@article {19691, title = {Discovering Pronoun Categories using Discourse Information}, journal = {Proceedings of the 35th Annual Conference of the Cognitive Science Society}, year = {Submitted}, abstract = {Abstract Interpretation of a pronoun is driven by properties of syntactic distribution. Consequently, acquiring the meaning and the distribution are intertwined. In order to learn that a pronoun is reflexive, learners need to know which entity the pronoun refers to in a ...}, url = {http://ling.umd.edu/~naho/orita_cogsci2013.pdf}, author = {McKeown, R and Feldman, N H and Lidz, J and Jordan Boyd-Graber} } @article {20252, title = {Deep-learning-assisted Volume Visualization}, journal = {IEEE Transactions on Visualization and Computer Graphics}, year = {2018}, month = {Jan-01-2018}, pages = {1 - 1}, issn = {1077-2626}, doi = {10.1109/TVCG.2018.2796085}, url = {http://ieeexplore.ieee.org/document/8265023/http://xplorestaging.ieee.org/ielx7/2945/4359476/08265023.pdf?arnumber=8265023}, author = {Cheng, Hsueh-Chien and Cardone, Antonio and Jain, Somay and Krokos, Eric and Narayan, Kedar and Subramaniam, Sriram and Varshney, Amitabh} } @article {20297, title = {Distinct consequences of amoxicillin and ertapenem exposure in the porcine gut microbiome}, journal = {Anaerobe}, volume = {53}, year = {2018}, month = {Jan-10-2018}, pages = {82 - 93}, issn = {10759964}, doi = {10.1016/j.anaerobe.2018.04.012}, url = {https://www.sciencedirect.com/science/article/pii/S1075996418300696?via\%3Dihub}, author = {Connelly, Sheila and Subramanian, Poorani and Hasan, Nur A. and Rita R Colwell and Kaleko, Michael} } @proceedings {20156, title = {Deep-learning-assisted visualization for live-cell images}, year = {2017}, month = {09/2017}, publisher = {IEEE}, address = {Beijing, China}, abstract = {Analyzing live-cell images is particularly challenging because cells move at the same time they undergo systematic changes. Visually inspecting live-cell images therefore involves simultaneously tracking individual cells and detecting relevant spatio-temporal changes. The high cognitive burden of such a complex task makes this kind of analysis inefficient and error-prone. In this paper we describe a deep-learning-assisted visualization based on automatically derived high-level features to identify target cell changes in live-cell images. Applying a novel user-mediated color assignment scheme that maps abstract features into corresponding colors, we create color-based visual annotations that facilitate visual reasoning and analysis of complex time varying live-cell imagery datasets. The visual representations can be used to study temporal changes in cells, such as the morphological changes in cell at various stages of life cycle.}, keywords = {deep learning, live-cell images, Visualization}, author = {Hsueh-Chien Cheng and Cardone, Antonio and Krokos, Eric and Stoica, Bogdan and Faden, Alan and Varshney, Amitabh} } @article {20348, title = {Deep-sea hydrothermal vent bacteria related to human pathogenic Vibrio species}, journal = {Proceedings of the National Academy of Sciences}, year = {2015}, month = {Feb-05-2017}, pages = {E2813 - E2819}, abstract = {Vibrio species are both ubiquitous and abundant in marine coastal waters, estuaries, ocean sediment, and aquaculture settings worldwide. We report here the isolation, characterization, and genome sequence of a novel Vibrio species, Vibrio antiquarius, isolated from a mesophilic bacterial community associated with hydrothermal vents located along the East Pacific Rise, near the southwest coast of Mexico. Genomic and phenotypic analysis revealed V. antiquarius is closely related to pathogenic Vibrio species, namely Vibrio alginolyticus, Vibrio parahaemolyticus, Vibrio harveyi, and Vibrio vulnificus, but sufficiently divergent to warrant a separate species status. The V. antiquarius genome encodes genes and operons with ecological functions relevant to the environment conditions of the deep sea and also harbors factors known to be involved in human disease caused by freshwater, coastal, and brackish water vibrios. The presence of virulence factors in this deep-sea Vibrio species suggests a far more fundamental role of these factors for their bacterial host. Comparative genomics revealed a variety of genomic events that may have provided an important driving force in V. antiquarius evolution, facilitating response to environmental conditions of the deep sea.}, issn = {0027-8424}, doi = {10.1073/pnas.1503928112}, url = {http://www.pnas.org/lookup/doi/10.1073/pnas.1503928112}, author = {Hasan, Nur A. and Grim, Christopher J. and Lipp, Erin K. and Rivera, Irma N. G. and Chun, Jongsik and Haley, Bradd J. and Taviani, Elisa and Choi, Seon Young and Hoq, Mozammel and Munk, A. Christine and Brettin, Thomas S. and Bruce, David and Challacombe, Jean F. and Detter, J. Chris and Han, Cliff S. and Eisen, Jonathan A. and Huq, Anwar and Rita R Colwell} } @article {19903, title = {Detection and characterization of nonspecific, sparsely populated binding modes in the early stages of complexation.}, journal = {J Comput Chem}, year = {2015}, month = {2015 Mar 18}, abstract = {

A method is proposed to study protein-ligand binding in a system governed by specific and nonspecific interactions. Strong associations lead to narrow distributions in the proteins configuration space; weak and ultraweak associations lead instead to broader distributions, a manifestation of nonspecific, sparsely populated binding modes with multiple interfaces. The method is based on the notion that a discrete set of preferential first-encounter modes are metastable states from which stable (prerelaxation) complexes at equilibrium evolve. The method can be used to explore alternative pathways of complexation with statistical significance and can be integrated into a general algorithm to study protein interaction networks. The method is applied to a peptide-protein complex. The peptide adopts several low-population conformers and binds in a variety of modes with a broad range of affinities. The system is thus well suited to analyze general features of binding, including conformational selection, multiplicity of binding modes, and nonspecific interactions, and to illustrate how the method can be applied to study these problems systematically. The equilibrium distributions can be used to generate biasing functions for simulations of multiprotein systems from which bulk thermodynamic quantities can be calculated. {\textcopyright} 2015 Wiley Periodicals, Inc.

}, issn = {1096-987X}, doi = {10.1002/jcc.23883}, author = {Cardone, Antonio and Bornstein, Aaron and Pant, Harish C and Brady, Mary and Sriram, Ram and Hassan, Sergio A} } @article {20350, title = {Diagnostic Approach for Monitoring Hydroclimatic Conditions Related to Emergence of West Nile Virus in West Virginia}, journal = {Frontiers in Public Health}, year = {2015}, month = {Dec-02-2015}, abstract = {West Nile virus (WNV), mosquito-borne and water-based disease, is increasingly a global threat to public health. Since its appearance in the northeastern United States in 1999, WNV has since been reported in several states in the continental United States. The objective of this study is to highlight role of hydroclimatic processes estimated through satellite sensors in capturing conditions for emergence of the vectors in historically disease free regions. We tested the hypothesis that an increase in surface temperature, in combination with intensification of vegetation, and enhanced precipitation, lead to conditions favorable for vector (mosquito) growth. Analysis of land surface temperature (LST) pattern shows that temperature values >16{\textdegree}C, with heavy precipitation, may lead to abundance of the mosquito population. This hypothesis was tested in West Virginia where a sudden epidemic of WNV infection was reported in 2012. Our results emphasize the value of hydroclimatic processes estimated by satellite remote sensing, as well as continued environmental surveillance of mosquitoes, because when a vector-borne infection like WNV is discovered in contiguous regions, the risk of spread of WNV mosquitoes increase at points where appropriate hydroclimatic processes intersect with the vector niche.}, doi = {10.3389/fpubh.2015.00010}, url = {http://journal.frontiersin.org/Article/10.3389/fpubh.2015.00010/abstract}, author = {Jutla, Antarpreet and Huq, Anwar and Rita R Colwell} } @article {20343, title = {Downscaling river discharge to assess the effects of climate change on cholera outbreaks in the Bengal Delta}, journal = {Climate Research}, volume = {64}, year = {2015}, month = {Jul-08-2017}, pages = {257 - 274}, abstract = {Endemic cholera in the Bengal Delta region of South Asia has been associated with asymmetric and episodic variability of river discharge. Spring cholera was found to be related to intrusion of bacteria-laden coastal seawater during low flow seasons. Autumn cholera was hypothesized to result from cross-contamination of water resources when high river discharge causes massive inland inundation. The effect of climate change on diarrheal diseases has not been explored, because of the difficulties in establishing linkages between coarse-resolution global climate model outputs with localized disease outbreaks. Since rivers act as corridors for transport of cholera bacteria, the first step is to understand the discharge variability that may occur with climate change and whether it is linked to cholera. Here, we present a framework for downscaling precipitation from global climate models for river discharge in the Ganges-Brahmaputra-Meghna basin. Using a data-mining method that includes particle swarm optimization-based support vector regression, precipitation was downscaled for a statistical multiple regressive model to estimate river discharge in the basin. Key results from an ensemble of HadCM3, GFDL, and ECHAM5 models indicated 8 and 7.5\% increase in flows for the IPCC A1B and A2 scenarios, respectively. The majority of the changes are attributable to increases in flows from February through August for both scenarios, with little to no change in seasonality of high and low flows during the next century. The probability of spring and autumn cholera is likely to increase steadily in the endemic region of the Bengal Delta. }, issn = {0936-577X}, doi = {10.3354/cr01310}, url = {http://www.int-res.com/abstracts/cr/v64/n3/p257-274/}, author = {Nasr-Azadani, F and Unnikrishnan, A and Akanda, A and Islam, S and Alam, M and Huq, A and Jutla, A and Rita R Colwell} } @article {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} } @article {20378, title = {Detection of Vibrio cholerae in environmental waters including drinking water reservoirs of Azerbaijan}, journal = {Environmental Microbiology Reports}, year = {2013}, month = {Jan-02-2013}, pages = {30 - 38}, doi = {10.1111/j.1758-2229.2012.00369.x }, url = {https://onlinelibrary.wiley.com/doi/10.1111/j.1758-2229.2012.00369.x}, author = {Rashid, Ahmadov and Haley, Bradd J. and Rajabov, Mukhtar and Ahmadova, Sevinj and Gurbanov, Shair and Rita R Colwell and Huq, Anwar} } @article {19160, title = {Dirichlet Mixtures, the Dirichlet Process, and the Structure of Protein Space}, journal = {Journal of Computational Biology}, volume = {20}, number = {1}, year = {2013}, abstract = {The Dirichlet process is used to model probability distributions that are mixtures of an unknown number of components. Amino acid frequencies at homologous positions within related proteins have been fruitfully modeled by Dirichlet mixtures, and we use the Dirichlet process to derive such mixtures with an unbounded number of components. This application of the method requires several technical innovations to sample an unbounded number of Dirichlet-mixture components. The resulting Dirichlet mixtures model multiple-alignment data substantially better than do previously derived ones. They consist of over 500 components, in contrast to fewer than 40 previously, and provide a novel perspective on the structure of proteins. Individual protein positions should be seen not as falling into one of several categories, but rather as arrayed near probability ridges winding through amino acid multinomial space.}, keywords = {ALIGNMENT, computational molecular biology, dynamic programming, multiple alignment, sequence analysis}, doi = {10.1089/cmb.2012.0244}, author = {Nguyen,Viet-An and Jordan Boyd-Graber and Altschul, Stephen F.} } @article {19657, title = {Distinct Rap1 Activity States Control the Extent of Epithelial Invagination via α-Catenin}, journal = {Developmental Cell}, volume = {25}, year = {2013}, month = {2013/05/13/}, pages = {299 - 309}, abstract = {Localized cell shape change initiates epithelial folding, while neighboring cell invagination determines the final depth of an epithelial fold. The mechanism that controls the extent of invagination remains unknown. During Drosophila gastrulation, a higher number of cells undergo invagination to form the deep posterior dorsal fold, whereas far fewer cells become incorporated into the initially very similar anterior dorsal fold. We find that a decrease in α-catenin activity causes the anterior fold to invaginate as extensively as the posterior fold. In contrast, constitutive activation of the small GTPase Rap1 restricts invagination of both dorsal folds in an α-catenin-dependent manner. Rap1 activity appears spatially modulated by Rapgap1, whose expression levels are high in the cells that flank the posterior fold but low in the anterior fold. We propose a model whereby distinct activity states of Rap1 modulate α-catenin-dependent coupling between junctions and actin to control the extent of epithelial invagination.}, isbn = {1534-5807}, url = {http://www.sciencedirect.com/science/article/pii/S1534580713001937}, author = {Wang, Yu-Chiun and Zia Khan and Wieschaus, Eric~F.} } @article {20370, title = {Distribution of Virulence Genes in Clinical and Environmental Vibrio cholerae Strains in Bangladesh}, journal = {Applied and Environmental Microbiology}, year = {2013}, month = {Mar-09-2014}, pages = {5782 - 5785}, abstract = {Vibrio cholerae, an environmental organism, is a facultative human pathogen. Here, we report the virulence profiles, comprising 18 genetic markers, of 102 clinical and 692 environmental V. cholerae strains isolated in Bangladesh between March 2004 and January 2006, showing the variability of virulence determinants within the context of public health. }, issn = {0099-2240}, doi = {10.1128/AEM.01113-13}, url = {http://aem.asm.org/lookup/doi/10.1128/AEM.01113-13}, author = {Hasan, Nur A. and Ceccarelli, Daniela and Grim, Christopher J. and Taviani, Elisa and Choi, Jinna and Sadique, Abdus and Alam, Munirul and Siddique, Abul K. and Sack, R. Bradley and Huq, Anwar and Rita R Colwell} } @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} } @article {20367, title = {Drug response and genetic properties of Vibrio cholerae associated with endemic cholera in north-eastern Thailand, 2003-2011}, journal = {Journal of Medical Microbiology}, year = {2013}, month = {Jan-04-2013}, pages = {599 - 609}, abstract = {Cholera, caused by Vibrio cholerae, results in significant morbidity and mortality worldwide, including Thailand. Representative V. cholerae strains associated with endemic cholera (n = 32), including strains (n = 3) from surface water sources, in Khon Kaen, Thailand (2003{\textendash}2011), were subjected to microbiological, molecular and phylogenetic analyses. According to phenotypic and related genetic data, all tested V. cholerae strains belonged to serogroup O1, biotype El Tor (ET), Inaba (IN) or Ogawa (OG). All of the strains were sensitive to gentamicin and ciprofloxacin, while multidrug-resistant (MDR) strains showing resistance to erythromycin, tetracycline, trimethoprim/sulfamethoxazole and ampicillin were predominant in 2007. V. cholerae strains isolated before and after 2007 were non-MDR. All except six diarrhoeal strains possessed ctxA and ctxB genes and were toxigenic altered ET, confirmed by MAMA-PCR and DNA sequencing. Year-wise data revealed that V. cholerae INET strains isolated between 2003 and 2004, plus one strain isolated in 2007, lacked the RS1 sequence (rstC) and toxin-linked cryptic plasmid (TLC)-specific genetic marker, but possessed CTXCL prophage genes ctxB CL and rstR CL. A sharp genetic transition was noted, namely the majority of V. cholerae strains in 2007 and all in 2010 and 2011 were not repressor genotype rstR CL but instead were rstR ET, and all ctx + strains possessed RS1 and TLC-specific genetic markers. DNA sequencing data revealed that strains isolated since 2007 had a mutation in the tcpA gene at amino acid position 64 (N{\textrightarrow}S). Four clonal types, mostly of environmental origin, including subtypes, reflected genetic diversity, while distinct signatures were observed for clonally related, altered ET from Thailand, Vietnam and Bangladesh, confirmed by distinct subclustering patterns observed in the PFGE (NotI)-based dendrogram, suggesting that endemic cholera is caused by V. cholerae indigenous to Khon Kaen.}, issn = {0022-2615}, doi = {10.1099/jmm.0.053801-0}, url = {http://jmm.microbiologyresearch.org/content/journal/jmm/10.1099/jmm.0.053801-0}, author = {Chomvarin, C. and Johura, F.-T. and Mannan, S. B. and Jumroenjit, W. and Kanoktippornchai, B. and Tangkanakul, W. and Tantisuwichwong, N. and Huttayananont, S. and Watanabe, H. and Hasan, N. A. and Huq, A. and Cravioto, A. and Rita R Colwell and Alam, M.} } @article {19128, title = {Deep Sequencing of the Oral Microbiome Reveals Signatures of Periodontal Disease}, journal = {PloS one}, volume = {7}, year = {2012}, month = {2012}, abstract = {The oral microbiome, the complex ecosystem of microbes inhabiting the human mouth, harbors several thousands of bacterial types. The proliferation of pathogenic bacteria within the mouth gives rise to periodontitis, an inflammatory disease known to also constitute a risk factor for cardiovascular disease. While much is known about individual species associated with pathogenesis, the system-level mechanisms underlying the transition from health to disease are still poorly understood. Through the sequencing of the 16S rRNA gene and of whole community DNA we provide a glimpse at the global genetic, metabolic, and ecological changes associated with periodontitis in 15 subgingival plaque samples, four from each of two periodontitis patients, and the remaining samples from three healthy individuals. We also demonstrate the power of whole-metagenome sequencing approaches in characterizing the genomes of key players in the oral microbiome, including an unculturable TM7 organism. We reveal the disease microbiome to be enriched in virulence factors, and adapted to a parasitic lifestyle that takes advantage of the disrupted host homeostasis. Furthermore, diseased samples share a common structure that was not found in completely healthy samples, suggesting that the disease state may occupy a narrow region within the space of possible configurations of the oral microbiome. Our pilot study demonstrates the power of high-throughput sequencing as a tool for understanding the role of the oral microbiome in periodontal disease. Despite a modest level of sequencing (~2 lanes Illumina 76 bp PE) and high human DNA contamination (up to ~90\%) we were able to partially reconstruct several oral microbes and to preliminarily characterize some systems-level differences between the healthy and diseased oral microbiomes.}, author = {Liu,B. and Faller, L.L. and Klitgord, N. and Mazumdar, V. and Ghodsi,M. and Sommer, D.D. and Gibbons, T.R. and Treangen, T.J. and Chang, Y.C. and Li,S.} } @article {13065, title = {Density-Based Multifeature Background Subtraction with Support Vector Machine}, journal = {Pattern Analysis and Machine Intelligence, IEEE Transactions on}, volume = {34}, year = {2012}, month = {2012/05//}, pages = {1017 - 1023}, abstract = {Background modeling and subtraction is a natural technique for object detection in videos captured by a static camera, and also a critical preprocessing step in various high-level computer vision applications. However, there have not been many studies concerning useful features and binary segmentation algorithms for this problem. We propose a pixelwise background modeling and subtraction technique using multiple features, where generative and discriminative techniques are combined for classification. In our algorithm, color, gradient, and Haar-like features are integrated to handle spatio-temporal variations for each pixel. A pixelwise generative background model is obtained for each feature efficiently and effectively by Kernel Density Approximation (KDA). Background subtraction is performed in a discriminative manner using a Support Vector Machine (SVM) over background likelihood vectors for a set of features. The proposed algorithm is robust to shadow, illumination changes, spatial variations of background. We compare the performance of the algorithm with other density-based methods using several different feature combinations and modeling techniques, both quantitatively and qualitatively.}, keywords = {algorithm;density-based, application;illumination, approximation;object, background, camera;support, change;kernel, Computer, density, detection;pixelwise, detection;support, extraction;image, feature;background, generative, Haar-like, likelihood, machine;Haar, machines;vectors;, modeling, multifeature, segmentation, segmentation;object, subtraction, technique;discriminative, technique;high-level, techniques;spatial, transforms;cameras;computer, variation;spatio-temporal, variation;static, vector, vector;binary, VISION, vision;feature}, isbn = {0162-8828}, doi = {10.1109/TPAMI.2011.243}, author = {Han,Bohyung and Davis, Larry S.} } @conference {19218, title = {The design and evaluation of prototype eco-feedback displays for fixture-level water usage data}, year = {2012}, month = {2012}, pages = {2367 - 2376}, publisher = {ACM}, organization = {ACM}, isbn = {145031015X}, author = {Jon Froehlich and Findlater,L. and Ostergren, M. and Ramanathan, S. and Peterson,J. and Wragg, I. and Larson,E. and Fu, F. and Bai, M. and Patel,S.} } @article {19253, title = {Design and Synthesis for Multimedia Systems Using the Targeted Dataflow Interchange Format}, journal = {IEEE Transactions on Multimedia}, volume = {14}, year = {2012}, month = {2012}, pages = {630 - 640}, abstract = {Development of multimedia systems that can be targeted to different platforms is challenging due to the need for rigorous integration between high-level abstract modeling, and low-level synthesis and optimization. In this paper, a new dataflow-based design tool called the targeted dataflow interchange format is introduced for retargetable design, analysis, and implementation of embedded software for multimedia systems. Our approach provides novel capabilities, based on principles of task-level dataflow analysis, for exploring and optimizing interactions across design components; object-oriented data structures for encapsulating contextual information for components; a novel model for representing parameterized schedules that are derived from repetitive graph structures; and automated code generation for programming interfaces and low-level customizations that are geared toward high-performance embedded-processing architectures. We demonstrate our design tool for cross-platform application design, parameterized schedule representation, and associated dataflow graph-code generation using a case study centered around an image registration application.}, keywords = {associated dataflow graph-code generation, Computational modeling, contextual information encapsulation, cross-platform application design, data flow graphs, Data models, Data structures, Dataflow graphs, design components, design tools, Digital signal processing, electronic data interchange, embedded signal processing, Embedded software, high-level abstract modeling, high-performance embedded-processing architectures, Image coding, image registration application, image representation, low-level customizations, low-level optimization, low-level synthesis, Multimedia communication, multimedia systems, multimedia systems development, object-oriented data structures, object-oriented methods, parameterized schedule representation, programming interfaces, repetitive graph structures, retargetable design, Schedules, scheduling, software synthesis, Streaming media, targeted dataflow interchange format, task-level dataflow analysis}, isbn = {1520-9210}, author = {Chung-Ching Shen and Wu, Shenpei and Sane, N. and Wu, Hsiang-Huang and Plishker,W. and Bhattacharyya, Shuvra S.} } @article {20376, title = {Detection, Isolation, and Identification of Vibrio cholerae from the Environment}, journal = {Current Protocols in Microbiology}, volume = {26}, year = {2012}, month = {08/2012}, publisher = {John Wiley \& Sons, Inc.}, chapter = {Unit 6A.5}, address = {Hoboken, NJ, USA}, abstract = {Recent molecular advances in microbiology have greatly improved the detection of bacterial pathogens in the environment. These improvements and a downward trend in the cost of molecular detection methods have contributed to increased frequency of detection of pathogenic microorganisms where traditional culture-based detection methods have failed. Culture methods also have been greatly improved, and the confluence of the two suites of methods provides a powerful tool for detection, isolation, and characterization of pathogens. While molecular detection provides data on the presence and type of pathogens, culturing methods allow a researcher to preserve the organism of interest for {\textquotedblleft}-omics{\textquotedblright} studies, such as genomic, metabolomic, secretomic, and transcriptomic analysis, which are rapidly becoming more affordable. This has yielded a clearer understanding of the ecology and epidemiology of microorganisms that cause disease. In this unit, we present commonly accepted methods for isolation, detection, and characterization of V. cholerae, providing more extensive knowledge of the ecology and epidemiology of this organism. This unit has been fully revised and updated from the earlier version with the latest knowledge and additional information not previously included. Curr. Protoc. Microbiol. 26:6A.5.1-6A.5.51. {\textcopyright} 2012 by John Wiley \& Sons, Inc. }, doi = {10.1002/9780471729259.mc06a05s26}, url = {http://doi.wiley.com/10.1002/9780471729259.mc06a05s26}, author = {Huq, Anwar and Haley, Bradd J. and Taviani, Elisa and Chen, Arlene and Hasan, Nur A. and Rita R Colwell}, editor = {Coico, Richard and Kowalik, Tim and Quarles, John and Stevenson, Brian and Taylor, Ron} } @inbook {18698, title = {Determining Protein Dynamics from 15N Relaxation Data by Using DYNAMICS}, booktitle = {Protein NMR Techniques}, series = {Methods in Molecular Biology}, volume = {831}, year = {2012}, month = {2012///}, pages = {485 - 511}, publisher = {Humana Press}, organization = {Humana Press}, abstract = {Motions are essential for protein function, and knowledge of protein dynamics is a key to our understanding the mechanisms underlying protein folding and stability, ligand recognition, allostery, and catalysis. In the last two decades, NMR relaxation measurements have become a powerful tool for characterizing backbone and side chain dynamics in complex biological macromolecules such as proteins and nucleic acids. Accurate analysis of the experimental data in terms of motional parameters is an essential prerequisite for developing physical models of motions to paint an adequate picture of protein dynamics. Here, I describe in detail how to use the software package DYNAMICS that was developed for accurate characterization of the overall tumbling and local dynamics in a protein from nuclear spin-relaxation rates measured by NMR. Step-by-step instructions are provided and illustrated through an analysis of 15 N relaxation data for protein G.}, keywords = {Biomedical and Life Sciences}, isbn = {978-1-61779-480-3}, url = {http://www.springerlink.com/content/q667p0k138058103/abstract/}, author = {Fushman, David}, editor = {Shekhtman,Alexander and Burz,David S. and Walker,John M.} } @article {12432, title = {Dictionary-based Face Recognition Under Variable Lighting and Pose}, journal = {IEEE Transactions on Information Forensics and Security}, volume = {PP}, year = {2012}, month = {2012/02/27/}, pages = {1 - 1}, abstract = {We present a face recognition algorithm based on simultaneous sparse approximations under varying illumination and pose. A dictionary is learned for each class based on given training examples which minimizes the representation error with a sparseness constraint. A novel test image is projected onto the span of the atoms in each learned dictionary. The resulting residual vectors are then used for classification. To handle variations in lighting conditions and pose, an image relighting technique based on pose-robust albedo estimation is used to generate multiple frontal images of the same person with variable lighting. As a result, the proposed algorithm has the ability to recognize human faces with high accuracy even when only a single or a very few images per person are provided for training. The efficiency of the proposed method is demonstrated using publicly available databases and it is shown that this method is efficient and can perform significantly better than many competitive face recognition algorithms.}, keywords = {Biometrics, dictionary learning, face recognition, illumination variation,, outlier rejection}, isbn = {1556-6013}, doi = {10.1109/TIFS.2012.2189205}, author = {Patel, Vishal M. and Wu,T. and Biswas,S. and Phillips,P. and Chellapa, Rama} } @article {19655, title = {Differential positioning of adherens junctions is associated with initiation of epithelial folding}, journal = {Nature}, volume = {484}, year = {2012}, month = {2012/04/19/}, pages = {390 - 393}, abstract = {During tissue morphogenesis, simple epithelial sheets undergo folding to form complex structures. The prevailing model underlying epithelial folding involves cell shape changes driven by myosin-dependent apical constriction. Here we describe an alternative mechanism that requires differential positioning of adherens junctions controlled by modulation of epithelial apical{\textendash}basal polarity. Using live embryo imaging, we show that before the initiation of dorsal transverse folds during Drosophila gastrulation, adherens junctions shift basally in the initiating cells, but maintain their original subapical positioning in the neighbouring cells. Junctional positioning in the dorsal epithelium depends on the polarity proteins Bazooka and Par-1. In particular, the basal shift that occurs in the initiating cells is associated with a progressive decrease in Par-1 levels. We show that uniform reduction of the activity of Bazooka or Par-1 results in uniform apical or lateral positioning of junctions and in each case dorsal fold initiation is abolished. In addition, an increase in the Bazooka/Par-1 ratio causes formation of ectopic dorsal folds. The basal shift of junctions not only alters the apical shape of the initiating cells, but also forces the lateral membrane of the adjacent cells to bend towards the initiating cells, thereby facilitating tissue deformation. Our data thus establish a direct link between modification of epithelial polarity and initiation of epithelial folding.}, keywords = {cell biology, developmental biology}, isbn = {0028-0836}, url = {http://www.nature.com/nature/journal/v484/n7394/abs/nature10938.html}, author = {Wang, Yu-Chiun and Zia Khan and Kaschube, Matthias and Wieschaus, Eric F.} } @article {13288, title = {Dimension-independent multi-resolution morse complexes}, journal = {Computers \& Graphics}, year = {2012}, month = {2012///}, author = {De Floriani, Leila and {\v C}omi{\'c},L.} } @article {14328, title = {Disaggregated water sensing from a single, pressure-based sensor: An extended analysis of HydroSense using staged experiments}, journal = {Pervasive and Mobile Computing}, volume = {8}, year = {2012}, month = {2012/02//}, pages = {82 - 102}, abstract = {We present an extended analysis of our previous work on the HydroSense technology, which is a low-cost and easily installed single-point sensor of pressure for automatically disaggregating water usage activities in the home (Froehlich et~al., 2009~[53]). We expand upon this work by providing a survey of existing and emerging water disaggregation techniques, a more comprehensive description of the theory of operation behind our approach, and an expanded analysis section that includes hot versus cold water valve usage classification and a comparison between two classification approaches: the template-based matching scheme used in Froehlich et~al. (2009)~[53] and a new stochastic approach using a Hidden Markov Model. We show that both are successful in identifying valve- and fixture-level water events with greater than 90\% accuracies. We conclude with a discussion of the limitations in our experimental methodology and open problems going forward.}, keywords = {Activity sensing, H1.2, H5.2, Infrastructure-mediated sensing, Sensors, Water usage}, isbn = {1574-1192}, doi = {10.1016/j.pmcj.2010.08.008}, url = {http://www.sciencedirect.com/science/article/pii/S1574119210000842}, author = {Larson,Eric and Jon Froehlich and Campbell,Tim and Haggerty,Conor and Atlas,Les and Fogarty,James and Patel,Shwetak N.} } @article {19658, title = {Drosophila Src regulates anisotropic apical surface growth to control epithelial tube size}, journal = {Nature Cell Biology}, volume = {14}, year = {2012}, month = {2012/05//}, pages = {518 - 525}, abstract = {Networks of epithelial and endothelial tubes are essential for the function of organs such as the lung, kidney and vascular system. The sizes and shapes of these tubes are highly regulated to match their individual functions. Defects in tube size can cause debilitating diseases such as polycystic kidney disease and ischaemia. It is therefore critical to understand how tube dimensions are regulated. Here we identify the tyrosine kinase Src as an instructive regulator of epithelial-tube length in the Drosophila tracheal system. Loss-of-function Src42 mutations shorten tracheal tubes, whereas Src42 overexpression elongates them. Surprisingly, Src42 acts distinctly from known tube-size pathways and regulates both the amount of apical surface growth and, with the conserved formin dDaam, the direction of growth. Quantitative three-dimensional image analysis reveals that Src42- and dDaam-mutant tracheal cells expand more in the circumferential than the axial dimension, resulting in tubes that are shorter in length{\textemdash}but larger in diameter{\textemdash}than wild-type tubes. Thus, Src42 and dDaam control tube dimensions by regulating the direction of anisotropic growth, a mechanism that has not previously been described.}, isbn = {1465-7392}, url = {http://www.nature.com/ncb/journal/v14/n5/abs/ncb2467.html}, author = {Nelson, Kevin S. and Zia Khan and Moln{\'a}r, Imre and Mih{\'a}ly, J{\'o}zsef and Kaschube, Matthias and Beitel, Greg J.} } @conference {19231, title = {Duking it out at the smartphone mobile app mapping API corral: Apple, Google, and the competition}, booktitle = {1st ACM SIGSPATIAL International Workshop on Mobile Geographic Information Systems (MobiGIS 2012)}, year = {2012}, month = {11/2012}, address = {Redondo Beach, California}, abstract = {The recent introduction of the Apple iPhone 5 and the accompanying iOS6 software environment which, among other changes, replaced the use of the Google Maps API in iOS5 by Apple{\textquoteright}s own Maps API, has led to significant changes in the user experience with apps that make use of maps and has resulted in closer scrutiny of mapping applications on mobile devices. Many of these changes in the user experience deal with the quality of the data that is being produced and presented to the user, and has led to a wide ranging discussion of data quality and the seeming lack of quality assurance policies and protocols by Apple. These are widely documented in web postings. However, equally important are significant changes in the manner in which the data is presented to the user, but, surprisingly, not much attention has been paid to this aspect of the user experience which is somewhat analogous to the concept of the {\textquotedblleft}last mile{\textquotedblright} when discussing the bandwidth of communications networks and its associated costs. The changes in the presentation and in the amount of data that are presented to the user on the Apple mapping platform, with an emphasis on mobile devices with a small form factor such as smartphones, are tabulated and compared along with other mapping platforms such as the iOS apps of ESRI, MapQuest, and OpenSeaMap (using the open source map data of OpenStreetMap), as well as Bing Maps and Nokia Maps for which no iOS app exists and thus the corresponding mobile web versions are used. }, author = {Samet, Hanan and Fruin, B.C and Nutanong,S.} } @conference {14906, title = {Dynamic changes in motivation in collaborative citizen-science projects}, booktitle = {Proceedings of the ACM 2012 conference on Computer Supported Cooperative Work}, series = {CSCW {\textquoteright}12}, year = {2012}, month = {2012///}, pages = {217 - 226}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Online citizen science projects engage volunteers in collecting, analyzing, and curating scientific data. Existing projects have demonstrated the value of using volunteers to collect data, but few projects have reached the full collaborative potential of scientists and volunteers. Understanding the shared and unique motivations of these two groups can help designers establish the technical and social infrastructures needed to promote effective partnerships. We present findings from a study of the motivational factors affecting participation in ecological citizen science projects. We show that volunteers are motivated by a complex framework of factors that dynamically change throughout their cycle of work on scientific projects; this motivational framework is strongly affected by personal interests as well as external factors such as attribution and acknowledgment. Identifying the pivotal points of motivational shift and addressing them in the design of citizen-science systems will facilitate improved collaboration between scientists and volunteers.}, keywords = {citizen science, Collaboration, crowdsourcing, ecology, motivation, scientists, volunteers}, isbn = {978-1-4503-1086-4}, doi = {10.1145/2145204.2145238}, url = {http://doi.acm.org/10.1145/2145204.2145238}, author = {Rotman,Dana and Preece,Jenny and Hammock,Jen and Procita,Kezee and Hansen,Derek and Parr,Cynthia and Lewis,Darcy and Jacobs, David W.} } @conference {19599, title = {Dynamic Searchable Symmetric Encryption}, booktitle = {CCS {\textquoteright}12 Proceedings of the 2012 ACM Conference on Computer and Communications Security }, series = {CCS {\textquoteright}12}, year = {2012}, month = {2012///}, pages = {965 - 976}, publisher = {ACM}, organization = {ACM}, abstract = {Searchable symmetric encryption (SSE) allows a client to encrypt its data in such a way that this data can still be searched. The most immediate application of SSE is to cloud storage, where it enables a client to securely outsource its data to an untrusted cloud provider without sacrificing the ability to search over it. SSE has been the focus of active research and a multitude of schemes that achieve various levels of security and efficiency have been proposed. Any practical SSE scheme, however, should (at a minimum) satisfy the following properties: sublinear search time, security against adaptive chosen-keyword attacks, compact indexes and the ability to add and delete files efficiently. Unfortunately, none of the previously-known SSE constructions achieve all these properties at the same time. This severely limits the practical value of SSE and decreases its chance of deployment in real-world cloud storage systems. To address this, we propose the first SSE scheme to satisfy all the properties outlined above. Our construction extends the inverted index approach (Curtmola et al., CCS 2006) in several non-trivial ways and introduces new techniques for the design of SSE. In addition, we implement our scheme and conduct a performance evaluation, showing that our approach is highly efficient and ready for deployment.}, keywords = {Cloud computing, cloud storage, searchable symmetric encryption}, isbn = {978-1-4503-1651-4}, url = {http://doi.acm.org/10.1145/2382196.2382298}, author = {Kamara, Seny and Charalampos Papamanthou and Roeder, Tom} } @article {19266, title = {Dataflow-based Design and Implementation of Image Processing Applications}, year = {2011}, month = {2011}, abstract = {Dataflow is a well known computational model and is widely used forexpressing the functionality of digital signal processing (DSP) applications, such as audio and video data stream processing, digital communications, and image processing. These applications usually require real-time processing capabilities and have critical performance constraints. Dataflow provides a formal mechanism for describing specifications of DSP applications, imposes minimal data-dependency constraints in specifications, and is effective in exposing and exploiting task or data level parallelism for achieving high performance implementations. To demonstrate dataflow-based design methods in a manner that is concrete and easily adapted to different platforms and back-end design tools, we present in this report a number of case studies based on the lightweight dataflow (LWDF) programming methodology. LWDF is designed as a "minimalistic" approach for integrating coarse grain dataflow programming structures into arbitrary simulation- or platform-oriented languages, such as C, C++, CUDA, MATLAB, SystemC, Verilog, and VHDL. In particular, LWDF requires minimal dependence on specialized tools or libraries. This feature --- together with the rigorous adherence to dataflow principles throughout the LWDF design framework --- allows designers to integrate and experiment with dataflow modeling approaches relatively quickly and flexibly into existing design methodologies and processes. }, keywords = {Technical Report}, isbn = {UMIACS-TR-2011-11}, doi = {Technical Report}, url = {http://drum.lib.umd.edu//handle/1903/11403}, author = {Chung-Ching Shen and Plishker,William and Bhattacharyya, Shuvra S.} } @article {19273, title = {Dataflow-Based Implementation of Layered Sensing Applications}, year = {2011}, month = {2011}, abstract = {This report describes a new dataflow-based technology and associated design tools for high-productivity design, analysis, and optimization of layered sensing software for signal processing systems. Our approach provides novel capabilities, based on the principles of task-level dataflow analysis, for exploring and optimizing interactions across application behavior; operational context; high performance embedded processing platforms, and implementation constraints. Particularly, we introduce and deliver novel software tools, called the targeted dataflow interchange format (TDIF) and Dataflow Interchange Format Markup Language (DIFML), for design and implementation of layered sensing and signal processing systems. The TDIF-CUDA (Compute Unified Device Architecture) environment is a graphics processing unit targeted software synthesis tool that provides a unique integration of dynamic dataflow modeling; retargetable actor construction; software synthesis; and instrumentation-based schedule evaluation and tuning. The DIFML package is a software package for the DIFML format, which is an Extensible Markup Language (XML)-based format for exchanging information between DIF and other tools.}, keywords = {*COMPUTER AIDED DESIGN, *DATA FUSION, *DATAFLOW, *LAYERS, *SOFTWARE TOOLS, COMPUTER PROGRAMMING AND SOFTWARE, DETECTION, High performance computing, LAYERED SENSING, OPTIMIZATION, Signal processing, synthesis, T2KA}, author = {Bhattacharyya, Shuvra S. and Chung-Ching Shen and Plishker,William and Sane, Nimish and Wu, Hsiang-Huang and Gu, Ruirui} } @conference {17861, title = {Decentralized, accurate, and low-cost network bandwidth prediction}, booktitle = {2011 Proceedings IEEE INFOCOM}, year = {2011}, month = {2011/04/10/15}, pages = {6 - 10}, publisher = {IEEE}, organization = {IEEE}, abstract = {The distributed nature of modern computing makes end-to-end prediction of network bandwidth increasingly important. Our work is inspired by prior work that treats the Internet and bandwidth as an approximate tree metric space. This paper presents a decentralized, accurate, and low cost system that predicts pairwise bandwidth between hosts. We describe an algorithm to construct a distributed tree that embeds bandwidth measurements. The correctness of the algorithm is provable when driven by precise measurements. We then describe three novel heuristics that achieve high accuracy for predicting bandwidth even with imprecise input data. Simulation experiments with a real-world dataset confirm that our approach shows high accuracy with low cost.}, keywords = {accuracy, approximate tree metric space, Bandwidth, bandwidth allocation, bandwidth measurement, decentralized low cost system, distributed tree, end-to-end prediction, Extraterrestrial measurements, Internet, low-cost network bandwidth prediction, Measurement uncertainty, pairwise bandwidth, Peer to peer computing, Prediction algorithms, trees (mathematics)}, isbn = {978-1-4244-9919-9}, doi = {10.1109/INFCOM.2011.5935251}, author = {Sukhyun Song and Keleher,P. and Bhattacharjee, Bobby and Sussman, Alan} } @book {15188, title = {Decision and Game Theory for Security: Second International Conference, GameSec 2011, College Park, MD, Maryland, USA, November 14-15, 2011, Proceedings}, year = {2011}, month = {2011/12/27/}, publisher = {Springer}, organization = {Springer}, abstract = {This book constitutes the refereed proceedings of the Second International Conference on Decision and Game Theory for Security, GameSec 2011, held in College Park, Maryland, USA, in November 2011. The 16 revised full papers and 2 plenary keynotes presented were carefully reviewed and selected from numerous submissions. The papers are organized in topical sections on attacks, adversaries, and game theory, wireless adhoc and sensor networks, network games, security insurance, security and trust in social networks and security investments.}, keywords = {Business \& Economics / Information Management, Computers / Hardware / Network Hardware, Computers / Information Technology, Computers / Programming / Algorithms, Computers / Security / General, Mathematics / Applied, Mathematics / Game Theory, Mathematics / General}, isbn = {9783642252792}, author = {Baras,John S and Katz, Jonathan and Altman,Eitan} } @conference {13362, title = {Declarative analysis of noisy information networks}, booktitle = {2011 IEEE 27th International Conference on Data Engineering Workshops (ICDEW)}, year = {2011}, month = {2011/04/11/16}, pages = {106 - 111}, publisher = {IEEE}, organization = {IEEE}, abstract = {There is a growing interest in methods for analyzing data describing networks of all types, including information, biological, physical, and social networks. Typically the data describing these networks is observational, and thus noisy and incomplete; it is often at the wrong level of fidelity and abstraction for meaningful data analysis. This has resulted in a growing body of work on extracting, cleaning, and annotating network data. Unfortunately, much of this work is ad hoc and domain-specific. In this paper, we present the architecture of a data management system that enables efficient, declarative analysis of large-scale information networks. We identify a set of primitives to support the extraction and inference of a network from observational data, and describe a framework that enables a network analyst to easily implement and combine new extraction and analysis techniques, and efficiently apply them to large observation networks. The key insight behind our approach is to decouple, to the extent possible, (a) the operations that require traversing the graph structure (typically the computationally expensive step), from (b) the operations that do the modification and update of the extracted network. We present an analysis language based on Datalog, and show how to use it to cleanly achieve such decoupling. We briefly describe our prototype system that supports these abstractions. We include a preliminary performance evaluation of the system and show that our approach scales well and can efficiently handle a wide spectrum of data cleaning operations on network data.}, keywords = {Cleaning, Data analysis, data cleaning operations, data management system, data mining, Databases, Datalog, declarative analysis, graph structure, information networks, Noise measurement, noisy information networks, Prediction algorithms, semantics, Syntactics}, isbn = {978-1-4244-9195-7}, doi = {10.1109/ICDEW.2011.5767619}, author = {Moustafa,W. E and Namata,G. and Deshpande, Amol and Getoor, Lise} } @conference {13257, title = {A Decomposition-based Approach to Modeling and Understanding Arbitrary Shapes}, booktitle = {Eurographics Italian Chapter Conference 2011}, year = {2011}, month = {2011///}, pages = {53 - 60}, author = {Canino,D. and De Floriani, Leila} } @conference {14832, title = {A deformation and lighting insensitive metric for face recognition based on dense correspondences}, booktitle = {Computer Vision and Pattern Recognition (CVPR), 2011 IEEE Conference on}, year = {2011}, month = {2011/06//}, pages = {2353 - 2360}, abstract = {Face recognition is a challenging problem, complicated by variations in pose, expression, lighting, and the passage of time. Significant work has been done to solve each of these problems separately. We consider the problems of lighting and expression variation together, proposing a method that accounts for both variabilities within a single model. We present a novel deformation and lighting insensitive metric to compare images, and we present a novel framework to optimize over this metric to calculate dense correspondences between images. Typical correspondence cost patterns are learned between face image pairs and a Nai $\#$x0308;ve Bayes classifier is applied to improve recognition accuracy. Very promising results are presented on the AR Face Database, and we note that our method can be extended to a broad set of applications.}, keywords = {$\#$x0308;ve, Bayes, classifier;pose, comparison;lighting, correspondences;expression, deformation;dense, estimation;, insensitive, methods;face, metric;nai, recognition;image, recognition;pose, variation;Bayes, variation;face}, doi = {10.1109/CVPR.2011.5995431}, author = {Jorstad,A. and Jacobs, David W. and Trouve,A.} } @article {18827, title = {Design and fabrication of miniature compliant hinges for multi-material compliant mechanisms}, journal = {The International Journal of Advanced Manufacturing Technology}, volume = {57}, year = {2011}, month = {2011///}, pages = {437 - 452}, abstract = {Multi-material molding (MMM) enables the creation of multi-material mechanisms that combine compliant hinges, serving as revolute joints, and rigid links in a single part. There are three important challenges in creating these structures: (1) bonding between the materials used, (2) the ability of the hinge to transfer the required loads in the mechanism while allowing for the prescribed degree(s) of freedom, and (3) incorporating the process-specific requirements in the design stage. This paper presents the approach for design and fabrication of miniature compliant hinges in multi-material compliant mechanisms. The methodology described in this paper allows for the concurrent design of the part and the manufacturing process. For the first challenge, mechanical interlocking strategies are presented. For the second challenge, the development of a simulation-based optimization model of the hinge is presented, involving functional and manufacturing constrains. For the third challenge, the development of hinge positioning features and gate positioning constraints is presented. The developed MMM process is described, along with the main constraints and performance measures. This includes the process sequence, the mold cavity design, gate selection, and runner system development. A case study is presented to demonstrate the feasibility of creating multi-material mechanisms with miniature hinges serving as joints through MMM process. The approach described in this paper was utilized to design a drive mechanism for a flapping wing micro air vehicle. The methods described in this paper are applicable to any lightweight, load-bearing compliant mechanism manufactured using multi-material injection molding.}, keywords = {engineering}, isbn = {0268-3768}, doi = {10.1007/s00170-011-3301-y}, url = {http://www.springerlink.com/content/ul641k1v50360607/abstract/}, author = {Bejgerowski,Wojciech and Gerdes,John and Gupta, Satyandra K. and Bruck,Hugh} } @conference {19260, title = {Design methods for Wireless Sensor Network Building Energy Monitoring Systems}, booktitle = {2011 IEEE 36th Conference on Local Computer Networks (LCN)}, year = {2011}, month = {2011}, pages = {974 - 981}, abstract = {In this paper, we present a new energy analysis method for evaluating energy consumption of embedded sensor nodes at the application level and the network level. Then we apply the proposed energy analysis method to develop new energy management schemes in order to maximize lifetime for Wireless Sensor Network Building Energy Monitoring Systems (WSNBEMS). At the application level, we develop a new design approach that uses dataflow techniques to model the application-level interfacing behavior between the processor and sensors on an embedded sensor node. At the network level, we analyze the energy consumption of the IEEE 802.15.4 MAC functionality. Based on our techniques for modeling and energy analysis, we have implemented an optimized WSNBEMS for a real building, and validated our energy analysis techniques through measurements on this implementation. The performance of our implementation is also evaluated in terms of monitoring accuracy and energy consumption savings. We have demonstrated that by applying the proposed scheme, system lifetime can be improved significantly without affecting monitoring accuracy.}, keywords = {Analytical models, application-level interfacing behavior, building energy monitoring system, Buildings, dataflow technique, embedded sensor node, energy analysis method, Energy consumption, energy management systems, Energy resolution, IEEE 802.15.4 MAC functionality, Monitoring, OPTIMIZATION, wireless sensor network, Wireless sensor networks, WSNBEMS, Zigbee}, author = {Cho, Inkeun and Chung-Ching Shen and Potbhare, S. and Bhattacharyya, Shuvra S. and Goldsman,N.} } @article {18786, title = {Design of Revolute Joints for In-Mold Assembly Using Insert Molding}, journal = {Journal of Mechanical Design}, volume = {133}, year = {2011}, month = {2011///}, pages = {121010 - 121010}, author = {Ananthanarayanan,A. and Ehrlich,L. and Desai,J. P. and Gupta,S.K.} } @conference {19263, title = {A design tool for efficient mapping of multimedia applications onto heterogeneous platforms}, booktitle = {2011 IEEE International Conference on Multimedia and Expo (ICME)}, year = {2011}, month = {2011}, pages = {1 - 6}, abstract = {Development of multimedia systems on heterogeneous platforms is a challenging task with existing design tools due to a lack of rigorous integration between high level abstract modeling, and low level synthesis and analysis. In this paper, we present a new dataflow-based design tool, called the targeted dataflow interchange format (TDIF), for design, analysis, and implementation of embedded software for multimedia systems. Our approach provides novel capabilities, based on the principles of task-level dataflow analysis, for exploring and optimizing interactions across application behavior; operational context; heterogeneous platforms, including high performance embedded processing architectures; and implementation constraints.}, keywords = {Dataflow graphs, design tools, embedded signal processing, software synthesis}, author = {Chung-Ching Shen and Wu, Hsiang-Huang and Sane, N. and Plishker,W. and Bhattacharyya, Shuvra S.} } @article {15741, title = {Designing Optimal Spectral Filters for Inverse Problems}, journal = {SIAM Journal on Scientific Computing}, volume = {33}, year = {2011}, month = {2011///}, doi = {DOI: 10.1137/100809787}, author = {Chung,Julianne M. and Chung,Matthias and O{\textquoteright}Leary, Dianne P.} } @conference {13535, title = {Detecting Structural Irregularity in Electronic Dictionaries Using Language Modeling}, booktitle = {Electronic lexicography in the 21st century: new applications for new users (eLEX2011)}, year = {2011}, month = {2011///}, pages = {227 - 232}, abstract = {Dictionaries are often developed using Extensible Markup Language (XML)-based standards. Very often, these standards allow many high-level repeating elements to represent lexical entries, and utilize descendants of these repeating elements to represent the structure within each lexical entry, in the form of an XML tree. In many cases, dictionaries are published that have errors and inconsistencies that would be too expensive to find manually. This paper discusses a method for dictionary writers to audit structural regularity across entries in a dictionary, quickly, by using statistical language modelling. The approach learns the patterns of XML nodes that could occur within an XML tree, and then calculates the probability of each XML tree in the dictionary against these patterns to look for entries that diverge from the norm.}, author = {Rodrigues,Paul and Zajic, David and Bloodgood,Michael and Ye,Peng and David Doermann} } @article {15470, title = {Developing a Single Model and Test Prioritization Strategies for Event-Driven Software}, journal = {Software Engineering, IEEE Transactions on}, volume = {37}, year = {2011}, month = {2011///}, pages = {48 - 64}, abstract = {Event-Driven Software (EDS) can change state based on incoming events; common examples are GUI and Web applications. These EDSs pose a challenge to testing because there are a large number of possible event sequences that users can invoke through a user interface. While valuable contributions have been made for testing these two subclasses of EDS, such efforts have been disjoint. This work provides the first single model that is generic enough to study GUI and Web applications together. In this paper, we use the model to define generic prioritization criteria that are applicable to both GUI and Web applications. Our ultimate goal is to evolve the model and use it to develop a unified theory of how all EDS should be tested. An empirical study reveals that the GUI and Web-based applications, when recast using the new model, show similar behavior. For example, a criterion that gives priority to all pairs of event interactions did well for GUI and Web applications; another criterion that gives priority to the smallest number of parameter value settings did poorly for both. These results reinforce our belief that these two subclasses of applications should be modeled and studied together.}, keywords = {EDS, event-driven software, graphical user interface, Graphical user interfaces, GUI testing, Internet, program testing, service-oriented architecture, test prioritization strategy, Web application testing}, isbn = {0098-5589}, doi = {10.1109/TSE.2010.12}, author = {Bryce,R.C. and Sampath,S. and Memon, Atif M.} } @conference {14393, title = {Differential adaptive diffusion: Understanding diversity and learning whom to trust in viral marketing}, booktitle = {Fifth International AAAI Conference on Weblogs and Social Media}, year = {2011}, month = {2011///}, abstract = {Viral marketing mechanisms use the existing social network between customers to spread information about products and encourage product adoption. Existing viral marketing models focus on the dynamics of the diffusion process, however they typically: (a) only consider a single product campaign and (b) fail to model the evolution of the social network, as the trust between individuals changes over time, during the course of multiple campaigns. In this work, we propose an adaptive vi- ral marketing model which captures: (1) multiple different product campaigns, (2) the diversity in customer preferences among different product categories, and (3) changing con- fidence in peers{\textquoteright} recommendations over time. By applying our model to a real-world network extracted from the Digg social news website, we provide insights into the effects of network dynamics on the different products{\textquoteright} adoption. Our experiments show that our proposed model outperforms ear- lier non-adaptive diffusion models in predicting future prod- uct adoptions. We also show how this model can be used to explore new viral marketing strategies that are more success- ful than classic strategies which ignore the dynamic nature of social networks.}, author = {Sharara,H. and Rand, William and Getoor, Lise} } @article {13289, title = {Dimension-independent simplification and refinement of Morse complexes}, journal = {Graphical Models}, volume = {73}, year = {2011}, month = {2011/09//}, pages = {261 - 285}, abstract = {Ascending and descending Morse complexes, determined by a scalar field f defined over a manifold M, induce a subdivision of M into regions associated with critical points of f, and compactly represent the topology of M. We define two simplification operators on Morse complexes, which work in arbitrary dimensions, and we define their inverse refinement operators. We describe how simplification and refinement operators affect Morse complexes on M, and we show that these operators form a complete set of atomic operators to create and update Morse complexes on M. Thus, any operator that modifies Morse complexes on M can be expressed as a suitable sequence of the atomic simplification and refinement operators we have defined. The simplification and refinement operators also provide a suitable basis for the construction of a multi-resolution representation of Morse complexes.}, keywords = {Morse complexes, Morse theory, Refinement, shape modeling, simplification, Topological representations}, isbn = {1524-0703}, doi = {10.1016/j.gmod.2011.05.001}, url = {http://www.sciencedirect.com/science/article/pii/S1524070311000154}, author = {{\v C}omi{\'c},Lidija and De Floriani, Leila} } @article {19656, title = {Direct targeting of Sec23a by miR-200s influences cancer cell secretome and promotes metastatic colonization}, journal = {Nature Medicine}, volume = {17}, year = {2011}, month = {2011/09//}, pages = {1101 - 1108}, abstract = {Although the role of miR-200s in regulating E-cadherin expression and epithelial-to-mesenchymal transition is well established, their influence on metastatic colonization remains controversial. Here we have used clinical and experimental models of breast cancer metastasis to discover a pro-metastatic role of miR-200s that goes beyond their regulation of E-cadherin and epithelial phenotype. Overexpression of miR-200s is associated with increased risk of metastasis in breast cancer and promotes metastatic colonization in mouse models, phenotypes that cannot be recapitulated by E-cadherin expression alone. Genomic and proteomic analyses revealed global shifts in gene expression upon miR-200 overexpression toward that of highly metastatic cells. miR-200s promote metastatic colonization partly through direct targeting of Sec23a, which mediates secretion of metastasis-suppressive proteins, including Igfbp4 and Tinagl1, as validated by functional and clinical correlation studies. Overall, these findings suggest a pleiotropic role of miR-200s in promoting metastatic colonization by influencing E-cadherin{\textendash}dependent epithelial traits and Sec23a-mediated tumor cell secretome.View full text }, isbn = {1078-8956}, url = {http://www.nature.com/nm/journal/v17/n9/abs/nm.2401.html}, author = {Korpal, Manav and Ell, Brian J. and Buffa, Francesca M. and Ibrahim, Toni and Blanco, Mario A. and Celi{\`a}-Terrassa, Toni and Mercatali, Laura and Zia Khan and Goodarzi, Hani and Hua, Yuling and Wei, Yong and Hu, Guohong and Garcia, Benjamin A. and Ragoussis, Jiannis and Amadori, Dino and Harris, Adrian L. and Kang, Yibin} } @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} } @article {14317, title = {Disaggregated End-Use Energy Sensing for the Smart Grid}, journal = {IEEE Pervasive Computing}, volume = {10}, year = {2011}, month = {2011/03//Jan}, pages = {28 - 39}, abstract = {This article surveys existing and emerging disaggregation techniques for energy-consumption data and highlights signal features that might be used to sense disaggregated data in an easily installed and cost-effective manner.}, keywords = {Calibration, disaggregated end-use energy sensing, Disaggregated energy sensing, disaggregation data techniques, Electricity, Energy consumption, Energy efficiency, energy-consumption data, Gas, Home appliances, Sensors, Smart grid, Smart grids, smart power grids, Sustainability, Water}, isbn = {1536-1268}, doi = {10.1109/MPRV.2010.74}, author = {Jon Froehlich and Larson,E. and Gupta,S. and Cohn,G. and Reynolds,M. and Patel,S.} } @article {13290, title = {Discrete Curvature Estimators: an Experimental Evaluation}, volume = {DISI-TR-11-12}, year = {2011}, month = {2011///}, institution = {Department of Computer Science and Information Science, University of Genoa}, abstract = {In this paper, we consider a surface, embedded in 3D space, which is discretely approximatedas triangle mesh. We define a method for estimating mean and Gaussian curvatures of such a discrete surface, based on simulating the analytic definition of mean and Gaussian curvatures in the continuum. Such method leads to what we call mean and Gaussian Ccurvatures. We present experiments evaluating such curvatures. }, author = {Mesmoudi,M. M. and De Floriani, Leila and Magillo,P.} } @inbook {12455, title = {Distributed Sensing and Processing for Multi-Camera Networks}, booktitle = {Distributed Video Sensor NetworksDistributed Video Sensor Networks}, year = {2011}, month = {2011///}, pages = {85 - 101}, publisher = {Springer London}, organization = {Springer London}, abstract = {Sensor networks with large numbers of cameras are becoming increasingly prevalent in a wide range of applications, including video conferencing, motion capture, surveillance, and clinical diagnostics. In this chapter, we identify some of the fundamental challenges in designing such systems: robust statistical inference, computationally efficiency, and opportunistic and parsimonious sensing. We show that the geometric constraints induced by the imaging process are extremely useful for identifying and designing optimal estimators for object detection and tracking tasks. We also derive pipelined and parallelized implementations of popular tools used for statistical inference in non-linear systems, of which multi-camera systems are examples. Finally, we highlight the use of the emerging theory of compressive sensing in reducing the amount of data sensed and communicated by a camera network.}, isbn = {978-0-85729-127-1}, url = {http://dx.doi.org/10.1007/978-0-85729-127-1_6}, author = {Sankaranarayanan,Aswin C. and Chellapa, Rama and Baraniuk,Richard G.}, editor = {Bhanu,Bir and Ravishankar,Chinya V. and Roy-Chowdhury,Amit K. and Aghajan,Hamid and Terzopoulos,Demetri} } @conference {19441, title = {A Dive into Online Community Properties}, booktitle = {CSCW {\textquoteright}11}, series = {CSCW {\textquoteright}11}, year = {2011}, month = {2011///}, pages = {725 - 728}, publisher = {ACM}, organization = {ACM}, abstract = {As digital communities grow in size their feature sets also grow with them. Different users have different experiences with the same tools and communities. Enterprises and other organizations seeking to leverage these communities need a straightforward way to analyze and compare a variety of salient attributes of these communities. We describe a taxonomy and tool for crowd-sourcing user based evaluations of enterprise relevant attributes of digital communities and present the results of a small scale study on its usefulness and stability across multiple raters.}, keywords = {enterprise, Online communities, Taxonomy, Visualization}, isbn = {978-1-4503-0556-3}, url = {http://doi.acm.org/10.1145/1958824.1958955}, author = {Wagstrom, Patrick and Martino, Jacquelyn and von Kaenel, Juerg and Marshini Chetty and Thomas, John and Jones, Lauretta} } @article {16256, title = {DNACLUST: accurate and efficient clustering of phylogenetic marker genes}, journal = {BMC Bioinformatics}, volume = {12}, year = {2011}, month = {2011/06/30/}, pages = {271 - 271}, abstract = {Clustering is a fundamental operation in the analysis of biological sequence data. New DNA sequencing technologies have dramatically increased the rate at which we can generate data, resulting in datasets that cannot be efficiently analyzed by traditional clustering methods.}, isbn = {1471-2105}, doi = {10.1186/1471-2105-12-271}, url = {http://www.biomedcentral.com/1471-2105/12/271}, author = {Ghodsi,Mohammadreza and Liu,Bo and Pop, Mihai} } @conference {19024, title = {Do You Know Where Your Data Are? Secure Data Capsules for Deployable Data Protection}, year = {2011}, month = {2011}, url = {http://static.usenix.org/event/hotos11/tech/final_files/ManiatisAkhawe.pdf}, author = {Maniatis, P. and Akhawe, D. and Fall,K. and Elaine Shi and McCamant, S. and Song,D.} } @conference {13541, title = {Document Image Classification and Labeling using Multiple Instance Learning}, booktitle = {Intl. Conf. on Document Analysis and Recognition (ICDAR 11)}, year = {2011}, month = {2011///}, pages = {1059 - 1063}, abstract = {The labeling of large sets of images for training or testing analysis systems can be a very costly and time-consuming process. Multiple instance learning (MIL) is a generalization of traditional supervised learning which relaxes the need for exact labels on training instances. Instead, the labels are required only for a set of instances known as bags. In this paper, we apply MIL to the retrieval and localization of signatures and the retrieval of images containing machine-printed text, and show that a gain of 15-20\% in performance can be achieved over the supervised learning with weak-labeling. We also compare our approach to supervised learning with fully annotated training data and report a competitive accuracy for MIL. Using our experiments on real-world datasets, we show that MIL is a good alternative when the training data has only document-level annotation.}, author = {Kumar,Jayant and Pillai,Jaishanker and David Doermann} } @conference {12437, title = {Domain adaptation for object recognition: An unsupervised approach}, booktitle = {2011 IEEE International Conference on Computer Vision (ICCV)}, year = {2011}, month = {2011/11/06/13}, pages = {999 - 1006}, publisher = {IEEE}, organization = {IEEE}, abstract = {Adapting the classifier trained on a source domain to recognize instances from a new target domain is an important problem that is receiving recent attention. In this paper, we present one of the first studies on unsupervised domain adaptation in the context of object recognition, where we have labeled data only from the source domain (and therefore do not have correspondences between object categories across domains). Motivated by incremental learning, we create intermediate representations of data between the two domains by viewing the generative subspaces (of same dimension) created from these domains as points on the Grassmann manifold, and sampling points along the geodesic between them to obtain subspaces that provide a meaningful description of the underlying domain shift. We then obtain the projections of labeled source domain data onto these subspaces, from which a discriminative classifier is learnt to classify projected data from the target domain. We discuss extensions of our approach for semi-supervised adaptation, and for cases with multiple source and target domains, and report competitive results on standard datasets.}, keywords = {Data models, data representations, discriminative classifier, Feature extraction, Grassmann manifold, image sampling, incremental learning, labeled source domain, Manifolds, measurement, object category, Object recognition, Principal component analysis, sampling points, semisupervised adaptation, target domain, underlying domain shift, unsupervised approach, unsupervised domain adaptation, Unsupervised learning, vectors}, isbn = {978-1-4577-1101-5}, doi = {10.1109/ICCV.2011.6126344}, author = {Gopalan,R. and Ruonan Li and Chellapa, Rama} } @article {19267, title = {The DSPCAD Integrative Command Line Environment: Introduction to DICE Version 1.1}, year = {2011}, month = {2011}, abstract = {DICE (the DSPCAD Integrative Command Line Environment) is a package of utilities that facilitates efficient management of software projects. Key areas of emphasis in DICE are cross-platform operation, support for projects that integrate heterogeneous programming languages, and support for applying and integrating different kinds of design and testing methodologies. The package is being developed at the University of Maryland to facilitate the research and teaching of methods for implementation, testing, evolution, and revision of engineering software. The package is also being developed as a foundation for developing experimental research software for techniques and tools in the area of computer-aided design (CAD) of digital signal processing (DSP) systems. The package is intended for cross-platform operation, and is currently being developed and used actively on the Linux, Mac OS, Solaris, and Windows (equipped with Cygwin) platforms. This report provides an introduction to DICE, and provides background on some of the key features in DICE Version 1.1. This report also gives a brief introduction to dicelang, which is a plug-in package for DICE that provides additional utilities, libraries, and tools for managing software projects in specific programming languages.}, keywords = {*SOFTWARE ENGINEERING, COMPUTER PROGRAMMING, COMPUTER PROGRAMMING AND SOFTWARE, COMPUTER PROGRAMS, DICE(COMPUTER PROGRAM), programming languages, Project management}, author = {Bhattacharyya, Shuvra S. and Plishker,William and Chung-Ching Shen and Sane, Nimish and Zaki, George} } @article {19257, title = {The DSPCAD Lightweight Dataflow Environment: Introduction to LIDE Version 0.1}, year = {2011}, month = {2011}, abstract = {LIDE (the DSPCAD Lightweight Dataflow Environment) is a flexible,lightweight design environment that allows designers to experiment with dataflow-based approaches for design and implementation of digital signal processing (DSP) systems. LIDE contains libraries of dataflow graph elements (primitive actors, hierarchical actors, and edges) and utilities that assist designers in modeling, simulating, and implementing DSP systems using formal dataflow techniques. The libraries of dataflow graph elements (mainly actors) contained in LIDE provide useful building blocks that can be used to construct signal processing applications, and that can be used as examples that designers can adapt to create their own, customized LIDE actors. Furthermore, by using LIDE along with the DSPCAD Integrative Command Line Environment (DICE), designers can efficiently create and execute unit tests for user-designed actors. This report provides an introduction to LIDE. The report includes details on the process for setting up the LIDE environment, and covers methods for using pre-designed libraries of graph elements, as well as creating user-designed libraries and associated utilities using the C language. The report also gives an introduction to the C language plug-in for dicelang. This plug-in, called dicelang-C, provides features for efficient C-based project development and maintenance that are useful to apply when working with LIDE. }, keywords = {Technical Report}, isbn = {UMIACS-TR-2011-17}, doi = {Technical Report}, url = {http://drum.lib.umd.edu//handle/1903/12147}, author = {Chung-Ching Shen and Wang, Lai-Huei and Cho, Inkeun and Kim, Scott and Won, Stephen and Plishker,William and Bhattacharyya, Shuvra S.} } @article {16495, title = {A Dual Framework and Algorithms for Targeted Online Data Delivery}, journal = {IEEE Transactions on Knowledge and Data Engineering}, volume = {23}, year = {2011}, month = {2011///}, pages = {5 - 21}, abstract = {A variety of emerging online data delivery applications challenge existing techniques for data delivery to human users, applications, or middleware that are accessing data from multiple autonomous servers. In this paper, we develop a framework for formalizing and comparing pull-based solutions and present dual optimization approaches. The first approach, most commonly used nowadays, maximizes user utility under the strict setting of meeting a priori constraints on the usage of system resources. We present an alternative and more flexible approach that maximizes user utility by satisfying all users. It does this while minimizing the usage of system resources. We discuss the benefits of this latter approach and develop an adaptive monitoring solution Satisfy User Profiles (SUPs). Through formal analysis, we identify sufficient optimality conditions for SUP. Using real (RSS feeds) and synthetic traces, we empirically analyze the behavior of SUP under varying conditions. Our experiments show that we can achieve a high degree of satisfaction of user utility when the estimations of SUP closely estimate the real event stream, and has the potential to save a significant amount of system resources. We further show that SUP can exploit feedback to improve user utility with only a moderate increase in resource utilization.}, keywords = {client/server multitier systems, distributed databases, online data delivery., online information services}, isbn = {1041-4347}, doi = {http://doi.ieeecomputersociety.org/10.1109/TKDE.2010.15}, author = {Roitman,Haggai and Gal,Avigdor and Raschid, Louiqa} } @conference {14679, title = {Dynamic Enforcement of Knowledge-Based Security Policies}, booktitle = {Computer Security Foundations Symposium (CSF), 2011 IEEE 24th}, year = {2011}, month = {2011/06/27/29}, pages = {114 - 128}, publisher = {IEEE}, organization = {IEEE}, abstract = {This paper explores the idea of knowledge-based security policies, which are used to decide whether to answer queries over secret data based on an estimation of the querier{\textquoteright}s (possibly increased) knowledge given the results. Limiting knowledge is the goal of existing information release policies that employ mechanisms such as noising, anonymization, and redaction. Knowledge-based policies are more general: they increase flexibility by not fixing the means to restrict information flow. We enforce a knowledge-based policy by explicitly tracking a model of a querier{\textquoteright}s belief about secret data, represented as a probability distribution, and denying any query that could increase knowledge above a given threshold. We implement query analysis and belief tracking via abstract interpretation using a novel probabilistic polyhedral domain, whose design permits trading off precision with performance while ensuring estimates of a querier{\textquoteright}s knowledge are sound. Experiments with our implementation show that several useful queries can be handled efficiently, and performance scales far better than would more standard implementations of probabilistic computation based on sampling.}, keywords = {abstract interpretation, belief networks, belief tracking, Data models, dynamic enforcement, Facebook, information flow, knowledge based systems, knowledge-based security, knowledge-based security policy, privacy, probabilistic computation, probabilistic logic, probabilistic polyhedral domain, probabilistic polyhedron, probability, query analysis, Security, security of data, semantics, Waste materials}, isbn = {978-1-61284-644-6}, doi = {10.1109/CSF.2011.15}, author = {Mardziel,P. and Magill,S. and Hicks, Michael W. and Srivatsa,M.} } @conference {14315, title = {Dynamic inference of static types for ruby}, booktitle = {Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages}, series = {POPL {\textquoteright}11}, year = {2011}, month = {2011///}, pages = {459 - 472}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {There have been several efforts to bring static type inference to object-oriented dynamic languages such as Ruby, Python, and Perl. In our experience, however, such type inference systems are extremely difficult to develop, because dynamic languages are typically complex, poorly specified, and include features, such as eval and reflection, that are hard to analyze. In this paper, we introduce constraint-based dynamic type inference, a technique that infers static types based on dynamic program executions. In our approach, we wrap each run-time value to associate it with a type variable, and the wrapper generates constraints on this type variable when the wrapped value is used. This technique avoids many of the often overly conservative approximations of static tools, as constraints are generated based on how values are used during actual program runs. Using wrappers is also easy to implement, since we need only write a constraint resolution algorithm and a transformation to introduce the wrappers. The best part is that we can eat our cake, too: our algorithm will infer sound types as long as it observes every path through each method body---note that the number of such paths may be dramatically smaller than the number of paths through the program as a whole. We have developed Rubydust, an implementation of our algorithm for Ruby. Rubydust takes advantage of Ruby{\textquoteright}s dynamic features to implement wrappers as a language library. We applied Rubydust to a number of small programs and found it to be both easy to use and useful: Rubydust discovered 1 real type error, and all other inferred types were correct and readable.}, keywords = {dynamic languages, dynamic type inference, ruby, static types}, isbn = {978-1-4503-0490-0}, doi = {10.1145/1926385.1926437}, url = {http://doi.acm.org/10.1145/1926385.1926437}, author = {An,Jong-hoon (David) and Chaudhuri,Avik and Foster, Jeffrey S. and Hicks, Michael W.} } @article {14430, title = {Dynamic Processing Allocation in Video}, journal = {Pattern Analysis and Machine Intelligence, IEEE Transactions on}, volume = {33}, year = {2011}, month = {2011/11//}, pages = {2174 - 2187}, abstract = {Large stores of digital video pose severe computational challenges to existing video analysis algorithms. In applying these algorithms, users must often trade off processing speed for accuracy, as many sophisticated and effective algorithms require large computational resources that make it impractical to apply them throughout long videos. One can save considerable effort by applying these expensive algorithms sparingly, directing their application using the results of more limited processing. We show how to do this for retrospective video analysis by modeling a video using a chain graphical model and performing inference both to analyze the video and to direct processing. We apply our method to problems in background subtraction and face detection, and show in experiments that this leads to significant improvements over baseline algorithms.}, keywords = {algorithms;digital, allocation;video, analysis;computer, background, detection;graphical, detection;resource, graphics;face, model;resource, processing;, processing;face, recognition;object, signal, subtraction;baseline, video}, isbn = {0162-8828}, doi = {10.1109/TPAMI.2011.55}, author = {Daozheng Chen and Bilgic,M. and Getoor, Lise and Jacobs, David W.} } @article {18189, title = {Data hiding in compiled program binaries for supplementing computer functionality}, volume = {11/445,374}, year = {2010}, month = {2010/11/23/}, abstract = {Bit reductions in program instructions are achieved by determining the set of bit patterns in bit locations of the instructions. If only a subset of bit patterns is present in the instructions, they may be represented by an index value having a smaller number of bits. The index value may be substituted into the instruction and later used in decoding by referencing a corresponding bit pattern in a lookup table. The bit-reduction in the instruction makes way for supplemental data bits which may then be embedded.}, url = {http://www.google.com/patents?id=tNHbAAAAEBAJ}, author = {M. Wu and Swaminathan,Ashwin and Mao,Yinian}, editor = {University of Maryland} } @conference {17843, title = {Decentralized dynamic scheduling across heterogeneous multi-core desktop grids}, booktitle = {2010 IEEE International Symposium on Parallel \& Distributed Processing, Workshops and Phd Forum (IPDPSW)}, year = {2010}, month = {2010/04/19/23}, pages = {1 - 9}, publisher = {IEEE}, organization = {IEEE}, abstract = {The recent advent of multi-core computing environments increases both the heterogeneity and complexity of managing desktop grid resources, making efficient load balancing challenging even for a centralized manager. Even with good initial job assignments, dynamic scheduling is still needed to adapt to dynamic environments, as well as for applications whose running times are not known a priori. In this paper, we propose new decentralized scheduling schemes that backfill jobs locally and dynamically migrate waiting jobs across nodes to leverage residual resources, while guaranteeing bounded waiting times for all jobs. The methods attempt to maximize total throughput while balancing load across available grid resources. Experimental results via simulation show that our scheduling scheme has performance competitive with an online centralized scheduler.}, keywords = {backfill jobs, bounded waiting time, Computer science, decentralized dynamic scheduling, desktop grid resource management, Dynamic scheduling, Educational institutions, Environmental management, grid computing, heterogeneous multicore desktop grid, job assignment, job migration, load balancing, Load management, multicore computing environment, Peer to peer computing, Processor scheduling, residual resources, resource allocation, Resource management, scheduling, Scheduling algorithm, Throughput}, isbn = {978-1-4244-6533-0}, doi = {10.1109/IPDPSW.2010.5470877}, author = {Jaehwan Lee and Keleher,P. and Sussman, Alan} } @conference {18559, title = {Decoupling policy from configuration in campus and enterprise networks}, booktitle = {Local and Metropolitan Area Networks (LANMAN), 2010 17th IEEE Workshop on}, year = {2010}, month = {2010/05//}, pages = {1 - 6}, abstract = {This paper surveys our ongoing work on the use of software-defined networking to simplify two acute policy problems in campus and enterprise network operations: access control and information flow control. We describe how the current coupling of high-level policy with low-level configuration makes these problems challenging today. We describe the specific policy problems faced by campus and enterprise network operators; illustrate our approach, which leverages recent trends in separating the network{\textquoteright}s $\#$x201C;control plane $\#$x201D; from the data plane; and show how this approach can be applied to simplify these two enterprise network management tasks. We also describe our ongoing deployment efforts to build a campus network testbed where trial designs can be deployed and evaluated. We close with a summary of current and future research challenges for solving challenges within enterprise networks within the context of this new paradigm.}, keywords = {Access control, Business communication, campus network, decoupling policy, enterprise network management tasks, enterprise network operator, information flow control, software defined network, software radio, telecommunication network management, telecommunication security}, doi = {10.1109/LANMAN.2010.5507162}, author = {Feamster, Nick and Nayak,A. and Kim,Hyojoon and Clark,R. and Mundada,Y. and Ramachandran,A. and bin Tariq,M.} } @conference {19445, title = {Deliberate Interactions: Characterizing Technology Use in Nairobi, Kenya}, booktitle = {SIGCHI {\textquoteright}10}, series = {CHI {\textquoteright}10}, year = {2010}, month = {2010///}, pages = {2593 - 2602}, publisher = {ACM}, organization = {ACM}, abstract = {We present results from a qualitative study examining how professionals living and working in Nairobi, Kenya regularly use ICT in their everyday lives. There are two contributions of this work for the HCI community. First, we provide empirical evidence demonstrating constraints our participants encountered when using technology in an infrastructure-poor setting. These constraints are limited bandwidth, high costs, differing perceptions of responsiveness, and threats to physical and virtual security. Second, we use our findings to critically evaluate the "access, anytime and anywhere" construct shaping the design of future technologies. We present an alternative vision called deliberate interactions--a planned and purposeful interaction style that involves offline preparation and discuss ways ICT can support this online usage behavior.}, keywords = {everyday technology, hci4d, Kenya, urban computing}, isbn = {978-1-60558-929-9}, url = {http://doi.acm.org/10.1145/1753326.1753719}, author = {Wyche, Susan P. and Smyth, Thomas N. and Marshini Chetty and Aoki, Paul M. and Grinter, Rebecca E.} } @article {15261, title = {Dense Subgraphs with Restrictions and Applications to Gene Annotation Graphs}, journal = {Research in Computational Molecular Biology}, year = {2010}, month = {2010///}, pages = {456 - 472}, abstract = {In this paper, we focus on finding complex annotation patterns representing novel and interesting hypotheses from gene annotation data. We define a generalization of the densest subgraph problem by adding an additional distance restriction (defined by a separate metric) to the nodes of the subgraph. We show that while this generalization makes the problem NP-hard for arbitrary metrics, when the metric comes from the distance metric of a tree, or an interval graph, the problem can be solved optimally in polynomial time. We also show that the densest subgraph problem with a specified subset of vertices that have to be included in the solution can be solved optimally in polynomial time. In addition, we consider other extensions when not just one solution needs to be found, but we wish to list all subgraphs of almost maximum density as well. We apply this method to a dataset of genes and their annotations obtained from The Arabidopsis Information Resource (TAIR). A user evaluation confirms that the patterns found in the distance restricted densest subgraph for a dataset of photomorphogenesis genes are indeed validated in the literature; a control dataset validates that these are not random patterns. Interestingly, the complex annotation patterns potentially lead to new and as yet unknown hypotheses. We perform experiments to determine the properties of the dense subgraphs, as we vary parameters, including the number of genes and the distance.}, doi = {10.1007/978-3-642-12683-3_30}, author = {Saha,B. and Hoch,A. and Khuller, Samir and Raschid, Louiqa and Zhang,X. N} } @article {14545, title = {Deploying sensor networks with guaranteed fault tolerance}, journal = {IEEE/ACM Transactions on Networking (TON)}, volume = {18}, year = {2010}, month = {2010///}, pages = {216 - 228}, author = {Bredin,J. L and Demaine,E. D and Hajiaghayi, Mohammad T. and Rus,D.} } @article {13286, title = {Design, Analysis and Comparison of Spatial Indexes for Tetrahedral Meshes}, volume = {DISI-TR-2010-05}, year = {2010}, month = {2010///}, institution = {Department of Computer Science and Information Science, University of Genoa}, abstract = {We address the problem of performing spatial queries on tetrahedral meshes. These latterarise in several application domains including 3D GIS, scientific visualization, finite element analysis. We have defined and implemented a family of spatial indexes, that we call tetrahedral trees. Tetrahedral trees are based on a subdivision of a cubic domain containing the mesh defined either by an octree or a 3D kd-tree. For each of them, we have four variants of the spatial index, depending on four different subdivision criteria. Here, we present such indexes, we discuss how to construct them and perform classical spatial queries such as point location and window queries. We compare the various tetrahedral trees based in memory usage, performances in spatial queries and computation times for constructing them. }, author = {De Floriani, Leila and Fellegara,R. and Magillo,P.} } @conference {18826, title = {Design and Fabrication of a Multi-Material Compliant Flapping Wing Drive Mechanism for Miniature Air Vehicles}, year = {2010}, month = {2010///}, pages = {69 - 80}, publisher = {ASME}, organization = {ASME}, abstract = {Successful realization of a flapping wing micro air vehicle (MAV) requires development of a light weight drive mechanism converting the rotary motion of the motor into flapping motion of the wings. Low weight of the drive mechanism is required to maximize the payload and battery capacity. In order to make flapping wing MAVs attractive in search, rescue, and recovery missions, they should be disposable from the cost point of view. Injection molded compliant drive mechanisms are an attractive design option to satisfy the weight, efficiency and cost requirements. In the past, we have successfully used multi-piece molding to create mechanisms utilizing distributed compliance for smaller MAVs. However, as the size of the MAV increases, mechanisms with distributed compliance exhibit excessive deformation. Therefore localizing rather than distributing the compliance in the mechanism becomes a more attractive option. Local compliance can be realized through multimaterial designs. A multi-material injection molded mechanism additionally offers reduction in the number of parts. This paper describes an approach for determining the drive mechanism shape and size that meets both the functional design and multi-material molding requirements. The design generated by the approach described in this paper was utilized to realize a flapping wing MAV with significant enhancements in the payload capabilities.}, isbn = {978-0-7918-4410-6}, doi = {10.1115/DETC2010-28519}, url = {http://link.aip.org/link/ASMECP/v2010/i44106/p69/s1\&Agg=doi}, author = {Bejgerowski,Wojciech and Gerdes,John W. and Gupta, Satyandra K. and Bruck,Hugh A. and Wilkerson,Stephen} } @article {19280, title = {Design and implementation of embedded computer vision systems based on particle filters}, journal = {Computer Vision and Image Understanding}, volume = {114}, year = {2010}, month = {2010}, pages = {1203 - 1214}, abstract = {Particle filtering methods are gradually attaining significant importance in a variety of embedded computer vision applications. For example, in smart camera systems, object tracking is a very important application and particle filter based tracking algorithms have shown promising results with robust tracking performance. However, most particle filters involve vast amount of computational complexity, thereby intensifying the challenges faced in their real-time, embedded implementation. Many of these applications share common characteristics, and the same system design can be reused by identifying and varying key system parameters and varying them appropriately. In this paper, we present a System-on-Chip (SoC) architecture involving both hardware and software components for a class of particle filters. The framework uses parameterization to enable fast and efficient reuse of the architecture with minimal re-design effort for a wide range of particle filtering applications as well as implementation platforms. Using this framework, we explore different design options for implementing three different particle filtering applications on field-programmable gate arrays (FPGAs). The first two applications involve particle filters with one-dimensional state transition models, and are used to demonstrate the key features of the framework. The main focus of this paper is on design methodology for hardware/software implementation of multi-dimensional particle filter application and we explore this in the third application which is a 3D facial pose tracking system for videos. In this multi-dimensional particle filtering application, we extend our proposed architecture with models for hardware/software co-design so that limited hardware resources can be utilized most effectively. Our experiments demonstrate that the framework is easy and intuitive to use, while providing for efficient design and implementation. We present different memory management schemes along with results on trade-offs between area (FPGA resource requirement) and execution speed.}, keywords = {design space exploration, Particle filters, Reconfigurable platforms}, isbn = {1077-3142}, url = {http://www.sciencedirect.com/science/article/pii/S1077314210000950}, author = {Sankalita Saha and Bambha, Neal K. and Bhattacharyya, Shuvra S.} } @conference {19281, title = {Design and implementation of real-time signal processing applications on heterogeneous multiprocessor arrays}, booktitle = {2010 Conference Record of the Forty Fourth Asilomar Conference on Signals, Systems and Computers (ASILOMAR)}, year = {2010}, month = {2010}, pages = {2121 - 2125}, abstract = {Processing structures based on arrays of computational elements form an important class of architectures, which includes field programmable gate arrays (FPGAs), systolic arrays, and various forms of multicore processors. A wide variety of design methods and tools have been targeted to regular processing arrays involving homogeneous processing elements. In this paper, we introduce the concept of field programmable X arrays (FPXAs) as an abstract model for design and implementation of heterogeneous multiprocessor arrays for signal processing systems. FPXAs are abstract structures that can be targeted for implementation on application-specific integrated circuits, FPGAs, or other kinds of reconfigurable processors. FPXAs can also be mapped onto multicore processors for flexible emulation. We discuss the use of dataflow models as an integrated application representation and intermediate representation for efficient specification and mapping of signal processing systems on FPXAs. We demonstrate our proposed models and techniques with a case study involving the embedding of an application-specific FPXA system on an off-the-shelf FPGA device.}, keywords = {application specific integrated circuits, application-specific integrated circuits, computational elements, Computer architecture, decoding, Field programmable gate arrays, field programmable X arrays, FPGA, FPXA, Integrated circuit modeling, Logic Design, microprocessor chips, multicore processors, multiprocessor arrays, real-time signal processing, reconfigurable architectures, reconfigurable processors, Routing, Signal processing, Signal processing systems, systolic arrays, Viterbi algorithm}, author = {Wu, Hsiang-Huang and Chung-Ching Shen and Bhattacharyya, Shuvra S. and Compton, K. and Schulte, M. and Wolf, M. and Zhang, Tong} } @conference {14345, title = {The design of eco-feedback technology}, booktitle = {Proceedings of the 28th international conference on Human factors in computing systems}, series = {CHI {\textquoteright}10}, year = {2010}, month = {2010///}, pages = {1999 - 2008}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, keywords = {eco-feedback, environmental hci, reflective hci, survey}, isbn = {978-1-60558-929-9}, doi = {10.1145/1753326.1753629}, url = {http://doi.acm.org/10.1145/1753326.1753629}, author = {Jon Froehlich and Findlater,Leah and Landay,James} } @conference {16824, title = {Determining the spatial reader scopes of news sources using local lexicons}, booktitle = {Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems}, series = {GIS {\textquoteright}10}, year = {2010}, month = {2010///}, pages = {43 - 52}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Information sources on the Internet (e.g., Web versions of newspapers) usually have an implicit spatial reader scope, which is the geographical location for which the content has been primarily produced. Knowledge of the spatial reader scope facilitates the construction of a news search engine that provides readers a set of news sources relevant to the location in which they are interested. In particular, it plays an important role in disambiguating toponyms (e.g., textual specifications of geographical locations) in news articles, as the process of selecting an interpretation for the toponym often reduces to one of selecting an interpretation that seems natural in the context of the spatial reader scope. The key to determining the spatial reader scope of news sources is the notion of local lexicon, which for a location s is a set of concepts such as, but not limited to, names of people, landmarks, and historical events, that are spatially related to s. Techniques to automatically generate the local lexicon of a location by using the link structure of Wikipedia are described and evaluated. A key contribution is the improvement of existing methods used in the semantic relatedness domain to extract concepts spatially related to a given location from the Wikipedia. Results of experiments are presented that indicate that the knowledge of the spatial reader scope significantly improves the disambiguation of textually specified locations in news articles and that using local lexicons is an effective method to determine the spatial reader scopes of news sources.}, keywords = {geotagging, local lexicon, news search engine, spatial reader scope, spatial relatedness}, isbn = {978-1-4503-0428-3}, doi = {10.1145/1869790.1869800}, url = {http://doi.acm.org/10.1145/1869790.1869800}, author = {Quercini,Gianluca and Samet, Hanan and Sankaranarayanan,Jagan and Lieberman,Michael D.} } @article {18828, title = {Developing a Stochastic Dynamic Programming Framework for Optical Tweezer-Based Automated Particle Transport Operations}, journal = {Automation Science and Engineering, IEEE Transactions on}, volume = {7}, year = {2010}, month = {2010/04//}, pages = {218 - 227}, abstract = {Automated particle transport using optical tweezers requires the use of motion planning to move the particle while avoiding collisions with randomly moving obstacles. This paper describes a stochastic dynamic programming based motion planning framework developed by modifying the discrete version of an infinite-horizon partially observable Markov decision process algorithm. Sample trajectories generated by this algorithm are presented to highlight effectiveness in crowded scenes and flexibility. The algorithm is tested using silica beads in a holographic tweezer set-up and data obtained from the physical experiments are reported to validate various aspects of the planning simulation framework. This framework is then used to evaluate the performance of the algorithm under a variety of operating conditions.}, keywords = {holographic tweezer set-up, holography, infinite-horizon partially observable Markov decision process algorithm, Markov processes, motion planning framework, optical tweezer-based automated particle transport operations, optical tweezers, radiation pressure, silica beads, stochastic dynamic programming framework, stochastic programming}, isbn = {1545-5955}, doi = {10.1109/TASE.2009.2026056}, author = {Banerjee,A. G. and Pomerance,A. and Losert,W. and Gupta,S.K.} } @article {18791, title = {Developing Autonomy for Unmanned Surface Vehicles by Using Virtual Environments}, year = {2010}, month = {2010///}, institution = {ENERGETICS TECHNOLOGY CENTER INC LA PLATA MD}, abstract = {We address the problem of automated synthesis of an action selection policy for an unmanned vehicle operating in an environment with a deceptive adversary. We introduce a new synthesis approach using which an initial version of the policy is automatically generated and then gradually refined by detecting and fixing its shortcomings. Our focus is specifically on automated synthesis of a policy used for blocking the advancement of an intruder boat toward a valuable target. The USV must generate specific maneuvers for blocking. The intruder is human competitive and exhibits a deceptive behavior so that the USV cannot exploit regularity in its attacking behavior. We compared the performance of a hand coded USVs blocking policy to the performance of a policy that was automatically synthesized. Our results show that the performance of the automatically generated USVs policy exceed the performance of the hand coded policy and thus demonstrates the feasibility of the proposed approach.}, url = {http://oai.dtic.mil/oai/oai?verb=getRecord\&metadataPrefix=html\&identifier=ADA535105}, author = {Kavetsky,R. and Gupta,S.K.} } @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 {12874, title = {Discovery of novel Vibrio cholerae VSP-II genomic islands using comparative genomic analysis}, journal = {FEMS Microbiology Letters}, volume = {308}, year = {2010}, month = {2010/05/06/}, pages = {130 - 137}, abstract = {This report describes Vibrio seventh pandemic island II (VSP-II) and three novel variants revealed by comparative genomics of 23 Vibrio cholerae strains and their presence among a large and diverse collection of V. cholerae isolates. Three VSP-II variants were reported previously and our results demonstrate the presence of three novel VSP-II in clinical and environmental V. cholerae marked by major deletions and genetic rearrangements. A new VSP-II cluster was found in the seventh pandemic V. cholerae O1 El Tor strain CIRS101, which is dominant (95\%) among the recent (2004{\textendash}2007) seven pandemic V. cholerae O1 El Tor isolates from two endemic sites, but was not found in older strains from the same region. Two other variants were found in V. cholerae TMA21 and RC385, two environmental strains from coastal Brazil and the Chesapeake Bay, respectively, the latter being prevalent among environmental V. cholerae non-O1/non-O139 and Vibrio mimicus. The results of this study indicate that the VSP-II island has undergone significant rearrangement through a complex evolutionary pathway in V. cholerae. Interestingly, one of the new VSP-II revealed the presence of {\textquoteleft}old{\textquoteright} and {\textquoteleft}new{\textquoteright}V. cholerae O1 El Tor pandemic clones circulating in some of the areas where cholera is endemic.}, keywords = {Vibrio cholerae, Vibrio mimicus, VPS-II}, isbn = {1574-6968}, doi = {10.1111/j.1574-6968.2010.02008.x}, url = {http://onlinelibrary.wiley.com/doi/10.1111/j.1574-6968.2010.02008.x/full}, author = {Taviani,Elisa and Grim,Christopher J. and Choi,Jinna and Jongsik Chun and Haley,Bradd and Hasan,Nur A. and Huq,Anwar and Rita R Colwell} } @article {18525, title = {Distributed Implementation of Coordinated, Network-Wide Policies and Protocols with FlowFlex}, volume = {GT-CS-10-07}, year = {2010}, month = {2010///}, institution = {Georgia Institute of Technology}, abstract = {The increasing programmability of network devices gives protocol designers and network operators considerably more flexibility in defining custom protocols and traffic processing functions. Today, network operators and protocol designers have the option of either operating at flow-level granularity, which offers coordinated control; or packet-level granularity, which offers flexibility, but not coordinated control. Today{\textquoteright}s network programming paradigms force operators to choose between the fine-grained control and expressiveness of packet processing and the coordination of flow processing, which makes it difficult to quickly realize a distributed implementation of a global, network-wide policy. Designers must also choose between the flexibility of hardware-based solutions and the fast development cycles offered by software. This paper proposes a system called FlowFlex that offers network designers the best of both worlds: with FlowFlex, operators can quickly design, implement, and deploy network systems and protocols that offer fast, distributed, implementations that require coordinated control and fine-grained operations on packets. We present the design and implementation of the FlowFlex framework and show how it can improve both expressiveness and efficiency for three real-world networking applications.}, url = {http://hdl.handle.net/1853/35002}, author = {Mundada,Y. and Sherwood,R. and Feamster, Nick} } @article {12876, title = {Diversity and distribution of cholix toxin, a novel ADP-ribosylating factor from Vibrio cholerae}, journal = {Environmental Microbiology Reports}, volume = {2}, year = {2010}, month = {2010/02/08/}, pages = {198 - 207}, abstract = {Non-toxigenic non-O1, non-O139 Vibrio cholerae strains isolated from both environmental and clinical settings carry a suite of virulence factors aside from cholera toxin. Among V. cholerae strains isolated from coastal waters of southern California, this includes cholix toxin, an ADP-ribosylating factor that is capable of halting protein synthesis in eukaryotic cells. The prevalence of the gene encoding cholix toxin, chxA, was assessed among a collection of 155 diverse V. cholerae strains originating from both clinical and environmental settings in Bangladesh and Mexico and other countries around the globe. The chxA gene was present in 47\% of 83 non-O1, non-O139 strains and 16\% of 72 O1/O139 strains screened as part of this study. A total of 86 chxA gene sequences were obtained, and phylogenetic analysis revealed that they fall into two distinct clades. These two clades were also observed in the phylogenies of several housekeeping genes, suggesting that the divergence observed in chxA extends to other regions of the V. cholerae genome, and most likely has arisen from vertical descent rather than horizontal transfer. Our results clearly indicate that ChxA is a major toxin of V. cholerae with a worldwide distribution that is preferentially associated with non-pandemic strains.}, isbn = {1758-2229}, doi = {10.1111/j.1758-2229.2010.00139.x}, url = {http://onlinelibrary.wiley.com/doi/10.1111/j.1758-2229.2010.00139.x/abstract?userIsAuthenticated=false\&deniedAccessCustomisedMessage=}, author = {Purdy,Alexandra E. and Balch,Deborah and Liz{\'a}rraga-Partida,Marcial Leonardo and Islam,Mohammad Sirajul and Martinez-Urtaza,Jaime and Huq,Anwar and Rita R Colwell and Bartlett,Douglas H.} } @article {18539, title = {Don{\textquoteright}t Configure the Network, Program It! Domain-Specific Programming Languages for Network Systems}, volume = {YALEU/DCS/RR-1432}, year = {2010}, month = {2010///}, institution = {Yale University}, abstract = {Network operators must configure networks to accomplish critical, complex, and often conflicting requirements: they must ensure good performance while maintaining security, and satisfy contractual obligations while ensuring profitable use of interdomain connections. Unfortunately, today they have no choice but to implement these high-level goals by configuring hundreds of individual network devices. These interact in complex and unexpected ways, often resulting in misconfigurations or downtime. We propose a new approach: rather than configure individual network devices, operators should program the network holistically, according to high-level policies. Towards this goal, we present Nettle, a system for clearly and concisely expressing network requirements together with mechanisms to control the network accordingly. At the lowest level, we rely on OpenFlow switches for programmable network hardware. On top of this layer, we build an extensible family of embedded domain-specific languages (EDSLs), each aimed at different operational concerns and provide convenient ways to sensibly combine expressions in these languages. We present a case study demonstrating a DSL for networks that provides fine-grained, dynamic access control policies.}, author = {Feamster, Nick and Voellmy,A. and Agarwal,A. and Hudak,P. and Burnett,S. and Launchbury,J.} } @conference {12221, title = {Don{\textquoteright}t love thy nearest neighbor}, booktitle = {Proceedings of the 9th international conference on Peer-to-peer systems}, series = {IPTPS{\textquoteright}10}, year = {2010}, month = {2010///}, pages = {5 - 5}, publisher = {USENIX Association}, organization = {USENIX Association}, address = {Berkeley, CA, USA}, url = {http://dl.acm.org/citation.cfm?id=1863145.1863150}, author = {Lumezanu,Cristian and Levin,Dave and Han,Bo and Spring, Neil and Bhattacharjee, Bobby} } @inbook {19300, title = {Dynamic and Multidimensional Dataflow Graphs}, booktitle = {Handbook of Signal Processing Systems}, year = {2010}, month = {2010}, pages = {899 - 930}, publisher = {Springer US}, organization = {Springer US}, abstract = {Much of the work to date on dataflow models for signal processing system design has focused decidable dataflow models that are best suited for onedimensional signal processing. In this chapter, we review more general dataflow modeling techniques that are targeted to applications that include multidimensional signal processing and dynamic dataflow behavior. As dataflow techniques are applied to signal processing systems that are more complex, and demand increasing degrees of agility and flexibility, these classes of more general dataflow models are of correspondingly increasing interest. We begin with a discussion of two dataflow modeling techniques - multi-dimensional synchronous dataflow and windowed dataflow - that are targeted towards multidimensional signal processing applications. We then provide a motivation for dynamic dataflow models of computation, and review a number of specific methods that have emerged in this class of models. Our coverage of dynamic dataflowmodels in this chapter includes Boolean dataflow, the stream-based function model, CAL, parameterized dataflow, and enable-invoke dataflow.}, keywords = {Communications Engineering, Networks, Computer Systems Organization and Communication Networks, Processor Architectures, Signal, Image and Speech Processing}, isbn = {978-1-4419-6344-4, 978-1-4419-6345-1}, url = {http://link.springer.com/chapter/10.1007/978-1-4419-6345-1_32}, author = {Bhattacharyya, Shuvra S. and Deprettere, Ed F. and Keinert, Joachim}, editor = {Bhattacharyya, Shuvra S. and Deprettere, Ed F. and Leupers, Rainer and Takala, Jarmo} } @conference {15621, title = {A dynamic data structure for approximate range searching}, booktitle = {Proceedings of the 2010 annual symposium on Computational geometry}, series = {SoCG {\textquoteright}10}, year = {2010}, month = {2010///}, pages = {247 - 256}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced variant of a quadtree data structure. In particular, it defines a hierarchical decomposition of space into cells, which are based on hyperrectangles of bounded aspect ratio, each of constant combinatorial complexity. It can be viewed as a multidimensional generalization of the treap data structure of Seidel and Aragon. When inserted, points are assigned random priorities, and the tree is restructured through rotations as if the points had been inserted in priority order. In any fixed dimension d, we show it is possible to store a set of n points in a quadtreap of space O(n). The height h of the tree is O(log n) with high probability. It supports point insertion in time O(h). It supports point deletion in worst-case time O(h2) and expected-case time O(h), averaged over the points of the tree. It can answer ε-approximate spherical range counting queries over groups and approximate nearest neighbor queries in time O(h + (1/ε)d-1).}, keywords = {Approximation algorithms, dynamic data structures, geometric data structures, quadtrees, Range searching}, isbn = {978-1-4503-0016-2}, doi = {10.1145/1810959.1811002}, url = {http://doi.acm.org/10.1145/1810959.1811002}, author = {Mount, Dave and Park,Eunhui} } @conference {14688, title = {Dynamically checking ownership policies in concurrent c/c++ programs}, booktitle = {Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages}, series = {POPL {\textquoteright}10}, year = {2010}, month = {2010///}, pages = {457 - 470}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Concurrent programming errors arise when threads share data incorrectly. Programmers often avoid these errors by using synchronization to enforce a simple ownership policy: data is either owned exclusively by a thread that can read or write the data, or it is read owned by a set of threads that can read but not write the data. Unfortunately, incorrect synchronization often fails to enforce these policies and memory errors in languages like C and C++ can violate these policies even when synchronization is correct. In this paper, we present a dynamic analysis for checking ownership policies in concurrent C and C++ programs despite memory errors. The analysis can be used to find errors in commodity multi-threaded programs and to prevent attacks that exploit these errors. We require programmers to write ownership assertions that describe the sharing policies used by different parts of the program. These policies may change over time, as may the policies{\textquoteright} means of enforcement, whether it be locks, barriers, thread joins, etc. Our compiler inserts checks in the program that signal an error if these policies are violated at runtime. We evaluated our tool on several benchmark programs. The run-time overhead was reasonable: between 0 and 49\% with an average of 26\%. We also found the tool easy to use: the total number of ownership assertions is small, and the asserted specification and implementation can be debugged together by running the instrumented program and addressing the errors that arise. Our approach enjoys a pleasing modular soundness property: if a thread executes a sequence of statements on variables it owns, the statements are serializable within a valid execution, and thus their effects can be reasoned about in isolation from other threads in the program.}, keywords = {concurrency, Debugging, Dynamic analysis, Security, Testing, tools}, isbn = {978-1-60558-479-9}, doi = {10.1145/1706299.1706351}, url = {http://doi.acm.org/10.1145/1706299.1706351}, author = {Martin,Jean-Phillipe and Hicks, Michael W. and Costa,Manuel and Akritidis,Periklis and Castro,Miguel} } @article {16832, title = {Database and Representation Issues in Geographic Information Systems (GIS)}, journal = {Web and Wireless Geographical Information Systems}, year = {2009}, month = {2009///}, pages = {1 - 6}, abstract = {A review is provided of some database and representation issues involved in the implementation of geographic information systems (GIS).}, doi = {10.1007/978-3-642-10601-9_1}, author = {Samet, Hanan} } @conference {18798, title = {A Decoupled and Prioritized Stochastic Dynamic Programming Approach for Automated Transport of Multiple Particles Using Optical Tweezers}, volume = {6}, year = {2009}, month = {2009///}, pages = {785 - 796}, publisher = {ASME}, organization = {ASME}, address = {San Diego, California, USA}, abstract = {Automated transport of multiple particles using optical tweezers requires the use of motion planning to move them simultaneously while avoiding collisions amongst themselves and with randomly moving obstacles. This paper develops a decoupled and prioritized stochastic dynamic programming based motion planning framework by sequentially applying a partially observable Markov decision process algorithm on every particle that needs to be transported. An iterative version of a maximum bipartite graph matching algorithm is used to assign given goal locations to such particles. The algorithm for individual particle transport is validated using silica beads in a holographic tweezer set-up. Once the individual plans are computed, a three-step method consisting of clustering, classification, and branch and bound optimization is employed to determine the final collision-free paths. Simulation results in the form of sample trajectories and performance characterization plots are presented to illustrate the usefulness of the developed approach.}, isbn = {978-0-7918-4903-3}, doi = {10.1115/DETC2009-87113}, url = {http://link.aip.org/link/ASMECP/v2009/i49033/p785/s1\&Agg=doi}, author = {Banerjee,Ashis Gopal and Losert,Wolfgang and Gupta, Satyandra K.} } @conference {19490, title = {Dependable, Online Upgrades in Enterprise Systems}, booktitle = {OOPSLA{\textquoteright}09 Proceedings of the 24th ACM SIGPLAN Conference Companion on Object Oriented Programming Systems Languages and Applications}, series = {OOPSLA {\textquoteright}09}, year = {2009}, month = {2009///}, pages = {743 - 744}, publisher = {ACM}, organization = {ACM}, abstract = {Software upgrades are unreliable, often causing downtime or data loss. I propose Imago, an approach for removing the leading causes of upgrade failures (broken dependencies) and of planned downtime (data migrations). While imposing a higher resource overhead than previous techniques, Imago is more dependable and easier to use correctly.}, keywords = {data migration, Dependability, hidden dependencies, online upgrades, software upgrades}, isbn = {978-1-60558-768-4}, url = {http://doi.acm.org/10.1145/1639950.1639993}, author = {Tudor Dumitras} } @article {16401, title = {Design guidelines for agent based model visualization}, journal = {Journal of Artificial Societies and Social Simulation}, volume = {12}, year = {2009}, month = {2009///}, pages = {1 - 1}, abstract = {In the field of agent-based modeling (ABM), visualizations play an important role in identifying, communicating and understanding important behavior of the modeled phenomenon. However, many modelers tend to create ineffective visualizations of Agent Based Models (ABM) due to lack of experience with visual design. This paper provides ABM visualization design guidelines in order to improve visual design with ABM toolkits. These guidelines will assist the modeler in creating clear and understandable ABM visualizations. We begin by introducing a non-hierarchical categorization of ABM visualizations. This categorization serves as a starting point in the creation of an ABM visualization. We go on to present well-known design techniques in the context of ABM visualization. These techniques are based on Gestalt psychology, semiology of graphics, and scientific visualization. They improve the visualization design by facilitating specific tasks, and providing a common language to critique visualizations through the use of visual variables. Subsequently, we discuss the application of these design techniques to simplify, emphasize and explain an ABM visualization. Finally, we illustrate these guidelines using a simple redesign of a NetLogo ABM visualization. These guidelines can be used to inform the development of design tools that assist users in the creation of ABM visualizations.}, author = {Kornhauser,D. and Wilensky,U. and Rand, William} } @article {18195, title = {Design of data warehouse in teaching state based on OLAP and data mining}, journal = {Proceedings of SPIE}, volume = {7344}, year = {2009}, month = {2009///}, pages = {73440M - 73440M}, abstract = {The data warehouse and the data mining technology is one of information technology research hot topics. Atpresent the data warehouse and the data mining technology in aspects and so on commercial, financial industry as well as enterprise{\textquoteright}s production, market marketing obtained the widespread application, but is relatively less in educational fields{\textquoteright} application. Over the years, the teaching and management have been accumulating large amounts of data in colleges and universities, while the data can not be effectively used, in the light of social needs of the university development and the current status of data management, the establishment of data warehouse in university state, the better use of existing data, and on the basis dealing with a higher level of disposal --data mining are particularly important. In this paper, starting from the decision-making needs design data warehouse structure of university teaching state, and then through the design structure and data extraction, loading, conversion create a data warehouse model, finally make use of association rule mining algorithm for data mining, to get effective results applied in practice. Based on the data analysis and mining, get a lot of valuable information, which can be used to guide teaching management, thereby improving the quality of teaching and promoting teaching devotion in universities and enhancing teaching infrastructure. At the same time it can provide detailed, multi-dimensional information for universities assessment and higher education research. }, author = {Zhou,L. and Wu,M. and Li,S.} } @conference {12416, title = {The design of ViVA: a mixed-initiative visual vocabulary for aphasia}, booktitle = {Proceedings of the 27th international conference extended abstracts on Human factors in computing systems}, series = {CHI EA {\textquoteright}09}, year = {2009}, month = {2009///}, pages = {4015 - 4020}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {In this paper, we present the design of ViVA, a visual vocabulary for aphasia. Aphasia is an acquired language disorder that causes variability of impairments affecting individual{\textquoteright}s ability to speak, comprehend, read and write. Existing communication aids lack flexibility and adequate customization functionality failing to address this variability and to satisfy individual user needs. We tackle these shortcomings by incorporating adaptive and adaptable capabilities in ViVA which is designed to assist communication for users suffering from aphasia. The visual vocabulary for aphasia implements a novel approach that organizes the words in the vocabulary according to user preferences, word usage and certain semantic measures, thus continuously tailoring the tool to the user{\textquoteright}s profile.}, keywords = {adaptive and adaptable interfaces, assistive communication tools, multi-modal interfaces}, isbn = {978-1-60558-247-4}, doi = {10.1145/1520340.1520610}, url = {http://doi.acm.org/10.1145/1520340.1520610}, author = {Nikolova,Sonya and Jordan Boyd-Graber and Cook,Perry R.} } @article {18528, title = {Designing Enforceable Network Contracts}, volume = {GT-CS-09-02}, year = {2009}, month = {2009///}, institution = {School of Computer Science, Georgia Tech}, abstract = {Internet connectivity depends on contractual agreements between cooperating entities, such as administrative domains (AD), where an agreement over a certain level of service is made. Contracts (e.g., SLAs) for providing certain levels of service must be enforceable, and ADs must have an incentive to meet their contractual obligations. Previous work has designed mechanisms for both pricing and network accountability, but no existing work examines contract structures with respect to different accountability frameworks, and how together they may affect an AD{\textquoteright}s incentives to fulfill contracts. We study how different contract structures{\textemdash}in particular, path-based versus pairwise contracts{\textemdash}affect ADs{\textquoteright} incentives to establish contracts (which, in turn, can affect overall connectivity) and, once contracts are established, to forward traffic according accordingly. This paper presents several contributions. First, we derive sufficient conditions for path-based contract systems and accountability frameworks for entities to have an incentive to forward traffic according to their contracts, provided that all parties involved are rational. Second, we show that for path-based contracts at equilibrium where nodes are encouraged to fulfill their contracts, only a constant amount of monitoring is required for every participant to make a positive profit; this is not the case for pairwise contracts. Third, we show how systems that rely on pairwise contracts are prone to depeering in presence of sufficient supply and demand due to coarse granularity, a contractual failure that systems which rely on path-based contracts are immune to. We propose modifications to pairwise contracts that could prevent such failures. Finally, we present situations of depeering that may be unpreventable due to maliciously behaving parties for both pairwise and path-based contract structures. For such scenarios, we show that while path-based contracts allow the sender of traffic to get reimbursed, this is not guaranteed in pairwise contract systems.}, url = {http://hdl.handle.net/1853/30626}, author = {Lychev,R. and Feamster, Nick} } @conference {13916, title = {Designing the reading experience for scanned multi-lingual picture books on mobile phones}, booktitle = {Proceedings of the 9th ACM/IEEE-CS joint conference on Digital libraries}, year = {2009}, month = {2009///}, pages = {305 - 308}, author = {Bederson, Benjamin B. and Quinn,A. and Druin, Allison} } @article {12532, title = {Detecting humans carrying objects}, journal = {SPIE Newsroom}, year = {2009}, month = {2009///}, abstract = {Decomposing an image sequence into slices that generate twisted patterns sufficiently characterizes human gait and a particular class of activities.}, isbn = {18182259}, doi = {10.1117/2.1200902.1511}, url = {https://spie.org/x33692.xml?ArticleID=x33692}, author = {Yang Ran and Qinfen Zheng and Chellapa, Rama} } @conference {18562, title = {Detecting network neutrality violations with causal inference}, booktitle = {Proceedings of the 5th international conference on Emerging networking experiments and technologies}, series = {CoNEXT {\textquoteright}09}, year = {2009}, month = {2009///}, pages = {289 - 300}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {We present NANO, a system that detects when ISPs apply policies that discriminate against specific classes of applications, users, or destinations. Existing systems for detecting discrimination are typically specific to an application or to a particular discrimination mechanism and rely on active measurement tests. Unfortunately, ISPs can change discrimination policies and mechanisms, and they can evade these tests by giving probe traffic higher priority. NANO detects ISP discrimination by passively collecting performance data from clients. To distinguish discrimination from other causes of degradation (e.g., overload, misconfiguration, failure), NANO establishes a causal relationship between an ISP and observed performance by adjusting for confounding factors. NANO agents deployed at participating clients across the Internet collect performance data for selected services and report this information to centralized servers, which analyze the measurements to establish causal relationship between an ISP and performance degradations. We have implemented NANO and deployed clients in a controlled environment on Emulab. We run a combination of controlled experiments on Emulab and wide-area experiments on PlanetLab that show that NANO can determine the extent and criteria for discrimination for a variety of discrimination policies and applications.}, keywords = {causal inference, network neutrality}, isbn = {978-1-60558-636-6}, doi = {10.1145/1658939.1658972}, url = {http://doi.acm.org/10.1145/1658939.1658972}, author = {Bin Tariq,Mukarram and Motiwala,Murtaza and Feamster, Nick and Ammar,Mostafa} } @conference {18563, title = {Detecting spammers with SNARE: spatio-temporal network-level automatic reputation engine}, booktitle = {Proceedings of the 18th conference on USENIX security symposium}, series = {SSYM{\textquoteright}09}, year = {2009}, month = {2009///}, pages = {101 - 118}, publisher = {USENIX Association}, organization = {USENIX Association}, address = {Berkeley, CA, USA}, abstract = {Users and network administrators need ways to filter email messages based primarily on the reputation of the sender. Unfortunately, conventional mechanisms for sender reputation--notably, IP blacklists--are cumbersome to maintain and evadable. This paper investigates ways to infer the reputation of an email sender based solely on network-level features, without looking at the contents of a message. First, we study first-order properties of network-level features that may help distinguish spammers from legitimate senders. We examine features that can be ascertained without ever looking at a packet{\textquoteright}s contents, such as the distance in IP space to other email senders or the geographic distance between sender and receiver. We derive features that are lightweight, since they do not require seeing a large amount of email from a single IP address and can be gleaned without looking at an email{\textquoteright}s contents--many such features are apparent from even a single packet. Second, we incorporate these features into a classification algorithm and evaluate the classifier{\textquoteright}s ability to automatically classify email senders as spammers or legitimate senders. We build an automated reputation engine, SNARE, based on these features using labeled data from a deployed commercial spam-filtering system. We demonstrate that SNARE can achieve comparable accuracy to existing static IP blacklists: about a 70\%detection rate for less than a 0.3\%false positive rate. Third, we show how SNARE can be integrated into existing blacklists, essentially as a first-pass filter.}, url = {http://dl.acm.org/citation.cfm?id=1855768.1855775}, author = {Hao,Shuang and Syed,Nadeem Ahmed and Feamster, Nick and Gray,Alexander G. and Krasser,Sven} } @article {12883, title = {Detection of toxigenic Vibrio cholerae O1 in freshwater lakes of the former Soviet Republic of Georgia}, journal = {Environmental Microbiology Reports}, volume = {2}, year = {2009}, month = {2009/09/03/}, pages = {2 - 6}, abstract = {Three freshwater lakes, Lisi Lake, Kumisi Lake and Tbilisi Sea, near Tbilisi, Georgia, were studied from January 2006 to December 2007 to determine the presence of Vibrio cholerae employing both bacteriological culture method and direct detection methods, namely PCR and direct fluorescent antibody (DFA). For PCR, DNA extracted from water samples was tested for presence of V. cholerae and genes coding for selected virulence factors. Vibrio cholerae non-O1/non-O139 was routinely isolated by culture from all three lakes; whereas V. cholerae O1 and O139 were not. Water samples collected during the summer months from Lisi Lake and Kumisi Lake were positive for both V. cholerae and V. cholerae ctxA, tcpA, zot, ompU and toxR by PCR. Water samples collected during the same period from both Lisi and Kumisi Lake were also positive for V. cholerae serogroup O1 by DFA. All of the samples were negative for V. cholerae serotype O139. The results of this study provide evidence for an environmental presence of toxigenic V. cholerae O1, which may represent a potential source of illness as these lakes serve as recreational water in Tbilisi, Georgia.}, isbn = {1758-2229}, doi = {10.1111/j.1758-2229.2009.00073.x}, url = {http://onlinelibrary.wiley.com/doi/10.1111/j.1758-2229.2009.00073.x/abstract?userIsAuthenticated=false\&deniedAccessCustomisedMessage=}, author = {Grim,Christopher J. and Jaiani,Ekaterina and Whitehouse,Chris A. and Janelidze,Nino and Kokashvili,Tamuna and Tediashvili,Marina and Rita R Colwell and Huq,Anwar} } @article {12891, title = {Determination of relationships among non-toxigenic Vibrio cholerae O1 biotype El Tor strains from housekeeping gene sequences and ribotype patterns}, journal = {Research in Microbiology}, volume = {160}, year = {2009}, month = {2009/01//}, pages = {57 - 62}, abstract = {Sequencing of three housekeeping genes, mdh, dnaE and recA, and ribotyping for seven non-toxigenic Vibrio cholerae O1 strains isolated from different geographic sources indicate a phylogenetic relationship among the strains. Results of MLST and ribotyping indicate a clear difference between three toxigenic strains (N16961, O395, and 569B) and three non-toxigenic strains from India (GS1, GS2, and GW87) and one Guam strain (X392), the latter of which were similar in both MLST and ribotyping, while two other non-toxigenic strains from the USA and India (2740-80 and OR69) appeared to be more closely related to toxigenic strains than to non-toxigenic strains, although this was not supported by ribotyping. These results provide clues to the emergence of toxigenic strains from a non-toxigenic progenitor by acquisition of virulence gene clusters. Results of split decomposition analysis suggest that widespread recombination occurs among the three housekeeping genes and that recombination plays an important role in the emergence of toxigenic strains of V. cholerae O1.}, keywords = {Housekeeping genes, Ribotyping, sequencing, Vibrio cholerae}, isbn = {0923-2508}, doi = {10.1016/j.resmic.2008.10.008}, url = {http://www.sciencedirect.com/science/article/pii/S0923250808001794}, author = {Mohapatra,Saswat S. and Ramachandran,Dhanya and Mantri,Chinmay K. and Rita R Colwell and Singh,Durg V.} } @article {18519, title = {Determining the causes of intradomain routing changes}, year = {2009}, month = {2009///}, institution = {University Pierre and Marie Curie}, abstract = {This paper studies how intradomain routinginstability relates to events in network trouble tickets for two networks: a VPN provider and the Internet2 backbone network. Our goal in performing this joint analysis of routing and trouble tickets is to better understand the likely underlying causes of intradomain routing instability. We develop a method to correlate trouble tickets with instability events and find that, although unplanned events last longer than scheduled maintenance, there is no single underlying cause for most instability, and that these causes differ across networks. In comparison to a similar study from Labovitz et al. from ten years ago, we find that, while certain causes of instability such as maintenance and circuit problems remain significant, power issues have become much less prevalent, and software-related problems have become more common. }, author = {Medem,A. and Teixeira,R. and Feamster, Nick and Meulle,M.} } @article {13287, title = {Diamond Hierarchies of Arbitrary Dimension}, journal = {Computer Graphics Forum}, volume = {28}, year = {2009}, month = {2009/08/31/}, pages = {1289 - 1300}, abstract = {Nested simplicial meshes generated by the simplicial bisection decomposition proposed by Maubach [Mau95] have been widely used in 2D and 3D as multi-resolution models of terrains and three-dimensional scalar fields, They are an alternative to octree representation since they allow generating crack-free representations of the underlying field. On the other hand, this method generates conforming meshes only when all simplices sharing the bisection edge are subdivided concurrently. Thus, efficient representations have been proposed in 2D and 3D based on a clustering of the simplices sharing a common longest edge in what is called a diamond. These representations exploit the regularity of the vertex distribution and the diamond structure to yield an implicit encoding of the hierarchical and geometric relationships among the triangles and tetrahedra, respectively. Here, we analyze properties of d-dimensional diamonds to better understand the hierarchical and geometric relationships among the simplices generated by Maubach{\textquoteright}s bisection scheme and derive closed-form equations for the number of vertices, simplices, parents and children of each type of diamond. We exploit these properties to yield an implicit pointerless representation for d-dimensional diamonds and reduce the number of required neighbor-finding accesses from O(d!) to O(d).}, keywords = {I.3.5 [Computer Graphics]: Computational Geometry and Object Modeling{\textemdash}Hierarchy and geometric transformations, I.3.6 [Computer Graphics]: Methodology and Techniques{\textemdash}Graphics data structures and data types}, isbn = {1467-8659}, doi = {10.1111/j.1467-8659.2009.01506.x}, url = {http://onlinelibrary.wiley.com/doi/10.1111/j.1467-8659.2009.01506.x/abstract?userIsAuthenticated=false\&deniedAccessCustomisedMessage=}, author = {Weiss,Kenneth and De Floriani, Leila} } @article {18196, title = {Digital forensics [From the Guest Editors]}, journal = {Signal Processing Magazine, IEEE}, volume = {26}, year = {2009}, month = {2009/03//}, pages = {14 - 15}, abstract = {This special issue provides a comprehensive overview of recent developments and open problems in digital forensics that are amenable to signal processing techniques.}, isbn = {1053-5888}, doi = {10.1109/MSP.2008.931089}, author = {Delp,E. and Memon, N. and Wu,M.} } @article {13259, title = {A dimension-independent library for building and manipulating multiresolution triangulations}, volume = {DISI-TR-99-03}, year = {2009}, month = {2009///}, institution = {Department of Computer Science and Information Science, University of Genoa}, abstract = {A Multi-Triangulation (MT) is a general multiresolution model for representing k-dimensional geometricobjects through simplicial complexes. An MT integrates several alternative representations of an object, and provides simple methods for handling representations at variable resolution efficiently , thus offering a basis for the development of applications that need to manage the level-of-detail of complex objects. In this paper, we present an object-oriented library that provides an open-ended tool for building and manipulating object representations based on the MT. }, author = {De Floriani, Leila and Magillo,P. and Puppo,E.} } @conference {14677, title = {Directing JavaScript with arrows}, booktitle = {Proceedings of the 5th symposium on Dynamic languages}, series = {DLS {\textquoteright}09}, year = {2009}, month = {2009///}, pages = {49 - 58}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {JavaScript programmers make extensive use of event-driven programming to help build responsive web applications. However, standard approaches to sequencing events are messy, and often lead to code that is difficult to understand and maintain. We have found that arrows, a generalization of monads, are an elegant solution to this problem. Arrows allow us to easily write asynchronous programs in small, modular units of code, and flexibly compose them in many different ways, while nicely abstracting the details of asynchronous program composition. In this paper, we present Arrowlets, a new JavaScript library that offers arrows to the everyday JavaScript programmer. We show how to use Arrowlets to construct a variety of state machines, including state machines that branch and loop. We also demonstrate how Arrowlets separate computation from composition with examples such as a drag-and-drop handler and a bubblesort animation.}, keywords = {arrowlets, arrows, events, javascript, web programming}, isbn = {978-1-60558-769-1}, doi = {10.1145/1640134.1640143}, url = {http://doi.acm.org/10.1145/1640134.1640143}, author = {Khoo,Yit Phang and Hicks, Michael W. and Foster, Jeffrey S. and Sazawal,Vibha} } @article {13291, title = {Discrete distortion for surface meshes}, journal = {Image Analysis and Processing{\textendash}ICIAP 2009}, year = {2009}, month = {2009///}, pages = {652 - 661}, abstract = {Discrete distortion for two- and three-dimensional combinatorial manifolds is a discrete alternative to Ricci curvature known for differentiable manifolds. Here, we show that distortion can be successfully used to estimate mean curvature at any point of a surface. We compare our approach with the continuous case and with a common discrete approximation of mean curvature, which depends on the area of the star of each vertex in the triangulated surface. This provides a new, area-independent, tool for curvature estimation and for morphological shape analysis. We illustrate our approach through experimental results showing the behavior of discrete distortion.}, doi = {10.1007/978-3-642-04146-4_70}, author = {Mesmoudi,M. and De Floriani, Leila and Magillo,P.} } @conference {16829, title = {Distance Oracles for Spatial Networks}, booktitle = {Data Engineering, 2009. ICDE {\textquoteright}09. IEEE 25th International Conference on}, year = {2009}, month = {2009/04/29/2}, pages = {652 - 663}, abstract = {The popularity of location-based services and the need to do real-time processing on them has led to an interest in performing queries on transportation networks, such as finding shortest paths and finding nearest neighbors. The challenge is that these operations involve the computation of distance along a spatial network rather than "as the crow flies." In many applications an estimate of the distance is sufficient, which can be achieved by use of an oracle. An approximate distance oracle is proposed for spatial networks that exploits the coherence between the spatial position of vertices and the network distance between them. Using this observation, a distance oracle is introduced that is able to obtain the epsiv-approximate network distance between two vertices of the spatial network. The network distance between every pair of vertices in the spatial network is efficiently represented by adapting the well-separated pair technique to spatial networks. Initially, use is made of an epsilon-approximate distance oracle of size O(n/epsivd) that is capable of retrieving the approximate network distance in O(log n) time using a B-tree. The retrieval time can be theoretically reduced further to O(1) time by proposing another epsiv-approximate distance oracle of size O(n log n/epsivd) that uses a hash table. Experimental results indicate that the proposed technique is scalable and can be applied to sufficiently large road networks. A 10\%-approximate oracle (epsiv = 0.1) on a large network yielded an average error of 0.9\% with 90\% of the answers making an error of 2\% or less and an average retrieval timeof 68 mu seconds. Finally, a strategy for the integration of the distance oracle into any relational database system as well as using it to perform a variety of spatial queries such as region search, k-nearest neighbor search, and spatial joins on spatial networks is discussed.}, keywords = {B-tree;distance, data, database, databases;tree, distance;hash, languages;query, neighbor, network, network;transportation, networks;spatial, networks;well-separated, oracles;epsiv-approximate, pair, processing;region, processing;relational, search;location-based, search;relational, services;real-time, structures;, system;road, table;k-nearest, technique;programming}, doi = {10.1109/ICDE.2009.53}, author = {Sankaranarayanan,J. and Samet, Hanan} } @article {14472, title = {Distinguishing knowledge vs social capital in social media with roles and context}, journal = {Proceedings of the ICWSM}, volume = {9}, year = {2009}, month = {2009///}, abstract = {Social media communities (e.g. Wikipedia, Flickr, Live Q\&A) give rise to distinct types of content, foremost among which are relational content (discussion, chat) and factual content (answering questions, problem-solving). Both users and researchers are increasingly interested in developing strategies that can rapidly distinguish these types of content. While many text-based and structural strategies are possible, we extend two bodies of research that show how social context, and the social roles of answerers can predict content type. We test our framework on a dataset of manually labeled contributions to Microsoft{\textquoteright}s Live Q\&A and find that it reliably extracts factual and relational messages from the data.}, author = {Barash,V. and Smith,M. and Getoor, Lise and Welser,H. T} } @article {16642, title = {A distributed learning algorithm for particle systems}, journal = {Integrated Computer-Aided Engineering}, volume = {16}, year = {2009}, month = {2009///}, pages = {1 - 20}, author = {Rodr{\'\i}guez,A. and Reggia, James A.} } @conference {17585, title = {Distributed Strategies for Channel Allocation and Scheduling in Software-Defined Radio Networks}, booktitle = {IEEE INFOCOM 2009}, year = {2009}, month = {2009/04/19/25}, pages = {1521 - 1529}, publisher = {IEEE}, organization = {IEEE}, abstract = {Equipping wireless nodes with multiple radios can significantly increase the capacity of wireless networks, by making these radios simultaneously transmit over multiple non-overlapping channels. However, due to the limited number of radios and available orthogonal channels, designing efficient channel assignment and scheduling algorithms in such networks is a major challenge. In this paper, we present provably-good distributed algorithms for simultaneous channel allocation of individual links and packet-scheduling, in software-defined radio (SDR) wireless networks. Our distributed algorithms are very simple to implement, and do not require any coordination even among neighboring nodes. A novel access hash function or random oracle methodology is one of the key drivers of our results. With this access hash function, each radio can know the transmitters{\textquoteright} decisions for links in its interference set for each time slot without introducing any extra communication overhead between them. Further, by utilizing the inductive-scheduling technique, each radio can also backoff appropriately to avoid collisions. Extensive simulations demonstrate that our bounds are valid in practice.}, keywords = {access hash function, Channel allocation, channel assignment algorithm, channel capacity, collision avoidance, Computer science, cryptography, distributed algorithm, distributed algorithms, Educational institutions, inductive-scheduling technique, Interference, interference set, packet scheduling algorithm, Peer to peer computing, Radio network, radio networks, radiofrequency interference, random oracle methodology, scheduling, Scheduling algorithm, simultaneous channel allocation, software radio, software-defined radio wireless network capacity, telecommunication congestion control, telecommunication security, Throughput, wireless channels, Wireless networks}, isbn = {978-1-4244-3512-8}, doi = {10.1109/INFCOM.2009.5062069}, author = {Han,Bo and Kumar,V. S.A and Marathe,M. V and Parthasarathy,S. and Srinivasan, Aravind} } @article {12890, title = {Diversity and Seasonality of Bioluminescent Vibrio Cholerae Populations in Chesapeake Bay}, journal = {Applied and Environmental MicrobiologyAppl. Environ. Microbiol.}, volume = {75}, year = {2009}, month = {2009/01/01/}, pages = {135 - 146}, abstract = {Association of luminescence with phenotypic and genotypic traits and with environmental parameters was determined for 278 strains of Vibrio cholerae isolated from the Chesapeake Bay during 1998 to 2000. Three clusters of luminescent strains (A, B, and C) and two nonluminescent clusters (X and Y) were identified among 180 clonal types. V. cholerae O1 strains isolated during pandemics and endemic cholera in the Ganges Delta were related to cluster Y. Heat-stable enterotoxin (encoded by stn) and the membrane protein associated with bile resistance (encoded by ompU) were found to be linked to luminescence in strains of cluster A. Succession from nonluminescent to luminescent populations of V. cholerae occurred during spring to midsummer. Occurrence of cluster A strains in water with neutral pH was contrasted with that of cluster Y strains in water with a pH of >8. Cluster A was found to be associated with a specific calanoid population cooccurring with cyclopoids. Cluster B was related to cluster Y, with its maximal prevalence at pH 8. Occurrence of cluster B strains was more frequent with warmer water temperatures and negatively correlated with maturity of the copepod community. It is concluded that each cluster of luminescent V. cholerae strains occupies a distinct ecological niche. Since the dynamics of these niche-specific subpopulations are associated with zooplankton community composition, the ecology of luminescent V. cholerae is concluded to be related to its interaction with copepods and related crustacean species.}, isbn = {0099-2240, 1098-5336}, doi = {10.1128/AEM.02894-07}, url = {http://aem.asm.org/content/75/1/135}, author = {Zo,Young-Gun and Chokesajjawatee,Nipa and Grim,Christopher and Arakawa,Eiji and Watanabe,Haruo and Rita R Colwell} } @article {17095, title = {Do you know the way to SNA?: A process model for analyzing and visualizing social media data}, journal = {University of Maryland Tech Report: HCIL-2009-17}, year = {2009}, month = {2009///}, abstract = {Traces of activity left by social media users can shed lighton individual behavior, social relationships, and community efficacy. Tools and processes to analyze social traces are essential for enabling practitioners to study and nurture meaningful and sustainable social interaction. Yet such tools and processes remain in their infancy. We conducted a study of 15 graduate students who were learning to apply Social Network Analysis (SNA) to data from online communities. Based on close observations of their emergent practices, we derived the Network Analysis and Visualization (NAV) process model and identified stages where intervention from peers, experts, and an SNA tool were most useful. We show how the NAV model informs the design of SNA tools and services, education practices, and support for social media practitioners. }, author = {Hansen,D. L and Rotman,D. and Bonsignore,E. and Milic-Frayling,N. and Rodrigues,E.M. and Smith,M. and Shneiderman, Ben} } @conference {19597, title = {Dynamic Provable Data Possession}, booktitle = {CCS {\textquoteright}09 Proceedings of the 16th ACM Conference on Computer and Communications Security }, series = {CCS {\textquoteright}09}, year = {2009}, month = {2009///}, pages = {213 - 222}, publisher = {ACM}, organization = {ACM}, abstract = {We consider the problem of efficiently proving the integrity of data stored at untrusted servers. In the provable data possession (PDP) model, the client preprocesses the data and then sends it to an untrusted server for storage, while keeping a small amount of meta-data. The client later asks the server to prove that the stored data has not been tampered with or deleted (without downloading the actual data). However, the original PDP scheme applies only to static (or append-only) files. We present a definitional framework and efficient constructions for dynamic provable data possession (DPDP), which extends the PDP model to support provable updates to stored data. We use a new version of authenticated dictionaries based on rank information. The price of dynamic updates is a performance change from O(1) to O(logn) (or O(nεlog n), for a file consisting of n blocks, while maintaining the same (or better, respectively) probability of misbehavior detection. Our experiments show that this slowdown is very low in practice (e.g. 415KB proof size and 30ms computational overhead for a 1GB file). We also show how to apply our DPDP scheme to outsourced file systems and version control systems (e.g. CVS).}, keywords = {authenticated data structures, Authentication, integrity checking, outsourced storage, proof of retrievability, provable data possession, skip list}, isbn = {978-1-60558-894-0}, url = {http://doi.acm.org/10.1145/1653662.1653688}, author = {Erway, Chris and K{\"u}p\cc{\"u}, Alptekin and Charalampos Papamanthou and Tamassia, Roberto} } @conference {14684, title = {Dynamic software updates: a VM-centric approach}, booktitle = {Proceedings of the 2009 ACM SIGPLAN conference on Programming language design and implementation}, series = {PLDI {\textquoteright}09}, year = {2009}, month = {2009///}, pages = {1 - 12}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Software evolves to fix bugs and add features. Stopping and restarting programs to apply changes is inconvenient and often costly. Dynamic software updating (DSU) addresses this problem by updating programs while they execute, but existing DSU systems for managed languages do not support many updates that occur in practice and are inefficient. This paper presents the design and implementation of Jvolve, a DSU-enhanced Java VM. Updated programs may add, delete, and replace fields and methods anywhere within the class hierarchy. Jvolve implements these updates by adding to and coordinating VM classloading, just-in-time compilation, scheduling, return barriers, on-stack replacement, and garbage collection. Jvolve, is safe: its use of bytecode verification and VM thread synchronization ensures that an update will always produce type-correct executions. Jvolve is flexible: it can support 20 of 22 updates to three open-source programs--Jetty web server, JavaEmailServer, and CrossFTP server--based on actual releases occurring over 1 to 2 years. Jvolve is efficient: performance experiments show that incurs no overhead during steady-state execution. These results demonstrate that this work is a significant step towards practical support for dynamic updates in virtual machines for managed languages.}, keywords = {dynamic software updating, garbage collection, virtual machine technology}, isbn = {978-1-60558-392-1}, doi = {10.1145/1542476.1542478}, url = {http://doi.acm.org/10.1145/1542476.1542478}, author = {Subramanian,Suriya and Hicks, Michael W. and McKinley,Kathryn S.} } @article {14683, title = {Dynamic software updates for Java: A VM-centric approach}, journal = {Proceedings of the ACM Conference on Programming Language Design and Implementation (PLDI)}, year = {2009}, month = {2009///}, abstract = {Software evolves to fix bugs and add features, but stopping andrestarting existing programs to take advantage of these changes can be inconvenient and costly. Dynamic software updating (DSU) addresses these problems by updating programs while they run. The challenge is to develop DSU infrastructure that is flexible, safe, and efficient{\textemdash}DSU should enable updates that are likely to occur in practice, and updated programs should be as reliable and as efficient as those started from scratch. This paper presents the design and implementation of a JVM we call JVOLVE that is enhanced with DSU support. The pa- per{\textquoteright}s key insight is that flexible, safe, and efficient DSU can be supported by naturally extending existing VM services. By piggybacking on classloading and garbage collection, JVOLVE can flexibly support additions and replacements of fields and methods anywhere within the class hierarchy, and in a manner that may alter class signatures. By utilizing bytecode verifi- cation and thread synchronization support, JVOLVE can ensure that an applied update will never violate type-safety. Finally, by employing JIT compilation, all DSU-related overhead be- fore or after an update can be effectively eliminated. Using JVOLVE, we successfully applied dynamic continuous updates corresponding to 20 of the 22 releases that occurred over nearly two years{\textquoteright} time, one update per release, for three open-source programs, Jetty web server, JavaEmailServer, and CrossFTP server. Our results indicate that the VM is well-suited to sup- port practical DSU services. }, author = {Subramanian,S. and Hicks, Michael W. and McKinley,K.S.} } @conference {14489, title = {The Dynamics of Actor Loyalty to Groups in Affiliation Networks}, booktitle = {Social Network Analysis and Mining, 2009. ASONAM {\textquoteright}09. International Conference on Advances in}, year = {2009}, month = {2009/07//}, pages = {101 - 106}, abstract = {In this paper, we introduce a method for analyzing the temporal dynamics of affiliation networks. We define affiliation groups which describe temporally related subsets of actors and describe an approach for exploring changing memberships in these affiliation groups over time. To model the dynamic behavior in these networks, we consider the concept of loyalty and introduce a measure that captures an actorpsilas loyalty to an affiliation group as the degree of dasiacommitmentpsila an actor shows to the group over time. We evaluate our measure using two real world affiliation networks: a senate bill co-sponsorship network and a dolphin network. The results show how the behavior of actors in different affiliation groups change dynamically over time, reinforcing the utility of our measure for understanding the loyalty of actors to time-varying affiliation groups.}, keywords = {actor, bill, co-sponsorship, dynamics;social, groups;affiliation, loyalty;affiliation, network;senate, network;temporal, networks;dolphin, sciences;}, doi = {10.1109/ASONAM.2009.27}, author = {Sharara,H. and Singh,L. and Getoor, Lise and Mann,J.} } @article {18494, title = {Dynamics of online scam hosting infrastructure}, journal = {Passive and Active Network Measurement}, year = {2009}, month = {2009///}, pages = {219 - 228}, abstract = {This paper studies the dynamics of scam hosting infrastructure, with an emphasis on the role of fast-flux service networks. By monitoring changes in DNS records of over 350 distinct spam-advertised domains collected from URLs in 115,000 spam emails received at a large spam sinkhole, we measure the rates and locations of remapping DNS records, and the rates at which {\textquotedblleft}fresh{\textquotedblright} IP addresses are used. We find that, unlike the short-lived nature of the scams themselves, the infrastructure that hosts these scams has relatively persistent features that may ultimately assist detection.}, doi = {10.1007/978-3-642-00975-4_22}, author = {Konte,M. and Feamster, Nick and Jung,J.} } @article {16065, title = {Data Sonification for Users with Visual Impairment: A Case Study with Georeferenced Data}, journal = {ACM Trans. Comput.-Hum. Interact.}, volume = {15}, year = {2008}, month = {2008/05//}, pages = {4:1{\textendash}4:28 - 4:1{\textendash}4:28}, abstract = {We describe the development and evaluation of a tool, iSonic, to assist users with visual impairment in exploring georeferenced data using coordinated maps and tables, augmented with nontextual sounds and speech output. Our in-depth case studies with 7 blind users during 42 hours of data collection, showed that iSonic enabled them to find facts and discover trends in georeferenced data, even in unfamiliar geographical contexts, without special devices. Our design was guided by an Action-by-Design-Component (ADC) framework, which was also applied to scatterplots to demonstrate its generalizability. Video and download is available at www.cs.umd.edu/hcil/iSonic/.}, keywords = {auditory user interfaces, information seeking, Interactive sonification, universal usability, users with visual impairment}, isbn = {1073-0516}, doi = {10.1145/1352782.1352786}, url = {http://doi.acm.org/10.1145/1352782.1352786}, author = {Zhao,Haixia and Plaisant, Catherine and Shneiderman, Ben and Lazar,Jonathan} } @conference {13119, title = {Decentralized discovery of camera network topology}, booktitle = {Distributed Smart Cameras, 2008. ICDSC 2008. Second ACM/IEEE International Conference on}, year = {2008}, month = {2008/09//}, pages = {1 - 10}, abstract = {One of the primary uses of camera networks is the observation and tracking of objects within some domain. Substantial research has gone into tracking objects within single and multiple views. However, few such approaches scale to large numbers of sensors, and those that do require an understanding of the network topology. Camera network topology models camera adjacency in the context of tracking: when an object/entity leaves one camera, which cameras could it appear at next? This paper presents a decentralized approach for estimating a camera networkpsilas topology based on sequential Bayesian estimation using a modified multinomial distribution. Central to this method is an information-theoretic appearance model for observation weighting. The distributed nature of the approach utilizes all of the sensors as processing agents in collectively recovering the network topology. Experimental results are presented using camera networks varying in size from 10-100 nodes.}, keywords = {adjacency;camera, Bayesian, camera, discovery;modified, distribution;sequential, estimation;Bayes, methods;distributed, multinomial, network, sensors;, sensors;image, topology;decentralized}, doi = {10.1109/ICDSC.2008.4635696}, author = {Farrell,R. and Davis, Larry S.} } @conference {19584, title = {Deciding kCFA is Complete for EXPTIME}, booktitle = {ICFP {\textquoteright}08 Proceedings of the 13th ACM SIGPLAN International Conference on Functional Programming}, series = {ICFP {\textquoteright}08}, year = {2008}, month = {2008///}, pages = {275 - 282}, publisher = {ACM}, organization = {ACM}, abstract = {We give an exact characterization of the computational complexity of the kCFA hierarchy. For any k > 0, we prove that the control flow decision problem is complete for deterministic exponential time. This theorem validates empirical observations that such control flow analysis is intractable. It also provides more general insight into the complexity of abstract interpretation.}, keywords = {complexity, flow analysis}, isbn = {978-1-59593-919-7}, url = {http://doi.acm.org/10.1145/1411204.1411243}, author = {David Van Horn and Mairson, Harry G.} } @conference {18151, title = {A decision theoretic framework for analyzing binary hash-based content identification systems}, booktitle = {Proceedings of the 8th ACM workshop on Digital rights management}, series = {DRM {\textquoteright}08}, year = {2008}, month = {2008///}, pages = {67 - 76}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Content identification has many applications, ranging from preventing illegal sharing of copyrighted content on video sharing websites, to automatic identification and tagging of content. Several content identification techniques based on watermarking or robust hashes have been proposed in the literature, but they have mostly been evaluated through experiments. This paper analyzes binary hash-based content identification schemes under a decision theoretic framework and presents a lower bound on the length of the hash required to correctly identify multimedia content that may have undergone modifications. A practical scheme for content identification is evaluated under the proposed framework. The results obtained through experiments agree very well with the performance suggested by the theoretical analysis.}, keywords = {content fingerprinting, content identification, decision theory}, isbn = {978-1-60558-290-0}, doi = {10.1145/1456520.1456532}, url = {http://doi.acm.org/10.1145/1456520.1456532}, author = {Varna,Avinash L. and Swaminathan,Ashwin and M. Wu} } @inbook {19030, title = {Delegating Capabilities in Predicate Encryption Systems}, booktitle = {Automata, Languages and Programming}, series = {Lecture Notes in Computer Science}, volume = {5126}, year = {2008}, month = {2008}, pages = {560 - 578}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {In predicate encryption systems, given a capability, one can evaluate one or more predicates on the plaintext encrypted, while all other information about the plaintext remains hidden. We consider the role of delegation in such predicate encryption systems. Suppose Alice has a capability, and she wishes to delegate to Bob a more restrictive capability allowing the decryption of a subset of the information Alice can learn about the plaintext encrypted. We formally define delegation in predicate encryption systems, propose a new security definition for delegation, and give an efficient construction supporting conjunctive queries. The security of our construction can be reduced to the general 3-party Bilinear Diffie-Hellman assumption, and the Bilinear Decisional Diffie-Hellman assumption in composite order bilinear groups.}, keywords = {Computer science}, isbn = {978-3-540-70582-6}, url = {http://www.springerlink.com/content/w320422h15050004/abstract/}, author = {Elaine Shi and Waters,Brent}, editor = {Aceto,Luca and Damg{\r a}rd,Ivan and Goldberg,Leslie and Halld{\'o}rsson,Magn{\'u}s and Ing{\'o}lfsd{\'o}ttir,Anna and Walukiewicz,Igor} } @conference {18692, title = {The Deployment of a Darknet on an Organization-Wide Network: An Empirical Analysis}, year = {2008}, month = {2008/12//}, pages = {59 - 68}, abstract = {Darknet sensors have the interesting property of collecting only suspicious traffic, including misconfiguration, backscatter and malicious traffic. The type of traffic collected highly depends on two parameters: the size and the location of the darknet sensor. The goals of this paper are to study empirically the relationship between these two parameters and to try to increase the volume of attackers detected by a given darknet sensor. Our empirical results reveal that on average, on a daily basis, 485 distinct external source IP addresses perform a TCP scan on one of the two /16 networks of our organizationpsilas network. Moreover, a given darknet sensor of 77 IP addresses deployed in the same /16 network collects on average attack traffic from 26\% of these attackers.}, keywords = {attack traffic, backscatter, darknet sensors, external source IP address, malicious traffic, organization network, organization-wide network, TCP scan, telecommunication congestion control, transmission control protocol, Transport protocols}, doi = {10.1109/HASE.2008.54}, author = {Berthier,R. and Michel Cukier} } @article {15056, title = {Design and implementation of blackboard-based system for human detection}, journal = {Jisuanji Gongcheng/ Computer Engineering}, volume = {34}, year = {2008}, month = {2008///}, author = {Zhuolin Jiang and Li,S.F. and Gao,D.F.} } @article {17063, title = {Designing community-based emergency communication system: A preliminary study}, journal = {Proceedings of the American Society for Information Science and Technology}, volume = {45}, year = {2008}, month = {2008///}, pages = {1 - 3}, author = {Fei Wu,P. and Qu,Y. and Fleischmann,K. and Golbeck,J. and Jaeger,P. and Preece,J. and Shneiderman, Ben} } @article {18511, title = {Detecting botnet membership with dnsbl counterintelligence}, journal = {Botnet Detection}, year = {2008}, month = {2008///}, pages = {131 - 142}, doi = {DOI: 10.1007/978-0-387-68768-1_7}, author = {Ramachandran,A. and Feamster, Nick and Dagon,D.} } @article {12901, title = {Determination of Clonality and Relatedness of Vibrio Cholerae Isolates by Genomic Fingerprinting, Using Long-Range Repetitive Element Sequence-Based PCR}, journal = {Applied and Environmental MicrobiologyAppl. Environ. Microbiol.}, volume = {74}, year = {2008}, month = {2008/09/01/}, pages = {5392 - 5401}, abstract = {A high-throughput method which is applicable for rapid screening, identification, and delineation of isolates of Vibrio cholerae, sensitive to genome variation, and capable of providing phylogenetic inferences enhances environmental monitoring of this bacterium. We have developed and optimized a method for genomic fingerprinting of V. cholerae based on long-range PCR. The method uses a primer set directed to enterobacterial repetitive intergenic consensus sequences, a high-fidelity DNA polymerase, and analysis via conventional agarose gel electrophoresis. Long (\~{}10 kb), highly reproducible amplicons were generated from V. cholerae isolates, including those from different geographical locations and historical strains isolated during the period 1931-2000. The amplicons yielded reduced variability in their densitometric band patterns to <=10\% and clonal distinction at <90\% similarity. Rapid band-matching analysis was accomplished for fingerprints with >=90\% similarity, discriminating O serotypes and biotypes (classical versus El Tor) as well as pathogenic and nonpathogenic strains. Compared to genome similarity measured by DNA-DNA hybridization, the results showed good correlation (r = 0.7; P < 0.001), with five times less measurement error and without bias. The method permits both phylogenetic inference and clonal differentiation of individual V. cholerae strains, enables robust, high-throughput analysis, and does not require specialized equipment to perform. With access to a curated public database furnished with appropriate analytical software applications, the method should prove useful in large-scale multilaboratory surveys, especially those designed to detect specific pathogens in the natural environment.}, isbn = {0099-2240, 1098-5336}, doi = {10.1128/AEM.00151-08}, url = {http://aem.asm.org/content/74/17/5392}, author = {Chokesajjawatee,Nipa and Zo,Young-Gun and Rita R Colwell} } @article {18768, title = {Development of a multi-piece multi-gate mold for manufacturing a flapping wing drive-mechanism}, journal = {Transactions of North American Manufacturing Research Institution of SME}, volume = {36}, year = {2008}, month = {2008///}, abstract = {Successful realization a flapping wing microair vehicle (MAV) requires development of a light weight drive-mechanism that can convert the continuous rotary motion to oscillatory flapping motion. Molded compliant drive-mechanisms are an attractive design option because of manufacturing scalability and reduction in the number of parts. The unique characteristics of this mechanism require development of a complex multi-piece multi-gate mold design. This paper describes a systematic approach for determining the part shape and size, optimizing the mold pieces, and placing the gates on the multi-piece mold. The novel aspects of this work include (1) selecting non-critical shape features to optimize the mold design and (2) the use of sacrificial structural elements to reduce the impact of the weld lines on the structural performance. The mold developed using our approach was utilized to realize a working flapping wing MAV. }, url = {http://web.mit.edu/arvinda/www/NAMRI_2008_Draft.pdf}, author = {Ananthanarayanan,A. and Bejgerowski,W. and Mueller,D. and Gupta,S.K.} } @article {18197, title = {Digital image forensics via intrinsic fingerprints}, journal = {Information Forensics and Security, IEEE Transactions on}, volume = {3}, year = {2008}, month = {2008/03//}, pages = {101 - 117}, abstract = {Digital imaging has experienced tremendous growth in recent decades, and digital camera images have been used in a growing number of applications. With such increasing popularity and the availability of low-cost image editing software, the integrity of digital image content can no longer be taken for granted. This paper introduces a new methodology for the forensic analysis of digital camera images. The proposed method is based on the observation that many processing operations, both inside and outside acquisition devices, leave distinct intrinsic traces on digital images, and these intrinsic fingerprints can be identified and employed to verify the integrity of digital data. The intrinsic fingerprints of the various in-camera processing operations can be estimated through a detailed imaging model and its component analysis. Further processing applied to the camera captured image is modelled as a manipulation filter, for which a blind deconvolution technique is applied to obtain a linear time-invariant approximation and to estimate the intrinsic fingerprints associated with these postcamera operations. The absence of camera-imposed fingerprints from a test image indicates that the test image is not a camera output and is possibly generated by other image production processes. Any change or inconsistencies among the estimated camera-imposed fingerprints, or the presence of new types of fingerprints suggest that the image has undergone some kind of processing after the initial capture, such as tampering or steganographic embedding. Through analysis and extensive experimental studies, this paper demonstrates the effectiveness of the proposed framework for nonintrusive digital image forensics.}, keywords = {ACQUISITION, analysis;intrinsic, approximation;cameras;digital, camera, deconvolution;digital, devices;blind, fingerprints;time, forensics;forensic, identification;image, image, images;digital, invariant, photography;fingerprint, sensors;}, isbn = {1556-6013}, doi = {10.1109/TIFS.2007.916010}, author = {Swaminathan,A. and M. Wu and Liu,K. J.R} } @book {15197, title = {Digital Signatures}, year = {2008}, month = {2008///}, publisher = {Springer Verlag}, organization = {Springer Verlag}, author = {Yung,M. and Katz, Jonathan} } @article {14678, title = {Directing javascript with arrows (functional pearl)}, year = {2008}, month = {2008///}, abstract = {JavaScript, being a single-threaded language, makes extensive use of event-driven programming to enable responsive web applications. However, standard approaches to sequencing events are messy, and often lead to code that is difficult to understand and maintain. We have found that arrows, a generalization of monads, are an elegant solution to this problem. Arrows allow us to easily write asynchronous programs in small, modular units of code, and flexibly compose them in many different ways, while nicely abstracting the details of asynchronous program composition. In particular, we show how to use arrows to construct a variety of state machines, such as autoscrollers and drag-and-drop handlers.}, author = {Khoo,Y.P. and Hicks, Michael W. and Foster, Jeffrey S. and Sazawal,V.} } @article {17519, title = {Discarte: a disjunctive internet cartographer}, journal = {ACM SIGCOMM Computer Communication Review}, volume = {38}, year = {2008}, month = {2008///}, pages = {303 - 314}, author = {Sherwood,R. and Bender,A. and Spring, Neil} } @article {13292, title = {Discrete Distortion in Triangulated 3-Manifolds}, journal = {Computer Graphics Forum}, volume = {27}, year = {2008}, month = {2008/09/29/}, pages = {1333 - 1340}, abstract = {We introduce a novel notion, that we call discrete distortion, for a triangulated 3-manifold. Discrete distortion naturally generalizes the notion of concentrated curvature defined for triangulated surfaces and provides a powerful tool to understand the local geometry and topology of 3-manifolds. Discrete distortion can be viewed as a discrete approach to Ricci curvature for singular flat manifolds. We distinguish between two kinds of distortion, namely, vertex distortion, which is associated with the vertices of the tetrahedral mesh decomposing the 3-manifold, and bond distortion, which is associated with the edges of the tetrahedral mesh. We investigate properties of vertex and bond distortions. As an example, we visualize vertex distortion on manifold hypersurfaces in R4 defined by a scalar field on a 3D mesh. distance fields.}, keywords = {I.3.3 [Computer Graphics], I.3.5 [Computational Geometry and Object Modeling]}, isbn = {1467-8659}, doi = {10.1111/j.1467-8659.2008.01272.x}, url = {http://onlinelibrary.wiley.com/doi/10.1111/j.1467-8659.2008.01272.x/abstract?userIsAuthenticated=false\&deniedAccessCustomisedMessage=}, author = {Mesmoudi,Mohammed Mostefa and De Floriani, Leila and Port,Umberto} } @conference {18565, title = {Distinguishing persistent failures from transient losses}, booktitle = {Proceedings of the 2008 ACM CoNEXT Conference}, series = {CoNEXT {\textquoteright}08}, year = {2008}, month = {2008///}, pages = {50:1{\textendash}50:2 - 50:1{\textendash}50:2}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Network tomography is a promising technique to identify the location of of IP faults. The goal of tomography is to infer the status of network internal characteristics based on end-to-end observations. In particular, binary tomography identifies the set of failed links from end-to-end path meausrments. Upon detecting the failure of one or more of the monitored paths, a monitor sends its measurements to a central coordinator. The coordinator then runs the binary tomography algorithm, which takes as input the topology of the network and the status (i.e., up or down) of all monitored paths and finds the minimum set of links that explain the observations.}, isbn = {978-1-60558-210-8}, doi = {10.1145/1544012.1544062}, url = {http://doi.acm.org/10.1145/1544012.1544062}, author = {Cunha,{\'I}talo and Teixeira,Renata and Feamster, Nick and Diot,Christophe} } @article {19615, title = {Distortion lower bounds for line embeddings}, journal = {Information Processing Letters}, volume = {108}, year = {2008}, month = {2008/10/31/}, pages = {175 - 178}, abstract = {In this paper, we show how we can derive lower bounds and also compute the exact distortion for the line embeddings of some special metrics, especially trees and graphs with certain structure. Using linear programming to formulate a simpler version of the problem gives an interesting intuition and direction concerning the computation of general lower bounds for distortion into the line. We also show that our lower bounds on special cases of metrics are a lot better than previous lower bounds.}, keywords = {combinatorial problems, Theory of computation}, isbn = {0020-0190}, url = {http://www.sciencedirect.com/science/article/pii/S0020019008001464}, author = {Mathieu, Claire and Charalampos Papamanthou} } @conference {13550, title = {Document Zone Classification Using Partial Least Squares and Hybrid Classifiers}, booktitle = {ICPR 2008. 19th International Conference on Pattern Recognition, 2008.}, year = {2008}, month = {2008///}, pages = {1 - 4}, abstract = {This paper introduces a novel document-zone classification algorithm. Low level image features are first extracted from document zones and partial least squares is used on pairs of classes to compute discriminating pairwise features. Rather than using the popular one-against-all and one-against-one voting schemes, we introduce a novel hybrid method which combines the benefits of the two schemes. The algorithm is applied on the University of Washington dataset and 97.3\% classification accuracy is obtained.}, author = {Abd-Almageed, Wael and Agrawal,Mudit and Seo,W. and David Doermann} } @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} } @article {12904, title = {Dual role colonization factors connecting Vibrio cholerae{\textquoteright}s lifestyles in human and aquatic environments open new perspectives for combating infectious diseases}, journal = {Current Opinion in Biotechnology}, volume = {19}, year = {2008}, month = {2008/06//}, pages = {254 - 259}, abstract = {Vibrio cholerae exhibits two distinctive lifestyles, one inside the milieu of the human intestine and the other in the aquatic environment. Recently, the existence of V. cholerae ligands involved in colonization of both human intestine and environmental chitin surfaces via the same binding specificity has been shown. Such molecules, here named {\textquoteleft}dual role colonization factors (DRCFs){\textquoteright}, are example of a tight connection between the two V. cholerae{\textquoteright}s lifestyles. It is suggested that DRCFs and, more generally, bacterial factors and pathways having roles in pathogenesis and in the out of the human body life may be promising targets for development of novel prophylactic or therapeutic interventions that may also affect V. cholerae fitness in its environmental reservoirs.}, isbn = {0958-1669}, doi = {10.1016/j.copbio.2008.04.002}, url = {http://www.sciencedirect.com/science/article/pii/S0958166908000426}, author = {Vezzulli,Luigi and Guzm{\'a}n,Carlos A and Rita R Colwell and Pruzzo,Carla} } @article {14681, title = {Dynamic Rebinding for Marshalling and Update, Via Redex-Time and Destruct-Time Reduction}, journal = {Journal of Functional Programming}, volume = {18}, year = {2008}, month = {2008///}, pages = {437 - 502}, abstract = {Most programming languages adopt static binding, but for distributed programming an exclusive reliance on static binding is too restrictive: dynamic binding is required in various guises, for example, when a marshalled value is received from the network, containing identifiers that must be rebound to local resources. Typically, it is provided only by ad hoc mechanisms that lack clean semantics. In this paper, we adopt a foundational approach, developing core dynamic rebinding mechanisms as extensions to the simply typed call-by-value λ calculus. To do so, we must first explore refinements of the call-by-value reduction strategy that delay instantiation, to ensure computations make use of the most recent versions of rebound definitions. We introduce redex-time and destruct-time strategies. The latter forms the basis for a λmarsh calculus that supports dynamic rebinding of marshalled values, while remaining as far as possible statically typed. We sketch an extension of λmarsh with concurrency and communication, giving examples showing how wrappers for encapsulating untrusted code can be expressed. Finally, we show that a high-level semantics for dynamic updating can also be based on the destruct-time strategy, defining a λupdate calculus with simple primitives to provide type-safe updating of running code. We show how the ideas of this simple calculus extend to more real-world, module-level dynamic updating in the style of Erlang. We thereby establish primitives and a common semantic foundation for a variety of real-world dynamic rebinding requirements.}, doi = {10.1017/S0956796807006600}, author = {Sewell,Peter and Stoyle,Gareth and Hicks, Michael W. and Bierman,Gavin and Wansbrough,Keith} } @article {18518, title = {A Dynamic Reputation Service for Spotting Spammers}, volume = {GT-CS-08-09}, year = {2008}, month = {2008///}, institution = {School of Computer Science, Georgia Tech}, abstract = {This paper presents the design, implementation, evalu-ation, and initial deployment of SpamSpotter, the first open, large-scale, real-time reputation system for filtering spam. Existing blacklists (e.g., SpamHaus) have trouble keeping pace with spammers{\textquoteright} increasing ability to send spam from {\textquotedblleft}fresh{\textquotedblright} IP addresses, and filters based purely on content are easily evadable. In contrast, SpamSpotter dynamically classifies email senders in real time based on their global sending behavior, rather than based on ephemeral features such as an IP address or the content of the message. In implementing SpamSpotter, we address significant challenges involving both dynamism (i.e., de- termining when to {\textquotedblleft}retrain{\textquotedblright} our dynamic classification algorithms) and scale (i.e., maintaining fast, accurate per- formance in the face of tremendous email message vol- ume). We have evaluated the performance and accuracy of SpamSpotter using traces from a large email-hosting provider and a spam appliance vendor that receives 300 million messages a day. Our evaluation shows that SpamSpotter is scalable, fast, and accurate. SpamSpotter is also operational today: it will currently answer queries from existing spam filtering software (e.g., SpamAssas- sin) with only minor configuration changes. }, author = {Ramachandran,A. and Hao,S. and Khandelwal,H. and Feamster, Nick and Vempala,S.} } @article {18205, title = {Dynamic Resource Allocation for Robust Distributed Multi-Point Video Conferencing}, journal = {Multimedia, IEEE Transactions on}, volume = {10}, year = {2008}, month = {2008/08//}, pages = {910 - 925}, abstract = {This paper proposes a distributed multi-point video conferencing system over packet erasure channels, where the aggregation of multiple video streams and resource allocation are performed in a distributed manner. Video stream combiners, which are located in different geographical areas and serve as portals for conferees, aggregate incoming streams supplied by local users with other streams aggregated from nearby video stream combiners. A packet-division multiple-access (PDMA)-based error protection scheme is proposed to be performed at each video stream combiner to minimize the maximal expected video distortion among aggregated streams. The proposed error protection scheme for multi-stream aggregation also supports user preference. In order to deliver video streams to end users with different preferred quality, a consensus algorithm is proposed to adaptively perform resource allocation based on user preference. Simulation results show that the proposed multi-stream aggregation and error protection scheme has significant gains over traditional multi-stream error protection schemes for a multi-point video conferencing system.}, keywords = {allocation;error, channels;packet-division, communication;, conferencing, conferencing;multi-access, distributed, dynamic, erasure, error, multiple-access-based, multipoint, Protection, resource, scheme;multi-point, scheme;robust, schemes;packet, streams;multistream, system;multiple, systems;teleconferencing;video, video}, isbn = {1520-9210}, doi = {10.1109/TMM.2008.922846}, author = {Chen,Meng and Su,Guan-Ming and M. Wu} } @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 {13430, title = {Data Clustering with a Relational Push-Pull Model}, booktitle = {Data Mining Workshops, 2007. ICDM Workshops 2007. Seventh IEEE International Conference on}, year = {2007}, month = {2007/10//}, pages = {189 - 194}, publisher = {IEEE}, organization = {IEEE}, abstract = {We present a new generative model for relational data in which relations between objects can have ei- ther a binding or a separating effect. For example, in a group of students separated into gender clusters, a "dating" relation would appear most frequently between the clusters, but a "roommate" relation would appear more often within clusters. In visualizing these rela- tions, one can imagine that the "dating" relation effec- tively pushes clusters apart, while the "roommate" re- lation pulls clusters into tighter formations. A unique aspect of the model is that an edge{\textquoteright}s existence is depen- dent on both the clusters to which the two connected objects belong and the features of the connected objects. We use simulated annealing to search for optimal val- ues of the unknown model parameters, where the ob- jective function is a Bayesian score derived from the generative model. Results describing the performance of the model are shown with artificial data as well as a subset of the Internet Movie Database. The results show that discovering a relation{\textquoteright}s tendency to either push or pull is critical to discovering a consistent clustering.}, isbn = {0-7695-3033-8, 978-0-7695-3019-2}, doi = {10.1109/ICDMW.2007.61}, url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4476666\&tag=1}, author = {Anthony,Adam and desJardins, Marie} } @article {13361, title = {Data Management in the Worldwide Sensor Web}, journal = {IEEE Pervasive Computing}, volume = {6}, year = {2007}, month = {2007///}, pages = {30 - 40}, abstract = {Advances in hardware and miniaturization technologies have led to a rapid increase in the number of large-scale sensor network deployments around the world, bringing us closer to the vision of a worldwide sensor web. Exploiting the sensor web to its full potential, however, raises several hard data management challenges. Addressing these challenges requires a concerted multidisciplinary effort encompassing many computer science fields. This article outlines some of the key data management challenges of a worldwide sensor web. It also presents recent advances in data management research that aim to address these challenges. Hopefully, the scientific, ubiquitous computing, and sensor network communities will adopt some of these solutions for managing their data. The article also attempts to bring many of the remaining open issues to the attention of the database community. This article is part of a special issue on Building a Sensor-Rich World.}, keywords = {data modeling, data streams, data uncertainty, distributed systems, interoperability, sensor networks}, isbn = {1536-1268}, author = {Balazinska,Magdalena and Deshpande, Amol and Franklin,Michael J. and Gibbons,Phillip B. and Gray,Jim and Hansen,Mark and Liebhold,Michael and Nath,Suman and Szalay,Alexander and Tao,Vincent} } @article {12326, title = {Dataflow-based mapping of computer vision algorithms onto FPGAs}, journal = {EURASIP Journal on Embedded Systems}, volume = {2007}, year = {2007}, month = {2007///}, pages = {29 - 29}, author = {Sen,M. and Corretjer,I. and Haim,F. and Saha,S. and Schlessman,J. and Lv,T. and Bhattacharyya, Shuvra S. and Wolf,W.} } @conference {15308, title = {Deconstructing nuggets: the stability and reliability of complex question answering evaluation}, booktitle = {Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval}, series = {SIGIR {\textquoteright}07}, year = {2007}, month = {2007///}, pages = {327 - 334}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {A methodology based on "information nuggets" has recently emerged as the de facto standard by which answers to complex questions are evaluated. After several implementations in the TREC question answering tracks, the community has gained a better understanding of its many characteristics. This paper focuses on one particular aspect of the evaluation: the human assignment of nuggets to answer strings, which serves as the basis of the F-score computation. As a byproduct of the TREC 2006 ciQA task, identical answer strings were independently evaluated twice, which allowed us to assess the consistency of human judgments. Based on these results, we explored simulations of assessor behavior that provide a method to quantify scoring variations. Understanding these variations in turn lets researchers be more confident in their comparisons of systems.}, keywords = {complex information needs, human judgments, trec}, isbn = {978-1-59593-597-7}, doi = {10.1145/1277741.1277799}, url = {http://doi.acm.org/10.1145/1277741.1277799}, author = {Jimmy Lin and Zhang,Pengyi} } @inbook {15506, title = {Deductive Databases}, booktitle = {Wiley Encyclopedia of Computer Science and EngineeringWiley Encyclopedia of Computer Science and Engineering}, year = {2007}, month = {2007/12/14/}, publisher = {John Wiley \& Sons, Inc.}, organization = {John Wiley \& Sons, Inc.}, keywords = {answer set semantics, Datalog, deductive database, disjunctive database, extended database}, isbn = {9780470050118}, url = {http://onlinelibrary.wiley.com/doi/10.1002/9780470050118.ecse105/abstract}, author = {Grant,John and Minker, Jack} } @conference {14675, title = {Defeating script injection attacks with browser-enforced embedded policies}, booktitle = {Proceedings of the 16th international conference on World Wide Web}, series = {WWW {\textquoteright}07}, year = {2007}, month = {2007///}, pages = {601 - 610}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Web sites that accept and display content such as wiki articles or comments typically filter the content to prevent injected script code from running in browsers that view the site. The diversity of browser rendering algorithms and the desire to allow rich content make filtering quite difficult, however, and attacks such as the Samy and Yamanner worms have exploited filtering weaknesses. This paper proposes a simple alternative mechanism for preventing script injection called Browser-Enforced Embedded Policies (BEEP). The idea is that a web site can embed a policy in its pages that specifies which scripts are allowed to run. The browser, which knows exactly when it will run a script, can enforce this policy perfectly. We have added BEEP support to several browsers, and built tools to simplify adding policies to web applications. We found that supporting BEEP in browsers requires only small and localized modifications, modifying web applications requires minimal effort, and enforcing policies is generally lightweight.}, keywords = {cross-site scripting, script injection, web application security}, isbn = {978-1-59593-654-7}, doi = {10.1145/1242572.1242654}, url = {http://doi.acm.org/10.1145/1242572.1242654}, author = {Jim,Trevor and Swamy,Nikhil and Hicks, Michael W.} } @conference {16425, title = {The defined cliffs variant in dynamic environments: a case study using the shaky ladder hyperplane-defined functions}, booktitle = {Proceedings of the 9th annual conference on Genetic and evolutionary computation}, series = {GECCO {\textquoteright}07}, year = {2007}, month = {2007///}, pages = {1158 - 1164}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {The shaky ladder hyperplane-defined functions (sl-hdfs) are a test suite utilized for exploring the behavior of the genetic algorithm (GA) in dynamic environments. This test suite can generate arbitrary problems with similar levels of difficulty and it provides a platform for systematic controlled observations of the GA in dynamic environments. Previous work has found two factors that contribute to the GA{\textquoteright}s success on sl-hdfs: (1) short initial building blocks and (2) significantly changing the reward structure during fitness landscape changes. Therefore a test function that combines these two features should facilitate even better GA performance. This has led to the construction of a new sl-hdf variant, "Defined Cliffs," in which we combine short elementary building blocks with sharp transitions in the environment. We examine this variant with two different levels of dynamics, static and regularly changing, using four different metrics. The results show superior GA performance on the Defined Cliffs over all previous variants (Cliffs, Weight, and Smooth). Our observations and conclusions in this variant further the understanding of the GA in dynamic environments.}, keywords = {building blocks, dynamic environments, Genetic algorithms, shaky ladder hyperplane-defined functions}, isbn = {978-1-59593-697-4}, doi = {10.1145/1276958.1277186}, url = {http://doi.acm.org/10.1145/1276958.1277186}, author = {Alharbi,Abir and Rand, William and Riolo,Rick} } @booklet {19446, title = {Description of Computer Science Higher Education in Sub-Saharan Africa: Initial Explorations}, year = {2007}, month = {2007///}, abstract = {Many countries in Sub-Saharan Africa (SSA) are in need oftechnology innovators who are equipped to leverage technologies in locally relevant domains such as health, government and education. To create skilled graduates who can build and shape locally relevant technologies, higher education institutes in Africa must have Computer Science (CS) education programs that meet local needs, for example, to satisfy the demand for entrepreneurs to build industry and strengthen an economy. This paper characterizes the current state of CS education in SSA in order to identify opportunities for addressing education challenges and to make suggestions that may improve the Information and Communication Technology (ICT) infrastructure in this region. We present the results of a survey of CS educators in SSA institutions of higher education, which was aimed at exploring the issues they face. In addition to the continued chronic under-funding of SSA education, we found that universities in SSA have smaller departments, less focus on Human Computer Interaction (HCI) and offer a variety of courses aside from undergraduate Bachelors degrees. We discuss directions to improve CS curricula through investing in locally tailored courses and changing perceptions of the value of SSA CS higher education programs, standards and educators. Further, we reflect on the challenges of conducting research on SSA. We conclude that further research in this area is needed to build on the ideas we offer here to continue to strengthen CS higher education in SSA. }, keywords = {Sub-Saharan Africa, Undergraduate computing education}, doi = {Technical Report}, url = {https://smartech.gatech.edu/handle/1853/20060}, author = {Marshini Chetty and Buckhalter, Celeste and Best, Michael L. and Grinter, Rebecca E. and Guzdial, Mark} } @article {15411, title = {Designing and comparing automated test oracles for GUI-based software applications}, journal = {ACM Trans. Softw. Eng. Methodol.}, volume = {16}, year = {2007}, month = {2007/02//}, abstract = {Test designers widely believe that the overall effectiveness and cost of software testing depends largely on the type and number of test cases executed on the software. This article shows that the test oracle, a mechanism that determines whether a software is executed correctly for a test case, also significantly impacts the fault detection effectiveness and cost of a test case. Graphical user interfaces (GUIs), which have become ubiquitous for interacting with today{\textquoteright}s software, have created new challenges for test oracle development. Test designers manually {\textquotedblleft}assert{\textquotedblright} the expected values of specific properties of certain GUI widgets in each test case; during test execution, these assertions are used as test oracles to determine whether the GUI executed correctly. Since a test case for a GUI is a sequence of events, a test designer must decide: (1) what to assert; and (2) how frequently to check an assertion, for example, after each event in the test case or after the entire test case has completed execution. Variations of these two factors significantly impact the fault-detection ability and cost of a GUI test case. A technique to declaratively specify different types of automated GUI test oracles is described. Six instances of test oracles are developed and compared in an experiment on four software systems. The results show that test oracles do affect the fault detection ability of test cases in different and interesting ways: (1) Test cases significantly lose their fault detection ability when using {\textquotedblleft}weak{\textquotedblright} test oracles; (2) in many cases, invoking a {\textquotedblleft}thorough{\textquotedblright} oracle at the end of test case execution yields the best cost-benefit ratio; (3) certain test cases detect faults only if the oracle is invoked during a small {\textquotedblleft}window of opportunity{\textquotedblright} during test execution; and (4) using thorough and frequently-executing test oracles can compensate for not having long test cases.}, keywords = {Graphical user interfaces, GUI state, GUI testing, test oracles, User interfaces, widgets}, isbn = {1049-331X}, doi = {10.1145/1189748.1189752}, url = {http://doi.acm.org/10.1145/1189748.1189752}, author = {Xie,Qing and Memon, Atif M.} } @article {17072, title = {Designing Semantic Substrates for Visual Network Exploration}, journal = {Information VisualizationInformation Visualization}, volume = {6}, year = {2007}, month = {2007/12/21/}, pages = {281 - 300}, abstract = {A semantic substrate is a spatial template for a network, where nodes are grouped into regions and laid out within each region according to one or more node attributes. This paper shows how users can be given control in designing their own substrates and how this ability leads to a different approach to network data exploration. Users can create a semantic substrate, enter their data, get feedback from domain experts, edit the semantic substrate, and iteratively continue this procedure until the domain experts are satisfied with the insights they have gained. We illustrate this process in two case studies with domain experts working with legal precedents and food webs. Guidelines for designing substrates are provided, including how to locate, size, and align regions in a substrate, which attributes to choose for grouping nodes into regions, how to select placement methods and which attributes to set as parameters of the selected placement method. Throughout the paper, examples are illustrated with NVSS 2.0, the network visualization tool developed to explore the semantic substrate idea.}, keywords = {data exploration and analysis, Graphical user interfaces, Information Visualization, network visualization, semantic substrate design}, isbn = {1473-8716, 1473-8724}, doi = {10.1057/palgrave.ivs.9500162}, url = {http://ivi.sagepub.com/content/6/4/281}, author = {Aris,Aleks and Shneiderman, Ben} } @conference {17782, title = {Detecting stochastically scheduled activities in video}, booktitle = {International Joint Conference on Artificial Intelligence}, year = {2007}, month = {2007///}, pages = {1802 - 1807}, abstract = {The ability to automatically detect activities invideo is of increasing importance in applications such as bank security, airport tarmac security, bag- gage area security and building site surveillance. We present a stochastic activity model composed of atomic actions which are directly observable through image understanding primitives. We focus on answering two types of questions: (i) what are the minimal sub-videos in which a given action is identified with probability above a certain thresh- old and (ii) for a given video, can we decide which activity from a given set most likely occurred? We provide the MPS algorithm for the first problem, as well as two different algorithms (naiveMPA and MPA) to solve the second. Our experimental re- sults on a dataset consisting of staged bank robbery videos (described in [Vu et al., 2003]) show that our algorithms are both fast and provide high qual- ity results when compared to human reviewers. }, author = {Albanese, M. and Moscato, V. and Picariello, A. and V.S. Subrahmanian and Udrea,O.} } @article {15507, title = {Developing a Computer Science Department at the University of Maryland}, journal = {Annals of the History of Computing, IEEE}, volume = {29}, year = {2007}, month = {2007/12//oct}, pages = {64 - 75}, abstract = {This article describes the first six years of the Computer Science Department, established in 1973 at the University of Maryland. The department evolved out of the Computer Science Center, which had been instituted in February 1962. In 1980, the National Academy of Sciences judged the department as being among the leading computer science departments in the US.}, keywords = {administrative, data, department;educational, MARYLAND, processing;, Science, University;computer}, isbn = {1058-6180}, doi = {10.1109/MAHC.2007.4407446}, author = {Minker, Jack} } @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.} } @article {18564, title = {Diagnosing network disruptions with network-wide analysis}, journal = {SIGMETRICS Perform. Eval. Rev.}, volume = {35}, year = {2007}, month = {2007/06//}, pages = {61 - 72}, abstract = {To maintain high availability in the face of changing network conditions, network operators must quickly detect, identify, and react to events that cause network disruptions. One way to accomplish this goal is to monitor routing dynamics, by analyzing routing update streams collected from routers. Existing monitoring approaches typically treat streams of routing updates from different routers as independent signals, and report only the "loud" events (i.e., events that involve large volume of routing messages). In this paper, we examine BGP routing data from all routers in the Abilene backbone for six months and correlate them with a catalog of all known disruptions to its nodes and links. We find that many important events are not loud enough to be detected from a single stream. Instead, they become detectable only when multiple BGP update streams are simultaneously examined. This is because routing updates exhibit network-wide dependencies. This paper proposes using network-wide analysis of routing information to diagnose (i.e., detect and identify) network disruptions. To detect network disruptions, we apply a multivariate analysis technique on dynamic routing information, (i.e., update traffic from all the Abilene routers) and find that this technique can detect every reported disruption to nodes and links within the network with a low rate of false alarms. To identify the type of disruption, we jointly analyze both the network-wide static configuration and details in the dynamic routing updates; we find that our method can correctly explain the scenario that caused the disruption. Although much work remains to make network-wide analysis of routing data operationally practical, our results illustrate the importance and potential of such an approach.}, keywords = {anomaly detection, network management, statistical inference}, isbn = {0163-5999}, doi = {10.1145/1269899.1254890}, url = {http://doi.acm.org/10.1145/1269899.1254890}, author = {Huang,Yiyi and Feamster, Nick and Lakhina,Anukool and Xu,Jim (Jun)} } @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 {16079, title = {Discovering interesting usage patterns in text collections: integrating text mining with visualization}, booktitle = {Proceedings of the sixteenth ACM conference on Conference on information and knowledge management}, series = {CIKM {\textquoteright}07}, year = {2007}, month = {2007///}, pages = {213 - 222}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {This paper addresses the problem of making text mining results more comprehensible to humanities scholars, journalists, intelligence analysts, and other researchers, in order to support the analysis of text collections. Our system, FeatureLens1, visualizes a text collection at several levels of granularity and enables users to explore interesting text patterns. The current implementation focuses on frequent itemsets of n-grams, as they capture the repetition of exact or similar expressions in the collection. Users can find meaningful co-occurrences of text patterns by visualizing them within and across documents in the collection. This also permits users to identify the temporal evolution of usage such as increasing, decreasing or sudden appearance of text patterns. The interface could be used to explore other text features as well. Initial studies suggest that FeatureLens helped a literary scholar and 8 users generate new hypotheses and interesting insights using 2 text collections.}, keywords = {digital humanities, frequent closed itemsets, n-grams, text mining, user interface}, isbn = {978-1-59593-803-9}, doi = {10.1145/1321440.1321473}, url = {http://doi.acm.org/10.1145/1321440.1321473}, author = {Don,Anthony and Zheleva,Elena and Gregory,Machon and Tarkan,Sureyya and Auvil,Loretta and Clement,Tanya and Shneiderman, Ben and Plaisant, Catherine} } @inbook {17584, title = {Distributed Ranked Search}, booktitle = {High Performance Computing {\textendash} HiPC 2007High Performance Computing {\textendash} HiPC 2007}, series = {Lecture Notes in Computer Science}, volume = {4873}, year = {2007}, month = {2007///}, pages = {7 - 20}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {P2P deployments are a natural infrastructure for building distributed search networks. Proposed systems support locating and retrieving all results, but lack the information necessary to rank them. Users, however, are primarily interested in the most relevant results, not necessarily all possible results. Using random sampling, we extend a class of well-known information retrieval ranking algorithms such that they can be applied in this decentralized setting. We analyze the overhead of our approach, and quantify how our system scales with increasing number of documents, system size, document to node mapping (uniform versus non-uniform), and types of queries (rare versus popular terms). Our analysis and simulations show that a) these extensions are efficient, and scale with little overhead to large systems, and b) the accuracy of the results obtained using distributed ranking is comparable to that of a centralized implementation.}, isbn = {978-3-540-77219-4}, url = {http://dx.doi.org/10.1007/978-3-540-77220-0_6}, author = {Gopalakrishnan,Vijay and Morselli,Ruggero and Bhattacharjee, Bobby and Keleher,Pete and Srinivasan, Aravind}, editor = {Aluru,Srinivas and Parashar,Manish and Badrinath,Ramamurthy and Prasanna,Viktor} } @article {12261, title = {Distributed ranked search}, journal = {High Performance Computing{\textendash}HiPC 2007}, year = {2007}, month = {2007///}, pages = {7 - 20}, abstract = {P2P deployments are a natural infrastructure for building distributed search networks. Proposed systems support locating and retrieving all results, but lack the information necessary to rank them. Users, however, are primarily interested in the most relevant results, not necessarily all possible results.Using random sampling, we extend a class of well-known information retrieval ranking algorithms such that they can be applied in this decentralized setting. We analyze the overhead of our approach, and quantify how our system scales with increasing number of documents, system size, document to node mapping (uniform versus non-uniform), and types of queries (rare versus popular terms). Our analysis and simulations show that a) these extensions are efficient, and scale with little overhead to large systems, and b) the accuracy of the results obtained using distributed ranking is comparable to that of a centralized implementation. }, author = {Gopalakrishnan,V. and Morselli,R. and Bhattacharjee, Bobby and Keleher,P. and Srinivasan, Aravind} } @inbook {19567, title = {Distribution-Free Testing Lower Bounds for Basic Boolean Functions}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques}, series = {Lecture Notes in Computer Science}, year = {2007}, month = {2007/01/01/}, pages = {494 - 508}, publisher = {Springer Berlin Heidelberg}, organization = {Springer Berlin Heidelberg}, abstract = {In the distribution-free property testing model, the distance between functions is measured with respect to an arbitrary and unknown probability distribution \mathcal{D} over the input domain. We consider distribution-free testing of several basic Boolean function classes over {0,1} n , namely monotone conjunctions, general conjunctions, decision lists, and linear threshold functions. We prove that for each of these function classes, Ω((n/logn)1/5) oracle calls are required for any distribution-free testing algorithm. Since each of these function classes is known to be distribution-free properly learnable (and hence testable) using Θ(n) oracle calls, our lower bounds are within a polynomial factor of the best possible.}, keywords = {Algorithm Analysis and Problem Complexity, Discrete Mathematics in Computer Science, Numeric Computing}, isbn = {978-3-540-74207-4, 978-3-540-74208-1}, url = {http://link.springer.com/chapter/10.1007/978-3-540-74208-1_36}, author = {Dana Dachman-Soled and Servedio, Rocco A.}, editor = {Charikar, Moses and Jansen, Klaus and Reingold, Omer and Rolim, Jos{\'e} D. P.} } @conference {13543, title = {Document Image Mosaicing with Mobile Phones}, booktitle = {International Conference on Image Analysis and Processing (ICIAP{\textquoteright}07)}, year = {2007}, month = {2007/09//}, pages = {1 - 8}, abstract = {This paper presents a novel user interaction oncept for document image scanning with mobile phones. A high resolution mosaic image is constructed in two main stages. Firstly, online camera motion estimation is applied on the phone to assist the user to capture small image batches of the document page. Automatic image stitching process with a help of estimated device motion is carried out to reconstruct the full view of the document. Experiments on document images captured and processed with the mosaicing software clearly show the feasibility of the approach.}, author = {Hannuksela,J. and Sangi,P. and Heikkila,J. and Liu,X. and David Doermann} } @article {16257, title = {Draft Genome of the Filarial Nematode Parasite Brugia Malayi}, journal = {Science}, volume = {317}, year = {2007}, month = {2007/09/21/}, pages = {1756 - 1760}, abstract = {Parasitic nematodes that cause elephantiasis and river blindness threaten hundreds of millions of people in the developing world. We have sequenced the \~{}90 megabase (Mb) genome of the human filarial parasite Brugia malayi and predict \~{}11,500 protein coding genes in 71 Mb of robustly assembled sequence. Comparative analysis with the free-living, model nematode Caenorhabditis elegans revealed that, despite these genes having maintained little conservation of local synteny during \~{}350 million years of evolution, they largely remain in linkage on chromosomal units. More than 100 conserved operons were identified. Analysis of the predicted proteome provides evidence for adaptations of B. malayi to niches in its human and vector hosts and insights into the molecular basis of a mutualistic relationship with its Wolbachia endosymbiont. These findings offer a foundation for rational drug design.}, isbn = {0036-8075, 1095-9203}, doi = {10.1126/science.1145406}, url = {http://www.sciencemag.org/content/317/5845/1756}, author = {Ghedin,Elodie and Wang,Shiliang and Spiro,David and Caler,Elisabet and Zhao,Qi and Crabtree,Jonathan and Allen,Jonathan E and Delcher,Arthur L. and Guiliano,David B and Miranda-Saavedra,Diego and Angiuoli,Samuel V and Creasy,Todd and Amedeo,Paolo and Haas,Brian and El-Sayed, Najib M. and Wortman,Jennifer R. and Feldblyum,Tamara and Tallon,Luke and Schatz,Michael and Shumway,Martin and Koo,Hean and Salzberg,Steven L. and Schobel,Seth and Pertea,Mihaela and Pop, Mihai and White,Owen and Barton,Geoffrey J and Carlow,Clotilde K. S and Crawford,Michael J and Daub,Jennifer and Dimmic,Matthew W and Estes,Chris F and Foster,Jeremy M and Ganatra,Mehul and Gregory,William F and Johnson,Nicholas M and Jin,Jinming and Komuniecki,Richard and Korf,Ian and Kumar,Sanjay and Laney,Sandra and Li,Ben-Wen and Li,Wen and Lindblom,Tim H and Lustigman,Sara and Ma,Dong and Maina,Claude V and Martin,David M. A and McCarter,James P and McReynolds,Larry and Mitreva,Makedonka and Nutman,Thomas B and Parkinson,John and Peregr{\'\i}n-Alvarez,Jos{\'e} M and Poole,Catherine and Ren,Qinghu and Saunders,Lori and Sluder,Ann E and Smith,Katherine and Stanke,Mario and Unnasch,Thomas R and Ware,Jenna and Wei,Aguan D and Weil,Gary and Williams,Deryck J and Zhang,Yinhua and Williams,Steven A and Fraser-Liggett,Claire and Slatko,Barton and Blaxter,Mark L and Scott,Alan L} } @conference {14477, title = {A dual-view approach to interactive network visualization}, booktitle = {Proceedings of the sixteenth ACM conference on Conference on information and knowledge management}, series = {CIKM {\textquoteright}07}, year = {2007}, month = {2007///}, pages = {939 - 942}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Visualizing network data, from tree structures to arbitrarily connected graphs, is a difficult problem in information visualization. A large part of the problem is that in network data, users not only have to visualize the attributes specific to each data item, but also the links specifying how those items are connected to each other. Past approaches to resolving these difficulties focus on zooming, clustering, filtering and applying various methods of laying out nodes and edges. Such approaches, however, focus only on optimizing a network visualization in a single view, limiting the amount of information that can be shown and explored in parallel. Moreover, past approaches do not allow users to cross reference different subsets or aspects of large, complex networks. In this paper, we propose an approach to these limitations using multiple coordinated views of a given network. To illustrate our approach, we implement a tool called DualNet and evaluate the tool with a case study using an email communication network. We show how using multiple coordinated views improves navigation and provides insight into large networks with multiple node and link properties and types.}, keywords = {coordinated views, Information Visualization, interactive graph visualization, social networks}, isbn = {978-1-59593-803-9}, doi = {10.1145/1321440.1321580}, url = {http://doi.acm.org/10.1145/1321440.1321580}, author = {Namata,Galileo Mark and Staats,Brian and Getoor, Lise and Shneiderman, Ben} } @article {17837, title = {Data redistribution and remote method invocation for coupled components}, journal = {Journal of Parallel and Distributed Computing}, volume = {66}, year = {2006}, month = {2006/07//}, pages = {931 - 946}, abstract = {With the increasing availability of high-performance massively parallel computer systems, the prevalence of sophisticated scientific simulation has grown rapidly. The complexity of the scientific models being simulated has also evolved, leading to a variety of coupled multi-physics simulation codes. Such cooperating parallel programs require fundamentally new interaction capabilities, to efficiently exchange parallel data structures and collectively invoke methods across programs. So-called {\textquotedblleft} M {\texttimes} N {\textquotedblright} research, as part of the common component architecture (CCA) effort, addresses these special and challenging needs, to provide generalized interfaces and tools that support flexible parallel data redistribution and parallel remote method invocation. Using this technology, distinct simulation codes with disparate distributed data decompositions can work together to achieve greater scientific discoveries.}, keywords = {Common component architecture, Model coupling, Parallel data redistribution, Parallel remote method invocation}, isbn = {0743-7315}, doi = {10.1016/j.jpdc.2005.12.009}, url = {http://www.sciencedirect.com/science/article/pii/S0743731506000700}, author = {Bertrand,Felipe and Bramley,Randall and Bernholdt,David E. and Kohl,James A. and Sussman, Alan and Larson,Jay W. and Damevski,Kostadin B.} } @conference {12317, title = {Dataflow transformations in high-level DSP system design}, booktitle = {Proceedings of the International Symposium on System-on-Chip, Tampere, Finland}, year = {2006}, month = {2006///}, pages = {131 - 136}, author = {Saha,S. and Puthenpurayil,S. and Bhattacharyya, Shuvra S.} } @conference {14498, title = {D-Dupe: An Interactive Tool for Entity Resolution in Social Networks}, booktitle = {Visual Analytics Science And Technology, 2006 IEEE Symposium On}, year = {2006}, month = {2006/11/31/2}, pages = {43 - 50}, abstract = {Visualizing and analyzing social networks is a challenging problem that has been receiving growing attention. An important first step, before analysis can begin, is ensuring that the data is accurate. A common data quality problem is that the data may inadvertently contain several distinct references to the same underlying entity; the process of reconciling these references is called entity-resolution. D-Dupe is an interactive tool that combines data mining algorithms for entity resolution with a task-specific network visualization. Users cope with complexity of cleaning large networks by focusing on a small subnetwork containing a potential duplicate pair. The subnetwork highlights relationships in the social network, making the common relationships easy to visually identify. D-Dupe users resolve ambiguities either by merging nodes or by marking them distinct. The entity resolution process is iterative: as pairs of nodes are resolved, additional duplicates may be revealed; therefore, resolution decisions are often chained together. We give examples of how users can flexibly apply sequences of actions to produce a high quality entity resolution result. We illustrate and evaluate the benefits of D-Dupe on three bibliographic collections. Two of the datasets had already been cleaned, and therefore should not have contained duplicates; despite this fact, many duplicates were rapidly identified using D-Dupe{\textquoteright}s unique combination of entity resolution algorithms within a task-specific visual interface}, keywords = {algorithm;data, analysis;social, computing;user, D-Dupe, interactive, interface;data, interfaces;, mining, mining;interactive, network, problem;entity, QUALITY, resolution;entity-resolution;social, sciences, systems;social, tool;data, visual, visualization;task-specific}, doi = {10.1109/VAST.2006.261429}, author = {Bilgic,M. and Licamele,L. and Getoor, Lise and Shneiderman, Ben} } @book {15740, title = {Deblurring Images: Matrices, Spectra, and Filtering}, year = {2006}, month = {2006///}, publisher = {SIAM Press}, organization = {SIAM Press}, address = {Philadelphia}, author = {Hansen,Per Christian and Nagy,James G. and O{\textquoteright}Leary, Dianne P.} } @conference {12271, title = {Decentralized message ordering for publish/subscribe systems}, booktitle = {Proceedings of the ACM/IFIP/USENIX 2006 International Conference on Middleware}, series = {Middleware {\textquoteright}06}, year = {2006}, month = {2006///}, pages = {162 - 179}, publisher = {Springer-Verlag New York, Inc.}, organization = {Springer-Verlag New York, Inc.}, address = {New York, NY, USA}, abstract = {We describe a method to order messages across groups in a publish/subscribe system without centralized control or large vector timestamps. We show that our scheme is practical---little state is required; that it is scalable---the maximum message load is limited by receivers; and that it performs well---the paths messages traverse to be ordered are not made much longer than necessary. Our insight is that only messages to groups that overlap in membership can be observed to arrive out of order: sequencing messages to these groups is sufficient to provide a consistent order, and when publishers subscribe to the groups to which they send, this message order is a causal order.}, url = {http://dl.acm.org/citation.cfm?id=1515984.1515997}, author = {Lumezanu,Cristian and Spring, Neil and Bhattacharjee, Bobby} } @conference {13258, title = {A decomposition-based representation for 3D simplicial complexes}, booktitle = {Proceedings of the fourth Eurographics symposium on Geometry processing}, series = {SGP {\textquoteright}06}, year = {2006}, month = {2006///}, pages = {101 - 110}, publisher = {Eurographics Association}, organization = {Eurographics Association}, address = {Aire-la-Ville, Switzerland, Switzerland}, abstract = {We define a new representation for non-manifold 3D shapes described by three-dimensional simplicial complexes, that we call the Double-Level Decomposition (DLD) data structure. The DLD data structure is based on a unique decomposition of the simplicial complex into nearly manifold parts, and encodes the decomposition in an efficient and powerful two-level representation. It is compact, and it supports efficient topological navigation through adjacencies. It also provides a suitable basis for geometric reasoning on non-manifold shapes. We describe an algorithm to decompose a 3D simplicial complex into nearly manifold parts. We discuss how to build the DLD data structure from a description of a 3D complex as a collection of tetrahedra, dangling triangles and wire edges, and we present algorithms for topological navigation. We present a thorough comparison with existing representations for 3D simplicial complexes.}, isbn = {3-905673-36-3}, url = {http://dl.acm.org/citation.cfm?id=1281957.1281970}, author = {Hui,Annie and Vaczlavik,Lucas and De Floriani, Leila} } @conference {11973, title = {Deformation and viewpoint invariant color histograms}, booktitle = {British Machine Vision Conference}, volume = {2}, year = {2006}, month = {2006///}, pages = {509 - 518}, author = {Domke, J. and Aloimonos, J.} } @article {14604, title = {Dense Subgraph Computation Via Stochastic Search: Application to Detect Transcriptional Modules}, journal = {BioinformaticsBioinformatics}, volume = {22}, year = {2006}, month = {2006/07/15/}, pages = {e117-e123 - e117-e123}, abstract = {Motivation: In a tri-partite biological network of transcription factors, their putative target genes, and the tissues in which the target genes are differentially expressed, a tightly inter-connected (dense) subgraph may reveal knowledge about tissue specific transcription regulation mediated by a specific set of transcription factors{\textemdash}a tissue-specific transcriptional module. This is just one context in which an efficient computation of dense subgraphs in a multi-partite graph is needed.Result: Here we report a generic stochastic search based method to compute dense subgraphs in a graph with an arbitrary number of partitions and an arbitrary connectivity among the partitions. We then use the tool to explore tissue-specific transcriptional regulation in the human genome. We validate our findings in Skeletal muscle based on literature. We could accurately deduce biological processes for transcription factors via the tri-partite clusters of transcription factors, genes, and the functional annotation of genes. Additionally, we propose a few previously unknown TF-pathway associations and tissue-specific roles for certain pathways. Finally, our combined analysis of Cardiac, Skeletal, and Smooth muscle data recapitulates the evolutionary relationship among the three tissues. Contact:sridharh@pcbi.upenn.edu }, isbn = {1367-4803, 1460-2059}, doi = {10.1093/bioinformatics/btl260}, url = {http://bioinformatics.oxfordjournals.org/content/22/14/e117}, author = {Everett,Logan and Wang,Li-San and Hannenhalli, Sridhar} } @article {13185, title = {Density estimation using mixtures of mixtures of Gaussians}, journal = {Computer Vision{\textendash}ECCV 2006}, year = {2006}, month = {2006///}, pages = {410 - 422}, abstract = {In this paper we present a new density estimation algorithm using mixtures of mixtures of Gaussians. The new algorithm overcomes the limitations of the popular Expectation Maximization algorithm. The paper first introduces a new model selection criterion called the Penalty-less Information Criterion, which is based on the Jensen-Shannon divergence. Mean-shift is used to automatically initialize the means and covariances of the Expectation Maximization in order to obtain better structure inference. Finally, a locally linear search is performed using the Penalty-less Information Criterion in order to infer the underlying density of the data. The validity of the algorithm is verified using real color images.}, author = {Abd-Almageed, Wael and Davis, Larry S.} } @article {15252, title = {Dependent rounding and its applications to approximation algorithms}, journal = {Journal of the ACM}, volume = {53}, year = {2006}, month = {2006/05//}, pages = {324 - 360}, abstract = {We develop a new randomized rounding approach for fractional vectors defined on the edge-sets of bipartite graphs. We show various ways of combining this technique with other ideas, leading to improved (approximation) algorithms for various problems. These include:---low congestion multi-path routing;---richer random-graph models for graphs with a given degree-sequence;---improved approximation algorithms for: (i) throughput-maximization in broadcast scheduling, (ii) delay-minimization in broadcast scheduling, as well as (iii) capacitated vertex cover; and---fair scheduling of jobs on unrelated parallel machines.}, keywords = {broadcast scheduling, Randomized rounding}, isbn = {0004-5411}, doi = {10.1145/1147954.1147956}, url = {http://doi.acm.org/10.1145/1147954.1147956}, author = {Gandhi,Rajiv and Khuller, Samir and Parthasarathy,Srinivasan and Srinivasan, Aravind} } @article {14210, title = {Depth estimation using the compound eye of dipteran flies}, journal = {Biological Cybernetics}, volume = {95}, year = {2006}, month = {2006///}, pages = {487 - 501}, abstract = {In the neural superposition eye of a dipteran fly every ommatidium has eight photoreceptors, each associated with a rhabdomere, two central and six peripheral, which altogether result in seven functional light guides. Groups of eight rhabdomeres in neighboring ommatidia have largely overlapping fields of view. Based on the hypothesis that the light signals collected by these rhabdomeres can be used individually, we investigated the feasibility of estimating 3D scene information. According to Pick (Biol Cybern 26:215{\textendash}224, 1977) the visual axes of these rhabdomeres are not parallel, but converge to a point 3{\textendash}6 mm in front of the cornea. Such a structure theoretically could estimate depth in a very simple way by assuming that locally the image intensity is well approximated by a linear function of the spatial coordinates. Using the measurements of Pick (Biol Cybern 26:215{\textendash}224, 1977) we performed simulation experiments to find whether this is practically possible. Our results indicate that depth estimation at small distances (up to about 1.5{\textendash}2 cm) is reasonably accurate. This would allow the insect to obtain at least an ordinal spatial layout of its operational space when walking.}, isbn = {0340-1200}, url = {http://dx.doi.org/10.1007/s00422-006-0097-1}, author = {Bitsakos,Konstantinos and Ferm{\"u}ller, Cornelia} } @conference {13536, title = {Detecting Text Line in Handwritten Documents}, booktitle = {ICPR{\textquoteright}06}, year = {2006}, month = {2006///}, pages = {1030 - 1033}, address = {Hong Kong, China}, abstract = {Although detecting text lines in machine printed documents is typically considered as a solved problem, it is still a challenge to segment handwritten text lines in the general sense given no prior knowledge of scrip. This paper models text line detection as an image segmentation problem by enhancing text line structure using a Gaussian window, and adopting the level set method to evolve text line boundaries. Experiments show that the method, which is script independent, achieves high accuracy for detecting text lines in both handwritten and machine printed documents.}, author = {Li,Yi and Yefeng Zheng and David Doermann} } @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.} } @inbook {12925, title = {Detection, Isolation, and Identification of Vibrio cholerae from the Environment}, booktitle = {Current Protocols in MicrobiologyCurrent Protocols in Microbiology}, year = {2006}, month = {2006/09/01/}, pages = {6A.5.1-6A.5.38 - 6A.5.1-6A.5.38}, publisher = {John Wiley \& Sons, Inc.}, organization = {John Wiley \& Sons, Inc.}, keywords = {culturable, DETECTION, Environment, identification, isolation, nonculturable, viable, Vibrio cholerae}, isbn = {9780471729259}, url = {http://onlinelibrary.wiley.com/doi/10.1002/9780471729259.mc06a05s02/abstract?userIsAuthenticated=false\&deniedAccessCustomisedMessage=}, author = {Huq,Anwar and Grim,Christopher and Rita R Colwell and Nair,G. Balakrish} } @article {14922, title = {Development of a Large-Scale Integrated Neurocognitive Architecture Part 1: Conceptual Framework}, volume = {UMIACS-TR-2006-33}, year = {2006}, month = {2006/06/15/}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {The idea of creating a general purpose machine intelligence that capturesmany of the features of human cognition goes back at least to the earliest days of artificial intelligence and neural computation. In spite of more than a half-century of research on this issue, there is currently no existing approach to machine intelligence that comes close to providing a powerful, general-purpose human-level intelligence. However, substantial progress made during recent years in neural computation, high performance computing, neuroscience and cognitive science suggests that a renewed effort to produce a general purpose and adaptive machine intelligence is timely, likely to yield qualitatively more powerful approaches to machine intelligence than those currently existing, and certain to lead to substantial progress in cognitive science, AI and neural computation. In this report, we outline a conceptual framework for the long-term development of a large-scale machine intelligence that is based on the modular organization, dynamics and plasticity of the human brain. Some basic design principles are presented along with a review of some of the relevant existing knowledge about the neurobiological basis of cognition. Three intermediate-scale prototypes for parts of a larger system are successfully implemented, providing support for the effectiveness of several of the principles in our framework. We conclude that a human-competitive neuromorphic system for machine intelligence is a viable long- term goal, but that for the short term, substantial integration with more standard symbolic methods as well as substantial research will be needed to make this goal achievable. }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu//handle/1903/3665}, author = {Reggia, James A. and Tagamets,Malle and Contreras-Vidal,Jose and Weems,Scott and Jacobs, David W. and Winder,Ransom and Chabuk,Timur} } @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 {14605, title = {Differential Transcriptional Response to Nonassociative and Associative Components of Classical Fear Conditioning in the Amygdala and Hippocampus}, journal = {Learning \& MemoryLearn. Mem.}, volume = {13}, year = {2006}, month = {2006/03/01/}, pages = {135 - 142}, abstract = {Classical fear conditioning requires the recognition of conditioned stimuli (CS) and the association of the CS with an aversive stimulus. We used Affymetrix oligonucleotide microarrays to characterize changes in gene expression compared to naive mice in both the amygdala and the hippocampus 30 min after classical fear conditioning and 30 min after exposure to the CS in the absence of an aversive stimulus. We found that in the hippocampus, levels of gene regulation induced by classical fear conditioning were not significantly greater than those induced by CS alone, whereas in the amygdala, classical fear conditioning did induce significantly greater levels of gene regulation compared to the CS. Computational studies suggest that transcriptional changes in the hippocampus and amygdala are mediated by large and overlapping but distinct combinations of molecular events. Our results demonstrate that an increase in gene regulation in the amygdala was partially correlated to associative learning and partially correlated to nonassociative components of the task, while gene regulation in the hippocampus was correlated to nonassociative components of classical fear conditioning, including configural learning.}, isbn = {1072-0502, 1549-5485}, doi = {10.1101/lm.86906}, url = {http://learnmem.cshlp.org/content/13/2/135}, author = {Keeley,Michael B and Wood,Marcelo A and Isiegas,Carolina and Stein,Joel and Hellman,Kevin and Hannenhalli, Sridhar and Abel,Ted} } @article {13260, title = {A Dimension-Independent Representation for Multiresolution Nonmanifold Meshes}, journal = {Journal of Computing and Information Science in Engineering}, volume = {6}, year = {2006}, month = {2006///}, pages = {397 - 404}, abstract = {We consider the problem of representing and manipulating nonmanifold objects of any dimension and at multiple resolutions. We present a modeling scheme based on (1) a multiresolution representation, called the vertex-based nonmanifold multitessellation, (2) a compact and dimension-independent data structure, called the Simplified Incidence Graph (SIG), and (3) an atomic mesh update operator, called vertex-pair contraction/vertex expansion. We propose efficient algorithms for performing the vertex-pair contraction on a simplicial mesh encoded as a SIG, and an effective representation for encoding this multiresolution model based on a compact encoding of vertex-pair contractions and vertex expansions.}, keywords = {computational geometry, graph theory, mesh generation}, doi = {10.1115/1.2364207}, url = {http://link.aip.org/link/?CIS/6/397/1}, author = {De Floriani, Leila and Hui,Annie} } @article {13261, title = {A dimension-independent simplicial data structure for non-manifold shapes}, volume = {CS-TR-4794}, year = {2006}, month = {2006/04/07/}, institution = {Department of Computer Science, University of Maryland, College Park}, abstract = {We consider the problem of representing and manipulating non-manifoldmulti-dimensional shapes, discretized as $d$-dimensional simplicial Euclidean complexes, for modeling finite element meshes derived from CAD models. We propose a dimension-independent data structure for simplicial complexes, that we call the {\em Incidence Simplicial (IS)} data structure. The IS data structure is scalable to manifold complexes, and supports efficient traversal and update algorithms for performing topological modifications, such as hole removal or dimension reduction. It has the same expressive power and performances as the incidence graph, commonly used for dimension-independent representation of simplicial and cell complexes, but it is much more compact. We present efficient algorithms for traversing, generating and updating a simplicial complex described as an IS data structure. We compare the IS data structure with dimension-independent and dimension-specific representations for simplicial complexes. Finally, we briefly discuss two applications that the IS data structure supports, namely decomposition of non-manifold objects for effective geometric reasoning, and multi-resolution modeling of non-manifold multi-dimensional shapes. }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/7427}, author = {Hui,Annie and De Floriani, Leila} } @article {17089, title = {Discovering business intelligence using treemap visualizations}, journal = {B-EYE-Network-Boulder, CO, USA, April}, volume = {11}, year = {2006}, month = {2006///}, author = {Shneiderman, Ben} } @article {16792, title = {Dissemination of compressed historical information in sensor networks}, journal = {The VLDB JournalThe VLDB Journal}, volume = {16}, year = {2006}, month = {2006/07//}, pages = {439 - 461}, isbn = {1066-8888}, doi = {10.1007/s00778-005-0173-5}, url = {http://dl.acm.org/citation.cfm?id=1285903}, author = {Deligiannakis,Antonios and Kotidis,Yannis and Roussopoulos, Nick} } @conference {17877, title = {DiST: fully decentralized indexing for querying distributed multidimensional datasets}, booktitle = {Parallel and Distributed Processing Symposium, 2006. IPDPS 2006. 20th International}, year = {2006}, month = {2006/04//}, publisher = {IEEE}, organization = {IEEE}, abstract = {Grid computing and peer-to-peer (P2P) systems are emerging as new paradigms for managing large scale distributed resources across wide area networks. While grid computing focuses on managing heterogeneous resources and relies on centralized managers for resource and data discovery, P2P systems target scalable, decentralized methods for publishing and searching for data. In large distributed systems, a centralized resource manager is a potential performance bottleneck and decentralization can help avoid this bottleneck, as is done in P2P systems. However, the query functionality provided by most existing P2P systems is very rudimentary, and is not directly applicable to grid resource management. In this paper, we propose a fully decentralized multidimensional indexing structure, called DiST, that operates in a fully distributed environment with no centralized control. In DiST, each data server only acquires information about data on other servers from executing and routing queries. We describe the DiST algorithms for maintaining the decentralized network of data servers, including adding and deleting servers, the query routing algorithm, and failure recovery algorithms. We also evaluate the performance of the decentralized scheme against a more structured hierarchical indexing scheme that we have previously shown to perform well in distributed grid environments}, keywords = {Computer network management, distributed multidimensional dataset querying, failure recovery, fault tolerant computing, fully decentralized multidimensional indexing, grid computing, Indexing, large scale distributed resource management, Large-scale systems, Multidimensional systems, Network servers, P2P systems, Peer to peer computing, peer-to-peer computing, peer-to-peer systems, Publishing, Query processing, query routing, resource allocation, Resource management, telecommunication network routing, wide area networks}, isbn = {1-4244-0054-6}, doi = {10.1109/IPDPS.2006.1639280}, author = {Nam,Beomseok and Sussman, Alan} } @conference {16870, title = {Distance join queries on spatial networks}, booktitle = {Proceedings of the 14th annual ACM international symposium on Advances in geographic information systems}, series = {GIS {\textquoteright}06}, year = {2006}, month = {2006///}, pages = {211 - 218}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {The result of a distance join operation on two sets of objects R, S on a spatial network G is a set P of object pairs pq, p {\'E} R, q {\'E} S such that the distance of an object pair pq is the shortest distance from p to q in G. Several variations to the distance join operation such as UnOrdered, Incremental, topk, Semi-Join impose additional constraints on the distance between the object pairs in P, the ordering of object pairs in P, and on the cardinality of P. A distance join algorithm on spatial networks is proposed that works in conjunction with the SILC framework, which is a new approach to query processing on spatial networks. Experimental results demonstrate up to an order of magnitude speed up when compared with a prominent existing technique.}, keywords = {location-based services, path coherence, Query processing, SILC framework, Spatial databases, spatial networks}, isbn = {1-59593-529-0}, doi = {10.1145/1183471.1183506}, url = {http://doi.acm.org/10.1145/1183471.1183506}, author = {Sankaranarayanan,Jagan and Alborzi,Houman and Samet, Hanan} } @conference {12277, title = {Distributing Google}, booktitle = {Data Engineering Workshops, 2006. Proceedings. 22nd International Conference on}, year = {2006}, month = {2006///}, pages = {33 - 33}, abstract = {We consider the problem of wide-area large-scale text search over a peer-to-peer infrastructure. A wide-area search infrastructure with billions of documents and millions of search terms presents unique challenges in terms of the amount of state that must be maintained and updated. Distributing such a system would require tens of thousands of hosts leading to the usual problems associated with node failures, churn and data migration. Localities inherent in query patterns will cause load imbalances and hot spots that can severely impair performance. In this paper, we describe an architecture for constructing a scalable search infrastructure that is designed to cope with the challenges of scale described above. Our architecture consists of a data store layer which is used to reliably store and recompute indexes over a slow timescale and a caching layer that is used to respond to most queries. Our primary insight is that the problem of efficiently retrieving a small number of relevant results must be decoupled from the problem of reliably storing potentially huge indexes. Relevant results can be quickly retrieved from caches of ranked results, which can be replicated based upon query load. An entirely different set of mechanisms, such as encoded storage and/or data partitioning, should be used to store large indexes reliably. These indexes should only be used to compute results when there is a miss in the cache.}, doi = {10.1109/ICDEW.2006.49}, author = {Gopalakrishnan,V. and Bhattacharjee, Bobby and Keleher,P.} } @conference {13540, title = {DOCLIB: a Software Library for Document Processing}, booktitle = {International Conference on Document Recognition and Retrieval XIII}, year = {2006}, month = {2006///}, pages = {1 - 9}, publisher = {San Jose, CA}, organization = {San Jose, CA}, abstract = {Most researchers would agree that research in the field of document processing can benefit tremendously from a common software library through which institutions are able to develop and share research-related software and applications across academic, business, and government domains. However, despite several attempts in the past, the research community still lacks a widely-accepted standard software library for document processing. This paper describes a new library called DOCLIB, which tries to overcome the drawbacks of earlier approaches. Many of DOCLIB{\textquoteright}s features are unique either in themselves or in their combination with others, e.g. the factory concept for support of different image types, the juxtaposition of image data and metadata, or the add-on mechanism. We cherish the hope that DOCLIB serves the needs of researchers better than previous approaches and will readily be accepted by a larger group of scientists.}, author = {Jaeger,Stefan and Zhu,Guangyu and David Doermann and Chen,Kevin and Sampat,Summit} } @article {13042, title = {Domain adaptation for statistical classifiers}, journal = {Journal of Artificial Intelligence Research}, volume = {26}, year = {2006}, month = {2006///}, pages = {101 - 126}, author = {Daum{\'e}, Hal and Marcu,D.} } @article {16812, title = {Dwarf cube architecture for reducing storage sizes of multidimensional data}, volume = {10/157,960}, year = {2006}, month = {2006/11/07/}, abstract = {The invention relates to data warehouses and the ability to create and maintain data cubes of multi-dimensional data. More specifically, the invention pertains to data cube architectures that permit significant reduction of storage, exhibit very efficient retrieval and provide a very efficient incremental update of the data cubes.}, url = {http://www.google.com/patents?id=PGl7AAAAEBAJ}, author = {Roussopoulos, Nick and Sismanis,John and Deligiannakis,Antonios}, editor = {The University of Maryland College Park} } @article {18188, title = {Data hiding in compiled program binaries for enhancing computer system performance}, journal = {Information Hiding}, year = {2005}, month = {2005///}, pages = {357 - 371}, abstract = {Information hiding has been studied in many security applications such as authentication, copyright management and digital forensics. In this work, we introduce a new application where successful information hiding in compiled program binaries could bring system-wide performance improvements. Our goal is to enhance computer system performance by providing additional information to the processor, without changing the instruction set architecture. We first analyze the statistics of typical programs to demonstrate the feasibility of hiding data in them. We then propose several techniques to hide a large amount of data in the operand fields with very low computation and storage requirements during the extraction process. The data embedding is made reversible to recover the original instructions and to ensure the correct execution of the computer program. Our experiments on the SPEC CPU2000 benchmark programs show that up to 110K bits of information can be embedded in large programs with as little as 3K bits of additional run-time memory in the form of a simple look-up table.}, doi = {10.1007/11558859_26}, author = {Swaminathan,A. and Mao,Y. and Wu,M. and Kailas,K.} } @article {18191, title = {Data hiding in curves with application to fingerprinting maps}, journal = {Signal Processing, IEEE Transactions on}, volume = {53}, year = {2005}, month = {2005/10//}, pages = {3988 - 4005}, abstract = {This paper presents a new data hiding method for curves. The proposed algorithm parameterizes a curve using the B-spline model and adds a spread spectrum sequence to the coordinates of the B-spline control points. In order to achieve robust fingerprint detection, an iterative alignment-minimization algorithm is proposed to perform curve registration and to deal with the nonuniqueness of B-spline control points. Through experiments, we demonstrate the robustness of the proposed data-hiding algorithm against various attacks, such as collusion, cropping, geometric transformations, vector/raster-raster/vector conversions, printing-and-scanning, and some of their combinations. We also show the feasibility of our method for fingerprinting topographic maps as well as writings and drawings.}, keywords = {(mathematics);, algorithm;, alignment-minimization, B-spline, CONTROL, curve, data, detection;, edge, embedding;, encapsulation;, fingerprint, geospatial, hiding, identification;, image, iterative, method;, methods;, minimisation;, point;, protection;, registration;, sequence;, spectrum, splines, spread, watermarking;}, isbn = {1053-587X}, doi = {10.1109/TSP.2005.855411}, author = {Gou,Hongmei and M. Wu} } @conference {16482, title = {A data model and query language to explore enhanced links and paths in life science sources}, booktitle = {Proceedings of the ACM SIGMOD Workshop on The Web and Databases (WebDB)}, year = {2005}, month = {2005///}, author = {Mihaila,G. and Naumann,F. and Raschid, Louiqa and Vidal,M. E} } @conference {17853, title = {Data Redistribution and Remote Method Invocation in Parallel Component Architectures}, booktitle = {Parallel and Distributed Processing Symposium, International}, volume = {1}, year = {2005}, month = {2005///}, pages = {40b - 40b}, publisher = {IEEE Computer Society}, organization = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, abstract = {With the increasing availability of high-performance massively parallel computer systems, the prevalence of sophisticated scientific simulation has grown rapidly. The complexity of the scientific models being simulated has also evolved, leading to a variety of coupled multi-physics simulation codes. Such cooperating parallel programs require fundamentally new interaction capabilities, to efficiently exchange parallel data structures and collectively invoke methods across programs. So-called "M?N" research, as part of the Common Component Architecture (CCA) effort, addresses these special and challenging needs, to provide generalized interfaces and tools that support flexible parallel data redistribution and parallel remote method invocation. Using this technology, distinct simulation codes with disparate distributed data decompositions can work together to achieve greater scientific discoveries.}, doi = {http://doi.ieeecomputersociety.org/10.1109/IPDPS.2005.159}, author = {Bertrand,Felipe and Bramley,Randall and Sussman, Alan and Bernholdt,David E. and Kohl,James A. and Larson,Jay W. and Damevski,Kostadin B.} } @article {12989, title = {Data sharing in ecology and evolution}, journal = {Trends in Ecology \& Evolution}, volume = {20}, year = {2005}, month = {2005/07//}, pages = {362 - 363}, isbn = {0169-5347}, doi = {10.1016/j.tree.2005.04.023}, url = {http://www.sciencedirect.com/science/article/pii/S0169534705001308}, author = {Parr,Cynthia S. and Cummings, Michael P.} } @conference {13284, title = {Data structures for simplicial complexes: an analysis and a comparison}, booktitle = {Proceedings of the third Eurographics symposium on Geometry processing}, series = {SGP {\textquoteright}05}, year = {2005}, month = {2005///}, publisher = {Eurographics Association}, organization = {Eurographics Association}, address = {Aire-la-Ville, Switzerland, Switzerland}, abstract = {In this paper, we review, analyze and compare representations for simplicial complexes. We classify such representations, based on the dimension of the complexes they can encode, into dimension-independent structures, and data structures for three- and for two-dimensional simplicial complexes. We further classify the data structures in each group according to the basic kinds of the topological entities they represent. We present a description of each data structure in terms of the entities and topological relations encoded, and we evaluate it based on its expressive power, on its storage cost and on the efficiency in supporting navigation inside the complex, i.e., in retrieving topological relations not explicitly encoded. We compare the various data structures inside each category based on the above features.}, isbn = {3-905673-24-X}, url = {http://dl.acm.org/citation.cfm?id=1281920.1281940}, author = {De Floriani, Leila and Hui,Annie} } @conference {13431, title = {DD-PREF: A language for expressing preferences over sets}, booktitle = {In AAAI-05}, year = {2005}, month = {2005///}, abstract = {In many application domains, it is useful to be able to represent and reason about a user{\textquoteright}s preferences over sets of objects. We present a representation language, DD-PREF (for Diversity and Depth PREFerences), for specifying the desired diversity and depth of sets of objects where each object is represented as a vector of feature values. A strong diversity preference for a particular feature indicates that the user would like the set to include objects whose values are evenly dispersed across the range of possible values for that feature. A strong depth preference for a feature indicates that the user is interested in specific target values or ranges. Diversity and depth are complementary, but are not necessarily opposites. We define an objective function that, when maximized, identifies the subset of objects that best satisfies a statement of preferences in DD-PREF. Exhaustively searching the space of all possible subsets is intractable for large problem spaces; therefore, we also present an efficient greedy algorithm for generating preferred object subsets. We demonstrate the expressive power of DD-PREF and the performance of our greedy algorithm by encoding and applying qualitatively different preferences for multiple tasks on a blocks world data set. Finally, we provide experimental results for a collection of Mars rover images, demonstrating that we can successfully capture individual preferences of different users, and use them to retrieve high-quality image subsets.}, author = {desJardins, Marie} } @conference {14859, title = {Deformation invariant image matching}, booktitle = {Computer Vision, 2005. ICCV 2005. Tenth IEEE International Conference on}, volume = {2}, year = {2005}, month = {2005/10//}, pages = {1466 -1473 Vol. 2 - 1466 -1473 Vol. 2}, abstract = {We propose a novel framework to build descriptors of local intensity that are invariant to general deformations. In this framework, an image is embedded as a 2D surface in 3D space, with intensity weighted relative to distance in x-y. We show that as this weight increases, geodesic distances on the embedded surface are less affected by image deformations. In the limit, distances are deformation invariant. We use geodesic sampling to get neighborhood samples for interest points, and then use a geodesic-intensity histogram (GIH) as a deformation invariant local descriptor. In addition to its invariance, the new descriptor automatically finds its support region. This means it can safely gather information from a large neighborhood to improve discriminability. Furthermore, we propose a matching method for this descriptor that is invariant to affine lighting changes. We have tested this new descriptor on interest point matching for two data sets, one with synthetic deformation and lighting change, and another with real non-affine deformations. Our method shows promising matching results compared to several other approaches}, keywords = {deformation, deformations;nonaffine, deformations;point, descriptor;geodesic, distances;geodesic, geometry;differential, geometry;image, histogram;image, image, invariant, local, matching;computational, matching;deformation, matching;image, morphing;, sampling;geodesic-intensity}, doi = {10.1109/ICCV.2005.67}, author = {Ling,Haibin and Jacobs, David W.} } @article {15242, title = {On degree constrained shortest paths}, journal = {Algorithms{\textendash}ESA 2005}, year = {2005}, month = {2005///}, pages = {259 - 270}, abstract = {Traditional shortest path problems play a central role in both the design and use of communication networks and have been studied extensively. In this work, we consider a variant of the shortest path problem. The network has two kinds of edges, {\textquotedblleft}actual{\textquotedblright} edges and {\textquotedblleft}potential{\textquotedblright} edges. In addition, each vertex has a degree/interface constraint. We wish to compute a shortest path in the graph that maintains feasibility when we convert the potential edges on the shortest path to actual edges. The central difficulty is when a node has only one free interface, and the unconstrained shortest path chooses two potential edges incident on this node. We first show that this problem can be solved in polynomial time by reducing it to the minimum weighted perfect matching problem. The number of steps taken by this algorithm is O(|E|2 log |E|) for the single-source single-destination case. In other words, for each v we compute the shortest path P v such that converting the potential edges on P v to actual edges, does not violate any degree constraint. We then develop more efficient algorithms by extending Dijkstra{\textquoteright}s shortest path algorithm. The number of steps taken by the latter algorithm is O(|E||V|), even for the single-source all destination case.}, doi = {10.1007/11561071_25}, author = {Khuller, Samir and Lee,K. and Shayman,M.} } @conference {18560, title = {Design and implementation of a routing control platform}, booktitle = {Proceedings of the 2nd conference on Symposium on Networked Systems Design \& Implementation - Volume 2}, series = {NSDI{\textquoteright}05}, year = {2005}, month = {2005///}, pages = {15 - 28}, publisher = {USENIX Association}, organization = {USENIX Association}, address = {Berkeley, CA, USA}, abstract = {The routers in an Autonomous System (AS) must distribute the information they learn about how to reach external destinations. Unfortunately, today{\textquoteright}s internal Border Gateway Protocol (iBGP) architectures have serious problems: a "full mesh" iBGP configuration does not scale to large networks and "route reflection" can introduce problems such as protocol oscillations and persistent loops. Instead, we argue that a Routing Control Platform (RCP) should collect information about external destinations and internal topology and select the BGP routes for each router in an AS. RCP is a logically-centralized platform, separate from the IP forwarding plane, that performs route selection on behalf of routers and communicates selected routes to the routers using the unmodified iBGP protocol. RCP provides scalability without sacrificing correctness. In this paper, we present the design and implementation of an RCP prototype on commodity hardware. Using traces of BGP and internal routing data from a Tier-1 backbone, we demonstrate that RCP is fast and reliable enough to drive the BGP routing decisions for a large network. We show that RCP assigns routes correctly, even when the functionality is replicated and distributed, and that networks using RCP can expect comparable convergence delays to those using today{\textquoteright}s iBGP architectures.}, url = {http://dl.acm.org/citation.cfm?id=1251203.1251205}, author = {Caesar,Matthew and Caldwell,Donald and Feamster, Nick and Rexford,Jennifer and Shaikh,Aman and van der Merwe,Jacobus} } @article {17062, title = {Designing a Metadata-Driven Visual Information Browser for Federal Statistics (2003)}, journal = {Institute for Systems Research Technical Reports}, year = {2005}, month = {2005///}, abstract = {When looking for federal statistics, finding the right table, chart or report can be a daunting task for anyone not thoroughly familiar with the federal statistical system. Search tools help, but differing terminologies within the statistical agencies and a lack of familiarity of terms by information seekers limit their effectiveness. The FedStats Browser is a design for visually browsing federal agency statistical products and publications, using techniques that allow users to reformulate queries and iteratively refine results via simple, reversible actions with immediate feedback. This paper also discusses the characteristics of metadata needed for such a browser and the challenges inherent in acquiring that metadata.}, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/6500}, author = {Kules,Bill and Shneiderman, Ben} } @article {17065, title = {Designing for Fun: Can we design user interfaces to be more fun? (2004)}, journal = {Institute for Systems Research Technical Reports}, year = {2005}, month = {2005///}, abstract = {User interfaces are taking their place in the world of fashion and style, which is great news. Just as dining out is more than getting a balanced diet and wearing clothes is more than staying warm, using interfaces is becoming a personal statement. It great that designers are turning attention to fun, as a separate design space, distinct from functionality, usability, and reliability. Did anyone notice that fun is part of functionality?}, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/6520}, author = {Shneiderman, Ben} } @book {16101, title = {Designing The User Interface}, year = {2005}, month = {2005///}, publisher = {Pearson Addison Wesley, USA}, organization = {Pearson Addison Wesley, USA}, author = {Shneiderman, Ben and Plaisant, Catherine} } @conference {18561, title = {Detecting BGP configuration faults with static analysis}, booktitle = {Proceedings of the 2nd conference on Symposium on Networked Systems Design \& Implementation - Volume 2}, series = {NSDI{\textquoteright}05}, year = {2005}, month = {2005///}, pages = {43 - 56}, publisher = {USENIX Association}, organization = {USENIX Association}, address = {Berkeley, CA, USA}, abstract = {The Internet is composed of many independent autonomous systems (ASes) that exchange reachability information to destinations using the Border Gateway Protocol (BGP). Network operators in each AS configure BGP routers to control the routes that are learned, selected, and announced to other routers. Faults in BGP configuration can cause forwarding loops, packet loss, and unintended paths between hosts, each of which constitutes a failure of the Internet routing infrastructure. This paper describes the design and implementation of rcc, the router configuration checker, a tool that finds faults in BGP configurations using static analysis. rcc detects faults by checking constraints that are based on a high-level correctness specification. rcc detects two broad classes of faults: route validity faults, where routers may learn routes that do not correspond to usable paths, and path visibility faults, where routers may fail to learn routes for paths that exist in the network. rcc enables network operators to test and debug configurations before deploying them in an operational network, improving on the status quo where most faults are detected only during operation. rcc has been downloaded by more than sixty-five network operators to date, some of whom have shared their configurations with us. We analyze network-wide configurations from 17 different ASes to detect a wide variety of faults and use these findings to motivate improvements to the Internet routing infrastructure.}, url = {http://dl.acm.org/citation.cfm?id=1251203.1251207}, author = {Feamster, Nick and Balakrishnan,Hari} } @inbook {14211, title = {Detecting Independent 3D Movement}, booktitle = {Handbook of Geometric ComputingHandbook of Geometric Computing}, year = {2005}, month = {2005///}, pages = {383 - 401}, publisher = {Springer Berlin Heidelberg}, organization = {Springer Berlin Heidelberg}, isbn = {978-3-540-28247-1}, url = {http://dx.doi.org/10.1007/3-540-28247-5_12}, author = {Corrochano,Eduardo Bayro and Ogale, Abhijit S. and Ferm{\"u}ller, Cornelia and Aloimonos, J.} } @conference {13188, title = {Detecting rotational symmetries}, booktitle = {Computer Vision, 2005. ICCV 2005. Tenth IEEE International Conference on}, volume = {2}, year = {2005}, month = {2005/10//}, pages = {954 - 961 Vol. 2 - 954 - 961 Vol. 2}, abstract = {We present an algorithm for detecting multiple rotational symmetries in natural images. Given an image, its gradient magnitude field is computed, and information from the gradients is spread using a diffusion process in the form of a gradient vector flow (GVF) field. We construct a graph whose nodes correspond to pixels in tire image, connecting points that are likely to be rotated versions of one another The n-cycles present in tire graph are made to vote for Cn symmetries, their votes being weighted by the errors in transformation between GVF in the neighborhood of the voting points, and the irregularity of the n-sided polygons formed by the voters. The votes are accumulated at tire centroids of possible rotational symmetries, generating a confidence map for each order of symmetry. We tested the method with several natural images.}, keywords = {axial, computational, detection;, field;, flow;, geometry;, gradient, graph, graph;, image, image;, magnitude, methods;, multiple, n-sided, object, polygons;, recognition;, rotational, symmetries;, symmetry;, theory;, tire, tyres;, vector}, doi = {10.1109/ICCV.2005.71}, author = {Shiv Naga Prasad,V. and Davis, Larry S.} } @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 {19032, title = {Detection of denial-of-message attacks on sensor network broadcasts}, year = {2005}, month = {2005}, pages = {64 - 78}, abstract = {So far sensor network broadcast protocols assume a trustworthy environment. However in safety and mission-critical sensor networks this assumption may not be valid and some sensor nodes might be adversarial. In these environments, malicious sensor nodes can deprive other nodes from receiving a broadcast message. We call this attack a denial-of-message attack (DoM). In this paper we model and analyze this attack, and present countermeasures. We present SIS, a secure implicit sampling scheme that permits a broadcasting base station to probabilistically detect the failure of nodes to receive its broadcast, even if these failures result from an attacker motivated to induce these failures undetectably. SIS works by eliciting authenticated acknowledgments from a subset of nodes per broadcast, where the subset is unpredictable to the attacker and tunable so as to mitigate acknowledgment implosion on the base station. We use a game-theoretic approach to evaluate this scheme in the face of an optimal attacker that attempts to maximize the number of nodes it denies the broadcast while remaining undetected by the base station, and show that SIS significantly constrains such an attacker even in sensor networks exhibiting high intrinsic loss rates. We also discuss extensions that permit more targeted detection capabilities.}, keywords = {authenticated acknowledgments, broadcast channels, broadcast protocols, broadcasting base station, countermeasures, denial-of-message attacks, DoM, game theory, game-theoretic approach, malicious sensor nodes, Mobile computing, optimal attacker, probabilistic detection, probability, Protocols, Sampling methods, secure implicit sampling, sensor network broadcasts, SIS, telecommunication security, Wireless sensor networks}, author = {McCune, J.M. and Elaine Shi and Perrig, A. and Reiter, M.K.} } @article {17079, title = {Determining Causes and Severity of End-User Frustration (2002)}, year = {2005}, month = {2005///}, abstract = {While computers are beneficial to individuals and society, frequently, users encounter frustrating experiences when using computers. This study attempts to measure, through 111 participants, the frequency, cause, and the level of severity of frustrating experiences. The data showed that frustrating experiences happen on a frequent basis. The applications in which the frustrating experiences happened most frequently were web browsing, e-mail, and word processing. The most-cited causes of frustrating experiences were error messages, dropped network connections, long download times, and hard-to-find features. The time lost due to frustrating experiences ranged from 47-53\% of time spent on a computer depending on the location and study method. After discarding extreme cases the time lost was still above 38\%. These disturbing results should be a basis for future study.}, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/6493}, author = {Ceaparu,Irina and Lazar,Jonathan and Bessiere,Katie and Robinson,John and Shneiderman, Ben} } @conference {16558, title = {Diagnostic problem solving using swarm intelligence}, booktitle = {Swarm Intelligence Symposium, 2005. SIS 2005. Proceedings 2005 IEEE}, year = {2005}, month = {2005///}, pages = {365 - 372}, author = {Lapizco-Encinas,G. C and Reggia, James A.} } @article {15869, title = {Dictionary-based cross-language retrieval}, journal = {Information Processing and Management}, volume = {41}, year = {2005}, month = {2005///}, pages = {523 - 547}, author = {Levow,G.A. and Oard, Douglas and Resnik, Philip} } @article {16689, title = {Dictionary-based techniques for cross-language information retrieval}, journal = {Information Processing \& Management}, volume = {41}, year = {2005}, month = {2005/05//}, pages = {523 - 547}, abstract = {Cross-language information retrieval (CLIR) systems allow users to find documents written in different languages from that of their query. Simple knowledge structures such as bilingual term lists have proven to be a remarkably useful basis for bridging that language gap. A broad array of dictionary-based techniques have demonstrated utility, but comparison across techniques has been difficult because evaluation results often span only a limited range of conditions. This article identifies the key issues in dictionary-based CLIR, develops unified frameworks for term selection and term translation that help to explain the relationships among existing techniques, and illustrates the effect of those techniques using four contrasting languages for systematic experiments with a uniform query translation architecture. Key results include identification of a previously unseen dependence of pre- and post-translation expansion on orthographic cognates and development of a query-specific measure for translation fanout that helps to explain the utility of structured query methods.}, keywords = {Cross-language information retrieval, Dictionary-based translation, Ranked retrieval}, isbn = {0306-4573}, doi = {10.1016/j.ipm.2004.06.012}, url = {http://www.sciencedirect.com/science/article/pii/S0306457304000810}, author = {Levow,Gina-Anne and Oard, Douglas and Resnik, Philip} } @conference {12279, title = {Differentiated traffic engineering for QoS provisioning}, booktitle = {INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings IEEE}, volume = {4}, year = {2005}, month = {2005/03//}, pages = {2349 - 2359 vol. 4 - 2349 - 2359 vol. 4}, abstract = {We introduce a new approach for QoS provisioning in packet networks based on the notion of differentiated traffic engineering (DTE). We consider a single AS network capable of source based multi-path routing. We do not require sophisticated queuing or per-class scheduling at individual routers; instead, if a link is used to forward QoS sensitive packets, we maintain its utilization below a threshold. As a consequence, DTE eliminates the need for per-flow (IntServ) or per-class (DiffServ) packet processing tasks such as traffic classification, queueing, shaping, policing and scheduling in the core and hence poses a lower burden on the network management unit. Conversely, DTE utilizes network bandwidth much more efficiently than simple over-provisioning. In this paper, we propose a complete architecture and an algorithmic structure for DTE. We show that our scheme can be formulated as a non-convex optimization problem, and we present an optimal solution framework based on simulated annealing. We present a simulation-based performance evaluation of DTE, and compare our scheme to existing (gradient projection) methods.}, keywords = {based, Computer, differentiated, DiffServ, DTE;, engineering;, evaluation;, link;, links;, management;, multipath, network, networks;, nonconvex, of, optimisation;, OPTIMIZATION, packet, performance, problem;, provisioning;, QoS, QUALITY, routing;, service;, simulation-based, source, Telecommunication, traffic, traffic;}, doi = {10.1109/INFCOM.2005.1498521}, author = {Tabatabaee,V. and Bhattacharjee, Bobby and La,R.J. and Shayman,M.A.} } @article {17082, title = {Direct Annotation: A Drag-and-Drop Strategy for Labeling Photos (2000)}, journal = {Institute for Systems Research Technical Reports}, year = {2005}, month = {2005///}, abstract = {Annotating photos is such a time-consuming, tedious and error-prone data entry task that it discourages most owners of personal photo libraries. By allowing users to drag labels such as personal names from a scrolling list and drop them on a photo, we believe we can make the task faster, easier and more appealing. Since the names are entered in a database, searching for all photos of a friend or family member is dramatically simplified. We describe the user interface design and the database schema to support direct annotation, as implemented in our PhotoFinder prototype.}, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/6471}, author = {Shneiderman, Ben and Kang,Hyunmo} } @conference {14175, title = {Discovering a language for human activity}, booktitle = {Proceedings of the AAAI 2005 Fall Symposium on Anticipatory Cognitive Embodied Systems, Washington, DC}, year = {2005}, month = {2005///}, author = {Guerra-Filho,G. and Ferm{\"u}ller, Cornelia and Aloimonos, J.} } @inbook {17795, title = {Distributed Algorithms for Dynamic Survivability of Multiagent Systems}, booktitle = {Computational Logic in Multi-Agent SystemsComputational Logic in Multi-Agent Systems}, series = {Lecture Notes in Computer Science}, volume = {3259}, year = {2005}, month = {2005///}, pages = {139 - 144}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {Though multiagent systems (MASs) are being increasingly used, few methods exist to ensure survivability of MASs. All existing methods suffer from two flaws. First, a centralized survivability algorithm (CSA) ensures survivability of the MAS {\textendash} unfortunately, if the node on which the CSA exists goes down, the survivability of the MAS is questionable. Second, no mechanism exists to change how the MAS is deployed when external factors trigger a re-evaluation of the survivability of the MAS. In this paper, we present three algorithms to address these two important problems. Our algorithms can be built on top of any CSA. Our algorithms are completely distributed and can handle external triggers to compute a new deployment. We report on experiments assessing the efficiency of these algorithms.}, keywords = {Computer, Science}, isbn = {978-3-540-24010-5}, url = {http://dx.doi.org/10.1007/978-3-540-30200-1_1}, author = {Subrahmanian,V. and Kraus,Sarit and Zhang,Yingqian}, editor = {Dix,J{\"u}rgen and Leite,Jo{\~a}o} } @conference {16309, title = {Distributed performance testing using statistical modeling}, booktitle = {Proceedings of the 1st international workshop on Advances in model-based testing}, year = {2005}, month = {2005///}, pages = {1 - 7}, author = {Karr,A. F and Porter, Adam} } @conference {16878, title = {A distributed quadtree index for peer-to-peer settings}, booktitle = {PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON DATA ENGINEERING}, volume = {21}, year = {2005}, month = {2005///}, pages = {254 - 254}, author = {Tanin,E. and Harwood,A. and Samet, Hanan} } @article {18699, title = {Diverse polyubiquitin interaction properties of ubiquitin-associated domains}, journal = {Nature Structural \& Molecular Biology}, volume = {12}, year = {2005}, month = {2005///}, pages = {708 - 714}, abstract = {The ubiquitin-associated (UBA) domain occurs frequently in proteins involved in ubiquitin-dependent signaling pathways. Although polyubiquitin chain binding is considered to be a defining feature of the UBA domain family, the generality of this property has not been established. Here we have surveyed the polyubiquitin interaction properties of 30 UBA domains, including 16 of 17 occurrences in budding yeast. The UBA domains sort into four classes that include linkage-selective polyubiquitin binders and domains that bind different chains (and monoubiquitin) in a nondiscriminatory manner; one notable class (30\%) did not bind any ubiquitin ligand surveyed. The properties of a given UBA domain are conserved from yeast to mammals. Their functional relevance is further suggested by the ability of an ectopic UBA domain to alter the specificity of a deubiquitylating enzyme in a predictable manner. Conversely, non-UBA sequences can modulate the interaction properties of a UBA domain.}, keywords = {apoptosis, basic cellular processes, Biochemistry, biophysics, cell biology, cell cycle, cell surface proteins, cell-cell interactions, checkpoints, chromatin, chromatin remodeling, chromatin structure, content, DNA recombination, DNA repair, DNA replication, Gene expression, Genetics, intracellular signaling, journal, macromolecules, mechanism, membrane processes, molecular, molecular basis of disease, molecular biology, molecular interactions, multi-component complexes, nature publishing group, nature structural molecular biology, nucleic acids, protein degradation, protein folding, protein processing, Proteins, regulation of transcription, regulation of translation, RNA, RNA processing, RNAi, signal transduction, single molecule studies, structure and function of proteins, transcription, translation}, isbn = {1545-9993}, doi = {10.1038/nsmb962}, url = {http://www.nature.com/nsmb/journal/v12/n8/full/nsmb962.html}, author = {Raasi,Shahri and Varadan,Ranjani and Fushman, David and Pickart,Cecile M.} } @conference {13539, title = {DOCLIB: A document processing research tool}, booktitle = {Symposium on Document Image Understanding Technology}, year = {2005}, month = {2005///}, pages = {159 - 163}, abstract = {Often, valuable document processing intellectual capital is lost due to staff transitions or project restructuring prior to technology transfer. Furthermore, hardware and software integrity, dependencies, and compatibility are critical components that often impede technology migration. While many open source tools attempt to mitigate these issues, they do not always address specific design needs and tailored-process that Government organizations must adhere to. This paper addresses the need for a common document processing research vehicle through which institutions can develop and share research-related software and applications across academic, business, and Government domains.}, author = {Chen,Kevin and Jaeger,Stefan and Zhu,Guangyu and David Doermann} } @conference {13547, title = {Document Ranking by Layout Relevance}, booktitle = {ICDAR}, year = {2005}, month = {2005/08//}, pages = {362 - 366}, abstract = {This paper describes the development of a new document ranking system based on layout similarity. The user has a need represented by a set of {\textquotedblright}wanted{\textquotedblright} documents, and the system ranks documents in the collection according to this need. Rather than performing complete document analysis, the system extracts text lines, and models layouts as relationships between pairs of these lines. This paper explores three novel feature sets to support scoring in large document collections. First, pairs of lines are used to form quadrilaterals, which are represented by their turning functions. A non- Euclidean distance is used to measure similarity. Second, the quadrilaterals are represented by 5DEuclidean vectors, and third, each line is represented by a 5DEuclidean vector. We compare the classification performance and computation speed of these three feature sets using a large database of diverse documents including forms, academic papers and handwritten pages in English and Arabic. The approach using quadrilaterals and turning functions produces slightly better results, but the approach using vectors to represent text lines is much faster for large document databases.}, author = {Huang,Mei and DeMenthon,Daniel and David Doermann and Golebiowski,Lynn} } @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 {17097, title = {Dynamic Aggregation to Support Pattern Discovery: A Case Study with Web Logs (2001)}, year = {2005}, month = {2005///}, abstract = {Rapid growth of digital data collections is overwhelming the capabilities of humans to comprehend them without aid. The extraction of useful data from large raw data sets is something that humans do poorly because of the overwhelming amount of information. Aggregation is a technique that extracts important aspect from groups of data thus reducing the amount that the user has to deal with at one time, thereby enabling them to discover patterns, outliers, gaps, and clusters. Previous mechanisms for interactive exploration with aggregated data was either too complex to use or too limited in scope. This paper proposes a new technique for dynamic aggregation that can combine with dynamic queries to support most of the tasks involved in data manipulation.}, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/6487}, author = {Tang,Lida and Shneiderman, Ben} } @conference {12334, title = {Dynamic configuration of dataflow graph topology for DSP system design}, booktitle = {Proc. of the Int. Conf. on Acoustics, Speech, and Signal Processing}, year = {2005}, month = {2005///}, pages = {69 - 72}, author = {Ko,D. I and Bhattacharyya, Shuvra S.} } @article {14680, title = {Dynamic inference of polymorphic lock types}, journal = {Science of Computer Programming}, volume = {58}, year = {2005}, month = {2005/12//}, pages = {366 - 383}, abstract = {We present FindLocks, an approach for automatically proving the absence of data races in multi-threaded Java programs, using a combination of dynamic and static analysis. The program in question is instrumented so that when executed it will gather information about locking relationships. This information is then used to automatically generate annotations needed to type check the program using the Race-Free Java type system. Programs that type check are sure to be free from races. We call this technique dynamic annotation inference. We describe the design and implementation of our approach, and our experience applying the tool to a variety of Java programs. We have found that when using a reasonably comprehensive test suite, which is easy for small programs but harder for larger ones, the approach generates useful annotations.}, keywords = {Data races, Dynamic analysis, java, Multithreading, Type inference}, isbn = {0167-6423}, doi = {10.1016/j.scico.2005.03.003}, url = {http://www.sciencedirect.com/science/article/pii/S0167642305000705}, author = {Rose,James and Swamy,Nikhil and Hicks, Michael W.} } @article {17099, title = {Dynamic Layout Management in a Multimedia Bulletin Board (2002)}, year = {2005}, month = {2005///}, abstract = {This paper proposes a novel user interface to manage the dynamic layout of multimedia objects in the Multimedia Bulletin Board (MBB) system. The MBB has been designed and implemented as a prototype of an asynchronous communication system that enables rich communication and collaboration among users of multimedia objects such as text, image, moving picture, sound, voice, web, office document, and other files. The layout properties of the multimedia objects on a board (e.g. x-y position, size, z-order, partial occlusion, explicit and implicit links, etc.) show important and useful information on the user dynamics occurring within a board. However, a fixed layout created and edited by multiple users may prevent users from recognizing and identifying useful information. This paper resolves this problem with a novel user-controlled layout strategy made visible with dynamic layout templates (DLT). Users can reorganize the objects to extract meaningful information related to time, source, geographic location, or topic.}, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/6489}, author = {Kang,Hyunmo and Shneiderman, Ben and Wolff,Gregory J} } @article {18203, title = {Dynamic network resource allocation using multimedia content features and ...}, volume = {09/795,952}, year = {2005}, month = {2005/09/20/}, abstract = {A method for dynamically allocating network resources while transferring multimedia at variable bit-rates in a network extracts first content features from the multimedia to determine renegotiation points and observation periods. Second content features and traffic features are extracted from the multimedia bit stream during the observation periods. The second content features and the traffic features are combined in a neural network to predict the network resources to be allocated at the renegotiation points.}, url = {http://www.google.com/patents?id=dToWAAAAEBAJ}, author = {M. Wu and Joyce,Robert A. and Vetro,Anthony and Wong,Hau-San and Guan,Ling and Kung,Sun-Yuan}, editor = {Mitsubishi Electric Research Labs, Inc.} } @article {17102, title = {Dynamic Queries and Brushing on Choropleth Maps (2001)}, year = {2005}, month = {2005///}, abstract = {Users who must combine demographic, economic or other data in a geographic context are often hampered by the integration of tabular and map representations. Static, paper-based solutions limit the amount of data that can be placed on a single map or table. By providing an effective user interface, we believe that researchers, journalists, teachers, and students can explore complex data sets more rapidly and effectively. This paper presents Dynamaps, a generalized map-based information-visualization tool for dynamic queries and brushing on choropleth maps. Users can use color coding to show a variable on each geographic region, and then filter out areas that do not meet the desired criteria. In addition, a scattergram view and a detailson- demand window support overviews and specific fact finding.}, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/6481}, author = {Dang,Gunjan and North,Chris and Shneiderman, Ben} } @article {17107, title = {Dynamic Query Chloropleth Maps for Information Seeking and Decision Making (2003)}, year = {2005}, month = {2005///}, abstract = {Information retrieval and visualization can be combined in dynamic query systems that allow users unparalleled access to information for decision making. In this paper, we report on the development and evaluation of a dynamic query system (YMap) that displays information on a chloropleth map using double thumb sliders to select ranges of query variables. The YMap prototype is a Java-Applet that supports panning and zooming. Several usability studies were conducted on early prototypes that resulted in the current version. Applications of YMap for decision making tasks are discussed.}, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/6505}, author = {Norman,Kent L and Zhao,Haixia and Shneiderman, Ben and Golub,Evan} } @article {17110, title = {Dynamic query tools for time series data sets: Timebox widgets for interactive exploration (2004)}, year = {2005}, month = {2005///}, abstract = {Timeboxes are rectangular widgets that can be used in direct-manipulation graphical user interfaces (GUIs) to specify query constraints on time series data sets. Timeboxes are used to specify simultaneously two sets of constraints: given a set of N time series profiles, a timebox covering time periods x1...x2 (x1rx2) and values y1...y2 (y1ry2) will retrieve only those nAN that have values y1ryry2 during all times x1rxrx2. TimeSearcher is an information visualization tool that combines timebox queries with overview displays, query-byexample facilities, and support for queries over multiple time-varying attributes. Query manipulation tools including pattern inversion and eaders \& laggards graphical bookmarks provide additional support for interactive exploration of data sets. Extensions to the basic timebox model that provide additional expressivity include variable time timeboxes, which can be used to express queries with variability in the time interval, and angular queries, which search for ranges of differentials, rather than absolute values. Analysis of the algorithmic requirements for providing dynamic query performance for timebox queries showed that a sequential search outperformed searches based on geometric indices. Design studies helped identify the strengths and weaknesses of the query tools. Extended case studies involving the analysis of two different types of data from molecular biology experiments provided valuable feedback and validated the utility of both the timebox model and the TimeSearcher tool.

Timesearcher is available [url=http://www.cs.umd.edu/hcil/ timesearcher]online.[/url]}, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/6521}, author = {Hochheiser,Harry and Shneiderman, Ben} } @article {17112, title = {Dynamic Query Visualizations on World Wide Web Clients: A DHTML Solution for Maps and Scattergrams (2002)}, year = {2005}, month = {2005///}, abstract = {Dynamic queries are gaining popularity as a method for interactive information visualization. Many implementations have been made on personal computers, and there is increasing interest in web-based designs. While Java and Flash strategies have been developed, we believe that a Dynamic HTML implementation could help promote more widespread use. We implemented double-box range sliders with choropleth maps and scattergrams, which are two popular visualizations, using HTML layers and tables. This paper describes our methods for slider control, visual presentation, and displaying/updating results for these visualizations. Visual design issues innovations and performance enhancements were necessary to create viable designs.}, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/6491}, author = {Golub,Evan and Shneiderman, Ben} } @article {17114, title = {Dynamic Querying for Pattern Identification in Microarray and Genomic Data (2003)}, year = {2005}, month = {2005///}, abstract = {Data sets involving linear ordered sequences are a recurring theme in bioinformatics. Dynamic query tools that support exploration of these data sets can be useful for identifying patterns of interest. This paper describes the use of one such tool TimeSearcher - to interactively explore linear sequence data sets taken from two bioinformatics problems. Microarray time course data sets involve expression levels for large numbers of genes over multiple time points. TimeSearcher can be used to interactively search these data sets for genes with expression profiles of interest. The occurrence frequencies of short sequences of DNA in aligned exons can be used to identify sequences that play a role in the pre-mRNA splicing. TimeSearcher can be used to search these data sets for candidate splicing signals.}, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/6503}, author = {Hochheiser,Harry and Baehrecke,Eric H and Mount, Stephen M. and Shneiderman, Ben} } @article {14686, title = {Dynamic software updating}, journal = {ACM Trans. Program. Lang. Syst.}, volume = {27}, year = {2005}, month = {2005/11//}, pages = {1049 - 1096}, abstract = {Many important applications must run continuously and without interruption, and yet also must be changed to fix bugs or upgrade functionality. No prior general-purpose methodology for dynamic updating achieves a practical balance between flexibility, robustness, low overhead, ease of use, and low cost.We present an approach for C-like languages that provides type-safe dynamic updating of native code in an extremely flexible manner---code, data, and types may be updated, at programmer-determined times---and permits the use of automated tools to aid the programmer in the updating process. Our system is based on dynamic patches that contain both the updated code and the code needed to transition from the old version to the new. A novel aspect of our patches is that they consist of verifiable native code (e.g. Proof-Carrying Code or Typed Assembly Language), which is native code accompanied by annotations that allow online verification of the code{\textquoteright}s safety. We discuss how patches are generated mostly automatically, how they are applied using dynamic-linking technology, and how code is compiled to make it updateable.To concretely illustrate our system, we have implemented a dynamically updateable web server, FlashEd. We discuss our experience building and maintaining FlashEd, and generalize to present observations about updateable software development. Performance experiments show that for FlashEd, the overhead due to updating is low: typically less than 1 percent.}, keywords = {dynamic software updating, typed assembly language}, isbn = {0164-0925}, doi = {10.1145/1108970.1108971}, url = {http://doi.acm.org/10.1145/1108970.1108971}, author = {Hicks, Michael W. and Nettles,Scott} } @article {14687, title = {Dynamic updating of information-flow policies}, journal = {Proceedings of the International Workshop on Foundations of Computer Security (FCS)}, year = {2005}, month = {2005///}, author = {Hicks, Michael W. and Tse,S. and Hicks,B. and Zdancewic,S.} } @conference {14807, title = {Data Centric Cache Measurement on the Intel ltanium 2 Processor}, booktitle = {Proceedings of the 2004 ACM/IEEE conference on Supercomputing}, series = {SC {\textquoteright}04}, year = {2004}, month = {2004///}, pages = {58{\textendash} - 58{\textendash}}, publisher = {IEEE Computer Society}, organization = {IEEE Computer Society}, abstract = {Processor speed continues to increase faster than the speed of access to main memory, making effective use of memory caches more important. Information about an application{\'y}s interaction with the cache is therefore critical to performance tuning. To be most useful, tools that measure this information should relate it to the source code level data structures in an application. We describe how to gather such information by using hardware performance counters to sample cache miss addresses, and present a new tool named Cache Scope that does this using the Intel Itanium 2 performance monitors. We present experimental results concerning Cache Scope{\'y}s accuracy and perturbation of cache behavior. We also describe a case study of using Cache Scope to tune two applications, achieving 24\% and 19\% reductions in running time.}, isbn = {0-7695-2153-3}, doi = {http://dx.doi.org/10.1109/SC.2004.21}, url = {http://dx.doi.org/10.1109/SC.2004.21}, author = {Buck, Bryan R and Hollingsworth, Jeffrey K} } @article {18187, title = {Data hiding in binary image for authentication and annotation}, journal = {Multimedia, IEEE Transactions on}, volume = {6}, year = {2004}, month = {2004/08//}, pages = {528 - 538}, abstract = {This paper proposes a new method to embed data in binary images, including scanned text, figures, and signatures. The method manipulates "flippable" pixels to enforce specific block-based relationship in order to embed a significant amount of data without causing noticeable artifacts. Shuffling is applied before embedding to equalize the uneven embedding capacity from region to region. The hidden data can be extracted without using the original image, and can also be accurately extracted after high quality printing and scanning with the help of a few registration marks. The proposed data embedding method can be used to detect unauthorized use of a digitized signature, and annotate or authenticate binary documents. The paper also presents analysis and discussions on robustness and security issues.}, keywords = {annotation;, authentication;, binary, coding;, data, digital, digitized, document, EMBEDDING, encapsulation;, extraction;, feature, hiding;, image, image;, method;, signature;, unauthorized, user;, watermarking;}, isbn = {1520-9210}, doi = {10.1109/TMM.2004.830814}, author = {M. Wu and Liu,Bede} } @conference {18190, title = {Data hiding in curves for collusion-resistant digital fingerprinting}, booktitle = {Image Processing, 2004. ICIP {\textquoteright}04. 2004 International Conference on}, volume = {1}, year = {2004}, month = {2004/10//}, pages = {51 - 54 Vol. 1 - 51 - 54 Vol. 1}, abstract = {This paper presents a new data hiding method for curves. The proposed algorithm parameterizes a curve using the B-spline model and adds a spread spectrum sequence in the coordinates of the B-spline control points. We demonstrate through experiments the robustness of the proposed data hiding algorithm against printing-and-scanning and collusions, and show its feasibility for collusion-resistant fingerprinting of topographic maps as well as writings/drawings from pen-based input devices.}, keywords = {(mathematics);, B-spline, coding;, collusion-resistant, CONTROL, data, devices;, digital, document, encapsulation;, extraction;, feature, fingerprinting;, hiding;, image, INPUT, maps;, model;, pen-based, points;, printing-and-scanning, processing;, robustness;, sequence;, spectrum, splines, spread, topographic, watermarking;}, doi = {10.1109/ICIP.2004.1418687}, author = {Gou,Hongmei and M. Wu} } @article {15240, title = {Data migration on parallel disks}, journal = {Algorithms{\textendash}ESA 2004}, year = {2004}, month = {2004///}, pages = {689 - 701}, abstract = {Our work is motivated by the problem of managing data on storage devices, typically a set of disks. Such storage servers are used as web servers or multimedia servers, for handling high demand for data. As the system is running, it needs to dynamically respond to changes in demand for different data items. There are known algorithms for mapping demand to a layout. When the demand changes, a new layout is computed. In this work we study the data migration problem, which arises when we need to quickly change one layout to another. This problem has been studied earlier when for each disk the new layout has been prescribed. However, to apply these algorithms effectively, we identify another problem that we refer to as the correspondence problem, whose solution has a significant impact on the solution for the data migration problem. We study algorithms for the data migration problem in more detail and identify variations of the basic algorithm that seem to improve performance in practice, even though some of the variations have poor worst case behavior.}, doi = {10.1007/978-3-540-30140-0_61}, author = {Golubchik,L. and Khuller, Samir and Kim,Y. A and Shargorodskaya,S. and Wan,Y. C} } @article {14481, title = {Data sciences technology for homeland security information management and knowledge discovery}, journal = {Report of the DHS Workshop Data Sciences, Jointly Released by Sandia National Laboratories and Lawrence Livermore National Laboratory, Alexandria, Va}, year = {2004}, month = {2004///}, author = {Kolda,T. and Brown,D and Corones,J. and Critchlow,T. and Eliassi-Rad,T. and Getoor, Lise and Hendrickson,B. and Kumar, V. and Lambert,D. and Matarazzo,C.} } @conference {13256, title = {A data structure for non-manifold simplicial d-complexes}, booktitle = {Proceedings of the 2004 Eurographics/ACM SIGGRAPH symposium on Geometry processing}, series = {SGP {\textquoteright}04}, year = {2004}, month = {2004///}, pages = {83 - 92}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {We propose a data structure for d-dimensional simplicial complexes, that we call the Simplified Incidence Graph (SIG). The simplified incidence graph encodes all simplices of a simplicial complex together with a set of boundary and partial co-boundary topological relations. It is a dimension-independent data structure in the sense that it can represent objects of arbitrary dimensions. It scales well to the manifold case, i.e. it exhibits a small overhead when applied to simplicial complexes with a manifold domain, Here, we present efficient navigation algorithms for retrieving all topological relations from a SIG, and an algorithm for generating a SIG from a representation of the complex as an incidence graph. Finally, we compare the simplified incidence graph with the incidence graph, with a widely-used data structure for d-dimensional pseudo-manifold simplicial complexes, and with two data structures specific for two-and three-dimensional simplicial complexes.}, isbn = {3-905673-13-4}, doi = {10.1145/1057432.1057444}, url = {http://doi.acm.org/10.1145/1057432.1057444}, author = {De Floriani, Leila and Greenfieldboyce,David and Hui,Annie} } @book {15668, title = {Data Structures and Algorithms in C++}, year = {2004}, month = {2004///}, publisher = {John Wiley \& Sons Inc}, organization = {John Wiley \& Sons Inc}, author = {Goodrich,M. T and Tamassia,R. and Mount, Dave} } @article {12210, title = {DateLens: A fisheye calendar interface for PDAs}, journal = {ACM Transactions on Computer-Human Interaction (TOCHI)}, volume = {11}, year = {2004}, month = {2004///}, pages = {90 - 119}, author = {Bederson, Benjamin B. and Clamage,A. and Czerwinski,M.P. and Robertson,G.G.} } @article {16883, title = {Decoupling partitioning and grouping: Overcoming shortcomings of spatial indexing with bucketing}, journal = {ACM Trans. Database Syst.}, volume = {29}, year = {2004}, month = {2004/12//}, pages = {789 - 830}, abstract = {The principle of decoupling the partitioning and grouping processes that form the basis of most spatial indexing methods that use tree directories of buckets is explored. The decoupling is designed to overcome the following drawbacks of traditional solutions:(1) multiple postings in disjoint space decomposition methods that lead to balanced trees such as the hB-tree where a node split in the event of node overflow may be such that one of the children of the node that was split becomes a child of both of the nodes resulting from the split;(2) multiple coverage and nondisjointness of methods based on object hierarchies such as the R-tree which lead to nonunique search paths;(3) directory nodes with similarly-shaped hyper-rectangle bounding boxes with minimum occupancy in disjoint space decomposition methods such as those based on quadtrees and k-d trees that make use of regular decomposition.The first two drawbacks are shown to be overcome by the BV-tree where as a result of decoupling the partitioning and grouping processes, the union of the regions associated with the nodes at a given level of the directory does not necessarily contain all of the data points although all searches take the same amount of time. The BV-tree is not plagued by the third drawback. The third drawback is shown to be overcome by the PK-tree where the grouping process is based on ensuring that every node has at least k objects or blocks. The PK-tree is not plagued by the first two drawbacks as they are inapplicable to it. In both cases, the downside of decoupling the partitioning and grouping processes is that the resulting structure is not necessarily balanced, although, since the nodes have a relatively large fanout, the deviation from a balanced structure is relatively small.}, keywords = {BV-trees, decoupling, object hierarchies, PK-trees, R-trees, space decomposition, spatial indexing}, isbn = {0362-5915}, doi = {10.1145/1042046.1042052}, url = {http://doi.acm.org/10.1145/1042046.1042052}, author = {Samet, Hanan} } @article {14414, title = {Deduplication and group detection using links}, journal = {KDD workshop on link analysis and group detection}, year = {2004}, month = {2004///}, abstract = {Clustering is a fundamental problem in data mining. Tradi-tionally, clustering is done based on the similarity of the at- tribute values of the entities to be clustered. More recently, there has been greater interest in clustering relational and structured data. Often times this data is best described as a graph, in which there are both entities, described by a collec- tion of attributes, and links between entities, representing the relations between them. Clustering in these scenarios becomes more complex, as we should also take into account the similarity of the entity links when we are clustering. We propose novel distance measures for clustering linked data, and show how they can be used to solve two important data mining tasks, entity deduplication and group discovery. }, author = {Bhattacharya,I. and Getoor, Lise} } @article {18381, title = {Defect evolution in a product line environment}, journal = {Journal of Systems and Software}, volume = {70}, year = {2004}, month = {2004/02//}, pages = {143 - 154}, abstract = {One mechanism used for monitoring the development of the Space Shuttle flight control software, in order to minimize any risks to the missions, is the independent verification and validation (IV\&V) process. Using data provided by both the Shuttle software developer and the IV\&V contractor, in this paper we describe the overall IV\&V process as used on the Space Shuttle program and provide an analysis of the use of metrics to document and control this process over multiple releases of this software. Our findings reaffirm the value of IV\&V, show the impact of IV\&V on multiple releases of a large complex software system, and indicate that some of the traditional measures of defect detection and repair are not applicable in a multiple-release environment such as this one.}, keywords = {Evolutionary software, Life and mission critical software, metrics, Process characterization, Product line development, Software independent verification and validation, Software safety and reliability, Space Shuttle program}, isbn = {0164-1212}, doi = {10.1016/S0164-1212(03)00013-X}, url = {http://www.sciencedirect.com/science/article/pii/S016412120300013X}, author = {Zelkowitz, Marvin V and Rus,Ioana} } @conference {16631, title = {A descriptive encoding language for evolving modular neural networks}, booktitle = {Genetic and Evolutionary Computation{\textendash}GECCO 2004}, year = {2004}, month = {2004///}, pages = {519 - 530}, author = {Jung,J. Y and Reggia, James A.} } @article {17066, title = {Designing for fun: how can we design user interfaces to be more fun?}, journal = {Interactions}, volume = {11}, year = {2004}, month = {2004/09//}, pages = {48 - 50}, isbn = {1072-5520}, doi = {10.1145/1015530.1015552}, url = {http://doi.acm.org/10.1145/1015530.1015552}, author = {Shneiderman, Ben} } @article {19031, title = {Designing secure sensor networks}, journal = {Wireless Communications, IEEE}, volume = {11}, year = {2004}, month = {2004}, pages = {38 - 43}, abstract = {Sensor networks are expected to play an essential role in the upcoming age of pervasive computing. Due to their constraints in computation, memory, and power resources, their susceptibility to physical capture, and use of wireless communications, security is a challenge in these networks. The scale of deployments of wireless sensor networks require careful decisions and trade-offs among various security measures. The authors discuss these issues and consider mechanisms to achieve secure communication in these networks.}, keywords = {Pervasive computing, secure sensor network design, telecommunication security, Ubiquitous Computing, wireless sensor network, Wireless sensor networks}, isbn = {1536-1284}, author = {Elaine Shi and Perrig, A.} } @book {16119, title = {Designing the user interface: Strategies for Effective Human-Computer Interaction}, year = {2004}, month = {2004///}, publisher = {Pearson Higher Education}, organization = {Pearson Higher Education}, author = {Plaisant, Catherine and Schneiderman,B.} } @book {16304, title = {Detecting and correcting a failure sequence in a computer system before a failure occurs}, year = {2004}, month = {2004/02//}, publisher = {Google Patents}, organization = {Google Patents}, author = {Gross,K. C and Votta,L. G. and Porter, Adam} } @article {17078, title = {Determining Causes and Severity of End-User Frustration}, journal = {International Journal of Human-Computer Interaction}, volume = {17}, year = {2004}, month = {2004///}, pages = {333 - 356}, abstract = {Although computers are beneficial to individuals and society, frequently users encounter frustrating experiences when using computers. This study represents an attempt to measure, in 111 participants, the frequency, the cause, and the level of severity of frustrating experiences. The data show that frustrating experiences happen on a frequent basis. The applications in which the frustrating experiences happened most frequently were Web browsing, e-mail, and word processing. The most-cited causes of frustrating experiences were error messages, dropped network connections, long download times, and hard-to-find features. The time lost due to frustrating experiences ranged from 47\% to 53\% of time spent on a computer, depending on the location and study method. After extreme cases were discarded, the time lost was still above 38\%. These disturbing results should be a basis for future study.Although computers are beneficial to individuals and society, frequently users encounter frustrating experiences when using computers. This study represents an attempt to measure, in 111 participants, the frequency, the cause, and the level of severity of frustrating experiences. The data show that frustrating experiences happen on a frequent basis. The applications in which the frustrating experiences happened most frequently were Web browsing, e-mail, and word processing. The most-cited causes of frustrating experiences were error messages, dropped network connections, long download times, and hard-to-find features. The time lost due to frustrating experiences ranged from 47\% to 53\% of time spent on a computer, depending on the location and study method. After extreme cases were discarded, the time lost was still above 38\%. These disturbing results should be a basis for future study. }, isbn = {1044-7318}, doi = {10.1207/s15327590ijhc1703_3}, url = {http://www.tandfonline.com/doi/abs/10.1207/s15327590ijhc1703_3}, author = {Ceaparu,Irina and Lazar,Jonathan and Bessiere,Katie and Robinson,John and Shneiderman, Ben} } @conference {19447, title = {Developing Locally Relevant Software Applications for Rural Areas: A South African Example}, booktitle = {SAICSIT {\textquoteright}04}, series = {SAICSIT {\textquoteright}04}, year = {2004}, month = {2004///}, pages = {239 - 243}, publisher = {South African Institute for Computer Scientists and Information Technologists}, organization = {South African Institute for Computer Scientists and Information Technologists}, abstract = {The digital divide between rural and urban areas within developing countries is vast. We investigate how to address this divide by introducing Information and Communication Technologies (ICTs) into remote rural areas. Our aim is to discover how to create locally relevant software applications with appropriate content for these areas. We use a user centred design approach and a modified software development lifecyle that is participatory, iterative and cyclical. This process is based on principles from Participatory Design and Action Research. This paper presents our initial experience of developing a telemedicine application for a rural village in the Eastern Cape Province of South Africa using this process. We present an overview of the methodology, describe the software application we have developed and cite several challenges we have faced. Finally we conclude that an inter-organisational and inter-disciplinary approach is needed to develop software for remote areas.}, keywords = {action research, design, human factors, participatory design, telemedicine}, url = {http://dl.acm.org/citation.cfm?id=1035053.1035083}, author = {Marshini Chetty and Tucker, William and Blake, Edwin} } @conference {15459, title = {Developing testing techniques for event-driven pervasive computing applications}, booktitle = {Proceedings of The OOPSLA 2004 workshop on Building Software for Pervasive Computing (BSPC 2004)}, year = {2004}, month = {2004///}, author = {Memon, Atif M.} } @article {12340, title = {DIF: An interchange format for dataflow-based design tools}, journal = {Computer Systems: Architectures, Modeling, and Simulation}, year = {2004}, month = {2004///}, pages = {3 - 32}, author = {Hsu,C. J and Keceli,F. and Ko,M. Y and Shahparnia,S. and Bhattacharyya, Shuvra S.} } @article {12681, title = {Dimensionality Estimation in Hyperspectral Imagery Using Minimum Description Length}, year = {2004}, month = {2004/12//}, institution = {MARYLAND UNIV COLLEGE PARK CENTER FOR AUTOMATION RESEARCH}, abstract = {Numerous algorithms have been developed for hyperspectral automatic target recognition (ATR) applications. Many of these algorithms require estimation of a background subspace. The estimation of the background subspace has been addressed using multiple methods. but most of these methods assume a-priori knowledge of the background dimensionality. In order to automate the estimation of the background subspace. we present an algorithm based on minimum description length (MDL) that can identify the background dimension. Results show that the MDL criterion estimates the proper dimension of the background for ATR applications.}, keywords = {*ALGORITHMS, *HYPERSPECTRAL IMAGERY, *TARGET DETECTION, *TARGET RECOGNITION, AUTOMATIC, BURIED OBJECTS, COMPONENT REPORTS, MINE DETECTION, NUMERICAL MATHEMATICS, SURFACE TARGETS., SYMPOSIA, TARGET DIRECTION, RANGE AND POSITION FINDING}, url = {http://stinet.dtic.mil/oai/oai?\&verb=getRecord\&metadataPrefix=html\&identifier=ADA431643}, author = {Broadwater,Joshua B and Meth,Reuven and Chellapa, Rama} } @article {18199, title = {Distortion compensated lookup-table embedding: Joint security and robustness enhancement for quantization based data hiding}, journal = {Electronic Imaging Symposium: Security, Steganography, and Watermarking of Multimedia Contents VI, San Jose, CA, Proc. of SPIE}, volume = {5306}, year = {2004}, month = {2004///}, pages = {610 - 621}, abstract = {Data embedding mechanism used for authentication applications should be secure in order to prevent an adversaryfrom forging the embedded data at his/her will. Meanwhile, semi-fragileness is often preferred to allow for distinguishing content changes versus non-content changes. In this paper, we focus on jointly enhancing the robustness and security of the embedding mechanism, which can be used as a building block for authentication. The paper presents analysis showing that embedding through a look-up table (LUT) of non-trivial run that maps quantized multimedia features randomly to binary data offers a probability of detection error considerably smaller than that of the traditional quantization embedding. We quantify the security strength of LUT embedding and enhance its robustness through distortion compensation. We introduce a combined security and capacity measure and show that the proposed distortion compensated LUT embedding provides joint enhancement of security and robustness over the traditional quantization embedding. }, author = {Wu,M.} } @conference {18200, title = {Distortion management of real-time MPEG-4 video over downlink multicode CDMA networks}, booktitle = {Communications, 2004 IEEE International Conference on}, volume = {5}, year = {2004}, month = {2004/06//}, pages = {3071 - 3075 Vol.5 - 3071 - 3075 Vol.5}, abstract = {In this paper, a protocol is designed to manage source rate/channel coding rate adaptation, code allocation, and power control to transmit real-time MPEG-4 FGS video over downlink multicode CDMA networks. We develop a fast adaptive scheme of distortion management to reduce the overall distortion received by all users subject, to the limited number of codes and maximal transmitted power. Compared with a modified greedy method in literature, our proposed algorithm can reduce the overall system{\textquoteright}s distortion by at least 45\%.}, keywords = {access;, adaptation;, allocation;, CDMA, channel, code, coding, coding;, combined, communication;, compression;, control;, data, distortion, division, downlink, links;, management;, MPEG-4, multicode, multiple, networks;, power, radio, rate, real-time, resource, source, source-channel, video, video;, visual}, doi = {10.1109/ICC.2004.1313096}, author = {Su,Guan-Ming and Han,Zhu and Kwasinski,A. and M. Wu and Liu,K. J.R and Farvardin,N.} } @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 {12817, title = {Distributed prototyping from validated specifications}, journal = {Journal of Systems and Software}, volume = {70}, year = {2004}, month = {2004/03//}, pages = {275 - 298}, abstract = {We present vpl2cxx, a translator that automatically generates efficient, fully distributed C++ code from high-level system models specified in the mathematically well-founded VPL design language. As the Concurrency Workbench of the New Century (CWB-NC) verification tool includes a front-end for VPL, designers may use the full range of automatic verification and simulation checks provided by this tool on their VPL system designs before invoking the translator, thereby generating distributed prototypes from validated specifications. Besides being fully distributed, the code generated by vpl2cxx is highly readable and portable to a host of execution environments and real-time operating systems (RTOSes). This is achieved by encapsulating all generated code dealing with low-level interprocess communication issues in a library for synchronous communication, which in turn is built upon the adaptive communication environment (ACE) client-server network programming interface. Finally, example applications show that the performance of the generated code is very good, especially for prototyping purposes. We discuss two such examples, including the RETHER real-time Ethernet protocol for voice and video applications.}, isbn = {0164-1212}, doi = {10.1016/S0164-1212(03)00074-8}, url = {http://www.sciencedirect.com/science/article/pii/S0164121203000748}, author = {Hansel,David and Cleaveland, Rance and Smolka,Scott A.} } @conference {13757, title = {Divergence Unraveling for Word Alignment...}, booktitle = {Natural Language Engineering}, year = {2004}, month = {2004///}, abstract = {We describe the use of parallel text for divergence unraveling in word-level alignment. DUSTer (Divergence Unraveling for Statistical Translation) is a system that combines linguistic and statistical knowledge to resolve structural di$\#$erences between languages, i.e., translation divergences, during the process of alignment. Our immediate goal is to induce word-level alignments that are more accurate than those produced by an existing state-ofthe -art statistical system. The long-term goal is to improve the output quality of statistical machine translation and lexical acquisition systems by using DUSTer as one possible input to a framework that accommodates multiple alignments. We show that a systematic characterization of alignment errors made by a statistical system validates the use of linguistically-motivated universal rules for identifying and handling divergences. These rules relate one or more linguistically-motivated categories associated with the (English) input words to those of another language (foreign language); the resulting match sets are used to infer corrected alignments. Using a human-aligned corpus as our gold standard, we demonstrate an improvement in alignments over an existing state-of-the-art alignment algorithm.}, author = {Dorr, Bonnie J and Ayan,N.F. and Habash,N.} } @article {12990, title = {Divergent Gene Copies in the Asexual Class Bdelloidea (Rotifera) Separated Before the Bdelloid Radiation or Within Bdelloid Families}, journal = {Proceedings of the National Academy of Sciences of the United States of AmericaPNAS}, volume = {101}, year = {2004}, month = {2004/02/10/}, pages = {1622 - 1625}, abstract = {Rotifers of the asexual class Bdelloidea are unusual in possessing two or more divergent copies of every gene that has been examined. Phylogenetic analysis of the heat-shock gene hsp82 and the TATA-box-binding protein gene tbp in multiple bdelloid species suggested that for each gene, each copy belonged to one of two lineages that began to diverge before the bdelloid radiation. Such gene trees are consistent with the two lineages having descended from former alleles that began to diverge after meiotic segregation ceased or from subgenomes of an alloploid ancestor of the bdelloids. However, the original analyses of bdelloid gene-copy divergence used only a single outgroup species and were based on parsimony and neighbor joining. We have now used maximum likelihood and Bayesian inference methods and, for hsp82, multiple outgroups in an attempt to produce more robust gene trees. Here we report that the available data do not unambiguously discriminate between gene trees that root the origin of hsp82 and tbp copy divergence before the bdelloid radiation and those which indicate that the gene copies began to diverge within bdelloid families. The remarkable presence of multiple diverged gene copies in individual genomes is nevertheless consistent with the loss of sex in an ancient ancestor of bdelloids.}, isbn = {0027-8424, 1091-6490}, doi = {10.1073/pnas.2136686100}, url = {http://www.pnas.org/content/101/6/1622}, author = {Welch,David B. Mark and Cummings, Michael P. and Hillis,David M and Meselson,Matthew} } @article {15345, title = {DNS of hypersonic turbulent boundary layers}, journal = {AIAA Paper}, volume = {2337}, year = {2004}, month = {2004///}, pages = {2004 - 2004}, author = {Martin, M.P and others} } @conference {15989, title = {Domain-independent reason-enhanced controller for task-oriented systems-DIRECTOR}, booktitle = {PROCEEDINGS OF THE NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE}, year = {2004}, month = {2004///}, pages = {1014 - 1015}, author = {Josyula,D. P and Anderson,M. L and Perlis, Don} } @article {19004, title = {The Drosophila U1-70K Protein Is Required for Viability, but Its Arginine-Rich Domain Is Dispensable}, journal = {GeneticsGenetics}, volume = {168}, year = {2004}, month = {2004/12/01/}, pages = {2059 - 2065}, abstract = {The conserved spliceosomal U1-70K protein is thought to play a key role in RNA splicing by linking the U1 snRNP particle to regulatory RNA-binding proteins. Although these protein interactions are mediated by repeating units rich in arginines and serines (RS domains) in vitro, tests of this domain{\textquoteright}s importance in intact multicellular organisms have not been carried out. Here we report a comprehensive genetic analysis of U1-70K function in Drosophila. Consistent with the idea that U1-70K is an essential splicing factor, we find that loss of U1-70K function results in lethality during embryogenesis. Surprisingly, and contrary to the current view of U1-70K function, animals carrying a mutant U1-70K protein lacking the arginine-rich domain, which includes two embedded sets of RS dipeptide repeats, have no discernible mutant phenotype. Through double-mutant studies, however, we show that the U1-70K RS domain deletion no longer supports viability when combined with a viable mutation in another U1 snRNP component. Together our studies demonstrate that while the protein interactions mediated by the U1-70K RS domain are not essential for viability, they nevertheless contribute to an essential U1 snRNP function.}, isbn = {0016-6731, 1943-2631}, doi = {10.1534/genetics.104.032532}, url = {http://www.genetics.org/content/168/4/2059}, author = {Salz,Helen K. and Mancebo,Ricardo S. Y. and Nagengast,Alexis A. and Speck,Olga and Psotka,Mitchell and Mount, Stephen M.} } @conference {18201, title = {Dynamic distortion control for 3-D embedded wavelet video over multiuser OFDM networks}, booktitle = {Global Telecommunications Conference, 2004. GLOBECOM {\textquoteright}04. IEEE}, volume = {2}, year = {2004}, month = {2004/12/03/nov}, pages = {650 - 654 Vol.2 - 650 - 654 Vol.2}, abstract = {In this paper, we propose a system to transmit multiple 3D embedded wavelet video programs over downlink multiuser OFDM. We consider the fairness among users and formulate the problem as minimizing the users{\textquoteright} maximal distortion subject to power, rate, and subcarrier constraints. By exploring frequency, time, and multiuser diversity in OFDM and flexibility of the 3D embedded wavelet video codec, the proposed algorithm can achieve fair video qualities among all users. Compared to a scheme similar to the current multiuser OFDM standard (IEEE 802.11a), the proposed scheme outperforms it by 1-5 dB on the worst received PSNR among all users and has much smaller PSNR deviation.}, keywords = {3D, 802.11a;, channels;, codec;, codecs;, communication;, control;, deviation;, distortion, diversity, diversity;, downlink, dynamic, embedded, fairness;, Frequency, IEEE, LAN;, maximal, minimax, minimization;, modulation;, multimedia, multiuser, OFDM, OFDM;, PSNR, rate, reception;, streaming;, systems;, techniques;, theory;, TIME, transforms;, video, video;, wavelet, wireless}, doi = {10.1109/GLOCOM.2004.1378042}, author = {Su,Guan-Ming and Han,Zhu and M. Wu and Liu,K. J.R} } @conference {18202, title = {Dynamic join-exit amortization and scheduling for time-efficient group key agreement}, booktitle = {INFOCOM 2004. Twenty-third AnnualJoint Conference of the IEEE Computer and Communications Societies}, volume = {4}, year = {2004}, month = {2004/03//}, pages = {2617 - 2627 vol.4 - 2617 - 2627 vol.4}, abstract = {We propose a time-efficient contributory key agreement framework for secure communications in dynamic groups. The proposed scheme employs a special join-tree/exit-tree topology in the logical key tree and effectively exploits the efficiency of amortized operations. We derive the optimal parameters and design an activation algorithm for the join and exit trees. We also show that the asymptotic average time cost per user join and leave event is theta;(log (log n)), where n is the group size. Our experiment results on both simulated user activities and the real MBone data have shown that the proposed scheme outperforms the existing tree-based schemes.}, keywords = {agreement;, asymptotic, average, communication;, complexity;, computational, cost;, cryptography;, dynamic, group, join-tree/exit-tree, key, logical, Multicast, network, secure, security;, special, Telecommunication, TIME, time-efficient, topology;, tree;}, doi = {10.1109/INFCOM.2004.1354681}, author = {Mao,Yinian and Sun,Yan and M. Wu and Liu,K. J.R} } @article {17109, title = {Dynamic Query Tools for Time Series Data Sets: Timebox Widgets for Interactive Exploration}, journal = {Information VisualizationInformation Visualization}, volume = {3}, year = {2004}, month = {2004/03/20/}, pages = {1 - 18}, abstract = {Timeboxes are rectangular widgets that can be used in direct-manipulation graphical user interfaces (GUIs) to specify query constraints on time series data sets. Timeboxes are used to specify simultaneously two sets of constraints: given a set of N time series profiles, a timebox covering time periods x1{\textellipsis}x2 (x1 <= x2) and values y1{\textellipsis}y2 (y1 <= y2) will retrieve only those n√N that have values y1 <= y2 during all times x1 <= x <= x2. TimeSearcher is an information visualization tool that combines timebox queries with overview displays, query-by-example facilities, and support for queries over multiple time-varying attributes. Query manipulation tools including pattern inversion and {\textquoteleft}leaders \& laggards{\textquoteright} graphical bookmarks provide additional support for interactive exploration of data sets. Extensions to the basic timebox model that provide additional expressivity include variable time timeboxes, which can be used to express queries with variability in the time interval, and angular queries, which search for ranges of differentials, rather than absolute values. Analysis of the algorithmic requirements for providing dynamic query performance for timebox queries showed that a sequential search outperformed searches based on geometric indices. Design studies helped identify the strengths and weaknesses of the query tools. Extended case studies involving the analysis of two different types of data from molecular biology experiments provided valuable feedback and validated the utility of both the timebox model and the TimeSearcher tool. Timesearcher is available at http://www.cs.umd.edu/hcil/timesearcher}, keywords = {angular queries, Bioinformatics, dynamic query, Graphical user interfaces, temporal data, time series, timeboxes, TimeSearcher, visual query}, isbn = {1473-8716, 1473-8724}, doi = {10.1057/palgrave.ivs.9500061}, url = {http://ivi.sagepub.com/content/3/1/1}, author = {Hochheiser,Harry and Shneiderman, Ben} } @article {12088, title = {The dangers of mitigating security design flaws: a wireless case study}, journal = {IEEE Security \& Privacy}, volume = {1}, year = {2003}, month = {2003/02//Jan}, pages = {28 - 36}, abstract = {Mitigating design flaws often provides the only means to protect legacy equipment, particularly in wireless local area networks. A synchronous active attack against the wired equivalent privacy protocol demonstrates how mitigating one flaw or attack can facilitate another.}, keywords = {Communication system security, computer security, cryptography, design flaw mitigation, Dictionaries, legacy equipment, privacy, Protection, Protocols, security design flaws, security of data, synchronous active attack, telecommunication security, Telecommunication traffic, wired equivalent privacy protocol, Wireless LAN, wireless local area networks, Wireless networks}, isbn = {1540-7993}, doi = {10.1109/MSECP.2003.1176993}, author = {Petroni,N. L. and Arbaugh, William A.} } @conference {15479, title = {DART: a framework for regression testing "nightly/daily builds" of GUI applications}, booktitle = {Software Maintenance, 2003. ICSM 2003. Proceedings. International Conference on}, year = {2003}, month = {2003/09//}, pages = {410 - 419}, abstract = {"Nightly/daily building and smoke testing" have become widespread since they often reveal bugs early in the software development process. During these builds, software is compiled, linked, and (re)tested with the goal of validating its basic functionality. Although successful for conventional software, smoke tests are difficult to develop and automatically rerun for software that has a graphical user interface (GUI). In this paper, we describe a framework called DART (daily automated regression tester) that addresses the needs of frequent and automated re-testing of GUI software. The key to our success is automation: DART automates everything from structural GUI analysis; test case generation; test oracle creation; to code instrumentation; test execution; coverage evaluation; regeneration of test cases; and their re-execution. Together with the operating system{\textquoteright}s task scheduler, DART can execute frequently with little input from the developer/tester to retest the GUI software. We provide results of experiments showing the time taken and memory required for GUI analysis, test case and test oracle generation, and test execution. We also empirically compare the relative costs of employing different levels of detail in the GUI test cases.}, keywords = {automated retesting, automatic test software, coverage evaluation, daily automated regression tester, DART, frequent retesting, graphical user interface, Graphical user interfaces, GUI software, instrumentation coding, program testing, regression testing, Software development management, Software development process, Software maintenance, Software quality, structural GUI analysis, Test Case Generation, test cases regeneration, Test execution, test oracle creation}, doi = {10.1109/ICSM.2003.1235451}, author = {Memon, Atif M. and Banerjee,I. and Hashmi,N. and Nagarajan,A.} } @conference {16136, title = {Data exploration with paired hierarchical visualizations: initial designs of PairTrees}, booktitle = {Proceedings of the 2003 annual national conference on Digital government research}, series = {dg.o {\textquoteright}03}, year = {2003}, month = {2003///}, pages = {1 - 6}, publisher = {Digital Government Society of North America}, organization = {Digital Government Society of North America}, abstract = {Paired hierarchical visualizations (PairTrees) integrate treemaps, node-link diagrams, choropleth maps and other information visualization techniques to support exploration of hierarchical data sets at multiple levels of abstraction. This paper describes several novel applications of PairTrees in the econometric and health statistics domains, as well as some challenges and trade-offs inherent in the technique.}, url = {http://dl.acm.org/citation.cfm?id=1123196.1123233}, author = {Kules,Bill and Shneiderman, Ben and Plaisant, Catherine} } @article {18193, title = {Data hiding in image and video .I. Fundamental issues and solutions}, journal = {Image Processing, IEEE Transactions on}, volume = {12}, year = {2003}, month = {2003/06//}, pages = {685 - 695}, abstract = {We address a number of fundamental issues of data hiding in image and video and propose general solutions to them. We begin with a review of two major types of embedding, based on which we propose a new multilevel embedding framework to allow the amount of extractable data to be adaptive according to the actual noise condition. We then study the issues of hiding multiple bits through a comparison of various modulation and multiplexing techniques. Finally, the nonstationary nature of visual signals leads to highly uneven distribution of embedding capacity and causes difficulty in data hiding. We propose an adaptive solution switching between using constant embedding rate with shuffling and using variable embedding rate with embedded control bits. We verify the effectiveness of our proposed solutions through analysis and simulation.}, keywords = {adaptive, analysis;, bits;, colour, condition;, constant, CONTROL, data, embedded, EMBEDDING, embedding;, encapsulation;, extractable, hiding;, image, Modulation, modulation;, multilevel, multiplexing, multiplexing;, NOISE, nonstationary, processing;, rate;, reviews;, shuffling;, signal, signals;, simulation;, solution;, techniques;, variable, video, visual}, isbn = {1057-7149}, doi = {10.1109/TIP.2003.810588}, author = {M. Wu and Liu,Bede} } @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 {12339, title = {Data partitioning for DSP software synthesis}, journal = {Lecture Notes in Computer Science}, year = {2003}, month = {2003///}, pages = {344 - 358}, author = {Ko,M. Y and Bhattacharyya, Shuvra S.} } @book {19346, title = {Data Structures and Algorithms in C++}, year = {2003}, month = {2003}, pages = {714}, publisher = {John Wiley \& Sons}, organization = {John Wiley \& Sons}, abstract = {* Provides a comprehensive introduction to data structures and algorithms, including their design, analysis, and implementation * Each data structure is presented using ADTs and their respective implementations * Helps provide an understanding of the wide spectrum of skills ranging from sound algorithm and data structure design to efficient implementation and coding of these designs in C++}, keywords = {Computers / Databases / General, Computers / Programming / Algorithms, Computers / Programming / General, Computers / Programming Languages / C, Fiction / General}, isbn = {9780471202080}, author = {Goodrich, Michael T. and Tamassia, Roberto and Mount, Dave} } @inbook {13283, title = {Data structures for 3D Multi-Tessellations: an overview}, booktitle = {Data Visualization: The State of the ArtData Visualization: The State of the Art}, series = {KLUWER INTERNATIONAL SERIES IN ENGINEERING AND COMPUTER SCIENCE}, year = {2003}, month = {2003///}, pages = {239 - 256}, publisher = {Springer}, organization = {Springer}, isbn = {9781402072598}, author = {Danovaro,E. and De Floriani, Leila and Magillo,P. and Puppo,E.} } @article {14056, title = {Data Structures, Optimal Choice of Parameters, and Complexity Results for Generalized Multilevel Fast Multipole Methods in $d$ Dimensions}, journal = {Technical Reports from UMIACS UMIACS-TR-2003-28}, year = {2003}, month = {2003/04/04/}, abstract = {We present an overview of the Fast Multipole Method, explain the use ofoptimal data structures and present complexity results for the algorithm. We explain how octree structures and bit interleaving can be simply used to create efficient versions of the multipole algorithm in $d$ dimensions. We then present simulations that demonstrate various aspects of the algorithm, including optimal selection of the clustering parameter, the influence of the error bound on the complexity, and others. The use of these optimal parameters results in a many-fold speed-up of the FMM, and prove very useful in practice. UMIACS-TR-2003-28 }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/1270}, author = {Gumerov, Nail A. and Duraiswami, Ramani and Borovikov,Eugene A.} } @inbook {16142, title = {Database Discovery with Dynamic Queries}, booktitle = {The craft of information visualization: readings and reflectionsThe craft of information visualization: readings and reflections}, year = {2003}, month = {2003///}, pages = {1 - 1}, publisher = {Morgan Kaufmann Publishers Inc.}, organization = {Morgan Kaufmann Publishers Inc.}, isbn = {978-1-55860-915-0}, author = {Fredrikson,A. and North,C. and Plaisant, Catherine and Shneiderman, Ben and Tanin,E. and Pkisant,C.} } @article {16893, title = {Data-parallel polygonization}, journal = {Parallel Computing}, volume = {29}, year = {2003}, month = {2003/10//}, pages = {1381 - 1401}, abstract = {Data-parallel algorithms are presented for polygonizing a collection of line segments represented by a data-parallel bucket PMR quadtree, a data-parallel R-tree, and a data-parallel R+-tree. Such an operation is useful in a geographic information system (GIS). A sample performance comparison of the three data-parallel structures for this operation is also given.}, keywords = {Data-parallel algorithms, Hierarchical spatial data structures, Lines, Polygonization}, isbn = {0167-8191}, doi = {10.1016/j.parco.2003.05.001}, url = {http://www.sciencedirect.com/science/article/pii/S0167819103001091}, author = {Hoel,Erik G. and Samet, Hanan} } @article {13285, title = {Decomposing non-manifold objects in arbitrary dimensions}, journal = {Graphical Models}, volume = {65}, year = {2003}, month = {2003/05//}, pages = {2 - 22}, abstract = {We address the problem of building valid representations of non-manifold d-dimensional objects through an approach based on decomposing a non-manifold d-dimensional object into an assembly of more regular components. We first define a standard decomposition of d-dimensional non-manifold objects described by abstract simplicial complexes. This decomposition splits a non-manifold object into components that belong to a well-understood class of objects, that we call initial quasi-manifold. Initial quasi-manifolds cannot be decomposed without cutting them along manifold faces. They form a decidable superset of d-manifolds for d⩾3, and coincide with manifolds for d⩽2. We then present an algorithm that computes the standard decomposition of a general non-manifold complex. This decomposition is unique, and removes all singularities which can be removed without cutting the complex along its manifold faces.}, isbn = {1524-0703}, doi = {10.1016/S1524-0703(03)00006-7}, url = {http://www.sciencedirect.com/science/article/pii/S1524070303000067}, author = {De Floriani, Leila and Mesmoudi,Mostefa M. and Morando,Franco and Puppo,Enrico} } @article {17813, title = {A Deductive Database Approach to AI Planning}, journal = {Journal of Intelligent Information Systems}, volume = {20}, year = {2003}, month = {2003///}, pages = {215 - 253}, abstract = {In this paper, we show that the classical A.I. planning problem can be modelled using simple database constructs with logic-based semantics. The approach is similar to that used to model updates and nondeterminism in active database rules. We begin by showing that planning problems can be automatically converted to Datalog1S programs with nondeterministic choice constructs, for which we provide a formal semantics using the concept of stable models. The resulting programs are characterized by a syntactic structure (XY-stratification) that makes them amenable to efficient implementation using compilation and fixpoint computation techniques developed for deductive database systems. We first develop the approach for sequential plans, and then we illustrate its flexibility and expressiveness by formalizing a model for parallel plans, where several actions can be executed simultaneously. The characterization of parallel plans as partially ordered plans allows us to develop (parallel) versions of partially ordered plans that can often be executed faster than the original partially ordered plans.}, doi = {10.1023/A:1022808724136}, author = {Brogi,A. and V.S. Subrahmanian and Zaniolo,C.} } @article {18537, title = {Defeating Web censorship with untrusted messenger discovery}, journal = {Workshop on Privacy Enhancing Technologies}, year = {2003}, month = {2003///}, author = {Feamster, Nick and Balazinska,M. and Wang,W. and Balakrishnan,H. and Karger,D.} } @article {12301, title = {Deno: a decentralized, peer-to-peer object-replication system for weakly connected environments}, journal = {Computers, IEEE Transactions on}, volume = {52}, year = {2003}, month = {2003/07//}, pages = {943 - 959}, abstract = {This paper presents the design, implementation, and evaluation of the replication framework of Deno, a decentralized, peer-to-peer object-replication system targeted for weakly connected environments. Deno uses weighted voting for availability and pair-wise, epidemic information flow for flexibility. This combination allows the protocols to operate with less than full connectivity, to easily adapt to changes in group membership, and to make few assumptions about the underlying network topology. We present two versions of Deno{\textquoteright}s protocol that differ in the consistency levels they support. We also propose security extensions to handle a class of malicious actions that involve misrepresentation of protocol information. Deno has been implemented and runs on top of Linux and Win32 platforms. We use the Deno prototype to characterize the performance of the Deno protocols and extensions. Our study reveals several interesting results that provide fundamental insight into the benefits of decentralization and the mechanics of epidemic protocols.}, keywords = {actions;, connected, consistency, data, data;, databases;, decentralized, Deno;, distributed, environments;, epidemic, group, levels;, Linux;, malicious, management;, membership;, network, object, object-replication, of, operating, peer-to-peer, protocols;, replicated, replication;, Security, security;, synchronisation;, system;, systems;, topology;, Unix;, voting;, weakly, weighted, Win32;}, isbn = {0018-9340}, doi = {10.1109/TC.2003.1214342}, author = {Cetintemel,U. and Keleher,P. J and Bhattacharjee, Bobby and Franklin,M.J.} } @conference {16894, title = {Depth-first k-nearest neighbor finding using the MaxNearestDist estimator}, booktitle = {Image Analysis and Processing, 2003.Proceedings. 12th International Conference on}, year = {2003}, month = {2003/09//}, pages = {486 - 491}, abstract = {Similarity searching is an important task when trying to find patterns in applications which involve mining different types of data such as images, video, time series, text documents, DNA sequences, etc. Similarity searching often reduces to finding the k nearest neighbors to a query object. A description is given of how to use an estimate of the maximum possible distance at which a nearest neighbor can be found to prune the search process in a depth-first branch-and-bound k-nearest neighbor finding algorithm. Using the MaxNearestDist estimator (Larsen, S. and Kanal, L.N., 1986) in the depth-first k-nearest neighbor algorithm provides a middle ground between a pure depth-first and a best-first k-nearest neighbor algorithm.}, keywords = {branch-and-bound, data, depth-first, distance;, DNA, documents;, estimation;, estimator;, finding;, images;, k-nearest, matching;, maximum, MaxNearestDist, mining;, neighbor, parameter, pattern, possible, process;, processing;, query, search, searching;, sequences;, series;, similarity, text, TIME, tree, video;}, doi = {10.1109/ICIAP.2003.1234097}, author = {Samet, Hanan} } @book {12377, title = {Design Considerations for Optically Connected Systems on Chip}, year = {2003}, month = {2003///}, publisher = {MARYLAND UNIV COLLEGE PARK DEPT OF ELECTRICAL AND COMPUTER ENGINEERING}, organization = {MARYLAND UNIV COLLEGE PARK DEPT OF ELECTRICAL AND COMPUTER ENGINEERING}, author = {Bhattacharyya, Shuvra S. and Bambha,N. K and Euliss,G.} } @article {12194, title = {Designing a digital library for young children: An intergenerational partnership}, journal = {The craft of information visualization: readings and reflections}, volume = {178}, year = {2003}, month = {2003///}, author = {Druin, Allison and Bederson, Benjamin B. and Hourcade,J. P and Sherman,L. and Revelle,G. and Platner,M. and Weng,S.} } @conference {17061, title = {Designing a metadata-driven visual information browser for federal statistics}, booktitle = {Proceedings of the 2003 annual national conference on Digital government research}, series = {dg.o {\textquoteright}03}, year = {2003}, month = {2003///}, pages = {1 - 6}, publisher = {Digital Government Society of North America}, organization = {Digital Government Society of North America}, abstract = {When looking for federal statistics, finding the right table, chart or report can be a daunting task for anyone not thoroughly familiar with the federal statistical system. Search tools help, but differing terminologies within the statistical agencies and a lack of familiarity of terms by information seekers limit their effectiveness. The FedStats Browser is a design for visually browsing federal agency statistical products and publications, using techniques that allow users to reformulate queries and iteratively refine results via simple, reversible actions with immediate feedback. This paper also discusses the characteristics of metadata needed for such a browser and the challenges inherent in acquiring that metadata.}, url = {http://dl.acm.org/citation.cfm?id=1123196.1123235}, author = {Kules,Bill and Shneiderman, Ben} } @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} } @article {18023, title = {Deterministic Resource Discovery in Distributed Networks}, journal = {Theory of Computing Systems}, volume = {36}, year = {2003}, month = {2003///}, pages = {479 - 495}, abstract = {The resource discovery problem was introduced by Harchol-Balter, Leighton, and Lewin. They developed a number of algorithms for the problem in the weakly connected directed graph model. This model is a directed logical graph that represents the vertices{\textquoteright} knowledge about the topology of the underlying communication network. The current paper proposes a deterministic algorithm for the problem in the same model, with improved time, message, and communication complexities. Each previous algorithm had a complexity that was higher at least in one of the measures. Specifically, previous deterministic solutions required either time linear in the diameter of the initial network, or communication complexity $O(n^3)$ (with message complexity $O(n^2)$), or message complexity $O(|E_0| {\l}og n)$ (where $E_0$ is the arc set of the initial graph $G_0$). Compared with the main randomized algorithm of Harchol-Balter, Leighton, and Lewin, the time complexity is reduced from $O({\l}og^2n)$ to\pagebreak[4] $O({\l}og n )$, the message complexity from $O(n {\l}og^2 n)$ to $O(n {\l}og n )$, and the communication complexity from $O(n^2 {\l}og^3 n)$ to $O(|E_0|{\l}og ^2 n )$. \par Our work significantly extends the connectivity algorithm of Shiloach and Vishkin which was originally given for a parallel model of computation. Our result also confirms a conjecture of Harchol-Balter, Leighton, and Lewin, and addresses an open question due to Lipton.}, keywords = {Computer, Science}, isbn = {1432-4350}, url = {http://dx.doi.org/10.1007/s00224-003-1084-8}, author = {Kutten,Shay and Peleg,David and Vishkin, Uzi} } @article {16902, title = {Digital government}, journal = {Communications of the ACM}, volume = {46}, year = {2003}, month = {2003///}, pages = {25 - 27}, abstract = {Information technologies are being applied vigorously by governmental units at national,regional, and local levels around the world. The application of IT to government service is often termed {\textquotedblleft}e-government{\textquotedblright} and the larger concept of government that depends upon IT to achieve basic missions is termed {\textquotedblleft}digital government.{\textquotedblright} This distinction is, of course, lexically arbitrary, but serves to distinguish R\&D specifically aimed at creating techniques for applying IT to government operations. Such R\&D efforts also consider the long-term impact of these applications on citizens and government itself. }, author = {Marchionini,G. and Samet, Hanan and Brandt,L.} } @article {16905, title = {Digital Government-Bistro: A Scalable and Secure Data Transfer Service for Digital Government Applications}, journal = {Communications of the ACM-Association for Computing Machinery-CACM}, volume = {46}, year = {2003}, month = {2003///}, pages = {50 - 51}, author = {Golubchik,L. and Cheng,W. C and Chou,C. F and Khuller, Samir and Samet, Hanan and Wan,Y. C.J} } @article {12948, title = {Direct Detection of Vibrio Cholerae and ctxA in Peruvian Coastal Water and Plankton by PCR}, journal = {Applied and Environmental MicrobiologyAppl. Environ. Microbiol.}, volume = {69}, year = {2003}, month = {2003/06/01/}, pages = {3676 - 3680}, abstract = {Seawater and plankton samples were collected over a period of 17 months from November 1998 to March 2000 along the coast of Peru. Total DNA was extracted from water and from plankton grouped by size into two fractions (64 μm to 202 μm and >202 μm). All samples were assayed for Vibrio cholerae, V. cholerae O1, V. cholerae O139, and ctxA by PCR. Of 50 samples collected and tested, 33 (66.0\%) were positive for V. cholerae in at least one of the three fractions. Of these, 62.5\% (n = 32) contained V. cholerae O1; ctxA was detected in 25\% (n = 20) of the V. cholerae O1-positive samples. None were positive for V. cholerae O139. Thus, PCR was successfully employed in detecting toxigenic V. cholerae directly in seawater and plankton samples and provides evidence for an environmental reservoir for this pathogen in Peruvian coastal waters.}, isbn = {0099-2240, 1098-5336}, doi = {10.1128/AEM.69.6.3676-3680.2003}, url = {http://aem.asm.org/content/69/6/3676}, author = {Lipp,Erin K. and Rivera,Irma N. G. and Gil,Ana I. and Espeland,Eric M. and Choopun,Nipa and Louis,Val{\'e}rie R. and Russek-Cohen,Estelle and Huq,Anwar and Rita R Colwell} } @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} } @article {19078, title = {The dog genome: survey sequencing and comparative analysis}, journal = {Science}, volume = {301}, year = {2003}, month = {2003}, author = {Kirkness,E. F and Bafna,V. and Halpern,A. L and Levy,S. and Remington,K. and Rusch,D. B and Delcher,A. L and Pop, Mihai and Wang,W. and Fraser,C. M and others} } @article {16289, title = {The Dog Genome: Survey Sequencing and Comparative Analysis}, journal = {ScienceScience}, volume = {301}, year = {2003}, month = {2003/09/26/}, pages = {1898 - 1903}, abstract = {A survey of the dog genome sequence (6.22 million sequence reads; 1.5{\texttimes} coverage) demonstrates the power of sample sequencing for comparative analysis of mammalian genomes and the generation of species-specific resources. More than 650 million base pairs (>25\%) of dog sequence align uniquely to the human genome, including fragments of putative orthologs for 18,473 of 24,567 annotated human genes. Mutation rates, conserved synteny, repeat content, and phylogeny can be compared among human, mouse, and dog. A variety of polymorphic elements are identified that will be valuable for mapping the genetic basis of diseases and traits in the dog.}, isbn = {0036-8075, 1095-9203}, doi = {10.1126/science.1086432}, url = {http://www.sciencemag.org/content/301/5641/1898}, author = {Kirkness,Ewen F. and Bafna,Vineet and Halpern,Aaron L. and Levy,Samuel and Remington,Karin and Rusch,Douglas B and Delcher,Arthur L. and Pop, Mihai and Wang,Wei and Fraser,Claire M. and Venter,J. Craig} } @article {13758, title = {Domain Tuning of Bilingual Lexicons for MT}, year = {2003}, month = {2003/02//}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {Our overall objective is to translate a domain-specific document in a foreign language (in this case, Chinese) to English. Using automatically induced domain-specific, comparable documents and language-independent clustering, we apply domain-tuning techniques to a bilingual lexicon for downstream translation of the input document to English. We will describe our domain-tuning technique and demonstrate its effectiveness by comparing our results to manually constructed domain-specific vocabulary. Our coverage/accuracy experiments indicate that domain-tuned lexicons achieve 88/\% precision and 66/\% recall. We also ran a Bleu experiment to compare our domain-tuned version to its un-tuned counterpart in an IR Ni-style NIT system. Our domain-tuned lexicons brought about an improvement in the Blen scores: 9.4/\% higher than a system trained on a uniformly- weighted dictionary and 275/\% higher than a system trained on no dictionary at all.}, keywords = {*DICTIONARIES, *FOREIGN LANGUAGES, accuracy, BILINGUAL LEXICONS, DOCUMENTS, linguistics, Vocabulary}, url = {http://stinet.dtic.mil/oai/oai?\&verb=getRecord\&metadataPrefix=html\&identifier=ADA455197}, author = {Ayan,Necip F and Dorr, Bonnie J and Kolak,Okan} } @article {17844, title = {Driving scientific applications by data in distributed environments}, journal = {Computational Science{\textemdash}ICCS 2003}, year = {2003}, month = {2003///}, pages = {713 - 713}, author = {Saltz, J. and Catalyurek,U. and Kurc, T. and Gray,M. and Hastings,S. and Langella,S. and Narayanan,S. and Martino,R. and Bryant,S. and Peszynska,M. and others} } @conference {15684, title = {Dynamic load balancing across mirrored multimedia servers}, booktitle = {2003 International Conference on Multimedia and Expo, 2003. ICME {\textquoteright}03. Proceedings}, volume = {2}, year = {2003}, month = {2003/07/06/9}, pages = {II- 53-6 vol.2 - II- 53-6 vol.2}, publisher = {IEEE}, organization = {IEEE}, abstract = {The purpose of this paper is to present protocols for efficient load balancing across replicated multimedia servers in a metropolitan area network. Current multimedia infrastructures, even when they use mirrored servers, do not have standardized load balancing schemes. Existing schemes frequently require participation from the clients in balancing the load across the servers efficiently. We propose two protocols in this paper for fair load balancing without any client-side processing being required. Neither protocol requires any change to the network-level infrastructure. Using network packet loss and packet transmission delay as the chief metrics, we show the effectiveness of the protocols through extensive simulations.}, keywords = {client-server systems, Delay, Internet, load balancing protocols, Load management, media streaming, metropolitan area network, metropolitan area networks, mirrored multimedia servers, Multimedia communication, multimedia servers, network packet loss, Network servers, packet transmission delay, Propagation losses, Protocols, Streaming media, Topology, Traffic control, Web server}, isbn = {0-7803-7965-9}, doi = {10.1109/ICME.2003.1221551}, author = {Matthur,A. and Mundur, Padma} } @article {17108, title = {Dynamic query choropleth maps for information seeking and decision making}, journal = {Proc. Human-Computer Interaction International}, year = {2003}, month = {2003///}, abstract = {Information retrieval and visualization can be combined in dynamic query systems that allow users unparalleled access to information for decision making. In this paper, we report on the development and evaluation of a dynamic query system (YMap) that displays information on a chloropleth map using double thumb sliders to select ranges of query variables. The YMap prototype is a Java-Applet that supports panning and zooming. Several usability studies were conducted on early prototypes that resulted in the current version. Applications of YMap for decision making tasks are discussed.}, author = {Norman,K. and Zhao,H. and Shneiderman, Ben and Golub,E.} } @article {17111, title = {Dynamic query visualisations on world wide web clients: A DHTML solution for maps and scattergrams}, journal = {International journal of Web engineering and technology}, volume = {1}, year = {2003}, month = {2003///}, pages = {63 - 78}, abstract = {Dynamic queries are gaining popularity as a method for interactive information visualisation. Many implementations have been made on personal computers, and there is increasing interest in Web-based designs. While Java and Flash strategies have been developed, we believe that a Dynamic HTML implementation could help promote more widespread use. We implemented double-box range sliders with choropleth maps and scattergrams, which are two popular visualisations, using HTML layers and tables. This paper describes our methods for slider control, visual presentation, and displaying/updating results for these visualisations. Visual design issues innovations and performance enhancements were necessary to create viable designs.}, author = {Golub,E. and Shneiderman, Ben} } @conference {17113, title = {Dynamic querying for pattern identification in microarray and genomic data}, booktitle = {2003 International Conference on Multimedia and Expo, 2003. ICME {\textquoteright}03. Proceedings}, volume = {3}, year = {2003}, month = {2003/07/06/9}, pages = {III- 453-6 vol.3 - III- 453-6 vol.3}, publisher = {IEEE}, organization = {IEEE}, abstract = {Data sets involving linear ordered sequences are a recurring theme in bioinformatics. Dynamic query tools that support exploration of these data sets can be useful for identifying patterns of interest. This paper describes the use of one such tool - timesearcher - to interactively explore linear sequence data sets taken from two bioinformatics problems. Microarray time course data sets involve expression levels for large numbers of genes over multiple time points. Timesearcher can be used to interactively search these data sets for genes with expression profiles of interest. The occurrence frequencies of short sequences of DNA in aligned exons can be used to identify sequences that play a role in the pre-mRNA splicing. Timesearcher can be used to search these data sets for candidate splicing signals.}, keywords = {Bioinformatics, data sets, Displays, dynamic querying, expression profiles, Frequency, Gene expression, genes, Genetics, genomic data, Genomics, linear ordered sequences, macromolecules, medical signal processing, Mice, Microarray, pattern identification, pattern recognition, premRNA splicing, Query processing, sequences, Signal processing, splicing, TimeSearcher}, isbn = {0-7803-7965-9}, doi = {10.1109/ICME.2003.1221346}, author = {Hochheiser,H. and Baehrecke,E. H and Mount, Stephen M. and Shneiderman, Ben} } @conference {14682, title = {Dynamic rebinding for marshalling and update, with destruct-time ?}, booktitle = {Proceedings of the eighth ACM SIGPLAN international conference on Functional programming}, series = {ICFP {\textquoteright}03}, year = {2003}, month = {2003///}, pages = {99 - 110}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Most programming languages adopt static binding, but for distributed programming an exclusive reliance on static binding is too restrictive: dynamic binding is required in various guises, for example when a marshalled value is received from the network, containing identifiers that must be rebound to local resources. Typically it is provided only by ad-hoc mechanisms that lack clean semantics.In this paper we adopt a foundational approach, developing core dynamic rebinding mechanisms as extensions to simply-typed call-by-value ? -calculus. To do so we must first explore refinements of the call-by-value reduction strategy that delay instantiation, to ensure computations make use of the most recent versions of rebound definitions. We introduce redex-time and destruct-time strategies. The latter forms the basis for a ?marsh calculus that supports dynamic rebinding of marshalled values, while remaining as far as possible statically-typed. We sketch an extension of ? marsh with concurrency and communication, giving examples showing how wrappers for encapsulating untrusted code can be expressed. Finally, we show that a high-level semantics for dynamic updating can also be based on the destruct-time strategy, defining a ?marsh calculus with simple primitives to provide type-safe updating of running code. We thereby establish primitives and a common semantic foundation for a variety of real-world dynamic rebinding requirements.}, keywords = {distributed programming, dynamic binding, dynamic update, lambda calculus, marshalling, programming languages, serialisation}, isbn = {1-58113-756-7}, doi = {10.1145/944705.944715}, url = {http://doi.acm.org/10.1145/944705.944715}, author = {Bierman,Gavin and Hicks, Michael W. and Sewell,Peter and Stoyle,Gareth and Wansbrough,Keith} } @conference {13363, title = {Decoupled query optimization for federated database systems}, booktitle = {18th International Conference on Data Engineering, 2002. Proceedings}, year = {2002}, month = {2002///}, pages = {716 - 727}, publisher = {IEEE}, organization = {IEEE}, abstract = {We study the problem of query optimization in federated relational database systems. The nature of federated databases explicitly decouples many aspects of the optimization process, often making it imperative for the optimizer to consult underlying data sources while doing cost-based optimization. This not only increases the cost of optimization, but also changes the trade-offs involved in the optimization process significantly. The dominant cost in the decoupled optimization process is the "cost of costing" that traditionally has been considered insignificant. The optimizer can only afford a few rounds of messages to the underlying data sources and hence the optimization techniques in this environment must be geared toward gathering all the required cost information with minimal communication. In this paper, we explore the design space for a query optimizer in this environment and demonstrate the need for decoupling various aspects of the optimization process. We present minimum-communication decoupled variants of various query optimization techniques, and discuss tradeoffs in their performance in this scenario. We have implemented these techniques in the Cohera federated database system and our experimental results, somewhat surprisingly, indicate that a simple two-phase optimization scheme performs fairly well as long as the physical database design is known to the optimizer, though more aggressive algorithms are required otherwise}, keywords = {Algorithm design and analysis, Cohera federated database, Computer science, Corporate acquisitions, Cost function, Database systems, decoupled optimization, Design optimization, distributed databases, federated databases, federated relational database systems, Internet, Query optimization, query optimizer, Query processing, Relational databases, Space exploration}, isbn = {0-7695-1531-2}, doi = {10.1109/ICDE.2002.994788}, author = {Deshpande, Amol and Hellerstein,J. M} } @conference {17583, title = {Dependent rounding in bipartite graphs}, booktitle = {The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings}, year = {2002}, month = {2002///}, pages = {323 - 332}, publisher = {IEEE}, organization = {IEEE}, abstract = {We combine the pipage rounding technique of Ageev \& Sviridenko with a recent rounding method developed by Srinivasan (2001), to develop a new randomized rounding approach for fractional vectors defined on the edge-sets of bipartite graphs. We show various ways of combining this technique with other ideas, leading to the following applications: richer random-graph models for graphs with a given degree-sequence; improved approximation algorithms for: (i) throughput-maximization in broadcast scheduling, (ii) delay-minimization in broadcast scheduling, and (iii) capacitated vertex cover; fair scheduling of jobs on unrelated parallel machines. A useful feature of our method is that it lets us prove certain (probabilistic) per-user fairness properties.}, keywords = {Application software, Approximation algorithms, bipartite graph, bipartite graphs, broadcast channels, broadcast scheduling, Broadcasting, capacitated vertex cover, Character generation, computational complexity, Computer science, Delay, edge-sets, Educational institutions, fair scheduling, fractional vectors, graph theory, per-user fairness properties, pipage rounding technique, Processor scheduling, Random variables, random-graph models, randomized rounding approach, rounding method, scheduling, Scheduling algorithm, telecommunication computing, unrelated parallel machines}, isbn = {0-7695-1822-2}, doi = {10.1109/SFCS.2002.1181955}, author = {Gandhi,R. and Khuller, Samir and Parthasarathy,S. and Srinivasan, Aravind} } @article {12958, title = {Detection of Cytotoxin-Hemolysin mRNA in Nonculturable Populations of Environmental and Clinical Vibrio Vulnificus Strains in Artificial Seawater}, journal = {Applied and Environmental MicrobiologyAppl. Environ. Microbiol.}, volume = {68}, year = {2002}, month = {2002/11/01/}, pages = {5641 - 5646}, abstract = {The objective of this study was to develop a molecular detection method that better estimates the potential risk associated with the presence of Vibrio vulnificus. For that purpose, we applied seminested reverse transcription-PCR (RT-PCR) to viable but nonculturable (VBNC) populations of V. vulnificus and targeted the cytotoxin-hemolysin virulence gene vvhA. Three strains, two environmental, IF Vv10 and IF Vv18, and one clinical, C7184, were used in this study. Artificial seawater, inoculated with mid-log-phase cells, was maintained at 4{\textdegree}C. VBNC cells resulted after 3, 6, and 14 days for C7184, IF Vv18, and IF Vv10, respectively. Our data indicate that seminested RT-PCR is sensitive for the detection of vvhA mRNA in artificial seawater when exclusively nonculturable bacteria are present. This is the first report of the expression of a toxin gene in VBNC V. vulnificus. Moreover, vvhA transcripts were shown to persist in nonculturable populations over a 4.5-month period, with a progressive decline of the signal over time. This result indicates that special attention should be given to the presence of potentially pathogenic VBNC cells in environmental samples when assessing public health risk.}, isbn = {0099-2240, 1098-5336}, doi = {10.1128/AEM.68.11.5641-5646.2002}, url = {http://aem.asm.org/content/68/11/5641}, author = {Fischer-Le Saux,Marion and Hervio-Heath,Dominique and Loaec,Solen and Rita R Colwell and Pommepuy,Monique} } @article {15512, title = {Disjunctive logic programming: A survey and assessment}, journal = {Computational Logic: Logic Programming and Beyond}, year = {2002}, month = {2002///}, pages = {171 - 197}, abstract = {We describe the fields of disjunctive logic programming and disjunctive deductive databases from the time of their inception to the current time. Contributions with respect to semantics, implementations and applications are surveyed.In the last decade many semantics have been proposed out of which we highlight what we believe to be the most influential ones and compare them. Basic ideas have been borrowed from the semantics of normal logic programs such as stable model semantics and well-founded semantics, which have been generalized in various ways to obtain semantics of disjunctive logic programs. We discuss disjunctive systems such as DLV and Smodels, and related non-disjunctive systems such as XSB and DeReS, that have been implemented. We also describe applications of disjunctive logic programming: reasoning about declarative specifications, reasoning about actions, diagnosis (e.g. in medicine or biology), and in data integration that have resource predicates defined by multiple rules. We discuss the future needs to make the field practical: e.g. integrating concepts from databases (such as aggregation), optimization methods, and object orientation. }, doi = {10.1007/3-540-45628-7_18}, author = {Minker, Jack and Seipel,D.} } @article {13759, title = {Domain-Specific Term-List Expansion Using Existing Linguistic Resources}, year = {2002}, month = {2002/08//}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {This report describes a series of experiments involving expansion of a domain-specific human-generated "seed list" using available linguistic resources. The resources used for the expansion are intended to be general purpose: two large-scale Chinese-English dictionaries and a Chinese lexical knowledge base (HowNet). The methodology involves three steps: (1) hand extraction of head words from each entry in the human-generated seed list; (2) automatic comparison of these head words against entries in the linguistic resources-where an entry matches if the head word matches the entry exactly or is included in its the semantic definition; and (3) collection of any resulting matching entries into a larger term list. The terms extracted by this process were verified manually to confirm whether they were relevant to the topic of a specific domain. An important contribution of this work is the finding that the use of a bilingual term list for the expansion proces does not provide a significant improvement over the use of a simpler, more easily produced, monoligual term list.}, keywords = {*LEXICOGRAPHY, *LINGUISTICS, AUTOMATIC, CHINA, COMPARISON, EXTRACTION, HANDS, knowledge based systems, linguistics, resources, WORDS(LANGUAGE)}, url = {http://stinet.dtic.mil/oai/oai?\&verb=getRecord\&metadataPrefix=html\&identifier=ADA525800}, author = {Dorr, Bonnie J and Zhao,Tiejun} } @inbook {13760, title = {DUSTer: A Method for Unraveling Cross-Language Divergences for Statistical Word-Level Alignment}, booktitle = {Machine Translation: From Research to Real UsersMachine Translation: From Research to Real Users}, series = {Lecture Notes in Computer Science}, volume = {2499}, year = {2002}, month = {2002///}, pages = {31 - 43}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {The frequent occurrence of divergenceS {\textemdash}structural differences between languages{\textemdash}presents a great challenge for statistical word-level alignment. In this paper, we introduce DUSTer, a method for systematically identifying common divergence types and transforming an English sentence structure to bear a closer resemblance to that of another language. Our ultimate goal is to enable more accurate alignment and projection of dependency trees in another language without requiring any training on dependency-tree data in that language. We present an empirical analysis comparing the complexities of performing word-level alignments with and without divergence handling. Our results suggest that our approach facilitates word-level alignment, particularly for sentence pairs containing divergences.}, isbn = {978-3-540-44282-0}, url = {http://dx.doi.org/10.1007/3-540-45820-4_4}, author = {Dorr, Bonnie J and Pearl,Lisa and Hwa,Rebecca and Habash,Nizar}, editor = {Richardson,Stephen} } @conference {16797, title = {Dwarf}, booktitle = {Proceedings of the 2002 ACM SIGMOD international conference on Management of data - SIGMOD {\textquoteright}02}, year = {2002}, month = {2002///}, pages = {464 - 464}, address = {Madison, Wisconsin}, doi = {10.1145/564691.564745}, url = {http://dl.acm.org/citation.cfm?id=564745}, author = {Sismanis,Yannis and Deligiannakis,Antonios and Roussopoulos, Nick and Kotidis,Yannis} } @conference {17098, title = {Dynamic layout management in a multimedia bulletin board}, booktitle = {IEEE 2002 Symposia on Human Centric Computing Languages and Environments, 2002. Proceedings}, year = {2002}, month = {2002///}, pages = {51 - 53}, publisher = {IEEE}, organization = {IEEE}, abstract = {This paper proposes a novel user interface to manage the dynamic layout of multimedia objects in the Multimedia Bulletin Board (MBB) system. The MBB has been designed and implemented as a prototype of an asynchronous communication system that enables rich communication and collaboration among users of multimedia objects such as text, image, moving picture, sound, voice, Web, office document, and other files. The layout properties of the multimedia objects on a board (e.g. x-y position, size, z-order, explicit and implicit links, etc.) show important and useful information on the user dynamics occurring within a board. However, a fixed layout created and edited by multiple users may prevent users from recognizing and identifying other information. This paper resolves this problem with a novel user-controlled layout strategy made visible with dynamic layout templates (DLT). Users can reorganize the objects to extract meaningful information related to time, source, geographic location, or topic.}, keywords = {Asynchronous communication, asynchronous communication system, Collaboration, data mining, dynamic layout management, dynamic layout templates, groupware, Human computer interaction, image, Information services, Laboratories, moving picture, Multimedia Bulletin Board system, multimedia computing, Multimedia databases, multimedia objects, multimedia systems, office document, Prototypes, sound, text, user interface, User interfaces, user-controlled layout strategy, voice, Web, Web pages}, isbn = {0-7695-1644-0}, doi = {10.1109/HCC.2002.1046344}, author = {Kang,Hyunmo and Shneiderman, Ben and Wolff,G. J} } @conference {16921, title = {A dynamic query interface for finding patterns in time series data}, booktitle = {CHI {\textquoteright}02 extended abstracts on Human factors in computing systems}, series = {CHI EA {\textquoteright}02}, year = {2002}, month = {2002///}, pages = {522 - 523}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Identification of patterns in time series data sets is a task that arises in a wide variety of application domains. This demonstration presents the timebox model of rectangular regions that specify constraints for dynamic queries over time series data sets, and the TimeSearcher application, which uses timeboxes as the basis of an interactive query tool.}, keywords = {dynamic queries, Information Visualization, time series}, isbn = {1-58113-454-1}, doi = {10.1145/506443.506460}, url = {http://doi.acm.org/10.1145/506443.506460}, author = {Hochheiser,Harry and Shneiderman, Ben} } @article {13408, title = {A day in the life of \… Marie DesJardins}, journal = {Crossroads}, volume = {8}, year = {2001}, month = {2001/12//}, pages = {8 - 9}, isbn = {1528-4972}, doi = {10.1145/567155.567158}, url = {http://doi.acm.org/10.1145/567155.567158}, author = {desJardins, Marie} } @article {17060, title = {Design: CUU: bridging the digital divide with universal usability}, journal = {Interactions}, volume = {8}, year = {2001}, month = {2001/03//}, pages = {11 - 15}, isbn = {1072-5520}, doi = {10.1145/361897.361905}, url = {http://doi.acm.org/10.1145/361897.361905}, author = {Shneiderman, Ben} } @article {12314, title = {The Design of TerraDir}, journal = {Technical Reports from UMIACS, UMIACS-TR-2001-4299}, year = {2001}, month = {2001/12/17/}, abstract = {We present the design and initial evaluation of TerraDir: an approach forimplementing customizable, distributed, peer-to-peer directories over which a broad range of wide-area resource discovery applications can be implemented. TerraDir{\textquoteright}s structure is two-tiered, consisting of a base protocol for providing arbitrary application-layer connectivity, and dynamic view materializations that efficiently realize different user-specified views of application-layer resources. TerraDir is specifically designed for data that can be arranged in a rooted hierarchy, and provides very efficient and robust lookups over such data while still being able to allow efficient searching. (Also referenced as UMIACS-TR-2001-4299) }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/1161}, author = {Bhattacharjee, Bobby and Keleher,Pete and Silaghi,Bujor} } @article {16154, title = {Designing an Interactive Message Board as a Technology Probe for Family Communication}, journal = {Technical Reports of the Computer Science Department}, year = {2001}, month = {2001/10/10/}, abstract = {In this paper, we describe the design issues and technical implementation of aninteractive Family Message Board. The Family Message Board enables members of a distributed family to communicate with one another both synchronously and asynchronously via simple, pen-based, digital notes. Each household running thi$ Java-based software can view, create, and manipulate notes in a zoomable space. The Family Message Board will be used as a technology probe to help us unders$ the communication needs of distributed families, and to help us design new devi$ to meet those needs. }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/526}, author = {Browne,Hilary and Bederson, Benjamin B. and Plaisant, Catherine and Druin, Allison} } @conference {14293, title = {Detecting format string vulnerabilities with type qualifiers}, booktitle = {Proceedings of the 10th conference on USENIX Security Symposium-Volume 10}, year = {2001}, month = {2001///}, pages = {16 - 16}, author = {Shankar,U. and Talwar,K. and Foster, Jeffrey S. and Wagner,D.} } @article {17933, title = {Differential point rendering}, journal = {Proceedings of 12th Eurographics Workshop on Rendering}, year = {2001}, month = {2001///}, pages = {139 - 50}, author = {Varshney, Amitabh and Kalaiah,A.} } @book {17407, title = {The Digital University: Building a Learning Community}, year = {2001}, month = {2001/12/18/}, publisher = {Springer}, organization = {Springer}, abstract = {University education continues to be revolutionized by the use of Web-based teaching and learning systems. Following on from "The Digital University: Reinventing the Academy", this book provides a fully up-to-date and practical guide to using and implementing this important technology. Looking specifically at asynchronous collaboration, it covers:- policies- management of collaboration- distance learning- support for authoring- course design- educational metadata schemaand will be an essential buy for managers, lecturers, administrators, department heads and researchers.It includes a foreword by Ben Shneiderman, Director of the HCI Laboratory at the University of Maryland, USA.}}, keywords = {elearning, koelpu}, isbn = {1852334789}, url = {http://www.amazon.de/exec/obidos/redirect?tag=citeulike01-21\&path=ASIN/1852334789}, author = {Shneiderman, Ben} } @article {17665, title = {The discrepancy of permutation families}, journal = {Unpublished manuscript}, year = {2001}, month = {2001///}, abstract = {In this note, we show that the discrepancy of any family of l permutations of[n] = {1,2,...,n} is O( √ llog n), improving on the O(llog n) bound due to Bohus (Random Structures \& Algorithms, 1:215{\textendash}220, 1990). In the case where l >= n, we show that the discrepancy is Θ(min{√nlog(2l/n),n}). }, author = {Spencer,JH and Srinivasan, Aravind and Tetali,P.} } @article {17882, title = {Distributed processing of very large datasets with DataCutter}, journal = {Parallel Computing}, volume = {27}, year = {2001}, month = {2001/10//}, pages = {1457 - 1478}, abstract = {We describe a framework, called DataCutter, that is designed to provide support for subsetting and processing of datasets in a distributed and heterogeneous environment. We illustrate the use of DataCutter with several data-intensive applications from diverse fields, and present experimental results.}, keywords = {Component architectures, Data analysis, Distributed computing, Multi-dimensional datasets, Runtime systems}, isbn = {0167-8191}, doi = {10.1016/S0167-8191(01)00099-0}, url = {http://www.sciencedirect.com/science/article/pii/S0167819101000990}, author = {Beynon,Michael D. and Kurc,Tahsin and Catalyurek,Umit and Chang,Chialin and Sussman, Alan and Saltz,Joel} } @conference {17586, title = {Distributions on level-sets with applications to approximation algorithms}, booktitle = {42nd IEEE Symposium on Foundations of Computer Science, 2001. Proceedings}, year = {2001}, month = {2001/10/08/11}, pages = {588 - 597}, publisher = {IEEE}, organization = {IEEE}, abstract = {We consider a family of distributions on fixed-weight vectors in {0, 1}t; these distributions enjoy certain negative correlation properties and also satisfy pre-specified conditions on their marginal distributions. We show the existence of such families, and present a linear-time algorithm to sample from them. This yields improved approximation algorithms for the following problems: (a) low-congestion multi-path routing; (b) maximum coverage versions of set cover; (c) partial vertex cover problems for bounded-degree graphs; and (d) the Group Steiner Tree problem. For (a) and (b), the improvement is in the approximation ratio; for (c), we show how to speedup existing approximation algorithms while preserving the best-known approximation ratio; we also improve the approximation ratio for certain families of instances of unbounded degree. For (d), we derive an approximation algorithm whose approximation guarantee is at least as good as what is known; our algorithm is shown to have a better approximation guarantee for the worst known input families for existing algorithms.}, keywords = {Approximation algorithms, approximation guarantee, approximation theory, bounded-degree graphs, computational geometry, Concrete, fixed-weight vectors, group Steiner tree problem, level-sets, linear-time algorithm, low-congestion multi-path routing, marginal distributions, maximum coverage versions, negative correlation properties, partial vertex cover problems, trees (mathematics)}, isbn = {0-7695-1116-3}, doi = {10.1109/SFCS.2001.959935}, author = {Srinivasan, Aravind} } @conference {17587, title = {Domatic partitions and the Lov{\'a}sz local lemma}, booktitle = {Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms}, series = {SODA {\textquoteright}01}, year = {2001}, month = {2001///}, pages = {922 - 923}, publisher = {Society for Industrial and Applied Mathematics}, organization = {Society for Industrial and Applied Mathematics}, address = {Philadelphia, PA, USA}, isbn = {0-89871-490-7}, url = {http://dl.acm.org/citation.cfm?id=365411.365810}, author = {Srinivasan, Aravind} } @conference {18566, title = {Dos and don{\textquoteright}ts of client authentication on the web}, booktitle = {Proceedings of the 10th conference on USENIX Security Symposium - Volume 10}, series = {SSYM{\textquoteright}01}, year = {2001}, month = {2001///}, pages = {19 - 19}, publisher = {USENIX Association}, organization = {USENIX Association}, address = {Berkeley, CA, USA}, abstract = {Client authentication has been a continuous source of problems on the Web. Although many well-studied techniques exist for authentication, Web sites continue to use extremely weak authentication schemes, especially in non-enterprise environments such as store fronts. These weaknesses often result from careless use of authenticators within Web cookies. Of the twenty-seven sites we investigated, we weakened the client authentication on two systems, gained unauthorized access on eight, and extracted the secret key used to mint authenticators from one. We provide a description of the limitations, requirements, and security models specific to Web client authentication. This includes the introduction of the interrogative adversary, a surprisingly powerful adversary that can adaptively query a Web site. We propose a set of hints for designing a secure client authentication scheme. Using these hints, we present the design and analysis of a simple authentication scheme secure against forgeries by the interrogative adversary. In conjunction with SSL, our scheme is secure against forgeries by the active adversary.}, url = {http://dl.acm.org/citation.cfm?id=1267612.1267631}, author = {Fu,Kevin and Sit,Emil and Smith,Kendra and Feamster, Nick} } @inbook {17096, title = {Dynamic Aggregation to Support Pattern Discovery: A Case Study with Web Logs}, booktitle = {Discovery ScienceDiscovery Science}, series = {Lecture Notes in Computer Science}, volume = {2226}, year = {2001}, month = {2001///}, pages = {464 - 469}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {Rapid growth of digital data collections is overwhelming the capabilities of humans to comprehend them without aid. The extraction of useful data from large raw data sets is something that humans do poorly. Aggregation is a technique that extracts important aspect from groups of data thus reducing the amount that the user has to deal with at one time, thereby enabling them to discover patterns, outliers, gaps, and clusters. Previous mechanisms for interactive exploration with aggregated data were either too complex to use or too limited in scope. This paper proposes a new technique for dynamic aggregation that can combine with dynamic queries to support most of the tasks involved in data manipulation.}, isbn = {978-3-540-42956-2}, url = {http://dx.doi.org/10.1007/3-540-45650-3_42}, author = {Tang,Lida and Shneiderman, Ben}, editor = {Jantke,Klaus and Shinohara,Ayumi} } @conference {17101, title = {Dynamic queries and brushing on choropleth maps}, booktitle = {Fifth International Conference on Information Visualisation, 2001. Proceedings}, year = {2001}, month = {2001///}, pages = {757 - 764}, publisher = {IEEE}, organization = {IEEE}, abstract = {Users who must combine demographic, economic or other data in a geographic context are often hampered by the integration of tabular and map representations. Static, paper-based solutions limit the amount of data that can be placed on a single map or table. By providing an effective user interface, we believe that researchers, journalists, teachers, and students can explore complex data sets more rapidly and effectively. This paper presents Dynamaps, a generalized map-based information visualization tool for dynamic queries and brushing on choropleth maps. Users can use color coding to show a variable on each geographic region, and then filter out areas that do not meet the desired criteria. In addition, a scatterplot view and a details-on-demand window support overviews and specific fact-finding}, keywords = {brushing, business, cartography, choropleth maps, color coding, colour graphics, complex data sets, Computational Intelligence Society, Computer science, data visualisation, Data visualization, demographic data, Demography, Dynamaps, dynamic queries, economic data, Educational institutions, geographic information system, geographic information systems, Joining processes, map representations, map-based information visualization, Query processing, Scattering, scatterplot view, tabular representations, user interface, User interfaces, World Wide Web}, isbn = {0-7695-1195-3}, doi = {10.1109/IV.2001.942141}, author = {Dang,G. and North,C. and Shneiderman, Ben} } @conference {18647, title = {A dynamic replica selection algorithm for tolerating timing faults}, year = {2001}, month = {2001/07//}, pages = {107 - 116}, abstract = {Server replication is commonly used to improve the fault tolerance and response time of distributed services. An important problem when executing time-critical applications in a replicated environment is that of preventing timing failures by dynamically selecting the replicas that can satisfy a client{\textquoteright}s timing requirement, even when the quality of service is degraded due to replica failures and excess load on the server. We describe the approach we have used to solve this problem in AQuA, a CORBA-based middleware that transparently replicates objects across a local area network. The approach we use estimates a replica{\textquoteright}s response time distribution based on performance measurements regularly broadcast by the replica. An online model uses these measurements to predict the probability with which a replica can prevent a timing failure for a client. A selection algorithm then uses this prediction to choose a subset of replicas that can together meet the client{\textquoteright}s timing constraints with at least the probability requested by the client. We conclude with experimental results based on our implementation.}, keywords = {AQuA, client, client-server systems, CORBA-based middleware, distributed object management, distributed services, dynamic replica selection algorithm, fault tolerant computing, local area network, Local area networks, quality of service, replica failures, response time, server replication, time-critical applications, timing failures, timing fault tolerance}, doi = {10.1109/DSN.2001.941397}, author = {Krishnamurthy, S. and Sanders,W. H. and Michel Cukier} } @article {18206, title = {Dynamic resource allocation via video content and short-term traffic statistics}, journal = {Multimedia, IEEE Transactions on}, volume = {3}, year = {2001}, month = {2001/06//}, pages = {186 - 199}, abstract = {The reliable and efficient transmission of high-quality variable bit rate (VBR) video through the Internet generally requires network resources be allocated in a dynamic fashion. This includes the determination of when to renegotiate for network resources, as well as how much to request at a given time. The accuracy of any resource request method depends critically on its prediction of future traffic patterns. Such a prediction can be performed using the content and traffic information of short video segments. This paper presents a systematic approach to select the best features for prediction, indicating that while content is important in predicting the bandwidth of a video hit stream, the use of both content and available short-term bandwidth statistics can yield significant improvements. A new framework for traffic prediction is proposed in this paper; experimental results show a smaller mean-square resource prediction error and higher overall link utilization}, keywords = {allocation;link, allocation;multimedia, allocation;variable, bit, codes;, content;bandwidth, error;short, Internet;dynamic, patterns;variable, prediction, rate, resource, segments;short-term, statistics;traffic, systems;resource, traffic, utilization;mean-square, video, video;video}, isbn = {1520-9210}, doi = {10.1109/6046.923818}, author = {M. Wu and Joyce,R.A. and Wong,Hau-San and Guan,Long and Kung,Sun-Yuan} } @conference {14685, title = {Dynamic software updating}, booktitle = {Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation}, series = {PLDI {\textquoteright}01}, year = {2001}, month = {2001///}, pages = {13 - 23}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Many important applications must run continuously and without interruption, yet must be changed to fix bugs or upgrade functionality. No prior general-purpose methodology for dynamic updating achieves a practical balance between flexibility, robustness, low overhead, and ease of use.We present a new approach for C-like languages that provides type-safe dynamic updating of native code in an extremely flexible manner (code, data, and types may be updated, at programmer-determined times) and permits the use of automated tools to aid the programmer in the updating process. Our system is based on dynamic patches that both contain the updated code and the code needed to transition from the old version to the new. A novel aspect of our patches is that they consist of verifiable native code (e.g. Proof-Carrying Code [17] or Typed Assembly Language [16]), which is native code accompanied by annotations that allow on-line verification of the code{\textquoteright}s safety. We discuss how patches are generated mostly automatically, how they are applied using dynamic-linking technology, and how code is compiled to make it updateable. To concretely illustrate our system, we have implemented a dynamically-updateable web server, FlashEd. We discuss our experience building and maintaining FlashEd. Performance experiments show that for FlashEd, the overhead due to updating is typically less than 1\%. }, isbn = {1-58113-414-2}, doi = {10.1145/378795.378798}, url = {http://doi.acm.org/10.1145/378795.378798}, author = {Hicks, Michael W. and Moore,Jonathan T. and Nettles,Scott} } @conference {13534, title = {Data and Content Based Adaptation for Video Over Low Bandwidth Networks}, booktitle = {SPIE- Multimedia and Systems Applicaitons III}, year = {2000}, month = {2000///}, pages = {69 - 78}, author = {David Doermann and DeMenthon,D.} } @conference {18192, title = {Data hiding in digital binary image}, booktitle = {Multimedia and Expo, 2000. ICME 2000. 2000 IEEE International Conference on}, volume = {1}, year = {2000}, month = {2000///}, pages = {393 -396 vol.1 - 393 -396 vol.1}, abstract = {This paper proposes a new method to embed data in binary images, including scanned text, figures and signatures. The method manipulates ldquo;flippable rdquo; pixels and uses shuffling to embed a significant amount of data without causing noticeable artifacts. The extraction of the hidden data does not require the original image. Potential applications include detecting unauthorized use of a digitized signature and authenticating binary documents}, keywords = {authentication;data, binary, data;, document, encapsulation;image, hiding;digital, image;digital, of, pixels;multimedia;scanned, processing;multimedia, signature;flippable, systems;security, text;shuffling;data, watermarking;digitized}, doi = {10.1109/ICME.2000.869623}, author = {M. Wu and Tang,E. and Lin, B.} } @conference {17847, title = {DataCutter: Middleware for filtering very large scientific datasets on archival storage systems}, booktitle = {NASA conference publication}, year = {2000}, month = {2000///}, pages = {119 - 134}, author = {Beynon, M. and Ferreira,R. and Kurc, T. and Sussman, Alan and Saltz, J.} } @article {17735, title = {The decompositional approach to matrix computation}, journal = {Computing in Science Engineering}, volume = {2}, year = {2000}, month = {2000/02//jan}, pages = {50 - 59}, abstract = {The introduction of matrix decomposition into numerical linear algebra revolutionized matrix computations. The article outlines the decompositional approach, comments on its history, and surveys the six most widely used decompositions: Cholesky decomposition; pivoted LU decomposition; QR decomposition; spectral decomposition; Schur decomposition; and singular value decomposition}, keywords = {Algebra, approach;history;matrix, Cholesky, computation;matrix, computations;pivoted, computing;matrix, decomposition;, decomposition;bibliographies;history;mathematics, decomposition;decompositional, decomposition;numerical, decomposition;QR, decomposition;Schur, decomposition;singular, decomposition;spectral, linear, LU, matrix, revolutionized, value}, isbn = {1521-9615}, doi = {10.1109/5992.814658}, author = {Stewart, G.W.} } @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 {17831, title = {Design of a Framework for Data-Intensive Wide-Area Applications}, booktitle = {Heterogeneous Computing Workshop}, year = {2000}, month = {2000///}, pages = {116 - 116}, publisher = {IEEE Computer Society}, organization = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, abstract = {Applications that use collections of very large, distributed datasets have become an increasingly important part of science and engineering. With high performance wide-area networks become more pervasive, there is interest in making collective use of distributed computational and data resources. Recent work has converged to the notion of the Grid, which attempts to uniformly present a heterogeneous collection of distributed resources. Current Grid research covers many areas from low-level infrastructure issues to high-level application concerns. However, providing support for efficient exploration and processing of very large scientific datasets stored in distributed archival storage systems remains a challenging research issue.We have initiated an effort that focuses on developing efficient data-intensive applications in a Grid environment. In this paper, we present a framework, called filter-stream programming that represents the processing units of a data-intensive application as a set of filters, which are designed to be efficient in their use of memory and scratch space. We describe a prototype infrastructure that supports execution of applications using the proposed framework. We present the implementation of two applications using the filter-stream programming framework, and discuss experimental results demonstrating the effects of heterogeneous resources on application performance.}, keywords = {application decomposition, data analysis and exploration, Data-intensive applications}, doi = {http://doi.ieeecomputersociety.org/10.1109/HCW.2000.843737}, author = {Beynon,Michael D. and Kurc,Tahsin and Sussman, Alan and Saltz,Joel} } @conference {13893, title = {Designing StoryRooms: interactive storytelling spaces for children}, booktitle = {Proceedings of the 3rd conference on Designing interactive systems: processes, practices, methods, and techniques}, year = {2000}, month = {2000///}, pages = {95 - 104}, author = {Alborzi,H. and Druin, Allison and Montemayor,J. and Platner,M. and Porteous,J. and Sherman,L. and Boltman,A. and Tax{\'e}n,G. and Best,J. and Hammer,J. and others} } @conference {13912, title = {Designing storytelling technologies to encouraging collaboration between young children}, booktitle = {Proceedings of the SIGCHI conference on Human factors in computing systems}, year = {2000}, month = {2000///}, pages = {556 - 563}, author = {Benford,S. and Bederson, Benjamin B. and \AAkesson,K. P and Bayon,V. and Druin, Allison and Hansson,P. and Hourcade,J. P and Ingram,R. and Neale,H. and O{\textquoteright}Malley,C. and others} } @article {17077, title = {Designing trust into online experiences}, journal = {Communications of the ACM}, volume = {43}, year = {2000}, month = {2000/12//}, pages = {57 - 59}, isbn = {0001-0782}, doi = {10.1145/355112.355124}, url = {http://doi.acm.org/10.1145/355112.355124}, author = {Shneiderman, Ben} } @article {12027, title = {Detecting independent motion: The statistics of temporal continuity}, journal = {Pattern Analysis and Machine Intelligence, IEEE Transactions on}, volume = {22}, year = {2000}, month = {2000///}, pages = {768 - 773}, author = {Pless, R. and Brodsky, T. and Aloimonos, J.} } @conference {17081, title = {Direct annotation: a drag-and-drop strategy for labeling photos}, booktitle = {IEEE International Conference on Information Visualization, 2000. Proceedings}, year = {2000}, month = {2000///}, pages = {88 - 95}, publisher = {IEEE}, organization = {IEEE}, abstract = {Annotating photographs is such a time-consuming, tedious and error-prone data entry task that it discourages most owners of personal photo libraries. By allowing the user to drag labels, such as personal names, from a scrolling list and drop them onto a photo, we believe we can make the task faster, easier and more appealing. Since the names are entered in a database, searching for all photos of a friend or family member is dramatically simplified. We describe the user interface design and the database schema to support direct annotation, as implemented in our PhotoFinder prototype}, keywords = {Biomedical imaging, Cities and towns, Computer errors, Computer science, database indexing, database schema, Databases, digital libraries, direct annotation, direct manipulation, drag-and-drop strategy, Educational institutions, graphical user interface, Graphical user interfaces, History, hobby computing, image searching, label placement, Labeling, Laboratories, Libraries, personal information systems, personal names database, PhotoFinder prototype, photograph labelling, photographic libraries, Photography, scrolling list, user interface design, visual databases}, isbn = {0-7695-0743-3}, doi = {10.1109/IV.2000.859742}, author = {Shneiderman, Ben and Kang,H.} } @conference {15335, title = {DNS of a Mach 4 boundary layer with chemical reactions}, booktitle = {AIAA, Aerospace Sciences Meeting and Exhibit, 38 th, Reno, NV}, year = {2000}, month = {2000///}, author = {Martin, M.P} } @conference {12197, title = {Domain name based visualization of Web histories in a zoomable user interface}, booktitle = {11th International Workshop on Database and Expert Systems Applications, 2000. Proceedings}, year = {2000}, month = {2000///}, pages = {591 - 598}, publisher = {IEEE}, organization = {IEEE}, abstract = {Users of hypertext systems like the World Wide Web (WWW) often find themselves following hypertext links deeper and deeper, only to find themselves {\textquotedblleft}lost{\textquotedblright} and unable to find their way back to the previously visited pages. We have implemented a Web browser companion called Domain Tree Browser (DTB) that builds a tree structured visual navigation history while browsing the Web. The Domain Tree Browser organizes the URLs visited based on the domain name of each URL and shows thumbnails of each page in a zoomable window}, keywords = {Computer science, data visualisation, domain name, domain name based visualization, Domain Tree Browser, Educational institutions, History, hypermedia, hypertext links, hypertext systems, information resources, Navigation, online front-ends, thumbnails, Tree graphs, tree structured visual navigation history, Uniform resource locators, URLs, User interfaces, Visualization, Web browser companion, Web histories, Web pages, World Wide Web, zoomable user interface, zoomable window}, isbn = {0-7695-0680-1}, doi = {10.1109/DEXA.2000.875085}, author = {Gandhi,R. and Kumar,G. and Bederson, Benjamin B. and Shneiderman, Ben} } @conference {11918, title = {A dual interpretation of {\textquotedblleft}standard constraints{\textquotedblright} in parametric scheduling}, booktitle = {Formal Techniques in Real-Time and Fault-Tolerant Systems}, year = {2000}, month = {2000///}, pages = {205 - 223}, abstract = {Parametric scheduling in real-time systems, in the presence of linear relative constraints between the start and execution times of tasks, is a well-studied problem. Prior research established the existence of polynomial time algorithms for the case when the constraints are restricted to be standard and the execution time vectors belong to an axis-parallel hyper-rectangle. In this paper we present a polynomial time algorithm for the case when the execution time vectors belong to arbitrary convex domains. Our insights into the problem occur primarily as a result of studying the dual polytope of the constraint system.}, author = {Subramani,K. and Agrawala, Ashok K.} } @conference {18636, title = {Dynamic node management and measure estimation in a state-driven fault injector}, year = {2000}, month = {2000///}, pages = {248 - 261}, abstract = {Validation of distributed systems using fault injectionis difficult because of their inherent complexity, lack of a global clock, and lack of an easily accessible notion of a global state. To address these challenges, the Loki fault injector injects faults based on a partial view of the global state of a distributed system, and performs a post-runtime analysis using an off-line clock synchronization algorithm to determine whether the faults were properly injected. In this paper, we first describe an enhanced runtime architecture for the Loki fault injector and then present a new method for obtaining measures in Loki. The enhanced runtime allows dynamic entry and exit of nodes in the system. It also offers more efficient multicast of notification messages and more efficient communication between state machines on the same host, and is more scalable than the previous runtime. We then detail a new and flexible method for obtaining a wide range of performance and dependability measures in Loki. }, url = {https://www.perform.csl.illinois.edu/Papers/USAN_papers/00CHA01.pdf}, author = {Chandra,R. and Michel Cukier and Lefever,R. and Sanders,W. and others} } @article {14535, title = {Dynamics of vapor bubbles with nonequilibrium phase transitions in isotropic acoustic fields}, journal = {Physics of Fluids}, volume = {12}, year = {2000}, month = {2000///}, pages = {71 - 71}, author = {Gumerov, Nail A.} } @article {17055, title = {Departments-Book Preview-Readings in Information Visualization: Using Vision to Think}, journal = {Interactions}, volume = {6}, year = {1999}, month = {1999///}, pages = {51 - 51}, author = {Card,S.K. and Mackinlay,J. and Shneiderman, Ben} } @conference {16166, title = {The design of history mechanisms and their use in collaborative educational simulations}, booktitle = {Proceedings of the 1999 conference on Computer support for collaborative learning}, series = {CSCL {\textquoteright}99}, year = {1999}, month = {1999///}, publisher = {International Society of the Learning Sciences}, organization = {International Society of the Learning Sciences}, abstract = {Reviewing past events has been useful in many domains. Videotapes and flight data recorders provide invaluable technological help to sports coaches or aviation engineers. Similarly, providing learners with a readable recording of their actions may help them monitor their behavior, reflect on their progress, and experiment with revisions of their experiences. It may also facilitate active collaboration among dispersed learning communities. Learning histories can help students and professionals make more effective use of digital library searching, word processing tasks, computer-assisted design tools, electronic performance support systems, and web navigation.This paper describes the design space and discusses the challenges of implementing learning histories. It presents guidelines for creating effective implementations, and the design tradeoffs between sparse and dense history records. The paper also presents a first implementation of learning histories for a simulation-based engineering learning environment called SimPLE (Simulated Processes in a Learning Environment) for the case of a semiconductor fabrication module, and reports on early user evaluation of learning histories implemented within SimPLE.}, keywords = {hci, scaffolding, simulation}, url = {http://dl.acm.org/citation.cfm?id=1150240.1150284}, author = {Plaisant, Catherine and Rose,Anne and Rubloff,Gary and Salter,Richard and Shneiderman, Ben} } @conference {13938, title = {Designing PETS: a personal electronic teller of stories}, booktitle = {Proceedings of the SIGCHI conference on Human factors in computing systems: the CHI is the limit}, series = {CHI {\textquoteright}99}, year = {1999}, month = {1999///}, pages = {326 - 329}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {We have begun the development of a new robotic pet that cansupport children in the storytelling process. Children can build their own pet by snapping together the modular animal parts of the PETS robot. After their pet is built, children can tell stories using the My Pets software. These stories can then be acted out by their robotic pet. This video paper describes the motivation for this research and the design process of our intergenerational design team in building the first PETS prototypes. We will discuss our progress to date and our focus for the future. }, keywords = {children, cooperative inquiry, design techniques, educational applications, intergenerational design team, PETS, ROBOTICS}, isbn = {0-201-48559-1}, doi = {10.1145/302979.303103}, url = {http://doi.acm.org/10.1145/302979.303103}, author = {Druin, Allison and Montemayor,Jamie and Hendler,Jim and McAlister,Britt and Boltman,Angela and Fiterman,Eric and Plaisant,Aurelie and Kruskal,Alex and Olsen,Hanne and Revett,Isabella and Schwenn,Thomas Plaisant and Sumida,Lauren and Wagner,Rebecca} } @article {14954, title = {Designing practical efficient algorithms for symmetric multiprocessors}, journal = {Algorithm Engineering and Experimentation}, year = {1999}, month = {1999///}, pages = {663 - 663}, abstract = {Symmetric multiprocessors (SMPs) dominate the high-end server market and are currently the primary candidate for constructing large scale multiprocessor systems. Yet, the design of efficient parallel algorithms for this platform currently poses several challenges. In this paper, we present a computational model for designing efficient algorithms for symmetric multiprocessors. We then use this model to create efficient solutions to two widely different types of problems - linked list prefix computations and generalized sorting. Our novel algorithm for prefix computations builds upon the sparse ruling set approach of Reid-Miller and Blelloch. Besides being somewhat simpler and requiring nearly half the number of memory accesses, we can bound our complexity with high probability instead of merely on average. Our algorithm for generalized sorting is a modification of our algorithm for sorting by regular sampling on distributed memory architectures. The algorithm is a stable sort which appears to be asymptotically faster than any of the published algorithms for SMPs. Both of our algorithms were implemented in C using POSIX threads and run on four symmetric multiprocessors - the IBM SP-2 (High Node), the HP-Convex Exemplar (S-Class), the DEC AlphaServer, and the Silicon Graphics Power Challenge. We ran our code for each algorithm using a variety of benchmarks which we identified to examine the dependence of our algorithm on memory access patterns. In spite of the fact that the processors must compete for access to main memory, both algorithms still yielded scalable performance up to 16 processors, which was the largest platform available to us. For some problems, our prefix computation algorithm actually matched or exceeded the performance of the standard sequential solution using only a single thread. Similarly, our generalized sorting algorithm always beat the performance of sequential merge sort by at least an order of magnitude, even with a single thread.}, doi = {10.1007/3-540-48518-X_3}, author = {Helman,D. and JaJa, Joseph F.} } @conference {13537, title = {Detection of slow-motion replay sequences for identifying sports videos}, booktitle = {Proceedings of IEEE 1999 Workshop on Multimedia Signal Processing}, year = {1999}, month = {1999///}, pages = {135 - 140}, abstract = {Automated classication of digital video is emerging as an important piece of the puzzle in the design of content management systems for digital libraries. The ability to classify videos into various genres such as sports, news, movies, or documentaries increases the efficiency of indexing, browsing, and retrieval of video in large databases. In this paper we present an automated technique for identifying slow motion replays directly from the compressed domain of MPEG video, It uses the macroblock motion and bit-rate information that is readily accessible from MPEG video with very minimal decoding, leading to enormous gains in processing speeds.}, author = {Kobla,V. and DeMenthon,D. and David Doermann} } @conference {17080, title = {Developing the next generation of Earth science data systems: the Global Land Cover Facility}, booktitle = {Geoscience and Remote Sensing Symposium, 1999. IGARSS {\textquoteright}99 Proceedings. IEEE 1999 International}, volume = {1}, year = {1999}, month = {1999///}, pages = {616-618 vol.1 - 616-618 vol.1}, publisher = {IEEE}, organization = {IEEE}, abstract = {A recent initiative by NASA has resulted in the formation of a federation of Earth science data partners. These Earth Science Information Partners (ESIPs) have been tasked with creating novel Earth science data products and services as well as distributing new and existing data sets to the Earth science community and the general public. The University of Maryland established its ESIP activities with the creation of the Global Land Cover Facility (GLCF). This joint effort of the Institute for Advanced Computer Studies (UMIACS) and the Department of Geography has developed an operational data archiving and distribution system aimed at advancing current land cover research efforts. The success of the GLCF is tied closely to assessing user needs as well. As the timely delivery of data products to the research community. This paper discusses the development and implementation of a web-based interface that allows users to query the authors{\textquoteright} data holdings and perform user requested processing tasks on demand. The GLCF takes advantage of a scaleable, high performance computing architecture for the manipulation of very large remote sensing data sets and the rapid spatial indexing of multiple format data types. The user interface has been developed with the cooperation of the Human-Computer Interaction Laboratory (HCIL) and demonstrates advances in spatial and temporal querying tools as well as the ability to overlay multiple raster and vector data sets. Their work provides one perspective concerning how critical earth science data may be handled in the near future by a coalition of distributed data centers}, keywords = {Computer architecture, data archiving, data distribution system, Data systems, Distributed computing, Earth science data products, Earth science data system, ESIP, geographic information system, geographic information systems, Geography, geophysical measurement technique, geophysical signal processing, geophysical techniques, Geoscience, GIS, GLCF, Global Land Cover Facility, High performance computing, Indexing, information service, Information services, Institute for Advanced Computer Studies, land cover, NASA, next generation, PACS, Remote sensing, terrain mapping, UMIACS, University of Maryland, User interfaces, web-based interface}, isbn = {0-7803-5207-6}, doi = {10.1109/IGARSS.1999.773583}, author = {Lindsay,F.E. and Townshend,J.R.G. and JaJa, Joseph F. and Humphries,J. and Plaisant, Catherine and Shneiderman, Ben} } @conference {18198, title = {Digital watermarking using shuffling}, booktitle = {Image Processing, 1999. ICIP 99. Proceedings. 1999 International Conference on}, volume = {1}, year = {1999}, month = {1999///}, pages = {291 -295 vol.1 - 291 -295 vol.1}, abstract = {This paper applies shuffling to digital watermarking and data hiding. The data embedding capacity in the multimedia source generally varies significantly from one part of the source to another. Sequential embedding is very sensitive to noise which may cause synchronization problem; the common but conservative solution via partitioning an image into large segments and embedding only one bit per segment is wasteful of the data embedding capacity. This paper shows how random shuffling can be used to equalize the uneven distribution of embedding capacity. The effectiveness of random shuffling is demonstrated by analysis and experiments}, keywords = {coding;, data, embeddin;data, encapsulation;document, hiding;digital, image, processing;image, shuffling;shuffling;synchronization;data, source;random, watermarking;multimedia}, doi = {10.1109/ICIP.1999.821616}, author = {M. Wu and Liu,B.} } @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 {12199, title = {Does animation help users build mental maps of spatial information?}, booktitle = {Information Visualization, 1999.(Info Vis{\textquoteright} 99) Proceedings. 1999 IEEE Symposium on}, year = {1999}, month = {1999///}, pages = {28 - 35}, author = {Bederson, Benjamin B. and Boltman,A.} } @conference {12184, title = {Does zooming improve image browsing}, booktitle = {Proceedings of the fourth ACM conference on Digital libraries}, year = {1999}, month = {1999///}, pages = {130 - 137}, author = {Tammara,T.A.C. and Bederson, Benjamin B.} } @conference {16732, title = {DynaMat: a dynamic view management system for data warehouses}, booktitle = {Proceedings of the 1999 ACM SIGMOD international conference on Management of data}, year = {1999}, month = {1999///}, pages = {371 - 382}, author = {Kotidis,Y. and Roussopoulos, Nick} } @inbook {17408, title = {The dynamic homefinder: evaluating dynamic queries in a real-estate information exploration system}, booktitle = {Materialized views}, year = {1999}, month = {1999///}, pages = {125 - 139}, publisher = {MIT Press}, organization = {MIT Press}, address = {Cambridge, MA, USA}, isbn = {0-262-57122-6}, author = {Williamson,C. and Shneiderman, Ben} } @inbook {17100, title = {Dynamic queries}, booktitle = {Readings in information visualizationReadings in information visualization}, year = {1999}, month = {1999///}, pages = {235 - 235}, author = {Card,S.K. and Mackinlay,J.D. and Shneiderman, Ben} } @conference {16191, title = {Data object and label placement for information abundant visualizations}, booktitle = {Proceedings of the 1998 workshop on New paradigms in information visualization and manipulation}, series = {NPIV {\textquoteright}98}, year = {1998}, month = {1998///}, pages = {41 - 48}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, keywords = {control panel, data object placement, Information Visualization, label placement, metrics, timelines, visual feedback}, isbn = {1-58113-179-8}, doi = {10.1145/324332.324341}, url = {http://doi.acm.org/10.1145/324332.324341}, author = {Li,Jia and Plaisant, Catherine and Shneiderman, Ben} } @inbook {16255, title = {De-amortization of Algorithms}, booktitle = {Computing and CombinatoricsComputing and Combinatorics}, series = {Lecture Notes in Computer Science}, volume = {1449}, year = {1998}, month = {1998///}, pages = {4 - 14}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {De-amortization aims to convert algorithms with excellent overall speed, f ( n ) for performing n operations, into algorithms that take no more than O ( f ( n )/ n ) steps for each operation. The paper reviews several existing techniques for de-amortization of algorithms.}, isbn = {978-3-540-64824-6}, url = {http://dx.doi.org/10.1007/3-540-68535-9_4}, author = {Rao Kosaraju,S. and Pop, Mihai}, editor = {Hsu,Wen-Lian and Kao,Ming-Yang} } @article {16026, title = {Defaults Denied}, volume = {UMIACS-TR-96-61}, year = {1998}, month = {1998/10/15/}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {We take a tour of various themes in default reasoning, examining new ideasas well as those of Brachman, Delgrande, Poole, and Schlechta. An underlying issue is that of stating that a potential default principle is not appropriate. We see this arise most dramatically as a problem in an attempt to formalize what are often loosely called "prototypes", although it also arises in other formal approaches to default reasoning. Some formalisms in the literature provide solutions but not without costs. We propose a formalism that appears to avoid these costs; it can be seen as a step toward a population-based set-theoretic modification of these approaches, that may ultimately provide a closer tie to recent work on statistical (quantitative) foundations of (qualitative) defaults([1]). Our analysis in particular indicates the need to resolve a conflation between use and mention in many default formalisms. Our treatment proposes such a resolution, and also explores the use of sets toward a more population-based notion of default. (Also cross-referenced as UMIACS-TR-96-61) }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu//handle/1903/841}, author = {Miller,Michael and Perlis, Don and Purang,Khemdut} } @article {17864, title = {The design and evaluation of a high-performance earth science database}, journal = {Parallel Computing}, volume = {24}, year = {1998}, month = {1998/01//}, pages = {65 - 89}, abstract = {Earth scientists have encountered two major obstacles in their attempts to use remotely sensed imagery to analyze the earth{\textquoteright}s land cover dynamics. First, the volume of data involved is very large and second, significant preprocessing is needed before the data can be used. This is particularly so for studies that analyze global trends using data sets that cover multiple years. In this paper, we present the design of an earth science database as well as our early experiences with it. The primary design goal of this database is to facilitate efficient access to and preprocessing of large volumes of satellite data. Our initial design assumed that the main bottleneck in the system would be retrieving data from the disks. However, experimental results show that precise identification of all the data values corresponding to a query can take a significant amount of time. The problem is even more pronounced in designing the system to attempt to minimize time spent performing I/O. We therefore discuss a major redesign of the system that includes a reworking of the indexing scheme and a reorganization of the data on disks. Experimental results show that the redesigned system performs significantly better than the original system, providing interactive response times for local queries.}, keywords = {Communication, High-performance I/O, load balancing, scalability, Scientific databases}, isbn = {0167-8191}, doi = {10.1016/S0167-8191(97)00117-8}, url = {http://www.sciencedirect.com/science/article/pii/S0167819197001178}, author = {Shock,Carter T. and Chang,Chialin and Moon,Bongki and Acharya,Anurag and Davis, Larry S. and Saltz,Joel and Sussman, Alan} } @article {16183, title = {The Design of a Telepathology Workstation: Exploring Remote Images}, journal = {Technical Reports of the Computer Science Department}, year = {1998}, month = {1998/10/15/}, abstract = {Dynamic telepathology uses a tele-operated microscope to allowpathologists to view samples at a remote location. However, time delays introduced by remote operation have made use of a commercial dynamic telepathology system difficult and frustrating. This paper describes experiments to evaluate and redesign the user interface. We also make recomendations for further automation to support the pathology process and increase the usefulness of the system. Copyright, 1994, by David Carr, Catherine Plaisant, and Hiroaki Hasegawa All rights reserved (Also cross-referenced as CAR-TR-708) }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/408}, author = {Carr,David and Plaisant, Catherine and Hasegawa,Hiroaki} } @article {16176, title = {Designing a real-time telepathology workstation to mitigate communication delays}, journal = {Interacting with Computers}, volume = {11}, year = {1998}, month = {1998/12/01/}, pages = {33 - 52}, abstract = {Dynamic telepathology uses a teleoperated microscope to allow pathologists to view samples at a remote location. However, time delays introduced by remote operation have made use of a commercial dynamic telepathology system difficult and frustrating. This paper describes the iterative redesign of the user interface. We redesigned the interface, conducted experiments to evaluate the improvements, and then redesigned the user interface based on the results.Our work shows that predictive displays and local maps improve user control of the microscope and increase user comfort with the system. It also indicates that some degree of automation is necessary to support the navigation process and increase the overall usefulness of the system. Therefore, we also make recommendations for further automation to support the telepathology process and increase the usefulness of the system. While performed on a specific device using a dedicated communications system, the same problems would be encountered in other environments. For example, Internet-based systems that enable remote control or require browsing of large images will need to compensate for time delays and can benefit from our experience with the telepathology application. }, keywords = {Iterative design, Predictive displays, Remote control, Supervisory control, Telepathology, Time delays}, isbn = {0953-5438}, doi = {10.1016/S0953-5438(98)00032-0}, url = {http://www.sciencedirect.com/science/article/pii/S0953543898000320}, author = {Carr,David and Plaisant, Catherine and Hasegawa,Hiroaki} } @article {17076, title = {Designing to facilitate browsing: A look back at the Hyperties workstation browser}, year = {1998}, month = {1998/10/15/}, abstract = {Since browsing hypertext can present a formidable cognitivechallenge, user interface design plays a major role in determining acceptability. In the Unix workstation version of Hyperties, a research-oriented prototype, we focussed on design features that facilitate browsing. We first give a general overview of Hyperties and its markup language. Customizable documents can be generated by the conditional text feature that enables dynamic and selective display of text and graphics. In addition we present: - an innovative solution to link identification: pop-out graphical buttons of arbitrary shape. - application of pie menus to permit low cognitive load actions that reduce the distraction of common actions, such as page turning or window selection. - multiple window selection strategies that reduce clutter and housekeeping effort. We preferred piles-of-tiles, in which standard-sized windows were arranged in a consistent pattern on the display and actions could be done rapidly, allowing users to concentrate on the contents. (Also cross-referenced as CAR-TR-494) }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/362}, author = {Shneiderman, Ben and Plaisant, Catherine and Botafogo,Rodrigo and Hopkins,Don and Weiland,William} } @article {13668, title = {The detection of duplicates in document image databases}, journal = {Image and Vision Computing}, volume = {16}, year = {1998}, month = {1998/08/24/}, pages = {907 - 920}, abstract = {Document imaging technology has developed to the point where it is not uncommon for organizations to scan large numbers of documents into databases with little or no index information. This may be done for archival purposes with an index as simple as a case number, or with the ultimate goal of automatically extracting index information for content-based queries. Maintaining the integrity of such a database is difficult, however, especially in a distributed environment where copies of the same documents may be scanned at different times.In this paper we present a novel approach to detecting duplicate documents in very large databases using only features extracted from the image. The method is based on a robust {\textquoteleft}signature{\textquoteright} extracted from each document image which is used to index into a table of previously processed documents. The system is able to deal with differences between scanned document instances such resolution, skew and image quality. The approach has a number of advantages over OCR or other recognition-based methods including speed and robustness to imaging distortions. To justify the approach and demonstrate its scalability, we have developed a simulator which allows us to change parameters of the system and examine performance while processing millions of document signatures. A complete system has been implemented and tested on a collection of technical articles and memos. }, keywords = {Document image databases, Document indexing, Duplicate detection, Shape coding}, isbn = {0262-8856}, doi = {10.1016/S0262-8856(98)00054-7}, url = {http://www.sciencedirect.com/science/article/pii/S0262885698000547}, author = {David Doermann and Huiping Li and Kia,Omid} } @article {14910, title = {Determining the similarity of deformable shapes}, journal = {Vision Research}, volume = {38}, year = {1998}, month = {1998/08//}, pages = {2365 - 2385}, abstract = {Determining the similarity of two shapes is a significant task in both machine and human vision systems that must recognize or classify objects. The exact properties of human shape similarity judgements are not well understood yet, and this task is particularly difficult in domains where the shapes are not related by rigid transformations. In this paper we identify a number of possibly desirable properties of a shape similarity method, and determine the extent to which these properties can be captured by approaches that compare local properties of the contours of the shapes, through elastic matching. Special attention is devoted to objects that possess articulations, i.e. articulated parts. Elastic matching evaluates the similarity of two shapes as the sum of local deformations needed to change one shape into another. We show that similarities of part structure can be captured by such an approach, without the explicit computation of part structure. This may be of importance, since although parts appear to play a significant role in visual recognition, it is difficult to stably determine part structure. We also show novel results about how one can evaluate smooth and polyhedral shapes with the same method. Finally, we describe shape similarity effects that cannot be handled by current approaches.}, isbn = {0042-6989}, doi = {10.1016/S0042-6989(98)00043-1}, url = {http://www.sciencedirect.com/science/article/pii/S0042698998000431}, author = {Basri,Ronen and Costa,Luiz and Geiger,Davi and Jacobs, David W.} } @conference {13538, title = {Developing High-Level Representations of Video Clips using VideoTrails}, booktitle = {Proceedings of the SPIEConference on Storage and Retrieval for Image and Video Databases VI}, volume = {3312}, year = {1998}, month = {1998///}, pages = {81 - 92}, abstract = {A high-level representation of a video clip comprising information about its physical and semantic structure isnecessary for providing appropriate processing, indexing and retrieval capabilities for video databases. We describe a novel technique which reduces a sequence of MPEG encoded video frames to a trail of points in a low dimensional space. In our earlier work, we presented techniques applicable in 3-D, but in this paper, we describe techniques that can be extended to higher dimensions where improved performance is expected. In the low-dimensional space, we can cluster frames, analyze transitions between clusters and compute properties of the resulting trail. Portions of the trail can be classi ed as either stationary or transitional, leading to high-level descriptions of the video. Tracking the interaction of clusters over time, we lay the groundwork for the complete analysis and representation of the video{\textquoteright}s physical and semantic structure. }, author = {Kobla,V. and David Doermann and Faloutsos,C.} } @article {12090, title = {DHCP++: Applying an efficient implementation method for fail-stop cryptographic protocols}, journal = {Proceedings of Global Internet (GlobeCom){\textquoteright}98}, year = {1998}, month = {1998///}, pages = {59 - 65}, author = {Arbaugh, William A. and Keromytis,A. D and Smith,J. M} } @conference {17832, title = {Digital dynamic telepathology{\textendash}the Virtual Microscope.}, booktitle = {Proceedings of the AMIA Symposium}, year = {1998}, month = {1998///}, pages = {912 - 912}, author = {Afework,A. and Beynon,M. D and Bustamante,F. and Cho,S. and Demarzo,A. and Ferreira,R. and Miller,R. and Silberman,M. and Saltz, J. and Sussman, Alan and others} } @article {17695, title = {Direction of Arrival and the Rank-Revealing URV Decomposition}, volume = {UMIACS-TR-91-166}, year = {1998}, month = {1998/10/15/}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {In many practical direction-of-arrival (DOA) problems the numberof sources and their directions from an antenna array do not remain stationary. Hence a practical DOA algorithm must be able to track changes with a minimal number of snapshots. In this paper we describe DOA algorithms, based on a new decomposition, that are not expensive to compute or difficult to update. The algorithms are compared with algorithms based on the singular value decomposition (SVD). (Also cross-referenced as UMIACS-TR-91-166) }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/561}, author = {Boman,E. C and Griffen,M. F and Stewart, G.W.} } @article {14214, title = {Directions of Motion Fields are Hardly Ever Ambiguous}, journal = {International Journal of Computer Vision}, volume = {26}, year = {1998}, month = {1998///}, pages = {5 - 24}, abstract = {If instead of the full motion field, we consider only the direction of the motion field due to a rigid motion, what can we say about the three-dimensional motion information contained in it? This paper provides a geometric analysis of this question based solely on the constraint that the depth of the surfaces in view is positive. The motivation behind this analysis is to provide a theoretical foundation for image constraints employing only the sign of flow in various directions and justify their utilization for addressing 3D dynamic vision problems.}, isbn = {0920-5691}, url = {http://dx.doi.org/10.1023/A:1007928406666}, author = {Brodsky, Tomas and Ferm{\"u}ller, Cornelia and Aloimonos, J.} } @conference {17094, title = {Distance learning: is it the end of education as most of us know it?}, booktitle = {CHI 98 conference summary on Human factors in computing systems}, series = {CHI {\textquoteright}98}, year = {1998}, month = {1998///}, pages = {86 - 87}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, keywords = {distance learning, education, Internet, Web}, isbn = {1-58113-028-7}, doi = {10.1145/286498.286542}, url = {http://doi.acm.org/10.1145/286498.286542}, author = {Laurillard,Diana and Preece,Jenny and Shneiderman, Ben and Neal,Lisa and W{\ae}rn,Yvonne} } @article {13542, title = {Document Image Coding for Processing and Retrieval}, journal = {Journal of VLSI Signal Processing}, volume = {20}, year = {1998}, month = {1998///}, pages = {121 - 135}, abstract = {Document images belong to a unique class of images where the information is embedded in the language represented by a series of symbols on the page rather than in the visual objects themselves. Since these symbols tend to appear repeatedly, a domain-specific image coding strategy can be designed to facilitate enhanced compression and retrieval. In this paper we describe a coding methodology that not only exploits component-level redundancy to reduce code length but also supports efficient data access. The approach identifies and organizes symbol patterns which appear repeatedly. Similar components are represented by a single prototype stored in a library and the location of each component instance is coded along with the residual between it and its prototype. A representation is built which provides a natural information index allowing access to individual components. Compression results are competitive and compressed-domain access is superior to competing methods. Applications to network-related problems have been considered, and show promising results.}, author = {Kia,O. and David Doermann} } @article {13544, title = {Document Image Understanding - 1997}, volume = {LAMP-TR-025,CFAR-TR-897,CS-TR-3936}, year = {1998}, month = {1998/10//}, institution = {University of Maryland, College Park}, abstract = {This report contains nearly 500 references which are directly related to the field of document image understanding and appeared in major journals and conferences during 1997. Each reference is classified by major topic. Areas covered include, but are not limited to, preprocessing, models and representations, on-line recognition, off-line recognition, graphics recognition and interpretation, page processing, post-processing and special applications. ABibTeX version of the bibliography as well as search capabilities are available on-line at url http://documents.cfar.umd.edu/biblio/.}, author = {David Doermann} } @article {17946, title = {Double quaternions for motion interpolation}, journal = {Proceedings of the ASME Design Engineering Technical Conference}, year = {1998}, month = {1998///}, abstract = {This paper describes the concept of double quaternions, anextension of quaternions, and shows how they can be used for ef- fective three-dimensional motion interpolation. Motion interpo- lation using double quaternions has several advantages over the method of interpolating rotation and translation independently and then combining the results. First, double quaternions pro- vide a conceptual framework that allows one to handle rotational and translational components in a unified manner. Second, re- sults obtained by using double quaternions are coordinate frame invariant. Third, double quaternions allow a natural way to trade- off robustness against accuracy. Fourth, double quaternions, be- ing a straightforward extension of quaternions, can be integrated into several existing systems that currently use quaternions with translational components, with a only small coding effort. }, author = {Ge,Q. J and Varshney, Amitabh and Menon,J. P and Chang,C. F} } @inbook {16258, title = {Drawing of Two-Dimensional Irregular Meshes}, booktitle = {Graph DrawingGraph Drawing}, series = {Lecture Notes in Computer Science}, volume = {1547}, year = {1998}, month = {1998///}, pages = {1 - 14}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {We present a method for transforming two-dimensional irregular meshes into square meshes with only a constant blow up in area. We also explore context invariant transformations of irregular meshes into square meshes and provide a lower bound for the transformation of down-staircases.}, isbn = {978-3-540-65473-5}, url = {http://dx.doi.org/10.1007/3-540-37623-2_1}, author = {Aggarwal,Alok and Rao Kosaraju,S. and Pop, Mihai}, editor = {Whitesides,Sue} } @conference {14521, title = {Dynamics of bubbles in conditions of gas hydrate formation}, booktitle = {8th International Offshore and Polar Engineering Conference, Montreal, Canada}, year = {1998}, month = {1998///}, author = {Gumerov, Nail A. and Chahine,G. L} } @conference {17048, title = {Data models, visual representations, metaphors: how to solve the puzzle? (panel)}, booktitle = {Proceedings of the third IFIP WG2.6 working conference on Visual database systems 3 (VDB-3)}, year = {1997}, month = {1997///}, pages = {177 - 182}, publisher = {Chapman \& Hall, Ltd.}, organization = {Chapman \& Hall, Ltd.}, address = {London, UK, UK}, keywords = {data model, metaphor, visual representation}, isbn = {0-412-72170-8}, url = {http://dl.acm.org/citation.cfm?id=265394.265440}, author = {Catarci,T. and Costabile,M. F. and Cruz,I. F. and Ioannidis,Y. and Shneiderman, Ben} } @conference {13753, title = {Deriving verbal and compositional lexical aspect for NLP applications}, booktitle = {Proceedings of the 35th Annual Meeting of the Association for Computational Linguistics and Eighth Conference of the European Chapter of the Association for Computational Linguistics}, series = {ACL {\textquoteright}98}, year = {1997}, month = {1997///}, pages = {151 - 158}, publisher = {Association for Computational Linguistics}, organization = {Association for Computational Linguistics}, address = {Stroudsburg, PA, USA}, abstract = {Verbal and compositional lexical aspect provide the underlying temporal structure of events. Knowledge of lexical aspect, e.g., (a)telicity, is therefore required for interpreting event sequences in discourse (Dowty, 1986; Moens and Steedman, 1988; Passoneau, 1988), interfacing to temporal databases (Androutsopoulos, 1996), processing temporal modifiers (Antonisse, 1994), describing allowable alternations and their semantic effects (Resnik, 1996; Tenny, 1994), and selecting tense and lexical items for natural language generation ((Dorr and Olsen, 1996; Klavans and Chodorow, 1992), cf. (Slobin and Bocaz, 1988)). We show that it is possible to represent lexical aspect---both verbal and compositional---on a large scale, using Lexical Conceptual Structure (LCS) representations of verbs in the classes cataloged by Levin (1993). We show how proper consideration of these universal pieces of verb meaning may be used to refine lexical representations and derive a range of meanings from combinations of LCS representations. A single algorithm may therefore be used to determine lexical aspect classes and features at both verbal and sentence levels. Finally, we illustrate how knowledge of lexical aspect facilitates the interpretation of events in NLP applications.}, doi = {10.3115/976909.979637}, url = {http://dx.doi.org/10.3115/976909.979637}, author = {Dorr, Bonnie J and Olsen,Mari Broman} } @conference {17056, title = {Design and evaluation of incremental data structures and algorithms for dynamic query interfaces}, booktitle = {IEEE Symposium on Information Visualization, 1997. Proceedings}, year = {1997}, month = {1997/10/21/21}, pages = {81 - 86}, publisher = {IEEE}, organization = {IEEE}, abstract = {A dynamic query interface (DQI) is a database access mechanism that provides continuous real-time feedback to the user during query formulation. Previous work shows that DQIs are elegant and powerful interfaces to small databases. Unfortunately, when applied to large databases, previous DQI algorithms slow to a crawl. We present a new incremental approach to DQI algorithms and display updates that work well with large databases, both in theory and in practice.}, keywords = {Algorithm design and analysis, Bars, Computer science, continuous real-time feedback, Data structures, data visualisation, Data visualization, database access mechanism, Displays, DQI algorithms, dynamic query interfaces, Feedback, Graphical user interfaces, Heuristic algorithms, incremental data structures, Information Visualization, large databases, Manipulator dynamics, NASA, query formulation, query languages, Query processing, real-time systems, small databases, User interfaces, very large databases, visual databases, visual languages}, isbn = {0-8186-8189-6}, doi = {10.1109/INFVIS.1997.636790}, author = {Tanin,E. and Beigel,R. and Shneiderman, Ben} } @article {17067, title = {Designing information-abundant web sites: issues and recommendations}, journal = {International Journal of Human-Computer Studies}, volume = {47}, year = {1997}, month = {1997/07//}, pages = {5 - 29}, abstract = {{\textquotedblleft}Gradually I began to feel that we were growing something almost organic in a new kind of reality, in cyberspace, growing it out of information{\textellipsis}a pulsing tree of data that I loved to climb around in, scanning for new growth.{\textquotedblright}(Mickey Hart,Drumming at the Edge of Magic: A Journey into the Spirit of Percussion, 1990) {\textquotedblleft}Look at every path closely and deliberately. Try it as many times as you think necessary. Then ask yourself, and yourself alone, one question{\textellipsis} Does this path have a heart? If it does, the path is good; if it doesn{\textquoteright}t it is of no use.{\textquotedblright} (Carlos CastanedaThe Teachings of Don Juan) The abundance of information on the World Wide Web has thrilled some, but frightened others. Improved web site design may increase users{\textquoteright} successful experiences and positive attitudes. This review of design issues identifies genres of web sites, goals of designers, communities of users and a spectrum of tasks. Then an Objects/Actions Interface Model is offered as a way to think about designing and evaluating web sites. Finally, search and navigation improvements are described to bring consistency, comprehensibility and user control. }, isbn = {1071-5819}, doi = {10.1006/ijhc.1997.0127}, url = {http://www.sciencedirect.com/science/article/pii/S1071581997901270}, author = {Shneiderman, Ben} } @conference {17070, title = {Designing interactive multimedia (panel)}, booktitle = {Proceedings of the fifth ACM international conference on Multimedia}, series = {MULTIMEDIA {\textquoteright}97}, year = {1997}, month = {1997///}, pages = {215 - 218}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, isbn = {0-89791-991-2}, doi = {10.1145/266180.266370}, url = {http://doi.acm.org/10.1145/266180.266370}, author = {Scarlatos,Lori L. and Darken,Rudolph P. and Harada,Komei and Heeter,Carrie and Muller,Richard and Shneiderman, Ben} } @conference {13669, title = {The Detection of Duplicates in Document Image Databases}, booktitle = {ICDAR}, year = {1997}, month = {1997///}, pages = {314 - 318}, abstract = {The problem of off-line handwritten character recognition has eluded a satisfactory solution for several decades. Researchers working in the area of on-line recognition have had greater success, but the possibility of extracting on-line information from static images has not been fully explored. The experience of forensic document examiners assures us that in many cases, such information can be successfully recovered.We outline the design of a system for the recovery of temporal information from static handwritten images. We provide a taxonomy of local, regional and global temporal clues which are often found in hand-written samples, and describe methods for recovering these clues from the image. We show how this system can benefit from obtaining a comprehensive understanding of the handwriting signal and a detailed analysis of stroke and sub-stroke properties. We suggest that the recovery task requires that we break away from traditional thresholding and thinning techniques, and we provide a framework for such analysis. We demonstrate how isolated temporal clues can reliably be extracted from this framework and propose a control structure for integrating the partial information. We show how many seemingly ambiguous situations can be resolved by the derived clues and our knowledge of the writing process, and provide several examples to illustrate our approach. The support of this research by the Ricoh Corporation is gratefully acknowledged. }, author = {David Doermann and Li,H. and Kia,O.} } @article {13755, title = {Development of an object oriented parser/generator, ontologies, and privative aspectual features for interlingual lexical conceptual structures}, year = {1997}, month = {1997///}, institution = {University of Maryland at College Park}, address = {College Park, MD, USA}, author = {Dorr, Bonnie J} } @conference {17083, title = {Direct manipulation for comprehensible, predictable and controllable user interfaces}, booktitle = {Proceedings of the 2nd international conference on Intelligent user interfaces}, year = {1997}, month = {1997///}, pages = {33 - 39}, author = {Shneiderman, Ben} } @inbook {17085, title = {Direct manipulation versus agents: Paths to predictable, controllable, and comprehensible interfaces}, booktitle = {Software agentsSoftware agents}, year = {1997}, month = {1997///}, pages = {97 - 106}, author = {Shneiderman, Ben} } @article {17086, title = {Direct manipulation vs. interface agents}, journal = {Interactions}, volume = {4}, year = {1997}, month = {1997///}, pages = {42 - 61}, author = {Shneiderman, Ben and Maes,P.} } @article {12017, title = {DIRECT MOTION PERCEPTION}, journal = {Visual navigation: from biological systems to unmanned ground vehicles}, year = {1997}, month = {1997///}, pages = {135 - 135}, author = {Ferm{\"u}ller, Cornelia and Aloimonos, J.} } @conference {16461, title = {The distributed information search component (disco) and the world wide web}, booktitle = {Proc. of ACM SIGMOD Conf. on Management of Data}, year = {1997}, month = {1997///}, author = {Naacke,H. and Kapitskaia,O. and Tomasic,A. and Bonnet,P. and Raschid, Louiqa and Amouroux,R.} } @article {13548, title = {Document Understanding - 1996}, volume = {LAMP-TR-008,CFAR-TR-853,CS-TR-3775}, year = {1997}, month = {1997/03//}, institution = {University of Maryland, College Park}, abstract = {This report contains nearly 340 references which are directly related to the field of document image understanding and appeared in major journals and conferences during 1996. Each reference is classified by major topic. Areas covered include, but are not limited to, preprocessing, models and representations, on-line recognition, off-line recognition, graphics recognition and interpretation, page processing, post-processing and special applications.}, author = {David Doermann} } @article {12791, title = {Dynamic priorities for modeling real-time}, journal = {Proc. of the Formal Description Techniques and Protocol Specification, Testing and Verification (FORTE X/PSTV XVII{\textquoteright}97)}, year = {1997}, month = {1997///}, pages = {321 - 336}, author = {Bhat,G. and Cleaveland, Rance and L\{\"u}ttgen,G.} } @article {17068, title = {Designing Information-Abundant Websites}, journal = {Institute for Systems Research Technical Reports}, year = {1996}, month = {1996///}, abstract = {The deluge of web pages has generated dystopian commentaries on the tragedy of the flood as well as utopian visions of harnessing the same flood for constructive purposes. Within this ocean of information there are also lifeboat web pages with design principles, but often the style parallels the early user interface writings in the 1970s. The well-intentioned Noahs who write from personal experience as website designers, often draw their wisdom from specific projects, making their advice incomplete or lacking in generalizability. Their experience is valuable but the paucity of empirical data to validate or sharpen insight means that some guidelines are misleading. As scientific evidence accumulates, foundational cognitive and perceptual theories will structure the discussion and guide designers in novel situations.}, keywords = {human computer interaction, Systems Integration Methodology}, url = {http://drum.lib.umd.edu/handle/1903/5759}, author = {Shneiderman, Ben} } @book {13898, title = {Designing Multimedia Environments for Children: Computers, Creativity, and Kids.}, year = {1996}, month = {1996///}, publisher = {Wiley Computer Publishing, John Wiley and Sons, Inc., One Wiley Drive, Somerset, NJ 08875 ($44.95; Canada, $62.95); phone (Eastern Division): 201-469-4400;(Western Division): 801-972-5828.}, organization = {Wiley Computer Publishing, John Wiley and Sons, Inc., One Wiley Drive, Somerset, NJ 08875 ($44.95; Canada, $62.95); phone (Eastern Division): 201-469-4400;(Western Division): 801-972-5828.}, author = {Druin, Allison and Solomon,C.} } @conference {13671, title = {The Development of a General Framework for Intelligent Document Image Retrieval}, booktitle = {Proceedings in the International Workshop on Document Analysis Systems}, year = {1996}, month = {1996///}, pages = {605 - 632}, author = {David Doermann and Sauvola,J. and Kauniskangas,H. and Shin,C. and Pietikainen,M. and Rosenfeld, A.} } @article {14105, title = {Differential expression of the expression site-associated gene I family in African trypanosomes}, journal = {Journal of Biological Chemistry}, volume = {271}, year = {1996}, month = {1996///}, pages = {9771 - 9771}, author = {Morgan,R. W and El-Sayed, Najib M. and Kepa,J. K and Pedram,M. and Donelson,J. E} } @inbook {14213, title = {Directions of motion fields are hardly ever ambiguous}, booktitle = {Computer Vision {\textemdash} ECCV {\textquoteright}96Computer Vision {\textemdash} ECCV {\textquoteright}96}, series = {Lecture Notes in Computer Science}, volume = {1065}, year = {1996}, month = {1996///}, pages = {119 - 128}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {Recent literature [7, 10, 11, 9, 13, 17] provides a number of results regarding uniqueness aspects of motion fields and exact image displacements due to 3-D rigid motion. Here instead of the full motion field we consider only the direction of the motion field due to a rigid motion and ask what can we say about the three-dimensional motion information contained in it. This paper provides a geometric analysis of this question based solely on the fact that the depth of the surfaces in view is positive (i.e. that the surface in view is in front of the camera). With this analysis we thus offer a theoretical foundation for image constraints employing only the sign of flow in various directions and provide a solid basis for their utilization in addressing 3D dynamic vision problems.}, isbn = {978-3-540-61123-3}, url = {http://dx.doi.org/10.1007/3-540-61123-1_132}, author = {Brodsky, Tomas and Ferm{\"u}ller, Cornelia and Aloimonos, J.}, editor = {Buxton,Bernard and Cipolla,Roberto} } @conference {15533, title = {Disjunctive deductive databases: Semantics, updates and architecture}, booktitle = {Proceedings of the 4th Bar-Ilan Symposium on Foundations of AI}, year = {1996}, month = {1996///}, pages = {256 - 274}, abstract = {The basic assumption in relational and deductive databases is that there are no gaps in our knowledge. That is, the database cannot store data that contain null values or data that is indefinite. In practical situations knowledge is not precise, and there are gaps in our knowledge. These gaps may be due to null values in the data, may arise when we combine several databases that lead to inconsistent theories, or may occur because information is indefinite in nature, such as in military or medical applications. In this paper we describe semantics for disjunctive deductive databases that extend the work in deductive databases, solve the view update problem, and permit indefinite data to be represented efficiently. Hierarchic, stratified, and normal stable models of disjunctive databases are described. An architecture is proposed for a disjunctive deductive database system and a class of theories for which the architecture will be effective is discussed.}, author = {Fernandez,J. A. and Gryz,J. and Minker, Jack} } @article {12991, title = {DNA sequence variation in the ribosomal internal transcribed spacer region of freshwater {\i}t Cladophora species (Chlorophyta)}, journal = {J Phycol}, volume = {32}, year = {1996}, month = {1996/12//}, pages = {1035 - 1042}, abstract = {Freshwater species of Cladophora (Chlorophyta) are globally distributed and occupy an unusually wide range of ecological habitats. Delineating species is difficult because most easily observed morphological traits are highly variable and because sexual reproduction has not been clearly documented. Synthesizing ecological data on freshwater Cladophora species is problematic because it is unclear whether freshwater Cladophora species comprise many genetically distinct species or a few ecologically and morphologically variable and / or plastic species. We determined nucleotide sequences of the internal transcribed spacer (ITS) region of the nuclear ribosomal cistron of freshwater Cladophora species from a wide range of habitats and geographic locations. We compared these sequences to those derived from culture collections of C. fracta and C. glomerata, the two most commonly reported freshwater Cladophora species. Cladophora fracta and C. glomerata had very similar ITS sequences (95.3\%). All other sequences were identical to those from the C. fracta or C. glomerata culture collections with the exception of one California sample that was similar to both C. fracta (95.6\%) and C. glomerata (92.4\%). ITS genotypes did not correlate with morphology or geography. This analysis shows that common freshwater Cladophora species comprise very few (possibly one) ecologically and morphologically variable species.}, keywords = {algae;, Chlorophyta;, Cladophora;, diversity;, freshwater, genetic, internal, spacer, transcribed}, author = {Marks,J. C and Cummings, Michael P.} } @conference {17960, title = {Dynamic view-dependent simplification for polygonal models}, booktitle = {Visualization {\textquoteright}96. Proceedings.}, year = {1996}, month = {1996///}, pages = {327 - 334}, abstract = {Presents an algorithm for performing view-dependent simplifications of a triangulated polygonal model in real-time. The simplifications are dependent on viewing direction, lighting and visibility, and are performed by taking advantage of image-space, object-space and frame-to-frame coherences. A continuous level-of-detail representation for an object is first constructed off-line. This representation is then used at run-time to guide the selection of appropriate triangles for display. The list of displayed triangles is updated incrementally from one frame to the next. Our approach is more effective than the current level-of-detail-based rendering approaches for most scientific visualization applications where there are a limited number of highly complex objects that stay relatively close to the viewer.}, keywords = {coherence;image-space, coherence;incremental, coherence;real-time, continuous, direction;visibility;data, dynamic, level-of-detail, list, model;viewing, polygonal, representation;displayed, selection;triangulated, simplification;scientific, triangle, updating;frame-to-frame, updating;lighting;object-space, view-dependent, visualisation;, visualization;triangle}, doi = {10.1109/VISUAL.1996.568126}, author = {Xia,J. C and Varshney, Amitabh} } @article {18045, title = {Data compression using locally consistent parsing}, journal = {TechnicM report, University of Maryland Department of Computer Science}, year = {1995}, month = {1995///}, author = {Sahinalp,S. C and Vishkin, Uzi} } @conference {17867, title = {Data parallel programming in an adaptive environment}, booktitle = {Parallel Processing Symposium, 1995. Proceedings., 9th International}, year = {1995}, month = {1995///}, pages = {827 - 832}, author = {Edjlali,G. and Agrawal,G. and Sussman, Alan and Saltz, J.} } @conference {17052, title = {Dealing with complexity: uniting agents and direct manipulation (panel session)}, booktitle = {Conference companion on Human factors in computing systems}, series = {CHI {\textquoteright}95}, year = {1995}, month = {1995///}, pages = {191 - 192}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, isbn = {0-89791-755-3}, doi = {10.1145/223355.223504}, url = {http://doi.acm.org/10.1145/223355.223504}, author = {Riecken,Doug and Maes,Pattie and Shneiderman, Ben and Smith,David Canfield} } @article {15535, title = {Deductive Databases and Knowledge Base Systems.}, year = {1995}, month = {1995/03/31/}, institution = {Department of Computer Science, University of Maryland, College Park}, abstract = {The following sections describe the research that has been accomplished during the entire grant period form September 1, 1991 to March 31, 1995, with partial support from the Air Force Office of Scientific Research and summarizes the papers, prototype systems and theses produced on the grant. Several major areas will be discussed. These are Cooperative Databases Systems, Combining Knowledge Base Systems, Disjunctive Deduction Databases, Extensions to the Semantics of Logic Programming and Parallel Logic Programming. During the first year of the grant we emphasized theoretical aspects of work in deductive databases and knowledge base systems. During the second year we stressed the development of tools and techniques to transfer the theory into practical systems. During the third year we developed prototype systems and experiments with them. Technological developments were made in Cooperative Database Systems and Disjunctive Deductive Databases. New theoretical developments were achieved in the Semantics of Logic Programming and in Combining Databases.}, keywords = {*DATA BASES, *KNOWLEDGE BASED SYSTEMS, *RESEARCH MANAGEMENT, *SYSTEMS ENGINEERING, AIR FORCE RESEARCH, COMPUTER LOGIC, COMPUTER PROGRAMMING, COMPUTER PROGRAMMING AND SOFTWARE, COMPUTER SYSTEMS, logic programming, PARALLEL LOGIC PROGRAMMING, PARALLEL PROCESSING, Prototypes, semantics, THESES, TRANSFER., WUAFOSR2304GS}, url = {http://stinet.dtic.mil/oai/oai?\&verb=getRecord\&metadataPrefix=html\&identifier=ADA295498}, author = {Minker, Jack} } @conference {17944, title = {Defining, Computing, and Visualizing Molecular Interfaces}, booktitle = {Proceedings of the 6th conference on Visualization {\textquoteright}95}, series = {VIS {\textquoteright}95}, year = {1995}, month = {1995///}, pages = {36{\textendash} - 36{\textendash}}, publisher = {IEEE Computer Society}, organization = {IEEE Computer Society}, address = {Washington, DC, USA}, abstract = {A parallel, analytic approach for defining and computing the inter- and intra-molecular interfaces in three dimensions is described. The "molecular interface surfaces" are derived from approximations to the power-diagrams over the participating molecular units. For a given molecular interface our approach can generate a family of interface surfaces parametrized by alpha and beta, where alpha is the radius of the solvent molecule (also known as the probe-radius) and beta is the interface radius that defines the size of the molecular interface. Molecular interface surfaces provide biochemists with a powerful tool to study surface complementarity and to efficiently characterize the interactions during a protein-substrate docking. The complexity of our algorithm for molecular environments is O(n k \log^2{k}), where n is the number of atoms in the participating molecular units and k is the average number of neighboring atoms -- a constant, given alpha and beta.}, keywords = {Computational Biochemistry Algorithms Molecular Graphics, Connolly Surfaces, Molecular Interfaces, Molecular Surfaces, Protein-Protein Recognition}, isbn = {0-8186-7187-4}, url = {http://dl.acm.org/citation.cfm?id=832271.833834}, author = {Varshney, Amitabh and Brooks Jr,Frederick P. and Manocha,Dinesh and Wright,William V. and Richardson,David C.} } @book {13756, title = {Development of interlingual lexical conceptual structures with syntactic markers for machine translation}, year = {1995}, month = {1995///}, publisher = {University of Maryland}, organization = {University of Maryland}, abstract = {This document reports on research conducted at the University of Mary-land for the Korean/English Machine Translation (MT) project. Our pri- mary objective was to develop an interlingual representation based on lexical conceptual structure (LCS) and to examine the relation between this repre- sentation and a set of linguistically motivated semantic classes. We view the work of the past year as a critical step toward achieving our goal of building a generator: the classification of LCS{\textquoteright}s into a semantic hierarchy provides a systematic mapping between semantic knowledge about verbs and their surface syntactic structures. We have focused on several areas in support of our objectives: (1) inves- tigation of morphological structure including distinctions between Korean and English; (2) porting a fast, message-passing parser to Korean (and to the IBM PC); (3) study of free word order and development of the associ- ated processing algorithm; (4) investigation of the aspectual dimension as it impacts morphology, syntax, and lexical semantics; (5) investigation of the relation between semantic classes and syntactic structure; (6) develop- ment of theta-role and lexical-semantic templates through lexical acquisition techniques; (7) definition a mapping between KR concepts and interlingual representations; (8) formalization of the lexical conceptual structure }, author = {Dorr, Bonnie J and Lee,J. and Voss,C. and Suh,S.} } @article {14212, title = {Direct Perception of Three-Dimensional Motion from Patterns of Visual Motion}, journal = {ScienceScience}, volume = {270}, year = {1995}, month = {1995/12/22/}, pages = {1973 - 1976}, abstract = {Measurements of retinal motion along a set of predetermined orientations on the retina of a moving system give rise to global patterns. Because the form and location of these patterns depend purely on three-dimensional (3D) motion, the effects of 3D motion and scene structure on image motion can be globally separated. The patterns are founded on easily derivable image measurements that depend only on the sign of image motion and do not require information about optical flow. The computational theory presented here explains how the self-motion of a system can be estimated by locating these patterns.}, isbn = {0036-8075, 1095-9203}, doi = {10.1126/science.270.5244.1973}, url = {http://www.sciencemag.org/content/270/5244/1973}, author = {Ferm{\"u}ller, Cornelia and Aloimonos, J.} } @conference {16713, title = {Disambiguating noun groupings with respect to WordNet senses}, booktitle = {Proceedings of the Third Workshop on Very Large Corpora}, year = {1995}, month = {1995///}, pages = {54 - 68}, author = {Resnik, Philip} } @conference {16619, title = {Discovery of self-replicating structures using a genetic algorithm}, booktitle = {Evolutionary Computation, 1995., IEEE International Conference on}, volume = {2}, year = {1995}, month = {1995///}, pages = {678 - 683}, author = {Lohn,J. D and Reggia, James A.} } @article {17091, title = {Dissertations}, journal = {ACM SIGCHI Bulletin}, volume = {27}, year = {1995}, month = {1995/01//}, pages = {73 - 75}, abstract = {The following are citations selected by title and abstract as being related to Computer-Human Interaction, resulting from a computer search, using Dialog Information Services, of the Dissertation Abstracts Online database produced by University Microfilms International (UMI). Included are UMI order number, title, author, degree, year, institution; number of pages, Dissertation Abstracts International (DAI) subject category chosen by the author, and abstract. Unless otherwise specified, paper or microform copies of dissertations may be ordered from University Microfilms International, Dissertation Copies, Post Office Box 1764, Ann Arbor, MI 48106; telephone for U.S. (except Michigan, Hawaii, Alaska): 1-800-521-3042, for Canada: 1-800-343-5299. Price lists and other ordering and shipping information are in the introduction to the published DAI. An alternate source for copies is sometimes provided. Dissertation titles and abstracts contained here are published with permission of University Microfilms International, publishers of Dissertation Abstracts International (copyright by University Microfilms International), and may not be reproduced without their prior permission.}, isbn = {0736-6906}, doi = {10.1145/202642.570129}, url = {http://doi.acm.org/10.1145/202642.570129}, editor = {Humphrey,Susanne M. and Shneiderman, Ben} } @article {12809, title = {Divergence and fair testing}, journal = {Automata, Languages and Programming}, year = {1995}, month = {1995///}, pages = {648 - 659}, author = {Natarajan,V. and Cleaveland, Rance} } @conference {17049, title = {Data structures for dynamic queries: an analytical and experimental evaluation}, booktitle = {Proceedings of the workshop on Advanced visual interfaces}, series = {AVI {\textquoteright}94}, year = {1994}, month = {1994///}, pages = {1 - 11}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Dynamic Queries is a querying technique for doing range search on multi-key data sets. It is a direct manipulation mechanism where the query is formulated using graphical widgets and the results are displayed graphically preferably within 100 milliseconds.This paper evaluates four data structures, the multilist, the grid file, k-d tree and the quad tree used to organize data in high speed storage for dynamic queries. The effect of factors like size, distribution and dimensionality of data on the storage overhead and the speed of search is explored. Analytical models for estimating the storage and the search overheads are presented, and verified to be correct by empirical data. Results indicate that multilists are suitable for small (few thousand points) data sets irrespective of the data distribution. For large data sets the grid files are excellent for uniformly distributed data, and trees are good for skewed data distributions. There was no significant difference in performance between the tree structures.}, isbn = {0-89791-733-2}, doi = {10.1145/192309.192313}, url = {http://doi.acm.org/10.1145/192309.192313}, author = {Jain,Vinit and Shneiderman, Ben} } @article {11923, title = {Design and implementation of Maruti-II}, journal = {Principles of Real-Time Systems. Prentice Hall}, year = {1994}, month = {1994///}, author = {Saksena,M. and da Silva,J. and Agrawala, Ashok K.} } @conference {18746, title = {Design for manufacture in multi-enterprise partnerships: current status and future directions}, year = {1994}, month = {1994///}, pages = {117 - 125}, abstract = {To pursue market and technology opportunities effectively, US commercial and defense industries will be relying increasingly on multi-enterprise partnerships. Horizontal partnering combines the strengths of multiple firms in product design, manufacture, after sales support and customer service, in order to launch superior products in the global market. To support effective partnering, new approaches will be needed for integrating the activities of design, planning, and production. It is important to address both the fundamental modeling of design, process planning, and production planning in ways that account for the capabilities of potential manufacturing partners, and the development of optimization procedures to address the underlying decision problems. This paper elaborates on these issues and discusses approaches for addressing them.}, url = {http://www.csa.com/partners/viewrecord.php?requester=gs\&collection=TRD\&recid=0160471CI}, author = {Nau, Dana S. and Ball,M. O and Gupta,S.K. and Minis,I. E. and Zhang, G.} } @article {18060, title = {On the detection of robust curves}, journal = {CVGIP: Graphical Models and Image Processing}, volume = {56}, year = {1994}, month = {1994///}, pages = {189 - 204}, author = {Cole,R. and Vishkin, Uzi} } @book {18146, title = {Developing a computer science agenda for high-performance computing}, year = {1994}, month = {1994///}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, isbn = {0-89791-678-6}, editor = {Vishkin, Uzi} } @conference {13546, title = {Document page decomposition by integration of distributed soft decisions}, booktitle = {International Conference on Neural Networks}, year = {1994}, month = {1994///}, pages = {4022 - 4027}, author = {Etemad,K. and David Doermann and Chellapa, Rama} } @conference {13549, title = {Document Understanding at Maryland}, booktitle = {IUW}, year = {1994}, month = {1994///}, pages = {817 - 826}, author = {David Doermann} } @conference {16214, title = {Dynamaps: dynamic queries on a health statistics atlas}, booktitle = {Conference companion on Human factors in computing systems}, series = {CHI {\textquoteright}94}, year = {1994}, month = {1994///}, pages = {439 - 440}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, isbn = {0-89791-651-4}, doi = {10.1145/259963.260438}, url = {http://doi.acm.org/10.1145/259963.260438}, author = {Plaisant, Catherine and Jain,Vinit} } @article {15569, title = {Dynamic algorithms for geometric spanners of small diameter: Randomized solutions}, journal = {Computational Geometry: Theory and Applications}, volume = {13}, year = {1994}, month = {1994///}, pages = {13 - 91}, abstract = {Let S be a set of n points in IR d and let t ? 1 be a real number. A t-spanner for S is a directed graph having the points of S as its vertices, such that for any pair p and q of points there is a path from p to q of length at most t times the Euclidean distance between p and q. Such a path is called a t-spanner path. The spanner diameter of such a spanner is defined as the smallest integer D such that for any pair p and q of points there is a t-spanner path from p to q containing at most D edges. A randomized algorithm is given for constructing a t-spanner that, with high probability, contains O(n) edges and has spanner diameter O(log n). A data structure of size O(n log d n) is given that maintains this t-spanner in O(log d n log log n) expected amortized time per insertion and deletion, in the model of random updates, as introduced by Mulmuley. Keywords: Computational geometry, proximity problems, skip lists, randomization, dynamic data structures. Preprint submitted to Els...}, author = {Arya,Sunil and Mount, Dave and Smid,Michiel} } @conference {14760, title = {Dynamic program instrumentation for scalable performance tools}, booktitle = {Scalable High-Performance Computing Conference, 1994., Proceedings of the}, year = {1994}, month = {1994/05//}, pages = {841 - 850}, publisher = {IEEE}, organization = {IEEE}, abstract = {Presents a new technique called {\textquoteleft}dynamic instrumentation{\textquoteright} that provides efficient, scalable, yet detailed data collection for large-scale parallel applications. Our approach is unique because it defers inserting any instrumentation until the application is in execution. We can insert or change instrumentation at any time during execution by modifying the application{\textquoteright}s binary image. Only the instrumentation required for the currently selected analysis or visualization is inserted. As a result, our technique collects several orders of magnitude less data than traditional data collection approaches. We have implemented a prototype of our dynamic instrumentation on the CM-5, and present results for several real applications. In addition, we include recommendations to operating system designers, compiler writers, and computer architects about the features necessary to permit efficient monitoring of large-scale parallel systems}, keywords = {Application software, binary image, compiler writing, Computer architecture, Computer displays, Computerized monitoring, Concurrent computing, data acquisition, data collection, data visualisation, Data visualization, dynamic program instrumentation, efficient monitoring, executing program, Instruments, large-scale parallel applications, Large-scale systems, operating system design, Operating systems, parallel programming, program analysis, program diagnostics, program visualization, Programming profession, Sampling methods, scalable performance tools, software tools}, isbn = {0-8186-5680-8}, doi = {10.1109/SHPCC.1994.296728}, author = {Hollingsworth, Jeffrey K and Miller, B. P and Cargille, J.} } @article {17104, title = {Dynamic queries for visual information seeking}, journal = {IEEE Software}, volume = {11}, year = {1994}, month = {1994/11//}, pages = {70 - 77}, abstract = {Considers how dynamic queries allow users to "fly through" databases by adjusting widgets and viewing the animated results. In studies, users reacted to this approach with an enthusiasm more commonly associated with video games. Adoption requires research into retrieval and display algorithms and user-interface design. The author discusses how experts may benefit from visual interfaces because they will be able to formulate more complex queries and interpret intricate results.<>}, keywords = {Algorithm design and analysis, animated results, animation, Application software, Command languages, complex queries, database management systems, Databases, display algorithms, Displays, dynamic queries, Educational institutions, Games, Graphical user interfaces, human factors, Query processing, retrieval, Runtime, Technological innovation, user-interface design, visual databases, visual information seeking, visual interfaces, widgets}, isbn = {0740-7459}, doi = {10.1109/52.329404}, author = {Shneiderman, Ben} } @mastersthesis {15381, title = {Data parallel algorithms for the numerical modeling of semiconductor devices}, year = {1993}, month = {1993///}, school = {University of Maryland at College Park}, address = {College Park, MD, USA}, author = {Darling,James Paul}, editor = {Mayergoyz, Issak D} } @article {17053, title = {Declaration in Apple vs. Microsoft/Hewlett-Packard}, journal = {Sparks of innovation in human-computer interaction}, year = {1993}, month = {1993///}, pages = {355 - 355}, author = {Shneiderman, Ben} } @article {18743, title = {Development of machining alternatives, based on MRSEVs}, journal = {Computers in Engineering}, year = {1993}, month = {1993///}, pages = {47 - 47}, abstract = {One missing link between CAD and CAM is the lack ofa systematic methodology for generating and evaluating al- ternative ways to manufacture a proposed design. To ad- dress this problem, we are developing a systematic approach for generating and evaluating alternative ways to manufac- ture machined parts, in order to provide information to the designer about the manufacturability of the proposed de- sign, and information to the process engineer about how best to machine the part. This paper describes our overall approach, and how MRSEVs (Material Removal Shape El- ement Volumes, a STEP library of machining features) can be used to support it. }, url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.37.6348\&rep=rep1\&type=pdf}, author = {Nau, Dana S. and Gupta,S.K. and Kramer,T. R. and Regli,W. C. and Zhang, G.} } @conference {14576, title = {A distributed algorithm for ear decomposition}, booktitle = {, Fifth International Conference on Computing and Information, 1993. Proceedings ICCI {\textquoteright}93}, year = {1993}, month = {1993/05/27/29}, pages = {180 - 184}, publisher = {IEEE}, organization = {IEEE}, abstract = {A distributed algorithm for finding an ear decomposition of an asynchronous communication network with n nodes and m links is presented. At the completion of the algorithm either the ears are correctly labeled or the nodes are informed that there exists no ear decomposition. First we present a novel algorithm to check the existence of an ear decomposition which uses O(m) messages. We also present two other algorithms, one which is time-optimal and the other which is message-optimal to determine the actual ears and their corresponding numbers after determining the existence of an ear decomposition}, keywords = {Asynchronous communication, asynchronous communication network, Automata, Communication networks, computational complexity, Computer networks, Computer science, decomposition graph, distributed algorithm, distributed algorithms, Distributed computing, Ear, ear decomposition, graph theory, message-optimal, network decomposition, sorting, Testing, time-optimal}, isbn = {0-8186-4212-2}, doi = {10.1109/ICCI.1993.315382}, author = {Hannenhalli, Sridhar and Perumalla,K. and Chandrasekharan,N. and Sridhar,R.} } @mastersthesis {13545, title = {Document Image Understanding: Integrating Recovery and Interpretation}, year = {1993}, month = {1993///}, school = {University of Maryland, College Park}, address = {College Park, MD}, author = {David Doermann} } @conference {14780, title = {Dynamic control of performance monitoring on large scale parallel systems}, booktitle = {Proceedings of the 7th international conference on Supercomputing - ICS {\textquoteright}93}, year = {1993}, month = {1993///}, pages = {185 - 194}, address = {Tokyo, Japan}, doi = {10.1145/165939.165969}, url = {http://dl.acm.org/citation.cfm?id=165969}, author = {Hollingsworth, Jeffrey K and Miller, Barton P.} } @article {17105, title = {Dynamic Queries: A step Beyond Database Languages}, journal = {Institute for Systems Research Technical Reports}, year = {1993}, month = {1993///}, abstract = {The capacity to incrementally adjust a query (with sliders, buttons, selections from a set of discrete attribute values, etc.) coupled with a visual display of results that are rapidly updated, dramatically changes the information seeking process. Dynamic queries on the chemical table of elements, computer directions, and a real estate database were built and tested in three separate exploratory experiments. Preliminary results show highly significant performance improvements and user enthusiasm more commonly seen with video games. Widespread application seems possible but research issues abound in the areas of: (1) graphic visualization design, (2) database and display algorithms, and (3) user interface requirements. Challenges include methods for rapidly displaying and changing many points, colors, and areas; multi-dimensional pointing and exploring using 6 degree of freedom input/output devices; incorporation of sound and visual display techniques that increase user comprehension; and integration with existing database systems.}, keywords = {human-computer interaction database query, Systems Integration}, url = {http://drum.lib.umd.edu/handle/1903/5350}, author = {Shneiderman, Ben} } @article {16380, title = {Definitions of dependence distance}, journal = {ACM Letters on Programming Languages and SystemsACM Lett. Program. Lang. Syst.}, volume = {1}, year = {1992}, month = {1992/09//}, pages = {261 - 265}, isbn = {10574514}, doi = {10.1145/151640.151645}, url = {http://dl.acm.org/citation.cfm?id=151645}, author = {Pugh, William} } @article {15623, title = {Delaunay triangulation and computational fluid dynamics meshes}, journal = {Proceedings of the 4th Canadian Conference on Computational Geometry}, year = {1992}, month = {1992///}, pages = {316 - 321}, abstract = {In aerospace computational fluid dynamics (CFD) calculations, the Delaunay triangulation of suitable quadrilateral meshes can lead to unsuitable triangulated meshes. Here, we present case studies which illustrate the limitations of using structured grid generation methods which produce points in a curvilinear coordinate system for subsequent triangulations for CFD applications. We discuss conditions under which meshes of quadrilateral elements may not produce a Delaunay triangulation suitable for CFD calculations, particularly with regard to high aspect ratio, skewed quadrilateral elements.}, author = {Posenau,Mary-Anne K and Mount, Dave} } @article {15818, title = {The Design of Reduced Order Observers with Precise Loop Transfer Recovery}, journal = {AIAA Journal of Guidance, Control, and Dynamics}, volume = {15}, year = {1992}, month = {1992///}, pages = {1320 - 1326}, author = {Monahemi,Moghen M. and Barlow,Jewel B. and O{\textquoteright}Leary, Dianne P.} } @article {14997, title = {On the difficulty of Manhattan channel routing}, journal = {Information Processing Letters}, volume = {44}, year = {1992}, month = {1992/12/21/}, pages = {281 - 284}, abstract = {We show that channel routing in the Manhattan model remains difficult even when all nets are single-sided. Given a set of n single-sided nets, we consider the problem of determining the minimum number of tracks required to obtain a dogleg-free routing. In addition to showing that the decision version of the problem isNP-complete, we show that there are problems requiring at least d+Ω(n) tracks, where d is the density. This existential lower bound does not follow from any of the known lower bounds in the literature.}, keywords = {combinatorial problems, computational complexity, lower bounds, VLSI channel routing}, isbn = {0020-0190}, doi = {10.1016/0020-0190(92)90214-G}, url = {http://www.sciencedirect.com/science/article/pii/002001909290214G}, author = {Greenberg,Ronald and JaJa, Joseph F. and Krishnamurthy,Sridhar} } @article {17092, title = {DISSERTATIONS: ABSTRACTS OF INTEREST}, journal = {ACM SIGCHI Bulletin}, volume = {24}, year = {1992}, month = {1992/04//}, pages = {58 - 75}, abstract = {The following abstracts were selected from a computer search using the BRS Information Technologies retrieval services of the Dissertation Abstracts International (DAI) database produced by University Microfilms International.Unless otherwise specified, paper or microform copies of dissertations may be ordered, using the UM order number, from University Microfilms International, Dissertation Copies, Post Office Box 1794, Ann Arbor, MI 488106; telephone for U.S. (except Michigan, Hawaii, or Alaska): 800/521-3042, for Canada: 800/268-6090. Price lists, ordering, and shipping information are in the introduction to the published DAI. An alternative source for copies is sometimes provided at the end of the abstract.The dissertation titles and abstracts contained here are published with permission of University Microfilms International, publishers of Dissertation Abstracts International (copyright 1985) by University Microfilms International), and may not be reproduced without their prior permission.}, isbn = {0736-6906}, doi = {10.1145/142386.1055546}, url = {http://doi.acm.org/10.1145/142386.1055546}, author = {Humphrey,Susanne M. and Shneiderman, Ben} } @conference {17409, title = {The Dynamic HomeFinder: Evaluating dynamic queries in a real-estate information exploration system}, booktitle = {Proceedings of the 15th annual international ACM SIGIR conference on Research and development in information retrieval}, year = {1992}, month = {1992///}, pages = {338 - 346}, author = {Williamson,C. and Shneiderman, Ben} } @conference {17106, title = {Dynamic queries: database searching by direct manipulation}, booktitle = {Proceedings of the SIGCHI conference on Human factors in computing systems}, series = {CHI {\textquoteright}92}, year = {1992}, month = {1992///}, pages = {669 - 670}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, isbn = {0-89791-513-5}, doi = {10.1145/142750.143082}, url = {http://doi.acm.org/10.1145/142750.143082}, author = {Shneiderman, Ben and Williamson,Christopher and Ahlberg,Christopher} } @conference {17103, title = {Dynamic queries for information exploration: an implementation and evaluation}, booktitle = {Proceedings of the SIGCHI conference on Human factors in computing systems}, series = {CHI {\textquoteright}92}, year = {1992}, month = {1992///}, pages = {619 - 626}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {We designed, implemented and evaluated a new concept for direct manipulation of databases, called dynamic queries, that allows users to formulate queries with graphical widgets, such as sliders. By providing a graphical visualization of the database and search results, users can find trends and exceptions easily. Eighteen undergraduate chemistry students performed statistically significantly faster using a dynamic queries interface compared to two interfaces both providing form fill-in as input method, one with graphical visualization output and one with all-textual output. The interfaces were used to explore the periodic table of elements and search on their properties.}, isbn = {0-89791-513-5}, doi = {10.1145/142750.143054}, url = {http://doi.acm.org/10.1145/142750.143054}, author = {Ahlberg,Christopher and Williamson,Christopher and Shneiderman, Ben} } @conference {15357, title = {Data parallel algorithms for the numerical modeling of semiconductor devices}, booktitle = {Proceedings of the 5th SIAM Conference on Parallel Processing for Scientific Computing}, year = {1991}, month = {1991///}, pages = {394 - 400}, author = {Darling,J. P. and Mayergoyz, Issak D} } @conference {15979, title = {Deadline-coupled real-time planning}, booktitle = {Innovative approaches to planning, scheduling and control: proceedings of a Workshop [on Innovative Approaches to Planning, Scheduling, and Control], held at San Diego, California, November 5-8, 1991}, year = {1991}, month = {1991///}, pages = {100 - 100}, author = {Kraus,S. and Nirkhe,M. and Perlis, Don} } @conference {17054, title = {Demonstrational interfaces: Coming soon?}, booktitle = {Proceedings of the SIGCHI conference on Human factors in computing systems: Reaching through technology}, series = {CHI {\textquoteright}91}, year = {1991}, month = {1991///}, pages = {393 - 396}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, isbn = {0-89791-383-3}, doi = {10.1145/108844.108966}, url = {http://doi.acm.org/10.1145/108844.108966}, author = {Myers,Brad A. and Cypher,Allen and Maulsby,David and Smith,David C. and Shneiderman, Ben} } @article {15583, title = {The densest double-lattice packing of a convex polygon}, journal = {Discrete and Computational Geometry: Papers from the DIMACS Special Year}, volume = {6}, year = {1991}, month = {1991///}, pages = {245 - 262}, author = {Mount, Dave} } @inbook {15817, title = {The Design of Reduced Order Luenberger Observers with Precise LTR}, booktitle = {Proceedings of the AIAA Meeting on Guidance, Navigation and ControlProceedings of the AIAA Meeting on Guidance, Navigation and Control}, volume = {AIAA-91-2731}, year = {1991}, month = {1991/08//}, address = {New Orleans}, abstract = {This work concerns the design of reduced-order observers for controllable, observable, and regular systems in which the number of measurements is more than the number of controls. It uses eigenstructure assignment whereas other approaches use Kalman filter (LQG/LTR) methods. The advantages of this approach are: (1) precise LTR rather than approximate LTR, (2) no restriction to minimum phase systems, (3) finite observer gain rather than asymptotic observer gain, and (4) simpler and more efficient numerical calculation. Case studies are presented illustrating these features in aircraft control applications.}, author = {Monahemi,M. and Barlow,J. and O{\textquoteright}Leary, Dianne P.} } @conference {11928, title = {DTP: An Efficient Transport Protocol}, booktitle = {In Proceedings of the IFIP TC6 Working Conference on ComACM Computing Surveys}, year = {1991}, month = {1991///}, pages = {91 - 133}, abstract = {We recently introduced a new flow control scheme, called send-time control, which is based on a deterministic model of virtual circuits in a computer network. In this scheme, the time at which a packet is sent by a source is computed from estimates of round-trip time, traffic in the network and bottleneck service time. In this paper, we describe a new transport protocol, called DTP, which uses send-time control as its flow control scheme. Preliminary measurements of coast-to-coast connections over the Internet show significant performance improvement over TCP, which is the most commonly used transport protocol in the Internet today. Keyword Codes: C.2.2 Keywords: Computer-Communication Networks, Network Protocols 1. Introduction Flow control is one of the most important function at the transport layer of the protocol hierarchy. The function of flow control schemes is to regulate the traffic entering into the network in order to avoid overloading of network resources, thus preventing c...}, author = {Sanghi,Dheeraj and Agrawala, Ashok K.} } @conference {18081, title = {Deterministic sampling{\textemdash}a new technique for fast pattern matching}, booktitle = {Proceedings of the twenty-second annual ACM symposium on Theory of computing}, year = {1990}, month = {1990///}, pages = {170 - 180}, author = {Vishkin, Uzi} } @conference {16542, title = {Diagnostic reasoning at multiple levels of abstraction}, booktitle = {AI Systems in Government Conference, 1990. Proceedings., Fifth Annual}, year = {1990}, month = {1990///}, pages = {168 - 175}, author = {Chu,B. T.B 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} } @article {18972, title = {Drosophila melanogaster genes for U1 snRNA variants and their expression during development}, journal = {Nucleic Acids ResearchNucl. Acids Res.}, volume = {18}, year = {1990}, month = {1990/01/01/}, pages = {6971 - 6979}, abstract = {We have cloned and characterized a complete set of seven U1-related sequences from Drosophila melanogaster. These sequences are located at the three cytogenetic loci 21D, 82E, and 95C. Three of these sequences have been previously studied: one U1 gene at 21D which encodes the prototype U1 sequence (U1a), one U1 gene at 82E which encodes a U1 variant with a single nucleotide substitution (1Mb), and a pseudogene at 82E. The four previously uncharacterized genes are another U1b gene at 82E, two additional U1 a genes at 95C, and a U1 gene at 95C which encodes a new variant (U1c) with a distinct single nucleotide change relative to U1a. Three blocks of 5' flanking sequence similarity are common to all six full length genes. Using specific primer extension assays, we have observed that the 1Mb RNA is expressed in Drosophila Kc cells and is associated with snRNP proteins, suggesting that the U1b-contalning snRNP particles are able to participate in the process of premRNA splicing. We have also examined the expression throughout Drosophila development of the two U1 variants relative to the prototype sequence. The U1c variant is undetectable by our methods, while the U1b variant exhibits a primarily embryonic pattern reminiscent of the expression of certain U1 variants in sea urchin, Xenopus, and mouse.}, isbn = {0305-1048, 1362-4962}, doi = {10.1093/nar/18.23.6971}, url = {http://nar.oxfordjournals.org/content/18/23/6971}, author = {Lo,Partick C. H. and Mount, Stephen M.} } @article {16585, title = {A data flow implementation of a competition-based connectionist model* 1}, journal = {Journal of Parallel and Distributed Computing}, volume = {6}, year = {1989}, month = {1989///}, pages = {704 - 714}, author = {Tagamets,M. A and Reggia, James A.} } @article {11931, title = {Distributed Checkpointing for Globally Consistent States of Databases}, journal = {IEEE Trans. Softw. Eng.}, volume = {15}, year = {1989}, month = {1989/10//}, pages = {1157 - 1167}, keywords = {Availability, checkpoint, consistency, distributed database, noninterference, recovery, transaction}, isbn = {0098-5589}, doi = {10.1109/TSE.1989.559763}, url = {http://dx.doi.org/10.1109/TSE.1989.559763}, author = {Son,Sang Hyuk and Agrawala, Ashok K.} } @inbook {15743, title = {Domino: A Transportable System for Parallel Processing}, booktitle = {Parallel Processing and Medium-Scale Multiprocessors (Proceedings of a 1986 Conference)Parallel Processing and Medium-Scale Multiprocessors (Proceedings of a 1986 Conference)}, year = {1989}, month = {1989///}, pages = {25 - 34}, publisher = {SIAM Press}, organization = {SIAM Press}, address = {Philadelphia}, author = {O{\textquoteright}Leary, Dianne P. and Stewart, G.W. and Geijn,Robert van de}, editor = {Wouk,Arthur} } @article {11932, title = {Dynamic bin packing problem}, journal = {SIAM Journal on Computing}, volume = {12}, year = {1989}, month = {1989///}, pages = {227 - 258}, abstract = {In a previous work we have defined a general architecture model for autonomous systems, which can be mapped easily to describe the functions of any automated system (SDAG-86-01). In this note, we use the model to describe the problem of thermal management in space stations. First we briefly review the architecture, then we present the environment of our application, and finally we detail the specific function for each functional block of the architecture for that environment.}, author = {Dikshit,Piyush and Guimaraes,Katia and Ramamurthy,Maya and Agrawala, Ashok K. and Larsen,Ronald L} } @article {17115, title = {Dynamic versus static menus: an exploratory comparison}, journal = {ACM SIGCHI Bulletin}, volume = {20}, year = {1989}, month = {1989/04//}, pages = {33 - 37}, abstract = {Sixty-three subjects completed 24 tasks using a menu driven computer program. The menu items appeared in a fixed (static) order during 12 of the tasks. During the other 12 tasks the menu item order changed dynamically such that the most frequently selected items always appeared at the top of the menu. All the subjects tried both dynamic and static menus.The subjects that used adaptive dynamic menus for the first set of tasks were significantly slower than those who used static menus on the first set of tasks. Subjects{\textquoteright} performance during the second set of tasks was not affected by menu style. Eighty-one percent of the subjects preferred working with static menus to working with dynamic menus.}, isbn = {0736-6906}, doi = {10.1145/67243.67247}, url = {http://doi.acm.org/10.1145/67243.67247}, author = {Mitchell,J. and Shneiderman, Ben} } @article {15653, title = {The decomposition of a rectangle into rectangles of minimal perimeter}, journal = {SIAM Journal on Computing}, volume = {17}, year = {1988}, month = {1988///}, pages = {1215 - 1215}, abstract = {This paper solves the problem of subdividing a unit square into p rectangles of area 1/p in such a way that the maximal perimeter of a rectangle is as small as possible. The correctness of the solution is proved using the well-known theorems of Menger and Dilworth.}, author = {Kong,T.Y and Mount, Dave and Roscoe,AW} } @conference {16777, title = {Deep compilation of large rule bases}, booktitle = {Proceedings 2nd International Conference on Expert Database Systems}, year = {1988}, month = {1988///}, author = {Sellis,T. and Roussopoulos, Nick} } @article {15584, title = {The decomposition of a square into rectangles of minimal perimeter}, journal = {Discrete Applied Mathematics}, volume = {16}, year = {1987}, month = {1987/03//}, pages = {239 - 243}, abstract = {This paper solves the problem of subdividing a unit square into p rectangles of area 1/p in such a way that the maximal perimeter of a rectangle is as small as possible. The correctness of the solution is proved using the well-known theorems of Menger and Dilworth.}, isbn = {0166-218X}, doi = {10.1016/0166-218X(87)90061-8}, url = {http://www.sciencedirect.com/science/article/pii/0166218X87900618}, author = {Kong,T.Y and Mount, Dave and Werman,Michael} } @book {17058, title = {Design Guidebook for Interaction Styles: A Taxonomy, Rule-base, and Some Opinions}, year = {1987}, month = {1987///}, publisher = {University of Maryland}, organization = {University of Maryland}, author = {Shneiderman, Ben} } @book {17074, title = {Designing the user interface: professional development courses from the University of Maryland}, year = {1987}, month = {1987///}, publisher = {University of Maryland at College Park}, organization = {University of Maryland at College Park}, address = {College Park, MD, USA}, author = {Shneiderman, Ben} } @conference {12024, title = {Determining three dimensional transformation parameters from images: Theory}, booktitle = {1987 IEEE International Conference on Robotics and Automation. Proceedings}, volume = {4}, year = {1987}, month = {1987/03//}, pages = {57 - 61}, publisher = {IEEE}, organization = {IEEE}, abstract = {We present a theory for the determination of the three dimensional transformation parameters of an object, from its images. The input to this process is the image intensity function and its temporal derivative. In particular, our results are: 1) If the structure of the transforming object in view is known, then the transformation parameters are determined from the solution of a linear system. Rigid motion is a special ease of our theory. 2)If the structure of the object in view is not known, then both the structure and transformation parameters may be computed through a hill climbing or simulated annealing algorithm.}, keywords = {Automation, Computational modeling, Educational institutions, Image motion analysis, Indium tin oxide, Linear systems, Motion estimation, Optical computing, Robots, Simulated annealing}, doi = {10.1109/ROBOT.1987.1088011}, author = {Ito, E. and Aloimonos, J.} } @article {16581, title = {Diagnostic problem-solving with causal chaining}, journal = {International Journal of Intelligent Systems}, volume = {2}, year = {1987}, month = {1987///}, pages = {265 - 302}, author = {Peng,Y. and Reggia, James A.} } @inbook {17084, title = {Direct manipulation user interfaces for expert systems}, booktitle = {Expert systems: the user interfaceExpert systems: the user interface}, year = {1987}, month = {1987///}, pages = {99 - 125}, author = {Baroff,J. and Simon,R. and Gilman,F. and Shneiderman, Ben} } @article {15655, title = {THE DISCRETE GEODESIC PROBLEM}, journal = {SIAM Journal on Computing (SICOMP)}, volume = {16}, year = {1987}, month = {1987///}, abstract = {We presentan algorithm for determining the shortest path between a source and a destinationon an arbitrary (possibly nonconvex) polyhedralsurface. The path is constrained to lie on the surface, and distances are measured according to the Euclidean metric. Our algorithm runs in time O(n log n) and requires O(n2) space, where n is the number of edges of the surface. After we run our algorithm, the distance from the source to any other destination may be determined using standard techniques in time O(log n) by locating the destination in the subdivision created by the algorithm. The actual shortest path from the source to a destination can bereported in time O(k+log n), where k is the number of faces crossed by the path. The algorithm generalizes to the case of multiple source points to build the Voronoi diagram on the surface, where n is now the maximum of the number of vertices and the number of sources. }, author = {JOSEPH,SB and Mount, Dave and Papadimitriou,C. H} } @article {17057, title = {Design and research on the interactive encyclopedia system (TIES)}, journal = {Proc. 29th Conference of the Association for the Development of Computer Based Instructional Systems}, year = {1986}, month = {1986///}, pages = {19 - 21}, abstract = {Printed books were an enormous stimulus to science, culture, commerce, and entertainment. Electronic books and hypertext systems may produce a similar stimulus in the next century, but current designs are poor. Typical screens are too small, too slow, too complicated, and too hard to read. With careful attention to the user interface and the underlying technology, we have a chance to create a new medium that is potentially more attractive and effective than printed books in many situations.}, author = {Morariu,J. and Shneiderman, Ben} } @article {17071, title = {Designing menu selection systems}, journal = {Journal of the American Society for Information Science}, volume = {37}, year = {1986}, month = {1986/03/01/}, pages = {57 - 70}, abstract = {Menu selection systems reduce training and memorization, simplify entry of choices, and structure the user{\textquoteright}s tasks. However, the use of menu selection is no guarantee that novices or experts will be satisfied or able to carry out their work. This article focuses on the multiple design issues in creating successful menu selection systems. These include the primary issue of semantic organization and the host of secondary issues such as response time and display rates, shortcuts for frequent users, titles, phrasing of menu items, graphic layout, and selection mechanisms. Novel approaches such as pop-up menus and embedded menus are covered. Experimental results and design guidelines are presented. {\textcopyright} 1986 John Wiley \& Sons, Inc.}, isbn = {1097-4571}, doi = {10.1002/(SICI)1097-4571(198603)37:2<57::AID-ASI2>3.0.CO;2-S}, url = {http://onlinelibrary.wiley.com/doi/10.1002/(SICI)1097-4571(198603)37:2\%3C57::AID-ASI2\%3E3.0.CO;2-S/abstract}, author = {Shneiderman, Ben} } @article {11984, title = {Determining the Translation of a Rigidly Moving Surface, without Correspondence,}, year = {1986}, month = {1986/01//}, abstract = {A method is presented for the recovery of the three-dimensional translation of a rigidly moving textured object from its images. The novelty of the method consists of the fact that four cameras are used in order to avoid the solution of the correspondence problem. The method seems to be immune to small noise percentages and to have good behavior when the noise increases. Keywords: Computer vision.}, keywords = {*IMAGE PROCESSING, *OPTICAL DETECTION, *Translation(Image processing), CAMERAS, Computer vision, COMPUTERS, IMMUNITY., MOTION, MOVING TARGETS, NOISE, OPTICAL DETECTION AND DETECTORS, SURFACES, THREE DIMENSIONAL, VISION}, url = {http://stinet.dtic.mil/oai/oai?\&verb=getRecord\&metadataPrefix=html\&identifier=ADA179409}, author = {Aloimonos, J. and Basu, Anup} } @conference {18114, title = {Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithms}, booktitle = {Proceedings of the eighteenth annual ACM symposium on Theory of computing}, year = {1986}, month = {1986///}, pages = {206 - 219}, author = {Cole,R. and Vishkin, Uzi} } @article {18111, title = {Deterministic coin tossing with applications to optimal parallel list ranking}, journal = {Information and Control}, volume = {70}, year = {1986}, month = {1986///}, pages = {32 - 53}, author = {Cole,R. and Vishkin, Uzi} } @article {17090, title = {Display Strategies for Program Browsing: Concepts and Experiment}, journal = {IEEE Software}, volume = {3}, year = {1986}, month = {1986/05//}, pages = {7 - 15}, abstract = {The new, larger display screens can improve program comprehension{\textemdash}if the added space is used for mome effective presentation, not just more code or larger type.}, keywords = {Computer errors, Content management, Fault detection, Information analysis, Large screen displays, Microscopy, Phase detection, Programming profession, User interfaces}, isbn = {0740-7459}, doi = {10.1109/MS.1986.233405}, author = {Shneiderman, Ben and Shafer,P. and Simon,R. and Weldon,L.} } @article {15739, title = {Data-flow algorithms for parallel matrix computation}, journal = {Communications of the ACM}, volume = {28}, year = {1985}, month = {1985/08//}, pages = {840 - 853}, abstract = {In this article we develop some algorithms and tools for solving matrix problems on parallel processing computers. Operations are synchronized through data-flow alone, which makes global synchronization unnecessary and enables the algorithms to be implemented on machines with very simple operating systems and communication protocols. As examples, we present algorithms that form the main modules for solving Liapounov matrix equations. We compare this approach to wave front array processors and systolic arrays, and note its advantages in handling missized problems, in evaluating variations of algorithms or architectures, in moving algorithms from system to system, and in debugging parallel algorithms on sequential machines.}, isbn = {0001-0782}, doi = {10.1145/4021.4025}, url = {http://doi.acm.org/10.1145/4021.4025}, author = {O{\textquoteright}Leary, Dianne P. and Stewart, G.W.} } @book {12004, title = {Detection of Surface Orientation and Motion from Texture: The Case of Planes}, year = {1985}, month = {1985///}, publisher = {Dept. of Computer Science, University of Rochester}, organization = {Dept. of Computer Science, University of Rochester}, author = {Aloimonos, J. and Chou, P. B and Science, University of Rochester. Dept. of Computer} } @conference {18927, title = {Deterministic parsing: A modern view}, volume = {15}, year = {1985}, month = {1985///}, pages = {15 - 33}, author = {Berwick,R. and Weinberg, Amy} } @conference {16773, title = {Direct spatial search on pictorial databases using packed R-trees}, booktitle = {ACM SIGMOD Record}, volume = {14}, year = {1985}, month = {1985///}, pages = {17 - 31}, author = {Roussopoulos, Nick and Leifker,D.} } @article {16614, title = {DS Nau, and PY Wang. A formal model of diagnostic inference}, journal = {Information Sciences}, volume = {37}, year = {1985}, month = {1985///}, pages = {227 - 285}, author = {Reggia, James A.} } @article {16804, title = {Dynamic access control for relational views.}, journal = {INFO. SYST.}, volume = {10}, year = {1985}, month = {1985///}, pages = {361 - 369}, author = {Roussopoulos, Nick and Bader,C.} } @article {18380, title = {Data collection and evaluation for experimental computer science research}, journal = {Information Processing \& Management}, volume = {20}, year = {1984}, month = {1984///}, pages = {269 - 276}, abstract = {The Software Engineering Laboratory has been monitoring software development at NASA Goddard Space Flight Center since 1976. This report describes the data collection activities of the Laboratory and some of the difficulties of obtaining reliable data. In addition, the application of this data collection process to a current prototyping experiment is reviewed.}, isbn = {0306-4573}, doi = {10.1016/0306-4573(84)90059-1}, url = {http://www.sciencedirect.com/science/article/pii/0306457384900591}, author = {Zelkowitz, Marvin V} } @book {17069, title = {Designing Interactive Computer Systems: A Software Psychology Workshop}, year = {1984}, month = {1984///}, publisher = {University of California, Los Angeles, University Extension, Dept. of Engineering, Science, and Mathematics}, organization = {University of California, Los Angeles, University Extension, Dept. of Engineering, Science, and Mathematics}, author = {Shneiderman, Ben} } @conference {12012, title = {Direct processing of curvilinear sensor motion from a sequence of perspective images}, booktitle = {Proc. Workshop on Computer Vision: Representation and Control}, volume = {72}, year = {1984}, month = {1984///}, pages = {77 - 77}, author = {Aloimonos, J. and Brown, C. M.} } @article {16616, title = {Diagnostic expert systems based on a set covering model}, journal = {International Journal of Man-Machine Studies}, volume = {19}, year = {1983}, month = {1983///}, pages = {437 - 460}, author = {Reggia, James A. and Nau, Dana S. and Wang,P. Y} } @article {15742, title = {Digital Image Compression by Outer Product Expansion}, journal = {Communications, IEEE Transactions on}, volume = {31}, year = {1983}, month = {1983/03//}, pages = {441 - 444}, abstract = {We approximate a digital image as a sum of outer products dxyTwheredis a real number but the vectorsxandyhave elements +1, -1, or 0 only. The expansion gives a least squares approximation. Work is proportional to the number of pixels; reconstruction involves only additions.}, keywords = {approximation;, coding;, image, Least-squares, Transform}, isbn = {0090-6778}, doi = {10.1109/TCOM.1983.1095823}, author = {O{\textquoteright}Leary, Dianne P. and Peleg,S.} } @article {18133, title = {Dynamic parallel memories}, journal = {Information and control}, volume = {56}, year = {1983}, month = {1983///}, pages = {174 - 182}, author = {Vishkin, Uzi and Wigderson,A.} } @article {17064, title = {Designing computer system messages}, journal = {Communications of the ACM}, volume = {25}, year = {1982}, month = {1982/09//}, pages = {610 - 611}, abstract = {tive computer systems and studies of their users, we have become increasingly aware of the importance of system messages. Novice users are unimpressed with CPU speeds, disk storage capabilities, or elegant file structures. For them, the system appears only in the form of the messages on their screens or printers. So when novices encounter violent messages such as {\textquotedblleft}FATAL ERROR, RUN ABORTED{\textquotedblright}, vague phases like {\textquotedblleft}ILLEGAL CMD{\textquotedblright}, or obscure codes such as {\textquotedblleft}OC7{\textquotedblright} or {\textquotedblleft}IEH2191{\textquotedblright}, they are understandably shaken, confused, dismayed, and discouraged from continuing. The negative image that computer systems sometimes generate is, we believe, largely due to the difficulties users experience when they make mistakes or are unsure about what to do next.}, keywords = {error messages, human/computer interaction, system messages}, isbn = {0001-0782}, doi = {10.1145/358628.358639}, url = {http://doi.acm.org/10.1145/358628.358639}, author = {Shneiderman, Ben} } @book {17088, title = {Directions in human/computer interaction.}, year = {1982}, month = {1982///}, publisher = {ABLEX PUBL. CORP.}, organization = {ABLEX PUBL. CORP.}, address = {355 CHESTNUT ST., NORWOOD, NJ 07648, USA}, abstract = {This book presents current research in interactive system design and human information processing. The contributions offer a mixture of survey, theory, practical recommendations and experimental results reflecting the diversity of research efforts in human/computer interaction.}, author = {Badre,A. and Shneiderman, Ben} } @article {15699, title = {A Discrete Newton Algorithm for Minimizing a Function of Many Variables}, journal = {Mathematical Programming}, volume = {23}, year = {1982}, month = {1982///}, pages = {20 - 33}, abstract = {A Newton-like method is presented for minimizing a function of n variables. It uses only function and gradient values and is a variant of the discrete Newton algorithm. This variant requires fewer operations than the standard method when n > 39, and storage is proportional to n rather than n.}, author = {O{\textquoteright}Leary, Dianne P.} } @article {17087, title = {Direct manipulation: A step beyond programming languages (abstract only)}, journal = {ACM SIGSOC Bulletin}, volume = {13}, year = {1981}, month = {1981/05//}, pages = {143 - 143}, abstract = {Direct manipulation is a style of interaction which has been used by implementers of widely varying systems. Direct manipulation permits novice users access to powerful facilities without the burden of learning to use a complex syntax and lengthy list of commands. Display editors use direct manipulation more than line editors. Form-fill-in is more direct than tag fields and delimiters. Spatial data management is more direct than query-by-example, which is more direct than SEQUEL. Computer arcade games and Visicalc are further examples.Direct manipulation involves three interrelated techniques:1. Provide a physically direct way of moving a cursor or manipulating the objects of interest.2. Present a concrete visual representation of the objects of interest and immediately change the view to reflect operations.3. Avoid using a command language and depend? on operations applied to the cognitive model which is shown on the display.}, isbn = {0163-5794}, doi = {10.1145/1015579.810991}, url = {http://doi.acm.org/10.1145/1015579.810991}, author = {Shneiderman, Ben} } @conference {17051, title = {Database Program Conversion: A Framework For Research}, booktitle = {Fifth International Conference on Very Large Data Bases, 1979}, year = {1979}, month = {1979/10/03/5}, pages = {299 - 312}, publisher = {IEEE}, organization = {IEEE}, keywords = {Application software, Costs, Data conversion, Data structures, Databases, Delay, Prototypes, Technology planning, US Government, Writing}, doi = {10.1109/VLDB.1979.718145}, author = {Taylor,R. W and Fry,J. P and Shneiderman, Ben and Smith,D. C.P and Su,S. Y.W} } @book {17047, title = {Data Bases: Improving Usability and Effectiveness}, year = {1978}, month = {1978///}, publisher = {Academic Press, Inc.}, organization = {Academic Press, Inc.}, address = {Orlando, FL, USA}, isbn = {0126421501}, author = {Shneiderman, Ben} } @article {17059, title = {Design, development and utilization perspectives on database management systems}, journal = {Information Processing \& Management}, volume = {13}, year = {1977}, month = {1977///}, pages = {23 - 33}, abstract = {This paper reviews the historical development of integrated database management systems and examines the competing approaches. Topics covered include management and utilization perspectives, implementation and design issues, query languages, security, integrity, privacy and concurrency. Extensive references are provided.}, isbn = {0306-4573}, doi = {10.1016/0306-4573(77)90028-0}, url = {http://www.sciencedirect.com/science/article/pii/0306457377900280}, author = {Shneiderman, Ben} }