@article {19706, title = {Surveying the Accessibility of Mobile Touchscreen Games for Persons with Motor Impairments: A Preliminary Analysis}, journal = {terpconnect.umd.edu}, year = {Submitted}, abstract = {ABSTRACT Touchscreen devices have rapidly become one of the most pervasive video game platforms in the world and, in turn, an integral part of popular culture; however, little work exists on comprehensively examining their accessibility. In this poster paper, we ...}, url = {http://terpconnect.umd.edu/~leahkf/pubs/ASSETS2013-TouchscreenGames.pdf}, author = {Kim, Y and Sutreja, N and Jon Froehlich and Findlater, L} } @article {20548, title = {Rapid, quantitative therapeutic screening for Alzheimer{\textquoteright}s enzymes enabled by optimal signal transduction with transistors}, journal = {The Analyst}, volume = {145}, year = {2020}, month = {Feb-04-2021}, pages = {2925 - 2936}, issn = {0003-2654}, doi = {10.1039/C9AN01804B}, url = {http://xlink.rsc.org/?DOI=C9AN01804Bhttp://pubs.rsc.org/en/content/articlepdf/2020/AN/C9AN01804Bhttp://pubs.rsc.org/en/content/articlepdf/2020/AN/C9AN01804B}, author = {Le, Son T. and Morris, Michelle A. and Cardone, Antonio and Guros, Nicholas B. and Klauda, Jeffery B. and Sperling, Brent A. and Richter, Curt A. and Pant, Harish C. and Balijepalli, Arvind} } @article {20295, title = {Biofilms Comprise a Component of the Annual Cycle of Vibrio cholerae in the Bay of Bengal Estuary}, journal = {mBio}, year = {2018}, month = {Feb-05-2018}, pages = {e00483-18}, abstract = {Vibrio cholerae, an estuarine bacterium, is the causative agent of cholera, a severe diarrheal disease that demonstrates seasonal incidence in Bangladesh. In an extensive study of V. cholerae occurrence in a natural aquatic environment, water and plankton samples were collected biweekly between December 2005 and November 2006 from Mathbaria, an estuarine village of Bangladesh near the mangrove forests of the Sundarbans. Toxigenic V. cholerae exhibited two seasonal growth peaks, one in spring (March to May) and another in autumn (September to November), corresponding to the two annual seasonal outbreaks of cholera in this region. The total numbers of bacteria determined by heterotrophic plate count (HPC), representing culturable bacteria, accounted for 1\% to 2.7\% of the total numbers obtained using acridine orange direct counting (AODC). The highest bacterial culture counts, including toxigenic V. cholerae, were recorded in the spring. The direct fluorescent antibody (DFA) assay was used to detect V. cholerae O1 cells throughout the year, as free-living cells, within clusters, or in association with plankton. V. cholerae O1 varied significantly in morphology, appearing as distinctly rod-shaped cells in the spring months, while small coccoid cells within thick clusters of biofilm were observed during interepidemic periods of the year, notably during the winter months. Toxigenic V. cholerae O1 was culturable in natural water during the spring when the temperature rose sharply. The results of this study confirmed biofilms to be a means of persistence for bacteria and an integral component of the annual life cycle of toxigenic V. cholerae in the estuarine environment of Bangladesh.}, doi = {10.1128/mBio.00483-18}, url = {https://mbio.asm.org/content/9/2/e00483-18}, author = {Sultana, Marzia and Nusrin, Suraia and Hasan, Nur A. and Sadique, Abdus and Ahmed, Kabir U. and Islam, Atiqul and Hossain, Anwar and Longini, Ira and Nizam, Azhar and Huq, Anwar and Siddique, Abul K. and Sack, David A. and Sack, Richard B. and Rita R Colwell and Alam, Munirul}, editor = {Vidaver, Anne K.} } @article {20288, title = {Characterization of the Microbiome at the World{\textquoteright}s Largest Potable Water Reuse Facility}, journal = {Frontiers in Microbiology}, year = {2018}, month = {Feb-10-2020}, abstract = {Conventional water resources are not sufficient in many regions to meet the needs of growing populations. Due to cyclical weather cycles, drought, and climate change, water stress has increased worldwide including in Southern California, which serves as a model for regions that integrate reuse of wastewater for both potable and non-potable use. The Orange County Water District (OCWD) Advanced Water Purification Facility (AWPF) is a highly engineered system designed to treat and produce up to 100 million gallons per day (MGD) of purified water from a municipal wastewater source for potable reuse. Routine facility microbial water quality analysis is limited to standard indicators at this and similar facilities. Given recent advances in high throughput DNA sequencing techniques, complete microbial profiling of communities in water samples is now possible. By using 16S/18S rRNA gene sequencing, metagenomic and metatranscriptomic sequencing coupled to a highly accurate identification method along with 16S rRNA gene qPCR, we describe a detailed view of the total microbial community throughout the facility. The total bacterial load of the water at stages of the treatment train ranged from 3.02 {\texttimes} 106 copies in source, unchlorinated wastewater feed to 5.49 {\texttimes} 101 copies of 16S rRNA gene/mL after treatment (consisting of microfiltration, reverse osmosis, and ultraviolet/advanced oxidation). Microbial diversity and load decreased by several orders of magnitude after microfiltration and reverse osmosis treatment, falling to almost non-detectable levels that more closely resembled controls of molecular grade laboratory water than the biomass detected in the source water. The presence of antibiotic resistance genes and viruses was also greatly reduced. Overall, system design performance was achieved, and comprehensive microbial community analysis was found to enable a more complete characterization of the water/wastewater microbial signature. Keywords: water reuse, pathogens, water purification, metatranscriptomics, metagenomics}, doi = {10.3389/fmicb.2018.02435}, url = {https://www.frontiersin.org/articles/10.3389/fmicb.2018.02435/full}, author = {Stamps, Blake W. and Leddy, Menu B. and Plumlee, Megan H. and Hasan, Nur A. and Rita R Colwell and Spear, John R.} } @article {20293, title = {Comparison of Infant Gut and Skin Microbiota, Resistome and Virulome Between Neonatal Intensive Care Unit (NICU) Environments}, journal = {Frontiers in Microbiology}, year = {2018}, month = {Jan-06-2020}, doi = {10.3389/fmicb.2018.01361}, url = {https://www.frontiersin.org/article/10.3389/fmicb.2018.01361/full}, author = {Hourigan, Suchitra K. and Subramanian, Poorani and Hasan, Nur A. and Ta, Allison and Klein, Elisabeth and Chettout, Nassim and Huddleston, Kathi and Deopujari, Varsha and Levy, Shira and Baveja, R and Clemency, Nicole C. and Baker, Robin L. and Niederhuber, John E. and Rita R Colwell} } @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} } @article {20300, title = {High-Throughput DNA Sequencing To Profile Microbial Water Quality Of Potable Reuse}, year = {2018}, url = {https://www.wateronline.com/doc/high-throughput-dna-sequencing-to-profile-microbial-water-quality-of-potable-reuse-0001}, author = {Menu B. Leddy and Megan H. Plumlee and Rose S. Kantor and Kara L. Nelson and Scott E. Miller and Lauren C. Kennedy and Blake W. Stamps and John R. Spear and Nur A. Hasan and Rita R Colwell} } @article {20290, title = {Spores and soil from six sides: interdisciplinarity and the environmental biology of anthrax (Bacillus anthracis)}, journal = {Biological Reviews}, year = {2018}, month = {Jan-11-2018}, pages = {1813 - 1831}, abstract = {Environmentally transmitted diseases are comparatively poorly understood and managed, and their ecology is particularly understudied. Here we identify challenges of studying environmental transmission and persistence with a six-sided interdisciplinary review of the biology of anthrax (Bacillus anthracis). Anthrax is a zoonotic disease capable of maintaining infectious spore banks in soil for decades (or even potentially centuries), and the mechanisms of its environmental persistence have been the topic of significant research and controversy. Where anthrax is endemic, it plays an important ecological role, shaping the dynamics of entire herbivore communities. The complex eco-epidemiology of anthrax, and the mysterious biology of Bacillus anthracis during its environmental stage, have necessitated an interdisciplinary approach to pathogen research. Here, we illustrate different disciplinary perspectives through key advances made by researchers working in Etosha National Park, a long-term ecological research site in Namibia that has exemplified the complexities of the enzootic process of anthrax over decades of surveillance. In Etosha, the role of scavengers and alternative routes (waterborne transmission and flies) has proved unimportant relative to the long-term persistence of anthrax spores in soil and their infection of herbivore hosts. Carcass deposition facilitates green-ups of vegetation to attract herbivores, potentially facilitated by the role of anthrax spores in the rhizosphere. The underlying seasonal pattern of vegetation, and herbivores{\textquoteright} immune and behavioural responses to anthrax risk, interact to produce regular {\textquoteleft}anthrax seasons{\textquoteright} that appear to be a stable feature of the Etosha ecosystem. Through the lens of microbiologists, geneticists, immunologists, ecologists, epidemiologists, and clinicians, we discuss how anthrax dynamics are shaped at the smallest scale by population genetics and interactions within the bacterial communities up to the broadest scales of ecosystem structure. We illustrate the benefits and challenges of this interdisciplinary approach to disease ecology, and suggest ways anthrax might offer insights into the biology of other important pathogens. Bacillus anthracis, and the more recently emerged Bacillus cereus biovar anthracis, share key features with other environmentally transmitted pathogens, including several zoonoses and panzootics of special interest for global health and conservation efforts. Understanding the dynamics of anthrax, and developing interdisciplinary research programs that explore environmental persistence, is a critical step forward for understanding these emerging threats. }, doi = {10.1111/brv.12420}, url = {https://onlinelibrary.wiley.com/doi/full/10.1111/brv.12420}, author = {Carlson, Colin J. and Getz, Wayne M. and Kausrud, Kyrre L. and Cizauskas, Carrie A. and Blackburn, Jason K. and Bustos Carrillo, Fausto A. and Rita R Colwell and Easterday, W. Ryan and Ganz, Holly H. and Kamath, Pauline L. and {\O}kstad, Ole A. and Turner, Wendy C. and Kolsto, Anne-Brit and Stenseth, Nils C.} } @article {20298, title = {Virulence-Related Genes Identified from the Genome Sequence of the Non-O1/Non-O139 Vibrio cholerae Strain VcN1, Isolated from Dhaka, Bangladesh}, journal = {Genome Announcements}, year = {2018}, month = {Aug-03-2018}, abstract = {We report here the first draft genome sequence of the non-O1/non-O139 Vibrio cholerae strain VcN1, isolated from Dhaka, Bangladesh. The data submitted to GenBank for this strain will contribute to advancing our understanding of this environmentally disseminated bacterium, including its virulence and its evolution as an important pathogen.}, doi = {10.1128/genomeA.01513-17}, url = {https://mra.asm.org/content/6/10/e01513-17}, author = {Hossain, Maqsud and Alam, Munirul and Khaleque, Abdul and Islam, Sohidul and Sadique, Abdus and Khan, Nayeim and Halim, Zahra and Sarker, Mrinmoy and El-Sayed, Najib M. and Huq, Anwar and Ahsan, Gias Uddin and Rita R Colwell} } @article {20448, title = {A Bioinformatics 3D Cellular Morphotyping Strategy for Assessing Biomaterial Scaffold Niches}, journal = {ACS Biomaterials Science \& Engineering}, volume = {3}, year = {2017}, month = {Sep-10-2017}, pages = {2302 - 2313}, issn = {2373-9878}, doi = {10.1021/acsbiomaterials.7b00473}, url = {http://pubs.acs.org/doi/10.1021/acsbiomaterials.7b00473http://pubs.acs.org/doi/pdf/10.1021/acsbiomaterials.7b00473}, author = {Florczyk, Stephen J. and Simon, Mylene and Juba, Derek and Pine, P. Scott and Sarkar, Sumona and Chen, Desu and Baker, Paula J. and Bodhak, Subhadip and Cardone, Antonio and Brady, Mary C. and Bajcsy, Peter and Simon, Carl G.} } @article {20307, title = {Characterization of Microbial Signatures From Advanced Treated Wastewater Biofilms}, journal = {Journal - American Water Works Association}, volume = {109}, year = {2017}, month = {Jan-11-2017}, pages = {E503 - E512}, abstract = {Next-generation sequencing (NGS) and metagenomics were used to identify microbial communities in biofilms of microfiltration (MF) and reverse osmosis (RO) membranes in an advanced water purification facility (AWPF) that treats municipal wastewater to produce potable quality water. Secondary treated wastewater effluent is the source of influent to the AWPF treatment train and was also characterized by NGS. Results show low bacterial diversity in biofilms obtained from the feed-side surfaces of MF and RO membranes. Microbial communities and antibiotic resistance genes (ARGs) in the RO biofilm were compared with those of the MF and influent, revealing lower abundance of bacterial species and ARGs in the RO biofilm than in the other samples. Opportunistic pathogens were detected in all samples; however, indicator bacteria, viruses, and bacteriophages were not detected in the RO biofilm. It is concluded that NGS has great potential for improved detection and characterization of microbial communities in biofilms that form on AWPF MF and RO membranes.}, doi = {10.5942/jawwa.2017.109.0116}, url = {http://doi.wiley.com/10.5942/jawwa.2017.109.0116}, author = {Leddy, Menu B. and Hasan, Nur A. and Subramanian, Poorani and Heberling, Colin and Cotruvo, Joseph and Rita R Colwell} } @article {20305, title = {Characterization of Two Cryptic Plasmids Isolated in Haiti from Clinical Vibrio cholerae Non-O1/Non-O139}, journal = {Frontiers in Microbiology}, year = {2017}, month = {Nov-11-2018}, doi = {10.3389/fmicb.2017.02283}, url = {http://journal.frontiersin.org/article/10.3389/fmicb.2017.02283}, author = {Ceccarelli, Daniela and Garriss, Genevieve and Choi, Seon Y. and Hasan, Nur A. and Stepanauskas, Ramunas and Pop, Mihai and Huq, Anwar and Rita R Colwell} } @article {20311, title = {Comparative Genomics of Escherichia coli Isolated from Skin and Soft Tissue and Other Extraintestinal Infections}, journal = {mBio}, year = {2017}, month = {Jun-09-2017}, abstract = {Escherichia coli, an intestinal Gram-negative bacterium, has been shown to be associated with a variety of diseases in addition to intestinal infections, such as urinary tract infections (UTIs), meningitis in neonates, septicemia, skin and soft tissue infections (SSTIs), and colisepticemia. Thus, for nonintestinal infections, it is categorized as extraintestinal pathogenic E. coli (ExPEC). It is also an opportunistic pathogen, causing cross infections, notably as an agent of zoonotic diseases. However, comparative genomic data providing functional and genetic coordinates for ExPEC strains associated with these different types of infections have not proven conclusive. In the study reported here, ExPEC E. coli isolated from SSTIs was characterized, including virulence and drug resistance profiles, and compared with isolates from patients suffering either pyelonephritis or septicemia. Results revealed that the majority of the isolates belonged to two pathogenic phylogroups, B2 and D. Approximately 67\% of the isolates were multidrug resistant (MDR), with 85\% producing extended-spectrum beta-lactamase (ESBL) and 6\% producing metallo-beta-lactamase (MBL). The blaCTX-M-15 genotype was observed in at least 70\% of the E. coli isolates in each category, conferring resistance to an extended range of beta-lactam antibiotics. Whole-genome sequencing and comparative genomics of the ExPEC isolates revealed that two of the four isolates from SSTIs, NA633 and NA643, belong to pandemic sequence type ST131, whereas functional characteristics of three of the ExPEC pathotypes revealed that they had equal capabilities to form biofilm and were resistant to human serum. Overall, the isolates from a variety of ExPEC infections demonstrated similar resistomes and virulomes and did not display any disease-specific functional or genetic coordinates. IMPORTANCE Infections caused by extraintestinal pathogenic E. coli (ExPEC) are of global concern as they result in significant costs to health care facilities management. The recent emergence of a multidrug-resistant pandemic clone, Escherichia coli ST131, is of primary concern as a global threat. In developing countries, such as India, skin and soft tissue infections (SSTIs) associated with E. coli are marginally addressed. In this study, we employed both genomic analysis and phenotypic assays to determine relationships, if any, among the ExPEC pathotypes. Similarity between antibiotic resistance and virulence profiles was observed, ST131 isolates from SSTIs were reported, and genomic similarities among strains isolated from different disease conditions were detected. This study provides functional molecular infection epidemiology insight into SSTI-associated E. coli compared with ExPEC pathotypes.}, doi = {10.1128/mBio.01070-17}, url = {http://mbio.asm.org/lookup/doi/10.1128/mBio.01070-17}, author = {Ranjan, Amit and Shaik, Sabiha and Nandanwar, Nishant and Hussain, Arif and Tiwari, Sumeet K. and Semmler, Torsten and Jadhav, Savita and Wieler, Lothar H. and Alam, Munirul and Rita R Colwell and Ahmed, Niyaz}, editor = {Cossart, Pascale F.} } @article {20308, title = {Comprehensive benchmarking and ensemble approaches for metagenomic classifiers}, journal = {Genome Biology}, year = {2017}, month = {Jan-12-2017}, doi = {10.1186/s13059-017-1299-7}, url = {http://genomebiology.biomedcentral.com/articles/10.1186/s13059-017-1299-7}, author = {McIntyre, Alexa B. R. and Ounit, Rachid and Afshinnekoo, Ebrahim and Prill, Robert J. and H{\'e}naff, Elizabeth and Alexander, Noah and Minot, Samuel S. and Danko, David and Foox, Jonathan and Ahsanuddin, Sofia and Tighe, Scott and Hasan, Nur A. and Subramanian, Poorani and Moffat, Kelly and Levy, Shawn and Lonardi, Stefano and Greenfield, Nick and Rita R Colwell and Rosen, Gail L. and Mason, Christopher E.} } @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 {20313, title = {Genomic Methods and Microbiological Technologies for Profiling Novel and Extreme Environments for the Extreme Microbiome Project (XMP)}, journal = {Journal of Biomolecular Techniques : JBT}, volume = {28}, year = {2017}, month = {Jan-04-2017}, pages = {31 - 39}, abstract = {The Extreme Microbiome Project (XMP) is a project launched by the Association of Biomolecular Resource Facilities Metagenomics Research Group (ABRF MGRG) that focuses on whole genome shotgun sequencing of extreme and unique environments using a wide variety of biomolecular techniques. The goals are multifaceted, including development and refinement of new techniques for the following: 1) the detection and characterization of novel microbes, 2) the evaluation of nucleic acid techniques for extremophilic samples, and 3) the identification and implementation of the appropriate bioinformatics pipelines. Here, we highlight the different ongoing projects that we have been working on, as well as details on the various methods we use to characterize the microbiome and metagenome of these complex samples. In particular, we present data of a novel multienzyme extraction protocol that we developed, called Polyzyme or MetaPolyZyme. Presently, the XMP is characterizing sample sites around the world with the intent of discovering new species, genes, and gene clusters. Once a project site is complete, the resulting data will be publically available. Sites include Lake Hillier in Western Australia, the {\textquotedblleft}Door to Hell{\textquotedblright} crater in Turkmenistan, deep ocean brine lakes of the Gulf of Mexico, deep ocean sediments from Greenland, permafrost tunnels in Alaska, ancient microbial biofilms from Antarctica, Blue Lagoon Iceland, Ethiopian toxic hot springs, and the acidic hypersaline ponds in Western Australia.}, issn = {1524-0215}, doi = {10.7171/jbt.17-2801-004}, url = {https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5345951/}, author = {Tighe, Scott and Afshinnekoo, Ebrahim and Rock, Tara M. and McGrath, Ken and Alexander, Noah and McIntyre, Alexa and Ahsanuddin, Sofia and Bezdan, Daniela and Green, Stefan J. and Joye, Samantha and Stewart Johnson, Sarah and Baldwin, Don A. and Bivens, Nathan and Ajami, Nadim and Carmical, Joseph R. and Herriott, Ian Charold and Rita R Colwell and Donia, Mohamed and Foox, Jonathan and Greenfield, Nick and Hunter, Tim and Hoffman, Jessica and Hyman, Joshua and Jorgensen, Ellen and Krawczyk, Diana and Lee, Jodie and Levy, Shawn and Garcia-Reyero, {\`a}lia and Settles, Matthew and Thomas, Kelley and {\'o}mez, Felipe and Schriml, Lynn and Kyrpides, Nikos and Zaikova, Elena and Penterman, Jon and Mason, Christopher E.} } @article {20317, title = {Vibrio cholerae O1 with Reduced Susceptibility to Ciprofloxacin and Azithromycin Isolated from a Rural Coastal Area of Bangladesh}, journal = {Frontiers in Microbiology}, year = {2017}, month = {Sep-02-2018}, abstract = {Cholera outbreaks occur each year in the remote coastal areas of Bangladesh and epidemiological surveillance and routine monitoring of cholera in these areas is challenging. In this study, a total of 97 Vibrio cholerae O1 isolates from Mathbaria, Bangladesh, collected during 2010 and 2014 were analyzed for phenotypic and genotypic traits, including antimicrobial susceptibility. Of the 97 isolates, 95 possessed CTX-phage mediated genes, ctxA, ace, and zot, and two lacked the cholera toxin gene, ctxA. Also both CTX+ and CTX- V. cholerae O1 isolated in this study carried rtxC, tcpAET, and hlyA. The classical cholera toxin gene, ctxB1, was detected in 87 isolates, while eight had ctxB7. Of 95 CTX+ V. cholerae O1, 90 contained rstRET and 5 had rstRCL. All isolates, except two, contained SXT related integrase intSXT. Resistance to penicillin, streptomycin, nalidixic acid, sulfamethoxazole-trimethoprim, erythromycin, and tetracycline varied between the years of study period. Most importantly, 93\% of the V. cholerae O1 were multidrug resistant. Six different resistance profiles were observed, with resistance to streptomycin, nalidixic acid, tetracycline, and sulfamethoxazole-trimethoprim predominant every year. Ciprofloxacin and azithromycin MIC were 0.003{\textendash}0.75 and 0.19{\textendash}2.00 μg/ml, respectively, indicating reduced susceptibility to these antibiotics. Sixteen of the V. cholerae O1 isolates showed higher MIC for azithromycin (>=0.5 μg/ml) and were further examined for 10 macrolide resistance genes, erm(A), erm(B), erm(C), ere(A), ere(B), mph(A), mph(B), mph(D), mef(A), and msr(A) with none testing positive for the macrolide resistance genes.}, doi = {10.3389/fmicb.2017.00252}, url = {http://journal.frontiersin.org/article/10.3389/fmicb.2017.00252}, author = {Rashed, Shah M. and Hasan, Nur A. and Alam, Munirul and Sadique, Abdus and Sultana, Marzia and Hoq, Md. Mozammel and Sack, R. Bradley and Rita R Colwell and Huq, Anwar} } @article {20312, title = {Membrane Bioreactor-Based Wastewater Treatment Plant in Saudi Arabia: Reduction of Viral Diversity, Load, and Infectious Capacity}, journal = {Water}, volume = {96046Volume 70}, year = {2017}, month = {Jan-07-2017}, pages = {534}, doi = {10.3390/w9070534}, url = {http://www.mdpi.com/2073-4441/9/7/534}, author = {Jumat, Muhammad and Hasan, Nur and Subramanian, Poorani and Heberling, Colin and Rita R Colwell and Hong, Pei-Ying} } @article {20309, title = {The microbiomes of blowflies and houseflies as bacterial transmission reservoirs}, journal = {Scientific Reports}, year = {2017}, month = {Jan-12-2017}, abstract = {Blowflies and houseflies are mechanical vectors inhabiting synanthropic environments around the world. They feed and breed in fecal and decaying organic matter, but the microbiome they harbour and transport is largely uncharacterized. We sampled 116 individual houseflies and blowflies from varying habitats on three continents and subjected them to high-coverage, whole-genome shotgun sequencing. This allowed for genomic and metagenomic analyses of the host-associated microbiome at the species level. Both fly host species segregate based on principal coordinate analysis of their microbial communities, but they also show an overlapping core microbiome. Legs and wings displayed the largest microbial diversity and were shown to be an important route for microbial dispersion. The environmental sequencing approach presented here detected a stochastic distribution of human pathogens, such as Helicobacter pylori, thereby demonstrating the potential of flies as proxies for environmental and public health surveillance.}, doi = {10.1038/s41598-017-16353-x}, url = {http://www.nature.com/articles/s41598-017-16353-x}, author = {Junqueira, AC and Ratan, Aakrosh and Acerbi, Enzo and Drautz-Moses, Daniela I. and Premkrishnan, BNV and Costea, PI and Linz, Bodo and Purbojati, Rikky W. and Paulo, Daniel F. and Gaultier, Nicolas E. and Subramanian, Poorani and Hasan, Nur A. and Rita R Colwell and Bork, Peer and Azeredo-Espin, Ana Maria L. and Bryant, Donald A. and Schuster, Stephan C.} } @article {20316, title = {SYN-004 (ribaxamase), an oral beta-lactamase, mitigates antibiotic-mediated dysbiosis in a porcine gut microbiome model}, journal = {Journal of Applied Microbiology}, year = {2017}, month = {Jan-07-2017}, pages = {66 - 79}, abstract = { Aim To evaluate an antibiotic inactivation strategy to protect the gut microbiome from antibiotic-mediated damage. Methods and Results SYN-004 (ribaxamase) is an orally delivered beta-lactamase intended to degrade penicillins and cephalosporins within the gastrointestinal tract to protect the microbiome. Pigs (20 kg, n = 10) were treated with ceftriaxone (CRO) (IV, 50 mg kg-1, SID) for 7 days and a cohort (n = 5) received ribaxamase (PO, 75 mg, QID) for 9 days beginning the day before antibiotic administration. Ceftriaxone serum levels were not statistically different in the antibiotic-alone and antibiotic + ribaxamase groups, indicating ribaxamase did not alter systemic antibiotic levels. Whole-genome metagenomic analyses of pig faecal DNA revealed that CRO caused significant changes to the gut microbiome and an increased frequency of antibiotic resistance genes. With ribaxamase, the gut microbiomes were not significantly different from pretreatment and antibiotic resistance gene frequency was not increased. Conclusion Ribaxamase mitigated CRO-mediated gut microbiome dysbiosis and attenuated propagation of the antibiotic resistance genes in pigs. Significance and Impact of the Study Damage of the microbiome can lead to overgrowth of pathogenic organisms and antibiotic exposure can promote selection for antibiotic-resistant micro-organisms. Ribaxamase has the potential to become the first therapy designed to protect the gut microbiome from antibiotic-mediated dysbiosis and reduce emergence of antibiotic resistance. }, doi = {10.1111/jam.13432}, url = {https://onlinelibrary.wiley.com/doi/10.1111/jam.13432}, author = {Connelly, S. and Bristol, J.A. and Hubert, S. and Subramanian, P. and Hasan, N.A. and Rita R Colwell and Kaleko, M.} } @conference {20065, title = {3D Cellular Morphotyping of Scaffold Niches}, booktitle = {2016 32nd Southern Biomedical Engineering Conference (SBEC)}, year = {2016}, publisher = {IEEE}, organization = {IEEE}, author = {Florczyk, Stephen J and Simon, Mylene and Juba, Derek and Pine, P Scott and Sarkar, Sumona and Chen, Desu and Baker, Paula J and Bodhak, Subhadip and Cardone, Antonio and Brady, Mary and others} } @article {20324, title = {Chitin promotes Mycobacterium ulcerans growth}, journal = {FEMS Microbiology Ecology}, volume = {928565871}, year = {2016}, month = {Jun-06-2017}, pages = {fiw067}, abstract = {Mycobacterium ulcerans (MU) is the causative agent of Buruli ulcer, an emerging human infectious disease. However, both the ecology and life cycle of MU are poorly understood. The occurrence of MU has been linked to the aquatic environment, notably water bodies affected by human activities. It has been hypothesized that one or a combination of environmental factor(s) connected to human activities could favour growth of MU in aquatic systems. Here, we tested in vitro the growth effect of two ubiquitous polysaccharides and five chemical components on MU at concentration ranges shown to occur in endemic regions. Real-time PCR showed that chitin increased MU growth significantly providing a nutrient source or environmental support for the bacillus, thereby, providing a focus on the association between MU and aquatic arthropods. Aquatic environments with elevated population of arthropods provide increased chitin availability and, thereby, enhanced multiplication of MU. If calcium very slightly enhanced MU growth, iron, zinc, sulphate and phosphate did not stimulate MU growth, and at the concentration ranges of this study would limit MU population in natural ecosystems.}, doi = {10.1093/femsec/fiw067}, url = {https://academic.oup.com/femsec/article-lookup/doi/10.1093/femsec/fiw067}, author = {Sanhueza, Daniel and Chevillon, Christine and Rita R Colwell and Babonneau, J{\'e}r{\'e}mie and Marion, Estelle and Marsollier, Laurent and {\'e}gan, {\c c}ois}, editor = {Sobecky, Patricia} } @article {20332, title = {Comparison of inferred relatedness based on multilocus variable-number tandem-repeat analysis and whole genome sequencing of Vibrio cholerae O1}, journal = {FEMS Microbiology Letters}, volume = {36389}, year = {2016}, month = {Nov-06-2017}, pages = {fnw116}, abstract = {Vibrio cholerae causes cholera, a severe diarrheal disease. Understanding the local genetic diversity and transmission of V. cholerae will improve our ability to control cholera. Vibrio cholerae isolates clustered in genetically related groups (clonal complexes, CC) by multilocus variable tandem-repeat analysis (MLVA) were compared by whole genome sequencing (WGS). Isolates in CC1 had been isolated from two geographical locations. Isolates in a second genetically distinct group, CC2, were isolated only at one location. Using WGS, CC1 isolates from both locations revealed, on average, 43.8 nucleotide differences, while those strains comprising CC2 averaged 19.7 differences. Strains from both MLVA-CCs had an average difference of 106.6. Thus, isolates comprising CC1 were more closely related (P < 10-6) to each other than to isolates in CC2. Within a MLVA-CC, after removing all paralogs, alternative alleles were found in all possible combinations on separate chromosomes indicative of recombination within the core genome. Including recombination did not affect the distinctiveness of the MLVA-CCs when measured by WGS. We found that WGS generally reflected the same genetic relatedness of isolates as MLVA, indicating that isolates from the same MLVA-CC shared a more recent common ancestor than isolates from the same location that clustered in a distinct MLVA-CC.}, doi = {10.1093/femsle/fnw116}, url = {https://academic.oup.com/femsle/article-lookup/doi/10.1093/femsle/fnw116}, author = {Rashid, Mahamud-ur and Almeida, Mathieu and Azman, Andrew S. and Lindsay, Brianna R. and Sack, David A. and Rita R Colwell and Huq, Anwar and Morris, J. Glenn and Alam, Munirul and Stine, O. Colin}, editor = {Winstanley, Craig} } @article {20060, title = {Computational study of the inhibitory mechanism of~the kinase CDK5 hyperactivity by peptide p5 and derivation of a pharmacophore}, journal = {Journal of Computer-Aided Molecular Design}, volume = {30}, year = {2016}, month = {Jan-06-2016}, pages = {513 - 521}, issn = {0920-654X}, doi = {10.1007/s10822-016-9922-3}, url = {http://link.springer.com/10.1007/s10822-016-9922-3http://link.springer.com/content/pdf/10.1007/s10822-016-9922-3http://link.springer.com/content/pdf/10.1007/s10822-016-9922-3.pdfhttp://link.springer.com/article/10.1007/s10822-016-9922-3/fulltext.html}, author = {Cardone, Antonio and Brady, M. and Sriram, R. and Pant, H. C. and Hassan, S. A.} } @article {20336, title = {Cross-talk among flesh-eating Aeromonas hydrophila strains in mixed infection leading to necrotizing fasciitis}, journal = {Proceedings of the National Academy of Sciences}, volume = {11312161268}, year = {2016}, month = {Jul-01-2017}, pages = {722 - 727}, abstract = {Necrotizing fasciitis (NF) caused by flesh-eating bacteria is associated with high case fatality. In an earlier study, we reported infection of an immunocompetent individual with multiple strains of Aeromonas hydrophila (NF1{\textendash}NF4), the latter three constituted a clonal group whereas NF1 was phylogenetically distinct. To understand the complex interactions of these strains in NF pathophysiology, a mouse model was used, whereby either single or mixed A. hydrophila strains were injected intramuscularly. NF2, which harbors exotoxin A (exoA) gene, was highly virulent when injected alone, but its virulence was attenuated in the presence of NF1 (exoA-minus). NF1 alone, although not lethal to animals, became highly virulent when combined with NF2, its virulence augmented by cis-exoA expression when injected alone in mice. Based on metagenomics and microbiological analyses, it was found that, in mixed infection, NF1 selectively disseminated to mouse peripheral organs, whereas the other strains (NF2, NF3, and NF4) were confined to the injection site and eventually cleared. In vitro studies showed NF2 to be more effectively phagocytized and killed by macrophages than NF1. NF1 inhibited growth of NF2 on solid media, but ExoA of NF2 augmented virulence of NF1 and the presence of NF1 facilitated clearance of NF2 from animals either by enhanced priming of host immune system or direct killing via a contact-dependent mechanism.}, issn = {0027-8424}, doi = {10.1073/pnas.1523817113}, url = {http://www.pnas.org/lookup/doi/10.1073/pnas.1523817113}, author = {Ponnusamy, Duraisamy and Kozlova, Elena V. and Sha, Jian and Erova, Tatiana E. and Azar, Sasha R. and Fitts, Eric C. and Kirtley, Michelle L. and Tiner, Bethany L. and Andersson, Jourdan A. and Grim, Christopher J. and Isom, Richard P. and Hasan, Nur A. and Rita R Colwell and Chopra, Ashok K.} } @article {20325, title = {Enrichment dynamics of Listeria monocytogenes and the associated microbiome from naturally contaminated ice cream linked to a listeriosis outbreak}, journal = {BMC Microbiology}, year = {2016}, month = {Jan-12-2016}, doi = {10.1186/s12866-016-0894-1}, url = {http://bmcmicrobiol.biomedcentral.com/articles/10.1186/s12866-016-0894-1}, author = {Ottesen, Andrea and Ramachandran, Padmini and Reed, Elizabeth and White, James R. and Hasan, Nur and Subramanian, Poorani and Ryan, Gina and Jarvis, Karen and Grim, Christopher and Daquiqan, Ninalynn and Hanes, Darcy and Allard, Marc and Rita R Colwell and Brown, Eric and Chen, Yi} } @article {20321, title = {Modeling Sustainability: Population, Inequality, Consumption, and Bidirectional Coupling of the Earth and Human Systems}, journal = {National Science Review}, year = {2016}, month = {Nov-12-2016}, pages = {nww081}, abstract = {Over the last two centuries, the impact of the Human System has grown dramatically, becoming strongly dominant within the Earth System in many different ways. Consumption, inequality, and population have increased extremely fast, especially since about 1950, threatening to overwhelm the many critical functions and ecosystems of the Earth System. Changes in the Earth System, in turn, have important feedback effects on the Human System, with costly and potentially serious consequences. However, current models do not incorporate these critical feedbacks. We argue that in order to understand the dynamics of either system, Earth System Models must be coupled with Human System Models through bidirectional couplings representing the positive, negative, and delayed feedbacks that exist in the real systems. In particular, key Human System variables, such as demographics, inequality, economic growth, and migration, are not coupled with the Earth System but are instead driven by exogenous estimates, such as United Nations population projections. This makes current models likely to miss important feedbacks in the real Earth{\textendash}Human system, especially those that may result in unexpected or counterintuitive outcomes, and thus requiring different policy interventions from current models. The importance and imminence of sustainability challenges, the dominant role of the Human System in the Earth System, and the essential roles the Earth System plays for the Human System, all call for collaboration of natural scientists, social scientists, and engineers in multidisciplinary research and modeling to develop coupled Earth{\textendash}Human system models for devising effective science-based policies and measures to benefit current and future generations.}, issn = {2095-5138}, doi = {10.1093/nsr/nww081}, url = {https://academic.oup.com/nsr/article-lookup/doi/10.1093/nsr/nww081}, author = {Motesharrei, Safa and Rivas, Jorge and Kalnay, Eugenia and Asrar, Ghassem R. and Busalacchi, Antonio J. and Cahalan, Robert F. and Cane, Mark A. and Rita R Colwell and Feng, Kuishuang and Franklin, Rachel S. and Hubacek, Klaus and Miralles-Wilhelm, Fernando and Miyoshi, Takemasa and Ruth, Matthias and Sagdeev, Roald and Shirmohammadi, Adel and Shukla, Jagadish and Srebric, Jelena and Yakovenko, Victor M. and Zeng, Ning} } @article {20335, title = {Phylogenetic Diversity of Vibrio cholerae Associated with Endemic Cholera in Mexico from 1991 to 2008}, journal = {mBio}, volume = {7}, year = {2016}, month = {Apr-05-2016}, abstract = {An outbreak of cholera occurred in 1991 in Mexico, where it had not been reported for more than a century and is now endemic. Vibrio cholerae O1 prototype El Tor and classical strains coexist with altered El Tor strains (1991 to 1997). Nontoxigenic (CTX-) V. cholerae El Tor dominated toxigenic (CTX+) strains (2001 to 2003), but V. cholerae CTX+ variant El Tor was isolated during 2004 to 2008, outcompeting CTX- V. cholerae. Genomes of six Mexican V. cholerae O1 strains isolated during 1991 to 2008 were sequenced and compared with both contemporary and archived strains of V. cholerae. Three were CTX+ El Tor, two were CTX- El Tor, and the remaining strain was a CTX+ classical isolate. Whole-genome sequence analysis showed the six isolates belonged to five distinct phylogenetic clades. One CTX- isolate is ancestral to the 6th and 7th pandemic CTX+ V. cholerae isolates. The other CTX- isolate joined with CTX- non-O1/O139 isolates from Haiti and seroconverted O1 isolates from Brazil and Amazonia. One CTX+ isolate was phylogenetically placed with the sixth pandemic classical clade and the V. cholerae O395 classical reference strain. Two CTX+ El Tor isolates possessing intact Vibrio seventh pandemic island II (VSP-II) are related to hybrid El Tor isolates from Mozambique and Bangladesh. The third CTX+ El Tor isolate contained West African-South American (WASA) recombination in VSP-II and showed relatedness to isolates from Peru and Brazil. Except for one isolate, all Mexican isolates lack SXT/R391 integrative conjugative elements (ICEs) and sensitivity to selected antibiotics, with one isolate resistant to streptomycin. No isolates were related to contemporary isolates from Asia, Africa, or Haiti, indicating phylogenetic diversity.}, doi = {10.1128/mBio.02160-15}, url = {http://mbio.asm.org/lookup/doi/10.1128/mBio.02160-15}, author = {Choi, Seon Y and Rashed, Shah M. and Hasan, Nur A. and Alam, Munirul and Islam, Tarequl and Sadique, Abdus and Johura, Fatema-Tuz and Eppinger, Mark and Ravel, Jacques and Huq, Anwar and Cravioto, Alejandro and Rita R Colwell} } @article {20333, title = {Strategic Planning in Population Health and Public Health Practice: A Call to Action for Higher Education}, journal = {The Milbank Quarterly}, volume = {94906033}, year = {2016}, month = {Jan-03-2016}, pages = {109 - 125}, abstract = {POLICY POINTS: Scarce resources, especially in population health and public health practice, underlie the importance of strategic planning. Public health agencies{\textquoteright} current planning and priority setting efforts are often narrow, at times opaque, and focused on single metrics such as cost-effectiveness. As demonstrated by SMART Vaccines, a decision support software system developed by the Institute of Medicine and the National Academy of Engineering, new approaches to strategic planning allow the formal incorporation of multiple stakeholder views and multicriteria decision making that surpass even those sophisticated cost-effectiveness analyses widely recommended and used for public health planning. Institutions of higher education can and should respond by building on modern strategic planning tools as they teach their students how to improve population health and public health practice. CONTEXT: Strategic planning in population health and public health practice often uses single indicators of success or, when using multiple indicators, provides no mechanism for coherently combining the assessments. Cost-effectiveness analysis, the most complex strategic planning tool commonly applied in public health, uses only a single metric to evaluate programmatic choices, even though other factors often influence actual decisions. METHODS: Our work employed a multicriteria systems analysis approach--specifically, multiattribute utility theory--to assist in strategic planning and priority setting in a particular area of health care (vaccines), thereby moving beyond the traditional cost-effectiveness analysis approach. FINDINGS: (1) Multicriteria systems analysis provides more flexibility, transparency, and clarity in decision support for public health issues compared with cost-effectiveness analysis. (2) More sophisticated systems-level analyses will become increasingly important to public health as disease burdens increase and the resources to deal with them become scarcer. CONCLUSIONS: The teaching of strategic planning in public health must be expanded in order to fill a void in the profession{\textquoteright}s planning capabilities. Public health training should actively incorporate model building, promote the interactive use of software tools, and explore planning approaches that transcend restrictive assumptions of cost-effectiveness analysis. The Strategic Multi-Attribute Ranking Tool for Vaccines (SMART Vaccines), which was recently developed by the Institute of Medicine and the National Academy of Engineering to help prioritize new vaccine development, is a working example of systems analysis as a basis for decision support.}, doi = {10.1111/1468-0009.12182}, url = {https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4941964/}, author = {Phelps, Charles and Madhavan, Guruprasad and Rappuoli, Rino and LEVIN, SCOTT and Shortlife, Edward and Rita R Colwell} } @article {20341, title = {Building Infectious Disease Research Programs to Promote Security and Enhance Collaborations with Countries of the Former Soviet Union}, journal = {Frontiers in Public Health}, volume = {35361632}, year = {2015}, month = {Feb-11-2017}, doi = {10.3389/fpubh.2015.00271}, url = {http://journal.frontiersin.org/Article/10.3389/fpubh.2015.00271/abstract}, author = {Bartholomew, James C. and Pearson, Andrew D. and Stenseth, Nils C. and LeDuc, James W. and Hirschberg, David L. 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 {20347, title = {Hybrid Vibrio~cholerae El Tor Lacking SXT Identified as the Cause of a Cholera Outbreak in the Philippines}, journal = {mBio}, year = {2015}, month = {Jan-05-2015}, abstract = {Cholera continues to be a global threat, with high rates of morbidity and mortality. In 2011, a cholera outbreak occurred in Palawan, Philippines, affecting more than 500 people, and 20 individuals died. Vibrio cholerae O1 was confirmed as the etiological agent. Source attribution is critical in cholera outbreaks for proper management of the disease, as well as to control spread. In this study, three V. cholerae O1 isolates from a Philippines cholera outbreak were sequenced and their genomes analyzed to determine phylogenetic relatedness to V. cholerae O1 isolates from recent outbreaks of cholera elsewhere. The Philippines V. cholerae O1 isolates were determined to be V. cholerae O1 hybrid El Tor belonging to the seventh-pandemic clade. They clustered tightly, forming a monophyletic clade closely related to V. cholerae O1 hybrid El Tor from Asia and Africa. The isolates possess a unique multilocus variable-number tandem repeat analysis (MLVA) genotype (12-7-9-18-25 and 12-7-10-14-21) and lack SXT. In addition, they possess a novel 15-kb genomic island (GI-119) containing a predicted type I restriction-modification system. The CTXΦ-RS1 array of the Philippines isolates was similar to that of V. cholerae O1 MG116926, a hybrid El Tor strain isolated in Bangladesh in 1991. Overall, the data indicate that the Philippines V. cholerae O1 isolates are unique, differing from recent V. cholerae O1 isolates from Asia, Africa, and Haiti. Furthermore, the results of this study support the hypothesis that the Philippines isolates of V. cholerae O1 are indigenous and exist locally in the aquatic ecosystem of the Philippines.}, doi = {10.1128/mBio.00047-15}, url = {http://mbio.asm.org/lookup/doi/10.1128/mBio.00047-15}, author = {Klinzing, David C. and Choi, Seon Young and Hasan, Nur A. and Matias, Ronald R. and Tayag, Enrique and Geronimo, Josefina and Skowronski, Evan and Rashed, Shah M. and Kawashima, Kent and Rosenzweig, C. Nicole and Gibbons, Henry S. and Torres, Brian C. and Liles, Veni and Alfon, Alicia C. and Juan, Maria Luisa and Natividad, Filipinas F. and Cebula, Thomas A. and Rita R Colwell} } @article {20342, title = {Satellite Based Assessment of Hydroclimatic Conditions Related to Cholera in Zimbabwe}, journal = {PLOS ONE}, year = {2015}, month = {May-09-2017}, pages = {e0137828}, abstract = {Introduction Cholera, an infectious diarrheal disease, has been shown to be associated with large scale hydroclimatic processes. The sudden and sporadic occurrence of epidemic cholera is linked with high mortality rates, in part, due to uncertainty in timing and location of outbreaks. Improved understanding of the relationship between pathogenic abundance and climatic processes allows prediction of disease outbreak to be an achievable goal. In this study, we show association of large scale hydroclimatic processes with the cholera epidemic in Zimbabwe reported to have begun in Chitungwiza, a city in Mashonaland East province, in August, 2008. Principal Findings Climatic factors in the region were found to be associated with triggering cholera outbreak and are shown to be related to anomalies of temperature and precipitation, validating the hypothesis that poor conditions of sanitation, coupled with elevated temperatures, and followed by heavy rainfall can initiate outbreaks of cholera. Spatial estimation by satellite of precipitation and global gridded air temperature captured sensitivities in hydroclimatic conditions that permitted identification of the location in the region where the disease outbreak began. Discussion Satellite derived hydroclimatic processes can be used to capture environmental conditions related to epidemic cholera, as occurred in Zimbabwe, thereby providing an early warning system. Since cholera cannot be eradicated because the causative agent, Vibrio cholerae, is autochthonous to the aquatic environment, prediction of conditions favorable for its growth and estimation of risks of triggering the disease in a given population can be used to alert responders, potentially decreasing infection and saving lives. }, doi = {10.1371/journal.pone.0137828}, url = {https://dx.plos.org/10.1371/journal.pone.0137828}, author = {Jutla, Antarpreet and Aldaach, Haidar and Billian, Hannah and Akanda, Ali and Huq, Anwar and Rita R Colwell}, editor = {Schumann, Guy J-P.} } @article {20062, title = {Survey statistics of automated segmentations applied to optical imaging of mammalian cells}, journal = {BMC bioinformatics}, volume = {16}, year = {2015}, pages = {1}, author = {Bajcsy, Peter and Cardone, Antonio and Chalfoun, Joe and Halter, Michael and Juba, Derek and Kociolek, Marcin and Majurski, Michael and Peskin, Adele and Simon, Carl and Simon, Mylene and others} } @article {20361, title = {Microbial Community Profiling of Human Saliva Using Shotgun Metagenomic Sequencing}, journal = {PLoS ONE}, year = {2014}, month = {Aug-05-2015}, pages = {e97699}, abstract = {Human saliva is clinically informative of both oral and general health. Since next generation shotgun sequencing (NGS) is now widely used to identify and quantify bacteria, we investigated the bacterial flora of saliva microbiomes of two healthy volunteers and five datasets from the Human Microbiome Project, along with a control dataset containing short NGS reads from bacterial species representative of the bacterial flora of human saliva. GENIUS, a system designed to identify and quantify bacterial species using unassembled short NGS reads was used to identify the bacterial species comprising the microbiomes of the saliva samples and datasets. Results, achieved within minutes and at greater than 90\% accuracy, showed more than 175 bacterial species comprised the bacterial flora of human saliva, including bacteria known to be commensal human flora but also Haemophilus influenzae, Neisseria meningitidis, Streptococcus pneumoniae, and Gamma proteobacteria. Basic Local Alignment Search Tool (BLASTn) analysis in parallel, reported ca. five times more species than those actually comprising the in silico sample. Both GENIUS and BLAST analyses of saliva samples identified major genera comprising the bacterial flora of saliva, but GENIUS provided a more precise description of species composition, identifying to strain in most cases and delivered results at least 10,000 times faster. Therefore, GENIUS offers a facile and accurate system for identification and quantification of bacterial species and/or strains in metagenomic samples.}, doi = {10.1371/journal.pone.0097699}, url = {https://dx.plos.org/10.1371/journal.pone.0097699}, author = {Hasan, Nur A. and Young, Brian A. and Minard-Smith, Angela T. and Saeed, Kelly and Li, Huai and Heizer, Esley M. and McMillan, Nancy J. and Isom, Richard and Abdullah, Abdul Shakur and Bornman, Daniel M. and Faith, Seth A. and Choi, Seon Young and Dickens, Michael L. and Cebula, Thomas A. and Rita R Colwell}, editor = {Ahmed, Niyaz} } @article {20334, title = {Occurrence in Mexico, 1998{\textendash}2008, of Vibrio cholerae CTX + El Tor carrying an additional truncated CTX prophage}, journal = {Proceedings of the National Academy of Sciences}, volume = {111}, year = {2014}, month = {Aug-07-2014}, pages = {9917 - 9922}, issn = {0027-8424}, doi = {10.1073/pnas.1323408111}, url = {http://www.pnas.org/lookup/doi/10.1073/pnas.1323408111}, author = {Alam, Munirul and Rashed, Shah M and Mannan, Shahnewaj Bin and Islam, Tarequl and Lizarraga-Partida, Marcial L. and Delgado, Gabriela and Morales-Espinosa, Rosario and Mendez, Jose Luis and Navarro, Armando and Watanabe, Haruo and Ohnishi, Makoto and Hasan, Nur A. and Huq, Anwar and Sack, R. Bradley and Rita R Colwell and Cravioto, Alejandro} } @article {20357, title = {Phylodynamic Analysis of Clinical and Environmental Vibrio cholerae Isolates from Haiti Reveals Diversification Driven by Positive Selection}, journal = {mBio}, year = {2014}, month = {Jul-12-2016}, abstract = {Phylodynamic analysis of genome-wide single-nucleotide polymorphism (SNP) data is a powerful tool to investigate underlying evolutionary processes of bacterial epidemics. The method was applied to investigate a collection of 65 clinical and environmental isolates of Vibrio cholerae from Haiti collected between 2010 and 2012. Characterization of isolates recovered from environmental samples identified a total of four toxigenic V. cholerae O1 isolates, four non-O1/O139 isolates, and a novel nontoxigenic V. cholerae O1 isolate with the classical tcpA gene. Phylogenies of strains were inferred from genome-wide SNPs using coalescent-based demographic models within a Bayesian framework. A close phylogenetic relationship between clinical and environmental toxigenic V. cholerae O1 strains was observed. As cholera spread throughout Haiti between October 2010 and August 2012, the population size initially increased and then fluctuated over time. Selection analysis along internal branches of the phylogeny showed a steady accumulation of synonymous substitutions and a progressive increase of nonsynonymous substitutions over time, suggesting diversification likely was driven by positive selection. Short-term accumulation of nonsynonymous substitutions driven by selection may have significant implications for virulence, transmission dynamics, and even vaccine efficacy.}, doi = {10.1128/mBio.01824-14}, url = {http://mbio.asm.org/lookup/doi/10.1128/mBio.01824-14}, author = {Azarian, Taj and Ali, Afsar and Johnson, Judith A. and Mohr, David and Prosperi, Mattia and Veras, Nazle M. and Jubair, Mohammed and Strickland, Samantha L. and Rashid, Mohammad H. and Alam, Meer T. and Weppelmann, Thomas A. and Katz, Lee S. and Tarr, Cheryl L. and Rita R Colwell and Morris, J. Glenn and Salemi, Marco} } @article {20360, title = {Validation of high throughput sequencing and microbial forensics applications}, journal = {Investigative Genetics}, volume = {5}, year = {2014}, month = {Jan-01-2014}, pages = {9}, abstract = {High throughput sequencing (HTS) generates large amounts of high quality sequence data for microbial genomics. The value of HTS for microbial forensics is the speed at which evidence can be collected and the power to characterize microbial-related evidence to solve biocrimes and bioterrorist events. As HTS technologies continue to improve, they provide increasingly powerful sets of tools to support the entire field of microbial forensics. Accurate, credible results allow analysis and interpretation, significantly influencing the course and/or focus of an investigation, and can impact the response of the government to an attack having individual, political, economic or military consequences. Interpretation of the results of microbial forensic analyses relies on understanding the performance and limitations of HTS methods, including analytical processes, assays and data interpretation. The utility of HTS must be defined carefully within established operating conditions and tolerances. Validation is essential in the development and implementation of microbial forensics methods used for formulating investigative leads attribution. HTS strategies vary, requiring guiding principles for HTS system validation. Three initial aspects of HTS, irrespective of chemistry, instrumentation or software are: 1) sample preparation, 2) sequencing, and 3) data analysis. Criteria that should be considered for HTS validation for microbial forensics are presented here. Validation should be defined in terms of specific application and the criteria described here comprise a foundation for investigators to establish, validate and implement HTS as a tool in microbial forensics, enhancing public safety and national security.}, issn = {2041-2223}, doi = {10.1186/2041-2223-5-9}, url = {http://investigativegenetics.biomedcentral.com/articles/10.1186/2041-2223-5-9}, author = {Budowle, Bruce and Connell, Nancy D and Bielecka-Oder, Anna and Rita R Colwell and Corbett, Cindi R and Fletcher, Jacqueline and Forsman, Mats and Kadavy, Dana R and Markotic, Alemka and Morse, Stephen A and Murch, Randall S and Sajantila, Antti and Schmedes, Sarah E and Ternus, Krista L and Turner, Stephen D and Minot, Samuel} } @article {20366, title = {Viewing Marine Bacteria, Their Activity and Response to Environmental Drivers from Orbit}, journal = {Microbial Ecology}, year = {2014}, month = {Jan-04-2014}, pages = {489 - 500}, abstract = {Satellite-based remote sensing of marine microorganisms has become a useful tool in predicting human health risks associated with these microscopic targets. Early applications were focused on harmful algal blooms, but more recently methods have been developed to interrogate the ocean for bacteria. As satellite-based sensors have become more sophisticated and our ability to interpret information derived from these sensors has advanced, we have progressed from merely making fascinating pictures from space to developing process models with predictive capability. Our understanding of the role of marine microorganisms in primary production and global elemental cycles has been vastly improved as has our ability to use the combination of remote sensing data and models to provide early warning systems for disease outbreaks. This manuscript will discuss current approaches to monitoring cyanobacteria and vibrios, their activity and response to environmental drivers, and will also suggest future directions.}, issn = {0095-3628}, doi = {10.1007/s00248-013-0363-4}, url = {http://link.springer.com/10.1007/s00248-013-0363-4}, author = {Grimes, D. Jay and Ford, Tim E. and Rita R Colwell and Baker-Austin, Craig and Martinez-Urtaza, Jaime and Subramaniam, Ajit and Capone, Douglas G.} } @inbook {19629, title = {Adaptive and Concurrent Secure Computation from New Adaptive, Non-malleable Commitments}, booktitle = {Advances in Cryptology - ASIACRYPT 2013}, series = {Lecture Notes in Computer Science}, year = {2013}, month = {2013/01/01/}, pages = {316 - 336}, publisher = {Springer Berlin Heidelberg}, organization = {Springer Berlin Heidelberg}, abstract = {We present a unified approach for obtaining general secure computation that achieves adaptive-Universally Composable (UC)-security. Using our approach we essentially obtain all previous results on adaptive concurrent secure computation, both in relaxed models (e.g., quasi-polynomial time simulation), as well as trusted setup models (e.g., the CRS model, the imperfect CRS model). This provides conceptual simplicity and insight into what is required for adaptive and concurrent security, as well as yielding improvements to set-up assumptions and/or computational assumptions in known models. Additionally, we provide the first constructions of concurrent secure computation protocols that are adaptively secure in the timing model, and the non-uniform simulation model. As a corollary we also obtain the first adaptively secure multiparty computation protocol in the plain model that is secure under bounded-concurrency. Conceptually, our approach can be viewed as an adaptive analogue to the recent work of Lin, Pass and Venkitasubramaniam [STOC {\textquoteleft}09], who considered only non-adaptive adversaries. Their main insight was that the non-malleability requirement could be decoupled from the simulation requirement to achieve UC-security. A main conceptual contribution of this work is, quite surprisingly, that it is still the case even when considering adaptive security. A key element in our construction is a commitment scheme that satisfies a strong definition of non-malleability. Our new primitive of concurrent equivocal non-malleable commitments, intuitively, guarantees that even when a man-in-the-middle adversary observes concurrent equivocal commitments and decommitments, the binding property of the commitments continues to hold for commitments made by the adversary. This definition is stronger than previous ones, and may be of independent interest. Previous constructions that satisfy our definition have been constructed in setup models, but either require existence of stronger encryption schemes such as CCA-secure encryption or require independent {\textquotedblleft}trapdoors{\textquotedblright} provided by the setup for every pair of parties to ensure non-malleability. A main technical contribution of this work is to provide a construction that eliminates these requirements and requires only a single trapdoor.}, keywords = {Algorithm Analysis and Problem Complexity, Applications of Mathematics, Data Encryption, Discrete Mathematics in Computer Science, Management of Computing and Information Systems, Systems and Data Security}, isbn = {978-3-642-42032-0, 978-3-642-42033-7}, url = {http://link.springer.com/chapter/10.1007/978-3-642-42033-7_17}, author = {Dana Dachman-Soled and Malkin, Tal and Raykova, Mariana and Venkitasubramaniam, Muthuramakrishnan}, editor = {Sako, Kazue and Sarkar, Palash} } @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} } @article {20363, title = {Engaging Actively with Issues in the Responsible Conduct of Science: Lessons from International Efforts Are Relevant for Undergraduate Education in the United States}, journal = {CBE{\textemdash}Life Sciences Education}, year = {2013}, month = {Jan-12-2013}, pages = {596 - 603}, abstract = {Numerous studies are demonstrating that engaging undergraduate students in original research can improve their achievement in the science, technology, engineering, and mathematics (STEM) fields and increase the likelihood that some of them will decide to pursue careers in these disciplines. Associated with this increased prominence of research in the undergraduate curriculum are greater expectations from funders, colleges, and universities that faculty mentors will help those students, along with their graduate students and postdoctoral fellows, develop an understanding and sense of personal and collective obligation for responsible conduct of science (RCS). This Feature describes an ongoing National Research Council (NRC) project and a recent report about educating faculty members in culturally diverse settings (Middle East/North Africa and Asia) to employ active-learning strategies to engage their students and colleagues deeply in issues related to RCS. The NRC report describes the first phase of this project, which took place in Aqaba and Amman, Jordan, in September 2012 and April 2013, respectively. Here we highlight the findings from that report and our subsequent experience with a similar interactive institute in Kuala Lumpur, Malaysia. Our work provides insights and perspectives for faculty members in the United States as they engage undergraduate and graduate students, as well as postdoctoral fellows, to help them better understand the intricacies of and connections among various components of RCS. Further, our experiences can provide insights for those who may wish to establish {\textquotedblleft}train-the-trainer{\textquotedblright} programs at their home institutions.}, doi = {10.1187/cbe.13-09-0184}, url = {https://www.lifescied.org/doi/10.1187/cbe.13-09-0184}, author = {Clements, John D. and Connell, Nancy D. and Dirks, Clarissa and El-Faham, Mohamed and Hay, Alastair and Heitman, Elizabeth and Stith, James H. and Bond, Enriqueta C. and Rita R Colwell and Anestidou, Lida and Husbands, Jo L. and Labov, Jay B.} } @article {20372, title = {Environmental Factors Influencing Epidemic Cholera}, journal = {The American Journal of Tropical Medicine and Hygiene}, volume = {89}, year = {2013}, month = {Apr-09-2013}, pages = {597 - 607}, abstract = {Cholera outbreak following the earthquake of 2010 in Haiti has reaffirmed that the disease is a major public health threat. Vibrio cholerae is autochthonous to aquatic environment, hence, it cannot be eradicated but hydroclimatology-based prediction and prevention is an achievable goal. Using data from the 1800s, we describe uniqueness in seasonality and mechanism of occurrence of cholera in the epidemic regions of Asia and Latin America. Epidemic regions are located near regional rivers and are characterized by sporadic outbreaks, which are likely to be initiated during episodes of prevailing warm air temperature with low river flows, creating favorable environmental conditions for growth of cholera bacteria. Heavy rainfall, through inundation or breakdown of sanitary infrastructure, accelerates interaction between contaminated water and human activities, resulting in an epidemic. This causal mechanism is markedly different from endemic cholera where tidal intrusion of seawater carrying bacteria from estuary to inland regions, results in outbreaks.}, issn = {0002-9637}, doi = {10.4269/ajtmh.12-0721}, url = {http://www.ajtmh.org/content/journals/10.4269/ajtmh.12-0721}, author = {Huq, Anwar and Hasan, Nur and Akanda, Ali and Whitcombe, Elizabeth and Rita R Colwell and Haley, Bradd and Alam, Munir and Jutla, Antarpreet and Sack, R. Bradley} } @article {19705, title = {Exploring Early Solutions for Automatically Identifying Inaccessible Sidewalks in the Physical World Using Google Street View}, journal = {HCIC 2013}, year = {2013}, month = {2013/00/01}, abstract = {Abstract Poorly maintained sidewalks , missing curb ramps, and other obstacles pose considerable accessibility challenges. Although pedestrian-and bicycle-oriented maps and associated routing algorithms continue to improve, there has been a lack of work focusing ...}, url = {http://www.cs.umd.edu/~jonf/publications/Hara_ExploringEarlySolutionsForAutomaticallyIdentifyingInaccessibleSidewalksInThePhysicalWorldUsingGoogleStreetView_HCIC2013.pdf}, author = {Hara, K and Le, V and Sun, J and Jacobs, D and Jon Froehlich} } @article {20380, title = {Fostering advances in interdisciplinary climate science}, journal = {Proceedings of the National Academy of Sciences}, year = {2013}, month = {Feb-02-2015}, pages = {3653 - 3656}, issn = {0027-8424}, doi = {10.1073/pnas.1301104110}, url = {http://www.pnas.org/cgi/doi/10.1073/pnas.1301104110}, author = {Shaman, J. and Solomon, S. and Rita R Colwell and Field, C. B.} } @article {20364, title = {Identification of bacteria in enrichment cultures of sulfate reducers in the Cariaco Basin water column employing Denaturing Gradient Gel Electrophoresis of 16S ribosomal RNA gene fragments}, journal = {Aquatic Biosystems}, volume = {9}, year = {2013}, month = {Jan-01-2013}, pages = {17}, abstract = {Background The Cariaco Basin is characterized by pronounced and predictable vertical layering of microbial communities dominated by reduced sulfur species at and below the redox transition zone. Marine water samples were collected in May, 2005 and 2006, at the sampling stations A (10{\textdegree}30' N, 64{\textdegree}40' W), B (10{\textdegree}40' N, 64{\textdegree}45' W) and D (10{\textdegree}43{\textquoteright}N, 64{\textdegree}32{\textquoteright}W) from different depths, including surface, redox interface, and anoxic zones. In order to enrich for sulfate reducing bacteria (SRB), water samples were inoculated into anaerobic media amended with lactate or acetate as carbon source. To analyze the composition of enrichment cultures, we performed DNA extraction, PCR-DGGE, and sequencing of selected bands. Results DGGE results indicate that many bacterial genera were present that are associated with the sulfur cycle, including Desulfovibrio spp., as well as heterotrophs belonging to Vibrio, Enterobacter, Shewanella, Fusobacterium, Marinifilum, Mariniliabilia, and Spirochaeta. These bacterial populations are related to sulfur coupling and carbon cycles in an environment of variable redox conditions and oxygen availability. Conclusions In our studies, we found an association of SRB-like Desulfovibrio with Vibrio species and other genera that have a previously defined relevant role in sulfur transformation and coupling of carbon and sulfur cycles in an environment where there are variable redox conditions and oxygen availability. This study provides new information about microbial species that were culturable on media for SRB at anaerobic conditions at several locations and water depths in the Cariaco Basin.}, issn = {2046-9063}, doi = {10.1186/2046-9063-9-17}, url = {http://aquaticbiosystems.biomedcentral.com/articles/10.1186/2046-9063-9-17}, author = {Bozo-Hurtado, Lorelei and Garc{\'\i}a-Amado, M and Chistoserdov, Andrei and Varela, Ramon and Narvaez, J and Rita R Colwell and Su{\'a}rez, Paula} } @article {19703, title = {An Initial Study of Automatic Curb Ramp Detection with Crowdsourced Verification Using Google Street View Images}, journal = {First AAAI Conference on Human Computation and Crowdsourcing}, year = {2013}, month = {2013/00/11}, abstract = {In our previous research, we examined whether minimally trained crowd workers could find, categorize, and assess sidewalk accessibility problems using Google Street View (GSV) images. This poster paper presents a first step towards combining automated methods ( e.g., machine vision-based curb ramp detectors) in concert with human computation to improve the overall scalability of our approach.}, url = {http://www.aaai.org/ocs/index.php/HCOMP/HCOMP13/paper/view/7507}, author = {Hara, Kotaro and Sun, Jin and Chazan, Jonah and Jacobs, David and Jon Froehlich} } @article {20371, title = {A new integrative conjugative element detected in Haitian isolates of Vibrio cholerae non-O1/non-O139}, journal = {Research in Microbiology}, volume = {164}, year = {2013}, month = {Jan-11-2013}, pages = {891 - 893}, abstract = {The presence of SXT/R391-related integrating conjugative elements (ICEs) in Vibrio cholerae O1 and non-O1/non-O139 isolated from clinical and environmental samples in Haiti in 2010 was studied. The main finding of this work was the identification of the novel ICEVchHai2 among closely related V. cholerae non-O1/non-O139 clinical strains. The mosaic structure of this element confirms the role of ICEs as efficient recombination systems whereby new genetic material can be acquired and exchanged, according V. cholerae strains new accessory functions. }, issn = {09232508}, doi = {10.1016/j.resmic.2013.08.004}, url = {https://linkinghub.elsevier.com/retrieve/pii/S092325081300154X}, author = {Ceccarelli, Daniela and Spagnoletti, Matteo and Hasan, Nur A. and Lansing, Stephanie and Huq, Anwar and Rita R Colwell} } @inbook {19620, title = {Parallel and Dynamic Searchable Symmetric Encryption}, booktitle = {Financial Cryptography and Data Security}, series = {Lecture Notes in Computer Science}, year = {2013}, month = {2013/01/01/}, pages = {258 - 274}, publisher = {Springer Berlin Heidelberg}, organization = {Springer Berlin Heidelberg}, abstract = {Searchable symmetric encryption (SSE) enables a client to outsource a collection of encrypted documents in the cloud and retain the ability to perform keyword searches without revealing information about the contents of the documents and queries. Although efficient SSE constructions are known, previous solutions are highly sequential. This is mainly due to the fact that, currently, the only method for achieving sub-linear time search is the inverted index approach (Curtmola, Garay, Kamara and Ostrovsky, CCS {\textquoteright}06) which requires the search algorithm to access a sequence of memory locations, each of which is unpredictable and stored at the previous location in the sequence. Motivated by advances in multi-core architectures, we present a new method for constructing sub-linear SSE schemes. Our approach is highly parallelizable and dynamic. With roughly a logarithmic number of cores in place, searches for a keyword w in our scheme execute in o(r) parallel time, where r is the number of documents containing keyword w (with more cores, this bound can go down to O(logn), i.e., independent of the result size r). Such time complexity outperforms the optimal Θ(r) sequential search time{\textemdash}a similar bound holds for the updates. Our scheme also achieves the following important properties: (a) it enjoys a strong notion of security, namely security against adaptive chosen-keyword attacks; (b) compared to existing sub-linear dynamic SSE schemes (e.g., Kamara, Papamanthou, Roeder, CCS {\textquoteright}12), updates in our scheme do not leak any information, apart from information that can be inferred from previous search tokens; (c) it can be implemented efficiently in external memory (with logarithmic I/O overhead). Our technique is simple and uses a red-black tree data structure; its security is proven in the random oracle model.}, keywords = {cloud storage, Computer Appl. in Administrative Data Processing, Data Encryption, e-Commerce/e-business, parallel search, Searchable encryption, Systems and Data Security}, isbn = {978-3-642-39883-4, 978-3-642-39884-1}, url = {http://link.springer.com/chapter/10.1007/978-3-642-39884-1_22}, author = {Kamara, Seny and Charalampos Papamanthou}, editor = {Sadeghi, Ahmad-Reza} } @article {19372, title = {Parallel geometric classification of stem cells by their three-dimensional morphology}, journal = {Computational Science \& Discovery}, volume = {6}, year = {2013}, month = {01/2013}, pages = {015007}, doi = {10.1088/1749-4699/6/1/015007}, author = {Juba,Derek and Cardone, Antonio and Ip, Cheuk Yiu and Simon Jr, Carl G and K Tison, Christopher and Kumar, Girish and Brady,Mary and Varshney, Amitabh} } @conference {19617, title = {Practical Dynamic Proofs of Retrievability}, booktitle = {CCS {\textquoteright}13 Proceedings of the 2013 ACM SIGSAC Conference on Computer \& Communications Security }, series = {CCS {\textquoteright}13}, year = {2013}, month = {2013///}, pages = {325 - 336}, publisher = {ACM}, organization = {ACM}, abstract = {Proofs of Retrievability (PoR), proposed by Juels and Kaliski in 2007, enable a client to store n file blocks with a cloud server so that later the server can prove possession of all the data in a very efficient manner (i.e., with constant computation and bandwidth). Although many efficient PoR schemes for static data have been constructed, only two dynamic PoR schemes exist. The scheme by Stefanov et. al. (ACSAC 2012) uses a large of amount of client storage and has a large audit cost. The scheme by Cash (EUROCRYPT 2013) is mostly of theoretical interest, as it employs Oblivious RAM (ORAM) as a black box, leading to increased practical overhead (e.g., it requires about 300 times more bandwidth than our construction). We propose a dynamic PoR scheme with constant client storage whose bandwidth cost is comparable to a Merkle hash tree, thus being very practical. Our construction outperforms the constructions of Stefanov et. al. and Cash et. al., both in theory and in practice. Specifically, for n outsourced blocks of beta bits each, writing a block requires beta+O(lambdalog n) bandwidth and O(betalog n) server computation (lambda is the security parameter). Audits are also very efficient, requiring beta+O(lambda^2log n) bandwidth. We also show how to make our scheme publicly verifiable, providing the first dynamic PoR scheme with such a property. We finally provide a very efficient implementation of our scheme.}, keywords = {dynamic proofs of retrievability, erasure code, por}, isbn = {978-1-4503-2477-9}, url = {http://doi.acm.org/10.1145/2508859.2516669}, author = {Shi, Elaine and Stefanov, Emil and Charalampos Papamanthou} } @inbook {19603, title = {Signatures of Correct Computation}, booktitle = {Theory of Cryptography}, series = {Lecture Notes in Computer Science}, year = {2013}, month = {2013/01/01/}, pages = {222 - 242}, publisher = {Springer Berlin Heidelberg}, organization = {Springer Berlin Heidelberg}, abstract = {We introduce Signatures of Correct Computation (SCC), a new model for verifying dynamic computations in cloud settings. In the SCC model, a trusted source outsources a function f to an untrusted server, along with a public key for that function (to be used during verification). The server can then produce a succinct signature σ vouching for the correctness of the computation of f, i.e., that some result v is indeed the correct outcome of the function f evaluated on some point a. There are two crucial performance properties that we want to guarantee in an SCC construction: (1) verifying the signature should take asymptotically less time than evaluating the function f; and (2) the public key should be efficiently updated whenever the function changes. We construct SCC schemes (satisfying the above two properties) supporting expressive manipulations over multivariate polynomials, such as polynomial evaluation and differentiation. Our constructions are adaptively secure in the random oracle model and achieve optimal updates, i.e., the function{\textquoteright}s public key can be updated in time proportional to the number of updated coefficients, without performing a linear-time computation (in the size of the polynomial). We also show that signatures of correct computation imply Publicly Verifiable Computation (PVC), a model recently introduced in several concurrent and independent works. Roughly speaking, in the SCC model, any client can verify the signature σ and be convinced of some computation result, whereas in the PVC model only the client that issued a query (or anyone who trusts this client) can verify that the server returned a valid signature (proof) for the answer to the query. Our techniques can be readily adapted to construct PVC schemes with adaptive security, efficient updates and without the random oracle model.}, keywords = {Algorithm Analysis and Problem Complexity, Computation by Abstract Devices, Data Encryption, Systems and Data Security}, isbn = {978-3-642-36593-5, 978-3-642-36594-2}, url = {http://link.springer.com/chapter/10.1007/978-3-642-36594-2_13}, author = {Charalampos Papamanthou and Shi, Elaine and Tamassia, Roberto}, editor = {Sahai, Amit} } @article {20373, title = {Species composition of limnetic zooplankton from the southern coastal areas (Mathbaria and Bakerganj) in Bangladesh}, journal = {Journal of the Asiatic Society of Bangladesh, Science}, volume = {38}, year = {2013}, month = {Apr-06-2014}, abstract = {We studied the coastal zooplankton community structure of six waterbodies of Mathbaria and Bakerganj from January 2008 to June 2009. In total 35 zooplankton species were identified under 26 genera under 20 families under 8 orders from Mathbaria. Among them 6 were protozoans, 24 were rotifers, 3 were copepods, 1 was cladocerans and 1 was ostracods. From Bakergonj a total of 42 zooplankton species were identified under 23 genera under 17 Families under 7 orders. Among them 3 were protozoans, 25 were rotifers, 7 were copepods, 6 were cladocerans and 1 was ostracods. Results showed that abundance of rotifera group from both area was higher in Mathbaria (64.86\%) and Bakerganj (60.98\%) than other groups while abundance of ostracoda of Bakerganj area was lowest.}, issn = {1016-6947}, doi = {10.3329/jasbs.v38i1.15326}, url = {http://banglajol.info/index.php/JASBS/article/view/15326}, author = {Mozumder, Pronob K and Nahar, Samsun and Naser, M Niamul and Alam, Munirul and Huq, Anwar and Sack, R Bradley and Rita R Colwell} } @inbook {19613, title = {Streaming Authenticated Data Structures}, booktitle = {Advances in Cryptology {\textendash} EUROCRYPT 2013}, series = {Lecture Notes in Computer Science}, year = {2013}, month = {2013/01/01/}, pages = {353 - 370}, publisher = {Springer Berlin Heidelberg}, organization = {Springer Berlin Heidelberg}, abstract = {We consider the problem of streaming verifiable computation, where both a verifier and a prover observe a stream of n elements x 1,x 2,{\textellipsis},x n and the verifier can later delegate some computation over the stream to the prover. The prover must return the output of the computation, along with a cryptographic proof to be used for verifying the correctness of the output. Due to the nature of the streaming setting, the verifier can only keep small local state (e.g., logarithmic) which must be updatable in a streaming manner and with no interaction with the prover. Such constraints make the problem particularly challenging and rule out applying existing verifiable computation schemes. We propose streaming authenticated data structures, a model that enables efficient verification of data structure queries on a stream. Compared to previous work, we achieve an exponential improvement in the prover{\textquoteright}s running time: While previous solutions have linear prover complexity (in the size of the stream), even for queries executing in sublinear time (e.g., set membership), we propose a scheme with O(logM logn)O(\log M\ log n) prover complexity, where n is the size of the stream and M is the size of the universe of elements. Our schemes support a series of expressive queries, such as (non-)membership, successor, range search and frequency queries, over an ordered universe and even in higher dimensions. The central idea of our construction is a new authentication tree, called generalized hash tree. We instantiate our generalized hash tree with a hash function based on lattices assumptions, showing that it enjoys suitable algebraic properties that traditional Merkle trees lack. We exploit such properties to achieve our results.}, keywords = {Algorithm Analysis and Problem Complexity, Data Encryption, Discrete Mathematics in Computer Science, Systems and Data Security}, isbn = {978-3-642-38347-2, 978-3-642-38348-9}, url = {http://link.springer.com/chapter/10.1007/978-3-642-38348-9_22}, author = {Charalampos Papamanthou and Shi, Elaine and Tamassia, Roberto and Yi, Ke}, editor = {Johansson, Thomas and Nguyen, Phong Q.} } @article {19716, title = {TIGRFAMs and Genome Properties in 2013.}, journal = {Nucleic Acids Res}, volume = {41}, year = {2013}, month = {2013 Jan}, pages = {D387-95}, abstract = {

TIGRFAMs, available online at http://www.jcvi.org/tigrfams is a database of protein family definitions. Each entry features a seed alignment of trusted representative sequences, a hidden Markov model (HMM) built from that alignment, cutoff scores that let automated annotation pipelines decide which proteins are members, and annotations for transfer onto member proteins. Most TIGRFAMs models are designated equivalog, meaning they assign a specific name to proteins conserved in function from a common ancestral sequence. Models describing more functionally heterogeneous families are designated subfamily or domain, and assign less specific but more widely applicable annotations. The Genome Properties database, available at http://www.jcvi.org/genome-properties, specifies how computed evidence, including TIGRFAMs HMM results, should be used to judge whether an enzymatic pathway, a protein complex or another type of molecular subsystem is encoded in a genome. TIGRFAMs and Genome Properties content are developed in concert because subsystems reconstruction for large numbers of genomes guides selection of seed alignment sequences and cutoff values during protein family construction. Both databases specialize heavily in bacterial and archaeal subsystems. At present, 4284 models appear in TIGRFAMs, while 628 systems are described by Genome Properties. Content derives both from subsystem discovery work and from biocuration of the scientific literature.

}, keywords = {Databases, Protein, Genome, Archaeal, Genome, Bacterial, Genomics, Internet, Markov chains, Molecular Sequence Annotation, Proteins, sequence alignment}, issn = {1362-4962}, doi = {10.1093/nar/gks1234}, author = {Haft, Daniel H and Jeremy D Selengut and Richter, Roland A and Harkins, Derek and Basu, Malay K and Beck, Erin} } @inbook {19646, title = {Why {\textquotedblleft}Fiat-Shamir for Proofs{\textquotedblright} Lacks a Proof}, booktitle = {Theory of Cryptography}, series = {Lecture Notes in Computer Science}, year = {2013}, month = {2013/01/01/}, pages = {182 - 201}, publisher = {Springer Berlin Heidelberg}, organization = {Springer Berlin Heidelberg}, abstract = {The Fiat-Shamir heuristic [CRYPTO {\textquoteright}86] is used to convert any 3-message public-coin proof or argument system into a non-interactive argument, by hashing the prover{\textquoteright}s first message to select the verifier{\textquoteright}s challenge. It is known that this heuristic is sound when the hash function is modeled as a random oracle. On the other hand, the surprising result of Goldwasser and Kalai [FOCS {\textquoteright}03] shows that there exists a computationally sound argument on which the Fiat-Shamir heuristic is never sound, when instantiated with any actual efficient hash function. This leaves us with the following interesting possibility: perhaps we can securely instantiates the Fiat-Shamir heuristic for all 3-message public-coin statistically sound proofs, even if we must fail for some computationally sound arguments. Indeed, this has been conjectured to be the case by Barak, Lindell and Vadhan [FOCS {\textquoteright}03], but we do not have any provably secure instantiation under any {\textquotedblleft}standard assumption{\textquotedblright}. In this work, we give a broad black-box separation result showing that the security of the Fiat-Shamir heuristic for statistically sound proofs cannot be proved under virtually any standard assumption via a black-box reduction. More precisely: {\textendash}If we want to have a {\textquotedblleft}universal{\textquotedblright} instantiation of the Fiat-Shamir heuristic that works for all 3-message public-coin proofs, then we cannot prove its security via a black-box reduction from any assumption that has the format of a {\textquotedblleft}cryptographic game{\textquotedblright}. {\textendash}For many concrete proof systems, if we want to have a {\textquotedblleft}specific{\textquotedblright} instantiation of the Fiat-Shamir heuristic for that proof system, then we cannot prove its security via a black box reduction from any {\textquotedblleft}falsifiable assumption{\textquotedblright} that has the format of a cryptographic game with an efficient challenger.}, keywords = {Algorithm Analysis and Problem Complexity, Computation by Abstract Devices, Data Encryption, Systems and Data Security}, isbn = {978-3-642-36593-5, 978-3-642-36594-2}, url = {http://link.springer.com/chapter/10.1007/978-3-642-36594-2_11}, author = {Bitansky, Nir and Dana Dachman-Soled and Garg, Sanjam and Jain, Abhishek and Kalai, Yael Tauman and L{\'o}pez-Alt, Adriana and Wichs, Daniel}, editor = {Sahai, Amit} } @article {20375, title = {An additional step in the transmission of Yersinia pestis?}, journal = {The ISME Journal}, year = {2012}, month = {Jan-02-2012}, pages = {231 - 236}, abstract = {Plague, caused by the bacterium Yersinia pestis, is a mammalian vector-borne disease, transmitted by fleas that serve as the vector between rodent hosts. For many pathogens, including Y. pestis, there are strong evolutionary pressures that lead to a reduction in {\textquoteleft}useless genes{\textquoteright}, with only those retained that reflect function in the specific environment inhabited by the pathogen. Genetic traits critical for survival and transmission between two environments, the rodent and the flea, are conserved in epizootic/epidemic plague strains. However, there are genes that remain conserved for which no function in the flea{\textendash}rodent cycle has yet been observed, indicating an additional environment may exist in the transmission cycle of plague. Here, we present evidence for highly conserved genes that suggests a role in the persistence of Y. pestis after death of its host. Furthermore, maintenance of these genes points to Y. pestis traversing a post-mortem path between, and possibly within, epizootic periods and offering insight into mechanisms that may allow Y. pestis an alternative route of transmission in the natural environment.}, issn = {1751-7362}, doi = {10.1038/ismej.2011.105}, url = {http://www.nature.com/articles/ismej2011105}, author = {Easterday, W Ryan and Kausrud, Kyrre L and Star, Bastiaan and Heier, Lise and Haley, Bradd J and Ageyev, Vladimir and Rita R Colwell and Stenseth, Nils Chr} } @article {19130, title = {AGORA: Assembly Guided by Optical Restriction Alignment}, journal = {BMC bioinformatics}, volume = {13}, year = {2012}, month = {2012}, abstract = {Genome assembly is difficult due to repeated sequences within the genome, which create ambiguities and cause the final assembly to be broken up into many separate sequences (contigs). Long range linking information, such as mate-pairs or mapping data, is necessary to help assembly software resolve repeats, thereby leading to a more complete reconstruction of genomes. Prior work has used optical maps for validating assemblies and scaffolding contigs, after an initial assembly has been produced. However, optical maps have not previously been used within the genome assembly process. Here, we use optical map information within the popular de Bruijn graph assembly paradigm to eliminate paths in the de Bruijn graph which are not consistent with the optical map and help determine the correct reconstruction of the genome.We developed a new algorithm called AGORA: Assembly Guided by Optical Restriction Alignment. AGORA is the first algorithm to use optical map information directly within the de Bruijn graph framework to help produce an accurate assembly of a genome that is consistent with the optical map information provided. Our simulations on bacterial genomes show that AGORA is effective at producing assemblies closely matching the reference sequences. Additionally, we show that noise in the optical map can have a strong impact on the final assembly quality for some complex genomes, and we also measure how various characteristics of the starting de Bruijn graph may impact the quality of the final assembly. Lastly, we show that a proper choice of restriction enzyme for the optical map may substantially improve the quality of the final assembly. Our work shows that optical maps can be used effectively to assemble genomes within the de Bruijn graph assembly framework. Our experiments also provide insights into the characteristics of the mapping data that most affect the performance of our algorithm, indicating the potential benefit of more accurate optical mapping technologies, such as nano-coding. }, author = {Lin, H.C. and Goldstein, S. and Mendelowitz, L. and Zhou, S. and Wetzel, J. and Schwartz, D.C. and Pop, Mihai} } @article {19723, title = {Archaeosortases and exosortases are widely distributed systems linking membrane transit with posttranslational modification.}, journal = {J Bacteriol}, volume = {194}, year = {2012}, month = {2012 Jan}, pages = {36-48}, abstract = {

Multiple new prokaryotic C-terminal protein-sorting signals were found that reprise the tripartite architecture shared by LPXTG and PEP-CTERM: motif, TM helix, basic cluster. Defining hidden Markov models were constructed for all. PGF-CTERM occurs in 29 archaeal species, some of which have more than 50 proteins that share the domain. PGF-CTERM proteins include the major cell surface protein in Halobacterium, a glycoprotein with a partially characterized diphytanylglyceryl phosphate linkage near its C terminus. Comparative genomics identifies a distant exosortase homolog, designated archaeosortase A (ArtA), as the likely protein-processing enzyme for PGF-CTERM. Proteomics suggests that the PGF-CTERM region is removed. Additional systems include VPXXXP-CTERM/archeaosortase B in two of the same archaea and PEF-CTERM/archaeosortase C in four others. Bacterial exosortases often fall into subfamilies that partner with very different cohorts of extracellular polymeric substance biosynthesis proteins; several species have multiple systems. Variant systems include the VPDSG-CTERM/exosortase C system unique to certain members of the phylum Verrucomicrobia, VPLPA-CTERM/exosortase D in several alpha- and deltaproteobacterial species, and a dedicated (single-target) VPEID-CTERM/exosortase E system in alphaproteobacteria. Exosortase-related families XrtF in the class Flavobacteria and XrtG in Gram-positive bacteria mark distinctive conserved gene neighborhoods. A picture emerges of an ancient and now well-differentiated superfamily of deeply membrane-embedded protein-processing enzymes. Their target proteins are destined to transit cellular membranes during their biosynthesis, during which most undergo additional posttranslational modifications such as glycosylation.

}, keywords = {Amino Acid Sequence, Aminoacyltransferases, Archaeal Proteins, Bacterial Proteins, Cell Membrane, Cysteine Endopeptidases, Gene Expression Regulation, Archaeal, Gene Expression Regulation, Bacterial, Gene Expression Regulation, Enzymologic, Molecular Sequence Data, Protein Processing, Post-Translational}, issn = {1098-5530}, doi = {10.1128/JB.06026-11}, author = {Haft, Daniel H and Payne, Samuel H and Jeremy D Selengut} } @article {18820, title = {Automated synthesis of action selection policies for unmanned vehicles operating in adverse environments}, journal = {Autonomous Robots}, volume = {32}, year = {2012}, month = {2012///}, pages = {149 - 164}, abstract = {We address the problem of automated action selection policy synthesis for unmanned vehicles operating in adverse environments. We introduce a new evolutionary computation-based approach using which an initial version of the policy is automatically generated and then gradually refined by detecting and fixing its shortcomings. The synthesis technique consists of the automated extraction of the vehicle{\textquoteright}s exception states and Genetic Programming (GP) for automated composition and optimization of corrective sequences of commands in the form of macro-actions to be applied locally. The focus is specifically on automated synthesis of a policy for Unmanned Surface Vehicle (USV) to efficiently block the advancement of an intruder boat toward a valuable target. This task requires the USV to utilize reactive planning complemented by short-term forward planning to 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 blocking policy to the performance of a policy that was automatically synthesized. Our results show that the performance of the automatically generated policy exceeds the performance of the hand-coded policy and thus demonstrates the feasibility of the proposed approach.}, keywords = {Computer science}, isbn = {0929-5593}, doi = {10.1007/s10514-011-9268-6}, url = {http://www.springerlink.com/content/664k84x080868141/abstract/}, author = {Svec,Petr and Gupta, Satyandra K.} } @article {19654, title = {BclAF1 restriction factor is neutralized by proteasomal degradation and microRNA repression during human cytomegalovirus infection}, journal = {Proceedings of the National Academy of Sciences}, volume = {109}, year = {2012}, month = {2012/06/12/}, pages = {9575 - 9580}, abstract = {Cell proteins can restrict the replication of viruses. Here, we identify the cellular BclAF1 protein as a human cytomegalovirus restriction factor and describe two independent mechanisms the virus uses to decrease its steady-state levels. Immediately following infection, the viral pp71 and UL35 proteins, which are delivered to cells within virions, direct the proteasomal degradation of BclAF1. Although BclAF1 reaccumulates through the middle stages of infection, it is subsequently down-regulated at late times by miR-UL112-1, a virus-encoded microRNA. In the absence of BclAF1 neutralization, viral gene expression and replication are inhibited. These data identify two temporally and mechanistically distinct functions used by human cytomegalovirus to down-regulate a cellular antiviral protein.}, keywords = {innate immunity, intrinsic immunity, miRNA, Proteasome, UL82}, isbn = {0027-8424, 1091-6490}, url = {http://www.pnas.org/content/109/24/9575}, author = {Lee, Song Hee and Kalejta, Robert F. and Kerry, Julie and Semmes, Oliver John and O{\textquoteright}Connor, Christine M. and Zia Khan and Garcia, Benjamin A. and Shenk, Thomas and Murphy, Eain} } @article {12980, title = {BEAGLE: An Application Programming Interface and High-Performance Computing Library for Statistical Phylogenetics}, journal = {Systematic BiologySyst Biol}, volume = {61}, year = {2012}, month = {2012/01/01/}, pages = {170 - 173}, abstract = {Phylogenetic inference is fundamental to our understanding of most aspects of the origin and evolution of life, and in recent years, there has been a concentration of interest in statistical approaches such as Bayesian inference and maximum likelihood estimation. Yet, for large data sets and realistic or interesting models of evolution, these approaches remain computationally demanding. High-throughput sequencing can yield data for thousands of taxa, but scaling to such problems using serial computing often necessitates the use of nonstatistical or approximate approaches. The recent emergence of graphics processing units (GPUs) provides an opportunity to leverage their excellent floating-point computational performance to accelerate statistical phylogenetic inference. A specialized library for phylogenetic calculation would allow existing software packages to make more effective use of available computer hardware, including GPUs. Adoption of a common library would also make it easier for other emerging computing architectures, such as field programmable gate arrays, to be used in the future. We present BEAGLE, an application programming interface (API) and library for high-performance statistical phylogenetic inference. The API provides a uniform interface for performing phylogenetic likelihood calculations on a variety of compute hardware platforms. The library includes a set of efficient implementations and can currently exploit hardware including GPUs using NVIDIA CUDA, central processing units (CPUs) with Streaming SIMD Extensions and related processor supplementary instruction sets, and multicore CPUs via OpenMP. To demonstrate the advantages of a common API, we have incorporated the library into several popular phylogenetic software packages. The BEAGLE library is free open source software licensed under the Lesser GPL and available from http://beagle-lib.googlecode.com. An example client program is available as public domain software.}, keywords = {Bayesian phylogenetics, gpu, maximum likelihood, parallel computing}, isbn = {1063-5157, 1076-836X}, doi = {10.1093/sysbio/syr100}, url = {http://sysbio.oxfordjournals.org/content/61/1/170}, author = {Ayres,Daniel L and Darling,Aaron and Zwickl,Derrick J and Beerli,Peter and Holder,Mark T and Lewis,Paul O and Huelsenbeck,John P and Ronquist,Fredrik and Swofford,David L and Cummings, Michael P. and Rambaut,Andrew and Suchard,Marc A} } @article {12424, title = {Besting the Quiz Master: Crowdsourcing Incremental Classification Games}, journal = {Empirical Methods in Natural Language Processing}, year = {2012}, month = {2012///}, abstract = {Cost-sensitive classification, where the features used in machine learning tasks have a cost, has been explored as a means of balancing knowl- edge against the expense of obtaining new fea- tures. We introduce a setting where humans engage in classification with incrementally re- vealed features: the collegiate trivia circuit. By providing the community with a web-based system to practice, we collected tens of thou- sands of implicit word-by-word ratings of how useful features are for eliciting correct answers. Observing humans{\textquoteright} classification process, we improve the performance of a state-of-the art classifier. We also use the dataset to evaluate a system to compete in the incremental classifica- tion task through a reduction of reinforcement learning to classification. Our system learns when to answer a question, performing better than baselines and most human players.}, author = {Satinoff,Brianna and Jordan Boyd-Graber} } @article {19135, title = {Bioinformatics for the Human Microbiome Project}, journal = {PLoS Computational Biology}, volume = {8}, year = {2012}, month = {11/2012}, pages = {e1002779}, doi = {10.1371/journal.pcbi.1002779}, author = {Gevers, Dirk and Pop, Mihai and Schloss, Patrick D. and Huttenhower, Curtis} } @article {19028, title = {Cloud Data Protection for the Masses}, journal = {Computer}, volume = {45}, year = {2012}, month = {2012}, pages = {39 - 45}, abstract = {Offering strong data protection to cloud users while enabling rich applications is a challenging task. Researchers explore a new cloud platform architecture called Data Protection as a Service, which dramatically reduces the per-application development effort required to offer data protection, while still allowing rapid development and maintenance.}, keywords = {Cloud computing, cloud data protection, cloud platform architecture, cloud users, Maintenance, rapid development, security of data, strong data protection}, isbn = {0018-9162}, author = {Song,D. and Elaine Shi and Fischer, I. and Shankar,U.} } @inbook {12400, title = {Collecting Semantic Similarity Ratings to Connect Concepts in Assistive Communication Tools}, booktitle = {Modeling, Learning, and Processing of Text Technological Data StructuresModeling, Learning, and Processing of Text Technological Data Structures}, series = {Studies in Computational Intelligence}, volume = {370}, year = {2012}, month = {2012///}, pages = {81 - 93}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {To compensate for the common inability of people with lexical production impairments to access and express intended concepts, we make use of models of human semantic memory that build on the notion of semantic similarity and relatedness. Such models, constructed on evidence gained from psycholinguistic experiments, form the basis of a large lexical database, WordNet . We augment WordNet with many additional links among words and concepts that are semantically related. Making this densely connected semantic network available to people with anomic aphasia through assistive technologies should enable them to navigate among related words and concepts and retrieve the words that they intend to express.}, isbn = {978-3-642-22612-0}, url = {http://dx.doi.org/10.1007/978-3-642-22613-7_5}, author = {Nikolova,Sonya and Jordan Boyd-Graber and Fellbaum,Christiane}, editor = {Mehler,Alexander and K{\"u}hnberger,Kai-Uwe and Lobin,Henning and L{\"u}ngen,Harald and Storrer,Angelika and Witt,Andreas} } @book {19345, title = {Computational Analysis of Terrorist Groups: Lashkar-e-Taiba}, year = {2012}, month = {2012}, publisher = {Springer Publishing Company, Incorporated}, organization = {Springer Publishing Company, Incorporated}, abstract = {Computational Analysis of Terrorist Groups: Lashkar-e-Taiba provides an in-depth look at Web intelligence, and how advanced mathematics and modern computing technology can influence the insights we have on terrorist groups. This book primarily focuses on one famous terrorist group known as Lashkar-e-Taiba (or LeT), and how it operates. After 10 years of counter Al Qaeda operations, LeT is considered by many in the counter-terrorism community to be an even greater threat to the US and world peace than Al Qaeda. Computational Analysis of Terrorist Groups: Lashkar-e-Taiba is the first book that demonstrates how to use modern computational analysis techniques including methods for big data analysis. This book presents how to quantify both the environment in which LeT operate, and the actions it took over a 20-year period, and represent it as a relational database table. This table is then mined using sophisticated data mining algorithms in order to gain detailed, mathematical, computational and statistical insights into LeT and its operations. This book also provides a detailed history of Lashkar-e-Taiba based on extensive analysis conducted by using open source information and public statements. Each chapter includes a case study, as well as a slide describing the key results which are available on the authors web sites. Computational Analysis of Terrorist Groups: Lashkar-e-Taiba is designed for a professional market composed of government or military workers, researchers and computer scientists working in the web intelligence field. Advanced-level students in computer science will also find this valuable as a reference book.}, isbn = {1461447682, 9781461447689}, author = {V.S. Subrahmanian and Mannes, Aaron and Sliva,Amy and Shakarian, Jana and Dickerson, John P.} } @article {12853, title = {Conversion of viable but nonculturable enteric bacteria to culturable by co-culture with eukaryotic cells}, journal = {Microbiology and Immunology}, volume = {56}, year = {2012}, month = {2012/04/27/}, pages = {342 - 345}, abstract = {Viable but nonculturable (VBNC) Vibrio cholerae non-O1/non-O139, V. parahaemolyticus, enterohemorrhagic Escherichia coli, enterotoxigenic E. coli, enteropathogenic E. coli, Shigella flexneri, and Salmonella enterica were converted to the culturable state by co-culture with selected eukaryotic cells, e.g., HT-29, Caco-2, T84, HeLa, Intestine 407, and CHO cells.}, keywords = {conversion to culturability, enteric bacteria, viable but nonculturable}, isbn = {1348-0421}, doi = {10.1111/j.1348-0421.2012.00440.x}, url = {http://onlinelibrary.wiley.com/doi/10.1111/j.1348-0421.2012.00440.x/abstract?userIsAuthenticated=false\&deniedAccessCustomisedMessage=}, author = {Senoh,Mitsutoshi and Ghosh-Banerjee,Jayeeta and Ramamurthy,Thandavarayan and Rita R Colwell and Miyoshi,Shin-ichi and Nair,G. Balakrish and Takeda,Yoshifumi} } @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 {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.} } @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.} } @article {20387, title = {Ecology of Vibrio parahaemolyticus and Vibrio vulnificus in the Coastal and Estuarine Waters of Louisiana, Maryland, Mississippi, and Washington (United States)}, journal = {Applied and Environmental Microbiology}, year = {2012}, month = {Mar-10-2013}, pages = {7249 - 7257}, abstract = {Vibrio parahaemolyticus and Vibrio vulnificus, which are native to estuaries globally, are agents of seafood-borne or wound infections, both potentially fatal. Like all vibrios autochthonous to coastal regions, their abundance varies with changes in environmental parameters. Sea surface temperature (SST), sea surface height (SSH), and chlorophyll have been shown to be predictors of zooplankton and thus factors linked to vibrio populations. The contribution of salinity, conductivity, turbidity, and dissolved organic carbon to the incidence and distribution of Vibrio spp. has also been reported. Here, a multicoastal, 21-month study was conducted to determine relationships between environmental parameters and V. parahaemolyticus and V. vulnificus populations in water, oysters, and sediment in three coastal areas of the United States. Because ecologically unique sites were included in the study, it was possible to analyze individual parameters over wide ranges. Molecular methods were used to detect genes for thermolabile hemolysin (tlh), thermostable direct hemolysin (tdh), and tdh-related hemolysin (trh) as indicators of V. parahaemolyticus and the hemolysin gene vvhA for V. vulnificus. SST and suspended particulate matter were found to be strong predictors of total and potentially pathogenic V. parahaemolyticus and V. vulnificus. Other predictors included chlorophyll a, salinity, and dissolved organic carbon. For the ecologically unique sites included in the study, SST was confirmed as an effective predictor of annual variation in vibrio abundance, with other parameters explaining a portion of the variation not attributable to SST.}, issn = {0099-2240}, doi = {10.1128/AEM.01296-12}, url = {http://aem.asm.org/lookup/doi/10.1128/AEM.01296-12}, author = {Johnson, Crystal N. and Bowers, John C. and Griffitt, Kimberly J. and Molina, Vanessa and Clostio, Rachel W. and Pei, Shaofeng and Laws, Edward and Paranjpye, Rohinee N. and Strom, Mark S. and Chen, Arlene and Hasan, Nur A. and Huq, Anwar and Noriea, Nicholas F. and Grimes, D. Jay and Rita R Colwell} } @article {13066, title = {Face Identification Using Large Feature Sets}, journal = {Image Processing, IEEE Transactions on}, volume = {21}, year = {2012}, month = {2012/04//}, pages = {2245 - 2255}, abstract = {With the goal of matching unknown faces against a gallery of known people, the face identification task has been studied for several decades. There are very accurate techniques to perform face identification in controlled environments, particularly when large numbers of samples are available for each face. However, face identification under uncontrolled environments or with a lack of training data is still an unsolved problem. We employ a large and rich set of feature descriptors (with more than 70 000 descriptors) for face identification using partial least squares to perform multichannel feature weighting. Then, we extend the method to a tree-based discriminative structure to reduce the time required to evaluate probe samples. The method is evaluated on Facial Recognition Technology (FERET) and Face Recognition Grand Challenge (FRGC) data sets. Experiments show that our identification method outperforms current state-of-the-art results, particularly for identifying faces acquired across varying conditions.}, keywords = {(mathematics);, approximations;trees, challenge, data, data;tree-based, discriminative, environments;face, feature, FERET;FRGC, grand, identification, least, recognition, recognition;least, sets;face, sets;facial, squares, squares;training, structure;uncontrolled, task;face, technology;multichannel, weighting;partial}, isbn = {1057-7149}, doi = {10.1109/TIP.2011.2176951}, author = {Schwartz, W.R. and Guo,Huimin and Choi,Jonghyun and Davis, Larry S.} } @article {14484, title = {The first international workshop on entity-oriented search (EOS)}, journal = {SIGIR Forum}, volume = {45}, year = {2012}, month = {2012/01//}, pages = {43 - 50}, abstract = {The First International Workshop on Entity-Oriented Search (EOS) workshop was held on July 28, 2011 in Beijing, China, in conjunction with the 34th Annual International ACM SIGIR Conference (SIGIR 2011). The objective for the workshop was to bring together academic researchers and industry practitioners working on entity-oriented search to discuss tasks and challenges, and to uncover the next frontiers for academic research on the topic. The workshop program accommodated two invited talks, eleven refereed papers divided into three technical paper sessions, and a group discussion.}, isbn = {0163-5840}, doi = {10.1145/2093346.2093353}, url = {http://doi.acm.org/10.1145/2093346.2093353}, author = {Balog,Krisztian and de Vries,Arjen P. and Serdyukov,Pavel and Wen,Ji-Rong} } @article {16266, title = {GAGE: A Critical Evaluation of Genome Assemblies and Assembly Algorithms}, journal = {Genome Research}, volume = {22}, year = {2012}, month = {2012}, pages = {557 - 567}, abstract = {New sequencing technology has dramatically altered the landscape of whole-genome sequencing, allowing scientists to initiate numerous projects to decode the genomes of previously unsequenced organisms. The lowest-cost technology can generate deep coverage of most species, including mammals, in just a few days. The sequence data generated by one of these projects consist of millions or billions of short DNA sequences (reads) that range from 50 to 150 nt in length. These sequences must then be assembled de novo before most genome analyses can begin. Unfortunately, genome assembly remains a very difficult problem, made more difficult by shorter reads and unreliable long-range linking information. In this study, we evaluated several of the leading de novo assembly algorithms on four different short-read data sets, all generated by Illumina sequencers. Our results describe the relative performance of the different assemblers as well as other significant differences in assembly difficulty that appear to be inherent in the genomes themselves. Three overarching conclusions are apparent: first, that data quality, rather than the assembler itself, has a dramatic effect on the quality of an assembled genome; second, that the degree of contiguity of an assembly varies enormously among different assemblers and different genomes; and third, that the correctness of an assembly also varies widely and is not well correlated with statistics on contiguity. To enable others to replicate our results, all of our data and methods are freely available, as are all assemblers used in this study.}, doi = {10.1101/gr.131383.111}, url = {http://genome.cshlp.org/content/22/3/557}, author = {Salzberg,Steven L. and Phillippy,Adam M and Zimin,Aleksey and Puiu,Daniela and Magoc,Tanja and Koren,Sergey and Treangen,Todd J and Schatz,Michael C and Delcher,Arthur L. and Roberts,Michael and Mar{\c c}ais,Guillaume and Pop, Mihai and Yorke,James A.} } @article {16267, title = {Gene Prediction with Glimmer for Metagenomic Sequences Augmented by Classification and Clustering}, journal = {Nucleic Acids ResearchNucl. Acids Res.}, volume = {40}, year = {2012}, month = {2012/01/01/}, pages = {e9-e9 - e9-e9}, abstract = {Environmental shotgun sequencing (or metagenomics) is widely used to survey the communities of microbial organisms that live in many diverse ecosystems, such as the human body. Finding the protein-coding genes within the sequences is an important step for assessing the functional capacity of a metagenome. In this work, we developed a metagenomics gene prediction system Glimmer-MG that achieves significantly greater accuracy than previous systems via novel approaches to a number of important prediction subtasks. First, we introduce the use of phylogenetic classifications of the sequences to model parameterization. We also cluster the sequences, grouping together those that likely originated from the same organism. Analogous to iterative schemes that are useful for whole genomes, we retrain our models within each cluster on the initial gene predictions before making final predictions. Finally, we model both insertion/deletion and substitution sequencing errors using a different approach than previous software, allowing Glimmer-MG to change coding frame or pass through stop codons by predicting an error. In a comparison among multiple gene finding methods, Glimmer-MG makes the most sensitive and precise predictions on simulated and real metagenomes for all read lengths and error rates tested.}, isbn = {0305-1048, 1362-4962}, doi = {10.1093/nar/gkr1067}, url = {http://nar.oxfordjournals.org/content/40/1/e9}, author = {Kelley,David R and Liu,Bo and Delcher,Arthur L. and Pop, Mihai and Salzberg,Steven L.} } @article {20374, title = {Genetic characteristics of drug-resistant Vibrio cholerae O1 causing endemic cholera in Dhaka, 2006-2011}, journal = {Journal of Medical Microbiology}, year = {2012}, month = {Jan-12-2012}, pages = {1736 - 1745}, abstract = {Vibrio cholerae O1 biotype El Tor (ET), causing the seventh cholera pandemic, was recently replaced in Bangladesh by an altered ET possessing ctxB of the Classical (CL) biotype, which caused the first six cholera pandemics. In the present study, V. cholerae O1 strains associated with endemic cholera in Dhaka between 2006 and 2011 were analysed for major phenotypic and genetic characteristics. Of 54 representative V. cholerae isolates tested, all were phenotypically ET and showed uniform resistance to trimethoprim/sulfamethoxazole (SXT) and furazolidone (FR). Resistance to tetracycline (TE) and erythromycin (E) showed temporal fluctuation, varying from year to year, while all isolates were susceptible to gentamicin (CN) and ciprofloxacin (CIP). Year-wise data revealed erythromycin resistance to be 33.3 \% in 2006 and 11 \% in 2011, while tetracycline resistance accounted for 33, 78, 0, 100 and 27 \% in 2006, 2007, 2008, 2009 and 2010, respectively; interestingly, all isolates tested were sensitive to TE in 2011, as observed in 2008. All V. cholerae isolates tested possessed genetic elements such as SXT, ctxAB, tcpA ET, rstR ET and rtxC; none had IntlI (Integron I). Double mismatch amplification mutation assay (DMAMA)-PCR followed by DNA sequencing and analysis of the ctxB gene revealed a point mutation at position 58 (C{\textrightarrow}A), which has resulted in an amino acid substitution from histidine (H) to asparagine (N) at position 20 (genotype 7) since 2008. Although the multi-resistant strains having tetracycline resistance showed minor genetic divergence, V. choleraestrains were clonal, as determined by a PFGE (NotI)-based dendrogram. This study shows 2008{\textendash}2010 to be the time of transition from ctxB genotype 1 to genotype 7 in V. cholerae ET causing endemic cholera in Dhaka, Bangladesh.}, issn = {0022-2615}, doi = {10.1099/jmm.0.049635-0}, url = {http://jmm.microbiologyresearch.org/content/journal/jmm/10.1099/jmm.0.049635-0}, author = {Rashed, S. M. and Mannan, S. B. and Johura, F.-T. and Islam, M. T. and Sadique, A. and Watanabe, H. and Sack, R. B. and Huq, A. and Rita R Colwell and Cravioto, A. and Alam, M.} } @article {20384, title = {Genomic analysis of ICE Vch Ban8: An atypical genetic element in Vibrio cholerae}, journal = {FEBS Letters}, year = {2012}, month = {Apr-06-2012}, pages = {1617 - 1621}, abstract = {Genomic islands (GIs) and integrative conjugative elements (ICEs) are major players in bacterial evolution since they encode genes involved in adaptive functions of medical or environmental importance. Here we performed the genomic analysis of ICEVchBan8, an unusual ICE found in the genome of a clinical non-toxigenic Vibrio cholerae O37 isolate. ICEVchBan8 shares most of its genetic structure with SXT/R391 ICEs. However, this ICE codes for a different integration/excision module is located at a different insertion site, and part of its genetic cargo shows homology to other pathogenicity islands of V. cholerae.}, doi = {10.1016/j.febslet.2012.03.064}, url = {http://doi.wiley.com/10.1016/j.febslet.2012.03.064}, author = {Taviani, Elisa and Spagnoletti, Matteo and Ceccarelli, Daniela and Haley, Bradd J. and Hasan, Nur A. and Chen, Arlene and Colombo, Mauro M. and Huq, Anwar and Rita R Colwell} } @article {20386, title = {Genomic diversity of 2010 Haitian cholera outbreak strains}, journal = {Proceedings of the National Academy of Sciences}, year = {2012}, month = {05/2012}, pages = {E2010 - E2017}, issn = {0027-8424}, doi = {10.1073/pnas.1207359109}, url = {http://www.pnas.org/cgi/doi/10.1073/pnas.1207359109}, author = {Hasan, N. A. and Choi, S. Y. and Eppinger, M. and Clark, P. W. and Chen, A. and Alam, M. and Haley, B. J. and Taviani, E. and Hine, E. and Su, Q. and Tallon, L. J. and Prosper, J. B. and Furth, K. and Hoq, M. M. and Li, H. and Fraser-Liggett, C. M. and Cravioto, A. and Huq, A. and Ravel, J. and Cebula, T. A. and Rita R Colwell} } @article {19718, title = {Genomic insights to SAR86, an abundant and uncultivated marine bacterial lineage.}, journal = {ISME J}, volume = {6}, year = {2012}, month = {2012 Jun}, pages = {1186-99}, abstract = {

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

}, keywords = {Computational Biology, Gammaproteobacteria, Genome, Bacterial, Genomic Library, metagenomics, Oceans and Seas, Phylogeny, plankton, Rhodopsin, RNA, Ribosomal, 16S, Seawater}, issn = {1751-7370}, doi = {10.1038/ismej.2011.189}, author = {Dupont, Chris L and Rusch, Douglas B and Yooseph, Shibu and Lombardo, Mary-Jane and Richter, R Alexander and Valas, Ruben and Novotny, Mark and Yee-Greenbaum, Joyclyn and Jeremy D Selengut and Haft, Dan H and Halpern, Aaron L and Lasken, Roger S and Nealson, Kenneth and Friedman, Robert and Venter, J Craig} } @article {12419, title = {Grammatical structures for word-level sentiment detection}, journal = {North American Association of Computational Linguistics}, year = {2012}, month = {2012///}, abstract = {Existing work in fine-grained sentiment anal- ysis focuses on sentences and phrases but ig- nores the contribution of individual words and their grammatical connections. This is because of a lack of both (1) annotated data at the word level and (2) algorithms that can leverage syn- tactic information in a principled way. We ad- dress the first need by annotating articles from the information technology business press via crowdsourcing to provide training and testing data. To address the second need, we propose a suffix-tree data structure to represent syntac- tic relationships between opinion targets and words in a sentence that are opinion-bearing. We show that a factor graph derived from this data structure acquires these relationships with a small number of word-level features. We demonstrate that our supervised model per- forms better than baselines that ignore syntac- tic features and constraints.}, author = {Jordan Boyd-Graber and Sayeed,Asad B. and Rusk,Bryan and Weinberg, Amy} } @article {15427, title = {Grey-box GUI Testing: Efficient Generation of Event Sequences}, journal = {arXiv:1205.4928}, year = {2012}, month = {2012/05/22/}, abstract = {Graphical user interfaces (GUIs), due to their event driven nature, present a potentially unbounded space of all possible ways to interact with software. During testing it becomes necessary to effectively sample this space. In this paper we develop algorithms that sample the GUI{\textquoteright}s input space by only generating sequences that (1) are allowed by the GUI{\textquoteright}s structure, and (2) chain together only those events that have data dependencies between their event handlers. We create a new abstraction, called an event-dependency graph (EDG) of the GUI, that captures data dependencies between event handler code. We develop a mapping between EDGs and an existing black-box user-level model of the GUI{\textquoteright}s workflow, called an event-flow graph (EFG). We have implemented automated EDG construction in a tool that analyzes the bytecode of each event handler. We evaluate our "grey-box" approach using four open-source applications and compare it with the current state-of-the-art EFG approach. Our results show that using the EDG reduces the number of test cases while still achieving at least the same coverage. Furthermore, we were able to detect 2 new bugs in the subject applications.}, keywords = {68N30, Computer Science - Software Engineering}, url = {http://arxiv.org/abs/1205.4928}, author = {Arlt,Stephan and Banerjee,Ishan and Bertolini,Cristiano and Memon, Atif M. and Sch{\"a}f,Martin} } @conference {18848, title = {Gripper synthesis for indirect manipulation of cells using Holographic Optical Tweezers}, year = {2012}, month = {2012/05//}, pages = {2749 - 2754}, abstract = {Optical Tweezers (OT) are used for highly accurate manipulations of biological cells. However, the direct exposure of cells to focused laser beam may negatively influence their biological functions. In order to overcome this problem, we generate multiple optical traps to grab and move a 3D ensemble of inert particles such as silica microspheres to act as a reconfigurable gripper for a manipulated cell. The relative positions of the microspheres are important in order for the gripper to be robust against external environmental forces and the exposure of high intensity laser on the cell to be minimized. In this paper, we present results of different gripper configurations, experimentally tested using our OT setup, that provide robust gripping as well as minimize laser intensity experienced by the cell. We developed a computational approach that allowed us to perform preliminary modeling and synthesis of the gripper configurations. The gripper synthesis is cast as a multi-objective optimization problem.}, doi = {10.1109/ICRA.2012.6225153}, author = {Chowdhury,Sagar and Svec,Petr and Wang,Chenlu and Losert,Wolfgang and Gupta, Satyandra K.} } @article {19129, title = {Identification of Coli Surface Antigen 23, a Novel Adhesin of Enterotoxigenic Escherichia coli}, journal = {Infection and immunity}, volume = {80}, year = {2012}, month = {2012}, pages = {2791 - 2801}, abstract = {Enterotoxigenic Escherichia coli (ETEC) is an important cause of diarrhea, mainly in developing countries. Although there are 25 different ETEC adhesins described in strains affecting humans, between 15\% and 50\% of the clinical isolates from different geographical regions are negative for these adhesins, suggesting that additional unidentified adhesion determinants might be present. Here, we report the discovery of Coli Surface Antigen 23 (CS23), a novel adhesin expressed by an ETEC serogroup O4 strain (ETEC 1766a), which was negative for the previously known ETEC adhesins, albeit it has the ability to adhere to Caco-2 cells. CS23 is encoded by an 8.8-kb locus which contains 9 open reading frames (ORFs), 7 of them sharing significant identity with genes required for assembly of K88-related fimbriae. This gene locus, named aal (adhesion-associated locus), is required for the adhesion ability of ETEC 1766a and was able to confer this adhesive phenotype to a nonadherent E. coli HB101 strain. The CS23 major structural subunit, AalE, shares limited identity with known pilin proteins, and it is more closely related to the CS13 pilin protein CshE, carried by human ETEC strains. Our data indicate that CS23 is a new member of the diverse adhesin repertoire used by ETEC strains.}, author = {Del Canto, F. and Botkin, D.J. and Valenzuela, P. and Popov, V. and Ruiz-Perez, F. and Nataro, J.P. and Levine, M.M. and Stine, O.C. and Pop, Mihai and Torres, A.G. and others} } @article {19216, title = {Individuals among commuters: Building personalised transport information services from fare collection systems}, journal = {Pervasive and Mobile Computing}, year = {2012}, month = {2012}, author = {Lathia,N. and Smith,C. and Jon Froehlich and Capra,L.} } @article {17249, title = {Interactive Dynamics for Visual Analysis}, journal = {Queue - Micoprocessors}, volume = {10}, year = {2012}, month = {2012/02//}, pages = {30:30{\textendash}30:55 - 30:30{\textendash}30:55}, abstract = {A taxonomy of tools that support the fluent and flexible use of visualizations}, isbn = {1542-7730}, doi = {10.1145/2133416.2146416}, url = {http://doi.acm.org/10.1145/2133416.2146416}, author = {Heer,Jeffrey and Shneiderman, Ben} } @article {19721, title = {InterPro in 2011: new developments in the family and domain prediction database.}, journal = {Nucleic Acids Res}, volume = {40}, year = {2012}, month = {2012 Jan}, pages = {D306-12}, abstract = {

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

}, keywords = {Databases, Protein, Protein Structure, Tertiary, Proteins, Sequence Analysis, Protein, software, Terminology as Topic, User-Computer Interface}, issn = {1362-4962}, doi = {10.1093/nar/gkr948}, author = {Hunter, Sarah and Jones, Philip and Mitchell, Alex and Apweiler, Rolf and Attwood, Teresa K and Bateman, Alex and Bernard, Thomas and Binns, David and Bork, Peer and Burge, Sarah and de Castro, Edouard and Coggill, Penny and Corbett, Matthew and Das, Ujjwal and Daugherty, Louise and Duquenne, Lauranne and Finn, Robert D and Fraser, Matthew and Gough, Julian and Haft, Daniel and Hulo, Nicolas and Kahn, Daniel and Kelly, Elizabeth and Letunic, Ivica and Lonsdale, David and Lopez, Rodrigo and Madera, Martin and Maslen, John and McAnulla, Craig and McDowall, Jennifer and McMenamin, Conor and Mi, Huaiyu and Mutowo-Muellenet, Prudence and Mulder, Nicola and Natale, Darren and Orengo, Christine and Pesseat, Sebastien and Punta, Marco and Quinn, Antony F and Rivoire, Catherine and Sangrador-Vegas, Amaia and Jeremy D Selengut and Sigrist, Christian J A and Scheremetjew, Maxim and Tate, John and Thimmajanarthanan, Manjulapramila and Thomas, Paul D and Wu, Cathy H and Yeats, Corin and Yong, Siew-Yit} } @article {19589, title = {Introspective Pushdown Analysis of Higher-Order Programs}, journal = {arXiv:1207.1813 [cs]}, year = {2012}, note = {Comment: Proceedings of the 17th ACM SIGPLAN International Conference on Functional Programming, 2012, ACM}, month = {2012/07/07/}, abstract = {In the static analysis of functional programs, pushdown flow analysis and abstract garbage collection skirt just inside the boundaries of soundness and decidability. Alone, each method reduces analysis times and boosts precision by orders of magnitude. This work illuminates and conquers the theoretical challenges that stand in the way of combining the power of these techniques. The challenge in marrying these techniques is not subtle: computing the reachable control states of a pushdown system relies on limiting access during transition to the top of the stack; abstract garbage collection, on the other hand, needs full access to the entire stack to compute a root set, just as concrete collection does. \emph{Introspective} pushdown systems resolve this conflict. Introspective pushdown systems provide enough access to the stack to allow abstract garbage collection, but they remain restricted enough to compute control-state reachability, thereby enabling the sound and precise product of pushdown analysis and abstract garbage collection. Experiments reveal synergistic interplay between the techniques, and the fusion demonstrates "better-than-both-worlds" precision.}, keywords = {Computer Science - Programming Languages, D.3.4, F.3.2}, url = {http://arxiv.org/abs/1207.1813}, author = {Earl, Christopher and Sergey, Ilya and Might, Matthew and David Van Horn} } @article {20382, title = {Vibrio cholerae in a historically cholera-free country}, journal = {Environmental Microbiology Reports}, year = {2012}, month = {Jan-08-2012}, pages = {381 - 389}, abstract = {We report the autochthonous existence of Vibrio cholerae in coastal waters of Iceland, a geothermally active country where cholera is absent and has never been reported. Seawater, mussel and macroalgae samples were collected close to, and distant from, sites where geothermal activity causes a significant increase in water temperature during low tides. Vibrio cholerae was detected only at geothermal-influenced sites during low-tides. None of the V. cholerae isolates encoded cholera toxin (ctxAB) and all were non-O1/non-O139 serogroups. However, all isolates encoded other virulence factors that are associated with cholera as well as extra-intestinal V. cholerae infections. The virulence factors were functional at temperatures of coastal waters of Iceland, suggesting an ecological role. It is noteworthy that V. cholerae was isolated from samples collected at sites distant from anthropogenic influence, supporting the conclusion that V. cholerae is autochthonous to the aquatic environment of Iceland.}, doi = {10.1111/j.1758-2229.2012.00332.x}, url = {http://doi.wiley.com/10.1111/j.1758-2229.2012.00332.x}, author = {Haley, Bradd J. and Chen, Arlene and Grim, Christopher J. and Clark, Philip and Diaz, Celia M and Taviani, Elisa and Hasan, Nur A. and Sancomb, Elizabeth and Elnemr, Wessam M and Islam, Muhammad A. and Huq, Anwar and Rita R Colwell and Benediktsd{\'o}ttir, Eva} } @conference {19317, title = {Linguistic Resources for Handwriting Recognition and Translation Evaluation}, booktitle = {Eight International Conference on Language Resources and Evaluation (LREC{\textquoteright}12)}, year = {2012}, author = {Song, Zhiyi and Ismael, Safa and Grimes, Stephen and David Doermann and Strassel,Stephanie} } @article {19275, title = {Mapping Parameterized Cyclo-static Dataflow Graphs onto Configurable Hardware}, journal = {Journal of Signal Processing Systems}, volume = {66}, year = {2012}, month = {2012}, pages = {285 - 301}, abstract = {In recent years, parameterized dataflow has evolved as a useful framework for modeling synchronous and cyclo-static graphs in which arbitrary parameters can be changed dynamically. Parameterized dataflow has proven to have significant expressive power for managing dynamics of DSP applications in important ways. However, efficient hardware synthesis techniques for parameterized dataflow representations are lacking. This paper addresses this void; specifically, the paper investigates efficient field programmable gate array (FPGA)-based implementation of parameterized cyclo-static dataflow (PCSDF) graphs. We develop a scheduling technique for throughput-constrained minimization of dataflow buffering requirements when mapping PCSDF representations of DSP applications onto FPGAs. The proposed scheduling technique is integrated with an existing formal schedule model, called the generalized schedule tree, to reduce schedule cost. To demonstrate our new, hardware-oriented PCSDF scheduling technique, we have designed a real-time base station emulator prototype based on a subset of long-term evolution (LTE), which is a key cellular standard.}, keywords = {4G communication systems, Circuits and Systems, Computer Imaging, Vision, Pattern Recognition and Graphics, Dataflow modeling, Electrical Engineering, FPGA implementation, Image Processing and Computer Vision, Parameterized dataflow, pattern recognition, scheduling, Signal, Image and Speech Processing}, isbn = {1939-8018, 1939-8115}, url = {http://link.springer.com/article/10.1007/s11265-011-0599-5}, author = {Kee, Hojin and Chung-Ching Shen and Bhattacharyya, Shuvra S. and Wong, Ian and Yong Rao and Kornerup, Jacob} } @article {17673, title = {Mobile Data Offloading through Opportunistic Communications and Social Participation}, journal = {Mobile Computing, IEEE Transactions on}, volume = {11}, year = {2012}, month = {2012/05//}, pages = {821 - 834}, abstract = {3G networks are currently overloaded, due to the increasing popularity of various applications for smartphones. Offloading mobile data traffic through opportunistic communications is a promising solution to partially solve this problem, because there is almost no monetary cost for it. We propose to exploit opportunistic communications to facilitate information dissemination in the emerging Mobile Social Networks (MoSoNets) and thus reduce the amount of mobile data traffic. As a case study, we investigate the target-set selection problem for information delivery. In particular, we study how to select the target set with only k users, such that we can minimize the mobile data traffic over cellular networks. We propose three algorithms, called Greedy, Heuristic, and Random, for this problem and evaluate their performance through an extensive trace-driven simulation study. Our simulation results verify the efficiency of these algorithms for both synthetic and real-world mobility traces. For example, the Heuristic algorithm can offload mobile data traffic by up to 73.66 percent for a real-world mobility trace. Moreover, to investigate the feasibility of opportunistic communications for mobile phones, we implement a proof-of-concept prototype, called Opp-off, on Nokia N900 smartphones, which utilizes their Bluetooth interface for device/service discovery and content transfer.}, keywords = {3G mobile communication, 3G networks, Bluetooth interface, cellular networks, cellular radio, content transfer, device/service discovery, graph theory, greedy algorithm, heuristic algorithm, information delivery, information dissemination, mobile data offloading, mobile data traffic, mobile phones, mobile social networks, MoSoNets, Nokia N900 smartphones, Opp-off, opportunistic communications, random algorithm, real-world mobility traces, smart phones, social networking (online), social participation, target-set selection problem, telecommunication network routing, Telecommunication traffic, trace-driven simulation study}, isbn = {1536-1233}, doi = {10.1109/TMC.2011.101}, author = {Han,Bo and Hui,Pan and Kumar,V. S.A and Marathe,M. V and Shao,Jianhua and Srinivasan, Aravind} } @conference {17630, title = {Networking lessons: From computers to water}, booktitle = {2012 Fourth International Conference on Communication Systems and Networks (COMSNETS)}, year = {2012}, month = {2012/01/03/7}, pages = {1 - 6}, publisher = {IEEE}, organization = {IEEE}, abstract = {As an instance of using IT to green non-IT domains, we consider the question whether lessons from computer networking can be applied in water distribution networks to improve their energy footprint and/or efficiency. Our contributions in this work are: (i) we identify several areas where principles from computer networking can be used to better water distribution; (ii) we focus on a specific infrastructure enhancement problem caused by increasing demands on a water utility network and present solutions (similar to those used in computer networks) that optimize both operational expenditure and total cost of ownership. We validate our solutions through simulations and compare their efficacy against techniques that are traditionally used in enhancing water networks. Our results show that lessons from computer networks can help in enhancing water networks.}, keywords = {Biological cells, computer networking, Computer networks, COMPUTERS, energy footprint, Genetic algorithms, green nonIT domains, infrastructure enhancement problem, Internet, network theory (graphs), networking lessons, planning, pricing, water distribution networks, water supply, water utility network}, isbn = {978-1-4673-0296-8}, doi = {10.1109/COMSNETS.2012.6151373}, author = {Narayanan,I. and Sarangan,V. and Vasan, A. and Srinivasan, Aravind and Sivasubramaniam,A.} } @article {12857, title = {Occurrence of protozoans \& their limnological relationships in some ponds of Mathbaria, Bangladesh}, journal = {University Journal of Zoology, Rajshahi University}, volume = {29}, year = {2012}, month = {2012///}, pages = {69 - 71}, isbn = {1023-6104}, url = {http://journals.sfu.ca/bd/index.php/UJZRU}, author = {Mozumder,P. K. and Banu,M. A. and Naser,M. N. and Ali,M. S. and Alam,M. and Sack,R. B. and Rita R Colwell and Huq,A.} } @conference {17641, title = {Optimizing epidemic protection for socially essential workers}, booktitle = {Proceedings of the 2nd ACM SIGHIT International Health Informatics Symposium}, series = {IHI {\textquoteright}12}, year = {2012}, month = {2012///}, pages = {31 - 40}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Public-health policy makers have many tools to mitigate an epidemic{\textquoteright}s effects. Most related research focuses on the direct effects on those infected (in terms of health, life, or productivity). Interventions including treatment, prophylaxis, quarantine, and social distancing are well studied in this context. These interventions do not address indirect effects due to the loss of critical services and infrastructures when too many of those responsible for their day-to-day operations fall ill. We examine, both analytically and through simulation, the protection of such essential subpopulations by sequestering them, effectively isolating them into groups during an epidemic. We develop a framework for studying the benefits of sequestering and heuristics for when to sequester. We also prove a key property of sequestering placement which helps partition the subpopulations optimally. Thus we provide a first step toward determining how to allocate resources between the direct protection of a population, and protection of those responsible for critical services.}, keywords = {epidemiology, OPTIMIZATION, public health informatics}, isbn = {978-1-4503-0781-9}, doi = {10.1145/2110363.2110371}, url = {http://doi.acm.org/10.1145/2110363.2110371}, author = {Barrett,Chris and Beckman,Richard and Bisset,Keith and Chen,Jiangzhuo and DuBois,Thomas and Eubank,Stephen and Kumar,V. S. Anil and Lewis,Bryan and Marathe,Madhav V. and Srinivasan, Aravind and Stretz,Paula E.} } @article {19038, title = {Path O-RAM: An Extremely Simple Oblivious RAM Protocol}, journal = {Arxiv preprint arXiv:1202.5150}, year = {2012}, month = {2012}, abstract = {We present Path O-RAM, an extremely simple Oblivious RAM protocol.}, keywords = {Computer Science - Cryptography and Security}, url = {http://arxiv.org/abs/1202.5150}, author = {Stefanov, Emil and Elaine Shi} } @article {19611, title = {Preserving Link Privacy in Social Network Based Systems}, journal = {arXiv:1208.6189 [cs]}, year = {2012}, note = {Comment: 16 pages, 15 figures}, month = {2012/08/30/}, abstract = {A growing body of research leverages social network based trust relationships to improve the functionality of the system. However, these systems expose users{\textquoteright} trust relationships, which is considered sensitive information in today{\textquoteright}s society, to an adversary. In this work, we make the following contributions. First, we propose an algorithm that perturbs the structure of a social graph in order to provide link privacy, at the cost of slight reduction in the utility of the social graph. Second we define general metrics for characterizing the utility and privacy of perturbed graphs. Third, we evaluate the utility and privacy of our proposed algorithm using real world social graphs. Finally, we demonstrate the applicability of our perturbation algorithm on a broad range of secure systems, including Sybil defenses and secure routing.}, keywords = {Computer Science - Cryptography and Security, Computer Science - Social and Information Networks}, url = {http://arxiv.org/abs/1208.6189}, author = {Mittal, Prateek and Charalampos Papamanthou and Song, Dawn} } @article {19254, title = {Prototyping scalable digital signal processing systems for radio astronomy using dataflow models}, journal = {Radio Science}, volume = {47}, year = {2012}, month = {2012}, pages = {n/a - n/a}, abstract = {There is a growing trend toward using high-level tools for design and implementation of radio astronomy digital signal processing (DSP) systems. Such tools, for example, those from the Collaboration for Astronomy Signal Processing and Electronics Research (CASPER), are usually platform-specific, and lack high-level, platform-independent, portable, scalable application specifications. This limits the designer{\textquoteright}s ability to experiment with designs at a high-level of abstraction and early in the development cycle. We address some of these issues using a model-based design approach employing dataflow models. We demonstrate this approach by applying it to the design of a tunable digital downconverter (TDD) used for narrow-bandwidth spectroscopy. Our design is targeted toward an FPGA platform, called theInterconnect Break-out Board (IBOB), that is available from the CASPER. We use the term TDD to refer to a digital downconverter for which the decimation factor and center frequency can be reconfigured without the need for regenerating the hardware code. Such a design is currently not available in the CASPER DSP library. The work presented in this paper focuses on two aspects. First, we introduce and demonstrate a dataflow-based design approach using thedataflow interchange format (DIF) tool for high-level application specification, and we integrate this approach with the CASPER tool flow. Secondly, we explore the trade-off between the flexibility of TDD designs and the low hardware cost of fixed-configuration digital downconverter (FDD) designs that use the available CASPER DSP library. We further explore this trade-off in the context of a two-stage downconversion scheme employing a combination of TDD or FDD designs.}, keywords = {dataflow models, digital downconverter, Digital signal processing, model-based design, radio astronomy, rapid prototyping}, isbn = {1944-799X}, url = {http://onlinelibrary.wiley.com/doi/10.1029/2011RS004924/abstract}, author = {Sane, N. and Ford, J. and Harris, A. I. and Bhattacharyya, Shuvra S.} } @article {19668, title = {Quantitative measurement of allele-specific protein expression in a diploid yeast hybrid by LC-MS}, journal = {Molecular Systems Biology}, volume = {8}, year = {2012}, month = {2012/01/01/}, abstract = {Understanding the genetic basis of gene regulatory variation is a key goal of evolutionary and medical genetics. Regulatory variation can act in an allele-specific manner (cis-acting) or it can affect both alleles of a gene (trans-acting). Differential allele-specific expression (ASE), in which the expression of one allele differs from another in a diploid, implies the presence of cis-acting regulatory variation. While microarrays and high-throughput sequencing have enabled genome-wide measurements of transcriptional ASE, methods for measurement of protein ASE (pASE) have lagged far behind. We describe a flexible, accurate, and scalable strategy for measurement of pASE by liquid chromatography-coupled mass spectrometry (LC-MS). We apply this approach to a hybrid between the yeast species Saccharomyces cerevisiae and Saccharomyces bayanus. Our results provide the first analysis of the relative contribution of cis-acting and trans-acting regulatory differences to protein expression divergence between yeast species.Synopsis A novel strategy for the quantitative measurement of allele-specific protein expression is used to infer the contributions of cis- and trans-acting factors influencing the divergence of protein levels between yeast species. Rigorous experimental controls and analyses confirm the accuracy of the new strategy for the quantitative measurement of allele-specific protein expression by high-throughput mass spectrometry.Analysis of allele-specific protein expression in an interspecies yeast hybrid and protein expression differences between species reveals that both cis-effects and trans-effects contribute to protein expression divergence between two yeast species, Saccharomyces cerevisiae and Saccharomyces bayanus. }, keywords = {allele specific, divergence, mass spectrometry, protein expression, proteomics}, url = {http://msb.embopress.org/content/8/1/602}, author = {Zia Khan and Bloom, Joshua S. and Amini, Sasan and Singh, Mona and Perlman, David H. and Caudy, Amy A. and Kruglyak, Leonid} } @article {16030, title = {Querying event sequences by exact match or similarity search: Design and empirical evaluation}, journal = {Interacting with Computers}, volume = {24}, year = {2012}, month = {2012/03//}, pages = {55 - 68}, abstract = {Specifying event sequence queries is challenging even for skilled computer professionals familiar with SQL. Most graphical user interfaces for database search use an exact match approach, which is often effective, but near misses may also be of interest. We describe a new similarity search interface, in which users specify a query by simply placing events on a blank timeline and retrieve a similarity-ranked list of results. Behind this user interface is a new similarity measure for event sequences which the users can customize by four decision criteria, enabling them to adjust the impact of missing, extra, or swapped events or the impact of time shifts. We describe a use case with Electronic Health Records based on our ongoing collaboration with hospital physicians. A controlled experiment with 18 participants compared exact match and similarity search interfaces. We report on the advantages and disadvantages of each interface and suggest a hybrid interface combining the best of both.}, keywords = {Event sequence, Similan, similarity measure, Similarity Search, temporal categorical data, Temporal query interface}, isbn = {0953-5438}, doi = {10.1016/j.intcom.2012.01.003}, url = {http://www.sciencedirect.com/science/article/pii/S0953543812000124}, author = {Wongsuphasawat,Krist and Plaisant, Catherine and Taieb-Maimon,Meirav and Shneiderman, Ben} } @article {20385, title = {Role of GbpA protein, an important virulence-related colonization factor, for Vibrio cholerae{\textquoteright}s survival in the aquatic environment}, journal = {Environmental Microbiology Reports}, year = {2012}, month = {Jan-08-2012}, pages = {439 - 445}, abstract = {Vibrio cholerae N-acetyl glucosamine-binding protein A (GbpA) is a chitin binding protein and a virulence factor involved in the colonization of human intestine. We investigated the distribution and genetic variations of gbpA in 488 V. cholerae strains of environmental and clinical origin, belonging to different serogroups and biotypes. We found that the gene is consistently present and highly conserved including an environmental V. cholerae-related strain of ancestral origin. The gene was also consistently expressed in a number of representative V. cholerae strains cultured in laboratory aquatic microcosms under conditions simulating those found in temperate marine environments. Functional analysis carried out on V. cholerae O1 El Tor N16961 showed that GbpA is not involved in adhesion to inorganic surfaces but promotes interaction with environmental biotic substrates (plankton and bivalve hepatopancreas cells) representing known marine reservoir or host for the bacterium. It is suggested that the ability of GbpA to colonize human intestinal cells most probably originated from its primary function in the aquatic environment.}, doi = {10.1111/j.1758-2229.2012.00356.x}, url = {http://doi.wiley.com/10.1111/j.1758-2229.2012.00356.x}, author = {Stauder, Monica and Huq, Anwar and Pezzati, Elisabetta and Grim, Christopher J. and Ramoino, Paola and Pane, Luigi and Rita R Colwell and Pruzzo, Carla and Vezzulli, Luigi} } @article {12855, title = {Role of Shrimp Chitin in the Ecology of Toxigenic Vibrio cholerae and Cholera Transmission}, journal = {Frontiers in Microbiology}, volume = {2:260}, year = {2012}, month = {01/2012}, abstract = {Seasonal plankton blooms correlate with occurrence of cholera in Bangladesh, although the mechanism of how dormant Vibrio cholerae, enduring interepidemic period in biofilms and plankton, initiates seasonal cholera is not fully understood. In this study, laboratory microcosms prepared with estuarine Mathbaria water (MW) samples supported active growth of toxigenic V. cholerae O1 up to 7 weeks as opposed to 6 months when microcosms were supplemented with dehydrated shrimp chitin chips (CC) as the single source of nutrient. Bacterial counting and detection of wbe and ctxA genes were done employing culture, direct fluorescent antibody (DFA) assay, and multiplex-polymerase chain reaction methods. In MW microcosm, the aqueous phase became clear as the non-culturable cells settled, whereas the aqueous phase of the MW{\textendash}CC microcosm became turbid from bacterial growth stimulated by chitin. Bacterial chitin degradation and biofilm formation proceeded from an initial steady state to a gradually declining bacterial culturable count. V. cholerae within the microenvironments of chitin and chitin-associated biofilms remained metabolically active even in a high acidic environment without losing either viability or virulence. It is concluded that the abundance of chitin that occurs during blooms plays an important role in the aquatic life cycle of V. cholerae and, ultimately, in the seasonal transmission of cholera.}, isbn = {1664-302X}, doi = {10.3389/fmicb.2011.00260}, author = {Nahar,Shamsun and Sultana,Marzia and Naser,M. Niamul and Nair,Gopinath B. and Watanabe,Haruo and Ohnishi,Makoto and Yamamoto,Shouji and Endtz,Hubert and Cravioto,Alejandro and Sack,R. Bradley and Hasan,Nur A. and Sadique,Abdus and Huq,Anwar and Rita R Colwell and Alam,Munirul} } @inbook {19644, title = {Securing Circuits against Constant-Rate Tampering}, booktitle = {Advances in Cryptology {\textendash} CRYPTO 2012}, series = {Lecture Notes in Computer Science}, year = {2012}, month = {2012/01/01/}, pages = {533 - 551}, publisher = {Springer Berlin Heidelberg}, organization = {Springer Berlin Heidelberg}, abstract = {We present a compiler that converts any circuit into one that remains secure even if a constant fraction of its wires are tampered with. Following the seminal work of Ishai et. al. (Eurocrypt 2006), we consider adversaries who may choose an arbitrary set of wires to corrupt, and may set each such wire to 0 or to 1, or may toggle with the wire. We prove that such adversaries, who continuously tamper with the circuit, can learn at most logarithmically many bits of secret information (in addition to black-box access to the circuit). Our results are information theoretic.}, keywords = {circuit compiler, Computer Communication Networks, computers and society, Data Encryption, Discrete Mathematics in Computer Science, Management of Computing and Information Systems, PCP of proximity, side-channel attacks, Systems and Data Security, tampering}, isbn = {978-3-642-32008-8, 978-3-642-32009-5}, url = {http://link.springer.com/chapter/10.1007/978-3-642-32009-5_31}, author = {Dana Dachman-Soled and Kalai, Yael Tauman}, editor = {Safavi-Naini, Reihaneh and Canetti, Ran} } @article {17515, title = {A Temporal Pattern Search Algorithm for Personal History Event Visualization}, journal = {Knowledge and Data Engineering, IEEE Transactions on}, volume = {24}, year = {2012}, month = {2012/05//}, pages = {799 - 812}, abstract = {We present Temporal Pattern Search (TPS), a novel algorithm for searching for temporal patterns of events in historical personal histories. The traditional method of searching for such patterns uses an automaton-based approach over a single array of events, sorted by time stamps. Instead, TPS operates on a set of arrays, where each array contains all events of the same type, sorted by time stamps. TPS searches for a particular item in the pattern using a binary search over the appropriate arrays. Although binary search is considerably more expensive per item, it allows TPS to skip many unnecessary events in personal histories. We show that TPS{\textquoteright}s running time is bounded by O(m2n lg(n)), where m is the length of (number of events) a search pattern, and n is the number of events in a record (history). Although the asymptotic running time of TPS is inferior to that of a nondeterministic finite automaton (NFA) approach (O(mn)), TPS performs better than NFA under our experimental conditions. We also show TPS is very competitive with Shift-And, a bit-parallel approach, with real data. Since the experimental conditions we describe here subsume the conditions under which analysts would typically use TPS (i.e., within an interactive visualization program), we argue that TPS is an appropriate design choice for us.}, keywords = {automaton-based approach, binary search, bit-parallel approach, data visualisation, electronic health records, event array, finite automata, interactive visualization program, Lifelines2 visualization tool, medical information systems, NFA approach, nondeterministic finite automaton, O(m2n lg(n)) problem, pattern matching, personal history event visualization, Shift-And approach, temporal pattern search algorithm, time stamp}, isbn = {1041-4347}, doi = {10.1109/TKDE.2010.257}, author = {Wang,T. D and Deshpande, Amol and Shneiderman, Ben} } @conference {16031, title = {Towards event sequence representation, reasoning and visualization for EHR data}, booktitle = {Proceedings of the 2nd ACM SIGHIT International Health Informatics Symposium}, series = {IHI {\textquoteright}12}, year = {2012}, month = {2012///}, pages = {801 - 806}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Efficient analysis of event sequences and the ability to answer time-related, clinically important questions can accelerate clinical research in several areas such as causality assessments, decision support systems, and retrospective studies. The Clinical Narrative Temporal Reasoning Ontology (CNTRO)-based system is designed for semantically representing, annotating, and inferring temporal relations and constraints for clinical events in Electronic Health Records (EHR) represented in both structured and unstructured ways. The LifeFlow system is designed to support an interactive exploration of event sequences using visualization techniques. The combination of the two systems will provide a comprehensive environment for users to visualize inferred temporal relationships from EHR data. This paper discusses our preliminary efforts on connecting the two systems and the benefits we envision from such an environment.}, keywords = {ehr, semantic web, temporal relation reasoning, time trend visualization}, isbn = {978-1-4503-0781-9}, doi = {10.1145/2110363.2110461}, url = {http://doi.acm.org/10.1145/2110363.2110461}, author = {Tao,Cui and Wongsuphasawat,Krist and Clark,Kimberly and Plaisant, Catherine and Shneiderman, Ben and Chute,Christopher G.} } @conference {19169, title = {When Does Simulated Data Match Real Data? Comparing Model Calibration Functions using Genetic Algorithms}, booktitle = {World Congress on Social Simulation (WCSS), Taipei, Taiwan}, year = {2012}, abstract = {Agent-based models can be manipulated to replicate real- world datasets, but choosing the best set of parameters to achieve this result can be difficult. To validate a model, the real-world dataset is often divided into a training and test set. The training set is used to calibrate the parameters and the test set is used to determine if the calibrated model represents the real-world data. The difference between the real-world data and the simulated data is determined using an error measure. When using an evolutionary computation technique to choose the parameters, this error measure becomes the fitness function, and choosing the appropriate measure becomes even more crucial for a successful calibration process. We survey the effect of five different error measures in the context of a toy problem and a real world problem (simulating on-line news consumption). We use each error measure in turn to calibrate on the training dataset, and then examine the results of all five error measures on both the training and testing datasets. For the toy problem, one measure was the Pareto-dominant choice for calibration, but no error measure dominated all the others for the real-world problem. }, author = {Stonedahl,Forrest and Rand, William} } @article {19717, title = {Whole genome analysis of Leptospira licerasiae provides insight into leptospiral evolution and pathogenicity.}, journal = {PLoS Negl Trop Dis}, volume = {6}, year = {2012}, month = {2012}, pages = {e1853}, abstract = {

The whole genome analysis of two strains of the first intermediately pathogenic leptospiral species to be sequenced (Leptospira licerasiae strains VAR010 and MMD0835) provides insight into their pathogenic potential and deepens our understanding of leptospiral evolution. Comparative analysis of eight leptospiral genomes shows the existence of a core leptospiral genome comprising 1547 genes and 452 conserved genes restricted to infectious species (including L. licerasiae) that are likely to be pathogenicity-related. Comparisons of the functional content of the genomes suggests that L. licerasiae retains several proteins related to nitrogen, amino acid and carbohydrate metabolism which might help to explain why these Leptospira grow well in artificial media compared with pathogenic species. L. licerasiae strains VAR010(T) and MMD0835 possess two prophage elements. While one element is circular and shares homology with LE1 of L. biflexa, the second is cryptic and homologous to a previously identified but unnamed region in L. interrogans serovars Copenhageni and Lai. We also report a unique O-antigen locus in L. licerasiae comprised of a 6-gene cluster that is unexpectedly short compared with L. interrogans in which analogous regions may include >90 such genes. Sequence homology searches suggest that these genes were acquired by lateral gene transfer (LGT). Furthermore, seven putative genomic islands ranging in size from 5 to 36 kb are present also suggestive of antecedent LGT. How Leptospira become naturally competent remains to be determined, but considering the phylogenetic origins of the genes comprising the O-antigen cluster and other putative laterally transferred genes, L. licerasiae must be able to exchange genetic material with non-invasive environmental bacteria. The data presented here demonstrate that L. licerasiae is genetically more closely related to pathogenic than to saprophytic Leptospira and provide insight into the genomic bases for its infectiousness and its unique antigenic characteristics.

}, keywords = {DNA, Bacterial, Evolution, Molecular, Gene Transfer, Horizontal, Genome, Bacterial, Genomic islands, HUMANS, Leptospira, Molecular Sequence Data, Multigene Family, Prophages, Sequence Analysis, DNA, Virulence factors}, issn = {1935-2735}, doi = {10.1371/journal.pntd.0001853}, author = {Ricaldi, Jessica N and Fouts, Derrick E and Jeremy D Selengut and Harkins, Derek M and Patra, Kailash P and Moreno, Angelo and Lehmann, Jason S and Purushe, Janaki and Sanka, Ravi and Torres, Michael and Webster, Nicholas J and Vinetz, Joseph M and Matthias, Michael A} } @conference {17746, title = {Abduction in Annotated Probabilistic Temporal Logic}, booktitle = {Technical Communications of the 27th International Conference on Logic Programming (ICLP{\textquoteright}11)}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, volume = {11}, year = {2011}, month = {2011///}, pages = {240 - 250}, publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}, organization = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}, abstract = {Annotated Probabilistic Temporal (APT) logic programs are a form of logic programs that allow users to state (or systems to automatically learn)rules of the form {\textquoteleft}{\textquoteleft}formula G becomes true K time units after formula F became true with L to U\% probability.{\textquoteright}{\textquoteright} In this paper, we develop a theory of abduction for APT logic programs. Specifically, given an APT logic program Pi, a set of formulas H that can be {\textquoteleft}{\textquoteleft}added{\textquoteright}{\textquoteright} to Pi, and a goal G, is there a subset S of H such that Pi \cup S is consistent and entails the goal G? In this paper, we study the complexity of the Basic APT Abduction Problem (BAAP). We then leverage a geometric characterization of BAAP to suggest a set of pruning strategies when solving BAAP and use these intuitions to develop a sound and complete algorithm.}, isbn = {978-3-939897-31-6}, doi = {http://dx.doi.org/10.4230/LIPIcs.ICLP.2011.240}, author = {Molinaro,Cristian and Sliva,Amy and V.S. Subrahmanian} } @article {19650, title = {Accurate proteome-wide protein quantification from high-resolution 15N mass spectra}, journal = {Genome Biology}, volume = {12}, year = {2011}, month = {2011/12/19/}, abstract = {In quantitative mass spectrometry-based proteomics, the metabolic incorporation of a single source of 15N-labeled nitrogen has many advantages over using stable isotope-labeled amino acids. However, the lack of a robust computational framework for analyzing the resulting spectra has impeded wide use of this approach. We have addressed this challenge by introducing a new computational methodology for analyzing 15N spectra in which quantification is integrated with identification. Application of this method to an Escherichia coli growth transition reveals significant improvement in quantification accuracy over previous methods.PMID: 22182234 }, isbn = {1465-6906}, url = {http://genomebiology.com/2011/12/12/R122/abstract}, author = {Zia Khan and Amini, Sasan and Bloom, Joshua S. and Ruse, Cristian and Caudy, Amy A. and Kruglyak, Leonid and Singh, Mona and Perlman, David H. and Tavazoie, Saeed} } @conference {14496, title = {Active Surveying: A Probabilistic Approach for Identifying Key Opinion Leaders}, booktitle = {Twenty-Second International Joint Conference on Artificial Intelligence}, year = {2011}, month = {2011///}, abstract = {Opinion leaders play an important role in influenc- ing people{\textquoteright}s beliefs, actions and behaviors. Al- though a number of methods have been proposed for identifying influentials using secondary sources of information, the use of primary sources, such as surveys, is still favored in many domains. In this work we present a new surveying method which combines secondary data with partial knowl- edge from primary sources to guide the information gathering process. We apply our proposed active surveying method to the problem of identifying key opinion leaders in the medical field, and show how we are able to accurately identify the opinion lead- ers while minimizing the amount of primary data required, which results in significant cost reduction in data acquisition without sacrificing its integrity.}, author = {Sharara,H. and Getoor, Lise and Norton,M.} } @conference {16815, title = {Adapting a map query interface for a gesturing touch screen interface}, booktitle = {Proceedings of the 20th international conference companion on World wide web}, series = {WWW {\textquoteright}11}, year = {2011}, month = {2011///}, pages = {257 - 260}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {NewsStand is an example application of a general framework that we are developing to enable searching for information using a map query interface, where the information results from monitoring the output of over 8,000 RSS news sources and is available for retrieval within minutes of publication. The user interface of NewsStand was recently adapted so that NewsStand can execute on mobile and tablet devices with a gesturing touch screen interface such as the iPhone, iPod Touch, and iPad. This action led to a discovery of some shortcomings of current mapping APIs as well as devising some interesting new widgets. These issues are discussed, and the realization can be seen by a demo at http://newsstand.umiacs.umd.edu on any of the above Apple devices as well as other devices that support gestures such as an Android phone.}, keywords = {map query interface, newsstand, touch screen gesturing interface}, isbn = {978-1-4503-0637-9}, doi = {10.1145/1963192.1963303}, url = {http://doi.acm.org/10.1145/1963192.1963303}, author = {Samet, Hanan and Teitler,Benjamin E. and Adelfio,Marco D. and Lieberman,Michael D.} } @article {17745, title = {Annotated probabilistic temporal logic}, journal = {ACM Trans. Comput. Logic}, volume = {12}, year = {2011}, month = {2011/01//}, pages = {14:1{\textendash}14:44 - 14:1{\textendash}14:44}, abstract = {The semantics of most logics of time and probability is given via a probability distribution over threads, where a thread is a structure specifying what will be true at different points in time (in the future). When assessing the probabilities of statements such as {\textquotedblleft}Event a will occur within 5 units of time of event b,{\textquotedblright} there are many different semantics possible, even when assessing the truth of this statement within a single thread. We introduce the syntax of annotated probabilistic temporal (APT) logic programs and axiomatically introduce the key notion of a frequency function (for the first time) to capture different types of intrathread reasoning, and then provide a semantics for intrathread and interthread reasoning in APT logic programs parameterized by such frequency functions. We develop a comprehensive set of complexity results for consistency checking and entailment in APT logic programs, together with sound and complete algorithms to check consistency and entailment. The basic algorithms use linear programming, but we then show how to substantially and correctly reduce the sizes of these linear programs to yield better computational properties. We describe a real world application we are developing using APT logic programs.}, keywords = {frequency functions, imprecise probabilities, Probabilistic and temporal reasoning, threads}, isbn = {1529-3785}, doi = {10.1145/1877714.1877720}, url = {http://doi.acm.org/10.1145/1877714.1877720}, author = {Shakarian,Paulo and Parker,Austin and Simari,Gerardo and V.S. Subrahmanian} } @conference {13423, title = {Ant Colony Optimization in a Changing Environment}, booktitle = {2011 AAAI Fall Symposium Series}, year = {2011}, month = {2011/03/11/}, abstract = {Ant colony optimization (ACO) algorithms are computational problem-solving methods that are inspired by the complex behaviors of ant colonies; specifically, the ways in which ants interact with each other and their environment to optimize the overall performance of the ant colony. Our eventual goal is to develop and experiment with ACO methods that can more effectively adapt to dynamically changing environments and problems. We describe biological ant systems and the dynamics of their environments and behaviors. We then introduce a family of dynamic ACO algorithms that can handle dynamic modifications of their inputs. We report empirical results, showing that dynamic ACO algorithms can effectively adapt to time-varying environments.}, url = {http://www.aaai.org/ocs/index.php/FSS/FSS11/paper/viewPaper/4223}, author = {Seymour,John Jefferson and Tuzo,Joseph and desJardins, Marie} } @conference {17564, title = {Approximation algorithms for throughput maximization in wireless networks with delay constraints}, booktitle = {2011 Proceedings IEEE INFOCOM}, year = {2011}, month = {2011/04/10/15}, pages = {1116 - 1124}, publisher = {IEEE}, organization = {IEEE}, abstract = {We study the problem of throughput maximization in multi-hop wireless networks with end-to-end delay constraints for each session. This problem has received much attention starting with the work of Grossglauser and Tse (2002), and it has been shown that there is a significant tradeoff between the end-to-end delays and the total achievable rate. We develop algorithms to compute such tradeoffs with provable performance guarantees for arbitrary instances, with general interference models. Given a target delay-bound Δ(c) for each session c, our algorithm gives a stable flow vector with a total throughput within a factor of O (logΔm/log log Δm) of the maximum, so that the per-session (end-to-end) delay is O ((logΔm/log log Δm Δ(c))2), where Δm = maxc{Δ(c)}; note that these bounds depend only on the delays, and not on the network size, and this is the first such result, to our knowledge.}, keywords = {Approximation algorithms, Approximation methods, approximation theory, Delay, delay constraints, delays, general interference model, Interference, multihop wireless networks, optimisation, Optimized production technology, radio networks, radiofrequency interference, target delay bound, Throughput, throughput maximization, Wireless networks}, isbn = {978-1-4244-9919-9}, doi = {10.1109/INFCOM.2011.5934887}, author = {Guanhong Pei and Anil Kumar,V. S and Parthasarathy,S. and Srinivasan, Aravind} } @article {18547, title = {Architecting for innovation}, journal = {SIGCOMM Comput. Commun. Rev.}, volume = {41}, year = {2011}, month = {2011///}, pages = {24 - 36}, abstract = {We argue that the biggest problem with the current Internet architecture is not a particular functional deficiency, but its inability to accommodate innovation. To address this problem we propose a minimal architectural "framework" in which comprehensive architectures can reside. The proposed Framework for Internet Innovation (FII) --- which is derived from the simple observation that network interfaces should be extensible and abstract --- allows for a diversity of architectures to coexist, communicate, and evolve. We demonstrate FII{\textquoteright}s ability to accommodate diversity and evolution with a detailed examination of how information flows through the architecture and with a skeleton implementation of the relevant interfaces.}, keywords = {diversity, Evolution, innovation, internet architecture}, isbn = {0146-4833}, doi = {10.1145/2002250.2002256}, url = {http://doi.acm.org/10.1145/2002250.2002256}, author = {Koponen,Teemu and Shenker,Scott and Balakrishnan,Hari and Feamster, Nick and Ganichev,Igor and Ghodsi,Ali and Godfrey,P. Brighten and McKeown,Nick and Parulkar,Guru and Raghavan,Barath and Rexford,Jennifer and Arianfar,Somaya and Kuptsov,Dmitriy} } @article {17566, title = {Article 28 (28 pages)-New Constructive Aspects of the Lov{\'a}sz Local Lemma}, journal = {Journal of the ACM-Association for ComputingMachinery}, volume = {58}, year = {2011}, month = {2011///}, author = {Haeupler,B. and Saha,B. and Srinivasan, Aravind} } @inbook {18819, title = {Automated Planning Logic Synthesis for Autonomous Unmanned Vehicles in Competitive Environments with Deceptive Adversaries}, booktitle = {New Horizons in Evolutionary Robotics}, series = {Studies in Computational Intelligence}, volume = {341}, year = {2011}, month = {2011///}, pages = {171 - 193}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {We developed a new approach for automated synthesis of a planning logic for autonomous unmanned vehicles. This new approach can be viewed as an automated iterative process during which an initial version of a logic is synthesized and then gradually improved by detecting and fixing its shortcomings. This is achieved by combining data mining for extraction of vehicle{\textquoteright}s states of failure and Genetic Programming (GP) technique for synthesis of corresponding navigation code. We verified the feasibility of the approach using unmanned surface vehicles (USVs) simulation. Our focus was specifically on the generation of a planning logic used for blocking the advancement of an intruder boat towards a valuable target. Developing autonomy logic for this behavior is challenging as the intruder{\textquoteright}s attacking logic is human-competitive with deceptive behavior so the USV is required to learn specific maneuvers for specific situations to do successful blocking. We compared the performance of the generated blocking logic to the performance of logic that was manually implemented. Our results show that the new approach was able to synthesize a blocking logic with performance closely approaching the performance of the logic coded by hand.}, keywords = {engineering}, isbn = {978-3-642-18271-6}, url = {http://www.springerlink.com/content/f454477212518671/abstract/}, author = {Svec,Petr and Gupta, Satyandra K.}, editor = {Doncieux,St{\'e}phane and Bred{\`e}che,Nicolas and Mouret,Jean-Baptiste} } @conference {13069, title = {AVSS 2011 demo session: A large-scale benchmark dataset for event recognition in surveillance video}, booktitle = {Advanced Video and Signal-Based Surveillance (AVSS), 2011 8th IEEE International Conference on}, year = {2011}, month = {2011/09/30/2}, pages = {527 - 528}, abstract = {We introduce to the surveillance community the VIRAT Video Dataset[1], which is a new large-scale surveillance video dataset designed to assess the performance of event recognition algorithms in realistic scenes1.}, doi = {10.1109/AVSS.2011.6027400}, author = {Oh,Sangmin and Hoogs,Anthony and Perera,Amitha and Cuntoor,Naresh and Chen,Chia-Chih and Lee,Jong Taek and Mukherjee,Saurajit and Aggarwal, JK and Lee,Hyungtae and Davis, Larry S. and Swears,Eran and Wang,Xiaoyang and Ji,Qiang and Reddy,Kishore and Shah,Mubarak and Vondrick,Carl and Pirsiavash,Hamed and Ramanan,Deva and Yuen,Jenny and Torralba,Antonio and Song,Bi and Fong,Anesco and Roy-Chowdhury,Amit and Desai,Mita} } @article {16247, title = {Bacillus Anthracis Comparative Genome Analysis in Support of the Amerithrax Investigation}, journal = {Proceedings of the National Academy of SciencesPNAS}, volume = {108}, year = {2011}, month = {2011/03/22/}, pages = {5027 - 5032}, abstract = {Before the anthrax letter attacks of 2001, the developing field of microbial forensics relied on microbial genotyping schemes based on a small portion of a genome sequence. Amerithrax, the investigation into the anthrax letter attacks, applied high-resolution whole-genome sequencing and comparative genomics to identify key genetic features of the letters{\textquoteright} Bacillus anthracis Ames strain. During systematic microbiological analysis of the spore material from the letters, we identified a number of morphological variants based on phenotypic characteristics and the ability to sporulate. The genomes of these morphological variants were sequenced and compared with that of the B. anthracis Ames ancestor, the progenitor of all B. anthracis Ames strains. Through comparative genomics, we identified four distinct loci with verifiable genetic mutations. Three of the four mutations could be directly linked to sporulation pathways in B. anthracis and more specifically to the regulation of the phosphorylation state of Spo0F, a key regulatory protein in the initiation of the sporulation cascade, thus linking phenotype to genotype. None of these variant genotypes were identified in single-colony environmental B. anthracis Ames isolates associated with the investigation. These genotypes were identified only in B. anthracis morphotypes isolated from the letters, indicating that the variants were not prevalent in the environment, not even the environments associated with the investigation. This study demonstrates the forensic value of systematic microbiological analysis combined with whole-genome sequencing and comparative genomics.}, isbn = {0027-8424, 1091-6490}, doi = {10.1073/pnas.1016657108}, url = {http://www.pnas.org/content/108/12/5027}, author = {Rasko,David A and Worsham,Patricia L and Abshire,Terry G and Stanley,Scott T and Bannan,Jason D and Wilson,Mark R and Langham,Richard J and Decker,R. Scott and Jiang,Lingxia and Read,Timothy D. and Phillippy,Adam M and Salzberg,Steven L. and Pop, Mihai and Van Ert,Matthew N and Kenefic,Leo J and Keim,Paul S and Fraser-Liggett,Claire M and Ravel,Jacques} } @conference {12435, title = {Blurring-invariant Riemannian metrics for comparing signals and images}, booktitle = {2011 IEEE International Conference on Computer Vision (ICCV)}, year = {2011}, month = {2011/11/06/13}, pages = {1770 - 1775}, publisher = {IEEE}, organization = {IEEE}, abstract = {We propose a novel Riemannian framework for comparing signals and images in a manner that is invariant to their levels of blur. This framework uses a log-Fourier representation of signals/images in which the set of all possible Gaussian blurs of a signal, i.e. its orbits under semigroup action of Gaussian blur functions, is a straight line. Using a set of Riemannian metrics under which the group actions are by isometries, the orbits are compared via distances between orbits. We demonstrate this framework using a number of experimental results involving 1D signals and 2D images.}, keywords = {blurring-invariant Riemannian metrics, Estimation, Fourier transforms, Gaussian blur function, Gaussian processes, image representation, log-Fourier representation, measurement, Orbits, Polynomials, signal representation, Space vehicles, vectors}, isbn = {978-1-4577-1101-5}, doi = {10.1109/ICCV.2011.6126442}, author = {Zhengwu Zhang and Klassen, E. and Srivastava, A. and Turaga,P. and Chellapa, Rama} } @article {18510, title = {Broadband internet performance: A view from the gateway}, journal = {SIGCOMM-Computer Communication Review}, volume = {41}, year = {2011}, month = {2011///}, pages = {134 - 134}, abstract = {We present the first study of network access link performance mea-sured directly from home gateway devices. Policymakers, ISPs, and users are increasingly interested in studying the performance of Internet access links. Because of many confounding factors in a home network or on end hosts, however, thoroughly understanding access network performance requires deploying measurement in- frastructure in users{\textquoteright} homes as gateway devices. In conjunction with the Federal Communication Commission{\textquoteright}s study of broad- band Internet access in the United States, we study the throughput and latency of network access links using longitudinal measure- ments from nearly 4,000 gateway devices across 8 ISPs from a de- ployment of over 4,200 devices. We study the performance users achieve and how various factors ranging from the user{\textquoteright}s choice of modem to the ISP{\textquoteright}s traffic shaping policies can affect performance. Our study yields many important findings about the characteristics of existing access networks. Our findings also provide insights into the ways that access network performance should be measured and presented to users, which can help inform ongoing broader efforts to benchmark the performance of access networks. }, author = {Sundaresan,S. and de Donato,W. and Feamster, Nick and Teixeira,R. and Crawford,S. and Pescap{\`e},A.} } @conference {14834, title = {Bypassing synthesis: PLS for face recognition with pose, low-resolution and sketch}, booktitle = {Computer Vision and Pattern Recognition (CVPR), 2011 IEEE Conference on}, year = {2011}, month = {2011/06//}, pages = {593 - 600}, abstract = {This paper presents a novel way to perform multi-modal face recognition. We use Partial Least Squares (PLS) to linearly map images in different modalities to a common linear subspace in which they are highly correlated. PLS has been previously used effectively for feature selection in face recognition. We show both theoretically and experimentally that PLS can be used effectively across modalities. We also formulate a generic intermediate subspace comparison framework for multi-modal recognition. Surprisingly, we achieve high performance using only pixel intensities as features. We experimentally demonstrate the highest published recognition rates on the pose variations in the PIE data set, and also show that PLS can be used to compare sketches to photos, and to compare images taken at different resolutions.}, keywords = {approximations;pose, COMPARISON, estimation;, extraction;image, framework;face, intensities;subspace, least, PLS;bypassing, recognition;feature, recognition;partial, resolution;least, selection;multimodal, squares, squares;pixel, synthesis;face}, doi = {10.1109/CVPR.2011.5995350}, author = {Sharma,A. and Jacobs, David W.} } @inbook {19628, title = {A Canonical Form for Testing Boolean Function Properties}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques}, series = {Lecture Notes in Computer Science}, year = {2011}, month = {2011/01/01/}, pages = {460 - 471}, publisher = {Springer Berlin Heidelberg}, organization = {Springer Berlin Heidelberg}, abstract = {In a well-known result Goldreich and Trevisan (2003) showed that every testable graph property has a {\textquotedblleft}canonical{\textquotedblright} tester in which a set of vertices is selected at random and the edges queried are the complete graph over the selected vertices. We define a similar-in-spirit canonical form for Boolean function testing algorithms, and show that under some mild conditions property testers for Boolean functions can be transformed into this canonical form. Our first main result shows, roughly speaking, that every {\textquotedblleft}nice{\textquotedblright} family of Boolean functions that has low noise sensitivity and is testable by an {\textquotedblleft}independent tester,{\textquotedblright} has a canonical testing algorithm. Our second main result is similar but holds instead for families of Boolean functions that are closed under ID-negative minors. Taken together, these two results cover almost all of the constant-query Boolean function testing algorithms that we know of in the literature, and show that all of these testing algorithms can be automatically converted into a canonical form.}, keywords = {Algorithm Analysis and Problem Complexity, Boolean functions, Computation by Abstract Devices, Computer Communication Networks, Computer Graphics, Data structures, Discrete Mathematics in Computer Science, property testing}, isbn = {978-3-642-22934-3, 978-3-642-22935-0}, url = {http://link.springer.com/chapter/10.1007/978-3-642-22935-0_39}, author = {Dana Dachman-Soled and Servedio, Rocco A.}, editor = {Goldberg, Leslie Ann and Jansen, Klaus and Ravi, R. and Rolim, Jos{\'e} D. P.} } @article {17571, title = {Capacity of wireless networks under SINR interference constraints}, journal = {Wireless Networks}, volume = {17}, year = {2011}, month = {2011///}, pages = {1605 - 1624}, abstract = {A fundamental problem in wireless networks is to estimate their throughput capacity{\textemdash}given a set of wireless nodes and a set of connections, what is the maximum rate at which data can be sent on these connections. Most of the research in this direction has focused either on random distributions of points, or has assumed simple graph-based models for wireless interference. In this paper, we study the capacity estimation problem using a realistic Signal to Interference Plus Noise Ratio (SINR) model for interference, on arbitrary wireless networks without any assumptions on node distributions. The problem becomes much more challenging for this setting, because of the non-locality of the SINR model. Recent work by Moscibroda et al. (IEEE INFOCOM 2006, ACM MobiHoc 2006) has shown that the throughput achieved by using SINR models can differ significantly from that obtained by using graph-based models. In this work, we develop polynomial time algorithms to provably approximate the throughput capacity of wireless network under the SINR model.}, isbn = {1022-0038}, url = {http://dx.doi.org/10.1007/s11276-011-0367-2}, author = {Chafekar,Deepti and Anil Kumar,V. and Marathe,Madhav and Parthasarathy,Srinivasan and Srinivasan, Aravind} } @conference {13080, title = {A case for query by image and text content: searching computer help using screenshots and keywords}, booktitle = {Proceedings of the 20th international conference on World wide web}, series = {WWW {\textquoteright}11}, year = {2011}, month = {2011///}, pages = {775 - 784}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {The multimedia information retrieval community has dedicated extensive research effort to the problem of content-based image retrieval (CBIR). However, these systems find their main limitation in the difficulty of creating pictorial queries. As a result, few systems offer the option of querying by visual examples, and rely on automatic concept detection and tagging techniques to provide support for searching visual content using textual queries. This paper proposes and studies a practical multimodal web search scenario, where CBIR fits intuitively to improve the retrieval of rich information queries. Many online articles contain useful know-how knowledge about computer applications. These articles tend to be richly illustrated by screenshots. We present a system to search for such software know-how articles that leverages the visual correspondences between screenshots. Users can naturally create pictorial queries simply by taking a screenshot of the application to retrieve a list of articles containing a matching screenshot. We build a prototype comprising 150k articles that are classified into walkthrough, book, gallery, and general categories, and provide a comprehensive evaluation of this system, focusing on technical (accuracy of CBIR techniques) and usability (perceived system usefulness) aspects. We also consider the study of added value features of such a visual-supported search, including the ability to perform cross-lingual queries. We find that the system is able to retrieve matching screenshots for a wide variety of programs, across language boundaries, and provide subjectively more useful results than keyword-based web and image search engines.}, keywords = {content-based image retrieval, multimodal search, online help}, isbn = {978-1-4503-0632-4}, doi = {10.1145/1963405.1963513}, url = {http://doi.acm.org/10.1145/1963405.1963513}, author = {Tom Yeh and White,Brandyn and San Pedro,Jose and Katz,Boriz and Davis, Larry S.} } @conference {18328, title = {A case for query by image and text content: searching computer help using screenshots and keywords}, booktitle = {Proceedings of the 20th international conference on World wide web}, series = {WWW {\textquoteright}11}, year = {2011}, month = {2011///}, pages = {775 - 784}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {The multimedia information retrieval community has dedicated extensive research effort to the problem of content-based image retrieval (CBIR). However, these systems find their main limitation in the difficulty of creating pictorial queries. As a result, few systems offer the option of querying by visual examples, and rely on automatic concept detection and tagging techniques to provide support for searching visual content using textual queries.This paper proposes and studies a practical multimodal web search scenario, where CBIR fits intuitively to improve the retrieval of rich information queries. Many online articles contain useful know-how knowledge about computer applications. These articles tend to be richly illustrated by screenshots. We present a system to search for such software know-how articles that leverages the visual correspondences between screenshots. Users can naturally create pictorial queries simply by taking a screenshot of the application to retrieve a list of articles containing a matching screenshot. We build a prototype comprising 150k articles that are classified into walkthrough, book, gallery, and general categories, and provide a comprehensive evaluation of this system, focusing on technical (accuracy of CBIR techniques) and usability (perceived system usefulness) aspects. We also consider the study of added value features of such a visual-supported search, including the ability to perform cross-lingual queries. We find that the system is able to retrieve matching screenshots for a wide variety of programs, across language boundaries, and provide subjectively more useful results than keyword-based web and image search engines. }, keywords = {content-based image retrieval, multimodal search, online help}, isbn = {978-1-4503-0632-4}, doi = {10.1145/1963405.1963513}, url = {http://doi.acm.org/10.1145/1963405.1963513}, author = {Tom Yeh and White,Brandyn and San Pedro,Jose and Katz,Boriz and Davis, Larry S.} } @article {18795, title = {A Case Study in Optimization of Gait and Physical Parameters for a Snake-Inspired Robot Based on a Rectilinear Gait}, journal = {Journal of mechanisms and robotics}, volume = {3}, year = {2011}, month = {2011///}, abstract = {Physical parameters of the constituent modules and gait parameters affect the overall performance of snake-inspired robots. Hence, a system-level optimization model needs to concurrently optimize the module parameters and the gait. Incorporating a physics-based model of rectilinear gaits in the system-level optimization model is a computationally challenging problem. This paper presents a case study to illustrate how metamodels of the precomputed optimal rectilinear gaits can be utilized to reduce the complexity of the system-level optimization model. An example is presented to illustrate the importance of concurrently optimizing the module parameters and the gait to obtain the optimal performance for a given mission.}, isbn = {1942-4302}, url = {http://cat.inist.fr/?aModele=afficheN\&cpsidt=23978760}, author = {Hopkins,James K. and Spranklin,Brent W. and Gupta, Satyandra K.} } @article {19369, title = {Cell cycle dependent TN-C promoter activity determined by live cell imaging.}, journal = {Cytometry. Part A : the journal of the International Society for Analytical Cytology}, volume = {79}, year = {2011}, month = {2011 Mar}, pages = {192-202}, abstract = {The extracellular matrix protein tenascin-C plays a critical role in development, wound healing, and cancer progression, but how it is controlled and how it exerts its physiological responses remain unclear. By quantifying the behavior of live cells with phase contrast and fluorescence microscopy, the dynamic regulation of TN-C promoter activity is examined. We employ an NIH 3T3 cell line stably transfected with the TN-C promoter ligated to the gene sequence for destabilized green fluorescent protein (GFP). Fully automated image analysis routines, validated by comparison with data derived from manual segmentation and tracking of single cells, are used to quantify changes in the cellular GFP in hundreds of individual cells throughout their cell cycle during live cell imaging experiments lasting 62 h. We find that individual cells vary substantially in their expression patterns over the cell cycle, but that on average TN-C promoter activity increases during the last 40\% of the cell cycle. We also find that the increase in promoter activity is proportional to the activity earlier in the cell cycle. This work illustrates the application of live cell microscopy and automated image analysis of a promoter-driven GFP reporter cell line to identify subtle gene regulatory mechanisms that are difficult to uncover using population averaged measurements.}, keywords = {Animals, cell cycle, Gene Expression Regulation, Green Fluorescent Proteins, Image Processing, Computer-Assisted, Mice, Microscopy, Fluorescence, Microscopy, Phase-Contrast, NIH 3T3 Cells, Promoter Regions, Genetic, Tenascin}, issn = {1552-4930}, doi = {10.1002/cyto.a.21028}, author = {Halter, Michael and Sisan, Daniel R and Chalfoun, Joe and Stottrup, Benjamin L and Cardone, Antonio and Dima,Alden A. and Tona, Alessandro and Plant,Anne L. and Elliott, John T} } @conference {18667, title = {Characterizing Attackers and Attacks: An Empirical Study}, year = {2011}, month = {2011/12//}, pages = {174 - 183}, abstract = {This paper describes an empirical research study to characterize attackers and attacks against targets of opportunity. A honey net infrastructure was built and deployed over 167 days that leveraged three different honey pot configurations and a SSH-based authentication proxy to attract and follow attackers over several weeks. A total of 211 attack sessions were recorded and evidence was collected at each stage of the attack sequence: from discovery to intrusion and exploitation of rogue software. This study makes two important contributions: 1) we introduce a new approach to measure attacker skills, and 2) we leverage keystroke profile analysis to differentiate attackers beyond their IP address of origin.}, keywords = {attack sessions, attacker characterization, attacker skill measurement, honey net infrastructure, honey pot configurations, IP address, keystroke profile analysis, opportunity target, rogue software exploitation, security of data, SSH-based authentication proxy}, doi = {10.1109/PRDC.2011.29}, author = {Salles-Loustau,G. and Berthier,R. and Collange,E. and Sobesto,B. and Michel Cukier} } @article {17011, title = {Claiming success, charting the future: micro-HCI and macro-HCI}, journal = {Interactions}, volume = {18}, year = {2011}, month = {2011///}, pages = {10 - 11}, author = {Shneiderman, Ben} } @article {18557, title = {Communicating with caps: managing usage caps in home networks}, journal = {ACM SIGCOMM Computer Communication Review}, volume = {41}, year = {2011}, month = {2011/08//}, pages = {470 - 471}, abstract = {As Internet service providers increasingly implement and impose "usage caps", consumers need better ways to help them understand and control how devices in the home use up the available network resources or available capacity. Towards this goal, we will demonstrate a system that allows users to monitor and manage their usage caps. The system uses the BISMark firmware running on network gateways to collect usage statistics and report them to a logically centralized controller, which displays usage information. The controller allows users to specify policies about how different people, devices, and applications should consume the usage cap; it implements and enforces these policies via a secure OpenFlow control channel to each gateway device. The demonstration will show various use cases, such as limiting the usage of a particular application, visualizing usage statistics, and allowing users within a single household to "trade" caps with one another.}, keywords = {home network, openflow, usage cap}, isbn = {0146-4833}, doi = {10.1145/2043164.2018526}, url = {http://doi.acm.org/10.1145/2043164.2018526}, author = {Kim,Hyojoon and Sundaresan,Srikanth and Marshini Chetty and Feamster, Nick and Edwards,W. Keith} } @article {19442, title = {Communicating with Caps: Managing Usage Caps in Home Networks}, journal = {SIGCOMM Comput. Commun. Rev.}, volume = {41}, year = {2011}, month = {2011/08//}, pages = {470 - 471}, abstract = {As Internet service providers increasingly implement and impose "usage caps", consumers need better ways to help them understand and control how devices in the home use up the available network resources or available capacity. Towards this goal, we will demonstrate a system that allows users to monitor and manage their usage caps. The system uses the BISMark firmware running on network gateways to collect usage statistics and report them to a logically centralized controller, which displays usage information. The controller allows users to specify policies about how different people, devices, and applications should consume the usage cap; it implements and enforces these policies via a secure OpenFlow control channel to each gateway device. The demonstration will show various use cases, such as limiting the usage of a particular application, visualizing usage statistics, and allowing users within a single household to "trade" caps with one another.}, keywords = {home network, openflow, usage cap}, isbn = {0146-4833}, url = {http://doi.acm.org/10.1145/2043164.2018526}, author = {Kim, Hyojoon and Sundaresan, Srikanth and Marshini Chetty and Feamster, Nick and Edwards, W. Keith} } @article {19647, title = {A computational statistics approach for estimating the spatial range of morphogen gradients}, journal = {Development}, volume = {138}, year = {2011}, month = {2011/11/15/}, pages = {4867 - 4874}, abstract = {A crucial issue in studies of morphogen gradients relates to their range: the distance over which they can act as direct regulators of cell signaling, gene expression and cell differentiation. To address this, we present a straightforward statistical framework that can be used in multiple developmental systems. We illustrate the developed approach by providing a point estimate and confidence interval for the spatial range of the graded distribution of nuclear Dorsal, a transcription factor that controls the dorsoventral pattern of the Drosophila embryo.}, keywords = {Computational Biology, Confidence interval, Dorsal gradient, Drosophila embryo, Morphogen gradient, Statistics}, isbn = {0950-1991, 1477-9129}, url = {http://dev.biologists.org/content/138/22/4867}, author = {Kanodia, Jitendra S. and Kim, Yoosik and Tomer, Raju and Zia Khan and Chung, Kwanghun and Storey, John D. and Lu, Hang and Keller, Philipp J. and Shvartsman, Stanislav Y.} } @article {15280, title = {A cost-aggregating integer linear program for motif finding}, journal = {Journal of Discrete Algorithms}, volume = {9}, year = {2011}, month = {2011/12//}, pages = {326 - 334}, abstract = {In the motif finding problem one seeks a set of mutually similar substrings within a collection of biological sequences. This is an important and widely-studied problem, as such shared motifs in DNA often correspond to regulatory elements. We study a combinatorial framework where the goal is to find substrings of a given length such that the sum of their pairwise distances is minimized. We describe a novel integer linear program for the problem, which uses the fact that distances between substrings come from a limited set of possibilities allowing for aggregate consideration of sequence position pairs with the same distances. We show how to tighten its linear programming relaxation by adding an exponential set of constraints and give an efficient separation algorithm that can find violated constraints, thereby showing that the tightened linear program can still be solved in polynomial time. We apply our approach to find optimal solutions for the motif finding problem and show that it is effective in practice in uncovering known transcription factor binding sites.}, keywords = {Computational Biology, Integer linear programming, Sequence motif finding}, isbn = {1570-8667}, doi = {10.1016/j.jda.2011.04.001}, url = {http://www.sciencedirect.com/science/article/pii/S157086671100044X}, author = {Kingsford, Carl and Zaslavsky,Elena and Singh,Mona} } @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} } @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.} } @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 {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} } @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 {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.} } @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.} } @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.} } @article {13432, title = {EAAI-10: The First Symposium on Educational Advances in Artificial Intelligence}, journal = {AI Magazine}, volume = {32}, year = {2011}, month = {2011/04/18/}, pages = {91 - 91}, keywords = {education, AI, symposium}, isbn = {0738-4602}, doi = {10.1609/aimag.v32i1.2323}, url = {http://www.aaai.org/ojs/index.php/aimagazine/article/view/2323}, author = {desJardins, Marie and Sahami,Mehran and Wagstaff,Kiri} } @conference {13433, title = {Educational advances in artificial intelligence}, booktitle = {Proceedings of the 42nd ACM technical symposium on Computer science education}, series = {SIGCSE {\textquoteright}11}, year = {2011}, month = {2011///}, pages = {81 - 82}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {In 2010 a new annual symposium on Educational Advances in Artificial Intelligence (EAAI) was launched as part of the AAAI annual meeting. The event was held in cooperation with ACM SIGCSE and has many similar goals related to broadening and disseminating work in computer science education. EAAI has a particular focus, however, as the event is specific to educational work in Artificial Intelligence and collocated with a major research conference (AAAI) to promote more interaction between researchers and educators in that domain. This panel seeks to introduce participants to EAAI as a way of fostering more interaction between educational communities in computing. Specifically, the panel will discuss the goals of EAAI, provide an overview of the kinds of work presented at the symposium, and identify potential synergies between that EAAI and SIGCSE as a way of better linking the two communities going forward.}, keywords = {artificial intelligence education, model AI assignments}, isbn = {978-1-4503-0500-6}, doi = {10.1145/1953163.1953189}, url = {http://doi.acm.org/10.1145/1953163.1953189}, author = {Sahami,Mehran and desJardins, Marie and Dodds,Zachary and Neller,Todd} } @conference {19022, title = {Efficient and secure threshold-based event validation for vanets}, year = {2011}, month = {2011}, abstract = {Determining whether the number of vehicles reporting anevent is above a threshold is an important mechanism for VANETs, because many applications rely on a threshold number of notifications to reach agreement among vehicles, to determine the validity of an event, or to prevent the abuse of emergency alarms. We present the first efficient and se- cure threshold-based event validation protocol for VANETs. Quite counter-intuitively, we found that the z-smallest ap- proach offers the best tradeoff between security and effi- ciency since other approaches perform better for probabilis- tic counting. Analysis and simulation shows that our pro- tocol provides > 99\% accuracy despite the presence of at- tackers, collection and distribution of alerts in less than 1 second, and negligible impact on network performance. }, url = {http://www.eecs.berkeley.edu/~elaines/docs/hsiao_wisec2011.pdf}, author = {Hsiao, H. C. and Studer, A. and Dubey, R. and Elaine Shi and Perrig, A.} } @article {15113, title = {Efficient Secure Computation with Garbled Circuits}, journal = {Information Systems Security}, year = {2011}, month = {2011///}, pages = {28 - 48}, abstract = {Secure two-party computation enables applications in which participants compute the output of a function that depends on their private inputs, without revealing those inputs or relying on any trusted third party. In this paper, we show the potential of building privacy-preserving applications using garbled circuits, a generic technique that until recently was believed to be too inefficient to scale to realistic problems. We present a Java-based framework that uses pipelining and circuit-level optimizations to build efficient and scalable privacy-preserving applications. Although the standard garbled circuit protocol assumes a very week, honest-but-curious adversary, techniques are available for converting such protocols to resist stronger adversaries, including fully malicious adversaries. We summarize approaches to producing malicious-resistant secure computations that reduce the costs of transforming a protocol to be secure against stronger adversaries. In addition, we summarize results on ensuring fairness, the property that either both parties receive the result or neither party does. Several open problems remain, but as theory and pragmatism advance, secure computation is approaching the point where it offers practical solutions for a wide variety of important problems.}, doi = {10.1007/978-3-642-25560-1_2}, author = {Huang,Y. and Shen,C. and Evans,D. and Katz, Jonathan and Shelat,A.} } @article {17128, title = {Electronic medical records: usability challenges and opportunities}, journal = {Interactions}, volume = {18}, year = {2011}, month = {2011///}, pages = {48 - 49}, author = {Hochheiser,H. and Shneiderman, Ben} } @article {14608, title = {Epigenomic and RNA structural correlates of polyadenylation}, journal = {RNA Biology}, volume = {8}, year = {2011}, month = {2011/05/01/}, pages = {529 - 537}, abstract = {Polyadenylation (poly(A)) of mRNA plays a critical role in regulating gene expression. Identifying the sequence, structural, and epigenomic determinants of poly(A) site usage is an important long term goal. Several cis elements that mediate poly(A) regulation have been identified. Highly used poly(A) sites are also known to have a greater nucleosome occupancy in the immediate downstream. However, a detailed exploration of additional epigenomic and mRNA structural correlates of poly(A) site usage has not been reported. Importantly, functional interaction between sequence, structure, and the epigenome in determining the poly(A) site usage is not known. We show that highly used poly(A) sites are positively associated with an mRNA structure that is energetically more favorable and one that better exposes a critical polyadenylation cis element. In exploring potential interplay between RNA and chromatin structure, we found that a stronger nucleosome occupancy downstream of poly(A) site strongly correlated with (1) a more favorable mRNA structure, and (2) a greater accumulation of RNA Polymerase II (PolII) at the poly(A) site. Further analysis suggested a causal relationship pointing from PolII accumulation to a stable RNA structure. Additionally, we found that distinct patterns of histone modifications characterize poly(A) sites and these epigenetic patterns alone can distinguish true poly(A) sites with ~76\% accuracy and also discriminate between high and low usage poly(A) sites with ~74\% accuracy. Our results suggest a causative link between chromatin structure and mRNA structure whereby a compacted chromatin downstream of the poly(A) site slows down the elongating transcript, thus facilitating the folding of nascent mRNA in a favorable structure at poly(A) site during transcription. Additionally we report hitherto unknown epigenomic correlates for poly(A) site usage.}, isbn = {1547-6286}, doi = {10.4161/rna.8.3.15194}, url = {http://www.landesbioscience.com/journals/rnabiology/article/15194/}, author = {Khaladkar,Mugdha and Smyda,Mark and Hannenhalli, Sridhar} } @article {12448, title = {ON THE ESTIMATION OF 3D HUMAN BODY MODELS AND POSE FROM MULTIPLE CAMERAS}, journal = {EMERGING TOPICS IN COMPUTER VISION AND ITS APPLICATIONS}, year = {2011}, month = {2011/09//undefin}, pages = {3 - 25}, abstract = {We present a completely automatic algorithm for initializing and tracking the articulated motion of humans using image sequences obtained from multiple cameras. We discuss the challenges in solving this problem and compare our work to some of the state of the art techniques today. We use a detailed articulated human body model composed of sixteen rigid segments that allows both translation and rotation at joints. Voxel data of the subject obtained from the images is segmented into the different articulated chains using Laplacian Eigenmaps. The segmented chains are registered in a subset of the frames using a single-frame registration technique and subsequently used to initialize the pose in the sequence. A temporal registration method is then used to identify the partially segmented or unregistered articulated chains in the remaining frames in the sequence. The tracker uses motion cues such as pixel displacement as well as 2D and 3D shape cues such as silhouettes, motion residues and skeleton curves. The use of complementary cues in the tracking algorithm alleviates the twin problems of drift and convergence to incorrect solutions. The use of multiple cameras also allows us to deal with the problems due to self-occlusion and kinematic singularity. We present tracking results on sequences with different kinds of motion to illustrate the effectiveness of our approach.}, author = {Sundaresan, A. and Chellapa, Rama} } @article {14690, title = {Evaluating Dynamic Software Update Safety Using Systematic Testing}, journal = {IEEE Transactions on Software Engineering}, volume = {PP}, year = {2011}, pages = {1 - 1}, abstract = {Dynamic software updating (DSU) systems patch programs on the fly without incurring downtime. To avoid failures due to the updating process itself, many DSU systems employ timing restrictions. However, timing restrictions are theoretically imperfect, and their practical effectiveness is an open question. This paper presents the first significant empirical evaluation of three popular timing restrictions: activeness safety (AS), which prevents updates to active functions; con-freeness safety (CFS), which only allows modifications to active functions when doing so is provably type-safe; and manual identification of the event-handling loops during which an update may occur. We evaluated these timing restrictions using a series of DSU patches to three programs: OpenSSH, vsftpd, and ngIRCd. We systematically applied updates at each distinct update point reached during execution of a suite of system tests for these programs to determine which updates pass and which fail. We found that all three timing restrictions prevented most failures, but only manual identification allowed none. Further, although CFS and AS allowed many more update points, manual identification still supported updates with minimal delay. Finally, we found that manual identification required the least developer effort. Overall, we conclude that manual identification is most effective.}, keywords = {and serviceability, Availability, Computer Systems Organization, Delay, Manuals, Performance of Systems, reliability, Safety, servers, software, software engineering, Test execution, Testing and Debugging}, isbn = {0098-5589}, doi = {10.1109/TSE.2011.101}, author = {Hayden,C. and Smith,E. and Hardisty,E. and Hicks, Michael W. and Foster, Jeffrey S.} } @conference {13766, title = {Evaluating visual and statistical exploration of scientific literature networks}, booktitle = {2011 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC)}, year = {2011}, month = {2011/09/18/22}, pages = {217 - 224}, publisher = {IEEE}, organization = {IEEE}, abstract = {Action Science Explorer (ASE) is a tool designed to support users in rapidly generating readily consumable summaries of academic literature. It uses citation network visualization, ranking and filtering papers by network statistics, and automatic clustering and summarization techniques. We describe how early formative evaluations of ASE led to a mature system evaluation, consisting of an in-depth empirical evaluation with four domain experts. The evaluation tasks were of two types: predefined tasks to test system performance in common scenarios, and user-defined tasks to test the system{\textquoteright}s usefulness for custom exploration goals. The primary contribution of this paper is a validation of the ASE design and recommendations to provide: easy-to-understand metrics for ranking and filtering documents, user control over which document sets to explore, and overviews of the document set in coordinated views along with details-on-demand of specific papers. We contribute a taxonomy of features for literature search and exploration tools and describe exploration goals identified by our participants.}, keywords = {abstracting, academic literature, action science explorer, automatic clustering, citation analysis, citation network visualization, Communities, Context, custom exploration goal, Data visualization, Databases, Document filtering, document handling, document ranking, easy-to-understand metrics, empirical evaluation, Google, Graphical user interfaces, Information filtering, Information Visualization, Libraries, literature exploration, network statistics, paper filtering, paper ranking, scientific literature network, statistical exploration, summarization technique, user-defined tasks, visual exploration, Visualization}, isbn = {978-1-4577-1246-3}, doi = {10.1109/VLHCC.2011.6070403}, author = {Gove,R. and Dunne,C. and Shneiderman, Ben and Klavans,J. and Dorr, Bonnie J} } @conference {17144, title = {EventGraphs: Charting Collections of Conference Connections}, booktitle = {2011 44th Hawaii International Conference on System Sciences (HICSS)}, year = {2011}, month = {2011/01/04/7}, pages = {1 - 10}, publisher = {IEEE}, organization = {IEEE}, abstract = {EventGraphs are social media network diagrams of conversations related to events, such as conferences. Many conferences now communicate a common "hashtag" or keyword to identify messages related to the event. EventGraphs help make sense of the collections of connections that form when people follow, reply or mention one another and a keyword. This paper defines EventGraphs, characterizes different types, and shows how the social media network analysis add-in NodeXL supports their creation and analysis. The structural patterns to look for in EventGraphs are highlighted and design ideas for their improvement are discussed.}, keywords = {conference connections, Conferences, Data visualization, EventGraphs, hashtag, measurement, Media, message identification, multimedia computing, NodeXL, Real time systems, social media network diagrams, social networking (online), Twitter}, isbn = {978-1-4244-9618-1}, doi = {10.1109/HICSS.2011.196}, author = {Hansen,D. and Smith,M. A and Shneiderman, Ben} } @article {14691, title = {Evolution in Action: Using Active Networking to Evolve Network Support for Mobility}, journal = {IFIP Lecture Notes in Computer Science (LNCS)}, volume = {2546}, year = {2011}, month = {2011///}, pages = {146 - 161}, abstract = {key early objective of Active Networking (AN) was to support on-the-fly network evolution. Although AN has been used relatively extensively to build application-customized protocols and even whole networking systems, demonstrations of evolution have been limited.}, author = {Hicks, Michael W. and Nettles,S. and Seong-Kyu,S. and Shannon,S.} } @conference {18210, title = {Exploring compression effects for improved source camera identification using strongly compressed video}, booktitle = {Image Processing (ICIP), 2011 18th IEEE International Conference on}, year = {2011}, month = {2011/09//}, pages = {1953 - 1956}, abstract = {This paper presents a study of the video compression effect on source camera identification based on the Photo-Response Non-Uniformity (PRNU). Specifically, the reliability of different types of frames in a compressed video is first investigated, which shows quantitatively that I-frames are more reliable than P-frames for PRNU estimation. Motivated by this observation, a new mechanism for estimating the reference PRNU and two mechanisms for estimating the test-video PRNU are proposed to achieve higher accuracy with fewer frames used. Experiments are performed to validate the effectiveness of the proposed mechanisms.}, keywords = {camera, cameras;video, coding;, compression;computer, compression;video, estimation;photoresponse, forensics;data, identification;video, non-uniformity;reliability;source, PRNU}, doi = {10.1109/ICIP.2011.6115855}, author = {Chuang,Wei-Hong and Su,Hui and M. Wu} } @article {16037, title = {Extracting Insights from Electronic Health Records: Case Studies, a Visual Analytics Process Model, and Design Recommendations}, journal = {Journal of Medical Systems}, volume = {35}, year = {2011}, month = {2011///}, pages = {1135 - 1152}, abstract = {Current electronic health record (EHR) systems facilitate the storage, retrieval, persistence, and sharing of patient data. However, the way physicians interact with EHRs has not changed much. More specifically, support for temporal analysis of a large number of EHRs has been lacking. A number of information visualization techniques have been proposed to alleviate this problem. Unfortunately, due to their limited application to a single case study, the results are often difficult to generalize across medical scenarios. We present the usage data of Lifelines2 (Wang et al. 2008 ), our information visualization system, and user comments, both collected over eight different medical case studies. We generalize our experience into a visual analytics process model for multiple EHRs. Based on our analysis, we make seven design recommendations to information visualization tools to explore EHR systems.}, isbn = {0148-5598}, url = {http://dx.doi.org/10.1007/s10916-011-9718-x}, author = {Wang,Taowei and Wongsuphasawat,Krist and Plaisant, Catherine and Shneiderman, Ben} } @inbook {12459, title = {Face Detection}, booktitle = {Visual Analysis of HumansVisual Analysis of Humans}, year = {2011}, month = {2011///}, pages = {71 - 90}, publisher = {Springer London}, organization = {Springer London}, abstract = {Face detection in still images and videos has been extensively studied over the last two decades. Attributed to the recent proliferation of cameras in consumer applications, research in face detection has gradually transformed into more unconstrained settings, with the goal of achieving performance close to humans. This presents two main challenges: (i) in addition to modeling the facial characteristics, understanding the information portrayed by the surrounding scene is important in resolving visual ambiguities, and (ii) the computational time needed for decision making should be compatible for real-time applications, since detection is primarily a front-end process on which additional knowledge extraction is built upon. This chapter begins with a review of recent work in modeling face-specific information, including appearance-based methods used by sliding window classifiers, concepts from learning and local interest-point descriptors, and then focuses on representing the contextual information shared by faces with the surrounding scene. To provide better understanding of working concepts, we discuss a method for learning the semantic context shared by the face with other human body parts that facilitates reasoning under occlusion, and then present an image representation which efficiently encodes contour information to enable fast detection of faces. We conclude the chapter by discussing some existing challenges.}, isbn = {978-0-85729-997-0}, url = {http://dx.doi.org/10.1007/978-0-85729-997-0_5}, author = {Gopalan,Raghuraman and Schwartz,William R. and Chellapa, Rama and Srivastava,Ankur}, editor = {Moeslund,Thomas B. and Hilton,Adrian and Kr{\"u}ger,Volker and Sigal,Leonid} } @article {14155, title = {Fast solvers for models of ICEO microfluidic flows}, journal = {International Journal for Numerical Methods in Fluids}, volume = {65}, year = {2011}, month = {2011///}, pages = {383 - 404}, author = {Shuttleworth, R. R and Elman, Howard and Long, K. R and Templeton, J. A} } @conference {17175, title = {From slacktivism to activism: participatory culture in the age of social media}, booktitle = {Proceedings of the 2011 annual conference extended abstracts on Human factors in computing systems}, series = {CHI EA {\textquoteright}11}, year = {2011}, month = {2011///}, pages = {819 - 822}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Social networking sites (e.g. Facebook), microblogging services (e.g. Twitter), and content-sharing sites (e.g. YouTube and Flickr) have introduced the opportunity for wide-scale, online social participation. Visibility of national and international priorities such as public health, political unrest, disaster relief, and climate change has increased, yet we know little about the benefits - and possible costs - of engaging in social activism via social media. These powerful social issues introduce a need for scientific research into technology mediated social participation. What are the actual, tangible benefits of "greening" Twitter profile pictures in support of the Iranian elections? Does cartooning a Facebook profile picture really raise awareness of child abuse? Are there unintended negative effects through low-risk, low-cost technology-mediated participation? And, is there a difference - in both outcome and engagement level - between different types of online social activism? This SIG will investigate technology mediated social participation through a critical lens, discussing both the potential positive and negative outcomes of such participation. Approaches to designing for increased participation, evaluating effects of participation, and next steps in scientific research directions will be discussed.}, keywords = {activism, change, design, participation, slacktivism, social media}, isbn = {978-1-4503-0268-5}, doi = {10.1145/1979742.1979543}, url = {http://doi.acm.org/10.1145/1979742.1979543}, author = {Rotman,Dana and Vieweg,Sarah and Yardi,Sarita and Chi,Ed and Preece,Jenny and Shneiderman, Ben and Pirolli,Peter and Glaisyer,Tom} } @article {14613, title = {Gene Coexpression Network Topology of Cardiac Development, Hypertrophy, and FailureClinical Perspective}, journal = {Circulation: Cardiovascular GeneticsCirc Cardiovasc Genet}, volume = {4}, year = {2011}, month = {2011/02/01/}, pages = {26 - 35}, abstract = {Background{\textemdash} Network analysis techniques allow a more accurate reflection of underlying systems biology to be realized than traditional unidimensional molecular biology approaches. Using gene coexpression network analysis, we define the gene expression network topology of cardiac hypertrophy and failure and the extent of recapitulation of fetal gene expression programs in failing and hypertrophied adult myocardium.Methods and Results{\textemdash} We assembled all myocardial transcript data in the Gene Expression Omnibus (n=1617). Because hierarchical analysis revealed species had primacy over disease clustering, we focused this analysis on the most complete (murine) dataset (n=478). Using gene coexpression network analysis, we derived functional modules, regulatory mediators, and higher-order topological relationships between genes and identified 50 gene coexpression modules in developing myocardium that were not present in normal adult tissue. We found that known gene expression markers of myocardial adaptation were members of upregulated modules but not hub genes. We identified ZIC2 as a novel transcription factor associated with coexpression modules common to developing and failing myocardium. Of 50 fetal gene coexpression modules, 3 (6\%) were reproduced in hypertrophied myocardium and 7 (14\%) were reproduced in failing myocardium. One fetal module was common to both failing and hypertrophied myocardium. Conclusions{\textemdash} Network modeling allows systems analysis of cardiovascular development and disease. Although we did not find evidence for a global coordinated program of fetal gene expression in adult myocardial adaptation, our analysis revealed specific gene expression modules active during both development and disease and specific candidates for their regulation. }, keywords = {fetal, Gene expression, heart failure, hypertrophy, myocardium}, isbn = {1942-325X, 1942-3268}, doi = {10.1161/CIRCGENETICS.110.941757}, url = {http://circgenetics.ahajournals.org/content/4/1/26}, author = {Dewey,Frederick E and Perez,Marco V and Wheeler,Matthew T and Watt,Clifton and Spin,Joshua and Langfelder,Peter and Horvath,Steve and Hannenhalli, Sridhar and Cappola,Thomas P. and Ashley,Euan A} } @article {14619, title = {Genome-Wide Survey of Natural Selection on Functional, Structural, and Network Properties of Polymorphic Sites in Saccharomyces Paradoxus}, journal = {Molecular Biology and EvolutionMol Biol Evol}, volume = {28}, year = {2011}, month = {2011/09/01/}, pages = {2615 - 2627}, abstract = {Background. To characterize the genetic basis of phenotypic evolution, numerous studies have identified individual genes that have likely evolved under natural selection. However, phenotypic changes may represent the cumulative effect of similar evolutionary forces acting on functionally related groups of genes. Phylogenetic analyses of divergent yeast species have identified functional groups of genes that have evolved at significantly different rates, suggestive of differential selection on the functional properties. However, due to environmental heterogeneity over long evolutionary timescales, selection operating within a single lineage may be dramatically different, and it is not detectable via interspecific comparisons alone. Moreover, interspecific studies typically quantify selection on protein-coding regions using the Dn/Ds ratio, which cannot be extended easily to study selection on noncoding regions or synonymous sites. The population genetic-based analysis of selection operating within a single lineage ameliorates these limitations. Findings. We investigated selection on several properties associated with genes, promoters, or polymorphic sites, by analyzing the derived allele frequency spectrum of single nucleotide polymorphisms (SNPs) in 28 strains of Saccharomyces paradoxus. We found evidence for significant differential selection between many functionally relevant categories of SNPs, underscoring the utility of function-centric approaches for discovering signatures of natural selection. When comparable, our findings are largely consistent with previous studies based on interspecific comparisons, with one notable exception: our study finds that mutations from an ancient amino acid to a relatively new amino acid are selectively disfavored, whereas interspecific comparisons have found selection against ancient amino acids. Several of our findings have not been addressed through prior interspecific studies: we find that synonymous mutations from preferred to unpreferred codons are selected against and that synonymous SNPs in the linker regions of proteins are relatively less constrained than those within protein domains. Conclusions. We present the first global survey of selection acting on various functional properties in S. paradoxus. We found that selection pressures previously detected over long evolutionary timescales have also shaped the evolution of S. paradoxus. Importantly, we also make novel discoveries untenable via conventional interspecific analyses.}, keywords = {derived allele frequency, Evolution, natural selection, yeast}, isbn = {0737-4038, 1537-1719}, doi = {10.1093/molbev/msr085}, url = {http://mbe.oxfordjournals.org/content/28/9/2615}, author = {Vishnoi,Anchal and Sethupathy,Praveen and Simola,Daniel and Plotkin,Joshua B. and Hannenhalli, Sridhar} } @conference {14497, title = {G-PARE: A visual analytic tool for comparative analysis of uncertain graphs}, booktitle = {Visual Analytics Science and Technology (VAST), 2011 IEEE Conference on}, year = {2011}, month = {2011///}, pages = {61 - 70}, author = {Sharara,H. and Sopan,A. and Namata,G. and Getoor, Lise and Singh,L.} } @article {17180, title = {Graph Analytics-Lessons Learned and Challenges Ahead}, volume = {31}, year = {2011}, month = {2011///}, pages = {18 - 29}, abstract = {Graph analytics is one of the most influential and important R\&D topics in the visual analytics community. Researchers with diverse backgrounds from information visualization, human-computer interaction, computer graphics, graph drawing, and data mining have pursued graph analytics from scientific, technical, and social approaches. These studies have addressed both distinct and common challenges. Past successes and mistakes can provide valuable lessons for revising the research agenda. In this article, six researchers from four academic and research institutes identify graph analytics{\textquoteright} fundamental challenges and present both insightful lessons learned from their experience and good practices in graph analytics research. The goal is to critically assess those lessons and shed light on how they can stimulate research and draw attention to grand challenges for graph analytics. The article also establishes principles that could lead to measurable standards and criteria for research.}, keywords = {citation analysis, citespace, Computer Graphics, document analysis, graphics and multimedia, greengrid, jigsaw system, modeling, power grid analysis, semantic substrates, simulation, social networks, text analysis, Visualization}, isbn = {0272-1716}, author = {Wong,Pak Chung and Chen,Chaomei and Gorg,Carsten and Shneiderman, Ben and Stasko,John and Thomas,Jim} } @conference {17181, title = {Group-in-a-Box Layout for Multi-faceted Analysis of Communities}, booktitle = {Privacy, Security, Risk and Trust (PASSAT), 2011 IEEE Third International Conference on and 2011 IEEE Third International Confernece on Social Computing (SocialCom)}, year = {2011}, month = {2011/10/09/11}, pages = {354 - 361}, publisher = {IEEE}, organization = {IEEE}, abstract = {Communities in social networks emerge from interactions among individuals and can be analyzed through a combination of clustering and graph layout algorithms. These approaches result in 2D or 3D visualizations of clustered graphs, with groups of vertices representing individuals that form a community. However, in many instances the vertices have attributes that divide individuals into distinct categories such as gender, profession, geographic location, and similar. It is often important to investigate what categories of individuals comprise each community and vice-versa, how the community structures associate the individuals from the same category. Currently, there are no effective methods for analyzing both the community structure and the category-based partitions of social graphs. We propose Group-In-a-Box (GIB), a meta-layout for clustered graphs that enables multi-faceted analysis of networks. It uses the tree map space filling technique to display each graph cluster or category group within its own box, sized according to the number of vertices therein. GIB optimizes visualization of the network sub-graphs, providing a semantic substrate for category-based and cluster-based partitions of social graphs. We illustrate the application of GIB to multi-faceted analysis of real social networks and discuss desirable properties of GIB using synthetic datasets.}, keywords = {Algorithm design and analysis, category based social graph partitions, clustered graphs, clustering, Clustering algorithms, Communities, data visualisation, force-directed, gender, geographic location, graph layout algorithms, graph theory, group-in-a-box, group-in-a-box layout, Image edge detection, Layout, meta-layout, multifaceted community analysis, network subgraph visualization, network visualization, pattern clustering, profession, semantic substrates, Social network services, social networking (online), social networks, treemap space filling technique, Visualization}, isbn = {978-1-4577-1931-8}, doi = {10.1109/PASSAT/SocialCom.2011.139}, author = {Rodrigues,E.M. and Milic-Frayling,N. and Smith,M. and Shneiderman, Ben and Hansen,D.} } @article {16273, title = {Hawkeye and AMOS: Visualizing and Assessing the Quality of Genome Assemblies}, journal = {Briefings in Bioinformatics}, year = {2011}, month = {2011/12/23/}, abstract = {Since its launch in 2004, the open-source AMOS project has released several innovative DNA sequence analysis applications including: Hawkeye, a visual analytics tool for inspecting the structure of genome assemblies; the Assembly Forensics and FRCurve pipelines for systematically evaluating the quality of a genome assembly; and AMOScmp, the first comparative genome assembler. These applications have been used to assemble and analyze dozens of genomes ranging in complexity from simple microbial species through mammalian genomes. Recent efforts have been focused on enhancing support for new data characteristics brought on by second- and now third-generation sequencing. This review describes the major components of AMOS in light of these challenges, with an emphasis on methods for assessing assembly quality and the visual analytics capabilities of Hawkeye. These interactive graphical aspects are essential for navigating and understanding the complexities of a genome assembly, from the overall genome structure down to individual bases. Hawkeye and AMOS are available open source at http://amos.sourceforge.net.}, keywords = {assembly forensics, DNA Sequencing, genome assembly, visual analytics}, isbn = {1467-5463, 1477-4054}, doi = {10.1093/bib/bbr074}, url = {http://bib.oxfordjournals.org/content/early/2011/12/23/bib.bbr074}, author = {Schatz,Michael C and Phillippy,Adam M and Sommer,Daniel D and Delcher,Arthur L. and Puiu,Daniela and Narzisi,Giuseppe and Salzberg,Steven L. and Pop, Mihai} } @conference {17184, title = {HCI for peace: from idealism to concrete steps}, booktitle = {PART 2 {\textemdash}{\textemdash}{\textemdash}{\textendash} Proceedings of the 2011 annual conference extended abstracts on Human factors in computing systems}, series = {CHI EA {\textquoteright}11}, year = {2011}, month = {2011///}, pages = {613 - 616}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {This panel will contribute diverse perspectives on the use of computer technology to promote peace and prevent armed conflict. These perspectives include: the use of social media to promote democracy and citizen participation, the role of computers in helping people communicate across division lines in zones of conflict, how persuasive technology can promote peace, and how interaction design can play a role in post-conflict reconciliation.}, keywords = {cyprus, peace, persuasive technology, post-conflict reconciliation, social media, value sensitive design, war}, doi = {10.1145/1979482.1979493}, url = {http://doi.acm.org/10.1145/1979482.1979493}, author = {Hourcade,Juan Pablo and Bullock-Rest,Natasha E. and Friedman,Batya and Nelson,Mark and Shneiderman, Ben and Zaphiris,Panayiotis} } @conference {19452, title = {Helping Users Shop for ISPs with Internet Nutrition Labels}, booktitle = {ACM SIGCOMM Workshop on Home Networks {\textquoteright}11}, series = {HomeNets {\textquoteright}11}, year = {2011}, month = {2011///}, pages = {13 - 18}, publisher = {ACM}, organization = {ACM}, abstract = {When purchasing home broadband access from Internet service providers (ISPs), users must decide which service plans are most appropriate for their needs. Today, ISPs advertise their available service plans using only generic upload and download speeds. Unfortunately, these metrics do not always accurately reflect the varying performance that home users will experience for a wide range of applications. In this paper, we propose that each ISP service plan carry a "nutrition label" that conveys more comprehensive information about network metrics along many dimensions, including various aspects of throughput, latency, loss rate, and jitter. We first justify why these metrics should form the basis of a network nutrition label. Then, we demonstrate that current plans that are superficially similar with respect to advertised download rates may have different performance according to the label metrics. We close with a discussion of the challenges involved in presenting a nutrition label to users in a way that is both accurate and easy to understand.}, keywords = {access networks, benchmarking, bismark, broadband networks, gateway measurements}, isbn = {978-1-4503-0798-7}, url = {http://doi.acm.org/10.1145/2018567.2018571}, author = {Sundaresan, Srikanth and Feamster, Nick and Teixeira, Renata and Tang, Anthony and Edwards, W. Keith and Grinter, Rebecca E. and Marshini Chetty and de Donato, Walter} } @inbook {19277, title = {Heterogeneous Design in Functional DIF}, booktitle = {Transactions on High-Performance Embedded Architectures and Compilers IV}, series = {Lecture Notes in Computer Science}, year = {2011}, month = {2011}, pages = {391 - 408}, publisher = {Springer Berlin Heidelberg}, organization = {Springer Berlin Heidelberg}, abstract = {Dataflow formalisms have provided designers of digital signal processing (DSP) systems with analysis and optimizations for many years. As system complexity increases, designers are relying on more types of dataflow models to describe applications while retaining these implementation benefits. The semantic range of DSP-oriented dataflow models has expanded to cover heterogeneous models and dynamic applications, but efficient design, simulation, and scheduling of such applications has not. To facilitate implementing heterogeneous applications, we utilize a new dataflow model of computation and show how actors designed in other dataflow models are directly supported by this framework, allowing system designers to immediately compose and simulate actors from different models. Using examples, we show how this approach can be applied to quickly describe and functionally simulate a heterogeneous dataflow-based application such that a designer may analyze and tune trade-offs among different models and schedules for simulation time, memory consumption, and schedule size.}, keywords = {Arithmetic and Logic Structures, Computer Communication Networks, Dataflow, heterogeneous, Input/Output and Data Communications, Logic Design, Processor Architectures, Programming Languages, Compilers, Interpreters, Signal processing}, isbn = {978-3-642-24567-1, 978-3-642-24568-8}, url = {http://link.springer.com/chapter/10.1007/978-3-642-24568-8_20}, author = {Plishker,William and Sane, Nimish and Kiemb, Mary and Bhattacharyya, Shuvra S.}, editor = {Stenstr{\"o}m, Per} } @inbook {12456, title = {Image and Video-Based Biometrics}, booktitle = {Visual Analysis of HumansVisual Analysis of Humans}, year = {2011}, month = {2011///}, pages = {437 - 454}, publisher = {Springer London}, organization = {Springer London}, abstract = {Biometrics deals with the problem of identifying individuals based on physiological or behavioral characteristics. Since many physical characteristics, such as face, iris, etc., and behavioral characteristics, such as voice, expression, etc., are unique to an individual, biometric analysis offers a reliable and natural solution to the problem of identity verification. In this chapter, we discuss image and video-based biometrics involving face, iris and gait. In particular, we discuss several recent approaches to physiological biometrics based on Sparse Representations and Compressed Sensing. Some of the most compelling challenges and issues that confront research in biometrics are also addressed.}, isbn = {978-0-85729-997-0}, url = {http://dx.doi.org/10.1007/978-0-85729-997-0_22}, author = {Patel, Vishal M. and Pillai,Jaishanker K. and Chellapa, Rama}, editor = {Moeslund,Thomas B. and Hilton,Adrian and Kr{\"u}ger,Volker and Sigal,Leonid} } @conference {13073, title = {Image ranking and retrieval based on multi-attribute queries}, booktitle = {Computer Vision and Pattern Recognition (CVPR), 2011 IEEE Conference on}, year = {2011}, month = {2011/06//}, pages = {801 - 808}, abstract = {We propose a novel approach for ranking and retrieval of images based on multi-attribute queries. Existing image retrieval methods train separate classifiers for each word and heuristically combine their outputs for retrieving multiword queries. Moreover, these approaches also ignore the interdependencies among the query terms. In contrast, we propose a principled approach for multi-attribute retrieval which explicitly models the correlations that are present between the attributes. Given a multi-attribute query, we also utilize other attributes in the vocabulary which are not present in the query, for ranking/retrieval. Furthermore, we integrate ranking and retrieval within the same formulation, by posing them as structured prediction problems. Extensive experimental evaluation on the Labeled Faces in the Wild(LFW), FaceTracer and PASCAL VOC datasets show that our approach significantly outperforms several state-of-the-art ranking and retrieval methods.}, keywords = {datasets;image, datasets;PASCAL, faces, FaceTracer, in, methods;labeled, queries;image, ranking;image, retrieval, retrieval;, the, VOC, wild;multiattribute}, doi = {10.1109/CVPR.2011.5995329}, author = {Siddiquie,B. and Feris,R.S. and Davis, Larry S.} } @inbook {19034, title = {Implicit Authentication through Learning User Behavior}, booktitle = {Information Security}, series = {Lecture Notes in Computer Science}, volume = {6531}, year = {2011}, month = {2011}, pages = {99 - 113}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {Users are increasingly dependent on mobile devices. However, current authentication methods like password entry are significantly more frustrating and difficult to perform on these devices, leading users to create and reuse shorter passwords and pins, or no authentication at all. We present implicit authentication - authenticating users based on behavior patterns. We describe our model for performing implicit authentication and assess our techniques using more than two weeks of collected data from over 50 subjects.}, keywords = {Computer science}, isbn = {978-3-642-18177-1}, url = {http://www.springerlink.com/content/m57u551u3133475m/abstract/}, author = {Elaine Shi and Niu, Yuan and Jakobsson, Markus and Chow, Richard}, editor = {Burmester, Mike and Tsudik, Gene and Magliveras, Spyros and Ilic, Ivana} } @article {12866, title = {The Importance of Chitin in the Marine Environment}, journal = {Marine Biotechnology}, year = {2011}, month = {2011///}, pages = {1 - 8}, abstract = {Chitin is the most abundant renewable polymer in the oceans and is an important source of carbon and nitrogen for marine organisms. The process of chitin degradation is a key step in the cycling of nutrients in the oceans and chitinolytic bacteria play a significant role in this process. These bacteria are autochthonous to both marine and freshwater ecosystems and produce chitinases that degrade chitin, an insoluble polysaccharide, to a biologically useful form. In this brief review, a description of the structure of chitin and diversity of chitinolytic bacteria in the oceans is provided, in the context of the significance of chitin degradation for marine life.}, doi = {10.1007/s10126-011-9388-1}, author = {Souza,C. P. and Almeida,B. C. and Rita R Colwell and Rivera,I. N. G.} } @article {15177, title = {Impossibility of blind signatures from one-way permutations}, journal = {Theory of Cryptography}, year = {2011}, month = {2011///}, pages = {615 - 629}, abstract = {A seminal result in cryptography is that signature schemes can be constructed (in a black-box fashion) from any one-way function. The minimal assumptions needed to construct blind signature schemes, however, have remained unclear. Here, we rule out black-box constructions of blind signature schemes from one-way functions. In fact, we rule out constructions even from a random permutation oracle, and our results hold even for blind signature schemes for 1-bit messages that achieve security only against honest-but-curious behavior.}, doi = {10.1007/978-3-642-19571-6_37}, author = {Katz, Jonathan and Schr{\"o}der,D. and Yerukhimovich,A.} } @article {16043, title = {Improved Identification and Visualization of Emergency Department Patient Visits}, journal = {Annals of Emergency Medicine}, volume = {58}, year = {2011}, month = {2011///}, pages = {S309 - S309}, author = {Hettinger,AZ and Rackoff,A. and Wongsuphasawat,K. and Cheng,H. and Fairbanks,RJ and Plaisant, Catherine and Smith,M. S} } @article {14353, title = {Improving Classifier Performance by Autonomously Collecting Background Knowledge from the Web}, journal = {2011 10th International Conference on Machine Learning and Applications Workshops}, year = {2011}, month = {2011///}, pages = {1 - 6}, abstract = {Many websites allow users to tag data items to makethem easier to find. In this paper we consider the problem of classifying tagged data according to user-specified interests. We present an approach for aggregating background knowledge from the Web to improve the performance of a classier. In previous work, researchers have developed technology for extracting knowledge, in the form of relational tables, from semi- structured websites. In this paper we integrate this extraction technology with generic machine learning algorithms, showing that knowledge extracted from the Web can significantly benefit the learning process. Specifically, the knowledge can lead to better generalizations, reduce the number of samples required for supervised learning, and eliminate the need to retrain the system when the environment changes. We validate the approach with an application that classifies tagged Fickr data. }, author = {Minton,S.N. and Michelson,M. and See,K. and Macskassy,S. and Gazen,B.C. and Getoor, Lise} } @article {16814, title = {An incremental Hausdorff distance calculation algorithm}, journal = {Proceedings of the VLDB Endowment}, volume = {4}, year = {2011}, month = {2011/05//}, pages = {506 - 517}, abstract = {The Hausdorff distance is commonly used as a similarity measure between two point sets. Using this measure, a set X is considered similar to Y iff every point in X is close to at least one point in Y. Formally, the Hausdorff distance HausDist(X, Y) can be computed as the Max-Min distance from X to Y, i.e., find the maximum of the distance from an element in X to its nearest neighbor (NN) in Y. Although this is similar to the closest pair and farthest pair problems, computing the Hausdorff distance is a more challenging problem since its Max-Min nature involves both maximization and minimization rather than just one or the other. A traditional approach to computing HausDist(X, Y) performs a linear scan over X and utilizes an index to help compute the NN in Y for each x in X. We present a pair of basic solutions that avoid scanning X by applying the concept of aggregate NN search to searching for the element in X that yields the Hausdorff distance. In addition, we propose a novel method which incrementally explores the indexes of the two sets X and Y simultaneously. As an example application of our techniques, we use the Hausdorff distance as a measure of similarity between two trajectories (represented as point sets). We also use this example application to compare the performance of our proposed method with the traditional approach and the basic solutions. Experimental results show that our proposed method outperforms all competitors by one order of magnitude in terms of the tree traversal cost and total response time.}, isbn = {2150-8097}, url = {http://dl.acm.org/citation.cfm?id=2002974.2002978}, author = {Nutanong,Sarana and Jacox,Edwin H. and Samet, Hanan} } @article {16032, title = {Information Visualization: State of the Field and New Research Directions}, journal = {Information VisualizationInformation Visualization}, volume = {10}, year = {2011}, month = {2011/10/01/}, pages = {269 - 270}, isbn = {1473-8716, 1473-8724}, doi = {10.1177/1473871611418138}, url = {http://ivi.sagepub.com/content/10/4/269}, author = {Kerren,Andreas and Plaisant, Catherine and Stasko,John T} } @article {12867, title = {Interaction of Vibrio cholerae non-O1/non-O139 with Copepods, Cladocerans and Competing Bacteria in the Large Alkaline Lake Neusiedler See, Austria}, journal = {Microbial ecology}, volume = {61}, year = {2011}, month = {2011///}, pages = {496 - 506}, abstract = {Vibrio cholerae is a human pathogen and natural inhabitant of aquatic environments. Serogroups O1/O139 have been associated with epidemic cholera, while non-O1/non-O139 serogroups usually cause human disease other than classical cholera. V. cholerae non-O1/non-O139 from the Neusiedler See, a large Central European lake, have caused ear and wound infections, including one case of fatal septicaemia. Recent investigations demonstrated rapid planktonic growth of V. cholerae non-O1/non-O139 and correlation with zooplankton biomass. The aim of this study was to elucidate the interaction of autochthonous V. cholerae with two dominant crustacean zooplankton species in the lake and investigate the influence of the natural bacterial community on this interaction. An existing data set was evaluated for statistical relationships between zooplankton species and V. cholerae and co-culture experiments were performed in the laboratory. A new fluorescence in situ hybridisation protocol was applied for quantification of V. cholerae non-O1/non-O139 cells, which significantly reduced analysis time. The experiments clearly demonstrated a significant relationship of autochthonous V. cholerae non-O1/non-O139 with cladocerans by promoting growth of V. cholerae non-O1/non-O139 in the water and on the surfaces of the cladocerans. In contrast, copepods had a negative effect on the growth of V. cholerae non-O1/non-O139 via competing bacteria from their surfaces. Thus, beside other known factors, biofilm formation by V. cholerae on crustacean zooplankton appears to be zooplankton taxon specific and may be controlled by the natural bacterial community.}, doi = {10.1007/s00248-010-9764-9}, author = {Kirschner,A. K. T. and Schauer,S. and Steinberger,B. and Wilhartitz,I. and Grim,C. J. and Huq,A. and Rita R Colwell and Herzig,A. and Sommer,R.} } @article {19689, title = {Interactive topic modeling}, year = {2011}, month = {2011/00/19}, pages = {248 - 257}, publisher = {Association for Computational Linguistics}, abstract = {Abstract Topic models have been used extensively as a tool for corpus exploration, and a cottage industry has developed to tweak topic models to better encode human intuitions or to better model data. However, creating such extensions requires expertise in machine ...}, url = {http://dl.acm.org/citation.cfm?id=2002472.2002505}, author = {Hu, Yuening and Jordan Boyd-Graber and Satinoff, Brianna} } @conference {12218, title = {IP geolocation in metropolitan areas}, booktitle = {Proceedings of the ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems}, series = {SIGMETRICS {\textquoteright}11}, year = {2011}, month = {2011///}, pages = {155 - 156}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Current IP geoloation techniques can geolocate an IP address to a region approximately 700 square miles, roughly the size of a metropolitan area. We model geolocation as a pattern-recognition problem, and introduce techniques that geolocate addresses to within 5 miles inside a metropolitan area. We propose two complementary algorithms: The first algorithm, Pattern Based Geolocation (PBG), models the distribution of latencies to the target and compares it to those of the reference landmarks to resolve an address to within 5 miles in a metropolitan area. The second approach, Perturbation Augmented PBG (PAPBG), provides higher resolution by sending extra traffic in the network. While sending an aggregate of 600 Kbps extra traffic to 20 nodes for approximately 2 minutes, PAPBG geolocates addresses to within 3 miles.}, keywords = {geolocation, pattern recognition, perturbation}, isbn = {978-1-4503-0814-4}, doi = {10.1145/1993744.1993803}, url = {http://doi.acm.org/10.1145/1993744.1993803}, author = {Singh,Satinder Pal and Baden,Randolph and Lee,Choon and Bhattacharjee, Bobby and La,Richard and Shayman,Mark} } @conference {13947, title = {Kernel partial least squares for speaker recognition}, booktitle = {Twelfth Annual Conference of the International Speech Communication Association}, year = {2011}, month = {2011///}, abstract = {I-vectors are a concise representation of speaker characteristics. Recent advances in speaker recognition have utilized their ability to capture speaker and channel variability to develop efficient recognition engines. Inter-speaker relationships in the i-vector space are non-linear. Accomplishing effective speaker recognition requires a good modeling of these non-linearities and can be cast as a machine learning problem. In this paper, we propose a kernel partial least squares (kernel PLS, or KPLS) framework for modeling speakers in the i-vectors space. The resulting recognition system is tested across several conditions of the NIST SRE 2010 extended core data set and compared against state-of-the-art systems: Joint Factor Analysis (JFA), Probabilistic Linear Discriminant Analysis (PLDA), and Cosine Distance Scoring (CDS) classifiers. Improvements are shown.}, author = {Srinivasan,B.V. and Garcia-Romero,D. and Zotkin,Dmitry N and Duraiswami, Ramani} } @article {13941, title = {Kernelized Renyi distance for subset selection and similarity scoring}, journal = {Technical Reports of the Computer Science Department}, year = {2011}, month = {2011/10/12/}, abstract = {Renyi entropy refers to a generalized class of entropies that have beenused in several applications. In this work, we derive a non-parametric distance between distributions based on the quadratic Renyi entropy. The distributions are estimated via Parzen density estimates. The quadratic complexity of the distance evaluation is mitigated with GPU-based parallelization. This results in an efficiently evaluated non-parametric entropic distance - the kernelized Renyi distance or the KRD. We adapt the KRD into a similarity measure and show its application to speaker recognition. We further extend KRD to measure dissimilarities between distributions and illustrate its applications to statistical subset selection and dictionary learning for object recognition and pose estimation. }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/12132}, author = {Srinivasan,Balaji Vasan and Duraiswami, Ramani} } @conference {14226, title = {Language Models for Semantic Extraction and Filtering in Video Action Recognition}, booktitle = {Workshops at the Twenty-Fifth AAAI Conference on Artificial Intelligence}, year = {2011}, month = {2011/08/24/}, abstract = {The paper addresses the following issues: (a) how to represent semantic information from natural language so that a vision model can utilize it? (b) how to extract the salient textual information relevant to vision? For a given domain, we present a new model of semantic extraction that takes into account word relatedness as well as word disambiguation in order to apply to a vision model. We automatically process the text transcripts and perform syntactic analysis to extract dependency relations. We then perform semantic extraction on the output to filter semantic entities related to actions. The resulting data are used to populate a matrix of co-occurrences utilized by the vision processing modules. Results show that explicitly modeling the co-occurrence of actions and tools significantly improved performance.}, url = {https://www.aaai.org/ocs/index.php/WS/AAAIW11/paper/viewPaper/3919}, author = {Tzoukermann,Evelyne and Neumann, Jan and Kosecka,Jana and Ferm{\"u}ller, Cornelia and Perera,Ian and Ferraro,Frank and Sapp,Ben and Chaudhry,Rizwan and Singh,Gautam} } @conference {13074, title = {A large-scale benchmark dataset for event recognition in surveillance video}, booktitle = {Computer Vision and Pattern Recognition (CVPR), 2011 IEEE Conference on}, year = {2011}, month = {2011/06//}, pages = {3153 - 3160}, abstract = {We introduce a new large-scale video dataset designed to assess the performance of diverse visual event recognition algorithms with a focus on continuous visual event recognition (CVER) in outdoor areas with wide coverage. Previous datasets for action recognition are unrealistic for real-world surveillance because they consist of short clips showing one action by one individual [15, 8]. Datasets have been developed for movies [11] and sports [12], but, these actions and scene conditions do not apply effectively to surveillance videos. Our dataset consists of many outdoor scenes with actions occurring naturally by non-actors in continuously captured videos of the real world. The dataset includes large numbers of instances for 23 event types distributed throughout 29 hours of video. This data is accompanied by detailed annotations which include both moving object tracks and event examples, which will provide solid basis for large-scale evaluation. Additionally, we propose different types of evaluation modes for visual recognition tasks and evaluation metrics along with our preliminary experimental results. We believe that this dataset will stimulate diverse aspects of computer vision research and help us to advance the CVER tasks in the years ahead.}, keywords = {algorithm;evaluation, CVER, databases;, databases;video, dataset;moving, event, metrics;large-scale, object, recognition, recognition;diverse, recognition;video, scenes;surveillance, surveillance;visual, tasks;computer, tracks;outdoor, video, video;computer, vision;continuous, vision;image, visual}, doi = {10.1109/CVPR.2011.5995586}, author = {Oh,Sangmin and Hoogs, A. and Perera,A. and Cuntoor, N. and Chen,Chia-Chih and Lee,Jong Taek and Mukherjee,S. and Aggarwal, JK and Lee,Hyungtae and Davis, Larry S. and Swears,E. and Wang,Xioyang and Ji,Qiang and Reddy,K. and Shah,M. and Vondrick,C. and Pirsiavash,H. and Ramanan,D. and Yuen,J. and Torralba,A. and Song,Bi and Fong,A. and Roy-Chowdhury, A. and Desai,M.} } @conference {16036, title = {LifeFlow: visualizing an overview of event sequences}, booktitle = {Proceedings of the 2011 annual conference on Human factors in computing systems}, series = {CHI {\textquoteright}11}, year = {2011}, month = {2011///}, pages = {1747 - 1756}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Event sequence analysis is an important task in many domains: medical researchers may study the patterns of transfers within the hospital for quality control; transportation experts may study accident response logs to identify best practices. In many cases they deal with thousands of records. While previous research has focused on searching and browsing, overview tasks are often overlooked. We introduce a novel interactive visual overview of event sequences called \emph{LifeFlow}. LifeFlow is scalable, can summarize all possible sequences, and represents the temporal spacing of the events within sequences. Two case studies with healthcare and transportation domain experts are presented to illustrate the usefulness of LifeFlow. A user study with ten participants confirmed that after 15 minutes of training novice users were able to rapidly answer questions about the prevalence and temporal characteristics of sequences, find anomalies, and gain significant insight from the data.}, keywords = {Information Visualization, overview visualization, temporal categorical data, timestamped event sequences}, isbn = {978-1-4503-0228-9}, doi = {10.1145/1978942.1979196}, url = {http://doi.acm.org/10.1145/1978942.1979196}, author = {Wongsuphasawat,Krist and Guerra G{\'o}mez,John Alexis and Plaisant, Catherine and Wang,Taowei David and Taieb-Maimon,Meirav and Shneiderman, Ben} } @conference {17280, title = {LifeFlow: visualizing an overview of event sequences (video preview)}, booktitle = {Proceedings of the 2011 annual conference extended abstracts on Human factors in computing systems}, series = {CHI EA {\textquoteright}11}, year = {2011}, month = {2011///}, pages = {507 - 510}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Event sequence analysis is an important task in many domains: medical researchers may study the patterns of transfers within the hospital for quality control; transportation experts may study accident response logs to identify best practices. In many cases they deal with thousands of records. While previous research has focused on searching and browsing, overview tasks are often overlooked. We introduce a novel interactive visual overview of event sequences called LifeFlow. LifeFlow is scalable, can summarize all possible sequences, and represents the temporal spacing of the events within sequences. In this video, we show an example of patient transfer data and briefly demonstrate how to analyze them with LifeFlow. Please see [11] or visit http:www.cs.umd.eduhcillifeflow for more detail.}, keywords = {emergency room, healthcare, Information Visualization, overview visualization, temporal categorical data, timestamped event sequences}, isbn = {978-1-4503-0268-5}, doi = {10.1145/1979742.1979557}, url = {http://doi.acm.org/10.1145/1979742.1979557}, author = {Wongsuphasawat,Krist and Guerra G{\'o}mez,John Alexis and Plaisant, Catherine and Wang,Taowei and Taieb-Maimon,Meirav and Shneiderman, Ben} } @conference {14702, title = {Lightweight monadic programming in ML}, booktitle = {Proceedings of the 16th ACM SIGPLAN international conference on Functional programming}, series = {ICFP {\textquoteright}11}, year = {2011}, month = {2011///}, pages = {15 - 27}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Many useful programming constructions can be expressed as monads. Examples include probabilistic modeling, functional reactive programming, parsing, and information flow tracking, not to mention effectful functionality like state and I/O. In this paper, we present a type-based rewriting algorithm to make programming with arbitrary monads as easy as using ML{\textquoteright}s built-in support for state and I/O. Developers write programs using monadic values of type m τ as if they were of type τ, and our algorithm inserts the necessary binds, units, and monad-to-monad morphisms so that the program type checks. Our algorithm, based on Jones{\textquoteright} qualified types, produces principal types. But principal types are sometimes problematic: the program{\textquoteright}s semantics could depend on the choice of instantiation when more than one instantiation is valid. In such situations we are able to simplify the types to remove any ambiguity but without adversely affecting typability; thus we can accept strictly more programs. Moreover, we have proved that this simplification is efficient (linear in the number of constraints) and coherent: while our algorithm induces a particular rewriting, all related rewritings will have the same semantics. We have implemented our approach for a core functional language and applied it successfully to simple examples from the domains listed above, which are used as illustrations throughout the paper.}, keywords = {coercion, coherence, monad, rewriting, type}, isbn = {978-1-4503-0865-6}, doi = {10.1145/2034773.2034778}, url = {http://doi.acm.org/10.1145/2034773.2034778}, author = {Swamy,Nikhil and Guts,Nataliya and Leijen,Daan and Hicks, Michael W.} } @article {15167, title = {Limits on the power of zero-knowledge proofs in cryptographic constructions}, journal = {Theory of Cryptography}, year = {2011}, month = {2011///}, pages = {559 - 578}, abstract = {For over 20 years, black-box impossibility results have been used to argue the infeasibility of constructing certain cryptographic primitives (e.g., key agreement) from others (e.g., one-way functions). A widely recognized limitation of such impossibility results, however, is that they say nothing about the usefulness of (known) nonblack-box techniques. This is unsatisfying, as we would at least like to rule out constructions using the set of techniques we have at our disposal.With this motivation in mind, we suggest a new framework for black-box constructions that encompasses constructions with a nonblack-box flavor: specifically, those that rely on zero-knowledge proofs relative to some oracle. We show that our framework is powerful enough to capture the Naor-Yung/Sahai paradigm for building a (shielding) CCA-secure public-key encryption scheme from a CPA-secure one, something ruled out by prior black-box separation results. On the other hand, we show that several black-box impossibility results still hold even in a setting that allows for zero-knowledge proofs. }, doi = {10.1007/978-3-642-19571-6_34}, author = {Brakerski,Z. and Katz, Jonathan and Segev,G. and Yerukhimovich,A.} } @article {13945, title = {Linear versus Mel Frequency Cepstral Coefficients for Speaker Recognition}, journal = {IEEE Automatic Speech Recognition and Understanding Workshop}, year = {2011}, month = {2011///}, abstract = {Mel-frequency cepstral coefficients (MFCC) havebeen dominantly used in speaker recognition as well as in speech recognition. However, based on theories in speech production, some speaker characteristics associated with the structure of the vocal tract, particularly the vocal tract length, are reflected more in the high frequency range of speech. This insight suggests that a linear scale in frequency may provide some advantages in speaker recognition over the mel scale. Based on two state-of-the- art speaker recognition back-end systems (one Joint Factor Analysis system and one Probabilistic Linear Discriminant Analysis system), this study compares the performances between MFCC and LFCC (Linear frequency cepstral coefficients) in the NIST SRE (Speaker Recognition Evaluation) 2010 extended-core task. Our results in SRE10 show that, while they are complementary to each other, LFCC consistently outperforms MFCC, mainly due to its better performance in the female trials. This can be explained by the relatively shorter vocal tract in females and the resulting higher formant frequencies in speech. LFCC benefits more in female speech by better capturing the spectral characteristics in the high frequency region. In addition, our results show some advantage of LFCC over MFCC in reverberant speech. LFCC is as robust as MFCC in the babble noise, but not in the white noise. It is concluded that LFCC should be more widely used, at least for the female trials, by the mainstream of the speaker recognition community. }, author = {Zhou,X. and Garcia-Romero,D. and Duraiswami, Ramani and Espy-Wilson,C. and Shamma,S.} } @conference {19035, title = {Link prediction by de-anonymization: How We Won the Kaggle Social Network Challenge}, year = {2011}, month = {2011}, pages = {1825 - 1834}, abstract = {This paper describes the winning entry to the IJCNN 2011 Social Network Challenge run by Kaggle.com. The goal of the contest was to promote research on real-world link prediction, and the dataset was a graph obtained by crawling the popular Flickr social photo sharing website, with user identities scrubbed. By de-anonymizing much of the competition test set using our own Flickr crawl, we were able to effectively game the competition. Our attack represents a new application of de-anonymization to gaming machine learning contests, suggesting changes in how future competitions should be run. We introduce a new simulated annealing-based weighted graph matching algorithm for the seeding step of de-anonymization. We also show how to combine de-anonymization with link prediction-the latter is required to achieve good performance on the portion of the test set not de-anonymized-for example by training the predictor on the de-anonymized portion of the test set, and combining probabilistic predictions from de-anonymization and link prediction.}, keywords = {deanonymization, Flickr social photo sharing Website, graph theory, IJCNN 2011 social network challenge, Kaggle social network challenge, learning (artificial intelligence), machine learning, realworld link prediction, Simulated annealing, simulated annealing-based weighted graph matching algorithm, social networking (online)}, author = {Narayanan, A. and Elaine Shi and Rubinstein, B.I.P.} } @article {17616, title = {Local Balancing Influences Global Structure in Social Networks}, journal = {Proceedings of the National Academy of SciencesPNAS}, volume = {108}, year = {2011}, month = {2011/02/01/}, pages = {1751 - 1752}, abstract = {Although social networks can often be viewed as graphs in their most basic form, many networks of interest include explicit sentiments (positive or negative views) of the nodes (constituent entities, also known as vertices) toward each other. This is particularly the case in geopolitics, settings where networks of firms compete in the creation of standards, and situations where polarization is frequent, such as in national elections, etc. The classical theory of structural balance developed by Heider (1) suggests how nodes may modify their relationships locally to maintain a type of balance within triads of nodes; this theory has been enriched in terms of explicit temporal dynamics by Kulakowski et al. (2). The work of Marvel et al. (3) in PNAS shows a rigorous analysis of these dynamics and brings out interesting properties and applications thereof.}, isbn = {0027-8424, 1091-6490}, doi = {10.1073/pnas.1018901108}, url = {http://www.pnas.org/content/108/5/1751}, author = {Srinivasan, Aravind} } @article {13082, title = {Local Response Context Applied to Pedestrian Detection}, journal = {Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications}, year = {2011}, month = {2011///}, pages = {181 - 188}, abstract = {Appearing as an important task in computer vision, pedestrian detection has been widely investigated in the recent years. To design a robust detector, we propose a feature descriptor called Local Response Context (LRC). This descriptor captures discriminative information regarding the surrounding of the person{\textquoteright}s location by sampling the response map obtained by a generic sliding window detector. A partial least squares regression model using LRC descriptors is learned and employed as a second classification stage (after the execution of the generic detector to obtain the response map). Experiments based on the ETHZ pedestrian dataset show that the proposed approach improves significantly the results achieved by the generic detector alone and is comparable to the state-of-the-art methods.}, author = {Schwartz,W. and Davis, Larry S. and Pedrini,H.} } @inbook {14324, title = {A Longitudinal Study of Pressure Sensing to Infer Real-World Water Usage Events in the Home}, booktitle = {Pervasive ComputingPervasive Computing}, series = {Lecture Notes in Computer Science}, volume = {6696}, year = {2011}, month = {2011///}, pages = {50 - 69}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {We present the first longitudinal study of pressure sensing to infer real-world water usage events in the home (e.g., dishwasher, upstairs bathroom sink, downstairs toilet). In order to study the pressure-based approach out in the wild , we deployed a ground truth sensor network for five weeks in three homes and two apartments that directly monitored valve-level water usage by fixtures and appliances . We use this data to, first, demonstrate the practical challenges in constructing water usage activity inference algorithms and, second, to inform the design of a new probabilistic-based classification approach. Inspired by algorithms in speech recognition, our novel Bayesian approach incorporates template matching, a language model, grammar, and prior probabilities. We show that with a single pressure sensor, our probabilistic algorithm can classify real-world water usage at the fixture level with 90\% accuracy and at the fixturecategory level with 96\% accuracy. With two pressure sensors, these accuracies increase to 94\% and 98\%. Finally, we show how our new approach can be trained with fewer examples than a strict template-matching approach alone.}, isbn = {978-3-642-21725-8}, url = {http://dx.doi.org/10.1007/978-3-642-21726-5_4}, author = {Jon Froehlich and Larson,Eric and Saba,Elliot and Campbell,Tim and Atlas,Les and Fogarty,James and Patel,Shwetak}, editor = {Lyons,Kent and Hightower,Jeffrey and Huang,Elaine} } @inbook {19186, title = {A Longitudinal Study of Pressure Sensing to Infer Real-World Water Usage Events in the Home}, booktitle = {Pervasive Computing}, series = {Lecture Notes in Computer Science}, volume = {6696}, year = {2011}, month = {2011}, pages = {50 - 69}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {We present the first longitudinal study of pressure sensing to infer real-world water usage events in the home (e.g., dishwasher, upstairs bathroom sink, downstairs toilet). In order to study the pressure-based approach out in the wild , we deployed a ground truth sensor network for five weeks in three homes and two apartments that directly monitored valve-level water usage by fixtures and appliances . We use this data to, first, demonstrate the practical challenges in constructing water usage activity inference algorithms and, second, to inform the design of a new probabilistic-based classification approach. Inspired by algorithms in speech recognition, our novel Bayesian approach incorporates template matching, a language model, grammar, and prior probabilities. We show that with a single pressure sensor, our probabilistic algorithm can classify real-world water usage at the fixture level with 90\% accuracy and at the fixturecategory level with 96\% accuracy. With two pressure sensors, these accuracies increase to 94\% and 98\%. Finally, we show how our new approach can be trained with fewer examples than a strict template-matching approach alone.}, isbn = {978-3-642-21725-8}, url = {http://dx.doi.org/10.1007/978-3-642-21726-5_4}, author = {Jon Froehlich and Larson,Eric and Saba,Elliot and Campbell,Tim and Atlas,Les and Fogarty,James and Patel,Shwetak}, editor = {Lyons,Kent and Hightower,Jeffrey and Huang,Elaine} } @article {17622, title = {Maximum bipartite flow in networks with adaptive channel width}, journal = {Theoretical Computer Science}, volume = {412}, year = {2011}, month = {2011/05/27/}, pages = {2577 - 2587}, abstract = {Traditionally, network optimization problems assume that each link in the network has a fixed capacity. Recent research in wireless networking has shown that it is possible to design networks where the capacity of the links can be changed adaptively to suit the needs of specific applications. In particular, one gets a choice of having a few high capacity outgoing links or many low capacity ones at any node of the network. This motivates us to have a re-look at classical network optimization problems and design algorithms to solve them in this new framework. In particular, we consider the problem of maximum bipartite flow, which has been studied extensively in the fixed-capacity network model. One of the motivations for studying this problem arises from the need to maximize the throughput of an infrastructure wireless network comprising base-stations (one set of vertices in the bipartition) and clients (the other set of vertices in the bipartition). We show that this problem has a significantly different combinatorial structure in this new network model from the fixed-capacity one. While there are several polynomial time algorithms for the maximum bipartite flow problem in traditional networks, we show that the problem is NP-hard in the new model. In fact, our proof extends to showing that the problem is APX-hard. We complement our lower bound by giving two algorithms for solving the problem approximately. The first algorithm is deterministic and achieves an approximation factor of O ( log N ) , where N is the number of nodes in the network, while the second algorithm is randomized and achieves an approximation factor of e e - 1 .}, keywords = {Adaptive channel width, graph algorithm, Linear program rounding, Maximum flow, Wireless networks}, isbn = {0304-3975}, doi = {10.1016/j.tcs.2010.10.023}, url = {http://www.sciencedirect.com/science/article/pii/S0304397510005852}, author = {Azar,Yossi and M{\k a}dry,Aleksander and Moscibroda,Thomas and Panigrahi,Debmalya and Srinivasan, Aravind} } @article {16039, title = {Medication Reconciliation: Work Domain Ontology, Prototype Development, and a Predictive Model}, journal = {AMIA Annual Symposium ProceedingsAMIA Annu Symp Proc}, volume = {2011}, year = {2011}, month = {2011///}, pages = {878 - 887}, abstract = {Medication errors can result from administration inaccuracies at any point of care and are a major cause for concern. To develop a successful Medication Reconciliation (MR) tool, we believe it necessary to build a Work Domain Ontology (WDO) for the MR process. A WDO defines the explicit, abstract, implementation-independent description of the task by separating the task from work context, application technology, and cognitive architecture. We developed a prototype based upon the WDO and designed to adhere to standard principles of interface design. The prototype was compared to Legacy Health System{\textquoteright}s and Pre-Admission Medication List Builder MR tools via a Keystroke-Level Model analysis for three MR tasks. The analysis found the prototype requires the fewest mental operations, completes tasks in the fewest steps, and completes tasks in the least amount of time. Accordingly, we believe that developing a MR tool, based upon the WDO and user interface guidelines, improves user efficiency and reduces cognitive load.}, isbn = {1942-597X}, author = {Markowitz,Eliz and Bernstam,Elmer V. and Herskovic,Jorge and Zhang,Jiajie and Shneiderman, Ben and Plaisant, Catherine and Johnson,Todd R.} } @article {12859, title = {Metagenomic 16S rDNA Targeted PCR-DGGE in Determining Bacterial Diversity in Aquatic Ecosystem}, journal = {Bangladesh Journal of Microbiology}, volume = {27}, year = {2011}, month = {2011/12/13/}, abstract = {Bacterial numbers in surface water samples, collected randomly from six different water bodies, were estimated by acridine orange direct counting (AODC) and conventional culture-based heterotrophic plate counting (HPC). Bacterial genomic DNA was prepared from water samples by employing methods used for stool samples, including the population dynamics, were determined by primer extension of the 16S rDNA (V6/V8 region) using polymerase chain reaction (PCR), followed by denaturing gradient gel electrophoresis (DGGE), a metagenomic tool that is capable of separating unrelated DNAs based on the differences in their sequences and GC contents. The bacterial numbers in water samples ranged from 103 {\textendash} 106 CFU/ mL for HPC and 104 {\textendash} 107 cells/ mL for AODC, showing that a great majority of bacteria prevail as uncultivable which do not respond to culture methods that are used widely for tracking bacterial pathogens. The acridine orange-stained bacteria varied in sizes and shapes, and appeared either as planktonic (solitary) cells or as clusters of biofilms, showing the presence of diverse community under the epifluorescence microscope. The DGGE of the ca. 457 bp amplicons, as confirmed by agarose gel electrophoresis, produced bands that ranged in intensities and numbers from 18 to 31, with each band possibly indicating the presence of one or more closely related bacterial species. The enrichment of pathogenic bacteria in the aquatic ecosystem is known to precede the seasonal diarrhoeal outbreaks; therefore, bacterial community dynamics determined by Metagenomic 16S PCR-DGGE during pre-epidemic enrichment appears promising in predicting the upcoming diarrheal outbreaks.}, isbn = {1011-9981}, doi = {10.3329/bjm.v27i2.9171}, url = {http://www.banglajol.info/bd/index.php/BJM/article/view/9171}, author = {Hasan,Nur A. and Chowdhury,W Bari and Rahim,Niaz and Sultana,Marzia and Shabnam,S Antara and Mai,Volker and Ali,Afsar and Morris,Glen J and Sack,R. Bradley and Huq,Anwar and Rita R Colwell and Endtz,Hubert Ph and Cravioto,Alejandro and Alam,Munirul} } @article {12443, title = {Method and system for markerless motion capture using multiple cameras}, volume = {11/937,834}, year = {2011}, month = {2011/09/20/}, abstract = {Completely automated end-to-end method and system for markerless motion capture performs segmentation of articulating objects in Laplacian Eigenspace and is applicable to handling of the poses of some complexity. 3D voxel representation of acquired images are mapped to a higher dimensional space (k), where k depends on the number of articulated chains of the subject body, so as to extract the 1-D representations of the articulating chains. A bottom-up approach is suggested in order to build a parametric (spline-based) representation of a general articulated body in the high dimensional space followed by a top-down probabilistic approach that registers the segments to an average human body model. The parameters of the model are further optimized using the segmented and registered voxels.}, url = {http://www.google.com/patents?id=-THwAQAAEBAJ}, author = {Sundaresan,Aravind and Chellapa, Rama}, editor = {University of Maryland} } @conference {19270, title = {A Model-Based Schedule Representation for Heterogeneous Mapping of Dataflow Graphs}, booktitle = {2011 IEEE International Symposium on Parallel and Distributed Processing Workshops and Phd Forum (IPDPSW)}, year = {2011}, month = {2011}, pages = {70 - 81}, abstract = {Dataflow-based application specifications are widely used in model-based design methodologies for signal processing systems. In this paper, we develop a new model called the dataflow schedule graph (DSG) for representing a broad class of dataflow graph schedules. The DSG provides a graphical representation of schedules based on dataflow semantics. In conventional approaches, applications are represented using dataflow graphs, whereas schedules for the graphs are represented using specialized notations, such as various kinds of sequences or looping constructs. In contrast, the DSG approach employs dataflow graphs for representing both application models and schedules that are derived from them. Our DSG approach provides a precise, formal framework for unambiguously representing, analyzing, manipulating, and interchanging schedules. We develop detailed formulations of the DSG representation, and present examples and experimental results that demonstrate the utility of DSGs in the context of heterogeneous signal processing system design.}, keywords = {Computational modeling, data flow graphs, dataflow schedule graph, dataflow semantics, dataflow-based application specifications, Dynamic scheduling, heterogeneous mapping, heterogeneous signal processing system design, model-based design methodologies, model-based schedule representation, Processor scheduling, Program processors, Schedules, semantics, Signal processing, synchronization}, author = {Wu, Hsiang-Huang and Chung-Ching Shen and Sane, N. and Plishker,W. and Bhattacharyya, Shuvra S.} } @conference {19261, title = {Modeling and optimization of dynamic signal processing in resource-aware sensor networks}, booktitle = {2011 8th IEEE International Conference on Advanced Video and Signal-Based Surveillance (AVSS)}, year = {2011}, month = {2011}, pages = {449 - 454}, abstract = {Sensor node processing in resource-aware sensor networks is often critically dependent on dynamic signal processing functionality - i.e., signal processing functionality in which computational structure must be dynamically assessed and adapted based on time-varying environmental conditions, operating constraints or application requirements. In dynamic signal processing systems, it is important to provide flexibility for run-time adaptation of application behavior and execution characteristics, but in the domain of resource-aware sensor networks, such flexibility cannot come with significant costs in terms of power consumption overhead or reduced predictability. In this paper, we review a variety of complementary models of computation that are being developed as part of the dataflow interchange format (DIF) project to facilitate efficient and reliable implementation of dynamic signal processing systems. We demonstrate these methods in the context of resource-aware sensor networks.}, keywords = {Adaptation models, Aerodynamics, Computational modeling, data flow graphs, dataflow interchange format, Dynamic scheduling, dynamic signal processing, power consumption overhead, Program processors, resource-aware sensor networks, run-time adaptation, Schedules, sensor node processing, Signal processing, Wireless sensor networks}, author = {Bhattacharyya, Shuvra S. and Plishker,W. and Sane, N. and Chung-Ching Shen and Wu, Hsiang-Huang} } @conference {17299, title = {Motivation for Participation in Online Neighborhood Watch Communities: An Empirical Study Involving Invitation Letters}, booktitle = {Privacy, Security, Risk and Trust (PASSAT), 2011 IEEE Third International Conference on and 2011 IEEE Third International Confernece on Social Computing (SocialCom)}, year = {2011}, month = {2011/10/09/11}, pages = {760 - 765}, publisher = {IEEE}, organization = {IEEE}, abstract = {This paper presents a three-part experiment designed to investigate the motivations of users of a community safety and neighborhood watch social networking website. The experiment centers around an intervention into the invitation system that current users employ to invite nonmembers to join the site, and involves several versions of an invitation email which differ by expressing one of four possible motivations for using such a site. The research presented investigates how potential users{\textquoteright} choice of whether or not to join the site is affected by the use case presented by the invitation. It also includes an investigation of the motivations of current users of the site, as reported in an online survey. The experiment yielded no significant difference in responses to the emails. Overall, invitations that included a specific motivation slightly outperformed those which did not, but not to a statistically significant degree. We conclude that although users have specific motivations for using the site, as reported in the survey, attempting to increase response rates to invitation emails by suggesting use cases of the site is surprisingly unlikely to be successful.}, keywords = {Art, Communities, community safety, Electronic mail, Interviews, invitation email, invitations, motivation, neighborhood watch, Online communities, online neighborhood watch communities, online survey, participation, Safety, Security, social media, Social network services, social networking (online), social networking Website}, isbn = {978-1-4577-1931-8}, doi = {10.1109/PASSAT/SocialCom.2011.108}, author = {Violi,N. and Shneiderman, Ben and Hanson,A. and Rey,P. J} } @conference {17306, title = {NetVisia: Heat Map \& Matrix Visualization of Dynamic Social Network Statistics \& Content}, booktitle = {Privacy, Security, Risk and Trust (PASSAT), 2011 IEEE Third International Conference on and 2011 IEEE Third International Confernece on Social Computing (SocialCom)}, year = {2011}, month = {2011/10/09/11}, pages = {19 - 26}, publisher = {IEEE}, organization = {IEEE}, abstract = {Visualizations of static networks in the form of node-link diagrams have evolved rapidly, though researchers are still grappling with how best to show evolution of nodes over time in these diagrams. This paper introduces NetVisia, a social network visualization system designed to support users in exploring temporal evolution in networks by using heat maps to display node attribute changes over time. NetVisia{\textquoteright}s novel contributions to network visualizations are to (1) cluster nodes in the heat map by similar metric values instead of by topological similarity, and (2) align nodes in the heat map by events. We compare NetVisia to existing systems and describe a formative user evaluation of a NetVisia prototype with four participants that emphasized the need for tool tips and coordinated views. Despite the presence of some usability issues, in 30-40 minutes the user evaluation participants discovered new insights about the data set which had not been discovered using other systems. We discuss implemented improvements to NetVisia, and analyze a co-occurrence network of 228 business intelligence concepts and entities. This analysis confirms the utility of a clustered heat map to discover outlier nodes and time periods.}, keywords = {business intelligence concept, business intelligence entity, competitive intelligence, data visualisation, dynamic networks, dynamic social network, heat map, Heating, Image color analysis, Information Visualization, Layout, matrix visualization, measurement, NetVisia system, network evolution, network visualization, node-link diagrams, outlier node, social network content, Social network services, social network statistics, social networking (online), social networks, static network visualization, time period, topological similarity, Training, usability, user evaluation, User interfaces}, isbn = {978-1-4577-1931-8}, doi = {10.1109/PASSAT/SocialCom.2011.216}, author = {Gove,R. and Gramsky,N. and Kirby,R. and Sefer,E. and Sopan,A. and Dunne,C. and Shneiderman, Ben and Taieb-Maimon,M.} } @article {17629, title = {Network Clustering Approximation Algorithm Using One Pass Black Box Sampling}, journal = {arXiv:1110.3563}, year = {2011}, month = {2011/10/16/}, abstract = {Finding a good clustering of vertices in a network, where vertices in the same cluster are more tightly connected than those in different clusters, is a useful, important, and well-studied task. Many clustering algorithms scale well, however they are not designed to operate upon internet-scale networks with billions of nodes or more. We study one of the fastest and most memory efficient algorithms possible - clustering based on the connected components in a random edge-induced subgraph. When defining the cost of a clustering to be its distance from such a random clustering, we show that this surprisingly simple algorithm gives a solution that is within an expected factor of two or three of optimal with either of two natural distance functions. In fact, this approximation guarantee works for any problem where there is a probability distribution on clusterings. We then examine the behavior of this algorithm in the context of social network trust inference.}, keywords = {Computer Science - Social and Information Networks, Physics - Physics and Society}, url = {http://arxiv.org/abs/1110.3563}, author = {DuBois,Thomas and Golbeck,Jennifer and Srinivasan, Aravind} } @article {19111, title = {Next Generation Sequence Assembly with AMOS}, journal = {Current Protocols in Bioinformatics}, volume = {11}, year = {2011}, month = {2011}, pages = {1 - 11}, author = {Treangen, T.J. and Sommer, D.D. and Angly, F.E. and Koren, S. and Pop, Mihai} } @article {15774, title = {Nouveau-ROUGE: A Novelty Metric for Update Summarization}, journal = {Computational Linguistics}, volume = {37}, year = {2011}, month = {2011///}, pages = {1 - 8}, abstract = {An update summary should provide a fluent summarization of new information on a time-evolving topic, assuming that the reader has already reviewed older documents or summaries. In 2007 and 2008, an annual summarization evaluation included an update summarization task. Several participating systems produced update summaries indistinguishable from human-generated summaries when measured using ROUGE. However, no machine system performed near human-level performance in manual evaluations such as pyramid and overall responsiveness scoring.}, isbn = {0891-2017}, doi = {10.1162/coli_a_00033}, url = {http://dx.doi.org/10.1162/coli_a_00033}, author = {Conroy,John M. and Schlesinger,Judith D. and O{\textquoteright}Leary, Dianne P.} } @conference {13070, title = {A novel feature descriptor based on the shearlet transform}, booktitle = {Image Processing (ICIP), 2011 18th IEEE International Conference on}, year = {2011}, month = {2011/09//}, pages = {1033 - 1036}, abstract = {Problems such as image classification, object detection and recognition rely on low-level feature descriptors to represent visual information. Several feature extraction methods have been proposed, including the Histograms of Oriented Gradients (HOG), which captures edge information by analyzing the distribution of intensity gradients and their directions. In addition to directions, the analysis of edge at different scales provides valuable information. Shearlet transforms provide a general framework for analyzing and representing data with anisotropic information at multiple scales. As a consequence, signal singularities, such as edges, can be precisely detected and located in images. Based on the idea of employing histograms to estimate the distribution of edge orientations and on the accurate multi-scale analysis provided by shearlet transforms, we propose a feature descriptor called Histograms of Shearlet Coefficients (HSC). Experimental results comparing HOG with HSC show that HSC provides significantly better results for the problems of texture classification and face identification.}, keywords = {analysis;multiscale, analysis;object, classification;face, classification;image, classification;intensity, coefficients;image, descriptor;feature, detection;object, distribution, edge, EXTRACTION, extraction;image, gradient, gradients;histograms, identification;feature, methods;histograms, of, orientations;face, oriented, recognition;feature, recognition;shearlet, recognition;transforms;, shearlet, singularities;texture, texture;object, transform;signal}, doi = {10.1109/ICIP.2011.6115600}, author = {Schwartz, W.R. and da Silva,R.D. and Davis, Larry S. and Pedrini,H.} } @article {17720, title = {On the Numerical Analysis of Oblique Projectors}, journal = {SIAM Journal on Matrix Analysis and Applications}, volume = {32}, year = {2011}, month = {2011///}, pages = {309 - 348}, abstract = {An oblique projector is an idempotent matrix whose null space is oblique to its range, in contrast to an orthogonal projector, whose null space is orthogonal to its range. Oblique projectors arise naturally in many applications and have a substantial literature. Missing from that literature, however, are systematic expositions of their numerical properties, including their perturbation theory, their various representations, their behavior in the presence of rounding error, the computation of complementary projections, and updating algorithms. This article is intended to make a start at filling this gap. The first part of the article is devoted to the first four of the above topics, with particular attention given to complementation. In the second part, stable algorithms are derived for updating an XQRY representation of projectors, which was introduced in the first part.}, keywords = {$B$-orthogonality, oblique projector, Perturbation theory, updating algorithms, XQRY form}, doi = {10.1137/100792093}, url = {http://link.aip.org/link/?SML/32/309/1}, author = {Stewart, G.W.} } @inbook {19037, title = {Oblivious RAM with O((logN)^3) Worst-Case Cost}, booktitle = {Advances in Cryptology {\textendash} ASIACRYPT 2011}, series = {Lecture Notes in Computer Science}, volume = {7073}, year = {2011}, month = {2011}, pages = {197 - 214}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {Oblivious RAM is a useful primitive that allows a client to hide its data access patterns from an untrusted server in storage outsourcing applications. Until recently, most prior works on Oblivious RAM aim to optimize its amortized cost, while suffering from linear or even higher worst-case cost. Such poor worst-case behavior renders these schemes impractical in realistic settings, since a data access request can occasionally be blocked waiting for an unreasonably large number of operations to complete. This paper proposes novel Oblivious RAM constructions that achieves poly-logarithmic worst-case cost, while consuming constant client-side storage. To achieve the desired worst-case asymptotic performance, we propose a novel technique in which we organize the O-RAM storage into a binary tree over data buckets, while moving data blocks obliviously along tree edges.}, keywords = {Computer science}, isbn = {978-3-642-25384-3}, url = {http://www.springerlink.com/content/2214q8013376rj37/abstract/}, author = {Elaine Shi and Chan, T. and Stefanov, Emil and Li, Mingfei}, editor = {Lee, Dong and Wang, Xiaoyun} } @article {20383, title = {Occurrence of Vibrio cholerae in Municipal and Natural Waters and Incidence of Cholera in Azerbaijan}, journal = {EcoHealth}, year = {2011}, month = {Jan-12-2011}, pages = {468 - 477}, abstract = {Cholera, a waterborne disease caused by Vibrio cholerae, is an autochthonous member of the aquatic environment and predominantly reported from developing countries. Technical reports and proceedings were reviewed to determine the relationship between occurrence of V. cholerae in natural waters, including sources of municipal water, and cases of cholera in Azerbaijan. Water samples collected from different environmental sources from 1970 to 1998 were tested for V. cholerae and 0.73\% (864/117,893) were positive. The results showed that in April of each year, when the air temperature rose by approximately 5{\textdegree}C, V. cholerae could be isolated. With each increase in air temperature, 6{\textendash}8 weeks after, impact on cases of cholera was recorded. The incidence of cholera peaked when the air temperature reached >25{\textdegree}C during the month of September. It is concluded that a distinct seasonality in cholera incidence exists in Azerbaijan, with increased occurrence during warmer months.}, issn = {1612-9202}, doi = {10.1007/s10393-012-0756-8}, url = {http://link.springer.com/10.1007/s10393-012-0756-8}, author = {Gurbanov, Shair and Akhmadov, Rashid and Shamkhalova, Gulnara and Akhmadova, Sevinj and Haley, Bradd J. and Rita R Colwell and Huq, Anwar} } @conference {14902, title = {Odd Leaf Out: Improving Visual Recognition with Games}, booktitle = {Privacy, security, risk and trust (passat), 2011 ieee third international conference on and 2011 ieee third international conference on social computing (socialcom)}, year = {2011}, month = {2011/10//}, pages = {87 - 94}, abstract = {A growing number of projects are solving complex computational and scientific tasks by soliciting human feedback through games. Many games with a purpose focus on generating textual tags for images. In contrast, we introduce a new game, Odd Leaf Out, which provides players with an enjoyable and educational game that serves the purpose of identifying misclassification errors in a large database of labeled leaf images. The game uses a novel mechanism to solicit useful information from players{\textquoteright} incorrect answers. A study of 165 players showed that game data can be used to identify mislabeled leaves much more quickly than would have been possible using a computer vision algorithm alone. Domain novices and experts were equally good at identifying mislabeled images, although domain experts enjoyed the game more. We discuss the successes and challenges of this new game, which can be applied to other domains with labeled image datasets.}, keywords = {algorithm;educational, classification;object, computational, computing;botany;computer, datasets;misclassification, errors;scientific, feedback;labeled, game;human, games;computer, games;image, image, leaf, Odd, Out;complex, recognition;, recognition;biology, tags;visual, tasks;computer, tasks;textual, VISION}, doi = {10.1109/PASSAT/SocialCom.2011.225}, author = {Hansen,D. L and Jacobs, David W. and Lewis,D. and Biswas,A. and Preece,J. and Rotman,D. and Stevens,E.} } @article {13946, title = {Partial least squares based speaker recognition system}, journal = {Snowbird Learning Workshop}, year = {2011}, month = {2011///}, author = {Srinivasan,B.V. and Zotkin,Dmitry N and Duraiswami, Ramani} } @conference {13943, title = {A partial least squares framework for speaker recognition}, booktitle = {Acoustics, Speech and Signal Processing (ICASSP), 2011 IEEE International Conference on}, year = {2011}, month = {2011/05//}, pages = {5276 - 5279}, abstract = {Modern approaches to speaker recognition (verification) operate in a space of "supervectors" created via concatenation of the mean vectors of a Gaussian mixture model (GMM) adapted from a universal background model (UBM). In this space, a number of approaches to model inter-class separability and nuisance attribute variability have been proposed. We develop a method for modeling the variability associated with each class (speaker) by using partial-least-squares - a latent variable modeling technique, which isolates the most informative subspace for each speaker. The method is tested on NIST SRE 2008 data and provides promising results. The method is shown to be noise-robust and to be able to efficiently learn the subspace corresponding to a speaker on training data consisting of multiple utterances.}, keywords = {approximations;speaker, attribute, background, GMM;Gaussian, least, mixture, model;Gaussian, model;NIST, modeling, processes;least, recognition;, recognition;speaker, separability;latent, squares, squares;partial-least-squares;speaker, SRE;interclass, technique;multiple, utterances;nuisance, variability;partial, variable, verification;universal}, doi = {10.1109/ICASSP.2011.5947548}, author = {Srinivasan,B.V. and Zotkin,Dmitry N and Duraiswami, Ramani} } @conference {17643, title = {Predicting Trust and Distrust in Social Networks}, booktitle = {Privacy, Security, Risk and Trust (PASSAT), 2011 IEEE Third International Conference on and 2011 IEEE Third International Confernece on Social Computing (SocialCom)}, year = {2011}, month = {2011/10/09/11}, pages = {418 - 424}, publisher = {IEEE}, organization = {IEEE}, abstract = {As user-generated content and interactions have overtaken the web as the default mode of use, questions of whom and what to trust have become increasingly important. Fortunately, online social networks and social media have made it easy for users to indicate whom they trust and whom they do not. However, this does not solve the problem since each user is only likely to know a tiny fraction of other users, we must have methods for inferring trust - and distrust - between users who do not know one another. In this paper, we present a new method for computing both trust and distrust (i.e., positive and negative trust). We do this by combining an inference algorithm that relies on a probabilistic interpretation of trust based on random graphs with a modified spring-embedding algorithm. Our algorithm correctly classifies hidden trust edges as positive or negative with high accuracy. These results are useful in a wide range of social web applications where trust is important to user behavior and satisfaction.}, keywords = {distrust prediction, Electronic publishing, Encyclopedias, graph theory, inference algorithm, Inference algorithms, inference mechanisms, Internet, negative trust, online social networks, positive trust, Prediction algorithms, probability, random graphs, security of data, social media, social networking (online), spring-embedding algorithm, Training, trust inference, trust probabilistic interpretation, user behavior, user satisfaction, user-generated content, user-generated interactions}, isbn = {978-1-4577-1931-8}, doi = {10.1109/PASSAT/SocialCom.2011.56}, author = {DuBois,T. and Golbeck,J. and Srinivasan, Aravind} } @conference {19042, title = {Privacy settings from contextual attributes: A case study using Google Buzz}, year = {2011}, month = {2011}, pages = {257 - 262}, abstract = {Social networks provide users with privacy settings to control what information is shared with connections and other users. In this paper, we analyze factors influencing changes in privacy-related settings in the Google Buzz social network. Specifically, we show statistics on contextual data related to privacy settings that are derived from crawled datasets and analyze the characteristics of users who changed their privacy settings. We also investigate potential neighboring effects among such users.}, keywords = {contextual attributes, data privacy, Google Buzz, privacy settings, social networking (online), social networks, Statistics}, author = {Mashima, D. and Elaine Shi and Chow, R. and Sarkar, P. and Li,C. and Song,D.} } @conference {19019, title = {Privacy-preserving aggregation of time-series data}, volume = {17}, year = {2011}, month = {2011}, abstract = {We consider how an untrusted data aggregator canlearn desired statistics over multiple participants{\textquoteright} data, without compromising each individual{\textquoteright}s privacy. We propose a construction that allows a group of partici- pants to periodically upload encrypted values to a data aggregator, such that the aggregator is able to compute the sum of all participants{\textquoteright} values in every time period, but is unable to learn anything else. We achieve strong privacy guarantees using two main techniques. First, we show how to utilize applied cryptographic techniques to allow the aggregator to decrypt the sum from multiple ciphertexts encrypted under different user keys. Second, we describe a distributed data randomization procedure that guarantees the differential privacy of the outcome statistic, even when a subset of participants might be compromised. }, url = {http://www.eecs.berkeley.edu/~elaines/docs/ndss2011.pdf}, author = {Elaine Shi and Chan, T. and Rieffel, E. and Chow, R. and Song,D.} } @article {19043, title = {Private and Continual Release of Statistics}, journal = {ACM Transactions on Information and System Security (TISSEC)}, volume = {14}, year = {2011}, month = {2011}, pages = {26:1 - 26:24}, abstract = {We ask the question: how can Web sites and data aggregators continually release updated statistics, and meanwhile preserve each individual user{\textquoteright}s privacy? Suppose we are given a stream of 0{\textquoteright}s and 1{\textquoteright}s. We propose a differentially private continual counter that outputs at every time step the approximate number of 1{\textquoteright}s seen thus far. Our counter construction has error that is only poly-log in the number of time steps. We can extend the basic counter construction to allow Web sites to continually give top-k and hot items suggestions while preserving users{\textquoteright} privacy.}, keywords = {continual mechanism, Differential privacy, streaming algorithm}, isbn = {1094-9224}, url = {http://doi.acm.org/10.1145/2043621.2043626}, author = {Chan, T.-H. Hubert and Elaine Shi and Song, Dawn} } @article {19722, title = {ProPhylo: partial phylogenetic profiling to guide protein family construction and assignment of biological process.}, journal = {BMC Bioinformatics}, volume = {12}, year = {2011}, month = {2011}, pages = {434}, abstract = {

BACKGROUND: Phylogenetic profiling is a technique of scoring co-occurrence between a protein family and some other trait, usually another protein family, across a set of taxonomic groups. In spite of several refinements in recent years, the technique still invites significant improvement. To be its most effective, a phylogenetic profiling algorithm must be able to examine co-occurrences among protein families whose boundaries are uncertain within large homologous protein superfamilies.

RESULTS: Partial Phylogenetic Profiling (PPP) is an iterative algorithm that scores a given taxonomic profile against the taxonomic distribution of families for all proteins in a genome. The method works through optimizing the boundary of each protein family, rather than by relying on prebuilt protein families or fixed sequence similarity thresholds. Double Partial Phylogenetic Profiling (DPPP) is a related procedure that begins with a single sequence and searches for optimal granularities for its surrounding protein family in order to generate the best query profiles for PPP. We present ProPhylo, a high-performance software package for phylogenetic profiling studies through creating individually optimized protein family boundaries. ProPhylo provides precomputed databases for immediate use and tools for manipulating the taxonomic profiles used as queries.

CONCLUSION: ProPhylo results show universal markers of methanogenesis, a new DNA phosphorothioation-dependent restriction enzyme, and efficacy in guiding protein family construction. The software and the associated databases are freely available under the open source Perl Artistic License from ftp://ftp.jcvi.org/pub/data/ppp/.

}, keywords = {algorithms, Archaea, Archaeal Proteins, DNA, Methane, Phylogeny, software}, issn = {1471-2105}, doi = {10.1186/1471-2105-12-434}, author = {Basu, Malay K and Jeremy D Selengut and Haft, Daniel H} } @article {13847, title = {Rapid understanding of scientific paper collections: integrating statistics, text analysis, and visualization}, journal = {University of Maryland, Human-Computer Interaction Lab Tech Report HCIL-2011}, year = {2011}, month = {2011///}, abstract = {Keeping up with rapidly growing research fields, especially when there aremultiple interdisciplinary sources, requires substantial effort for researchers, program managers, or venture capital investors. Current theories and tools are directed at finding a paper or website, not gaining an understanding of the key papers, authors, controversies, and hypotheses. This report presents an effort to integrate statistics, text analytics, and visualization in a multiple coordinated window environment that supports exploration. Our prototype system, Action Science Explorer (ASE), provides an environment for demon- strating principles of coordination and conducting iterative usability tests of them with interested and knowledgeable users. We developed an under- standing of the value of reference management, statistics, citation context extraction, natural language summarization for single and multiple docu- ments, filters to interactively select key papers, and network visualization to see citation patterns and identify clusters. The three-phase usability study guided our revisions to ASE and led us to improve the testing methods. }, author = {Dunne,C. and Shneiderman, Ben and Gove,R. and Klavans,J. and Dorr, Bonnie J} } @article {17340, title = {Realizing the value of social media requires innovative computing research}, journal = {Communications of the ACM}, volume = {54}, year = {2011}, month = {2011/09//}, pages = {34 - 37}, abstract = {How social media are expanding traditional research and development topics for computer and information scientists.}, isbn = {0001-0782}, doi = {10.1145/1995376.1995389}, url = {http://doi.acm.org/10.1145/1995376.1995389}, author = {Shneiderman, Ben and Preece,Jennifer and Pirolli,Peter} } @conference {18891, title = {Real-Time Planning for Covering an Initially-Unknown Spatial Environment}, year = {2011}, month = {2011///}, abstract = {We consider the problem of planning, on the fly, a path whereby a robotic vehicle will cover every point in an ini- tially unknown spatial environment. We describe four strate- gies (Iterated WaveFront, Greedy-Scan, Delayed Greedy- Scan and Closest-First Scan) for generating cost-effective coverage plans in real time for unknown environments. We give theorems showing the correctness of our planning strate- gies. Our experiments demonstrate that some of these strate- gies work significantly better than others, and that the best ones work very well; e.g., in environments having an average of 64,000 locations for the robot to cover, the best strategy re- turned plans with less than 6\% redundant coverage, and took only an average of 0.1 milliseconds per action.}, url = {http://www.aaai.org/ocs/index.php/FLAIRS/FLAIRS11/paper/download/2566/2992}, author = {Shivashankar,V. and Jain, R. and Kuter,U. and Nau, Dana S.} } @article {16038, title = {Reducing Missed Laboratory Results: Defining Temporal Responsibility, Generating User Interfaces for Test Process Tracking, and Retrospective Analyses to Identify Problems}, journal = {AMIA Annual Symposium ProceedingsAMIA Annu Symp Proc}, volume = {2011}, year = {2011}, month = {2011///}, pages = {1382 - 1391}, abstract = {Researchers have conducted numerous case studies reporting the details on how laboratory test results of patients were missed by the ordering medical providers. Given the importance of timely test results in an outpatient setting, there is limited discussion of electronic versions of test result management tools to help clinicians and medical staff with this complex process. This paper presents three ideas to reduce missed results with a system that facilitates tracking laboratory tests from order to completion as well as during follow-up: (1) define a workflow management model that clarifies responsible agents and associated time frame, (2) generate a user interface for tracking that could eventually be integrated into current electronic health record (EHR) systems, (3) help identify common problems in past orders through retrospective analyses.}, isbn = {1942-597X}, author = {Tarkan,Sureyya and Plaisant, Catherine and Shneiderman, Ben and Hettinger,A. Zachary} } @conference {17338, title = {Re-engineering health care with information technology: the role of computer-human interaction}, booktitle = {PART 2 {\textemdash}{\textemdash}{\textemdash}{\textendash} Proceedings of the 2011 annual conference extended abstracts on Human factors in computing systems}, series = {CHI EA {\textquoteright}11}, year = {2011}, month = {2011///}, pages = {451 - 454}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {There is critical, nation-wide need to improve health care and its cost. Health information technology has great promise that is yet to be realized. In this panel four noted experts will discuss key issues that should drive health IT, and the challenges for the CHI community to play a leading role.}, keywords = {clinical workflow, electronic medical records, health information technology visualization, healthcare informatics, participatory design, usability standards \&$\#$38; evaluation}, doi = {10.1145/1979482.1979490}, url = {http://doi.acm.org/10.1145/1979482.1979490}, author = {Butler,Keith and Payne,Thomas and Shneiderman, Ben and Brennan,Patricia and Zhang,Jiajie} } @article {12861, title = {Role of Zooplankton Diversity in Vibrio Cholerae Population Dynamics and in the Incidence of Cholera in the Bangladesh Sundarbans}, journal = {Applied and Environmental Microbiology}, volume = {77}, year = {2011}, month = {09/2011}, pages = {6125 - 6132}, abstract = {Vibrio cholerae, a bacterium autochthonous to the aquatic environment, is the causative agent of cholera, a severe watery, life-threatening diarrheal disease occurring predominantly in developing countries. V. cholerae, including both serogroups O1 and O139, is found in association with crustacean zooplankton, mainly copepods, and notably in ponds, rivers, and estuarine systems globally. The incidence of cholera and occurrence of pathogenic V. cholerae strains with zooplankton were studied in two areas of Bangladesh: Bakerganj and Mathbaria. Chitinous zooplankton communities of several bodies of water were analyzed in order to understand the interaction of the zooplankton population composition with the population dynamics of pathogenic V. cholerae and incidence of cholera. Two dominant zooplankton groups were found to be consistently associated with detection of V. cholerae and/or occurrence of cholera cases, namely, rotifers and cladocerans, in addition to copepods. Local differences indicate there are subtle ecological factors that can influence interactions between V. cholerae, its plankton hosts, and the incidence of cholera.}, isbn = {0099-2240, 1098-5336}, doi = {10.1128/AEM.01472-10}, url = {http://aem.asm.org/content/77/17/6125}, author = {De Magny,Guillaume Constantin and Mozumder,Pronob K. and Grim,Christopher J. and Hasan,Nur A. and Naser,M. Niamul and Alam,Munirul and Sack,R. Bradley and Huq,Anwar and Rita R Colwell} } @article {11906, title = {Silhouette-based gesture and action recognition via modeling trajectories on Riemannian shape manifolds}, journal = {Computer Vision and Image Understanding}, volume = {115}, year = {2011}, month = {2011/03//}, pages = {439 - 455}, abstract = {This paper addresses the problem of recognizing human gestures from videos using models that are built from the Riemannian geometry of shape spaces. We represent a human gesture as a temporal sequence of human poses, each characterized by a contour of the associated human silhouette. The shape of a contour is viewed as a point on the shape space of closed curves and, hence, each gesture is characterized and modeled as a trajectory on this shape space. We propose two approaches for modeling these trajectories. In the first template-based approach, we use dynamic time warping (DTW) to align the different trajectories using elastic geodesic distances on the shape space. The gesture templates are then calculated by averaging the aligned trajectories. In the second approach, we use a graphical model approach similar to an exemplar-based hidden Markov model, where we cluster the gesture shapes on the shape space, and build non-parametric statistical models to capture the variations within each cluster. We model each gesture as a Markov model of transitions between these clusters. To evaluate the proposed approaches, an extensive set of experiments was performed using two different data sets representing gesture and action recognition applications. The proposed approaches not only are successfully able to represent the shape and dynamics of the different classes for recognition, but are also robust against some errors resulting from segmentation and background subtraction.}, keywords = {Action recognition, Gesture recognition, Riemannian manifolds, Shape space, Silhouette-based approaches}, isbn = {1077-3142}, doi = {16/j.cviu.2010.10.006}, url = {http://www.sciencedirect.com/science/article/pii/S1077314210002377}, author = {Abdelkader,Mohamed F. and Abd-Almageed, Wael and Srivastava,Anuj and Chellapa, Rama} } @conference {17369, title = {Social discovery framework: building capacity and seeking solutions}, booktitle = {Proceedings of the 8th ACM conference on Creativity and cognition}, series = {C\&$\#$38;C {\textquoteright}11}, year = {2011}, month = {2011///}, pages = {307 - 308}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {While journalists often portray discovery as the thrilling insight of a brilliant individual, many discoveries require years of work by competing and collaborating teams. Often large amounts of foundational work are necessary and dialogs among participants help clarify goals. The Social Discovery Framework suggests that (1) there are important processes in building capacity and then seeking solutions and (2) those that initiate requests are often as important as those who seek solutions. The implications of the Social Discovery Framework are that improved social tools to build capacity, initiate requests, and support dialog would accelerate the discovery process as much as the more visible tools for individuals seeking solutions.}, keywords = {Collaboration, collective intelligence, community, creativity support tools, crowdsourcing, search, social discovery, User interfaces}, isbn = {978-1-4503-0820-5}, doi = {10.1145/2069618.2069669}, url = {http://doi.acm.org/10.1145/2069618.2069669}, author = {Shneiderman, Ben} } @article {17370, title = {Social discovery in an information abundant world: Designing to create capacity and seek solutions}, journal = {Information Services and Use}, volume = {31}, year = {2011}, month = {2011/01/01/}, pages = {3 - 13}, abstract = {The first generation of search tools provided remarkable capabilities to many researchers for finding specific information, navigating to desired websites or tracking down needed documents. A second generation of tools is helping researchers conduct exploratory search in situations where the goals are less clear, where complete coverage is necessary, and where proof of absence is required (patents, legal precedents, etc.). However, the third generation of tools turns search into social discovery, in which colleagues, informal groups, companies, non-profit organizations, professional societies, and international federations are motivated to find, filter, organize, annotate and summarize voluminous information resources. The Reader-to-Leader framework describes the usability and sociability design features needed to motivate readers, contributors, collaborators and leaders. The Social Discovery framework, proposed in this paper, suggests that effective design enables people to engage in dialogs over weeks and months to create capacity (in the manner described by the Reader-to-Leader framework), and become more effective solution seekers. Much work remains to be done to validate these social discovery frameworks and refine them to fit diverse contexts.}, doi = {10.3233/ISU-2011-0628}, url = {http://dx.doi.org/10.3233/ISU-2011-0628}, author = {Shneiderman, Ben} } @article {12442, title = {Special Issue on Video Analysis on Resource-Limited Systems}, journal = {IEEE Transactions on Circuits and Systems for Video Technology}, volume = {21}, year = {2011}, month = {2011/10//}, pages = {1349 - 1352}, abstract = {The 17 papers in this special issue focus on resource-limited systems.}, keywords = {computational complexity, Image Enhancement, Special issues and sections, Video compression}, isbn = {1051-8215}, doi = {10.1109/TCSVT.2011.2165795}, author = {Chellapa, Rama and Cavallaro, A. and Wu,Y. and Shan, C. and Fu, Y. and Pulli, K.} } @inbook {17378, title = {Speeding Up Network Layout and Centrality Measures for Social Computing Goals}, booktitle = {Social Computing, Behavioral-Cultural Modeling and PredictionSocial Computing, Behavioral-Cultural Modeling and Prediction}, series = {Lecture Notes in Computer Science}, volume = {6589}, year = {2011}, month = {2011///}, pages = {244 - 251}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {This paper presents strategies for speeding up calculation of graph metrics and layout by exploiting the parallel architecture of modern day Graphics Processing Units (GPU), specifically Compute Unified Device Architecture ( CUDA ) by Nvidia . Graph centrality metrics like Eigenvector , Betweenness , Page Rank and layout algorithms like Fruchterman - Rheingold are essential components of Social Network Analysis ( SNA ). With the growth in adoption of SNA in different domains and increasing availability of huge networked datasets for analysis, social network analysts require faster tools that are also scalable. Our results, using NodeXL, show up to 802 times speedup for a Fruchterman-Rheingold graph layout and up to 17,972 times speedup for Eigenvector centrality metric calculations on a 240 core CUDA-capable GPU.}, isbn = {978-3-642-19655-3}, url = {http://dx.doi.org/10.1007/978-3-642-19656-0_35}, author = {Sharma,Puneet and Khurana,Udayan and Shneiderman, Ben and Scharrenbroich,Max and Locke,John}, editor = {Salerno,John and Yang,Shanchieh and Nau, Dana S. and Chai,Sun-Ki} } @conference {14736, title = {State transfer for clear and efficient runtime updates}, booktitle = {2011 IEEE 27th International Conference on Data Engineering Workshops (ICDEW)}, year = {2011}, month = {2011/04/11/16}, pages = {179 - 184}, publisher = {IEEE}, organization = {IEEE}, abstract = {Dynamic software updating (DSU), the practice of updating software while it executes, is a lively area of research. The DSU approach most prominent in both commercial and research systems is in-place updating, in which patches containing program modifications are loaded into a running process. However, in-place updating suffers from several problems: it requires complex tool support, it may adversely affect the performance of normal execution, it requires challenging reasoning to understand the behavior of an updated program, and it requires extra effort to modify program state to be compatible with an update. This paper presents preliminary work investigating the potential for state transfer updating to address these problems. State transfer updates work by launching a new process running the updated program version and transferring program state from the running process to the updated version. In this paper, we describe the use and implementation of Ekiden, a new state transfer updating library for C/C++ programs. Ekiden seeks to redress the difficulties of in-place updating, and we report on our experience updating VSFTPD using Ekiden. This initial experience suggests that state transfer provides the availability benefits of in-place DSU approaches while addressing many of their shortcomings.}, keywords = {C++ language, C++ program, Cognition, complex tool support, dynamic software updating, efficient runtime update, in-place DSU approach, Libraries, Operating systems, program modification, Program processors, program transfer, program version, Runtime, servers, software libraries, Software maintenance, state transfer update, Steady-state, updating library, VSFTPD}, isbn = {978-1-4244-9195-7}, doi = {10.1109/ICDEW.2011.5767632}, author = {Hayden,C.M. and Smith,E. K and Hicks, Michael W. and Foster, Jeffrey S.} } @article {12439, title = {Statistical Computations on Grassmann and Stiefel Manifolds for Image and Video-Based Recognition}, journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {33}, year = {2011}, month = {2011/11//}, pages = {2273 - 2286}, abstract = {In this paper, we examine image and video-based recognition applications where the underlying models have a special structure-the linear subspace structure. We discuss how commonly used parametric models for videos and image sets can be described using the unified framework of Grassmann and Stiefel manifolds. We first show that the parameters of linear dynamic models are finite-dimensional linear subspaces of appropriate dimensions. Unordered image sets as samples from a finite-dimensional linear subspace naturally fall under this framework. We show that an inference over subspaces can be naturally cast as an inference problem on the Grassmann manifold. To perform recognition using subspace-based models, we need tools from the Riemannian geometry of the Grassmann manifold. This involves a study of the geometric properties of the space, appropriate definitions of Riemannian metrics, and definition of geodesics. Further, we derive statistical modeling of inter and intraclass variations that respect the geometry of the space. We apply techniques such as intrinsic and extrinsic statistics to enable maximum-likelihood classification. We also provide algorithms for unsupervised clustering derived from the geometry of the manifold. Finally, we demonstrate the improved performance of these methods in a wide variety of vision applications such as activity recognition, video-based face recognition, object recognition from image sets, and activity-based video clustering.}, keywords = {activity based video clustering, activity recognition, computational geometry, Computational modeling, Data models, face recognition, feature representation, finite dimensional linear subspaces, geometric properties, Geometry, Grassmann Manifolds, Grassmann., HUMANS, Image and video models, image recognition, linear dynamic models, linear subspace structure, Manifolds, maximum likelihood classification, maximum likelihood estimation, Object recognition, Riemannian geometry, Riemannian metrics, SHAPE, statistical computations, statistical models, Stiefel, Stiefel Manifolds, unsupervised clustering, video based face recognition, video based recognition, video signal processing}, isbn = {0162-8828}, doi = {10.1109/TPAMI.2011.52}, author = {Turaga,P. and Veeraraghavan,A. and Srivastava, A. and Chellapa, Rama} } @article {19118, title = {Suppression subtractive hybridization PCR isolation of cDNAs from a Caribbean soft coral}, journal = {Electronic Journal of Biotechnology}, volume = {14}, year = {2011}, month = {2011}, pages = {8 - 9}, author = {Lopez, J.V. and Ledger, A. and Santiago-V{\'a}zquez, L.Z. and Pop, Mihai and Sommer, D.D. and Ranzer, L.K. and Feldman, R.A. and Russell, G.K.} } @article {18543, title = {A survey of virtual LAN usage in campus networks}, journal = {Communications Magazine, IEEE}, volume = {49}, year = {2011}, month = {2011/07//}, pages = {98 - 103}, abstract = {VLANs are widely used in today{\textquoteright}s enterprise networks to improve Ethernet scalability and support network policies. However, manuals and textbooks offer very little information about how VLANs are actually used in practice. Through discussions with network administrators and analysis of configuration data, we describe how three university campuses and one academic department use VLANs to achieve a variety of goals. We argue that VLANs are ill-suited to some of these goals (e.g., VLANs are often used to realize access control policies, but constrain the types of policies that can be expressed). Furthermore, the use of VLANs leads to significant complexity in the configuration of network devices.}, keywords = {academic department, campus network, educational computing, Educational institutions, Ethernet scalability, Local area networks, network policy support, university campus, virtual LAN usage, VLAN}, isbn = {0163-6804}, doi = {10.1109/MCOM.2011.5936161}, author = {Yu,Minlan and Rexford,J. and Sun,Xin and Rao,Sanjay and Feamster, Nick} } @conference {12441, title = {Synthesis-based recognition of low resolution faces}, booktitle = {2011 International Joint Conference on Biometrics (IJCB)}, year = {2011}, month = {2011/10/11/13}, pages = {1 - 6}, publisher = {IEEE}, organization = {IEEE}, abstract = {Recognition of low resolution face images is a challenging problem in many practical face recognition systems. Methods have been proposed in the face recognition literature for the problem when the probe is of low resolution, and a high resolution gallery is available for recognition. These methods modify the probe image such that the resultant image provides better discrimination. We formulate the problem differently by leveraging the information available in the high resolution gallery image and propose a generative approach for classifying the probe image. An important feature of our algorithm is that it can handle resolution changes along with illumination variations. The effective- ness of the proposed method is demonstrated using standard datasets and a challenging outdoor face dataset. It is shown that our method is efficient and can perform significantly better than many competitive low resolution face recognition algorithms.}, keywords = {Dictionaries, Face, face images, face recognition, face recognition literature, face recognition systems, illumination variations, image resolution, low resolution faces, Organizations, PROBES, support vector machines, synthesis based recognition}, isbn = {978-1-4577-1358-3}, doi = {10.1109/IJCB.2011.6117545}, author = {Shekhar, S. and Patel, Vishal M. and Chellapa, Rama} } @article {17744, title = {SYSTEM AND METHOD FOR DATA MANAGEMENT IN LARGE DATA NETWORKS}, volume = {WO/2011/032077}, year = {2011}, month = {2011/03//}, abstract = {A system and method for storing an input data network, in the form of graph is provided. The system includes a master node and a plurality of slave nodes. The master node is operable to receive the data network in the form of a graph, the graph including a plurality of vertices connected by edges; calculate a probability of co-retrieval for each of the plurality of vertices; and assign each of the plurality of vertices to one of the plurality of compute nodes based on the calculated probability of co-retrieval. Another method and system are provided for converting a dataset into a graph based index and storing the index on disk. Respective systems and methods of querying such data networks are also provided.}, author = {BROECHELER,M. and V.S. Subrahmanian and Pugliese, A.} } @article {16045, title = {A task taxonomy of network evolution analysis}, journal = {University of Maryland, Human-Computer Interaction Lab Tech Report HCIL-2011-09}, year = {2011}, month = {2011///}, abstract = {Visualization is a useful tool for understanding the nature of networks. The recent growth of social media requires morepowerful visualization techniques beyond static network diagrams. One of the most important challenges is the visualization of temporal network evolution. In order to provide strong temporal visualization methods, we need to understand what tasks users accomplish. This study provides a taxonomy of the temporal network visualization tasks. We identify (1) the entities, (2) the properties to be visualized, and (3) the hierarchy of temporal features, which were extracted by surveying existing temporal network visualization systems. By building and examining the task taxonomy, we report which tasks have been covered so far and suggest additions for designing the future visualizations. We also present example visualizations constructed using the task taxonomy for a social networking site in order to validate the quality of the taxonomy. }, author = {Ahn,JW and Plaisant, Catherine and Shneiderman, Ben} } @conference {19258, title = {Teaching cross-platform design and testing methods for embedded systems using DICE}, series = {WESE {\textquoteright}11}, year = {2011}, month = {2011}, pages = {38 - 45}, publisher = {ACM}, organization = {ACM}, 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 platform- and language-independent focus of DICE makes it an effective vehicle for teaching high-productivity, high-reliability methods for design and implementation of embedded systems for a variety of courses. In this paper, we provide an overview of features of DICE --- particularly as they relate to testing driven design practices --- that are useful in embedded systems education, and discuss examples and experiences of applying the tool in courses at the University of Maryland aimed at diverse groups of students --- undergraduate programming concepts for engineers, graduate VLSI architectures (aimed at research-oriented students), and graduate FPGA system design (aimed at professional Master{\textquoteright}s students).}, isbn = {978-1-4503-1046-8}, url = {http://doi.acm.org/10.1145/2077370.2077376}, author = {Bhattacharyya, Shuvra S. and Plishker,William and Gupta, Ayush and Chung-Ching Shen} } @article {17396, title = {Technology-mediated social participation: the next 25 years of HCI challenges}, journal = {Human-Computer Interaction. Design and Development Approaches}, year = {2011}, month = {2011///}, pages = {3 - 14}, abstract = {The dramatic success of social media such as Facebook, Twitter, YouTube, blogs, and traditional discussion groups empowers individuals to become active in local and global communities. Some enthusiasts believe that with modest redesign, these technologies can be harnessed to support national priorities such as healthcare/wellness, disaster response, community safety, energy sustainability, etc. However, accomplishing these ambitious goals will require long-term research to develop validated scientific theories and reliable, secure, and scalable technology strategies. The enduring questions of how to motivate participation, increase social trust, and promote collaboration remain grand challenges even as the technology rapidly evolves. This talk invites researchers across multiple disciplines to participate in redefining our discipline of Human-Computer Interaction (HCI) along more social lines to answer vital research questions while creating inspirational prototypes, conducting innovative evaluations, and developing robust technologies. By placing greater emphasis on social media, the HCI community could constructively influence these historic changes.}, author = {Shneiderman, Ben} } @inbook {16046, title = {Temporal Visualization of Social Network Dynamics: Prototypes for Nation of Neighbors}, booktitle = {Social Computing, Behavioral-Cultural Modeling and PredictionSocial Computing, Behavioral-Cultural Modeling and Prediction}, series = {Lecture Notes in Computer Science}, volume = {6589}, year = {2011}, month = {2011///}, pages = {309 - 316}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {Information visualization is a powerful tool for analyzing the dynamic nature of social communities. Using Nation of Neighbors community network as a testbed, we propose five principles of implementing temporal visualizations for social networks and present two research prototypes: NodeXL and TempoVis. Three different states are defined in order to visualize the temporal changes of social networks. We designed the prototypes to show the benefits of the proposed ideas by letting users interactively explore temporal changes of social networks.}, isbn = {978-3-642-19655-3}, url = {http://dx.doi.org/10.1007/978-3-642-19656-0_43}, author = {Ahn,Jae-wook and Taieb-Maimon,Meirav and Sopan,Awalin and Plaisant, Catherine and Shneiderman, Ben}, editor = {Salerno,John and Yang,Shanchieh and Nau, Dana S. and Chai,Sun-Ki} } @article {19256, title = {Topological Patterns for Scalable Representation and Analysis of Dataflow Graphs}, journal = {Journal of Signal Processing Systems}, volume = {65}, year = {2011}, month = {2011}, pages = {229 - 244}, abstract = {Tools for designing signal processing systems with their semantic foundation in dataflow modeling often use high-level graphical user interfaces (GUIs) or text based languages that allow specifying applications as directed graphs. Such graphical representations serve as an initial reference point for further analysis and optimizations that lead to platform-specific implementations. For large-scale applications, the underlying graphs often consist of smaller substructures that repeat multiple times. To enable more concise representation and direct analysis of such substructures in the context of high level DSP specification languages and design tools, we develop the modeling concept of topological patterns, and propose ways for supporting this concept in a high-level language. We augment the dataflow interchange format (DIF) language{\textemdash}a language for specifying DSP-oriented dataflow graphs{\textemdash}with constructs for supporting topological patterns, and we show how topological patterns can be effective in various aspects of embedded signal processing design flows using specific application examples.}, keywords = {Circuits and Systems, Computer Imaging, Vision, Pattern Recognition and Graphics, Dataflow graphs, Electrical Engineering, High-level languages, Image Processing and Computer Vision, model-based design, pattern recognition, Signal processing systems, Signal, Image and Speech Processing, Topological patterns}, isbn = {1939-8018, 1939-8115}, url = {http://link.springer.com/article/10.1007/s11265-011-0610-1}, author = {Sane, Nimish and Kee, Hojin and Seetharaman, Gunasekaran and Bhattacharyya, Shuvra S.} } @conference {19507, title = {Toward a Standard Benchmark for Computer Security Research: The Worldwide Intelligence Network Environment (WINE)}, booktitle = {BADGERS {\textquoteright}11 Proceedings of the First Workshop on Building Analysis Datasets and Gathering Experience Returns for Security}, series = {BADGERS {\textquoteright}11}, year = {2011}, month = {2011///}, pages = {89 - 96}, publisher = {ACM}, organization = {ACM}, abstract = {Unlike benchmarks that focus on performance or reliability evaluations, a benchmark for computer security must necessarily include sensitive code and data. Because these artifacts could damage systems or reveal personally identifiable information about the users affected by cyber attacks, publicly disseminating such a benchmark raises several scientific, ethical and legal challenges. We propose the Worldwide Intelligence Network Environment (WINE), a security-benchmarking approach based on rigorous experimental methods. WINE includes representative field data, collected worldwide from 240,000 sensors, for new empirical studies, and it will enable the validation of research on all the phases in the lifecycle of security threats. We tackle the key challenges for security benchmarking by designing a platform for repeatable experimentation on the WINE data sets and by collecting the metadata required for understanding the results. In this paper, we review the unique characteristics of the WINE data, we discuss why rigorous benchmarking will provide fresh insights on the security arms race and we propose a research agenda for this area.}, isbn = {978-1-4503-0768-0}, url = {http://doi.acm.org/10.1145/1978672.1978683}, author = {Tudor Dumitras and Shou, Darren} } @article {13949, title = {Toward improved aeromechanics simulations using recent advancements in scientific computing}, journal = {Proceedings 67th Annual Forum of the American Helicopter Society}, year = {2011}, month = {2011///}, pages = {3 - 5}, author = {Hu,Q. and Syal,M. and Gumerov, Nail A. and Duraiswami, Ramani and Leishman,J.G.} } @article {15450, title = {Towards incremental component compatibility testing}, journal = {Proceedings of the 14th international ACM Sigsoft symposium on Component based software engineering, CBSE}, volume = {11}, year = {2011}, month = {2011///}, pages = {119 - 128}, abstract = {Software components are increasingly assembled from othercomponents. Each component may further depend on oth- ers, and each may have multiple active versions. The to- tal number of configurations{\textemdash}combinations of components and their versions{\textemdash}deployed by end users can be very large. Component developers, therefore, spend considerable time and effort doing compatibility testing {\textendash} determining whether their components can be built correctly for all deployed con- figurations. In previous work we developed Rachet to sup- port large-scale compatibility testing of components. In this paper, we describe and evaluate methods to enable Rachet to perform incremental compatibility testing. We de- scribe algorithms to compute differences in component com- patibilities between current and previous component builds, a formal test adequacy criterion based on covering the differ- ences, and cache-aware configuration sampling and testing methods that attempt to reuse effort from previous testing sessions. We evaluate our approach using the 5-year evo- lution history of a scientific middleware component. Our results show significant performance improvements over Ra- chet{\textquoteright}s previous retest-all approach, making the process of compatibility testing practical for evolving components. }, author = {Yoon,I. and Sussman, Alan and Memon, Atif M. and Porter, Adam} } @article {19047, title = {Towards Practical Oblivious RAM}, journal = {arXiv:1106.3652}, year = {2011}, month = {2011}, abstract = {We take an important step forward in making Oblivious RAM (O-RAM) practical. We propose an O-RAM construction achieving an amortized overhead of 20X-35X (for an O-RAM roughly 1 terabyte in size), about 63 times faster than the best existing scheme. On the theoretic front, we propose a fundamentally novel technique for constructing Oblivious RAMs: specifically, we partition a bigger O-RAM into smaller O-RAMs, and employ a background eviction technique to obliviously evict blocks from the client-side cache into a randomly assigned server-side partition. This novel technique is the key to achieving the gains in practical performance.}, keywords = {Computer Science - Cryptography and Security}, url = {http://arxiv.org/abs/1106.3652}, author = {Stefanov, Emil and Elaine Shi and Song, Dawn} } @article {17435, title = {Tragic errors: usability and electronic health records}, journal = {Interactions}, volume = {18}, year = {2011}, month = {2011/11//}, pages = {60 - 63}, isbn = {1072-5520}, doi = {10.1145/2029976.2029992}, url = {http://doi.acm.org/10.1145/2029976.2029992}, author = {Shneiderman, Ben} } @conference {18794, title = {Trajectory planning with look-ahead for Unmanned Sea Surface Vehicles to handle environmental disturbances}, year = {2011}, month = {2011///}, pages = {1154 - 1159}, url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=6048670}, author = {Svec,P. and Schwartz,M. and Thakur,A. and Gupta,S.K.} } @article {17439, title = {TreeCovery: Coordinated dual treemap visualization for exploring the Recovery Act}, journal = {Government Information Quarterly}, year = {2011}, month = {2011///}, abstract = {The American Recovery and Reinvestment Act dedicated $787 billion to stimulate the U.S. economy and mandated the release of the data describing the exact distribution of that money. The dataset is a large and complex one; one of its distinguishing features is its bi-hierarchical structure, arising from the distribution of money through agencies to specific projects and the natural aggregation of awards based on location. To offer a comprehensive overview of the data, a visualization must incorporate both these hierarchies. We present TreeCovery, a tool that accomplishes this through the use of two coordinated treemaps. The tool includes a number of innovative features, including coordinated zooming and filtering and a proportional highlighting technique across the two trees. TreeCovery was designed to facilitate data exploration, and initial user studies suggest that it will be helpful in insight generation. RATB (Recovery Accountability and Transparency Board) has tested TreeCovery and is considering including the concept in their visual analytics.}, keywords = {Recovery Act, user interface, Visual analytic}, isbn = {0740-624X}, doi = {10.1016/j.giq.2011.07.004}, url = {http://www.sciencedirect.com/science/article/pii/S0740624X11001055}, author = {Rios-Berrios,Miguel and Sharma,Puneet and Lee,Tak Yeon and Schwartz,Rachel and Shneiderman, Ben} } @conference {17442, title = {TreeVersity: Comparing tree structures by topology and node{\textquoteright}s attributes differences}, booktitle = {2011 IEEE Conference on Visual Analytics Science and Technology (VAST)}, year = {2011}, month = {2011/10/23/28}, pages = {275 - 276}, publisher = {IEEE}, organization = {IEEE}, abstract = {It is common to classify data in hierarchies, they provide a comprehensible way of understanding big amounts of data. From budgets to organizational charts or even the stock market, trees are everywhere and people find them easy to use. However when analysts need to compare two versions of the same tree structure, or two related taxonomies, the task is not so easy. Much work has been done on this topic, but almost all of it has been restricted to either compare the trees by topology, or by the node attribute values. With this project we are proposing TreeVersity, a framework for comparing tree structures, both by structural changes and by differences in the node attributes. This paper is based on our previous work on comparing traffic agencies using LifeFlow [1, 2] and on a first prototype of TreeVersity.}, keywords = {Computer science, data classification, Data visualization, Educational institutions, hierarchy, Image color analysis, LifeFlow, node attributes differences, Pattern classification, structural changes, Topology, topology attributes differences, traffic agencies, tree structures comparison, trees (mathematics), TreeVersity, Vegetation, Visualization}, isbn = {978-1-4673-0015-5}, doi = {10.1109/VAST.2011.6102471}, author = {Gomez,J.A.G. and Buck-Coleman,A. and Plaisant, Catherine and Shneiderman, Ben} } @conference {16034, title = {TreeVersity: Comparing tree structures by topology and node{\textquoteright}s attributes differences}, booktitle = {Visual Analytics Science and Technology (VAST), 2011 IEEE Conference on}, year = {2011}, month = {2011/10//}, pages = {275 - 276}, abstract = {It is common to classify data in hierarchies, they provide a comprehensible way of understanding big amounts of data. From budgets to organizational charts or even the stock market, trees are everywhere and people find them easy to use. However when analysts need to compare two versions of the same tree structure, or two related taxonomies, the task is not so easy. Much work has been done on this topic, but almost all of it has been restricted to either compare the trees by topology, or by the node attribute values. With this project we are proposing TreeVersity, a framework for comparing tree structures, both by structural changes and by differences in the node attributes. This paper is based on our previous work on comparing traffic agencies using LifeFlow [1, 2] and on a first prototype of TreeVersity.}, keywords = {(mathematics);, agencies;tree, attributes, changes;topology, classification;hierarchy;node, classification;trees, comparison;pattern, differences;structural, differences;traffic, LifeFlow;TreeVersity;data, STRUCTURES}, doi = {10.1109/VAST.2011.6102471}, author = {Gomez,J.A.G. and Buck-Coleman,A. and Plaisant, Catherine and Shneiderman, Ben} } @article {17445, title = {Tutorial-Graph Analytics {\textemdash} Lessons Learned and Challenges Ahead}, journal = {IEEE Computer Graphics and Applications}, volume = {31}, year = {2011}, month = {2011///}, pages = {18 - 18}, author = {Wong,P.C. and Chen,C. and G{\"o}rg,C. and Shneiderman, Ben and Stasko,J. and Thomas,J.} } @article {14488, title = {Understanding actor loyalty to event-based groups in affiliation networks}, journal = {Social Network Analysis and Mining}, volume = {1}, year = {2011}, month = {2011///}, pages = {115 - 126}, abstract = {In this paper, we introduce a method for analyzing the temporal dynamics of affiliation networks. We define affiliation groups which describe temporally related subsets of actors and describe an approach for exploring changing memberships in these affiliation groups over time. To model the dynamic behavior in these networks, we consider the concept of loyalty and introduce a measure that captures an actor{\textquoteright}s loyalty to an affiliation group as the degree of {\textquoteleft}commitment{\textquoteright} an actor shows to the group over time. We evaluate our measure using three real world affiliation networks: a publication network, a senate bill cosponsorship network, and a dolphin network. The results show the utility of our measure for analyzing the dynamic behavior of actors and quantifying their loyalty to different time-varying affiliation groups.}, doi = {10.1007/s13278-010-0005-5}, author = {Sharara,H. and Singh,L. and Getoor, Lise and Mann,J.} } @article {13882, title = {Understanding Scientific Literature Networks: An Evaluation of Action Science Explorer}, year = {2011}, month = {2011///}, institution = {University of Maryland at College Park}, abstract = {Action Science Explorer (ASE) is a tool designed to supportusers in rapidly generating readily consumable summaries of academic literature. The authors describe ASE and report on how early formative evaluations led to a mature system evaluation, consisting of an in-depth empirical evaluation with 4 domain expert participants. The user study tasks were of two types: predefined tasks to test system perfor- mance in common scenarios, and user-defined tasks to test the system{\textquoteright}s usefulness for custom exploration goals. This paper concludes by describing ASE{\textquoteright}s attribute ranking ca- pability which is a novel contribution for exploring scientific literature networks. It makes design recommendations to: give the users control over which documents to explore, easy- to-understand metrics for ranking documents, and overviews of the document set in coordinated views along with details- on-demand of specific papers. }, author = {Gove,R. and Dunne,C. and Shneiderman, Ben and Klavans,J. and Dorr, Bonnie J} } @article {13351, title = {A unified approach to ranking in probabilistic databases}, journal = {The VLDB Journal}, volume = {20}, year = {2011}, month = {2011/04//}, pages = {249 - 275}, abstract = {Ranking is a fundamental operation in data analysis and decision support and plays an even more crucial role if the dataset being explored exhibits uncertainty. This has led to much work in understanding how to rank the tuples in a probabilistic dataset in recent years. In this article, we present a unified approach to ranking and top-k query processing in probabilistic databases by viewing it as a multi-criterion optimization problem and by deriving a set of features that capture the key properties of a probabilistic dataset that dictate the ranked result. We contend that a single, specific ranking function may not suffice for probabilistic databases, and we instead propose two parameterized ranking functions, called PRF {\textquestiondown} and PRF e, that generalize or can approximate many of the previously proposed ranking functions. We present novel generating functions-based algorithms for efficiently ranking large datasets according to these ranking functions, even if the datasets exhibit complex correlations modeled using probabilistic and/xor trees or Markov networks. We further propose that the parameters of the ranking function be learned from user preferences, and we develop an approach to learn those parameters. Finally, we present a comprehensive experimental study that illustrates the effectiveness of our parameterized ranking functions, especially PRF e, at approximating other ranking functions and the scalability of our proposed algorithms for exact or approximate ranking.}, keywords = {Approximation techniques, Graphical models, Learning to rank, Probabilistic databases, Ranking}, isbn = {1066-8888}, doi = {10.1007/s00778-011-0220-3}, url = {http://dx.doi.org/10.1007/s00778-011-0220-3}, author = {Li,Jian and Saha,Barna and Deshpande, Amol} } @article {17462, title = {Usability and Accessibility in Consumer Health Informatics: Current Trends and Future Challenges}, journal = {American Journal of Preventive Medicine}, volume = {40}, year = {2011}, month = {2011/05//}, pages = {S187-S197 - S187-S197}, abstract = {It is a truism that, for innovative eHealth systems to have true value and impact, they must first and foremost be usable and accessible by clinicians, consumers, and other stakeholders. In this paper, current trends and future challenges in the usability and accessibility of consumer health informatics will be described. Consumer expectations of their healthcare providers and healthcare records in this new era of consumer-directed care will be explored, and innovative visualizations, assistive technologies, and other ways that healthcare information is currently being provided and/or shared will be described. Challenges for ensuring the usability of current and future systems will also be discussed. An innovative model for conducting systematic, timely, user-centered research on consumer-facing websites at the National Cancer Institute (NCI) and the ongoing efforts at the National Institute of Standards and Technology (NIST) to promote health information technology (HIT) usability standards and evaluation criteria will also be presented.}, isbn = {0749-3797}, doi = {10.1016/j.amepre.2011.01.009}, url = {http://www.sciencedirect.com/science/article/pii/S0749379711000869}, author = {Goldberg,Larry and Lide,Bettijoyce and Lowry,Svetlana and Massett,Holly A. and O{\textquoteright}Connell,Trisha and Preece,Jennifer and Quesenbery,Whitney and Shneiderman, Ben} } @conference {13476, title = {Using Agent-Based Simulation to Determine an Optimal Lane-Changing Strategy on a Multi-Lane Highway}, booktitle = {2011 AAAI Fall Symposium Series}, year = {2011}, month = {2011///}, author = {Tuzo,J. and Seymour,J. and desJardins, Marie and others} } @article {19264, title = {Using the DSPCAD Integrative Command-Line Environment: User{\textquoteright}s Guide for DICE Version 1.1}, year = {2011}, month = {2011}, abstract = {This document provides instructions on setting up, starting up, andbuilding DICE and its key companion packages, dicemin and dicelang. This installation process is based on a general set of conventions, which we refer to as the DICE organizational conventions, for software packages. The DICE organizational conventions are specified in this report. These conventions are applied in DICE, dicemin, and dicelang, and also to other software packages that are developed in the Maryland DSPCAD Research Group. }, keywords = {Technical Report}, isbn = {UMIACS-TR-2011-13}, doi = {Technical Report}, url = {http://drum.lib.umd.edu//handle/1903/11804}, author = {Bhattacharyya, Shuvra S. and Chung-Ching Shen and Plishker,William and Sane, Nimish and Zaki, George} } @conference {12445, title = {Variable remapping of images from very different sources}, booktitle = {2011 18th IEEE International Conference on Image Processing (ICIP)}, year = {2011}, month = {2011/09/11/14}, pages = {1501 - 1504}, publisher = {IEEE}, organization = {IEEE}, abstract = {We present a system which registers image sequences acquired by very different sources, so that multiple views could be transformed to the same coordinates system. This enables the functionality of automatic object identification and confirmation across views and platforms. The capability of the system comes from three ingredients: 1) image context enlargement through temporal integration; 2) robust motion estimation using the G-RANSAC framework with a relaxed correspondence criteria; 3) constrained motion estimation within the G-RANSAC framework. The proposed system has worked successfully on thousands of frames from multiple collections with significant variations in scale and resolution.}, keywords = {automatic object identification, Buildings, CAMERAS, Conferences, constrained motion estimation, coordinates system, Estimation, G-RANSAC framework, image context enlargement, Image Enhancement, image registration, image sequence registration, Image sequences, Motion estimation, Robustness, temporal integration, variable image remapping}, isbn = {978-1-4577-1304-0}, doi = {10.1109/ICIP.2011.6115729}, author = {Wei Zhang and Yanlin Guo and Meth, R. and Sokoloff, H. and Pope, A. and Strat, T. and Chellapa, Rama} } @conference {17484, title = {Visual Analysis of Temporal Trends in Social Networks Using Edge Color Coding and Metric Timelines}, booktitle = {Privacy, Security, Risk and Trust (PASSAT), 2011 IEEE Third International Conference on and 2011 IEEE Third International Confernece on Social Computing (SocialCom)}, year = {2011}, month = {2011/10/09/11}, pages = {549 - 554}, publisher = {IEEE}, organization = {IEEE}, abstract = {We present Net EvViz, a visualization tool for analysis and exploration of a dynamic social network. There are plenty of visual social network analysis tools but few provide features for visualization of dynamically changing networks featuring the addition or deletion of nodes or edges. Our tool extends the code base of the Node XL template for Microsoft Excel, a popular network visualization tool. The key features of this work are (1) The ability of the user to specify and edit temporal annotations to the network components in an Excel sheet, (2) See the dynamics of the network with multiple graph metrics plotted over the time span of the graph, called the Timeline, and (3) Temporal exploration of the network layout using an edge coloring scheme and a dynamic Time slider. The objectives of the new features presented in this paper are to let the data analysts, computer scientists and others to observe the dynamics or evolution in a network interactively. We presented Net EvViz to five users of Node XL and received positive responses.}, keywords = {Color, computer scientists, data analysts, data visualisation, Data visualization, dynamic social network, dynamic timeslider, edge color coding, excel sheet, Image coding, image colour analysis, Layout, measurement, metric timelines, Microsoft excel, multiple graph metrics, Net EvViz, network components, network layout, network visualization tool, NodeXL template, social networking (online), temporal trends, Twitter, Visualization}, isbn = {978-1-4577-1931-8}, doi = {10.1109/PASSAT/SocialCom.2011.212}, author = {Khurana,U. and Nguyen,Viet-An and Hsueh-Chien Cheng and Ahn,Jae-wook and Chen,Xi and Shneiderman, Ben} } @article {17487, title = {Visual Exploration across Biomedical Databases}, journal = {IEEE/ACM Transactions on Computational Biology and Bioinformatics}, volume = {8}, year = {2011}, month = {2011/04//March}, pages = {536 - 550}, abstract = {Though biomedical research often draws on knowledge from a wide variety of fields, few visualization methods for biomedical data incorporate meaningful cross-database exploration. A new approach is offered for visualizing and exploring a query-based subset of multiple heterogeneous biomedical databases. Databases are modeled as an entity-relation graph containing nodes (database records) and links (relationships between records). Users specify a keyword search string to retrieve an initial set of nodes, and then explore intra- and interdatabase links. Results are visualized with user-defined semantic substrates to take advantage of the rich set of attributes usually present in biomedical data. Comments from domain experts indicate that this visualization method is potentially advantageous for biomedical knowledge exploration.}, keywords = {Bioinformatics, Biomedical computing, biomedical databases, cross-database exploration, Data exploration and discovery, Data visualization, database management systems, Databases, Factual, DNA, graph theory, Information Storage and Retrieval, information visualization., Keyword search, medical computing, natural language processing, Proteins, semantic networks, semantics, sequences, text mining, User-Computer Interface, user-defined semantics, visual databases}, isbn = {1545-5963}, doi = {10.1109/TCBB.2010.1}, author = {Lieberman,M.D. and Taheri, S. and Guo,Huimin and Mirrashed,F. and Yahav,I. and Aris,A. and Shneiderman, Ben} } @conference {16417, title = {When does simulated data match real data?}, booktitle = {Proceedings of the 13th annual conference companion on Genetic and evolutionary computation}, series = {GECCO {\textquoteright}11}, year = {2011}, month = {2011///}, pages = {231 - 232}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Agent-based models can replicate real-world patterns, but finding parameters that achieve the best match can be difficult. To validate a model, a real-world dataset is often divided into a training set (to calibrate the parameters) and a test set (to validate the calibrated model). The difference between the training and test data and the simulated data is determined using an error measure. In the context of evolutionary computation techniques, the error measure also serves as a fitness function, and thus affects evolutionary search dynamics. We survey the effect of five different error measures on both a toy problem and a real world problem of matching a model to empirical online news consumption behavior. We use each error measure separately for calibration on the training dataset, and then examine the results of all five error measures on both the training and testing datasets. We show that certain error measures sometimes serve as better fitness functions than others, and in fact using one error measure may result in better calibration (on a different measure) than using the different measure directly. For the toy problem, the Pearson{\textquoteright}s correlation measure dominated all other measures, but no single error measure was Pareto dominant for the real world problem.}, keywords = {Agent-based modeling, business, Calibration, Genetic algorithms, information search, network analysis}, isbn = {978-1-4503-0690-4}, doi = {10.1145/2001858.2001988}, url = {http://doi.acm.org/10.1145/2001858.2001988}, author = {Stonedahl,Forrest and Anderson,David and Rand, William} } @conference {19464, title = {Why is My Internet Slow?: Making Network Speeds Visible}, booktitle = {SIGCHI {\textquoteright}11}, series = {CHI {\textquoteright}11}, year = {2011}, month = {2011///}, pages = {1889 - 1898}, publisher = {ACM}, organization = {ACM}, abstract = {With widespread broadband adoption, more households report experiencing sub-optimal speeds. Not only are slow speeds frustrating, they may indicate consumers are not receiving the services they are paying for from their internet service providers. Yet, determining the speed and source of slow-downs is difficult because few tools exist for broadband management. We report on results of a field trial with 10 households using a visual network probe designed to address these problems. We describe the results of the study and provide design implications for future tools. More importantly, we argue that tools like this can educate and empower consumers by making broadband speeds and sources of slow-downs more visible.}, keywords = {broadband speed, broadband tools, home networks}, isbn = {978-1-4503-0228-9}, url = {http://doi.acm.org/10.1145/1978942.1979217}, author = {Marshini Chetty and Haslem, David and Baird, Andrew and Ofoha, Ugochi and Sumner, Bethany and Grinter, Rebecca} } @article {14374, title = {AI Theory and Practice: A Discussion on Hard Challenges and Opportunities Ahead}, journal = {AI Magazine}, volume = {31}, year = {2010}, month = {2010/07/28/}, pages = {103 - 114}, abstract = {AI Theory and Practice: A Discussion on Hard Challenges and Opportunities Ahead}, isbn = {0738-4602}, doi = {10.1609/aimag.v31i3.2293}, url = {http://www.aaai.org/ojs/index.php/aimagazine/article/viewArticle/2293}, author = {Horvitz,Eric and Getoor, Lise and Guestrin,Carlos and Hendler,James and Konstan,Joseph and Subramanian,Devika and Wellman,Michael and Kautz,Henry} } @book {16975, title = {Analyzing Social Media Networks with NodeXL}, year = {2010}, month = {2010/08/27/}, publisher = {Morgan Kaufmann}, organization = {Morgan Kaufmann}, abstract = {"Analyzing Social Media Networks with NodeXL provides a much needed resource for the social media research community, as it describes network theory, provides compelling examples using data sources like Twitter and Flickr, and highlights how to use a free sophisticated tool for analysis. This is the perfect book for anyone trying to analyze the behavior of online social networks and beyond." ---Adam Perer, Research Scientist, IBM Research "This book provides a basic introduction to social network analysis, followed by practical instruction and examples on gathering data from online sources, importing into Excel, and then analyzing the data through Excel. The book will be important for promoting research in the area for those in information science, sociology, cultural studies, virtual community, and e-commerce."---Caroline Haythornthwaite, PhD, Professor, Graduate School of Library and Information Science, University of Illinois at Urbana-Champaign Businesses, entrepreneurs, individuals, and government agencies alike are looking to social network analysis (SNA) tools for insight into trends, connections, and fluctuations in social media. Microsoft{\textquoteright}s NodeXL is a free, open-source SNA plug-in for use with Excel. It provides instant graphical representation of relationships of complex networked data. But it goes further than other SNA tools - NodeXL was developed by a multidisciplinary team of experts that bring together information studies, computer science, sociology, human-computer interaction, and over 20 years of visual analytic theory and information visualization into a simple tool anyone can use. This makes NodeXL of interest not only to end-users but also to researchers and students studying visual and network analytics and their application in the real world.}, keywords = {Business \& Economics / Marketing / Research, Computers / Computer Science, Computers / Data Processing, Computers / Database Management / Data Mining, Computers / General, Computers / Information Theory, Computers / Interactive \& Multimedia, Computers / Social Aspects / General, Computers / Social Aspects / Human-Computer Interaction, Computers / User Interfaces, data mining, Data mining - Computer programs, Data mining/ Computer programs, Information Visualization, Information visualization - Computer programs, Information visualization/ Computer programs, NodeXL, online social networks, Social Science / General, Social Science / Reference, Social Science / Sociology / General, Technology \& Engineering / General, Technology \& Engineering / Social Aspects, Webometrics, Webometrics - Computer programs, Webometrics/ Computer programs}, isbn = {9780123822291}, author = {Hansen,Derek and Shneiderman, Ben and Smith,Marc A.} } @book {19357, title = {Analyzing Social Media Networks with NodeXL: Insights from a Connected World}, year = {2010}, month = {2010}, pages = {302}, publisher = {Morgan Kaufmann}, organization = {Morgan Kaufmann}, abstract = {Businesses, entrepreneurs, individuals, and government agencies alike are looking to social network analysis (SNA) tools for insight into trends, connections, and fluctuations in social media. Microsoft{\textquoteright}s NodeXL is a free, open-source SNA plug-in for use with Excel. It provides instant graphical representation of relationships of complex networked data. But it goes further than other SNA tools -- NodeXL was developed by a multidisciplinary team of experts that bring together information studies, computer science, sociology, human-computer interaction, and over 20 years of visual analytic theory and information visualization into a simple tool anyone can use. This makes NodeXL of interest not only to end-users but also to researchers and students studying visual and network analytics and their application in the real world. In Analyzing Social Media Networks with NodeXL, members of the NodeXL development team up to provide readers with a thorough and practical guide for using the tool while also explaining the development behind each feature. Blending the theoretical with the practical, this book applies specific SNA instructions directly to NodeXL, but the theory behind the implementation can be applied to any SNA. To learn more about Analyzing Social Media Networks and NodeXL, visit the companion site at www.mkp.com/nodexl*Walks you through NodeXL, while explaining the theory and development behind each step, providing takeaways that can apply to any SNA *Demonstrates how visual analytics research can be applied to SNA tools for the mass market *Includes case studies from researchers who use NodeXL on popular networks like email, Facebook, Twitter, and wikis}, keywords = {Computers / Computer Science, Computers / General, Computers / Social Aspects / General, Computers / Social Aspects / Human-Computer Interaction, Computers / User Interfaces}, isbn = {9780123822307}, author = {Hansen,Derek and Shneiderman, Ben and Smith,Marc A.} } @article {17748, title = {Annotated RDF}, journal = {ACM Trans. Comput. Logic}, volume = {11}, year = {2010}, month = {2010/01//}, pages = {10:1{\textendash}10:41 - 10:1{\textendash}10:41}, abstract = {Real-world use of RDF requires the ability to transparently represent and explain metadata associated with RDF triples. For example, when RDF triples are extracted automatically by information extraction programs, there is a need to represent where the triples came from, what their temporal validity is, and how certain we are that the triple is correct. Today, there is no theoretically clean and practically scalable mechanism that spans these different needs - reification is the only solution propose to date, and its implementations have been ugly. In this paper, we present Annotated RDF (or aRDF for short) in which RDF triples are annotated by members of a partially ordered set (with bottom element) that can be selected in any way desired by the user. We present a formal declarative semantics (model theory) for annotated RDF and develop algorithms to check consistency of aRDF theories and to answer queries to aRDF theories. We show that annotated RDF supports users who need to think about the uncertainty, temporal aspects, and provenance of the RDF triples in an RDF database. We develop a prototype aRDF implementation and show that our algorithms work efficiently even on real world data sets containing over 10 million triples.}, keywords = {annotated RDF, Query processing, view maintenance}, isbn = {1529-3785}, doi = {10.1145/1656242.1656245}, url = {http://doi.acm.org/10.1145/1656242.1656245}, author = {Udrea,Octavian and Recupero,Diego Reforgiato and V.S. Subrahmanian} } @article {12474, title = {Applications of a Simple Characterization of Human Gait in Surveillance}, journal = {Systems, Man, and Cybernetics, Part B: Cybernetics, IEEE Transactions on}, volume = {40}, year = {2010}, month = {2010/08//}, pages = {1009 - 1020}, abstract = {Applications of a simple spatiotemporal characterization of human gait in the surveillance domain are presented. The approach is based on decomposing a video sequence into x-t slices, which generate periodic patterns referred to as double helical signatures (DHSs). The features of DHS are given as follows: 1) they naturally encode the appearance and kinematics of human motion and reveal geometric symmetries and 2) they are effective and efficient for recovering gait parameters and detecting simple events. We present an iterative local curve embedding algorithm to extract the DHS from video sequences. Two applications are then considered. First, the DHS is used for simultaneous segmentation and labeling of body parts in cluttered scenes. Experimental results showed that the algorithm is robust to size, viewing angles, camera motion, and severe occlusion. Then, the DHS is used to classify load-carrying conditions. By examining various symmetries in DHS, activities such as carrying, holding, and walking with objects that are attached to legs are detected. Our approach possesses several advantages: a compact representation that can be computed in real time is used; furthermore, it does not depend on silhouettes or landmark tracking, which are sensitive to errors in background subtraction stage.}, keywords = {algorithms, Artificial intelligence, Automated;Photography;Reproducibility of Results;Sensitivity and Specificity;Video Recording;, Biometry, Computer-Assisted;Pattern Recognition, double helical signatures, Gait, gait analysis, human gait, human motion kinematics, HUMANS, Image Enhancement, Image Interpretation, Image motion analysis, iterative local curve embedding algorithm, Object detection, simple spatiotemporal characterization, video sequence, Video surveillance}, isbn = {1083-4419}, doi = {10.1109/TSMCB.2010.2044173}, author = {Yang Ran and Qinfen Zheng and Chellapa, Rama and Strat, T.M.} } @article {14548, title = {Approximation Algorithms for Non-Uniform Buy-at-Bulk Network Design}, journal = {SIAM Journal on Computing}, volume = {39}, year = {2010}, month = {2010///}, pages = {1772 - 1798}, author = {Chekuri,C. and Hajiaghayi, Mohammad T. and Kortsarz,G. and Salavatipour,M. R} } @conference {12122, title = {Are developers complying with the process: an XP study}, booktitle = {Proceedings of the 2010 ACM-IEEE International Symposium on Empirical Software Engineering and Measurement}, series = {ESEM {\textquoteright}10}, year = {2010}, month = {2010///}, pages = {14:1{\textendash}14:10 - 14:1{\textendash}14:10}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Adapting new software processes and practices in organizational and academic environments requires training the developers and validating the applicability of the newly introduced activities. Investigating process conformance during training and understanding if programmers are able and willing to follow the specific steps are crucial to evaluating whether the process improves various software product quality factors. In this paper we present a process model independent approach to detect process non-conformance. Our approach is based on non-intrusively collected data captured by a version control system and provides the project manager with timely updates. Further, we provide evidence of the applicability of our approach by investigating process conformance in a five day training class on eXtreme Programming (XP) practices at the Leibniz Universit{\"a}t Hannover. Our results show that the approach enabled researchers to formulate minimal intrusive methods to check for conformance and that for the majority of the investigated XP practices violations could be detected.}, keywords = {process conformance, process improvement, XP programming}, isbn = {978-1-4503-0039-1}, doi = {10.1145/1852786.1852805}, url = {http://doi.acm.org/10.1145/1852786.1852805}, author = {Zazworka, Nico and Stapel,Kai and Knauss,Eric and Shull, Forrest and Basili, Victor R. and Schneider,Kurt} } @article {16245, title = {Assembly complexity of prokaryotic genomes using short reads}, journal = {BMC Bioinformatics}, volume = {11}, year = {2010}, month = {2010/01/12/}, pages = {21 - 21}, abstract = {De Bruijn graphs are a theoretical framework underlying several modern genome assembly programs, especially those that deal with very short reads. We describe an application of de Bruijn graphs to analyze the global repeat structure of prokaryotic genomes.}, isbn = {1471-2105}, doi = {10.1186/1471-2105-11-21}, url = {http://www.biomedcentral.com/1471-2105/11/21}, author = {Kingsford, Carl and Schatz,Michael C and Pop, Mihai} } @conference {15849, title = {Assessor error in stratified evaluation}, booktitle = {Proceedings of the 19th ACM international conference on Information and knowledge management}, year = {2010}, month = {2010///}, pages = {539 - 548}, author = {Webber,W. and Oard, Douglas and Scholer,F. and Hedin,B.} } @conference {19026, title = {Authentication in the clouds: a framework and its application to mobile users}, series = {CCSW {\textquoteright}10}, year = {2010}, month = {2010}, pages = {1 - 6}, publisher = {ACM}, organization = {ACM}, abstract = {Cloud computing is a natural fit for mobile security. Typical handsets have input constraints and practical computational and power limitations, which must be respected by mobile security technologies in order to be effective. We describe how cloud computing can address these issues. Our approach is based on a flexible framework for supporting authentication decisions we call TrustCube (to manage the authentication infrastructure) and on a behavioral authentication approach referred to as implicit authentication (to translate user behavior into authentication scores). The combination results in a new authentication paradigm for users of mobile technologies, one where an appropriate balance between usability and trust can be managed through flexible policies and dynamic tuning.}, keywords = {Authentication, Cloud computing, Mobile computing}, isbn = {978-1-4503-0089-6}, url = {http://doi.acm.org/10.1145/1866835.1866837}, author = {Chow, Richard and Jakobsson, Markus and Masuoka, Ryusuke and Molina,Jesus and Niu, Yuan and Elaine Shi and Song,Zhexuan} } @article {18536, title = {Autonomous Traffic Engineering using Self-Configuring Link Weights}, volume = {GT-CS-10-16}, year = {2010}, month = {2010///}, institution = {School of Computer Science, Georgia Tech}, abstract = {Network operators use traffic engineering to control the flow of traffic across their networks. Existing TE methods establish static topologies offline, either by setting link weights or by configuring paths a priori. These methods require manual configuration and may not be robust in the face of failures. Some methods also require knowledge about traffic demands and may not be able to handle traffic fluctuations. Even when changes in demand are expected, operators must manually tune network configurations to prepare for them. Because adjusting configurations is difficult to get right, we start from an extreme design point, asking instead whether it is possible to perform traffic engineering online without having to perform any a priori configuration. Our traffic engineering technique, SculpTE, adapts to changing traffic demands by automatically configuring link weights in a stable manner. SculpTE balances load across the network by continually adjusting link weights to expose lightly-loaded paths. We evaluate SculpTE using a simple analytical model and simulations on realistic ISP network topologies. Our results show that SculpTE achieves excellent load balancing, responsiveness, and stability compared to state-of-the-art TE schemes, without requiring network operators to perform any offline configuration.}, url = {http://hdl.handle.net/1853/35011}, author = {Sundaresan,S. and Lumezanu,C. and Feamster, Nick and Fran{\c c}ois,P.} } @article {18549, title = {Autonomous traffic engineering with self-configuring topologies}, journal = {SIGCOMM Comput. Commun. Rev.}, volume = {41}, year = {2010}, month = {2010/08//}, pages = {{\textendash} - {\textendash}}, abstract = {Network operators use traffic engineering (TE) to control the flow of traffic across their networks. Existing TE methods require manual configuration of link weights or tunnels, which is difficult to get right, or prior knowledge of traffic demands and hence may not be robust to link failures or traffic fluctuations. We present a self-configuring TE scheme, SculpTE, which automatically adapts the network-layer topology to changing traffic demands. SculpTE is responsive, stable, and achieves excellent load balancing.}, keywords = {multi-path routing, online, sculpte, self-configuring, traffic engineering}, isbn = {0146-4833}, url = {http://dl.acm.org/citation.cfm?id=2043164.1851239}, author = {Sundaresan,Srikanth and Lumezanu,Cristian and Feamster, Nick and Francois,Pierre} } @article {12220, title = {Brief announcement: decentralized network bandwidth prediction}, journal = {Distributed Computing}, year = {2010}, month = {2010///}, pages = {198 - 200}, abstract = {Distributed applications can often benefit from knowledge of the bandwidth between hosts, without performing measurements between all host pairs. For example, if a peer-to-peer (P2P) computational grid system predicts pairwise bandwidth between all nodes in the system, that information could increase overall system performance by finding high-bandwidth nodes to store large scientific input or output datasets. Another possible beneficiary is a P2P online game, which can provide users a seamless gaming experience by selecting a coordinator node that has high-bandwidth connections to the players in a game region.}, author = {Song,S. and Keleher,P. and Bhattacharjee, Bobby and Sussman, Alan} } @conference {18932, title = {Building an IT Taxonomy with Co-occurrence Analysis, Hierarchical Clustering, and Multidimensional Scaling}, year = {2010}, month = {2010///}, abstract = {Different information technologies (ITs) are related in complex ways. How can the relationships among a large number of ITs be described and analyzed in a representative, dynamic, and scalable way? In this study, we employed co-occurrence analysis to explore the relationships among 50 information technologies discussed in six magazines over ten years (1998-2007). Using hierarchical clustering and multidimensional scaling, we have found that the similarities of the technologies can be depicted in hierarchies and two-dimensional plots, and that similar technologies can be classified into meaningful categories. The results imply reasonable validity of our approach for understanding technology relationships and building an IT taxonomy. The methodology that we offer not only helps IT practitioners and researchers make sense of numerous technologies in the iField but also bridges two related but thus far largely separate research streams in iSchools - information management and IT management.}, url = {https://www.ideals.illinois.edu/handle/2142/14918}, author = {Tsui,C. and Wang,P. and Fleischmann,K.R. and Sayeed,A. B. and Weinberg, Amy} } @conference {16682, title = {cdec: A decoder, alignment, and learning framework for finite-state and context-free translation models}, booktitle = {Proceedings of the ACL 2010 System Demonstrations}, year = {2010}, month = {2010///}, pages = {7 - 12}, author = {Dyer,C. and Weese,J. and Setiawan,H. and Lopez,A. and Ture,F. and Eidelman,V. and Ganitkevitch,J. and Blunsom,P. and Resnik, Philip} } @conference {17572, title = {Cellular traffic offloading through opportunistic communications: a case study}, booktitle = {Proceedings of the 5th ACM workshop on Challenged networks}, series = {CHANTS {\textquoteright}10}, year = {2010}, month = {2010///}, pages = {31 - 38}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Due to the increasing popularity of various applications for smartphones, 3G networks are currently overloaded by mobile data traffic. Offloading cellular traffic through opportunistic communications is a promising solution to partially solve this problem, because there is no monetary cost for it. As a case study, we investigate the target-set selection problem for information delivery in the emerging Mobile Social Networks (MoSoNets). We propose to exploit opportunistic communications to facilitate the information dissemination and thus reduce the amount of cellular traffic. In particular, we study how to select the target set with only k users, such that we can minimize the cellular data traffic. In this scenario, initially the content service providers deliver information over cellular networks to only users in the target set. Then through opportunistic communications, target-users will further propagate the information among all the subscribed users. Finally, service providers will send the information to users who fail to receive it before the delivery deadline (i.e., delay-tolerance threshold). We propose three algorithms, called Greedy, Heuristic, and Random, for this problem and evaluate their performance through an extensive trace-driven simulation study. The simulation results verify the efficiency of these algorithms for both synthetic and real-world mobility traces. For example, the Heuristic algorithm can offload cellular traffic by up to 73.66\% for a real-world mobility trace.}, keywords = {cellular traffic offloading, mobile social networks, opportunistic communications, target-set selection}, isbn = {978-1-4503-0139-8}, doi = {10.1145/1859934.1859943}, url = {http://doi.acm.org/10.1145/1859934.1859943}, author = {Han,Bo and Hui,Pan and Kumar,V. S. Anil and Marathe,Madhav V. and Guanhong Pei and Srinivasan, Aravind} } @conference {16500, title = {Challenges in personalized authority flow based ranking of social media}, booktitle = {Proceedings of the 19th ACM international conference on Information and knowledge management}, year = {2010}, month = {2010///}, pages = {1409 - 1412}, author = {Sayyadi,H. and Edmonds,J. and Hristidis,V. and Raschid, Louiqa} } @article {17020, title = {Communication: Mapping science}, journal = {Nature}, volume = {468}, year = {2010}, month = {2010/12/22/}, pages = {1037 - 1037}, abstract = {Ben Shneiderman enjoys a tome full of tools for discovery.}, keywords = {Communication}, isbn = {0028-0836}, doi = {10.1038/4681037a}, url = {http://www.nature.com/nature/journal/v468/n7327/full/4681037a.html}, author = {Shneiderman, Ben} } @conference {15457, title = {Community-based, collaborative testing and analysis}, booktitle = {Proceedings of the FSE/SDP workshop on Future of software engineering research}, series = {FoSER {\textquoteright}10}, year = {2010}, month = {2010///}, pages = {239 - 244}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {This article proposes a research agenda aimed at enabling optimized testing and analysis processes and tools to support component-based software development communities. We hypothesize that de facto communities---sets of projects that provide, maintain and integrate many shared infrastructure components---are commonplace. Currently, community members, often unknown to each other, tend to work in isolation, duplicating work, failing to learn from each other{\textquoteright}s effort, and missing opportunities to efficiently improve the common infrastructure. We further hypothesize that as software integration continues to become the predominant mode of software development, there will be increasing value in tools and techniques that empower these communities to coordinate and optimize their development efforts, and to generate and broadly share information. Such tools and techniques will greatly improve the robustness, quality and usability of the common infrastructure which, in turn, will greatly reduce the time and effort needed to produce and use the end systems that are the true goal of the entire community.}, keywords = {component-based software development communities, testing and analysis}, isbn = {978-1-4503-0427-6}, doi = {10.1145/1882362.1882412}, url = {http://doi.acm.org/10.1145/1882362.1882412}, author = {Memon, Atif M. and Porter, Adam and Sussman, Alan} } @article {12881, title = {Comparative genomic analysis reveals evidence of two novel Vibrio species closely related to V. cholerae}, journal = {BMC Microbiology}, volume = {10}, year = {2010}, month = {2010///}, abstract = {In recent years genome sequencing has been used to characterize new bacterial species, a method of analysis available as a result of improved methodology and reduced cost. Included in a constantly expanding list of Vibrio species are several that have been reclassified as novel members of the Vibrionaceae. The description of two putative new Vibrio species, Vibrio sp. RC341 and Vibrio sp. RC586 for which we propose the names V. metecus and V. parilis, respectively, previously characterized as non-toxigenic environmental variants of V. cholerae is presented in this study. Results Based on results of whole-genome average nucleotide identity (ANI), average amino acid identity (AAI), rpoB similarity, MLSA, and phylogenetic analysis, the new species are concluded to be phylogenetically closely related to V. cholerae and V. mimicus. Vibrio sp. RC341 and Vibrio sp. RC586 demonstrate features characteristic of V. cholerae and V. mimicus, respectively, on differential and selective media, but their genomes show a 12 to 15\% divergence (88 to 85\% ANI and 92 to 91\% AAI) compared to the sequences of V. cholerae and V. mimicus genomes (ANI <95\% and AAI <96\% indicative of separate species). Vibrio sp. RC341 and Vibrio sp. RC586 share 2104 ORFs (59\%) and 2058 ORFs (56\%) with the published core genome of V. cholerae and 2956 (82\%) and 3048 ORFs (84\%) with V. mimicus MB-451, respectively. The novel species share 2926 ORFs with each other (81\% Vibrio sp. RC341 and 81\% Vibrio sp. RC586). Virulence-associated factors and genomic islands of V. cholerae and V. mimicus, including VSP-I and II, were found in these environmental Vibrio spp. Conclusions Results of this analysis demonstrate these two environmental vibrios, previously characterized as variant V. cholerae strains, are new species which have evolved from ancestral lineages of the V. cholerae and V. mimicus clade. The presence of conserved integration loci for genomic islands as well as evidence of horizontal gene transfer between these two new species, V. cholerae, and V. mimicus suggests genomic islands and virulence factors are transferred between these species.}, author = {Bradd,H. and Christopher,G. and Nur,H. and Seon-Young,C. and Jongsik,C. and Thomas,B. and David,B. and Jean,C. and Chris,D. J. and Cliff,H. and Rita R Colwell} } @inbook {12500, title = {Compressive Acquisition of Dynamic Scenes}, booktitle = {Computer Vision {\textendash} ECCV 2010Computer Vision {\textendash} ECCV 2010}, series = {Lecture Notes in Computer Science}, volume = {6311}, year = {2010}, month = {2010///}, pages = {129 - 142}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {Compressive sensing (CS) is a new approach for the acquisition and recovery of sparse signals and images that enables sampling rates significantly below the classical Nyquist rate. Despite significant progress in the theory and methods of CS, little headway has been made in compressive video acquisition and recovery. Video CS is complicated by the ephemeral nature of dynamic events, which makes direct extensions of standard CS imaging architectures and signal models infeasible. In this paper, we develop a new framework for video CS for dynamic textured scenes that models the evolution of the scene as a linear dynamical system (LDS). This reduces the video recovery problem to first estimating the model parameters of the LDS from compressive measurements, from which the image frames are then reconstructed. We exploit the low-dimensional dynamic parameters (the state sequence) and high-dimensional static parameters (the observation matrix) of the LDS to devise a novel compressive measurement strategy that measures only the dynamic part of the scene at each instant and accumulates measurements over time to estimate the static parameters. This enables us to considerably lower the compressive measurement rate considerably. We validate our approach with a range of experiments including classification experiments that highlight the effectiveness of the proposed approach.}, isbn = {978-3-642-15548-2}, url = {http://dx.doi.org/10.1007/978-3-642-15549-9_10}, author = {Sankaranarayanan,Aswin and Turaga,Pavan and Baraniuk,Richard and Chellapa, Rama}, editor = {Daniilidis,Kostas and Maragos,Petros and Paragios,Nikos} } @article {17578, title = {Concentration of measure for the analysis of randomized algorithms by Devdatt P. Dubhashi and Alessandro Panconesi Cambridge University Press, 2009}, journal = {SIGACT News}, volume = {41}, year = {2010}, month = {2010/03//}, pages = {28 - 30}, isbn = {0163-5700}, doi = {10.1145/1753171.1753179}, url = {http://doi.acm.org/10.1145/1753171.1753179}, author = {Srinivasan, Aravind} } @article {13914, title = {Connecting generations: developing co-design methods for older adults and children}, journal = {Behaviour \& Information Technology}, volume = {99999}, year = {2010}, month = {2010///}, pages = {1 - 11}, author = {Xie,B. and Druin, Allison and Fails,J. and Massey,S. and Golub,E. and Franckel,S. and Schneider,K.} } @article {12873, title = {Conversion of viable but nonculturable Vibrio cholerae to the culturable state by co-culture with eukaryotic cells}, journal = {Microbiology and Immunology}, volume = {54}, year = {2010}, month = {2010/06/14/}, pages = {502 - 507}, abstract = {VBNC Vibrio cholerae O139 VC-280 obtained by incubation in 1\% solution of artificial sea water IO at 4{\textdegree}C for 74 days converted to the culturable state when co-cultured with CHO cells. Other eukaryotic cell lines, including HT-29, Caco-2, T84, HeLa, and Intestine 407, also supported conversion of VBNC cells to the culturable state. Conversion of VBNC V. cholerae O1 N16961 and V. cholerae O139 VC-280/pG13 to the culturable state, under the same conditions, was also confirmed. When VBNC V. cholerae O139 VC-280 was incubated in 1\% IO at 4{\textdegree}C for up to 91 days, the number of cells converted by co-culture with CHO cells declined with each additional day of incubation and after 91 days conversion was not observed.}, keywords = {conversion to culturability, co-culture, eukaryotic cell, viable but nonculturable (VBNC) Vibrio cholerae}, isbn = {1348-0421}, doi = {10.1111/j.1348-0421.2010.00245.x}, url = {http://onlinelibrary.wiley.com/doi/10.1111/j.1348-0421.2010.00245.x/full}, author = {Senoh,Mitsutoshi and Ghosh-Banerjee,Jayeeta and Ramamurthy,Thandavarayan and Hamabata,Takashi and Kurakawa,Takashi and Takeda,Makoto and Rita R Colwell and Nair,G. Balakrish and Takeda,Yoshifumi} } @article {14602, title = {Correlated Changes Between Regulatory Cis Elements and Condition-Specific Expression in Paralogous Gene Families}, journal = {Nucleic Acids ResearchNucl. Acids Res.}, volume = {38}, year = {2010}, month = {2010/01/01/}, pages = {738 - 749}, abstract = {Gene duplication is integral to evolution, providing novel opportunities for organisms to diversify in function. One fundamental pathway of functional diversification among initially redundant gene copies, or paralogs, is via alterations in their expression patterns. Although the mechanisms underlying expression divergence are not completely understood, transcription factor binding sites and nucleosome occupancy are known to play a significant role in the process. Previous attempts to detect genomic variations mediating expression divergence in orthologs have had limited success for two primary reasons. First, it is inherently challenging to compare expressions among orthologs due to variable trans-acting effects and second, previous studies have quantified expression divergence in terms of an overall similarity of expression profiles across multiple samples, thereby obscuring condition-specific expression changes. Moreover, the inherently inter-correlated expressions among homologs present statistical challenges, not adequately addressed in many previous studies. Using rigorous statistical tests, here we characterize the relationship between cis element divergence and condition-specific expression divergence among paralogous genes in Saccharomyces cerevisiae. In particular, among all combinations of gene family and TFs analyzed, we found a significant correlation between TF binding and the condition-specific expression patterns in over 20\% of the cases. In addition, incorporating nucleosome occupancy reveals several additional correlations. For instance, our results suggest that GAL4 binding plays a major role in the expression divergence of the genes in the sugar transporter family. Our work presents a novel means of investigating the cis regulatory changes potentially mediating expression divergence in paralogous gene families under specific conditions.}, isbn = {0305-1048, 1362-4962}, doi = {10.1093/nar/gkp989}, url = {http://nar.oxfordjournals.org/content/38/3/738}, author = {Singh,Larry N. and Hannenhalli, Sridhar} } @conference {17747, title = {COSI: Cloud Oriented Subgraph Identification in Massive Social Networks}, booktitle = {Advances in Social Networks Analysis and Mining (ASONAM), 2010 International Conference on}, year = {2010}, month = {2010/08//}, pages = {248 - 255}, abstract = {Subgraph matching is a key operation on graph data. Social network (SN) providers may want to find all subgraphs within their social network that match certain query graph patterns. Unfortunately, subgraph matching is NP-complete, making its application to massive SNs a major challenge. Past work has shown how to implement subgraph matching on a single processor when the graph has 10-25M edges. In this paper, we show how to use cloud computing in conjunction with such existing single processor methods to efficiently match complex subgraphs on graphs as large as 778M edges. A cloud consists of one master compute node and k slave compute nodes. We first develop a probabilistic method to estimate probabilities that a vertex will be retrieved by a random query and that a pair of vertices will be successively retrieved by a random query. We use these probability estimates to define edge weights in an SN and to compute minimal edge cuts to partition the graph amongst k slave nodes. We develop algorithms for both master and slave nodes that try to minimize communication overhead. The resulting COSI system can answer complex queries over real-world SN data containing over 778M edges very efficiently.}, keywords = {(online);, answering;social, complexity;data, computing;edge, data;graph, estimation;query, handling;graph, matching;Internet;computational, matching;probability;query, network;subgraph, networking, NP-complete;cloud, pattern;probability, processing;social, theory;pattern, weight;graph}, doi = {10.1109/ASONAM.2010.80}, author = {Bröcheler,M. and Pugliese, A. and V.S. Subrahmanian} } @conference {18940, title = {Crowdsourcing the evaluation of a domain-adapted named entity recognition system}, series = {HLT {\textquoteright}10}, year = {2010}, month = {2010///}, pages = {345 - 348}, publisher = {Association for Computational Linguistics}, organization = {Association for Computational Linguistics}, address = {Stroudsburg, PA, USA}, abstract = {Named entity recognition systems sometimes have difficulty when applied to data from domains that do not closely match the training data. We first use a simple rule-based technique for domain adaptation. Data for robust validation of the technique is then generated, and we use crowdsourcing techniques to show that this strategy produces reliable results even on data not seen by the rule designers. We show that it is possible to extract large improvements on the target data rapidly at low cost using these techniques.}, isbn = {1-932432-65-5}, url = {http://dl.acm.org/citation.cfm?id=1857999.1858050}, author = {Sayeed,Asad B. and Meyer,Timothy J. and Nguyen,Hieu C. and Buzek,Olivia and Weinberg, Amy} } @article {17045, title = {Cyberinfrastructure for Social Action on National Priorities}, journal = {Computer}, volume = {43}, year = {2010}, month = {2010/11//}, pages = {20 - 21}, abstract = {Extensive research is needed to build upon currently used media and tools to foster wider participation, address national priorities, and deal with potential dangers associated with technology-mediated social participation.}, keywords = {Collaborative tools, Peer to peer computing, Public policy, Research initiatives, Social network services, Special issues and sections, Technology-mediated social participation}, isbn = {0018-9162}, doi = {10.1109/MC.2010.315}, author = {Pirolli,Peter and Preece,Jenny and Shneiderman, Ben} } @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 {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 {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 {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 {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} } @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} } @conference {12222, title = {The effect of packet loss on redundancy elimination in cellular wireless networks}, booktitle = {Proceedings of the 10th annual conference on Internet measurement}, series = {IMC {\textquoteright}10}, year = {2010}, month = {2010///}, pages = {294 - 300}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Network-level redundancy elimination (RE) algorithms reduce traffic volume on bandwidth-constrained network paths by avoiding the transmission of repeated byte sequences. Previous work shows that RE can suppress the transmission of 20-50\% bytes when deployed at ISP access links or between routers. In this paper, we focus on the challenges of deploying RE in cellular networks. The potential benefifit is substantial, since cellular networks have a growing subscriber base and network links, including wired backhaul, are often oversubscribed. Using three large traces captured at two North American and one European wireless network providers, we show that RE can reduce the bandwidth consumption of the majority of mobile users by at least 10\%. However, cellular links have much higher packet loss rates than their wired counterparts, which makes applying RE much more difficult. Our experiments also show that the loss of only a few packets can disrupt RE and eliminate the bandwidth savings. We propose informed marking, a lightweight scheme that detects lost packets and prevents RE algorithms from using them for future encodings. We implement RE with informed marking and deploy it in a real-world cellular network. Our results show that with informed marking, more than 60\% of the bandwidth savings of RE are preserved, even when packet loss rates are high.}, keywords = {cellular networks, loss, redundancy elimination}, isbn = {978-1-4503-0483-2}, doi = {10.1145/1879141.1879179}, url = {http://doi.acm.org/10.1145/1879141.1879179}, author = {Lumezanu,Cristian and Guo,Katherine and Spring, Neil and Bhattacharjee, Bobby} } @article {13959, title = {Efficient kriging for real-time spatio-temporal interpolation}, journal = {Proceedings of the 20 th Conference on Probability and Statistics in the Atmospheric Sciences}, year = {2010}, month = {2010///}, pages = {228 - 235}, abstract = {Atmospheric data is often recorded at scattered stationlocations. While the data is generally available over a long period of time it cannot be used directly for extract- ing coherent patterns and mechanistic correlations. The only recourse is to spatially and temporally interpolate the data both to organize the station recording to a reg- ular grid and to query the data for predictions at a par- ticular location or time of interest. Spatio-temporal in- terpolation approaches require the evaluation of weights at each point of interest. A widely used interpolation ap- proach is kriging. However, kriging has a computational cost that scales as the cube of the number of data points N, resulting in cubic time complexity for each point of interest, which leads to a time complexity of O(N4) for interpolation at O(N) points. In this work, we formulate the kriging problem, to first reduce the computational cost to O(N3). We use an iterative solver (Saad, 2003), and further accelerate the solver using fast summation algo- rithms like GPUML (Srinivasan and Duraiswami, 2009) or FIGTREE (Morariu et al., 2008). We illustrate the speedup on synthetic data and compare the performance with other standard kriging approaches to demonstrate substantial improvement in the performance of our ap- proach. We then apply the developed approach on ocean color data from the Chesapeake Bay and present some quantitative analysis of the kriged results. }, author = {Srinivasan,B.V. and Duraiswami, Ramani and Murtugudde,R.} } @conference {17750, title = {Efficient Policy-Based Inconsistency Management in Relational Knowledge Bases}, booktitle = {Scalable Uncertainty Management: 4th International Conference}, volume = {6379}, year = {2010}, month = {2010///}, pages = {264 - 264}, abstract = {Real-world databases are frequently inconsistent. Even though the users who work with a body of data are far more familiar not only with that data, but also their own job and the risks they are willing to take and the inferences they are willing to make from inconsistent data, most DBMSs force them to use the policy embedded in the DBMS. Inconsistency management policies (IMPs) were introduced so that users can apply policies that they deem are appropriate for data they know and understand better than anyone else. In this paper, we develop an efficient {\textquotedblleft}cluster table{\textquotedblright} method to implement IMPs and show that using cluster tables instead of a standard DBMS index is far more efficient when less than about 3\% of a table is involved in an inconsistency (which is hopefully the case in most real world DBs), while standard DBMS indexes perform better when the amount of inconsistency in a database is over 3\%.}, doi = {10.1007/978-3-642-15951-0_26}, author = {Martinez,M. V and Parisi,F. and Pugliese, A. and Simari,G. I and V.S. Subrahmanian} } @conference {15260, title = {Energy efficient scheduling via partial shutdown}, booktitle = {Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms}, series = {SODA {\textquoteright}10}, year = {2010}, month = {2010///}, pages = {1360 - 1372}, publisher = {Society for Industrial and Applied Mathematics}, organization = {Society for Industrial and Applied Mathematics}, address = {Philadelphia, PA, USA}, abstract = {Motivated by issues of saving energy in data centers we define a collection of new problems referred to as "machine activation" problems. The central framework we introduce considers a collection of m machines (unrelated or related) with each machine i having an activation cost of ai. There is also a collection of n jobs that need to be performed, and pi, j is the processing time of job j on machine i. Standard scheduling models assume that the set of machines is fixed and all machines are available. However, in our setting, we assume that there is an activation cost budget of A - we would like to select a subset S of the machines to activate with total cost a(S) <= A and find a schedule for the n jobs on the machines in S minimizing the makespan (or any other metric). We consider both the unrelated machines setting, as well as the setting of scheduling uniformly related parallel machines, where machine i has activation cost ai and speed si, and the processing time of job j on machine i is pi, j = pjsi, where pj is the processing requirement of job j. For the general unrelated machine activation problem, our main results are that if there is a schedule with makespan T and activation cost A then we can obtain a schedule with makespan (2 + ε)T and activation cost 2(1 + 1/ε)(ln n/OPT + 1)A, for any ε > 0. We also consider assignment costs for jobs as in the generalized assignment problem, and using our framework, provide algorithms that minimize the machine activation and the assignment cost simultaneously. In addition, we present a greedy algorithm which only works for the basic version and yields a makespan of 2T and an activation cost A(1 + ln n). For the uniformly related parallel machine sceduling problem, we develop a polynomial time approximation scheme that outputs a schedule with the property that the activation cost of the subset of machines is at most A and the makespan is at most (1 + ε)T for any ε > 0. For the special case of m identical speed machines, the machine activation problem is trivial, since the cheapest subset of k machines is always the best choice if the optimal solution activates k machines. In addition, we consider the case whem some jobs can be dropped (and are treated as outliers).}, isbn = {978-0-898716-98-6}, url = {http://dl.acm.org/citation.cfm?id=1873601.1873711}, author = {Khuller, Samir and Li,Jian and Saha,Barna} } @article {19293, title = {Energy-driven distribution of signal processing applications across wireless sensor networks}, journal = {ACM Trans. Sen. Netw.}, volume = {6}, year = {2010}, month = {2010}, pages = {24:1 - 24:32}, abstract = {Wireless sensor network (WSN) applications have been studied extensively in recent years. Such applications involve resource-limited embedded sensor nodes that have small size and low power requirements. Based on the need for extended network lifetimes in WSNs in terms of energy use, the energy efficiency of computation and communication operations in the sensor nodes becomes critical. Digital Signal Processing (DSP) applications typically require intensive data processing operations and as a result are difficult to implement directly in resource-limited WSNs. In this article, we present a novel design methodology for modeling and implementing computationally intensive DSP applications applied to wireless sensor networks. This methodology explores efficient modeling techniques for DSP applications, including data sensing and processing; derives formulations of Energy-Driven Partitioning (EDP) for distributing such applications across wireless sensor networks; and develops efficient heuristic algorithms for finding partitioning results that maximize the network lifetime. To address such an energy-driven partitioning problem, this article provides a new way of aggregating data and reducing communication traffic among nodes based on application analysis. By considering low data token delivery points and the distribution of computation in the application, our approach finds energy-efficient trade-offs between data communication and computation.}, keywords = {DSP, Energy efficiency, network lifetime, Speech recognition, Wireless sensor networks}, isbn = {1550-4859}, url = {http://doi.acm.org/10.1145/1754414.1754420}, author = {Chung-Ching Shen and Plishker, William L. and Ko,Dong-Ik and Bhattacharyya, Shuvra S. and Goldsman,Neil} } @article {12426, title = {Evaluation of the Interaction of Cyclin-Dependent Kinase 5 with Activator p25 and with p25-Derived Inhibitor CIP}, journal = {Journal of Computational Biology}, volume = {17}, year = {2010}, month = {2010///}, pages = {707 - 721}, author = {Cardone, Antonio and Albers,R.W. and Sriram,R.D. and Pant,H.C.} } @inbook {12995, title = {Evolutionary framework for Lepidoptera model systems}, booktitle = {Genetics and Molecular Biology of LepidopteraGenetics and Molecular Biology of Lepidoptera}, year = {2010}, month = {2010///}, pages = {1 - 24}, publisher = {Taylor \& Francis}, organization = {Taylor \& Francis}, address = {Boca Raton}, abstract = {{\textquotedblleft}Model systems{\textquotedblright} are specific organisms upon which detailed studies have been conducted examining a fundamental biological question. If the studies are robust, their results can be extrapolated among an array of organisms that possess features in common with the subject organism. The true power of model systems lies in the ability to extrapolate these details across larger groups of organisms. In order to generalize these results, comparative studies are essential and require that model systems be placed into their evolutionary or phylogenetic context. This chapter examines model systems in the insect order Lepidoptera from the perspective of several different superfamilies. Historically, many species of Lepidoptera have been essential in the development of invaluable model systems in the fields of development biology, genetics, molecular biology, physiology, co-evolution, population dynamics, and ecology.}, author = {Roe,A. and Weller,S. and Baixeras,J. and Brown,J. W and Cummings, Michael P. and Davis,DR and Horak,M and Kawahara,A. Y and Mitter,C and Parr,C.S. and Regier,J. C and Rubinoff,D and Simonsen,TJ and Wahlberg,N and Zwick,A.}, editor = {Goldsmith,M and Marec,F} } @conference {16416, title = {Evolving viral marketing strategies}, booktitle = {Proceedings of the 12th annual conference on Genetic and evolutionary computation}, series = {GECCO {\textquoteright}10}, year = {2010}, month = {2010///}, pages = {1195 - 1202}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {One method of viral marketing involves seeding certain consumers within a population to encourage faster adoption of the product throughout the entire population. However, determining how many and which consumers within a particular social network should be seeded to maximize adoption is challenging. We define a strategy space for consumer seeding by weighting a combination of network characteristics such as average path length, clustering coefficient, and degree. We measure strategy effectiveness by simulating adoption on a Bass-like agent-based model, with five different social network structures: four classic theoretical models (random, lattice, small-world, and preferential attachment) and one empirical (extracted from Twitter friendship data). To discover good seeding strategies, we have developed a new tool, called BehaviorSearch, which uses genetic algorithms to search through the parameter-space of agent-based models. This evolutionary search also provides insight into the interaction between strategies and network structure. Our results show that one simple strategy (ranking by node degree) is near-optimal for the four theoretical networks, but that a more nuanced strategy performs significantly better on the empirical Twitter-based network. We also find a correlation between the optimal seeding budget for a network, and the inequality of the degree distribution.}, keywords = {Agent-based modeling, business, diffusion, Genetic algorithms, simulation, social networks, viral marketing}, isbn = {978-1-4503-0072-8}, doi = {10.1145/1830483.1830701}, url = {http://doi.acm.org/10.1145/1830483.1830701}, author = {Stonedahl,Forrest and Rand, William and Wilensky,Uri} } @article {17152, title = {Exploring distributions: design and evaluation}, journal = {University of Maryland, Human-Computer Interaction Lab Tech Report HCIL-2010-01}, year = {2010}, month = {2010///}, abstract = {Visual overviews of tables of numerical and categorical data have been proposed for tables with a single value per cell.In this paper we address the problem of exploring tables including columns consisting of distributions, e.g. the distributions of movie ratings or trust ratings in recommender systems, age distributions in demographic data, usage distributions in logs of telephone calls etc. We propose a novel way of displaying and interacting with distribution data, and present the results of a usability study that demonstrates the benefits of the interface in providing an overview of the data and facilitating the discovery of interesting clusters, patterns, outliers and relationships between columns. }, author = {Sopan,A. and Freire,M. and Taieb-Maimon,M. and Golbeck,J. and Shneiderman, Ben} } @conference {15874, title = {Exploring the Relationships among ICTs: A Scalable Computational Approach Using KL Divergence and Hierarchical Clustering}, booktitle = {Hawaii International Conference on System Sciences}, year = {2010}, month = {2010///}, pages = {1 - 10}, publisher = {IEEE Computer Society}, organization = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, abstract = {Different information and communication technologies (ICTs) are related in complex ways and, accordingly, their diffusion trajectories are related, too. How can the relationships among multiple ICTs be described and analyzed in a scalable way? In this study, we offer a scalable methodology, based on computational analysis of discourse, to examine the relationships among ICTs. Specifically, we employed Kullback-Leibler (KL) divergence to compare the semantic similarity of forty-seven ICTs discussed in the trade magazine InformationWeek over a decade. Using hierarchical clustering, we have found that the similarity of the technologies can be mapped in a hierarchy and similar technologies demonstrated similar discourses. The results establish the validity of our approach and demonstrate its scalability and richness. This analytical approach not only enables diffusion researchers to undertake multi-innovation, multi-source, and multi-period studies, but also helps practitioners effectively adopt and efficiently use new ICTs in their organizations.}, isbn = {978-0-7695-3869-3}, doi = {http://doi.ieeecomputersociety.org/10.1109/HICSS.2010.203}, author = {Tsui,Chia-jung and Wang,Ping and Fleischmann,Kenneth R. and Oard, Douglas and Sayeed,Asad B.} } @conference {18943, title = {Expresses-an-opinion-about: using corpus statistics in an information extraction approach to opinion mining}, series = {COLING {\textquoteright}10}, year = {2010}, month = {2010///}, pages = {1095 - 1103}, publisher = {Association for Computational Linguistics}, organization = {Association for Computational Linguistics}, address = {Stroudsburg, PA, USA}, abstract = {We present a technique for identifying the sources and targets of opinions without actually identifying the opinions themselves. We are able to use an information extraction approach that treats opinion mining as relation mining; we identify instances of a binary "expresses-an-opinion-about" relation. We find that we can classify source-target pairs as belonging to the relation at a performance level significantly higher than two relevant baselines. This technique is particularly suited to emerging approaches in corpus-based social science which focus on aggregating interactions between sources to determine their effects on socio-economically significant targets. Our application is the analysis of information technology (IT) innovations. This is an example of a more general problem where opinion is expressed using either sub- or supersets of expressive words found in newswire. We present an annotation scheme and an SVM-based technique that uses the local context as well as the corpus-wide frequency of a source-target pair as data to determine membership in "expresses-an-opinion-about". While the presence of conventional subjectivity keywords appears significant in the success of this technique, we are able to find the most domain-relevant keywords without sacrificing recall.}, url = {http://dl.acm.org/citation.cfm?id=1944566.1944692}, author = {Sayeed,Asad B. and Nguyen,Hieu C. and Meyer,Timothy J. and Weinberg, Amy} } @article {12494, title = {Face Recognition by Computers and Humans}, journal = {Computer}, volume = {43}, year = {2010}, month = {2010/02//}, pages = {46 - 55}, abstract = {This article talks about how the study of how humans perceive faces can be used to help design practical systems for face recognition. Besides applications related to identification and verification-such as access control, law enforcement, ID and licensing, and surveillance-face recognition has also proven useful in applications such as human-computer interaction, virtual reality, database retrieval, multimedia, and computer entertainment. Continuing research into face recognition will provide scientists and engineers with many vital projects, in areas such as homeland security, human-computer interaction, and numerous consumer applications. The areas we are considering pursuing are recognition from unconstrained video sequences, incorporating familiarity into algorithms, modeling effects of aging, and developing biologically plausible models for human face recognition ability.}, keywords = {access, Computer, control;aging;computer, control;face, entertainment;database, interaction;national, interaction;unconstrained, reality;access, recognition;homeland, recognition;human, retrieval;face, security;, security;human, sequences;virtual, video}, isbn = {0018-9162}, doi = {10.1109/MC.2010.37}, author = {Chellapa, Rama and Sinha, P. and Phillips,P.J.} } @article {14869, title = {Face Verification Across Age Progression Using Discriminative Methods}, journal = {Information Forensics and Security, IEEE Transactions on}, volume = {5}, year = {2010}, month = {2010/03//}, pages = {82 - 91}, abstract = {Face verification in the presence of age progression is an important problem that has not been widely addressed. In this paper, we study the problem by designing and evaluating discriminative approaches. These directly tackle verification tasks without explicit age modeling, which is a hard problem by itself. First, we find that the gradient orientation, after discarding magnitude information, provides a simple but effective representation for this problem. This representation is further improved when hierarchical information is used, which results in the use of the gradient orientation pyramid (GOP). When combined with a support vector machine GOP demonstrates excellent performance in all our experiments, in comparison with seven different approaches including two commercial systems. Our experiments are conducted on the FGnet dataset and two large passport datasets, one of them being the largest ever reported for recognition tasks. Second, taking advantage of these datasets, we empirically study how age gaps and related issues (including image quality, spectacles, and facial hair) affect recognition algorithms. We found surprisingly that the added difficulty of verification produced by age gaps becomes saturated after the gap is larger than four years, for gaps of up to ten years. In addition, we find that image quality and eyewear present more of a challenge than facial hair.}, keywords = {algorithms;support, databases;, dataset;age, FGnet, hair;gradient, information;image, information;recognition, machine;face, machines;visual, methods;eyewear;face, methods;support, orientation, orientation;gradient, progression;commercial, pyramid;hierarchical, quality;magnitude, recognition;gradient, systems;discriminative, vector, verification;facial}, isbn = {1556-6013}, doi = {10.1109/TIFS.2009.2038751}, author = {Ling,Haibin and Soatto,S. and Ramanathan,N. and Jacobs, David W.} } @article {13960, title = {Fast matrix-vector product based fgmres for kernel machines}, journal = {Copper Mountain Conference on Iterative Methods}, volume = {2}, year = {2010}, month = {2010///}, abstract = {Kernel based approaches for machine learning have gained huge interest in the past decades because of their robustness. In somealgorithms, the primary problem is the solution of a linear system involving the kernel matrix. Iterative Krylov approaches are often used to solve these efficiently [2, 3]. Fast matrix-vector products can be used to accelerate each Krylov iteration to further optimize the performance. In order to reduce the number of iterations of the Krylov approach, a preconditioner becomes necessary in many cases. Several researchers have proposed flexible preconditioning methods where the preconditioner changes with each iteration, and this class of preconditioners are shown to have good performance [6, 12]. In this paper, we use a Tikhonov regularized kernel matrix as a preconditioner for flexible GMRES [12] to solve kernel matrix based systems of equations. We use a truncated conjugate gradient (CG) method to solve the preconditioner system and further accelerate each CG iteration using fast matrix-vector products. The convergence of the proposed preconditioned GMRES is shown on synthetic data. The performance is further validated on problems in Gaussian process regression and radial basis function interpolation. Improvements are seen in each case. }, author = {Srinivasan,B.V. and Duraiswami, Ramani and Gumerov, Nail A.} } @inbook {17598, title = {Fault-Tolerant Facility Location: A Randomized Dependent LP-Rounding Algorithm}, booktitle = {Integer Programming and Combinatorial OptimizationInteger Programming and Combinatorial Optimization}, series = {Lecture Notes in Computer Science}, volume = {6080}, year = {2010}, month = {2010///}, pages = {244 - 257}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, isbn = {978-3-642-13035-9}, url = {http://dx.doi.org/10.1007/978-3-642-13036-6_19}, author = {Byrka,Jaroslaw and Srinivasan, Aravind and Swamy,Chaitanya}, editor = {Eisenbrand,Friedrich and Shepherd,F.} } @article {17174, title = {From bowling alone to tweeting together: technology-mediated social participation}, journal = {Interactions}, volume = {17}, year = {2010}, month = {2010///}, pages = {64 - 67}, author = {Hochheiser,H. and Shneiderman, Ben} } @conference {14280, title = {From program verification to program synthesis}, booktitle = {ACM SIGPLAN Notices}, volume = {45}, year = {2010}, month = {2010///}, pages = {313 - 326}, author = {Srivastava,S. and Gulwani,S. and Foster, Jeffrey S.} } @inbook {19194, title = {GasSense: Appliance-Level, Single-Point Sensing of Gas Activity in the Home}, booktitle = {Pervasive Computing}, series = {Lecture Notes in Computer Science}, volume = {6030}, year = {2010}, month = {2010}, pages = {265 - 282}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {This paper presents GasSense, a low-cost, single-point sensing solution for automatically identifying gas use down to its source (e.g., water heater, furnace, fireplace). This work adds a complementary sensing solution to the growing body of work in infrastructure-mediated sensing. GasSense analyzes the acoustic response of a home{\textquoteright}s government mandated gas regulator, which provides the unique capability of sensing both the individual appliance at which gas is currently being consumed as well as an estimate of the amount of gas flow. Our approach provides a number of appealing features including the ability to be easily and safely installed without the need of a professional. We deployed our solution in nine different homes and initial results show that GasSense has an average accuracy of 95.2\% in identifying individual appliance usage.}, isbn = {978-3-642-12653-6}, url = {http://dx.doi.org/10.1007/978-3-642-12654-3_16}, author = {Cohn,Gabe and Gupta,Sidhant and Jon Froehlich and Larson,Eric and Patel,Shwetak}, editor = {Flor{\'e}en,Patrik and Kr{\"u}ger,Antonio and Spasojevic,Mirjana} } @article {19094, title = {Genomic characterization of the Yersinia genus}, journal = {Genome biology}, volume = {11}, year = {2010}, month = {2010}, author = {Chen, P.E. and Cook, C. and Stewart, A.C. and Nagarajan,N. and Sommer, D.D. and Pop, Mihai and Thomason, B. and Thomason, M.P.K. and Lentz, S. and Nolan, N. and others} } @conference {16825, title = {Geotagging: using proximity, sibling, and prominence clues to understand comma groups}, booktitle = {Proceedings of the 6th Workshop on Geographic Information Retrieval}, series = {GIR {\textquoteright}10}, year = {2010}, month = {2010///}, pages = {6:1{\textendash}6:8 - 6:1{\textendash}6:8}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Geotagging is the process of recognizing textual references to geographic locations, known as toponyms, and resolving these references by assigning each lat/long values. Typical geotagging algorithms use a variety of heuristic evidence to select the correct interpretation for each toponym. A study is presented of one such heuristic which aids in recognizing and resolving lists of toponyms, referred to as comma groups. Comma groups of toponyms are recognized and resolved by inferring the common threads that bind them together, based on the toponyms{\textquoteright} shared geographic attributes. Three such common threads are proposed and studied --- population-based prominence, distance-based proximity, and sibling relationships in a geographic hierarchy --- and examples of each are noted. In addition, measurements are made of these comma groups{\textquoteright} usage and variety in a large dataset of news articles, indicating that the proposed heuristics, and in particular the proximity and sibling heuristics, are useful for resolving comma group toponyms.}, keywords = {comma groups, geotagging, toponyms}, isbn = {978-1-60558-826-1}, doi = {10.1145/1722080.1722088}, url = {http://doi.acm.org/10.1145/1722080.1722088}, author = {Lieberman,Michael D. and Samet, Hanan and Sankaranayananan,Jagan} } @conference {16819, title = {Geotagging with local lexicons to build indexes for textually-specified spatial data}, booktitle = {Data Engineering (ICDE), 2010 IEEE 26th International Conference on}, year = {2010}, month = {2010/03//}, pages = {201 - 212}, abstract = {The successful execution of location-based and feature-based queries on spatial databases requires the construction of spatial indexes on the spatial attributes. This is not simple when the data is unstructured as is the case when the data is a collection of documents such as news articles, which is the domain of discourse, where the spatial attribute consists of text that can be (but is not required to be) interpreted as the names of locations. In other words, spatial data is specified using text (known as a toponym) instead of geometry, which means that there is some ambiguity involved. The process of identifying and disambiguating references to geographic locations is known as geotagging and involves using a combination of internal document structure and external knowledge, including a document-independent model of the audience{\textquoteright}s vocabulary of geographic locations, termed its spatial lexicon. In contrast to previous work, a new spatial lexicon model is presented that distinguishes between a global lexicon of locations known to all audiences, and an audience-specific local lexicon. Generic methods for inferring audiences{\textquoteright} local lexicons are described. Evaluations of this inference method and the overall geotagging procedure indicate that establishing local lexicons cannot be overlooked, especially given the increasing prevalence of highly local data sources on the Internet, and will enable the construction of more accurate spatial indexes.}, keywords = {data;Internet;data, databases;, databases;spatial, document, indexes;spatial, information, Internet;document-independent, knowledge;feature-based, lexicon, lexicons;location-based, locations;geotagging;inference, method;internal, methods;geographic, mining;geographic, model;external, model;textually-specified, queries;generic, queries;spatial, spatial, structure;local, systems;visual}, doi = {10.1109/ICDE.2010.5447903}, author = {Lieberman,M.D. and Samet, Hanan and Sankaranarayanan,J.} } @article {17179, title = {Getting serious about social media: strategies for increasing civic participation}, journal = {Proceedings of HCI}, year = {2010}, month = {2010///}, author = {Shneiderman, Ben} } @article {13958, title = {GPUML: Graphical processors for speeding up kernel machines}, journal = {Workshop on High Performance Analytics-Algorithms, Implementations, and Applications}, year = {2010}, month = {2010///}, abstract = {Algorithms based on kernel methods play a central rolein statistical machine learning. At their core are a num- ber of linear algebra operations on matrices of kernel functions which take as arguments the training and test- ing data. These range from the simple matrix-vector product, to more complex matrix decompositions, and iterative formulations of these. Often the algorithms scale quadratically or cubically, both in memory and op- erational complexity, and as data sizes increase, kernel methods scale poorly. We use parallelized approaches on a multi-core graphical processor (GPU) to partially address this lack of scalability. GPUs are used to scale three different classes of problems, a simple kernel- matrix-vector product, iterative solution of linear sys- tems of kernel function and QR and Cholesky decom- position of kernel matrices. Application of these accel- erated approaches in scaling several kernel based learn- ing approaches are shown, and in each case substantial speedups are obtained. The core software is released as an open source package, GPUML. }, author = {Srinivasan,B.V. and Hu,Q. and Duraiswami, Ramani} } @conference {17751, title = {A graph-theoretic approach to protect static and moving targets from adversaries}, booktitle = {Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1}, series = {AAMAS {\textquoteright}10}, year = {2010}, month = {2010///}, pages = {299 - 306}, publisher = {International Foundation for Autonomous Agents and Multiagent Systems}, organization = {International Foundation for Autonomous Agents and Multiagent Systems}, address = {Richland, SC}, abstract = {The static asset protection problem (SAP) in a road network is that of allocating resources to protect vertices, given any possible behavior by an adversary determined to attack those assets. The dynamic asset protection (DAP) problem is a version of SAP where the asset is following a fixed and widely known route (e.g., a parade route) and needs to be protected. We formalize what it means for a given allocation of resources to be "optimal" for protecting a desired set of assets, and show that randomly allocating resources to a single edge cut in the road network solves this problem. Unlike SAP, we show that DAP is not only an NP-complete problem, but that approximating DAP is also NP-hard. We provide the GreedyDAP heuristic algorithm to solve DAP and show experimentally that it works well in practice, using road network data for real cities.}, keywords = {adversarial reasoning, agent systems, game theory}, isbn = {978-0-9826571-1-9}, url = {http://dl.acm.org/citation.cfm?id=1838206.1838248}, author = {Dickerson,J. P. and Simari,G. I and V.S. Subrahmanian and Kraus,Sarit} } @article {14426, title = {Higher-order graphical models for classification in social and affiliation networks}, journal = {NIPS 2010 Workshop on Networks Across Disciplines: Theory and Applications, Whistler BC, Canada}, year = {2010}, month = {2010///}, abstract = {In this work we explore the application of higher-order Markov Random Fields(MRF) to classification in social and affiliation networks. We consider both friend- ship links and group membership for inferring hidden attributes in a collective inference framework. We explore different ways of using the social groups as ei- ther node features or to construct the graphical model structure. The bottleneck in applying higher-order MRFs to a domain with many overlapping large cliques is the complexity of inference which is exponential in the size of the largest clique. To circumvent the slow inference problem, we borrow recent advancements in the computer vision community to achieve fast approximate inference results. We provide preliminary results using a dataset from facebook which suggest that our higher-order MRF models are capturing the structural dependencies in the net- works and they yield higher accuracy than linear classifiers. }, author = {Zheleva,E. and Getoor, Lise and Sarawagi,S.} } @article {12875, title = {Identification of Pathogenic Vibrio Species by Multilocus PCR-Electrospray Ionization Mass Spectrometry and Its Application to Aquatic Environments of the Former Soviet Republic of Georgia}, journal = {Applied and Environmental MicrobiologyAppl. Environ. Microbiol.}, volume = {76}, year = {2010}, month = {2010/03/15/}, pages = {1996 - 2001}, abstract = {The Ibis T5000 is a novel diagnostic platform that couples PCR and mass spectrometry. In this study, we developed an assay that can identify all known pathogenic Vibrio species and field-tested it using natural water samples from both freshwater lakes and the Georgian coastal zone of the Black Sea. Of the 278 total water samples screened, 9 different Vibrio species were detected, 114 (41\%) samples were positive for V. cholerae, and 5 (0.8\%) samples were positive for the cholera toxin A gene (ctxA). All ctxA-positive samples were from two freshwater lakes, and no ctxA-positive samples from any of the Black Sea sites were detected.}, isbn = {0099-2240, 1098-5336}, doi = {10.1128/AEM.01919-09}, url = {http://aem.asm.org/content/76/6/1996}, author = {Whitehouse,Chris A. and Baldwin,Carson and Sampath,Rangarajan and Blyn,Lawrence B. and Melton,Rachael and Li,Feng and Hall,Thomas A. and Harpin,Vanessa and Matthews,Heather and Tediashvili,Marina and Jaiani,Ekaterina and Kokashvili,Tamar and Janelidze,Nino and Grim,Christopher and Rita R Colwell and Huq,Anwar} } @conference {16818, title = {Images in News}, booktitle = {Pattern Recognition (ICPR), 2010 20th International Conference on}, year = {2010}, month = {2010/08//}, pages = {3240 - 3243}, abstract = {A system, called News Stand, is introduced that automatically extracts images from news articles. The system takes RSS feeds of news article and applies an online clustering algorithm so that articles belonging to the same news topic can be associated with the same cluster. Using the feature vector associated with the cluster, the images from news articles that form the cluster are extracted. First, the caption text associated with each of the images embedded in the news article is determined. This is done by analyzing the structure of the news article{\textquoteright}s HTML page. If the caption and feature vector of the cluster are found to contain keywords in common, then the image is added to an image repository. Additional meta-information are now associated with each image such as caption, cluster features, names of people in the news article, etc. A very large repository containing more than 983k images from 12 million news articles was built using this approach. This repository also contained more than 86.8 million keywords associated with the images. The key contribution of this work is that it combines clustering and natural language processing tasks to automatically create a large corpus of news images with good quality tags or meta-information so that interesting vision tasks can be performed on it.}, keywords = {algorithm;feature, articles;news, clustering, clustering;publishing;, extraction;hypermedia, extraction;image, feeds;caption, HTML, images;news, LANGUAGE, languages;image, markup, page;RSS, processing;news, processing;pattern, repository;meta-information;natural, retrieval;natural, stand;online, text;feature, vector;image}, doi = {10.1109/ICPR.2010.792}, author = {Sankaranarayanan,J. and Samet, Hanan} } @article {14487, title = {On the importance of sharing negative results}, journal = {SIGKDD explorations}, volume = {12}, year = {2010}, month = {2010///}, pages = {3 - 4}, author = {Giraud-Carrier,C. and Dunham,M.H. and Atreya,A. and Elkan,C. and Perlich,C. and Swirszcz,G. and Shi,X. and Philip,S.Y. and F{\"u}rnkranz,J. and Sima,J.F.} } @article {19614, title = {On the initialization methods of an exterior point algorithm for the assignment problem}, journal = {International Journal of Computer Mathematics}, volume = {87}, year = {2010}, month = {2010///}, pages = {1831 - 1846}, abstract = {In this paper, we present a theoretical investigation and an extensive computational study of exterior point simplex algorithm (EPSA) initialization methods for the assignment problem (AP). We describe the exterior point algorithm using three different initialization methods. Effective implementations are explored for each initialization method. Then we perform an experimental evaluation on a large set of benchmark problems from the TSPLib 95 and OR Library collections. The results obtained demonstrate the advantages of the three initialization methods. Finally, we give a theoretical justification of the initialization methods efficiency. We explain theoretically the computational ranking for these methods.}, isbn = {0020-7160}, url = {http://www.tandfonline.com/doi/abs/10.1080/00207160802524739}, author = {Charalampos Papamanthou and Paparrizos, K. and Samaras, N. and Sifaleras, A.} } @article {16052, title = {Interactive information visualization for exploring and querying electronic health records: A systematic review}, year = {2010}, month = {2010///}, institution = {Human-Computer Interaction Lab, University of Maryland}, abstract = {To overcome the complexity and scale of making medical decisions based on electronic health records (EHRs) a variety of visual methods have been proposed. This paper surveys twelve state-of-the-art information visualization systems described in the scientific literature and compares them based on a set of carefully selected criteria. It aims to systematically examine the systems{\textquoteright} strengths and weaknesses to inform future information visualization designs.We select twelve state-of-the-art information visualization systems from information visualization, medical information systems and human-computer interaction conferences and journals. We compare the systems using the following criteria: (1) data types covered, (2) multivariate analysis support, (3) number of patients records used (one or many), and (4) user intents addressed. The review describes the twelve systems in detail and evaluates the systems using the aforementioned criteria. We discuss how the systems differ in their features and highlight how these differences are related to their design and affect the user intent model. Examples of findings include: (1) most systems handle numerical or categorical data but not both, (2) most systems are specifically designed for looking at a single patient or multiple patients but not both, (3) most systems utilize horizontal time lines to represent time, (4) only systems that handle multiple patient records have good support for Filter, and (5) some specific user intents (e.g. the Encode and Connect intents) are rarely addressed. Based on our review results, we believe that effective information visualization can facilitate analysis of patient records, and we encourage the information visualization community to study the application of their systems and conduct more in depth evaluations. We identify potential future research topics in interactive support for data abstraction and medical tasks that involve looking at a single or multiple records. Finally, we propose to create a repository for data and tasks so benchmarks can be established for both academic and commercial patient record visualization systems. }, author = {Rind,A. and Wang,T. D and Aigner,W. and Miksh,S. and Wongsuphasawat,K. and Plaisant, Catherine and Shneiderman, Ben} } @article {13798, title = {Interlingual Annotation of Parallel Text Corpora: A New Framework for Annotation and Evaluation}, journal = {Natural Language Engineering}, volume = {16}, year = {2010}, month = {2010///}, pages = {197 - 243}, abstract = {This paper focuses on an important step in the creation of a system of meaning representation and the development of semantically annotated parallel corpora, for use in applications such as machine translation, question answering, text summarization, and information retrieval. The work described below constitutes the first effort of any kind to annotate multiple translations of foreign-language texts with interlingual content. Three levels of representation are introduced: deep syntactic dependencies (IL0), intermediate semantic representations (IL1), and a normalized representation that unifies conversives, nonliteral language, and paraphrase (IL2). The resulting annotated, multilingually induced, parallel corpora will be useful as an empirical basis for a wide range of research, including the development and evaluation of interlingual NLP systems and paraphrase-extraction systems as well as a host of other research and development efforts in theoretical and applied linguistics, foreign language pedagogy, translation studies, and other related disciplines.}, doi = {10.1017/S1351324910000070}, author = {Dorr, Bonnie J and Passonneau,Rebecca J. and Farwell,David and Green,Rebecca and Habash,Nizar and Helmreich,Stephen and Hovy,Eduard and Levin,Lori and Miller,Keith J. and Mitamura,Teruko and Rambow,Owen and Siddharthan,Advaith} } @article {13804, title = {iOpener Workbench: Tools for rapid understanding of scientific literature}, journal = {Human-Computer Interaction Lab 27th Annual Symposium, University of Maryland, College Park, MD}, year = {2010}, month = {2010///}, author = {Dunne,C. and Shneiderman, Ben and Dorr, Bonnie J and Klavans,J.} } @inbook {17635, title = {On k-Column Sparse Packing Programs}, booktitle = {Integer Programming and Combinatorial OptimizationInteger Programming and Combinatorial Optimization}, series = {Lecture Notes in Computer Science}, volume = {6080}, year = {2010}, month = {2010///}, pages = {369 - 382}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {We consider the class of packing integer programs (PIPs) that are column sparse, where there is a specified upper bound k on the number of constraints that each variable appears in. We give an improved (ek + o(k))-approximation algorithm for k-column sparse PIPs. Our algorithm is based on a linear programming relaxation, and involves randomized rounding combined with alteration. We also show that the integrality gap of our LP relaxation is at least 2k - 1; it is known that even special cases of k-column sparse PIPs are (klogk)-hard to approximate.We generalize our result to the case of maximizing monotone submodular functions over k-column sparse packing constraints, and obtain an e2ke-1+o(k) -approximation algorithm. In obtaining this result, we prove a new property of submodular functions that generalizes the fractionally subadditive property, which might be of independent interest. }, isbn = {978-3-642-13035-9}, url = {http://dx.doi.org/10.1007/978-3-642-13036-6_28}, author = {Bansal,Nikhil and Korula,Nitish and Nagarajan,Viswanath and Srinivasan, Aravind}, editor = {Eisenbrand,Friedrich and Shepherd,F.} } @article {12502, title = {Large-scale matrix factorization with missing data under additional constraints}, journal = {Advances in Neural Information Processing Systems}, volume = {23}, year = {2010}, month = {2010///}, pages = {1642 - 1650}, abstract = {Matrix factorization in the presence of missing data is at the core of many com-puter vision problems such as structure from motion (SfM), non-rigid SfM and photometric stereo. We formulate the problem of matrix factorization with miss- ing data as a low-rank semidefinite program (LRSDP) with the advantage that: 1) an efficient quasi-Newton implementation of the LRSDP enables us to solve large-scale factorization problems, and 2) additional constraints such as ortho- normality, required in orthographic SfM, can be directly incorporated in the new formulation. Our empirical evaluations suggest that, under the conditions of ma- trix completion theory, the proposed algorithm finds the optimal solution, and also requires fewer observations compared to the current state-of-the-art algorithms. We further demonstrate the effectiveness of the proposed algorithm in solving the affine SfM problem, non-rigid SfM and photometric stereo problems. }, author = {Mitra, K. and Sheorey,S. and Chellapa, Rama} } @article {12493, title = {A Learning Approach Towards Detection and Tracking of Lane Markings}, journal = {IEEE Transactions on Intelligent Transportation Systems}, volume = {PP}, year = {2010}, month = {2010/02/17/}, pages = {1 - 12}, abstract = {Road scene analysis is a challenging problem that has applications in autonomous navigation of vehicles. An integral component of this system is the robust detection and tracking of lane markings. It is a hard problem primarily due to large appearance variations in lane markings caused by factors such as occlusion (traffic on the road), shadows (from objects like trees), and changing lighting conditions of the scene (transition from day to night). In this paper, we address these issues through a learning-based approach using visual inputs from a camera mounted in front of a vehicle. We propose the following: 1) a pixel-hierarchy feature descriptor to model the contextual information shared by lane markings with the surrounding road region; 2) a robust boosting algorithm to select relevant contextual features for detecting lane markings; and 3) particle filters to track the lane markings, without knowledge of vehicle speed, by assuming the lane markings to be static through the video sequence and then learning the possible road scene variations from the statistics of tracked model parameters. We investigate the effectiveness of our algorithm on challenging daylight and night-time road video sequences.}, keywords = {Boosting, Context, Context modeling, Feature extraction, lane marking detection, outlier robustness, Roads, tracking and learning, Training, Vehicles}, isbn = {1524-9050}, doi = {10.1109/TITS.2012.2184756}, author = {Gopalan,R. and Hong, T. and Shneier, M. and Chellapa, Rama} } @conference {19282, title = {A Lightweight Dataflow Approach for Design and Implementation of SDR Systems}, booktitle = {Wireless Innovation Conference and Product Exposition, Washington DC, USA}, year = {2010}, month = {2010}, abstract = {Model-based design methods based on dataflow modelsof computation are attractive for design and implementation of wireless communication systems because of their intuitive correspondence to communication system block diagrams, and the formal structure that is exposed through formal dataflow representations (e.g., see [2]). In this paper, we introduce a novel lightweight dataflow (LWDF) programming model for model-based design and implementation of wireless communication and software-defined radio systems. The approach is suitable for improving the productivity of the design process; the agility with which designs can be retargeted across different platforms; and the quality of derived implementations. By {\textquotedblleft}lightweight{\textquotedblright}, we meant that the programming model is designed to be minimally intrusive on existing design processes, and require minimal dependence on specialized tools or libraries. This allows designers to integrate and experiment with dataflow modeling approaches relatively quickly and flexibly into existing design methodologies and processes. }, url = {http://www.researchgate.net/publication/228788399_A_lightweight_dataflow_approach_for_design_and_implementation_of_SDR_systems/file/d912f511472fa25833.pdf}, author = {Chung-Ching Shen and Plishker,William and Wu, Hsiang-Huang and Bhattacharyya, Shuvra S.} } @article {12144, title = {Linking Software Development and Business Strategy Through Measurement}, journal = {Computer}, volume = {43}, year = {2010}, month = {2010/04//}, pages = {57 - 65}, abstract = {The GQM+Strategies approach extends the goal/question/metric paradigm for measuring the success or failure of goals and strategies, adding enterprise-wide support for determining action on the basis of measurement results. An organization can thus integrate its measurement program across all levels.}, keywords = {approach;business, aspects;software, development;organisational, engineering;, GQM+Strategies, program;software, strategy;enterprise, support;measurement, wide}, isbn = {0018-9162}, doi = {10.1109/MC.2010.108}, author = {Basili, Victor R. and Lindvall,M. and Regardie,M. and Seaman,C. and Heidrich,J. and Munch,J. and Rombach,D. and Trendowicz,A.} } @article {19287, title = {A Low-overhead Scheduling Methodology for Fine-grained Acceleration of Signal Processing Systems}, journal = {Journal of Signal Processing Systems}, volume = {60}, year = {2010}, month = {2010}, pages = {333 - 343}, abstract = {Fine-grained accelerators have the potential to deliver significant benefits in various platforms for embedded signal processing. Due to the moderate complexity of their targeted operations, these accelerators must be managed with minimal run-time overhead. In this paper, we present a methodology for applying flow-shop scheduling techniques to make effective, low-overhead use of fine-grained DSP accelerators. We formulate the underlying scheduling approach in terms of general flow-shop scheduling concepts, and demonstrate our methodology concretely by applying it to MPEG-4 video decoding. We present quantitative experiments on a soft processor that runs on a field-programmable gate array, and provide insight on trends and trade-offs among different flow-shop scheduling approaches when applied to run-time management of fine-grained acceleration.}, url = {http://link.springer.com/article/10.1007/s11265-009-0366-z}, author = {Boutellier, Jani and Bhattacharyya, Shuvra S. and Silv{\'e}n, Olli} } @article {17621, title = {LP-rounding algorithms for facility-location problems}, journal = {arXiv:1007.3611}, year = {2010}, month = {2010/07/21/}, abstract = {We study LP-rounding approximation algorithms for metric uncapacitated facility-location problems. We first give a new analysis for the algorithm of Chudak and Shmoys, which differs from the analysis of Byrka and Aardal in that now we do not need any bound based on the solution to the dual LP program. Besides obtaining the optimal bifactor approximation as do Byrka and Aardal, we can now also show that the algorithm with scaling parameter equaling 1.58 is, in fact, an 1.58-approximation algorithm. More importantly, we suggest an approach based on additional randomization and analyses such as ours, which could achieve or approach the conjectured optimal 1.46...--approximation for this basic problem. Next, using essentially the same techniques, we obtain improved approximation algorithms in the 2-stage stochastic variant of the problem, where we must open a subset of facilities having only stochastic information about the future demand from the clients. For this problem we obtain a 2.2975-approximation algorithm in the standard setting, and a 2.4957-approximation in the more restricted, per-scenario setting. We then study robust fault-tolerant facility location, introduced by Chechik and Peleg: solutions here are designed to provide low connection cost in case of failure of up to $k$ facilities. Chechik and Peleg gave a 6.5-approximation algorithm for $k=1$ and a ($7.5k + 1.5$)-approximation algorithm for general $k$. We improve this to an LP-rounding $(k+5+4/k)$-approximation algorithm. We also observe that in case of oblivious failures the expected approximation ratio can be reduced to $k + 1.5$, and that the integrality gap of the natural LP-relaxation of the problem is at least $k + 1$.}, keywords = {Computer Science - Data Structures and Algorithms}, url = {http://arxiv.org/abs/1007.3611}, author = {Byrka,Jaroslaw and Ghodsi,Mohammadreza and Srinivasan, Aravind} } @conference {16055, title = {ManyNets: an interface for multiple network analysis and visualization}, booktitle = {Proceedings of the 28th international conference on Human factors in computing systems}, series = {CHI {\textquoteright}10}, year = {2010}, month = {2010///}, pages = {213 - 222}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Traditional network analysis tools support analysts in studying a single network. ManyNets offers these analysts a powerful new approach that enables them to work on multiple networks simultaneously. Several thousand networks can be presented as rows in a tabular visualization, and then inspected, sorted and filtered according to their attributes. The networks to be displayed can be obtained by subdivision of larger networks. Examples of meaningful subdivisions used by analysts include ego networks, community extraction, and time-based slices. Cell visualizations and interactive column overviews allow analysts to assess the distribution of attributes within particular sets of networks. Details, such as traditional node-link diagrams, are available on demand. We describe a case study analyzing a social network geared towards film recommendations by means of decomposition. A small usability study provides feedback on the use of the interface on a set of tasks issued from the case study.}, keywords = {exploratory analysis, graphical user interface, Information Visualization, interaction, network analysis, table interface}, isbn = {978-1-60558-929-9}, doi = {10.1145/1753326.1753358}, url = {http://doi.acm.org/10.1145/1753326.1753358}, author = {Freire,Manuel and Plaisant, Catherine and Shneiderman, Ben and Golbeck,Jen} } @conference {12223, title = {Maranello: practical partial packet recovery for 802.11}, booktitle = {Proceedings of the 7th USENIX conference on Networked systems design and implementation}, series = {NSDI{\textquoteright}10}, year = {2010}, month = {2010///}, pages = {14 - 14}, publisher = {USENIX Association}, organization = {USENIX Association}, address = {Berkeley, CA, USA}, abstract = {Partial packet recovery protocols attempt to repair corrupted packets instead of retransmitting them in their entirety. Recent approaches have used physical layer confidence estimates or additional error detection codes embedded in each transmission to identify corrupt bits, or have applied forward error correction to repair without such explicit knowledge. In contrast to these approaches, our goal is a practical design that simultaneously: (a) requires no extra bits in correct packets, (b) reduces recovery latency, except in rare instances, (c) remains compatible with existing 802.11 devices by obeying timing and backoff standards, and (d) can be incrementally deployed on widely available access points and wireless cards. In this paper, we design, implement, and evaluate Maranello, a novel partial packet recovery mechanism for 802.11. In Maranello, the receiver computes checksums over blocks in corrupt packets and bundles these checksums into a negative acknowledgment sent when the sender expects to receive an acknowledgment. The sender then retransmits only those blocks for which the checksum is incorrect, and repeats this partial retransmission until it receives an acknowledgment. Successful transmissions are not burdened by additional bits and the receiver needs not infer which bits were corrupted. We implemented Maranello using OpenFWWF (open source firmware for Broadcom wireless cards) and deployed it in a small testbed. We compare Maranello to alternative recovery protocols using a trace-driven simulation and to 802.11 using a live implementation under various channel conditions. To our knowledge, Maranello is the first partial packet recovery design to be implemented in commonly available firmware.}, url = {http://dl.acm.org/citation.cfm?id=1855711.1855725}, author = {Han,Bo and Schulman,Aaron and Gringoli,Francesco and Spring, Neil and Bhattacharjee, Bobby and Nava,Lorenzo and Ji,Lusheng and Lee,Seungjoon and Miller,Robert} } @conference {16025, title = {The Metacognitive Loop: An Architecture for Building Robust Intelligent Systems}, booktitle = {2010 AAAI Fall Symposium Series}, year = {2010}, month = {2010/03/11/}, abstract = {The Metacognitive Loop: An Architecture for Building Robust Intelligent Systems}, keywords = {commonsense, ontologies, robust intelligent systems}, url = {http://www.aaai.org/ocs/index.php/FSS/FSS10/paper/view/2161}, author = {Shahri,Hamid Haidarian and Dinalankara,Wikum and Fults,Scott and Wilson,Shomir and Perlis, Don and Schmill,Matt and Oates,Tim and Josyula,Darsana and Anderson,Michael} } @article {14629, title = {Mimosa: Mixture model of co-expression to detect modulators of regulatory interaction}, journal = {Algorithms for Molecular Biology}, volume = {5}, year = {2010}, month = {2010/01/04/}, pages = {4 - 4}, abstract = {Functionally related genes tend to be correlated in their expression patterns across multiple conditions and/or tissue-types. Thus co-expression networks are often used to investigate functional groups of genes. In particular, when one of the genes is a transcription factor (TF), the co-expression-based interaction is interpreted, with caution, as a direct regulatory interaction. However, any particular TF, and more importantly, any particular regulatory interaction, is likely to be active only in a subset of experimental conditions. Moreover, the subset of expression samples where the regulatory interaction holds may be marked by presence or absence of a modifier gene, such as an enzyme that post-translationally modifies the TF. Such subtlety of regulatory interactions is overlooked when one computes an overall expression correlation.}, isbn = {1748-7188}, doi = {10.1186/1748-7188-5-4}, url = {http://www.almob.org/content/5/1/4}, author = {Hansen,Matthew and Everett,Logan and Singh,Larry and Hannenhalli, Sridhar} } @article {17625, title = {Mobile data offloading in metropolitan area networks}, journal = {SIGMOBILE Mob. Comput. Commun. Rev.}, volume = {14}, year = {2010}, month = {2010/11//}, pages = {28 - 30}, abstract = {Cellular networks, especially 3G networks, are currently overloaded with mobile data traffic. It is thus imperative to develop novel communication architectures and protocols for this problem. In this paper, we propose to exploit the delay-tolerant nature of non-realtime applications to offload mobile data traffic through opportunistic communications and WiFi networks. We argue that it is necessary for cellular network operators, WiFi service providers, and end-users to cooperate to make the offloading more effective. We also present several preliminary experiment results about the work we have been conducting, which show that it is promising to offload mobile data traffic in metropolitan area networks.}, isbn = {1559-1662}, doi = {10.1145/1942268.1942279}, url = {http://doi.acm.org/10.1145/1942268.1942279}, author = {Han,Bo and Hui,Pan and Srinivasan, Aravind} } @inbook {15770, title = {Modelling Type 1a Supernova Light Curves}, booktitle = {Exponential Data Fitting and Its ApplicationsExponential Data Fitting and Its Applications}, year = {2010}, month = {2010///}, pages = {169 - 186}, publisher = {Bentham Science Publishers Ltd.}, organization = {Bentham Science Publishers Ltd.}, url = {http://www.bentham.org/ebooks/9781608050482/http://www.bentham.org/ebooks/9781608050482/}, author = {Rust,Bert W. and O{\textquoteright}Leary, Dianne P. and Mullen,Katharine M.}, editor = {Pereyra,V. and Scherer,G.} } @conference {14989, title = {Monitoring distributed collections using the Audit Control Environment (ACE)}, booktitle = {Proceedings of the 2010 Roadmap for Digital Preservation Interoperability Framework Workshop}, series = {US-DPIF {\textquoteright}10}, year = {2010}, month = {2010///}, pages = {13:1{\textendash}13:5 - 13:1{\textendash}13:5}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {The Audit Control Environment (ACE) is a system which provides a scalable, auditable platform that actively monitors collections to ensure their integrity over the lifetime of an archive. It accomplishes this by using a small integrity token issued for each monitored item. This token is part of a larger externally auditable cryptographic system. We will describe how this system has been implemented for a set of applications designed to run in an archive or library environment. ACE has been used for almost two years by the Chronopolis Preservation Environment to monitor the integrity of collections replicated between the three independent archive partners. During this time, ACE has been expanded to better support the requirements of this distributed archive. We will describe how ACE has been used and expanded to support the Chronopolis preservation requirements. We conclude by discussing several future requirements for integrity monitoring that have been identified by users of ACE. These include securely monitoring remote data, monitoring offline data, and scaling monitoring activities in a way that does not impact the normal operational activity of an archive.}, keywords = {digital, preservation}, isbn = {978-1-4503-0109-1}, doi = {10.1145/2039274.2039287}, url = {http://doi.acm.org/10.1145/2039274.2039287}, author = {Smorul,Michael and Song,Sangchul and JaJa, Joseph F.} } @conference {12479, title = {Moving vistas: Exploiting motion for describing scenes}, booktitle = {2010 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)}, year = {2010}, month = {2010/06/13/18}, pages = {1911 - 1918}, publisher = {IEEE}, organization = {IEEE}, abstract = {Scene recognition in an unconstrained setting is an open and challenging problem with wide applications. In this paper, we study the role of scene dynamics for improved representation of scenes. We subsequently propose dynamic attributes which can be augmented with spatial attributes of a scene for semantically meaningful categorization of dynamic scenes. We further explore accurate and generalizable computational models for characterizing the dynamics of unconstrained scenes. The large intra-class variation due to unconstrained settings and the complex underlying physics present challenging problems in modeling scene dynamics. Motivated by these factors, we propose using the theory of chaotic systems to capture dynamics. Due to the lack of a suitable dataset, we compiled a dataset of {\textquoteleft}in-the-wild{\textquoteright} dynamic scenes. Experimental results show that the proposed framework leads to the best classification rate among other well-known dynamic modeling techniques. We also show how these dynamic features provide a means to describe dynamic scenes with motion-attributes, which then leads to meaningful organization of the video data.}, keywords = {Application software, Automation, Chaos, chaotic system, Computational modeling, Computer vision, dynamic scene categorization, Educational institutions, HUMANS, image recognition, in the wild dynamic scene, Layout, motion attribute, natural scenes, Physics, probability, scene recognition, Snow, video data}, isbn = {978-1-4244-6984-0}, doi = {10.1109/CVPR.2010.5539864}, author = {Shroff, N. and Turaga,P. and Chellapa, Rama} } @inbook {16823, title = {Multidimensional data structures for spatial applications}, booktitle = {Algorithms and theory of computation handbookAlgorithms and theory of computation handbook}, year = {2010}, month = {2010///}, pages = {6 - 6}, publisher = {Chapman \& Hall/CRC}, organization = {Chapman \& Hall/CRC}, abstract = {An overview is presented of a number of representations of multidimensional data that arise in spatial applications. Multidimensional spatial data consists of points as well as objects that have extent such as line segments, rectangles, regions, and volumes. The points may have locational as well as nonlocational attributes. The focus is on spatial data which is a subset of multidimensional data consisting of points with locational attributes and objects with extent. The emphasis is on hierarchical representations based on the "divide-and-conquer" problem-solving paradigm. They are of interest because they enable focusing computational resources on the interesting subsets of data. Thus, there is no need to expend work where the payoff is small. These representations are of use in operations such as range searching and finding nearest neighbors.}, isbn = {978-1-58488-822-2}, url = {http://dl.acm.org/citation.cfm?id=1882757.1882763}, author = {Samet, Hanan}, editor = {Atallah,Mikhail J. and Blanton,Marina} } @conference {17633, title = {New Constructive Aspects of the Lovasz Local Lemma}, booktitle = {2010 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS)}, year = {2010}, month = {2010/10/23/26}, pages = {397 - 406}, publisher = {IEEE}, organization = {IEEE}, abstract = {The Lov{\textquoteright}{a}sz Local Lemma (LLL) is a powerful tool that gives sufficient conditions for avoiding all of a given set of {\textquoteleft}{\textquoteleft}bad{\textquoteright}{\textquoteright} events, with positive probability. A series of results have provided algorithms to efficiently construct structures whose existence is non-constructively guaranteed by the LLL, culminating in the recent breakthrough of Moser \& Tardos. We show that the output distribution of the Moser-Tardos algorithm well-approximates the emph{conditional LLL-distribution} {\textendash} the distribution obtained by conditioning on all bad events being avoided. We show how a known bound on the probabilities of events in this distribution can be used for further probabilistic analysis and give new constructive and non-constructive results. We also show that when an LLL application provides a small amount of slack, the number of resamplings of the Moser-Tardos algorithm is nearly linear in the number of underlying independent variables (not events!), and can thus be used to give efficient constructions in cases where the underlying proof applies the LLL to super-polynomially many events. Even in cases where finding a bad event that holds is computationally hard, we show that applying the algorithm to avoid a polynomial-sized {\textquoteleft}{\textquoteleft}core{\textquoteright}{\textquoteright} subset of bad events leads to a desired outcome with high probability. We demonstrate this idea on several applications. We give the first constant-factor approximation algorithm for the Santa Claus problem by making an LLL-based proof of Feige constructive. We provide Monte Carlo algorithms for acyclic edge coloring, non-repetitive graph colorings, and Ramsey-type graphs. In all these applications the algorithm falls directly out of the non-constructive LLL-based proof. Our algorithms are very simple, often provide better bounds than previous algorithms, and are in several cases the first efficient algorithms known. As a second type of application we consider settings beyond the critical dependency threshold of the LLL: - - avoiding all bad events is impossible in these cases. As the first (even non-constructive) result of this kind, we show that by sampling from the LLL-distribution of a selected smaller core, we can avoid a fraction of bad events that is higher than the expectation. MAX $k$-SAT is an example of this.}, keywords = {acyclic edge coloring, Algorithm design and analysis, Approximation algorithms, Approximation methods, computational complexity, Computer science, constant factor approximation algorithm, graph colouring, Linearity, Lovasz Local Lemma, MAX k-SAT, Monte Carlo Algorithm, Monte Carlo methods, Moser-Tardos algorithm, nonrepetitive graph coloring, output distribution, polynomial sized core subset, Polynomials, Probabilistc Method, probabilistic analysis, probabilistic logic, probability, Ramsey type graph, Sampling methods, Santa Claus Problem}, isbn = {978-1-4244-8525-3}, doi = {10.1109/FOCS.2010.45}, author = {Haeupler,B. and Saha,B. and Srinivasan, Aravind} } @article {16053, title = {New forms of Human-Computer Interaction for Visualizing Information}, journal = {Information Visualization}, year = {2010}, month = {2010///}, abstract = {The Graphical User Interface (GUI) {\textendash} although developed in research laboratories in the late 1970s {\textendash} is still the dominant interaction paradigm in Information Visualization. We propose a new interaction paradigm called Blended Interaction. It combines ideas of Embodied Cognition, Multimodal Interaction, Reality-Based Interaction \& Ubiquitous Computing. This is intended to stress that a single increase in the reality aspect of the interaction cannot go far enough. The particular challenge {\textendash} and from the user{\textquoteright}s standpoint, the key advantage {\textendash} lies in a meaningful marriage between the tested real-world options and the digital world. As a minimum this marriage must exist on the levels of the interaction, communication, of the way we solve problems with conventional tools (workflows), and of the design of the space or the architecture of buildings and places. The digital world often offers entirely new possibilities and takes the form of interactive devices of various shapes but also of intelligent everyday objects (e.g. the {\textquoteright}Internet of things{\textquoteright}). In our view, interaction concepts can indeed offer a new quality of interaction, but only when the design of the interaction includes all these domains at the same time and with equal weighting. We test the suitability of our ideas of Blended Interaction concepts by using specific application examples that are being worked on as part of current research projects. Our experiences show that this new interaction paradigm has also great potential for interacting with visualization. For example, we have developed multi-touch scatter plots \& facet maps for tangible user interfaces supporting the searching \& browsing in Digital Libraries. We have embedded different visualizations into a Zoomable Object-oriented Information Landscape (ZOIL), which supports our vision of using visualizations on different displays of different size at the same time. We have developed specific kind of search tokens that supports collaborative search activities. For example, we try to address the following research questions: * How can future interactive InfoVis tools look like, especially in the light of the idea Blended Interaction? * How can future interactive InfoVis tools benefit from Multi-Displays \& Multimodal environments used by Multiple Users? * What are the specific design requirements for multi-touch visualizations? * How can we support the collaborative use visualization tools?}, author = {Reiterer,H. and Kerren,A. and Plaisant, Catherine and Stasko,J.T.} } @conference {18641, title = {Nfsight: netflow-based network awareness tool}, year = {2010}, month = {2010///}, abstract = {Network awareness is highly critical for network and se-curity administrators. It enables informed planning and management of network resources, as well as detection and a comprehensive understanding of malicious activ- ity. It requires a set of tools to efficiently collect, process, and represent network data. While many such tools al- ready exist, there is no flexible and practical solution for visualizing network activity at various granularities, and quickly gaining insights about the status of network as- sets. To address this issue, we developed Nfsight, a Net- Flow processing and visualization application designed to offer a comprehensive network awareness solution. Nfsight constructs bidirectional flows out of the unidi- rectional NetFlow flows and leverages these bidirectional flows to provide client/server identification and intrusion detection capabilities. We present in this paper the in- ternal architecture of Nfsight, the evaluation of the ser- vice, and intrusion detection algorithms. We illustrate the contributions of Nfsight through several case studies conducted by security administrators on a large univer- sity network. }, url = {http://www.usenix.org/event/lisa10/tech/full_papers/Berthier.pdf}, author = {Berthier,R. and Michel Cukier and Hiltunen,M. and Kormann,D. and Vesonder,G. and Sheleheda,D.} } @conference {19023, title = {One experience collecting sensitive mobile data}, year = {2010}, month = {2010}, abstract = {We report on our efforts to collect behavioral data basedon activities recorded by phones. We recruited Android de- vice owners and offered entry into a raffle for participants. Our application was distributed from the Android Market, and its placement there unexpectedly helped us find par- ticipants from casual users browsing for free applications. We collected data from 267 total participants who gave us varying amounts of data. }, url = {http://www2.parc.com/csl/members/eshi/docs/users.pdf}, author = {Niu, Y. and Elaine Shi and Chow, R. and Golle, P. and Jakobsson, M.} } @article {12476, title = {Online Empirical Evaluation of Tracking Algorithms}, journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {32}, year = {2010}, month = {2010/08//}, pages = {1443 - 1458}, abstract = {Evaluation of tracking algorithms in the absence of ground truth is a challenging problem. There exist a variety of approaches for this problem, ranging from formal model validation techniques to heuristics that look for mismatches between track properties and the observed data. However, few of these methods scale up to the task of visual tracking, where the models are usually nonlinear and complex and typically lie in a high-dimensional space. Further, scenarios that cause track failures and/or poor tracking performance are also quite diverse for the visual tracking problem. In this paper, we propose an online performance evaluation strategy for tracking systems based on particle filters using a time-reversed Markov chain. The key intuition of our proposed methodology relies on the time-reversible nature of physical motion exhibited by most objects, which in turn should be possessed by a good tracker. In the presence of tracking failures due to occlusion, low SNR, or modeling errors, this reversible nature of the tracker is violated. We use this property for detection of track failures. To evaluate the performance of the tracker at time instant t, we use the posterior of the tracking algorithm to initialize a time-reversed Markov chain. We compute the posterior density of track parameters at the starting time t = 0 by filtering back in time to the initial time instant. The distance between the posterior density of the time-reversed chain (at t = 0) and the prior density used to initialize the tracking algorithm forms the decision statistic for evaluation. It is observed that when the data are generated by the underlying models, the decision statistic takes a low value. We provide a thorough experimental analysis of the evaluation methodology. Specifically, we demonstrate the effectiveness of our approach for tackling common challenges such as occlusion, pose, and illumination changes and provide the Receiver Operating Characteristic (ROC) curves. Finally, we also s how the applicability of the core ideas of the paper to other tracking algorithms such as the Kanade-Lucas-Tomasi (KLT) feature tracker and the mean-shift tracker.}, keywords = {Back, Biomedical imaging, Computer vision, Filtering, formal model validation techniques, formal verification, ground truth, Kanade Lucas Tomasi feature tracker, Karhunen-Loeve transforms, lighting, Markov processes, mean shift tracker, model validation., online empirical evaluation, particle filtering (numerical methods), Particle filters, Particle tracking, performance evaluation, receiver operating characteristic curves, Robustness, SNR, Statistics, Surveillance, time reversed Markov chain, tracking, tracking algorithms, visual tracking}, isbn = {0162-8828}, doi = {10.1109/TPAMI.2009.135}, author = {Wu,Hao and Sankaranarayanan,A. C and Chellapa, Rama} } @conference {16826, title = {Ontuition: intuitive data exploration via ontology navigation}, booktitle = {Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems}, series = {GIS {\textquoteright}10}, year = {2010}, month = {2010///}, pages = {540 - 541}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Ontuition, a system for mapping ontologies, is presented. Transforming data to a usable format for Ontuition involves recognizing and resolving data values corresponding to concepts in multiple ontological domains. In particular, for datasets with a geographic component an attempt is made to identify and extract enough spatio-textual data that specific lat/long values to dataset entries can be assigned. Next, a gazetteer is used to transform the textually-specified locations into lat/long values that can be displayed on a map. Non-spatial ontological concepts are also discovered. This methodology is applied to the National Library of Medicine{\textquoteright}s very popular clinical trials website (http://clinicaltrials.gov/) whose users are generally interested in locating trials near where they live. The trials are specified using XML files. The location data is extracted and coupled with a disease ontology to enable general queries on the data with the result being of use to a very large group of people. The goal is to do this automatically for such ontology datasets with a locational component.}, keywords = {MAPPING, ontology, ontuition, spatio-textual}, isbn = {978-1-4503-0428-3}, doi = {10.1145/1869790.1869887}, url = {http://doi.acm.org/10.1145/1869790.1869887}, author = {Adelfio,Marco D. and Lieberman,Michael D. and Samet, Hanan and Firozvi,Kashif A.} } @article {12466, title = {PADS: A Probabilistic Activity Detection Framework for Video Data}, journal = {Pattern Analysis and Machine Intelligence, IEEE Transactions on}, volume = {32}, year = {2010}, month = {2010/12//}, pages = {2246 - 2261}, abstract = {There is now a growing need to identify various kinds of activities that occur in videos. In this paper, we first present a logical language called Probabilistic Activity Description Language (PADL) in which users can specify activities of interest. We then develop a probabilistic framework which assigns to any subvideo of a given video sequence a probability that the subvideo contains the given activity, and we finally develop two fast algorithms to detect activities within this framework. OffPad finds all minimal segments of a video that contain a given activity with a probability exceeding a given threshold. In contrast, the OnPad algorithm examines a video during playout (rather than afterwards as OffPad does) and computes the probability that a given activity is occurring (even if the activity is only partially complete). Our prototype Probabilistic Activity Detection System (PADS) implements the framework and the two algorithms, building on top of existing image processing algorithms. We have conducted detailed experiments and compared our approach to four different approaches presented in the literature. We show that-for complex activity definitions-our approach outperforms all the other approaches.}, keywords = {Automated;Programming Languages;Video Recording;, Computer-Assisted;Models, PADL;PADS;image processing algorithms;offPad algorithm;onPad algorithm;probabilistic activity description language;probabilistic activity detection framework;video data;video sequence;image sequences;object detection;probability;video surveillance;Algorit, Statistical;Movement;Pattern Recognition}, isbn = {0162-8828}, doi = {10.1109/TPAMI.2010.33}, author = {Albanese, M. and Chellapa, Rama and Cuntoor, N. and Moscato, V. and Picariello, A. and V.S. Subrahmanian and Udrea,O.} } @article {15118, title = {Parallel and concurrent security of the HB and HB+ protocols}, journal = {Journal of cryptology}, volume = {23}, year = {2010}, month = {2010///}, pages = {402 - 421}, abstract = {Hopper and Blum (Asiacrypt 2001) and Juels and Weis (Crypto 2005) recently proposed two shared-key authentication protocols{\textemdash}HB and HB+, respectively{\textemdash}whose extremely low computational cost makes them attractive for low-cost devices such as radio-frequency identification (RFID) tags. The security of these protocols is based on the conjectured hardness of the {\textquotedblleft}learning parity with noise{\textquotedblright} (LPN) problem, which is equivalent to the problem of decoding random binary linear codes. The HB protocol is proven secure against a passive (eavesdropping) adversary, while the HB+ protocol is proven secure against active attacks.}, doi = {10.1007/s00145-010-9061-2}, author = {Katz, Jonathan and Shin,J. S and Smith,A.} } @article {13085, title = {Partial least squares on graphical processor for efficient pattern recognition}, journal = {Technical Reports of the Computer Science Department}, year = {2010}, month = {2010/10/18/}, abstract = {Partial least squares (PLS) methods have recently been used for many patternrecognition problems in computer vision. Here, PLS is primarily used as a supervised dimensionality reduction tool to obtain effective feature combinations for better learning. However, application of PLS to large datasets is hindered by its higher computational cost. We propose an approach to accelerate the classical PLS algorithm on graphical processors to obtain the same performance at a reduced cost. Although, PLS modeling is practically an offline training process, accelerating it helps large scale modeling. The proposed acceleration is shown to perform well and it yields upto ~30X speedup, It is applied on standard datasets in human detection and face recognition. }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/10975}, author = {Srinivasan,Balaji Vasan and Schwartz,William Robson and Duraiswami, Ramani and Davis, Larry S.} } @conference {13624, title = {Performance Evaluation Tools for Zone Segmentation and Classification (PETS)}, booktitle = {International Conference on Pattern Recognition}, year = {2010}, month = {2010///}, pages = {503 - 506}, abstract = {This paper overviews a set of Performance Evaluation ToolS (PETS) for zone segmentation and classification. The tools allow researchers and developers to evaluate, optimize and compare their algorithms by providing a variety of quantitative performance metrics. The evaluation of segmentation quality is based on the pixel-based overlaps between two sets of regions proposed by Randriamasy and Vincent. PETS extends the approach by providing a set of metrics for overlap analysis, RLE and polygonal representation of regions and introduces type-matching to evaluate zone classification. The software is available for research use.}, author = {Seo,W. and Agrawal,Mudit and David Doermann} } @article {18708, title = {Perturbing the Ubiquitin Pathway Reveals How Mitosis Is Hijacked to Denucleate and Regulate Cell Proliferation and Differentiation In Vivo}, journal = {PLoS ONEPLoS ONE}, volume = {5}, year = {2010}, month = {2010/10/20/}, pages = {e13331 - e13331}, abstract = {BackgroundThe eye lens presents a unique opportunity to explore roles for specific molecules in cell proliferation, differentiation and development because cells remain in place throughout life and, like red blood cells and keratinocytes, they go through the most extreme differentiation, including removal of nuclei and cessation of protein synthesis. Ubiquitination controls many critical cellular processes, most of which require specific lysines on ubiquitin (Ub). Of the 7 lysines (K) least is known about effects of modification of K6. Methodology and Principal Findings We replaced K6 with tryptophan (W) because K6 is the most readily modified K and W is the most structurally similar residue to biotin. The backbone of K6W-Ub is indistinguishable from that of Wt-Ub. K6W-Ub is effectively conjugated and deconjugated but the conjugates are not degraded via the ubiquitin proteasome pathways (UPP). Expression of K6W-ubiquitin in the lens and lens cells results in accumulation of intracellular aggregates and also slows cell proliferation and the differentiation program, including expression of lens specific proteins, differentiation of epithelial cells into fibers, achieving proper fiber cell morphology, and removal of nuclei. The latter is critical for transparency, but the mechanism by which cell nuclei are removed has remained an age old enigma. This was also solved by expressing K6W-Ub. p27kip, a UPP substrate accumulates in lenses which express K6W-Ub. This precludes phosphorylation of nuclear lamin by the mitotic kinase, a prerequisite for disassembly of the nuclear membrane. Thus the nucleus remains intact and DNAseIIβ neither gains entry to the nucleus nor degrades the DNA. These results could not be obtained using chemical proteasome inhibitors that cannot be directed to specific tissues. Conclusions and Significance K6W-Ub provides a novel, genetic means to study functions of the UPP because it can be targeted to specific cells and tissues. A fully functional UPP is required to execute most stages of lens differentiation, specifically removal of cell nuclei. In the absence of a functional UPP, small aggregate prone, cataractous lenses are formed. }, doi = {10.1371/journal.pone.0013331}, url = {http://dx.doi.org/10.1371/journal.pone.0013331}, author = {Caceres,Andrea and Shang,Fu and Wawrousek,Eric and Liu,Qing and Avidan,Orna and Cvekl,Ales and Yang,Ying and Haririnia,Aydin and Storaska,Andrew and Fushman, David and Kuszak,Jer and Dudek,Edward and Smith,Donald and Taylor,Allen} } @article {17985, title = {Plasmonic Systems and Devices Utilizing Surface Plasmon Polariton}, volume = {12/697,595}, year = {2010}, month = {2010/05/27/}, abstract = {Plasmonic systems and devices that utilize surface plasmon polaritons (or {\textquotedblleft}plasmons{\textquotedblright}) for inter-chip and/or intra-chip communications are provided. A plasmonic system includes a microchip that has an integrated circuit module and a plasmonic device configured to interface with the integrated circuit module. The plasmonic device includes a first electrode, a second electrode positioned at a non-contact distance from the first electrode, and a tunneling-junction configured to create a plasmon when a potential difference is created between the first electrode and the second electrode.}, url = {http://www.google.com/patents?id=2VnRAAAAEBAJ}, author = {Smolyaninov,Igor I. and Vishkin, Uzi and Davis,Christopher C.} } @article {16817, title = {Query Processing Using Distance Oracles for Spatial Networks}, journal = {Knowledge and Data Engineering, IEEE Transactions on}, volume = {22}, year = {2010}, month = {2010/08//}, pages = {1158 - 1175}, 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 here is that the efficient execution of spatial operations usually involves the computation of distance along a spatial network instead of "as the crow flies, $\#$x0201D; which is not simple. Techniques are described that enable the determination of the network distance between any pair of points (i.e., vertices) with as little as O(n) space rather than having to store the n^2 distances between all pairs. This is done by being willing to expend a bit more time to achieve this goal such as O(log n) instead of O(1), as well as by accepting an error varepsilon in the accuracy of the distance that is provided. The strategy that is adopted reduces the space requirements and is based on the ability to identify groups of source and destination vertices for which the distance is approximately the same within some varepsilon. The reductions are achieved by introducing a construct termed a distance oracle that yields an estimate of the network distance (termed the varepsilon-approximate distance) between any two vertices in the spatial network. The distance oracle is obtained by showing how to adapt the well-separated pair technique from computational geometry to spatial networks. Initially, an varepsilon-approximate distance oracle of size O(nover varepsilon^2 ) is used 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 varepsilon-approximate distance oracle of size O(n log nover varepsilon^2 ) that uses a hash table. Experimental results indicate that the proposed technique is scalable and can be applied to sufficiently large road networks. For example, a 10-percent-approximate oracle (vareps- - ilon = 0.1) on a large network yielded an average error of 0.9 percent with 90 percent of the answers having an error of 2 percent or less and an average retrieval time of 68 mu rm seconds. The fact that the network distance can be approximated by one value is used to show how a number of spatial queries can be formulated using appropriate SQL constructs and a few built-in primitives. The result is that these operations can be executed on almost any modern database with no modifications, while taking advantage of the existing query optimizers and query processing strategies.}, isbn = {1041-4347}, doi = {10.1109/TKDE.2010.75}, author = {Sankaranarayanan,Jagan and Samet, Hanan} } @article {13950, title = {Random sampling for estimating the performance of fast summations}, journal = {Technical Reports of the Computer Science Department}, year = {2010}, month = {2010/10/18/}, abstract = {Summation of functions of N source points evaluated at M target pointsoccurs commonly in many applications. To scale these approaches for large datasets, many fast algorithms have been proposed. In this technical report, we propose a Chernoff bound based efficient approach to test the performance of a fast summation algorithms providing a probabilistic accuracy. We further validate and use our approach in separate comparisons. }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/10976}, author = {Srinivasan,Balaji Vasan and Duraiswami, Ramani} } @conference {19291, title = {Rapid prototyping for digital signal processing systems using Parameterized Synchronous Dataflow graphs}, booktitle = {2010 21st IEEE International Symposium on Rapid System Prototyping (RSP)}, year = {2010}, month = {2010}, pages = {1 - 7}, abstract = {Parameterized Synchronous Dataflow (PSDF) has been used previously for abstract scheduling and as a model for architecting embedded software and FPGA implementations. PSDF has been shown to be attractive for these purposes due to its support for flexible dynamic reconfiguration, and efficient quasi-static scheduling. To apply PSDF techniques more deeply into the design flow, support for comprehensive functional simulation and efficient hardware mapping is important. By building on the DIF (Dataflow Interchange Format), which is a design language and associated software package for developing and experimenting with dataflow-based design techniques for signal processing systems, we have developed a tool for functional simulation of PSDF specifications. This simulation tool allows designers to model applications in PSDF and simulate their functionality, including use of the dynamic parameter reconfiguration capabilities offered by PSDF. Based on this simulation tool, we also present a systematic design methodology for applying PSDF to the design and implementation of digital signal processing systems, with emphasis on FPGA-based systems for signal processing. We demonstrate capabilities for rapid and accurate prototyping offered by our proposed design methodology, along with its novel support for PSDF-based FPGA system implementation.}, keywords = {abstract scheduling, Computational modeling, Computer architecture, data flow graphs, dataflow based design, dataflow interchange format, design flow, design language, Digital signal processing, digital signal processing systems, dynamic parameter reconfiguration, Dynamic scheduling, efficient hardware mapping, efficient quasistatic scheduling, Embedded software, embedded systems, Field programmable gate arrays, flexible dynamic reconfiguration, FPGA based systems, FPGA implementations, functional simulation, Hardware, parameterized synchronous dataflow graphs, rapid prototyping, Schedules, scheduling, semantics, simulation tool, software package, systematic design methodology}, author = {Wu, Hsiang-Huang and Kee, Hojin and Sane, N. and Plishker,W. and Bhattacharyya, Shuvra S.} } @article {13399, title = {Read-once functions and query evaluation in probabilistic databases}, journal = {Proc. VLDB Endow.}, volume = {3}, year = {2010}, month = {2010/09//}, pages = {1068 - 1079}, abstract = {Probabilistic databases hold promise of being a viable means for large-scale uncertainty management, increasingly needed in a number of real world applications domains. However, query evaluation in probabilistic databases remains a computational challenge. Prior work on efficient exact query evaluation in probabilistic databases has largely concentrated on query-centric formulations (e.g., safe plans, hierarchical queries), in that, they only consider characteristics of the query and not the data in the database. It is easy to construct examples where a supposedly hard query run on an appropriate database gives rise to a tractable query evaluation problem. In this paper, we develop efficient query evaluation techniques that leverage characteristics of both the query and the data in the database. We focus on tuple-independent databases where the query evaluation problem is equivalent to computing marginal probabilities of Boolean formulas associated with the result tuples. This latter task is easy if the Boolean formulas can be factorized into a form that has every variable appearing at most once (called read-once). However, a naive approach that directly uses previously developed Boolean formula factorization algorithms is inefficient, because those algorithms require the input formulas to be in the disjunctive normal form (DNF). We instead develop novel, more efficient factorization algorithms that directly construct the read-once expression for a result tuple Boolean formula (if one exists), for a large subclass of queries (specifically, conjunctive queries without self-joins). We empirically demonstrate that (1) our proposed techniques are orders of magnitude faster than generic inference algorithms for queries where the result Boolean formulas can be factorized into read-once expressions, and (2) for the special case of hierarchical queries, they rival the efficiency of prior techniques specifically designed to handle such queries.}, isbn = {2150-8097}, url = {http://dl.acm.org/citation.cfm?id=1920841.1920975}, author = {Sen,Prithviraj and Deshpande, Amol and Getoor, Lise} } @article {14373, title = {REPORTS AI Theory and Practice: A Discussion on Hard Challenges and Opportunities Ahead}, journal = {AI Magazine}, volume = {31}, year = {2010}, month = {2010///}, pages = {87 - 87}, author = {Horvitz,E. and Getoor, Lise and Guestrin,C. and Hendler,J. and Kautz,H. and Konstan,J. and Subramanian,D. and Wellman,M.} } @conference {19593, title = {Resolving and Exploiting the k-CFA Paradox: Illuminating Functional vs. Object-oriented Program Analysis}, booktitle = {PLDI {\textquoteright}10 Proceedings of the 2010 ACM SIGPLAN Conference on Programming Language Design and Implementation}, series = {PLDI {\textquoteright}10}, year = {2010}, month = {2010///}, pages = {305 - 315}, publisher = {ACM}, organization = {ACM}, abstract = {Low-level program analysis is a fundamental problem, taking the shape of "flow analysis" in functional languages and "points-to" analysis in imperative and object-oriented languages. Despite the similarities, the vocabulary and results in the two communities remain largely distinct, with limited cross-understanding. One of the few links is Shivers{\textquoteright}s k-CFA work, which has advanced the concept of "context-sensitive analysis" and is widely known in both communities. Recent results indicate that the relationship between the functional and object-oriented incarnations of k-CFA is not as well understood as thought. Van Horn and Mairson proved k-CFA for k >= 1 to be EXPTIME-complete; hence, no polynomial-time algorithm can exist. Yet, there are several polynomial-time formulations of context-sensitive points-to analyses in object-oriented languages. Thus, it seems that functional k-CFA may actually be a profoundly different analysis from object-oriented k-CFA. We resolve this paradox by showing that the exact same specification of k-CFA is polynomial-time for object-oriented languages yet exponential-time for functional ones: objects and closures are subtly different, in a way that interacts crucially with context-sensitivity and complexity. This illumination leads to an immediate payoff: by projecting the object-oriented treatment of objects onto closures, we derive a polynomial-time hierarchy of context-sensitive CFAs for functional programs.}, keywords = {control-flow analysis, functional, k-cfa, m-cfa, object-oriented, pointer analysis, static analysis}, isbn = {978-1-4503-0019-3}, url = {http://doi.acm.org/10.1145/1806596.1806631}, author = {Might, Matthew and Smaragdakis, Yannis and David Van Horn} } @article {18711, title = {Reversible Post-Translational Carboxylation Modulates the Enzymatic Activity of N-Acetyl-l-ornithine Transcarbamylase}, journal = {Biochemistry}, volume = {49}, year = {2010}, month = {2010///}, pages = {6887 - 6895}, abstract = {N-Acetyl-l-ornithine transcarbamylase (AOTCase), rather than ornithine transcarbamylase (OTCase), is the essential carbamylase enzyme in the arginine biosynthesis of several plant and human pathogens. The specificity of this unique enzyme provides a potential target for controlling the spread of these pathogens. Recently, several crystal structures of AOTCase from Xanthomonas campestris (xc) have been determined. In these structures, an unexplained electron density at the tip of the Lys302 side chain was observed. Using 13C NMR spectroscopy, we show herein that Lys302 is post-translationally carboxylated. The structure of wild-type AOTCase in a complex with the bisubstrate analogue Nδ-(phosphonoacetyl)-Nα-acetyl-l-ornithine (PALAO) indicates that the carboxyl group on Lys302 forms a strong hydrogen bonding network with surrounding active site residues, Lys252, Ser253, His293, and Glu92 from the adjacent subunit either directly or via a water molecule. Furthermore, the carboxyl group is involved in binding N-acetyl-l-ornithine via a water molecule. Activity assays with the wild-type enzyme and several mutants demonstrate that the post-translational modification of lysine 302 has an important role in catalysis.N-Acetyl-l-ornithine transcarbamylase (AOTCase), rather than ornithine transcarbamylase (OTCase), is the essential carbamylase enzyme in the arginine biosynthesis of several plant and human pathogens. The specificity of this unique enzyme provides a potential target for controlling the spread of these pathogens. Recently, several crystal structures of AOTCase from Xanthomonas campestris (xc) have been determined. In these structures, an unexplained electron density at the tip of the Lys302 side chain was observed. Using 13C NMR spectroscopy, we show herein that Lys302 is post-translationally carboxylated. The structure of wild-type AOTCase in a complex with the bisubstrate analogue Nδ-(phosphonoacetyl)-Nα-acetyl-l-ornithine (PALAO) indicates that the carboxyl group on Lys302 forms a strong hydrogen bonding network with surrounding active site residues, Lys252, Ser253, His293, and Glu92 from the adjacent subunit either directly or via a water molecule. Furthermore, the carboxyl group is involved in binding N-acetyl-l-ornithine via a water molecule. Activity assays with the wild-type enzyme and several mutants demonstrate that the post-translational modification of lysine 302 has an important role in catalysis. }, isbn = {0006-2960}, doi = {10.1021/bi1007386}, url = {http://dx.doi.org/10.1021/bi1007386}, author = {Li,Yongdong and Yu,Xiaolin and Ho,Jeremy and Fushman, David and Allewell,Norma M. and Tuchman,Mendel and Shi,Dashuang} } @article {16821, title = {Roads Belong in Databases}, journal = {Data Engineering}, year = {2010}, month = {2010///}, pages = {4 - 4}, author = {Samet, Hanan} } @article {13088, title = {A robust and scalable approach to face identification}, journal = {Computer Vision{\textendash}ECCV 2010}, year = {2010}, month = {2010///}, pages = {476 - 489}, abstract = {The problem of face identification has received significant attention over the years. For a given probe face, the goal of face identification is to match this unknown face against a gallery of known people. Due to the availability of large amounts of data acquired in a variety of conditions, techniques that are both robust to uncontrolled acquisition conditions and scalable to large gallery sizes, which may need to be incrementally built, are challenges. In this work we tackle both problems. Initially, we propose a novel approach to robust face identification based on Partial Least Squares (PLS) to perform multi-channel feature weighting. Then, we extend the method to a tree-based discriminative structure aiming at reducing the time required to evaluate novel probe samples. The method is evaluated through experiments on FERET and FRGC datasets. In most of the comparisons our method outperforms state-of-art face identification techniques. Furthermore, our method presents scalability to large datasets.}, author = {Schwartz,W. and Guo,H. and Davis, Larry S.} } @article {12475, title = {Robust Height Estimation of Moving Objects From Uncalibrated Videos}, journal = {IEEE Transactions on Image Processing}, volume = {19}, year = {2010}, month = {2010/08//}, pages = {2221 - 2232}, abstract = {This paper presents an approach for video metrology. From videos acquired by an uncalibrated stationary camera, we first recover the vanishing line and the vertical point of the scene based upon tracking moving objects that primarily lie on a ground plane. Using geometric properties of moving objects, a probabilistic model is constructed for simultaneously grouping trajectories and estimating vanishing points. Then we apply a single view mensuration algorithm to each of the frames to obtain height measurements. We finally fuse the multiframe measurements using the least median of squares (LMedS) as a robust cost function and the Robbins-Monro stochastic approximation (RMSA) technique. This method enables less human supervision, more flexibility and improved robustness. From the uncertainty analysis, we conclude that the method with auto-calibration is robust in practice. Results are shown based upon realistic tracking data from a variety of scenes.}, keywords = {algorithms, Biometry, Calibration, EM algorithm, geometric properties, Geometry, Image Enhancement, Image Interpretation, Computer-Assisted, Imaging, Three-Dimensional, least median of squares, least squares approximations, MOTION, motion information, multiframe measurements, Pattern Recognition, Automated, Reproducibility of results, Robbins-Monro stochastic approximation, robust height estimation, Sensitivity and Specificity, Signal Processing, Computer-Assisted, stochastic approximation, Subtraction Technique, tracking data, uncalibrated stationary camera, uncalibrated videos, uncertainty analysis, vanishing point, video metrology, Video Recording, video signal processing}, isbn = {1057-7149}, doi = {10.1109/TIP.2010.2046368}, author = {Jie Shao and Zhou,S. K and Chellapa, Rama} } @conference {19285, title = {Scalable representation of dataflow graph structures using topological patterns}, booktitle = {2010 IEEE Workshop on Signal Processing Systems (SIPS)}, year = {2010}, month = {2010}, pages = {13 - 18}, abstract = {Tools for designing signal processing systems with their semantic foundation in dataflow modeling often use high-level graphical user interface (GUI) or text based languages that allow specifying applications as directed graphs. Such graphical representations serve as an initial reference point for further analysis and optimizations that lead to platform-specific implementations. For large-scale applications, the underlying graphs often consist of smaller substructures that repeat multiple times. To enable more concise representation and direct analysis of such substructures in the context of high level DSP specification languages and design tools, we develop the modeling concept of topological patterns, and propose ways for supporting this concept in a high-level language. We augment the DIF language - a language for specifying DSP-oriented dataflow graphs - with constructs for supporting topological patterns, and we show how topological patterns can be effective in various aspects of embedded signal processing design flows using specific application examples.}, keywords = {arrays, data flow graphs, Dataflow graphs, DIF language, Digital signal processing, directed graphs, DSP specification languages, embedded signal processing design flows, embedded systems, Field programmable gate arrays, graphical user interface, Graphical user interfaces, High-level languages, modelbased design, optimisation, optimizations, scalable dataflow graph structures representation, semantics, Signal processing, Signal processing systems, Specification languages, text based languages, Topological patterns, Topology, Transform coding}, author = {Sane, N. and Kee, Hojin and Seetharaman, G. and Bhattacharyya, Shuvra S.} } @inbook {12507, title = {Semantic Video Content Analysis}, booktitle = {Video Search and MiningVideo Search and Mining}, series = {Studies in Computational Intelligence}, volume = {287}, year = {2010}, month = {2010///}, pages = {147 - 176}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {In recent years, there has been significant interest in the area of automatically recognizing activities occurring in a camera{\textquoteright}s field of view and detecting abnormalities. The practical applications of such a system could include airport tarmac monitoring, or monitoring of activities in secure installations, to name a few. The difficulty of the problem is compounded by several factors: detection of primitive actions in spite of changes in illumination, occlusions and noise; complexmultiagent interaction;mapping of higher-level activities to lower-level primitive actions; variations in which the same semantic activity can be performed. In this chapter, we develop a theory of semantic activity analysis that addresses each of these issues in an integrated manner. Specifically, we discuss ontological representations of knowledge of a domain, integration of domain knowledge and statistical models for achieving semantic mappings, definition of logical languages to describe activities, and design of frameworks which integrate all the above aspects in a coherent way, thus laying the foundations of effective Semantic Video Content Analysis systems.}, isbn = {978-3-642-12899-8}, url = {http://dx.doi.org/10.1007/978-3-642-12900-1_6}, author = {Albanese,Massimiliano and Turaga,Pavan and Chellapa, Rama and Pugliese,Andrea and Subrahmanian,V.}, editor = {Schonfeld,Dan and Shan,Caifeng and Tao,Dacheng and Wang,Liang} } @inbook {19044, title = {Signatures of Reputation}, booktitle = {Financial Cryptography and Data Security}, series = {Lecture Notes in Computer Science}, volume = {6052}, year = {2010}, month = {2010}, pages = {400 - 407}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, keywords = {Computer science}, isbn = {978-3-642-14576-6}, url = {http://www.springerlink.com/content/8484428n77226512/abstract/}, author = {Bethencourt, John and Elaine Shi and Song, Dawn}, editor = {Sion, Radu} } @conference {19296, title = {Simulating dynamic communication systems using the core functional dataflow model}, booktitle = {2010 IEEE International Conference on Acoustics Speech and Signal Processing (ICASSP)}, year = {2010}, month = {2010}, pages = {1538 - 1541}, abstract = {The latest communication technologies invariably consist of modules with dynamic behavior. There exists a number of design tools for communication system design with their foundation in dataflow modeling semantics. These tools must not only support the functional specification of dynamic communication modules and subsystems but also provide accurate estimation of resource requirements for efficient simulation and implementation. We explore this trade-off - between flexible specification of dynamic behavior and accurate estimation of resource requirements - using a representative application employing an adaptive modulation scheme. We propose an approach for precise modeling of such applications based on a recently-introduced form of dynamic dataflow called core functional dataflow. From our proposed modeling approach, we show how parameterized looped schedules can be generated and analyzed to simulate applications with low run-time overhead as well as guaranteed bounded memory execution. We demonstrate our approach using the Advanced Design System from Agilent Technologies, Inc., which is a commercial tool for design and simulation of communication systems.}, keywords = {adaptive modulation, Analytical models, Application software, Computational modeling, core functional dataflow model, Dataflow, dataflow modeling semantics, design tools, Digital signal processing, dynamic communication systems, functional specification, Hardware, modeling and simulation, Power system modeling, Predictive models, Processor scheduling, Production, Signal processing, software tools, wireless communication}, author = {Sane, N. and Chia-Jui Hsu and Pino,J. L and Bhattacharyya, Shuvra S.} } @article {19725, title = {Sites Inferred by Metabolic Background Assertion Labeling (SIMBAL): adapting the Partial Phylogenetic Profiling algorithm to scan sequences for signatures that predict protein function.}, journal = {BMC Bioinformatics}, volume = {11}, year = {2010}, month = {2010}, pages = {52}, abstract = {

BACKGROUND: Comparative genomics methods such as phylogenetic profiling can mine powerful inferences from inherently noisy biological data sets. We introduce Sites Inferred by Metabolic Background Assertion Labeling (SIMBAL), a method that applies the Partial Phylogenetic Profiling (PPP) approach locally within a protein sequence to discover short sequence signatures associated with functional sites. The approach is based on the basic scoring mechanism employed by PPP, namely the use of binomial distribution statistics to optimize sequence similarity cutoffs during searches of partitioned training sets.

RESULTS: Here we illustrate and validate the ability of the SIMBAL method to find functionally relevant short sequence signatures by application to two well-characterized protein families. In the first example, we partitioned a family of ABC permeases using a metabolic background property (urea utilization). Thus, the TRUE set for this family comprised members whose genome of origin encoded a urea utilization system. By moving a sliding window across the sequence of a permease, and searching each subsequence in turn against the full set of partitioned proteins, the method found which local sequence signatures best correlated with the urea utilization trait. Mapping of SIMBAL "hot spots" onto crystal structures of homologous permeases reveals that the significant sites are gating determinants on the cytosolic face rather than, say, docking sites for the substrate-binding protein on the extracellular face. In the second example, we partitioned a protein methyltransferase family using gene proximity as a criterion. In this case, the TRUE set comprised those methyltransferases encoded near the gene for the substrate RF-1. SIMBAL identifies sequence regions that map onto the substrate-binding interface while ignoring regions involved in the methyltransferase reaction mechanism in general. Neither method for training set construction requires any prior experimental characterization.

CONCLUSIONS: SIMBAL shows that, in functionally divergent protein families, selected short sequences often significantly outperform their full-length parent sequence for making functional predictions by sequence similarity, suggesting avenues for improved functional classifiers. When combined with structural data, SIMBAL affords the ability to localize and model functional sites.

}, keywords = {algorithms, Amino Acid Sequence, Gene Expression Profiling, Molecular Sequence Data, Phylogeny, Proteins, Sequence Analysis, Protein, Structure-Activity Relationship}, issn = {1471-2105}, doi = {10.1186/1471-2105-11-52}, author = {Jeremy D Selengut and Rusch, Douglas B and Haft, Daniel H} } @conference {16822, title = {Sorting in space: multidimensional, spatial, and metric data structures for computer graphics applications}, booktitle = {ACM SIGGRAPH ASIA 2010 Courses}, series = {SA {\textquoteright}10}, year = {2010}, month = {2010///}, pages = {3:1{\textendash}3:52 - 3:1{\textendash}3:52}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {The representation of spatial data is an important issue in game programming, computer graphics, visualization, solid modeling, and related areas including computer vision and geographic information systems (GIS). Many representations are currently used. Recently, there has been much interest in hierarchical representations such as quadtrees, octrees, and pyramids which are based on image hierarchies, as well methods that use bounding boxes which are based on object hierarchies. The key advantage of these representations is that they provide a way to index into space. In fact, they are little more than multidimensional sorts. They are compact and depending on the nature of the spatial data they save space as well as time and also facilitate operations such as search. This course provides a brief overview of hierarchical spatial data structures and related algorithms that make use of them. We describe hierarchical representations of points, lines, collections of small rectangles, regions, surfaces, and volumes. For region data, we point out the dimension-reduction property of the region quadtree and octree, as how to navigate between nodes in the same tree, thereby leading to the popularity of these representations in ray tracing applications. We also demonstrate how to use these representations for both raster and vector data. In the case of nonregion data, we show how these data structures can be used to compute nearest objects in an incremental fashion so that the number of objects need not be known in advance. We also review a number of different tessellations and show why hierarchical decomposition into squares instead of triangles or hexagons is preferred. In addition a demonstration of the SAND spatial browser based on the SAND spatial database system and of the VASCO JAVA applet illustrating these methods (found at http://www.cs.umd.edu/~hjs/quadtree/index.html) will be presented.}, isbn = {978-1-4503-0527-3}, doi = {10.1145/1900520.1900523}, url = {http://doi.acm.org/10.1145/1900520.1900523}, author = {Samet, Hanan} } @article {12468, title = {Special Section on Distributed Camera Networks: Sensing, Processing, Communication, and Implementation}, journal = {Image Processing, IEEE Transactions on}, volume = {19}, year = {2010}, month = {2010/10//}, pages = {2513 - 2515}, abstract = {The eight papers in this special section span across theoretical and practical considerations of various aspects of distributed camera networks, including adaptive sensing, distributed processing, efficient communications, and versatile implementations.}, isbn = {1057-7149}, doi = {10.1109/TIP.2010.2063650}, author = {Chellapa, Rama and Heinzelman, W. and Konrad, J. and Schonfeld, D. and Wolf, M.} } @article {13087, title = {SPECIAL SECTION ON SHAPE ANALYSIS AND ITS APPLICATIONS IN IMAGE UNDERSTANDING}, journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {32}, year = {2010}, month = {2010///}, pages = {0162 - 8828}, author = {Srivastava, A. and Damon,J.N. and Dryden,I.L. and Jermyn,I.H. and Das,S. and Vaswani, N. and Huckemann,S. and Hotz,T. and Munk,A. and Lin,Z. and others} } @article {15397, title = {On Stability of Magnetization Dynamics in Nanoparticles}, journal = {Magnetics, IEEE Transactions on}, volume = {46}, year = {2010}, month = {2010/06//}, pages = {1718 - 1721}, abstract = {It is rigorously demonstrated that spatially uniform magnetization oscillations in sufficiently small ellipsoidal nanoparticles can be unconditionally stable with respect to spatially nonuniform perturbations. The proof reveals the dominant stabilizing effect of exchange field which is mathematically manifested through the Poincare inequality.}, keywords = {(electron);magnetic, DYNAMICS, ellipsoidal, field;magnetization, inequality;exchange, INTERACTIONS, magnetization, nanoparticles;spatially, nonuniform, oscillations;spin-wave, particles;magnetisation;nanoparticles;spin, perturbations;exchange, perturbations;spatially, Poincare, stability;small, uniform, waves;}, isbn = {0018-9464}, doi = {10.1109/TMAG.2009.2039119}, author = {Mayergoyz, Issak D and Serpico,C. and Bertotti,G.} } @conference {17423, title = {The state of visual analytics: Views on what visual analytics is and where it is going}, booktitle = {2010 IEEE Symposium on Visual Analytics Science and Technology (VAST)}, year = {2010}, month = {2010/10/25/26}, pages = {257 - 259}, publisher = {IEEE}, organization = {IEEE}, abstract = {In the 2005 publication "Illuminating the Path" visual analytics was defined as "the science of analytical reasoning facilitated by interactive visual interfaces." A lot of work has been done in visual analytics over the intervening five years. While visual analytics started in the United States with a focus on security, it is now a worldwide research agenda with a broad range of application domains. This is evidenced by efforts like the European VisMaster program and the upcoming Visual Analytics and Knowledge Discovery (VAKD) workshop, just to name two.There are still questions concerning where and how visual analytics fits in the large body of research and applications represented by the VisWeek community. This panel will present distinct viewpoints on what visual analytics is and its role in understanding complex information in a complex world. The goal of this panel is to engender discussion from the audience on the emergence and continued advancement of visual analytics and its role relative to fields of related research. Four distinguished panelists will provide their perspective on visual analytics focusing on what it is, what it should be, and thoughts about a development path between these two states. The purpose of the presentations is not to give a critical review of the literature but rather to give a review on the field and to provide a contextual perspective based on the panelists{\textquoteright} years of experience and accumulated knowledge.}, keywords = {analytical reasoning, Data analysis, data mining, data visualisation, European VisMaster program, interactive visual interfaces, knowledge discovery, United States, visual analytics, VisWeek community}, isbn = {978-1-4244-9488-0}, doi = {10.1109/VAST.2010.5649078}, author = {May,R. and Hanrahan,P. and Keim,D. A and Shneiderman, Ben and Card,S.} } @inbook {12497, title = {Statistical Analysis on Manifolds and Its Applications to Video Analysis}, booktitle = {Video Search and MiningVideo Search and Mining}, series = {Studies in Computational Intelligence}, volume = {287}, year = {2010}, month = {2010///}, pages = {115 - 144}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {The analysis and interpretation of video data is an important component of modern vision applications such as biometrics, surveillance, motionsynthesis and web-based user interfaces. A common requirement among these very different applications is the ability to learn statistical models of appearance and motion from a collection of videos, and then use them for recognizing actions or persons in a new video. These applications in video analysis require statistical inference methods to be devised on non-Euclidean spaces or more formally on manifolds. This chapter outlines a broad survey of applications in video analysis that involve manifolds. We develop the required mathematical tools needed to perform statistical inference on manifolds and show their effectiveness in real video-understanding applications.}, isbn = {978-3-642-12899-8}, url = {http://dx.doi.org/10.1007/978-3-642-12900-1_5}, author = {Turaga,Pavan and Veeraraghavan,Ashok and Srivastava,Anuj and Chellapa, Rama}, editor = {Schonfeld,Dan and Shan,Caifeng and Tao,Dacheng and Wang,Liang} } @book {12505, title = {Statistical Methods and Models for Video-Based Tracking, Modeling, and Recognition}, year = {2010}, month = {2010///}, publisher = {Now Publishers Inc}, organization = {Now Publishers Inc}, abstract = {Computer vision systems attempt to understand a scene and its components from mostly visual information. The geometry exhibited by the real world, the influence of material properties on scattering of incident light, and the process of imaging introduce constraints and properties that are key to solving some of these tasks. In the presence of noisy observations and other uncertainties, the algorithms make use of statistical methods for robust inference. Statistical Methods and Models for Video-based Tracking, Modeling, and Recognition highlights the role of geometric constraints in statistical estimation methods, and how the interplay of geometry and statistics leads to the choice and design of algorithms. In particular, it illustrates the role of imaging, illumination, and motion constraints in classical vision problems such as tracking, structure from motion, metrology, activity analysis and recognition, and appropriate statistical methods used in each of these problems.}, keywords = {Computers / Computer Vision \& Pattern Recognition, Computers / Image Processing, Technology \& Engineering / Electronics / General, Technology \& Engineering / General}, isbn = {9781601983145}, author = {Chellapa, Rama and Sankaranarayanan,Aswin C. and Veeraraghavan,Ashok} } @conference {18864, title = {Strategy generation in multi-agent imperfect-information pursuit games}, series = {AAMAS {\textquoteright}10}, year = {2010}, month = {2010///}, pages = {947 - 954}, publisher = {International Foundation for Autonomous Agents and Multiagent Systems}, organization = {International Foundation for Autonomous Agents and Multiagent Systems}, address = {Richland, SC}, abstract = {We describe a formalism and algorithms for game-tree search in partially-observable Euclidean space, and implementation and tests in a scenario where a multi-agent team, called tracking agents, pursues a target agent that wants to evade the tracking agents. Our contributions include--- {\textbullet} A formalism that combines geometric elements (agents{\textquoteright} locations and trajectories and observable regions, and obstacles that restrict mobility and observability) with game-theoretic elements (information sets, utility functions, and strategies). {\textbullet} A recursive formula for information-set minimax values based on our formalism, and a implementation of the formula in a game-tree search algorithm. {\textbullet} A heuristic evaluation function for use at the leaf nodes of the game-tree search. It works by doing a quick lookahead search of its own, in a relaxed version of the problem. {\textbullet} Experimental results in 500 randomly generated trials. With the strategies generated by our heuristic, the tracking agents were more than twice as likely to know the target agent{\textquoteright}s location at the end of the game than with the strategies generated by heuristics that compute estimates of the target{\textquoteright}s possible locations.}, keywords = {game tree search, multi-agent planning, visibility-based pursuit-evasion games}, isbn = {978-0-9826571-1-9}, url = {http://dl.acm.org/citation.cfm?id=1838206.1838333}, author = {Raboin,Eric and Nau, Dana S. and Kuter,Ugur and Gupta, Satyandra K. and Svec,Petr} } @article {19368, title = {Structural and dynamic determinants of ligand binding and regulation of cyclin-dependent kinase 5 by pathological activator p25 and inhibitory peptide CIP.}, journal = {Journal of molecular biology}, volume = {401}, year = {2010}, month = {2010 Aug 20}, pages = {478-92}, abstract = {The crystal structure of the cdk5/p25 complex has provided information on possible molecular mechanisms of the ligand binding, specificity, and regulation of the kinase. Comparative molecular dynamics simulations are reported here for physiological conditions. This study provides new insight on the mechanisms that modulate such processes, which may be exploited to control pathological activation by p25. The structural changes observed in the kinase are stabilized by a network of interactions involving highly conserved residues within the cyclin-dependent kinase (cdk) family. Collective motions of the proteins (cdk5, p25, and CIP) and their complexes are identified by principal component analysis, revealing two conformational states of the activation loop upon p25 complexation, which are absent in the uncomplexed kinase and not apparent from the crystal. Simulations of the uncomplexed inhibitor CIP show structural rearrangements and increased flexibility of the interfacial loop containing the critical residue E240, which becomes fully hydrated and available for interactions with one of several positively charged residues in the kinase. These changes provide a rationale for the observed high affinity and enhanced inhibitory action of CIP when compared to either p25 or the physiological activators of cdk5.}, keywords = {Crystallography, X-Ray, Cyclin-Dependent Kinase 5, Cyclin-Dependent Kinase Inhibitor Proteins, HUMANS, Ligands, molecular dynamics simulation, Nerve Tissue Proteins, Principal component analysis, Protein Binding, Protein Conformation}, issn = {1089-8638}, doi = {10.1016/j.jmb.2010.06.040}, author = {Cardone, Antonio and Hassan, S A and Albers,R.W. and Sriram,R.D. and Pant,H.C.} } @article {14417, title = {A survey of link mining tasks for analyzing noisy and incomplete networks}, journal = {Link Mining: Models, Algorithms, and Applications}, year = {2010}, month = {2010///}, pages = {107 - 133}, abstract = {Many data sets of interest today are best described as networks or graphs of interlinked entities. Examples include Web and text collections, social networks and social media sites, information, transaction and communication networks, and all manner of scientific networks, including biological networks. Unfortunately, often the data collection and extraction process for gathering these network data sets is imprecise, noisy, and/or incomplete. In this chapter, we review a collection of link mining algorithms that are well suited to analyzing and making inferences about networks, especially in the case where the data is noisy or missing.}, doi = {10.1007/978-1-4419-6515-8_4}, author = {Namata,G.M. and Sharara,H. and Getoor, Lise} } @article {13869, title = {System and method for analysis of an opinion expressed in documents with regard to a particular topic}, volume = {11/808,278}, year = {2010}, month = {2010//01/28}, abstract = {System and method for analysis of an opinion expressed in documents on a particular topic computes opinion strength on a continuous numeric scale, or qualitatively. A variety of opinion scoring techniques are plugged in to score opinion expressing words and sentences in documents. These scores are aggregated to measure the opinion intensity of documents. Multilingual opinion analysis is supported by capability to concurrently identify and visualize the opinion intensity expressed in documents in multiple languages. A multi-dimensional representation of the measured opinion intensity is generated which is agreeable with multi-lingual domain.}, url = {http://www.google.com/patents?id=j9fLAAAAEBAJ}, author = {V.S. Subrahmanian and Picariello,Antonio and Dorr, Bonnie J and Reforgiato,Diego Recupero and Cesarano,Carmine and Sagoff,Amelia} } @article {18284, title = {System and Method for Confidentiality-Preserving Rank-Ordered Search}, volume = {12/608,724}, year = {2010}, month = {2010/06/10/}, abstract = {A confidentiality preserving system and method for performing a rank-ordered search and retrieval of contents of a data collection. The system includes at least one computer system including a search and retrieval algorithm using term frequency and/or similar features for rank-ordering selective contents of the data collection, and enabling secure retrieval of the selective contents based on the rank-order. The search and retrieval algorithm includes a baseline algorithm, a partially server oriented algorithm, and/or a fully server oriented algorithm. The partially and/or fully server oriented algorithms use homomorphic and/or order preserving encryption for enabling search capability from a user other than an owner of the contents of the data collection. The confidentiality preserving method includes using term frequency for rank-ordering selective contents of the data collection, and retrieving the selective contents based on the rank-order.}, url = {http://www.google.com/patents?id=kInVAAAAEBAJ}, author = {Swaminathan,Ashwin and Mao,Yinian and Su,Guan-Ming and Gou,Hongmei and Varna,Avinash L. and He,Shan and M. Wu and Oard, Douglas} } @conference {18785, title = {A Systematic Methodology for Accurate Design-Stage Estimation of Energy Consumption for Injection Molded Parts}, year = {2010}, month = {2010///}, abstract = {Today{\textquoteright}s ubiquitous use of plastics in product designand manufacturing presents significant environmental and human health challenges. Injection molding, one of the most commonly used processes for making plastic products, consumes a significant amount of energy. A methodology for accurately estimating the energy consumed to injection-mold a part would enable environmentally conscious decision making during the product design. Unfortunately, only limited information is available at the design stage. Therefore, accurately estimating energy consumption before the part has gone into production can be challenging. In this paper, we describe a methodology for energy estimation that works with the limited amount of data available during the design stage, namely the CAD model of the part, the material name, and the production requirements. This methodology uses this data to estimate the parameters of the runner system and an appropriately sized molding machine. It then uses these estimates to compute the machine setup time and the cycle time required for the injection molding operation. This is done by appropriately abstracting information available from the mold flow simulation tools and analytical models that are traditionally used during the manufacturing stage. These times are then multiplied by the power consumed by the appropriately sized machine during each stage of the molding cycle to compute the estimated energy consumption per part. }, url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.165.4139\&rep=rep1\&type=pdf}, author = {Weissman,A. and Ananthanarayanan,A. and Gupta,S.K. and Sriram,R.D.} } @article {16816, title = {Techniques for similarity searching in multimedia databases}, journal = {Proc. VLDB Endow.}, volume = {3}, year = {2010}, month = {2010/09//}, pages = {1649 - 1650}, abstract = {Techniques for similarity searching in multimedia databases are reviewed. This includes a discussion of the curse of dimensionality, as well as multidimensional indexing, distance-based indexing, and the actual search process which is realized by nearest neighbor finding.}, isbn = {2150-8097}, url = {http://dl.acm.org/citation.cfm?id=1920841.1921064}, author = {Samet, Hanan} } @inbook {17395, title = {Technology-Mediated Social Participation: Deep Science and Extreme Technology}, booktitle = {Active Media TechnologyActive Media Technology}, series = {Lecture Notes in Computer Science}, volume = {6335}, year = {2010}, month = {2010///}, pages = {1 - 4}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {The dramatic success of social media such as Facebook, Twitter, YouTube, Flickr, blogs, and traditional discussion groups empowers individuals to become active in local and global communities. With modest redesign, these technologies can be harnessed to support national priorities such as healthcare/wellness, disaster response, community safety, energy sustainability, etc. This talk describes a research agenda for these topics that develops deep science questions and extreme technology challenges.}, isbn = {978-3-642-15469-0}, url = {http://dx.doi.org/10.1007/978-3-642-15470-6_1}, author = {Shneiderman, Ben}, editor = {An,Aijun and Lingras,Pawan and Petty,Sheila and Huang,Runhe} } @conference {13925, title = {Toque: designing a cooking-based programming language for and with children}, booktitle = {Proceedings of the 28th international conference on Human factors in computing systems}, year = {2010}, month = {2010///}, pages = {2417 - 2426}, author = {Tarkan,S. and Sazawal,V. and Druin, Allison and Golub,E. and Bonsignore,E. M and Walsh,G. and Atrash,Z.} } @article {19724, title = {Unexpected abundance of coenzyme F(420)-dependent enzymes in Mycobacterium tuberculosis and other actinobacteria.}, journal = {J Bacteriol}, volume = {192}, year = {2010}, month = {2010 Nov}, pages = {5788-98}, abstract = {

Regimens targeting Mycobacterium tuberculosis, the causative agent of tuberculosis (TB), require long courses of treatment and a combination of three or more drugs. An increase in drug-resistant strains of M. tuberculosis demonstrates the need for additional TB-specific drugs. A notable feature of M. tuberculosis is coenzyme F(420), which is distributed sporadically and sparsely among prokaryotes. This distribution allows for comparative genomics-based investigations. Phylogenetic profiling (comparison of differential gene content) based on F(420) biosynthesis nominated many actinobacterial proteins as candidate F(420)-dependent enzymes. Three such families dominated the results: the luciferase-like monooxygenase (LLM), pyridoxamine 5{\textquoteright}-phosphate oxidase (PPOX), and deazaflavin-dependent nitroreductase (DDN) families. The DDN family was determined to be limited to F(420)-producing species. The LLM and PPOX families were observed in F(420)-producing species as well as species lacking F(420) but were particularly numerous in many actinobacterial species, including M. tuberculosis. Partitioning the LLM and PPOX families based on an organism{\textquoteright}s ability to make F(420) allowed the application of the SIMBAL (sites inferred by metabolic background assertion labeling) profiling method to identify F(420)-correlated subsequences. These regions were found to correspond to flavonoid cofactor binding sites. Significantly, these results showed that M. tuberculosis carries at least 28 separate F(420)-dependent enzymes, most of unknown function, and a paucity of flavin mononucleotide (FMN)-dependent proteins in these families. While prevalent in mycobacteria, markers of F(420) biosynthesis appeared to be absent from the normal human gut flora. These findings suggest that M. tuberculosis relies heavily on coenzyme F(420) for its redox reactions. This dependence and the cofactor{\textquoteright}s rarity may make F(420)-related proteins promising drug targets.

}, keywords = {Actinobacteria, Amino Acid Sequence, Binding Sites, Coenzymes, Flavonoids, Gene Expression Profiling, Gene Expression Regulation, Bacterial, Genome, Bacterial, molecular biology, Molecular Sequence Data, Molecular Structure, Mycobacterium tuberculosis, Phylogeny, Protein Conformation, Riboflavin}, issn = {1098-5530}, doi = {10.1128/JB.00425-10}, author = {Jeremy D Selengut and Haft, Daniel H} } @article {17749, title = {Using Generalized Annotated Programs to Solve Social Network Optimization Problems}, journal = {ICLP}, year = {2010}, month = {2010///}, abstract = {Reasoning about social networks (labeled, directed, weighted graphs) is be-coming increasingly important and there are now models of how certain phenomena (e.g. adoption of products/services by consumers, spread of a given disease) {\textquotedblleft}diffuse{\textquotedblright} through the network. Some of these diffusion models can be expressed via generalized annotated programs (GAPs). In this paper, we consider the following problem: suppose we have a given goal to achieve (e.g. maximize the expected number of adoptees of a product or minimize the spread of a disease) and suppose we have limited resources to use in trying to achieve the goal (e.g. give out a few free plans, provide medication to key people in the SN) - how should these resources be used so that we optimize a given objective function related to the goal? We define a class of social network optimization problems (SNOPs) that supports this type of reasoning. We formalize and study the complexity of SNOPs and show how they can be used in conjunction with existing economic and disease diffusion models. }, author = {Shakarian,P. and V.S. Subrahmanian and Sapino,M. L and Hermenegildo,M. and Schaub,T.} } @conference {14306, title = {Using symbolic evaluation to understand behavior in configurable software systems}, booktitle = {Software Engineering, 2010 ACM/IEEE 32nd International Conference on}, volume = {1}, year = {2010}, month = {2010///}, pages = {445 - 454}, author = {Reisner,E. and Song,C. and Ma,K.K. and Foster, Jeffrey S. and Porter, Adam} } @article {19299, title = {Utilizing Hierarchical Multiprocessing for Medical Image Registration}, journal = {IEEE Signal Processing Magazine}, volume = {27}, year = {2010}, month = {2010}, pages = {61 - 68}, abstract = {This work discusses an approach to utilize hierarchical multiprocessing in the context of medical image registration. By first organizing application parallelism into a domain-specific taxonomy, an algorithm is structured to target a set of multicore platforms.The approach on a cluster of graphics processing units (GPUs) requiring the use of two parallel programming environments to achieve fast execution times is demonstrated.There is negligible loss in accuracy for rigid registration when employing GPU acceleration, but it does adversely effect our nonrigid registration implementation due to our usage of a gradient descent approach.}, keywords = {Acceleration, application parallelism, Biomedical imaging, domain-specific taxonomy, GPU acceleration, gradient descent approach, Graphics processing unit, hierarchical multiprocessing, image registration, Magnetic resonance imaging, Medical diagnostic imaging, medical image processing, medical image registration, multicore platform set, Multicore processing, PARALLEL PROCESSING, parallel programming, Robustness, Signal processing algorithms, Ultrasonic imaging}, isbn = {1053-5888}, author = {Plishker,W. and Dandekar,O. and Bhattacharyya, Shuvra S. and Shekhar,R.} } @conference {16047, title = {VAST 2010 Challenge: Arms dealings and pandemics}, booktitle = {Visual Analytics Science and Technology (VAST), 2010 IEEE Symposium on}, year = {2010}, month = {2010/10//}, pages = {263 - 264}, abstract = {The 5th VAST Challenge consisted of three mini-challenges that involved both intelligence analysis and bioinformatics. Teams could solve one, two or all three mini-challenges and assess the overall situation to enter the Grand Challenge. Mini-challenge one involved text reports about people and events giving information about arms dealers, situations in various countries and linkages between different countries. Mini-challenge two involved hospital admission and death records from various countries providing information about the spread of a world wide pandemic. Mini-challenge three involved genetic data to be used to identify the origin of the pandemic and the most dangerous viral mutations. The Grand Challenge was to determine how these various mini-challenges were connected. As always the goal was to analyze the data and provide novel interactive visualizations useful in the analytic process. We received 58 submissions in total and gave 15 awards.}, keywords = {2010, administrative, admission;intelligence, analysis;interactive, analysis;medical, challenge;arms, challenge;hospital, data, data;grand, dealings;bioinformatics;dangerous, mutations;death, processing;weapons;, records;genetic, reports;bioinformatics;data, VAST, viral, visualizations;minichallenge;pandemics;text}, doi = {10.1109/VAST.2010.5649054}, author = {Grinstein,G. and Konecni,S. and Scholtz,J. and Whiting,M. and Plaisant, Catherine} } @article {12464, title = {Video Pr{\'e}cis: Highlighting Diverse Aspects of Videos}, journal = {IEEE Transactions on Multimedia}, volume = {12}, year = {2010}, month = {2010/12//}, pages = {853 - 868}, abstract = {Summarizing long unconstrained videos is gaining importance in surveillance, web-based video browsing, and video-archival applications. Summarizing a video requires one to identify key aspects that contain the essence of the video. In this paper, we propose an approach that optimizes two criteria that a video summary should embody. The first criterion, {\textquotedblleft}coverage,{\textquotedblright} requires that the summary be able to represent the original video well. The second criterion, {\textquotedblleft}diversity,{\textquotedblright} requires that the elements of the summary be as distinct from each other as possible. Given a user-specified summary length, we propose a cost function to measure the quality of a summary. The problem of generating a précis is then reduced to a combinatorial optimization problem of minimizing the proposed cost function. We propose an efficient method to solve the optimization problem. We demonstrate through experiments (on KTH data, unconstrained skating video, a surveillance video, and a YouTube home video) that optimizing the proposed criterion results in meaningful video summaries over a wide range of scenarios. Summaries thus generated are then evaluated using both quantitative measures and user studies.}, keywords = {$K$-means, CAMERAS, combinatorial mathematics, combinatorial optimization, Cost function, data compression, Exemplar selection, Image segmentation, Internet, Iron, Length measurement, multimedia systems, Ncut, optimisation, Optimization methods, original video, Permission, shot segmentation, Surveillance, user specified summary length, video précis, Video sharing, video signal processing, Video summarization}, isbn = {1520-9210}, doi = {10.1109/TMM.2010.2058795}, author = {Shroff, N. and Turaga,P. and Chellapa, Rama} } @conference {16051, title = {Visual information seeking in multiple electronic health records: design recommendations and a process model}, booktitle = {Proceedings of the 1st ACM International Health Informatics Symposium}, series = {IHI {\textquoteright}10}, year = {2010}, month = {2010///}, pages = {46 - 55}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Current electronic health record (EHR) systems facilitate the storage, retrieval, persistence, and sharing of patient data. However, the way physicians interact with EHRs has not changed much. More specifically, support for temporal analysis of a large number of EHRs has been lacking. A number of information visualization techniques have been proposed to alleviate this problem. Unfortunately, due to their limited application to a single case study, the results are often difficult to generalize across medical scenarios. We present the usage data of Lifelines2,[22] our information visualization system, and user comments, both collected over eight different medical case studies. We generalize our experience into an information-seeking process model for multiple EHRs. Based on our analysis, we make recommendations to future information visualization designers for EHRs on design requirements and future research directions.}, keywords = {design requriements, electronic health records, human-computer interaction (hci), Information Visualization}, isbn = {978-1-4503-0030-8}, doi = {10.1145/1882992.1883001}, url = {http://doi.acm.org/10.1145/1882992.1883001}, author = {Wang,Taowei David and Wongsuphasawat,Krist and Plaisant, Catherine and Shneiderman, Ben} } @inbook {17503, title = {Visualizing Threaded Conversation Networks: Mining Message Boards and Email Lists for Actionable Insights}, booktitle = {Active Media TechnologyActive Media Technology}, series = {Lecture Notes in Computer Science}, volume = {6335}, year = {2010}, month = {2010///}, pages = {47 - 62}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {Analyzing complex online relationships is a difficult job, but new information visualization tools are enabling a wider range of users to make actionable insights from the growing volume of online data. This paper describes the challenges and methods for conducting analyses of threaded conversations such as found in enterprise message boards, email lists, and forums. After defining threaded conversation, we characterize the types of networks that can be extracted from them. We then provide 3 mini case studies to illustrate how actionable insights for community managers can be gained by applying the network analysis metrics and visualizations available in the free, open source NodeXL tool, which is a powerful, yet easy-to-use tool embedded in Excel 2007/2010.}, isbn = {978-3-642-15469-0}, url = {http://dx.doi.org/10.1007/978-3-642-15470-6_7}, author = {Hansen,Derek and Shneiderman, Ben and Smith,Marc}, editor = {An,Aijun and Lingras,Pawan and Petty,Sheila and Huang,Runhe} } @article {16820, title = {A Web Database for Computer-Aided Detection and Diagnosis of Medical Images}, journal = {Digital Mammography}, year = {2010}, month = {2010///}, pages = {265 - 272}, author = {Tahmoush,D. and Samet, Hanan} } @article {18524, title = {Which Factors Affect Access Network Performance?}, volume = {GT-CS-10-04}, year = {2010}, month = {2010///}, institution = {Georgia Institute of Technology}, abstract = {This paper presents an analysis of the performance of residential access networks using over four months of round-trip, download, and upload measurements from more than 7,000 users across four ADSL and cable providers in France. Previous studies have characterized residential access network performance, but this paper presents the first study of how access network performance relates to other factors, such as choice of access provider, service-level agreement, and geographic location. We first explore the extent to which user performance matches the capacity advertised by an access provider, and whether the ability to achieve this capacity depends on the user{\textquoteright}s access network. We then analyze the extent to which various factors influence the performance that users experience. Finally, we explore how different groups of users experience simultaneous performance anomalies and analyze the common characteristics of users that share fate (e.g., whether users that experience simultaneous performance degradation share the same provider, city). Our analysis informs both users and designers of networked services who wish to improve the reliability and performance of access networks through multihoming and may also assist operators with troubleshooting network issues by narrowing down likely causes.}, url = {http://hdl.handle.net/1853/37336}, author = {Sundaresan,S. and Feamster, Nick and Dicioccio,L. and Teixeira,R.} } @conference {19463, title = {Who{\textquoteright}s Hogging the Bandwidth: The Consequences of Revealing the Invisible in the Home}, booktitle = {SIGCHI {\textquoteright}10}, series = {CHI {\textquoteright}10}, year = {2010}, month = {2010///}, pages = {659 - 668}, publisher = {ACM}, organization = {ACM}, abstract = {As more technologies enter the home, householders are burdened with the task of digital housekeeping-managing and sharing digital resources like bandwidth. In response to this, we created and evaluated a domestic tool for bandwidth management called Home Watcher. Our field trial showed that when resource contention amongst different household members is made visible, people{\textquoteright}s understanding of bandwidth changes and household politics are revealed. In this paper, we describe the consequences of showing real time resource usage in a home, and how this varies depending on the social make up of the household.}, keywords = {bandwidth monitoring, home broadband, home networks}, isbn = {978-1-60558-929-9}, url = {http://doi.acm.org/10.1145/1753326.1753423}, author = {Marshini Chetty and Banks, Richard and Harper, Richard and Regan, Tim and Sellen, Abigail and Gkantsidis, Christos and Karagiannis, Thomas and Key, Peter} } @conference {15456, title = {Workshop on experimental evaluation of software and systems in computer science (Evaluate 2010)}, booktitle = {Proceedings of the ACM international conference companion on Object oriented programming systems languages and applications companion}, series = {SPLASH {\textquoteright}10}, year = {2010}, month = {2010///}, pages = {291 - 292}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {We call ourselves {\textquoteright}computer scientists{\textquoteright}, but are we scientists? If we are scientists, then we must practice the scientific method. This includes a solid experimental evaluation. In our experience, our experimental methodology is ad hoc at best, and nonexistent at worst. This workshop brings together experts from different areas of computer science to discuss, explore, and attempt to identify the principles of sound experimental evaluation}, keywords = {Evaluation, METHODOLOGY}, isbn = {978-1-4503-0240-1}, doi = {10.1145/1869542.1869618}, url = {http://doi.acm.org/10.1145/1869542.1869618}, author = {Blackburn,Steven M. and Diwan,Amer and Hauswirth,Matthias and Memon, Atif M. and Sweeney,Peter F.} } @article {15278, title = {2009 Swine-Origin Influenza A (H1N1) Resembles Previous Influenza Isolates}, journal = {PLoS ONEPLoS ONE}, volume = {4}, year = {2009}, month = {2009/07/28/}, pages = {e6402 - e6402}, abstract = {In April 2009, novel swine-origin influenza viruses (S-OIV) were identified in patients from Mexico and the United States. The viruses were genetically characterized as a novel influenza A (H1N1) strain originating in swine, and within a very short time the S-OIV strain spread across the globe via human-to-human contact.We conducted a comprehensive computational search of all available sequences of the surface proteins of H1N1 swine influenza isolates and found that a similar strain to S-OIV appeared in Thailand in 2000. The earlier isolates caused infections in pigs but only one sequenced human case, A/Thailand/271/2005 (H1N1). Differences between the Thai cases and S-OIV may help shed light on the ability of the current outbreak strain to spread rapidly among humans. }, doi = {10.1371/journal.pone.0006402}, url = {http://dx.doi.org/10.1371/journal.pone.0006402}, author = {Kingsford, Carl and Nagarajan,Niranjan and Salzberg,Steven L.} } @article {16059, title = {Advancing User-Centered Evaluation of Visual Analytic Environments Through Contests}, journal = {Information VisualizationInformation Visualization}, volume = {8}, year = {2009}, month = {2009/09/21/}, pages = {230 - 238}, abstract = {In this paper, the authors describe the Visual Analytics Science and Technology (VAST) Symposium contests run in 2006 and 2007 and the VAST 2008 and 2009 challenges. These contests were designed to provide researchers with a better understanding of the tasks and data that face potential end users. Access to these end users is limited because of time constraints and the classified nature of the tasks and data. In that respect, the contests serve as an intermediary, with the metrics and feedback serving as measures of utility to the end users. The authors summarize the lessons learned and the future directions for VAST Challenges.}, keywords = {metrics, synthetic data, user-centered evaluation, visual analytics}, isbn = {1473-8716, 1473-8724}, doi = {10.1057/ivs.2009.16}, url = {http://ivi.sagepub.com/content/8/3/230}, author = {Costello,Loura and Grinstein,Georges and Plaisant, Catherine and Scholtz,Jean} } @conference {17752, title = {Aggregate Query Answering under Uncertain Schema Mappings}, booktitle = {Data Engineering, 2009. ICDE {\textquoteright}09. IEEE 25th International Conference on}, year = {2009}, month = {2009/04/29/2}, pages = {940 - 951}, abstract = {Recent interest in managing uncertainty in data integration has led to the introduction of probabilistic schema mappings and the use of probabilistic methods to answer queries across multiple databases using two semantics: by-table and by-tuple. In this paper, we develop three possible semantics for aggregate queries: the range, distribution, and expected value semantics, and show that these three semantics combine with the by-table and by-tuple semantics in six ways. We present algorithms to process COUNT, AVG, SUM, MIN, and MAX queries under all six semantics and develop results on the complexity of processing such queries under all six semantics. We show that computing COUNT is in PTIME for all six semantics and computing SUM is in PTIME for all but the by-tuple/distribution semantics. Finally, we show that AVG, MIN, and MAX are PTIME computable for all by-table semantics and for the by-tuple/range semantics.We developed a prototype implementation and experimented with both real-world traces and simulated data. We show that, as expected, naive processing of aggregates does not scale beyond small databases with a small number of mappings. The results also show that the polynomial time algorithms are scalable up to several million tuples as well as with a large number of mappings.}, keywords = {aggregate, algorithm;probabilistic, answering;by-table, complexity;data, complexity;distributed, database;polynomial, databases;, databases;probability;query, integration;distribution, mapping;computational, mapping;query, processing;range, processing;statistical, query, schema, semantics;by-tuple, semantics;computational, semantics;expected, semantics;multiple, semantics;uncertain, TIME, value}, doi = {10.1109/ICDE.2009.55}, author = {Gal,A. and Martinez,M. V and Simari,G. I and V.S. Subrahmanian} } @article {12886, title = {Analysis of clonally related environmental Vibrio cholerae O1 El Tor isolated before 1992 from Varanasi, India reveals origin of SXT-ICEs belonging to O139 and O1 serogroups}, journal = {Environmental Microbiology Reports}, volume = {2}, year = {2009}, month = {2009/07/21/}, pages = {50 - 57}, abstract = {In this study, we report the presence of SXT in environmental Vibrio cholerae O1 El Tor strains isolated before 1992 from Varanasi, India. All isolates, except one, were resistant to Tm, and/or Sul, Sm, Fr, Na and Am. None contained plasmids. PCR and DNA sequencing revealed the presence of SXT containing dfrA1 and/or sulII, strAB in six isolates and dfr18, sulII and strAB in five isolates. Three clinical V. cholerae O1 isolated during 1992 contained the antibiotic resistance gene cassette aadA1 in the class 1 integron. Conjugation experiments, followed by PCR analysis of transconjugants, provided evidence of the transferable nature of SXT and associated antibiotic resistance genes, and its integration into the prfC site. Results of phylogenetic analysis of the intSXT gene of clonally similar V. cholerae showed a clear difference between dfr18+ and dfrA1+V. cholerae O1 isolates. This is the first report of the occurrence of SXT harbouring sulII, strAB, dfr18 and/or dfrA1 genes in environmental V. cholerae O1 isolated prior to 1992 from Varanasi, India, and suggests emergence of SXT+ antibiotic-resistant V. cholerae O139 and O1 from an environmental V. cholerae progenitor by acquisition of SXT and antibiotic-resistant gene clusters.}, isbn = {1758-2229}, doi = {10.1111/j.1758-2229.2009.00051.x}, url = {http://onlinelibrary.wiley.com/doi/10.1111/j.1758-2229.2009.00051.x/abstract?userIsAuthenticated=false\&deniedAccessCustomisedMessage=}, author = {Mohapatra,Saswat S. and Mantri,Chinmay K. and Mohapatra,Harapriya and Rita R Colwell and Singh,Durg V.} } @article {15377, title = {Analytical Description of Quasi-Random Magnetization Relaxation to Equilibrium}, journal = {Magnetics, IEEE Transactions on}, volume = {45}, year = {2009}, month = {2009/11//}, pages = {5224 - 5227}, abstract = {The Landau-Lifshitz (LL) dynamics of a uniformly magnetized particle is considered. The LL equation is written in the form of a Hamiltonian perturbed dynamical system. By using suitable averaging technique, the equation for the slow dynamics of the energy is derived. The averaging technique breaks up in the case of separatrix crossing. It is shown that, in the limit of small damping, the separatrix crossing can be described by using a probabilistic approach.}, keywords = {approach;quasirandom, crossing;uniformly, dynamical, dynamics;averaging, Hamiltonian, magnetization, magnetized, particle;magnetic, particles;magnetic, perturbed, relaxation;magnetisation;probability;, relaxation;separatrix, system;Landau-Lifshitz, technique;damping;probabilistic}, isbn = {0018-9464}, doi = {10.1109/TMAG.2009.2031067}, author = {Serpico,C. and d{\textquoteright}Aquino,M. and Bertotti,G. and Mayergoyz, Issak D} } @conference {16974, title = {Analyzing (social media) networks with NodeXL}, booktitle = {Proceedings of the fourth international conference on Communities and technologies}, series = {C\&$\#$38;T {\textquoteright}09}, year = {2009}, month = {2009///}, pages = {255 - 264}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {We present NodeXL, an extendible toolkit for network overview, discovery and exploration implemented as an add-in to the Microsoft Excel 2007 spreadsheet software. We demonstrate NodeXL data analysis and visualization features with a social media data sample drawn from an enterprise intranet social network. A sequence of NodeXL operations from data import to computation of network statistics and refinement of network visualization through sorting, filtering, and clustering functions is described. These operations reveal sociologically relevant differences in the patterns of interconnection among employee participants in the social media space. The tool and method can be broadly applied.}, keywords = {excel, network analysis, social media, social network, spreadsheet, Visualization}, isbn = {978-1-60558-713-4}, doi = {10.1145/1556460.1556497}, url = {http://doi.acm.org/10.1145/1556460.1556497}, author = {Smith,Marc A. and Shneiderman, Ben and Milic-Frayling,Natasa and Mendes Rodrigues,Eduarda and Barash,Vladimir and Dunne,Cody and Capone,Tony and Perer,Adam and Gleave,Eric} } @conference {15855, title = {Arabic Cross-Document Coreference Resolution}, booktitle = {Proceedings of the ACL-IJCNLP 2009 Conference Short Papers$}$}, year = {2009}, month = {2009///}, pages = {357 - 360}, author = {Sayeed,A. and Elsayed,T. and Garera,N. and Alexander,D. and Xu,T. and Oard, Douglas and Yarowsky,D. and Piatko,C.} } @article {12531, title = {An architectural level design methodology for smart camera applications}, journal = {International Journal of Embedded Systems}, volume = {4}, year = {2009}, month = {2009///}, pages = {83 - 97}, abstract = {Today{\textquoteright}s embedded computing applications are characterised by increased functionality, and hence increased design complexity and processing requirements. The resulting design spaces are vast and designers are typically able to evaluate only small subsets of solutions due to lack of efficient design tools. In this paper, we propose an architectural level design methodology that provides a means for a comprehensive design space exploration for smart camera applications and enable designers to select higher quality solutions and provides substantial savings on the overall cost of the system. We present efficient, accurate and intuitive models for performance estimation and validate them with experiments.}, author = {Saha,S. and Kianzad,V. and Schlessman,J. and Aggarwal,G. and Bhattacharyya, Shuvra S. and Chellapa, Rama and Wolf,W.} } @article {18695, title = {Avid interactions underlie the Lys63-linked polyubiquitin binding specificities observed for UBA domains}, journal = {Nature Structural \& Molecular Biology}, volume = {16}, year = {2009}, month = {2009///}, pages = {883 - 889}, abstract = {Ubiquitin (denoted Ub) receptor proteins as a group must contain a diverse set of binding specificities to distinguish the many forms of polyubiquitin (polyUb) signals. Previous studies suggested that the large class of ubiquitin-associated (UBA) domains contains members with intrinsic specificity for Lys63-linked polyUb or Lys48-linked polyUb, thus explaining how UBA-containing proteins can mediate diverse signaling events. Here we show that previously observed Lys63-polyUb selectivity in UBA domains is the result of an artifact in which the dimeric fusion partner, glutathione S-transferase (GST), positions two UBAs for higher affinity, avid interactions with Lys63-polyUb, but not with Lys48-polyUb. Freed from GST, these UBAs are either nonselective or prefer Lys48-polyUb. Accordingly, NMR experiments reveal no Lys63-polyUb{\textendash}specific binding epitopes for these UBAs. We reexamine previous conclusions based on GST-UBAs and present an alternative model for how UBAs achieve a diverse range of linkage specificities.}, 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/nsmb.1637}, url = {http://www.nature.com/nsmb/journal/v16/n8/abs/nsmb.1637.html}, author = {Sims,Joshua J. and Haririnia,Aydin and Dickinson,Bryan C. and Fushman, David and Cohen,Robert E.} } @conference {13358, title = {Bisimulation-based approximate lifted inference}, booktitle = {Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence}, series = {UAI {\textquoteright}09}, year = {2009}, month = {2009///}, pages = {496 - 505}, publisher = {AUAI Press}, organization = {AUAI Press}, address = {Arlington, Virginia, United States}, abstract = {There has been a great deal of recent interest in methods for performing lifted inference; however, most of this work assumes that the first-order model is given as input to the system. Here, we describe lifted inference algorithms that determine symmetries and automatically lift the probabilistic model to speedup inference. In particular, we describe approximate lifted inference techniques that allow the user to trade off inference accuracy for computational efficiency by using a handful of tunable parameters, while keeping the error bounded. Our algorithms are closely related to the graph-theoretic concept of bisimulation. We report experiments on both synthetic and real data to show that in the presence of symmetries, run-times for inference can be improved significantly, with approximate lifted inference providing orders of magnitude speedup over ground inference.}, isbn = {978-0-9749039-5-8}, url = {http://dl.acm.org/citation.cfm?id=1795114.1795172}, author = {Sen,Prithviraj and Deshpande, Amol and Getoor, Lise} } @conference {17994, title = {Brief announcement: performance potential of an easy-to-program PRAM-on-chip prototype versus state-of-the-art processor}, booktitle = {Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures}, year = {2009}, month = {2009///}, pages = {163 - 165}, author = {Caragea,G.C. and Saybasili,A. B and Wen,X. and Vishkin, Uzi} } @article {17756, title = {CAPE: Automatically Predicting Changes in Group Behavior}, journal = {Mathematical Methods in Counterterrorism}, year = {2009}, month = {2009///}, pages = {253 - 269}, abstract = {There is now intense interest in the problem of forecasting what a group will do in the future. Past work [1, 2, 3] has built complex models of a group{\textquoteright}s behavior and used this to predict what the group might do in the future. However, almost all past work assumes that the group will not change its past behavior. Whether the group is a group of investors, or a political party, or a terror group, there is much interest in when and how the group will change its behavior. In this paper, we develop an architecture and algorithms called CAPE to forecast the conditions under which a group will change its behavior. We have tested CAPE on social science data about the behaviors of seven terrorist groups and show that CAPE is highly accurate in its predictions{\textemdash}at least in this limited setting.}, doi = {10.1007/978-3-211-09442-6_15}, author = {Sliva,A. and V.S. Subrahmanian and Martinez,V. and Simari,G.} } @article {17010, title = {Civic Collaboration}, journal = {ScienceScience}, volume = {325}, year = {2009}, month = {2009/07/31/}, pages = {540 - 540}, abstract = {Drawing on her work developing the Peer-to-Patent network, Noveck describes how Web 2.0 technologies could be used to promote participatory democracy and more efficient government.}, isbn = {0036-8075, 1095-9203}, doi = {10.1126/science.1178326}, url = {http://www.sciencemag.org/content/325/5940/540.1}, author = {Shneiderman, Ben} } @inbook {15726, title = {CLASSY 2009: Summarization and Metrics}, booktitle = {TAC 2009 Workshop ProceedingsTAC 2009 Workshop Proceedings}, year = {2009}, month = {2009/11/16/17}, publisher = {NIST}, organization = {NIST}, url = {http://www.nist.gov/tac/publications/2009/participant.papers/CLASSY.proceedings.pdfhttp://www.nist.gov/tac/publications/2009/participant.papers/CLASSY.proceedings.pdf}, author = {Conroy,John M. and Schlesinger,Judith D. and O{\textquoteright}Leary, Dianne P.} } @conference {14445, title = {Co-evolution of social and affiliation networks}, booktitle = {Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining}, series = {KDD {\textquoteright}09}, year = {2009}, month = {2009///}, pages = {1007 - 1016}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {In our work, we address the problem of modeling social network generation which explains both link and group formation. Recent studies on social network evolution propose generative models which capture the statistical properties of real-world networks related only to node-to-node link formation. We propose a novel model which captures the co-evolution of social and affiliation networks. We provide surprising insights into group formation based on observations in several real-world networks, showing that users often join groups for reasons other than their friends. Our experiments show that the model is able to capture both the newly observed and previously studied network properties. This work is the first to propose a generative model which captures the statistical properties of these complex networks. The proposed model facilitates controlled experiments which study the effect of actors{\textquoteright} behavior on the evolution of affiliation networks, and it allows the generation of realistic synthetic datasets.}, keywords = {affiliation network, Evolution, graph generator, groups, social network}, isbn = {978-1-60558-495-9}, doi = {10.1145/1557019.1557128}, url = {http://doi.acm.org/10.1145/1557019.1557128}, author = {Zheleva,Elena and Sharara,Hossam and Getoor, Lise} } @inbook {14493, title = {Collective classification for text classification}, booktitle = {Text Mining: Classification, Clustering, and ApplicationsText Mining: Classification, Clustering, and Applications}, year = {2009}, month = {2009///}, pages = {51 - 69}, author = {Namata,G. and Sen,P. and Bilgic,M. and Getoor, Lise} } @article {15077, title = {Collusion-free multiparty computation in the mediated model}, journal = {Advances in Cryptology-CRYPTO 2009}, year = {2009}, month = {2009///}, pages = {524 - 540}, abstract = {Collusion-free protocols prevent subliminal communication (i.e., covert channels) between parties running the protocol. In the standard communication model, if one-way functions exist, then protocols satisfying any reasonable degree of privacy cannot be collusion-free. To circumvent this impossibility, Alwen, shelat and Visconti (CRYPTO 2008) recently suggested the mediated model where all communication passes through a mediator. The goal is to design protocols where collusion-freeness is guaranteed as long as the mediator is honest, while standard security guarantees hold if the mediator is dishonest. In this model, they gave constructions of collusion-free protocols for commitments and zero-knowledge proofs in the two-party setting.We strengthen the definition of Alwen et al., and resolve the main open questions in this area by showing a collusion-free protocol (in the mediated model) for computing any multi-party functionality. }, doi = {10.1007/978-3-642-03356-8_31}, author = {Alwen,J. and Katz, Jonathan and Lindell,Y. and Persiano,G. and Shelat,A. and Visconti,I.} } @conference {13095, title = {Combining multiple kernels for efficient image classification}, booktitle = {Applications of Computer Vision (WACV), 2009 Workshop on}, year = {2009}, month = {2009/12//}, pages = {1 - 8}, abstract = {We investigate the problem of combining multiple feature channels for the purpose of efficient image classification. Discriminative kernel based methods, such as SVMs, have been shown to be quite effective for image classification. To use these methods with several feature channels, one needs to combine base kernels computed from them. Multiple kernel learning is an effective method for combining the base kernels. However, the cost of computing the kernel similarities of a test image with each of the support vectors for all feature channels is extremely high. We propose an alternate method, where training data instances are selected, using AdaBoost, for each of the base kernels. A composite decision function, which can be evaluated by computing kernel similarities with respect to only these chosen instances, is learnt. This method significantly reduces the number of kernel computations required during testing. Experimental results on the benchmark UCI datasets, as well as on a challenging painting dataset, are included to demonstrate the effectiveness of our method.}, keywords = {(artificial, AdaBoost;base, channels;multiple, classification;kernel, classification;learning, decision, feature, function;discriminative, intelligence);support, Kernel, kernel;image, kernels;composite, learning;support, machine;image, machines;, similarity;multiple, vector}, doi = {10.1109/WACV.2009.5403040}, author = {Siddiquie,B. and Vitaladevuni,S.N. and Davis, Larry S.} } @article {18183, title = {Component forensics}, journal = {Signal Processing Magazine, IEEE}, volume = {26}, year = {2009}, month = {2009/03//}, pages = {38 - 48}, abstract = {Visual sensor technologies have experienced tremendous growth in recent decades, and digital devices are becoming ubiquitous. Digital images taken by various imaging devices have been used in a growing number of applications, from military and reconnaissance to medical diagnosis and consumer photography. Consequently, a series of new forensic issues arise amidst such rapid advancement and widespread adoption of imaging technologies. For example, one can readily ask what kinds of hardware and software components as well as their parameters have been employed inside these devices? Given a digital image, which imaging sensor or which brand of sensor was used to acquire the image? How was the image acquired? Was it captured using a digital camera, cell phone camera, image scanner, or was it created artificially using an imageediting software? Has the image undergone any manipulation after capture? Is it authentic, or has it been tampered in any way? Does it contain any hidden information or steganographic data? Many of these forensic questions are related to tracing the origin of the digital image to its creation process. Evidence obtained from such analysis would provide useful forensic information to law enforcement, security, and intelligence agencies. Knowledge of image acquisition techniques can also help answer further forensic questions regarding the nature of additional processing that the image might have undergone after capture.}, keywords = {ACQUISITION, component, data;, forensics;digital, image, of, processing;image, sensor, sensors;security, technique;visual, technology;image}, isbn = {1053-5888}, doi = {10.1109/MSP.2008.931076}, author = {Swaminathan,A. and M. Wu and Liu,K. J.R} } @article {15170, title = {Composability and on-line deniability of authentication}, journal = {Theory of Cryptography}, year = {2009}, month = {2009///}, pages = {146 - 162}, abstract = {Protocols for deniable authentication achieve seemingly paradoxical guarantees: upon completion of the protocol the receiver is convinced that the sender authenticated the message, but neither party can convince anyone else that the other party took part in the protocol. We introduce and study on-line deniability, where deniability should hold even when one of the parties colludes with a third party during execution of the protocol. This turns out to generalize several realistic scenarios that are outside the scope of previous models.We show that a protocol achieves our definition of on-line deniability if and only if it realizes the message authentication functionality in the generalized universal composability framework; any protocol satisfying our definition thus automatically inherits strong composability guarantees. Unfortunately, we show that our definition is impossible to realize in the PKI model if adaptive corruptions are allowed (even if secure erasure is assumed). On the other hand, we show feasibility with respect to static corruptions (giving the first separation in terms of feasibility between the static and adaptive setting), and show how to realize a relaxation termed deniability with incriminating abort under adaptive corruptions. }, doi = {10.1007/978-3-642-00457-5_10}, author = {Dodis,Y. and Katz, Jonathan and Smith,A. and Walfish,S.} } @article {13967, title = {Computation of singular and hypersingular boundary integrals by Green identity and application to boundary value problems}, journal = {Engineering Analysis with Boundary Elements}, volume = {33}, year = {2009}, month = {2009/08//}, pages = {1124 - 1131}, abstract = {The problem of computing singular and hypersingular integrals involved in a large class of boundary value problems is considered. The method is based on Green{\textquoteright}s theorem for calculating the diagonal elements of the resulting discretized matrix using the Nystr{\"o}m discretization method. The method is successfully applied to classical boundary value problems. Convergence of the method is also discussed.}, keywords = {Bounday integral method, Green identity, Hypersingular integrals, Nystr{\"o}m method, Singular integrals}, isbn = {0955-7997}, doi = {10.1016/j.enganabound.2009.02.004}, url = {http://www.sciencedirect.com/science/article/pii/S0955799709000447}, author = {Seydou,F. and Duraiswami, Ramani and Sepp{\"a}nen,T. and Gumerov, Nail A.} } @article {15298, title = {Computational linguistics for metadata building (CLiMB): using text mining for the automatic identification, categorization, and disambiguation of subject terms for image metadata}, journal = {Multimedia Tools and Applications}, volume = {42}, year = {2009}, month = {2009///}, pages = {115 - 138}, abstract = {In this paper, we present a system using computational linguistic techniques to extract metadata for image access. We discuss the implementation, functionality and evaluation of an image catalogers{\textquoteright} toolkit, developed in the Computational Linguistics for Metadata Building (CLiMB) research project. We have tested components of the system, including phrase finding for the art and architecture domain, functional semantic labeling using machine learning, and disambiguation of terms in domain-specific text vis a vis a rich thesaurus of subject terms, geographic and artist names. We present specific results on disambiguation techniques and on the nature of the ambiguity problem given the thesaurus, resources, and domain-specific text resource, with a comparison of domain-general resources and text. Our primary user group for evaluation has been the cataloger expert with specific expertise in the fields of painting, sculpture, and vernacular and landscape architecture.}, doi = {10.1007/s11042-008-0253-9}, author = {Klavans,J. L and Sheffield,C. and Abels,E. and Jimmy Lin and Passonneau,R. and Sidhu,T. and Soergel,D.} } @conference {19029, title = {Controlling data in the cloud: outsourcing computation without outsourcing control}, series = {CCSW {\textquoteright}09}, year = {2009}, month = {2009}, pages = {85 - 90}, publisher = {ACM}, organization = {ACM}, abstract = {Cloud computing is clearly one of today{\textquoteright}s most enticing technology areas due, at least in part, to its cost-efficiency and flexibility. However, despite the surge in activity and interest, there are significant, persistent concerns about cloud computing that are impeding momentum and will eventually compromise the vision of cloud computing as a new IT procurement model. In this paper, we characterize the problems and their impact on adoption. In addition, and equally importantly, we describe how the combination of existing research thrusts has the potential to alleviate many of the concerns impeding adoption. In particular, we argue that with continued research advances in trusted computing and computation-supporting encryption, life in the cloud can be advantageous from a business intelligence standpoint over the isolated alternative that is more common today.}, keywords = {Cloud computing, privacy, Security}, isbn = {978-1-60558-784-4}, url = {http://doi.acm.org/10.1145/1655008.1655020}, author = {Chow, Richard and Golle, Philippe and Jakobsson, Markus and Elaine Shi and Staddon, Jessica and Masuoka, Ryusuke and Molina,Jesus} } @conference {12230, title = {CPM: Adaptive Video-on-Demand with Cooperative Peer Assists and Multicast}, booktitle = {INFOCOM 2009, IEEE}, year = {2009}, month = {2009/04//}, pages = {91 - 99}, abstract = {We present CPM, a unified approach that exploits server multicast, assisted by peer downloads, to provide efficient video-on-demand (VoD) in a service provider environment. We describe our architecture and show how CPM is designed to dynamically adapt to a wide range of situations including highly different peer-upload bandwidths, content popularity, user request arrival patterns, video library size, and subscriber population. We demonstrate the effectiveness of CPM using simulations (based on an actual implementation codebase) across the range of situations described above and show that CPM does significantly better than traditional unicast, different forms of multicast, as well as peer-to-peer schemes. Along with synthetic parameters, we augment our experiments using data from a deployed VoD service to evaluate the performance of CPM.}, keywords = {assists;multicast;peer-to-peer, communication;peer-to-peer, computing;video, CPM;cooperative, demand;, on, parameters;video-on-demand;multicast, peer, schemes;synthetic}, doi = {10.1109/INFCOM.2009.5061910}, author = {Gopalakrishnan,V. and Bhattacharjee, Bobby and Ramakrishnan,K.K. and Jana,R. and Srivastava,D.} } @conference {17037, title = {Creativity challenges and opportunities in social computing}, 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 = {3283 - 3286}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {There is a convergence in recent theories of creativity that go beyond characteristics and cognitive processes of individuals to recognize the importance of the social construction of creativity. In parallel, there has been a rise in social computing supporting the collaborative construction of knowledge. The panel will discuss the challenges and opportunities from the confluence of these two developments by bringing together the contrasting and controversial perspective of the individual panel members. It will synthesize from different perspectives an analytic framework to understand these new developments, and how to promote rigorous research methods and how to identify the unique challenges in developing evaluation and assessment methods for creativity research.}, keywords = {creativity, social computing}, isbn = {978-1-60558-247-4}, doi = {10.1145/1520340.1520470}, url = {http://doi.acm.org/10.1145/1520340.1520470}, author = {Fischer,Gerhard and Jennings,Pamela and Maher,Mary Lou and Resnick,Mitchel and Shneiderman, Ben} } @inbook {17039, title = {Creativity Support Tools: A Grand Challenge for HCI Researchers}, booktitle = {Engineering the User InterfaceEngineering the User Interface}, year = {2009}, month = {2009///}, pages = {1 - 9}, publisher = {Springer London}, organization = {Springer London}, abstract = {Human-computer interaction researchers can play a key role in designing, implementing, and evaluating a new generation of creativity support tools. Understanding creative processes, especially when mediated by user interfaces will remain a continuing challenge, especially in dealing with novice and expert users, across a variety of disciplines. The expected outcomes include (1) refined theories of technology-supported creative processes, (2) active discussion of user-oriented empirical research methods, (3) new software architectures, database management strategies, and networking technologies, and (4) improved user interfaces to support discover and innovation, especially in collaborative environments.}, isbn = {978-1-84800-136-7}, url = {http://dx.doi.org/10.1007/978-1-84800-136-7_1}, author = {Shneiderman, Ben} } @conference {14670, title = {Cross-tier, label-based security enforcement for web applications}, booktitle = {Proceedings of the 35th SIGMOD international conference on Management of data}, series = {SIGMOD {\textquoteright}09}, year = {2009}, month = {2009///}, pages = {269 - 282}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {This paper presents SELinks, a programming language focused on building secure multi-tier web applications. SELinks provides a uniform programming model, in the style of LINQ and Ruby on Rails, with language syntax for accessing objects residing either in the database or at the server. Object-level security policies are expressed as fully-customizable, first-class labels which may themselves be subject to security policies. Access to labeled data is mediated via trusted, user-provided policy enforcement functions. SELinks has two novel features that ensure security policies are enforced correctly and efficiently. First, SELinks implements a type system called Fable that allows a protected object{\textquoteright}s type to refer to its protecting label. The type system can check that labeled data is never accessed directly by the program without first consulting the appropriate policy enforcement function. Second, SELinks compiles policy enforcement code to database-resident user-defined functions that can be called directly during query processing. Database-side checking avoids transferring data to the server needlessly, while still allowing policies to be expressed in a customizable and portable manner. Our experience with two sizable web applications, a modelhealth-care database and a secure wiki with fine-grained security policies, indicates that cross-tier policy enforcement in SELinks is flexible, relatively easy to use, and, when compared to a single-tier approach, improves throughput by nearly an order of magnitude. SELinks is freely available.}, keywords = {compilers, database programming, security enforcement, type systems, web applications}, isbn = {978-1-60558-551-2}, doi = {10.1145/1559845.1559875}, url = {http://doi.acm.org/10.1145/1559845.1559875}, author = {Corcoran,Brian J. and Swamy,Nikhil and Hicks, Michael W.} } @article {14603, title = {CTCF binding site classes exhibit distinct evolutionary, genomic, epigenomic and transcriptomic features}, journal = {Genome Biology}, volume = {10}, year = {2009}, month = {2009/11/18/}, pages = {R131 - R131}, abstract = {CTCF (CCCTC-binding factor) is an evolutionarily conserved zinc finger protein involved in diverse functions ranging from negative regulation of MYC, to chromatin insulation of the beta-globin gene cluster, to imprinting of the Igf2 locus. The 11 zinc fingers of CTCF are known to differentially contribute to the CTCF-DNA interaction at different binding sites. It is possible that the differences in CTCF-DNA conformation at different binding sites underlie CTCF{\textquoteright}s functional diversity. If so, the CTCF binding sites may belong to distinct classes, each compatible with a specific functional role.}, isbn = {1465-6906}, doi = {10.1186/gb-2009-10-11-r131}, url = {http://genomebiology.com/2009/10/11/R131}, author = {Essien,Kobby and Vigneau,Sebastien and Apreleva,Sofia and Singh,Larry N. and Bartolomei,Marisa S. and Hannenhalli, Sridhar} } @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 {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 {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.} } @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} } @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} } @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 {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 {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 {12095, title = {Efficient peer-to-Peer lookup in multi-hop wireless networks}, journal = {KSII Trans. Internet and Information Systems}, volume = {3}, year = {2009}, month = {2009///}, pages = {5 - 25}, author = {Shin,M. and Arbaugh, William A.} } @conference {13972, title = {Efficient subset selection via the kernelized R{\'e}nyi distance}, booktitle = {Computer Vision, 2009 IEEE 12th International Conference on}, year = {2009}, month = {2009///}, pages = {1081 - 1088}, abstract = {With improved sensors, the amount of data available in many vision problems has increased dramatically and allows the use of sophisticated learning algorithms to perform inference on the data. However, since these algorithms scale with data size, pruning the data is sometimes necessary. The pruning procedure must be statistically valid and a representative subset of the data must be selected without introducing selection bias. Information theoretic measures have been used for sampling the data, retaining its original information content. We propose an efficient Rényi entropy based subset selection algorithm. The algorithm is first validated and then applied to two sample applications where machine learning and data pruning are used. In the first application, Gaussian process regression is used to learn object pose. Here it is shown that the algorithm combined with the subset selection is significantly more efficient. In the second application, our subset selection approach is used to replace vector quantization in a standard object recognition algorithm, and improvements are shown.}, author = {Srinivasan,B.V. and Duraiswami, Ramani} } @article {18209, title = {Enabling search over encrypted multimedia databases}, journal = {SPIE/IS\&T Media Forensics and Security}, year = {2009}, month = {2009///}, pages = {7254 - 18}, abstract = {Performing information retrieval tasks while preserving data confidentiality is a desirable capability when adatabase is stored on a server maintained by a third-party service provider. This paper addresses the problem of enabling content-based retrieval over encrypted multimedia databases. Search indexes, along with multimedia documents, are first encrypted by the content owner and then stored onto the server. Through jointly apply- ing cryptographic techniques, such as order preserving encryption and randomized hash functions, with image processing and information retrieval techniques, secure indexing schemes are designed to provide both privacy protection and rank-ordered search capability. Retrieval results on an encrypted color image database and se- curity analysis of the secure indexing schemes under different attack models show that data confidentiality can be preserved while retaining very good retrieval performance. This work has promising applications in secure multimedia management. }, author = {Lu,W. and Swaminathan,A. and Varna,A.L. and Wu,M.} } @article {15055, title = {Fast and Accurate Method of Uniform-colored Video Text Extraction}, journal = {Jisuanji Gongcheng/ Computer Engineering}, volume = {35}, year = {2009}, month = {2009///}, abstract = {For most video text is rich in edge,uniform-colored and horizontally ranged,the candidate text areas in video image are determined by using a fast deriche edge based algorithm,and the accurate binary text images are extracted from the areas by using a color based algorithm.The experimental results show that the method is effective in text extraction in complex-background video frame,and has higher processing speed and better extraction result in comparison with color alone based method.}, author = {Shen,R.D. and Li,S.F. and Zhuolin Jiang} } @conference {17531, title = {Fighting Spam with the NeighborhoodWatch DHT}, booktitle = {IEEE INFOCOM 2009}, year = {2009}, month = {2009/04/19/25}, pages = {1755 - 1763}, publisher = {IEEE}, organization = {IEEE}, abstract = {In this paper, we present DHTBL, an anti-spam blacklist built upon a novel secure distributed hash table (DHT). We show how DHTBL can be used to replace existing DNS-based blacklists (DNSBLs) of IP addresses of mail relays that forward spam. Implementing a blacklist on a DHT improves resilience to DoS attacks and secures message delivery, when compared to DNSBLs. However, due to the sensitive nature of the blacklist, storing the data in a peer-to-peer DHT would invite attackers to infiltrate the system. Typical DHTs can withstand fail-stop failures, but malicious nodes may provide incorrect routing information, refuse to return published items, or simply ignore certain queries. The neighborhoodwatch DHT is resilient to malicious nodes and maintains the O(logiV) bounds on routing table size and expected lookup time. NeighborhoodWatch depends on two assumptions in order to make these guarantees: (1) the existence of an on-line trusted authority that periodically contacts and issues signed certificates to each node, and (2) for every sequence of k + 1 consecutive nodes in the ID space, at least one is alive and non-malicious. We show how NeighborhoodWatch maintains many of its security properties even when the second assumption is violated. Honest nodes in NeighborhoodWatch can detect malicious behavior and expel the responsible nodes from the DHT.}, keywords = {Communications Society, computer crime, cryptography, Databases, IP addresses, IP networks, on-line trusted authority, Peer to peer computing, peer-to-peer computing, peer-to-peer distributed hash table, Postal services, Relays, Resilience, Routing, Security, table size routing, Unsolicited electronic mail}, isbn = {978-1-4244-3512-8}, doi = {10.1109/INFCOM.2009.5062095}, author = {Bender,A. and Sherwood,R. and Monner,D. and Goergen,N. and Spring, Neil and Bhattacharjee, Bobby} } @conference {17162, title = {Finding comparable temporal categorical records: A similarity measure with an interactive visualization}, booktitle = {IEEE Symposium on Visual Analytics Science and Technology, 2009. VAST 2009}, year = {2009}, month = {2009/10/12/13}, pages = {27 - 34}, publisher = {IEEE}, organization = {IEEE}, abstract = {An increasing number of temporal categorical databases are being collected: Electronic Health Records in healthcare organizations, traffic incident logs in transportation systems, or student records in universities. Finding similar records within these large databases requires effective similarity measures that capture the searcher{\textquoteright}s intent. Many similarity measures exist for numerical time series, but temporal categorical records are different. We propose a temporal categorical similarity measure, the M\&M (Match \& Mismatch) measure, which is based on the concept of aligning records by sentinel events, then matching events between the target and the compared records. The M\&M measure combines the time differences between pairs of events and the number of mismatches. To accom-modate customization of parameters in the M\&M measure and results interpretation, we implemented Similan, an interactive search and visualization tool for temporal categorical records. A usability study with 8 participants demonstrated that Similan was easy to learn and enabled them to find similar records, but users had difficulty understanding the M\&M measure. The usability study feedback, led to an improved version with a continuous timeline, which was tested in a pilot study with 5 participants.}, keywords = {data visualisation, Educational institutions, Feedback, Information retrieval, interactive search tool, interactive systems, interactive visualization tool, large databases, M\&M Measure, Match \& Mismatch measure, Medical services, numerical time series, parameters customization, Particle measurements, Similan, similarity measure, Similarity Search, temporal categorical databases, Temporal Categorical Records, temporal databases, Testing, Time measurement, time series, transportation, usability, very large databases, visual databases, Visualization}, isbn = {978-1-4244-5283-5}, doi = {10.1109/VAST.2009.5332595}, author = {Wongsuphasawat,K. and Shneiderman, Ben} } @article {18213, title = {Fingerprinting Compressed Multimedia Signals}, journal = {Information Forensics and Security, IEEE Transactions on}, volume = {4}, year = {2009}, month = {2009/09//}, pages = {330 - 345}, abstract = {Digital fingerprinting is a technique to deter unauthorized redistribution of multimedia content by embedding a unique identifying signal in each legally distributed copy. The embedded fingerprint can later be extracted and used to trace the originator of an unauthorized copy. A group of users may collude and attempt to create a version of the content that cannot be traced back to any of them. As multimedia data is commonly stored in compressed form, this paper addresses the problem of fingerprinting compressed signals. Analysis is carried out to show that due to the quantized nature of the host signal and the embedded fingerprint, directly extending traditional fingerprinting techniques for uncompressed signals to the compressed case leads to low collusion resistance. To overcome this problem and improve the collusion resistance, a new technique for fingerprinting compressed signals called Anti-Collusion Dither (ACD) is proposed, whereby a random dither signal is added to the compressed host before embedding so as to make the effective host signal appear more continuous. The proposed technique is shown to reduce the accuracy with which attackers can estimate the host signal, and from an information theoretic perspective, the proposed ACD technique increases the maximum number of users that can be supported by the fingerprinting system under a given attack. Both analytical and experimental studies confirm that the proposed technique increases the probability of identifying a guilty user and can approximately quadruple the collusion resistance compared to conventional Gaussian fingerprinting.}, keywords = {coding;, coding;copy, collusion;digital, communication;video, compression;digital, compression;video, dither;collusion, domain, fingerprinting;anti-collusion, fingerprinting;multimedia, Gaussian, management;multimedia, protection;data, resistance;compressed, rights}, isbn = {1556-6013}, doi = {10.1109/TIFS.2009.2025860}, author = {Varna,A.L. and He,Shan and Swaminathan,A. and M. Wu} } @conference {17168, title = {First Steps to Netviz Nirvana: Evaluating Social Network Analysis with NodeXL}, booktitle = {International Conference on Computational Science and Engineering, 2009. CSE {\textquoteright}09}, volume = {4}, year = {2009}, month = {2009/08/29/31}, pages = {332 - 339}, publisher = {IEEE}, organization = {IEEE}, abstract = {Social Network Analysis (SNA) has evolved as a popular, standard method for modeling meaningful, often hidden structural relationships in communities. Existing SNA tools often involve extensive pre-processing or intensive programming skills that can challenge practitioners and students alike. NodeXL, an open-source template for Microsoft Excel, integrates a library of common network metrics and graph layout algorithms within the familiar spreadsheet format, offering a potentially low-barrier-to-entry framework for teaching and learning SNA. We present the preliminary findings of 2 user studies of 21 graduate students who engaged in SNA using NodeXL. The majority of students, while information professionals, had little technical background or experience with SNA techniques. Six of the participants had more technical backgrounds and were chosen specifically for their experience with graph drawing and information visualization. Our primary objectives were (1) to evaluate NodeXL as an SNA tool for a broad base of users and (2) to explore methods for teaching SNA. Our complementary dual case-study format demonstrates the usability of NodeXL for a diverse set of users, and significantly, the power of a tightly integrated metrics/visualization tool to spark insight and facilitate sense-making for students of SNA.}, keywords = {Computer science, computer science education, data visualisation, Data visualization, Educational institutions, graph drawing, graph layout algorithm, Information services, Information Visualization, Internet, Libraries, Microsoft Excel open-source template, MILC, multi-dimensional in-depth long-term case studies, Netviz Nirvana, NodeXL, Open source software, Programming profession, SNA, social network analysis, Social network services, social networking (online), spreadsheet programs, structural relationship, teaching, visual analytics, visualization tool, Web sites}, isbn = {978-1-4244-5334-4}, doi = {10.1109/CSE.2009.120}, author = {Bonsignore,E. M and Dunne,C. and Rotman,D. and Smith,M. and Capone,T. and Hansen,D. L and Shneiderman, Ben} } @conference {13773, title = {Fluency, adequacy, or HTER?: exploring different human judgments with a tunable MT metric}, booktitle = {Proceedings of the Fourth Workshop on Statistical Machine Translation}, series = {StatMT {\textquoteright}09}, year = {2009}, month = {2009///}, pages = {259 - 268}, publisher = {Association for Computational Linguistics}, organization = {Association for Computational Linguistics}, address = {Stroudsburg, PA, USA}, abstract = {Automatic Machine Translation (MT) evaluation metrics have traditionally been evaluated by the correlation of the scores they assign to MT output with human judgments of translation performance. Different types of human judgments, such as Fluency, Adequacy, and HTER, measure varying aspects of MT performance that can be captured by automatic MT metrics. We explore these differences through the use of a new tunable MT metric: TER-Plus, which extends the Translation Edit Rate evaluation metric with tunable parameters and the incorporation of morphology, synonymy and paraphrases. TER-Plus was shown to be one of the top metrics in NIST{\textquoteright}s Metrics MATR 2008 Challenge, having the highest average rank in terms of Pearson and Spearman correlation. Optimizing TER-Plus to different types of human judgments yields significantly improved correlations and meaningful changes in the weight of different types of edits, demonstrating significant differences between the types of human judgments.}, url = {http://dl.acm.org/citation.cfm?id=1626431.1626480}, author = {Snover,Matthew and Madnani,Nitin and Dorr, Bonnie J and Schwartz,Richard} } @conference {18835, title = {Formal Representation of Product Design Specifications for Validating Product Design}, year = {2009}, month = {2009///}, pages = {1411 - 1422}, publisher = {ASME}, organization = {ASME}, abstract = {As collaborative efforts in electro-mechanical design have scaled to large, distributed groups working for years on a single product, an increasingly large gulf has developed between the original stated goals of the project and the final design solution. It has thus become necessary to validate the final design solution against a set of requirements to ensure that these goals have, in fact, been met. This process has become tedious for complex products with hundreds of design aspects and requirements. By formalizing the representation of requirements and the design solution, tools can be developed to a large extent automatically perform this validation. In this paper, we propose a formal approach for relating product requirements to the design solution. First, we present a formal model for representing product requirements. Then, we introduce the Core Product Model (CPM) and the Open Assembly Model (OAM) for representing the design solution. Finally, we link these models formally and provide an example with an actual consumer device.}, isbn = {978-0-7918-4899-9}, doi = {10.1115/DETC2009-87307}, url = {http://link.aip.org/link/ASMECP/v2009/i48999/p1411/s1\&Agg=doi}, author = {Weissman,Alexander and Gupta, Satyandra K. and Fiorentini,Xenia and Sudarsan,Rachuri and Sriram,Ram} } @article {14465, title = {FutureRank: Ranking scientific articles by predicting their future PageRank}, journal = {Proceedings of the 9th SIAM International Conference on Data Mining}, year = {2009}, month = {2009///}, pages = {533 - 544}, abstract = {The dynamic nature of citation networks makes the taskof ranking scientific articles hard. Citation networks are continually evolving because articles obtain new citations every day. For ranking scientific articles, we can define the popularity or prestige of a paper based on the number of past citations at the user query time; however, we argue that what is most useful is the expected future references. We define a new measure, FutureRank, which is the expected future PageRank score based on citations that will be obtained in the future. In addition to making use of the citation network, FutureRank uses the authorship network and the publication time of the article in order to predict future citations. Our experiments compare FutureRank with existing approaches, and show that FutureRank is accurate and useful for finding and ranking publications. }, author = {Sayyadi,H. and Getoor, Lise} } @article {14614, title = {Gene Profiling of Human Adipose Tissue During Evoked Inflammation In Vivo}, journal = {DiabetesDiabetes}, volume = {58}, year = {2009}, month = {2009/10/01/}, pages = {2211 - 2219}, abstract = {OBJECTIVE Adipose inflammation plays a central role in obesity-related metabolic and cardiovascular complications. However, few human adipose-secreted proteins are known to mediate these processes. We hypothesized that microarray mRNA profiling of human adipose during evoked inflammation could identify novel adipocytokines.RESEARCH DESIGN AND METHODS Healthy human volunteers (n = 14) were treated with intravenous endotoxin (3 ng/kg lipopolysaccharide [LPS]) and underwent subcutaneous adipose biopsies before and after LPS. On Affymetrix U133Plus 2.0 arrays, adipose mRNAs modulated >1.5-fold (with P < 0.00001) were selected. SignalP 3.0 and SecretomeP 2.0 identified genes predicted to encode secreted proteins. Of these, 86 candidates were chosen for validation in adipose from an independent human endotoxemia protocol (N = 7, with 0.6 ng/kg LPS) and for exploration of cellular origin in primary human adipocytes and macrophages in vitro. RESULTS Microarray identified 776 adipose genes modulated by LPS; 298 were predicted to be secreted. Of detectable prioritized genes, 82 of 85 (96\% [95\% CI 90{\textendash}99]) were upregulated (fold changes >1.0) during the lower-dose (LPS 0.6 ng/kg) validation study and 51 of 85 (59\% [49{\textendash}70]) were induced greater than 1.5-fold. Treatment of primary adipocytes with LPS and macrophage polarization to M1 proinflammatory phenotype increased expression by 1.5-fold for 58 and 73\% of detectable genes, respectively. CONCLUSIONS We demonstrate that evoked inflammation of human adipose in vivo modulated expression of multiple genes likely secreted by adipocytes and monocytes. These included established adipocytokines and chemokines implicated in recruitment and activation of lymphocytes, adhesion molecules, antioxidants, and several novel genes with unknown function. Such candidates may represent biomarkers and therapeutic targets for obesity-related complications. }, isbn = {0012-1797, 1939-327X}, doi = {10.2337/db09-0256}, url = {http://diabetes.diabetesjournals.org/content/58/10/2211}, author = {Shah,Rachana and Lu,Yun and Hinkle,Christine C and McGillicuddy,Fiona C and Kim,Roy and Hannenhalli, Sridhar and Cappola,Thomas P. and Heffron,Sean and Wang,XingMei and Mehta,Nehal N and Putt,Mary and Reilly,Muredach P} } @article {12896, title = {Genome assortment, not serogroup, defines Vibrio cholerae pandemic strains}, journal = {Nature}, year = {2009}, month = {2009///}, abstract = {Vibrio cholerae, the causative agent of cholera, is a bacterium autochthonous to the aquatic environment, and a serious public health threat. V. cholerae serogroup O1 is responsible for the previous two cholera pandemics, in which classical and El Tor biotypes were dominant in the 6th and the current 7th pandemics, respectively. Cholera researchers continually face newly emerging and re-emerging pathogenic clones carrying combinations of new serogroups as well as of phenotypic and genotypic properties. These genotype and phenotype changes have hampered control of the disease. Here we compare the complete genome sequences of 23 strains of V. cholerae isolated from a variety of sources and geographical locations over the past 98 years in an effort to elucidate the evolutionary mechanisms governing genetic diversity and genesis of new pathogenic clones. The genome-based phylogeny revealed 12 distinct V. cholerae phyletic lineages, of which one, designated the V. cholerae core genome (CG), comprises both O1 classical and EI Tor biotypes. All 7th pandemic clones share nearly identical gene content, i.e., the same genome backbone. The transition from 6th to 7th pandemic strains is defined here as a {\textquoteright}shift{\textquoteright} between pathogenic clones belonging to the same O1 serogroup, but from significantly different phyletic lineages within the CG clade. In contrast, transition among clones during the present 7th pandemic period can be characterized as a {\textquoteright}drift{\textquoteright} between clones, differentiated mainly by varying composition of laterally transferred genomic islands, resulting in emergence of variants, exemplified by V.cholerae serogroup O139 and V.cholerae O1 El Tor hybrid clones that produce cholera toxin of classical biotype. Based on the comprehensive comparative genomics presented in this study it is concluded that V. cholerae undergoes extensive genetic recombination via lateral gene transfer, and, therefore, genome assortment, not serogroup, should be used to define pathogenic V. cholerae clones.}, keywords = {59; CHOLERA; GENES; GENETICS; GENOTYPE; ISLANDS; ORIGIN; PHENOTYPE; PUBLIC HEALTH; RECOMBINATION; STRAINS; TOXINS}, url = {http://www.osti.gov/energycitations/servlets/purl/962365-icnke9/}, author = {Brettin,Thomas S[Los Alamos National Laboratory and Bruce,David C[Los Alamos National Laboratory and Challacombe,Jean F[Los Alamos National Laboratory and Detter,John C[Los Alamos National Laboratory and Han,Cliff S[Los Alamos National Laboratory and Munik,A. C[Los Alamos National Laboratory and Chertkov,Olga[Los Alamos National Laboratory and Meincke,Linda[Los Alamos National Laboratory and Saunders,Elizabeth[Los Alamos National Laboratory and Choi,Seon Y[SEOUL NATL UNIV and Haley,Bradd J[U MARYLAND and Taviani,Elisa[U MARYLAND and Jeon,Yoon-Seong[INTL VACCINE INST SEOUL and Kim,Dong Wook[INTL VACCINE INST SEOUL and Lee,Jae-Hak[SEOUL NATL UNIV and Walters,Ronald A[PNNL and Hug,Anwar[NATL INST CHOLERIC ENTERIC DIS and Rita R Colwell} } @article {13371, title = {Graphical models for uncertain data}, journal = {Managing and Mining Uncertain Data}, year = {2009}, month = {2009///}, pages = {77 - 77}, author = {Deshpande, Amol and Getoor, Lise and Sen,P.} } @article {16759, title = {GrouPeer: Dynamic clustering of P2P databases}, journal = {Information Systems}, volume = {34}, year = {2009}, month = {2009/03//}, pages = {62 - 86}, abstract = {Sharing structured data in a P2P network is a challenging problem, especially in the absence of a mediated schema. The standard practice of answering a consecutively rewritten query along the propagation path often results in significant loss of information. On the opposite, the use of mediated schemas requires human interaction and global agreement, both during creation and maintenance. In this paper we present GrouPeer, an adaptive, automated approach to both issues in the context of unstructured P2P database overlays. By allowing peers to individually choose which rewritten version of a query to answer and evaluate the received answers, information-rich sources left hidden otherwise are discovered. Gradually, the overlay is restructured as semantically similar peers are clustered together. Experimental results show that our technique produces very accurate answers and builds clusters that are very close to the optimal ones by contacting a very small number of nodes in the overlay.}, keywords = {Peer-to-Peer databases, Query reformulation in P2P databases, Semantics in P2P query answering, Structured data in unstructured P2P overlays}, isbn = {0306-4379}, doi = {16/j.is.2008.04.002}, url = {http://www.sciencedirect.com/science/article/pii/S0306437908000252}, author = {Kantere,Verena and Tsoumakos,Dimitrios and Sellis,Timos and Roussopoulos, Nick} } @article {17186, title = {HEALTH AND WELLBEING}, journal = {The fourth paradigm: data-intensive scientific discovery}, year = {2009}, month = {2009///}, pages = {57 - 57}, author = {Gillam,M. and Feied,C. and MOODY,E. and Shneiderman, Ben and Smith,M. and DICKASON,J.} } @conference {13099, title = {Human detection using partial least squares analysis}, booktitle = {Computer Vision, 2009 IEEE 12th International Conference on}, year = {2009}, month = {2009/10/29/2}, pages = {24 - 31}, abstract = {Significant research has been devoted to detecting people in images and videos. In this paper we describe a human detection method that augments widely used edge-based features with texture and color information, providing us with a much richer descriptor set. This augmentation results in an extremely high-dimensional feature space (more than 170,000 dimensions). In such high-dimensional spaces, classical machine learning algorithms such as SVMs are nearly intractable with respect to training. Furthermore, the number of training samples is much smaller than the dimensionality of the feature space, by at least an order of magnitude. Finally, the extraction of features from a densely sampled grid structure leads to a high degree of multicollinearity. To circumvent these data characteristics, we employ Partial Least Squares (PLS) analysis, an efficient dimensionality reduction technique, one which preserves significant discriminative information, to project the data onto a much lower dimensional subspace (20 dimensions, reduced from the original 170,000). Our human detection system, employing PLS analysis over the enriched descriptor set, is shown to outperform state-of-the-art techniques on three varied datasets including the popular INRIA pedestrian dataset, the low-resolution gray-scale DaimlerChrysler pedestrian dataset, and the ETHZ pedestrian dataset consisting of full-length videos of crowded scenes.}, doi = {10.1109/ICCV.2009.5459205}, author = {Schwartz,William Robson and Kembhavi,Aniruddha and Harwood,David and Davis, Larry S.} } @conference {12238, title = {Identifying close friends on the internet}, booktitle = {Proc. of workshop on Hot Topics in Networks (HotNets-VIII)}, year = {2009}, month = {2009///}, abstract = {Online Social Networks (OSNs) encourage users to createan online presence that reflects their offline identity. OSNs create the illusion that these online accounts correspond to the correct offline person, but in reality the OSN lacks the re- sources to detect impersonation. We propose that OSN users identify each other based on interaction and experience. We believe that impersonation can be thwarted by users who possess exclusive shared knowledge, secret informa- tion shared only between a pair of OSN friends. We describe existing protocols that use shared secrets to exchange public keys without revealing those secrets to attackers. We present results from a user study on Facebook to show that users do share exclusive knowledge with their Facebook friends and attackers are rarely able to guess that knowledge. Finally, we show that friend identification can be extended using a web of trust built on the OSN friend graph. }, author = {Baden,R. and Spring, Neil and Bhattacharjee, Bobby} } @article {14941, title = {An Implementation of the Audit Control Environment (ACE) to Support the Long Term Integrity of Digital Archives}, journal = {Proceedings of DigCCurr2009 Digital Curation: Practice, Promise and Prospects}, year = {2009}, month = {2009///}, pages = {164 - 164}, abstract = {In this paper, we describe the implementation of the AuditControl Environment (ACE)[1] system that provides a scalable, auditable platform for ensuring the integrity of digital archival holdings. The core of ACE is a small integrity token issued for each monitored item, which is part of a larger, externally auditable cryptographic system. Two components that describe this system, an Audit Manager and Integrity Management Service, have been developed and released. The Audit Manager component is designed to be installed locally at the archive, while the Integrity Management Service is a centralized, publically available service. ACE allows for the monitoring of collections on a variety of disk and grid based storage systems. Each collection in ACE is subject to monitoring based on a customizable policy. The released ACE Version 1.0 has been tested extensively on a wide variety of collections in both centralized and distributed environments. }, author = {Smorul,M. and Song,S. and JaJa, Joseph F.} } @conference {19033, title = {Implicit authentication for mobile devices}, series = {HotSec{\textquoteright}09}, year = {2009}, month = {2009}, pages = {9 - 9}, publisher = {USENIX Association}, organization = {USENIX Association}, abstract = {We introduce the notion of implicit authentication - the ability to authenticate mobile users based on actions they would carry out anyway. We develop a model for how to perform implicit authentication, and describe experiments aimed at assessing the benefits of our techniques. Our preliminary findings support that this is a meaningful approach, whether used to increase usability or increase security.}, url = {http://dl.acm.org/citation.cfm?id=1855628.1855637}, author = {Jakobsson, Markus and Elaine Shi and Golle, Philippe and Chow, Richard} } @article {17224, title = {Improving graph drawing readability by incorporating readability metrics: A software tool for network analysts}, journal = {University of Maryland, HCIL Tech Report HCIL-2009-13}, year = {2009}, month = {2009///}, abstract = {Designing graph drawings that effectively communicate the under-lying network is challenging as for every network there are many potential unintelligible or even misleading drawings. Automated graph layout algorithms have helped, but frequently generate in- effective drawings. In order to build awareness of effective graph drawing strategies, we detail readability metrics on a [0,1] contin- uous scale for node occlusion, edge crossing, edge crossing angle, and edge tunneling and summarize many more. Additionally, we define new node \& edge readability metrics to provide more lo- calized identification of where improvement is needed. These are implemented in SocialAction, a tool for social network analysis, in order to direct users towards poor areas of the drawing and provide real-time readability metric feedback as users manipulate it. These contributions are aimed at heightening the awareness of network analysts that the images they share or publish could be of higher quality, so that readers could extract relevant information. }, author = {Dunne,C. and Shneiderman, Ben} } @article {17613, title = {Improving recommendation accuracy by clustering social networks with trust}, journal = {Recommender Systems \& the Social Web}, year = {2009}, month = {2009///}, pages = {1 - 8}, abstract = {Social trust relationships between users in social networksspeak to the similarity in opinions between the users, both in general and in important nuanced ways. They have been used in the past to make recommendations on the web. New trust metrics allow us to easily cluster users based on trust. In this paper, we investigate the use of trust clusters as a new way of improving recommendations. Previous work on the use of clusters has shown the technique to be relatively un- successful, but those clusters were based on similarity rather than trust. Our results show that when trust clusters are integrated into memory-based collaborative filtering algo- rithms, they lead to statistically significant improvements in accuracy. In this paper we discuss our methods, experi- ments, results, and potential future applications of the tech- nique. }, author = {DuBois,T. and Golbeck,J. and Kleint,J. and Srinivasan, Aravind} } @conference {13101, title = {Incremental Multiple Kernel Learning for object recognition}, booktitle = {Computer Vision, 2009 IEEE 12th International Conference on}, year = {2009}, month = {2009/10/29/2}, pages = {638 - 645}, abstract = {A good training dataset, representative of the test images expected in a given application, is critical for ensuring good performance of a visual categorization system. Obtaining task specific datasets of visual categories is, however, far more tedious than obtaining a generic dataset of the same classes. We propose an Incremental Multiple Kernel Learning (IMKL) approach to object recognition that initializes on a generic training database and then tunes itself to the classification task at hand. Our system simultaneously updates the training dataset as well as the weights used to combine multiple information sources. We demonstrate our system on a vehicle classification problem in a video stream overlooking a traffic intersection. Our system updates itself with images of vehicles in poses more commonly observed in the scene, as well as with image patches of the background, leading to an increase in performance. A considerable change in the kernel combination weights is observed as the system gathers scene specific training data over time. The system is also seen to adapt itself to the illumination change in the scene as day transitions to night.}, doi = {10.1109/ICCV.2009.5459179}, author = {Kembhavi,Aniruddha and Siddiquie,Behjat and Miezianko,Roland and McCloskey,Scott and Davis, Larry S.} } @article {14478, title = {Index interactions in physical design tuning: modeling, analysis, and applications}, journal = {Proceedings of the VLDB Endowment}, volume = {2}, year = {2009}, month = {2009/08//}, pages = {1234 - 1245}, abstract = {One of the key tasks of a database administrator is to optimize the set of materialized indices with respect to the current workload. To aid administrators in this challenging task, commercial DBMSs provide advisors that recommend a set of indices based on a sample workload. It is left for the administrator to decide which of the recommended indices to materialize and when. This decision requires some knowledge of how the indices benefit the workload, which may be difficult to understand if there are any dependencies or interactions among indices. Unfortunately, advisors do not provide this crucial information as part of the recommendation. Motivated by this shortcoming, we propose a framework and associated tools that can help an administrator understand the interactions within the recommended set of indices. We formalize the notion of index interactions and develop a novel algorithm to identify the interaction relationships that exist within a set of indices. We present experimental results with a prototype implementation over IBM DB2 that demonstrate the efficiency of our approach. We also describe two new database tuning tools that utilize information about index interactions. The first tool visualizes interactions based on a partitioning of the index-set into non-interacting subsets, and the second tool computes a schedule that materializes the indices over several maintenance windows with maximal overall benefit. In both cases, we provide strong analytical results showing that index interactions can enable enhanced functionality.}, isbn = {2150-8097}, url = {http://dl.acm.org/citation.cfm?id=1687627.1687766}, author = {Schnaitter,Karl and Polyzotis,Neoklis and Getoor, Lise} } @inbook {17233, title = {Information Visualization}, booktitle = {Human-Computer InteractionHuman-Computer Interaction}, volume = {20093960}, year = {2009}, month = {2009/03/02/}, pages = {181 - 215}, publisher = {CRC Press}, organization = {CRC Press}, isbn = {978-1-4200-8885-4, 978-1-4200-8886-1}, url = {http://www.crcnetbase.com/doi/abs/10.1201/9781420088861.ch10}, author = {Card,Stuart}, editor = {Sears,Andrew and Jacko,Julie} } @article {19460, title = {The Ins and Outs of Home Networking: The Case for Useful and Usable Domestic Networking}, journal = {ACM Trans. Comput.-Hum. Interact.}, volume = {16}, year = {2009}, month = {2009/06//}, pages = {8:1 - 8:28}, abstract = {Householders are increasingly adopting home networking as a solution to the demands created by the presence of multiple computers, devices, and the desire to access the Internet. However, current network solutions are derived from the world of work (and initially the military) and provide poor support for the needs of the home. We present the key findings to emerge from empirical studies of home networks in the UK and US. The studies reveal two key kinds of work that effective home networking relies upon: one, the technical work of setting up and maintaining the home network, and the other, the collaborative and socially organized work of the home which the network is embedded in and supports. The two are thoroughly intertwined and rely upon one another for their realization, yet neither is adequately supported by current networking technologies and applications. Explication of the {\textquotedblleft}work to make the home network work{\textquotedblright} opens up the design space for the continued integration of the home network in domestic life and elaboration of future support. Key issues for development include the development of networking facilities that do not require advanced networking knowledge, that are flexible and support the local social order of the home and the evolution of its routines, and which ultimately make the home network visible and accountable to household members.}, keywords = {home networking, Human computer interaction}, isbn = {1073-0516}, url = {http://doi.acm.org/10.1145/1534903.1534905}, author = {Grinter, Rebecca E. and Edwards, W. Keith and Marshini Chetty and Poole, Erika S. and Sung, Ja-Young and Yang, Jeonghwa and Crabtree, Andy and Tolmie, Peter and Rodden, Tom and Greenhalgh, Chris and Benford, Steve} } @article {17238, title = {Integrating Statistics and Visualization for Exploratory Power: From Long-Term Case Studies to Design Guidelines}, journal = {IEEE Computer Graphics and Applications}, volume = {29}, year = {2009}, month = {2009/06//May}, pages = {39 - 51}, abstract = {Evaluating visual-analytics systems is challenging because laboratory-based controlled experiments might not effectively represent analytical tasks. One such system, Social Action, integrates statistics and visualization in an interactive exploratory tool for social network analysis. This article describes results from long-term case studies with domain experts and extends established design goals for information visualization.}, keywords = {case studies, Control systems, Data analysis, data mining, data visualisation, Data visualization, data-mining, design guidelines, Employment, exploration, Filters, Guidelines, Information Visualization, insights, laboratory-based controlled experiments, Performance analysis, social network analysis, Social network services, social networking (online), social networks, SocialAction, statistical analysis, Statistics, visual analytics, visual-analytics systems, Visualization}, isbn = {0272-1716}, doi = {10.1109/MCG.2009.44}, author = {Perer,A. and Shneiderman, Ben} } @inbook {13797, title = {Interlingual annotation of multilingual text corpora and FrameNet}, booktitle = {Multilingual FrameNets in Computational LexicographyMultilingual FrameNets in Computational Lexicography}, volume = {200}, year = {2009}, month = {2009/07/14/}, pages = {287 - 318}, publisher = {Mouton de Gruyter}, organization = {Mouton de Gruyter}, address = {Berlin, New York}, isbn = {978-3-11-021296-9, 978-3-11-021297-6}, url = {http://www.degruyter.com/view/books/9783110212976/9783110212976.4.287/9783110212976.4.287.xml}, author = {Farwell,David and Dorr, Bonnie J and Habash,Nizar and Helmreich,Stephen and Hovy,Eduard and Green,Rebecca and Levin,Lori and Miller,Keith and Mitamura,Teruko and Rambow,Owen and Reeder,Flo and Siddharthan,Advaith}, editor = {Bisang,Walter and Hock,Hans Henrich and Winter,Werner and Boas,Hans C.} } @article {18230, title = {Intrinsic Sensor Noise Features for Forensic Analysis on Scanners and Scanned Images}, journal = {Information Forensics and Security, IEEE Transactions on}, volume = {4}, year = {2009}, month = {2009/09//}, pages = {476 - 491}, abstract = {A large portion of digital images available today are acquired using digital cameras or scanners. While cameras provide digital reproduction of natural scenes, scanners are often used to capture hard-copy art in a more controlled environment. In this paper, new techniques for nonintrusive scanner forensics that utilize intrinsic sensor noise features are proposed to verify the source and integrity of digital scanned images. Scanning noise is analyzed from several aspects using only scanned image samples, including through image denoising, wavelet analysis, and neighborhood prediction, and then obtain statistical features from each characterization. Based on the proposed statistical features of scanning noise, a robust scanner identifier is constructed to determine the model/brand of the scanner used to capture a scanned image. Utilizing these noise features, we extend the scope of acquisition forensics to differentiating scanned images from camera-taken photographs and computer-generated graphics. The proposed noise features also enable tampering forensics to detect postprocessing operations on scanned images. Experimental results are presented to demonstrate the effectiveness of employing the proposed noise features for performing various forensic analysis on scanners and scanned images.}, keywords = {analysis;image, camera-taken, cameras;digital, denoising;intrinsic, denoising;wavelet, features;natural, forensics;scanned, graphics;digital, identifier;wavelet, images;digital, images;scanner, NOISE, photographs;computer-generated, prediction;nonintrusive, reproduction;forensic, scanner, scenes;neighborhood, sensor, transforms;}, isbn = {1556-6013}, doi = {10.1109/TIFS.2009.2026458}, author = {Gou,Hongmei and Swaminathan,A. and M. Wu} } @inbook {12536, title = {Knowledge Extraction from Surveillance Sensors}, booktitle = {Wiley Handbook of Science and Technology for Homeland SecurityWiley Handbook of Science and Technology for Homeland Security}, year = {2009}, month = {2009///}, publisher = {John Wiley \& Sons, Inc.}, organization = {John Wiley \& Sons, Inc.}, keywords = {multi-camera tracking, multi-modal fusion, recognition, sensor networks, Surveillance}, isbn = {9780470087923}, url = {http://onlinelibrary.wiley.com/doi/10.1002/9780470087923.hhs510/abstract;jsessionid=D0D752EF5D04327BE003BDFBD2F96134.d01t03}, author = {Chellapa, Rama and Veeraraghavan,Ashok and Sankaranarayanan,Aswin C.} } @conference {13102, title = {Learning Discriminative Appearance-Based Models Using Partial Least Squares}, booktitle = {Computer Graphics and Image Processing (SIBGRAPI), 2009 XXII Brazilian Symposium on}, year = {2009}, month = {2009/10//}, pages = {322 - 329}, abstract = {Appearance information is essential for applications such as tracking and people recognition. One of the main problems of using appearance-based discriminative models is the ambiguities among classes when the number of persons being considered increases. To reduce the amount of ambiguity, we propose the use of a rich set of feature descriptors based on color, textures and edges. Another issue regarding appearance modeling is the limited number of training samples available for each appearance. The discriminative models are created using a powerful statistical tool called partial least squares (PLS), responsible for weighting the features according to their discriminative power for each different appearance. The experimental results, based on appearance-based person recognition, demonstrate that the use of an enriched feature set analyzed by PLS reduces the ambiguity among different appearances and provides higher recognition rates when compared to other machine learning techniques.}, keywords = {(artificial, analysis;learning, appearance, approximations;object, based, colour, descriptors;learning, discriminative, intelligence);least, learning, least, models;machine, person, recognition;, recognition;feature, squares, squares;image, techniques;partial}, doi = {10.1109/SIBGRAPI.2009.42}, author = {Schwartz, W.R. and Davis, Larry S.} } @article {13450, title = {Learning to trust in the competence and commitment of agents}, journal = {Autonomous Agents and Multi-Agent Systems}, volume = {18}, year = {2009}, month = {2009///}, pages = {36 - 82}, abstract = {For agents to collaborate in open multi-agent systems, each agent must trust in the other agents{\textquoteright} ability to complete tasks and willingness to cooperate. Agents need to decide between cooperative and opportunistic behavior based on their assessment of another agents{\textquoteright} trustworthiness. In particular, an agent can have two beliefs about a potential partner that tend to indicate trustworthiness: that the partner is competent and that the partner expects to engage in future interactions . This paper explores an approach that models competence as an agent{\textquoteright}s probability of successfully performing an action, and models belief in future interactions as a discount factor. We evaluate the underlying decision framework{\textquoteright}s performance given accurate knowledge of the model{\textquoteright}s parameters in an evolutionary game setting. We then introduce a game-theoretic framework in which an agent can learn a model of another agent online, using the Harsanyi transformation. The learning agents evaluate a set of competing hypotheses about another agent during the simulated play of an indefinitely repeated game. The Harsanyi strategy is shown to demonstrate robust and successful online play against a variety of static, classic, and learning strategies in a variable-payoff Iterated Prisoner{\textquoteright}s Dilemma setting.}, isbn = {1387-2532}, url = {http://dx.doi.org/10.1007/s10458-008-9055-8}, author = {Smith,Michael and desJardins, Marie} } @article {14352, title = {On maximum coverage in the streaming model \& application to multi-topic blog-watch}, journal = {2009 SIAM International Conference on Data Mining (SDM09)}, year = {2009}, month = {2009///}, abstract = {We generalize the graph streaming model to hypergraphs.In this streaming model, hyperedges are arriving online and any computation has to be done on-the-fly using a small amount of space. Each hyperedge can be viewed as a set of elements (nodes), so we refer to our proposed model as the {\textquotedblleft}set-streaming{\textquotedblright} model of computation. We consider the problem of {\textquotedblleft}maximum coverage{\textquotedblright}, in which k sets have to be selected that maximize the total weight of the covered elements. In the set-streaming model of computation, we show that our algorithm for maximum- coverage achieves an approximation factor of 1 . When multiple passes are allowed, we also provide a Θ(log n) approximation algorithm for the set-cover. We next consider a multi-topic blog-watch application, an extension of blog- alert like applications for handling simultaneous multiple- topic requests. We show how the problems of maximum- coverage and set-cover in the set-streaming model can be utilized to give efficient online solutions to this problem. We verify the effectiveness of our methods both on synthetic and real weblog data. }, author = {Saha,B. and Getoor, Lise} } @article {19664, title = {Measuring differential gene expression by short read sequencing: quantitative comparison to 2-channel gene expression microarrays}, journal = {BMC Genomics}, volume = {10}, year = {2009}, month = {2009/12/01/}, pages = {1 - 10}, abstract = {Background High-throughput cDNA synthesis and sequencing of poly(A)-enriched RNA is rapidly emerging as a technology competing to replace microarrays as a quantitative platform for measuring gene expression. Results Consequently, we compared full length cDNA sequencing to 2-channel gene expression microarrays in the context of measuring differential gene expression. Because of its comparable cost to a gene expression microarray, our study focused on the data obtainable from a single lane of an Illumina 1 G sequencer. We compared sequencing data to a highly replicated microarray experiment profiling two divergent strains of S. cerevisiae. Conclusion Using a large number of quantitative PCR (qPCR) assays, more than previous studies, we found that neither technology is decisively better at measuring differential gene expression. Further, we report sequencing results from a diploid hybrid of two strains of S. cerevisiae that indicate full length cDNA sequencing can discover heterozygosity and measure quantitative allele-specific expression simultaneously.}, keywords = {Animal Genetics and Genomics, Life Sciences, general, Microarrays, Microbial Genetics and Genomics, Plant Genetics \& Genomics, proteomics}, isbn = {1471-2164}, url = {http://link.springer.com/article/10.1186/1471-2164-10-221}, author = {Bloom, Joshua S. and Zia Khan and Kruglyak, Leonid and Singh, Mona and Caudy, Amy A.} } @article {17753, title = {Method and system for optimal data diagnosis}, volume = {10/774,516}, year = {2009}, month = {2009/01/06/}, abstract = {In the method and system for automated data diagnosis, a relational data base is formed of attributes characterizing an entity. The framework computes optimal diagnosis for a diagnostic inference problem which separates the desirable attributes from the undesirable attributes. The user of the system is permitted to specify certain parameters based on which the system computes a set of optimal or near optimal association rules between the attributes of a specific process, product, or other entity. The system and method of the present invention considers the simplicity of conditions in addition to support and confidence when ordering them, contributes the notion of tight conditions and semi-equivalence to remove redundant rules, uses the concept of the top fringes which allows near optimal conditions to be found, in addition to optimal conditions. Numeric as well as non-numeric attributes can be analyzed.}, url = {http://www.google.com/patents?id=fHnVAAAAEBAJ}, author = {V.S. Subrahmanian and Ernst,Jason}, editor = {University of Maryland} } @conference {14628, title = {Mimosa: mixture model of co-expression to detect modulators of regulatory interaction}, booktitle = {Proceedings of the 9th international conference on Algorithms in bioinformatics}, series = {WABI{\textquoteright}09}, year = {2009}, month = {2009///}, pages = {133 - 144}, publisher = {Springer-Verlag}, organization = {Springer-Verlag}, address = {Berlin, Heidelberg}, abstract = {Functionally related genes tend to be correlated in their expression patterns across multiple conditions and/or tissue-types. Thus co-expression networks are often used to investigate functional groups of genes. In particular, when one of the genes is a transcription factor (TF), the co-expression-based interaction is interpreted, with caution, as a direct regulatory interaction. However, any particular TF, and more importantly, any particular regulatory interaction, is likely to be active only in a subset of experimental conditions. Moreover, the subset of expression samples where the regulatory interaction holds may be marked by presence or absence of a modifier gene, such as an enzyme that post-translationally modifies the TF. Such subtlety of regulatory interactions is overlooked when one computes an overall expression correlation. Here we present a novel mixture modeling approach where a TF-Gene pair is presumed to be significantly correlated (with unknown coefficient) in a (unknown) subset of expression samples. The parameters of the model are estimated using a Maximum Likelihood approach. The estimated mixture of expression samples is then mined to identify genes potentially modulating the TF-Gene interaction. We have validated our approach using synthetic data and on three biological cases in cow and in yeast. While limited in some ways, as discussed, the work represents a novel approach to mine expression data and detect potential modulators of regulatory interactions.}, isbn = {3-642-04240-6, 978-3-642-04240-9}, url = {http://dl.acm.org/citation.cfm?id=1812906.1812918}, author = {Hansen,Matthew and Everett,Logan and Singh,Larry and Hannenhalli, Sridhar} } @article {17755, title = {Mining Online Opinions}, journal = {Computer}, volume = {42}, year = {2009}, month = {2009///}, pages = {88 - 90}, abstract = {Emerging opinion-mining technology makes it possible to aggregate and financially leverage the opinions of vast numbers of people.}, doi = {10.1109/MC.2009.229}, author = {V.S. Subrahmanian} } @article {17917, title = {Modeling and visualization of human activities for multicamera networks}, journal = {EURASIP Journal on Image and Video Processing}, volume = {2009}, year = {2009}, month = {2009///}, author = {Sankaranarayanan,A. C and Patro,R. and Turaga,P. and Varshney, Amitabh and Chellapa, Rama} } @article {12513, title = {Multicamera Tracking of Articulated Human Motion Using Shape and Motion Cues}, journal = {Image Processing, IEEE Transactions on}, volume = {18}, year = {2009}, month = {2009/09//}, pages = {2114 - 2126}, abstract = {We present a completely automatic algorithm for initializing and tracking the articulated motion of humans using image sequences obtained from multiple cameras. A detailed articulated human body model composed of sixteen rigid segments that allows both translation and rotation at joints is used. Voxel data of the subject obtained from the images is segmented into the different articulated chains using Laplacian eigenmaps. The segmented chains are registered in a subset of the frames using a single-frame registration technique and subsequently used to initialize the pose in the sequence. A temporal registration method is proposed to identify the partially segmented or unregistered articulated chains in the remaining frames in the sequence. The proposed tracker uses motion cues such as pixel displacement as well as 2-D and 3-D shape cues such as silhouettes, motion residue, and skeleton curves. The tracking algorithm consists of a predictor that uses motion cues and a corrector that uses shape cues. The use of complementary cues in the tracking alleviates the twin problems of drift and convergence to local minima. The use of multiple cameras also allows us to deal with the problems due to self-occlusion and kinematic singularity. We present tracking results on sequences with different kinds of motion to illustrate the effectiveness of our approach. The pose of the subject is correctly tracked for the duration of the sequence as can be verified by inspection.}, keywords = {2D shape cues, 3D shape cues, algorithms, Anatomic;Models, articulated human motion, automatic algorithm, Biological;Movement;Posture;Skeleton;Video Recording;, Computer-Assisted;Models, Eigenvalues and eigenfunctions, human pose estimation, HUMANS, Image motion analysis, IMAGE PROCESSING, image registration, Image segmentation, Image sequences, kinematic singularity, Laplacian eigenmaps, multicamera tracking algorithm, pixel displacement, pose estimation, single-frame registration technique, temporal registration method, tracking}, isbn = {1057-7149}, doi = {10.1109/TIP.2009.2022290}, author = {Sundaresan, A. and Chellapa, Rama} } @article {17300, title = {Multidimensional Analysis and Visualization on Large Biomedical Data}, journal = {Statistical Bioinformatics}, year = {2009}, month = {2009///}, pages = {157 - 184}, author = {Seo,J. and Shneiderman, Ben} } @article {16936, title = {A National Initiative for Social Participation}, journal = {ScienceScience}, volume = {323}, year = {2009}, month = {2009/03/13/}, pages = {1426 - 1427}, isbn = {0036-8075, 1095-9203}, doi = {10.1126/science.323.5920.1426}, url = {http://www.sciencemag.org/content/323/5920/1426}, author = {Shneiderman, Ben} } @conference {14564, title = {Network-aware forward caching}, booktitle = {Proceedings of the 18th international conference on World wide web}, series = {WWW {\textquoteright}09}, year = {2009}, month = {2009///}, pages = {291 - 300}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {This paper proposes and evaluates a Network Aware Forward Caching approach for determining the optimal deployment strategy of forward caches to a network. A key advantage of this approach is that we can reduce the network costs associated with forward caching to maximize the benefit obtained from their deployment. We show in our simulation that a 37\% increase to net benefits could be achieved over the standard method of full cache deployment to cache all POPs traffic. In addition, we show that this maximal point occurs when only 68\% of the total traffic is cached. Another contribution of this paper is the analysis we use to motivate and evaluate this problem. We characterize the Internet traffic of 100K subscribers of a US residential broadband provider. We use both layer 4 and layer 7 analysis to investigate the traffic volumes of the flows as well as study the general characteristics of the applications used. We show that HTTP is a dominant protocol and account for 68\% of the total downstream traffic and that 34\% of that traffic is multimedia. In addition, we show that multimedia content using HTTP exhibits a 83\% annualized growth rate and other HTTP traffic has a 53\% growth rate versus the 26\% over all annual growth rate of broadband traffic. This shows that HTTP traffic will become ever more dominent and increase the potential caching opportunities. Furthermore, we characterize the core backbone traffic of this broadband provider to measure the distance travelled by content and traffic. We find that CDN traffic is much more efficient than P2P content and that there is large skew in the Air Miles between POP in a typical network. Our findings show that there are many opportunties in broadband provider networks to optimize how traffic is delivered and cached.}, keywords = {caching, Web}, isbn = {978-1-60558-487-4}, doi = {10.1145/1526709.1526749}, url = {http://doi.acm.org/10.1145/1526709.1526749}, author = {Erman,Jeffrey and Gerber,Alexandre and Hajiaghayi, Mohammad T. and Pei,Dan and Spatscheck,Oliver} } @article {12887, title = {New records of phytoplankton for Bangladesh. 9. Some rare and a new species}, journal = {Bangladesh Journal of Plant Taxonomy}, volume = {16}, year = {2009}, month = {2009/06/25/}, abstract = {Ten taxa belonging to Chlorophyceae, Cyanophyceae, Bacillariophyceae and Euglenophyceae, and one with an uncertain taxonomic position have been described in this paper. Of these, 10 taxa have been found to be globally rare and new records for Bangladesh, whereas Strombomonas islamii Khondker sp. nov. has been described as new to science.}, isbn = {1028-2092}, doi = {10.3329/bjpt.v16i1.2734}, url = {http://www.banglajol.info/bd/index.php/BJPT/article/viewArticle/2734}, author = {Khondker,Moniruzzaman and Bhuiyan,Rauf Ahmed and Yeasmin,Jenat and Alam,Munirul and Sack,R. Bradley and Huq,Anwar and Rita R Colwell} } @article {15391, title = {Nonlinear Resonant and Chaotic Dynamics in Microwave Assisted Magnetization Switching}, journal = {Magnetics, IEEE Transactions on}, volume = {45}, year = {2009}, month = {2009/10//}, pages = {3950 - 3953}, abstract = {The switching process of a uniformly magnetized magnetic nanoparticle is considered. The particle is subject to applied fields having both dc and linearly-polarized radio-frequency (RF) components. The possibility of using the RF power to obtain a reduced coercivity of the particle is related to the onset of chaotic magnetization dynamics for moderately low values of the RF field amplitude. Perturbation technique for the evaluation of the reduced coercive field is developed and applied to the microwave assisted switching of the particle. Numerical simulations confirm the predictions of the theory.}, keywords = {amplitude;chaotic, components;magnetic, dynamical, dynamics;coercive, dynamics;numerical, field, field;coercivity;linearly-polarized, force;magnetic, magnetization, nanoparticle;microwave-assisted, particles;magnetic, radiofrequency, resonant, RF, simulations;perturbation, switching;nanoparticles;nonlinear, switching;nonlinear, systems;perturbation, technique;chaos;coercive, theory;}, isbn = {0018-9464}, doi = {10.1109/TMAG.2009.2023242}, author = {d{\textquoteright}Aquino,M. and Serpico,C. and Bertotti,G. and Mayergoyz, Issak D and Bonin,R.} } @article {13613, title = {Off-Line Loop Investigation for Handwriting Analysis}, journal = {IEEETransactions on Pattern Analysis and Machine Intelligence}, volume = {31}, year = {2009}, month = {2009/02//}, pages = {193 - 209}, author = {Steinherz,T. and David Doermann and Rivlin,E. and Intrator,N.} } @article {18538, title = {An OpenFlow switch element for Click}, journal = {Symposium on Click Modular Router}, year = {2009}, month = {2009///}, author = {Mundada,Y. and Sherwood,R. and Feamster, Nick} } @conference {14456, title = {Opinion graphs for polarity and discourse classification}, booktitle = {Proceedings of the 2009 Workshop on Graph-based Methods for Natural Language Processing}, series = {TextGraphs-4}, year = {2009}, month = {2009///}, pages = {66 - 74}, publisher = {Association for Computational Linguistics}, organization = {Association for Computational Linguistics}, address = {Stroudsburg, PA, USA}, abstract = {This work shows how to construct discourse-level opinion graphs to perform a joint interpretation of opinions and discourse relations. Specifically, our opinion graphs enable us to factor in discourse information for polarity classification, and polarity information for discourse-link classification. This inter-dependent framework can be used to augment and improve the performance of local polarity and discourse-link classifiers.}, isbn = {978-1-932432-54-1}, url = {http://dl.acm.org/citation.cfm?id=1708124.1708138}, author = {Somasundaran,Swapna and Namata,Galileo and Getoor, Lise and Wiebe,Janyce} } @article {14495, title = {P r DB: managing and exploiting rich correlations in probabilistic databases}, journal = {The VLDB Journal}, volume = {18}, year = {2009}, month = {2009///}, pages = {1065 - 1090}, abstract = {Due to numerous applications producing noisy data, e.g., sensor data, experimental data, data from uncurated sources, information extraction, etc., there has been a surge of interest in the development of probabilistic databases. Most probabilistic database models proposed to date, however, fail to meet the challenges of real-world applications on two counts: (1) they often restrict the kinds of uncertainty that the user can represent; and (2) the query processing algorithms often cannot scale up to the needs of the application. In this work, we define a probabilistic database model, PrDB, that uses graphical models, a state-of-the-art probabilistic modeling technique developed within the statistics and machine learning community, to model uncertain data. We show how this results in a rich, complex yet compact probabilistic database model, which can capture the commonly occurring uncertainty models (tuple uncertainty, attribute uncertainty), more complex models (correlated tuples and attributes) and allows compact representation (shared and schema-level correlations). In addition, we show how query evaluation in PrDB translates into inference in an appropriately augmented graphical model. This allows us to easily use any of a myriad of exact and approximate inference algorithms developed within the graphical modeling community. While probabilistic inference provides a generic approach to solving queries, we show how the use of shared correlations, together with a novel inference algorithm that we developed based on bisimulation, can speed query processing significantly. We present a comprehensive experimental evaluation of the proposed techniques and show that even with a few shared correlations, significant speedups are possible.}, doi = {10.1007/s00778-009-0153-2}, author = {Sen,P. and Deshpande, Amol and Getoor, Lise} } @article {16827, title = {Path oracles for spatial networks}, journal = {Proc. VLDB Endow.}, volume = {2}, year = {2009}, month = {2009/08//}, pages = {1210 - 1221}, abstract = {The advent of location-based services has led to an increased demand for performing operations on spatial networks in real time. The challenge lies in being able to cast operations on spatial networks in terms of relational operators so that they can be performed in the context of a database. A linear-sized construct termed a path oracle is introduced that compactly encodes the n2 shortest paths between every pair of vertices in a spatial network having n vertices thereby reducing each of the paths to a single tuple in a relational database and enables finding shortest paths by repeated application of a single SQL SELECT operator. The construction of the path oracle is based on the observed coherence between the spatial positions of both source and destination vertices and the shortest paths between them which facilitates the aggregation of source and destination vertices into groups that share common vertices or edges on the shortest paths between them. With the aid of the Well-Separated Pair (WSP) technique, which has been applied to spatial networks using the network distance measure, a path oracle is proposed that takes O(sdn) space, where s is empirically estimated to be around 12 for road networks, but that can retrieve an intermediate link in a shortest path in O(logn) time using a B-tree. An additional construct termed the path-distance oracle of size O(n {\textperiodcentered} max(sd, 1/εd)) (empirically (n {\textperiodcentered} max(122, 2.5/ε2))) is proposed that can retrieve an intermediate vertex as well as an ε-approximation of the network distances in O(logn) time using a B-tree. Experimental results indicate that the proposed oracles are linear in n which means that they are scalable and can enable complicated query processing scenarios on massive spatial network datasets.}, isbn = {2150-8097}, url = {http://dl.acm.org/citation.cfm?id=1687627.1687763}, author = {Sankaranarayanan,Jagan and Samet, Hanan and Alborzi,Houman} } @conference {12237, title = {Persona: an online social network with user-defined privacy}, booktitle = {Proceedings of the ACM SIGCOMM 2009 conference on Data communication}, series = {SIGCOMM {\textquoteright}09}, year = {2009}, month = {2009///}, pages = {135 - 146}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Online social networks (OSNs) are immensely popular, with some claiming over 200 million users. Users share private content, such as personal information or photographs, using OSN applications. Users must trust the OSN service to protect personal information even as the OSN provider benefits from examining and sharing that information. We present Persona, an OSN where users dictate who may access their information. Persona hides user data with attribute-based encryption (ABE), allowing users to apply fine-grained policies over who may view their data. Persona provides an effective means of creating applications in which users, not the OSN, define policy over access to private data. We demonstrate new cryptographic mechanisms that enhance the general applicability of ABE. We show how Persona provides the functionality of existing online social networks with additional privacy benefits. We describe an implementation of Persona that replicates Facebook applications and show that Persona provides acceptable performance when browsing privacy-enhanced web pages, even on mobile devices.}, keywords = {ABE, Facebook, OSN, persona, privacy, social networks}, isbn = {978-1-60558-594-9}, doi = {10.1145/1592568.1592585}, url = {http://doi.acm.org/10.1145/1592568.1592585}, author = {Baden,Randy and Bender,Adam and Spring, Neil and Bhattacharjee, Bobby and Starin,Daniel} } @article {12232, title = {Persona : An Online Social Network with User-Defined Privacy Categories and Subject Descriptors}, journal = {Computer}, volume = {39}, year = {2009}, month = {2009///}, pages = {135 - 146}, abstract = {Online social networks (OSNs) are immensely popular, with some claiming over 200 million users. Users share private content, such as personal information or photographs, using OSN applications. Users must trust the OSN service to protect personal information even as the OSN provider benefits from examining and sharing that information. We present Persona, an OSN where users dictate who may access their information. Persona hides user data with attribute-based encryption (ABE), allowing users to apply fine-grained policies over who may view their data. Persona provides an effective means of creating applications in which users, not the OSN, define policy over access to private data. We demonstrate new cryptographic mechanisms that enhance the general applicability of ABE. We show how Persona provides the functionality of existing online social networks with additional privacy benefits. We describe an implementation of Persona that replicates Facebook applications and show that Persona provides acceptable performance when browsing privacy-enhanced web pages, even on mobile devices.}, doi = {10.1145/1594977.1592585}, author = {Starin,Daniel and Baden,Randy and Bender,Adam and Spring, Neil and Bhattacharjee, Bobby} } @inbook {18916, title = {Planning for Interactions among Autonomous Agents}, booktitle = {Programming Multi-Agent Systems}, series = {Lecture Notes in Computer Science}, volume = {5442}, year = {2009}, month = {2009///}, pages = {1 - 23}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {AI planning research has traditionally focused on offline pl- anning for static single-agent environments. In environments where an agent needs to plan its interactions with other autonomous agents, planning is much more complicated, because the actions of the other agents can induce a combinatorial explosion in the number of contingencies that the planner will need to consider. This paper discusses several ways to alleviate the combinatorial explosion, and illustrates their use in several different kinds of multi-agent planning domains.}, keywords = {Computer science}, isbn = {978-3-642-03277-6}, url = {http://www.springerlink.com/content/j258015ux2p38383/abstract/}, author = {Au,Tsz-Chiu and Kuter,Ugur and Nau, Dana S.}, editor = {Hindriks,Koen and Pokahr,Alexander and Sardina,Sebastian} } @article {15704, title = {A Polynomial-Time Interior-Point Method for Conic Optimization, with Inexact Barrier Evaluations}, journal = {SIAM Journal on Optimization}, volume = {20}, year = {2009}, month = {2009///}, pages = {548 - 571}, doi = {DOI: 10.1137/080722825}, author = {Schurr,Simon P. and O{\textquoteright}Leary, Dianne P. and Tits,Andre{\textquoteright} L.} } @article {19648, title = {A practical algorithm for finding maximal exact matches in large sequence datasets using sparse suffix arrays}, journal = {Bioinformatics}, volume = {25}, year = {2009}, month = {2009/07/01/}, pages = {1609 - 1616}, abstract = {Motivation: High-throughput sequencing technologies place ever increasing demands on existing algorithms for sequence analysis. Algorithms for computing maximal exact matches (MEMs) between sequences appear in two contexts where high-throughput sequencing will vastly increase the volume of sequence data: (i) seeding alignments of high-throughput reads for genome assembly and (ii) designating anchor points for genome{\textendash}genome comparisons.Results: We introduce a new algorithm for finding MEMs. The algorithm leverages a sparse suffix array (SA), a text index that stores every K-th position of the text. In contrast to a full text index that stores every position of the text, a sparse SA occupies much less memory. Even though we use a sparse index, the output of our algorithm is the same as a full text index algorithm as long as the space between the indexed suffixes is not greater than a minimum length of a MEM. By relying on partial matches and additional text scanning between indexed positions, the algorithm trades memory for extra computation. The reduced memory usage makes it possible to determine MEMs between significantly longer sequences. Availability: Source code for the algorithm is available under a BSD open source license at http://compbio.cs.princeton.edu/mems. The implementation can serve as a drop-in replacement for the MEMs algorithm in MUMmer 3. Contact: zkhan@cs.princeton.edu;mona@cs.princeton.edu Supplementary information: Supplementary data are available at Bioinformatics online. }, isbn = {1367-4803, 1460-2059}, url = {http://bioinformatics.oxfordjournals.org/content/25/13/1609}, author = {Zia Khan and Bloom, Joshua S. and Kruglyak, Leonid and Singh, Mona} } @article {13394, title = {PrDB: managing and exploiting rich correlations in probabilistic databases}, journal = {The VLDB Journal}, volume = {18}, year = {2009}, month = {2009///}, pages = {1065 - 1090}, abstract = {Due to numerous applications producing noisy data, e.g., sensor data, experimental data, data from uncurated sources, information extraction, etc., there has been a surge of interest in the development of probabilistic databases. Most probabilistic database models proposed to date, however, fail to meet the challenges of real-world applications on two counts: (1) they often restrict the kinds of uncertainty that the user can represent; and (2) the query processing algorithms often cannot scale up to the needs of the application. In this work, we define a probabilistic database model, P r DB, that uses graphical models, a state-of-the-art probabilistic modeling technique developed within the statistics and machine learning community, to model uncertain data. We show how this results in a rich, complex yet compact probabilistic database model, which can capture the commonly occurring uncertainty models (tuple uncertainty, attribute uncertainty), more complex models (correlated tuples and attributes) and allows compact representation (shared and schema-level correlations). In addition, we show how query evaluation in P r DB translates into inference in an appropriately augmented graphical model. This allows us to easily use any of a myriad of exact and approximate inference algorithms developed within the graphical modeling community. While probabilistic inference provides a generic approach to solving queries, we show how the use of shared correlations, together with a novel inference algorithm that we developed based on bisimulation, can speed query processing significantly. We present a comprehensive experimental evaluation of the proposed techniques and show that even with a few shared correlations, significant speedups are possible.}, isbn = {1066-8888}, url = {http://dx.doi.org/10.1007/s00778-009-0153-2}, author = {Sen,Prithviraj and Deshpande, Amol and Getoor, Lise} } @inbook {19041, title = {Predicate Privacy in Encryption Systems}, booktitle = {Theory of Cryptography}, series = {Lecture Notes in Computer Science}, volume = {5444}, year = {2009}, month = {2009}, pages = {457 - 473}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {Predicate encryption is a new encryption paradigm which gives a master secret key owner fine-grained control over access to encrypted data. The master secret key owner can generate secret key tokens corresponding to predicates. An encryption of data x can be evaluated using a secret token corresponding to a predicate f ; the user learns whether the data satisfies the predicate, i.e., whether f ( x ) = 1. Prior work on public-key predicate encryption has focused on the notion of data or plaintext privacy, the property that ciphertexts reveal no information about the encrypted data to an attacker other than what is inherently revealed by the tokens the attacker possesses. In this paper, we consider a new notion called predicate privacy , the property that tokens reveal no information about the encoded query predicate. Predicate privacy is inherently impossible to achieve in the public-key setting and has therefore received little attention in prior work. In this work, we consider predicate encryption in the symmetric-key setting and present a symmetric-key predicate encryption scheme which supports inner product queries. We prove that our scheme achieves both plaintext privacy and predicate privacy.}, keywords = {Computer science}, isbn = {978-3-642-00456-8}, url = {http://www.springerlink.com/content/1717x5445k4718rp/abstract/}, author = {Shen, Emily and Elaine Shi and Waters,Brent}, editor = {Reingold, Omer} } @conference {15486, title = {Prioritizing component compatibility tests via user preferences}, booktitle = {Software Maintenance, 2009. ICSM 2009. IEEE International Conference on}, year = {2009}, month = {2009/09//}, pages = {29 - 38}, abstract = {Many software systems rely on third-party components during their build process. Because the components are constantly evolving, quality assurance demands that developers perform compatibility testing to ensure that their software systems build correctly over all deployable combinations of component versions, also called configurations. However, large software systems can have many configurations, and compatibility testing is often time and resource constrained. We present a prioritization mechanism that enhances compatibility testing by examining the ldquomost importantrdquo configurations first, while distributing the work over a cluster of computers. We evaluate our new approach on two large scientific middleware systems and examine tradeoffs between the new prioritization approach and a previously developed lowest-cost-configuration-first approach.}, keywords = {compatibility testing prioritization, component configurations, computer clusters, Middleware, Middleware systems, object-oriented programming, program testing, software engineering, Software systems, third-party components, user preferences}, doi = {10.1109/ICSM.2009.5306357}, author = {Yoon,Il-Chul and Sussman, Alan and Memon, Atif M. and Porter, Adam} } @conference {17329, title = {Promoting social creativity: a component of a national initiative for social participation}, booktitle = {Proceedings of the seventh ACM conference on Creativity and cognition}, series = {C\&$\#$38;C {\textquoteright}09}, year = {2009}, month = {2009///}, pages = {7 - 8}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {This panel will discuss group processes that promote social creativity in science, engineering, arts, and humanities. We will offer positive and negative examples of social creativity projects, while suggesting research directions for dramatically increased social participation. The goal is to develop strategies that would expand resources and opportunities for research and education in social creativity. This requires our community to develop a unified position, then reach out to national science funding agencies, while building the case for the importance of this topic beyond our own community. How can social creativity, collaborative discovery, distributed innovation, and collective intelligence be framed as an international priority to cope with the problems of the 21st century and how can we identify a clear set of research challenges? The theme of technology-mediated social participation is outlined in the white paper for a National Initiative for Social Participation (http://iparticipate.wikispaces.com). The white paper suggests that successful research challenges should have three key elements: (1) compelling national need (healthcare, national security, community safety, education, innovation, cultural heritage, energy sustainability, environmental protection, etc.), (2) scientific foundation based on established theories and well-defined research questions (privacy, reciprocity, trust, motivation, recognition, etc.), and (3) computer science research challenges (security, privacy protection, scalability, visualization, end-user development, distributed data handling for massive user-generated content, network analysis of community evolution, cross network comparison, etc.). We seek recommendations for ways to increase the resources and attention for this field. We hope to inspire: universities to change course content, add courses, and offer new degree programs industry to help researchers on social creativity government to support these ideas and try them out in government applications scientists and artists to open themselves to more social/collaborative approaches}, keywords = {research agenda, social creativity, social participation}, isbn = {978-1-60558-865-0}, doi = {10.1145/1640233.1640237}, url = {http://doi.acm.org/10.1145/1640233.1640237}, author = {Shneiderman, Ben and Churchill,Elizabeth and Fischer,Gerhard and Goldberg,Ken} } @article {19667, title = {Protein quantification across hundreds of experimental conditions}, journal = {Proceedings of the National Academy of Sciences}, volume = {106}, year = {2009}, month = {2009/09/15/}, pages = {15544 - 15548}, abstract = {Quantitative studies of protein abundance rarely span more than a small number of experimental conditions and replicates. In contrast, quantitative studies of transcript abundance often span hundreds of experimental conditions and replicates. This situation exists, in part, because extracting quantitative data from large proteomics datasets is significantly more difficult than reading quantitative data from a gene expression microarray. To address this problem, we introduce two algorithmic advances in the processing of quantitative proteomics data. First, we use space-partitioning data structures to handle the large size of these datasets. Second, we introduce techniques that combine graph-theoretic algorithms with space-partitioning data structures to collect relative protein abundance data across hundreds of experimental conditions and replicates. We validate these algorithmic techniques by analyzing several datasets and computing both internal and external measures of quantification accuracy. We demonstrate the scalability of these techniques by applying them to a large dataset that comprises a total of 472 experimental conditions and replicates.}, keywords = {kd-tree, orthogonal range query, quantitative proteomics, space partitioning data structures, tandem mass spectrometry}, isbn = {0027-8424, 1091-6490}, url = {http://www.pnas.org/content/106/37/15544}, author = {Zia Khan and Bloom, Joshua S. and Garcia, Benjamin A. and Singh, Mona and Kruglyak, Leonid} } @article {16061, title = {Querying timestamped event sequences by exact search or similarity-based search: design and empirical evaluation}, volume = {HCIL-2009-20}, year = {2009}, month = {2009///}, institution = {Human-Computer Interaction Lab, University of Maryland}, author = {Wongsuphasawat,K. and Plaisant, Catherine and Shneiderman, Ben} } @conference {17636, title = {On random sampling auctions for digital goods}, booktitle = {Proceedings of the 10th ACM conference on Electronic commerce}, series = {EC {\textquoteright}09}, year = {2009}, month = {2009///}, pages = {187 - 196}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {In the context of auctions for digital goods, an interesting Random Sampling Optimal Price auction (RSOP) has been proposed by Goldberg, Hartline and Wright; this leads to a truthful mechanism. Since random sampling is a popular approach for auctions that aims to maximize the seller{\textquoteright}s revenue, this method has been analyzed further by Feige, Flaxman, Hartline and Kleinberg, who have shown that it is 15-competitive in the worst case -- which is substantially better than the previously proved bounds but still far from the conjectured competitive ratio of 4. In this paper, we prove that RSOP is indeed 4-competitive for a large class of instances in which the number λ of bidders receiving the item at the optimal uniform price, is at least 6. We also show that it is 4.68 competitive for the small class of remaining instances thus leaving a negligible gap between the lower and upper bound. Furthermore, we develop a robust version of RSOP -- one in which the seller{\textquoteright}s revenue is, with high probability, not much below its mean -- when the above parameter λ grows large. We employ a mix of probabilistic techniques and dynamic programming to compute these bounds.}, keywords = {auction, mechanism design, random sampling}, isbn = {978-1-60558-458-4}, doi = {10.1145/1566374.1566402}, url = {http://doi.acm.org/10.1145/1566374.1566402}, author = {Alaei,Saeed and Malekian,Azarakhsh and Srinivasan, Aravind} } @article {12515, title = {Rate-Invariant Recognition of Humans and Their Activities}, journal = {Image Processing, IEEE Transactions on}, volume = {18}, year = {2009}, month = {2009/06//}, pages = {1326 - 1339}, abstract = {Pattern recognition in video is a challenging task because of the multitude of spatio-temporal variations that occur in different videos capturing the exact same event. While traditional pattern-theoretic approaches account for the spatial changes that occur due to lighting and pose, very little has been done to address the effect of temporal rate changes in the executions of an event. In this paper, we provide a systematic model-based approach to learn the nature of such temporal variations (time warps) while simultaneously allowing for the spatial variations in the descriptors. We illustrate our approach for the problem of action recognition and provide experimental justification for the importance of accounting for rate variations in action recognition. The model is composed of a nominal activity trajectory and a function space capturing the probability distribution of activity-specific time warping transformations. We use the square-root parameterization of time warps to derive geodesics, distance measures, and probability distributions on the space of time warping functions. We then design a Bayesian algorithm which treats the execution rate function as a nuisance variable and integrates it out using Monte Carlo sampling, to generate estimates of class posteriors. This approach allows us to learn the space of time warps for each activity while simultaneously capturing other intra- and interclass variations. Next, we discuss a special case of this approach which assumes a uniform distribution on the space of time warping functions and show how computationally efficient inference algorithms may be derived for this special case. We discuss the relative advantages and disadvantages of both approaches and show their efficacy using experiments on gait-based person identification and activity recognition.}, keywords = {Automated;Video Recording;, Bayesian algorithm;Monte Carlo sampling;action recognition;activity-specific time warping transformations;computationally efficient inference algorithms;distance measures;execution rate function;function space;gait-based person identification;geodesics;no, Statistical;Monte Carlo Method;Movement;Pattern Recognition}, isbn = {1057-7149}, doi = {10.1109/TIP.2009.2017143}, author = {Veeraraghavan,A. and Srivastava, A. and Roy-Chowdhury, A.K. and Chellapa, Rama} } @article {17421, title = {The reader-to-leader framework: Motivating technology-mediated social participation}, journal = {AIS Transactions on Human-Computer Interaction}, volume = {1}, year = {2009}, month = {2009///}, pages = {13 - 32}, abstract = {Billions of people participate in online social activities. Most users participate as readers of discussion boards, searchers of blogposts, or viewers of photos. A fraction of users become contributors of user-generated content by writing consumer product reviews, uploading travel photos, or expressing political opinions. Some users move beyond such individual efforts to become collaborators, forming tightly connected groups with lively discussions whose outcome might be a Wikipedia article or a carefully edited YouTube video. A small fraction of users becomes leaders, who participate in governance by setting and upholding policies, repairing vandalized materials, or mentoring novices. We analyze these activities and offer the Reader-to-Leader Framework with the goal of helping researchers, designers, and managers understand what motivates technology-mediated social participation. This will enable them to improve interface design and social support for their companies, government agencies, and non-governmental organizations. These improvements could reduce the number of failed projects, while accelerating the application of social media for national priorities such as healthcare, energy sustainability, emergency response, economic development, education, and more. }, author = {Preece,J. and Shneiderman, Ben} } @article {15116, title = {Reducing complexity assumptions for statistically-hiding commitment}, journal = {Journal of cryptology}, volume = {22}, year = {2009}, month = {2009///}, pages = {283 - 310}, abstract = {We revisit the following question: what are the minimal assumptions needed to construct statistically-hiding commitment schemes? Naor et al. show how to construct such schemes based on any one-way permutation. We improve upon this by showing a construction based on any approximable preimage-size one-way function. These are one-way functions for which it is possible to efficiently approximate the number of pre-images of a given output. A special case is the class of regular one-way functions where all points in the image of the function have the same (known) number of pre-images.We also prove two additional results related to statistically-hiding commitment. First, we prove a (folklore) parallel composition theorem showing, roughly speaking, that the statistical hiding property of any such commitment scheme is amplified exponentially when multiple independent parallel executions of the scheme are carried out. Second, we show a compiler which transforms any commitment scheme which is statistically hiding against an honest-but-curious receiver into one which is statistically hiding even against a malicious receiver. }, doi = {10.1007/s00145-007-9012-8}, author = {Haitner,I. and Horvitz,O. and Katz, Jonathan and Koo,C. Y and Morselli,R. and Shaltiel,R.} } @article {15274, title = {Revealing biological modules via graph summarization}, journal = {Journal of Computational Biology}, volume = {16}, year = {2009}, month = {2009///}, pages = {253 - 264}, author = {Navlakha,S. and Schatz,M. C and Kingsford, Carl} } @article {16828, title = {Review of Spatial Databases and Geographic Information Systems}, journal = {Proceedings of the 17th Italian Symposium on Advanced Database Systems (SEBD{\textquoteright}09)}, volume = {23}, year = {2009}, month = {2009/06//}, pages = {26 - 26}, author = {Samet, Hanan} } @conference {17653, title = {Rigorous Probabilistic Trust-Inference with Applications to Clustering}, booktitle = {IEEE/WIC/ACM International Joint Conferences on Web Intelligence and Intelligent Agent Technologies, 2009. WI-IAT {\textquoteright}09}, volume = {1}, year = {2009}, month = {2009/09/15/18}, pages = {655 - 658}, publisher = {IEEE}, organization = {IEEE}, abstract = {The World Wide Web has transformed into an environment where users both produce and consume information. In order to judge the validity of information, it is important to know how trustworthy its creator is. Since no individual can have direct knowledge of more than a small fraction of information authors, methods for inferring trust are needed. We propose a new trust inference scheme based on the idea that a trust network can be viewed as a random graph, and a chain of trust as a path in that graph. In addition to having an intuitive interpretation, our algorithm has several advantages, noteworthy among which is the creation of an inferred trust-metric space where the shorter the distance between two people, the higher their trust. Metric spaces have rigorous algorithms for clustering, visualization, and related problems, any of which is directly applicable to our results.}, keywords = {Clustering algorithms, Conferences, Educational institutions, Extraterrestrial measurements, Inference algorithms, Intelligent agent, random graphs, Social network services, trust inferrence, Visualization, Voting, Web sites}, isbn = {978-0-7695-3801-3}, doi = {10.1109/WI-IAT.2009.109}, author = {DuBois,Thomas and Golbeck,Jennifer and Srinivasan, Aravind} } @article {12529, title = {Robust human detection under occlusion by integrating face and person detectors}, journal = {Proceedings of the Third International Conference on Advances in Biometrics}, year = {2009}, month = {2009///}, pages = {970 - 979}, abstract = {Human detection under occlusion is a challenging problemin computer vision. We address this problem through a framework which integrates face detection and person detection. We first investigate how the response of a face detector is correlated with the response of a person detector. From these observations, we formulate hypotheses that capture the intuitive feedback between the responses of face and person detectors and use it to verify if the individual detectors{\textquoteright} outputs are true or false. We illustrate the performance of our integration framework on challeng- ing images that have considerable amount of occlusion, and demonstrate its advantages over individual face and person detectors. }, author = {Schwartz, W.R. and Gopalan,R. and Chellapa, Rama and Davis, Larry S.} } @article {13971, title = {Scaling kernel machine learning algorithm via the use of GPUs}, journal = {GPU Technology Conference}, year = {2009}, month = {2009///}, author = {Srinivasan,B.V. and Duraiswami, Ramani} } @article {13114, title = {Scene it or not? incremental multiple kernel learning for object detection}, journal = {Proceedings of the International Conference on Computer Vision}, year = {2009}, month = {2009///}, author = {Kembhavi,A. and Siddiquie,B. and Miezianko,R. and McCloskey,S. and Davis, Larry S. and Schwartz, W.R. and Harwood,D. and Gupta,A. and Farrell,R. and Luo,Y. and others} } @article {17655, title = {Scheduling on Unrelated Machines under Tree-Like Precedence Constraints}, journal = {Algorithmica}, volume = {55}, year = {2009}, month = {2009///}, pages = {205 - 226}, abstract = {We present polylogarithmic approximations for the R | prec | C max and R | prec |∑ j w j C j problems, when the precedence constraints are {\textquotedblleft}treelike{\textquotedblright}{\textemdash}i.e., when the undirected graph underlying the precedences is a forest. These are the first non-trivial generalizations of the job shop scheduling problem to scheduling with precedence constraints that are not just chains. These are also the first non-trivial results for the weighted completion time objective on unrelated machines with precedence constraints of any kind . We obtain improved bounds for the weighted completion time and flow time for the case of chains with restricted assignment{\textemdash}this generalizes the job shop problem to these objective functions. We use the same lower bound of {\textquotedblleft}congestion + dilation{\textquotedblright}, as in other job shop scheduling approaches (e.g. Shmoys, Stein and Wein, SIAM J. Comput. 23, 617{\textendash}632, 1994 ). The first step in our algorithm for the R | prec | C max problem with treelike precedences involves using the algorithm of Lenstra, Shmoys and Tardos to obtain a processor assignment with the congestion + dilation value within a constant factor of the optimal. We then show how to generalize the random-delays technique of Leighton, Maggs and Rao to the case of trees. For the special case of chains, we show a dependent rounding technique which leads to a bicriteria approximation algorithm for minimizing the flow time, a notoriously hard objective function.}, isbn = {0178-4617}, url = {http://dx.doi.org/10.1007/s00453-007-9004-y}, author = {Anil Kumar,V. and Marathe,Madhav and Parthasarathy,Srinivasan and Srinivasan, Aravind} } @conference {12154, title = {Scope error detection and handling concerning software estimation models}, booktitle = {Proceedings of the 2009 3rd International Symposium on Empirical Software Engineering and Measurement}, series = {ESEM {\textquoteright}09}, year = {2009}, month = {2009///}, pages = {123 - 132}, publisher = {IEEE Computer Society}, organization = {IEEE Computer Society}, address = {Washington, DC, USA}, abstract = {Over the last 25+ years, the software community has been searching for the best models for estimating variables of interest (e.g., cost, defects, and fault proneness). However, little research has been done to improve the reliability of the estimates. Over the last decades, scope error and error analysis have been substantially ignored by the community. This work attempts to fill this gap in the research and enhance a common understanding within the community. Results provided in this study can eventually be used to support human judgment-based techniques and be an addition to the portfolio. The novelty of this work is that, we provide a way of detecting and handling the scope error arising from estimation models. The answer whether or not scope error will occur is a pre-condition to safe use of an estimation model. We also provide a handy procedure for dealing with outliers as to whether or not to include them in the training set for building a new version of the estimation model. The majority of the work is empirically based, applying computational intelligence techniques to some COCOMO model variations with respect to a publicly available cost estimation data set in the PROMISE repository.}, isbn = {978-1-4244-4842-5}, doi = {10.1109/ESEM.2009.5316020}, url = {http://dx.doi.org/10.1109/ESEM.2009.5316020}, author = {Sarcia,Salvatore Alessandro and Basili, Victor R. and Cantone,Giovanni} } @conference {15023, title = {Search and Access Strategies for Web Archives}, booktitle = {Proceedings of IS\&T Archiving 2009}, year = {2009}, month = {2009///}, author = {Song,Sangchul and JaJa, Joseph F.} } @article {16283, title = {Searching for SNPs with cloud computing}, journal = {Genome Biology}, volume = {10}, year = {2009}, month = {2009/11/20/}, pages = {R134 - R134}, abstract = {As DNA sequencing outpaces improvements in computer speed, there is a critical need to accelerate tasks like alignment and SNP calling. Crossbow is a cloud-computing software tool that combines the aligner Bowtie and the SNP caller SOAPsnp. Executing in parallel using Hadoop, Crossbow analyzes data comprising 38-fold coverage of the human genome in three hours using a 320-CPU cluster rented from a cloud computing service for about $85. Crossbow is available from http://bowtie-bio.sourceforge.net/crossbow/.}, isbn = {1465-6906}, doi = {10.1186/gb-2009-10-11-r134}, url = {http://genomebiology.com/2009/10/11/R134}, author = {Langmead,Ben and Schatz,Michael C and Jimmy Lin and Pop, Mihai and Salzberg,Steven L.} } @conference {18275, title = {Secure image retrieval through feature protection}, booktitle = {Acoustics, Speech and Signal Processing, 2009. ICASSP 2009. IEEE International Conference on}, year = {2009}, month = {2009/04//}, pages = {1533 - 1536}, abstract = {This paper addresses the problem of image retrieval from an encrypted database, where data confidentiality is preserved both in the storage and retrieval process. The paper focuses on image feature protection techniques which enable similarity comparison among protected features. By utilizing both signal processing and cryptographic techniques, three schemes are investigated and compared, including bit-plane randomization, random projection, and randomized unary encoding. Experimental results show that secure image retrieval can achieve comparable retrieval performance to conventional image retrieval techniques without revealing information about image content. This work enriches the area of secure information retrieval and can find applications in secure online services for images and videos.}, keywords = {bit-plane, confidentiality;data, database;image, databases;, encoding;signal, extraction;image, feature, processes;visual, processing;content-based, projection;randomized, protection;image, randomization;cryptographic, retrieval;cryptography;feature, retrieval;random, storage;encrypted, technique;data, unary}, doi = {10.1109/ICASSP.2009.4959888}, author = {Lu,Wenjun and Varna,A.L. and Swaminathan,A. and M. Wu} } @article {17725, title = {On the Semidefinite B-Arnoldi Method}, journal = {SIAM Journal on Matrix Analysis and Applications}, volume = {31}, year = {2009}, month = {2009///}, pages = {1458 - 1468}, abstract = {The B-Arnoldi method is a variant of the ordinary Arnoldi method in which orthogonalization is done with respect to the inner product generated by a positive definite matrix $B$. It arises in connection with the generalized eigenvalue problem $Ax = \lambda Bx$. When $B$ is semidefinite, the algorithm can proceed formally, with {\textquotedblleft}orthogonalization{\textquotedblright} taking place in the semi-inner product generated by $B$. However, it has been observed that components of the Arnoldi vectors lying in the null space of $B$ can grow rapidly. In this paper we examine the source and consequences of this growth.}, keywords = {Arnoldi{\textquoteright}s method, B-inner product, null-space component, semidefinite B}, doi = {10.1137/090759252}, url = {http://link.aip.org/link/?SML/31/1458/1}, author = {Stewart, G.W.} } @article {12882, title = {Serogroup, Virulence, and Genetic Traits of Vibrio Parahaemolyticus in the Estuarine Ecosystem of Bangladesh}, journal = {Applied and Environmental MicrobiologyAppl. Environ. Microbiol.}, volume = {75}, year = {2009}, month = {2009/10/01/}, pages = {6268 - 6274}, abstract = {Forty-two strains of Vibrio parahaemolyticus were isolated from Bay of Bengal estuaries and, with two clinical strains, analyzed for virulence, phenotypic, and molecular traits. Serological analysis indicated O8, O3, O1, and K21 to be the major O and K serogroups, respectively, and O8:K21, O1:KUT, and O3:KUT to be predominant. The K antigen(s) was untypeable, and pandemic serogroup O3:K6 was not detected. The presence of genes toxR and tlh were confirmed by PCR in all but two strains, which also lacked toxR. A total of 18 (41\%) strains possessed the virulence gene encoding thermostable direct hemolysin (TDH), and one had the TDH-related hemolysin (trh) gene, but not tdh. Ten (23\%) strains exhibited Kanagawa phenomenon that surrogates virulence, of which six, including the two clinical strains, possessed tdh. Of the 18 tdh-positive strains, 17 (94\%), including the two clinical strains, had the seromarker O8:K21, one was O9:KUT, and the single trh-positive strain was O1:KUT. None had the group-specific or ORF8 pandemic marker gene. DNA fingerprinting employing pulsed-field gel electrophoresis (PFGE) of SfiI-digested DNA and cluster analysis showed divergence among the strains. Dendrograms constructed using PFGE (SfiI) images from a soft database, including those of pandemic and nonpandemic strains of diverse geographic origin, however, showed that local strains formed a cluster, i.e., {\textquotedblleft}clonal cluster,{\textquotedblright} as did pandemic strains of diverse origin. The demonstrated prevalence of tdh-positive and diarrheagenic serogroup O8:K21 strains in coastal villages of Bangladesh indicates a significant human health risk for inhabitants.}, isbn = {0099-2240, 1098-5336}, doi = {10.1128/AEM.00266-09}, url = {http://aem.asm.org/content/75/19/6268}, author = {Alam,Munirul and Chowdhury,Wasimul B. and Bhuiyan,N. A. and Islam,Atiqul and Hasan,Nur A. and Nair,G. Balakrish and Watanabe,H. and Siddique,A. K. and Huq,Anwar and Sack,R. Bradley and Akhter,M. Z. and Grim,Christopher J. and Kam,K.-M. and Luey,C. K. Y. and Endtz,Hubert P. and Cravioto,Alejandro and Rita R Colwell} } @mastersthesis {17358, title = {Shape Identification in Temporal Data Sets}, year = {2009}, month = {2009///}, school = {Master{\textquoteright}s thesis, University of Maryland}, abstract = {Shapes are a concise way to describe temporal variable behaviors.Some commonly used shapes are spikes, sinks, rises, and drops. A spike describes a set of variable values that rapidly increase, then immediately rapidly decrease. The variable may be the value of a stock or a person{\textquoteright}s blood sugar levels. Shapes are abstract. Details such as the height of spike or its rate increase, are lost in the ab- straction. These hidden details make it difficult to define shapes and compare one to another. For example, what attributes of a spike determine its {\textquotedblleft}spikiness{\textquotedblright}? The ability to define and com- pare shapes is important because it allows shapes to be identified and ranked, according to an attribute of interest. Work has been done in the area of shape identification through pattern matching and other data mining techniques, but ideas combining the identifi- cation and comparison of shapes have received less attention. This paper fills the gap by presenting a set of shapes and the attributes by which they can identified, compared, and ranked. Neither the set of shapes, nor their attributes presented in this paper are exhaustive, but it provides an example of how a shape{\textquoteright}s attributes can be used for identification and comparison. The intention of this paper is not to replace any particular mathematical method of identifying a par- ticular behavior, but to provide a toolset for knowledge discovery and an intuitive method of data mining for novices. Spikes, sinks, rises, drops, lines, plateaus, valleys, and gaps are the shapes pre- sented in this paper. Several attributes for each shape are defined. These attributes will be the basis for constructing definitions that allow the shapes to be identified and ranked. The second contri- bution is an information visualization tool, TimeSearcher: Shape Search Edition (SSE), which allows users to explore data sets using the identification and ranking ideas in this paper. }, author = {Gregory,M.B. and Shneiderman, Ben} } @article {16831, title = {Sorting Spatial Data by Spatial Occupancy}, journal = {GeoSpatial Visual Analytics}, year = {2009}, month = {2009///}, pages = {31 - 43}, abstract = {The increasing popularity of web-based mapping services such as Microsoft Virtual Earth and Google Maps/Earth has led to a dramatic increase in awareness of the importance of location as a component of data for the purposes of further processing as a means of enhancing the value of the nonspatial data and of visualization. Both of these purposes inevitably involve searching. The efficiency of searching is dependent on the extent to which the underlying data is sorted. The sorting is encapsulated by the data structure known as an index that is used to represent the spatial data thereby making it more accessible. The traditional role of the indexes is to sort the data, which means that they order the data. However, since generally no ordering exists in dimensions greater than 1 without a transformation of the data to one dimension, the role of the sort process is one of differentiating between the data and what is usually done is to sort the spatial objects with respect to the space that they occupy. The resulting ordering should be implicit rather than explicit so that the data need not be resorted (i.e., the index need not be rebuilt) when the queries change. The indexes are said to order the space and the characteristics of such indexes are explored further.}, doi = {10.1007/978-90-481-2899-0_3}, author = {Samet, Hanan} } @conference {16833, title = {Spatio-textual spreadsheets: geotagging via spatial coherence}, booktitle = {Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems}, series = {GIS {\textquoteright}09}, year = {2009}, month = {2009///}, pages = {524 - 527}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {The spatio-textual spreadsheet is a conventional spreadsheet where spatial attribute values are specified textually. Techniques are presented to automatically find the textually-specified spatial attributes that are present in spreadsheets. Once the spatial attributes have been identified, an accurate translation of the values of the spatial attributes to their actual geographic locations is needed (known as geotagging). The key observation is that spreadsheets with spatial data exhibit spatial coherence --- that is, cells with spatial data that are nearby in the spreadsheet contain data that share spatial characteristics in the real world. These techniques also allow richer search engine results by returning actual tuples from spreadsheets instead of simply links to the spreadsheets. Moreover, when the search key is a particular location, results in proximity to the query can be provided rather than just exact matches.}, keywords = {geotagging, spatial coherence, spatio-textual, spreadsheets}, isbn = {978-1-60558-649-6}, doi = {10.1145/1653771.1653860}, url = {http://doi.acm.org/10.1145/1653771.1653860}, author = {Lieberman,Michael D. and Samet, Hanan and Sankaranarayanan,Jagan and Sperling,Jon} } @article {17754, title = {SPOT Databases: Efficient Consistency Checking and Optimistic Selection in Probabilistic Spatial Databases}, journal = {Knowledge and Data Engineering, IEEE Transactions on}, volume = {21}, year = {2009}, month = {2009/01//}, pages = {92 - 107}, abstract = {Spatial probabilistic temporal (SPOT) databases are a paradigm for reasoning with probabilistic statements about where a vehicle may be now or in the future. They express statements of the form "Object O is in spatial region R at some time t with some probability in the interval [L,U]." Past work on SPOT databases has developed selection operators based on selecting SPOT atoms that are entailed by the SPOT database-we call this "cautious" selection. In this paper, we study several problems. First, we note that the runtime of consistency checking and cautious selection algorithms in past work is influenced greatly by the granularity of the underlying Cartesian space. In this paper, we first introduce the notion of "optimistic" selection, where we are interested in returning all SPOT atoms in a database that are consistent with respect to a query, rather than having an entailment relationship. We then develop an approach to scaling SPOT databases that has three main contributions: 1) We develop methods to eliminate variables from the linear programs used in past work, thus greatly reducing the size of the linear programs used-the resulting advances apply to consistency checking, optimistic selection, and cautious selection. 2) We develop a host of theorems to show how we can prune the search space when we are interested in optimistic selection. 3) We use the above contributions to build an efficient index to execute optimistic selection queries over SPOT databases. Our approach is superior to past work in two major respects: First, it makes fewer assumptions than all past works on this topic except that in. Second, our experiments, which are based on real-world data about ship movements, show that our algorithms are much more efficient than those in.}, keywords = {Cartesian, checking;database, database;data, databases;, databases;visual, indexing;inference, indexing;linear, integrity;database, mechanisms;linear, probabilistic, problem;spatial, problems;temporal, processing;search, program;optimistic, programming;probability;query, query;probabilistic, reasoning;search, selection, selection;consistency, space;cautious, temporal}, isbn = {1041-4347}, doi = {10.1109/TKDE.2008.93}, author = {Parker,A. and Infantes,G. and Grant,J. and V.S. Subrahmanian} } @article {18721, title = {Structure of the S5a:K48-Linked Diubiquitin Complex and Its Interactions with Rpn13}, journal = {Molecular Cell}, volume = {35}, year = {2009}, month = {2009/08/14/}, pages = {280 - 290}, abstract = {SummaryDegradation by the proteasome typically requires substrate ubiquitination. Two ubiquitin receptors exist in the proteasome, S5a/Rpn10 and Rpn13. Whereas Rpn13 has only one ubiquitin-binding surface, S5a binds ubiquitin with two independent ubiquitin-interacting motifs (UIMs). Here, we use nuclear magnetic resonance (NMR) and analytical ultracentrifugation to define at atomic level resolution how S5a binds K48-linked diubiquitin, in which K48 of~one ubiquitin subunit (the {\textquotedblleft}proximal{\textquotedblright} one) is covalently bonded to G76 of the other (the {\textquotedblleft}distal{\textquotedblright} subunit). We demonstrate that S5a{\textquoteright}s UIMs bind the two subunits simultaneously with a preference for UIM2 binding to the proximal subunit while UIM1 binds to the distal one. In addition, NMR experiments reveal that Rpn13 and S5a bind K48-linked diubiquitin simultaneously with subunit specificity, and a model structure of S5a and Rpn13 bound to K48-linked polyubiquitin is provided. Altogether, our data demonstrate that S5a is highly adaptive and cooperative toward binding ubiquitin chains. }, keywords = {Proteins}, isbn = {1097-2765}, doi = {10.1016/j.molcel.2009.06.010}, url = {http://www.sciencedirect.com/science/article/pii/S1097276509004018}, author = {Zhang,Naixia and Wang,Qinghua and Ehlinger,Aaron and Randles,Leah and Lary,Jeffrey W. and Kang,Yang and Haririnia,Aydin and Storaska,Andrew J. and Cole,James L. and Fushman, David and Walters,Kylie J.} } @conference {14455, title = {Supervised and unsupervised methods in employing discourse relations for improving opinion polarity classification}, booktitle = {Proceedings of the 2009 Conference on Empirical Methods in Natural Language Processing: Volume 1 - Volume 1}, series = {EMNLP {\textquoteright}09}, year = {2009}, month = {2009///}, pages = {170 - 179}, publisher = {Association for Computational Linguistics}, organization = {Association for Computational Linguistics}, address = {Stroudsburg, PA, USA}, abstract = {This work investigates design choices in modeling a discourse scheme for improving opinion polarity classification. For this, two diverse global inference paradigms are used: a supervised collective classification framework and an unsupervised optimization framework. Both approaches perform substantially better than baseline approaches, establishing the efficacy of the methods and the underlying discourse scheme. We also present quantitative and qualitative analyses showing how the improvements are achieved.}, isbn = {978-1-932432-59-6}, url = {http://dl.acm.org/citation.cfm?id=1699510.1699533}, author = {Somasundaran,Swapna and Namata,Galileo and Wiebe,Janyce and Getoor, Lise} } @article {18808, title = {A survey of snake-inspired robot designs}, journal = {Bioinspiration \& Biomimetics}, volume = {4}, year = {2009}, month = {2009/06/01/}, pages = {021001 - 021001}, abstract = {Body undulation used by snakes and the physical architecture of a snake body may offer significant benefits over typical legged or wheeled locomotion designs in certain types of scenarios. A large number of research groups have developed snake-inspired robots to exploit these benefits. The purpose of this review is to report different types of snake-inspired robot designs and categorize them based on their main characteristics. For each category, we discuss their relative advantages and disadvantages. This review will assist in familiarizing a newcomer to the field with the existing designs and their distinguishing features. We hope that by studying existing robots, future designers will be able to create new designs by adopting features from successful robots. The review also summarizes the design challenges associated with the further advancement of the field and deploying snake-inspired robots in practice.}, isbn = {1748-3182, 1748-3190}, doi = {10.1088/1748-3182/4/2/021001}, url = {http://iopscience.iop.org/1748-3182/4/2/021001}, author = {Hopkins,James K. and Spranklin,Brent W. and Gupta, Satyandra K.} } @conference {12236, title = {Symbiotic relationships in internet routing overlays}, booktitle = {Proceedings of the 6th USENIX symposium on Networked systems design and implementation}, series = {NSDI{\textquoteright}09}, year = {2009}, month = {2009///}, pages = {467 - 480}, publisher = {USENIX Association}, organization = {USENIX Association}, address = {Berkeley, CA, USA}, abstract = {We propose to construct routing overlay networks using the following principle: that overlay edges should be based on mutual advantage between pairs of hosts. Upon this principle, we design, implement, and evaluate Peer-Wise, a latency-reducing overlay network. To show the feasibility of PeerWise, we must show first that mutual advantage exists in the Internet: perhaps contrary to expectation, that there are not only "haves" and "have nots" of low-latency connectivity. Second, we must provide a scalable means of finding promising edges and overlay routes; we seek embedding error in network coordinates to expose both shorter-than-default "detour" routes and longer-than-expected default routes. We evaluate the cost of limiting PeerWise to mutually advantageous links, then build the intelligent components that put PeerWise into practice. We design and evaluate "virtual" network coordinates for destinations not participating in the overlay, neighbor selection algorithms to find promising relays, and relay selection algorithms to choose the neighbor to traverse for a good detour. Finally, we show that PeerWise is practical through a wide-area deployment and evaluation.}, url = {http://dl.acm.org/citation.cfm?id=1558977.1559009}, author = {Lumezanu,Cristian and Baden,Randy and Levin,Dave and Spring, Neil and Bhattacharjee, Bobby} } @article {13110, title = {System and method for fast illumination-invariant background subtraction ...}, volume = {11/282,513}, year = {2009}, month = {2009/03/31/}, abstract = {A method for eliminating errors in foreground object detection in digitized images comprises providing a reference camera and a secondary camera, vertically aligning each said camera with a baseline that is approximately perpendicular to a ground plane, wherein said reference camera is placed lower than said secondary camera, selecting a foreground pixel in a reference view of a first point in a foreground object, finding a conjugate pixel of the foreground pixel in a secondary view, using the foreground and conjugate pixels to determine an image base pixel of a base point in the reference view, wherein said base point is a point on the ground plane below the first point, and using the foreground and image base pixels to find a location where the ground plane is first visible.}, url = {http://www.google.com/patents?id=8yK_AAAAEBAJ}, author = {Lim,Ser-Nam and Mittal,Anurag and Davis, Larry S.}, editor = {Siemens Corporate Research, Inc.} } @conference {12318, title = {System-level Clustering and Timing Analysis for GALS-based Dataflow Architectures}, booktitle = {In Proceedings of the ACM International Workshop on Timing Issues in the Specification and Synthesis of Digital Systems, Austin, Texas, February 2009.}, year = {2009}, month = {2009///}, abstract = {In this paper, we propose an approach based ondataflow techniques for modeling application-specific, globally asynchronous, locally synchronous (GALS) architectures for digital signal processing (DSP) applications, and analyzing the performance of such architectures. Dataflow-based techniques are attractive for DSP applications because they allow applica- tion behavior to be represented formally, analyzed at a high level of abstraction, and synthesized to software/hardware implementations through an optimized, automated process. In our proposed methodology, we employ dataflow-based compu- tational models to expose relevant structure in the targeted applications, and facilitate the manual or automatic derivation of efficient implementations. We demonstrate the utility of our modeling and analysis techniques by applying them as core parts of a novel clustering algorithm that is geared towards optimizing the throughput of GALS-based DSP architectures. }, author = {Shen,C. and Bhattacharyya, Shuvra S.} } @conference {12228, title = {Systems-compatible incentives}, booktitle = {Game Theory for Networks, 2009. GameNets {\textquoteright}09. International Conference on}, year = {2009}, month = {2009/05//}, pages = {100 - 106}, abstract = {Selfish participants in a distributed system attempt to gain from the system without regard to how their actions may affect others. To maintain desirable system-wide properties in the presence of selfish users, designers are increasingly turning to the powerful mechanisms offered by economics and game theory. Combining the two fields of economics and systems design introduces new challenges of achieving incentive-compatibility in systems we can deploy in today{\textquoteright}s Internet. In this paper, we explore the interactions between systems and the mechanisms that give users incentives to cooperate. Using findings from recent work on incentive-compatible systems, we discuss several economic mechanisms and assumptions: money, punishment, and altruism. We seek to understand when these mechanisms violate system properties. Among the potential pitfalls we present is a phenomenon we call the price of altruism: altruistic peers can impose a loss of social good in some systems. We also discuss systems-compatible mechanisms that have been used in real, distributed systems, and attempt to extract the underlying design principles that have led to their success.}, keywords = {computing;, incentives;game, Internet;distributed, system;distributed, systems;game, systems;systems-compatible, theory;incentive-compatible, theory;peer-to-peer}, doi = {10.1109/GAMENETS.2009.5137390}, author = {Levin,D. and Spring, Neil and Bhattacharjee, Bobby} } @conference {19045, title = {TACKing Together Efficient Authentication, Revocation, and Privacy in VANETs}, year = {2009}, month = {2009}, pages = {1 - 9}, abstract = {Vehicular ad hoc networks (VANETs) require a mechanism to help authenticate messages, identify valid vehicles, and remove malevolent vehicles. A public key infrastructure (PKI) can provide this functionality using certificates and fixed public keys. However, fixed keys allow an eavesdropper to associate a key with a vehicle and a location, violating drivers{\textquoteright} privacy. In this work we propose a VANET key management scheme based on temporary anonymous certified keys (TACKs). Our scheme efficiently prevents eavesdroppers from linking a vehicle{\textquoteright}s different keys and provides timely revocation of misbehaving participants while maintaining the same or less overhead for vehicle-to-vehicle communication as the current IEEE 1609.2 standard for VANET security.}, keywords = {ad hoc networks, data privacy, eavesdropper, IEEE 1609.2 standard, Message authentication, mobile radio, public key cryptography, public key infrastructure, remove malevolent vehicle, telecommunication security, temporary anonymous certified key, valid vehicle identification, VANET key management, VANET security, vehicle-to-vehicle communication, Vehicles, vehicular ad hoc network}, author = {Studer, A. and Elaine Shi and Bai, Fan and Perrig, A.} } @conference {18285, title = {Tampering identification using Empirical Frequency Response}, booktitle = {Acoustics, Speech and Signal Processing, 2009. ICASSP 2009. IEEE International Conference on}, year = {2009}, month = {2009/04//}, pages = {1517 - 1520}, abstract = {With the widespread popularity of digital images and the presence of easy-to-use image editing software, content integrity can no longer be taken for granted, and there is a strong need for techniques that not only detect the presence of tampering but also identify its type. This paper focusses on tampering-type identification and introduces a new approach based on the empirical frequency response (EFR) to address this problem. We show that several types of tampering operations, both linear shift invariant (LSI) and non-LSI, can be characterized consistently and distinctly by their EFRs. We then extend the approach to estimate the EFR for scenarios where only the final image is available. Theoretical reasoning supported by experimental results verify the effectiveness of this method for identifying the type of a tampering operation.}, keywords = {aproach;JPEG, coding;multimedia, compression;frequency, compression;LSI, computing;security, data;, editing, EFR, forensics;tampering-type, Frequency, identification;data, image, invariant;multimedia, of, response;image, response;linear, shift, software;empirical, system;digital}, doi = {10.1109/ICASSP.2009.4959884}, author = {Chuang,Wei-Hong and Swaminathan,A. and M. Wu} } @article {15058, title = {Target Tracking Based on Nonparametric Clustering and Multi-Scale Images}, journal = {JSCUT (Natural Science Edition)}, volume = {37}, year = {2009}, month = {2009///}, pages = {34 - 41}, abstract = {In order to track a target in space and scale in a complex background,a target tracking algorithm based on the nonparametric clustering and multi-scale images is presented.In this algorithm,first,a modified nonparame-tric color-clustering method is employed to adaptively partition the color space of a tracked object,and the Gaussian function is used to model the spatial information of each bin of the color histogram.Next,the Bhattacharyya coefficient is adopted to derive a function describing the similarity between the target model and the target candidate.Then,a coarse-to-fine approach of multi-scale images is employed to implement the spatial location of the tracked object.Finally,the derived automatic bandwidth selection method of kernel function is applied to obtain the scale of the tracked object.Experimental results show that the proposed algorithm outperforms the classical mean shift tracker.}, author = {Shao-fa,J.Z.L. and Hong-li,J.X.Z.} } @article {15035, title = {Techniques to audit and certify the long-term integrity of digital archives}, journal = {International Journal on Digital Libraries}, volume = {10}, year = {2009}, month = {2009///}, pages = {123 - 131}, abstract = {A fundamental requirement for a digital archive is to set up mechanisms that will ensure the authenticity of its holdings in the long term. In this article, we develop a new methodology to address the long-term integrity of digital archives using rigorous cryptographic techniques. Our approach involves the generation of a small-size integrity token for each object, some cryptographic summary information, and a framework that enables cost-effective regular and periodic auditing of the archive{\textquoteright}s holdings depending on the policy set by the archive. Our scheme is very general, architecture and platform independent, and can detect with high probability any alteration to an object, including malicious alterations introduced by the archive or by an external intruder. The scheme can be shown to be mathematically correct as long as a small amount of cryptographic information, in the order of 100 KB/year, can be kept intact. Using this approach, a prototype system called ACE (Auditing Control Environment) has been built and tested in an operational large scale archiving environment.}, keywords = {Computer science}, isbn = {1432-5012}, doi = {10.1007/s00799-009-0056-2}, url = {http://www.springerlink.com/content/y52815g805h96334/abstract/}, author = {Song,Sangchul and JaJa, Joseph F.} } @article {17397, title = {Temporal Summaries: Supporting Temporal Categorical Searching, Aggregation and Comparison}, journal = {IEEE Transactions on Visualization and Computer Graphics}, volume = {15}, year = {2009}, month = {2009/12//Nov}, pages = {1049 - 1056}, abstract = {When analyzing thousands of event histories, analysts often want to see the events as an aggregate to detect insights and generate new hypotheses about the data. An analysis tool must emphasize both the prevalence and the temporal ordering of these events. Additionally, the analysis tool must also support flexible comparisons to allow analysts to gather visual evidence. In a previous work, we introduced align, rank, and filter (ARF) to accentuate temporal ordering. In this paper, we present temporal summaries, an interactive visualization technique that highlights the prevalence of event occurrences. Temporal summaries dynamically aggregate events in multiple granularities (year, month, week, day, hour, etc.) for the purpose of spotting trends over time and comparing several groups of records. They provide affordances for analysts to perform temporal range filters. We demonstrate the applicability of this approach in two extensive case studies with analysts who applied temporal summaries to search, filter, and look for patterns in electronic health records and academic records.}, keywords = {Aggregates, Collaborative work, Computational Biology, Computer Graphics, Data analysis, data visualisation, Data visualization, Databases, Factual, Displays, Event detection, Filters, Heparin, History, Human computer interaction, Human-computer interaction, HUMANS, Information Visualization, Interaction design, interactive visualization technique, Medical Records Systems, Computerized, Pattern Recognition, Automated, Performance analysis, Springs, temporal categorical data visualization, temporal categorical searching, temporal ordering, temporal summaries, Thrombocytopenia, Time factors}, isbn = {1077-2626}, doi = {10.1109/TVCG.2009.187}, author = {Wang,T. D and Plaisant, Catherine and Shneiderman, Ben and Spring, Neil and Roseman,D. and Marchand,G. and Mukherjee,V. and Smith,M.} } @article {16056, title = {Temporal Summaries: Supporting Temporal Categorical Searching, Aggregation and Comparison}, journal = {Visualization and Computer Graphics, IEEE Transactions on}, volume = {15}, year = {2009}, month = {2009/12//nov}, pages = {1049 - 1056}, abstract = {When analyzing thousands of event histories, analysts often want to see the events as an aggregate to detect insights and generate new hypotheses about the data. An analysis tool must emphasize both the prevalence and the temporal ordering of these events. Additionally, the analysis tool must also support flexible comparisons to allow analysts to gather visual evidence. In a previous work, we introduced align, rank, and filter (ARF) to accentuate temporal ordering. In this paper, we present temporal summaries, an interactive visualization technique that highlights the prevalence of event occurrences. Temporal summaries dynamically aggregate events in multiple granularities (year, month, week, day, hour, etc.) for the purpose of spotting trends over time and comparing several groups of records. They provide affordances for analysts to perform temporal range filters. We demonstrate the applicability of this approach in two extensive case studies with analysts who applied temporal summaries to search, filter, and look for patterns in electronic health records and academic records.}, keywords = {Automated;Thrombocytopenia;Time Factors;, Computerized;Pattern Recognition, Factual;Heparin;Humans;Medical Records Systems, interactive visualization technique;temporal categorical searching;temporal ordering;temporal summaries;data visualisation;human computer interaction;Computational Biology;Computer Graphics;Databases}, isbn = {1077-2626}, doi = {10.1109/TVCG.2009.187}, author = {Wang,T. D and Plaisant, Catherine and Shneiderman, Ben and Spring, Neil and Roseman,D. and Marchand,G. and Mukherjee,V. and Smith,M.} } @article {13872, title = {TER-Plus: paraphrase, semantic, and alignment enhancements to Translation Edit Rate}, journal = {Machine Translation}, volume = {23}, year = {2009}, month = {2009///}, pages = {117 - 127}, abstract = {This paper describes a new evaluation metric, TER-Plus (TERp) for automatic evaluation of machine translation (MT). TERp is an extension of Translation Edit Rate (TER). It builds on the success of TER as an evaluation metric and alignment tool and addresses several of its weaknesses through the use of paraphrases, stemming, synonyms, as well as edit costs that can be automatically optimized to correlate better with various types of human judgments. We present a correlation study comparing TERp to BLEU, METEOR and TER, and illustrate that TERp can better evaluate translation adequacy.}, isbn = {0922-6567}, url = {http://dx.doi.org/10.1007/s10590-009-9062-9}, author = {Snover,Matthew and Madnani,Nitin and Dorr, Bonnie J and Schwartz,Richard} } @article {15433, title = {Testing graphical user interfaces}, journal = {Encyclopedia of Information Science and Technology}, year = {2009}, month = {2009///}, author = {Strecker,J. and Memon, Atif M.} } @conference {14658, title = {A theory of typed coercions and its applications}, booktitle = {Proceedings of the 14th ACM SIGPLAN international conference on Functional programming}, series = {ICFP {\textquoteright}09}, year = {2009}, month = {2009///}, pages = {329 - 340}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {A number of important program rewriting scenarios can be recast as type-directed coercion insertion. These range from more theoretical applications such as coercive subtyping and supporting overloading in type theories, to more practical applications such as integrating static and dynamically typed code using gradual typing, and inlining code to enforce security policies such as access control and provenance tracking. In this paper we give a general theory of type-directed coercion insertion. We specifically explore the inherent tradeoff between expressiveness and ambiguity--the more powerful the strategy for generating coercions, the greater the possibility of several, semantically distinct rewritings for a given program. We consider increasingly powerful coercion generation strategies, work out example applications supported by the increased power (including those mentioned above), and identify the inherent ambiguity problems of each setting, along with various techniques to tame the ambiguities.}, keywords = {coercion insertion, gradual typing, nonambiguity, provenance, type-directed translation}, isbn = {978-1-60558-332-7}, doi = {10.1145/1596550.1596598}, url = {http://doi.acm.org/10.1145/1596550.1596598}, author = {Swamy,Nikhil and Hicks, Michael W. and Bierman,Gavin M.} } @article {19726, title = {Three genomes from the phylum Acidobacteria provide insight into the lifestyles of these microorganisms in soils.}, journal = {Appl Environ Microbiol}, volume = {75}, year = {2009}, month = {2009 Apr}, pages = {2046-56}, abstract = {

The complete genomes of three strains from the phylum Acidobacteria were compared. Phylogenetic analysis placed them as a unique phylum. They share genomic traits with members of the Proteobacteria, the Cyanobacteria, and the Fungi. The three strains appear to be versatile heterotrophs. Genomic and culture traits indicate the use of carbon sources that span simple sugars to more complex substrates such as hemicellulose, cellulose, and chitin. The genomes encode low-specificity major facilitator superfamily transporters and high-affinity ABC transporters for sugars, suggesting that they are best suited to low-nutrient conditions. They appear capable of nitrate and nitrite reduction but not N(2) fixation or denitrification. The genomes contained numerous genes that encode siderophore receptors, but no evidence of siderophore production was found, suggesting that they may obtain iron via interaction with other microorganisms. The presence of cellulose synthesis genes and a large class of novel high-molecular-weight excreted proteins suggests potential traits for desiccation resistance, biofilm formation, and/or contribution to soil structure. Polyketide synthase and macrolide glycosylation genes suggest the production of novel antimicrobial compounds. Genes that encode a variety of novel proteins were also identified. The abundance of acidobacteria in soils worldwide and the breadth of potential carbon use by the sequenced strains suggest significant and previously unrecognized contributions to the terrestrial carbon cycle. Combining our genomic evidence with available culture traits, we postulate that cells of these isolates are long-lived, divide slowly, exhibit slow metabolic rates under low-nutrient conditions, and are well equipped to tolerate fluctuations in soil hydration.

}, keywords = {Anti-Bacterial Agents, bacteria, Biological Transport, Carbohydrate Metabolism, Cyanobacteria, DNA, Bacterial, Fungi, Genome, Bacterial, Macrolides, Molecular Sequence Data, Nitrogen, Phylogeny, Proteobacteria, Sequence Analysis, DNA, sequence homology, Soil Microbiology}, issn = {1098-5336}, doi = {10.1128/AEM.02294-08}, author = {Ward, Naomi L and Challacombe, Jean F and Janssen, Peter H and Henrissat, Bernard and Coutinho, Pedro M and Wu, Martin and Xie, Gary and Haft, Daniel H and Sait, Michelle and Badger, Jonathan and Barabote, Ravi D and Bradley, Brent and Brettin, Thomas S and Brinkac, Lauren M and Bruce, David and Creasy, Todd and Daugherty, Sean C and Davidsen, Tanja M and DeBoy, Robert T and Detter, J Chris and Dodson, Robert J and Durkin, A Scott and Ganapathy, Anuradha and Gwinn-Giglio, Michelle and Han, Cliff S and Khouri, Hoda and Kiss, Hajnalka and Kothari, Sagar P and Madupu, Ramana and Nelson, Karen E and Nelson, William C and Paulsen, Ian and Penn, Kevin and Ren, Qinghu and Rosovitz, M J and Jeremy D Selengut and Shrivastava, Susmita and Sullivan, Steven A and Tapia, Roxanne and Thompson, L Sue and Watkins, Kisha L and Yang, Qi and Yu, Chunhui and Zafar, Nikhat and Zhou, Liwei and Kuske, Cheryl R} } @conference {12163, title = {Tool supported detection and judgment of nonconformance in process execution}, booktitle = {Empirical Software Engineering and Measurement, 2009. ESEM 2009. 3rd International Symposium on}, year = {2009}, month = {2009/10//}, pages = {312 - 323}, abstract = {In the past decades the software engineering community has proposed a large collection of software development life cycles, models, and processes. The goal of a major set of these processes is to assure that the product is finished within time and budget, and that a predefined set of functional and nonfunctional requirements (e.g. quality goals) are satisfied at delivery time. Based upon the assumption that there is a real relationship between the process applied and the characteristics of the product developed from that process, we developed a tool supported approach that uses process nonconformance detection to identify potential risks in achieving the required process characteristics. In this paper we present the approach and a feasibility study that demonstrates its use on a large-scale software development project in the aerospace domain. We demonstrate that our approach, in addition to meeting the criteria above, can be applied to a real system of reasonable size; can represent a useful and adequate set of rules of relevance in such an environment; and can detect relevant examples of process nonconformance that provide useful insight to the project manager.}, keywords = {aerospace, community;tool, cycle;software, detection;software, development, domain;large-scale, engineering, execution;process, life, management;software, nonconformance, project;nonfunctional, requirement;process, software, supported, tools;}, doi = {10.1109/ESEM.2009.5315983}, author = {Zazworka, N. and Basili, Victor R. and Shull, F.} } @conference {15041, title = {Tools and Services for Long-Term Preservation of Digital Archives}, booktitle = {Indo-US Workshop on International Trends in Digital Preservation}, year = {2009}, month = {2009///}, abstract = {We have been working on a technology model to support thepreservation and reliable access of long term digital archives. The model is built around a layered object architecture involving modular, extensible components that can gracefully adapt to the evolving technology, standards, and protocols. This has led to the development of methodologies, tools and services to handle a number of core requirements of long term digital archives. Specifically, we have built flexible tools for implementing general ingestion workflows, active monitoring and auditing of the archive{\textquoteright}s collections to ensure their long-term availability and integrity, storage organization and indexing to optimize access. These tools are platform and architecture independent, and have been tested using a wide variety of collections on heterogeneous computing platforms. In this paper, we will primarily focus on describing the underpinnings of our software called ACE (Auditing Control Environment), and report on its performance on a large scale distributed environment called Chronopolis. Built on top of rigorous cryptographic techniques, ACE provides a policy- driven, scalable environment to monitor and audit the archive{\textquoteright}s contents in a cost effective way. In addition, we will briefly introduce some our recent efforts to deal with storage organization and access of web archives. Long term preservation is a process that must begin before an object is ingested into the archive and must remain active throughout the lifetime of the archive. The ACE tool provides a very flexible environment to actively monitor and audit the contents of a digital archive throughout its lifetime, so as to ensure the availability and integrity of the archive{\textquoteright}s holdings with extremely high probability. ACE is based on rigorous cryptographic techniques, and enables periodic auditing of the archive{\textquoteright}s holdings at the granularity and frequency set by the manager of the archive. The scheme is cost effective and very general, does not depend on the archive{\textquoteright}s architecture, and can detect any alterations, including alterations made by a malicious user. ACE can gracefully adapt to format migrations and changes to the archive{\textquoteright}s policies. }, author = {JaJa, Joseph F. and Smorul,M. and Song,S.} } @conference {16677, title = {Topological ordering of function words in hierarchical phrase-based translation}, booktitle = {Proceedings of the Joint Conference of the 47th Annual Meeting of the ACL and the 4th International Joint Conference on Natural Language Processing of the AFNLP: Volume 1-Volume 1}, year = {2009}, month = {2009///}, pages = {324 - 332}, author = {Setiawan,H. and Kan,M.Y. and Li,H. and Resnik, Philip} } @article {13026, title = {Toward reconstructing the evolution of advanced moths and butterflies (Lepidoptera: Ditrysia): an initial molecular study}, journal = {BMC Evol Biol}, volume = {9}, year = {2009}, month = {2009///}, pages = {280 - 280}, abstract = {BACKGROUND: In the mega-diverse insect order Lepidoptera (butterflies and moths; 165,000 described species), deeper relationships are little understood within the clade Ditrysia, to which 98\% of the species belong. To begin addressing this problem, we tested the ability of five protein-coding nuclear genes (6.7 kb total), and character subsets therein, to resolve relationships among 123 species representing 27 (of 33) superfamilies and 55 (of 100) families of Ditrysia under maximum likelihood analysis. RESULTS: Our trees show broad concordance with previous morphological hypotheses of ditrysian phylogeny, although most relationships among superfamilies are weakly supported. There are also notable surprises, such as a consistently closer relationship of Pyraloidea than of butterflies to most Macrolepidoptera. Monophyly is significantly rejected by one or more character sets for the putative clades Macrolepidoptera as currently defined (P < 0.05) and Macrolepidoptera excluding Noctuoidea and Bombycoidea sensu lato (P < or = 0.005), and nearly so for the superfamily Drepanoidea as currently defined (P < 0.08). Superfamilies are typically recovered or nearly so, but usually without strong support. Relationships within superfamilies and families, however, are often robustly resolved. We provide some of the first strong molecular evidence on deeper splits within Pyraloidea, Tortricoidea, Geometroidea, Noctuoidea and others.Separate analyses of mostly synonymous versus non-synonymous character sets revealed notable differences (though not strong conflict), including a marked influence of compositional heterogeneity on apparent signal in the third codon position (nt3). As available model partitioning methods cannot correct for this variation, we assessed overall phylogeny resolution through separate examination of trees from each character set. Exploration of "tree space" with GARLI, using grid computing, showed that hundreds of searches are typically needed to find the best-feasible phylogeny estimate for these data. CONCLUSION: Our results (a) corroborate the broad outlines of the current working phylogenetic hypothesis for Ditrysia, (b) demonstrate that some prominent features of that hypothesis, including the position of the butterflies, need revision, and (c) resolve the majority of family and subfamily relationships within superfamilies as thus far sampled. Much further gene and taxon sampling will be needed, however, to strongly resolve individual deeper nodes.}, doi = {10.1186/1471-2148-9-280}, author = {Regier,J. C and Zwick,A. and Cummings, Michael P. and Kawahara,A. Y and Cho,S. and Weller,S. and Roe,A. and Baixeras,J. and Brown,J. W and Parr,C. and Davis,DR and Epstein,M and Hallwachs,W and Hausmann,A and Janzen,DH and Kitching,IJ and Solis,MA and Yen,S-H and Bazinet,A. L and Mitter,C} } @article {18529, title = {Towards an Internet Connectivity Market}, volume = {GT-CS-09-01}, year = {2009}, month = {2009///}, institution = {Georgia Institute of Technology}, abstract = {Today{\textquoteright}s Internet achieves end-to-end connectivity through bilateral contracts between neighboring networks; unfortunately, this {\textquotedblleft}one size fits all{\textquotedblright} connectivity results in less efficient paths, unsold capacity and unmet demand, and sometimes catastrophic market failures that result in global disconnectivity. This paper presents the design and evaluation of MINT, a Market for Internet Transit. MINT is a connectivity market and corresponding set of protocols that allows ISPs to offer path segments on an open market. Edge networks bid for end-to-end paths, and a mediator matches bids for paths to collections of path segments that form end-to-end paths. MINT can be deployed using protocols that are present in today{\textquoteright}s routers, and it operates in parallel with the existing routing infrastructure and connectivity market. We present MINT{\textquoteright}s market model and protocol design; evaluate how MINT improves efficiency, the utility of edge networks, and the profits of transit networks; and how MINT can operate at Internet scale.}, url = {http://hdl.handle.net/1853/30622}, author = {Feamster, Nick and Hassan,U. and Sundaresan,S. and Valancius,V. and Johari,R. and Vazirani,V.} } @article {14301, title = {Triaging Checklists: a Substitute for a PhD in Static Analysis}, journal = {Evaluation and Usability of Programming Languages and Tools (PLATEAU) PLATEAU 2009}, year = {2009}, month = {2009///}, abstract = {Static analysis tools have achieved great success in recentyears in automating the process of detecting defects in soft- ware. However, these sophisticated tools have yet to gain widespread adoption, since many of these tools remain too difficult to understand and use. In previous work, we dis- covered that even with an effective code visualization tool, users still found it hard to determine if warnings reported by these tools were true errors or false warnings. The fun- damental problem users face is to understand enough of the underlying algorithm to determine if a warning is caused by imprecision in the algorithm, a challenge that even experts with PhDs may take a while to achieve. In our current work, we propose to use triaging checklists to provide users with systematic guidance to identify false warnings by taking into account specific sources of imprecision in the particular tool. Additionally, we plan to provide checklist assistants, which is a library of simple analyses designed to aid users in an- swering checklist questions. }, author = {Phang,K.Y. and Foster, Jeffrey S. and Hicks, Michael W. and Sazawal,V.} } @inbook {12235, title = {Triangle Inequality and Routing Policy Violations in the Internet}, booktitle = {Passive and Active Network MeasurementPassive and Active Network Measurement}, series = {Lecture Notes in Computer Science}, volume = {5448}, year = {2009}, month = {2009///}, pages = {45 - 54}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {Triangle inequality violations (TIVs) are the effect of packets between two nodes being routed on the longer direct path between them when a shorter detour path through an intermediary is available. TIVs are a natural, widespread and persistent consequence of Internet routing policies. By exposing opportunities to improve the delay between two nodes, TIVs can help myriad applications that seek to minimize end-to-end latency. However, sending traffic along the detour paths revealed by TIVs may influence Internet routing negatively. In this paper we study the interaction between triangle inequality violations and policy routing in the Internet. We use measured and predicted AS paths between Internet nodes to show that 25\% of the detour paths exposed by TIVs are in fact available to BGP but are simply deemed {\textquotedblleft}less efficient{\textquotedblright}. We also compare the AS paths of detours and direct paths and find that detours use AS edges that are rarely followed by default Internet paths, while avoiding others that BGP seems to prefer. Our study is important both for understanding the various interactions that occur at the routing layer as well as their effects on applications that seek to use TIVs to minimize latency.}, keywords = {Computer, Science}, isbn = {978-3-642-00974-7}, url = {http://dx.doi.org/10.1007/978-3-642-00975-4_5}, author = {Lumezanu,Cristian and Baden,Randy and Spring, Neil and Bhattacharjee, Bobby}, editor = {Moon,Sue and Teixeira,Renata and Uhlig,Steve} } @conference {12234, title = {Triangle inequality variations in the internet}, booktitle = {Proceedings of the 9th ACM SIGCOMM conference on Internet measurement conference}, series = {IMC {\textquoteright}09}, year = {2009}, month = {2009///}, pages = {177 - 183}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Triangle inequality violations (TIVs) are important for latency sensitive distributed applications. On one hand, they can expose opportunities to improve network routing by finding shorter paths between nodes. On the other hand, TIVs can frustrate network embedding or positioning systems that treat the Internet as a metric space where the triangle inequality holds. Even though triangle inequality violations are both significant and curious, their study has been limited to aggregate data sets that combine measurements taken over long periods of time. The limitations of these data sets open crucial questions in the design of systems that exploit (or avoid) TIVs: are TIVs stable or transient? Or are they illusions caused by aggregating measurements taken at different times? We collect latency matrices at varying sizes and time granularities and study dynamic properties of triangle inequality violations in the Internet. We show that TIVs are not results of measurement error and that their number varies with time. We examine how latency aggregates of data measured over longer periods of time preserve TIVs. Using medians to compute violations eliminates most of the TIVs that appear sporadically during the measurement but it misses many of the ones that are present for more than five hours.}, keywords = {latency, tiv, triangle inequality violation, variation}, isbn = {978-1-60558-771-4}, doi = {10.1145/1644893.1644914}, url = {http://doi.acm.org/10.1145/1644893.1644914}, author = {Lumezanu,Cristian and Baden,Randy and Spring, Neil and Bhattacharjee, Bobby} } @conference {16830, title = {TwitterStand: news in tweets}, booktitle = {Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems}, series = {GIS {\textquoteright}09}, year = {2009}, month = {2009///}, pages = {42 - 51}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Twitter is an electronic medium that allows a large user populace to communicate with each other simultaneously. Inherent to Twitter is an asymmetrical relationship between friends and followers that provides an interesting social network like structure among the users of Twitter. Twitter messages, called tweets, are restricted to 140 characters and thus are usually very focused. We investigate the use of Twitter to build a news processing system, called TwitterStand, from Twitter tweets. The idea is to capture tweets that correspond to late breaking news. The result is analogous to a distributed news wire service. The difference is that the identities of the contributors/reporters are not known in advance and there may be many of them. Furthermore, tweets are not sent according to a schedule: they occur as news is happening, and tend to be noisy while usually arriving at a high throughput rate. Some of the issues addressed include removing the noise, determining tweet clusters of interest bearing in mind that the methods must be online, and determining the relevant locations associated with the tweets.}, keywords = {geotagging, news, online clustering, Twitter}, isbn = {978-1-60558-649-6}, doi = {10.1145/1653771.1653781}, url = {http://doi.acm.org/10.1145/1653771.1653781}, author = {Sankaranarayanan,Jagan and Samet, Hanan and Teitler,Benjamin E. and Lieberman,Michael D. and Sperling,Jon} } @article {16292, title = {Ultrafast and memory-efficient alignment of short DNA sequences to the human genome}, journal = {Genome Biology}, volume = {10}, year = {2009}, month = {2009/03/04/}, pages = {R25 - R25}, abstract = {Bowtie is an ultrafast, memory-efficient alignment program for aligning short DNA sequence reads to large genomes. For the human genome, Burrows-Wheeler indexing allows Bowtie to align more than 25 million reads per CPU hour with a memory footprint of approximately 1.3 gigabytes. Bowtie extends previous Burrows-Wheeler techniques with a novel quality-aware backtracking algorithm that permits mismatches. Multiple processor cores can be used simultaneously to achieve even greater alignment speeds. Bowtie is open source http://bowtie.cbcb.umd.edu.}, isbn = {1465-6906}, doi = {10.1186/gb-2009-10-3-r25}, url = {http://genomebiology.com/2009/10/3/R25}, author = {Langmead,Ben and Trapnell,Cole and Pop, Mihai and Salzberg,Steven L.} } @article {15843, title = {Understanding IT Innovations Through Computational Analysis of Discourse}, journal = {ICIS 2009 Proceedings}, year = {2009}, month = {2009/01/01/}, url = {http://aisel.aisnet.org/icis2009/102}, author = {Tsui,Chia-jung and Wang,Ping and Fleischmann,Kenneth and Oard, Douglas and Sayeed,Asad} } @conference {17453, title = {Understanding social computing participation with visual exploration tools}, booktitle = {International Symposium on Collaborative Technologies and Systems, 2009. CTS {\textquoteright}09}, year = {2009}, month = {2009/05/18/22}, pages = {xi-xii - xi-xii}, publisher = {IEEE}, organization = {IEEE}, abstract = {The rapid growth of socio-technical systems, social media and social networking websites has raised the importance of understanding the determinants of their success. The pressure to understand success is increased by the shift from playful discretionary applications to mission critical applications in government, business, and civic settings. These include homeland defense, energy sustainability, environmental conservation, disaster response, and community safety. Information visualization tools and statistical methods can both be helpful, but their utility grows when they are well-integrated. This talk will demonstrate novel tools for network evolution and offer a framework for thinking about motivating technology-mediated social participation.}, keywords = {Application software, Books, Collaborative tools, Computer science, Data visualization, Educational institutions, History, International collaboration, Social network services, Sociotechnical systems}, isbn = {978-1-4244-4584-4}, doi = {10.1109/CTS.2009.5067426}, author = {Shneiderman, Ben} } @conference {13106, title = {Understanding videos, constructing plots learning a visually grounded storyline model from annotated videos}, booktitle = {Computer Vision and Pattern Recognition, 2009. CVPR 2009. IEEE Conference on}, year = {2009}, month = {2009/06//}, pages = {2012 - 2019}, abstract = {Analyzing videos of human activities involves not only recognizing actions (typically based on their appearances), but also determining the story/plot of the video. The storyline of a video describes causal relationships between actions. Beyond recognition of individual actions, discovering causal relationships helps to better understand the semantic meaning of the activities. We present an approach to learn a visually grounded storyline model of videos directly from weakly labeled data. The storyline model is represented as an AND-OR graph, a structure that can compactly encode storyline variation across videos. The edges in the AND-OR graph correspond to causal relationships which are represented in terms of spatio-temporal constraints. We formulate an Integer Programming framework for action recognition and storyline extraction using the storyline model and visual groundings learned from training data.}, keywords = {(artificial, action, activity, analysis;integer, AND-OR, annotation;video, coding;, constraint;video, construction;semantic, extraction;graph, framework;plots, graph;encoding;human, grounded, intelligence);spatiotemporal, learning, meaning;spatio-temporal, model, phenomena;video, Programming, programming;learning, recognition;human, representation;integer, storyline, theory;image, understanding;visually}, doi = {10.1109/CVPR.2009.5206492}, author = {Gupta,A. and Srinivasan,P. and Shi,Jianbo and Davis, Larry S.} } @article {13350, title = {A unified approach to ranking in probabilistic databases}, journal = {Proceedings of the VLDB Endowment}, volume = {2}, year = {2009}, month = {2009/08//}, pages = {502 - 513}, abstract = {The dramatic growth in the number of application domains that naturally generate probabilistic, uncertain data has resulted in a need for efficiently supporting complex querying and decision-making over such data. In this paper, we present a unified approach to ranking and top-k query processing in probabilistic databases by viewing it as a multi-criteria optimization problem, and by deriving a set of features that capture the key properties of a probabilistic dataset that dictate the ranked result. We contend that a single, specific ranking function may not suffice for probabilistic databases, and we instead propose two parameterized ranking functions, called PRFω and PRFe, that generalize or can approximate many of the previously proposed ranking functions. We present novel generating functions-based algorithms for efficiently ranking large datasets according to these ranking functions, even if the datasets exhibit complex correlations modeled using probabilistic and/xor trees or Markov networks. We further propose that the parameters of the ranking function be learned from user preferences, and we develop an approach to learn those parameters. Finally, we present a comprehensive experimental study that illustrates the effectiveness of our parameterized ranking functions, especially PRFe, at approximating other ranking functions and the scalability of our proposed algorithms for exact or approximate ranking.}, isbn = {2150-8097}, url = {http://dl.acm.org/citation.cfm?id=1687627.1687685}, author = {Li,Jian and Saha,Barna and Deshpande, Amol} } @article {17549, title = {A unified approach to scheduling on unrelated parallel machines}, journal = {J. ACM}, volume = {56}, year = {2009}, month = {2009/08//}, pages = {28:1{\textendash}28:31 - 28:1{\textendash}28:31}, abstract = {We develop a single rounding algorithm for scheduling on unrelated parallel machines; this algorithm works well with the known linear programming-, quadratic programming-, and convex programming-relaxations for scheduling to minimize completion time, makespan, and other well-studied objective functions. This algorithm leads to the following applications for the general setting of unrelated parallel machines: (i) a bicriteria algorithm for a schedule whose weighted completion-time and makespan simultaneously exhibit the current-best individual approximations for these criteria; (ii) better-than-two approximation guarantees for scheduling to minimize the Lp norm of the vector of machine-loads, for all 1 < p < $\infty$; and (iii) the first constant-factor multicriteria approximation algorithms that can handle the weighted completion-time and any given collection of integer Lp norms. Our algorithm has a natural interpretation as a melding of linear-algebraic and probabilistic approaches. Via this view, it yields a common generalization of rounding theorems due to Karp et al. [1987] and Shmoys \& Tardos [1993], and leads to improved approximation algorithms for the problem of scheduling with resource-dependent processing times introduced by Grigoriev et al. [2007].}, keywords = {Approximation algorithms, Randomized rounding, scheduling under multiple criteria}, isbn = {0004-5411}, doi = {10.1145/1552285.1552289}, url = {http://doi.acm.org/10.1145/1552285.1552289}, author = {Kumar,V. S. Anil and Marathe,Madhav V. and Parthasarathy,Srinivasan and Srinivasan, Aravind} } @conference {16665, title = {The University of Maryland statistical machine translation system for the Fourth Workshop on Machine Translation}, booktitle = {Proceedings of the Fourth Workshop on Statistical Machine Translation}, year = {2009}, month = {2009///}, pages = {145 - 149}, author = {Dyer,C. and Setiawan,H. and Marton,Y. and Resnik, Philip} } @article {17689, title = {An Unreliable Convergence Criterion for Arnoldi{\textquoteright}s Method}, year = {2009}, month = {2009///}, institution = {Technical Report, CMSC TR-4938, University of Maryland}, author = {Stewart, G.W.} } @article {12846, title = {Using formal specifications to support testing}, journal = {ACM Computing Surveys}, volume = {41}, year = {2009}, month = {2009/02/01/}, pages = {1 - 76}, isbn = {03600300}, doi = {10.1145/1459352.1459354}, url = {http://dl.acm.org/citation.cfm?id=1459352.1459354}, author = {Hierons,Robert M. and Krause,Paul and L{\"u}ttgen,Gerald and Simons,Anthony J. H. and Vilkomir,Sergiy and Woodward,Martin R. and Zedan,Hussein and Bogdanov,Kirill and Bowen,Jonathan P. and Cleaveland, Rance and Derrick,John and Dick,Jeremy and Gheorghe,Marian and Harman,Mark and Kapoor,Kalpesh} } @article {17916, title = {Using Graphics Processors for High-Performance Computation and Visualization of Plasma Turbulence}, journal = {Computing in Science Engineering}, volume = {11}, year = {2009}, month = {2009/04//march}, pages = {52 - 59}, abstract = {Direct numerical simulation (DNS) of turbulence is computationally intensive and typically relies on some form of parallel processing. The authors present techniques to map DNS computations to modern graphics processing units (GPUs), which are characterized by very high memory bandwidth and hundreds of SPMD (single-program-multiple-data) processors.}, keywords = {analysis;parallel, computation;parallel, computing;numerical, direct, engineering, numerical, PROCESSING, processing;plasma, processors;data, simulation;graphics, systems;nuclear, turbulence, turbulence;, units;high-performance, visualisation;multiprocessing, visualization;single-program-multiple-data}, isbn = {1521-9615}, doi = {10.1109/MCSE.2009.42}, author = {Stantchev,G. and Juba,D. and Dorland,W. and Varshney, Amitabh} } @conference {12167, title = {Using uncertainty as a model selection and comparison criterion}, booktitle = {Proceedings of the 5th International Conference on Predictor Models in Software Engineering}, series = {PROMISE {\textquoteright}09}, year = {2009}, month = {2009///}, pages = {18:1{\textendash}18:9 - 18:1{\textendash}18:9}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Over the last 25+ years, software estimation research has been searching for the best model for estimating variables of interest (e.g., cost, defects, and fault proneness). This research effort has not lead to a common agreement. One problem is that, they have been using accuracy as the basis for selection and comparison. But accuracy is not invariant; it depends on the test sample, the error measure, and the chosen error statistics (e.g., MMRE, PRED, Mean and Standard Deviation of error samples). Ideally, we would like an invariant criterion. In this paper, we show that uncertainty can be used as an invariant criterion to figure out which estimation model should be preferred over others. The majority of this work is empirically based, applying Bayesian prediction intervals to some COCOMO model variations with respect to a publicly available cost estimation data set coming from the PROMISE repository.}, keywords = {accuracy, Bayesian prediction intervals, Calibration, cost estimation, cost model, model evaluation, model selection, prediction interval, Uncertainty}, isbn = {978-1-60558-634-2}, doi = {10.1145/1540438.1540464}, url = {http://doi.acm.org/10.1145/1540438.1540464}, author = {Sarcia{\textquoteright},Salvatore Alessandro and Basili, Victor R. and Cantone,Giovanni} } @conference {12806, title = {Validating Automotive Control Software Using Instrumentation-Based Verification}, booktitle = {Automated Software Engineering, International Conference on}, year = {2009}, month = {2009///}, pages = {15 - 25}, publisher = {IEEE Computer Society}, organization = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, abstract = {This paper discusses the results of an application of a formally based verification technique, called Instrumentation-Based Verification (IBV), to a production automotive lighting controller. The goal of the study is to assess, from both a tools as well as a methodological perspective, the performance of IBV in an industrial setting. The insights obtained as a result of the project include a refinement of a previously developed architecture for requirements specifications; observations about changes to model-based design workflows; insights into the role of requirements during development; and the capability of automated verification to detect inconsistencies among requirements as well as between requirements and design models.}, doi = {http://doi.ieeecomputersociety.org/10.1109/ASE.2009.98}, author = {Ray,Arnab and Morschhaeuser,Iris and Ackermann,Chris and Cleaveland, Rance and Shelton,Charles and Martin,Chris} } @conference {16058, title = {VAST 2009 challenge: An insider threat}, booktitle = {Visual Analytics Science and Technology, 2009. VAST 2009. IEEE Symposium on}, year = {2009}, month = {2009/10//}, pages = {243 - 244}, abstract = {The 4th VAST Challenge centered on a cyber analytics scenario and offered three mini-challenges with datasets of badge and network traffic data, a social network including geospatial information, and security video. Teams could also enter the Grand challenge which combined all three datasets. In this paper, we summarize the dataset, the overall scenario and the questions asked in the challenges. We describe the judging process and new infrastructure developed to manage the submissions and compute accuracy measures in the social network mini challenge. We received 49 entries from 30 teams, and gave 23 different awards to a total of 16 teams.}, keywords = {2009, analytics;data, analytics;geospatial, challenge;cyber, data;security, information, information;human, interaction;network, interfaces;, network;visual, traffic, user, VAST, video;social, visualisation;graphical}, doi = {10.1109/VAST.2009.5334454}, author = {Grinstein,G. and Scholtz,J. and Whiting,M. and Plaisant, Catherine} } @article {14756, title = {Verified enforcement of stateful information release policies}, journal = {SIGPLAN Not.}, volume = {43}, year = {2009}, month = {2009/02//}, pages = {21 - 31}, abstract = {Many organizations specify information release policies to describe the terms under which sensitive information may be released to other organizations. This paper presents a new approach for ensuring that security-critical software correctly enforces its information release policy. Our approach has two parts. First, an information release policy is specified as a security automaton written in a new language called AIR. Second, we enforce an AIR policy by translating it into an API for programs written in lAIR, a core formalism for a functional programming language. lAIR uses a novel combination of dependent, affine, and singleton types to ensure that the API is used correctly. As a consequence we can certify that programs written in lAIR meet the requirements of the original AIR policy specification.}, keywords = {affine types, certified evaluation, declassification, dependent types, singleton types, state modifying policies}, isbn = {0362-1340}, doi = {10.1145/1513443.1513448}, url = {http://doi.acm.org/10.1145/1513443.1513448}, author = {Swamy,Nikhil and Hicks, Michael W.} } @article {13112, title = {Video Compression and Retrieval of Moving Object Location Applied to Surveillance}, journal = {Image Analysis and Recognition}, year = {2009}, month = {2009///}, pages = {906 - 916}, abstract = {A major problem in surveillance systems is the storage requirements for video archival; videos are recorded continuously for long periods of time, resulting in large amounts of data. Therefore, it is essential to apply efficient compression techniques. Additionally, it is useful to be able to index the archived videos based on events. In general, such events are defined by the interaction among moving objects in the scene. Consequently, besides data compression, efficient ways of storing moving objects should be considered. We present a method that exploits both temporal and spatial redundancy of videos captured from static cameras to perform compression and subsequently allows fast retrieval of moving object locations directly from the compressed data. Experimental results show that the approach achieves high compression ratios compared to other existing video compression techniques without significant quality degradation and is fast due to the simplicity of the operations required for compression and decompression.}, author = {Schwartz,W. and Pedrini,H. and Davis, Larry S.} } @book {12535, title = {Video-based Lane Detection using Boosting Principles}, year = {2009}, month = {2009///}, publisher = {Snowbird}, organization = {Snowbird}, abstract = {Autonomous navigation of road vehicles is a challenging problem that has widespread applications in intelligent systems, and robotics. An integral componentof such a system is to understand how the road is structured. Detection of road lane markings assumes importance in this regard, and this problem has been approached with different visual input- based inference algorithms ([1], [2]), besides other sensing modalities such as the GPS sensor and the internal vehicle- state sensors. But the challenge still remains when there is considerable amount of shadows on the road, variations in outdoor lighting conditions of the scene (transition from day to night), among others. To address such issues, we propose a machine learning approach based on Real Adaboost [3], and train linear classifiers for both the appearance and edge cues of the training examplars. Additionally, we incorporate prior knowledge about the relative importance of the training samples by computing their weights using kernel discriminant analysis [4], before learning the classification function through boosting. The regions identified as lane markings are then analyzed for gradient direction consistency before making the final detection decision. We illustrate the effectiveness of our algorithm on challenging daylight and night- time road scenarios. }, author = {Gopalan,R. and Hong, T. and Shneier, M. and Chellapa, Rama} } @article {17491, title = {Visual overviews for discovering key papers and influences across research fronts}, journal = {Journal of the American Society for Information Science and Technology}, volume = {60}, year = {2009}, month = {2009/11/01/}, pages = {2219 - 2228}, abstract = {Gaining a rapid overview of an emerging scientific topic, sometimes called research fronts, is an increasingly common task due to the growing amount of interdisciplinary collaboration. Visual overviews that show temporal patterns of paper publication and citation links among papers can help researchers and analysts to see the rate of growth of topics, identify key papers, and understand influences across subdisciplines. This article applies a novel network-visualization tool based on meaningful layouts of nodes to present research fronts and show citation links that indicate influences across research fronts. To demonstrate the value of two-dimensional layouts with multiple regions and user control of link visibility, we conducted a design-oriented, preliminary case study with 6 domain experts over a 4-month period. The main benefits were being able (a) to easily identify key papers and see the increasing number of papers within a research front, and (b) to quickly see the strength and direction of influence across related research fronts.}, isbn = {1532-2890}, doi = {10.1002/asi.21160}, url = {http://onlinelibrary.wiley.com/doi/10.1002/asi.21160/abstract}, author = {Aris,Aleks and Shneiderman, Ben and Qazvinian,Vahed and Radev,Dragomir} } @article {16060, title = {Visual-Analytics Evaluation}, journal = {Computer Graphics and Applications, IEEE}, volume = {29}, year = {2009}, month = {2009/06//may}, pages = {16 - 17}, abstract = {Visual analytics (VA) is the science of analytical reasoning facilitated by interactive visual interfaces. Assessing VA technology{\textquoteright}s effectiveness is challenging because VA tools combine several disparate components, both low and high level, integrated in complex interactive systems used by analysts, emergency responders, and others. These components include analytical reasoning, visual representations, computer-human interaction techniques, data representations and transformations, collaboration tools, and especially tools for communicating the results of their use. VA tool users{\textquoteright} activities can be exploratory and can take place over days, weeks, or months. Users might not follow a predefined or even linear work flow. They might work alone or in groups. To understand these complex behaviors, an evaluation can target the component level, the system level, or the work environment level, and requires realistic data and tasks. Traditional evaluation metrics such as task completion time, number of errors, or recall and precision are insufficient to quantify the utility of VA tools, and new research is needed to improve our VA evaluation methodology.}, keywords = {analytic, analytics, evaluation;cognition;data, generation;user, interactive, interfaces;synthetic-data-set, reasoning;visual, systems;, tools;visual, visual, visualisation;interactive}, isbn = {0272-1716}, doi = {10.1109/MCG.2009.56}, author = {Plaisant, Catherine and Grinstein,G. and Scholtz,J.} } @conference {16834, title = {3. Similarity searching: Indexing, nearest neighbor finding, dimensionality reduction, and embedding methods for applications in multimedia databases}, booktitle = {Pattern Recognition, 2008. ICPR 2008. 19th International Conference on}, year = {2008}, month = {2008/12//}, pages = {1 - 1}, abstract = {Similarity searching is usually achieved by means of nearest neighbor finding. Existing methods for handling similarity search in this setting fall into one of two classes. The first is based on mapping to a low-dimensional vector space which is then indexed using representations such as k-d trees, R-trees, quadtrees, etc. The second directly indexes the the objects based on distances using representations such as the vp-tree, M-tree, etc. Mapping from a high-dimensional space into a low-dimensional space is known as dimensionality reduction and is achieved using SVD, DFT, etc. At times, when we just have distance information, the data objects are embedded in a vector space so that the distances of the embedded objects as measured by the distance metric in the embedding space approximate the actual distance. The search in the embedding space uses conventional indexing methods which are often coupled with dimensionality reduction. Some commonly known embedding methods are multidimensional scaling, Lipschitz embeddings, and Fast Map. This tutorial is organized into five parts that cover the five basic concepts outlined above: indexing low and high dimensional spaces, distance-based indexing, dimensionality reduction, embedding methods, and nearest neighbor searching.}, keywords = {database;nearest, databases;singular, decomposition;, DFT;FastMap, EMBEDDING, embedding;Lipschitz, finding;similarity, Fourier, indexing;discrete, indexing;multidimensional, method;multimedia, method;SVD;distance-based, neighbor, scaling, searching;database, transforms;multimedia, value}, doi = {10.1109/ICPR.2008.4760937}, author = {Samet, Hanan} } @article {18544, title = {Accountable internet protocol (aip)}, journal = {SIGCOMM Comput. Commun. Rev.}, volume = {38}, year = {2008}, month = {2008/08//}, pages = {339 - 350}, abstract = {This paper presents AIP (Accountable Internet Protocol), a network architecture that provides accountability as a first-order property. AIP uses a hierarchy of self-certifying addresses, in which each component is derived from the public key of the corresponding entity. We discuss how AIP enables simple solutions to source spoofing, denial-of-service, route hijacking, and route forgery. We also discuss how AIP{\textquoteright}s design meets the challenges of scaling, key management, and traffic engineering.}, keywords = {accountability, address, internet architecture, scalability, Security}, isbn = {0146-4833}, doi = {10.1145/1402946.1402997}, url = {http://doi.acm.org/10.1145/1402946.1402997}, author = {Andersen,David G. and Balakrishnan,Hari and Feamster, Nick and Koponen,Teemu and Moon,Daekyeong and Shenker,Scott} } @conference {12111, title = {Adopting Curvilinear Component Analysis to Improve Software Cost Estimation Accuracy. Model, Application Strategy, and an Experimental Verification}, booktitle = {In G. Visaggio (Ed.), 12 th International Conference on Evaluation and Assessment in Software Engineering. BCS eWIC}, year = {2008}, month = {2008///}, abstract = {Cost estimation is a critical issue for software organizations. Good estimates can help us make more informed decisions (controlling and planning software risks), if they are reliable (correct) and valid (stable). In this study, we apply a variable reduction technique (based on auto-associative feed--forward neural networks {\textendash} called Curvilinear component analysis) to log-linear regression functions calibrated with ordinary least squares. Based on a COCOMO 81 data set, we show that Curvilinear component analysis can improve the estimation model accuracy by turning the initial input variables into an equivalent and more compact representation. We show that, the models obtained by applying Curvilinear component analysis are more parsimonious, correct, and reliable.}, author = {Sarcia,Salvatore A. and Cantone,Giovanni and Basili, Victor R.} } @article {15835, title = {Advances in multilingual and multimodal information retrieval}, journal = {Lecture Notes in Computer Science}, volume = {5152}, year = {2008}, month = {2008///}, author = {Peters,C. and Jijkoun,V. and Mandl,T. and M{\"u}ller,H. and Oard, Douglas and Pe{\~n}as,A. and Santos,D.} } @conference {17763, title = {An AGM-based belief revision mechanism for probabilistic spatio-temporal logics}, booktitle = {Proceedings of the 23rd national conference on Artificial intelligence}, year = {2008}, month = {2008///}, pages = {511 - 516}, author = {Parker,A. and Infantes,G. and V.S. Subrahmanian and Grant,J.} } @article {17684, title = {Algorithm 879: EIGENTEST{\textemdash}a test matrix generator for large-scale eigenproblems}, journal = {ACM Trans. Math. Softw.}, volume = {35}, year = {2008}, month = {2008/07//}, pages = {7:1{\textendash}7:11 - 7:1{\textendash}7:11}, abstract = {Eigentest is a package that produces real test matrices with known eigensystems. A test matrix, called an eigenmat, is generated in a factored form, in which the user can specify the eigenvalues and has some control over the condition of the eigenvalues and eigenvectors. An eigenmat A of order n requires only O(n) storage for its representation. Auxiliary programs permit the computation of (A - sI)b, (A - sI)Tb, (A - sI)-1 b, and (A - sI)-T b in O(n) operations. A special routine computes specified eigenvectors of an eigenmat and the condition of its eigenvalue. Thus eigenmats are suitable for testing algorithms based on Krylov sequences, as well as others based on matrix-vector products. This article introduces the eigenmat and describes implementations in Fortran 77, Fortran 95, C, and Matlab.}, keywords = {Eigensystem, test matrix generation}, isbn = {0098-3500}, doi = {10.1145/1377603.1377610}, url = {http://doi.acm.org/10.1145/1377603.1377610}, author = {Lee,Che-Rung and Stewart, G.W.} } @article {12552, title = {Algorithmic and Architectural Optimizations for Computationally Efficient Particle Filtering}, journal = {Image Processing, IEEE Transactions on}, volume = {17}, year = {2008}, month = {2008/05//}, pages = {737 - 748}, abstract = {In this paper, we analyze the computational challenges in implementing particle filtering, especially to video sequences. Particle filtering is a technique used for filtering nonlinear dynamical systems driven by non-Gaussian noise processes. It has found widespread applications in detection, navigation, and tracking problems. Although, in general, particle filtering methods yield improved results, it is difficult to achieve real time performance. In this paper, we analyze the computational drawbacks of traditional particle filtering algorithms, and present a method for implementing the particle filter using the Independent Metropolis Hastings sampler, that is highly amenable to pipelined implementations and parallelization. We analyze the implementations of the proposed algorithm, and, in particular, concentrate on implementations that have minimum processing times. It is shown that the design parameters for the fastest implementation can be chosen by solving a set of convex programs. The proposed computational methodology was verified using a cluster of PCs for the application of visual tracking. We demonstrate a linear speedup of the algorithm using the methodology proposed in the paper.}, keywords = {Automated;Reproducibility of Results;Sensitivity and Specificity;Signal Processing, Computer-Assisted;Models, Computer-Assisted;Video Recording;, convex program;independent Metropolis Hastings sampler;nonGaussian noise process;nonlinear dynamical system filtering;particle filtering algorithm;pipelined architectural optimization;video sequences;visual tracking;convex programming;image sequences;opti, Statistical;Pattern Recognition}, isbn = {1057-7149}, doi = {10.1109/TIP.2008.920760}, author = {Sankaranarayanan,A. C and Srivastava, A. and Chellapa, Rama} } @conference {16069, title = {Aligning temporal data by sentinel events: discovering patterns in electronic health records}, booktitle = {Proceedings of the twenty-sixth annual SIGCHI conference on Human factors in computing systems}, series = {CHI {\textquoteright}08}, year = {2008}, month = {2008///}, pages = {457 - 466}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Electronic Health Records (EHRs) and other temporal databases contain hidden patterns that reveal important cause-and-effect phenomena. Finding these patterns is a challenge when using traditional query languages and tabular displays. We present an interactive visual tool that complements query formulation by providing operations to align, rank and filter the results, and to visualize estimates of the intervals of validity of the data. Display of patient histories aligned on sentinel events (such as a first heart attack) enables users to spot precursor, co-occurring, and aftereffect events. A controlled study demonstrates the benefits of providing alignment (with a 61\% speed improvement for complex tasks). A qualitative study and interviews with medical professionals demonstrates that the interface can be learned quickly and seems to address their needs.}, keywords = {electronic health record, Evaluation, Information Visualization, search, temporal data, Uncertainty}, isbn = {978-1-60558-011-1}, doi = {10.1145/1357054.1357129}, url = {http://doi.acm.org/10.1145/1357054.1357129}, author = {Wang,Taowei David and Plaisant, Catherine and Quinn,Alexander J. and Stanchak,Roman and Murphy,Shawn and Shneiderman, Ben} } @article {13724, title = {Applying automatically generated semantic knowledge: A case study in machine translation}, journal = {NSF Symposium on Semantic Knowledge Discovery, Organization and Use}, year = {2008}, month = {2008///}, abstract = {In this paper, we discuss how we apply automatically generated semantic knowledge to benefit statisticalmachine translation (SMT). Currently, almost all statistical machine translation systems rely heavily on memorizing translations of phrases. Some systems attempt to go further and generalize these learned phrase translations into templates using empirically derived information about word alignments and a small amount of syntactic information, if at all. There are several issues in a SMT pipeline that could be addressed by the application of semantic knowledge, if such knowledge were easily available. One such issue, an important one, is that of reference sparsity. The fundamental problem that translation systems have to face is that there is no such thing as the correct translation for any sentence. In fact, any given source sentence can often be translated into the target language in many valid ways. Since there can be many {\textquotedblleft}correct answers,{\textquotedblright} almost all models employed by SMT systems require, in addition to a large bitext, a held-out development set comprised of multiple high-quality, human-authored reference translations in the target language in order to tune their parameters relative to a translation quality metric.1 There are several reasons that this requirement is not an easy one to satisfy. First, with a few exceptions{\textemdash}notably NIST{\textquoteright}s annual MT evaluations{\textemdash}most new MT research data sets are provided with only a single reference translation. Second, obtaining multiple reference translations in rapid development, low-density source language scenarios (e.g. (Oard, 2003)) is likely to be severely limited (or made entirely impractical) by limitations of time, cost, and ready availability of qualified translators. }, author = {Madnani,N. and Resnik, Philip and Dorr, Bonnie J and Schwartz,R.} } @conference {14848, title = {Approximate earth mover{\textquoteright}s distance in linear time}, booktitle = {Computer Vision and Pattern Recognition, 2008. CVPR 2008. IEEE Conference on}, year = {2008}, month = {2008/06//}, pages = {1 - 8}, abstract = {The earth moverpsilas distance (EMD) is an important perceptually meaningful metric for comparing histograms, but it suffers from high (O(N3 logN)) computational complexity. We present a novel linear time algorithm for approximating the EMD for low dimensional histograms using the sum of absolute values of the weighted wavelet coefficients of the difference histogram. EMD computation is a special case of the Kantorovich-Rubinstein transshipment problem, and we exploit the Holder continuity constraint in its dual form to convert it into a simple optimization problem with an explicit solution in the wavelet domain. We prove that the resulting wavelet EMD metric is equivalent to EMD, i.e. the ratio of the two is bounded. We also provide estimates for the bounds. The weighted wavelet transform can be computed in time linear in the number of histogram bins, while the comparison is about as fast as for normal Euclidean distance or chi2 statistic. We experimentally show that wavelet EMD is a good approximation to EMD, has similar performance, but requires much less computation.}, keywords = {algorithm;normal, complexity;earth, complexity;image, constraint;Kantorovich-Rubinstein, continuity, distance;histograms;linear, distance;weighted, Euclidean, Holder, matching;wavelet, movers, problem;computational, TIME, transform;computational, transforms;, transshipment, wavelet}, doi = {10.1109/CVPR.2008.4587662}, author = {Shirdhonkar,S. and Jacobs, David W.} } @conference {17559, title = {Approximation Algorithms for Computing Capacity of Wireless Networks with SINR Constraints}, booktitle = {IEEE INFOCOM 2008. The 27th Conference on Computer Communications}, year = {2008}, month = {2008/04/13/18}, pages = {1166 - 1174}, publisher = {IEEE}, organization = {IEEE}, abstract = {A fundamental problem in wireless networks is to estimate its throughput capacity - given a set of wireless nodes, and a set of connections, what is the maximum rate at which data can be sent on these connections. Most of the research in this direction has focused on either random distributions of points, or has assumed simple graph-based models for wireless interference. In this paper, we study capacity estimation problem using the more general Signal to Interference Plus Noise Ratio (SINR) model for interference, on arbitrary wireless networks. The problem becomes much harder in this setting, because of the non-locality of the SINR model. Recent work by Moscibroda et al. (2006) has shown that the throughput in this model can differ from graph based models significantly. We develop polynomial time algorithms to provably approximate the total throughput in this setting.}, keywords = {Algorithm design and analysis, approximation algorithm, Approximation algorithms, approximation theory, Computer networks, Computer science, graph theory, graph-based model, Interference constraints, polynomial time algorithm, Propagation losses, Protocols, radio networks, radiofrequency interference, signal to interference plus noise ratio, Signal to noise ratio, Throughput, wireless interference, wireless network, Wireless networks}, isbn = {978-1-4244-2025-4}, doi = {10.1109/INFOCOM.2008.172}, author = {Chafekar,D. and Kumart,V. S.A and Marathe,M. V and Parthasarathy,S. and Srinivasan, Aravind} } @inbook {15716, title = {Arabic/English Multi-document Summarization with CLASSYThe Past and the Future}, booktitle = {Computational Linguistics and Intelligent Text Processing, Lecture Notes in Computer Science Volume 4919Computational Linguistics and Intelligent Text Processing, Lecture Notes in Computer Science Volume 4919}, year = {2008}, month = {2008///}, pages = {568 - 581}, publisher = {Springer Berlin}, organization = {Springer Berlin}, url = {http://dx.doi.org/10.1007/978-3-540-78135-6_49http://dx.doi.org/10.1007/978-3-540-78135-6_49}, author = {Schlesinger,Judith D. and O{\textquoteright}Leary, Dianne P. and Conroy,John M.} } @article {14949, title = {Archiving Temporal Web Information: Organization of Web Contents for Fast Access and Compact Storage}, volume = {UMIACS-TR-2008-08}, year = {2008}, month = {2008/04/07/}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {We address the problem of archiving dynamic web contents oversignificant time spans. Current schemes crawl the web contents at regular time intervals and archive the contents after each crawl regardless of whether or not the contents have changed between consecutive crawls. Our goal is to store newly crawled web contents only when they are different than the previous crawl, while ensuring accurate and quick retrieval of archived contents based on arbitrary temporal queries over the archived time period. In this paper, we develop a scheme that stores unique temporal web contents in containers following the widely used ARC/WARC format, and that provides quick access to the archived contents for arbitrary temporal queries. A novel component of our scheme is the use of a new indexing structure based on the concept of persistent or multi-version data structures. Our scheme can be shown to be asymptotically optimal both in storage utilization and insert/retrieval time. We illustrate the performance of our method on two very different data sets from the Stanford WebBase project, the first reflecting very dynamic web contents and the second relatively static web contents. The experimental results clearly illustrate the substantial storage savings achieved by eliminating duplicate contents detected between consecutive crawls, as well as the speed at which our method can find the archived contents specified through arbitrary temporal queries. }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/7569}, author = {Song,Sangchul and JaJa, Joseph F.} } @article {13725, title = {Are multiple reference translations necessary? investigating the value of paraphrased reference translations in parameter optimization}, journal = {Proceedings of the Eighth Conference of the Association for Machine Translation in the Americas, October}, year = {2008}, month = {2008///}, abstract = {Most state-of-the-art statistical machine trans-lation systems use log-linear models, which are defined in terms of hypothesis features and weights for those features. It is standard to tune the feature weights in order to maxi- mize a translation quality metric, using held- out test sentences and their corresponding ref- erence translations. However, obtaining refer- ence translations is expensive. In our earlier work (Madnani et al., 2007), we introduced a new full-sentence paraphrase technique, based on English-to-English decoding with an MT system, and demonstrated that the resulting paraphrases can be used to cut the number of human reference translations needed in half. In this paper, we take the idea a step further, asking how far it is possible to get with just a single good reference translation for each item in the development set. Our analysis suggests that it is necessary to invest in four or more hu- man translations in order to significantly im- prove on a single translation augmented by monolingual paraphrases. }, author = {Madnani,N. and Resnik, Philip and Dorr, Bonnie J and Schwartz,R.} } @conference {16837, title = {Augmenting spatio-textual search with an infectious disease ontology}, booktitle = {Data Engineering Workshop, 2008. ICDEW 2008. IEEE 24th International Conference on}, year = {2008}, month = {2008/04//}, pages = {266 - 269}, abstract = {A system is described that automatically categorizes and classifies infectious disease incidence reports by type and geographic location, to aid analysis by domain experts. It identifies references to infectious diseases by using a disease ontology. The system leverages the textual and spatial search capabilities of the STEWARD system to enable queries such as reports on "influenza" near "Hong Kong", possibly within a particular time period. Documents from the U.S. National Library of Medicine (http://www.pubmed.gov) and the World Health Organization (http://www.who.int) are tagged so that spatial relationships to specific disease occurrences can be presented graphically via a map interface. In addition, newspaper articles can be tagged and indexed to bolster the surveillance of ongoing epidemics. Examining past epidemics using this system may lead to improved understanding of the cause and spread of infectious diseases.}, keywords = {(artificial, article;ontology;spatio-textual, disease;map, engines;, information, intelligence);search, interface;newspaper, search;classification;diseases;indexing;medical, STEWARD, system;classification;epidemics;indexing;infectious, systems;ontologies}, doi = {10.1109/ICDEW.2008.4498330}, author = {Lieberman,M.D. and Sankaranarayanan,J. and Samet, Hanan and Sperling,J.} } @article {13129, title = {Automatic online tuning for fast Gaussian summation}, journal = {Advances in Neural Information Processing Systems}, year = {2008}, month = {2008///}, abstract = {Many machine learning algorithms require the summation of Gaussian kernelfunctions, an expensive operation if implemented straightforwardly. Several meth- ods have been proposed to reduce the computational complexity of evaluating such sums, including tree and analysis based methods. These achieve varying speedups depending on the bandwidth, dimension, and prescribed error, making the choice between methods difficult for machine learning tasks. We provide an algorithm that combines tree methods with the Improved Fast Gauss Transform (IFGT). As originally proposed the IFGT suffers from two problems: (1) the Taylor series expansion does not perform well for very low bandwidths, and (2) parameter se- lection is not trivial and can drastically affect performance and ease of use. We address the first problem by employing a tree data structure, resulting in four eval- uation methods whose performance varies based on the distribution of sources and targets and input parameters such as desired accuracy and bandwidth. To solve the second problem, we present an online tuning approach that results in a black box method that automatically chooses the evaluation method and its parameters to yield the best performance for the input data, desired accuracy, and bandwidth. In addition, the new IFGT parameter selection approach allows for tighter error bounds. Our approach chooses the fastest method at negligible additional cost, and has superior performance in comparisons with previous approaches. }, author = {Morariu,V. and Srinivasan,B.V. and Raykar,V.C. and Duraiswami, Ramani and Davis, Larry S.} } @article {17757, title = {AVA: Adjective-Verb-Adverb Combinations for Sentiment Analysis}, journal = {Intelligent Systems, IEEE}, volume = {23}, year = {2008}, month = {2008/08//july}, pages = {43 - 50}, abstract = {Most research on determining the strength of subjective expressions in a sentence or document uses single, specific parts of speech such as adjectives, adverbs, or verbs. To date, almost no research covers the development of a single comprehensive framework in which we can analyze sentiment that takes all three into account. The authors propose the AVA (adjective verb adverb) framework for identifying opinions on any given topic. In AVA, a user can select any topic t of interest and any document d. AVA will return a score that d expresses topic t. The score is expressed on a $\#$x02013;1 (maximally negative) to +1 (maximally positive) scale.}, isbn = {1541-1672}, doi = {10.1109/MIS.2008.57}, author = {V.S. Subrahmanian and Reforgiato,Diego} } @article {13052, title = {A Bayesian statistics approach to multiscale coarse graining}, journal = {The Journal of chemical physics}, volume = {129}, year = {2008}, month = {2008///}, pages = {214114 - 214114}, author = {Liu,P. and Shi,Q. and Daum{\'e}, Hal and Voth,G. A} } @conference {16073, title = {BELIV{\textquoteright}08: Beyond time and errors: novel evaluation methods for information visualization}, booktitle = {CHI {\textquoteright}08 extended abstracts on Human factors in computing systems}, series = {CHI EA {\textquoteright}08}, year = {2008}, month = {2008///}, pages = {3913 - 3916}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Information visualization systems allow users to produce insights, innovations and discoveries. Evaluating such tools is a challenging task and the goal of BELIV{\textquoteright}08 is to make a step ahead in the comprehension of such a complex activity. Current evaluation methods exhibit noticeable limitations and researchers in the area experiment some frustration with evaluation processes that are time consuming and too often leading to unsatisfactory results. The most used evaluation metrics such as task time completion and number of errors appear insufficient to quantify the quality of an information visualization system; thus the name of the workshop: "beyond time and errors".}, keywords = {Evaluation, Information Visualization}, isbn = {978-1-60558-012-8}, doi = {10.1145/1358628.1358955}, url = {http://doi.acm.org/10.1145/1358628.1358955}, author = {Bertini,Enrico and Perer,Adam and Plaisant, Catherine and Santucci,Giuseppe} } @article {16240, title = {Bioinformatics challenges of new sequencing technology}, journal = {Trends in Genetics}, volume = {24}, year = {2008}, month = {2008/03//}, pages = {142 - 149}, abstract = {New DNA sequencing technologies can sequence up to one billion bases in a single day at low cost, putting large-scale sequencing within the reach of many scientists. Many researchers are forging ahead with projects to sequence a range of species using the new technologies. However, these new technologies produce read lengths as short as 35{\^a}{\texteuro}{\textquotedblleft}40 nucleotides, posing challenges for genome assembly and annotation. Here we review the challenges and describe some of the bioinformatics systems that are being proposed to solve them. We specifically address issues arising from using these technologies in assembly projects, both de novo and for resequencing purposes, as well as efforts to improve genome annotation in the fragmented assemblies produced by short read lengths.}, isbn = {0168-9525}, doi = {10.1016/j.tig.2007.12.006}, url = {http://www.sciencedirect.com/science/article/pii/S016895250800022X}, author = {Pop, Mihai and Salzberg,Steven L.} } @conference {12246, title = {Bittorrent is an auction: analyzing and improving bittorrent{\textquoteright}s incentives}, booktitle = {Proceedings of the ACM SIGCOMM 2008 conference on Data communication}, series = {SIGCOMM {\textquoteright}08}, year = {2008}, month = {2008///}, pages = {243 - 254}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Incentives play a crucial role in BitTorrent, motivating users to upload to others to achieve fast download times for all peers. Though long believed to be robust to strategic manipulation, recent work has empirically shown that BitTorrent does not provide its users incentive to follow the protocol. We propose an auction-based model to study and improve upon BitTorrent{\textquoteright}s incentives. The insight behind our model is that BitTorrent uses, not tit-for-tat as widely believed, but an auction to decide which peers to serve. Our model not only captures known, performance-improving strategies, it shapes our thinking toward new, effective strategies. For example, our analysis demonstrates, counter-intuitively, that BitTorrent peers have incentive to intelligently under-report what pieces of the file they have to their neighbors. We implement and evaluate a modification to BitTorrent in which peers reward one another with proportional shares of bandwidth. Within our game-theoretic model, we prove that a proportional-share client is strategy-proof. With experiments on PlanetLab, a local cluster, and live downloads, we show that a proportional-share unchoker yields faster downloads against BitTorrent and BitTyrant clients, and that under-reporting pieces yields prolonged neighbor interest.}, keywords = {auctions, bittorrent, incentive systems, proportional share, tit-for-tat}, isbn = {978-1-60558-175-0}, doi = {10.1145/1402958.1402987}, url = {http://doi.acm.org/10.1145/1402958.1402987}, author = {Levin,Dave and LaCurts,Katrina and Spring, Neil and Bhattacharjee, Bobby} } @article {17693, title = {Block Gram{\textendash}Schmidt Orthogonalization}, journal = {SIAM Journal on Scientific Computing}, volume = {31}, year = {2008}, month = {2008///}, pages = {761 - 775}, abstract = {The classical Gram{\textendash}Schmidt algorithm for computing the QR factorization of a matrix $X$ requires at least one pass over the current orthogonalized matrix $Q$ as each column of $X$ is added to the factorization. When $Q$ becomes so large that it must be maintained on a backing store, each pass involves the costly transfer of data from the backing store to main memory. However, if one orthogonalizes the columns of $X$ in blocks of $m$ columns, the number of passes is reduced by a factor of $1/m$. Moreover, matrix-vector products are converted into matrix-matrix products, allowing level-3 BLAS cache performance. In this paper we derive such a block algorithm and give some experimental results that suggest it can be quite effective for large scale problems, even when the matrix $X$ is rank degenerate.}, keywords = {blocked algorithm, GramSchmidt algorithm, orthogonalization, QR factorization}, doi = {10.1137/070682563}, url = {http://link.aip.org/link/?SCE/31/761/1}, author = {Stewart, G.W.} } @inbook {17569, title = {Budgeted Allocations in the Full-Information Setting}, booktitle = {Approximation, Randomization and Combinatorial Optimization. Algorithms and TechniquesApproximation, Randomization and Combinatorial Optimization. Algorithms and Techniques}, series = {Lecture Notes in Computer Science}, volume = {5171}, year = {2008}, month = {2008///}, pages = {247 - 253}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {We build on the work of Andelman \& Mansour and Azar, Birnbaum, Karlin, Mathieu \& Thach Nguyen to show that the full-information (i.e., offline) budgeted-allocation problem can be approximated to within 4/3: we conduct a rounding of the natural LP relaxation, for which our algorithm matches the known lower-bound on the integrality gap.}, isbn = {978-3-540-85362-6}, url = {http://dx.doi.org/10.1007/978-3-540-85363-3_20}, author = {Srinivasan, Aravind}, editor = {Goel,Ashish and Jansen,Klaus and Rolim,Jos{\'e} and Rubinfeld,Ronitt} } @conference {17570, title = {Capacity of Asynchronous Random-Access Scheduling in Wireless Networks}, booktitle = {IEEE INFOCOM 2008. The 27th Conference on Computer Communications}, year = {2008}, month = {2008/04/13/18}, pages = {1148 - 1156}, publisher = {IEEE}, organization = {IEEE}, abstract = {We study the throughput capacity of wireless networks which employ (asynchronous) random-access scheduling as opposed to deterministic scheduling. The central question we answer is: how should we set the channel-access probability for each link in the network so that the network operates close to its optimal throughput capacity? We design simple and distributed channel-access strategies for random-access networks which are provably competitive with respect to the optimal scheduling strategy, which is deterministic, centralized, and computationally infeasible. We show that the competitiveness of our strategies are nearly the best achievable via random-access scheduling, thus establishing fundamental limits on the performance of random- access. A notable outcome of our work is that random access compares well with deterministic scheduling when link transmission durations differ by small factors, and much worse otherwise. The distinguishing aspects of our work include modeling and rigorous analysis of asynchronous communication, asymmetry in link transmission durations, and hidden terminals under arbitrary link-conflict based wireless interference models.}, keywords = {asynchronous random-access scheduling, channel access probability, Computer networks, Computer science, Educational institutions, Interference, Optimal scheduling, Peer to peer computing, probability, Processor scheduling, radio link, radio links, radio networks, Routing, scheduling, Throughput, throughput capacity, wireless channels, Wireless networks}, isbn = {978-1-4244-2025-4}, doi = {10.1109/INFOCOM.2008.170}, author = {Chafekar,D. and Levin,D. and Kumar,V. S.A and Marathe,M. V and Parthasarathy,S. and Srinivasan, Aravind} } @conference {16329, title = {CiCUTS: Combining System Execution Modeling Tools with Continuous Integration Environments}, booktitle = {Engineering of Computer-Based Systems, IEEE International Conference on the}, year = {2008}, month = {2008///}, pages = {66 - 75}, publisher = {IEEE Computer Society}, organization = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, abstract = {System execution modeling (SEM) tools provide an effective means to evaluate the quality of service (QoS) of enterprise distributed real-time and embedded (DRE) systems. SEM tools facilitate testing and resolving performance issues throughout the entire development life-cycle, rather than waiting until final system integration. SEM tools have not historically focused on effective testing. New techniques are therefore needed to help bridge the gap between the early integration capabilities of SEM tools and testing so developers can focus on resolving strategic integration and performance issues, as opposed to wrestling with tedious and error-prone low-level testing concerns. This paper provides two contributions to research on using SEM tools to address enterprise DRE system integration challenges. First, we evaluate several approaches for combining continuous integration environments with SEM tools and describe CiCUTS, which combines the CUTS SEM tool with the CruiseControl .NET continuous integration environment. Second, we present a case study that shows how CiCUTS helps reduce the time and effort required to manage and execute integration tests that evaluate QoS metrics for a representative DRE system from the domain of shipboard computing. The results of our case study show that CiCUTS helps developers and testers ensure the performance of an example enterprise DRE system is within its QoS specifications throughout development, instead of waiting until system integration time to evaluate QoS.}, keywords = {continuous integration, integration testing, serialized phasing, system execution modeling}, isbn = {978-0-7695-3141-0}, doi = {http://doi.ieeecomputersociety.org/10.1109/ECBS.2008.20}, author = {Hill,James H. and Schmidt,Douglas C. and Porter, Adam and Slaby,John M.} } @article {14375, title = {Collective Classification in Network Data}, journal = {AI Magazine}, volume = {29}, year = {2008}, month = {2008/09/06/}, pages = {93 - 93}, abstract = {Collective Classification in Network Data}, isbn = {0738-4602}, doi = {10.1609/aimag.v29i3.2157}, url = {http://www.aaai.org/ojs/index.php/aimagazine/article/viewArticle/2157}, author = {Sen,Prithviraj and Namata,Galileo and Bilgic,Mustafa and Getoor, Lise and Galligher,Brian and Eliassi-Rad,Tina} } @inbook {13522, title = {Combining Classifiers with Informational Confidence}, booktitle = {Studies in Computational Intelligence: Machine Learning in Document Analysis and RecognitionStudies in Computational Intelligence: Machine Learning in Document Analysis and Recognition}, year = {2008}, month = {2008///}, pages = {163 - 192}, publisher = {Springer}, organization = {Springer}, abstract = {We propose a new statistical method for learning normalized confidence values in multiple classifier systems. Our main idea is to adjust confidence values so that their nominal values equal the information actually conveyed. In order to do so, we assume that information depends on the actual performance of each confidence value on an evaluation set. As information measure, we use Shannon{\textquoteright}s well-known logarithmic notion of information. With the confidence values matching their informational content, the classifier combination scheme reduces to the simple sum-rule, theoretically justifying this elementary combination scheme. In experimental evaluations for script identification, and both handwritten and printed character recognition, we achieve a consistent improvement on the best single recognition rate. We cherish the hope that our information-theoretical framework helps fill the theoretical gap we still experience in classifier combination, and puts the excellent practical performance of multiple classifier systems on a more solid basis.}, author = {Jaeger,Stefan and Ma,Huanfeng and David Doermann}, editor = {Simone Marinai,Hiromichi Fujisawa} } @conference {18898, title = {Combining Domain-Independent Planning and HTN Planning: The Duet Planner}, year = {2008}, month = {2008///}, pages = {573 - 577}, publisher = {IOS Press}, organization = {IOS Press}, address = {Amsterdam, The Netherlands, The Netherlands}, abstract = {Despite the recent advances in planning for classical domains, the question of how to use domain knowledge in planning is yet to be completely and clearly answered. Some of the existing planners use domain-independent search heuristics, and some others depend on intensively-engineered domain-specific knowledge to guide the planning process. In this paper, we describe an approach to combine ideas from both of the above schools of thought. We present Duet, our planning system that incorporates the ability of using hierarchical domain knowledge in the form of Hierarchical Task Networks (HTNs) as in SHOP2 [14] and using domain-independent local search techniques as in LPG [8]. In our experiments, Duet was able to solve much larger problems than LPG could solve, with only minimal domain knowledge encoded in HTNs (much less domain knowledge than SHOP2 needed to solve those problems by itself).}, isbn = {978-1-58603-891-5}, url = {http://dl.acm.org/citation.cfm?id=1567281.1567406}, author = {Gerevini,Alfonso and Kuter,Ugur and Nau, Dana S. and Saetti,Alessandro and Waisbrot,Nathaniel} } @article {17021, title = {Community response grid (CRG) for a university campus: Design requirements and implications}, journal = {Proceedings of the 5th International ISCRAM Conference}, year = {2008}, month = {2008///}, pages = {34 - 43}, abstract = {This paper describes the initial stages of the participatory design of a community-oriented emergency responsesystem for a university campus. After reviewing related work and the current University emergency response system, this paper describes our participatory design process, discusses initial findings from a design requirement survey and from our interactions with different stakeholders, and proposes a Web interface design for a community response grid system. The prototyping of the system demonstrates the possibility of fostering a social-network-based community participation in emergency response, and also identifies concerns raised by potential users and by the professional responder community. }, author = {Wu,P.F. and Qu,Y. and Preece,J. and Fleischmann,K. and Golbeck,J. and Jaeger,P. and Shneiderman, Ben} } @conference {18681, title = {On the Comparison of Network Attack Datasets: An Empirical Analysis}, year = {2008}, month = {2008/12//}, pages = {39 - 48}, abstract = {Network malicious activity can be collected and reported by various sources using different attack detection solutions. The granularity of these solutions provides either very detailed information (intrusion detection systems, honeypots) or high-level trends (CAIDA, SANS). The problem for network security operators is often to select the sources of information to better protect their network. How much information from these sources is redundant and how much is unique? The goal of this paper is to show empirically that while some global attack events can be correlated across various sensors, the majority of incoming malicious activity has local specificities. This study presents a comparative analysis of four different attack datasets offering three different levels of granularity: 1) two high interaction honeynets deployed at two different locations (i.e., a corporate and an academic environment); 2) ATLAS which is a distributed network telescope from Arbor; and 3) Internet Protecttrade which is a global alerting service from AT amp;T.}, keywords = {ATLAS, distributed network telescope, Internet, intrusion detection systems, network attack datasets, network malicious activity, network security operators, security of data}, doi = {10.1109/HASE.2008.50}, author = {Berthier,R. and Korman,D. and Michel Cukier and Hiltunen,M. and Vesonder,G. and Sheleheda,D.} } @conference {16842, title = {Complexity and Accessibility: Sorting in space: multidimensional, spatial, and metric data structures for CG applications}, booktitle = {International Conference on Computer Graphics and Interactive Techniques}, year = {2008}, month = {2008///}, author = {Samet, Hanan} } @conference {12547, title = {Compressed sensing for multi-view tracking and 3-D voxel reconstruction}, booktitle = {Image Processing, 2008. ICIP 2008. 15th IEEE International Conference on}, year = {2008}, month = {2008/10//}, pages = {221 - 224}, abstract = {Compressed sensing (CS) suggests that a signal, sparse in some basis, can be recovered from a small number of random projections. In this paper, we apply the CS theory on sparse background-subtracted silhouettes and show the usefulness of such an approach in various multi-view estimation problems. The sparsity of the silhouette images corresponds to sparsity of object parameters (location, volume etc.) in the scene. We use random projections (compressed measurements) of the silhouette images for directly recovering object parameters in the scene coordinates. To keep the computational requirements of this recovery procedure reasonable, we tessellate the scene into a bunch of non-overlapping lines and perform estimation on each of these lines. Our method is scalable in the number of cameras and utilizes very few measurements for transmission among cameras. We illustrate the usefulness of our approach for multi-view tracking and 3-D voxel reconstruction problems.}, keywords = {3D, background-subtracted, coding;, Estimation, image, problems;multi-view, projections;silhouette, reconstruction;CS, reconstruction;video, sensing;multi-view, silhouettes;image, sparsity;sparse, theory;compressed, tracking;random, voxel}, doi = {10.1109/ICIP.2008.4711731}, author = {Reddy, D. and Sankaranarayanan,A. C and Cevher, V. and Chellapa, Rama} } @article {12569, title = {Compressive sensing for background subtraction}, journal = {Computer Vision{\textendash}ECCV 2008}, year = {2008}, month = {2008///}, pages = {155 - 168}, abstract = {Compressive sensing (CS) is an emerging field that provides a framework for image recovery using sub-Nyquist sampling rates. The CS theory shows that a signal can be reconstructed from a small set of random projections, provided that the signal is sparse in some basis, e.g., wavelets. In this paper, we describe a method to directly recover background subtracted images using CS and discuss its applications in some communication constrained multi-camera computer vision problems. We show how to apply the CS theory to recover object silhouettes (binary background subtracted images) when the objects of interest occupy a small portion of the camera view, i.e., when they are sparse in the spatial domain. We cast the background subtraction as a sparse approximation problem and provide different solutions based on convex optimization and total variation. In our method, as opposed to learning the background, we learn and adapt a low dimensional compressed representation of it, which is sufficient to determine spatial innovations; object silhouettes are then estimated directly using the compressive samples without any auxiliary image reconstruction. We also discuss simultaneous appearance recovery of the objects using compressive measurements. In this case, we show that it may be necessary to reconstruct one auxiliary image. To demonstrate the performance of the proposed algorithm, we provide results on data captured using a compressive single-pixel camera. We also illustrate that our approach is suitable for image coding in communication constrained problems by using data captured by multiple conventional cameras to provide 2D tracking and 3D shape reconstruction results with compressive measurements.}, author = {Cevher, V. and Sankaranarayanan, A. and Duarte, M. and Reddy, D. and Baraniuk, R. and Chellapa, Rama} } @article {14599, title = {Computational Analysis of Constraints on Noncoding Regions, Coding Regions and Gene Expression in Relation to Plasmodium Phenotypic Diversity}, journal = {PLoS ONEPLoS ONE}, volume = {3}, year = {2008}, month = {2008///}, pages = {e3122 - e3122}, abstract = {Malaria-causing Plasmodium species exhibit marked differences including host choice and preference for invading particular cell types. The genetic bases of phenotypic differences between parasites can be understood, in part, by investigating constraints on gene expression and genic sequences, both coding and regulatory.We investigated the evolutionary constraints on sequence and expression of parasitic genes by applying comparative genomics approaches to 6 Plasmodium genomes and 2 genome-wide expression studies. We found that the coding regions of Plasmodium transcription factor and sexual development genes are relatively less constrained, as are those of genes encoding CCCH zinc fingers and invasion proteins, which all play important roles in these parasites. Transcription factors and genes with stage-restricted expression have conserved upstream regions and so do several gene classes critical to the parasite{\textquoteright}s lifestyle, namely, ion transport, invasion, chromatin assembly and CCCH zinc fingers. Additionally, a cross-species comparison of expression patterns revealed that Plasmodium-specific genes exhibit significant expression divergence. Overall, constraints on Plasmodium{\textquoteright}s protein coding regions confirm observations from other eukaryotes in that transcription factors are under relatively lower constraint. Proteins relevant to the parasite{\textquoteright}s unique lifestyle also have lower constraint on their coding regions. Greater conservation between Plasmodium species in terms of promoter motifs suggests tight regulatory control of lifestyle genes. However, an interspecies divergence in expression patterns of these genes suggests that either expression is controlled via genomic or epigenomic features not encoded in the proximal promoter sequence, or alternatively, the combinatorial interactions between motifs confer species-specific expression patterns. }, doi = {10.1371/journal.pone.0003122}, url = {UR - http://dx.doi.org/10.1371/journal.pone.0003122,http://dx.doi.org/10.1371/journal.pone.0003122}, author = {Essien,Kobby and Hannenhalli, Sridhar and Stoeckert,Christian J.} } @article {17764, title = {Computational cultural dynamics}, journal = {IEEE intelligent systems}, volume = {23}, year = {2008}, month = {2008///}, pages = {51 - 57}, author = {Martinez,V. and Simari,G. I and Sliva,A. and V.S. Subrahmanian} } @article {12567, title = {Computational Vision Approaches for Event Modeling}, journal = {Understanding Events}, volume = {1}, year = {2008}, month = {2008///}, pages = {473 - 522}, abstract = {Event modeling systems provide a semantic interpretation of sequences of pixels that are captured by a video camera. The design of a practical system has to take into account the following three main factors: low-level preprocessing limitations, computational and storage complexity of the event model, and user interaction. The hidden Markov model (HMM) and its variants have been widely used to model both speech and video signals. Computational efficiency of the Baum-Welch and the Viterbi algorithms has been a leading reason for the popularity of the HMM. Since the objective is to detect events in video sequences that are meaningful to humans, one might want to provide space in the design loop for a user who can specify events of interest. This chapter explores this using semantic approaches that not only use features extracted from raw video streams but also incorporate metadata and ontologies of activities. It presents three approaches for applications such as event recognition: anomaly detection, temporal segmentation, and ontology evaluation. The three approaches discussed are statistical methods based on HMMs, formal grammars, and ontologies. The effectiveness of these approaches is illustrated using video sequences captured both indoors and outdoors: the indoor UCF human action dataset, the TSA airport tarmac surveillance dataset, and the bank monitoring dataset.}, author = {Chellapa, Rama and Cuntoor, N.P. and Joo, S.W. and V.S. Subrahmanian and Turaga,P.} } @article {17932, title = {Confluent Volumetric Visualization of Gyrokinetic Turbulence}, journal = {Plasma Science, IEEE Transactions on}, volume = {36}, year = {2008}, month = {2008/08//}, pages = {1112 - 1113}, abstract = {Data from gyrokinetic turbulence codes are often difficult to visualize due their high dimensionality, the nontrivial geometry of the underlying grids, and the vast range of spatial scales. We present an interactive visualization framework that attempts to address these issues. Images from a nonlinear gyrokinetic simulation are presented.}, keywords = {flow;plasma, geometry;plasma, gyrokinetic, simulation;nontrivial, simulation;plasma, turbulence;, turbulence;nonlinear, turbulence;volumetric, visualisation;plasma, visualization;flow}, isbn = {0093-3813}, doi = {10.1109/TPS.2008.924509}, author = {Stantchev,G. and Juba,D. and Dorland,W. and Varshney, Amitabh} } @article {12549, title = {A Constrained Probabilistic Petri Net Framework for Human Activity Detection in Video}, journal = {Multimedia, IEEE Transactions on}, volume = {10}, year = {2008}, month = {2008/10//}, pages = {982 - 996}, abstract = {Recognition of human activities in restricted settings such as airports, parking lots and banks is of significant interest in security and automated surveillance systems. In such settings, data is usually in the form of surveillance videos with wide variation in quality and granularity. Interpretation and identification of human activities requires an activity model that a) is rich enough to handle complex multi-agent interactions, b) is robust to uncertainty in low-level processing and c) can handle ambiguities in the unfolding of activities. We present a computational framework for human activity representation based on Petri nets. We propose an extension-Probabilistic Petri Nets (PPN)-and show how this model is well suited to address each of the above requirements in a wide variety of settings. We then focus on answering two types of questions: (i) what are the minimal sub-videos in which a given activity is identified with a probability above a certain threshold and (ii) for a given video, which activity from a given set occurred with the highest probability? We provide the PPN-MPS algorithm for the first problem, as well as two different algorithms (naive PPN-MPA and PPN-MPA) to solve the second. Our experimental results on a dataset consisting of bank surveillance videos and an unconstrained TSA tarmac surveillance dataset show that our algorithms are both fast and provide high quality results.}, keywords = {activity, dataset;automated, detection;human, interactions;security, net;human, nets;image, Petri, probabilistic, processing;multiagent, processing;video, representation;low-level, representation;video, signal, Surveillance, surveillance;, systems;constrained, systems;surveillance, tarmac, TSA, videos;Petri}, isbn = {1520-9210}, doi = {10.1109/TMM.2008.2001369}, author = {Albanese, M. and Chellapa, Rama and Moscato, V. and Picariello, A. and V.S. Subrahmanian and Turaga,P. and Udrea,O.} } @article {18823, title = {Content-based assembly search: A step towards assembly reuse}, journal = {Computer-Aided Design}, volume = {40}, year = {2008}, month = {2008/02//}, pages = {244 - 261}, abstract = {The increased use of CAD systems by product development organizations has resulted in the creation of large databases of assemblies. This explosion of assembly data is likely to continue in the future. In many situations, a text-based search alone may not be sufficient to search for assemblies and it may be desirable to search for assemblies based on the content of the assembly models. The ability to perform content-based searches on these databases is expected to help the designers in the following two ways. First, it can facilitate the reuse of existing assembly designs, thereby reducing the design time. Second, a lot of useful designs for manufacturing, and assembly knowledge are implicitly embedded in existing assemblies. Therefore a capability to locate existing assemblies and examine them can be used as a learning tool by designers to learn from the existing assembly designs. This paper describes a system for performing content-based searches on assembly databases. We identify templates for comprehensive search definitions and describe algorithms to perform content-based searches for mechanical assemblies. We also illustrate the capabilities of our system through several examples.}, keywords = {Assembly characteristics, Assembly mating conditions, Content-based assembly search, Graph compatibility}, isbn = {0010-4485}, doi = {10.1016/j.cad.2007.10.012}, url = {http://www.sciencedirect.com/science/article/pii/S0010448507002424}, author = {Deshmukh,Abhijit S. and Banerjee,Ashis Gopal and Gupta, Satyandra K. and Sriram,Ram D.} } @article {17758, title = {CONVEX: Similarity-Based Algorithms for Forecasting Group Behavior}, journal = {Intelligent Systems, IEEE}, volume = {23}, year = {2008}, month = {2008/08//july}, pages = {51 - 57}, abstract = {A proposed framework for predicting a group{\textquoteright}s behavior associates two vectors with that group. The context vector tracks aspects of the environment in which the group functions; the action vector tracks the group{\textquoteright}s previous actions. Given a set of past behaviors consisting of a pair of these vectors and given a query context vector, the goal is to predict the associated action vector. To achieve this goal, two families of algorithms employ vector similarity. CONVEXk _NN algorithms use k-nearest neighbors in high-dimensional metric spaces; CONVEXMerge algorithms look at linear combinations of distances of the query vector from context vectors. Compared to past prediction algorithms, these algorithms are extremely fast. Moreover, experiments on real-world data sets show that the algorithms are highly accurate, predicting actions with well over 95-percent accuracy.}, keywords = {(artificial, algorithm;action, algorithm;behavioural, algorithm;CONVEXk-NN, BEHAVIOR, computing;ontologies, CONVEXMerge, forecasting;high-dimensional, intelligence);, metric, sciences, space;ontology;similarity-based, vector;context, vector;group}, isbn = {1541-1672}, doi = {10.1109/MIS.2008.62}, author = {Martinez,V. and Simari,G. I and Sliva,A. and V.S. Subrahmanian} } @article {17034, title = {Copernican challenges face those who suggest that collaboration, not computation are the driving energy for socio-technical systems that characterize Web 2.0.}, journal = {Science}, volume = {319}, year = {2008}, month = {2008///}, pages = {1349 - 1350}, author = {Shneiderman, Ben} } @article {17581, title = {Cost-Sharing Mechanisms for Network Design}, journal = {Algorithmica}, volume = {50}, year = {2008}, month = {2008///}, pages = {98 - 119}, abstract = {We consider a single-source network design problem from a game-theoretic perspective. Gupta, Kumar and Roughgarden (Proc. 35th Annual ACM STOC, pp. 365{\textendash}372, 2003 ) developed a simple method for a single-source rent-or-buy problem that also yields the best-known approximation ratio for the problem. We show how to use a variant of this method to develop an approximately budget-balanced and group strategyproof cost-sharing method for the problem. The novelty of our approach stems from our obtaining the cost-sharing methods for the rent-or-buy problem by carefully combining cost-shares for the simpler Steiner tree problem. Our algorithm is conceptually simpler than the previous such cost-sharing method due to P{\'a}l and Tardos (Proc. 44th Annual FOCS, pp. 584{\textendash}593, 2003 ), and improves the previously-known approximation factor of 15 to 4.6.}, isbn = {0178-4617}, url = {http://dx.doi.org/10.1007/s00453-007-9065-y}, author = {Gupta,Anupam and Srinivasan, Aravind and Tardos,{\'E}va} } @conference {16415, title = {CrossNet: a framework for crossover with network-based chromosomal representations}, booktitle = {Proceedings of the 10th annual conference on Genetic and evolutionary computation}, series = {GECCO {\textquoteright}08}, year = {2008}, month = {2008///}, pages = {1057 - 1064}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {We propose a new class of crossover operators for genetic algorithms (CrossNet) which use a network-based (or graph-based) chromosomal representation. We designed CrossNet with the intent of providing a framework for creating crossover operators that take advantage of domain-specific knowledge for solving problems. Specifically, GA users supply a network which defines the epistatic relationships between genes in the genotype. CrossNet-based crossover uses this information with the goal of improving linkage. We performed two experiments that compared CrossNet-based crossover with one-point and uniform crossover. The first experiment involved the density classification problem for cellular automata (CA), and the second experiment involved fitting two randomly generated hyperplane-defined functions (hdf{\textquoteright}s). Both of these exploratory experiments support the hypothesis that CrossNet-based crossover can be useful, although performance improvements were modest. We discuss the results and remain hopeful about the successful application of CrossNet to other domains. We conjecture that future work with the CrossNet framework will provide a useful new perspective for investigating linkage and chromosomal representations.}, keywords = {crossover, Genetic algorithms, graphs, linkage, NETWORKS, recombination}, isbn = {978-1-60558-130-9}, doi = {10.1145/1389095.1389290}, url = {http://doi.acm.org/10.1145/1389095.1389290}, author = {Stonedahl,Forrest and Rand, William and Wilensky,Uri} } @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 {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} } @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 {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} } @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} } @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 {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 {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 {15452, title = {Effective and scalable software compatibility testing}, booktitle = {Proceedings of the 2008 international symposium on Software testing and analysis}, series = {ISSTA {\textquoteright}08}, year = {2008}, month = {2008///}, pages = {63 - 74}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Today{\textquoteright}s software systems are typically composed of multiple components, each with different versions. Software compatibility testing is a quality assurance task aimed at ensuring that multi-component based systems build and/or execute correctly across all their versions{\textquoteright} combinations, or configurations. Because there are complex and changing interdependencies between components and their versions, and because there are such a large number of configurations, it is generally infeasible to test all potential configurations. Consequently, in practice, compatibility testing examines only a handful of default or popular configurations to detect problems; as a result costly errors can and do escape to the field. This paper presents a new approach to compatibility testing, called Rachet. We formally model the entire configuration space for software systems and use the model to generate test plans to sample a portion of the space. In this paper, we test all direct dependencies between components and execute the test plan efficiently in parallel. We present empirical results obtained by applying our approach to two large-scale scientific middleware systems. The results show that for these systems Rachet scaled well and discovered incompatibilities between components, and that testing only direct dependences did not compromise test quality.}, keywords = {component-based software system, software compatibility testing}, isbn = {978-1-60558-050-0}, doi = {10.1145/1390630.1390640}, url = {http://doi.acm.org/10.1145/1390630.1390640}, author = {Yoon,Il-Chul and Sussman, Alan and Memon, Atif M. and Porter, Adam} } @article {12239, title = {Efficient and Resilient Backbones for Multihop Wireless Networks}, journal = {Mobile Computing, IEEE Transactions on}, volume = {7}, year = {2008}, month = {2008/11//}, pages = {1349 - 1362}, abstract = {We consider the problem of finding "backbones" in multihop wireless networks. The backbone provides end-to-end connectivity, allowing nonbackbone nodes to save energy since they do not have to route nonlocal data or participate in the routing protocol. Ideally, such a backbone would be small, consist primarily of high capacity nodes, and remain connected even when nodes are mobile or fail. Unfortunately, it is often infeasible to construct a backbone that has all of these properties; e.g., a small optimal backbone is often too sparse to handle node failures or high mobility. We present a parameterized backbone construction algorithm that permits explicit trade-offs between backbone size, resilience to node movement and failure, energy consumption, and path lengths. We prove that our scheme can construct essentially best possible backbones (with respect to energy consumption and backbone size) when the network is relatively static. We generalize our scheme to build more robust structures better suited to networks with higher mobility. We present a distributed protocol based upon our algorithm and show that this protocol builds and maintains a connected backbone in dynamic networks. Finally, we present detailed packet-level simulation results to evaluate and compare our scheme with existing energy-saving techniques. Our results show that, depending on the network environment, our scheme increases network lifetimes by 20 percent to 220 percent without adversely affecting delivery ratio or end-to-end latency.}, keywords = {algorithm;protocols;wireless, backbone, channels;, CONSTRUCTION, distributed, networks;parameterized, protocol;multihop, wireless}, isbn = {1536-1233}, doi = {10.1109/TMC.2008.69}, author = {Lee,Seungjoon and Bhattacharjee, Bobby and Srinivasan, Aravind and Khuller, Samir} } @article {17129, title = {Embedded menus: selecting items in context}, journal = {Sparks of innovation in human-computer interaction}, year = {2008}, month = {2008///}, author = {Koved,L. and Shneiderman, Ben} } @article {17132, title = {Enabling teachers to explore grade patterns to identify individual needs and promote fairer student assessment}, journal = {Computers \& Education}, volume = {51}, year = {2008}, month = {2008/12//}, pages = {1467 - 1485}, abstract = {Exploring student test, homework, and other assessment scores is a challenge for most teachers, especially when attempting to identify cross-assessment weaknesses and produce final course grades. During the course, teachers need to identify subject weaknesses in order to help students who are struggling with a particular topic. This identification often needs to happen across multiple assessment data points and should be considered in comparison to the class{\textquoteright}s progress as a whole. When determining grades, fairness to all is essential, but there are special needs for students who did poorly on one exam or had a steadily increasing grasp of the subject. We present eduViz, a visualization tool designed to help teachers explore and assign grades. Teachers can see the trajectory of student scores, the relationship of a particular student to the class, and use categories they have defined in order to filter their assessment information. Query response is immediate and all logical comparisons are possible. Teachers can easily compare their query to the class or per student average as well as view scores by raw point total or percentage. Additionally, eduViz provides a grade assignment interface which allows teachers to view sorted student scores in a scatterplot. This scatterplot is coupled with a unique partition slider which allows users to move color coordinated bands on the scatterplot to indicate grade ranges. As these grade ranges are set, a histogram is updated to show the number of students assigned to each grade range. These features give teachers new and powerful ways to explore and assign grades so that they can better understand student strengths and weaknesses and make the most of the time they have available. Interviews with 16 expert teachers indicate that eduViz is a success across fields, provides teachers with a useful tool to understand and help their classes, and encourages reflective practice.}, keywords = {Evaluation methodologies, Human{\textendash}computer interface, Improving classroom teaching, Pedagogical issues, Teaching/learning strategies}, isbn = {0360-1315}, doi = {10.1016/j.compedu.2008.01.005}, url = {http://www.sciencedirect.com/science/article/pii/S0360131508000353}, author = {Friedler,Sorelle A. and Tan,Yee Lin and Peer,Nir J. and Shneiderman, Ben} } @inbook {12117, title = {An Environment for Conducting Families of Software Engineering Experiments}, booktitle = {Software Development}, volume = {Volume 74}, year = {2008}, month = {2008///}, pages = {175 - 200}, publisher = {Elsevier}, organization = {Elsevier}, abstract = {The classroom is a valuable resource for conducting software engineering experiments. However, coordinating a family of experiments in classroom environments presents a number of challenges to researchers. Understanding how to run such experiments, developing procedures to collect accurate data, and collecting data that is consistent across multiple studies are major problems. This paper describes an environment, the Experiment Manager that simplifies the process of collecting, managing, and sanitizing data from classroom experiments, while minimizing disruption to natural subject behavior. We have successfully used this environment to study the impact of parallel programming languages in the high-performance computing domain on programmer productivity at multiple universities across the United States.}, isbn = {0065-2458}, url = {http://www.sciencedirect.com/science/article/pii/S0065245808006050}, author = {Hochstein, Lorin and Nakamura,Taiga and Shull, Forrest and Zazworka, Nico and Basili, Victor R. and Zelkowitz, Marvin V}, editor = {Zelkowitz, Marvin V} } @article {12913, title = {Environmental signatures associated with cholera epidemics}, journal = {Proceedings of the National Academy of Sciences}, volume = {105}, year = {2008}, month = {2008///}, pages = {17676 - 17676}, abstract = {The causative agent of cholera, Vibrio cholerae, has been shown to be autochthonous to riverine, estuarine, and coastal waters along with its host, the copepod, a significant member of the zooplankton community. Temperature, salinity, rainfall and plankton have proven to be important factors in the ecology of V. cholerae, influencing the transmission of the disease in those regions of the world where the human population relies on untreated water as a source of drinking water. In this study, the pattern of cholera outbreaks during 1998{\textendash}2006 in Kolkata, India, and Matlab, Bangladesh, and the earth observation data were analyzed with the objective of developing a prediction model for cholera. Satellite sensors were used to measure chlorophyll a concentration (CHL) and sea surface temperature (SST). In addition, rainfall data were obtained from both satellite and in situ gauge measurements. From the analyses, a statistically significant relationship between the time series for cholera in Kolkata, India, and CHL and rainfall anomalies was determined. A statistically significant one month lag was observed between CHL anomaly and number of cholera cases in Matlab, Bangladesh. From the results of the study, it is concluded that ocean and climate patterns are useful predictors of cholera epidemics, with the dynamics of endemic cholera being related to climate and/or changes in the aquatic ecosystem. When the ecology of V. cholerae is considered in predictive models, a robust early warning system for cholera in endemic regions of the world can be developed for public health planning and decision making.ecology epidemiology microbiology remote sensing }, isbn = {0027-8424, 1091-6490}, doi = {10.1073/pnas.0809654105}, url = {http://www.pnas.org/content/105/46/17676}, author = {Constantin de Magny,G. and Murtugudde,R. and Sapiano,M. R. P. and Nizam,A. and Brown,C. W. and Busalacchi,A. J. and Yunus,M. and Nair,G. B. and Gil,A. I. and Lanata,C. F. and Rita R Colwell} } @article {17138, title = {Evaluating Exploratory Search Systems}, journal = {Information processing \& management}, volume = {44}, year = {2008}, month = {2008///}, pages = {463 - 484}, author = {Kules,B. and Shneiderman, Ben} } @mastersthesis {19021, title = {Evaluating predicates over encrypted data}, year = {2008}, month = {2008}, school = {Carnegie Mellon University}, abstract = {The high-level goal of this thesis is to build predicate encryption systems that are efficient, support expressive queries and rich operations. Our contributions are summarized below: (1) We propose a predicate encryption scheme supporting multi-dimensional range queries. Prior to this work, researchers have constructed schemes support equality tests. Hence, our scheme supports more expressive queries than before. At the core of this construction is a technique to support conjunctive queries without leaking the outcome of each individual clause. (2) We study how to delegate capabilities in predicate encryption schemes. To demonstrate why delegation may be interesting, imagine that Alice has a capability, and she wishes to delegate to Bob a more restrictive capability allowing him to decrypt a subset of the information Alice can learn about the plaintext encrypted. We propose a security definition for delegation, and build a scheme supporting delegation and conjunctive queries. (3) Most prior work focuses on hiding the plaintext (encoded in the ciphertext), but does not provide guarantees about the secrecy of the queries (encoded in the capabilities). In other words, given a capability, one might be able to infer from it what the query predicate is. We study how to hide the query predicates, and propose a scheme supporting inner-product queries that hides the query predicates in addition to the plaintext.}, doi = {Doctoral Dissertation}, url = {http://books.google.com/books?hl=en\&lr=\&id=jBOgjMdBeHAC\&oi=fnd\&pg=PA1\&dq=+Elaine+Shi\&ots=W3nTBSxa3H\&sig=76cmlidxiCTBXbaFhfkl9zVOm6s}, author = {Elaine Shi} } @article {16066, title = {Evaluating Visual Analytics at the 2007 VAST Symposium Contest}, journal = {Computer Graphics and Applications, IEEE}, volume = {28}, year = {2008}, month = {2008/04//march}, pages = {12 - 21}, abstract = {In this article, we report on the contest{\textquoteright}s data set and tasks, the judging criteria, the winning tools, and the overall lessons learned in the competition. We believe that by organizing these contests, we{\textquoteright}re creating useful resources for researchers and are beginning to understand how to better evaluate VA tools. Competitions encourage the community to work on difficult problems, improve their tools, and develop baselines for others to build or improve upon. We continue to evolve a collection of data sets, scenarios, and evaluation methodologies that reflect the richness of the many VA tasks and applications.}, keywords = {2007, analytics, analytics;data, and, Contest;Visual, Science, Symposium, Technology;data, VAST, visualisation;, visualization;visual}, isbn = {0272-1716}, doi = {10.1109/MCG.2008.27}, author = {Plaisant, Catherine and Grinstein,G. and Scholtz,J. and Whiting,M. and O{\textquoteright}Connell,T. and Laskowski,S. and Chien,L. and Tat,A. and Wright,W. and Gorg,C. and Zhicheng Liu and Parekh,N. and Singhal,K. and Stasko,J.} } @article {18670, title = {Experiences with building an intrusion-tolerant group communication system}, journal = {Software: Practice and Experience}, volume = {38}, year = {2008}, month = {2008///}, pages = {639 - 666}, abstract = {There are many group communication systems (GCSs) that provide consistent group membership and reliable, ordered multicast properties in the presence of crash faults. However, relatively few GCS implementations are able to provide these properties in the presence of malicious faults resulting from intrusions. We describe the systematic transformation of a crash-tolerant GCS, namely C-Ensemble, into an intrusion-tolerant GCS, the ITUA GCS. To perform the transformation, we devised intrusion-tolerant versions of key group communication protocols. We then inserted implementations of the protocols into C-Ensemble and made significant changes to the rest of the C-Ensemble protocol stack to make the stack intrusion tolerant. We quantify the cost of providing intrusion-tolerant group communication in two ways. First, we quantify the implementation effort by presenting a detailed analysis of the amount of change required to the original C-Ensemble system. In doing so, we provide insight into the choice of building an intrusion-tolerant GCS from scratch versus building one by leveraging a crash-tolerant implementation. Second, we quantify the run-time performance cost of tolerating intrusions by presenting results from an experimental evaluation of the main intrusion-tolerant microprotocols. The results are analyzed to identify the parts that contribute the most overhead while providing intrusion tolerance during both normal operation and recovery from intrusions. Copyright {\textcopyright} 2007 John Wiley \& Sons, Ltd.}, keywords = {distributed protocols, experimental evaluation, Fault tolerance, Group communication, intrusion tolerance}, isbn = {1097-024X}, doi = {10.1002/spe.848}, url = {http://onlinelibrary.wiley.com/doi/10.1002/spe.848/abstract}, author = {Ramasamy,HariGovind V. and Pandey,Prashant and Michel Cukier and Sanders,William H.} } @conference {16496, title = {Exploiting ontology structure and patterns of annotation to mine significant associations between pairs of controlled vocabulary terms}, booktitle = {Data Integration in the Life Sciences}, year = {2008}, month = {2008///}, pages = {44 - 60}, author = {Lee,W. J and Raschid, Louiqa and Sayyadi,H. and Srinivasan,P.} } @article {13368, title = {Exploiting shared correlations in probabilistic databases}, journal = {Proceedings of the VLDB Endowment}, volume = {1}, year = {2008}, month = {2008/08//}, pages = {809 - 820}, abstract = {There has been a recent surge in work in probabilistic databases, propelled in large part by the huge increase in noisy data sources --- from sensor data, experimental data, data from uncurated sources, and many others. There is a growing need for database management systems that can efficiently represent and query such data. In this work, we show how data characteristics can be leveraged to make the query evaluation process more efficient. In particular, we exploit what we refer to as shared correlations where the same uncertainties and correlations occur repeatedly in the data. Shared correlations occur mainly due to two reasons: (1) Uncertainty and correlations usually come from general statistics and rarely vary on a tuple-to-tuple basis; (2) The query evaluation procedure itself tends to re-introduce the same correlations. Prior work has shown that the query evaluation problem on probabilistic databases is equivalent to a probabilistic inference problem on an appropriately constructed probabilistic graphical model (PGM). We leverage this by introducing a new data structure, called the random variable elimination graph (rv-elim graph) that can be built from the PGM obtained from query evaluation. We develop techniques based on bisimulation that can be used to compress the rv-elim graph exploiting the presence of shared correlations in the PGM, the compressed rv-elim graph can then be used to run inference. We validate our methods by evaluating them empirically and show that even with a few shared correlations significant speed-ups are possible.}, isbn = {2150-8097}, doi = {10.1145/1453856.1453944}, url = {http://dx.doi.org/10.1145/1453856.1453944}, author = {Sen,Prithviraj and Deshpande, Amol and Getoor, Lise} } @article {15866, title = {Extending sense-making models with ideas from cognition and learning theories}, journal = {Proceedings of the American Society for Information Science and Technology}, volume = {45}, year = {2008}, month = {2008///}, pages = {23 - 23}, author = {Zhang,P. and Soergel,D. and Klavans,J. L and Oard, Douglas} } @article {17158, title = {Extreme visualization: squeezing a billion records into a million pixels}, journal = {SIGMOD Conference}, year = {2008}, month = {2008///}, pages = {3 - 12}, abstract = {Database searches are usually performed with querylanguages and form fill in templates, with results displayed in tabular lists. However, excitement is building around dynamic queries sliders and other graphical selectors for query specification, with results displayed by information visualization techniques. These filtering techniques have proven to be effective for many tasks in which visual presentations enable discovery of relationships, clusters, outliers, gaps, and other patterns. Scaling visual presentations from millions to billions of records will require collaborative research efforts in information visualization and database management to enable rapid aggregation, meaningful coordinated windows, and effective summary graphics. This paper describes current and proposed solutions (atomic, aggregated, and density plots) that facilitate sense-making for interactive visual exploration of billion record data sets. }, author = {Shneiderman, Ben} } @conference {14696, title = {Fable: A Language for Enforcing User-defined Security Policies}, booktitle = {IEEE Symposium on Security and Privacy, 2008. SP 2008}, year = {2008}, month = {2008/05/18/22}, pages = {369 - 383}, publisher = {IEEE}, organization = {IEEE}, abstract = {This paper presents FABLE, a core formalism for a programming language in which programmers may specify security policies and reason that these policies are properly enforced. In FABLE, security policies can be expressed by associating security labels with the data or actions they protect. Programmers define the semantics of labels in a separate part of the program called the enforcement policy. FABLE prevents a policy from being circumvented by allowing labeled terms to be manipulated only within the enforcement policy; application code must treat labeled values abstractly. Together, these features facilitate straightforward proofs that programs implementing a particular policy achieve their high-level security goals. FABLE is flexible enough to implement a wide variety of security policies, including access control, information flow, provenance, and security automata. We have implemented FABLE as part of the LINKS web programming language; we call the resulting language SELlNKS. We report on our experience using SELlNKS to build two substantial applications, a wiki and an on-line store, equipped with a combination of access control and provenance policies. To our knowledge, no existing framework enables the enforcement of such a wide variety of security policies with an equally high level of assurance.}, keywords = {Access control, Automata, Collaborative work, Communication system security, Computer languages, computer security, Data security, enforcement policy, FABLE, Government, high-level security goals, information flow, Information security, Language-based security, programming languages, Programming profession, provenance, security automata, security labels, security of data, user-defined security policies, verified enforcement, Web programming language}, isbn = {978-0-7695-3168-7}, doi = {10.1109/SP.2008.29}, author = {Swamy,N. and Corcoran,B.J. and Hicks, Michael W.} } @conference {12554, title = {Factorized variational approximations for acoustic multi source localization}, booktitle = {Acoustics, Speech and Signal Processing, 2008. ICASSP 2008. IEEE International Conference on}, year = {2008}, month = {2008/04/31/4}, pages = {2409 - 2412}, abstract = {Estimation based on received signal strength (RSS) is crucial in sensor networks for sensor localization, target tracking, etc. In this paper, we present a Gaussian approximation of the Chi distribution that is applicable to general RSS source localization problems in sensor networks. Using our Gaussian approximation, we provide a factorized variational Bayes (VB) approximation to the location and power posterior of multiple sources using a sensor network. When the source signal and the sensor noise have uncorrelated Gaussian distributions, we demonstrate that the envelope of the sensor output can be accurately modeled with a multiplicative Gaussian noise model. In turn, our factorized VB approximations decrease the computational complexity and provide computational robustness as the number of targets increases. Simulations are provided to demonstrate the effectiveness of the proposed approximations.}, keywords = {approximation;acoustic, approximation;Bayes, approximation;multisensor, approximation;variational, Bayes, Chi, detection;wireless, distribution;Gaussian, localization;factorized, localization;sensor, methods;Gaussian, multisource, networks;, networks;stochastic, processes;acoustic, sensor, signal, strength;sensor, systems;object, tracking;received, variational}, doi = {10.1109/ICASSP.2008.4518133}, author = {Cevher, V. and Sankaranarayanan,A. C and Chellapa, Rama} } @conference {14968, title = {Fast browsing of archived Web contents}, booktitle = {8th International Web Archiving Workshop, Aarhus, Denmark.}, year = {2008}, month = {2008///}, abstract = {The web is becoming the preferred medium for communicatingand storing information pertaining to almost any human activity. However it is an ephemeral medium whose contents are constantly changing, resulting in a permanent loss of part of our cultural and scientific heritage on a regular basis. Archiving important web contents is a very challenging technical problem due to its tremendous scale and complex structure, extremely dynamic nature, and its rich heterogeneous and deep contents. In this paper, we consider the problem of archiving a linked set of web objects into web containers in such a way as to minimize the number of containers accessed during a typical browsing session. We develop a method that makes use of the notion of PageRank and optimized graph partitioning to enable faster browsing of archived web contents. We include simulation results that illustrate the performance of our scheme and compare it to the common scheme currently used to organize web objects into web containers. }, author = {Song,S. and JaJa, Joseph F.} } @conference {18567, title = {Fast monitoring of traffic subpopulations}, booktitle = {Proceedings of the 8th ACM SIGCOMM conference on Internet measurement}, series = {IMC {\textquoteright}08}, year = {2008}, month = {2008///}, pages = {257 - 270}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Network accounting, forensics, security, and performance monitoring applications often need to examine detailed traces from subsets of flows ("subpopulations"), where the application desires flexibility in specifying the subpopulation (e.g., to detect a portscan, the application must observe many packets between a source and a destination with one packet to each port). However, the dynamism and volume of network traffic on many high-speed links necessitates traffic sampling, which adversely affects subpopulation monitoring: because many subpopulations of interest to operators are low-volume flows, conventional sampling schemes (e.g., uniform random sampling) miss much of the subpopulation{\textquoteright}s traffic. Today{\textquoteright}s routers and network devices provide scant support for monitoring specific traffic subpopulations. This paper presents the design, implementation, and evaluation of FlexSample, a traffic monitoring engine that dynamically extracts traffic from subpopulations that operators define using conditions on packet header fields. FlexSample uses a fast, flexible counter array to provide rough estimates of packets{\textquoteright} membership in respective subpopulations. Based on these coarse estimates, FlexSample then makes per-packet sampling decisions to sample proportionately from each subpopulation (as specified by a network operator), subject to an overall sampling constraint. We apply FlexSample to extract subpopulations such as port scans and traffic to high-degree nodes and find that it is able to capture significantly more packets from these subpopulations than conventional approaches.}, keywords = {counters, flexsample, sampling, traffic statistics, traffic subpopulations}, isbn = {978-1-60558-334-1}, doi = {10.1145/1452520.1452551}, url = {http://doi.acm.org/10.1145/1452520.1452551}, author = {Ramachandran,Anirudh and Seetharaman,Srinivasan and Feamster, Nick and Vazirani,Vijay} } @conference {16838, title = {A Fast Similarity Join Algorithm Using Graphics Processing Units}, booktitle = {Data Engineering, 2008. ICDE 2008. IEEE 24th International Conference on}, year = {2008}, month = {2008/04//}, pages = {1111 - 1120}, abstract = {A similarity join operation A BOWTIEepsiv B takes two sets of points A, B and a value epsiv isin Ropf, and outputs pairs of points p isin A,q isin B, such that the distance D(p, q) les epsiv. Similarity joins find use in a variety of fields, such as clustering, text mining, and multimedia databases. A novel similarity join algorithm called LSS is presented that executes on a graphics processing unit (GPU), exploiting its parallelism and high data throughput. As GPUs only allow simple data operations such as the sorting and searching of arrays, LSS uses these two operations to cast a similarity join operation as a GPU sort-and-search problem. It first creates, on the fly, a set of space-filling curves on one of its input datasets, using a parallel GPU sort routine. Next, LSS processes each point p of the other dataset in parallel. For each p, it searches an interval of one of the space-filling curves guaranteed to contain all the pairs in which p participates. Using extensive theoretical and experimental analysis, LSS is shown to offer a good balance between time and work efficiency. Experimental results demonstrate that LSS is suitable for similarity joins in large high-dimensional datasets, and that it performs well when compared against two existing prominent similarity join methods.}, keywords = {algorithm;graphics, algorithms;quadtrees;set, arrays, curves;parallel, join, problem;space-filling, PROCESSING, searching;fast, similarity, theory;sorting;, units;sort-and-search}, doi = {10.1109/ICDE.2008.4497520}, author = {Lieberman,M.D. and Sankaranarayanan,J. and Samet, Hanan} } @conference {17517, title = {On the fidelity of 802.11 packet traces}, booktitle = {Proceedings of the 9th international conference on Passive and active network measurement}, year = {2008}, month = {2008///}, pages = {132 - 141}, author = {Schulman,A. and Levin,D. and Spring, Neil} } @inbook {18675, title = {Finding Corrupted Computers Using Imperfect Intrusion Prevention System Event Data}, booktitle = {Computer Safety, Reliability, and Security}, series = {Lecture Notes in Computer Science}, volume = {5219}, year = {2008}, month = {2008///}, pages = {221 - 234}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {With the increase of attacks on the Internet, a primary concern for organizations is how to protect their network. The objectives of a security team are 1) to prevent external attackers from launching successful attacks against organization computers that could become compromised, 2) to ensure that organization computers are not vulnerable (e.g., fully patched) so that in either case the organization computers do not start launching attacks. The security team can monitor and block malicious activity by using devices such as intrusion prevention systems. However, in large organizations, such monitoring devices could record a high number of events. The contributions of this paper are 1) to introduce a method that ranks potentially corrupted computers based on imperfect intrusion prevention system event data, and 2) to evaluate the method based on empirical data collected at a large organization of about 40,000 computers. The evaluation is based on the judgment of a security expert of which computers were indeed corrupted. On the one hand, we studied how many computers classified as of high concern or of concern were indeed corrupted (i.e., true positives). On the other hand, we analyzed how many computers classified as of lower concern were in fact corrupted (i.e., false negatives).}, keywords = {Computer science}, isbn = {978-3-540-87697-7}, url = {http://www.springerlink.com/content/4767u3017r613822/abstract/}, author = {Chrun,Danielle and Michel Cukier and Sneeringer,Gerry}, editor = {Harrison,Michael and Sujan,Mark-Alexander} } @article {18517, title = {Fishing for Phishing from the Network Stream}, volume = {GT-CS-08-08}, year = {2008}, month = {2008///}, institution = {Georgia Institute of Technology}, abstract = {Phishing is an increasingly prevalent social-engineering attack that attempts identity theft using spoofed Web pages of legitimate organizations. Unfortunately, current phishing detection methods are neither complete nor responsive because they rely on user reports, and many also require clientside software. Anti-phishing techniques could be more effective if they (1) could detect phishing attacks automatically from the network traffic; (2) could operate without cooperation from end-users. This paper performs a preliminary study to determine the feasibility of detecting phishing attacks in real-time, from the network traffic stream itself. We develop a model to identify the stages where in-network phishing detection is feasible and the data sources that can be analyzed to provide relevant information at each stage. Based on this model, we develop and evaluate a detection method based on features that exist in the network traffic it- self and are correlated with confirmed phishing attacks.}, url = {http://hdl.handle.net/1853/25463}, author = {Ramachandran,A. and Feamster, Nick and Krishnamurthy,B. and Spatscheck,O. and Van der Merwe,J.} } @conference {17537, title = {Fixing ally{\textquoteright}s growing pains with velocity modeling}, booktitle = {Proceedings of the 8th ACM SIGCOMM conference on Internet measurement}, series = {IMC {\textquoteright}08}, year = {2008}, month = {2008///}, pages = {337 - 342}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Mapping the router topology is an important component of Internet measurement. Alias resolution, the process of mapping IP addresses to routers, is critical to accurate Internet mapping. Ally, a popular alias resolution tool, was developed to resolve aliases in individual ISPs, but its probabilistic accuracy and need to send O(n2) probes to infer aliases among n IP addresses make it unappealing for large-scale Internet mapping. In this paper, we present RadarGun, a tool that uses IP identifier velocity modeling to improve the accuracy and scalability of the Ally-based resolution technique. We provide analytical bounds on Ally{\textquoteright}s accuracy and validate our predicted aliases against Ally. Additionally, we show that velocity modeling requires only O(n) probes and thus scales to Internet-sized mapping efforts.}, keywords = {alias resolution, ally, ip identifier, velocity modeling}, isbn = {978-1-60558-334-1}, doi = {10.1145/1452520.1452560}, url = {http://doi.acm.org/10.1145/1452520.1452560}, author = {Bender,Adam and Sherwood,Rob and Spring, Neil} } @conference {12106, title = {A Framework for Software Engineering Experimental Replications}, booktitle = {Engineering of Complex Computer Systems, 2008. ICECCS 2008. 13th IEEE International Conference on}, year = {2008}, month = {2008/04/31/3}, pages = {203 - 212}, abstract = {Experimental replications are very important to the advancement of empirical software engineering. Replications are one of the key mechanisms to confirm previous experimental findings. They are also used to transfer experimental knowledge, to train people, and to expand a base of experimental evidence. Unfortunately, experimental replications are difficult endeavors. It is not easy to transfer experimental know-how and experimental findings. Based on our experience, this paper discusses this problem and proposes a Framework for Improving the Replication of Experiments (FIRE). The FIRE addresses knowledge sharing issues both at the intra-group (internal replications) and inter-group (external replications) levels. It encourages coordination of replications in order to facilitate knowledge transfer for lower cost, higher quality replications and more generalizable results.}, keywords = {engineering, engineering;, evidence;experimental, experimental, Experiments;experimental, for, Framework, Improving, knowledge, of, replication, replication;software, sharing;software, the, transfer;knowledge}, doi = {10.1109/ICECCS.2008.38}, author = {Mendonca,M.G. and Maldonado,J.C. and de Oliveira,M.C.F. and Carver, J. and Fabbri,C.P.F. and Shull, F. and Travassos,G.H. and Hohn,E.N. and Basili, Victor R.} } @article {14612, title = {Functional Diversification of Paralogous Transcription Factors via Divergence in DNA Binding Site Motif and in Expression}, journal = {PLoS ONEPLoS ONE}, volume = {3}, year = {2008}, month = {2008/06/04/}, pages = {e2345 - e2345}, abstract = {Gene duplication is a major driver of evolutionary innovation as it allows for an organism to elaborate its existing biological functions via specialization or diversification of initially redundant gene paralogs. Gene function can diversify in several ways. Transcription factor gene paralogs in particular, can diversify either by changes in their tissue-specific expression pattern or by changes in the DNA binding site motif recognized by their protein product, which in turn alters their gene targets. The relationship between these two modes of functional diversification of transcription factor paralogs has not been previously investigated, and is essential for understanding adaptive evolution of transcription factor gene families.Based on a large set of human paralogous transcription factor pairs, we show that when the DNA binding site motifs of transcription factor paralogs are similar, the expressions of the genes that encode the paralogs have diverged, so in general, at most one of the paralogs is highly expressed in a tissue. Moreover, paralogs with diverged DNA binding site motifs tend to be diverged in their function. Conversely, two paralogs that are highly expressed in a tissue tend to have dissimilar DNA binding site motifs. We have also found that in general, within a paralogous family, tissue-specific decrease in gene expression is more frequent than what is expected by chance. While previous investigations of paralogous gene diversification have only considered coding sequence divergence, by explicitly quantifying divergence in DNA binding site motif, our work presents a new paradigm for investigating functional diversification. Consistent with evolutionary expectation, our quantitative analysis suggests that paralogous transcription factors have survived extinction in part, either through diversification of their DNA binding site motifs or through alterations in their tissue-specific expression levels. }, doi = {10.1371/journal.pone.0002345}, url = {UR - http://dx.plos.org/10.1371/journal.pone.0002345,http://dx.plos.org/10.1371/journal.pone.0002345}, author = {Singh,Larry N. and Hannenhalli, Sridhar} } @article {12975, title = {A GENEALOGICAL APPROACH TO QUANTIFYING LINEAGE DIVERGENCE}, journal = {Evolution}, volume = {62}, year = {2008}, month = {2008/09/01/}, pages = {2411 - 2422}, abstract = {We introduce a statistic, the genealogical sorting index (gsi), for quantifying the degree of exclusive ancestry of labeled groups on a rooted genealogy and demonstrate its application. The statistic is simple, intuitive, and easily calculated. It has a normalized range to facilitate comparisons among different groups, trees, or studies and it provides information on individual groups rather than a composite measure for all groups. It naturally handles polytomies and accommodates measures of uncertainty in phylogenetic relationships. We use coalescent simulations to explore the behavior of the gsi across a range of divergence times, with the mean value increasing to 1, the maximum value when exclusivity within a group reached monophyly. Simulations also demonstrate that the power to reject the null hypothesis of mixed genealogical ancestry increased markedly as sample size increased, and that the gsi provides a statistically more powerful measure of divergence than FST. Applications to data from published studies demonstrated that the gsi provides a useful way to detect significant exclusivity even when groups are not monophyletic. Although we describe this statistic in the context of divergence, it is more broadly applicable to quantify and assess the significance of clustering of observations in labeled groups on any tree.}, keywords = {Ancestral polymorphism, congruence, exclusivity, genealogy, lineage sorting, monophyly, paraphyly, Phylogeny, polyphyly, speciation, species}, isbn = {1558-5646}, doi = {10.1111/j.1558-5646.2008.00442.x}, url = {http://onlinelibrary.wiley.com/doi/10.1111/j.1558-5646.2008.00442.x/abstract}, author = {Cummings, Michael P. and Neel,Maile C and Shaw,Kerry L} } @article {16268, title = {Genome assembly forensics: finding the elusive mis-assembly}, journal = {Genome Biology}, volume = {9}, year = {2008}, month = {2008/03/14/}, pages = {R55 - R55}, abstract = {We present the first collection of tools aimed at automated genome assembly validation. This work formalizes several mechanisms for detecting mis-assemblies, and describes their implementation in our automated validation pipeline, called amosvalidate. We demonstrate the application of our pipeline in both bacterial and eukaryotic genome assemblies, and highlight several assembly errors in both draft and finished genomes. The software described is compatible with common assembly formats and is released, open-source, at http://amos.sourceforge.net.}, isbn = {1465-6906}, doi = {10.1186/gb-2008-9-3-r55}, url = {http://genomebiology.com/2008/9/3/R55}, author = {Phillippy,Adam M and Schatz,Michael C and Pop, Mihai} } @article {14617, title = {Genome-Wide Analysis of Natural Selection on Human Cis-Elements}, journal = {PLoS ONEPLoS ONE}, volume = {3}, year = {2008}, month = {2008///}, pages = {e3137 - e3137}, abstract = {It has been speculated that the polymorphisms in the non-coding portion of the human genome underlie much of the phenotypic variability among humans and between humans and other primates. If so, these genomic regions may be undergoing rapid evolutionary change, due in part to natural selection. However, the non-coding region is a heterogeneous mix of functional and non-functional regions. Furthermore, the functional regions are comprised of a variety of different types of elements, each under potentially different selection regimes.Using the HapMap and Perlegen polymorphism data that map to a stringent set of putative binding sites in human proximal promoters, we apply the Derived Allele Frequency distribution test of neutrality to provide evidence that many human-specific and primate-specific binding sites are likely evolving under positive selection. We also discuss inherent limitations of publicly available human SNP datasets that complicate the inference of selection pressures. Finally, we show that the genes whose proximal binding sites contain high frequency derived alleles are enriched for positive regulation of protein metabolism and developmental processes. Thus our genome-scale investigation provides evidence for positive selection on putative transcription factor binding sites in human proximal promoters. }, doi = {10.1371/journal.pone.0003137}, url = {UR - http://dx.doi.org/10.1371/journal.pone.0003137,http://dx.doi.org/10.1371/journal.pone.0003137}, author = {Sethupathy,Praveen and Giang,Hoa and Plotkin,Joshua B. and Hannenhalli, Sridhar} } @article {16271, title = {Genome-Wide Analysis of Repetitive Elements in Papaya}, journal = {Tropical Plant Biology}, volume = {1}, year = {2008}, month = {2008///}, pages = {191 - 201}, abstract = {Papaya ( Carica papaya L.) is an important fruit crop cultivated in tropical and subtropical regions worldwide. A first draft of its genome sequence has been recently released. Together with Arabidopsis , rice, poplar, grapevine and other genomes in the pipeline, it represents a good opportunity to gain insight into the organization of plant genomes. Here we report a detailed analysis of repetitive elements in the papaya genome, including transposable elements (TEs), tandemly-arrayed sequences, and high copy number genes. These repetitive sequences account for \~{}56\% of the papaya genome with TEs being the most abundant at 52\%, tandem repeats at 1.3\% and high copy number genes at 3\%. Most common types of TEs are represented in the papaya genome with retrotransposons being the dominant class, accounting for 40\% of the genome. The most prevalent retrotransposons are Ty3-gypsy (27.8\%) and Ty1-copia (5.5\%). Among the tandem repeats, microsatellites are the most abundant in number, but represent only 0.19\% of the genome. Minisatellites and satellites are less abundant, but represent 0.68\% and 0.43\% of the genome, respectively, due to greater repeat length. Despite an overall smaller gene repertoire in papaya than many other angiosperms, a significant fraction of genes (\>2\%) are present in large gene families with copy number greater than 20. This repeat database clarified a major part of the papaya genome organization and partly explained the lower gene repertoire in papaya than in Arabidopsis .}, isbn = {1935-9756}, url = {http://dx.doi.org/10.1007/s12042-008-9015-0}, author = {Nagarajan,Niranjan and Navajas-P{\'e}rez,Rafael and Pop, Mihai and Alam,Maqsudul and Ming,Ray and Paterson,Andrew and Salzberg,Steven} } @article {14425, title = {Group proximity measure for recommending groups in online social networks}, journal = {networks}, volume = {1}, year = {2008}, month = {2008///}, pages = {5 - 5}, abstract = {There are currently, thousands of online social networks (OSN)available, each of which hosts millions of users. Users make new friendship links, join groups on diverse topics, share opinions and thus help in building a big knowledge repository. In this paper we study the problem of defining proximity measure between groups (communities) of OSN. Understanding the proximity among the groups in OSN can reveal new insights into the structure of the network. We use this proximity measure in a novel way with other structural features of online groups to predict the evolving state of the network. One of the important task in the sphere of OSN is helping users in selecting groups of their interest, by making rec- ommendations. We utilize group proximity measure to propose a new framework for recommending groups to users of OSN. Finally we investigate the effectiveness of our methods in three real OSN: Flickr, Live Journal and You Tube. Our methods give promising results. }, author = {Saha,B. and Getoor, Lise} } @article {12565, title = {Hardware and Software Systems for Image and Video Processing-Algorithmic and Architectural Optimizations for Computationally Efficient Particle Filtering}, journal = {IEEE Transactions on Image Processing}, volume = {17}, year = {2008}, month = {2008///}, pages = {737 - 748}, author = {Sankaranarayanan,A. C and Srivastava, A. and Chellapa, Rama} } @conference {19450, title = {Hci for community and international development}, booktitle = {SIGCHI EA {\textquoteright}08}, series = {CHI EA {\textquoteright}08}, year = {2008}, month = {2008///}, pages = {3909 - 3912}, publisher = {ACM}, organization = {ACM}, abstract = {This workshop explores the challenges in applying, extending and inventing appropriate methods and contributions of Human Computer Interaction (HCI) to International economic and community Development. We address interaction design for parts of the world that are often marginalized by the Global North as well as people in the Global North who are themselves similarly marginalized by poverty or other barriers. We hope to extend the boundaries of the field of Human Computer Interaction by spurring a discussion on how existing methods and practices can be adapted and modified, and how new practices can be developed, to deal with the unique challenges posed by these contexts.}, keywords = {community design, ict4d, information and communication technology, international development, participatory design, ucd4id, User centered design}, isbn = {978-1-60558-012-8}, url = {http://doi.acm.org/10.1145/1358628.1358954}, author = {Thomas, John and Dearden, Andy and Dray, Susan and Light, Ann and Best, Michael and Arkin, Nuray and Maunder, Andrew and Kam, Mathew and Marshini Chetty and Sambasivan, Nithya and Buckhalter, Celeste and Krishnan, Gaurishankar} } @article {16844, title = {Hierarchical infrastructure for internet mapping services}, journal = {Geospatial Services and Applications for the Internet}, year = {2008}, month = {2008///}, pages = {1 - 30}, doi = {10.1007/978-0-387-74674-6_1}, author = {Brabec,F. and Samet, Hanan} } @conference {16836, title = {High-Dimensional Similarity Retrieval Using Dimensional Choice}, booktitle = {Similarity Search and Applications, 2008. SISAP 2008. First International Workshop on}, year = {2008}, month = {2008/04//}, pages = {35 - 42}, abstract = {There are several pieces of information that can be utilized in order to improve the efficiency of similarity searches on high-dimensional data. The most commonly used information is the distribution of the data itself but the use of dimensional choice based on the information in the query as well as the parameters of the distribution can provide an effective improvement in the query processing speed and storage. The use of this method can produce dimension reduction by as much as a factor of n, the number of data points in the database, over sequential search. We demonstrate that the curse of dimensionality is not based on the dimension of the data itself, but primarily upon the effective dimension of the distance function. We also introduce a new distance function that utilizes fewer dimensions of the higher dimensional space to produce a maximal lower bound distance in order to approximate the full distance function. This work has demonstrated significant dimension reduction, up to 70\% reduction with an improvement in accuracy or over 99\% with only a 6\% loss in accuracy on a prostate cancer data set.}, keywords = {data, database, function;high-dimensional, management, processing;, processing;sequential, reduction;database, reduction;distance, retrieval;query, search;data, search;similarity, similarity, system;dimension, systems;query}, doi = {10.1109/SISAP.2008.20}, author = {Tahmoush,D. and Samet, Hanan} } @article {15324, title = {How Do Users Find Things with PubMed? Towards Automatic Utility Evaluation with User Simulations}, year = {2008}, month = {2008/02//}, institution = {Human-Computer Interaction Lab, University of Maryland, College Park}, abstract = {In the context of document retrieval in the biomedical domain, this paper explores the complex relationship between the quality of initial query results and the overall utility of an interactive system. We demonstrate that a content-similarity browsing tool can compensate for poor retrieval results, and that the relationship between retrieval performance and overall utility is non-linear. Arguments are advanced with user simulations, which characterize the relevance of documents that a user might encounter with different browsing strategies. With broader implications to IR, this work provides a case study of how user simulations can be exploited as a formative tool for automatic utility evaluation. Simulation-based studies provide researchers with an additional evaluation tool to complement interactive and Cranfield-style experiments.}, keywords = {*BIOMEDICAL INFORMATION SYSTEMS, *BROWSING, *INFORMATION RETRIEVAL, *PUBMED, *SIMILARITY, *SIMULATION, *USER NEEDS, DOCUMENTS, FIND-SIMILAR, HUMAN FACTORS ENGINEERING \& MAN MACHINE SYSTEM, INFORMATION SCIENCE, MAN COMPUTER INTERFACE, QUALITY, queries, searching, TEST AND EVALUATION, UTILITY}, url = {http://stinet.dtic.mil/oai/oai?\&verb=getRecord\&metadataPrefix=html\&identifier=ADA478703}, author = {Jimmy Lin and Smucker,Mark D.} } @article {19195, title = {ilearn on the iphone: Real-time human activity classification on commodity mobile phones}, journal = {University of Washington CSE Tech Report UW-CSE-08-04-02}, year = {2008}, month = {2008}, author = {Saponas,T. and Lester,J. and Jon Froehlich and Fogarty,J. and Landay,J.} } @conference {18224, title = {Image acquisition forensics: Forensic analysis to identify imaging source}, booktitle = {Acoustics, Speech and Signal Processing, 2008. ICASSP 2008. IEEE International Conference on}, year = {2008}, month = {2008/04/31/4}, pages = {1657 - 1660}, abstract = {With widespread availability of digital images and easy-to-use image editing softwares, the origin and integrity of digital images has become a serious concern. This paper introduces the problem of image acquisition forensics and proposes a fusion of a set of signal processing features to identify the source of digital images. Our results show that the devices{\textquoteright} color interpolation coefficients and noise statistics can jointly serve as good forensic features to help accurately trace the origin of the input image to its production process and to differentiate between images produced by cameras, cell phone cameras, scanners, and computer graphics. Further, the proposed features can also be extended to determining the brand and model of the device. Thus, the techniques introduced in this work provide a unified framework for image acquisition forensics.}, keywords = {ACQUISITION, acquisition;image, analysis;, analysis;image, analysis;interpolation;statistical, cameras;color, cell, coefficients;computer, colour, editing, forensics;image, graphics;digital, identification;noise, images;forensic, Interpolation, phone, processing;data, softwares;imaging, source, statistics;scanners;signal}, doi = {10.1109/ICASSP.2008.4517945}, author = {McKay,C. and Swaminathan,A. and Gou,Hongmei and M. Wu} } @conference {15694, title = {Immunity-Based Epidemic Routing in Intermittent Networks}, booktitle = {5th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, 2008. SECON {\textquoteright}08}, year = {2008}, month = {2008/06/16/20}, pages = {609 - 611}, publisher = {IEEE}, organization = {IEEE}, abstract = {In this research, we propose to modify and extend epidemic routing used in intermittent networks. In particular, we propose to include immunity-based information disseminated in the reverse once messages get delivered to their destination. The goal is to design a more efficient routing protocol in terms of resource utilization. The idea is to analyze and evaluate the network performance using an immunity scheme in the context of epidemic routing and its variants. The reverse dissemination of such information requires minimal resources and the tradeoff in timely purging of delivered messages can be significant. We are using ns2 to implement a detailed simulation of the proposed immunity-based epidemic routing.}, keywords = {Analytical models, Delay, delivered messages, Disruption tolerant networking, Educational institutions, immunity-based epidemic routing, information dissemination, intermittent networks, Mobile ad hoc networks, Network topology, Performance analysis, Resource management, resource utilization, routing protocol, routing protocols, telecommunication network topology}, isbn = {978-1-4244-1777-3}, doi = {10.1109/SAHCN.2008.86}, author = {Mundur, Padma and Seligman,M. and Jin Na Lee} } @inbook {14700, title = {Implicit Flows: Can{\textquoteright}t Live with {\textquoteleft}Em, Can{\textquoteright}t Live without {\textquoteleft}Em}, booktitle = {Information Systems SecurityInformation Systems Security}, series = {Lecture Notes in Computer Science}, volume = {5352}, year = {2008}, month = {2008///}, pages = {56 - 70}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {Verifying that programs trusted to enforce security actually do so is a practical concern for programmers and administrators. However, there is a disconnect between the kinds of tools that have been successfully applied to real software systems (such as taint mode in Perl and Ruby), and information-flow compilers that enforce a variant of the stronger security property of noninterference. Tools that have been successfully used to find security violations have focused on explicit flows of information, where high-security information is directly leaked to output. Analysis tools that enforce noninterference also prevent implicit flows of information, where high-security information can be inferred from a program{\textquoteright}s flow of control. However, these tools have seen little use in practice, despite the stronger guarantees that they provide. To better understand why, this paper experimentally investigates the explicit and implicit flows identified by the standard algorithm for establishing noninterference. When applied to implementations of authentication and cryptographic functions, the standard algorithm discovers many real implicit flows of information, but also reports an extremely high number of false alarms, most of which are due to conservative handling of unchecked exceptions (e.g., null pointer exceptions). After a careful analysis of all sources of true and false alarms, due to both implicit and explicit flows, the paper concludes with some ideas to improve the false alarm rate, toward making stronger security analysis more practical.}, isbn = {978-3-540-89861-0}, url = {http://dx.doi.org/10.1007/978-3-540-89862-7_4}, author = {King,Dave and Hicks,Boniface and Hicks, Michael W. and Jaeger,Trent}, editor = {Sekar,R. and Pujari,Arun} } @conference {17601, title = {Improved algorithmic versions of the Lov{\'a}sz Local Lemma}, booktitle = {Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms}, series = {SODA {\textquoteright}08}, year = {2008}, month = {2008///}, pages = {611 - 620}, publisher = {Society for Industrial and Applied Mathematics}, organization = {Society for Industrial and Applied Mathematics}, address = {Philadelphia, PA, USA}, abstract = {The Lov{\'a}sz Local Lemma is a powerful tool in combinatorics and computer science. The original version of the lemma was nonconstructive, and efficient algorithmic versions have been developed by Beck, Alon, Molloy \& Reed, et al. In particular, the work of Molloy \& Reed lets us automatically extract efficient versions of essentially any application of the symmetric version of the Local Lemma. However, with some exceptions, there is a significant gap between what one can prove using the original Lemma nonconstructively, and what is possible through these efficient versions; also, some of these algorithmic versions run in super-polynomial time. Here, we lessen this gap, and improve the running time of all these applications (which cover all applications in the Molloy \& Reed framework) to polynomial. We also improve upon the parallel algorithmic version of the Local Lemma for hypergraph coloring due to Alon, by allowing noticeably more overlap among the edges.}, url = {http://dl.acm.org/citation.cfm?id=1347082.1347150}, author = {Srinivasan, Aravind} } @conference {17766, title = {Inconsistency management policies}, booktitle = {Proc. 2008 Intl. Conference on Knowledge Representation and Reasoning (KR 2008)}, year = {2008}, month = {2008///}, abstract = {Though there is much work on how inconsistency indatabases should be managed, there is good reason to believe that end users will want to bring their domain expertise and needs to bear in how to deal with inconsistencies. In this paper, we propose the concept of inconsistency management policies (IMPs). We show that IMPs are rich enough to spec- ify many types of inconsistency management methods pro- posed previously, but provide end users with tools that allow them to use the policies that they want. Our policies are also capable of allowing inconsistency to persist in the database or of eliminating more than a minimal subset of tuples involved in the inconsistency. We present a formal axiomatic definition of IMPs and present appropriate complexity results, together with results linking different IMPs together. We extend the relational algebra (RA) to incorporate IMPs and present the- oretical results showing how IMPs and classical RA operators interact. }, author = {Martinez,M. V and Parisi,F. and Pugliese, A. and Simari,G. I and V.S. Subrahmanian} } @conference {16843, title = {Indexing planar point quartets via geometric attributes}, booktitle = {Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems}, series = {GIS {\textquoteright}08}, year = {2008}, month = {2008///}, pages = {71:1{\textendash}71:4 - 71:1{\textendash}71:4}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {An index is devised to support position-independent search for images containing quartets of icons. Point quartets exist that do not unambiguously map to quadrilaterals, however, four points do unambiguously determine a set of six interpoint line segments. Values for the "size", "shape", and "orientation" attributes of an icon quartet can be derived as functions of this interpoint line set, and can be used to construct a point-based index, in which each point quartet maps to a single point in the resulting hyperdimensional index space. Orientation can be represented by a single, spatially closed dimension. However, assignment of a reference direction for quartets possessing a k-fold rotational symmetry presents a significant challenge. Methods are described for determining shape and orientation attributes for point quartets, and for mapping these attributes onto a set of attribute axes to form a combined index. The orientation computation supplies, as a byproduct, one component of the shape attribute. All attributes are continuous with respect to small variations in the indexed point quartets.}, isbn = {978-1-60558-323-5}, doi = {10.1145/1463434.1463516}, url = {http://doi.acm.org/10.1145/1463434.1463516}, author = {Cranston,Charles B. and Samet, Hanan} } @article {12829, title = {An instrumentation-based approach to controller model validation}, journal = {Model-Driven Development of Reliable Automotive Services}, year = {2008}, month = {2008///}, pages = {84 - 97}, author = {Cleaveland, Rance and Smolka,S. and Sims,S.} } @conference {12240, title = {Integrating categorical resource types into a P2P desktop grid system}, booktitle = {Grid Computing, 2008 9th IEEE/ACM International Conference on}, year = {2008}, month = {2008/10/29/1}, pages = {284 - 291}, abstract = {We describe and evaluate a set of protocols that implement a distributed, decentralized desktop grid. Incoming jobs are matched with system nodes through proximity in an N-dimensional resource space. This work improves on prior work by (1) efficiently accommodating node and job characterizations that include both continuous and categorical resource types, and (2) scaling gracefully to large system sizes even with highly non-uniform distributions of job and node types. We use extensive simulation results to show that the resulting system handles both continuous and categorical constraints efficiently, and that the new scalability techniques are effective.}, keywords = {computing;peer-to-peer, computing;protocols;, computing;protocols;scalability, desktop, Grid, grid;distributed, grid;peer-to-peer, N-dimensional, resource, space;P2P, system;categorical, technique;grid, types;decentralized}, doi = {10.1109/GRID.2008.4662810}, author = {Kim,Jik-Soo and Nam,Beomseok and Marsh,M. and Keleher,P. and Bhattacharjee, Bobby and Sussman, Alan} } @conference {17239, title = {Integrating statistics and visualization: case studies of gaining clarity during exploratory data analysis}, booktitle = {Proceedings of the twenty-sixth annual SIGCHI conference on Human factors in computing systems}, series = {CHI {\textquoteright}08}, year = {2008}, month = {2008///}, pages = {265 - 274}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Although both statistical methods and visualizations have been used by network analysts, exploratory data analysis remains a challenge. We propose that a tight integration of these technologies in an interactive exploratory tool could dramatically speed insight development. To test the power of this integrated approach, we created a novel social network analysis tool, SocialAction, and conducted four long-term case studies with domain experts, each working on unique data sets with unique problems. The structured replicated case studies show that the integrated approach in SocialAction led to significant discoveries by a political analyst, a bibliometrician, a healthcare consultant, and a counter-terrorism researcher. Our contributions demonstrate that the tight integration of statistics and visualizations improves exploratory data analysis, and that our evaluation methodology for long-term case studies captures the research strategies of data analysts.}, keywords = {case studies, Evaluation, exploratory data analysis, Information Visualization, social networks, Statistics}, isbn = {978-1-60558-011-1}, doi = {10.1145/1357054.1357101}, url = {http://doi.acm.org/10.1145/1357054.1357101}, author = {Perer,Adam and Shneiderman, Ben} } @article {16068, title = {Interactive auditory data exploration: A framework and evaluation with geo-referenced data sonification}, journal = {ACM Transactions on Computer-Human Interaction}, year = {2008}, month = {2008///}, abstract = {We describe an Action-by-Design-Component (ADC) framework to guide auditory interface designers for exploratory data analysis. The framework characterizes data interaction in the auditory mode as a set of Auditory Information Seeking Actions (AISAs). Contrasting AISAs with actions in visualizations, the framework also discusses design considerations for a set of Design Components to support AISAs. Applying the framework to geo-referenced data, we systematically explored and evaluated its design space. A data exploration tool, iSonic, was built for blind users. In depth case studies with 7 blind users, with over 42 hours of data collection, showed that iSonic enabled them to find facts and discover trends of geo-referenced data, even in unfamiliar geographical contexts, without special devices. The results also showed that blind users dramatically benefited from the rich set of task-oriented actions (AISAs) and the use of multiple highly coordinated data views provided by the ADC framework. Some widely used techniques in visualization, with appropriate adaptation, also work in the auditory mode. The application of the framework to scatterplots shows that the framework can be generalized and lead to the design of a unified auditory workspace for general exploratory data analysis. Readers can view a supplementary video demonstration of iSonic by visiting www.cs.umd.edu/hcil/iSonic/}, author = {Zhao,H. and Plaisant, Catherine and Shneiderman, Ben and Lazar,J.} } @article {17250, title = {Interactive Entity Resolution in Relational Data: A Visual Analytic Tool and Its Evaluation}, journal = {IEEE Transactions on Visualization and Computer Graphics}, volume = {14}, year = {2008}, month = {2008/10//Sept}, pages = {999 - 1014}, abstract = {Databases often contain uncertain and imprecise references to real-world entities. Entity resolution, the process of reconciling multiple references to underlying real-world entities, is an important data cleaning process required before accurate visualization or analysis of the data is possible. In many cases, in addition to noisy data describing entities, there is data describing the relationships among the entities. This relational data is important during the entity resolution process; it is useful both for the algorithms which determine likely database references to be resolved and for visual analytic tools which support the entity resolution process. In this paper, we introduce a novel user interface, D-Dupe, for interactive entity resolution in relational data. D-Dupe effectively combines relational entity resolution algorithms with a novel network visualization that enables users to make use of an entity{\textquoteright}s relational context for making resolution decisions. Since resolution decisions often are interdependent, D-Dupe facilitates understanding this complex process through animations which highlight combined inferences and a history mechanism which allows users to inspect chains of resolution decisions. An empirical study with 12 users confirmed the benefits of the relational context visualization on the performance of entity resolution tasks in relational data in terms of time as well as users{\textquoteright} confidence and satisfaction.}, keywords = {algorithms, Computer Graphics, D-Dupe, data visualisation, database management systems, Databases, Factual, graphical user interface, Graphical user interfaces, human-centered computing, Image Interpretation, Computer-Assisted, Information Storage and Retrieval, Information Visualization, interactive entity resolution, relational context visualization, Relational databases, relational entity resolution algorithm, User interfaces, user-centered design, User-Computer Interface, visual analytic tool}, isbn = {1077-2626}, doi = {10.1109/TVCG.2008.55}, author = {Kang,Hyunmo and Getoor, Lise and Shneiderman, Ben and Bilgic,M. and Licamele,L.} } @conference {13807, title = {Language and translation model adaptation using comparable corpora}, booktitle = {Proceedings of the Conference on Empirical Methods in Natural Language Processing}, series = {EMNLP {\textquoteright}08}, year = {2008}, month = {2008///}, pages = {857 - 866}, publisher = {Association for Computational Linguistics}, organization = {Association for Computational Linguistics}, address = {Stroudsburg, PA, USA}, abstract = {Traditionally, statistical machine translation systems have relied on parallel bi-lingual data to train a translation model. While bi-lingual parallel data are expensive to generate, monolingual data are relatively common. Yet monolingual data have been under-utilized, having been used primarily for training a language model in the target language. This paper describes a novel method for utilizing monolingual target data to improve the performance of a statistical machine translation system on news stories. The method exploits the existence of comparable text---multiple texts in the target language that discuss the same or similar stories as found in the source language document. For every source document that is to be translated, a large monolingual data set in the target language is searched for documents that might be comparable to the source documents. These documents are then used to adapt the MT system to increase the probability of generating texts that resemble the comparable document. Experimental results obtained by adapting both the language and translation models show substantial gains over the baseline system.}, url = {http://dl.acm.org/citation.cfm?id=1613715.1613825}, author = {Snover,Matthew and Dorr, Bonnie J and Schwartz,Richard} } @conference {14454, title = {Leveraging social context for searching social media}, booktitle = {Proceedings of the 2008 ACM workshop on Search in social media}, series = {SSM {\textquoteright}08}, year = {2008}, month = {2008///}, pages = {91 - 94}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {The ability to utilize and benefit from today{\textquoteright}s explosion of social media sites depends on providing tools that allow users to productively participate. In order to participate, users must be able to find resources (both people and information) that they find valuable. Here, we argue that in order to do this effectively, we should make use of a user{\textquoteright}s "social context". A user{\textquoteright}s social context includes both their personal social context (their friends and the communities to which they belong) and their community social context (their role and identity in different communities).}, keywords = {social context, social media, social search}, isbn = {978-1-60558-258-0}, doi = {10.1145/1458583.1458602}, url = {http://doi.acm.org/10.1145/1458583.1458602}, author = {Smith,Marc and Barash,Vladimir and Getoor, Lise and Lauw,Hady W.} } @article {12542, title = {Machine Recognition of Human Activities: A Survey}, journal = {Circuits and Systems for Video Technology, IEEE Transactions on}, volume = {18}, year = {2008}, month = {2008/11//}, pages = {1473 - 1488}, abstract = {The past decade has witnessed a rapid proliferation of video cameras in all walks of life and has resulted in a tremendous explosion of video content. Several applications such as content-based video annotation and retrieval, highlight extraction and video summarization require recognition of the activities occurring in the video. The analysis of human activities in videos is an area with increasingly important consequences from security and surveillance to entertainment and personal archiving. Several challenges at various levels of processing-robustness against errors in low-level processing, view and rate-invariant representations at midlevel processing and semantic representation of human activities at higher level processing-make this problem hard to solve. In this review paper, we present a comprehensive survey of efforts in the past couple of decades to address the problems of representation, recognition, and learning of human activities from video and related applications. We discuss the problem at two major levels of complexity: 1) "actions" and 2) "activities." "Actions" are characterized by simple motion patterns typically executed by a single human. "Activities" are more complex and involve coordinated actions among a small number of humans. We will discuss several approaches and classify them according to their ability to handle varying degrees of complexity as interpreted above. We begin with a discussion of approaches to model the simplest of action classes known as atomic or primitive actions that do not require sophisticated dynamical modeling. Then, methods to model actions with more complex dynamics are discussed. The discussion then leads naturally to methods for higher level representation of complex activities.}, keywords = {activity;low-level, annotation;human, cameras;video, content-based, factors;image, processing;machine, processing;rate-invariant, recognition;image, recognition;midlevel, representation;image, representation;video, representations;semantic, retrieval;human, sequences;, summarization;content-based, video}, isbn = {1051-8215}, doi = {10.1109/TCSVT.2008.2005594}, author = {Turaga,P. and Chellapa, Rama and V.S. Subrahmanian and Udrea,O.} } @article {14569, title = {Maternal depletion of CTCF reveals multiple functions during oocyte and preimplantation embryo development}, journal = {Development}, volume = {135}, year = {2008}, month = {2008///}, pages = {2729 - 2738}, abstract = {CTCF is a multifunctional nuclear factor involved in epigenetic regulation. Despite recent advances that include the systematic discovery of CTCF-binding sites throughout the mammalian genome, the in vivo roles of CTCF in adult tissues and during embryonic development are largely unknown. Using transgenic RNAi, we depleted maternal stores of CTCF from growing mouse oocytes, and identified hundreds of misregulated genes. Moreover, our analysis suggests that CTCF predominantly activates or derepresses transcription in oocytes. CTCF depletion causes meiotic defects in the egg, and mitotic defects in the embryo that are accompanied by defects in zygotic gene expression, and culminate in apoptosis. Maternal pronuclear transfer and CTCF mRNA microinjection experiments indicate that CTCF is a mammalian maternal effect gene, and that persistent transcriptional defects rather than persistent chromosomal defects perturb early embryonic development. This is the first study detailing a global and essential role for CTCF in mouse oocytes and preimplantation embryos.}, doi = {10.1242/dev.024539}, url = {http://dev.biologists.org/content/135/16/2729.abstract}, author = {Wan,Le-Ben and Pan,Hua and Hannenhalli, Sridhar and Cheng,Yong and Ma,Jun and Fedoriw,Andrew and Lobanenkov,Victor and Latham,Keith E. and Schultz,Richard M. and Bartolomei,Marisa S.} } @conference {17536, title = {Measurement Manipulation and Space Selection in Network Coordinates}, booktitle = {Distributed Computing Systems, International Conference on}, year = {2008}, month = {2008///}, pages = {361 - 368}, publisher = {IEEE Computer Society}, organization = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, abstract = {Internet coordinate systems have emerged as an efficient method to estimate the latency between pairs of nodes without any communication between them. However, most coordinate systems have been evaluated solely on data sets built by their authors from measurements gathered over large periods of time. Although they show good prediction results, it is unclear whether the accuracy is the result of the system design properties or is more connected to the characteristics of the data sets. In this paper, we revisit a simple question: how do the features of the embedding space and the inherent attributes of the data sets interact in producing good embeddings? We adapt the Vivaldi algorithm to use Hyperbolic space for embedding and evaluate both Euclidean and Hyperbolic Vivaldi on seven sets of real-world latencies. Our results show that node filtering and latency distributions can significantly influence the accuracy of the predictions. For example, although Euclidean Vivaldi performs well on data sets that were chosen, constructed and filtered by the designers of the algorithm, its performance and robustness decrease considerably when run on third party data sets that were not filtered a priori. Our results offer important insight into designing and building coordinate systems that are both robust and accurate in Internet-like environments.}, doi = {http://doi.ieeecomputersociety.org/10.1109/ICDCS.2008.27}, author = {Lumezanu,Cristian and Spring, Neil} } @article {12360, title = {Memory-constrained block processing for dsp software optimization}, journal = {Journal of Signal Processing Systems}, volume = {50}, year = {2008}, month = {2008///}, pages = {163 - 177}, author = {Ko,M. Y and Shen,C. C and Bhattacharyya, Shuvra S.} } @article {16835, title = {Metric space similarity joins}, journal = {ACM Trans. Database Syst.}, volume = {33}, year = {2008}, month = {2008/06//}, pages = {7:1{\textendash}7:38 - 7:1{\textendash}7:38}, abstract = {Similarity join algorithms find pairs of objects that lie within a certain distance ε of each other. Algorithms that are adapted from spatial join techniques are designed primarily for data in a vector space and often employ some form of a multidimensional index. For these algorithms, when the data lies in a metric space, the usual solution is to embed the data in vector space and then make use of a multidimensional index. Such an approach has a number of drawbacks when the data is high dimensional as we must eventually find the most discriminating dimensions, which is not trivial. In addition, although the maximum distance between objects increases with dimension, the ability to discriminate between objects in each dimension does not. These drawbacks are overcome via the introduction of a new method called Quickjoin that does not require a multidimensional index and instead adapts techniques used in distance-based indexing for use in a method that is conceptually similar to the Quicksort algorithm. A formal analysis is provided of the Quickjoin method. Experiments show that the Quickjoin method significantly outperforms two existing techniques.}, keywords = {distance-based indexing, external memory algorithms, nearest neighbor queries, range queries, Ranking, Similarity join}, isbn = {0362-5915}, doi = {10.1145/1366102.1366104}, url = {http://doi.acm.org/10.1145/1366102.1366104}, author = {Jacox,Edwin H. and Samet, Hanan} } @article {12557, title = {Mixed state models for automatic target recognition and behavior analysis in video sequences}, journal = {Proceedings of SPIE}, volume = {6967}, year = {2008}, month = {2008/04/03/}, pages = {69670Q-69670Q-11 - 69670Q-69670Q-11}, abstract = {Mixed state or hybrid state space systems are useful tools for various problems in computer vision. These systems model complicated system dynamics as a mixture of inherently simple sub-systems, with an additional mechanism to switch between the sub-systems. This approach of modeling using simpler systems allows for ease in learning the parameters of the system and in solving the inference problem. In this paper, we study the use of such mixed state space systems for problems in recognition and behavior analysis in video sequences. We begin with a dynamical system formulation for recognition of faces from a video. This system is used to introduce the simultaneous tracking and recognition paradigm that allows for improved performance in both tracking and recognition. We extend this framework to design a second system for verification of vehicles across non-overlapping views using structural and textural fingerprints for characterizing the identity of the target. Finally, we show the use of such modeling for tracking and behavior analysis of bees from video.}, isbn = {0277786X}, doi = {doi:10.1117/12.777766}, url = {http://spiedigitallibrary.org/proceedings/resource/2/psisdg/6967/1/69670Q_1?isAuthorized=no}, author = {Chellapa, Rama and Sankaranarayanan,Aswin C. and Veeraraghavan,Ashok} } @article {12851, title = {Model Based Design Verification: A Monitor Based Approach}, volume = {2008-01-0741}, year = {2008}, month = {2008/04//}, institution = {SAE International}, address = {Warrendale, PA}, abstract = {This paper assesses the utility of an automated functional verification methodology in the design of a body electronics application. The use of design models as detailed specifications for software is gaining steady acceptance in the automotive industry because of the advantages it offers in terms of rapid system prototyping and automatic code generation. This paper argues that such modeling effort can also be used to provide support for design verification, so that errors may be pinpointed before they find their way into code, when they become much harder and more expensive to isolate, diagnose and repair.}, url = {http://papers.sae.org/2008-01-0741}, author = {Ackermann,Chris and Ray,Arnab and Cleaveland, Rance and Heit,J{\"u}rgen and Martin,Christopher and Shelton,Charles} } @article {12544, title = {Model Driven Segmentation of Articulating Humans in Laplacian Eigenspace}, journal = {Pattern Analysis and Machine Intelligence, IEEE Transactions on}, volume = {30}, year = {2008}, month = {2008/10//}, pages = {1771 - 1785}, abstract = {We propose a general approach using Laplacian Eigenmaps and a graphical model of the human body to segment 3D voxel data of humans into different articulated chains. In the bottom-up stage, the voxels are transformed into a high-dimensional (6D or less) Laplacian Eigenspace (LE) of the voxel neighborhood graph. We show that LE is effective at mapping voxels on long articulated chains to nodes on smooth 1D curves that can be easily discriminated, and prove these properties using representative graphs. We fit 1D splines to voxels belonging to different articulated chains such as the limbs, head and trunk, and determine the boundary between splines using the spline fitting error. A top-down probabilistic approach is then used to register the segmented chains, utilizing their mutual connectivity and individual properties. Our approach enables us to deal with complex poses such as those where the limbs form loops. We use the segmentation results to automatically estimate the human body models. While we use human subjects in our experiments, the method is fairly general and can be applied to voxel-based segmentation of any articulated object composed of long chains. We present results on real and synthetic data that illustrate the usefulness of this approach.}, keywords = {3D voxel data segmentation, algorithms, Anatomic;Pattern Recognition, Artificial intelligence, Automated;Reproducibility of Results;Sensitivity and Specificity;Whole Body Imaging;, Computer simulation, Computer-Assisted;Imaging, curve fitting, Eigenvalues and eigenfunctions, graph theory, human articulation, human body graphical model, human motion analysis, HUMANS, Image Enhancement, Image Interpretation, Image motion analysis, image registration, Image segmentation, Laplace transforms, Laplacian eigenspace transform, model driven segmentation, probability, representative graph, skeleton registration, Smoothing methods, solid modelling, spline fitting error, splines (mathematics), Three-Dimensional;Joints;Models, top-down probabilistic approach, voxel neighborhood graph}, isbn = {0162-8828}, doi = {10.1109/TPAMI.2007.70823}, author = {Sundaresan, A. and Chellapa, Rama} } @article {14708, title = {Modular Information Hiding and Type-Safe Linking for C}, journal = {IEEE Transactions on Software Engineering}, volume = {34}, year = {2008}, month = {2008/06//May}, pages = {357 - 376}, abstract = {This paper presents CMod, a novel tool that provides a sound module system for C. CMod works by enforcing four rules that are based on principles of modular reasoning and on current programming practice. CMod{\textquoteright}s rules flesh out the convention that .h header files are module interfaces and .c source files are module implementations. Although this convention is well-known, existing explanations of it are incomplete, omitting important subtleties needed for soundness. In contrast, we have proven formally that CMod{\textquoteright}s rules enforce both information hiding and type-safe linking. To use CMod, the programmer develops and builds their software as usual, redirecting the compiler and linker to CMod{\textquoteright}s wrappers. We evaluated CMod by applying it to 30 open source programs, totaling more than one million LoC. Violations to CMod{\textquoteright}s rules revealed more than a thousand information hiding errors, dozens of typing errors, and hundreds of cases that, although not currently bugs, make programming mistakes more likely as the code evolves. At the same time, programs generally adhere to the assumptions underlying CMod{\textquoteright}s rules, and so we could fix rule violations with a modest effort. We conclude that CMod can effectively support modular programming in C: it soundly enforces type-safe linking and information-hiding while being largely compatible with existing practice.}, keywords = {C language, CMOD, Code design, Coding Tools and Techniques, compiler, data encapsulation, Information hiding, modular information hiding, modular reasoning, modules, object-oriented programming, open source programs, packages, program compilers, public domain software, reliability, software reusability, type-safe linking}, isbn = {0098-5589}, doi = {10.1109/TSE.2008.25}, author = {Srivastava,S. and Hicks, Michael W. and Foster, Jeffrey S. and Jenkins,P.} } @article {12976, title = {A molecular footprint of limb loss: sequence variation of the autopodial identity gene Hoxa-13}, journal = {J Mol Evol}, volume = {67}, year = {2008}, month = {2008/12//}, pages = {581 - 593}, abstract = {The homeobox gene Hoxa-13 codes for a transcription factor involved in multiple functions, including body axis and hand/foot development in tetrapods. In this study we investigate whether the loss of one function (e.g., limb loss in snakes) left a molecular footprint in exon 1 of Hoxa-13 that could be associated with the release of functional constraints caused by limb loss. Fragments of the Hoxa-13 exon 1 were sequenced from 13 species and analyzed, with additional published sequences of the same region, using relative rates and likelihood-ratio tests. Five amino acid sites in exon 1 of Hoxa-13 were detected as evolving under positive selection in the stem lineage of snakes. To further investigate whether there is an association between limb loss and sequence variation in Hoxa-13, we used the random forest method on an alignment that included shark, basal fish lineages, and "eu-tetrapods" such as mammals, turtle, alligator, and birds. The random forest method approaches the problem as one of classification, where we seek to predict the presence or absence of autopodium based on amino acid variation in Hoxa-13 sequences. Different alignments tested were associated with similar error rates (18.42\%). The random forest method suggested that phenotypic states (autopodium present and absent) can often be correctly predicted based on Hoxa-13 sequences. Basal, nontetrapod gnat-hostomes that never had an autopodium were consistently classified as limbless together with the snakes, while eu-tetrapods without any history of limb loss in their phylogeny were also consistently classified as having a limb. Misclassifications affected mostly lizards, which, as a group, have a history of limb loss and limb re-evolution, and the urodele and caecilian in our sample. We conclude that a molecular footprint can be detected in Hoxa-13 that is associated with the lack of an autopodium; groups with classification ambiguity (lizards) are characterized by a history of repeated limb loss and possible limb re-evolution.}, doi = {10.1007/s00239-008-9156-7}, author = {Kohlsdorf,T and Cummings, Michael P. and Lynch,VJ and Stopper,GF and Takahashi,K and Wagner,GP} } @conference {12247, title = {Motivating participation in internet routing overlays}, booktitle = {Proceedings of the 3rd international workshop on Economics of networked systems}, series = {NetEcon {\textquoteright}08}, year = {2008}, month = {2008///}, pages = {91 - 96}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {PeerWise is an Internet routing overlay that reduces end-to-end latencies by allowing peers to forward through a relay instead of connecting directly to their destinations. Fundamental to PeerWise is the notion of peering agreements between two peers, wherein they agree to forward for one another. In this paper, we consider the problem of motivating users to establish and maintain peerings in a completely decentralized, scalable manner. We show that routing overlays present unique challenges and goals. For instance, since participants can always "fall back" on standard Internet routing, we must encourage users to stay in the system and maintain long-lived peering agreements. To address these challenges, we propose two mechanisms: First, we use Service Level Agreements (SLAs) to expressively negotiate peers{\textquoteright} demands and the recourses they will take when SLAs are violated. Second, we propose a mechanism to address SLA violations that differs from the standard notion of punishment via service degradation. Our simulation results demonstrate that our mechanism causes peers to avoid SLA violators in favor of long-lived peerings. Lastly, we discuss potential, emergent behaviors in a selfish routing overlay.}, keywords = {incentives, internet routing overlays, service-level agreements}, isbn = {978-1-60558-179-8}, doi = {10.1145/1403027.1403048}, url = {http://doi.acm.org/10.1145/1403027.1403048}, author = {Levin,Dave and Baden,Randolph and Lumezanu,Cristian and Spring, Neil and Bhattacharjee, Bobby} } @article {16385, title = {Multi-agent learning with a distributed genetic algorithm}, journal = {AAMAS 2008: ALAMAS + ALAg Workshop}, year = {2008}, month = {2008///}, abstract = {Lightweight agents distributed in space have the potential to solve many complex problems. In this paper, we examine a model where agents represent individuals in a genetic algorithm (GA) solving a shared problem. We examine two questions: (1) How does the network density of connections between agents a ffect the performance of the systems? (2) How does the interaction topology a affect the performance of the system? In our model, agents exist in either a random network topology with long-distance communication, or a location-based topology, where agents only communicate with near neighbors. We examine both fixed and dynamic networks. Within the context of our investigation, our initial results indicate that relatively low network density achievesthe same results as a panmictic, or fully connected, population. Additionally, we find that dynamic networks outperform fixed networks, and that random network topologies outperform proximity-based network topologies. We conclude by showing how this model can be useful not only for multi-agent learning, but also for genetic algorithms, agent-based simulation and models of diff usion of innovation. }, author = {Stonedahl,F. and Rand, William and Wilensky,U.} } @article {17303, title = {NASDAQ Velocity and Forces: An Interactive Visualization of Activity and Change}, journal = {Journal of Universal Computer Science}, volume = {14}, year = {2008}, month = {2008///}, pages = {1391 - 1410}, author = {Dao,H.T. and Bazinet,A. and Berthier,R. and Shneiderman, Ben} } @article {12900, title = {New records of phytoplankton for Bangladesh. 2. Cryptophyceae and Synurophyceae}, journal = {Bangladesh Journal of Botany}, volume = {36}, year = {2008}, month = {2008/11/05/}, abstract = {This study presents two species of Rhodomonas, four species of Chroomonas, six species of Cryptomonas and Cryptochrysis minor, Cyanomonas coeruleus, Chrysodidymus synuroideus and Mallomonas akrokomos. These species have been reported from some ponds of Mathbaria in Pirojpur and Bakerganj of Barisal district in Bangladesh.}, isbn = {0253-5416}, doi = {10.3329/bjb.v36i1.1549}, url = {http://www.banglajol.info/bd/index.php/BJB/article/viewArticle/1549}, author = {Khondker,Moniruzzaman and Bhuiyan,Rauf Ahmed and Yeasmin,Jenat and Alam,Munirul and Sack,R. Bradley and Huq,Anwar and Rita R Colwell} } @article {12902, title = {New records of phytoplankton for Bangladesh. 5. Euglena, Euglenocapsa}, journal = {Bangladesh Journal of Plant Taxonomy}, volume = {15}, year = {2008}, month = {2008/06/16/}, abstract = {This study presents 20 taxa of the genus Euglena and one species of the rare euglenoid genus Euglenocapsa. All these taxa are reported for the first time from some pond ecosystems of Mathbaria in Pirojpur and Bakerganj of Barisal districts of Bangladesh.}, isbn = {1028-2092}, doi = {10.3329/bjpt.v15i1.910}, url = {http://www.banglajol.info/index.php/BJPT/article/viewArticle/910}, author = {Khondker,Moniruzzaman and Bhuiyan,Rauf Ahmed and Yeasmin,Jenat and Alam,Munirul and Sack,R. Bradley and Huq,Anwar and Rita R Colwell} } @article {12899, title = {New records of phytoplankton for Bangladesh. 7. Phacus spp.}, journal = {Bangladesh Journal of Botany}, volume = {37}, year = {2008}, month = {2008/11/05/}, abstract = {Thirteen species of Phacus hitherto not reported from Bangladesh have been described and illustrated. Freshwater ponds at southern districts of Pirojpur and Barisal revealed these presence of the species.}, isbn = {0253-5416}, doi = {10.3329/bjb.v37i1.1564}, url = {http://www.banglajol.info/bd/index.php/BJB/article/viewArticle/1564}, author = {Khondker,Moniruzzaman and Bhuiyan,Rauf Ahmed and Yeasmin,Jenat and Alam,Munirul and Sack,R. Bradley and Huq,Anwar and Rita R Colwell} } @article {12897, title = {New records of phytoplankton for Bangladesh. 8. Trachelomonas Ehr. (Euglenophyceae)}, journal = {Bangladesh Journal of Botany}, volume = {37}, year = {2008}, month = {2008/12/19/}, abstract = {Investigation of pelagic plankton communities from some freshwater ponds of Pirojpur and Barisal districts revealed the presence of 17 species under the genus Trachelomonas Ehr. for the first time in Bangladesh.}, isbn = {0253-5416}, doi = {10.3329/bjb.v37i2.1719}, url = {http://www.banglajol.info/bd/index.php/BJB/article/viewArticle/1719}, author = {Khondker,Moniruzzaman and Bhuiyan,Rauf Ahmed and Yeasmin,Jenat and Alam,Munirul and Sack,R. Bradley and Huq,Anwar and Rita R Colwell} } @conference {16839, title = {NewsStand: a new view on news}, booktitle = {Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems}, series = {GIS {\textquoteright}08}, year = {2008}, month = {2008///}, pages = {18:1{\textendash}18:10 - 18:1{\textendash}18:10}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {News articles contain a wealth of implicit geographic content that if exposed to readers improves understanding of today{\textquoteright}s news. However, most articles are not explicitly geotagged with their geographic content, and few news aggregation systems expose this content to users. A new system named NewsStand is presented that collects, analyzes, and displays news stories in a map interface, thus leveraging on their implicit geographic content. NewsStand monitors RSS feeds from thousands of online news sources and retrieves articles within minutes of publication. It then extracts geographic content from articles using a custom-built geotagger, and groups articles into story clusters using a fast online clustering algorithm. By panning and zooming in NewsStand{\textquoteright}s map interface, users can retrieve stories based on both topical significance and geographic region, and see substantially different stories depending on position and zoom level.}, keywords = {clustering, geotagging, knowledge discovery, text mining}, isbn = {978-1-60558-323-5}, doi = {10.1145/1463434.1463458}, url = {http://doi.acm.org/10.1145/1463434.1463458}, author = {Teitler,Benjamin E. and Lieberman,Michael D. and Panozzo,Daniele and Sankaranarayanan,Jagan and Samet, Hanan and Sperling,Jon} } @article {16937, title = {A Node Aggregation Strategy to Reduce Complexity of Network Visualization using Semantic Substrates}, year = {2008}, month = {2008///}, institution = {Human-Computer Interaction Lab, University of Maryland}, abstract = {Semantic substrates are spatial templates for networks, wherenodes are grouped into regions and laid out within each region according to one or more node attributes. Analysts{\textquoteright} ability to design their own substrates leads to a different approach than other more automatic approaches to layout nodes (force-directed, circular, etc.). While the semantic substrate approach provides more interpretable node locations, sometimes a set of nodes is compressed into a small space on the display, leading to node overlap. In this paper, we significantly improve this situation by introducing the node aggregation mechanism in the context of semantic substrates. We illustrate this functionality in a document citation network and provide pros and cons of the approach. We conclude with guidelines and future directions for this research. Throughout the paper, examples are illustrated with NVSS 3.0, the network visualization tool developed to explore the semantic substrate idea. }, author = {Aris,A. and Shneiderman, Ben} } @article {17547, title = {A note on the distribution of the number of prime factors of the integers}, journal = {Information Processing Letters}, volume = {109}, year = {2008}, month = {2008/12/31/}, pages = {133 - 135}, abstract = {The Chernoff{\textendash}Hoeffding bounds are fundamental probabilistic tools. An elementary approach is presented to obtain a Chernoff-type upper-tail bound for the number of prime factors of a random integer in { 1 , 2 , {\textellipsis} , n } . The method illustrates tail bounds in negatively-correlated settings.}, keywords = {Chernoff bounds, Dependent random variables, Primes, Probabilistic number theory, randomized algorithms, Tail bounds}, isbn = {0020-0190}, doi = {10.1016/j.ipl.2008.09.010}, url = {http://www.sciencedirect.com/science/article/pii/S0020019008002688}, author = {Srinivasan, Aravind} } @article {12545, title = {Object Detection, Tracking and Recognition for Multiple Smart Cameras}, journal = {Proceedings of the IEEE}, volume = {96}, year = {2008}, month = {2008/10//}, pages = {1606 - 1624}, abstract = {Video cameras are among the most commonly used sensors in a large number of applications, ranging from surveillance to smart rooms for videoconferencing. There is a need to develop algorithms for tasks such as detection, tracking, and recognition of objects, specifically using distributed networks of cameras. The projective nature of imaging sensors provides ample challenges for data association across cameras. We first discuss the nature of these challenges in the context of visual sensor networks. Then, we show how real-world constraints can be favorably exploited in order to tackle these challenges. Examples of real-world constraints are (a) the presence of a world plane, (b) the presence of a three-dimiensional scene model, (c) consistency of motion across cameras, and (d) color and texture properties. In this regard, the main focus of this paper is towards highlighting the efficient use of the geometric constraints induced by the imaging devices to derive distributed algorithms for target detection, tracking, and recognition. Our discussions are supported by several examples drawn from real applications. Lastly, we also describe several potential research problems that remain to be addressed.}, keywords = {algorithm;geometric, analysis;image, association;distributed, camera;visual, cameras;, cameras;object, colour, constraints;imaging, data, detection;object, detection;sensor, detection;three-dimiensional, fusion;target, model;video, network;distributed, recognition;object, scene, sensor, sensor;multiple, sensors;geometry;image, sensors;object, smart, texture;intelligent, tracking;target, tracking;video}, isbn = {0018-9219}, doi = {10.1109/JPROC.2008.928758}, author = {Sankaranarayanan,A. C and Veeraraghavan,A. and Chellapa, Rama} } @article {12910, title = {Occurrence and Expression of Luminescence in Vibrio Cholerae}, journal = {Applied and Environmental MicrobiologyAppl. Environ. Microbiol.}, volume = {74}, year = {2008}, month = {2008/02/01/}, pages = {708 - 715}, abstract = {Several species of the genus Vibrio, including Vibrio cholerae, are bioluminescent or contain bioluminescent strains. Previous studies have reported that only 10\% of V. cholerae strains are luminescent. Analysis of 224 isolates of non-O1/non-O139 V. cholerae collected from Chesapeake Bay, MD, revealed that 52\% (116/224) were luminescent when an improved assay method was employed and 58\% (130/224) of isolates harbored the luxA gene. In contrast, 334 non-O1/non-O139 V. cholerae strains isolated from two rural provinces in Bangladesh yielded only 21 (6.3\%) luminescent and 35 (10.5\%) luxA+ isolates. An additional 270 clinical and environmental isolates of V. cholerae serogroups O1 and O139 were tested, and none were luminescent or harbored luxA. These results indicate that bioluminescence may be a trait specific for non-O1/non-O139 V. cholerae strains that frequently occur in certain environments. Luminescence expression patterns of V. cholerae were also investigated, and isolates could be grouped based on expression level. Several strains with defective expression of the lux operon, including natural K variants, were identified.}, isbn = {0099-2240, 1098-5336}, doi = {10.1128/AEM.01537-07}, url = {http://aem.asm.org/content/74/3/708}, author = {Grim,Christopher J. and Taviani,Elisa and Alam,Munirul and Huq,Anwar and Sack,R. Bradley and Rita R Colwell} } @inbook {19642, title = {Optimal Cryptographic Hardness of Learning Monotone Functions}, booktitle = {Automata, Languages and Programming}, series = {Lecture Notes in Computer Science}, year = {2008}, month = {2008/01/01/}, pages = {36 - 47}, publisher = {Springer Berlin Heidelberg}, organization = {Springer Berlin Heidelberg}, abstract = {A wide range of positive and negative results have been established for learning different classes of Boolean functions from uniformly distributed random examples. However, polynomial-time algorithms have thus far been obtained almost exclusively for various classes of monotone functions, while the computational hardness results obtained to date have all been for various classes of general (nonmonotone) functions. Motivated by this disparity between known positive results (for monotone functions) and negative results (for nonmonotone functions), we establish strong computational limitations on the efficient learnability of various classes of monotone functions. We give several such hardness results which are provably almost optimal since they nearly match known positive results. Some of our results show cryptographic hardness of learning polynomial-size monotone circuits to accuracy only slightly greater than 1/2+1/n--√1/2 + 1/\sqrt{n} ; this accuracy bound is close to optimal by known positive results (Blum et al., FOCS {\textquoteright}98). Other results show that under a plausible cryptographic hardness assumption, a class of constant-depth, sub-polynomial-size circuits computing monotone functions is hard to learn; this result is close to optimal in terms of the circuit size parameter by known positive results as well (Servedio, Information and Computation {\textquoteright}04). Our main tool is a complexity-theoretic approach to hardness amplification via noise sensitivity of monotone functions that was pioneered by O{\textquoteright}Donnell (JCSS {\textquoteright}04).}, keywords = {Data structures, Data Structures, Cryptology and Information Theory, Discrete Mathematics in Computer Science, Numeric Computing, Software Engineering/Programming and Operating Systems, Theory of computation}, isbn = {978-3-540-70574-1, 978-3-540-70575-8}, url = {http://link.springer.com/chapter/10.1007/978-3-540-70575-8_4}, author = {Dana Dachman-Soled and Lee, Homin K. and Malkin, Tal and Servedio, Rocco A. and Wan, Andrew and Wee, Hoeteck}, editor = {Aceto, Luca and Damg{\r a}rd, Ivan and Goldberg, Leslie Ann and Halld{\'o}rsson, Magn{\'u}s M. and Ing{\'o}lfsd{\'o}ttir, Anna and Walukiewicz, Igor} } @conference {12560, title = {Optimal Multi-View Fusion of Object Locations}, booktitle = {Motion and video Computing, 2008. WMVC 2008. IEEE Workshop on}, year = {2008}, month = {2008/01//}, pages = {1 - 8}, abstract = {In surveillance applications, it is common to have multiple cameras observing targets exhibiting motion on a ground plane. Tracking and estimation of the location of a target on the plane becomes an important inference problem. In this paper, we study the problem of combining estimates of location obtained from multiple cameras. We model the relation between the uncertainty in the location estimation to the position and location of the camera with respect to the plane (which is encoded by a 2D projective transformation). This is addressed by a theoretical study of the properties of a random variable under a projective transformation and analysis of the geometric setting when the moments of the transformed random variable exist. In this context, we prove that ground plane tracking near the horizon line is often inaccurate. Using suitable approximations to compute the moments, a minimum variance estimator is designed to fuse the multi-camera location estimates. Finally, we present experimental results that illustrate the importance of such modeling in location estimation and tracking.}, keywords = {control;surveillance;tracking;, detection;position, estimates;optimal, estimation;location, estimation;multicamera, estimation;object, estimator;motion, fusion;surveillance;cameras;estimation, location, multiview, theory;motion, tracking;minimum, variance}, doi = {10.1109/WMVC.2008.4544048}, author = {Sankaranarayanan,A. C and Chellapa, Rama} } @article {15013, title = {Parallel Algorithms for Volumetric Surface Construction}, year = {2008}, month = {2008///}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {Large scale scientific data sets are appearing at an increasing rate whose sizes can range from hundreds of gigabytes to tens of terabytes. Isosurface extraction and rendering is an important visualization technique that enables the visual exploration of such data sets using surfaces. However the computational requirements of this approach are substantial which in general prevent the interactive rendering of isosurfaces for large data sets. Therefore, parallel and distributed computing techniques offer a promising direction to deal with the corresponding computational challenges. In this chapter, we give a brief historical perspective of the isosurface visualization approach, and describe the basic sequential and parallel techniques used to extract and render isosurfaces with a particular focus on out-of-core techniques. For parallel algorithms, we assume a distributed memory model in which each processor has its own local disk, and processors communicate and exchange data through an interconnection network. We present a general framework for evaluating parallel isosurface extraction algorithms and describe the related best known parallel algorithms. We also describe the main parallel strategies used to handle isosurface rendering, pointing out the limitations of these strategies. 1.}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=?doi=10.1.1.122.4472}, author = {JaJa, Joseph F. and Shi,Qingmin and Varshney, Amitabh} } @conference {14714, title = {Path projection for user-centered static analysis tools}, booktitle = {Proceedings of the 8th ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering}, series = {PASTE {\textquoteright}08}, year = {2008}, month = {2008///}, pages = {57 - 63}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {The research and industrial communities have made great strides in developing sophisticated defect detection tools based on static analysis. To date most of the work in this area has focused on developing novel static analysis algorithms, but has neglected study of other aspects of static analysis tools, particularly user interfaces. In this work, we present a novel user interface toolkit called Path Projection that helps users visualize, navigate, and understand program paths, a common component of many tools{\textquoteright} error reports. We performed a controlled user study to measure the benefit of Path Projection in triaging error reports from Locksmith, a data race detection tool for C. We found that Path Projection improved participants{\textquoteright} time to complete this task without affecting accuracy, while participants felt Path Projection was useful and strongly preferred it to a more standard viewer.}, isbn = {978-1-60558-382-2}, doi = {10.1145/1512475.1512488}, url = {http://doi.acm.org/10.1145/1512475.1512488}, author = {Khoo,Yit Phang and Foster, Jeffrey S. and Hicks, Michael W. and Sazawal,Vibha} } @conference {18155, title = {A pattern classification framework for theoretical analysis of component forensics}, booktitle = {Acoustics, Speech and Signal Processing, 2008. ICASSP 2008. IEEE International Conference on}, year = {2008}, month = {2008/04/31/4}, pages = {1665 - 1668}, abstract = {Component forensics is an emerging methodology for forensic analysis that aims at estimating the algorithms and parameters in each component of a digital device. This paper proposes a theoretical foundation to examine the performance limits of component forensics. Using ideas from pattern classification theory, we define formal notions of identifiability of components in the information processing chain. We show that the parameters of certain device components can be accurately identified only in controlled settings through semi non-intrusive forensics, while the parameters of some others can be computed directly from the available sample data via complete non-intrusive analysis. We then extend the proposed theoretical framework to quantify and improve the accuracies and confidence in component parameter identification for several forensic applications.}, keywords = {analysis;information, classification;, classification;parameter, component, estimation;pattern, forensics;component, forensics;pattern, identification;forensic, parameter, processing;nonintrusive}, doi = {10.1109/ICASSP.2008.4517947}, author = {Swaminathan,A. and M. Wu and Liu,K. J.R} } @conference {15145, title = {Predicate encryption supporting disjunctions, polynomial equations, and inner products}, booktitle = {Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology}, series = {EUROCRYPT{\textquoteright}08}, year = {2008}, month = {2008///}, pages = {146 - 162}, publisher = {Springer-Verlag}, organization = {Springer-Verlag}, address = {Berlin, Heidelberg}, abstract = {Predicate encryption is a new paradigm generalizing, among other things, identity-based encryption. In a predicate encryption scheme, secret keys correspond to predicates and ciphertexts are associated with attributes; the secret key SKf corresponding to a predicate f can be used to decrypt a ciphertext associated with attribute I if and only if f(I) = 1. Constructions of such schemes are currently known for relatively few classes of predicates. We construct such a scheme for predicates corresponding to the evaluation of inner products over ZN (for some large integer N). This, in turn, enables constructions in which predicates correspond to the evaluation of disjunctions, polynomials, CNF/DNF formulae, or threshold predicates (among others). Besides serving as a significant step forward in the theory of predicate encryption, our results lead to a number of applications that are interesting in their own right.}, isbn = {3-540-78966-9, 978-3-540-78966-6}, url = {http://dl.acm.org/citation.cfm?id=1788414.1788423}, author = {Katz, Jonathan and Sahai,Amit and Waters,Brent} } @inbook {17668, title = {The Randomized Coloring Procedure with Symmetry-Breaking}, booktitle = {Automata, Languages and ProgrammingAutomata, Languages and Programming}, series = {Lecture Notes in Computer Science}, volume = {5125}, year = {2008}, month = {2008///}, pages = {306 - 319}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {A basic randomized coloring procedure has been used in probabilistic proofs to obtain remarkably strong results on graph coloring. These results include the asymptotic version of the List Coloring Conjecture due to Kahn, the extensions of Brooks{\textquoteright} Theorem to sparse graphs due to Kim and Johansson, and Luby{\textquoteright}s fast parallel and distributed algorithms for graph coloring. The most challenging aspect of a typical probabilistic proof is showing adequate concentration bounds for key random variables. In this paper, we present a simple symmetry-breaking augmentation to the randomized coloring procedure that works well in conjunction with Azuma{\textquoteright}s Martingale Inequality to easily yield the requisite concentration bounds. We use this approach to obtain a number of results in two areas: frugal coloring and weighted equitable coloring . A β-frugal coloring of a graph G is a proper vertex-coloring of G in which no color appears more than β times in any neighborhood. Let G = ( V , E ) be a vertex-weighted graph with weight function w : V {\textrightarrow}[0, 1] and let W = ∑ v ∈ V w ( v ). A weighted equitable coloring of G is a proper k -coloring such that the total weight of every color class is {\textquotedblleft}large{\textquotedblright}, i.e., {\textquotedblleft}not much smaller{\textquotedblright} than W / k ; this notion is useful in obtaining tail bounds for sums of dependent random variables.}, isbn = {978-3-540-70574-1}, url = {http://dx.doi.org/10.1007/978-3-540-70575-8_26}, author = {Pemmaraju,Sriram and Srinivasan, Aravind}, 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 {15497, title = {Relationships between Test Suites, Faults, and Fault Detection in GUI Testing}, booktitle = {Software Testing, Verification, and Validation, 2008 1st International Conference on}, year = {2008}, month = {2008/04//}, pages = {12 - 21}, abstract = {Software-testing researchers have long sought recipes for test suites that detect faults well. In the literature, empirical studies of testing techniques abound, yet the ideal technique for detecting the desired kinds of faults in a given situation often remains unclear. This work shows how understanding the context in which testing occurs, in terms of factors likely to influence fault detection, can make evaluations of testing techniques more readily applicable to new situations. We present a methodology for discovering which factors do statistically affect fault detection, and we perform an experiment with a set of test-suite- and fault-related factors in the GUI testing of two fielded, open-source applications. Statement coverage and GUI-event coverage are found to be statistically related to the likelihood of detecting certain kinds of faults.}, keywords = {Fault detection, fault-related factors, Graphical user interfaces, GUI testing, program testing, software-testing, test suites, test-suite-related factors}, doi = {10.1109/ICST.2008.26}, author = {Strecker,J. and Memon, Atif M.} } @article {17346, title = {Research Agenda: Visual Overviews for Exploratory Search}, journal = {Information Seeking Support Systems}, volume = {11}, year = {2008}, month = {2008///}, pages = {4 - 4}, abstract = {Exploratory search is necessary when users knowledge ofthe domain is incomplete or when initial user goals do not match available data or metadata that is the basis for search indexing attributes. Such mismatches mean that users need to learn more in order to develop a better understanding of the domain or to revise their search goals. Exploratory search processes may take weeks or months, so interfaces that support prolonged exploration are necessary. The attraction of exploratory search is that users can take on more ambitious goals that require substantial learning and creative leaps to bridge the gaps between what they know and that they seek. }, author = {Shneiderman, Ben} } @article {13016, title = {Resolving arthropod phylogeny: exploring phylogenetic signal within 41 kb of protein-coding nuclear gene sequence}, journal = {Syst Biol}, volume = {57}, year = {2008}, month = {2008/12//}, pages = {920 - 938}, abstract = {This study attempts to resolve relationships among and within the four basal arthropod lineages (Pancrustacea, Myriapoda, Euchelicerata, Pycnogonida) and to assess the widespread expectation that remaining phylogenetic problems will yield to increasing amounts of sequence data. Sixty-eight regions of 62 protein-coding nuclear genes (approximately 41 kilobases (kb)/taxon) were sequenced for 12 taxonomically diverse arthropod taxa and a tardigrade outgroup. Parsimony, likelihood, and Bayesian analyses of total nucleotide data generally strongly supported the monophyly of each of the basal lineages represented by more than one species. Other relationships within the Arthropoda were also supported, with support levels depending on method of analysis and inclusion/exclusion of synonymous changes. Removing third codon positions, where the assumption of base compositional homogeneity was rejected, altered the results. Removing the final class of synonymous mutations{\textendash}first codon positions encoding leucine and arginine, which were also compositionally heterogeneous{\textendash}yielded a data set that was consistent with a hypothesis of base compositional homogeneity. Furthermore, under such a data-exclusion regime, all 68 gene regions individually were consistent with base compositional homogeneity. Restricting likelihood analyses to nonsynonymous change recovered trees with strong support for the basal lineages but not for other groups that were variably supported with more inclusive data sets. In a further effort to increase phylogenetic signal, three types of data exploration were undertaken. (1) Individual genes were ranked by their average rate of nonsynonymous change, and three rate categories were assigned{\textendash}fast, intermediate, and slow. Then, bootstrap analysis of each gene was performed separately to see which taxonomic groups received strong support. Five taxonomic groups were strongly supported independently by two or more genes, and these genes mostly belonged to the slow or intermediate categories, whereas groups supported only by a single gene region tended to be from genes of the fast category, arguing that fast genes provide a less consistent signal. (2) A sensitivity analysis was performed in which increasing numbers of genes were excluded, beginning with the fastest. The number of strongly supported nodes increased up to a point and then decreased slightly. Recovery of Hexapoda required removal of fast genes. Support for Mandibulata (Pancrustacea + Myriapoda) also increased, at times to "strong" levels, with removal of the fastest genes. (3) Concordance selection was evaluated by clustering genes according to their ability to recover Pancrustacea, Euchelicerata, or Myriapoda and analyzing the three clusters separately. All clusters of genes recovered the three concordance clades but were at times inconsistent in the relationships recovered among and within these clades, a result that indicates that the a priori concordance criteria may bias phylogenetic signal in unexpected ways. In a further attempt to increase support of taxonomic relationships, sequence data from 49 additional taxa for three slow genes (i.e., EF-1 alpha, EF-2, and Pol II) were combined with the various 13-taxon data sets. The 62-taxon analyses supported the results of the 13-taxon analyses and provided increased support for additional pancrustacean clades found in an earlier analysis including only EF-1 alpha, EF-2, and Pol II.}, doi = {10.1080/10635150802570791}, author = {Regier,J. C and Shultz,J. W and Ganley,A. R.D and Hussey,A. and Shi,D. and Ball,B. and Zwick,A. and Stajich,J. E and Cummings, Michael P. and Martin,J. W and Cunningham,CW} } @article {13133, title = {Resource allocation for tracking multiple targets using particle filters}, journal = {The Eighth International Workshop on Visual Surveillance}, year = {2008}, month = {2008///}, abstract = {Particle filters have been very widely used to track targets in video sequences. However, they suffer from an exponential rise in the number of particles needed to jointly track multiple targets. On the other hand, using multiple independent filters to track in crowded scenes often leads to erroneous results. We present a new particle filtering framework which uses an intelligent resource allocation scheme allowing us to track a large number of targets using a small set of particles. First, targets with overlapping posterior distributions and similar appearance models are clustered into interaction groups and tracked jointly, but independent of other targets in the scene. Second, different number of particles are allocated to different groups based on the following observations. Groups with higher associations (quantifying spatial proximity and pairwise appearance similarity) are given more particles. Groups with larger number of targets are given a larger number of particles. Finally, groups with ineffective proposal distributions are assigned more particles. Our experiments demonstrate the effectiveness of this framework over the commonly used joint particle filter with Markov Chain Monte Carlo (MCMC) sampling.}, author = {Kembhavi,A. and Schwartz, W.R. and Davis, Larry S. and others} } @inbook {13634, title = {Review of Classifier Combination Methods}, booktitle = {Studies in Computational Intelligence: Machine Learning in Document Analysis and RecognitionStudies in Computational Intelligence: Machine Learning in Document Analysis and Recognition}, year = {2008}, month = {2008///}, pages = {361 - 386}, publisher = {Springer}, organization = {Springer}, abstract = {Classifier combination methods have proved to be an effective tool to increase the performance of pattern recognition applications. In this chapter we review and categorize major advancements in this field. Despite a significant number of publications describing successful classifier combination implementations, the theoretical basis is still missing and achieved improvements are inconsistent. By introducing different categories of classifier combinations in this review we attempt to put forward more specific directions for future theoretical research.We also introduce a retraining effect and effects of locality based training as important properties of classifier combinations. Such effects have significant influence on the performance of combinations, and their study is necessary for complete theoretical understanding of combination algorithms.}, author = {Tulyakov,Sergey and Jaeger,Stefan and Govindaraju,Venu and David Doermann}, editor = {Simone Marinai,Hiromichi Fujisawa} } @conference {16010, title = {The role of metacognition in robust AI systems}, booktitle = {AAAI-08 Workshop on Metareasoning,(Chicago, IL)}, year = {2008}, month = {2008///}, author = {Schmill,M. D and Oates,T. and Anderson,M. and Fults,S. and Josyula,D. and Perlis, Don and Wilson,S.} } @conference {16840, title = {Scalable network distance browsing in spatial databases}, booktitle = {Proceedings of the 2008 ACM SIGMOD international conference on Management of data}, series = {SIGMOD {\textquoteright}08}, year = {2008}, month = {2008///}, pages = {43 - 54}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {An algorithm is presented for finding the k nearest neighbors in a spatial network in a best-first manner using network distance. The algorithm is based on precomputing the shortest paths between all possible vertices in the network and then making use of an encoding that takes advantage of the fact that the shortest paths from vertex u to all of the remaining vertices can be decomposed into subsets based on the first edges on the shortest paths to them from u. Thus, in the worst case, the amount of work depends on the number of objects that are examined and the number of links on the shortest paths to them from q, rather than depending on the number of vertices in the network. The amount of storage required to keep track of the subsets is reduced by taking advantage of their spatial coherence which is captured by the aid of a shortest path quadtree. In particular, experiments on a number of large road networks as well as a theoretical analysis have shown that the storage has been reduced from O(N3) to O(N1.5) (i.e., by an order of magnitude equal to the square root). The precomputation of the shortest paths along the network essentially decouples the process of computing shortest paths along the network from that of finding the neighbors, and thereby also decouples the domain S of the query objects and that of the objects from which the neighbors are drawn from the domain V of the vertices of the spatial network. This means that as long as the spatial network is unchanged, the algorithm and underlying representation of the shortest paths in the spatial network can be used with different sets of objects.}, keywords = {decoupling, nearest neighbor, scalability, shortest path quadtree, spatial networks}, isbn = {978-1-60558-102-6}, doi = {10.1145/1376616.1376623}, url = {http://doi.acm.org/10.1145/1376616.1376623}, author = {Samet, Hanan and Sankaranarayanan,Jagan and Alborzi,Houman} } @conference {17761, title = {Scaling RDF with Time}, booktitle = {Proceedings of the 17th international conference on World Wide Web}, series = {WWW {\textquoteright}08}, year = {2008}, month = {2008///}, pages = {605 - 614}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {The World Wide Web Consortium{\textquoteright}s RDF standard primarily consists of (subject, property, object) triples that specify the value that a given subject has for a given property. However, it is frequently the case that even for a fixed subject and property, the value varies with time. As a consequence, efforts have been made to annotate RDF triples with "valid time" intervals. However, to date, no proposals exist for efficient indexing of such temporal RDF databases. It is clearly beneficial to store RDF data in a relational DB - however, standard relational indexes are inadequately equipped to handle RDF{\textquoteright}s graph structure. In this paper, we propose the tGRIN index structure that builds a specialized index for temporal RDF that is physically stored in an RDBMS. Past efforts to store RDF in relational stores include Jena2 from HP, Sesame from OpenRDF.org, and 3store from the University of Southampton. We show that even when these efforts are augmented with well known temporal indexes like R+ trees, SR-trees, ST-index, and MAP21, the tGRIN index exhibits superior performance. In terms of index build time, tGRIN takes two thirds or less of the time used by any other system, and it uses a comparable amount of memory and less disk space than Jena, Sesame and 3store. More importantly, tGRIN can answer queries three to six times faster for average query graph patterns and five to ten times faster for complex queries than these systems.}, keywords = {RDF indexing, resource description framework, temporal RDF}, isbn = {978-1-60558-085-2}, doi = {10.1145/1367497.1367579}, url = {http://doi.acm.org/10.1145/1367497.1367579}, author = {Pugliese,Andrea and Udrea,Octavian and V.S. Subrahmanian} } @article {16070, title = {Searching Electronic Health Records for Temporal Patterns in Patient Histories: A Case Study with Microsoft Amalga}, journal = {AMIA Annual Symposium ProceedingsAMIA Annu Symp Proc}, volume = {2008}, year = {2008}, month = {2008///}, pages = {601 - 605}, abstract = {As electronic health records (EHR) become more widespread, they enable clinicians and researchers to pose complex queries that can benefit immediate patient care and deepen understanding of medical treatment and outcomes. However, current query tools make complex temporal queries difficult to pose, and physicians have to rely on computer professionals to specify the queries for them. This paper describes our efforts to develop a novel query tool implemented in a large operational system at the Washington Hospital Center (Microsoft Amalga, formerly known as Azyxxi). We describe our design of the interface to specify temporal patterns and the visual presentation of results, and report on a pilot user study looking for adverse reactions following radiology studies using contrast.}, isbn = {1942-597X}, author = {Plaisant, Catherine and Lam,Stanley and Shneiderman, Ben and Smith,Mark S. and Roseman,David and Marchand,Greg and Gillam,Michael and Feied,Craig and Handler,Jonathan and Rappaport,Hank} } @article {14853, title = {Searching the world{\textquoteright}s herbaria: A system for visual identification of plant species}, journal = {Computer Vision{\textendash}ECCV 2008}, year = {2008}, month = {2008///}, pages = {116 - 129}, abstract = {We describe a working computer vision system that aids in the identification of plant species. A user photographs an isolated leaf on a blank background, and the system extracts the leaf shape and matches it to the shape of leaves of known species. In a few seconds, the system displays the top matching species, along with textual descriptions and additional images. This system is currently in use by botanists at the Smithsonian Institution National Museum of Natural History. The primary contributions of this paper are: a description of a working computer vision system and its user interface for an important new application area; the introduction of three new datasets containing thousands of single leaf images, each labeled by species and verified by botanists at the US National Herbarium; recognition results for two of the three leaf datasets; and descriptions throughout of practical lessons learned in constructing this system.}, doi = {10.1007/978-3-540-88693-8_9}, author = {Belhumeur,P. and Chen,D. and Feiner,S. and Jacobs, David W. and Kress,W. and Ling,H. and Lopez,I. and Ramamoorthi,R. and Sheorey,S. and White,S.} } @article {12907, title = {Seasonal Cholera from Multiple Small Outbreaks, Rural Bangladesh}, journal = {Emerging Infectious DiseasesEmerg Infect Dis}, volume = {14}, year = {2008}, month = {2008/05//}, pages = {831 - 833}, abstract = {Clinical and environmental Vibrio cholerae organisms collected from February 2004 through April 2005 were systematically isolated from 2 rural Bangladeshi locales. Their genetic relatedness was evaluated at 5 loci that contained a variable number of tandem repeats (VNTR). The observed minimal overlap in VNTR patterns between the 2 communities was consistent with sequential, small outbreaks from local sources.}, isbn = {1080-6040}, doi = {10.3201/eid1405.071116}, author = {Stine,O. Colin and Alam,Munirul and Tang,Li and Nair,G. Balakrish and Siddique,A. Kasem and Faruque,Shah M. and Huq,Anwar and Rita R Colwell and Sack,R. Bradley and Morris,J. Glenn} } @book {13327, title = {Shape Analysis and Structuring}, year = {2008}, month = {2008///}, publisher = {Springer}, organization = {Springer}, abstract = {With a lot of recent developments in the field, this much-needed book has come at just the right time. It covers a variety of topics related to preserving and enhancing shape information at a geometric level. The contributors also cover subjects that are relevant to effectively capturing the structure of a shape by identifying relevant shape components and their mutual relationships.}, keywords = {Computer Graphics, Computer vision, Computers / Computer Graphics, Computers / Image Processing, Geometrical models, Geometry, Geometry, Analytic, Image analysis, IMAGE PROCESSING, Mathematics / Functional Analysis, Mathematics / Geometry / General, Mathematics / Graphic Methods, Mathematics / Mathematical Analysis, shapes, Technology \& Engineering / Engineering (General), Visualization}, isbn = {9783540332640}, author = {De Floriani, Leila and Spagnuolo,Michela} } @article {13134, title = {A {\textquotedblleft}Shape Aware{\textquotedblright} Model for semi-supervised Learning of Objects and its Context}, journal = {Proc. of NIPS}, year = {2008}, month = {2008///}, abstract = {We present an approach that combines bag-of-words and spatial models to performsemantic and syntactic analysis for recognition of an object based on its internal appearance and its context. We argue that while object recognition requires mod- eling relative spatial locations of image features within the object, a bag-of-word is sufficient for representing context. Learning such a model from weakly labeled data involves labeling of features into two classes: foreground(object) or {\textquotedblleft}infor- mative{\textquotedblright} background(context). We present a {\textquotedblleft}shape-aware{\textquotedblright} model which utilizes contour information for efficient and accurate labeling of features in the image. Our approach iterates between an MCMC-based labeling and contour based la- beling of features to integrate co-occurrence of features and shape similarity. }, author = {Gupta,A. and Shi,J. and Davis, Larry S.} } @article {12559, title = {Shape-and-Behavior Encoded Tracking of Bee Dances}, journal = {Pattern Analysis and Machine Intelligence, IEEE Transactions on}, volume = {30}, year = {2008}, month = {2008/03//}, pages = {463 - 476}, abstract = {Behavior analysis of social insects has garnered impetus in recent years and has led to some advances in fields like control systems and flight navigation. Manual labeling of insect motions required for analyzing the behaviors of insects requires significant investment of time and effort. In this paper, we propose certain general principles that help in simultaneous automatic tracking and behavior analysis, with applications in tracking bees and recognizing specific behaviors that they exhibit. The state space for tracking is defined using the position, orientation, and current behavior of the insect being tracked. The position and the orientation are parameterized using a shape model, whereas the behavior is explicitly modeled using a three-tier hierarchical motion model. The first tier (dynamics) models the local motions exhibited, and the models built in this tier act as a vocabulary for behavior modeling. The second tier is a Markov motion model built on top of the local motion vocabulary, which serves as the behavior model. The third tier of the hierarchy models the switching between behaviors, and this is also modeled as a Markov model. We address issues in learning the three-tier behavioral model, in discriminating between models, and in detecting and modeling abnormal behaviors. Another important aspect of this work is that it leads to joint tracking and behavior analysis instead of the traditional "track-and-then-recognize" approach. We apply these principles for tracking bees in a hive while they are executing the waggle dance and the round dance.}, keywords = {Automated;Reproducibility of Results;Sensitivity and Specificity;Social Behavior;, Computer-Assisted;Imaging, Markov model;bee dance;behavior analysis;shape model;social insect;three-tier hierarchical motion model;tracking;video sequence;waggle dance;Markov processes;image sequences;optical tracking;video signal processing;zoology;Algorithms;Animal Communication;, Three-Dimensional;Information Storage and Retrieval;Male;Pattern Recognition}, isbn = {0162-8828}, doi = {10.1109/TPAMI.2007.70707}, author = {Veeraraghavan,A. and Chellapa, Rama and Srinivasan, M.} } @article {18533, title = {SNARE: Spatio-temporal Network-level Automatic Reputation Engine}, volume = {GT-CSE-08-02}, year = {2008}, month = {2008///}, institution = {Georgia Institute of Technology}, abstract = {Current spam filtering techniques classify email based oncontent and IP reputation blacklists or whitelists. Unfortu- nately, spammers can alter spam content to evade content- based filters, and spammers continually change the IP ad- dresses from which they send spam. Previous work has sug- gested that filters based on network-level behavior might be more efficient and robust, by making decisions based on how messages are sent, as opposed to what is being sent or who is sending them. This paper presents a technique to identify spammers based on features that exploit the network-level spatio- temporal behavior of email senders to differentiate the spam- ming IPs from legitimate senders. Our behavioral classifier has two benefits: (1) it is early (i.e., it can automatically detect spam without seeing a large amount of email from a sending IP address{\textemdash}sometimes even upon seeing only a single packet); (2) it is evasion-resistant (i.e., it is based on spatial and temporal features that are difficult for a sender to change). We build classifiers based on these features us- ing two different machine learning methods, support vec- tor machine and decision trees, and we study the efficacy of these classifiers using labeled data from a deployed com- mercial spam-filtering system. Surprisingly, using only fea- tures from a single IP packet header (i.e., without looking at packet contents), our classifier can identify spammers with about 93\% accuracy and a reasonably low false-positive rate (about 7\%). After looking at a single message spammer identification accuracy improves to more than 94\% with a false rate of just over 5\%. These suggest an effective sender reputation mechanism. }, url = {http://hdl.handle.net/1853/25135}, author = {Feamster, Nick and Gray,A.G. and Krasser,S. and Syed,N.A.} } @conference {17765, title = {The soma terror organization portal (stop): Social network and analytic tools for the real-time analysis of terror groups}, booktitle = {First Intl. Workshop on Social Computing, Behavioral Modeling and Prediction}, year = {2008}, month = {2008///}, abstract = {Stochastic Opponent Modeling Agents (SOMA) have been proposed as a paradigm for reasoning about cultural groups, terror groups, and other socioeconomic-political-military organizations worldwide. In this paper, we describe the SOMA Terror Organization Portal (STOP). STOP provides a single point of contact through which analysts may access data about terror groups world wide. In order to analyze this data, SOMA provides three major components: the SOMA Extraction Engine (SEE), the SOMA Adversarial Forecast Engine (SAFE), and the SOMA Analyst NEtwork (SANE) that allows analysts to find other analysts doing similar work, share findings with them, and let consensus findings emerge. This paper describes the STOP framework.}, doi = {10.1007/978-0-387-77672-9_2}, author = {Martinez,V. and Simari,G. and Sliva,A. and V.S. Subrahmanian} } @article {17760, title = {The SOMA Terror Organization Portal (STOP): social network and analytic tools for the real-time analysis of terror groups}, journal = {Social Computing, Behavioral Modeling, and Prediction}, year = {2008}, month = {2008///}, pages = {9 - 18}, abstract = {Stochastic Opponent Modeling Agents (SOMA) have been proposed as a paradigm for reasoning about cultural groups, terror groups, and other socioeconomic-political-military organizations worldwide. In this paper, we describe the SOMA Terror Organization Portal (STOP). STOP provides a single point of contact through which analysts may access data about terror groups world wide. In order to analyze this data, SOMA provides three major components: the SOMA Extraction Engine (SEE), the SOMA Adversarial Forecast Engine (SAFE), and the SOMA Analyst NEtwork (SANE) that allows analysts to find other analysts doing similar work, share findings with them, and let consensus findings emerge. This paper describes the STOP framework.}, doi = {10.1007/978-0-387-77672-9_2}, author = {Sliva,A. and V.S. Subrahmanian and Martinez,V. and Simari,G. I} } @conference {16841, title = {A sorting approach to indexing spatial data}, booktitle = {ACM SIGGRAPH 2008 classes}, series = {SIGGRAPH {\textquoteright}08}, year = {2008}, month = {2008///}, pages = {91:1{\textendash}91:15 - 91:1{\textendash}91:15}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Spatial data is distinguished from conventional data by having extent. Therefore, spatial queries involve both the objects and the space that they occupy. The handling of queries that involve spatial data is facilitated by building an index on the data. The traditional role of the index is to sort the data, which means that it orders the data. However, since generally no ordering exists in dimensions greater than 1 without a transformation of the data to one dimension, the role of the sort process is one of differentiating between the data and what is usually done is to sort the spatial objects with respect to the space that they occupy. The resulting ordering is usually implicit rather than explicit so that the data need not be resorted (i.e., the index need not be rebuilt) when the queries change (e.g., the query reference objects). The index is said to order the space and the characteristics of such indexes are explored further.}, doi = {10.1145/1401132.1401250}, url = {http://doi.acm.org/10.1145/1401132.1401250}, author = {Samet, Hanan} } @conference {12546, title = {Stochastic fusion of multi-view gradient fields}, booktitle = {Image Processing, 2008. ICIP 2008. 15th IEEE International Conference on}, year = {2008}, month = {2008/10//}, pages = {1324 - 1327}, abstract = {Image gradients form powerful cues in a host of vision and graphics applications. In this paper, we consider multiple views of a textured planar scene and consider the problem of estimating the scene texture map using these multi-view inputs. Modeling each camera view as a projective transformation of the scene, we show that the problem is equivalent to that of studying the effect of noise (and the projective imaging) on the gradient fields induced by this texture map. We show that these noisy gradient fields can be modeled as complete observers of the scene radiance. Further, the corrupting noise can be shown to be additive and linear, although spatially varying. However, the specific form of the noise term can be exploited to design linear estimators that fuse the gradient fields obtained from each of the individual views. The fused gradient field forms a robust estimate of the scene gradients and can be used for scene reconstruction.}, keywords = {application;brightness;cameras;gradient, application;image, camera, estimators;multiview, fields;projective, fusion;image, fusion;textured, gradient, gradients;linear, gradients;scene, imaging;scene, map;stochastic, methods;image, noise;graphics, planar, radiance;scene, reconstruction;image, reconstruction;scene, scene;vision, TEXTURE, texture;, view;corrupting}, doi = {10.1109/ICIP.2008.4712007}, author = {Sankaranarayanan,A. C and Chellapa, Rama} } @article {17767, title = {Stochastic opponent modeling agents: A case study with Hamas}, journal = {Proceedings of ICCCD}, year = {2008}, month = {2008///}, abstract = {Stochastic Opponent Modeling Agents (SOMA) have beenproposed as a paradigm for reasoning about cultural groups, terror groups, and other socio-economic-political-military organizations worldwide. In this paper, we describe a case study that shows how SOMA was used to model the behavior of the terrorist organization, Hamas. Our team, consisting of a mix of computer scientists, policy experts, and political scientists, were able to understand new facts about Hamas of which even seasoned Hamas experts may not have been aware. This paper briefly overviews SOMA rules, explains how several thousand SOMA rules for Hamas were automatically derived, and then describes a few key findings about Hamas, enabled by this framework. }, author = {Mannes,A. and Sliva,A. and V.S. Subrahmanian and Wilkenfeld,J.} } @article {14433, title = {Structural Sampling for Statistical Software Testing}, journal = {Probabilistic, Logical and Relational Learning-A Further Synthesis}, year = {2008}, month = {2008///}, abstract = {Structural Statistical Software Testing exploits the control flow graph of the program being tested to construct test cases. While test cases can easily be extracted from {em feasible paths} in the control flow graph, that is, paths which are actually exerted for some values of the program input, the feasible path region is a tiny fraction of the graph paths (less than $10^{-5}]$ for medium size programs). The S4T algorithm presented in this paper aims to address this limitation; as an Active Relational Learning Algorithm, it uses the few feasible paths initially available to sample new feasible paths. The difficulty comes from the non-Markovian nature of the feasible path concept, due to the long-range dependencies between the nodes in the control flow graph. Experimental validation on real-world and artificial problems demonstrates significant improvements compared to the state of the art.}, author = {Baskiotis,N. and Sebag,M. and De Raedt,L. and Dietterich,T. and Getoor, Lise and Kersting,K. and Muggleton,S. H} } @conference {18777, title = {A Survey of the Virtual Environments-based Assembly Training Applications}, year = {2008}, month = {2008///}, abstract = {The advent of virtual environments is presenting new ways of trainingtomorrow{\textquoteright}s workforce. Virtual environments offer numerous benefits in training applications. First, virtual environments allow extensive user interactions in a very convenient and natural manner. This interaction is greatly beneficial for increasing the user{\textquoteright}s retention of spatial information compared to text-based or video-based instructions that are non-interactive in nature. Second, virtual environments provide users with a 3D immersive experience. This feature helps users gain a better understanding of spatial relationships compared to 2D displays. Third, virtual environments support multi-media instructions. One can watch standard videos, view 3D animations, view text instructions, listen to audio instructions, and interact with 3D objects in the scene. This paper describes representative research and associated systems that use of virtual environments in assembly training applications. }, url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.151.2892\&rep=rep1\&type=pdf}, author = {Gupta,S.K. and Anand,D. K. and Brough,J. E. and Kavetsky,R. A. and Schwartz,M. and Thakur,A.} } @conference {17392, title = {Systematic yet flexible discovery: guiding domain experts through exploratory data analysis}, booktitle = {Proceedings of the 13th international conference on Intelligent user interfaces}, series = {IUI {\textquoteright}08}, year = {2008}, month = {2008///}, pages = {109 - 118}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {During exploratory data analysis, visualizations are often useful for making sense of complex data sets. However, as data sets increase in size and complexity, static information visualizations decrease in comprehensibility. Interactive techniques can yield valuable discoveries, but current data analysis tools typically support only opportunistic exploration that may be inefficient and incomplete. We present a refined architecture that uses systematic yet flexible (SYF) design goals to guide domain expert users through complex exploration of data over days, weeks and months. The SYF system aims to support exploratory data analysis with some of the simplicity of an e-commerce check-out while providing added flexibility to pursue insights. The SYF system provides an overview of the analysis process, suggests unexplored states, allows users to annotate useful states, supports collaboration, and enables reuse of successful strategies. The affordances of the SYF system are demonstrated by integrating it into a social network analysis tool employed by social scientists and intelligence analysts. The SYF system is a tool-independent component and can be incorporated into other data analysis tools.}, keywords = {exploratory data analysis, guides, Information Visualization, social networks, systematic yet flexible, wizards}, isbn = {978-1-59593-987-6}, doi = {10.1145/1378773.1378788}, url = {http://doi.acm.org/10.1145/1378773.1378788}, author = {Perer,Adam and Shneiderman, Ben} } @conference {18865, title = {System-Level Optimization Model for a Snake-Inspired Robot Based on a Rectilinear Gait}, year = {2008}, month = {2008///}, pages = {913 - 924}, publisher = {ASME}, organization = {ASME}, abstract = {Physical parameters of modules and gait parameters affect the overall snake-inspired robot performance. Hence the system-level optimization model has to concurrently optimize the module parameters and the gait. The equations of motion associated with the rectilinear gait are quite complex due to the changing topology of the rectilinear gait. Embedding these equations in the system-level optimization model leads to a computationally challenging formulation. This paper presents a system-level optimization model that utilizes a hierarchical optimization approach and meta-models of the pre-computed optimal gaits to reduce the complexity of the optimization model. This approach enabled us to use an experimentally validated physics-based model of the rectilinear gait and yet at the same time enabled us to create a system-level optimization model with a manageable complexity. A detailed case study is presented to show the importance of concurrently optimizing the module parameters and the gait using our model to obtain the optimal performance for a given mission.}, isbn = {978-0-7918-4326-0}, doi = {10.1115/DETC2008-49972}, url = {http://link.aip.org/link/ASMECP/v2008/i43260/p913/s1\&Agg=doi}, author = {Hopkins,James K. and Spranklin,Brent W. and Gupta, Satyandra K.} } @article {13873, title = {TERp system description}, journal = {MetricsMATR workshop at AMTA}, year = {2008}, month = {2008///}, abstract = {This paper describes TER-Plus (TERp) the University of Maryland / BBN Technologies submission for the NIST Metric MATR 2008 workshop on automatic machine translation evaluation metrics. TERp is an extension of Translation Edit Rate (TER) that builds off of the success of TER as an evaluation metric and alignment tool while addressing several of its weaknesses through the use of paraphrases, morphological stemming, and synonyms, as well as edit costs that are optimized to correlate better with various types of human judgments.}, author = {Snover,M. and Madnani,N. and Dorr, Bonnie J and Schwartz,R.} } @conference {18867, title = {Towards Design and Fabrication of a Miniature MRI-Compatible Robot for Applications in Neurosurgery}, year = {2008}, month = {2008///}, pages = {747 - 754}, publisher = {ASME}, organization = {ASME}, abstract = {Brain tumors are among the most feared complications of cancer and they occur in 20{\textendash}40\% of adult cancer patients. Despite numerous advances in treatment, the prognosis for these patients is poor, with a median survival of 4{\textendash}8 months. The primary reasons for poor survival rate are the lack of good continuous imaging modality for intraoperative intracranial procedures and the inability to remove the complete tumor tissue due to its placement in the brain and the corresponding space constraints to reach it. Intraoperative magnetic resonance imaging (MRI) supplements the surgeon{\textquoteright}s visual and tactile senses in a way that no other imaging device can achieve resulting in less trauma to surrounding healthy brain tissue during surgery. To minimize the trauma to surrounding healthy brain tissue, it would be beneficial to operate through a narrow surgical corridor dissected by the neurosurgeon. Facilitating tumor removal by accessing regions outside the direct {\textquotedblleft}line-of-sight{\textquotedblright} of the neurosurgical corridor will require a highly dexterous, small cross section, and MRI-compatible robot. Developing such a robot is extremely challenging task. In this paper we report a preliminary design of 6-DOF robot for possible application in neurosurgery. The robot actuators and body parts are constructed from MRI compatible materials. The current prototype is 0.36{\textquotedblright} in diameter and weighs only 0.0289 N (2.95 grams). The device was actuated using Flexinol{\textregistered} which is a shape memory alloy manufactured by Dynalloy, Inc. The end-effector forces ranged from 12 mN to 50 mN depending on the robot configuration. The end-effector force to robot weight ratio varied from 0.41 to 1.73. During trials the robot motion was repeatable and the range of motion of the robot was about 90 degrees for the end-effector when one side shape memory alloy (SMA) channel was actuated. The actuation time from the start to finish was about 2.5 s.}, isbn = {978-0-7918-4326-0}, doi = {10.1115/DETC2008-49587}, url = {http://link.aip.org/link/ASMECP/v2008/i43260/p747/s1\&Agg=doi}, author = {Pappafotis,Nicholas and Bejgerowski,Wojciech and Gullapalli,Rao and Simard,J. Marc and Gupta, Satyandra K. and Desai,Jaydev P.} } @article {12243, title = {Trade-offs in matching jobs and balancing load for distributed desktop grids}, journal = {Future Generation Computer Systems}, volume = {24}, year = {2008}, month = {2008/05//}, pages = {415 - 424}, abstract = {Desktop grids~can achieve tremendous computing power at low cost through opportunistic sharing of resources. However, traditional client{\textendash}server Grid architectures do not deal with all types of failures, and do not always cope well with very dynamic environments. This paper describes the design of a desktop grid implemented over a modified Peer-to-Peer (P2P) architecture. The underlying P2P system is decentralized and inherently adaptable, giving the Grid robustness, scalability, and the ability to cope with dynamic environments, while still efficiently mapping application instances to available resources throughout the system.We use simulation to compare three different types of matching algorithms under differing workloads. Overall, the P2P approach produces significantly lower wait times than prior approaches, while adapting efficiently to the dynamic environment. }, keywords = {Desktop grid, load balancing, Matchmaking, peer-to-peer computing, Resource discovery}, isbn = {0167-739X}, doi = {10.1016/j.future.2007.07.007}, url = {http://www.sciencedirect.com/science/article/pii/S0167739X07001240}, author = {Kim,Jik-Soo and Nam,Beomseok and Keleher,Peter and Marsh,Michael and Bhattacharjee, Bobby and Sussman, Alan} } @article {12912, title = {Transesterification activity of a novel lipase from Acinetobacter venetianus RAG-1}, journal = {Antonie van Leeuwenhoek}, volume = {94}, year = {2008}, month = {2008///}, pages = {621 - 625}, abstract = {Transesterification activity and the industrial potential of a novel lipase prepared from Acinetobacter ventiatus RAG-1 were evaluated. Purified lipase samples were dialyzed against pH 9.0 buffer in a single optimization step prior to lyophilization. The enzyme and organic phase were pre-equilibrated (separately) to the same thermodynamic water activities (a w) ranging from a w 0.33 to 0.97. Production of 1-octyl butyrate by lipase-catalyzed transesterification of vinyl butyrate with 1-octanol in hexane was monitored by gas chromatography. Production of 1-octyl butyrate and initial rate of reaction depended on water activity. Product synthesis and rate of transesterification increased sharply with increase from a w 0.33 to 0.55. Highest product concentration (218 mM) and rate of reaction (18.7 μmol h-1 {\textperiodcentered} 10 μg protein) were measured at a w 0.86. Transesterification activity in hexane represented 32\% of comparable hydrolytic activity in aqueous buffer.}, doi = {10.1007/s10482-008-9276-5}, author = {Snellman,E. A. and Rita R Colwell} } @article {14591, title = {A Tutorial of the Poisson Random Field Model in Population Genetics}, journal = {Advances in Bioinformatics}, volume = {2008}, year = {2008}, month = {2008///}, pages = {1 - 9}, abstract = {Population genetics is the study of allele frequency changes driven by various evolutionary forces such as mutation, natural selection, and random genetic drift. Although natural selection is widely recognized as a bona-fide phenomenon, the extent to which it drives evolution continues to remain unclear and controversial. Various qualitative techniques, or so-called {\textquotedblleft}tests of neutrality{\textquotedblright}, have been introduced to detect signatures of natural selection. A decade and a half ago, Stanley Sawyer and Daniel Hartl provided a mathematical framework, referred to as the Poisson random field (PRF), with which to determine quantitatively the intensity of selection on a particular gene or genomic region. The recent availability of large-scale genetic polymorphism data has sparked widespread interest in genome-wide investigations of natural selection. To that end, the original PRF model is of particular interest for geneticists and evolutionary genomicists. In this article, we will provide a tutorial of the mathematical derivation of the original Sawyer and Hartl PRF model.}, isbn = {1687-8027, 1687-8035}, doi = {10.1155/2008/257864}, url = {http://www.hindawi.com/journals/abi/2008/257864/}, author = {Sethupathy,Praveen and Hannenhalli, Sridhar} } @article {18448, title = {Understanding the High-Performance-Computing Community: A Software Engineer{\textquoteright}s Perspective}, journal = {Software, IEEE}, volume = {25}, year = {2008}, month = {2008/08//july}, pages = {29 - 36}, abstract = {Computational scientists developing software for HPC systems face unique software engineering issues. Attempts to transfer SE technologies to this domain must take these issues into account.}, keywords = {community;software, computational, engineering;, engineering;software, Science, software;high-performance-computing}, isbn = {0740-7459}, doi = {10.1109/MS.2008.103}, author = {Basili, Victor R. and Carver, J. C and Cruzes, D. and Hochstein, L. M and Hollingsworth, Jeffrey K and Shull, F. and Zelkowitz, Marvin V} } @article {12242, title = {A Unified Framework for Multipath Routing for Unicast and Multicast Traffic}, journal = {Networking, IEEE/ACM Transactions on}, volume = {16}, year = {2008}, month = {2008/10//}, pages = {1038 - 1051}, abstract = {We study the problem of load balancing the traffic from a set of unicast and multicast sessions. The problem is formulated as an optimization problem. However, we assume that the gradient of the network cost function is not available and needs to be estimated. Multiple paths are provided between a source and a destination using application-layer overlay. We propose a novel algorithm that is based on what is known as simultaneous perturbation stochastic approximation and utilizes only noisy measurements collected and reported to the sources, using an overlay architecture. We consider three network models that reflect different sets of assumptions regarding multicast capabilities of the network. Using an analytical model we first prove the almost sure convergence of the algorithm to a corresponding optimal solution under each network model considered in this paper with decreasing step sizes. Then, we establish the weak convergence (or convergence in distribution) with a fixed step size. In addition, we investigate the benefits acquired from implementing additional multicast capabilities by studying the relative performance of our algorithm under the three network models.}, keywords = {application-layer, approximation;unicast, balancing;multicast, channels;stochastic, communication;multipath, cost, function;optimization, network, overlay;load, perturbation, problem;simultaneous, processes;telecommunication, routing;network, routing;telecommunication, Stochastic, traffic;, traffic;multicast, traffic;multipath}, isbn = {1063-6692}, doi = {10.1109/TNET.2007.909686}, author = {Guven,T. and La,R.J. and Shayman,M.A. and Bhattacharjee, Bobby} } @conference {18682, title = {On the Use of Security Metrics Based on Intrusion Prevention System Event Data: An Empirical Analysis}, year = {2008}, month = {2008/12//}, pages = {49 - 58}, abstract = {With the increasing number of attacks on the Internet, a primary concern for organizations is the protection of their network. To do so, organizations install security devices such as intrusion prevention systems to monitor network traffic. However, data that are collected by these devices are often imperfect. The contribution of this paper is to try to define some practical metrics based on imperfect data collected by an intrusion prevention system. Since attacks greatly differ, we propose to group the attacks into several attack type groups. We then define a set of metrics for each attack type group. We introduce an approach that consists in analyzing the evolution of these metrics per attack type group by focusing on outliers in order to give an insight into an organizationpsilas security. The method is assessed for an organization of about 40,000 computers. The results were encouraging: outliers could be related to security issues that, in some cases, had not been previously flagged.}, keywords = {empirical analysis, Internet, Internet attack group, intrusion prevention system event data, network traffic monitoring, organization security metrics, security of data}, doi = {10.1109/HASE.2008.52}, author = {Chrun,D. and Michel Cukier and Sneeringer,G.} } @article {17475, title = {Users can change their web search tactics: Design guidelines for categorized overviews}, journal = {Information Processing \& Management}, volume = {44}, year = {2008}, month = {2008/03//}, pages = {463 - 484}, abstract = {Categorized overviews of web search results are a promising way to support user exploration, understanding, and discovery. These search interfaces combine a metadata-based overview with the list of search results to enable a rich form of interaction. A study of 24 sophisticated users carrying out complex tasks suggests how searchers may adapt their search tactics when using categorized overviews. This mixed methods study evaluated categorized overviews of web search results organized into thematic, geographic, and government categories. Participants conducted four exploratory searches during a 2-hour session to generate ideas for newspaper articles about specified topics such as {\textquotedblleft}human smuggling.{\textquotedblright} Results showed that subjects explored deeper while feeling more organized, and that the categorized overview helped subjects better assess their results, although no significant differences were detected in the quality of the article ideas. A qualitative analysis of searcher comments identified seven tactics that participants reported adopting when using categorized overviews. This paper concludes by proposing a set of guidelines for the design of exploratory search interfaces. An understanding of the impact of categorized overviews on search tactics will be useful to web search researchers, search interface designers, information architects and web developers.}, keywords = {categorization, Categorized overviews, Categorized search results, Exploratory search, Human-computer interaction, information seeking, Search result visualization, Search user interfaces, Web search}, isbn = {0306-4573}, doi = {10.1016/j.ipm.2007.07.014}, url = {http://www.sciencedirect.com/science/article/pii/S0306457307001574}, author = {Kules,Bill and Shneiderman, Ben} } @article {14434, title = {Variational Bayes via Propositionalization}, journal = {Probabilistic, Logical and Relational Learning-A Further Synthesis}, year = {2008}, month = {2008///}, author = {Sato,T. and Kameya,Y. and Kurihara,K. and De Raedt,L. and Dietterich,T. and Getoor, Lise and Kersting,K. and Muggleton,S. H} } @conference {16064, title = {VAST 2008 Challenge: Introducing mini-challenges}, booktitle = {Visual Analytics Science and Technology, 2008. VAST {\textquoteright}08. IEEE Symposium on}, year = {2008}, month = {2008/10//}, pages = {195 - 196}, abstract = {Visual analytics experts realize that one effective way to push the field forward and to develop metrics for measuring the performance of various visual analytics components is to hold an annual competition. The VAST 2008 Challenge is the third year that such a competition was held in conjunction with the IEEE Visual Analytics Science and Technology (VAST) symposium. The authors restructured the contest format used in 2006 and 2007 to reduce the barriers to participation and offered four mini-challenges and a Grand Challenge. Mini Challenge participants were to use visual analytic tools to explore one of four heterogeneous data collections to analyze specific activities of a fictitious, controversial movement. Questions asked in the Grand Challenge required the participants to synthesize data from all four data sets. In this paper we give a brief overview of the data sets, the tasks, the participation, the judging, and the results.}, keywords = {2008, analytics;data, Challenge;heterogeneous, collections;visual, data, VAST, visualisation;}, doi = {10.1109/VAST.2008.4677383}, author = {Grinstein,G. and Plaisant, Catherine and Laskowski,S. and O{\textquoteright}Connell,T. and Scholtz,J. and Whiting,M.} } @article {14754, title = {Verified enforcement of automaton-based information release policies}, journal = {Proceedings of the 2008 Workshop on Programming Languages and Analysis for Security. ACM Press}, year = {2008}, month = {2008///}, abstract = {Many organizations specify information release policies to describe the terms under which sensitive information may bereleased to other organizations. This paper presents a new approach for ensuring that security-critical software correctly enforces its information release policy. Our approach has two parts. First, an information release policy is specified as a security automaton written in a new language called AIR. Second, we enforce an AIR policy by translating it into an API for programs written in λAIR, a core formalism for a functional programming language. λAIR uses a novel combination of dependent, affine, and singleton types to ensure that the API is used correctly. As a consequence we can certify that programs written in λAIR meet the requirements of the original AIR policy specification. }, author = {Swamy,N. and Hicks, Michael W.} } @article {12909, title = {Vibrio cholerae non-O1, non-O139 strains isolated before 1992 from Varanasi, India are multiple drug resistant, contain intSXT, dfr18 and aadA5 genes}, journal = {Environmental Microbiology}, volume = {10}, year = {2008}, month = {2008/04/01/}, pages = {866 - 873}, abstract = {In this study, we report the presence of the SXT element and Class I integron in Vibrio cholerae non-O1, non-O139 strains isolated from Varanasi, India. Isolates were resistant to cotrimoxazole, trimethoprim and/or streptomycin, furazolidone and ampicillin. None contained plasmids. Polymerase chain reaction (PCR) and DNA sequencing revealed the presence of antibiotic resistance gene cassettes, aadA1, aadA2, aadA5 and dfrA15, in the Class I integron and SXT, an integrative conjugative element containing dfr18, sulII and strAB, in three and six of the isolates respectively. Conjugation experiments, followed by PCR analysis of transconjugants, provided evidence for the transferable nature of intSXT and associated antibiotic resistance gene cassettes. This is the first report of the occurrence of SXT ICE, dfr18, sulII, strAB and aadA5 genes in environmental V.~cholerae non-O1, non-O139 strains from Varanasi, India, that had been isolated before 1992.}, isbn = {1462-2920}, doi = {10.1111/j.1462-2920.2007.01502.x}, url = {http://onlinelibrary.wiley.com/doi/10.1111/j.1462-2920.2007.01502.x/abstract?userIsAuthenticated=false\&deniedAccessCustomisedMessage=}, author = {Mohapatra,Harapriya and Mohapatra,Saswat S. and Mantri,Chinmay K. and Rita R Colwell and Singh,Durg V.} } @inbook {16072, title = {Visualizing Functional Data with an Application to eBay{\textquoteright}s Online Auctions}, booktitle = {Handbook of Data VisualizationHandbook of Data Visualization}, series = {Springer Handbooks of Computational Statistics}, year = {2008}, month = {2008///}, pages = {873 - 898}, publisher = {Springer Berlin Heidelberg}, organization = {Springer Berlin Heidelberg}, abstract = {Technological advances in the measurement, collection, and storage of data have led tomore andmore complex data structures. Examples of such structures include measurements of the behavior of individuals over time, digitized two- or three-dimensional images of the brain, and recordings of three- or even four-dimensional movements of objects traveling through space and time. Such data, although recorded in a discrete fashion, are usually thought of as continuous objects that are represented by functional relationships. This gave rise to functional data analysis (FDA), which was made popular by the monographs of Ramsay and Silverman (1997, 2002), where the center of interest is a set of curves, shapes, objects, or, more generally, a set of functional observations , in contrast to classical statistics where interest centers on a set of data vectors. In that sense, functional data is not only different from the data structure studied in classical statistics, but it actually generalizes it. Many of these new data structures require new statistical methods to unveil the information that they carry.}, isbn = {978-3-540-33037-0}, url = {http://dx.doi.org/10.1007/978-3-540-33037-0_34}, author = {Chen,Chun-houh and H{\"a}rdle,Wolfgang and Unwin,Antony and Jank,Wolfgang and Shmueli,Galit and Plaisant, Catherine and Shneiderman, Ben} } @article {15272, title = {What are decision trees?}, journal = {Nature biotechnology}, volume = {26}, year = {2008}, month = {2008///}, pages = {1011 - 1011}, author = {Kingsford, Carl and Salzberg,S. L} } @article {19616, title = {Worst case examples of an exterior point algorithm for the assignment problem}, journal = {Discrete Optimization}, volume = {5}, year = {2008}, month = {2008/08//}, pages = {605 - 614}, abstract = {An efficient exterior point simplex type algorithm for the assignment problem has been developed by Paparrizos~[K. Paparrizos, An infeasible (exterior point) simplex algorithm for assignment problems, Math. Program. 51 (1991) 45{\textendash}54]. This algorithm belongs to the category of forest algorithms and solves an n {\texttimes} n assignment problem in at most n ( n - 1 ) 2 iterations and in at most O ( n 3 ) time. In this paper worst case examples are presented. Specifically, a systematic procedure to construct worst case assignment problems is presented for the exterior point algorithm. The algorithm applied to these examples executes exactly n ( n - 1 ) 2 iterations. This result verifies that the bound O ( n 3 ) is the best possible for the above-mentioned algorithm.}, keywords = {Assignment problem, Exterior point algorithm, Worst case examples}, isbn = {1572-5286}, url = {http://www.sciencedirect.com/science/article/pii/S1572528608000030}, author = {Charalampos Papamanthou and Paparrizos, Konstantinos and Samaras, Nikolaos and Stergiou, Konstantinos} } @article {16917, title = {25 years of CHI conferences: capturing the exchange of ideas}, journal = {Magazine interactions - 25 years of CHI conferences: a photographic essay}, volume = {14}, year = {2007}, month = {2007/03//}, pages = {24 - 31}, isbn = {1072-5520}, doi = {10.1145/1229863.1229865}, url = {http://doi.acm.org/10.1145/1229863.1229865}, author = {Shneiderman, Ben} } @article {16918, title = {911. gov}, journal = {Science(Washington)}, volume = {315}, year = {2007}, month = {2007///}, pages = {944 - 944}, author = {Shneiderman, Ben and Preece,J.} } @conference {12263, title = {Accountability as a service}, booktitle = {Proceedings of the 3rd USENIX workshop on Steps to reducing unwanted traffic on the internet}, series = {SRUTI{\textquoteright}07}, year = {2007}, month = {2007///}, pages = {5:1{\textendash}5:6 - 5:1{\textendash}5:6}, publisher = {USENIX Association}, organization = {USENIX Association}, address = {Berkeley, CA, USA}, abstract = {We propose that accountability be a first-class network service, independent of addressing and routing. We design a scheme for allowing accountability services, rather than connectivity-providing ISPs, to vouch for traffic, allowing victims to report abuse, filter abusive traffic, and isolate malicious senders. We discuss how accountability services may evolve, how they may facilitate new applications, and the implications of shifting the burden of network policing to a dedicated service.}, url = {http://dl.acm.org/citation.cfm?id=1361436.1361441}, author = {Bender,Adam and Spring, Neil and Levin,Dave and Bhattacharjee, Bobby} } @article {14937, title = {ACE: A Novel Software Platform to Ensure the Integrity of Long Term Archives}, volume = {UMIACS-TR-2007-07}, year = {2007}, month = {2007/01/31/}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {We develop a new methodology to address the integrity of long term archives using rigorous cryptographic techniques. A prototype system called ACE (Auditing Control Environment) was designed and developed based on this methodology. ACE creates a small-size integrity token for each digital object and some cryptographic summary information based on all the objects handled within a dynamic time period. ACE continuously audits the contents of the various objects according to the policy set by the archive, and provides mechanisms for an independent third-party auditor to certify the integrity of any object. In fact, our approach will allow an independent auditor to verify the integrity of every version of an archived digital object as well as link the current version to the original form of the object when it was ingested into the archive. We show that ACE is very cost effective and scalable while making no assumptions about the archive architecture. We include in this paper some preliminary results on the validation and performance of ACE on a large image collection.}, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/4047}, author = {Song,Sangchul and JaJa, Joseph F.} } @article {17870, title = {Active semantic caching to optimize multidimensional data analysis in parallel and distributed environments}, journal = {Parallel Computing}, volume = {33}, year = {2007}, month = {2007/08//}, pages = {497 - 520}, abstract = {In this paper, we present a multi-query optimization framework based on the concept of active semantic caching. The framework permits the identification and transparent reuse of data and computation in the presence of multiple queries (or query batches) that specify user-defined operators and aggregations originating from scientific data-analysis applications. We show how query scheduling techniques, coupled with intelligent cache replacement policies, can further improve the performance of query processing by leveraging the active semantic caching operators. We also propose a methodology for functionally decomposing complex queries in terms of primitives so that multiple reuse sites are exposed to the query optimizer, to increase the amount of reuse. The optimization framework and the database system implemented with it are designed to be efficient irrespective of the underlying parallel and/or distributed machine configuration. We present experimental results highlighting the performance improvements obtained by our methods using real scientific data-analysis applications on multiple parallel and distributed processing configurations (e.g., single symmetric multiprocessor (SMP) machine, cluster of SMP nodes, and a Grid computing configuration).}, keywords = {Active semantic caching, Parallel databases, Query optimization, Scientific data analysis}, isbn = {0167-8191}, doi = {10.1016/j.parco.2007.03.001}, url = {http://www.sciencedirect.com/science/article/pii/S0167819107000506}, author = {Andrade,Henrique and Kurc,Tahsin and Sussman, Alan and Saltz,Joel} } @inbook {17770, title = {Aggregates in Generalized Temporally Indeterminate Databases}, booktitle = {Scalable Uncertainty ManagementScalable Uncertainty Management}, series = {Lecture Notes in Computer Science}, volume = {4772}, year = {2007}, month = {2007///}, pages = {171 - 186}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {Dyreson and Snodgrass as well as Dekhtyar et. al. have provided a probabilistic model (as well as compelling example applications) for why there may be temporal indeterminacy in databases. In this paper, we first propose a formal model for aggregate computation in such databases when there is uncertainty not just in the temporal attribute, but also in the ordinary (non-temporal) attributes. We identify two types of aggregates: event correlated aggregates, and non event correlated aggregations, and provide efficient algorithms for both of them. We prove that our algorithms are correct, and we present experimental results showing that the algorithms work well in practice.}, keywords = {Computer, Science}, isbn = {978-3-540-75407-7}, url = {http://dx.doi.org/10.1007/978-3-540-75410-7_13}, author = {Udrea,Octavian and Majki{\'c},Zoran and Subrahmanian,V.}, editor = {Prade,Henri and Subrahmanian,V.} } @conference {18165, title = {Analysis of Nonlinear Collusion Attacks on Fingerprinting Systems for Compressed Multimedia}, booktitle = {Image Processing, 2007. ICIP 2007. IEEE International Conference on}, volume = {2}, year = {2007}, month = {2007/10/16/19}, pages = {II -133 -II -136 - II -133 -II -136}, abstract = {In this paper, we analyze the effect of various collusion attacks on fingerprinting systems for compressed multimedia. We evaluate the effectiveness of the collusion attacks in terms of the probability of detection and accuracy in estimating the host signal. Our analysis shows that applying averaging collusion on copies of moderately compressed content gives a highly accurate estimation of the host, and can effectively remove the embedded fingerprints. Averaging is thus the best choice for an attacker as the probability of detection and the distortion introduced are the lowest.}, keywords = {attacks;data, coding;multimedia, coding;security, collusion, compressed, compression;image, data;watermarking;, fingerprinting, multimedia;data, of, systems;nonlinear}, doi = {10.1109/ICIP.2007.4379110}, author = {Varna,A.L. and He,Shan and Swaminathan,A. and M. Wu} } @article {17690, title = {Analysis of the Residual Arnoldi Method}, volume = {UMIACS-TR-2007-45}, year = {2007}, month = {2007/10/15/}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {The Arnoldi method generates a nested squences of orthonormal bases$U_{1},U_{2}, \ldots$ by orthonormalizing $Au_{k}$ against $U_{k}$. Frequently these bases contain increasingly accurate approximations of eigenparis from the periphery of the spectrum of $A$. However, the convergence of these approximations stagnates if $u_{k}$ is contaminated by error. It has been observed that if one chooses a Rayleigh--Ritz approximation $(\mu_{k}, z_{k})$ to a chosen target eigenpair $(\lambda, x)$ and orthonormalizes the residual $Az_{k - }\mu_{k} z_{k}$, the approximations to $x$ (but not the other eigenvectors) continue to converge, even when the residual is contaminated by error. The same is true of the shift-invert variant of Arnoldi{\textquoteright}s method. In this paper we give a mathematical analysis of these new methods. }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/7428}, author = {Lee,Che-Rung and Stewart, G.W.} } @article {14663, title = {Appendix to CMod: Modular Information Hiding and Type-Safe Linking for C}, journal = {Technical Reports of the Computer Science Department}, year = {2007}, month = {2007/06/30/undef}, abstract = {This brief note is an appendix to the paper "CMod: Modular Information Hiding and Type-Safe Linking for C." It consists of the proof of soundness for the formal language presented in that paper.}, author = {Srivastava,S. and Hicks, Michael W. and Foster, Jeffrey S.} } @conference {17562, title = {Approximation algorithms for stochastic and risk-averse optimization}, booktitle = {Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms}, series = {SODA {\textquoteright}07}, year = {2007}, month = {2007///}, pages = {1305 - 1313}, publisher = {Society for Industrial and Applied Mathematics}, organization = {Society for Industrial and Applied Mathematics}, address = {Philadelphia, PA, USA}, abstract = {We present improved approximation algorithms in stochastic optimization. We prove that the multi-stage stochastic versions of covering integer programs (such as set cover and vertex cover) admit essentially the same approximation algorithms as their standard (non-stochastic) counterparts; this improves upon work of Swamy \& Shmoys that shows an approximability which depends multiplicatively on the number of stages. We also present approximation algorithms for facility location and some of its variants in the 2-stage recourse model, improving on previous approximation guarantees.}, isbn = {978-0-898716-24-5}, url = {http://dl.acm.org/citation.cfm?id=1283383.1283523}, author = {Srinivasan, Aravind} } @article {16862, title = {Autonomic computing}, journal = {IEEE internet computing}, volume = {11}, year = {2007}, month = {2007///}, pages = {52 - 59}, author = {Brabec,F. and Samet, Hanan} } @article {16076, title = {BELIV{\textquoteright}06: beyond time and errors: novel evaluation methods for information visualization}, journal = {interactions}, volume = {14}, year = {2007}, month = {2007/05//}, pages = {59 - 60}, isbn = {1072-5520}, doi = {10.1145/1242421.1242460}, url = {http://doi.acm.org/10.1145/1242421.1242460}, author = {Bertini,Enrico and Plaisant, Catherine and Santucci,Giuseppe} } @conference {13146, title = {Bilattice-based Logical Reasoning for Human Detection}, booktitle = {Computer Vision and Pattern Recognition, 2007. CVPR {\textquoteright}07. IEEE Conference on}, year = {2007}, month = {2007/06//}, pages = {1 - 8}, abstract = {The capacity to robustly detect humans in video is a critical component of automated visual surveillance systems. This paper describes a bilattice based logical reasoning approach that exploits contextual information and knowledge about interactions between humans, and augments it with the output of different low level detectors for human detection. Detections from low level parts-based detectors are treated as logical facts and used to reason explicitly about the presence or absence of humans in the scene. Positive and negative information from different sources, as well as uncertainties from detections and logical rules, are integrated within the bilattice framework. This approach also generates proofs or justifications for each hypothesis it proposes. These justifications (or lack thereof) are further employed by the system to explain and validate, or reject potential hypotheses. This allows the system to explicitly reason about complex interactions between humans and handle occlusions. These proofs are also available to the end user as an explanation of why the system thinks a particular hypothesis is actually a human. We employ a boosted cascade of gradient histograms based detector to detect individual body parts. We have applied this framework to analyze the presence of humans in static images from different datasets.}, keywords = {automated, detection;parts-based, detectors;static, histograms;human, images;formal, interactions;gradient, logic;image, logical, mechanisms;surveillance;video, processing;, reasoning;complex, recognition;inference, signal, Surveillance, systems;bilattice-based, visual}, doi = {10.1109/CVPR.2007.383133}, author = {Shet,V. D and Neumann, J. and Ramesh,V. and Davis, Larry S.} } @article {16439, title = {BIPASS: BioInformatics Pipeline Alternative Splicing Services}, journal = {Nucleic Acids Research}, volume = {35}, year = {2007}, month = {2007///}, pages = {W292 - W292}, author = {Legendre,C. and Raschid, Louiqa and Snyder,B.} } @article {18497, title = {Bitstore: An incentive-compatible solution for blocked downloads in bittorrent}, journal = {Proc. Joint Workshop on The Economics of Networked Systems and Incentive-Based Computing (NetEcon)}, year = {2007}, month = {2007///}, abstract = {As many as 30\% of all files shared on public BitTorrentnetworks suffer from the lack of {\textquotedblleft}seeders{\textquotedblright} (peers that have complete copies of the file being shared); peers attempting to download such a file ({\textquotedblleft}leechers{\textquotedblright}) may have to wait indef- initely to obtain certain file chunks that are not distributed in the file{\textquoteright}s network of peers (the {\textquotedblleft}swarm{\textquotedblright}). We call this the Blocked Leecher Problem (BLP). To alleviate BLP, we propose BitStore, a larger, secure network of BitTorrent users (not necessarily all sharing the same content) where nodes offer their resources (such as disk space and bandwidth) for public use. Peers sharing any file can use the storage network to maintain replicas for each chunk of the file. Any leecher seeking chunks that are absent from in its own swarm can query the public network, locate the node storing the said chunks, and retrieve them. BitStore also provides robust incentives for nodes contributing re- sources: In return for storing and serving chunks, such nodes can negotiate micropayments using a second-price auction. Peers who receive these credits may later use them to re- trieve blocks they need from the storage network. This paper quantifies the BLP, presents an overview of the BitStore design, and discusses various challenges related to storage management and incentives. }, author = {Ramachandran,A. and Sarma,A.D. and Feamster, Nick} } @article {12257, title = {Boycotting and extorting nodes in an internetwork}, journal = {NetE-con+ IBC}, year = {2007}, month = {2007///}, author = {Levin,D. and Bender,A. and Lumezanu,C. and Spring, Neil and Bhattacharjee, Bobby} } @conference {12921, title = {Bridging art and science with creativity support tools}, booktitle = {Proceedings of the 6th ACM SIGCHI conference on Creativity \& cognition}, series = {C\&C {\textquoteright}07}, year = {2007}, month = {2007///}, pages = {309 - 309}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, isbn = {978-1-59593-712-4}, doi = {10.1145/1254960.1255044}, url = {http://doi.acm.org/10.1145/1254960.1255044}, author = {Shneiderman, Ben and Rita R Colwell and Diamond,Sara and Greenhalgh,Paul and Wulf,William} } @inbook {15722, title = {Bridging the ROUGE/Human Evaluation Gap in Multi-Document Summarization}, booktitle = {Document Understanding Conference DUC 2007Document Understanding Conference DUC 2007}, year = {2007}, month = {2007/04/26/}, publisher = {HLT-NAACL}, organization = {HLT-NAACL}, address = {Rochester, NY}, author = {Conroy,John M. and Schlesinger,Judith D. and O{\textquoteright}Leary, Dianne P.} } @article {16998, title = {Browsing large online data tables using generalized query previews}, journal = {Information Systems}, volume = {32}, year = {2007}, month = {2007/05//}, pages = {402 - 423}, abstract = {Companies, government agencies, and other organizations are making their data available to the world over the Internet. They often use large online relational tables for this purpose. Users query such tables with front-ends that typically use menus or form fillin interfaces, but these interfaces rarely give users information about the contents and distribution of the data. Such a situation leads users to waste time and network/server resources posing queries that have zero- or mega-hit results. Generalized query previews enable efficient browsing of large online data tables by supplying data distribution information to users. The data distribution information provides continuous feedback about the size of the result set as the query is being formed. Our paper presents a new user interface architecture and discusses three controlled experiments (with 12, 16, and 48 participants). Our prototype systems provide flexible user interfaces for research and testing of the ideas. The user studies show that for exploratory querying tasks, generalized query previews can speed user performance for certain user domains and can reduce network/server load.}, keywords = {Information Visualization, Internet, Online querying, World-wide web}, isbn = {0306-4379}, doi = {10.1016/j.is.2005.12.006}, url = {http://www.sciencedirect.com/science/article/pii/S0306437905001213}, author = {Tanin,Egemen and Shneiderman, Ben and Xie,Hairuo} } @article {18507, title = {Building a Better Mousetrap}, volume = {GIT-CSS-07-01}, year = {2007}, month = {2007///}, institution = {Georgia Institute of Technology. College of Computing}, abstract = {Routers in the network core are unable to maintain detailed statistics for every packet; thus, traffic statistics are often based on packet sampling, which reduces accuracy. Because tracking large ("heavy-hitter") traffic flows is important both for pricing and for traffic engineering, much attention has focused on maintaining accurate statistics for such flows, often at the expense of small-volume flows. Eradicating these smaller flows makes it difficult to observe communication structure, which is sometimes more important than maintaining statistics about flow sizes. This paper presents FlexSample, a sampling framework that allows network operators to get the best of both worlds: For a fixed sampling budget, FlexSample can capture significantly more small-volume flows for only a small increase in relative error of large traffic flows. FlexSample uses a fast, lightweight counter array that provides a coarse estimate of the size ("class") of each traffic flow; a router then can sample at different rates according to the class of the traffic using any existing sampling strategy. Given a fixed sampling rate and a target fraction of sampled packets to allocate across traffic classes, FlexSample computes packet sampling rates for each class that achieve these allocations online. Through analysis and trace-based experiments, we find that FlexSample captures at least 50\% more mouse flows than strategies that do not perform class-dependent packet sampling. We also show how FlexSample can be used to capture unique flows for specific applications.}, url = {http://hdl.handle.net/1853/14350}, author = {Ramachandran,A. and Seetharaman,S. and Feamster, Nick and Vazirani,V.} } @article {12215, title = {Capture, annotate, browse, find, share: novel interfaces for personal photo management}, journal = {International Journal of Human-] Computer Interaction}, volume = {23}, year = {2007}, month = {2007///}, pages = {315 - 337}, author = {Kang,H. and Bederson, Benjamin B. and Suh,B.} } @article {18897, title = {CARA: A Cultural-Reasoning Architecture}, journal = {IEEE Intelligent Systems}, volume = {22}, year = {2007}, month = {2007///}, pages = {12 - 16}, abstract = {The Cognitive Architecture for Reasoning about Adversaries supports methods to gather data about different cultural groups and learn the intensity of those groups{\textquoteright} opinions on various topics. It also lets users build and extract models of those groups{\textquoteright} behavior and continuously refine those models through shared multiperson learning experiences. Researchers have applied the architecture to develop cultural-reasoning applications for example, a game that teaches soldiers about cultural norms in an Afghan village.}, keywords = {cultural reasoning, opinion extraction, opponent modeling}, isbn = {1541-1672}, author = {V.S. Subrahmanian and Albanese,Massimiliano and Martinez,Mar?a Vanina and Nau, Dana S. and Reforgiato,Diego and Simari,Gerardo I. and Sliva,Amy and Udrea,Octavian and Wilkenfeld,Jonathan} } @article {14556, title = {Cell breathing in wireless LANs: Algorithms and evaluation}, journal = {IEEE Transactions on Mobile Computing}, volume = {6}, year = {2007}, month = {2007///}, pages = {164 - 178}, author = {Hajiaghayi, Mohammad T. and Mirrokni,S. V. and Saberi,A. and Bahl,P. and Jain,K. and Qiu,L.} } @article {16238, title = {Characterization of Ehp, a Secreted Complement Inhibitory Protein from Staphylococcus aureus}, journal = {Journal of Biological Chemistry}, volume = {282}, year = {2007}, month = {2007/10/12/}, pages = {30051 - 30061}, abstract = {We report here the discovery and characterization of Ehp, a new secreted Staphylococcus aureus protein that potently inhibits the alternative complement activation pathway. Ehp was identified through a genomic scan as an uncharacterized secreted protein from S. aureus, and immunoblotting of conditioned S. aureus culture medium revealed that the Ehp protein was secreted at the highest levels during log-phase bacterial growth. The mature Ehp polypeptide is composed of 80 residues and is 44\% identical to the complement inhibitory domain of S. aureus Efb (extracellular fibrinogen-binding protein). We observed preferential binding by Ehp to native and hydrolyzed C3 relative to fully active C3b and found that Ehp formed a subnanomolar affinity complex with these various forms of C3 by binding to its thioester-containing C3d domain. Site-directed mutagenesis demonstrated that Arg75 and Asn82 are important in forming the Ehp{\textperiodcentered}C3d complex, but loss of these side chains did not completely disrupt Ehp/C3d binding. This suggested the presence of a second C3d-binding site in Ehp, which was mapped to the proximity of Ehp Asn63. Further molecular level details of the Ehp/C3d interaction were revealed by solving the 2.7-{\r A} crystal structure of an Ehp{\textperiodcentered}C3d complex in which the low affinity site had been mutationally inactivated. Ehp potently inhibited C3b deposition onto sensitized surfaces by the alternative complement activation pathway. This inhibition was directly related to Ehp/C3d binding and was more potent than that seen for Efb-C. An altered conformation in Ehp-bound C3 was detected by monoclonal antibody C3-9, which is specific for a neoantigen exposed in activated forms of C3. Our results suggest that increased inhibitory potency of Ehp relative to Efb-C is derived from the second C3-binding site in this new protein.}, doi = {10.1074/jbc.M704247200}, url = {http://www.jbc.org/content/282/41/30051.abstract}, author = {Hammel,Michal and Sfyroera,Georgia and Pyrpassopoulos,Serapion and Ricklin,Daniel and Ramyar,Kasra X. and Pop, Mihai and Jin,Zhongmin and Lambris,John D. and Geisbrecht,Brian V.} } @article {12260, title = {Chit-based access control}, year = {2007}, month = {2007///}, institution = {Technical Report CS-TR-4878, University of Maryland at College Park}, author = {Keleher,P. J and Spring, Neil and Bhattacharjee, Bobby} } @conference {13147, title = {Classifying Computer Generated Charts}, booktitle = {Content-Based Multimedia Indexing, 2007. CBMI {\textquoteright}07. International Workshop on}, year = {2007}, month = {2007/06//}, pages = {85 - 92}, abstract = {We present an approach for classifying images of charts based on the shape and spatial relationships of their primitives. Five categories are considered: bar-charts, curve-plots, pie-charts, scatter-plots and surface-plots. We introduce two novel features to represent the structural information based on (a) region segmentation and (b) curve saliency. The local shape is characterized using the Histograms of Oriented Gradients (HOG) and the Scale Invariant Feature Transform (SIFT) descriptors. Each image is represented by sets of feature vectors of each modality. The similarity between two images is measured by the overlap in the distribution of the features -measured using the Pyramid Match algorithm. A test image is classified based on its similarity with training images from the categories. The approach is tested with a database of images collected from the Internet.}, keywords = {algorithm;scale, analysis;visual, classification;image, database;image, databases;, feature, Internet;bar-chart;curve-plot;image, invariant, match, matching;image, relationship;surface-plot;Internet;image, representation;image, segmentation;pie-chart;pyramid, segmentation;statistical, transform;scatter-plot;spatial}, doi = {10.1109/CBMI.2007.385396}, author = {Prasad,V. S.N and Siddiquie,B. and Golbeck,J. and Davis, Larry S.} } @article {16861, title = {Client-Based Spatial Browsing on the World Wide Web}, journal = {IEEE Internet Computing}, volume = {11}, year = {2007}, month = {2007///}, pages = {52 - 59}, abstract = {Being able to visualize both spatial and nonspatial data is becoming increasingly important to today{\textquoteright}s Internet users. Spatial data viewers and query tools can aid in visualization, but they should also let users access data instantly and with minimal effort. The authors explore new ways to allow visualization of data stored in a central server database on a simple client. They also consider usage scenarios in which transferring the whole database to the client for processing isn{\textquoteright}t feasible due to the amount of data on the server, insufficient computing power on the client, and a slow link between the two.}, keywords = {client-server spatial browsing, geographic information systems (GIS), Spatial databases, web access, web-based mapping}, isbn = {1089-7801}, author = {Brabec,Frantisek and Samet, Hanan} } @conference {18178, title = {Collusion-Resistant Fingerprinting for Compressed Multimedia Signals}, booktitle = {Acoustics, Speech and Signal Processing, 2007. ICASSP 2007. IEEE International Conference on}, volume = {2}, year = {2007}, month = {2007/04//}, pages = {II-165 -II-168 - II-165 -II-168}, abstract = {Most existing collusion-resistant fingerprinting techniques are for fingerprinting uncompressed signals. In this paper, we first study the performance of the traditional Gaussian based spread spectrum sequences for fingerprinting compressed signals and show that the system can be easily defeated by averaging or taking the median of a few copies. To overcome the collusion problem for compressed multimedia host signals, we propose a technique called anti-collusion dithering to mimic an uncompressed signal. Results show higher probability of catching a colluder using the proposed scheme compared to using Gaussian based fingerprints.}, keywords = {based, compression;Gaussian, compression;multimedia, dithering;collusion-resistant, fingerprinting;multimedia, Gaussian, processes;data, sequences;anticollusion, signals, spectrum, spread, systems;}, doi = {10.1109/ICASSP.2007.366198}, author = {Varna,A.L. and He,Shan and Swaminathan,A. and M. Wu and Lu,Haiming and Lu,Zengxiang} } @article {13740, title = {Combining outputs from multiple machine translation systems}, journal = {Human Language Technologies 2007: The Conference of the North American Chapter of the Association for Computational Linguistics; Proceedings of the Main Conference}, year = {2007}, month = {2007///}, pages = {228 - 235}, abstract = {Currently there are several approaches tomachine translation (MT) based on differ- ent paradigms; e.g., phrasal, hierarchical and syntax-based. These three approaches yield similar translation accuracy despite using fairly different levels of linguistic knowledge. The availability of such a variety of systems has led to a growing interest toward finding better translations by combining outputs from multiple sys- tems. This paper describes three differ- ent approaches to MT system combina- tion. These combination methods oper- ate on sentence, phrase and word level exploiting information from N -best lists, system scores and target-to-source phrase alignments. The word-level combination provides the most robust gains but the best results on the development test sets (NIST MT05 and the newsgroup portion of GALE 2006 dry-run) were achieved by combining all three methods. }, author = {Rosti,A.V.I. and Ayan,N.F. and Xiang,B. and Matsoukas,S. and Schwartz,R. and Dorr, Bonnie J} } @article {14666, title = {Combining provenance and security policies in a web-based document management system}, journal = {On-line Proceedings of the Workshop on Principles of Provenance (PrOPr)}, year = {2007}, month = {2007///}, author = {Corcoran,B.J. and Swamy,N. and Hicks, Michael W.} } @article {17023, title = {Community response grids: E-government, social networks, and effective emergency management}, journal = {Telecommunications Policy}, volume = {31}, year = {2007}, month = {2007/11//}, pages = {592 - 604}, abstract = {This paper explores the concept of developing community response grids (CRGs) for community emergency response and the policy implications of such a system. CRGs make use of the Internet and mobile communication devices, allowing residents and responders to share information, communicate, and coordinate activities in response to a major disaster. This paper explores the viability of using mobile communication technologies and the Web, including e-government, to develop response systems that would aid communities before, during, and after a major disaster, providing channels for contacting residents and responders, uploading information, distributing information, coordinating the responses of social networks, and facilitating resident-to-resident assistance. Drawing upon research from computer science, information studies, public policy, emergency management, and several other disciplines, the paper elaborates on the concept of and need for CRGs, examines related current efforts that can inform the development of CRGs, discusses how research about community networks can be used to instill trust and social capital in CRGs, and examines the issues of public policy, telecommunications, and e-government related to such a system.}, keywords = {Community response grid, E-government, Emergency response, Mobile communications, Public policy, social networks}, isbn = {0308-5961}, doi = {10.1016/j.telpol.2007.07.008}, url = {http://www.sciencedirect.com/science/article/pii/S0308596107000699}, author = {Jaeger,Paul T. and Shneiderman, Ben and Fleischmann,Kenneth R. and Preece,Jennifer and Qu,Yan and Fei Wu,Philip} } @article {17022, title = {Community response grids for older adults: Motivations, usability, and sociability}, journal = {Proceedings of the 13th Americas Conference on Information Systems}, year = {2007}, month = {2007///}, abstract = {This paper discusses the motivation for a Community Response Grid (CRG) to helpolder adults improve their capability for coping with emergency situations. We define and discuss the concept of a CRG, briefly review the limits of current emergency response systems, and identify usability and sociability guidelines for CRGs for older adults based on existing research. The paper ends with a call to action and suggestions for future research directions. }, author = {Wu,P.F. and Preece,J. and Shneiderman, Ben and Jaeger,P. T and Qu,Y.} } @article {17024, title = {Community Response Grids: Using Information Technology to Help Communities Respond to Bioterror Emergencies}, journal = {Biosecurity and Bioterrorism: Biodefense Strategy, Practice, and Science}, volume = {5}, year = {2007}, month = {2007/12//}, pages = {335 - 346}, abstract = {Access to accurate and trusted information is vital in preparing for, responding to, and recovering from an mergency. To facilitate response in large-scale emergency situations, Community Response Grids (CRGs) integrate Internet and mobile technologies to enable residents to report information, professional emergency responders to disseminate instructions, and residents to assist one another. CRGs use technology to help residents and professional emergency responders to work together in community response to emergencies, including bioterrorism events. In a time of increased danger from bioterrorist threats, the application of advanced information and communication technologies to community response is vital in confronting such threats. This article describes CRGs, their underlying concepts, development efforts, their relevance to biosecurity and bioterrorism, and future research issues in the use of technology to facilitate community response.}, isbn = {1538-7135, 1557-850X}, doi = {10.1089/bsp.2007.0034}, url = {http://www.liebertonline.com/doi/abs/10.1089/bsp.2007.0034}, author = {Jaeger,Paul T. and Fleischmann,Kenneth R. and Preece,Jennifer and Shneiderman, Ben and Fei Wu,Philip and Qu,Yan} } @conference {12351, title = {Compact, low power wireless sensor network system for line crossing recognition}, booktitle = {Circuits and Systems, 2007. ISCAS 2007. IEEE International Symposium on}, year = {2007}, month = {2007///}, pages = {2506 - 2509}, author = {Shen,C. C and Kupershtok,R. and Yang,B. and Vanin,F. M and Shao,X. and Sheth,D. and Goldsman,N. and Balzano,Q. and Bhattacharyya, Shuvra S.} } @conference {18150, title = {A Component Estimation Framework for Information Forensics}, booktitle = {Multimedia Signal Processing, 2007. MMSP 2007. IEEE 9th Workshop on}, year = {2007}, month = {2007/10//}, pages = {397 - 400}, abstract = {With a rapid growth of imaging technologies and an increasingly widespread usage of digital images and videos for a large number of high security and forensic applications, there is a strong need for techniques to verify the source and integrity of digital data. Component forensics is new approach for forensic analysis that aims to estimate the algorithms and parameters in each component of the digital device. In this paper, we develop a novel theoretical foundation to understand the fundamental performance limits of component forensics. We define formal notions of identifiability of components in the information processing chain, and present methods to quantify the accuracies at which the component parameters can be estimated. Building upon the proposed theoretical framework, we devise methods to improve the accuracies of component parameter estimation for a wide range of forensic applications.}, keywords = {component, data, data;, Estimation, estimation;image, forensics;parameter, framework;digital, integrity;imaging, of, processing;security, technologies;information}, doi = {10.1109/MMSP.2007.4412900}, author = {Swaminathan,A. and M. Wu and Liu,K. J.R} } @article {14600, title = {COMPUTATIONAL BIOLOGY}, journal = {Nucleic acids research}, volume = {35}, year = {2007}, month = {2007///}, pages = {3163 - 3163}, author = {Leparc,GG and Mitra,RD and Vardhanabhuti,S. and Wang,J. and Hannenhalli, Sridhar and Smit,S. and Widmann,J. and Knight,R. and Wu,S. and Zhang,Y. and others} } @article {18966, title = {A computational survey of candidate exonic splicing enhancer motifs in the model plant Arabidopsis thaliana}, journal = {BMC Bioinformatics}, volume = {8}, year = {2007}, month = {2007/05/21/}, pages = {159 - 159}, abstract = {Algorithmic approaches to splice site prediction have relied mainly on the consensus patterns found at the boundaries between protein coding and non-coding regions. However exonic splicing enhancers have been shown to enhance the utilization of nearby splice sites.}, isbn = {1471-2105}, doi = {10.1186/1471-2105-8-159}, url = {http://www.biomedcentral.com/1471-2105/8/159/abstract}, author = {Pertea,Mihaela and Mount, Stephen M. and Salzberg,Steven L.} } @article {18900, title = {Computing most probable worlds of action probabilistic logic programs: scalable estimation for 10^30,000 worlds}, journal = {Annals of Mathematics and Artificial Intelligence}, volume = {51}, year = {2007}, month = {2007///}, pages = {295 - 331}, abstract = {The semantics of probabilistic logic programs (PLPs) is usually given through a possible worlds semantics. We propose a variant of PLPs called action probabilistic logic programs or -programs that use a two-sorted alphabet to describe the conditions under which certain real-world entities take certain actions. In such applications, worlds correspond to sets of actions these entities might take. Thus, there is a need to find the most probable world (MPW) for -programs. In contrast, past work on PLPs has primarily focused on the problem of entailment. This paper quickly presents the syntax and semantics of -programs and then shows a naive algorithm to solve the MPW problem using the linear program formulation commonly used for PLPs. As such linear programs have an exponential number of variables, we present two important new algorithms, called and to solve the MPW problem exactly. Both these algorithms can significantly reduce the number of variables in the linear programs. Subsequently, we present a {\textquotedblleft}binary{\textquotedblright} algorithm that applies a binary search style heuristic in conjunction with the Naive, and algorithms to quickly find worlds that may not be {\textquotedblleft}most probable.{\textquotedblright} We experimentally evaluate these algorithms both for accuracy (how much worse is the solution found by these heuristics in comparison to the exact solution) and for scalability (how long does it take to compute). We show that the results of are very accurate and also very fast: more than 10 30,000 worlds can be handled in a few minutes. Subsequently, we develop parallel versions of these algorithms and show that they provide further speedups.}, keywords = {Computer science}, isbn = {1012-2443}, doi = {10.1007/s10472-008-9089-2}, url = {http://www.springerlink.com/content/t70g873h613273pu/abstract/}, author = {Khuller, Samir and Martinez,M. and Nau, Dana S. and Sliva,Amy and Simari,Gerardo and Subrahmanian,V.} } @article {15320, title = {Concept disambiguation for improved subject access using multiple knowledge sources}, journal = {Proceedings of the Workshop on Language Technology for Cultural Heritage Data (LaTeCH 2007)}, year = {2007}, month = {2007///}, pages = {25 - 25}, abstract = {We address the problem of mining text forrelevant image metadata. Our work is situ- ated in the art and architecture domain, where highly specialized technical vocabu- lary presents challenges for NLP tech- niques. To extract high quality metadata, the problem of word sense disambiguation must be addressed in order to avoid leading the searcher to the wrong image as a result of ambiguous{\textemdash}and thus faulty{\textemdash}meta- data. In this paper, we present a disam- biguation algorithm that attempts to select the correct sense of nouns in textual de- scriptions of art objects, with respect to a rich domain-specific thesaurus, the Art and Architecture Thesaurus (AAT). We per- formed a series of intrinsic evaluations us- ing a data set of 600 subject terms ex- tracted from an online National Gallery of Art (NGA) collection of images and text. Our results showed that the use of external knowledge sources shows an improvement over a baseline. }, author = {Sidhu,T. and Klavans,J. and Jimmy Lin} } @article {14327, title = {Conducting In Situ Evaluations for and With Ubiquitous Computing Technologies}, journal = {International Journal of Human-Computer Interaction}, volume = {22}, year = {2007}, month = {2007///}, pages = {103 - 118}, abstract = {Abstract To evaluate ubiquitous computing technologies, which may be embedded in the environment, embedded in objects, worn, or carried by the user throughout everyday life, it is essential to use methods that accommodate the often unpredictable, real-world environments in which the technologies are used. This article discusses how we have adapted and applied traditional methods from psychology and human-computer interaction, such as Wizard of Oz and Experience Sampling, to be more amenable to the in situ evaluations of ubiquitous computing applications, particularly in the early stages of design. The way that ubiquitous computing technologies can facilitate the in situ collection of self-report data is also discussed. Although the focus is on ubiquitous computing applications and tools for their assessment, it is believed that the in situ evaluation tools that are proposed will be generally useful for field trials of other technology, applications, or formative studies that are concerned with collecting data in situ.Abstract To evaluate ubiquitous computing technologies, which may be embedded in the environment, embedded in objects, worn, or carried by the user throughout everyday life, it is essential to use methods that accommodate the often unpredictable, real-world environments in which the technologies are used. This article discusses how we have adapted and applied traditional methods from psychology and human-computer interaction, such as Wizard of Oz and Experience Sampling, to be more amenable to the in situ evaluations of ubiquitous computing applications, particularly in the early stages of design. The way that ubiquitous computing technologies can facilitate the in situ collection of self-report data is also discussed. Although the focus is on ubiquitous computing applications and tools for their assessment, it is believed that the in situ evaluation tools that are proposed will be generally useful for field trials of other technology, applications, or formative studies that are concerned with collecting data in situ. }, isbn = {1044-7318}, doi = {10.1080/10447310709336957}, url = {http://www.tandfonline.com/doi/abs/10.1080/10447310709336957}, author = {Consolvo,Sunny and Harrison,Beverly and Smith,Ian and Chen,Mike Y. and Everitt,Katherine and Jon Froehlich and Landay,James A.} } @conference {15904, title = {Confidentiality-preserving rank-ordered search}, booktitle = {Proceedings of the 2007 ACM workshop on Storage security and survivability}, series = {StorageSS {\textquoteright}07}, year = {2007}, month = {2007///}, pages = {7 - 12}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {This paper introduces a new framework for confidentiality preserving rank-ordered search and retrieval over large document collections. The proposed framework not only protects document/query confidentiality against an outside intruder, but also prevents an untrusted data center from learning information about the query and the document collection. We present practical techniques for proper integration of relevance scoring methods and cryptographic techniques, such as order preserving encryption, to protect data collections and indices and provide efficient and accurate search capabilities to securely rank-order documents in response to a query. Experimental results on the W3C collection show that these techniques have comparable performance to conventional search systems designed for non-encrypted data in terms of search accuracy. The proposed methods thus form the first steps to bring together advanced information retrieval and secure search capabilities for a wide range of applications including managing data in government and business operations, enabling scholarly study of sensitive data, and facilitating the document discovery process in litigation.}, keywords = {encrypted domain search, Ranked retrieval, secure index}, isbn = {978-1-59593-891-6}, doi = {10.1145/1314313.1314316}, url = {http://doi.acm.org/10.1145/1314313.1314316}, author = {Swaminathan,Ashwin and Mao,Yinian and Su,Guan-Ming and Gou,Hongmei and Varna,Avinash L. and He,Shan and M. Wu and Oard, Douglas} } @conference {19633, title = {Configuration Reasoning and Ontology For Web}, booktitle = {IEEE International Conference on Services Computing, 2007. SCC 2007}, year = {2007}, month = {2007/07//}, pages = {387 - 394}, abstract = {Configuration plays a central role in the deployment and management of Web infrastructures and applications. A configuration often consists of assigning "values" to a pre-defined set of parameters defined in one or more files. Although the task of assigning values to (configuration) parameters looks simple, configuring infrastructures and applications is a very complex process. In this paper we present a framework for defining and analyzing configuration of an Apache server. We define the notion of "configuration space" of an Apache server as a set of possible values that can be assigned to configuration parameters. We then define the notion of an "obstacle" and "forbidden region" in the configuration space that should be avoided. We model configuration space using a logical framework based on OWL (Web ontology language). The obstacles and forbidden regions in the configuration space are modeled as constraints in the logical framework. These obstacles and forbidden regions are essentially "anti-patterns" that a typical installation should avoid. Given an instance of a configuration (that is, a "point" in the configuration space) we then check if the instance is "obstacle free" using logical reasoning.}, keywords = {Apache server, Application software, configuration management, configuration reasoning, configuration space, File servers, Information security, Internet, knowledge representation languages, logical framework, logical reasoning, ontologies, ontologies (artificial intelligence), Orbital robotics, OWL, path planning, Robot kinematics, Runtime environment, Taxonomy, Web infrastructures management, Web ontology language, Web server}, author = {Dana Dachman-Soled and Sreedhar, V.C.} } @article {17777, title = {CONVEX: Context vectors as a paradigm for learning group behaviors based on similarity}, journal = {IEEE Intelligent Systems}, volume = {23}, year = {2007}, month = {2007///}, pages = {51 - 57}, author = {Martinez,V. and Simari,G. I and Sliva,A. and V.S. Subrahmanian} } @conference {12252, title = {Creating a Robust Desktop Grid using Peer-to-Peer Services}, booktitle = {Parallel and Distributed Processing Symposium, 2007. IPDPS 2007. IEEE International}, year = {2007}, month = {2007/03//}, pages = {1 - 7}, abstract = {The goal of the work described in this paper is to design and build a scalable infrastructure for executing grid applications on a widely distributed set of resources. Such grid infrastructure must be decentralized, robust, highly available, and scalable, while efficiently mapping application instances to available resources in the system. However, current desktop grid computing platforms are typically based on a client-server architecture, which has inherent shortcomings with respect to robustness, reliability and scalability. Fortunately, these problems can be addressed through the capabilities promised by new techniques and approaches in peer-to-peer (P2P) systems. By employing P2P services, our system allows users to submit jobs to be run in the system and to run jobs submitted by other users on any resources available in the system, essentially allowing a group of users to form an ad-hoc set of shared resources. The initial target application areas for the desktop grid system are in astronomy and space science simulation and data analysis.}, keywords = {allocation;, architecture;load, balancing;peer-to-peer, client-server, computing;peer-to-peer, computing;resource, desktop, grid;scalable, infrastructure;client-server, system;robust, systems;grid}, doi = {10.1109/IPDPS.2007.370505}, author = {Kim,J.-S. and Nam,B. and Marsh,M. and Keleher,P. and Bhattacharjee, Bobby and Richardson,D. and Wellnitz,D. and Sussman, Alan} } @article {17041, title = {Creativity support tools: accelerating discovery and innovation}, journal = {Commun. ACM}, volume = {50}, year = {2007}, month = {2007/12//}, pages = {20 - 32}, abstract = {How can designers of programming interfaces, interactive tools, and rich social environments enable more people to be more creative more often?}, isbn = {0001-0782}, doi = {10.1145/1323688.1323689}, url = {http://doi.acm.org/10.1145/1323688.1323689}, author = {Shneiderman, Ben} } @conference {17582, title = {Cross-layer latency minimization in wireless networks with SINR constraints}, booktitle = {Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing}, series = {MobiHoc {\textquoteright}07}, year = {2007}, month = {2007///}, pages = {110 - 119}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Recently, there has been substantial interest in the design of cross-layer protocols for wireless networks. These protocols optimize certain performance metric(s) of interest (e.g. latency, energy, rate) by jointly optimizing the performance of multiple layers of the protocol stack. Algorithm designers often use geometric-graph-theoretic models for radio interference to design such cross-layer protocols. In this paper we study the problem of designing cross-layer protocols for multi-hop wireless networks using a more realistic Signal to Interference plus Noise Ratio (SINR) model for radio interference. The following cross-layer latency minimization problem is studied: Given a set V of transceivers, and a set of source-destination pairs, (i) choose power levels for all the transceivers, (ii) choose routes for all connections, and (iii) construct an end-to-end schedule such that the SINR constraints are satisfied at each time step so as to minimize the make-span of the schedule (the time by which all packets have reached their respective destinations). We present a polynomial-time algorithm with provable worst-case performance guarantee for this cross-layer latency minimization problem. As corollaries of the algorithmic technique we show that a number of variants of the cross-layer latency minimization problem can also be approximated efficiently in polynomial time. Our work extends the results of Kumar et al. (Proc. SODA, 2004) and Moscibroda et al. (Proc. MOBIHOC, 2006). Although our algorithm considers multiple layers of the protocol stack, it can naturally be viewed as compositions of tasks specific to each layer --- this allows us to improve the overall performance while preserving the modularity of the layered structure.}, keywords = {cross-layer design, end-to-end scheduling, Interference, SINR model, Wireless networks}, isbn = {978-1-59593-684-4}, doi = {10.1145/1288107.1288123}, url = {http://doi.acm.org/10.1145/1288107.1288123}, author = {Chafekar,Deepti and Kumar,V. S. Anil and Marathe,Madhav V. and Parthasarathy,Srinivasan and Srinivasan, Aravind} } @article {17772, title = {Cultural modeling in real time}, journal = {Science}, volume = {317}, year = {2007}, month = {2007///}, pages = {1509 - 1509}, abstract = {Computer models are being developed that can help policy-makers predict the behavior of political, economic, and social groups.}, doi = {10.1126/science.1148306}, author = {V.S. Subrahmanian} } @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 {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.} } @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.} } @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 {17591, title = {Efficient lookup on unstructured topologies}, journal = {IEEE Journal on Selected Areas in Communications}, volume = {25}, year = {2007}, month = {2007/01//}, pages = {62 - 72}, abstract = {We present LMS, a protocol for efficient lookup on unstructured networks. Our protocol uses a virtual namespace without imposing specific topologies. It is more efficient than existing lookup protocols for unstructured networks, and thus is an attractive alternative for applications in which the topology cannot be structured as a Distributed Hash Table (DHT). We present analytic bounds for the worst-case performance of LMS. Through detailed simulations (with up to 100,000 nodes), we show that the actual performance on realistic topologies is significantly better. We also show in both simulations and a complete implementation (which includes over five hundred nodes) that our protocol is inherently robust against multiple node failures and can adapt its replication strategy to optimize searches according to a specific heuristic. Moreover, the simulation demonstrates the resilience of LMS to high node turnover rates, and that it can easily adapt to orders of magnitude changes in network size. The overhead incurred by LMS is small, and its performance approaches that of DHTs on networks of similar size}, keywords = {Computer science, DHT, distributed algorithms, Distributed computing, distributed hash table, Least squares approximation, LMS, local minima search, lookup protocol, Network topology, node failures, Peer to peer computing, Performance analysis, Protocols, replication strategy, Resilience, Robustness, table lookup, telecommunication network topology, unstructured network topology}, isbn = {0733-8716}, doi = {10.1109/JSAC.2007.07007}, author = {Morselli,R. and Bhattacharjee, Bobby and Marsh,M.A. and Srinivasan, Aravind} } @article {12346, title = {Efficient parallel memory organization for turbo decoders}, journal = {Red}, volume = {5}, year = {2007}, month = {2007///}, author = {Salmela,P. and Gu,R. and Bhattacharyya, Shuvra S. and Takala,J.} } @article {17123, title = {eHealth Research from the User{\textquoteright}s Perspective}, journal = {American Journal of Preventive Medicine}, volume = {32}, year = {2007}, month = {2007/05//}, pages = {S97-S103 - S97-S103}, abstract = {The application of information technology (IT) to issues of healthcare delivery has had a long and tortuous history in the United States. Within the field of eHealth, vanguard applications of advanced computing techniques, such as applications in artificial intelligence or expert systems, have languished in spite of a track record of scholarly publication and decisional accuracy. The problem is one of purpose, of asking the right questions for the science to solve. Historically, many computer science pioneers have been tempted to ask {\textquotedblleft}what can the computer do?{\textquotedblright} New advances in eHealth are prompting developers to ask {\textquotedblleft}what can people do?{\textquotedblright} How can eHealth take part in national goals for healthcare reform to empower relationships between healthcare professionals and patients, healthcare teams and families, and hospitals and communities to improve health equitably throughout the population? To do this, eHealth researchers must combine best evidence from the user sciences (human factors engineering, human{\textendash}computer interaction, psychology, and usability) with best evidence in medicine to create transformational improvements in the quality of care that medicine offers. These improvements should follow recommendations from the Institute of Medicine to create a healthcare system that is (1) safe, (2) effective (evidence based), (3) patient centered, and (4) timely. Relying on the eHealth researcher{\textquoteright}s intuitive grasp of systems issues, improvements should be made with considerations of users and beneficiaries at the individual (patient{\textendash}physician), group (family{\textendash}staff), community, and broad environmental levels.}, isbn = {0749-3797}, doi = {10.1016/j.amepre.2007.01.019}, url = {http://www.sciencedirect.com/science/article/pii/S0749379707000487}, author = {Hesse,Bradford W. and Shneiderman, Ben} } @article {18006, title = {Electron beam and optical proximity effect reduction for nanolithography: New results}, journal = {Journal of Vacuum Science \& Technology B}, volume = {25}, year = {2007}, month = {2007///}, pages = {2288 - 2294}, abstract = {Proximity effect correction by dose modulation is widely practiced in electron-beam lithography. Optical proximity control is also possible using a combination of shape adjustment and phase control. Assigning {\textquotedblleft}the right{\textquotedblright} dose (or fill factor and phase for optics) is a well known mathematical inverse problem. Linear programming, by definition, is the appropriate method for determining dose. In the past, the technique was too slow for full-scale implementation in mask making. Here, the authors discuss how recent developments in computer speed and architecture have improved the prospects for full-scale implementation. In addition, the authors discuss some numerical techniques, analogous to gridding and relaxation, that make linear programming more attractive in mask making.}, keywords = {electron beam lithography, Linear programming, masks, nanolithography, proximity effect (lithography)}, doi = {10.1116/1.2806967}, url = {http://link.aip.org/link/?JVB/25/2288/1}, author = {Peckerar,Martin and Sander,David and Srivastava,Ankur and Foli,Adakou and Vishkin, Uzi} } @conference {12382, title = {An energy-driven design methodology for distributing DSP applications across wireless sensor networks}, booktitle = {Proceedings of RTSS}, year = {2007}, month = {2007///}, pages = {214 - 226}, author = {Shen,C. C and Plishker,W. and Bhattacharyya, Shuvra S. and Goldsman,N.} } @article {12118, title = {An Environment of Conducting Families of Software Engineering Experiments}, year = {2007}, month = {2007/05//}, institution = {University of Maryland, College Park}, abstract = {The classroom is a valuable resource for conducting software engineering experiments. However, coordinating a family of experiments in classroom environments presents a number of challenges to researchers. This paper describes an environment that simplifies the process of collecting, managing and sanitizing data from classroom experiments, while minimizing disruption to natural subject behavior. We have successfully used this environment to study the impact of parallel programming languages on programmer productivity at multiple universities across the United States.}, keywords = {collecting data, managing data, parallel programming languages, sanitizing data, software engineering experiments, universities}, url = {http://drum.lib.umd.edu/handle/1903/7545}, author = {Hochstein, Lorin and Nakamura,Taiga and Shull, Forrest and Zazworka, Nico and Voelp,Martin and Zelkowitz, Marvin V and Basili, Victor R.} } @article {12600, title = {Estimation of contour motion and deformation for nonrigid object tracking}, journal = {Journal of the Optical Society of America AJ. Opt. Soc. Am. A}, volume = {24}, year = {2007}, month = {2007///}, pages = {2109 - 2121}, abstract = {We present an algorithm for nonrigid contour tracking in heavily cluttered background scenes. Based on the properties of nonrigid contour movements, a sequential framework for estimating contour motion and deformation is proposed. We solve the nonrigid contour tracking problem by decomposing it into three subproblems: motion estimation, deformation estimation, and shape regulation. First, we employ a particle filter to estimate the global motion parameters of the affine transform between successive frames. Then we generate a probabilistic deformation map to deform the contour. To improve robustness, multiple cues are used for deformation probability estimation. Finally, we use a shape prior model to constrain the deformed contour. This enables us to retrieve the occluded parts of the contours and accurately track them while allowing shape changes specific to the given object types. Our experiments show that the proposed algorithm significantly improves the tracker performance.}, keywords = {Motion detection, VISION}, doi = {10.1364/JOSAA.24.002109}, url = {http://josaa.osa.org/abstract.cfm?URI=josaa-24-8-2109}, author = {Jie Shao and Porikli,Fatih and Chellapa, Rama} } @article {16261, title = {Evolution of genes and genomes on the Drosophila phylogeny}, journal = {Nature}, volume = {450}, year = {2007}, month = {2007/11/08/}, pages = {203 - 218}, abstract = {Comparative analysis of multiple genomes in a phylogenetic framework dramatically improves the precision and sensitivity of evolutionary inference, producing more robust results than single-genome analyses can provide. The genomes of 12 Drosophila species, ten of which are presented here for the first time (sechellia, simulans, yakuba, erecta, ananassae, persimilis, willistoni, mojavensis, virilis and grimshawi), illustrate how rates and patterns of sequence divergence across taxa can illuminate evolutionary processes on a genomic scale. These genome sequences augment the formidable genetic tools that have made Drosophila melanogaster a pre-eminent model for animal genetics, and will further catalyse fundamental research on mechanisms of development, cell biology, genetics, disease, neurobiology, behaviour, physiology and evolution. Despite remarkable similarities among these Drosophila species, we identified many putatively non-neutral changes in protein-coding genes, non-coding RNA genes, and cis-regulatory regions. These may prove to underlie differences in the ecology and behaviour of these diverse species.}, isbn = {0028-0836}, doi = {10.1038/nature06341}, url = {http://www.nature.com/nature/journal/v450/n7167/full/nature06341.html}, author = {Clark,Andrew G. and Eisen,Michael B. and Smith,Douglas R. and Bergman,Casey M. and Oliver,Brian and Markow,Therese A. and Kaufman,Thomas C. and Kellis,Manolis and Gelbart,William and Iyer,Venky N. and Pollard,Daniel A. and Sackton,Timothy B. and Larracuente,Amanda M. and Singh,Nadia D. and Abad,Jose P. and Abt,Dawn N. and Adryan,Boris and Aguade,Montserrat and Akashi,Hiroshi and Anderson,Wyatt W. and Aquadro,Charles F. and Ardell,David H. and Arguello,Roman and Artieri,Carlo G. and Barbash,Daniel A. and Barker,Daniel and Barsanti,Paolo and Batterham,Phil and Batzoglou,Serafim and Begun,Dave and Bhutkar,Arjun and Blanco,Enrico and Bosak,Stephanie A. and Bradley,Robert K. and Brand,Adrianne D. and Brent,Michael R. and Brooks,Angela N. and Brown,Randall H. and Butlin,Roger K. and Caggese,Corrado and Calvi,Brian R. and Carvalho,A. Bernardo de and Caspi,Anat and Castrezana,Sergio and Celniker,Susan E. and Chang,Jean L. and Chapple,Charles and Chatterji,Sourav and Chinwalla,Asif and Civetta,Alberto and Clifton,Sandra W. and Comeron,Josep M. and Costello,James C. and Coyne,Jerry A. and Daub,Jennifer and David,Robert G. and Delcher,Arthur L. and Delehaunty,Kim and Do,Chuong B. and Ebling,Heather and Edwards,Kevin and Eickbush,Thomas and Evans,Jay D. and Filipski,Alan and Findei|[szlig]|,Sven and Freyhult,Eva and Fulton,Lucinda and Fulton,Robert and Garcia,Ana C. L. and Gardiner,Anastasia and Garfield,David A. and Garvin,Barry E. and Gibson,Greg and Gilbert,Don and Gnerre,Sante and Godfrey,Jennifer and Good,Robert and Gotea,Valer and Gravely,Brenton and Greenberg,Anthony J. and Griffiths-Jones,Sam and Gross,Samuel and Guigo,Roderic and Gustafson,Erik A. and Haerty,Wilfried and Hahn,Matthew W. and Halligan,Daniel L. and Halpern,Aaron L. and Halter,Gillian M. and Han,Mira V. and Heger,Andreas and Hillier,LaDeana and Hinrichs,Angie S. and Holmes,Ian and Hoskins,Roger A. and Hubisz,Melissa J. and Hultmark,Dan and Huntley,Melanie A. and Jaffe,David B. and Jagadeeshan,Santosh and Jeck,William R. and Johnson,Justin and Jones,Corbin D. and Jordan,William C. and Karpen,Gary H. and Kataoka,Eiko and Keightley,Peter D. and Kheradpour,Pouya and Kirkness,Ewen F. and Koerich,Leonardo B. and Kristiansen,Karsten and Kudrna,Dave and Kulathinal,Rob J. and Kumar,Sudhir and Kwok,Roberta and Lander,Eric and Langley,Charles H. and Lapoint,Richard and Lazzaro,Brian P. and Lee,So-Jeong and Levesque,Lisa and Li,Ruiqiang and Lin,Chiao-Feng and Lin,Michael F. and Lindblad-Toh,Kerstin and Llopart,Ana and Long,Manyuan and Low,Lloyd and Lozovsky,Elena and Lu,Jian and Luo,Meizhong and Machado,Carlos A. and Makalowski,Wojciech and Marzo,Mar and Matsuda,Muneo and Matzkin,Luciano and McAllister,Bryant and McBride,Carolyn S. and McKernan,Brendan and McKernan,Kevin and Mendez-Lago,Maria and Minx,Patrick and Mollenhauer,Michael U. and Montooth,Kristi and Mount, Stephen M. and Mu,Xu and Myers,Eugene and Negre,Barbara and Newfeld,Stuart and Nielsen,Rasmus and Noor,Mohamed A. F. and O{\textquoteright}Grady,Patrick and Pachter,Lior and Papaceit,Montserrat and Parisi,Matthew J. and Parisi,Michael and Parts,Leopold and Pedersen,Jakob S. and Pesole,Graziano and Phillippy,Adam M and Ponting,Chris P. and Pop, Mihai and Porcelli,Damiano and Powell,Jeffrey R. and Prohaska,Sonja and Pruitt,Kim and Puig,Marta and Quesneville,Hadi and Ram,Kristipati Ravi and Rand,David and Rasmussen,Matthew D. and Reed,Laura K. and Reenan,Robert and Reily,Amy and Remington,Karin A. and Rieger,Tania T. and Ritchie,Michael G. and Robin,Charles and Rogers,Yu-Hui and Rohde,Claudia and Rozas,Julio and Rubenfield,Marc J. and Ruiz,Alfredo and Russo,Susan and Salzberg,Steven L. and Sanchez-Gracia,Alejandro and Saranga,David J. and Sato,Hajime and Schaeffer,Stephen W. and Schatz,Michael C and Schlenke,Todd and Schwartz,Russell and Segarra,Carmen and Singh,Rama S. and Sirot,Laura and Sirota,Marina and Sisneros,Nicholas B. and Smith,Chris D. and Smith,Temple F. and Spieth,John and Stage,Deborah E. and Stark,Alexander and Stephan,Wolfgang and Strausberg,Robert L. and Strempel,Sebastian and Sturgill,David and Sutton,Granger and Sutton,Granger G. and Tao,Wei and Teichmann,Sarah and Tobari,Yoshiko N. and Tomimura,Yoshihiko and Tsolas,Jason M. and Valente,Vera L. S. and Venter,Eli and Venter,J. Craig and Vicario,Saverio and Vieira,Filipe G. and Vilella,Albert J. and Villasante,Alfredo and Walenz,Brian and Wang,Jun and Wasserman,Marvin and Watts,Thomas and Wilson,Derek and Wilson,Richard K. and Wing,Rod A. and Wolfner,Mariana F. and Wong,Alex and Wong,Gane Ka-Shu and Wu,Chung-I and Wu,Gabriel and Yamamoto,Daisuke and Yang,Hsiao-Pei and Yang,Shiaw-Pyng and Yorke,James A. and Yoshida,Kiyohito and Zdobnov,Evgeny and Zhang,Peili and Zhang,Yu and Zimin,Aleksey V. and Baldwin,Jennifer and Abdouelleil,Amr and Abdulkadir,Jamal and Abebe,Adal and Abera,Brikti and Abreu,Justin and Acer,St Christophe and Aftuck,Lynne and Alexander,Allen and An,Peter and Anderson,Erica and Anderson,Scott and Arachi,Harindra and Azer,Marc and Bachantsang,Pasang and Barry,Andrew and Bayul,Tashi and Berlin,Aaron and Bessette,Daniel and Bloom,Toby and Blye,Jason and Boguslavskiy,Leonid and Bonnet,Claude and Boukhgalter,Boris and Bourzgui,Imane and Brown,Adam and Cahill,Patrick and Channer,Sheridon and Cheshatsang,Yama and Chuda,Lisa and Citroen,Mieke and Collymore,Alville and Cooke,Patrick and Costello,Maura and D{\textquoteright}Aco,Katie and Daza,Riza and Haan,Georgius De and DeGray,Stuart and DeMaso,Christina and Dhargay,Norbu and Dooley,Kimberly and Dooley,Erin and Doricent,Missole and Dorje,Passang and Dorjee,Kunsang and Dupes,Alan and Elong,Richard and Falk,Jill and Farina,Abderrahim and Faro,Susan and Ferguson,Diallo and Fisher,Sheila and Foley,Chelsea D. and Franke,Alicia and Friedrich,Dennis and Gadbois,Loryn and Gearin,Gary and Gearin,Christina R. and Giannoukos,Georgia and Goode,Tina and Graham,Joseph and Grandbois,Edward and Grewal,Sharleen and Gyaltsen,Kunsang and Hafez,Nabil and Hagos,Birhane and Hall,Jennifer and Henson,Charlotte and Hollinger,Andrew and Honan,Tracey and Huard,Monika D. and Hughes,Leanne and Hurhula,Brian and Husby,M Erii and Kamat,Asha and Kanga,Ben and Kashin,Seva and Khazanovich,Dmitry and Kisner,Peter and Lance,Krista and Lara,Marcia and Lee,William and Lennon,Niall and Letendre,Frances and LeVine,Rosie and Lipovsky,Alex and Liu,Xiaohong and Liu,Jinlei and Liu,Shangtao and Lokyitsang,Tashi and Lokyitsang,Yeshi and Lubonja,Rakela and Lui,Annie and MacDonald,Pen and Magnisalis,Vasilia and Maru,Kebede and Matthews,Charles and McCusker,William and McDonough,Susan and Mehta,Teena and Meldrim,James and Meneus,Louis and Mihai,Oana and Mihalev,Atanas and Mihova,Tanya and Mittelman,Rachel and Mlenga,Valentine and Montmayeur,Anna and Mulrain,Leonidas and Navidi,Adam and Naylor,Jerome and Negash,Tamrat and Nguyen,Thu and Nguyen,Nga and Nicol,Robert and Norbu,Choe and Norbu,Nyima and Novod,Nathaniel and O{\textquoteright}Neill,Barry and Osman,Sahal and Markiewicz,Eva and Oyono,Otero L. and Patti,Christopher and Phunkhang,Pema and Pierre,Fritz and Priest,Margaret and Raghuraman,Sujaa and Rege,Filip and Reyes,Rebecca and Rise,Cecil and Rogov,Peter and Ross,Keenan and Ryan,Elizabeth and Settipalli,Sampath and Shea,Terry and Sherpa,Ngawang and Shi,Lu and Shih,Diana and Sparrow,Todd and Spaulding,Jessica and Stalker,John and Stange-Thomann,Nicole and Stavropoulos,Sharon and Stone,Catherine and Strader,Christopher and Tesfaye,Senait and Thomson,Talene and Thoulutsang,Yama and Thoulutsang,Dawa and Topham,Kerri and Topping,Ira and Tsamla,Tsamla and Vassiliev,Helen and Vo,Andy and Wangchuk,Tsering and Wangdi,Tsering and Weiand,Michael and Wilkinson,Jane and Wilson,Adam and Yadav,Shailendra and Young,Geneva and Yu,Qing and Zembek,Lisa and Zhong,Danni and Zimmer,Andrew and Zwirko,Zac and Jaffe,David B. and Alvarez,Pablo and Brockman,Will and Butler,Jonathan and Chin,CheeWhye and Gnerre,Sante and Grabherr,Manfred and Kleber,Michael and Mauceli,Evan and MacCallum,Iain} } @article {19072, title = {Evolution of genes and genomes on the Drosophila phylogeny}, journal = {Nature}, volume = {450}, year = {2007}, month = {2007}, pages = {203 - 218}, author = {Clark, A.G. and Eisen,M. B and Smith,D. R and Bergman, C.M. and Oliver, B. and Markow, T.A. and Kaufman, T.C. and Kellis, M. and Gelbart, W. and Iyer, V.N. and others} } @conference {16427, title = {Evolution of non-uniform cellular automata using a genetic algorithm: diversity and computation}, booktitle = {Proceedings of the 9th annual conference on Genetic and evolutionary computation}, series = {GECCO {\textquoteright}07}, year = {2007}, month = {2007///}, pages = {1531 - 1531}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {We used a genetic algorithm to evaluate the cost / benefit of diversity in evolving sets of rules for non-uniform cellular automata solving the density classification problem.}, keywords = {diversity, Genetic algorithms, non-uniform cellular automata, search spaces}, isbn = {978-1-59593-697-4}, doi = {10.1145/1276958.1277260}, url = {http://doi.acm.org/10.1145/1276958.1277260}, author = {Sondahl,Forrest and Rand, William} } @article {16850, title = {Execution time analysis of a top-down R-tree construction algorithm}, journal = {Information Processing Letters}, volume = {101}, year = {2007}, month = {2007/01/16/}, pages = {6 - 12}, abstract = {A detailed CPU execution-time analysis and implementation are given for a bulk loading algorithm to construct R-trees due to Garc{\'\i}a et al. [Y.J. Garc{\'\i}a, M.A. L{\'o}pez, S.T. Leutenegger, A greedy algorithm for bulk loading R-trees, in: GIS{\textquoteright}98: Proc. of the 6th ACM Intl. Symp. on Advances in Geographic Information Systems, Washington, DC, 1998, pp. 163{\textendash}164] which is known as the top-down greedy split (TGS) bulk loading algorithm. The TGS algorithm makes use of a classical bottom-up packing approach. In addition, an alternative packing approach termed top-down packing is introduced which may lead to improved query performance, and it is shown how to incorporate it into the TGS algorithm. A discussion is also presented of the tradeoffs of using the bottom-up and top-down packing approaches.}, keywords = {Bulk loading, Data structures, Packing, R-trees, Spatial databases}, isbn = {0020-0190}, doi = {10.1016/j.ipl.2006.07.010}, url = {http://www.sciencedirect.com/science/article/pii/S002001900600233X}, author = {Alborzi,Houman and Samet, Hanan} } @article {14086, title = {The Expression of a Plant-type Ferredoxin Redox System provides Molecular Evidence for a Plastid in the Early Dinoflagellate Perkinsus marinus}, journal = {Protist}, volume = {158}, year = {2007}, month = {2007/01/22/}, pages = {119 - 130}, abstract = {Perkinsus marinus is a parasitic protozoan with a phylogenetic positioning between Apicomplexa and dinoflagellates. It is thus of interest for reconstructing the early evolution of eukaryotes, especially with regard to the acquisition of secondary plastids in these organisms. It is also an important pathogen of oysters, and the definition of parasite-specific metabolic pathways would be beneficial for the identification of efficient treatments for infected mollusks. Although these different scientific interests have resulted in the start of a genome project for this organism, it is still unknown whether P. marinus contains a plastid or plastid-like organelle like the related dinoflagellates and Apicomplexa. Here, we show that in vitro-cultivated parasites contain transcripts of the plant-type ferredoxin and its associated reductase. Both proteins are nuclear-encoded and possess N-terminal targeting sequences similar to those characterized in dinoflagellates. Since this redox pair is exclusively found in cyanobacteria and plastid-harboring organisms its presence also in P. marinus is highly indicative of a plastid. We also provide additional evidence for such an organelle by demonstrating pharmacological sensitivity to inhibitors of plastid-localized enzymes involved in fatty acid biosynthesis (e.g. acetyl-CoA carboxylase) and by detection of genes for three enzymes of plastid-localized isoprenoid biosynthesis (1-deoxy-D-xylulose 5-phosphate reductoisomerase, (E)-4-hydroxy-3-methyl-but-2-enyl diphosphate reductase, and (E)-4-hydroxy-3-methyl-but-2-enyl diphosphate synthase).}, keywords = {Apicomplexa, ferredoxin, Perkinsozoa, plastid, transit peptide}, isbn = {1434-4610}, doi = {16/j.protis.2006.09.003}, url = {http://www.sciencedirect.com/science/article/pii/S1434461006001015}, author = {Stelter,Kathrin and El-Sayed, Najib M. and Seeber,Frank} } @article {17915, title = {A fast all nearest neighbor algorithm for applications involving large point-clouds}, journal = {Computers \& Graphics}, volume = {31}, year = {2007}, month = {2007/04//}, pages = {157 - 174}, abstract = {Algorithms that use point-cloud models make heavy use of the neighborhoods of the points. These neighborhoods are used to compute the surface normals for each point, mollification, and noise removal. All of these primitive operations require the seemingly repetitive process of finding the k nearest neighbors (kNNs) of each point. These algorithms are primarily designed to run in main memory. However, rapid advances in scanning technologies have made available point-cloud models that are too large to fit in the main memory of a computer. This calls for more efficient methods of computing the kNNs of a large collection of points many of which are already in close proximity. A fast kNN algorithm is presented that makes use of the locality of successive points whose k nearest neighbors are sought to reduce significantly the time needed to compute the neighborhood needed for the primitive operation as well as enable it to operate in an environment where the data is on disk. Results of experiments demonstrate an order of magnitude improvement in the time to perform the algorithm and several orders of magnitude improvement in work efficiency when compared with several prominent existing methods.}, keywords = {All nearest neighbor algorithm, Disk-based data structures, Incremental neighbor finding algorithm, k Nearest neighbors, kNN Algorithm, Locality, Neighbor finding, Neighborhood, Point-cloud graphics, Point-cloud operations}, isbn = {0097-8493}, doi = {10.1016/j.cag.2006.11.011}, url = {http://www.sciencedirect.com/science/article/pii/S0097849306002378}, author = {Sankaranarayanan,Jagan and Samet, Hanan and Varshney, Amitabh} } @article {17596, title = {Fast and scalable approximation methods for finding minimum cost flows with ...}, volume = {10/053,079}, year = {2007}, month = {2007/10/09/}, abstract = {Broadly, techniques for solving network routing within a predetermined error are disclosed. These techniques may be applied to networks supporting dedicated reserve capacity, where reserved capacity on links in the network is dedicated for a particular commodity (generally, a source and sink pair of computers), and shared recovery, where reserved capacity on links is shared amongst two or more commodities. These techniques use an iterative process to determine flows on each of the links in a network. Costs are set for each commodity, and primary and secondary (i.e., backup) flows are initialized. A commodity is selected and demand for the commodity is routed through the shortest path. Costs are updated for each potential failure mode. For each commodity, the flows and costs are updated. Once all flows and costs are updated, then it is determined if a function is less than a predetermined value. If the function is less than a predetermined value, then the commodity selection, and...}, url = {http://www.google.com/patents?id=rkWpAAAAEBAJ}, author = {Fleischer,Lisa Karen and Saniee,Iraj and Shepherd,Frederick Bruce and Srinivasan, Aravind}, editor = {Lucent Technologies Inc.} } @conference {15435, title = {Faults{\textquoteright} context matters}, booktitle = {Fourth international workshop on Software quality assurance: in conjunction with the 6th ESEC/FSE joint meeting}, series = {SOQUA {\textquoteright}07}, year = {2007}, month = {2007///}, pages = {112 - 115}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {When choosing a testing technique, practitioners want to know which one will detect the faults that matter most to them in the programs that they plan to test. Do empirical evaluations of testing techniques provide this information? More often than not, they report how many faults in a carefully chosen "representative" sample the evaluated techniques detect. But the population of faults that such a sample would represent depends heavily on the faults{\textquoteright} context or environment---as does the cost of failing to detect those faults. If empirical studies are to provide information that a practitioner can apply outside the context of the study, they must characterize the faults studied in a way that translates across contexts. A testing technique{\textquoteright}s fault-detecting abilities could then be interpreted relative to the fault characterization. In this paper, we present a list of criteria that a fault characterization must meet in order to be fit for this task, and we evaluate several well-known fault characterizations against the criteria. Two families of characterizations are found to satisfy the criteria: those based on graph models of programs and those based on faults{\textquoteright} detection by testing techniques.}, isbn = {978-1-59593-724-7}, doi = {10.1145/1295074.1295096}, url = {http://doi.acm.org/10.1145/1295074.1295096}, author = {Strecker,Jaymie and Memon, Atif M.} } @inbook {18904, title = {Finding Most Probable Worlds of Probabilistic Logic Programs}, booktitle = {Scalable Uncertainty Management}, series = {Lecture Notes in Computer Science}, volume = {4772}, year = {2007}, month = {2007///}, pages = {45 - 59}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {Probabilistic logic programs have primarily studied the problem of entailment of probabilistic atoms. However, there are some interesting applications where we are interested in finding a possible world that is most probable. Our first result shows that the problem of computing such {\textquotedblright}maximally probable worlds{\textquotedblright} (MPW) is intractable. We subsequently show that we can often greatly reduce the size of the linear program used in past work (by Ng and Subrahmanian) and yet solve the problem exactly. However, the intractability results still make computational efficiency quite impossible. We therefore also develop several heuristics to solve the MPW problem and report extensive experimental results on the accuracy and efficiency of such heuristics.}, keywords = {Computer science}, isbn = {978-3-540-75407-7}, url = {http://www.springerlink.com/content/e4463p4rv4k01u93/abstract/}, author = {Khuller, Samir and Martinez,Vanina and Nau, Dana S. and Simari,Gerardo and Sliva,Amy and Subrahmanian,V.}, editor = {Prade,Henri and Subrahmanian,V.} } @article {15255, title = {Finding most probable worlds of probabilistic logic programs}, journal = {Scalable Uncertainty Management}, year = {2007}, month = {2007///}, pages = {45 - 59}, abstract = {Probabilistic logic programs have primarily studied the problem of entailment of probabilistic atoms. However, there are some interesting applications where we are interested in finding a possible world that is most probable. Our first result shows that the problem of computing such {\textquotedblright}maximally probable worlds{\textquotedblright} (MPW) is intractable. We subsequently show that we can often greatly reduce the size of the linear program used in past work (by Ng and Subrahmanian) and yet solve the problem exactly. However, the intractability results still make computational efficiency quite impossible. We therefore also develop several heuristics to solve the MPW problem and report extensive experimental results on the accuracy and efficiency of such heuristics.}, doi = {10.1007/978-3-540-75410-7_4}, author = {Khuller, Samir and Martinez,V. and Nau, Dana S. and Simari,G. and Sliva,A. and Subrahmanian,V.} } @book {16857, title = {Fundamentals of Multidimensional and Metric data structure}, year = {2007}, month = {2007///}, publisher = {Morgan-Kaufmann, San Francisco}, organization = {Morgan-Kaufmann, San Francisco}, author = {Samet, Hanan} } @conference {17774, title = {A general framework for reasoning about inconsistency}, booktitle = {Proceedings of the International Joint Conference on Artificial Intelligence}, year = {2007}, month = {2007///}, pages = {599 - 604}, abstract = {Numerous logics have been developed for reason-ing about inconsistency which differ in (i) the logic to which they apply, and (ii) the criteria used to draw inferences. In this paper, we propose a gen- eral framework for reasoning about inconsistency in a wide variety of logics including ones for which inconsistency resolution methods have not yet been studied (e.g. various temporal and epistemic log- ics). We start with Tarski and Scott{\textquoteright}s axiomatiza- tion of logics, but drop their monotonicity require- ments that we believe are too strong for AI. For such a logic L, we define the concept of an option. Options are sets of formulas in L that are closed and consistent according to the notion of consequence and consistency in L. We show that by defining an appropriate preference relation on options, we can capture several existing works such as Brewka{\textquoteright}s subtheories. We also provide algorithms to com- pute most preferred options. }, author = {V.S. Subrahmanian and Amgoud,L.} } @article {15279, title = {Genome Analysis Linking Recent European and African Influenza (H5N1) Viruses}, journal = {Emerging Infectious DiseasesEmerg Infect Dis}, volume = {13}, year = {2007}, month = {2007/05//}, pages = {713 - 718}, abstract = {Although linked, these viruses are distinct from earlier outbreak strains., To better understand the ecology and epidemiology of the highly pathogenic avian influenza virus in its transcontinental spread, we sequenced and analyzed the complete genomes of 36 recent influenza A (H5N1) viruses collected from birds in Europe, northern Africa, and southeastern Asia. These sequences, among the first complete genomes of influenza (H5N1) viruses outside Asia, clearly depict the lineages now infecting wild and domestic birds in Europe and Africa and show the relationships among these isolates and other strains affecting both birds and humans. The isolates fall into 3 distinct lineages, 1 of which contains all known non-Asian isolates. This new Euro-African lineage, which was the cause of several recent (2006) fatal human infections in Egypt and Iraq, has been introduced at least 3 times into the European-African region and has split into 3 distinct, independently evolving sublineages. One isolate provides evidence that 2 of these sublineages have recently reassorted.}, isbn = {1080-6040}, doi = {10.3201/eid1305.070013}, author = {Salzberg,Steven L. and Kingsford, Carl and Cattoli,Giovanni and Spiro,David J. and Janies,Daniel A. and Aly,Mona Mehrez and Brown,Ian H. and Couacy-Hymann,Emmanuel and De Mia,Gian Mario and Dung,Do Huu and Guercio,Annalisa and Joannis,Tony and Ali,Ali Safar Maken and Osmani,Azizullah and Padalino,Iolanda and Saad,Magdi D. and Savi{\'c},Vladimir and Sengamalay,Naomi A. and Yingst,Samuel and Zaborsky,Jennifer and Zorman-Rojs,Olga and Ghedin,Elodie and Capua,Ilaria} } @conference {14404, title = {GeoDDupe: A Novel Interface for Interactive Entity Resolution in Geospatial Data}, booktitle = {Information Visualization, 2007. IV {\textquoteright}07. 11th International Conference}, year = {2007}, month = {2007/07//}, pages = {489 - 496}, abstract = {Due to the growing interest in geospatial data mining and analysis, data cleaning and integration in geospatial data is becoming an important issue. Geospatial entity resolution is the process of reconciling multiple location references to the same real world location within a single data source (deduplication) or across multiple data sources (integration). In this paper, we introduce an interactive tool called GeoDDupe which effectively combines automatic data mining algorithms for geospatial entity resolution with a novel network visualization supporting users{\textquoteright} resolution analysis and decisions. We illustrate the GeoDDupe interface with an example geospatial dataset and show how users can efficiently and accurately resolve location entities. Finally, the case study with two real-world geospatial datasets demonstrates the potential of GeoDDupe.}, keywords = {algorithms;data, cleaning;geospatial, data, entity, GeoDDupe;automatic, interfaces;, mining, mining;geography;user, mining;geospatial, resolution;interactive, tool;network, visualization;data}, doi = {10.1109/IV.2007.55}, author = {Kang,Hyunmo and Sehgal,V. and Getoor, Lise} } @conference {13348, title = {A graph-based approach to vehicle tracking in traffic camera video streams}, booktitle = {Proceedings of the 4th workshop on Data management for sensor networks: in conjunction with 33rd International Conference on Very Large Data Bases}, series = {DMSN {\textquoteright}07}, year = {2007}, month = {2007///}, pages = {19 - 24}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Vehicle tracking has a wide variety of applications from law enforcement to traffic planning and public safety. However, the image resolution of the videos available from most traffic camera systems, make it difficult to track vehicles based on unique identifiers like license plates. In many cases, vehicles with similar attributes are indistinguishable from one another due to image quality issues. Often, network bandwidth and power constraints limit the frame rate, as well. In this paper, we discuss the challenges of performing vehicle tracking queries over video streams from ubiquitous traffic cameras. We identify the limitations of tracking vehicles individually in such conditions and provide a novel graph-based approach using the identity of neighboring vehicles to improve the performance. We evaluate our approach using streaming video feeds from live traffic cameras available on the Internet. The results show that vehicle tracking is feasible, even for low quality and low frame rate traffic cameras. Additionally, exploitation of the attributes of neighboring vehicles significantly improves the performance.}, isbn = {978-159593-911-1}, doi = {10.1145/1286380.1286386}, url = {http://doi.acm.org/10.1145/1286380.1286386}, author = {Shahri,Hamid Haidarian and Namata,Galileo and Navlakha,Saket and Deshpande, Amol and Roussopoulos, Nick} } @conference {17771, title = {GRIN: A graph based RDF index}, booktitle = {Proceedings of the National Conference on Artificial Intelligence}, volume = {22}, year = {2007}, month = {2007///}, pages = {1465 - 1465}, abstract = {RDF ({\textquotedblleft}Resource Description Framework{\textquotedblright}) is now a widelyused World Wide Web Consortium standard. However, methods to index large volumes of RDF data are still in their infancy. In this paper, we focus on providing a very lightweight indexing mechanism for certain kinds of RDF queries, namely graph-based queries where there is a need to traverse edges in the graph determined by an RDF database. Our approach uses the idea of drawing circles around selected {\textquotedblleft}center{\textquotedblright} vertices in the graph where the circle would encom- pass those vertices in the graph that are within a given dis- tance of the {\textquotedblleft}center{\textquotedblright} vertex. We come up with methods of finding such {\textquotedblleft}center{\textquotedblright} vertices and identifying the radius of the circles and then leverage this to build an index called GRIN. We compare GRIN with three existing RDF indexex: Jena, Sesame, and RDFBroker. We compared (i) the time to an- swer graph based queries, (ii) memory needed to store the index, and (iii) the time to build the index. GRIN outper- forms Jena, Sesame and RDFBroker on all three measures for graph based queries (for other types of queries, it may be worth building one of these other indexes and using it), at the expense of using a larger amount of memory when answering queries. }, author = {Udrea,O. and Pugliese, A. and V.S. Subrahmanian} } @article {17183, title = {Hawkeye: an interactive visual analytics tool for genome assemblies}, journal = {Genome Biology}, volume = {8}, year = {2007}, month = {2007/03/09/}, pages = {R34 - R34}, abstract = {Genome sequencing remains an inexact science, and genome sequences can contain significant errors if they are not carefully examined. Hawkeye is our new visual analytics tool for genome assemblies, designed to aid in identifying and correcting assembly errors. Users can analyze all levels of an assembly along with summary statistics and assembly metrics, and are guided by a ranking component towards likely mis-assemblies. Hawkeye is freely available and released as part of the open source AMOS project http://amos.sourceforge.net/hawkeye.}, isbn = {1465-6906}, doi = {10.1186/gb-2007-8-3-r34}, url = {http://genomebiology.com/2007/8/3/R34}, author = {Schatz,Michael C and Phillippy,Adam M and Shneiderman, Ben and Salzberg,Steven L.} } @article {17905, title = {High-throughput sequence alignment using Graphics Processing Units}, journal = {BMC Bioinformatics}, volume = {8}, year = {2007}, month = {2007///}, pages = {474 - 474}, isbn = {1471-2105}, doi = {10.1186/1471-2105-8-474}, url = {http://www.biomedcentral.com/1471-2105/8/474}, author = {Schatz,Michael C and Trapnell,Cole and Delcher,Arthur L. and Varshney, Amitabh} } @conference {18573, title = {Holding the Internet Accountable}, booktitle = {Proc. 6th ACM Workshop on Hot Topics in Networks (Hotnets-VI)}, year = {2007}, month = {2007/11/01/}, abstract = {Today{\textquoteright}s IP network layer provides little to no protection against misconfiguration or malice. Despite some progress in improving the robustness and security of the IP layer, misconfigurations and attacks still occur frequently. We show how a network layer that provides accountability, i.e., the ability to associate each action with the responsible entity, provides a firm foundation for defenses against misconfiguration and malice. We present the design of a network layer that incorporates accountability called AIP (Accountable Internet Protocol) and show how its features{\textemdash}notably, its use of self-certifying addresses{\textemdash} can improve both source accountability (the ability to trace actions to a particular end host and stop that host from misbehaving) and control-plane accountability (the ability to pinpoint and prevent attacks on routing).}, url = {http://repository.cmu.edu/compsci/66}, author = {Andersen,David and Balakrishnan,Hari and Feamster, Nick and Koponen,Teemu and Moon,Daekyong and Shenker,Scott} } @conference {15986, title = {Hood College, Master of Business Administration, 2005 Hood College, Master of Science (Computer Science), 2001 Hood College, Bachelor of Science (Computer Science), 1998 Frederick Community College, Associate in Arts (Business Administration), 1993}, booktitle = {Proceedings of the Workshop on Metareasoning in Agent-Based Systems}, year = {2007}, month = {2007///}, author = {Anderson,M. L and Schmill,M. and Oates,T. and Perlis, Don and Josyula,D. and Wright,D. and Human,S. W.T.D.N and Metacognition,L. and Fults,S. and Josyula,D. P} } @inbook {19453, title = {How Smart Homes Learn: The Evolution of the Networked Home and Household}, booktitle = {UbiComp 2007: Ubiquitous Computing}, series = {Lecture Notes in Computer Science}, year = {2007}, month = {2007/01/01/}, pages = {127 - 144}, publisher = {Springer Berlin Heidelberg}, organization = {Springer Berlin Heidelberg}, abstract = {Despite a growing desire to create smart homes, we know little about how networked technologies interact with a house{\textquoteright}s infrastructure. In this paper, we begin to close this gap by presenting findings from a study that examined the relationship between home networking and the house itself{\textemdash}and the work that results for householders as a consequence of this interaction. We discuss four themes that emerged: an ambiguity in understanding the virtual boundaries created by wireless networks, the home network control paradox, a new home network access paradox, and the relationship between increased responsibilities and the possibilities of wireless networking.}, keywords = {Computer Communication Networks, computers and society, home networking, Information Systems Applications (incl.Internet), infrastructure, smart home, software engineering, Systems and Data Security, User Interfaces and Human Computer Interaction}, isbn = {978-3-540-74852-6, 978-3-540-74853-3}, url = {http://link.springer.com/chapter/10.1007/978-3-540-74853-3_8}, author = {Marshini Chetty and Sung, Ja-Young and Grinter, Rebecca E.}, editor = {Krumm, John and Abowd, Gregory D. and Seneviratne, Aruna and Strang, Thomas} } @article {17203, title = {Human Responsibility for Autonomous Agents}, journal = {IEEE Intelligent Systems}, volume = {22}, year = {2007}, month = {2007/04//March}, pages = {60 - 61}, abstract = {Automated or autonomous systems can sometimes fail harmlessly, but they can also destroy data, compromise privacy, and consume resources, such as bandwidth or server capacity. What{\textquoteright}s more troubling is that automated systems embedded in vital systems can cause financial losses, destruction of property, and loss of life. Controlling these dangers will increase trust while enabling broader use of these systems with higher degrees of safety. Obvious threats stem from design errors and software bugs, but we can{\textquoteright}t overlook mistaken assumptions by designers, unanticipated actions by humans, and interference from other computerized systems. This article is part of a special issue on Interacting with Autonomy.}, keywords = {Automatic control, Autonomous agents, autonomous systems, Bandwidth, Computer bugs, Computer errors, Control systems, data privacy, Human-computer interaction, HUMANS, Robots, Safety, Software design}, isbn = {1541-1672}, doi = {10.1109/MIS.2007.32}, author = {Shneiderman, Ben} } @inbook {17208, title = {Human Values for Shaping the Made World}, booktitle = {Human-Computer Interaction {\textendash} INTERACT 2007Human-Computer Interaction {\textendash} INTERACT 2007}, series = {Lecture Notes in Computer Science}, volume = {4662}, year = {2007}, month = {2007///}, pages = {1 - 1}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {Interface design principles have been effective in shaping new desktop applications, web-based resources, and mobile devices. Usability and sociability promote successful online communities and social network services. The contributions of human-computer interaction researchers have been effective in raising the quality of design of many products and services. As our influence grows, we can play an even more profound role in guaranteeing that enduring human values are embedded in the next generation of technology. This talk identifies which goals are realistic, such as universality, responsibility, trust, empathy, and privacy, and how we might ensure that they become part of future services and systems.}, isbn = {978-3-540-74794-9}, url = {http://dx.doi.org/10.1007/978-3-540-74796-3_1}, author = {Shneiderman, Ben}, editor = {Baranauskas,C{\'e}cilia and Palanque,Philippe and Abascal,Julio and Barbosa,Simone} } @article {14150, title = {IFISS: A Matlab toolbox for modelling incompressible flow}, journal = {ACM Transactions on Mathematical Software}, volume = {33}, year = {2007}, month = {2007///}, author = {Elman, Howard and Ramage, A. and Silvester, D. J} } @article {16848, title = {An improved asymmetry measure to detect breast cancer}, journal = {Proceedings of SPIE}, volume = {6514}, year = {2007}, month = {2007/03/08/}, pages = {65141Q-65141Q-9 - 65141Q-65141Q-9}, abstract = {Radiologists can use the differences between the left and right breasts, or asymmetry, in mammograms to help detect certain malignant breast cancers. An image similarity method has been improved to make use of this knowledge base to recognize breast cancer. Image similarity is determined using computer-aided detection (CAD) prompts as the features, and then a cluster comparison is done to determine whether there is asymmetry. We develop the analysis through a combination of clustering and supervised learning of model parameters. This process correctly classifies cancerous mammograms 95\% of the time, and all mammograms 84\% of the time, and thus asymmetry is a measure that can play an important role in significantly improving computer-aided breast cancer detection systems. This technique represents an improvement in accuracy of 121\% over commercial techniques on non-cancerous cases. Most computer-aided detection (CAD) systems are tested on images which contain cancer on the assumption that images without cancer would produce the same number of false positives. However, a pre-screening system is designed to remove the normal cases from consideration, and so the inclusion of a pre-screening system into CAD dramatically reduces the number of false positives reported by the CAD system. We define three methods for the inclusion of pre-screening into CAD, and improve the performance of the CAD system by over 70\% at low levels of false positives.}, isbn = {0277786X}, doi = {doi:10.1117/12.708327}, url = {http://spiedigitallibrary.org/proceedings/resource/2/psisdg/6514/1/65141Q_1?isAuthorized=no}, author = {Tahmoush,Dave and Samet, Hanan} } @conference {12582, title = {In Situ Evaluation of Tracking Algorithms Using Time Reversed Chains}, booktitle = {Computer Vision and Pattern Recognition, 2007. CVPR {\textquoteright}07. IEEE Conference on}, year = {2007}, month = {2007/06//}, pages = {1 - 8}, abstract = {Automatic evaluation of visual tracking algorithms in the absence of ground truth is a very challenging and important problem. In the context of online appearance modeling, there is an additional ambiguity involving the correctness of the appearance model. In this paper, we propose a novel performance evaluation strategy for tracking systems based on particle filter using a time reversed Markov chain. Starting from the latest observation, the time reversed chain is propagated back till the starting time t = 0 of the tracking algorithm. The posterior density of the time reversed chain is also computed. The distance between the posterior density of the time reversed chain (at t = 0) and the prior density used to initialize the tracking algorithm forms the decision statistic for evaluation. It is postulated that when the data is generated true to the underlying models, the decision statistic takes a low value. We empirically demonstrate the performance of the algorithm against various common failure modes in the generic visual tracking problem. Finally, we derive a small frame approximation that allows for very efficient computation of the decision statistic.}, keywords = {(numerical, algorithm;Markov, chain;tracking, decision, density;time, detection;particle, Evaluation, evaluation;object, filter;performance, Filtering, Markov, methods);tracking;visual, processes;decision, reversed, servoing;, situ, statistics;in, strategy;posterior, systems;visual, theory;object, tracking, tracking;particle}, doi = {10.1109/CVPR.2007.382992}, author = {Wu,Hao and Sankaranarayanan,A. C and Chellapa, Rama} } @conference {16845, title = {Indexing Methods for Similarity Searching}, booktitle = {Current Trends in Computer Science, 2007. ENC 2007. Eighth Mexican International Conference on}, year = {2007}, month = {2007/09//}, pages = {xv - xv}, abstract = {An overview is given of the various techniques and issues involved in providing indexing support for similarity searching. Similarity searching is a crucial part of retrieval in multimedia databases used for applications such as pattern recognition, image databases, and content-based retrieval. It involves finding objects in a data set S that are similar to a query object q based on some distance measure d which is usually a distance metric. The search process is usually achieved by means of nearest neighbor finding. Existing methods for handling similarity search in this setting fall into one of two classes. The first is based on mapping to a vector space. The vector space is usually of high dimension which requires special handling due to the fact indexing methods do not discriminate well in such spaces. In particular, the query regions often overlap all of the blocks that result from the decomposition of the underlying space. This has led to some special solutions that make use of a sequential scan. An alternative is to use dimension reduction to find a mapping from a high-dimensional space into a low-dimensional space by finding the most discriminating dimensions and then index the data using one of a number of different data structures such as k-d trees, R-trees, quadtrees, etc. The second directly indexes the objects based on distances making use of data structures such as the vp-tree, M-tree, etc.}, keywords = {content-based, database;indexing, database;pattern, databases;, indexing;multimedia, methods;multimedia, recognition;similarity, retrieval;data, searching;data, structures;database, structures;image}, doi = {10.1109/ENC.2007.9}, author = {Samet, Hanan} } @conference {16847, title = {Indexing Point Triples Via Triangle Geometry}, booktitle = {Data Engineering, 2007. ICDE 2007. IEEE 23rd International Conference on}, year = {2007}, month = {2007/04//}, pages = {936 - 945}, abstract = {Database search for images containing icons with specific mutual spatial relationships can be facilitated by an appropriately structured index. For the case of images containing subsets each of which consist of three icons, the one-to-one correspondence between (distinct) point triples and triangles allows the use of such triangle attributes as position, size, orientation, and "shape" in constructing a point-based index, in which each triangle maps to a single point in a resulting hyperdimensional index space. Size (based on the triangle perimeter) can be represented by a single linear dimension. The abstract "shape" of a triangle induces a space that is inherently two-dimensional, and a number of alternative definitions of a basis for this space are examined. Within a plane, orientation reduces to rotation, and (after assignment of a reference direction for the triangle) can be represented by a single, spatially closed dimension. However, assignment of a reference direction for triangles possessing a k-fold rotational symmetry presents a significant challenge. Methods are described for characterizing shape and orientation of triangles, and for mapping these attributes onto a set of linear axes to form a combined index. The shape attribute is independent of size, orientation, and position, and the characterization of shape and orientation is stable with respect to small variations in the indexed triangles.}, keywords = {database, databases;, dimension;spatial, geometry;database, hyperdimensional, index, index;single, index;triangle, indexing;query, linear, point;k-fold, processing;visual, relationships;structured, rotational, search;indexing, space;image, symmetry;point-based}, doi = {10.1109/ICDE.2007.367939}, author = {Cranston,C.B. and Samet, Hanan} } @article {18229, title = {Intrinsic fingerprints for image authentication and steganalysis}, journal = {Proc. SPIE Conf. Security, Steganography, Watermarking of Multimedia Contents}, year = {2007}, month = {2007///}, abstract = {With growing popularity of digital imaging devices and low-cost image editing software, the integrity of imagecontent can no longer be taken for granted. This paper introduces a methodology for forensic analysis of digital camera images, based on the observation that many in-camera and post-camera processing operations leave distinct traces on digital images. We present methods to identify these intrinsic fingerprint traces of the various processing operations and employ them to verify the authenticity of digital data. We develop an explicit imaging model to characterize the properties that should be satisfied by a direct camera output, and model any further processing applied to the camera captured image by a manipulation filter. Utilizing the manipulation filter coefficients and reference patterns estimated from direct camera outputs using blind deconvolution techniques, the proposed methods are capable of detecting manipulations made by previously unseen operations and steganographic embedding. }, author = {Swaminathan,A. and Wu,M. and Liu,K. J.R} } @article {12575, title = {Jmin-image based color-texture segmentation using watershed and hierarchical clustering}, journal = {Proceedings of the 8th International Symposium on Mathematical Morphology}, volume = {2}, year = {2007}, month = {2007/10//undefin}, pages = {35 - 36}, author = {Santos, T.T. and Morimoto, CH and Chellapa, Rama} } @conference {12594, title = {Joint Acoustic-Video Fingerprinting of Vehicles, Part II}, booktitle = {Acoustics, Speech and Signal Processing, 2007. ICASSP 2007. IEEE International Conference on}, volume = {2}, year = {2007}, month = {2007/04//}, pages = {II-749 -II-752 - II-749 -II-752}, abstract = {In this second paper, we first show how to estimate the wheelbase length of a vehicle using line metrology in video. We then address the vehicle fingerprinting problem using vehicle silhouettes and color invariants. We combine the acoustic metrology and classification results discussed in Part I with the video results to improve estimation performance and robustness. The acoustic video fusion is achieved in a Bayesian framework by assuming conditional independence of the observations of each modality. For the metrology density functions, Laplacian approximations are used for computational efficiency. Experimental results are given using field data}, keywords = {acoustic-video, analysis;video, approximations;acoustic, Bayesian, colour, density, efficiency;joint, estimation;Bayes, fingerprinting;metrology, framework;Laplacian, functions;performance, fusion;color, identification;image, invariants;computational, methods;acoustic, metrology;acoustic, processing;, processing;fingerprint, signal, video}, doi = {10.1109/ICASSP.2007.366344}, author = {Cevher, V. and Guo, F. and Sankaranarayanan,A. C and Chellapa, Rama} } @article {18236, title = {Joint Uplink and Downlink Optimization for Real-Time Multiuser Video Streaming Over WLANs}, journal = {Selected Topics in Signal Processing, IEEE Journal of}, volume = {1}, year = {2007}, month = {2007/08//}, pages = {280 - 294}, abstract = {In this paper, a network-aware and source-aware video streaming system is proposed to support interactive multiuser communications within single-cell and multicell IEEE 802.11 networks. Unlike the traditional streaming video services, the strict delay constraints of an interactive video streaming system pose more challenges. These challenges include the heterogeneity of uplink and downlink channel conditions experienced by different users, the multiuser resource allocation of limited radio resources, the incorporation of the cross-layer design, and the diversity of content complexities exhibited by different video sequences. With the awareness of video content and network resources, the proposed system integrates cross-layer error protection mechanism and performs dynamic resource allocation across multiple users. We formulate the proposed system as to minimize the maximal end-to-end expected distortion received by all users, subject to maximal transmission power and delay constraints. To reduce the high dimensionality of the search space, fast multiuser algorithms are proposed to find the near-optimal solutions. Compared to the strategy without dynamically and jointly allocating bandwidth resource for uplinks and downlinks, the proposed framework outperforms by 2.18 7.95 dB in terms of the average received PSNR of all users and by 3.82 11.50 dB in terms of the lowest received PSNR among all users. Furthermore, the proposed scheme can provide more uniform video quality for all users and lower quality fluctuation for each received video sequence.}, keywords = {802.11, allocation;image, allocation;real-time, communications;maximal, distortion;multiuser, end-to-end, error, expected, IEEE, LAN;, mechanism;downlink, multiuser, networks;WLAN;cross-layer, optimization;interactive, optimization;video, Protection, quality;video, resource, sequences;video, streaming, streaming;uplink, streaming;wireless, system;bandwidth, video}, isbn = {1932-4553}, doi = {10.1109/JSTSP.2007.901518}, author = {Su,Guan-Ming and Han,Zhu and M. Wu and Liu,K. J.R} } @article {16858, title = {K-nearest neighbor finding using MaxNearestDist}, journal = {IEEE transactions on pattern analysis and machine intelligence}, year = {2007}, month = {2007///}, pages = {243 - 252}, author = {Samet, Hanan} } @conference {16854, title = {Knowledge discovery using the sand spatial browser}, booktitle = {Proceedings of the 8th annual international conference on Digital government research: bridging disciplines \& domains}, series = {dg.o {\textquoteright}07}, year = {2007}, month = {2007///}, pages = {284 - 285}, publisher = {Digital Government Society of North America}, organization = {Digital Government Society of North America}, abstract = {The use of the SAND Internet Browser as a knowledge discovery tool for epidemiological cartography is highlighted by recreating the results of Dr. John Snow{\textquoteright}s study of the 1854 Cholera epidemic in Soho, London.}, keywords = {distance semi-join, knowledge discovery, sand database system, snow cholera map}, isbn = {1-59593-599-1}, url = {http://dl.acm.org/citation.cfm?id=1248460.1248521}, author = {Samet, Hanan and Phillippy,Adam and Sankaranarayanan,Jagan} } @article {14129, title = {Least squares preconditioners for stabilized discretizations of the Navier-Stokes equations}, journal = {SIAM J. Sci. Comput}, volume = {30}, year = {2007}, month = {2007///}, pages = {290 - 311}, author = {Elman, Howard and Howle, V. E and Shadid, J. and Silvester, D. and Tuminaro, R.} } @article {14512, title = {Link-based Classification}, volume = {UMIACS-TR-2007-11}, year = {2007}, month = {2007/02/19/}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {Over the past few years, a number of approximate inference algorithms fornetworked data have been put forth. We empirically compare the performance of three of the popular algorithms: loopy belief propagation, mean field relaxation labeling and iterative classification. We rate each algorithm in terms of its robustness to noise, both in attribute values and correlations across links. We also compare them across varying types of correlations across links. }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/4298}, author = {Sen,Prithviraj and Getoor, Lise} } @conference {12343, title = {Low-overhead run-time scheduling for fine-grained acceleration of signal processing systems}, booktitle = {Signal Processing Systems, 2007 IEEE Workshop on}, year = {2007}, month = {2007///}, pages = {457 - 462}, author = {Boutellier,J. and Bhattacharyya, Shuvra S. and Silv{\'e}n,O.} } @conference {17769, title = {MAGIC: A Multi-Activity Graph Index for Activity Detection}, booktitle = {Information Reuse and Integration, 2007. IRI 2007. IEEE International Conference on}, year = {2007}, month = {2007/08//}, pages = {267 - 272}, abstract = {Suppose we are given a set A of activities of interest, a set O of observations, and a probability threshold p. We are interested in finding the set of all pairs (a, O{\textquoteright}), where a epsi A and O{\textquoteright} sube O, that minimally validate the fact that an instance of activity a occurs in O with probability p or more. The novel contribution of this paper is the notion of the multi-activity graph index (MAGIC), which can index very large numbers of observations from interleaved activities and quickly retrieve completed instances of the monitored activities. We introduce two complexity reducing restrictions of the problem (which takes exponential time) and develop algorithms for each. We experimentally evaluate our exponential algorithm as well as the restricted algorithms on both synthetic data and a real (depersonalized) travel data set consisting of 5.5 million observations. Our experiments show that MAGIC consumes reasonable amounts of memory and can retrieve completed instances of activities in just a few seconds. We also report appropriate statistical significance results validating our experimental hypotheses.}, keywords = {complexity;graph, detection;complexity, graph, index;probability, MAGIC;activity, reducing, restrictions;exponential, theory;probability;, threshold;computational, time;multiactivity}, doi = {10.1109/IRI.2007.4296632}, author = {Albanese, M. and Pugliese, A. and V.S. Subrahmanian and Udrea,O.} } @article {18859, title = {Manufacturing multi-material articulated plastic products using in-mold assembly}, journal = {The International Journal of Advanced Manufacturing Technology}, volume = {32}, year = {2007}, month = {2007///}, pages = {350 - 365}, abstract = {In-mold assembly can be used to create plastic products with articulated joints. This process eliminates the need for post-molding assembly and reduces the number of parts being used in the product, hence improving the product quality. However, designing both products and molds is significantly more challenging in case of in-mold assembly. Currently, a systematic methodology does not exist for developing product and processes to exploit potential benefits of in-mold assembly for creating articulated joints. This paper is a step towards creating such a methodology and reports the following three results. First, it presents a model for designing assemblies and molding process so that the joint clearances and variation in the joint clearances can meet the performance goals. Second, it describes proven mold design templates for realizing revolute, prismatic, and spherical joints. Third, it describes a mold design methodology for designing molds for products that contain articulated joints and will be produced using in-mold assembly process. Three case studies are also presented to illustrate how in-mold assembly process can be used to create articulated devices.}, keywords = {engineering}, isbn = {0268-3768}, doi = {10.1007/s00170-005-0343-z}, url = {http://www.springerlink.com/content/q77nl78827r7w461/abstract/}, author = {Priyadarshi,Alok and Gupta, Satyandra K. and Gouker,Regina and Krebs,Florian and Shroeder,Martin and Warth,Stefan} } @conference {13828, title = {Measuring variability in sentence ordering for news summarization}, booktitle = {Proceedings of the Eleventh European Workshop on Natural Language Generation}, series = {ENLG {\textquoteright}07}, year = {2007}, month = {2007///}, pages = {81 - 88}, publisher = {Association for Computational Linguistics}, organization = {Association for Computational Linguistics}, address = {Stroudsburg, PA, USA}, abstract = {The issue of sentence ordering is an important one for natural language tasks such as multi-document summarization, yet there has not been a quantitative exploration of the range of acceptable sentence orderings for short texts. We present results of a sentence reordering experiment with three experimental conditions. Our findings indicate a very high degree of variability in the orderings that the eighteen subjects produce. In addition, the variability of reorderings is significantly greater when the initial ordering seen by subjects is different from the original summary. We conclude that evaluation of sentence ordering should use multiple reference orderings. Our evaluation presents several metrics that might prove useful in assessing against multiple references. We conclude with a deeper set of questions: (a) what sorts of independent assessments of quality of the different reference orderings could be made and (b) whether a large enough test set would obviate the need for such independent means of quality assessment.}, url = {http://dl.acm.org/citation.cfm?id=1610163.1610177}, author = {Madnani,Nitin and Passonneau,Rebecca and Ayan,Necip Fazil and Conroy,John M. and Dorr, Bonnie J and Klavans,Judith L. and O{\textquoteright}Leary, Dianne P. and Schlesinger,Judith D.} } @article {12596, title = {Method of three-dimensional object reconstruction from a video sequence using a generic model}, volume = {10/644,817}, year = {2007}, month = {2007/02/27/}, abstract = {In a novel method of 3D modeling of an object from a video sequence using an SfM algorithm and a generic object model, the generic model is incorporated after the SfM algorithm generates a 3D estimate of the object model purely and directly from the input video sequence. An optimization framework provides for comparison of the local trends of the 3D estimate and the generic model so that the errors in the 3D estimate are corrected. The 3D estimate is obtained by fusing intermediate 3D reconstructions of pairs of frames of the video sequence after computing the uncertainty of the two frame solutions. The quality of the fusion algorithm is tracked using a rate-distortion function. In order to combine the generic model with the 3D estimate, an energy function minimization procedure is applied to the 3D estimate. The optimization is performed using a Metropolis-Hasting sampling strategy.}, url = {http://www.google.com/patents?id=4At_AAAAEBAJ}, author = {Chellapa, Rama and Chowdhury,Amit K. Roy and Srinivasan,Sridhar}, editor = {University of Maryland} } @article {16279, title = {Minimus: a fast, lightweight genome assembler}, journal = {BMC Bioinformatics}, volume = {8}, year = {2007}, month = {2007/02/26/}, pages = {64 - 64}, abstract = {Genome assemblers have grown very large and complex in response to the need for algorithms to handle the challenges of large whole-genome sequencing projects. Many of the most common uses of assemblers, however, are best served by a simpler type of assembler that requires fewer software components, uses less memory, and is far easier to install and run.}, isbn = {1471-2105}, doi = {10.1186/1471-2105-8-64}, url = {http://www.biomedcentral.com/1471-2105/8/64}, author = {Sommer,Daniel D and Delcher,Arthur L. and Salzberg,Steven L. and Pop, Mihai} } @article {13831, title = {Multi-candidate reduction: Sentence compression as a tool for document summarization tasks}, journal = {Information Processing \& Management}, volume = {43}, year = {2007}, month = {2007/11//}, pages = {1549 - 1570}, abstract = {This article examines the application of two single-document sentence compression techniques to the problem of multi-document summarization{\textemdash}a {\textquotedblleft}parse-and-trim{\textquotedblright} approach and a statistical noisy-channel approach. We introduce the multi-candidate reduction (MCR) framework for multi-document summarization, in which many compressed candidates are generated for each source sentence. These candidates are then selected for inclusion in the final summary based on a combination of static and dynamic features. Evaluations demonstrate that sentence compression is a valuable component of a larger multi-document summarization framework.}, keywords = {Headline generation, Hidden Markov model, Parse-and-trim, Summarization}, isbn = {0306-4573}, doi = {10.1016/j.ipm.2007.01.016}, url = {http://www.sciencedirect.com/science/article/pii/S0306457307000295}, author = {Zajic, David and Dorr, Bonnie J and Jimmy Lin and Schwartz,Richard} } @conference {19036, title = {Multi-Dimensional Range Query over Encrypted Data}, year = {2007}, month = {2007}, pages = {350 - 364}, abstract = {We design an encryption scheme called multi-dimensional range query over encrypted data (MRQED), to address the privacy concerns related to the sharing of network audit logs and various other applications. Our scheme allows a network gateway to encrypt summaries of network flows before submitting them to an untrusted repository. When network intrusions are suspected, an authority can release a key to an auditor, allowing the auditor to decrypt flows whose attributes (e.g., source and destination addresses, port numbers, etc.) fall within specific ranges. However, the privacy of all irrelevant flows are still preserved. We formally define the security for MRQED and prove the security of our construction under the decision bilinear Diffie-Hellman and decision linear assumptions in certain bilinear groups. We study the practical performance of our construction in the context of network audit logs. Apart from network audit logs, our scheme also has interesting applications for financial audit logs, medical privacy, untrusted remote storage, etc. In particular, we show that MRQED implies a solution to its dual problem, which enables investors to trade stocks through a broker in a privacy-preserving manner.}, keywords = {auditing, cryptography, data privacy, decision bilinear Diffie-Hellman, decision linear assumptions, encrypted data, multi-dimensional range query, network audit logs, network gateway, network intrusions}, author = {Elaine Shi and Bethencourt, J. and Chan, T.-H.H. and Song, Dawn and Perrig, A.} } @article {14711, title = {Mutatis Mutandis: Safe and predictable dynamic software updating}, journal = {ACM Trans. Program. Lang. Syst.}, volume = {29}, year = {2007}, month = {2007/08//}, abstract = {This article presents Proteus, a core calculus that models dynamic software updating, a service for fixing bugs and adding features to a running program. Proteus permits a program{\textquoteright}s type structure to change dynamically but guarantees the updated program remains type-correct by ensuring a property we call con-freeness. We show how con-freeness can be enforced dynamically, and how it can be approximated via a novel static analysis. This analysis can be used to assess the implications of a program{\textquoteright}s structure on future updates in order to make update success more predictable. We have implemented Proteus for C, and briefly discuss our implementation which we have tested on several well-known programs.}, keywords = {capability, dynamic software updating, proteus, Type inference, updateability analysis}, isbn = {0164-0925}, doi = {10.1145/1255450.1255455}, url = {http://doi.acm.org/10.1145/1255450.1255455}, author = {Stoyle,Gareth and Hicks, Michael W. and Bierman,Gavin and Sewell,Peter and Neamtiu,Iulian} } @conference {16851, title = {A new database for medical images and information}, booktitle = {Proceedings of SPIE-Medical Imaging}, year = {2007}, month = {2007///}, abstract = {We present a medical image and medical record database for the storage, research,transmission, and evaluation of medical images, as well as tele-medicine applications. Any medical image from a source that supports the DICOM standard can be stored and accessed, as well as associated analysis and annotations. Information and image retrieval can be done based on patient info, date, doctor{\textquoteright}s annotations, features in the images, or a spatial combination of features. Secure access and transmission is addressed for tele- medicine applications. This database application follows all HIPAA regulations. }, author = {Tahmoush,D. and Samet, Hanan} } @article {12918, title = {New records of phytoplankton for Bangladesh. 3. Volvocales}, journal = {Bangladesh Journal of Plant Taxonomy}, volume = {14}, year = {2007}, month = {2007/12/01/}, abstract = {This study presents 21 species of Chlamydomonas, four species of Carteria, two species of each of Nephroselmis, Pyramidomonas and Scherffelia, and Collodictyon triciliatum, Polytoma minus, Tetrachloridium ? allorgei and Tetraselmis cordiformis. These species have been reported from some ponds of Mathbaria of Pirojpur and Bakerganj of Barisal districts in Bangladesh.}, isbn = {1028-2092}, doi = {10.3329/bjpt.v14i1.518}, url = {http://www.banglajol.info/bd/index.php/BJPT/article/viewArticle/518}, author = {Khondker,Moniruzzaman and Bhuiyan,Rauf Ahmed and Yeasmin,Jenat and Alam,Munirul and Sack,R. Bradley and Huq,Anwar and Rita R Colwell} } @article {12917, title = {New records of phytoplankton for Bangladesh. 4. Chlorococcales}, journal = {Bangladesh Journal of Plant Taxonomy}, volume = {14}, year = {2007}, month = {2007/12/02/}, abstract = {This study presents three species from each of Schroederia, Monoraphidium and Ankistrodesmus, two species and one variety of Dictyosphaerium, two varieties of Pediastrum, and Tetraedron arthrodesmiforme var. contorta, Chlorotetraedron polymorphum, Myrmecia aquatica, Oocystis tainoensis, Nephrocytium spirale, Kirchneriella irregularis, Coelastrum indicum and Scenedesmus similagineus. These taxa have been reported from some ponds of Mathbaria of Pirojpur and Bakerganj of Barisal Districts in Bangladesh.}, isbn = {1028-2092}, doi = {10.3329/bjpt.v14i2.528}, url = {http://www.banglajol.info/bd/index.php/BJPT/article/viewArticle/528}, author = {Khondker,Moniruzzaman and Bhuiyan,Rauf Ahmed and Yeasim,Jenat and Alam,Munirul and Sack,R. Bradley and Huq,Anwar and Rita R Colwell} } @conference {14991, title = {New techniques for ensuring the long term integrity of digital archives}, booktitle = {Proceedings of the 8th annual international conference on Digital government research}, year = {2007}, month = {2007///}, pages = {57 - 65}, abstract = {A large portion of the government, business, cultural, andscientific digital data being created today needs to be archived and preserved for future use of periods ranging from a few years to decades and sometimes centuries. A fundamental requirement of a long term archive is to ensure the integrity of its holdings. In this paper, we develop a new methodology to address the integrity of long term archives using rigorous cryptographic techniques. Our approach involves the generation of a small-size integrity token for each digital object to be archived, and some cryptographic summary information based on all the objects handled within a dynamic time period. We present a framework that enables the continuous auditing of the holdings of the archive depending on the policy set by the archive. Moreover, an independent auditor will be able to verify the integrity of every version of an archived digital object as well as link the current version to the original form of the object when it was ingested into the archive. We built a - prototype system that is completely independent of the archive{\textquoteright}s underlying architecture, and tested it on large scale data. We include in this paper some preliminary results on the validation and performance of our prototype. }, author = {Song,S. and JaJa, Joseph F.} } @article {14074, title = {New Trypanosoma cruzi Repeated Element That Shows Site Specificity for Insertion}, journal = {Eukaryotic Cell}, volume = {6}, year = {2007}, month = {2007/07/01/}, pages = {1228 - 1238}, abstract = {A new family of site-specific repeated elements identified in Trypanosoma cruzi, which we named TcTREZO, is described here. TcTREZO appears to be a composite repeated element, since three subregions may be defined within it on the basis of sequence similarities with other T. cruzi sequences. Analysis of the distribution of TcTREZO in the genome clearly indicates that it displays site specificity for insertion. Most TcTREZO elements are flanked by conserved sequences. There is a highly conserved 68-bp sequence at the 5{\textquoteright} end of the element and a sequence domain of [~]500 bp without a well-defined borderline at the 3{\textquoteright} end. Northern blot hybridization and reverse transcriptase PCR analyses showed that TcTREZO transcripts are expressed as oligo(A)-terminated transcripts whose length corresponds to the unit size of the element (1.6 kb). Transcripts of [~]0.2 kb derived from a small part of TcTREZO are also detected in steady-state RNA. TcTREZO transcripts are unspliced and not translated. The copy number of TcTREZO sequences was estimated to be [~]173 copies per haploid genome. TcTREZO appears to have been assembled by insertions of sequences into a progenitor element. Once associated with each other, these subunits were amplified as a new transposable element. TcTREZO shows site specificity for insertion, suggesting that a sequence-specific endonuclease could be responsible for its insertion at a unique site.}, doi = {

10.1128/EC.00036-07

}, url = {http://ec.asm.org/cgi/content/abstract/6/7/1228}, author = {Souza,Renata T. and Santos,Marcia R. M. and Lima,Fabio M. and El-Sayed, Najib M. and Myler,Peter J. and Ruiz,Jeronimo C. and da Silveira,Jose Franco} } @conference {18255, title = {Noise Features for Image Tampering Detection and Steganalysis}, booktitle = {Image Processing, 2007. ICIP 2007. IEEE International Conference on}, volume = {6}, year = {2007}, month = {2007/10/16/19}, pages = {VI -97 -VI -100 - VI -97 -VI -100}, abstract = {With increasing availability of low-cost image editing softwares, the authenticity of digital images can no longer be taken for granted. Digital images have also been used as cover data for transmitting secret information in the field of steganography. In this paper, we introduce a new set of features for multimedia forensics to determine if a digital image is an authentic camera output or if it has been tampered or embedded with hidden data. We perform such image forensic analysis employing three sets of statistical noise features, including those from denoising operations, wavelet analysis, and neighborhood prediction. Our experimental results demonstrate that the proposed method can effectively distinguish digital images from their tampered or stego versions.}, keywords = {analysis;cryptography;data, analysis;image, analysis;wavelet, authenticity;hidden, computing;statistical, data;image, denoising, denoising;multimedia, detection;low-cost, editing, encapsulation;feature, extraction;image, features;steganalysis;wavelet, forensic, forensics;neighborhood, image, NOISE, operations;digital, prediction;statistical, softwares;multimedia, tampering, transforms;}, doi = {10.1109/ICIP.2007.4379530}, author = {Gou,Hongmei and Swaminathan,A. and M. Wu} } @article {18257, title = {Nonintrusive component forensics of visual sensors using output images}, journal = {Information Forensics and Security, IEEE Transactions on}, volume = {2}, year = {2007}, month = {2007/03//}, pages = {91 - 106}, abstract = {Rapid technology development and the widespread use of visual sensors have led to a number of new problems related to protecting intellectual property rights, handling patent infringements, authenticating acquisition sources, and identifying content manipulations. This paper introduces nonintrusive component forensics as a new methodology for the forensic analysis of visual sensing information, aiming to identify the algorithms and parameters employed inside various processing modules of a digital device by only using the device output data without breaking the device apart. We propose techniques to estimate the algorithms and parameters employed by important camera components, such as color filter array and color interpolation modules. The estimated interpolation coefficients provide useful features to construct an efficient camera identifier to determine the brand and model from which an image was captured. The results obtained from such component analysis are also useful to examine the similarities between the technologies employed by different camera models to identify potential infringement/licensing and to facilitate studies on technology evolution}, keywords = {ACQUISITION, array;color, authenticating, component, filter, forensics;patent, infringements;visual, Interpolation, manipulations;intellectual, modules;content, property, property;, protection;nonintrusive, rights, sensors;image, sensors;industrial, sources;color}, isbn = {1556-6013}, doi = {10.1109/TIFS.2006.890307}, author = {Swaminathan,A. and M. Wu and Liu,K. J.R} } @conference {15997, title = {Ontologies for reasoning about failures in AI systems}, booktitle = {Proceedings from the Workshop on Metareasoning in Agent Based Systems at the Sixth International Joint Conference on Autonomous Agents and Multiagent Sytems}, year = {2007}, month = {2007///}, author = {Schmill,M. and Josyula,D. and Anderson,M. L and Wilson,S. and Oates,T. and Perlis, Don and Fults,S.} } @article {16860, title = {Out-of-core Multi-resolution Terrain Modeling}, journal = {Spatial data on the Web: modeling and management}, year = {2007}, month = {2007///}, pages = {43 - 43}, author = {Danovaro,E. and De Floriani, Leila and Puppo,E. and Samet, Hanan} } @article {18642, title = {Password Changes: Empirical Results}, journal = {Computers and Software Engineering}, year = {2007}, month = {2007///}, abstract = {This paper focuses on a detailed analysis of oneaspect of password evolution based on empirical data: password changes. Passwords can be divided into weak and strong based on how easy it is to crack them. We present a model of password changes and analyze passwords collected during 21 months from a large network of an average of 770 users. The results include tracking the percentage of users with weak passwords over time and the percentage of users changing between weak and strong passwords. Based on the data analysis, the distribution of users switching between weak and strong passwords was characterized and two parameters of the model were estimated. }, url = {http://isastorganization.org/ISAST_CS_1_2007.pdf$\#$page=10}, author = {Michel Cukier and Sharma,A.} } @conference {17528, title = {PeerWise discovery and negotiation of faster paths}, booktitle = {Proc. Workshop on Hot Topics in Networks (HotNets)}, year = {2007}, month = {2007///}, author = {Lumezanu,C. and Levin,D. and Spring, Neil} } @article {17906, title = {Plasma Turbulence Simulation and Visualization on Graphics Processors: Efficient Parallel Computing on the Desktop}, journal = {Bulletin of the American Physical Society}, volume = {Volume 52, Number 11}, year = {2007}, month = {2007/11/12/}, abstract = {Direct numerical simulation (DNS) of turbulence is computationally very intensive and typically relies on some form of parallel processing. Spectral kernels used for spatial discretization are a common computational bottleneck on distributed memory architectures. One way to increase the efficiency of DNS algorithms is to parallelize spectral kernels using tightly-coupled SPMD multiprocessor hardware architecture with minimal inter-processor communication latency. In this poster we present techniques to take advantage of the recent programmable interfaces for modern Graphics Processing Units (GPUs) to carefully map DNS computations to GPU architectures that are characterized by a very high memory bandwidth and hundreds of SPMD processors. We compare and contrast the performance of our parallel algorithm on a modern GPU versus a CPU implementation of several turbulence simulation codes. We also demonstrate a prototype of a scalable computational steering framework based on turbulence simulation and visualization coupling on the GPU.}, url = {http://meetings.aps.org/Meeting/DPP07/Event/70114}, author = {Stantchev,George and Juba,Derek and Dorland,William and Varshney, Amitabh} } @conference {18003, title = {Plasmonics and the parallel programming problem}, booktitle = {Society of Photo-Optical Instrumentation Engineers (SPIE) Conference Series}, volume = {6477}, year = {2007}, month = {2007///}, pages = {19 - 19}, abstract = {While many parallel computers have been built, it has generally been too difficult to program them. Now, all computersare effectively becoming parallel machines. Biannual doubling in the number of cores on a single chip, or faster, over the coming decade is planned by most computer vendors. Thus, the parallel programming problem is becoming more critical. The only known solution to the parallel programming problem in the theory of computer science is through a parallel algorithmic theory called PRAM. Unfortunately, some of the PRAM theory assumptions regarding the bandwidth between processors and memories did not properly reflect a parallel computer that could be built in previous decades. Reaching memories, or other processors in a multi-processor organization, required off-chip connections through pins on the boundary of each electric chip. Using the number of transistors that is becoming available on chip, on-chip architectures that adequately support the PRAM are becoming possible. However, the bandwidth of off-chip connections remains insufficient and the latency remains too high. This creates a bottleneck at the boundary of the chip for a PRAM-On-Chip architecture. This also prevents scalability to larger {\textquotedblleft}supercomputing{\textquotedblright} organizations spanning across many processing chips that can handle massive amounts of data. Instead of connections through pins and wires, power-efficient CMOS-compatible on-chip conversion to plasmonic nanowaveguides is introduced for improved latency and bandwidth. Proper incorporation of our ideas offer exciting avenues to resolving the parallel programming problem, and an alternative way for building faster, more useable and much more compact supercomputers. }, author = {Vishkin, Uzi and Smolyaninov,I. and Davis,C.} } @conference {19040, title = {Portcullis: protecting connection setup from denial-of-capability attacks}, series = {SIGCOMM {\textquoteright}07}, year = {2007}, month = {2007}, pages = {289 - 300}, publisher = {ACM}, organization = {ACM}, abstract = {Systems using capabilities to provide preferential service to selected flows have been proposed as a defense against large-scale network denial-of-service attacks. While these systems offer strong protection for established network flows, the Denial-of-Capability (DoC) attack, which prevents new capability-setup packets from reaching the destination, limits the value of these systems. Portcullis mitigates DoC attacks by allocating scarce link bandwidth for connection establishment packets based on per-computation fairness. We prove that a legitimate sender can establish a capability with high probability regardless of an attacker{\textquoteright}s resources or strategy and that no system can improve on our guarantee. We simulate full and partial deployments of Portcullis on an Internet-scale topology to confirm our theoretical results and demonstrate the substantial benefits of using per-computation fairness.}, keywords = {network capability, per-computation fairness}, isbn = {978-1-59593-713-1}, url = {http://doi.acm.org/10.1145/1282380.1282413}, author = {Parno, Bryan and Wendlandt, Dan and Elaine Shi and Perrig, Adrian and Maggs, Bruce and Hu, Yih-Chun} } @article {15572, title = {A practical approximation algorithm for the LMS line estimator}, journal = {Computational Statistics \& Data Analysis}, volume = {51}, year = {2007}, month = {2007/02/01/}, pages = {2461 - 2486}, abstract = {The problem of fitting a straight line to a finite collection of points in the plane is an important problem in statistical estimation. Robust estimators are widely used because of their lack of sensitivity to outlying data points. The least median-of-squares (LMS) regression line estimator is among the best known robust estimators. Given a set of n points in the plane, it is defined to be the line that minimizes the median squared residual or, more generally, the line that minimizes the residual of any given quantile q, where 0 \< q ⩽ 1 . This problem is equivalent to finding the strip defined by two parallel lines of minimum vertical separation that encloses at least half of the points.The best known exact algorithm for this problem runs in O ( n 2 ) time. We consider two types of approximations, a residual approximation, which approximates the vertical height of the strip to within a given error bound ε r ⩾ 0 , and a quantile approximation, which approximates the fraction of points that lie within the strip to within a given error bound ε q ⩾ 0 . We present two randomized approximation algorithms for the LMS line estimator. The first is a conceptually simple quantile approximation algorithm, which given fixed q and ε q \> 0 runs in O ( n log n ) time. The second is a practical algorithm, which can solve both types of approximation problems or be used as an exact algorithm. We prove that when used as a quantile approximation, this algorithm{\textquoteright}s expected running time is O ( n log 2 n ) . We present empirical evidence that the latter algorithm is quite efficient for a wide variety of input distributions, even when used as an exact algorithm. }, keywords = {Approximation algorithms, least median-of-squares regression, line arrangements, line fitting, randomized algorithms, robust estimation}, isbn = {0167-9473}, doi = {10.1016/j.csda.2006.08.033}, url = {http://www.sciencedirect.com/science/article/pii/S0167947306002921}, author = {Mount, Dave and Netanyahu,Nathan S. and Romanik,Kathleen and Silverman,Ruth and Wu,Angela Y.} } @article {17850, title = {Principles for designing data-/compute-intensive distributed applications and middleware systems for heterogeneous environments}, journal = {Journal of Parallel and Distributed Computing}, volume = {67}, year = {2007}, month = {2007/07//}, pages = {755 - 771}, abstract = {The nature of distributed systems is constantly and steadily changing as the hardware and software landscape evolves. Porting applications and adapting existing middleware systems to ever changing computational platforms has become increasingly complex and expensive. Therefore, the design of applications, as well as the design of next generation middleware systems, must follow a set of guiding principles in order to insure long-term {\textquotedblleft}survivability{\textquotedblright} without costly re-engineering. From our practical experience, the key determinants to success in this endeavor are adherence to the following principles: (1) Design for change; (2) Provide for storage subsystem I/O coordination; (3) Employ workload partitioning and load balancing techniques; (4) Employ caching; (5) Schedule the workload; and (6) Understand the workload. In order to support these principles, we have collected extensive experimental results comparing three middleware systems targeted at data- and compute-intensive applications implemented by our research group during the course of the last decade, on a single data- and compute-intensive application. The main contribution of this work is the analysis of a level playing field, where we discuss and quantify how adherence to these guiding principles impacts overall system throughput and response time.}, keywords = {Computational science applications, Data-/compute-intensive applications, Heterogeneous environments, Middleware systems}, isbn = {0743-7315}, doi = {10.1016/j.jpdc.2007.04.006}, url = {http://www.sciencedirect.com/science/article/pii/S0743731507000603}, author = {Kim,Jik-Soo and Andrade,Henrique and Sussman, Alan} } @conference {18886, title = {Probabilistic go theories}, year = {2007}, month = {2007///}, abstract = {There are numerous cases where we need to rea- son about vehicles whose intentions and itineraries are not known in advance to us. For example, Coast Guard agents tracking boats don{\textquoteright}t always know where they are headed. Likewise, in drug en- forcement applications, it is not always clear where drug-carrying airplanes (which do often show up on radar) are headed, and how legitimate planes with an approved flight manifest can avoid them. Likewise, traffic planners may want to understand how many vehicles will be on a given road at a given time. Past work on reasoning about vehi- cles (such as the {\textquotedblleft}logic of motion{\textquotedblright} by Yaman et. al. [Yaman et al., 2004]) only deals with vehicles whose plans are known in advance and don{\textquoteright}t cap- ture such situations. In this paper, we develop a for- mal probabilistic extension of their work and show that it captures both vehicles whose itineraries are known, and those whose itineraries are not known. We show how to correctly answer certain queries against a set of statements about such vehicles. A prototype implementation shows our system to work efficiently in practice.}, url = {http://www.aaai.org/Papers/IJCAI/2007/IJCAI07-079.pdf}, author = {Parker,A. and Yaman,F. and Nau, Dana S. and V.S. Subrahmanian} } @conference {13397, title = {Probabilistic graphical models and their role in databases}, booktitle = {Proceedings of the 33rd international conference on Very large data bases}, series = {VLDB {\textquoteright}07}, year = {2007}, month = {2007///}, pages = {1435 - 1436}, publisher = {VLDB Endowment}, organization = {VLDB Endowment}, abstract = {Probabilistic graphical models provide a framework for compact representation and efficient reasoning about the joint probability distribution of several interdependent variables. This is a classical topic with roots in statistical physics. In recent years, spurred by several applications in unstructured data integration, sensor networks, image processing, bio-informatics, and code design, the topic has received renewed interest in the machine learning, data mining, and database communities. Techniques from graphical models have also been applied to many topics directly of interest to the database community including information extraction, sensor data analysis, imprecise data representation and querying, selectivity estimation for query optimization, and data privacy. As database research continues to expand beyond the confines of traditional enterprise domains, we expect both the need and applicability of probabilistic graphical models to increase dramatically over the next few years. With this tutorial, we are aiming to provide a foundational overview of probabilistic graphical models to the database community, accompanied by a brief overview of some of the recent research literature on the role of graphical models in databases.}, isbn = {978-1-59593-649-3}, url = {http://dl.acm.org/citation.cfm?id=1325851.1326038}, author = {Deshpande, Amol and Sarawagi,Sunita} } @article {14366, title = {Probabilistic interval XML}, journal = {ACM Transactions on Computational Logic (TOCL)}, volume = {8}, year = {2007}, month = {2007/08//}, abstract = {Interest in XML databases has been expanding rapidly over the last few years. In this paper, we study the problem of incorporating probabilistic information into XML databases. We propose the Probabilistic Interval XML (PIXML for short) data model in this paper. Using this data model, users can express probabilistic information within XML markups. In addition, we provide two alternative formal model-theoretic semantics for PIXML data. The first semantics is a {\textquotedblleft}global{\textquotedblright} semantics which is relatively intuitive, but is not directly amenable to computation. The second semantics is a {\textquotedblleft}local{\textquotedblright} semantics which supports efficient computation. We prove several correspondence results between the two semantics. To our knowledge, this is the first formal model theoretic semantics for probabilistic interval XML. We then provide an operational semantics that may be used to compute answers to queries and that is correct for a large class of probabilistic instances.}, keywords = {Semistructured Databases, XML}, isbn = {1529-3785}, doi = {10.1145/1276920.1276926}, url = {http://doi.acm.org/10.1145/1276920.1276926}, author = {Hung,Edward and Getoor, Lise and V.S. Subrahmanian} } @inbook {18418, title = {Protocols in the use of empirical software engineering artifacts}, booktitle = {Empirical Software EngineeringEmpirical Software Engineering}, volume = {12}, year = {2007}, month = {2007///}, pages = {107 - 119}, publisher = {Springer}, organization = {Springer}, abstract = {If empirical software engineering is to grow as a valid scientific endeavor, the ability to acquire, use, share, and compare data collected from a variety of sources must be encouraged. This is necessary to validate the formal models being developed within computer science. However, within the empirical software engineering community this has not been easily accomplished. This paper analyses experiences from a number of projects, and defines the issues, which include the following: (1) How should data, testbeds, and artifacts be shared? (2) What limits should be placed on who can use them and how? How does one limit potential misuse? (3) What is the appropriate way to credit the organization and individual that spent the effort collecting the data, developing the testbed, and building the artifact? (4) Once shared, who owns the evolved asset? As a solution to these issues, the paper proposes a framework for an empirical software engineering artifact agreement. Such an agreement is intended to address the needs for both creator and user of such artifacts and should foster a market in making available and using such artifacts. If this framework for sharing software engineering artifacts is commonly accepted, it should encourage artifact owners to make the artifacts accessible to others (gaining credit is more likely and misuse is less likely). It may be easier for other researchers to request artifacts since there will be a well-defined protocol for how to deal with relevant matters.}, author = {Basili, Victor R. and Zelkowitz, Marvin V and Sj{\o}berg,D. I.K and Johnson,P. and Cowling,A. J} } @article {17644, title = {Provable algorithms for joint optimization of transport, routing and MAC layers in wireless ad hoc networks}, journal = {Proc. DialM-POMC Workshop on Foundations of Mobile Computing}, year = {2007}, month = {2007///}, author = {Kumar,V. S.A and Marathe,M. V and Parthasarathy,S. and Srinivasan, Aravind} } @article {15790, title = {QCS: A system for querying, clustering and summarizing documents}, journal = {Information Processing \& Management}, volume = {43}, year = {2007}, month = {2007/11//}, pages = {1588 - 1605}, abstract = {Information retrieval systems consist of many complicated components. Research and development of such systems is often hampered by the difficulty in evaluating how each particular component would behave across multiple systems. We present a novel integrated information retrieval system{\textemdash}the Query, Cluster, Summarize (QCS) system{\textemdash}which is portable, modular, and permits experimentation with different instantiations of each of the constituent text analysis components. Most importantly, the combination of the three types of methods in the QCS design improves retrievals by providing users more focused information organized by topic.We demonstrate the improved performance by a series of experiments using standard test sets from the Document Understanding Conferences (DUC) as measured by the best known automatic metric for summarization system evaluation, ROUGE. Although the DUC data and evaluations were originally designed to test multidocument summarization, we developed a framework to extend it to the task of evaluation for each of the three components: query, clustering, and summarization. Under this framework, we then demonstrate that the QCS system (end-to-end) achieves performance as good as or better than the best summarization engines. Given a query, QCS retrieves relevant documents, separates the retrieved documents into topic clusters, and creates a single summary for each cluster. In the current implementation, Latent Semantic Indexing is used for retrieval, generalized spherical k-means is used for the document clustering, and a method coupling sentence {\textquotedblleft}trimming{\textquotedblright} and a hidden Markov model, followed by a pivoted QR decomposition, is used to create a single extract summary for each cluster. The user interface is designed to provide access to detailed information in a compact and useful format. Our system demonstrates the feasibility of assembling an effective IR system from existing software libraries, the usefulness of the modularity of the design, and the value of this particular combination of modules. }, keywords = {clustering, Information retrieval, latent semantic indexing, Sentence trimming, Summarization, TEXT PROCESSING}, isbn = {0306-4573}, doi = {10.1016/j.ipm.2007.01.003}, url = {http://www.sciencedirect.com/science/article/pii/S0306457307000246}, author = {Dunlavy,Daniel M. and O{\textquoteright}Leary,Dianne P. and Conroy,John M. and Schlesinger,Judith D.} } @inbook {17646, title = {Randomized Algorithms and Probabilistic Analysis in Wireless Networking}, booktitle = {Stochastic Algorithms: Foundations and ApplicationsStochastic Algorithms: Foundations and Applications}, series = {Lecture Notes in Computer Science}, volume = {4665}, year = {2007}, month = {2007///}, pages = {54 - 57}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {Devices connected wirelessly, in various forms including computers, hand-held devices, ad hoc networks, and embedded systems, are expected to become ubiquitous all around us. Wireless networks pose interesting new challenges, some of which do not arise in standard (wired) networks. This survey discusses some key probabilistic notions {\textendash} both randomized algorithms and probabilistic analysis {\textendash} in wireless networking.}, isbn = {978-3-540-74870-0}, url = {http://dx.doi.org/10.1007/978-3-540-74871-7_5}, author = {Srinivasan, Aravind}, editor = {Hromkovic,Juraj and Kr{\'a}lovic,Richard and Nunkesser,Marc and Widmayer,Peter} } @article {15476, title = {Reliable Effects Screening: A Distributed Continuous Quality Assurance Process for Monitoring Performance Degradation in Evolving Software Systems}, journal = {Software Engineering, IEEE Transactions on}, volume = {33}, year = {2007}, month = {2007/02//}, pages = {124 - 141}, abstract = {Developers of highly configurable performance-intensive software systems often use in-house performance-oriented "regression testing" to ensure that their modifications do not adversely affect their software{\textquoteright}s performance across its large configuration space. Unfortunately, time and resource constraints can limit in-house testing to a relatively small number of possible configurations, followed by unreliable extrapolation from these results to the entire configuration space. As a result, many performance bottlenecks escape detection until systems are fielded. In our earlier work, we improved the situation outlined above by developing an initial quality assurance process called "main effects screening". This process 1) executes formally designed experiments to identify an appropriate subset of configurations on which to base the performance-oriented regression testing, 2) executes benchmarks on this subset whenever the software changes, and 3) provides tool support for executing these actions on in-the-field and in-house computing resources. Our initial process had several limitations, however, since it was manually configured (which was tedious and error-prone) and relied on strong and untested assumptions for its accuracy (which made its use unacceptably risky in practice). This paper presents a new quality assurance process called "reliable effects screening" that provides three significant improvements to our earlier work. First, it allows developers to economically verify key assumptions during process execution. Second, it integrates several model-driven engineering tools to make process configuration and execution much easier and less error prone. Third, we evaluate this process via several feasibility studies of three large, widely used performance-intensive software frameworks. Our results indicate that reliable effects screening can detect performance degradation in large-scale systems more reliably and with significantly less resources than conventional t- echniques}, keywords = {configuration subset, distributed continuous quality assurance process, evolving software systems, in house testing, main effects screening, performance bottlenecks, performance degradation monitoring, performance intensive software systems, process configuration, process execution, program testing, regression testing, reliable effects screening, software benchmarks, Software performance, software performance evaluation, Software quality, software reliability, tool support}, isbn = {0098-5589}, doi = {10.1109/TSE.2007.20}, author = {Yilmaz,C. and Porter, Adam and Krishna,A. S and Memon, Atif M. and Schmidt,D. C and Gokhale,A.S. and Natarajan,B.} } @conference {13401, title = {Representing and Querying Correlated Tuples in Probabilistic Databases}, booktitle = {Data Engineering, 2007. ICDE 2007. IEEE 23rd International Conference on}, year = {2007}, month = {2007///}, pages = {596 - 605}, publisher = {IEEE}, organization = {IEEE}, abstract = {Probabilistic databases have received considerable attention recently due to the need for storing uncertain data produced by many real world applications. The widespread use of probabilistic databases is hampered by two limitations: (1) current probabilistic databases make simplistic assumptions about the data (e.g., complete independence among tuples) that make it difficult to use them in applications that naturally produce correlated data, and (2) most probabilistic databases can only answer a restricted subset of the queries that can be expressed using traditional query languages. We address both these limitations by proposing a framework that can represent not only probabilistic tuples, but also correlations that may be present among them. Our proposed framework naturally lends itself to the possible world semantics thus preserving the precise query semantics extant in current probabilistic databases. We develop an efficient strategy for query evaluation over such probabilistic databases by casting the query processing problem as an inference problem in an appropriately constructed probabilistic graphical model. We present several optimizations specific to probabilistic databases that enable efficient query evaluation. We validate our approach by presenting an experimental evaluation that illustrates the effectiveness of our techniques at answering various queries using real and synthetic datasets.}, isbn = {1-4244-0802-4}, doi = {10.1109/ICDE.2007.367905}, url = {zotero://attachment/12299/}, author = {Sen,Prithviraj and Deshpande, Amol} } @conference {13402, title = {Representing Tuple and Attribute Uncertainty in Probabilistic Databases}, booktitle = {Seventh IEEE International Conference on Data Mining Workshops, 2007. ICDM Workshops 2007}, year = {2007}, month = {2007/10/28/31}, pages = {507 - 512}, publisher = {IEEE}, organization = {IEEE}, abstract = {There has been a recent surge in work in probabilistic databases, propelled in large part by the huge increase in noisy data sources-sensor data, experimental data, data from uncurated sources, and many others. There is a growing need to be able to flexibly represent the uncertainties in the data, and to efficiently query the data. Building on existing probabilistic database work, we present a unifying framework which allows a flexible representation of correlated tuple and attribute level uncertainties. An important capability of our representation is the ability to represent shared correlation structures in the data. We provide motivating examples to illustrate when such shared correlation structures are likely to exist. Representing shared correlations structures allows the use of sophisticated inference techniques based on lifted probabilistic inference that, in turn, allows us to achieve significant speedups while computing probabilities for results of user-submitted queries.}, keywords = {attribute uncertainty, Computer science, Conferences, correlation structures, data mining, Data models, database management systems, Educational institutions, inference mechanisms, noisy data sources, probabilistic database, probabilistic inference, Probability distribution, Query processing, Relational databases, Sensor phenomena and characterization, tuple representation, Uncertainty, uncertainty handling}, isbn = {978-0-7695-3019-2}, doi = {10.1109/ICDMW.2007.11}, author = {Sen,P. and Deshpande, Amol and Getoor, Lise} } @article {17678, title = {A Residual Inverse Power Method}, volume = {UMIACS-TR-2007-09}, year = {2007}, month = {2007/02//}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {The inverse power method involves solving shifted equations of theform $(A -\sigma I)v = u$. This paper describes a variant method in which shifted equations may be solved to a fixed reduced accuracy without affecting convergence. The idea is to alter the right-hand side to produce a correction step to be added to the current approximations. The digits of this step divide into two parts: leading digits that correct the solution and trailing garbage. Hence the step can be be evaluated to a reduced accuracy corresponding to the correcting digits. The cost is an additional multiplication by $A$ at each step to generate the right-hand side. Analysis and experiments show that the method is suitable for normal and mildly nonnormal problems. }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/4260}, author = {Stewart, G.W.} } @conference {12250, title = {Robust Routing with Unknown Traffic Matrices}, booktitle = {INFOCOM 2007. 26th IEEE International Conference on Computer Communications. IEEE}, year = {2007}, month = {2007/05//}, pages = {2436 - 2440}, abstract = {In this paper, we present an algorithm for intra-domain traffic engineering. We assume that the traffic matrix, which specifies traffic load between every source-destination pair in the network, is unknown and varies with time, but that always lies inside an explicitly defined region. Our goal is to compute a fixed robust routing with best worst case performance for all traffic matrices inside the bounding region. We formulate this problem as a semi-infinite programming problem. Then, we focus on a special case with practical merits, where (1) the traffic matrix region is assumed to be a polytope specified by a finite set of linear inequalities, and (2) our objective is to find the routing that minimizes the maximum link utilization. Under these assumptions, the problem can be formulated as a polynomial size linear programming (LP) problem with finite number of constraints. We further consider two specific set of constraints for the traffic matrix region. The first set is based on the hose model and limits the total traffic rate of network point of presence (PoP) nodes. The second set is based on the pipe model and limits the traffic between source-destination pairs. We study the effectiveness of each set of constraints using extensive simulations.}, keywords = {engineering;linear, inequalities;maximum, intradomain, linear, link, matrices;linear, matrix, network, nodes;polynomial, of, point, presence, problem;traffic, Programming, programming;semiinfinite, programming;telecommunication, region;unknown, routing;telecommunication, size, traffic, traffic;, utilization;network}, doi = {10.1109/INFCOM.2007.296}, author = {Tabatabaee,V. and Kashyap,A. and Bhattacharjee, Bobby and La,R.J. and Shayman,M.A.} } @article {18269, title = {Robust scanner identification based on noise features}, journal = {Proc. SPIE, Electronic Imaging, Security, Steganography, and Watermarking of Multimedia Contents IX}, volume = {6505}, year = {2007}, month = {2007///}, pages = {0S{\textendash}0T - 0S{\textendash}0T}, abstract = {A large portion of digital image data available today is acquired using digital cameras or scanners. While camerasallow digital reproduction of natural scenes, scanners are often used to capture hardcopy art in more controlled scenarios. This paper proposes a new technique for non-intrusive scanner model identification, which can be further extended to perform tampering detection on scanned images. Using only scanned image samples that contain arbitrary content, we construct a robust scanner identifier to determine the brand/model of the scanner used to capture each scanned image. The proposed scanner identifier is based on statistical features of scanning noise. We first analyze scanning noise from several angles, including through image de-noising, wavelet analysis, and neighborhood prediction, and then obtain statistical features from each characterization. Experimental results demonstrate that the proposed method can effectively identify the correct scanner brands/models with high accuracy. }, author = {Gou,H. and Swaminathan,A. and Wu,M.} } @conference {12574, title = {Robust Visual Tracking Using the Time-Reversibility Constraint}, booktitle = {Computer Vision, 2007. ICCV 2007. IEEE 11th International Conference on}, year = {2007}, month = {2007/10//}, pages = {1 - 8}, abstract = {Visual tracking is a very important front-end to many vision applications. We present a new framework for robust visual tracking in this paper. Instead of just looking forward in the time domain, we incorporate both forward and backward processing of video frames using a novel time-reversibility constraint. This leads to a new minimization criterion that combines the forward and backward similarity functions and the distances of the state vectors between the forward and backward states of the tracker. The new framework reduces the possibility of the tracker getting stuck in local minima and significantly improves the tracking robustness and accuracy. Our approach is general enough to be incorporated into most of the current tracking algorithms. We illustrate the improvements due to the proposed approach for the popular KLT tracker and a search based tracker. The experimental results show that the improved KLT tracker significantly outperforms the original KLT tracker. The time-reversibility constraint used for tracking can be incorporated to improve the performance of optical flow, mean shift tracking and other algorithms.}, keywords = {backward, constraint;video, criterion;state, forward, frame, KLT, processing;, processing;video, processing;visual, signal, tracker;minimization, tracking;minimisation;video, vectors;time-reversibility}, doi = {10.1109/ICCV.2007.4408956}, author = {Wu,Hao and Chellapa, Rama and Sankaranarayanan,A. C and Zhou,S. K} } @article {12255, title = {SAAR: A shared control plane for overlay multicast}, journal = {Proceedings of 4th USENIX Symposium on Networked Systems Design \& Implementation}, year = {2007}, month = {2007///}, pages = {57 - 72}, abstract = {Many cooperative overlay multicast systems of diverse designs have been implemented and deployed. In this paper, we explore a new architecture for overlay multicast: we factor out the control plane into a separate overlay that provides a single primitive: a configurable anycast for peer selection. This separation of control and data overlays has several advantages. Data overlays can be optimized for efficient content delivery, while the control overlay can be optimized for flexible and efficient peer selection. Several data channels can share a control plane for fast switching among content channels, which is particularly important for IPTV. And, the control overlay can be reused in multicast systems with different data plane organizations.We designed and evaluated a decentralized control overlay for endsystem multicast. The overlay proactively aggregates system state and implements a powerful anycast primitive for peer selection. We demonstrate that SAAR{\textquoteright}s efficiency in locating peers reduces channel switching time, improves the quality of content delivery, and reduces overhead, even under dynamic conditions and at scale. An experimental evaluation demonstrates that the system can efficiently support single-tree, multi-tree and block-based multicast systems. }, author = {Nandi,A. and Ganjam,A. and Druschel,P. and Ng,T. S.E and Stoica,I. and Zhang,H. and Bhattacharjee, Bobby} } @book {17768, title = {Scalable Uncertainty Management: First International Conference, SUM 2007, Washington, DC, USA, October 10-12, 2007 : Proceedings}, year = {2007}, month = {2007/11/14/}, publisher = {Springer}, organization = {Springer}, abstract = {This book constitutes the refereed proceedings of the First International Conference on Scalable Uncertainty Management, SUM 2007, held in Washington, DC, USA, in Oktober 2007.The 20 revised full papers presented were carefully reviewed and selected from numerous submissions for inclusion in the book. The papers address artificial intelligence researchers, database researchers, and practitioners to demonstrate theoretical techniques required to manage the uncertainty that arises in large scale real world applications. The papers deal with the following topics: uncertainty models, probabilistic logics, fuzzy logics, and annotated logics, inconsistency logics, database algebras and calculi, scalable database systems, spatial, temporal, mobile and multimedia databases, as well as implementations, and applications.}, keywords = {Artificial intelligence, Computers / Information Theory, Computers / Intelligence (AI) \& Semantics, Electronic books, Mathematics / Logic, Uncertainty (Information theory)}, isbn = {9783540754077}, author = {Prade,Henri and V.S. Subrahmanian} } @conference {14544, title = {Scheduling to minimize gaps and power consumption}, booktitle = {Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures}, year = {2007}, month = {2007///}, pages = {46 - 54}, author = {Demaine,E. D and Ghodsi,M. and Hajiaghayi, Mohammad T. and Sayedi-Roshkhar,A. S and Zadimoghaddam,M.} } @article {12248, title = {A Secure DHT via the Pigeonhole Principle}, journal = {Technical Reports of the Computer Science Department, CS-TR-4884}, year = {2007}, month = {2007/09/24/}, abstract = {The standard Byzantine attack model assumes no more than some fixedfraction of the participants are faulty. This assumption does not accurately apply to peer-to-peer settings, where Sybil attacks and botnets are realistic threats. We propose an attack model that permits an arbitrary number of malicious nodes under the assumption that each node can be classified based on some of its attributes, such as autonomous system number or operating system, and that the number of classes with malicious nodes is bounded (e.g., an attacker may exploit at most a few operating systems at a time). In this model, we present a secure DHT, evilTwin, which replaces a single, large DHT with sufficiently many smaller instances such that it is impossible for an adversary to corrupt every instance. Our system ensures high availability and low-latency lookups, is easy to implement, does not require a complex Byzantine agreement protocol, and its proof of security is a straightforward application of the pigeonhole principle. The cost of security comes in the form of increased storage and bandwidth overhead; we show how to reduce these costs by replicating data and adaptively querying participants who historically perform well. We use implementation and simulation to show that evilTwin imposes a relatively small additional cost compared to conventional DHTs. }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/7136}, author = {Baden,Randy and Bender,Adam and Levin,Dave and Sherwood,Rob and Spring, Neil and Bhattacharjee, Bobby} } @article {15471, title = {Semantics-Preserving Design of Embedded Control Software from Synchronous Models}, journal = {Software Engineering, IEEE Transactions on}, volume = {33}, year = {2007}, month = {2007/08//}, pages = {497 - 509}, abstract = {The design of embedded controllers is experiencing a growth in complexity as embedded systems increase their functionality while they become ubiquitous in electronic appliances, cars, airplanes, etc. As requirements become more challenging, mathematical models gain importance for mastering complexity. Among the different computational models proposed, synchronous models have proved to be the most widely used for control dominated applications. While synchronous models simplify the way of dealing with concurrency by decoupling functional and timing aspects, their software implementation on multitasking and multiprocessor platforms is far from straightforward, because of the asynchronous nature of most industrial software platforms. Known solutions in the literature either restrict the solution space or focus on special cases. We present a method for preserving the synchronous semantics through buffer-based intertask communication mechanisms, grounded on an abstraction of the target platform. This allows us to deal with any task set and, most importantly, being independent of the implementation, to explore the design space effectively.}, keywords = {embedded control software, embedded systems, multiprocessing programs, multiprocessor, multitasking, semantics-preserving design, software engineering, software implementation, systems analysis}, isbn = {0098-5589}, doi = {10.1109/TSE.2007.70718}, author = {Mangeruca,L. and Baleani,M. and Ferrari,A. and Sangiovanni-Vincentelli,A.} } @article {12196, title = {Semi-automatic photo annotation strategies using event based clustering and clothing based person recognition}, journal = {Interacting with Computers}, volume = {19}, year = {2007}, month = {2007///}, pages = {524 - 544}, author = {Suh,B. and Bederson, Benjamin B.} } @article {15777, title = {On Sensitivity of Gauss-Christoffel Quadrature}, journal = {Numerische Mathematik}, volume = {107}, year = {2007}, month = {2007///}, pages = {147 - 174}, abstract = {In numerical computations the question how much does a function change under perturbations of its arguments is of central importance. In this work, we investigate sensitivity of Gauss{\textendash}Christoffel quadrature with respect to small perturbations of the distribution function. In numerical quadrature, a definite integral is approximated by a finite sum of functional values evaluated at given quadrature nodes and multiplied by given weights. Consider a sufficiently smooth integrated function uncorrelated with the perturbation of the distribution function. Then it seems natural that given the same number of function evaluations, the difference between the quadrature approximations is of the same order as the difference between the (original and perturbed) approximated integrals. That is perhaps one of the reasons why, to our knowledge, the sensitivity question has not been formulated and addressed in the literature, though several other sensitivity problems, motivated, in particular, by computation of the quadrature nodes and weights from moments, have been thoroughly studied by many authors. We survey existing particular results and show that even a small perturbation of a distribution function can cause large differences in Gauss{\textendash}Christoffel quadrature estimates. We then discuss conditions under which the Gauss{\textendash}Christoffel quadrature is insensitive under perturbation of the distribution function, present illustrative examples, and relate our observations to known conjectures on some sensitivity problems.}, url = {doi:10.1007/s00211-007-0078-xdoi:10.1007/s00211-007-0078-x}, author = {O{\textquoteright}Leary, Dianne P. and Strako{\v s},Zden{\v e}k and Tich{\'y},Petr} } @conference {17780, title = {Sentiment analysis: Adjectives and adverbs are better than adjectives alone}, booktitle = {Proceedings of the International Conference on Weblogs and Social Media (ICWSM)}, year = {2007}, month = {2007///}, abstract = {Most past work on determining the strength of subjective expres-sions within a sentence or a document use specific parts of speech such as adjectives, verbs and nouns. To date, there is almost no work on the use of adverbs in sentiment analysis, nor has there been any work on the use of adverb-adjective combinations (AACs). We propose an AAC-based sentiment analysis technique that uses a lin- guistic analysis of adverbs of degree. We define a set of general axioms (based on a classification of adverbs of degree into five cat- egories) that all adverb scoring techniques must satisfy. Instead of aggregating scores of both adverbs and adjectives using simple scor- ing functions, we propose an axiomatic treatment of AACs based on the linguistic classification of adverbs. Three specific AAC scor- ing methods that satisfy the axioms are presented. We describe the results of experiments on an annotated set of 200 news articles (an- notated by 10 students) and compare our algorithms with some exist- ing sentiment analysis algorithms. We show that our results lead to higher accuracy based on Pearson correlation with human subjects. }, author = {Benamara,F. and Cesarano,C. and Picariello, A. and Reforgiato,D. and V.S. Subrahmanian} } @conference {18160, title = {A Signal Processing and Randomization Perspective of Robust and Secure Image Hashing}, booktitle = {Statistical Signal Processing, 2007. SSP {\textquoteright}07. IEEE/SP 14th Workshop on}, year = {2007}, month = {2007/08//}, pages = {166 - 170}, abstract = {An image hash is a content-based compact representation of an image and finds applications in image authentication, watermarking, and image similarity comparison. This paper reviews representative approaches developed by the research community in constructing robust and secure image hash. A unified framework and case studies on representative image hash schemes are presented to demonstrate important roles of signal processing and controlled randomization in constructing and evaluating robust and secure hashing for visual data.}, doi = {10.1109/SSP.2007.4301240}, author = {M. Wu and Mao,Yinian and Swaminathan,Ashwin} } @conference {17360, title = {Similarity-Based Forecasting with Simultaneous Previews: A River Plot Interface for Time Series Forecasting}, booktitle = {Information Visualization, 2007. IV {\textquoteright}07. 11th International Conference}, year = {2007}, month = {2007/07/04/6}, pages = {191 - 196}, publisher = {IEEE}, organization = {IEEE}, abstract = {Time-series forecasting has a large number of applications. Users with a partial time series for auctions, new stock offerings, or industrial processes desire estimates of the future behavior. We present a data driven forecasting method and interface called similarity-based forecasting (SBF). A pattern matching search in an historical time series dataset produces a subset of curves similar to the partial time series. The forecast is displayed graphically as a river plot showing statistical information about the SBF subset. A forecasting preview interface allows users to interactively explore alternative pattern matching parameters and see multiple forecasts simultaneously. User testing with 8 users demonstrated advantages and led to improvements.}, keywords = {data driven forecasting method, data visualisation, Data visualization, Economic forecasting, forecasting preview interface, Graphical user interfaces, historical time series dataset, Laboratories, new stock offerings, partial time series, pattern matching, pattern matching search, Predictive models, river plot interface, Rivers, similarity-based forecasting, Smoothing methods, Technological innovation, Testing, time series, time series forecasting, Weather forecasting}, isbn = {0-7695-2900-3}, doi = {10.1109/IV.2007.101}, author = {Buono,P. and Plaisant, Catherine and Simeone,A. and Aris,A. and Shneiderman, Ben and Shmueli,G. and Jank,W.} } @article {15475, title = {Skoll: A Process and Infrastructure for Distributed Continuous Quality Assurance}, journal = {Software Engineering, IEEE Transactions on}, volume = {33}, year = {2007}, month = {2007/08//}, pages = {510 - 525}, abstract = {Software engineers increasingly emphasize agility and flexibility in their designs and development approaches. They increasingly use distributed development teams, rely on component assembly and deployment rather than green field code writing, rapidly evolve the system through incremental development and frequent updating, and use flexible product designs supporting extensive end-user customization. While agility and flexibility have many benefits, they also create an enormous number of potential system configurations built from rapidly changing component implementations. Since today{\textquoteright}s quality assurance (QA) techniques do not scale to handle highly configurable systems, we are developing and validating novel software QA processes and tools that leverage the extensive computing resources of user and developer communities in a distributed, continuous manner to improve software quality significantly. This paper provides several contributions to the study of distributed, continuous QA (DCQA). First, it shows the structure and functionality of Skoll, which is an environment that defines a generic around-the-world, around-the-clock QA process and several sophisticated tools that support this process. Second, it describes several novel QA processes built using the Skoll environment. Third, it presents two studies using Skoll: one involving user testing of the Mozilla browser and another involving continuous build, integration, and testing of the ACE+TAO communication software package. The results of our studies suggest that the Skoll environment can manage and control distributed continuous QA processes more effectively than conventional QA processes. For example, our DCQA processes rapidly identified problems that had taken the ACE+TAO developers much longer to find and several of which they had not found. Moreover, the automatic analysis of QA results provided developers information that enabled them to quickly find the root causes of problems}, keywords = {ACE+TAO communication software package, component assembly, component deployment, distributed continuous quality assurance, distributed development teams, distributed processing, end-user customization, flexible product design, incremental development, object-oriented programming, Skoll, software engineering, Software quality, systems analysis}, isbn = {0098-5589}, doi = {10.1109/TSE.2007.70719}, author = {Porter, Adam and Yilmaz,C. and Memon, Atif M. and Schmidt,D. C and Natarajan,B.} } @conference {16299, title = {Software configuration management using ontologies}, booktitle = {3rd International Workshop on Semantic Web Enabled Software Engineering (SWESE 2007), Innsubruk, Austria}, year = {2007}, month = {2007///}, author = {Shahri,H. H and Hendler,J. A and Porter, Adam} } @conference {17775, title = {Soma models of the behaviors of stakeholders in the afghan drug economy: A preliminary report}, booktitle = {Proc. 2007 Intl. Conf. on Computational Cultural Dynamics}, year = {2007}, month = {2007///}, pages = {78 - 86}, abstract = {Most cultural reasoning today is done by anthropologists andsociologists who use their detailed knowledge of culture to make predictions about how a given group will respond to a given situation. The main problem with this is that experts in a particular culture or subculture are few and not readily accessible to the many who might suddenly need to tap their expertise (e.g. in cases of war or conflict). In this paper, we briefly describe how the SOMA (Stochastic Opponent Mod- eling Agents) paradigm proposed by the authors can and has been used to model the behaviors of various stake-holders in the drug trade in Afghanistan. }, author = {Sliva,A. and Martinez,V. and Simari,G. I and V.S. Subrahmanian} } @conference {16856, title = {Sorting in space: multidimensional, spatial, and metric data structures for computer graphics applications}, booktitle = {International Conference on Computer Graphics and Interactive Techniques}, year = {2007}, month = {2007///}, author = {Samet, Hanan} } @article {16849, title = {Spatial join techniques}, journal = {ACM Trans. Database Syst.}, volume = {32}, year = {2007}, month = {2007/03//}, abstract = {A variety of techniques for performing a spatial join are reviewed. Instead of just summarizing the literature and presenting each technique in its entirety, distinct components of the different techniques are described and each is decomposed into an overall framework for performing a spatial join. A typical spatial join technique consists of the following components: partitioning the data, performing internal-memory spatial joins on subsets of the data, and checking if the full polygons intersect. Each technique is decomposed into these components and each component addressed in a separate section so as to compare and contrast similar aspects of each technique. The goal of this survey is to describe the algorithms within each component in detail, comparing and contrasting competing methods, thereby enabling further analysis and experimentation with each component and allowing the best algorithms for a particular situation to be built piecemeal, or, even better, enabling an optimizer to choose which algorithms to use.}, keywords = {external memory algorithms, plane-sweep, Spatial join}, isbn = {0362-5915}, doi = {10.1145/1206049.1206056}, url = {http://doi.acm.org/10.1145/1206049.1206056}, author = {Jacox,Edwin H. and Samet, Hanan} } @conference {16859, title = {STEWARD: architecture of a spatio-textual search engine}, booktitle = {Proceedings of the 15th annual ACM international symposium on Advances in geographic information systems}, series = {GIS {\textquoteright}07}, year = {2007}, month = {2007///}, pages = {25:1{\textendash}25:8 - 25:1{\textendash}25:8}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {STEWARD ("Spatio-Textual Extraction on the Web Aiding Retrieval of Documents"), a system for extracting, querying, and visualizing textual references to geographic locations in unstructured text documents, is presented. Methods for retrieving and processing web documents, extracting and disambiguating georeferences, and identifying geographic focus are described. A brief overview of STEWARD{\textquoteright}s querying capabilities, as well as the design of an intuitive user interface, are provided. Finally, several application scenarios and future extensions to STEWARD are discussed.}, keywords = {geocoding, spatio-textual search engine, STEWARD}, isbn = {978-1-59593-914-2}, doi = {10.1145/1341012.1341045}, url = {http://doi.acm.org/10.1145/1341012.1341045}, author = {Lieberman,Michael D. and Samet, Hanan and Sankaranarayanan,Jagan and Sperling,Jon} } @conference {16855, title = {STEWARD: demo of spatio-textual extraction on the web aiding the retrieval of documents}, booktitle = {Proceedings of the 8th annual international conference on Digital government research: bridging disciplines \& domains}, series = {dg.o {\textquoteright}07}, year = {2007}, month = {2007///}, pages = {300 - 301}, publisher = {Digital Government Society of North America}, organization = {Digital Government Society of North America}, abstract = {A spatio-textual search engine, termed "STEWARD" is demonstrated where document similarity is based on both the textual similarity as well as the spatial proximity of the locations in the document to the spatial search input. STEWARD{\textquoteright}s performance is enhanced by the presence of a document tagger that is able to identify textual references to geographical entities. The user-interface of STEWARD provides the ability to browse results, thereby making it a valuable "knowledge discovery" tool.}, keywords = {geocoding, spatio-textual search engine, STEWARD}, isbn = {1-59593-599-1}, url = {http://dl.acm.org/citation.cfm?id=1248460.1248529}, author = {Samet, Hanan and Lieberman,Michael D. and Sankaranarayanan,Jagan and Sperling,Jon} } @article {15688, title = {Storage routing for dtn congestion control}, journal = {Wireless communications and mobile computing}, volume = {7}, year = {2007}, month = {2007///}, pages = {1183 - 1196}, author = {Seligman,M. and Fall,K. and Mundur, Padma} } @article {17779, title = {Story creation from heterogeneous data sources}, journal = {Multimedia Tools and Applications}, volume = {33}, year = {2007}, month = {2007///}, pages = {351 - 377}, abstract = {There are numerous applications where there is a need to rapidly infer a story about a given subject from a given set of potentially heterogeneous data sources. In this paper, we formally define a story to be a set of facts about a given subject that satisfies a {\textquotedblleft}story length{\textquotedblright} constraint. An optimal story is a story that maximizes the value of an objective function measuring the goodness of a story. We present algorithms to extract stories from text and other data sources. We also develop an algorithm to compute an optimal story, as well as three heuristic algorithms to rapidly compute a suboptimal story. We run experiments to show that constructing stories can be efficiently performed and that the stories constructed by these heuristic algorithms are high quality stories. We have built a prototype STORY system based on our model{\textemdash}we briefly describe the prototype as well as one application in this paper.}, doi = {10.1007/s11042-007-0100-4}, author = {Fayzullin,M. and V.S. Subrahmanian and Albanese, M. and Cesarano,C. and Picariello, A.} } @article {18717, title = {Structural Biology: Analysis of {\textquoteright}downhill{\textquoteright} protein folding; Analysis of protein-folding cooperativity (Reply)}, journal = {Nature}, volume = {445}, year = {2007}, month = {2007/02/15/}, pages = {E17-E18 - E17-E18}, abstract = {Ferguson et al. and Zhou and Bai criticize the quality of our nuclear magnetic resonance (NMR) data and atom-by-atom analysis of global {\textquoteright}downhill{\textquoteright} folding, also claiming that the data are compatible with two-state folding.}, keywords = {Astronomy, astrophysics, Biochemistry, Bioinformatics, Biology, biotechnology, cancer, cell cycle, cell signalling., climate change, Computational Biology, development, developmental biology, DNA, drug discovery, earth science, ecology, environmental science, Evolution, evolutionary biology, functional genomics, Genetics, Genomics, geophysics, immunology, interdisciplinary science, life, marine biology, materials science, medical research, medicine, metabolomics, molecular biology, molecular interactions, nanotechnology, Nature, neurobiology, neuroscience, palaeobiology, pharmacology, Physics, proteomics, quantum physics, RNA, Science, science news, science policy, signal transduction, structural biology, systems biology, transcriptomics}, isbn = {0028-0836}, doi = {10.1038/nature05645}, url = {http://www.nature.com/nature/journal/v445/n7129/full/nature05645.html?lang=en}, author = {Sadqi,Mourad and Fushman, David and Mu{\~n}oz,Victor} } @conference {14862, title = {A Study of Face Recognition as People Age}, booktitle = {Computer Vision, 2007. ICCV 2007. IEEE 11th International Conference on}, year = {2007}, month = {2007/10//}, pages = {1 - 8}, abstract = {In this paper we study face recognition across ages within a real passport photo verification task. First, we propose using the gradient orientation pyramid for this task. Discarding the gradient magnitude and utilizing hierarchical techniques, we found that the new descriptor yields a robust and discriminative representation. With the proposed descriptor, we model face verification as a two-class problem and use a support vector machine as a classifier. The approach is applied to two passport data sets containing more than 1,800 image pairs from each person with large age differences. Although simple, our approach outperforms previously tested Bayesian technique and other descriptors, including the intensity difference and gradient with magnitude. In addition, it works as well as two commercial systems. Second, for the first time, we empirically study how age differences affect recognition performance. Our experiments show that, although the aging process adds difficulty to the recognition task, it does not surpass illumination or expression as a confounding factor.}, keywords = {Bayesian, difference;passport, machine;face, machines;, magnitude;gradient, orientation, photo, pyramid;hierarchical, recognition;face, recognition;support, representation;face, task;support, technique;discriminative, techniques;intensity, vector, verification, verification;gradient}, doi = {10.1109/ICCV.2007.4409069}, author = {Ling,Haibin and Soatto,S. and Ramanathan,N. and Jacobs, David W.} } @article {16523, title = {Swarm Intelligence Systems Using Guided Self-Organization for Collective Problem Solving}, journal = {Advances in Complex Systems}, volume = {10}, year = {2007}, month = {2007///}, pages = {5 - 34}, author = {RodrIGuez,A. and Grushin,A. and Reggia, James A. and HAUPTMAN,AMI and SIPPER,M. and PAN,Z. and Reggia, James A. and GAO,D. and DARABOS,C. and GIACOBINI,M. and others} } @conference {17869, title = {Taking Advantage of Collective Operation Semantics for Loosely Coupled Simulations}, booktitle = {Parallel and Distributed Processing Symposium, International}, year = {2007}, month = {2007///}, pages = {128 - 128}, publisher = {IEEE Computer Society}, organization = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, abstract = {Although a loosely coupled component-based framework offers flexibility and versatility for building and deploying large-scale multi-physics simulation systems, the performance of such a system can suffer from excessive buffering of data objects which may or may not be transferred between components. By taking advantages of the collective properties of parallel simulation components, which is common for data-parallel scientific applications, an optimization method, which we call buddy-help, can greatly enhance overall performance. Buddy-Help can reduce the time taken for buffering operations in an exporting component, when there are timing differences across processes in the exporting component. The optimization enables skipping unnecessary buffering operations, once another process, which has already performed the collective export operation, has determined that the buffered data will never be needed. Because an analytical study would be very difficult due to the complexity of the overall coupled simulation system, the performance improvement enabled by buddy-help is investigated via a micro-benchmark specifically designed to illustrate the behavior of coupled simulation scenarios under which buddy-help can provide performance gains.}, isbn = {1-4244-0909-8}, doi = {http://doi.ieeecomputersociety.org/10.1109/IPDPS.2007.370318}, author = {Wu,Joe Shang-Chieh and Sussman, Alan} } @article {12587, title = {Target Tracking Using a Joint Acoustic Video System}, journal = {Multimedia, IEEE Transactions on}, volume = {9}, year = {2007}, month = {2007/06//}, pages = {715 - 727}, abstract = {In this paper, a multitarget tracking system for collocated video and acoustic sensors is presented. We formulate the tracking problem using a particle filter based on a state-space approach. We first discuss the acoustic state-space formulation whose observations use a sliding window of direction-of-arrival estimates. We then present the video state space that tracks a target{\textquoteright}s position on the image plane based on online adaptive appearance models. For the joint operation of the filter, we combine the state vectors of the individual modalities and also introduce a time-delay variable to handle the acoustic-video data synchronization issue, caused by acoustic propagation delays. A novel particle filter proposal strategy for joint state-space tracking is introduced, which places the random support of the joint filter where the final posterior is likely to lie. By using the Kullback-Leibler divergence measure, it is shown that the joint operation of the filter decreases the worst case divergence of the individual modalities. The resulting joint tracking filter is quite robust against video and acoustic occlusions due to our proposal strategy. Computer simulations are presented with synthetic and field data to demonstrate the filter{\textquoteright}s performance}, keywords = {(numerical, acoustic, adaptive, appearance, approach;synchronization;time-delay, data, delay;acoustic, divergence;acoustic, estimate;joint, estimation;hidden, feature, filter;sliding, Filtering, fusion;multitarget, fusion;synchronisation;target, highways;direction-of-arrival, Kullback-Leibler, methods);sensor, model;particle, processing;, processing;automated, propagation, removal;optical, signal, system;multimodal, tracking;acoustic, tracking;direction-of-arrival, tracking;occlusion;online, tracking;particle, tracking;video, variable;visual, video, window;state-space}, isbn = {1520-9210}, doi = {10.1109/TMM.2007.893340}, author = {Cevher, V. and Sankaranarayanan,A. C and McClellan, J.H. and Chellapa, Rama} } @article {13870, title = {Task-based evaluation of text summarization using Relevance Prediction}, journal = {Information Processing \& Management}, volume = {43}, year = {2007}, month = {2007/11//}, pages = {1482 - 1499}, abstract = {This article introduces a new task-based evaluation measure called Relevance Prediction that is a more intuitive measure of an individual{\textquoteright}s performance on a real-world task than interannotator agreement. Relevance Prediction parallels what a user does in the real world task of browsing a set of documents using standard search tools, i.e., the user judges relevance based on a short summary and then that same user{\textemdash}not an independent user{\textemdash}decides whether to open (and judge) the corresponding document. This measure is shown to be a more reliable measure of task performance than LDC Agreement, a current gold-standard based measure used in the summarization evaluation community. Our goal is to provide a stable framework within which developers of new automatic measures may make stronger statistical statements about the effectiveness of their measures in predicting summary usefulness. We demonstrate{\textemdash}as a proof-of-concept methodology for automatic metric developers{\textemdash}that a current automatic evaluation measure has a better correlation with Relevance Prediction than with LDC Agreement and that the significance level for detected differences is higher for the former than for the latter.}, keywords = {Relevance prediction, Summarization evaluation, Summary usefulness}, isbn = {0306-4573}, doi = {10.1016/j.ipm.2007.01.002}, url = {http://www.sciencedirect.com/science/article/pii/S0306457307000234}, author = {Hobson,Stacy President and Dorr, Bonnie J and Monz,Christof and Schwartz,Richard} } @conference {15906, title = {Task-based interaction with an integrated multilingual, multimedia information system: a formative evaluation}, booktitle = {Proceedings of the 7th ACM/IEEE-CS joint conference on Digital libraries}, series = {JCDL {\textquoteright}07}, year = {2007}, month = {2007///}, pages = {117 - 126}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {This paper describes a formative evaluation of an integrated multilingual, multimedia information system, a series of user studies designed to guide system development. The system includes automatic speech recognition for English, Chinese, and Arabic, automatic translation from Chinese and Arabic into English, and query-based and profile-based search options. The study design emphasizes repeated evaluation with the same (increasingly experienced) participants, exploration of alternative task designs, rich qualitative and quantitative data collection, and rapid analysis to provide the timely feedback needed to support iterative and responsive development. Results indicate that users presented with materials in a language that they do not know can generate remarkably useful work products, but that integration of transcription, translation, search and profile management poses challenges that would be less evident were each technology to be evaluated in isolation.}, keywords = {Cross-language information retrieval, multimedia, User studies}, isbn = {978-1-59593-644-8}, doi = {10.1145/1255175.1255199}, url = {http://doi.acm.org/10.1145/1255175.1255199}, author = {Zhang,Pengyi and Plettenberg,Lynne and Klavans,Judith L. and Oard, Douglas and Soergel,Dagobert} } @conference {12368, title = {A taxonomy for medical image registration acceleration techniques}, booktitle = {Life Science Systems and Applications Workshop, 2007. LISA 2007. IEEE/NIH}, year = {2007}, month = {2007///}, pages = {160 - 163}, author = {Plishker,W. and Dandekar,O. and Bhattacharyya, Shuvra S. and Shekhar,R.} } @article {16322, title = {Techniques for Classifying Executions of Deployed Software to Support Software Engineering Tasks}, journal = {IEEE Transactions on Software Engineering}, volume = {33}, year = {2007}, month = {2007///}, pages = {287 - 304}, abstract = {There is an increasing interest in techniques that support analysis and measurement of fielded software systems. These techniques typically deploy numerous instrumented instances of a software system, collect execution data when the instances run in the field, and analyze the remotely collected data to better understand the system{\textquoteright}s in-the-field behavior. One common need for these techniques is the ability to distinguish execution outcomes (e.g., to collect only data corresponding to some behavior or to determine how often and under which condition a specific behavior occurs). Most current approaches, however, do not perform any kind of classification of remote executions and either focus on easily observable behaviors (e.g., crashes) or assume that outcomes{\textquoteright} classifications are externally provided (e.g., by the users). To address the limitations of existing approaches, we have developed three techniques for automatically classifying execution data as belonging to one of several classes. In this paper, we introduce our techniques and apply them to the binary classification of passing and failing behaviors. Our three techniques impose different overheads on program instances and, thus, each is appropriate for different application scenarios. We performed several empirical studies to evaluate and refine our techniques and to investigate the trade-offs among them. Our results show that 1) the first technique can build very accurate models, but requires a complete set of execution data; 2) the second technique produces slightly less accurate models, but needs only a small fraction of the total execution data; and 3) the third technique allows for even further cost reductions by building the models incrementally, but requires some sequential ordering of the software instances{\textquoteright} instrumentation.}, keywords = {execution classification, remote analysis/measurement.}, isbn = {0098-5589}, doi = {http://doi.ieeecomputersociety.org/10.1109/TSE.2007.1004}, author = {Haran,Murali and Karr,Alan and Last,Michael and Orso,Alessandro and Porter, Adam and Sanil,Ashish and Fouch?,Sandro} } @conference {16008, title = {Toward domain-neutral human-level metacognition}, booktitle = {AAAI Spring Symposium on Logical Formalizations of Commonsense Reasoning}, year = {2007}, month = {2007///}, author = {Anderson,M. L and Schmill,M. and Oates,T. and Perlis, Don and Josyula,D. and Wright,D. and Wilson,S.} } @article {14746, title = {Toward Specifying and Validating Cross-Domain Policies}, journal = {Technical Reports from UMIACS}, year = {2007}, month = {2007/04/17/undef}, abstract = {Formal security policies are extremely useful for two related reasons. First, they allow a policy to be considered in isolation, separate from programs under the purview of the policy and separate from the implementation of the policy{\textquoteright}s enforcement. Second, policies can be checked for compliance against higher-level security goals by using automated analyses. By contrast, ad hoc enforcement mechanisms (for which no separate policies are specified) enjoy neither benefit, and non-formal policies enjoy the first but not the second. We would like to understand how best to define (and enforce) multi-level security policies when information must be shared across domains that have varying levels of trust (the so-called "cross domain" problem). Because we wish to show such policies meet higher-level security goals with high assurance, we are interested in specifying cross domain policies formally, and then reasoning about them using automated tools. In this report, we briefly survey work that presents formal security policies with cross-domain concerns, in particular with respect to the problem of downgrading. We also describe correctness properties for such policies, all based on noninterference. Finally, we briefly discuss recently-developed tools for analyzing formal security policies; though no existing tools focus on the analysis of downgrading-oriented policies, existing research points the way to providing such support.}, author = {Hicks, Michael W. and Swamy,N. and Tsang,S.} } @conference {12331, title = {Towards a heterogeneous medical image registration acceleration platform}, booktitle = {Biomedical Circuits and Systems Conference, 2007. BIOCAS 2007. IEEE}, year = {2007}, month = {2007///}, pages = {231 - 234}, author = {Plishker,W. and Dandekar,O. and Bhattacharyya, Shuvra S. and Shekhar,R.} } @article {18869, title = {Towards the development of a virtual environment-based training system for mechanical assembly operations}, journal = {Virtual Reality}, volume = {11}, year = {2007}, month = {2007///}, pages = {189 - 206}, abstract = {In this paper, we discuss the development of Virtual Training Studio (VTS), a virtual environment-based training system that allows training supervisors to create training instructions and allows trainees to learn assembly operations in a virtual environment. Our system is mainly focused on the cognitive side of training so that trainees can learn to recognize parts, remember assembly sequences, and correctly orient the parts during assembly operations. Our system enables users to train using the following three training modes: (1) Interactive Simulation, (2) 3D Animation, and (3) Video. Implementing these training modes required us to develop several new system features. This paper presents an overview of the VTS system and describes a few main features of the system. We also report user test results that show how people train using our system. The user test results indicate that the system is able to support a wide variety of training preferences and works well to support training for assembly operations.}, keywords = {Computer science}, isbn = {1359-4338}, doi = {10.1007/s10055-007-0076-4}, url = {http://www.springerlink.com/content/g7760422m13l83x1/abstract/}, author = {Brough,John and Schwartz,Maxim and Gupta, Satyandra K. and Anand,Davinder and Kavetsky,Robert and Pettersen,Ralph} } @article {14567, title = {TREMOR{\textemdash}a tool for retrieving transcriptional modules by incorporating motif covariance}, journal = {Nucleic Acids Research}, volume = {35}, year = {2007}, month = {2007/12/01/}, pages = {7360 - 7371}, abstract = {A transcriptional module (TM) is a collection of transcription factors (TF) that as a group, co-regulate multiple, functionally related genes. The task of identifying TMs poses an important biological challenge. Since TFs belong to evolutionarily and structurally related families, TF family members often bind to similar DNA motifs and can confound sequence-based approaches to TM identification. A previous approach to TM detection addresses this issue by pre-selecting a single representative from each TF family. One problem with this approach is that closely related transcription factors can still target sufficiently distinct genes in a biologically meaningful way, and thus, pre-selecting a single family representative may in principle miss certain TMs. Here we report a method{\textemdash}TREMOR (Transcriptional Regulatory Module Retriever). This method uses the Mahalanobis distance to assess the validity of a TM and automatically incorporates the inter-TF binding similarity without resorting to pre-selecting family representatives. The application of TREMOR on human muscle-specific, liver-specific and cell-cycle-related genes reveals TFs and TMs that were validated from literature and also reveals additional related genes.}, doi = {10.1093/nar/gkm885}, url = {http://nar.oxfordjournals.org/content/35/21/7360.abstract}, author = {Singh,Larry N. and Wang,Li-San and Hannenhalli, Sridhar} } @conference {17781, title = {T-rex: A domain-independent system for automated cultural information extraction}, booktitle = {Proceedings of the First International Conference on Computational Cultural Dynamics (ICCCD 2007)}, year = {2007}, month = {2007///}, abstract = {RDF (Resource Description Framework) is a web standarddefined by the World Wide Web Consortium. In RDF, we can define schemas of interest. For example, we can define a schema about tribes on the Pakistan-Afghanistan borderland, or a schema about violent events. An RDF instance is a set of facts that are compatible with the schema. The principal contribution of this paper is the development of a scalable system called T-REX (short for {\textquotedblleft}The RDF EXtractor{\textquotedblright}) that allows us to extract instances associated with a user-specified schema, independently of the domain about which we wish to extract data. Using T-REX, we have successfully extracted information about various aspects of about 20 tribes living in the Pakistan-Afghanistan border. Moreover, we have used T-REX to successfully extract occurrences of violent events from a set of 80 news sites in approximately 50 countries. T-REX scales well {\textendash} it has processed approximately 45,000 web pages per day for the last 6 months. }, author = {Albanese, M. and V.S. Subrahmanian} } @article {17773, title = {Uncertainty in logic programming: Some recollections}, journal = {Association for Logic Programming Newsletter}, volume = {20}, year = {2007}, month = {2007///}, author = {V.S. Subrahmanian} } @article {15277, title = {A unified model explaining the offsets of overlapping and near-overlapping prokaryotic genes}, journal = {Molecular biology and evolution}, volume = {24}, year = {2007}, month = {2007///}, pages = {2091 - 2091}, author = {Kingsford, Carl and Delcher,A. L and Salzberg,S. L} } @article {15827, title = {Universal Duality in Conic Convex Optimization}, journal = {Mathematical Programming A}, volume = {109}, year = {2007}, month = {2007///}, pages = {69 - 88}, abstract = {Given a primal-dual pair of linear programs, it is well known that if their optimal values are viewed as lying on the extended real line, then the duality gap is zero, unless both problems are infeasible, in which case the optimal values are +$\infty$ and -$\infty$. In contrast, for optimization problems over nonpolyhedral convex cones, a nonzero duality gap can exist when either the primal or the dual is feasible.For a pair of dual conic convex programs, we provide simple conditions on the {\textquoteleft}{\textquoteleft}constraint matrices{\textquoteright}{\textquoteright} and cone under which the duality gap is zero for every choice of linear objective function and constraint right-hand side. We refer to this property as {\textquoteleft}{\textquoteleft}universal duality{\textquoteright}{\textquoteright}. Our conditions possess the following properties: (i) they are necessary and sufficient, in the sense that if (and only if) they do not hold, the duality gap is nonzero for some linear objective function and constraint right-hand side; (ii) they are metrically and topologically generic; and (iii) they can be verified by solving a single conic convex program. We relate to universal duality the fact that the feasible sets of a primal convex program and its dual cannot both be bounded, unless they are both empty. Finally we illustrate our theory on a class of semidefinite programs that appear in control theory applications. }, author = {Schurr,Simon P. and Tits,Andr{\'e} and O{\textquoteright}Leary, Dianne P.} } @article {17458, title = {Universal Usability: A grand challenge for HCI}, journal = {Universal usability: Designing computer interfaces for user diversity}, year = {2007}, month = {2007///}, author = {Shneiderman, Ben} } @conference {18611, title = {Usage-based dhcp lease time optimization}, booktitle = {Proceedings of the 7th ACM SIGCOMM conference on Internet measurement}, series = {IMC {\textquoteright}07}, year = {2007}, month = {2007///}, pages = {71 - 76}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {The Dynamic Host Configuration Protocol (DHCP) is used to dynamically allocate address space to hosts on a local area network. Despite its widespread usage, few studies exist on DHCP usage patterns, and even less is known about the importance of setting the lease time (the time that a client retains ownership over some IP address) to an appropriate value. Lease time can greatly affect the tradeoff between address space utilization and the number of both renewal messages and client session expirations. In this paper, using a DHCP trace for 5 weekdays from the Georgia Tech campus network, we present the largest known study of DHCP utilization. We also explore how various strategies for setting lease times can dramatically reduce the number of renewals and expirations without prohibitively increasing address space utilization.}, keywords = {dhcp, network management, OPTIMIZATION, usage}, isbn = {978-1-59593-908-1}, doi = {10.1145/1298306.1298315}, url = {http://doi.acm.org/10.1145/1298306.1298315}, author = {Khadilkar,Manas and Feamster, Nick and Sanders,Matt and Clark,Russ} } @article {16846, title = {Using a distributed quadtree index in peer-to-peer networks}, journal = {The VLDB Journal}, volume = {16}, year = {2007}, month = {2007/04//}, pages = {165 - 178}, abstract = {Peer-to-peer (P2P) networks have become a powerful means for online data exchange. Currently, users are primarily utilizing these networks to perform exact-match queries and retrieve complete files. However, future more data intensive applications, such as P2P auction networks, P2P job-search networks, P2P multiplayer games, will require the capability to respond to more complex queries such as range queries involving numerous data types including those that have a spatial component. In this paper, a distributed quadtree index that adapts the MX-CIF quadtree is described that enables more powerful accesses to data in P2P networks. This index has been implemented for various prototype P2P applications and results of experiments are presented. Our index is easy to use, scalable, and exhibits good load-balancing properties. Similar indices can be constructed for various multidimensional data types with both spatial and non-spatial components.}, keywords = {Distributed data structures, peer-to-peer networks, quadtrees, spatial data structures}, isbn = {1066-8888}, doi = {10.1007/s00778-005-0001-y}, url = {http://dx.doi.org/10.1007/s00778-005-0001-y}, author = {Tanin,Egemen and Harwood,Aaron and Samet, Hanan} } @conference {16449, title = {Using annotations from controlled vocabularies to find meaningful associations}, booktitle = {Proceedings of the 4th international conference on Data integration in the life sciences}, year = {2007}, month = {2007///}, pages = {247 - 263}, author = {Lee,W. J and Raschid, Louiqa and Srinivasan,P. and Shah,N. and Rubin,D. and Noy,N.} } @article {17893, title = {Using Content-Addressable Networks for Load Balancing in Desktop Grids}, volume = {UMIACS-TR-2007-16}, year = {2007}, month = {2007/03/29/}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {Desktop grids combine Peer-to-Peer and Grid computing techniques to improvethe robustness, reliability and scalability of job execution infrastructures. However, efficiently matching incoming jobs to available system resources and achieving good load balance in a fully decentralized and heterogeneous computing environment is a challenging problem. In this paper, we extend our prior work with a new decentralized algorithm for maintaining approximate global load information, and a job pushing mechanism that uses the global information to push jobs towards underutilized portions of the system. The resulting system more effectively balances load and improves overall system throughput. Through a comparative analysis of experimental results across different system configurations and job profiles, performed via simulation, we show that our system can reliably execute Grid applications on a distributed set of resources both with low cost and with good load balance. }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu//handle/1903/4355}, author = {Kim,Jik-Soo and Keleher,Peter and Marsh,Michael and Bhattacharjee, Bobby and Sussman, Alan} } @conference {13478, title = {Using multiresolution learning for transfer in image classification}, booktitle = {Proceedings of the 22nd national conference on Artificial intelligence - Volume 2}, series = {AAAI{\textquoteright}07}, year = {2007}, month = {2007///}, pages = {1852 - 1853}, publisher = {AAAI Press}, organization = {AAAI Press}, abstract = {Our work explores the transfer of knowledge at multiple levels of abstraction to improve learning. By exploiting the similarities between objects at various levels of detail, multiresolution learning can facilitate transfer between image classification tasks.We extract features from images at multiple levels of resolution, then use these features to create models at different resolutions. Upon receiving a new task, the closest-matching stored model can be generalized (adapted to the appropriate resolution) and transferred to the new task. }, isbn = {978-1-57735-323-2}, url = {http://dl.acm.org/citation.cfm?id=1619797.1619927}, author = {Eaton,Eric and desJardins, Marie and Stevenson,John} } @conference {18766, title = {Using virtual demonstrations for creating multi-media training instructions}, year = {2007}, month = {2007///}, abstract = {Often generating training instructions for virtual environments is a long and tedious process. In thispaper, we discuss the development of a virtual environment (VE) instruction generating tool called Virtual Author which is the main component of the Virtual Training Studio (VTS). VTS is a virtual environment-based training system that provides instructors with a tool to create training instructions and allows trainees to learn assembly operations in a personal virtual environment. The Virtual Author tool is designed to allow an instructor to perform virtual demonstrations using CAD models in the virtual environment in order to quickly generate VE-based training instructions for use in VTS. This paper describes the algorithms used to carry out motion smoothening of instructor{\textquoteright}s actions, automated text instruction generation based on part and assembly motions, and extraction of alignment constraints from 3D CAD models to support instruction generation. We also present examples to illustrate how the use of the Virtual Author tool leads to a significant reduction in the training instruction generation time. }, url = {http://www.cadanda.com/CAD_4_1-4__11.PDF}, author = {Schwartz,M. and Gupta,S.K. and Anand,D. K. and Brough,J. E. and Kavetsky,R.} } @conference {16074, title = {VAST 2007 Contest - Blue Iguanodon}, booktitle = {Visual Analytics Science and Technology, 2007. VAST 2007. IEEE Symposium on}, year = {2007}, month = {2007/11/30/1}, pages = {231 - 232}, abstract = {Visual analytics experts realize that one effective way to push the field forward and to develop metrics for measuring the performance of various visual analytics components is to hold an annual competition. The second visual analytics science and technology (VAST) contest was held in conjunction with the 2007 IEEE VAST symposium. In this contest participants were to use visual analytic tools to explore a large heterogeneous data collection to construct a scenario and find evidence buried in the data of illegal and terrorist activities that were occurring. A synthetic data set was made available as well as tasks. In this paper we describe some of the advances we have made from the first competition held in 2006.}, keywords = {activities;large, activities;visual, analytic, collection;terrorist, data, heterogeneous, illegal, interfaces;, tools;data, user, visualisation;graphical}, doi = {10.1109/VAST.2007.4389032}, author = {Grinstein,G. and Plaisant, Catherine and Laskowski,S. and O{\textquoteright}Connell,T. and Scholtz,J. and Whiting,M.} } @conference {14755, title = {Verified Enforcement of Security Policies for Cross-Domain Information Flows}, booktitle = {IEEE Military Communications Conference, 2007. MILCOM 2007}, year = {2007}, month = {2007/10/29/31}, pages = {1 - 7}, publisher = {IEEE}, organization = {IEEE}, abstract = {We describe work in progress that uses program analysis to show that security-critical programs, such as cross-domain guards, correctly enforce cross-domain security policies. We are enhancing existing techniques from the field of Security-oriented Programming Languages to construct a new language for the construction of secure networked applications, SELINKS. In order to specify and enforce expressive and fine-grained policies, we advocate dynamically associating security labels with sensitive entities. Programs written in SELINKS are statically guaranteed to correctly manipulate an entity{\textquoteright}s security labels and to ensure that the appropriate policy checks mediate all operations that are performed on the entity. We discuss the design of our main case study : a web-based Collaborative Planning Application that will permit a collection of users, with varying security requirements and clearances, to access sensitive data sources and collaboratively create documents based on these sources.}, keywords = {Collaboration, Computer languages, Data security, Educational institutions, Government, Information analysis, Information filtering, Information filters, Information security, Vehicles}, isbn = {978-1-4244-1513-7}, doi = {10.1109/MILCOM.2007.4455189}, author = {Swamy,Nikhil and Hicks, Michael W. and Tsang,Simon} } @article {12923, title = {Viable but nonculturable Vibrio cholerae O1 in biofilms in the aquatic environment and their role in cholera transmission}, journal = {Proceedings of the National Academy of Sciences}, volume = {104}, year = {2007}, month = {2007///}, pages = {17801 - 17801}, abstract = {Vibrio cholerae persists in aquatic environments predominantly in a nonculturable state. In this study coccoid, nonculturable V. cholerae O1 in biofilms maintained for 495 days in Mathbaria, Bangladesh, pond water became culturable upon animal passage. Culturability, biofilm formation, and the wbe, ctxA, and rstR2 genes were monitored by culture, direct fluorescent antibody (DFA), and multiplex PCR. DFA counts were not possible after formation of biofilm. Furthermore, wbe, but not ctxA, were amplifiable, even after incubation for 54 and 68 days at room temperature (≈25{\textdegree}C) and 4{\textdegree}C, respectively, when no growth was detectable. Slower biofilm formation and extended culturability were observed for cultures incubated at 4{\textdegree}C, compared with ≈25{\textdegree}C, suggesting biofilm production to be temperature dependent and linked to loss of culturability. Small colonies appearing after incubation in microcosms for 54 and 68 days at 25{\textdegree}C and 4{\textdegree}C, respectively, were wbe positive and ctxA and rstR2 negative, indicating loss of bacteriophage CTXΦ. The coccoid V. cholerae O1 observed as free cells in microcosms incubated for 495 days could not be cultured, but biofilms in the same microcosms yielded culturable cells. It is concluded that biofilms can act as a reservoir for V. cholerae O1 between epidemics because of its long-term viability in biofilms. In contrast to biofilms produced in Mathbaria pond water, V. cholerae O1 in biofilms present in cholera stools and incubated under identical conditions as the Mathbaria pond water biofilms could not be cultured after 2 months, indicating that those V. cholerae cells freshly discharged into the environment are significantly less robust than cells adapted to environmental conditions.Bangladesh bacteriophage CTXΦ DFA multiplex-PCR ctxA }, isbn = {0027-8424, 1091-6490}, doi = {10.1073/pnas.0705599104}, url = {http://www.pnas.org/content/104/45/17801}, author = {Alam,M. and Sultana,M. and Nair,G. B. and Siddique,A. K. and Hasan,N. A. and Sack,R. B. and Sack,D. A. and Ahmed,K. U. and Sadique,A. and Watanabe,H. and Rita R Colwell} } @article {14361, title = {Visual analysis of dynamic group membership in temporal social networks}, journal = {ACM SIGKDD Explorations Newsletter}, volume = {9}, year = {2007}, month = {2007/12//}, pages = {13 - 21}, abstract = {C-Group is a tool for analyzing dynamic group membership in temporal social networks over time. Unlike most network visualization tools, which show the group structure within an entire network, or the group membership for a single actor, C-Group allows users to focus their analysis on a pair of individuals. While C-Group allows for viewing the addition and deletion of nodes (actors) and edges (relationships) over time, its major contribution is its focus on changing group memberships over time. By doing so, users can investigate the context of temporal group memberships for the pair. C-Group provides users with a flexible interface for defining (and redefining) groups interactively, and supports two novel visual representations of the evolving group memberships. This flexibility gives users alternate views that are appropriate for different network sizes and provides users with different insights into the grouping behavior. We demonstrate the utility of the tool on a scientific publication network.}, keywords = {dynamic group detection, group visualization, visual data mining}, isbn = {1931-0145}, doi = {10.1145/1345448.1345452}, url = {http://doi.acm.org/10.1145/1345448.1345452}, author = {Kang,Hyunmo and Getoor, Lise and Singh,Lisa} } @conference {14405, title = {Visual Mining of Multi-Modal Social Networks at Different Abstraction Levels}, booktitle = {Information Visualization, 2007. IV {\textquoteright}07. 11th International Conference}, year = {2007}, month = {2007/07//}, pages = {672 - 679}, abstract = {Social networks continue to become more and more feature rich. Using local and global structural properties and descriptive attributes are necessary for more sophisticated social network analysis and support for visual mining tasks. While a number of visualization tools for social network applications have been developed, most of them are limited to uni-modal graph representations. Some of the tools support a wide range of visualization options, including interactive views. Others have better support for calculating structural graph properties such as the density of the graph or deploying traditional statistical social network analysis. We present Invenio, a new tool for visual mining of socials. Invenio integrates a wide range of interactive visualization options from Prefuse, with graph mining algorithm support from JUNG. While the integration expands the breadth of functionality within the core engine of the tool, our goal is to interactively explore multi-modal, multi-relational social networks. Invenio also supports construction of views using both database operations and basic graph mining operations.}, keywords = {computing;, database;interactive, graph, management, mining;data, network;structural, property;visual, sciences, social, systems;graph, systems;social, theory;interactive, visualisation;database, visualization;multimodal}, doi = {10.1109/IV.2007.126}, author = {Singh,L. and Beard,M. and Getoor, Lise and Blake,M.B.} } @article {15051, title = {Web Archiving: Organizing Web Objects into Web Containers to Optimize Access}, volume = {UMIACS-TR-2007-42}, year = {2007}, month = {2007/10/09/}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {The web is becoming the preferred medium for communicating and storinginformation pertaining to almost any human activity. However it is an ephemeral medium whose contents are constantly changing, resulting in a permanent loss of part of our cultural and scientific heritage on a regular basis. Archiving important web contents is a very challenging technical problem due to its tremendous scale and complex structure, extremely dynamic nature, and its rich heterogeneous and deep contents. In this paper, we consider the problem of archiving a linked set of web objects into web containers in such a way as to minimize the number of containers accessed during a typical browsing session. We develop a method that makes use of the notion of PageRank and optimized graph partitioning to enable faster browsing of archived web contents. We include simulation results that illustrate the performance of our scheme and compare it to the common scheme currently used to organize web objects into web containers. }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/7426}, author = {Song,Sangchul and JaJa, Joseph F.} } @conference {16852, title = {A web collaboration system for content-based image retrieval of medical images}, booktitle = {Proceedings of SPIE{\textendash}Medical Imaging}, volume = {6516}, year = {2007}, month = {2007///}, abstract = {Building effective content-based image retrieval (CBIR) systemsinvolves the combination of image creation, storage, security, transmission, analysis, evaluation feature extraction, and feature combination in order to store and retrieve medical images effectively. This requires the involvement of a large community of experts across several fields. We have created a CBIR system called Archimedes which integrates the community together without requiring disclosure of sensitive details. Archimedes{\textquoteright} system design enables researchers to upload their feature sets and quickly compare the effectiveness of their methods against other stored feature sets. Additionally, research into the techniques used by radiologists is possible in Archimedes through double- blind radiologist comparisons based on their annotations and feature markups. This research archive contains the essential technologies of secure transmission and storage, textual and feature searches, spatial searches, annotation searching, filtering of result sets, feature creation, and bulk loading of features, while creating a repository and testbed for the community. }, author = {Tahmoush,D. and Samet, Hanan} } @article {17506, title = {Web science: a provocative invitation to computer science}, journal = {Communications of the ACM}, volume = {50}, year = {2007}, month = {2007/06//}, pages = {25 - 27}, abstract = {Here{\textquoteright}s how it can awaken computer science to the interdisciplinary possibilities of the Web{\textquoteright}s socially embedded computing technology.}, isbn = {0001-0782}, doi = {10.1145/1247001.1247022}, url = {http://doi.acm.org/10.1145/1247001.1247022}, author = {Shneiderman, Ben} } @inbook {12623, title = {Acquisition of Articulated Human Body Models Using Multiple Cameras}, booktitle = {Articulated Motion and Deformable ObjectsArticulated Motion and Deformable Objects}, series = {Lecture Notes in Computer Science}, volume = {4069}, year = {2006}, month = {2006///}, pages = {78 - 89}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {Motion capture is an important application in different areas such as biomechanics, computer animation, and human-computer interaction. Current motion capture methods typically use human body models in order to guide pose estimation and tracking. We model the human body as a set of tapered super-quadrics connected in an articulated structure and propose an algorithm to automatically estimate the parameters of the model using video sequences obtained from multiple calibrated cameras. Our method is based on the fact that the human body is constructed of several articulated chains that can be visualised as essentially 1-D segments embedded in 3-D space and connected at specific joint locations. The proposed method first computes a voxel representation from the images and maps the voxels to a high dimensional space in order to extract the 1-D structure. A bottom-up approach is then suggested in order to build a parametric (spline-based) representation of a general articulated body in the high dimensional space followed by a top-down probabilistic approach that registers the segments to the known human body model. We then present an algorithm to estimate the parameters of our model using the segmented and registered voxels.}, isbn = {978-3-540-36031-5}, url = {http://dx.doi.org/10.1007/11789239_9}, author = {Sundaresan,Aravind and Chellapa, Rama}, editor = {Perales,Francisco and Fisher,Robert} } @article {12396, title = {Adding dense, weighted connections to wordnet}, journal = {Proceedings of the Third International WordNet Conference}, year = {2006}, month = {2006///}, pages = {29 - 36}, abstract = {WORDNET, a ubiquitous tool for natural language processing, suffers from sparsity of connectionsbetween its component concepts (synsets). Through the use of human annotators, a subset of the connections between 1000 hand-chosen synsets was assigned a value of {\textquotedblleft}evocation{\textquotedblright} representing how much the first concept brings to mind the second. These data, along with existing similarity measures, constitute the basis of a method for predicting evocation between previously unrated pairs. }, author = {Jordan Boyd-Graber and Fellbaum,C. and Osherson,D. and Schapire,R.} } @conference {15689, title = {Alternative custodians for congestion control in delay tolerant networks}, booktitle = {Proceedings of the 2006 SIGCOMM workshop on Challenged networks}, series = {CHANTS {\textquoteright}06}, year = {2006}, month = {2006///}, pages = {229 - 236}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, keywords = {delay tolerant network, Routing}, isbn = {1-59593-572-X}, doi = {10.1145/1162654.1162660}, url = {http://doi.acm.org/10.1145/1162654.1162660}, author = {Seligman,Matthew and Fall,Kevin and Mundur, Padma} } @article {15107, title = {Analyzing the HB and HB+ protocols in the {\textquotedblleft}large error{\textquotedblright} case}, journal = {IACR ePrint report}, volume = {326}, year = {2006}, month = {2006///}, pages = {2006 - 2006}, abstract = {HB and HB+ are two shared-key, unidirectional authentication protocols whose extremelylow computational cost makes them potentially well-suited for severely resource-constrained devices. Security of these protocols is based on the conjectured hardness of learning parity with noise; that is, learning a secret s given {\textquotedblleft}noisy{\textquotedblright} dot products of s that are incorrect with probability ε. Although the problem of learning parity with noise is meaningful for any constant ε < 1/2, existing proofs of security for HB and HB+ only imply security when ε < 1/4. In this note, we show how to extend these proofs to the case of arbitrary ε < 1/2. }, author = {Katz, Jonathan and Smith,A.} } @article {17784, title = {Annotated rdf}, journal = {The Semantic Web: Research and Applications}, volume = {4011}, year = {2006}, month = {2006///}, pages = {487 - 501}, abstract = {There are numerous extensions of RDF that support temporal reasoning, reasoning about pedigree, reasoning about uncertainty, and so on. In this paper, we present Annotated RDF (or aRDF for short) in which RDF triples are annotated by members of a partially ordered set (with bottom element) that can be selected in any way desired by the user. We present a formal declarative semantics (model theory) for annotated RDF and develop algorithms to check consistency of aRDF theories and to answer queries to aRDF theories. We show that annotated RDF captures versions of all the forms of reasoning mentioned above within a single unified framework. We develop a prototype aRDF implementation and show that our algorithms work very fast indeed {\textendash} in fact, in just a matter of seconds for theories with over 100,000 nodes.}, doi = {10.1007/11762256_36}, author = {Udrea,O. and Recupero,D. and V.S. Subrahmanian} } @conference {13723, title = {Annotation compatibility working group report}, booktitle = {Proceedings of the Workshop on Frontiers in Linguistically Annotated Corpora 2006}, series = {LAC {\textquoteright}06}, year = {2006}, month = {2006///}, pages = {38 - 53}, publisher = {Association for Computational Linguistics}, organization = {Association for Computational Linguistics}, address = {Stroudsburg, PA, USA}, abstract = {This report explores the question of compatibility between annotation projects including translating annotation formalisms to each other or to common forms. Compatibility issues are crucial for systems that use the results of multiple annotation projects. We hope that this report will begin a concerted effort in the field to track the compatibility of annotation schemes for part of speech tagging, time annotation, treebanking, role labeling and other phenomena.}, isbn = {1-932432-78-7}, url = {http://dl.acm.org/citation.cfm?id=1641991.1641997}, author = {Meyers,A. and Fang,A. C. and Ferro,L. and K{\"u}bler,S. and Jia-Lin,T. and Palmer,M. and Poesio,M. and Dolbey,A. and Schuler,K. K. and Loper,E. and Zinsmeister,H. and Penn,G. and Xue,N. and Hinrichs,E. and Wiebe,J. and Pustejovsky,J. and Farwell,D. and Hajicova,E. and Dorr, Bonnie J and Hovy,E. and Onyshkevych,B. A. and Levin,L.} } @article {19020, title = {Anonymous multi-attribute encryption with range query and conditional decryption}, year = {2006}, month = {2006}, institution = {Carnegie Mellon University}, abstract = {We introduce the concept of Anonymous Multi-Attribute Encryption with Range Query and Con-ditional Decryption (AMERQCD). In AMERQCD, a plaintext is encrypted under a point in multi- dimensional space. To a computationally bounded adversary, the ciphertext hides both the plaintext and the point under which it is encrypted. In a range query, a master key owner releases the decryp- tion key for an arbitrary hyper-rectangle in space, thus allowing decryption of ciphertexts previ- ously encrypted under any point within the hyper-rectangle. However, a computationally bounded adversary cannot learn any information on ciphertexts outside the range covered by the decryption key (except the fact that they do not lie within this range). We give an efficient construction based on the Decision Bilinear Diffie-Hellman (D-BDH) and Decision Linear (D-Linear) assumption. }, isbn = {CMU-CS-06-135}, doi = {Technical Report}, url = {http://reports-archive.adm.cs.cmu.edu/anon/anon/home/ftp/2006/CMU-CS-06-135.pdf}, author = {Bethencourt, J. and Chan, H. and Perrig, A. and Elaine Shi and Song,D.} } @article {15250, title = {Approximation algorithms for channel allocation problems in broadcast networks}, journal = {Networks}, volume = {47}, year = {2006}, month = {2006/03/09/}, pages = {225 - 236}, abstract = {We study two packing problems that arise in the area of dissemination-based information systems; a second theme is the study of distributed approximation algorithms. The problems considered have the property that the space occupied by a collection of objects together could be significantly less than the sum of the sizes of the individual objects. In the Channel Allocation Problem, there are requests that are subsets of topics. There are a fixed number of channels that can carry an arbitrary number of topics. All the topics of each request must be broadcast on some channel. The load on any channel is the number of topics that are broadcast on that channel; the objective is to minimize the maximum load on any channel. We present approximation algorithms for this problem, and also show that the problem is MAX-SNP hard. The second problem is the Edge Partitioning Problem addressed by Goldschmidt, Hochbaum, Levin, and Olinick (Networks, 41:13{\textendash}23, 2003). Each channel here can deliver topics for at most k requests, and we aim to minimize the total load on all channels. We present an O(n1/3){\textendash}approximation algorithm, and also show that the algorithm can be made fully distributed with the same approximation guarantee; we also generalize the (nondistributed) Edge Partitioning Problem of graphs to the case of hypergraphs. {\textcopyright} 2006 Wiley Periodicals, Inc. NETWORKS, Vol. 47(4), 225{\textendash}236 2006}, keywords = {channel allocation problem, distributed approximation algorithm, edge partitioning problem}, isbn = {1097-0037}, doi = {10.1002/net.20111}, url = {http://onlinelibrary.wiley.com/doi/10.1002/net.20111/abstract}, author = {Gandhi,Rajiv and Khuller, Samir and Srinivasan, Aravind and Wang,Nan} } @conference {16868, title = {Archimedes, an archive of medical images}, booktitle = {American Medical Informatics Association 2006 Annual Symposium Proceedings Biomedical and Health Informatics: From Foundations to Applications to Policy, Washington, DC, DW Bates, JH Holmes, and G. Kuperman, editors}, year = {2006}, month = {2006///}, abstract = {We present a medical image and medical recorddatabase for the storage, research, transmission, and evaluation of medical images. Medical images from any source that supports the DICOM standard can be stored and accessed, as well as associated analysis and annotations. Retrieval is based on patient info, date, doctor{\textquoteright}s annotations, features in the images, or a spatial combination. This database supports the secure transmission of sensitive data for tele-medicine and follows all HIPPA regulations. }, author = {Tahmoush,D. and Samet, Hanan} } @article {18653, title = {An architecture for adaptive intrusion-tolerant applications}, journal = {Software: Practice and Experience}, volume = {36}, year = {2006}, month = {2006///}, pages = {1331 - 1354}, abstract = {Applications that are part of a mission-critical information system need to maintain a usable level of key services through ongoing cyber-attacks. In addition to the well-publicized denial of service (DoS) attacks, these networked and distributed applications are increasingly threatened by sophisticated attacks that attempt to corrupt system components and violate service integrity. While various approaches have been explored to deal with DoS attacks, corruption-inducing attacks remain largely unaddressed. We have developed a collection of mechanisms based on redundancy, Byzantine fault tolerance, and adaptive middleware that help distributed, object-based applications tolerate corruption-inducing attacks. In this paper, we present the ITUA architecture, which integrates these mechanisms in a framework for auto-adaptive intrusion-tolerant systems, and we describe our experience in using the technology to defend a critical application that is part of a larger avionics system as an example. We also motivate the adaptive responses that are key to intrusion tolerance, and explain the use of the ITUA architecture to support them in an architectural framework. Copyright {\textcopyright} 2006 John Wiley \& Sons, Ltd.}, keywords = {adaptive defense, adaptive middleware, Byzantine fault tolerance, intrusion tolerance, redundancy, survivability architecture}, isbn = {1097-024X}, doi = {10.1002/spe.747}, url = {http://onlinelibrary.wiley.com/doi/10.1002/spe.747/abstract}, author = {Pal,Partha and Rubel,Paul and Atighetchi,Michael and Webber,Franklin and Sanders,William H. and Seri,Mouna and Ramasamy,HariGovind and Lyons,James and Courtney,Tod and Agbaria,Adnan and Michel Cukier and Gossett,Jeanna and Keidar,Idit} } @article {16352, title = {Atomic instructions in java}, journal = {ECOOP 2002{\textemdash}Object-Oriented Programming}, year = {2006}, month = {2006///}, pages = {5 - 16}, author = {Hovemeyer,D. and Pugh, William and Spacco,J.} } @article {18874, title = {Automatic web services composition using Shop2}, year = {2006}, month = {2006///}, institution = {Department of Computer Science, University of Maryland, College Park}, abstract = {Semantic markup of Web services will enable the automation of various kinds of tasks, including discovery, composition, and execution of Web services. We describe how an AI planning system (SHOP2) can be used with DAML-S Web service descriptions to automatically compose Web services.}, url = {http://www.stormingmedia.us/96/9697/A969744.html}, author = {Hendler,J. and Nau, Dana S. and Parsia,B. and Sirin,E. and Wu,D.} } @inbook {15719, title = {Back to Basics: CLASSY 2006}, booktitle = {DUC 06 Conference ProceedingsDUC 06 Conference Proceedings}, year = {2006}, month = {2006///}, publisher = {U.S. National Inst. of Standards and Technology}, organization = {U.S. National Inst. of Standards and Technology}, abstract = {The IDA/CCS summarization system, CLASSY, underwent significant change for this year{\textquoteright}sDUC. Two changes made processing simpler and faster: 1) we eliminated the use of a POS (part of speech) tagger for sentence splitting and to assist sentence trimming, and 2) we simplified the scoring of sentences for inclusion in the summary by introducing a new {\textquotedblleft}approximate oracle{\textquotedblright} score. An additional change introduced a modest amount of extra computation: we ordered sentences in the summary using a new Traveling Salesperson (TSP) formulation. These changes improved ROUGE scores on the DUC 2005 data from last year and gave strong performance in the DUC 2006 competition. }, url = {\tt http://duc.nist.gov/}, author = {Conroy,John M. and Schlesinger,Judith D. and O{\textquoteright}Leary, Dianne P. and Goldstein,Jade} } @article {16983, title = {Balancing Systematic and Flexible Exploration of Social Networks}, journal = {IEEE Transactions on Visualization and Computer Graphics}, volume = {12}, year = {2006}, month = {2006/10//Sept}, pages = {693 - 700}, abstract = {Social network analysis (SNA) has emerged as a powerful method for understanding the importance of relationships in networks. However, interactive exploration of networks is currently challenging because: (1) it is difficult to find patterns and comprehend the structure of networks with many nodes and links, and (2) current systems are often a medley of statistical methods and overwhelming visual output which leaves many analysts uncertain about how to explore in an orderly manner. This results in exploration that is largely opportunistic. Our contributions are techniques to help structural analysts understand social networks more effectively. We present SocialAction, a system that uses attribute ranking and coordinated views to help users systematically examine numerous SNA measures. Users can (1) flexibly iterate through visualizations of measures to gain an overview, filter nodes, and find outliers, (2) aggregate networks using link structure, find cohesive subgroups, and focus on communities of interest, and (3) untangle networks by viewing different link types separately, or find patterns across different link types using a matrix overview. For each operation, a stable node layout is maintained in the network visualization so users can make comparisons. SocialAction offers analysts a strategy beyond opportunism, as it provides systematic, yet flexible, techniques for exploring social networks}, keywords = {Aggregates, algorithms, attribute ranking, Cluster Analysis, Computer Graphics, Computer simulation, Coordinate measuring machines, coordinated views, Data analysis, data visualisation, Data visualization, exploratory data analysis, Filters, Gain measurement, graph theory, Graphical user interfaces, Information Storage and Retrieval, interactive graph visualization, matrix algebra, matrix overview, Models, Biological, Navigation, network visualization, Pattern analysis, Population Dynamics, Social Behavior, social network analysis, Social network services, social networks, social sciences computing, Social Support, SocialAction, software, statistical analysis, statistical methods, User-Computer Interface}, isbn = {1077-2626}, doi = {10.1109/TVCG.2006.122}, author = {Perer,A. and Shneiderman, Ben} } @conference {18767, title = {Bio-inspired, Modular, and Multifunctional Thermal and Impact Protected (TIPed) Embedded Sensing Controls Actuation Power Element (ESCAPE) Structures}, year = {2006}, month = {2006///}, abstract = {There is a great deal of interest in creating new structural concepts, such as snake robots, from analogousbiological systems. These biological systems are typically composed of materials that serve multiple functions. For example, the skin of a snake is a system consisting of a soft, hyperelastic covering, with nerves providing thermal and pressure sensitivity, and a hard, scaly coating to resist wear and tear from hard particles such as sand. Therefore, bio-inspired structures can also be composed of multifunctional materials. There are currently many approaches to fabricating bio-inspired structures with conventional materials. These concepts typically utilize a system-of-systems design approach where the structure will be composed of a structural framework, an actuation system, a power source for the actuation system, controllers, and external sensors. The drawbacks to these structures include the need to assemble all of the components, interfaces between components that can compromise reliability, constraints on scaling down the structure, and very high power consumption and power generation requirements. These problems have been addressed by developing a new scalable approach to creating multifunctional materials for bio-inspired structures where the controllers, actuators, and sensors are integrated into a modular, multifunctional structure. This approach is facilitated by using multi-material multi-stage molding processes with fully embedded electronic systems, and has resulted in new Thermal and Impact Protected (TIPed) Embedded Sensing Controls Actuation Power Element (ESCAPE) Structures for compact and rugged robotic applications. }, url = {http://sem-proceedings.com/06s/sem.org-2006-SEM-Ann-Conf-s89p07-Bio-inspired-Modular-Multifunctional-Thermal-Impact-Protected-TIPed.pdf}, author = {Gyger Jr,L. S. and Spranklin,B. W. and Gupta,S.K. and Bruck,H. A.} } @article {14140, title = {Block preconditioners based on approximate commutators}, journal = {SIAM Journal on Scientific Computing}, volume = {27}, year = {2006}, month = {2006///}, pages = {1651 - 1668}, author = {Elman, Howard and Howle, V. E and Shadid, J. and Shuttleworth, R. and Tuminaro, R.} } @article {16866, title = {Building and querying a P2P virtual world}, journal = {Geoinformatica}, volume = {10}, year = {2006}, month = {2006///}, pages = {91 - 116}, abstract = {Peer-to-Peer (P2P) systems are known to provide excellent scalability in a networked environment. One peer is introduced to the system by each participant. However current P2P applications can only provide file sharing and other forms of relatively simple data communications, and, in this paper, we demonstrate how this limitation can be bridged by indexing and querying a 3D virtual-world on a dynamic distributed network. We present an algorithm for 3D range queries as well as an algorithm for nearest neighbor queries. We also show how to build such a complex application from the ground level of a P2P routing algorithm.}, doi = {10.1007/s10707-005-4887-8}, author = {Tanin,E. and Harwood,A. and Samet, Hanan and Nayar,D. and Nutanong,S.} } @article {17862, title = {Building complex coupled physical simulations on the grid with InterComm}, journal = {Engineering with Computers}, volume = {22}, year = {2006}, month = {2006///}, pages = {311 - 323}, author = {Sussman, Alan} } @conference {12264, title = {CAM04-6: Single-Path Routing of Time-varying Traffic}, booktitle = {Global Telecommunications Conference, 2006. GLOBECOM {\textquoteright}06. IEEE}, year = {2006}, month = {2006/12/27/1}, pages = {1 - 6}, abstract = {We consider the problem of finding a single-path intra-domain routing for time-varying traffic. We characterize the traffic variations by a finite set of traffic profiles with given non-zero fractions of occurrence. Our goal is to optimize the average performance over all of these traffic profiles. We solve the optimal multi-path version of this problem using linear programming and develop heuristic single-path solutions using randomized rounding and iterated rounding. We analyze our single-path heuristic (finding the optimal single-path routing is NP-hard), and prove that the randomized rounding algorithm has a worst case performance bound of O(log(KN)/log(log(KN))) compared to the optimal multi-path routing with a high probability, where K is the number of traffic profiles, and N the number of nodes in the network. Further, our simulations show the iterated rounding heuristics perform close to the optimal multi-path routing on a wide range of measured ISP topologies, in both the average and the worst-case. Overall, these results are extremely positive since they show that in a wide-range of practical situations, it is not necessary to deploy multi-path routing; instead, an appropriately computed single-path routing is sufficient to provide good performance.}, keywords = {algorithm;linear, algorithm;time-varying, algorithms;telecommunication, bound;IP, case, complexity;iterative, intra-domain, IP, methods;linear, multipath, network, network;ISP, networks;Internet;computational, optimal, performance, problem;heuristic, profile;worst, programming;optimal, programming;probability;randomised, rounding, routing;iterated, routing;probability;randomized, routing;telecommunication, single-path, topology;NP-hard, topology;telecommunication, traffic, traffic;}, doi = {10.1109/GLOCOM.2006.29}, author = {Kashyap,A. and Bhattacharjee, Bobby and La,R. and Shayman,M. and Tabatabaee,V.} } @conference {13894, title = {A case study of tangible flags: a collaborative technology to enhance field trips}, booktitle = {Proceedings of the 2006 conference on Interaction design and children}, year = {2006}, month = {2006///}, pages = {1 - 8}, author = {Chipman,G. and Druin, Allison and Beer,D. and Fails,J. A and Guha,M.L. and Simms,S.} } @conference {17007, title = {Categorizing web search results into meaningful and stable categories using fast-feature techniques}, booktitle = {Proceedings of the 6th ACM/IEEE-CS joint conference on Digital libraries}, series = {JCDL {\textquoteright}06}, year = {2006}, month = {2006///}, pages = {210 - 219}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {When search results against digital libraries and web resources have limited metadata, augmenting them with meaningful and stable category information can enable better overviews and support user exploration. This paper proposes six fast-feature techniques that use only features available in the search result list, such as title, snippet, and URL, to categorize results into meaningful categories. They use credible knowledge resources, including a US government organizational hierarchy, a thematic hierarchy from the Open Directory Project (ODP) web directory, and personal browse histories, to add valuable metadata to search results. In three tests the percent of results categorized for five representative queries was high enough to suggest practical benefits: general web search (76-90\%), government web search (39-100\%), and the Bureau of Labor Statistics website (48-94\%). An additional test submitted 250 TREC queries to a search engine and successfully categorized 66\% of the top 100 using the ODP and 61\% of the top 350. Fast-feature techniques have been implemented in a prototype search engine. We propose research directions to improve categorization rates and make suggestions about how web site designers could re-organize their sites to support fast categorization of search results.}, keywords = {Browsing, categorization, classification, metadata, open directory, taxonomies}, isbn = {1-59593-354-9}, doi = {10.1145/1141753.1141801}, url = {http://doi.acm.org/10.1145/1141753.1141801}, author = {Kules,Bill and Kustanowitz,Jack and Shneiderman, Ben} } @article {15340, title = {Characterization of the turbulence structure in supersonic boundary layers using DNS data}, journal = {AIAA Paper}, volume = {3539}, year = {2006}, month = {2006///}, author = {Ringuette,M. J and Martin, M.P and Smits,A. J. and Wu,M.} } @article {17013, title = {Classifying science: Phenomena, data, theory, method, practice: Book Reviews}, journal = {J. Am. Soc. Inf. Sci. Technol.}, volume = {57}, year = {2006}, month = {2006/12//}, pages = {1977 - 1978}, abstract = {Due to e-mail{\textquoteright}s ubiquitous nature, millions of users are intimate with the technology; however, most users are only familiar with managing their own e-mail, which is an inherently different task from exploring an e-mail archive. Historians and social scientists believe that e-mail archives are important artifacts for understanding the individuals and communities they represent. To understand the conversations evidenced in an archive, context is needed. In this article, we present a new way to gain this necessary context: analyzing the temporal rhythms of social relationships. We provide methods for constructing meaningful rhythms from the e-mail headers by identifying relationships and interpreting their attributes. With these visualization techniques, e-mail archive explorers can uncover insights that may have been otherwise hidden in the archive. We apply our methods to an individual{\textquoteright}s 15-year e-mail archive, which consists of about 45,000 messages and over 4,000 relationships. {\textcopyright} 2006 Wiley Periodicals, Inc.}, keywords = {corpus_analysis, email, hci, project--email, text_analysis, Visualization}, isbn = {1532-2882}, url = {http://dx.doi.org/10.1002/asi.v57:14}, author = {Perer,Adam and Shneiderman, Ben and Oard, Douglas} } @inbook {15727, title = {CLASSYArabic and English Multi-Document Summarization}, booktitle = {Multi-Lingual Summarization Evaluation 2006Multi-Lingual Summarization Evaluation 2006}, year = {2006}, month = {2006///}, url = {http://www.isi.edu/ cyl/MTSE2006/MSE2006/papers/index.htmlhttp://www.isi.edu/ cyl/MTSE2006/MSE2006/papers/index.html}, author = {Conroy,John M. and O{\textquoteright}Leary, Dianne P. and Schlesinger,Judith D.} } @article {17544, title = {A client-driven approach for channel management in wireless LANs}, journal = {IEEE Infocom}, volume = {6}, year = {2006}, month = {2006///}, abstract = {We propose an efficient client-based approach for channel man-agement (channel assignment and load balancing) in 802.11-based WLANs that lead to better usage of the wireless spectrum. This approach is based on a {\textquotedblleft}conflict set coloring{\textquotedblright} formulation that jointly performs load balancing along with channel assignment. Such a formulation has a number of advantages. First, it explicitly captures interference effects at clients. Next, it intrinsically ex- poses opportunities for better channel re-use. Finally, algorithms based on this formulation do not depend on specific physical RF models and hence can be applied efficiently to a wide-range of in- building as well as outdoor scenarios. We have performed extensive packet-level simulations and mea- surements on a deployed wireless testbed of 70 APs to validate the performance of our proposed algorithms. We show that in addi- tion to single network scenarios, the conflict set coloring formu- lation is well suited for channel assignment where multiple wire- less networks share and contend for spectrum in the same physical space. Our results over a wide range of both simulated topologies and in-building testbed experiments indicate that our approach improves application level performance at the clients by upto three times (and atleast 50\%) in comparison to current best-known tech- niques. }, author = {Mishra,A. and Brik,V. and Banerjee,S. and Srinivasan, Aravind and Arbaugh, William A.} } @article {17574, title = {Client-driven channel management for wireless LANs}, journal = {SIGMOBILE Mob. Comput. Commun. Rev.}, volume = {10}, year = {2006}, month = {2006/10//}, pages = {8 - 10}, abstract = {With the explosive growth in the density of 802.11 access points (APs) in the form of hotspots and public/home access networks, coordinating the shared use of spectrum has become an important problem. The irregular coverage topologies present in WLANs due to the vagaries of the indoor RF environment make the channel assignment algorithms in cellular networks inapplicable [1, 2].}, isbn = {1559-1662}, doi = {10.1145/1215976.1215981}, url = {http://doi.acm.org/10.1145/1215976.1215981}, author = {Mishra,Arunesh and Brik,Vladimir and Banerjee,Suman and Srinivasan, Aravind and Arbaugh, William A.} } @conference {14549, title = {Combination can be hard: Approximability of the unique coverage problem}, booktitle = {Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm}, year = {2006}, month = {2006///}, pages = {162 - 171}, author = {Demaine,E. D and Hajiaghayi, Mohammad T. and Feige,U. and Salavatipour,M. R} } @conference {12347, title = {A Communication Interface for Multiprocessor Signal Processing Systems}, booktitle = {Proceedings of the 2006 IEEE/ACM/IFIP Workshop on Embedded Systems for Real Time Multimedia}, year = {2006}, month = {2006/10//}, pages = {127 - 132}, publisher = {IEEE}, organization = {IEEE}, abstract = {Parallelization of embedded software is often desirable for power/performance-related considerations for computation-intensive applications that frequently occur in the signal-processing domain. Although hardware support for parallel computation is increasingly available in embedded processing platforms, there is a distinct lack of effective software support. One of the most widely known efforts in support of parallel software is the message passing interface (MPI). However, MPI suffers from several drawbacks with regards to customization to specialized parallel processing contexts, and performance degradation for communication-intensive applications. In this paper, we propose a new interface, the signal passing interface (SPI), that is targeted toward signal processing applications and addresses the limitations of MPI for this important domain of embedded software by integrating relevant properties of MPI and coarse-grain dataflow modeling. SPI is much easier and more intuitive to use, and due to its careful specialization, more performance-efficient for the targeted application domain. We present our preliminary version of SPI, along with experiments using SPI on a practical face detection system that demonstrate the capabilities of SPI}, keywords = {application program interfaces, Application software, coarse-grain dataflow modeling, Computer applications, Concurrent computing, Context, data flow graphs, Embedded computing, Embedded software, face detection system, Hardware, Message passing, message passing interface, MPI, Multiprocessing systems, multiprocessor signal processing system, PARALLEL PROCESSING, signal passing interface, Signal processing, SPI}, isbn = {0-7803-9783-5}, doi = {10.1109/ESTMED.2006.321285}, author = {Sankalita Saha and Bhattacharyya, Shuvra S. and Wayne Wolf} } @article {17533, title = {Community-oriented network measurement infrastructure (CONMI) workshop report}, journal = {ACM SIGCOMM Computer Communication Review}, volume = {36}, year = {2006}, month = {2006/04/28/}, pages = {41 - 41}, isbn = {01464833}, doi = {10.1145/1129582.1129594}, url = {http://dl.acm.org/citation.cfm?id=1129594}, author = {claffy,kc and Crovella,Mark and Friedman,Timur and Shannon,Colleen and Spring, Neil} } @conference {15266, title = {A compact mathematical programming formulation for DNA motif finding}, booktitle = {Combinatorial Pattern Matching}, year = {2006}, month = {2006///}, pages = {233 - 245}, author = {Kingsford, Carl and Zaslavsky,E. and Singh,M.} } @conference {18184, title = {Component Forensics of Digital Cameras: A Non-Intrusive Approach}, booktitle = {Information Sciences and Systems, 2006 40th Annual Conference on}, year = {2006}, month = {2006/03//}, pages = {1194 - 1199}, abstract = {This paper considers the problem of component forensics and proposes a methodology to identify the algorithms and parameters employed by various processing modules inside a digital camera. The proposed analysis techniques are non-intrusive, using only sample output images collected from the camera to find the color filter array pattern; and the algorithm and parameters of color interpolation employed in cameras. As demonstrated by various case studies in the paper, the features obtained from component forensic analysis provide useful evidence for such applications as detecting technology infringement, protecting intellectual property rights, determining camera source, and identifying image tampering.}, keywords = {analysis;image, approach;processing, array, camera;image, Color, colour, detection;optical, filter, filters;, forensics;detecting, identification;intellectual, infringement;digital, interpolation;component, intrusive, module;cameras;image, pattern;color, property, protection;non, right, sensors;interpolation;object, tampering, technology}, doi = {10.1109/CISS.2006.286646}, author = {Swaminathan,A. and Wu,M. and Liu,K. J.R} } @article {12268, title = {Cooperative peer groups in NICE}, journal = {Computer Networks}, volume = {50}, year = {2006}, month = {2006/03/15/}, pages = {523 - 544}, abstract = {We present a distributed scheme for trust inference in peer-to-peer networks. Our work is in the context of the NICE system, which is a platform for implementing cooperative applications over the Internet. We describe a technique for efficiently storing user reputation information in a completely decentralized manner, and show how this information can be used to efficiently identify non-cooperative users in NICE. We present a simulation-based study of our algorithms, in which we show our scheme scales to thousands of users using modest amounts of storage, processing, and bandwidth at any individual node. Lastly we show that our scheme is robust and can form cooperative groups in systems where the vast majority of users are malicious.}, keywords = {distributed algorithms, P2P, Reputation base trust}, isbn = {1389-1286}, doi = {10.1016/j.comnet.2005.07.012}, url = {http://www.sciencedirect.com/science/article/pii/S1389128605002185}, author = {Sherwood,Rob and Lee,Seungjoon and Bhattacharjee, Bobby} } @conference {14459, title = {Cost-sensitive learning with conditional Markov networks}, booktitle = {Proceedings of the 23rd international conference on Machine learning}, series = {ICML {\textquoteright}06}, year = {2006}, month = {2006///}, pages = {801 - 808}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {There has been a recent, growing interest in classification and link prediction in structured domains. Methods such as CRFs (Lafferty et al., 2001) and RMNs (Taskar et al., 2002) support flexible mechanisms for modeling correlations due to the link structure. In addition, in many structured domains, there is an interesting structure in the risk or cost function associated with different misclassifications. There is a rich tradition of cost-sensitive learning applied to unstructured (IID) data. Here we propose a general framework which can capture correlations in the link structure and handle structured cost functions. We present a novel cost-sensitive structured classifier based on Maximum Entropy principles that directly determines the cost-sensitive classification. We contrast this with an approach which employs a standard 0/1 loss structured classifier followed by minimization of the expected cost of misclassification. We demonstrate the utility of our proposed classifier with experiments on both synthetic and real-world data.}, isbn = {1-59593-383-2}, doi = {10.1145/1143844.1143945}, url = {http://doi.acm.org/10.1145/1143844.1143945}, author = {Sen,Prithviraj and Getoor, Lise} } @article {17042, title = {Creativity Support Tools: Report From a U.S. National Science Foundation Sponsored Workshop}, journal = {International Journal of Human-Computer Interaction}, volume = {20}, year = {2006}, month = {2006///}, pages = {61 - 77}, abstract = {Creativity support tools is a research topic with high risk but potentially very high payoff. The goal is to develop improved software and user interfaces that empower users to be not only more productive but also more innovative. Potential users include software and other engineers, diverse scientists, product and graphic designers, architects, educators, students, and many others. Enhanced interfaces could enable more effective searching of intellectual resources, improved collaboration among teams, and more rapid discovery processes. These advanced interfaces should also provide potent support in hypothesis formation, speedier evaluation of alternatives, improved understanding through visualization, and better dissemination of results. For creative endeavors that require composition of novel artifacts (e.g., computer programs, scientific papers, engineering diagrams, symphonies, artwork), enhanced interfaces could facilitate exploration of alternatives, prevent unproductive choices, and enable easy backtracking. This U.S. National Science Foundation sponsored workshop brought together 25 research leaders and graduate students to share experiences, identify opportunities, and formulate research challenges. Two key outcomes emerged: (a) encouragement to evaluate creativity support tools through multidimensional in-depth longitudinal case studies and (b) formulation of 12 principles for design of creativity support tools.Creativity support tools is a research topic with high risk but potentially very high payoff. The goal is to develop improved software and user interfaces that empower users to be not only more productive but also more innovative. Potential users include software and other engineers, diverse scientists, product and graphic designers, architects, educators, students, and many others. Enhanced interfaces could enable more effective searching of intellectual resources, improved collaboration among teams, and more rapid discovery processes. These advanced interfaces should also provide potent support in hypothesis formation, speedier evaluation of alternatives, improved understanding through visualization, and better dissemination of results. For creative endeavors that require composition of novel artifacts (e.g., computer programs, scientific papers, engineering diagrams, symphonies, artwork), enhanced interfaces could facilitate exploration of alternatives, prevent unproductive choices, and enable easy backtracking. This U.S. National Science Foundation sponsored workshop brought together 25 research leaders and graduate students to share experiences, identify opportunities, and formulate research challenges. Two key outcomes emerged: (a) encouragement to evaluate creativity support tools through multidimensional in-depth longitudinal case studies and (b) formulation of 12 principles for design of creativity support tools. }, isbn = {1044-7318}, doi = {10.1207/s15327590ijhc2002_1}, url = {http://www.tandfonline.com/doi/abs/10.1207/s15327590ijhc2002_1}, author = {Shneiderman, Ben and Fischer,Gerhard and Czerwinski,Mary and Resnick,Mitch and Myers,Brad and Candy,Linda and Edmonds,Ernest and Eisenberg,Mike and Giaccardi,Elisa and Hewett,Tom and Jennings,Pamela and Kules,Bill and Nakakoji,Kumiyo and Nunamaker,Jay and Pausch,Randy and Selker,Ted and Sylvan,Elisabeth and Terry,Michael} } @inbook {13751, title = {Cross-Language Access to Recorded Speech in the MALACH Project}, booktitle = {Text, Speech and DialogueText, Speech and Dialogue}, series = {Lecture Notes in Computer Science}, volume = {2448}, year = {2006}, month = {2006///}, pages = {197 - 212}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {The MALACH project seeks to help users find information in a vast multilingual collections of untranscribed oral history interviews. This paper introduces the goals of the project and focuses on supporting access by users who are unfamiliar with the interview language. It begins with a review of the state of the art in crosslanguage speech retrieval; approaches that will be investigated in the project are then described. Czech was selected as the first non-English language to be supported, so results of an initial experiment with Czech/English cross-language retrieval are reported.}, isbn = {978-3-540-44129-8}, url = {http://dx.doi.org/10.1007/3-540-46154-X_8}, author = {Oard, Douglas and Demner-Fushman,Dina and Haji{\v c},Jan and Ramabhadran,Bhuvana and Gustman,Samuel and Byrne,William and Soergel,Dagobert and Dorr, Bonnie J and Resnik, Philip and Picheny,Michael}, editor = {Sojka,Petr and Kopecek,Ivan and Pala,Karel} } @conference {18186, title = {Cross-Path PDMA-Based Error Protection for Streaming Multiuser Video over Multiple Paths}, booktitle = {Image Processing, 2006 IEEE International Conference on}, year = {2006}, month = {2006/10//}, pages = {21 - 24}, abstract = {In this paper, we consider aggregating multiple video streams and transmitting the merged stream over multiple error-prone paths. We propose a novel multi-stream error protection scheme based on packet division multiplexing access (PDMA) and cross-path forward error coding. Compared with the traditional time division multiplexing access (TDMA)-based error protection scheme, the proposed scheme outperforms 1.43 1.88 dB for the averaged PSNR of all received streams}, keywords = {access;error, codes;forward, coding;multiple, coding;video, correction, correction;multi-access, division, error, error-prone, forward, multiplexing, path;multistream, PDMA;cross-path, Protection, scheme;multiuser, streaming;, streaming;packet, systems;video, video}, doi = {10.1109/ICIP.2006.313151}, author = {Su,Guan-Ming and Chen,Meng and M. Wu} } @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} } @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} } @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 {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 {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} } @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 {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 {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 {12930, title = {Effect of transport at ambient temperature on detection and isolation of Vibrio cholerae from environmental samples}, journal = {Applied and environmental microbiology}, volume = {72}, year = {2006}, month = {2006///}, pages = {2185 - 2190}, abstract = {It has long been assumed that prolonged holding of environmental samples at the ambient air temperature prior to bacteriological analysis is detrimental to isolation and detection of Vibrio cholerae, the causative agent of pandemic cholera. The present study was aimed at understanding the effect of transporting environmental samples at the ambient air temperature on isolation and enumeration of V. cholerae. For water and plankton samples held at ambient temperatures ranging from 31{\textdegree}C to 35{\textdegree}C for 20 h, the total counts did not increase significantly but the number of culturable V. cholerae increased significantly compared to samples processed within 1 h of collection, as measured by culture, acridine orange direct count, direct fluorescent-antibody-direct viable count (DFA-DVC), and multiplex PCR analyses. For total coliform counts, total bacterial counts, and DFA-DVC counts, the numbers did not increase significantly, but the culturable plate counts for V. cholerae increased significantly after samples were held at the ambient temperature during transport to the laboratory for analysis. An increase in the recovery of V. cholerae O1 and improved detection of V. cholerae O1 rfb and ctxA also occurred when samples were enriched after they were kept for 20 h at the ambient temperature during transport. Improved detection and isolation of toxigenic V. cholerae from freshwater ecosystems can be achieved by holding samples at the ambient temperature, an observation that has significant implications for tracking this pathogen in diverse aquatic environments.}, author = {Alam,M. and Sadique,A. and Bhuiyan,N. A. and Nair,G. B. and Siddique,A. K. and Sack,D. A. and Ahsan,S. and Huq,A. and Sack,R. B. and Rita R Colwell and others} } @article {14959, title = {Efficient Isosurface Extraction for Large Scale Time-Varying Data Using the Persistent Hyperoctree (PHOT)}, volume = {UMIACS-TR-2006-01}, year = {2006}, month = {2006/01/13/T20:3}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {We introduce the Persistent HyperOcTree (PHOT) to handle the4D isocontouring problem for large scale time-varying data sets. This novel data structure is provably space efficient and optimal in retrieving active cells. More importantly, the set of active cells for any possible isovalue are already organized in a Compact Hyperoctree, which enables very efficient slicing of the isocontour along spatial and temporal dimensions. Experimental results based on the very large Richtmyer-Meshkov instability data set demonstrate the effectiveness of our approach. This technique can also be used for other isosurfacing schemes such as view-dependent isosurfacing and ray-tracing, which will benefit from the inherent hierarchical structure associated with the active cells. }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/3035}, author = {Shi,Qingmin and JaJa, Joseph F.} } @conference {16876, title = {Efficient position-independent iconic search using an R-theta index}, booktitle = {Proceedings of the 14th annual ACM international symposium on Advances in geographic information systems}, series = {GIS {\textquoteright}06}, year = {2006}, month = {2006///}, pages = {27 - 34}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {An iconic image database is a collection of symbolic images where each image is a collection of labeled point features called icons. A method is presented to support fast position-independent similarity search in an iconic database for symbolic images where the similarity condition involves finding icon pairs that satisfy a specific spatial relationship. This is achieved by introducing an index data structure based on r-θ space, which corresponds to the Cartesian product of separation (i.e., inter-icon distance) and (some representation of) relative spatial orientation. In this space, each pairing of two icons is represented by a single point, and all pairs with the same separation and relative orientation (regardless of absolute position) map to the same point. Similarly, all icon pairs with the same separation but different relative orientations map to points on a line parallel to the θ axis, while all pairs with different separations but the same relative orientation map to points on a line parallel to the r axis. Using such an index, database search for icon pairs with a given spatial relationship or range is accomplished by examining the subarea of the index space into which desired pairs would map. This r-θ index space can be organized using well-known spatial database techniques, such as quadtrees or R-trees. Although the size of such an index grows only linearly with respect to the number of images in the collection, it grows quadratically with the average number of icons in an image. A scheme is described to reduce the size of the index by pruning away a subset of the pairs, at the cost of incurring additional work when searching the database. This pruning is governed by a parameter φ, whose variation provides a continuous range of trade-offs between index size and search time.}, keywords = {iconic database, position-independent, spatial indexing}, isbn = {1-59593-529-0}, doi = {10.1145/1183471.1183478}, url = {http://doi.acm.org/10.1145/1183471.1183478}, author = {Cranston,Charles B. and Samet, Hanan} } @article {17696, title = {EIGENTEST: A Test Matrix Generator for Large-Scale Eigenproblems}, volume = {UMIACS-TR-2006-07}, year = {2006}, month = {2006/02/13/T19:4}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {Eigentest is a package that produces real test matrices with knowneigensystems. A test matrix, called an eigenmat, is generated in a factored form, in which the user can specify the eigenvalues and has some control over the condition of the eigenvalues and eigenvectors. An eigenmat A of order n requires only O(n) storage for its representation. Auxiliary programs permit the computation of (A - sI)*b, (A - sI){\textquoteright}*b, inv(A - sI)*b, and inv(A - sI)*b in O(n) operations. A special routine computes specified eigenvectors of an eigenmat and the condition of its eigenvalue. Thus eigenmats are suitable for testing algorithms based on Krylov sequences, as well as others based on matrix-vector products. This paper introduces the eigenmat and describes implementations in Fortran~77, Fortran~95, C, and Matlab. }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/3328}, author = {Lee,Che Rung and Stewart, G.W.} } @article {14429, title = {Empirical comparison of approximate inference algorithms for networked data}, journal = {Open Problems in Statistical Relational Learning: Papers from the ICML Workshop. Pittsburgh, PA: www. cs. umd. edu/projects/srl2006}, year = {2006}, month = {2006///}, abstract = {Over the past few years, a number of approx-imate inference algorithms for networked data have been put forth. We empirically compare the performance of three of the popular algorithms: loopy belief propagation, mean field relaxation labeling and iterative classification. We rate each algorithm in terms of its robustness to noise, both in attribute values and correlations across links. A novel observation from our experiments is that loopy belief propagation faces difficulty when in- ferring over data with homophily, a common type of link correlation observed in relational data. }, author = {Sen,P. and Getoor, Lise} } @article {13159, title = {Employing the Hand as an Interface Device}, journal = {Journal of Multimedia}, volume = {1}, year = {2006}, month = {2006/11/01/}, abstract = {We propose algorithms and applications for using the hand as an interface device in virtual and physical spaces. In virtual drawing, by tracking the hand in 3-D and estimating a virtual plane in space, the intended drawing of user is recognized. In a virtual marble game, the instantaneous orientation of the hand is simulated to render a graphical scene of the game board. Real-time visual feedback allows the user to navigate a virtual ball in a maze. In 3-D model construction, the system tracks the hand motion in space while the user is traversing edges of a physical object. The object is then rendered virtually by the computer. These applications involve estimating the 3-D absolute position and/or orientation of the hand in space. We propose parametric modelling of the central region of the hand to extract this information. A stereo camera is used to first build a preliminary disparity map of the hand. Then, the best fitting plane to the disparity points is computed using robust estimation. The 3-D hand plane is calculated based on the disparity plane and the position and orientation parameters of the hand. Tracking the hand region over a sequence of frames and coping with noise using robust modelling of the hand motion enables estimating the trajectory of the hand in space. The algorithms are real-time and experiments are presented to demonstrate the proposed applications of using the hand as an interface device.}, isbn = {1796-2048}, doi = {10.4304/jmm.1.7.18-29}, url = {http://www.ojs.academypublisher.com/index.php/jmm/article/viewArticle/01071829}, author = {Sepehri,Afshin and Yacoob,Yaser and Davis, Larry S.} } @article {18300, title = {Employing the hand as an interface device}, journal = {Journal of Multimedia}, volume = {1}, year = {2006}, month = {2006///}, pages = {18 - 29}, author = {Sepehri,A. and Yacoob,Yaser and Davis, Larry S.} } @conference {16865, title = {Enabling Query Processing on Spatial Networks}, booktitle = {Data Engineering, 2006. ICDE {\textquoteright}06. Proceedings of the 22nd International Conference on}, year = {2006}, month = {2006/04//}, pages = {163 - 163}, abstract = {A system that enables real time query processing on large spatial networks is demonstrated. The system provides functionality for processing a wide range of spatial queries such as nearest neighbor searches and spatial joins on spatial networks of sufficiently large sizes.}, doi = {10.1109/ICDE.2006.60}, author = {Sankaranarayanan,J. and Alborzi,H. and Samet, Hanan} } @article {14395, title = {Entity and relationship labeling in affiliation networks}, journal = {ICML Workshop on Statistical Network Analysis}, year = {2006}, month = {2006///}, abstract = {Many domains are best characterized as anaffiliation network describing a set of actors and a set of events interlinked together in a variety of relationships. Relational clas- sification in these domains requires the col- lective classification of both entities (actors and events) and relationships. We investigate the use of relational Markov networks (RMN) for relational classification in affiliation net- works. In this paper, we introduce a novel dataset, Profile in Terror (PIT) knowledge base, that provides a rich source of various af- filiation networks. We study two tasks, entity labeling and relationship labeling. We high- light several important issues concerning the effectiveness of relational classification. Our results show that the PIT dataset has a rich source of relational structure and therefore it is a useful dataset for statisical relational network learning community. }, author = {Zhao,B. and Sen,P. and Getoor, Lise} } @conference {14444, title = {Entity resolution in geospatial data integration}, booktitle = {Proceedings of the 14th annual ACM international symposium on Advances in geographic information systems}, series = {GIS {\textquoteright}06}, year = {2006}, month = {2006///}, pages = {83 - 90}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Due to the growing availability of geospatial data from a wide variety of sources, there is a pressing need for robust, accurate and automatic merging and matching techniques. Geospatial Entity Resolution is the process of determining, from a collection of database sources referring to geospatial locations, a single consolidated collection of {\textquoteright}true{\textquoteright} locations. At the heart of this process is the problem of determining when two locations references match---i.e., when they refer to the same underlying location. In this paper, we introduce a novel method for resolving location entities in geospatial data. A typical geospatial database contains heterogeneous features such as location name, spatial coordinates, location type and demographic information. We investigate the use of all of these features in algorithms for geospatial entity resolution. Entity resolution is further complicated by the fact that the different sources may use different vocabularies for describing the location types and a semantic mapping is required. We propose a novel approach which learns how to combine the different features to perform accurate resolutions. We present experimental results showing that methods combining spatial and non-spatial features (e.g., location-name, location-type, etc.) together outperform methods based on spatial or name information alone.}, isbn = {1-59593-529-0}, doi = {10.1145/1183471.1183486}, url = {http://doi.acm.org/10.1145/1183471.1183486}, author = {Sehgal,Vivek and Getoor, Lise and Viechnicki,Peter D} } @conference {15852, title = {Evaluation of Multilingual and Multi-modal Information Retrieval-Seventh Workshop of the Cross-Language Evaluation Forum, CLEF 2006, Alicante, Spain, September 19-21, 2006, Revised Selected Papers}, booktitle = {Seventh Workshop of the Cross-Language Evaluation Forum, CLEF 2006}, year = {2006}, month = {2006///}, address = {Alicante, Spain}, author = {Peters,C. and Clough,P. and Gey,F. and Karlgren,J. and Magnini,B. and Oard, Douglas and De Rijke,M. and Stempfhuber,M.} } @article {14479, title = {Event classification and relationship labeling in affiliation networks}, journal = {Proceedings of the Workshop on Statistical Network Analysis (SNA) at the 23rd International Conference on Machine Learning (ICML)}, year = {2006}, month = {2006///}, abstract = {Many domains are best described as an affiliation network in which there are entities such as actors, events and organizations linked together in a variety of relationships. Relational classification in these domains requires the collective classification of both entities and relationships. In this paper, we investigate the use of relational Markov networks (RMN) for relational classification in affiliation networks. We study two tasks, event classification and relationship labeling, and discuss general issues in constructing an appropriate RMN from an affiliation network. We evaluate our methods on a novel dataset describing terrorist affiliation networks which includes data about actors (terrorists), events (terrorist attacks) and organizations (terrorist organizations). Our results highlight several important issues concerning the effectiveness of relational classification and our experiments show that the relational structure significantly helps relationship labeling.}, author = {Zhao,B. and Sen,P. and Getoor, Lise} } @article {12135, title = {Experiments to understand HPC time to development}, journal = {CTWatch Quarterly}, year = {2006}, month = {2006///}, abstract = {In order to understand how high performance computing (HPC) programs are developed, a series of experiments, using students in graduate level HPC classes, have been conducted at many universities in the US. In this paper we discuss the general process of conducting those experiments, give some of the early results of those experiments, and describe a web-based process we are developing that will allow us to run additional experiments at other universities and laboratories that will be easier to conduct and generate results that more accurately reflect the process of building HPC programs.}, keywords = {hackystat, HPC, publications-journals}, url = {http://csdl.ics.hawaii.edu/techreports/06-08/06-08.pdf}, author = {Hochstein, Lorin and Nakamura,Taiga and Basili, Victor R. and Asgari, Sima and Zelkowitz, Marvin V and Hollingsworth, Jeffrey K and Shull, Forrest and Carver,Jeffrey and Voelp,Martin and Zazworka, Nico and Johnson,Philip} } @conference {15887, title = {An exploratory study of the W3C mailing list test collection for retrieval of emails with pro/con arguments}, booktitle = {Proceedings of the Third Conference on Email and Anti-Spam, Mountain View, CA, July}, year = {2006}, month = {2006///}, author = {Wu,Y. and Oard, Douglas and Soboroff,I.} } @article {16081, title = {Exploring auction databases through interactive visualization}, journal = {Decision Support Systems}, volume = {42}, year = {2006}, month = {2006/12//}, pages = {1521 - 1538}, abstract = {We introduce AuctionExplorer, a suite of tools for exploring databases of online auctions. The suite combines tools for collecting, processing, and interactively exploring auction attributes (e.g., seller rating), and the bid history (price evolution represented as a time series). Part of AuctionExplorer{\textquoteright}s power comes from its coupling of the two information structures, thereby allowing exploration of relationships between them. Exploration can be directed by hypothesis testing or exploratory data analysis. We propose a process for visual data analysis and illustrate AuctionExplorer{\textquoteright}s operations with a dataset of eBay auctions. Insights may improve seller, bidder, auction house, and other vendors{\textquoteright} understanding of the market, thereby assisting their decision making process.}, keywords = {Auction dynamics, Bid history, Online auctions, time series, user interface}, isbn = {0167-9236}, doi = {10.1016/j.dss.2006.01.001}, url = {http://www.sciencedirect.com/science/article/pii/S0167923606000042}, author = {Shmueli,Galit and Jank,Wolfgang and Aris,Aleks and Plaisant, Catherine and Shneiderman, Ben} } @conference {16087, title = {Exploring erotics in Emily Dickinson{\textquoteright}s correspondence with text mining and visual interfaces}, booktitle = {Proceedings of the 6th ACM/IEEE-CS joint conference on Digital libraries}, series = {JCDL {\textquoteright}06}, year = {2006}, month = {2006///}, pages = {141 - 150}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {This paper describes a system to support humanities scholars in their interpretation of literary work. It presents a user interface and web architecture that integrates text mining, a graphical user interface and visualization, while attempting to remain easy to use by non specialists. Users can interactively read and rate documents found in a digital libraries collection, prepare training sets, review results of classification algorithms and explore possible indicators and explanations. Initial evaluation steps suggest that there is a rationale for "provocational" text mining in literary interpretation.}, keywords = {case studies, humanities, literary criticism, text mining, user interface, Visualization}, isbn = {1-59593-354-9}, doi = {10.1145/1141753.1141781}, url = {http://doi.acm.org/10.1145/1141753.1141781}, author = {Plaisant, Catherine and Rose,James and Yu,Bei and Auvil,Loretta and Kirschenbaum,Matthew G. and Smith,Martha Nell and Clement,Tanya and Lord,Greg} } @article {17153, title = {Exploring personal media: A spatial interface supporting user-defined semantic regions}, journal = {Journal of Visual Languages \& Computing}, volume = {17}, year = {2006}, month = {2006/06//}, pages = {254 - 283}, abstract = {Graphical mechanisms for spatially organizing personal media data could enable users to fruitfully apply their conceptual models. This paper introduces Semantic regions, an innovative way for users to construct display representations of their conceptual models by drawing regions on 2D space and specifying the semantics for each region. Then users can apply personal categorizations to personal media data using the fling-and-flock metaphor. This allows personal media to be dragged to the spatially organized display and automatically grouped according to time, geography, family trees, groups of friends, or other spatially organized display representations of conceptual models. The prototype implementation for semantic regions, MediaFinder, was refined based on two small usability tests for usage and construction of user-defined conceptual models.}, keywords = {dynamic queries, Fling-and-flock, Personal media management, Spatial information management, User interfaces}, isbn = {1045-926X}, doi = {10.1016/j.jvlc.2006.01.001}, url = {http://www.sciencedirect.com/science/article/pii/S1045926X06000048}, author = {Kang,Hyunmo and Shneiderman, Ben} } @article {18211, title = {Exploring QIM-based anti-collusion fingerprinting for multimedia}, journal = {Proceedings of SPIE}, volume = {6072}, year = {2006}, month = {2006///}, pages = {698 - 709}, abstract = {Digital fingerprinting is an emerging technology to protect multimedia from unauthorizeduse by embedding a unique fingerprint signal into each user{\textquoteright}s copy. A robust embedding algorithm is an important building block in order to make the fingerprint resilient to vari- ous distortions and collusion attacks. Spread spectrum embedding has been widely used for multimedia fingerprinting. In this paper, we explore another class of embedding methods {\textendash} Quantization Index Modulation (QIM) for fingerprinting applications. We first employ Dither Modulation (DM) technique and extend it for embedding multiple symbols through a basic dither sequence design. We then develop a theoretical model and propose a new algorithm to improve the collusion resistance of the basic scheme. Simulation results show that the improvement algorithm enhances the collusion resistance, while there is still a performance gap with the existing spread spectrum based fingerprinting. We then explore coded fingerprinting based on spread transform dither modulation (STDM) embedding. Simulation results show that this coded STDM based fingerprinting has significant advantages over spread spectrum based fingerprinting under blind detection. }, author = {Swaminathan,A. and He,S. and Wu,M.} } @article {16874, title = {Extending the SAND Spatial Database System for the Visualization of Three-Dimensional Scientific Data}, journal = {Geographical Analysis}, volume = {38}, year = {2006}, month = {2006///}, pages = {87 - 101}, abstract = {The three-dimensional extension of the SAND (Spatial and Nonspatial Data) spatial database system is described as is its use for data found in scientific visualization applications. The focus is on surface data. Some of the principal operations supported by SAND involve locating spatial objects in the order of their distance from other spatial objects in an incremental manner so that the number of objects that are needed is not known a priori. These techniques are shown to be useful in enabling users to visualize the results of certain proximity queries without having to execute algorithms to completion as is the case when performing a nearest-neighbor query where a Voronoi diagram (i.e., Thiessen polygon) would be computed as a preprocessing step before any attempt to respond to the query could be made. This is achieved by making use of operations such as the spatial join and the distance semijoin. Examples of the utility of such operations is demonstrated in the context of posing meteorological queries to a spatial database with a visualization component.}, author = {Samet, Hanan and Webber,R. E} } @conference {19493, title = {Eye of the Beholder: Phone-Based Text-Recognition for the Visually-Impaired}, booktitle = {2006 10th IEEE International Symposium on Wearable Computers}, year = {2006}, month = {2006///}, pages = {145 - 146}, abstract = {Blind and visually-impaired people cannot access essential information in the form of written text in our environment (e.g., on restaurant menus, street signs, door labels, product names and instructions, expiration dates). In this paper, we present and evaluate a mobile text-recognition system capable of extracting written information from a wide variety of sources and communicating it on-demand to the user. The user needs no additional hardware except an ordinary, Internet- enabled mobile camera-phone - a device that many visually-impaired individuals already own. This approach fills a gap in assistive technologies for the visually- impaired because it makes users aware of textual information not available to them through any other means.}, keywords = {CAMERAS, data mining, handicapped aids, Hardware, Image quality, Internet, Land mobile radio cellular systems, Mobile computing, mobile handsets, mobile text-recognition system, Optical character recognition software, phone-based text-recognition, Product safety, Text recognition, visually-impaired}, author = {Tudor Dumitras and Lee, M. and Quinones, P. and Smailagic, A. and Siewiorek, Dan and Narasimhan, P.} } @conference {12273, title = {Fair file swarming with FOX}, booktitle = {Proc. 5th IPTPS}, year = {2006}, month = {2006///}, abstract = {File swarming is a popular method of coordi-nated download by which peers obtain a file from an under- provisioned server. Critical problems arise within this domain when users act selfishly, yet most systems are built with altru- ism assumed. Working under the assumption that all peers are greedy, we introduce the Fair, Optimal eXchange (FOX) protocol. FOX, in addition to effective and robust application of the tit-for-tat incentive mechanism, provides theoretically optimal download times when everyone cooperates. Under our assumption of server and peer capabilities, we develop a strong threat model that provides peers with the incentives to not deviate from the protocol. From a theoretical perspective, we prove FOX{\textquoteright}s optimality and incentive properties, even when the network consists only of purely self-interested peers. We also discuss issues in implementing and deploying such a system, and address the cost of ensuring fairness in a domain where efficiency is so important. }, author = {Levin,D. and Sherwood,R. and Bhattacharjee, Bobby} } @conference {16871, title = {A Fast k-Neighborhood Algorithm for Large Point-Clouds}, booktitle = {Proceedings of the 3rd IEEE/Eurographics Symposium on Point-Based Graphics. ACM, Boston, MA, USA}, year = {2006}, month = {2006///}, abstract = {Algorithms that use point-cloud models make heavy use of the neighborhoods of the points. These neighborhoodsare used to compute the surface normals for each point, mollification, and noise removal. All of these primitive operations require the seemingly repetitive process of finding the k nearest neighbors of each point. These algo- rithms are primarily designed to run in main memory. However, rapid advances in scanning technologies have made available point-cloud models that are too large to fit in the main memory of a computer. This calls for more efficient methods of computing the k nearest neighbors of a large collection of points many of which are already in close proximity. A fast k nearest neighbor algorithm is presented that makes use of the locality of successive points whose k nearest neighbors are sought to significantly reduce the time needed to compute the neighborhood needed for the primitive operation as well as enable it to operate in an environment where the data is on disk. Results of experiments demonstrate an order of magnitude improvement in the time to perform the algorithm and several orders of magnitude improvement in work efficiency when compared with several prominent existing method. }, author = {Sankaranarayanan,J. and Samet, Hanan and Varshney, Amitabh} } @article {17161, title = {Find that photo!: interface strategies to annotate, browse, and share}, journal = {Communications of the ACM - Supporting exploratory search}, volume = {49}, year = {2006}, month = {2006/04//}, pages = {69 - 71}, isbn = {0001-0782}, doi = {10.1145/1121949.1121985}, url = {http://doi.acm.org/10.1145/1121949.1121985}, author = {Shneiderman, Ben and Bederson, Benjamin B. and Drucker,Steven M.} } @inbook {18834, title = {Finding Mold-Piece Regions Using Computer Graphics Hardware}, booktitle = {Geometric Modeling and Processing - GMP 2006}, series = {Lecture Notes in Computer Science}, volume = {4077}, year = {2006}, month = {2006///}, pages = {655 - 662}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {An important step in the mold design process that ensures disassembly of mold pieces consists of identifying various regions on the part that will be formed by different mold pieces. This paper presents an efficient and robust algorithm to find and highlight the mold-piece regions on a part. The algorithm can be executed on current-generation computer graphics hardware. The complexity of the algorithm solely depends on the time to render the given part. By using a system that can quickly find various mold-piece regions on a part, designers can easily optimize the part and mold design and if needed make appropriate corrections upfront, streamlining the subsequent design steps.}, keywords = {Computer science}, isbn = {978-3-540-36711-6}, url = {http://www.springerlink.com/content/t8t3588924263p12/abstract/}, author = {Priyadarshi,Alok and Gupta, Satyandra K.}, editor = {Kim,Myung-Soo and Shimada,Kenji} } @article {14909, title = {First Steps Toward an Electronic Field Guide for Plants}, journal = {Taxon}, volume = {55}, year = {2006}, month = {2006///}, pages = {597 - 610}, abstract = {this paper, we will describe our progress towards building a digital collection of the Smithsonian{\textquoteright}s type specimens, developing recognition algorithms that can match an image of a leaf to the species of plant from which it comes, and designing user interfaces for interacting with an electronic field guide. To start, we are developing a prototype electronic field guide for the flora of Plummers Island, a small, well-studied island in the Potomac River. This prototype system contains multiple images for each of about 130 species of plants on the island, and should soon grow to cover all 200+ species currently recorded (Shetler et al., 2005). Images of full specimens are available, as well as images of isolated leaves of each species. A zoomable user interface allows a user to browse these images, zooming in on ones of interest. Visual recognition algorithms assist a botanist in locating the specimens that are most relevant to identify the species of a plant. The system currently runs on a small hand-held computer. We will describe the components of this prototype, and also describe some of the future challenges we anticipate if we are to provide botanists in the field with all the resources that are now currently available in the world{\textquoteright}s museums and herbaria. Type Specimen Digital Collection The first challenge in producing our electronic field guide is to create a digital collection covering all of the Smithsonian{\textquoteright}s 85,000 vascular plant type specimens. For each type specimen, the database should eventually include systematically acquired high-resolution digital images of the specimen, textual descriptions, links to decision trees, images of live plants, and 3D models. Figure 1: On the left, our set-up at the Smithsonian for digitally photographing type specimens. On the...}, author = {Haibin,Gaurav Agarwal and Agarwal,Gaurav and Ling,Haibin and Jacobs, David W. and Shirdhonkar,Sameer and Kress,W. John and Russell,Rusty and Belhumeur,Peter and Dixit,An and Feiner,Steve and Mahajan,Dhruv and Sunkavalli,Kalyan and Ramamoorthi,Ravi and White,Sean} } @book {19348, title = {Foundations of Multidimensional And Metric Data Structures}, year = {2006}, month = {2006}, pages = {1023}, publisher = {Morgan Kaufmann}, organization = {Morgan Kaufmann}, abstract = {The field of multidimensional data structures is large and growing very quickly. Here, for the first time, is a thorough treatment of multidimensional point data, object and image-based representations, intervals and small rectangles, and high-dimensional datasets. The book includes a thorough introduction; a comprehensive survey to spatial and multidimensional data structures and algorithms; and implementation details for the most useful data structures. Along with the hundreds of worked exercises and hundreds of illustrations, the result is an excellent and valuable reference tool for professionals in many areas, including computer graphics, databases, geographic information systems (GIS), game programming, image processing, pattern recognition, solid modeling, similarity retrieval, and VLSI design. Award Winner in 2006 Best Book competition in Professional and Scholarly Publishing from the Association of American Publishers. Morgan Kaufmann would like to congratulate Hanan Samet on receiving the UCGIS 2009 Research Award! Read the announcement here: http: //www.ucgis.org/summer2009/researchaward.htm * First comprehensive work on multidimensional data structures available, a thorough and authoritative treatment. * An algorithmic rather than mathematical approach, with a liberal use of examples that allows the readers to easily see the possible implementation and use. * Each section includes a large number of exercises and solutions to self-test and confirm the reader{\textquoteright}s understanding and suggest future directions. * Written by a well-known authority in the area of spatial data structures who has made many significant contributions to the field. The author{\textquoteright}s website includes: Spatial Index Demos}, keywords = {Computers / Data Modeling \& Design, Computers / Data Processing, Computers / Databases / General}, isbn = {9780123694461}, author = {Samet, Hanan} } @book {16863, title = {Foundations of Multidimensional And Metric Data Structures}, year = {2006}, month = {2006/08/08/}, publisher = {Morgan Kaufmann}, organization = {Morgan Kaufmann}, abstract = {The field of multidimensional data structures is large and growing very quickly. Here, for the first time, is a thorough treatment of multidimensional point data, object and image-based representations, intervals and small rectangles, and high-dimensional datasets. The book includes a thorough introduction; a comprehensive survey to spatial and multidimensional data structures and algorithms; and implementation details for the most useful data structures. Along with the hundreds of worked exercises and hundreds of illustrations, the result is an excellent and valuable reference tool for professionals in many areas, including computer graphics, databases, geographic information systems (GIS), game programming, image processing, pattern recognition, solid modeling, similarity retrieval, and VLSI design. Award Winner in 2006 "Best Book" competition in Professional and Scholarly Publishing from the Association of American Publishers. Morgan Kaufmann would like to congratulate Hanan Samet on receiving the UCGIS 2009 Research Award! Read the announcement here: http://www.ucgis.org/summer2009/researchaward.htm * First comprehensive work on multidimensional data structures available, a thorough and authoritative treatment. * An algorithmic rather than mathematical approach, with a liberal use of examples that allows the readers to easily see the possible implementation and use. * Each section includes a large number of exercises and solutions to self-test and confirm the reader{\textquoteright}s understanding and suggest future directions. * Written by a well-known authority in the area of spatial data structures who has made many significant contributions to the field. The author{\textquoteright}s website includes: Spatial Index Demos}, keywords = {Computer algorithms, Computers / Computer Graphics, Computers / Computer Vision \& Pattern Recognition, Computers / Data Modeling \& Design, Computers / Data Processing, Computers / Database Management / General, Computers / Programming / General, Computers / User Interfaces, Data structures (Computer science), Science / Physics / General}, isbn = {9780123694461}, author = {Samet, Hanan} } @article {14611, title = {Functional Analysis of Hes-1 in Preadipocytes}, journal = {Molecular EndocrinologyMolecular Endocrinology}, volume = {20}, year = {2006}, month = {2006/03/01/}, pages = {698 - 705}, abstract = {Notch signaling blocks differentiation of 3T3-L1 preadipocytes, and this can be mimicked by constitutive expression of the Notch target gene Hes-1. Although considered initially to function only as a repressor, recent evidence indicates that Hes-1 can also activate transcription. We show here that the domains of Hes-1 needed to block adipogenesis coincide with those necessary for transcriptional repression. HRT1, another basic-helix-loop-helix protein and potential Hes-1 partner, was also induced by Notch in 3T3-L1 cells but did not block adipogenesis, suggesting that Hes-1 functions primarily as a homodimer or possibly as a heterodimer with an unknown partner. Purification of Hes-1 identified the Groucho/transducin-like enhancer of split family of corepressors as the only significant Hes-1 interacting proteins in vivo. An evaluation of global gene expression in preadipocytes identified approximately 200 Hes-1-responsive genes comprising roughly equal numbers of up-regulated and down-regulated genes. However, promoter analyses indicated that the down-regulated genes were significantly more likely to contain Hes-1 binding sites, indicating that Hes-1 is more likely to repress transcription of its direct targets. We conclude that Notch most likely blocks adipogenesis through the induction of Hes-1 homodimers, which repress transcription of key target genes.}, isbn = {0888-8809, 1944-9917}, doi = {10.1210/me.2005-0325}, url = {http://mend.endojournals.org/content/20/3/698}, author = {Ross,David A and Hannenhalli, Sridhar and Tobias,John W and Cooch,Neil and Shiekhattar,Ramin and Kadesch,Tom} } @article {17736, title = {The Gram-Schmidt Algorithm and Its Variations}, volume = {UMIACS-TR-2004-84}, year = {2006}, month = {2006/01/13/}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {The Gram--Schmidt algorithm is a widely used method fororthogonalizing a sequence of vectors. It comes in two forms: classical Gram--Schmidt and modified Gram--Schmidt, each of whose operations can be ordered in different ways. This expository paper gives a systematic treatment of this confusing variety of algorithms. It also treats the numerical issue of loss of orthogonality and reorthogonalization as well as the implementation of column pivoting. }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/3036}, author = {Stewart, G.W.} } @article {17189, title = {Hierarchical Layouts for Photo Libraries}, journal = {IEEE Multimedia}, volume = {13}, year = {2006}, month = {2006/12//Oct}, pages = {62 - 72}, abstract = {We use an annotated digital photo collection to demonstrate a two-level auto-layout technique consisting of a central primary region with secondary regions surrounding it. Because the object sizes within regions can only be changed in discrete units, we refer to them as quantum content. Our real-time algorithms enable a compelling interactive display as users resize the canvas, or move and resize the primary region}, keywords = {annotated digital photo collection, auto-layout technique, bi-level hierarchies, Computer science, data visualisation, digital libraries, document image processing, Information Visualization, interactive algorithms, interactive displays, Libraries, Lifting equipment, Organization Charts, photo collections, photo layouts, photo library, Photography, quantum content, Silver, Springs, User interfaces, Web pages}, isbn = {1070-986X}, doi = {10.1109/MMUL.2006.83}, author = {Kustanowitz,J. and Shneiderman, Ben} } @article {12814, title = {High-confidence medical device software and systems}, journal = {Computer}, volume = {39}, year = {2006}, month = {2006/04//}, pages = {33 - 38}, abstract = {Given the shortage of caregivers and the increase in an aging US population, the future of US healthcare quality does not look promising and definitely is unlikely to be cheaper. Advances in health information systems and healthcare technology offer a tremendous opportunity for improving the quality of care while reducing costs. The development and production of medical device software and systems is a crucial issue, both for the US economy and for ensuring safe advances in healthcare delivery. As devices become increasingly smaller in physical terms but larger in software terms, the design, testing, and eventual Food and Drug Administration (FDA) device approval is becoming much more expensive for medical device manufacturers both in terms of time and cost. Furthermore, the number of devices that have recently been recalled due to software and hardware problems is increasing at an alarming rate. As medical devices are becoming increasingly networked, ensuring even the same level of health safety seems a challenge.}, keywords = {Aging, biomedical equipment, Clinical software engineering, Costs, FDA device, Food and Drug Administration device, health and safety, health care, health information system, health safety, healthcare delivery, Healthcare technology, Information systems, medical computing, medical device manufacturing, medical device software development, medical device systems development, medical information systems, Medical services, Medical software, Medical tests, networked medical devices, Production systems, Software design, Software safety, Software systems, Software testing, US healthcare quality}, isbn = {0018-9162}, doi = {10.1109/MC.2006.127}, author = {Lee,I. and Pappas,G. J and Cleaveland, Rance and Hatcliff,J. and Krogh,B. H and Lee,P. and Rubin,H. and Sha,L.} } @article {19661, title = {How Multirobot Systems Research will Accelerate our Understanding of Social Animal Behavior}, journal = {Proceedings of the IEEE}, volume = {94}, year = {2006}, month = {2006/07//}, pages = {1445 - 1463}, abstract = {Our understanding of social insect behavior has significantly influenced artificial intelligence (AI) and multirobot systems{\textquoteright} research (e.g., ant algorithms and swarm robotics). In this work, however, we focus on the opposite question: "How can multirobot systems research contribute to the understanding of social animal behavior?" As we show, we are able to contribute at several levels. First, using algorithms that originated in the robotics community, we can track animals under observation to provide essential quantitative data for animal behavior research. Second, by developing and applying algorithms originating in speech recognition and computer vision, we can automatically label the behavior of animals under observation. In some cases the automatic labeling is more accurate and consistent than manual behavior identification. Our ultimate goal, however, is to automatically create, from observation, executable models of behavior. An executable model is a control program for an agent that can run in simulation (or on a robot). The representation for these executable models is drawn from research in multirobot systems programming. In this paper we present the algorithms we have developed for tracking, recognizing, and learning models of social animal behavior, details of their implementation, and quantitative experimental results using them to study social insects}, keywords = {Acceleration, Animal behavior, ant movement tracking, Artificial intelligence, biology computing, Computer vision, control engineering computing, Insects, Intelligent robots, Labeling, monkey movement tracking, multi-robot systems, multirobot systems, robotics algorithms, Robotics and automation, social animal behavior, social animals, social insect behavior, Speech recognition, tracking}, isbn = {0018-9219}, author = {Balch, T. and Dellaert, F. and Feldman, A. and Guillory, A. and Isbell, C.L. and Zia Khan and Pratt, S.C. and Stein, A.N. and Wilde, H.} } @book {16872, title = {Image Database Systems and Techniques: A Symbolic Approach}, year = {2006}, month = {2006///}, publisher = {Morgan Kaufmann Publishers Inc.}, organization = {Morgan Kaufmann Publishers Inc.}, address = {San Francisco, CA, USA}, isbn = {1558605495}, author = {Samet, Hanan and Soffer,Aya} } @article {16867, title = {Image Similarity and Asymmetry to Improve Computer-Aided Detection of Breast Cancer}, journal = {Digital Mammography}, year = {2006}, month = {2006///}, pages = {221 - 228}, abstract = {An improved image similarity method is introduced to recognize breast cancer, and it is incorporated into a computer-aided breast cancer detection system through Bayes Theorem. Radiologists can use the differences between the left and right breasts, or asymmetry, in mammograms to help detect certain malignant breast cancers. Image similarity is used to determine asymmetry using a contextual and then a spatial comparison. The mammograms are filtered to find the most contextually significant points, and then the resulting point set is analyzed for spatial similarity. We develop the analysis through a combination of modeling and supervised learning of model parameters. This process correctly classifies mammograms 84\% of the time, and significantly improves the accuracy of a computer-aided breast cancer detection system by 71\%.}, doi = {10.1007/11783237_31}, author = {Tahmoush,D. and Samet, Hanan} } @conference {18226, title = {Image Tampering Identification using Blind Deconvolution}, booktitle = {Image Processing, 2006 IEEE International Conference on}, year = {2006}, month = {2006/10//}, pages = {2309 - 2312}, abstract = {Digital images have been used in growing number of applications from law enforcement and surveillance, to medical diagnosis and consumer photography. With such widespread popularity and the presence of low-cost image editing softwares, the integrity of image content can no longer be taken for granted. In this paper, we propose a novel technique based on blind deconvolution to verify image authenticity. We consider the direct output images of a camera as authentic, and introduce algorithms to detect further processing such as tampering applied to the image. Our proposed method is based on the observation that many tampering operations can be approximated as a combination of linear and non-linear components. We model the linear part of the tampering process as a filter, and obtain its coefficients using blind deconvolution. These estimated coefficients are then used to identify possible manipulations. We demonstrate the effectiveness of the proposed image authentication technique and compare our results with existing works}, keywords = {(access, approximation;blind, authentication;image, coding;, compression;deconvolution;filtering, control);data, deconvolution;camera;consumer, diagnosis;surveillance;tampering, editing, identification;approximation, images;filter, photography;digital, process;image, softwares;medical, theory;biometrics, theory;image}, doi = {10.1109/ICIP.2006.312848}, author = {Swaminathan,A. and M. Wu and Liu,K. J.R} } @conference {16451, title = {Implementing a bioinformatics pipeline (bip) on a mediator platform: Comparing cost and quality of alternate choices}, booktitle = {Data Engineering Workshops, 2006. Proceedings. 22nd International Conference on}, year = {2006}, month = {2006///}, pages = {67 - 67}, author = {Eckman,B. A and Gaasterland,T. and Lacroix,Z. and Raschid, Louiqa and Snyder,B. and Vidal,M. E} } @article {15249, title = {An improved approximation algorithm for vertex cover with hard capacities}, journal = {Journal of Computer and System Sciences}, volume = {72}, year = {2006}, month = {2006/02//}, pages = {16 - 33}, abstract = {We study the capacitated vertex cover problem, a generalization of the well-known vertex-cover problem. Given a graph G = ( V , E ) , the goal is to cover all the edges by picking a minimum cover using the vertices. When we pick a vertex, we can cover up to a pre-specified number of edges incident on this vertex (its capacity). The problem is clearly NP-hard as it generalizes the well-known vertex-cover problem. Previously, approximation algorithms with an approximation factor of 2 were developed with the assumption that an arbitrary number of copies of a vertex may be chosen in the cover. If we are allowed to pick at most a fixed number of copies of each vertex, the approximation algorithm becomes much more complex. Chuzhoy and Naor (FOCS, 2002) have shown that the weighted version of this problem is at least as hard as set cover; in addition, they developed a 3-approximation algorithm for the unweighted version. We give a 2-approximation algorithm for the unweighted version, improving the Chuzhoy{\textendash}Naor bound of three and matching (up to lower-order terms) the best approximation ratio known for the vertex-cover problem.}, keywords = {Approximation algorithms, Capacitated covering, Linear programming, Randomized rounding, Set cover, Vertex cover}, isbn = {0022-0000}, doi = {10.1016/j.jcss.2005.06.004}, url = {http://www.sciencedirect.com/science/article/pii/S0022000005000747}, author = {Gandhi,Rajiv and Halperin,Eran and Khuller, Samir and Kortsarz,Guy and Srinivasan, Aravind} } @article {16088, title = {Integrating data and interfaces to enhance understanding of government statistics: toward the national statistical knowledge network project briefing}, journal = {Proceedings of 7th Annual International Conference on Digital Libraries (DG06)}, year = {2006}, month = {2006///}, pages = {21 - 24}, abstract = {This paper reports the results of work in the final no-costextension year of a digital government project that developed user interface models and prototypes to help people find and understand government statistics; proposed a Statistical Knowledge Network architecture that supports cross agency information access; and demonstrated models for government- academic collaboration. }, author = {Marchionini,G. and Haas,S. and Plaisant, Catherine and Shneiderman, Ben} } @article {14979, title = {Isosurface Extraction and Spatial Filtering using Persistent Octree (POT)}, journal = {Visualization and Computer Graphics, IEEE Transactions on}, volume = {12}, year = {2006}, month = {2006/10//sept}, pages = {1283 - 1290}, abstract = {We propose a novel persistent octree (POT) indexing structure for accelerating isosurface extraction and spatial filtering from volumetric data. This data structure efficiently handles a wide range of visualization problems such as the generation of view-dependent isosurfaces, ray tracing, and isocontour slicing for high dimensional data. POT can be viewed as a hybrid data structure between the interval tree and the branch-on-need octree (BONO) in the sense that it achieves the asymptotic bound of the interval tree for identifying the active cells corresponding to an isosurface and is more efficient than BONO for handling spatial queries. We encode a compact octree for each isovalue. Each such octree contains only the corresponding active cells, in such a way that the combined structure has linear space. The inherent hierarchical structure associated with the active cells enables very fast filtering of the active cells based on spatial constraints. We demonstrate the effectiveness of our approach by performing view-dependent isosurfacing on a wide variety of volumetric data sets and 4D isocontour slicing on the time-varying Richtmyer-Meshkov instability dataset}, keywords = {4D isocontour slicing;Richtmyer-Meshkov instability dataset;branch-on-need octree;hybrid data structure;isosurface extraction;persistent octree;spatial filtering;data visualisation;database indexing;feature extraction;octrees;spatial data structures;Algor, Computer-Assisted;Imaging, Three-Dimensional;Information Storage and Retrieval;User-Computer Interface;}, isbn = {1077-2626}, doi = {10.1109/TVCG.2006.157}, author = {Shi,Q. and JaJa, Joseph F.} } @article {18231, title = {JET: dynamic join-exit-tree amortization and scheduling for contributory key management}, journal = {IEEE/ACM Trans. Netw.}, volume = {14}, year = {2006}, month = {2006/10//}, pages = {1128 - 1140}, abstract = {In secure group communications, the time cost associated with key updates in the events of member join and departure is an important aspect of quality of service, especially in large groups with highly dynamic membership. To achieve better time efficiency, we propose a join-exit-tree (JET) key management framework. First, a special key tree topology with join and exit subtrees is introduced to handle key updates for dynamic membership. Then, optimization techniques are employed to determine the capacities of join and exit subtrees for achieving the best time efficiency, and algorithms are designed to dynamically update the join and exit trees. We show that, on average, the asymptotic time cost for each member join/departure event is reduced to O(log (log n)) from the previous cost of O(log n), where n is the group size. Our experimental results based on simulated user activities as well as the real MBone data demonstrate that the proposed JET scheme can significantly improve the time efficiency, while maintaining low communication and computation cost, of tree-based contributory key management.}, keywords = {contributory key management, dynamic tree topology, secure group communications, time efficiency}, isbn = {1063-6692}, doi = {10.1109/TNET.2006.882851}, url = {http://dx.doi.org/10.1109/TNET.2006.882851}, author = {Mao,Yinian and Sun,Yan and M. Wu and Liu,K. J.R} } @inbook {12639, title = {Key Frame-Based Activity Representation Using Antieigenvalues}, booktitle = {Computer Vision {\textendash} ACCV 2006Computer Vision {\textendash} ACCV 2006}, series = {Lecture Notes in Computer Science}, volume = {3852}, year = {2006}, month = {2006///}, pages = {499 - 508}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {Many activities may be characterized by a sequence of key frames that are related to important changes in motion rather than dominant characteristics that persist over a long sequence of frames. To detect such changes, we define a transformation operator at every time instant, which relates the past to the future states. One of the useful quantities associated with numerical range of an operator is the eigenvalue. In the literature, eigenvalue-based approaches have been studied extensively for many modeling tasks. These rely on gross properties of the data and are not suitable to detect subtle changes. We propose an antieigenvalue {\textendash} based measure to detect key frames. Antieigenvalues depend critically on the turning of the operator, whereas eigenvalues represent the amount of dilation along the eigenvector directions aligned with the direction of maximum variance. We demonstrate its application to activity modeling and recognition using two datasets: a motion capture dataset and the UCF human action dataset.}, isbn = {978-3-540-31244-4}, url = {http://dx.doi.org/10.1007/11612704_50}, author = {Cuntoor,Naresh and Chellapa, Rama}, editor = {Narayanan,P. and Nayar,Shree and Shum,Heung-Yeung} } @article {17272, title = {Knowledge discovery in high-dimensional data: case studies and a user survey for the rank-by-feature framework}, journal = {IEEE Transactions on Visualization and Computer Graphics}, volume = {12}, year = {2006}, month = {2006/06//May}, pages = {311 - 322}, abstract = {Knowledge discovery in high-dimensional data is a challenging enterprise, but new visual analytic tools appear to offer users remarkable powers if they are ready to learn new concepts and interfaces. Our three-year effort to develop versions of the hierarchical clustering explorer (HCE) began with building an interactive tool for exploring clustering results. It expanded, based on user needs, to include other potent analytic and visualization tools for multivariate data, especially the rank-by-feature framework. Our own successes using HCE provided some testimonial evidence of its utility, but we felt it necessary to get beyond our subjective impressions. This paper presents an evaluation of the hierarchical clustering explorer (HCE) using three case studies and an e-mail user survey (n=57) to focus on skill acquisition with the novel concepts and interface for the rank-by-feature framework. Knowledgeable and motivated users in diverse fields provided multiple perspectives that refined our understanding of strengths and weaknesses. A user survey confirmed the benefits of HCE, but gave less guidance about improvements. Both evaluations suggested improved training methods}, keywords = {case study, Computer aided software engineering, Computer Society, Data analysis, data mining, data visualisation, Data visualization, database management systems, e-mail user survey, Genomics, Helium, Hierarchical Clustering Explorer, hierarchical clustering explorer., high-dimensional data, Histograms, Information visualization evaluation, interactive systems, interactive tool, knowledge discovery, multivariate data, Rank-by-feature framework, Scattering, Testing, user interface, User interfaces, user survey, visual analytic tools, visual analytics, visualization tools}, isbn = {1077-2626}, doi = {10.1109/TVCG.2006.50}, author = {Seo,Jinwook and Shneiderman, Ben} } @article {14436, title = {Learning through failure}, journal = {Probabilistic, Logical and Relational Learning-Towards a Synthesis}, year = {2006}, month = {2006///}, abstract = {PRISM, a symbolic-statistical modeling language we have been developing since {\textquoteright}97, recently incorporated a program transformation technique to handle failure in generative modeling. I{\textquoteright}ll show this feature opens a way to new breeds of symbolic models, including EM learning from negative observations, constrained HMMs and finite PCFGs.}, author = {Sato,T. and Kameya,Y. and De Raedt,L. and Dietterich,T. and Getoor, Lise and Muggleton,S. H} } @inbook {17620, title = {Lower Bounds on the Deterministic and Quantum Communication Complexities of Hamming-Distance Problems}, booktitle = {Algorithms and ComputationAlgorithms and Computation}, series = {Lecture Notes in Computer Science}, volume = {4288}, year = {2006}, month = {2006///}, pages = {628 - 637}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {A sub-area of discrepancy theory that has received much attention in computer science re-cently, is that of explicit constructions of low-discrepancy point sets for various types of rectangle families in high dimension. This research has led to interesting applications in error-control cod- ing, distributed protocols, Web document filtering, derandomization, and other areas. We give a short survey of this area here. }, isbn = {978-3-540-49694-6}, url = {http://dx.doi.org/10.1007/11940128_63}, author = {Ambainis,Andris and Gasarch,William and Srinivasan, Aravind and Utis,Andrey}, editor = {Asano,Tetsuo} } @article {16864, title = {Maintenance of K-nn and spatial join queries on continuously moving points}, journal = {ACM Trans. Database Syst.}, volume = {31}, year = {2006}, month = {2006/06//}, pages = {485 - 536}, abstract = {Cars, aircraft, mobile cell phones, ships, tanks, and mobile robots all have the common property that they are moving objects. A kinematic representation can be used to describe the location of these objects as a function of time. For example, a moving point can be represented by the function p(t) = \&OV0489;0 + (t - t0)\&OV0505;, where \&OV0489;0 is the start location, t0 is the start time, and \&OV0505; is its velocity vector. Instead of storing the location of the object at a given time in a database, the coefficients of the function are stored. When an object{\textquoteright}s behavior changes enough so that the function describing its location is no longer accurate, the function coefficients for the object are updated. Because the location of each object is represented as a function of time, spatial query results can change even when no transactions update the database. We present efficient algorithms to maintain k-nearest neighbor, and spatial join queries in this domain as time advances and updates occur. We assume no previous knowledge of what the updates will be before they occur. We experimentally compare these new algorithms with more straight forward adaptations of previous work to support updates. Experiments are conducted using synthetic uniformly distributed data, and real aircraft flight data. The primary metric of comparison is the number of I/O disk accesses needed to maintain the query results and the supporting data structures.}, keywords = {k-nearest neighbor, continuously moving objects, materialized view maintenance, Moving object databases, Spatial join, temporal databases}, isbn = {0362-5915}, doi = {10.1145/1138394.1138396}, url = {http://doi.acm.org/10.1145/1138394.1138396}, author = {Iwerks,Glenn S. and Samet, Hanan and Smith,Kenneth P.} } @conference {17285, title = {Making a difference: integrating socially relevant projects into HCI teaching}, booktitle = {CHI {\textquoteright}06 extended abstracts on Human factors in computing systems}, series = {CHI EA {\textquoteright}06}, year = {2006}, month = {2006///}, pages = {41 - 44}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Enriching courses on human-computer interaction with socially-relevant projects provides a compelling opportunity for students to improve their education and make socially beneficial contributions. By having clearly defined user communities outside the classroom, students have the chance to practice their interview, observation, and usability testing skills, while developing projects that continue beyond the semester. These projects often give students life-changing exposure to genuine needs and impressive results to include in their portfolio when seeking employment. Educators will present their strategies for arranging, supervising, and grading these projects. Students will describe their experience and how it influenced them.}, keywords = {education, making a difference, relevance, service learning, social impact, team projects}, isbn = {1-59593-298-4}, doi = {10.1145/1125451.1125463}, url = {http://doi.acm.org/10.1145/1125451.1125463}, author = {Shneiderman, Ben and Bishop,Ann and Friedman,Batya and Lazar,Jonathan and Marsden,Gary and Nass,Cliff} } @conference {14706, title = {Managing policy updates in security-typed languages}, booktitle = {19th IEEE Computer Security Foundations Workshop, 2006}, year = {2006}, month = {2006///}, pages = {13 pp.-216 - 13 pp.-216}, publisher = {IEEE}, organization = {IEEE}, abstract = {This paper presents Rx, a new security-typed programming language with features intended to make the management of information-flow policies more practical. Security labels in Rx, in contrast to prior approaches, are defined in terms of owned roles, as found in the RT role-based trust-management framework. Role-based security policies allow flexible delegation, and our language Rx provides constructs through which programs can robustly update policies and react to policy updates dynamically. Our dynamic semantics use statically verified transactions to eliminate illegal information flows across updates, which we call transitive flows. Because policy updates can be observed through dynamic queries, policy updates can potentially reveal sensitive information. As such, Rx considers policy statements themselves to be potentially confidential information and subject to information-flow metapolicies}, keywords = {Access control, Computer languages, Data security, Database systems, dynamic queries, dynamic semantics, Educational institutions, high level languages, Information security, information-flow policy management, Lattices, Network servers, Operating systems, policy update management, Robustness, role-based security policies, RT role-based trust-management framework, Rx security-typed programming language, security of data, statically verified transactions, transitive flows}, isbn = {0-7695-2615-2}, doi = {10.1109/CSFW.2006.17}, author = {Swamy,N. and Hicks, Michael W. and Tse,S. and Zdancewic,S.} } @conference {12391, title = {Mapping Multimedia Applications Onto Configurable Hardware With Parameterized Cyclo-Static Dataflow Graphs}, booktitle = {Acoustics, Speech and Signal Processing, 2006. ICASSP 2006 Proceedings. 2006 IEEE International Conference on}, volume = {3}, year = {2006}, month = {2006/05//}, pages = {III - III}, abstract = {This paper develops methods for model-based design and implementation of image processing applications. We apply our previously developed meta-modeling technique of homogeneous parameterized dataflow (HPDF) (M. Sen et al., 2005) to the framework of cyclostatic dataflow (CSDF) (G. Bilsen et al., 1996), and demonstrate this integrated modeling methodology through hardware mapping of a gesture recognition application. We also provide a comparative study between HPDF/CSDF-based representation of the gesture recognition application, and a previously developed version based on applying HPDF in conjunction with conventional synchronous dataflow (SDF) semantics (M. Sen et al., 2005)}, keywords = {configurable hardware, Data communication, Gesture recognition, gesture recognition application, graph theory, hardware mapping, image processing applications, mapping multimedia applications, meta-modeling technique, model-based design, Multimedia communication, parameterized cyclo-static dataflow graphs}, doi = {10.1109/ICASSP.2006.1660838}, author = {Haim,F. and Sen,M. and Ko,Dong-Ik and Bhattacharyya, Shuvra S. and Wolf,W.} } @article {12266, title = {Matching Jobs to Resources in Distributed Desktop Grid Environments}, journal = {Technical Reports from UMIACS, UMIACS-TR-2006-15}, year = {2006}, month = {2006/04//}, abstract = {Desktop grids use opportunistic sharing to exploit large collectionsof personal computers and workstations across the Internet and can achieve tremendous computing power with low cost. However, current systems are typically based on a traditional client-server architecture, which has inherent shortcomings with respect to robustness, reliability and scalability. In this paper, we propose a decentralized, robust, highly available, and scalable infrastructure to match incoming jobs to available resources. The key idea behind our proposed system is to leverage information provided by an underlying peer-to-peer system to create a hierarchical Rendezvous Node Tree, which performs the matching efficiently. Our experimental results obtained via simulation show that we can effectively match jobs with varying levels of resource constraints to available nodes and maintain good load balance in a fully decentralized heterogeneous computational environment. }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/3669}, author = {Kim,Jik-Soo and Bhattacharjee, Bobby and Keleher, Peter J. and Sussman, Alan} } @article {12274, title = {Measurement-based optimal routing on overlay architectures for unicast sessions}, journal = {Computer Networks}, volume = {50}, year = {2006}, month = {2006///}, pages = {1938 - 1951}, abstract = {We propose a measurement-based routing algorithm to load-balance intradomain traffic along multiple paths for multi-ple unicast sources. Multiple paths are established using overlay nodes. The distributed algorithm is derived from simul- taneous perturbation stochastic approximation (SPSA) and does not assume that the gradient of an analytical cost function is known. Instead, we rely on (potentially) noisy estimates from local measurements. Using the analytical model presented in the paper, we first show the almost sure convergence of the algorithm to the optimal solution under a decreas- ing step size policy (as with a standard SPSA model). Motivated by practical concerns, we next consider the constant step size case, for which we establish weak convergence. We provide simulation results to demonstrate the advantages of our proposed algorithm under various network scenarios, and also present a comparative study with MATE (an existing opti- mal routing algorithm) }, author = {La,R.J. and Shayman,M.A. and Bhattacharjee, Bobby} } @article {12636, title = {Measuring human movement for biomechanical applications using markerless motion capture}, journal = {Proceedings of SPIE}, volume = {6056}, year = {2006}, month = {2006///}, pages = {60560R - 60560R}, abstract = {Modern biomechanical and clinical applications require the accurate capture of normal and pathological humanmovement without the artifacts associated with standard marker-based motion capture techniques such as soft tissue artifacts and the risk of artificial stimulus of taped-on or strapped-on markers. In this study, the need for new markerless human motion capture methods is discussed in view of biomechanical applications. Three different approaches for estimating human movement from multiple image sequences were explored. The first two approaches tracked a 3D articulated model in 3D representations constructed from the image sequences, while the third approach tracked a 3D articulated model in multiple 2D image planes. The three methods are systematically evaluated and results for real data are presented. The role of choosing appropriate technical equipment and algorithms for accurate markerless motion capture is critical. The implementation of this new methodology offers the promise for simple, time-efficient, and potentially more meaningful assessments of human movement in research and clinical practice. }, author = {M{\"u}ndermann, L. and Corazza, S. and Chaudhari, A.M. and Andriacchi, T.P. and Sundaresan, A. and Chellapa, Rama} } @conference {12325, title = {Memory-constrained block processing optimization for synthesis of DSP software}, booktitle = {Embedded Computer Systems: Architectures, Modeling and Simulation, 2006. IC-SAMOS 2006. International Conference on}, year = {2006}, month = {2006///}, pages = {137 - 143}, author = {Ko,M. Y and Shen,C. C and Bhattacharyya, Shuvra S.} } @article {16276, title = {Metagenomic Analysis of the Human Distal Gut Microbiome}, journal = {Science}, volume = {312}, year = {2006}, month = {2006/06/02/}, pages = {1355 - 1359}, abstract = {The human intestinal microbiota is composed of 1013 to 1014 microorganisms whose collective genome ({\textquotedblleft}microbiome{\textquotedblright}) contains at least 100 times as many genes as our own genome. We analyzed \~{}78 million base pairs of unique DNA sequence and 2062 polymerase chain reaction{\textendash}amplified 16S ribosomal DNA sequences obtained from the fecal DNAs of two healthy adults. Using metabolic function analyses of identified genes, we compared our human genome with the average content of previously sequenced microbial genomes. Our microbiome has significantly enriched metabolism of glycans, amino acids, and xenobiotics; methanogenesis; and 2-methyl-d-erythritol 4-phosphate pathway{\textendash}mediated biosynthesis of vitamins and isoprenoids. Thus, humans are superorganisms whose metabolism represents an amalgamation of microbial and human attributes.}, isbn = {0036-8075, 1095-9203}, doi = {10.1126/science.1124234}, url = {http://www.sciencemag.org/content/312/5778/1355}, author = {Gill,Steven R. and Pop, Mihai and DeBoy,Robert T. and Eckburg,Paul B and Turnbaugh,Peter J and Samuel,Buck S and Gordon,Jeffrey I and Relman,David A and Fraser-Liggett,Claire M and Nelson,Karen E.} } @article {17295, title = {Methods for the electronic annotation, retrieval, and use of electronic images}, volume = {09/976,362}, year = {2006}, month = {2006/03/07/}, abstract = {The present invention provides software for electronically annotating electronic images, such as drawings, photographs, video, etc., through the drag-and-drop of annotations from a pre-defined, but extendable, list. The annotations are placed at a user-selected X, Y location on the image, and stored in a searchable database. Thus, they can be searched in order to retrieve, organize, group, or display desired electronic images or collections of such images. The annotations may be text, images, sounds, etc. The invention provides a flexible, easy to learn, rapid, low error rate and satisfying interface for accomplishing such tasks.}, url = {http://www.google.com/patents?id=iBt4AAAAEBAJ}, author = {Shneiderman, Ben}, editor = {University of Maryland, College Park} } @article {16933, title = {A model for computer frustration: the role of instrumental and dispositional factors on incident, session, and post-session frustration and mood}, journal = {Computers in Human Behavior}, volume = {22}, year = {2006}, month = {2006/11//}, pages = {941 - 961}, abstract = {Frustration is almost universally accepted as the emotional outcome of a negative computing experience. Despite the wide use of the term, however, it has not been rigorously conceptualized as a factor in the study of the human{\textendash}computer interface. This project sets out to explicate frustration as a pre-emotional state generated by the user{\textquoteright}s appraisal of the interface as an impediment to goal attainment, and looks at how user characteristics, such as self-efficacy, relate to it. This project employed episode report methodology to capture data from 144 computer users{\textquoteright} reports of actual frustrating events as they took place. Diaries taken as users worked at their everyday tasks yield detailed data about the problems they encountered and included information about session length and an estimate of the time lost due to the experiences. Outcomes were measured as either situational or dispositional factors. Situational factors, having to do with specific events, predicted incident frustration. However, disposition variables, especially user self-efficacy, were much stronger, predicting incident and session frustration, and post-session mood. One surprising outcome was the failure of demographic variables as predictors of frustration.}, keywords = {Efficacy, Emotion, Frustration, Mood, problem solving, usability}, isbn = {0747-5632}, doi = {10.1016/j.chb.2004.03.015}, url = {http://www.sciencedirect.com/science/article/pii/S0747563204000615}, author = {Bessi{\`e}re,Katie and Newhagen,John E. and Robinson,John P. and Shneiderman, Ben} } @conference {12333, title = {Model-based mapping of image registration applications onto configurable hardware}, booktitle = {Signals, Systems and Computers, 2006. ACSSC{\textquoteright}06. Fortieth Asilomar Conference on}, year = {2006}, month = {2006///}, pages = {1453 - 1457}, author = {Hemaraj,Y. and Sen,M. and Shekhar,R. and Bhattacharyya, Shuvra S.} } @conference {17854, title = {Model-based OpenMP implementation of a 3D facial pose tracking system}, booktitle = {2006 International Conference on Parallel Processing Workshops, 2006. ICPP 2006 Workshops}, year = {2006}, month = {2006///}, pages = {8 pp.-73 - 8 pp.-73}, publisher = {IEEE}, organization = {IEEE}, abstract = {Most image processing applications are characterized by computation-intensive operations, and high memory and performance requirements. Parallelized implementation on shared-memory systems offer an attractive solution to this class of applications. However, we cannot thoroughly exploit the advantages of such architectures without proper modeling and analysis of the application. In this paper, we describe our implementation of a 3D facial pose tracking system using the OpenMP platform. Our implementation is based on a design methodology that uses coarse-grain dataflow graphs to model and schedule the application. We present our modeling approach, details of the implementation that we derived based on this modeling approach, and associated performance results. The parallelized implementation achieves significant speedup, and meets or exceeds the target frame rate under various configurations}, keywords = {3D facial pose tracking system, application modeling, application program interfaces, application scheduling, coarse-grain dataflow graphs, Concurrent computing, data flow graphs, Educational institutions, face recognition, IMAGE PROCESSING, image processing applications, Inference algorithms, Message passing, OpenMP platform, parallel implementation, PARALLEL PROCESSING, parallel programming, Particle tracking, Processor scheduling, SHAPE, shared memory systems, shared-memory systems, Solid modeling, tracking}, isbn = {0-7695-2637-3}, doi = {10.1109/ICPPW.2006.55}, author = {Saha,S. and Chung-Ching Shen and Chia-Jui Hsu and Aggarwal,G. and Veeraraghavan,A. and Sussman, Alan and Bhattacharyya, Shuvra S.} } @article {14081, title = {Molecular Characterization of Serine-, Alanine-, and Proline-Rich Proteins of Trypanosoma cruzi and Their Possible Role in Host Cell Infection}, journal = {Infect. Immun.}, volume = {74}, year = {2006}, month = {2006/03/01/}, pages = {1537 - 1546}, abstract = {We previously reported the isolation of a novel protein gene family, termed SAP (serine-, alanine-, and proline-rich protein), from Trypanosoma cruzi. Aided by the availability of the completed genome sequence of T. cruzi, we have now identified 39 full-length sequences of SAP, six pseudogenes and four partial genes. SAPs share a central domain of about 55 amino acids and can be divided into four groups based on their amino (N)- and carboxy (C)-terminal sequences. Some SAPs have conserved N- and C-terminal domains encoding a signal peptide and a glycosylphosphatidylinositol anchor addition site, respectively. Analysis of the expression of SAPs in metacyclic trypomastigotes by two-dimensional electrophoresis and immunoblotting revealed that they are likely to be posttranslationally modified in vivo. We have also demonstrated that some SAPs are shed into the extracellular medium. The recombinant SAP exhibited an adhesive capacity toward mammalian cells, where binding was dose dependent and saturable, indicating a possible ligand-receptor interaction. SAP triggered the host cell Ca2+ response required for parasite internalization. A cell invasion assay performed in the presence of SAP showed inhibition of internalization of the metacyclic forms of the CL strain. Taken together, these results show that SAP is involved in the invasion of mammalian cells by metacyclic trypomastigotes, and they confirm the hypothesis that infective trypomastigotes exploit an arsenal of surface glycoproteins and shed proteins to induce signaling events required for their internalization.}, doi = {

10.1128/IAI.74.3.1537-1546.2006

}, url = {http://iai.asm.org/cgi/content/abstract/74/3/1537}, author = {Baida,Renata C. P. and Santos,Marcia R. M. and Carmo,Mirian S. and Yoshida,Nobuko and Ferreira,Danielle and Ferreira,Alice Teixeira and El Sayed,Najib M. and Andersson,Bjorn and da Silveira,Jose Franco} } @conference {12616, title = {Motion Based Correspondence for 3D Tracking of Multiple Dim Objects}, booktitle = {Acoustics, Speech and Signal Processing, 2006. ICASSP 2006 Proceedings. 2006 IEEE International Conference on}, volume = {2}, year = {2006}, month = {2006/05//}, pages = {II - II}, abstract = {Tracking multiple objects in a video is a demanding task that is frequently encountered in several systems such as surveillance and motion analysis. Ability to track objects in 3D requires the use of multiple cameras. While tracking multiple objects using multiples video cameras, establishing correspondence between objects in the various cameras is a nontrivial task. Specifically, when the targets are dim or are very far away from the camera, appearance cannot be used in order to establish this correspondence. Here, we propose a technique to establish correspondence across cameras using the motion features extracted from the targets, even when the relative position of the cameras is unknown. Experimental results are provided for the problem of tracking multiple bees in natural flight using two cameras. The reconstructed 3D flight paths of the bees show some interesting flight patterns}, keywords = {3D, analysis;motion, analysis;video, based, cameras;feature, correspondence;motion, dim, extraction;image, extraction;multiple, features, MOTION, objects;video, processing;, signal, tracking;motion}, doi = {10.1109/ICASSP.2006.1660431}, author = {Veeraraghavan,A. and Srinivasan, M. and Chellapa, Rama and Baird, E. and Lamont, R.} } @inbook {12624, title = {Multi-camera Tracking of Articulated Human Motion Using Motion and Shape Cues}, booktitle = {Computer Vision {\textendash} ACCV 2006Computer Vision {\textendash} ACCV 2006}, series = {Lecture Notes in Computer Science}, volume = {3852}, year = {2006}, month = {2006///}, pages = {131 - 140}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {We present a framework and algorithm for tracking articulated motion for humans. We use multiple calibrated cameras and an articulated human shape model. Tracking is performed using motion cues as well as image-based cues (such as silhouettes and {\textquotedblleft}motion residues{\textquotedblright} hereafter referred to as spatial cues,) as opposed to constructing a 3D volume image or visual hulls. Our algorithm consists of a predictor and corrector: the predictor estimates the pose at the t + 1 using motion information between images at t and t + 1. The error in the estimated pose is then corrected using spatial cues from images at t + 1. In our predictor, we use robust multi-scale parametric optimisation to estimate the pixel displacement for each body segment. We then use an iterative procedure to estimate the change in pose from the pixel displacement of points on the individual body segments. We present a method for fusing information from different spatial cues such as silhouettes and {\textquotedblleft}motion residues{\textquotedblright} into a single energy function. We then express this energy function in terms of the pose parameters, and find the optimum pose for which the energy is minimised.}, isbn = {978-3-540-31244-4}, url = {http://dx.doi.org/10.1007/11612704_14}, author = {Sundaresan,Aravind and Chellapa, Rama}, editor = {Narayanan,P. and Nayar,Shree and Shum,Heung-Yeung} } @conference {17852, title = {Multiple range query optimization with distributed cache indexing}, booktitle = {Proceedings of the 2006 ACM/IEEE conference on Supercomputing}, year = {2006}, month = {2006///}, pages = {100{\textendash}es - 100{\textendash}es}, author = {Nam,B. and Andrade,H. and Sussman, Alan} } @article {18253, title = {Multiuser cross-layer resource allocation for video transmission over wireless networks}, journal = {Network, IEEE}, volume = {20}, year = {2006}, month = {2006/04//march}, pages = {21 - 27}, abstract = {With the advancement of video-compression technology and the wide deployment of wireless networks, there is an increasing demand for wireless video communication services, and many design challenges remain to be overcome. In this article, we discuss how to dynamically allocate resources according to the changing environments and requirements, so as to improve the overall system performance and ensure individual quality of service (QoS). Specifically, we consider two aspects with regard to design issues: cross-layer design, which jointly optimizes resource utilization from the physical layer to the application layer, and multiuser diversity, which explores source and channel heterogeneity for different users. We study how to efficiently transmit multiple video streams, encoded by current and future video codecs, over resource-limited wireless networks such as 3G/4G cellular system and future wireless local/metropolitan area networks (WLANs/WMANs)}, keywords = {3G, allocation;multiuser, allocation;video, cellular, channels;quality, codecs;video, coding;video, communication;4G, communication;data, compression;diversity, cross-layer, diversity;physical, layer;multiple, layer;quality, mobile, networks;3G, of, reception;multiuser, resource, service;resource, service;video, streaming;, streams;multiuser, system;4G, system;QoS;application, technology;wireless, transmission;video-compression, video}, isbn = {0890-8044}, doi = {10.1109/MNET.2006.1607892}, author = {Su,Guan-Ming and Man,Zhu and M. Wu and Liu,K. J.R} } @article {18254, title = {Multiuser distortion management of layered video over resource limited downlink multicode-CDMA}, journal = {Wireless Communications, IEEE Transactions on}, volume = {5}, year = {2006}, month = {2006/11//}, pages = {3056 - 3067}, abstract = {Transmitting multiple real-time encoded videos to multiple users over wireless cellular networks is a key driving force for developing broadband technology. We propose a new framework to transmit multiple users{\textquoteright} video programs encoded by MPEG-4 FGS codec over downlink multicode CDMA networks in real time. The proposed framework jointly manages the rate adaptation of source and channel coding, CDMA code allocation, and power control. Subject to the limited system resources, such as the number of pseudo-random codes and the maximal power for CDMA transmission, we develop an adaptive scheme of distortion management to ensure baseline video quality for each user and further reduce the overall distortion received by all users. To efficiently utilize system resources, the proposed scheme maintains a balanced ratio between the power and code usages. We also investigate three special scenarios where demand, power, or code is limited, respectively. Compared with existing methods in the literature, the proposed algorithm can reduce the overall system{\textquoteright}s distortion by 14\% to 26\%. In the demand-limited case and the code-limited but power-unlimited case, the proposed scheme achieves the optimal solutions. In the power-limited but code-unlimited case, the proposed scheme has a performance very close to a performance upper bound}, keywords = {(mobile, access;combined, allocation;broadband, case;layered, CDMA, cellular, code, codes;radio, codes;real-time, codes;telecommunication, coding;mobility, coding;video, coding;wireless, communication;, control;pseudo-random, control;pseudonoise, control;video, distortion, division, downlink, encoded, limited, links;random, management, management;power, multicode-CDMA;source-channel, multiple, networks;broadband, networks;cellular, radio);power, radio;code, source-channel, technology;code-unlimited, video;multiuser, videos;resource}, isbn = {1536-1276}, doi = {10.1109/TWC.2006.258231}, author = {Han,Z. and Su,Guan-Ming and Kwasinski,A. and M. Wu and Liu,K. J.R} } @article {13174, title = {Multivalued default logic for identity maintenance in visual surveillance}, journal = {Computer Vision{\textendash}ECCV 2006}, year = {2006}, month = {2006///}, pages = {119 - 132}, abstract = {Recognition of complex activities from surveillance video requires detection and temporal ordering of its constituent {\textquotedblleft}atomic{\textquotedblright} events. It also requires the capacity to robustly track individuals and maintain their identities across single as well as multiple camera views. Identity maintenance is a primary source of uncertainty for activity recognition and has been traditionally addressed via different appearance matching approaches. However these approaches, by themselves, are inadequate. In this paper, we propose a prioritized, multivalued, default logic based framework that allows reasoning about the identities of individuals. This is achieved by augmenting traditional appearance matching with contextual information about the environment and self identifying traits of certain actions. This framework also encodes qualitative confidence measures for the identity decisions it takes and finally, uses this information to reason about the occurrence of certain predefined activities in video.}, author = {Shet,V. and Harwood,D. and Davis, Larry S.} } @article {14437, title = {Multi-View Learning and Link Farm Discovery}, journal = {Probabilistic, Logical and Relational Learning-Towards a Synthesis}, year = {2006}, month = {2006///}, abstract = {The first part of this abstract focuses on estimation of mixture models for problems in which multiple views of the instances are available. Examples of this setting include clustering web pages or research papers that have intrinsic (text) and extrinsic (references) attributes. Mixture model estimation is a key problem for both semi-supervised and unsupervised learning. An appropriate optimization criterion quantifies the likelihood and the consensus among models in the individual views; maximizing this consensus minimizes a bound on the risk of assigning an instance to an incorrect mixture component. An EM algorithm maximizes this criterion. The second part of this abstract focuses on the problem of identifying link spam. Search engine optimizers inflate the page rank of a target site by spinning an artificial web for the sole purpose of providing inbound links to the target. Discriminating natural from artificial web sites is a difficult multi-view problem.}, author = {Scheffer,T. and De Raedt,L. and Dietterich,T. and Getoor, Lise and Muggleton,S. H} } @article {17307, title = {Network Visualization by Semantic Substrates}, journal = {IEEE Transactions on Visualization and Computer Graphics}, volume = {12}, year = {2006}, month = {2006/10//Sept}, pages = {733 - 740}, abstract = {Networks have remained a challenge for information visualization designers because of the complex issues of node and link layout coupled with the rich set of tasks that users present. This paper offers a strategy based on two principles: (1) layouts are based on user-defined semantic substrates, which are non-overlapping regions in which node placement is based on node attributes, (2) users interactively adjust sliders to control link visibility to limit clutter and thus ensure comprehensibility of source and destination. Scalability is further facilitated by user control of which nodes are visible. We illustrate our semantic substrates approach as implemented in NVSS 1.0 with legal precedent data for up to 1122 court cases in three regions with 7645 legal citations}, keywords = {Automatic control, data visualisation, Data visualization, Displays, Filters, Graphical user interfaces, Information Visualization, information visualization designers, Law, legal citations, Legal factors, legal precedent data, network visualization, NVSS 1.0, scalability, semantic substrate, Terminology, Tunneling, user-defined semantic substrates}, isbn = {1077-2626}, doi = {10.1109/TVCG.2006.166}, author = {Shneiderman, Ben and Aris,A.} } @conference {18256, title = {Non-Intrusive Forensic Analysis of Visual Sensors Using Output Images}, booktitle = {Acoustics, Speech and Signal Processing, 2006. ICASSP 2006 Proceedings. 2006 IEEE International Conference on}, volume = {5}, year = {2006}, month = {2006/05//}, pages = {V - V}, abstract = {This paper considers the problem of non-intrusive forensic analysis of the individual components in visual sensors and its implementation. As a new addition to the emerging area of forensic engineering, we present a framework for analyzing technologies employed inside digital cameras based on output images, and develop a set of forensic signal processing algorithms for visual sensors based on color array sensor and interpolation methods. We show through simulations that the proposed method is robust against compression and noise, and can help identify various processing components inside the camera. Such a non-intrusive forensic framework would provide useful evidence for analyzing technology infringement and evolution for visual sensors}, keywords = {algorithms;interpolation, analysis;image, analysis;output, array, cameras;forensic, Color, colour, engineering;forensic, forensic, images;visual, methods;nonintrusive, PROCESSING, sensor;digital, sensors;cameras;image, sensors;interpolation;, signal}, doi = {10.1109/ICASSP.2006.1661297}, author = {Swaminathan,A. and M. Wu and Liu,K. J.R} } @article {17677, title = {A note on generalized and hypergeneralized projectors}, journal = {Linear Algebra and its Applications}, volume = {412}, year = {2006}, month = {2006/01/15/}, pages = {408 - 411}, abstract = {Gro{\ss} and Trenkler [Generalized and hypergeneralized projectors, Linear Algebra Appl. 264 (1997) 463{\textendash}474] have introduced two generalizations of orthogonal projectors called generalized projectors and hypergeneralized projectors. In this note we characterize these generalizations by their spectral decompositions.}, keywords = {Generalized projection, projection, Spectral decomposition}, isbn = {0024-3795}, doi = {10.1016/j.laa.2005.07.022}, url = {http://www.sciencedirect.com/science/article/pii/S0024379505003836}, author = {Stewart, G.W.} } @article {17309, title = {Nuclear Envelope Dystrophies Show a Transcriptional Fingerprint Suggesting Disruption of Rb{\textendash}MyoD Pathways in Muscle Regeneration}, journal = {BrainBrain}, volume = {129}, year = {2006}, month = {2006/04/01/}, pages = {996 - 1013}, abstract = {Mutations of lamin A/C (LMNA) cause a wide range of human disorders, including progeria, lipodystrophy, neuropathies and autosomal dominant Emery{\textendash}Dreifuss muscular dystrophy (EDMD). EDMD is also caused by X-linked recessive loss-of-function mutations of emerin, another component of the inner nuclear lamina that directly interacts with LMNA. One model for disease pathogenesis of LMNA and emerin mutations is cell-specific perturbations of the mRNA transcriptome in terminally differentiated cells. To test this model, we studied 125 human muscle biopsies from 13 diagnostic groups (125 U133A, 125 U133B microarrays), including EDMD patients with LMNA and emerin mutations. A Visual and Statistical Data Analyzer (VISDA) algorithm was used to statistically model cluster hierarchy, resulting in a tree of phenotypic classifications. Validations of the diagnostic tree included permutations of U133A and U133B arrays, and use of two probe set algorithms (MAS5.0 and MBEI). This showed that the two nuclear envelope defects (EDMD LMNA, EDMD emerin) were highly related disorders and were also related to fascioscapulohumeral muscular dystrophy (FSHD). FSHD has recently been hypothesized to involve abnormal interactions of chromatin with the nuclear envelope. To identify disease-specific transcripts for EDMD, we applied a leave-one-out (LOO) cross-validation approach using LMNA patient muscle as a test data set, with reverse transcription{\textendash}polymerase chain reaction (RT{\textendash}PCR) validations in both LMNA and emerin patient muscle. A high proportion of top-ranked and validated transcripts were components of the same transcriptional regulatory pathway involving Rb1 and MyoD during muscle regeneration (CRI-1, CREBBP, Nap1L1, ECREBBP/p300), where each was specifically upregulated in EDMD. Using a muscle regeneration time series (27 time points) we develop a transcriptional model for downstream consequences of LMNA and emerin mutations. We propose that key interactions between the nuclear envelope and Rb and MyoD fail in EDMD at the point of myoblast exit from the cell cycle, leading to poorly coordinated phosphorylation and acetylation steps. Our data is consistent with mutations of nuclear lamina components leading to destabilization of the transcriptome in differentiated cells.}, keywords = {EDMD = Emery{\textendash}Dreifuss muscular dystrophy, emerin, Emery-Dreifuss muscular dystrophy, FSHD = fascioscapulohumeral muscular dystrophy, IDG = individual discriminatory genes, JDG = jointly discriminatory genes, lamin A/C, LGMD = limb-girdle muscular dystrophy, LOO = leave-one-out, RT{\textendash}PCR = reverse transcription{\textendash}polymerase chain reaction; VISDA = Visual and Statistical Data Analyzer, Skeletal muscle, wFC = weighted Fisher criterion}, isbn = {0006-8950, 1460-2156}, doi = {10.1093/brain/awl023}, url = {http://brain.oxfordjournals.org/content/129/4/996}, author = {Bakay,Marina and Wang,Zuyi and Melcon,Gisela and Schiltz,Louis and Xuan,Jianhua and Zhao,Po and Sartorelli,Vittorio and Seo,Jinwook and Pegoraro,Elena and Angelini,Corrado and Shneiderman, Ben and Escolar,Diana and Chen,Yi-Wen and Winokur,Sara T and Pachman,Lauren M and Fan,Chenguang and Mandler,Raul and Nevo,Yoram and Gordon,Erynn and Zhu,Yitan and Dong,Yibin and Wang,Yue and Hoffman,Eric P} } @article {14004, title = {Numerical computation of the Green?s function for two-dimensional finite-size photonic crystals of infinite length}, journal = {Optics ExpressOpt. Express}, volume = {14}, year = {2006}, month = {2006/11/13/}, pages = {11362 - 11371}, abstract = {We develop a numerical algorithm that computes the Green{\textquoteright}s function of Maxwell equation for a 2D finite-size photonic crystal, composed of rods of arbitrary shape. The method is based on the boundary integral equation, and a Nystr{\"o}m discretization is used for the numerical solution. To provide an exact solution that validates our code we derive multipole expansions for circular cylinders using our integral equation approach. The numerical method performs very well on the test case. We then apply it to crystals of arbitrary shape and discuss the convergence.}, keywords = {Diffraction and gratings, Multiple scattering}, doi = {10.1364/OE.14.011362}, url = {http://www.opticsexpress.org/abstract.cfm?URI=oe-14-23-11362}, author = {Seydou,F. and Ramahi,Omar M. and Duraiswami, Ramani and Sepp{\"a}nen,T.} } @conference {17788, title = {Opinion Analysis in Document Databases}, booktitle = {Proc. AAAI Spring Symposium on Computational Approaches to Analyzing Weblogs, Stanford, CA}, year = {2006}, month = {2006///}, abstract = {There are numerous applications in which we would like toassess what opinions are being expressed in text documents. Forr example, Martha Stewart{\textquoteright}s company may have wished to assess the degree of harshness of news articles about her in the recent past. Likewise, a World Bank official may wish to as- sess the degree of criticism of a proposed dam in Bangladesh. The ability to gauge opinion on a given topic is therefore of critical interest. In this paper, we develop a suite of algo- rithms which take as input, a set D of documents as well as a topic t, and gauge the degree of opinion expressed about topic t in the set D of documents. Our algorithms can return both a number (larger the number, more positive the opinion) as well as a qualitative opinion (e.g. harsh, complimentary). We as- sess the accuracy of these algorithms via human experiments and show that the best of these algorithms can accurately re- flect human opinions. We have also conducted performance experiments showing that our algorithms are computationally fast. }, author = {Cesarano,C. and Dorr, Bonnie J and Picariello, A. and Reforgiato,D. and Sagoff,A. and V.S. Subrahmanian} } @article {13320, title = {Out{\textendash}of{\textendash}Core Multiresolution Terrain Modeling}, journal = {Modeling and Management of Geographical Data over Distributed Architectures. Springer{\textendash}Verlag}, year = {2006}, month = {2006///}, author = {Danovaro,E. and De Floriani, Leila and Puppo,E. and Samet, Hanan} } @conference {17786, title = {Overconfidence or paranoia? search in imperfect-information games}, booktitle = {PROCEEDINGS OF THE NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE}, volume = {21}, year = {2006}, month = {2006///}, pages = {1045 - 1045}, abstract = {We derive a recursive formula for expected utility valuesin imperfect- information game trees, and an imperfect- information game tree search algorithm based on it. The for- mula and algorithm are general enough to incorporate a wide variety of opponent models. We analyze two opponent mod- els. The {\textquotedblleft}paranoid{\textquotedblright} model is an information-set analog of the minimax rule used in perfect-information games. The {\textquotedblleft}over- confident{\textquotedblright} model assumes the opponent moves randomly. Our experimental tests in the game of kriegspiel chess (an imperfect-information variant of chess) produced surpris- ing results: (1) against each other, and against one of the kriegspiel algorithms presented at IJCAI-05, the overconfi- dent model usually outperformed the paranoid model; (2) the performance of both models depended greatly on how well the model corresponded to the opponent{\textquoteright}s behavior. These re- sults suggest that the usual assumption of perfect-information game tree search{\textemdash}that the opponent will choose the best pos- sible move{\textemdash}isn{\textquoteright}t as useful in imperfect-information games. }, url = {http://www.aaai.org/Papers/AAAI/2006/AAAI06-164.pdf}, author = {Parker,A. and Nau, Dana S. and V.S. Subrahmanian} } @article {19018, title = {OverDoSe: A generic DDoS protection service using an overlay network}, year = {2006}, month = {2006}, institution = {School of Computer Science, Carnegie Mellon University}, abstract = {We present the design and implementation of OverDoSe, an overlay network offering generic DDoS protection for targeted sites. OverDoSe clients and servers are isolated at the IP level. Overlay nodes route packets between a client and a server, and regulate traffic according to the server{\textquoteright}s instructions. Through the use of light-weight security primitives, OverDoSe achieves resilience against compromised overlay nodes with a minimal performance overhead. OverDoSe can be deployed by a single ISP who wishes to offer DDoS protection as a value-adding service to its customers.}, isbn = {CMU-CS-06-114}, doi = {Technical Report}, url = {http://repository.cmu.edu/cgi/viewcontent.cgi?article=1073\&context=compsci}, author = {Elaine Shi and Stoica,I. and Andersen,D.G. and Perrig, A.} } @conference {13168, title = {Parametric Hand Tracking for Recognition of Virtual Drawings}, booktitle = {Computer Vision Systems, 2006 ICVS {\textquoteright}06. IEEE International Conference on}, year = {2006}, month = {2006/01//}, pages = {6 - 6}, abstract = {A hand tracking system for recognition of virtual spatial drawings is presented. Using a stereo camera, the 3D position of the hand in space is estimated. Then, by tracking the central region of the hand in 3D and estimating a virtual plane in space, the intended drawing of the user is recognized. Experimental results demonstrate the accuracy and effectiveness of this technique. The system can be used to communicate drawings and alphabets to a computer where a classifier can transform the drawn alphabets into interpretable characters.}, doi = {10.1109/ICVS.2006.50}, author = {Sepehri,A. and Yacoob,Yaser and Davis, Larry S.} } @conference {12083, title = {Partially overlapped channels not considered harmful}, booktitle = {Proceedings of the joint international conference on Measurement and modeling of computer systems}, year = {2006}, month = {2006///}, pages = {63 - 74}, author = {Mishra,A. and Shrivastava,V. and Banerjee,S. and Arbaugh, William A.} } @conference {13841, title = {PCFGs with syntactic and prosodic indicators of speech repairs}, booktitle = {Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics}, series = {ACL-44}, year = {2006}, month = {2006///}, pages = {161 - 168}, publisher = {Association for Computational Linguistics}, organization = {Association for Computational Linguistics}, address = {Stroudsburg, PA, USA}, abstract = {A grammatical method of combining two kinds of speech repair cues is presented. One cue, prosodic disjuncture, is detected by a decision tree-based ensemble classifier that uses acoustic cues to identify where normal prosody seems to be interrupted (Lickley, 1996). The other cue, syntactic parallelism, codifies the expectation that repairs continue a syntactic category that was left unfinished in the reparandum (Levelt, 1983). The two cues are combined in a Treebank PCFG whose states are split using a few simple tree transformations. Parsing performance on the Switchboard and Fisher corpora suggests that these two cues help to locate speech repairs in a synergistic way.}, doi = {10.3115/1220175.1220196}, url = {http://dx.doi.org/10.3115/1220175.1220196}, author = {Hale,John and Shafran,Izhak and Yung,Lisa and Dorr, Bonnie J and Harper,Mary and Krasnyanskaya,Anna and Lease,Matthew and Liu,Yang and Roark,Brian and Snover,Matthew and Stewart,Robin} } @conference {17541, title = {A platform for unobtrusive measurements on PlanetLab}, booktitle = {Proceedings of the 3rd conference on USENIX Workshop on Real, Large Distributed Systems - Volume 3}, series = {WORLDS{\textquoteright}06}, year = {2006}, month = {2006///}, pages = {2 - 2}, publisher = {USENIX Association}, organization = {USENIX Association}, address = {Berkeley, CA, USA}, abstract = {TCP Sidecar is a network measurement platform for injecting probes transparently into externally generated TCP streams. By coupling measurement probes with nonmeasurement traffic, we are able to obtain measurements behind NATs and firewalls without alerting intrusion detection systems. In this paper, we discuss Sidecar{\textquoteright}s design and our deployment experience on PlanetLab. We present preliminary results from Sidecar-based tools for RTT estimation ("sideping") and receiver-side bottleneck location ("artrat").}, url = {http://dl.acm.org/citation.cfm?id=1254840.1254842}, author = {Sherwood,Rob and Spring, Neil} } @article {12270, title = {Postmodern internetwork architecture}, journal = {ITTC-FY2006-TR-45030-01, Information and Telecommunication Center, The University of Kansas}, year = {2006}, month = {2006/02//}, abstract = {Network-layer innovation has proven surprisingly difficult, in part because internetworking protocols ignore com-peting economic interests and because a few protocols dominate, enabling layer violations that entrench technologies. Many shortcomings of today{\textquoteright}s internetwork layer result from its inflexibility with respect to the policies of the stake- holders: users and service providers. The consequences of these failings are well-known: various hacks, layering violations, and overloadings are introduced to enforce policies and attempt to get the upper hand in various {\textquotedblleft}tus- sles{\textquotedblright}. The result is a network that is increasingly brittle, hostile to innovation, vulnerable to attack, and insensitive to concerns about accountability and privacy. Our project aims to design, implement, and evaluate through daily use a minimalist internetwork layer and aux- iliary functionality that anticipates tussles and allows them to be played out in policy space, as opposed to in the packet-forwarding path. We call our approach postmodern internetwork architecture, because it is a reaction against many established network layer design concepts. The overall goal of the project is to make a larger portion of the network design space accessible without sacrificing the economy of scale offered by the unified Internet. We will use the postmodern architecture to explore basic architectural questions. These include: {\textbullet} What mechanisms should be supported by the network such that any foreseeable policy requirement can be explicitly addressed? {\textbullet} To what extent can routing and forwarding be isolated from each other while maintaining an efficient and usable network? {\textbullet} What forms of identity should be visible within the network, and what forms of accountability do different identities enable? {\textbullet} What mechanisms are needed to enable efficient access to cross-layer information and mechanisms such that lower layers can express their characteristics and upper layers can exert control downward? We plan to build and evaluate a complete end-to-end networking layer to help us understand feasible solutions to these questions. The Internet has fulfilled the potential of a complete generation of networking research by producing a global platform for innovation, commerce, and democracy. Unfortunately, the Internet also amply demonstrates the com- plexity and architectural ugliness that ensue when competing interests vie for benefits beyond those envisioned in the original design. This project is about redesigning the waist of the architectural hourglass to foster innovation, enhance security and accountability, and accomodate competing interests. }, author = {Bhattacharjee, Bobby and Calvert,K. and Griffioen,J. and Spring, Neil and Sterbenz,J. P.G} } @article {14724, title = {Practical dynamic software updating for C}, journal = {SIGPLAN Not.}, volume = {41}, year = {2006}, month = {2006/06//}, pages = {72 - 83}, abstract = {Software updates typically require stopping and restarting an application, but many systems cannot afford to halt service, or would prefer not to. Dynamic software updating (DSU) addresses this difficulty by permitting programs to be updated while they run. DSU is appealing compared to other approaches for on-line upgrades because it is quite general and requires no redundant hardware. The challenge is in making DSU practical: it should be flexible, and yet safe, efficient, and easy to use.In this paper, we present Ginseng, a DSU implementation for C that aims to meet this challenge. We compile programs specially so that they can be dynamically patched, and generate most of a dynamic patch automatically. Ginseng performs a series of analyses that when combined with some simple runtime support ensure that an update will not violate type-safety while guaranteeing that data is kept up-to-date. We have used Ginseng to construct and dynamically apply patches to three substantial open-source server programs---Very Secure FTP daemon, OpenSSH sshd daemon, and GNU Zebra. In total, we dynamically patched each program with three years{\textquoteright} worth of releases. Though the programs changed substantially, the majority of updates were easy to generate. Performance experiments show that all patches could be applied in less than 5 ms, and that the overhead on application throughput due to updating support ranged from 0 to at most 32\%.}, keywords = {dynamic software updating, function indirection, loop extraction, type wrapping}, isbn = {0362-1340}, doi = {10.1145/1133255.1133991}, url = {http://doi.acm.org/10.1145/1133255.1133991}, author = {Neamtiu,Iulian and Hicks, Michael W. and Stoyle,Gareth and Oriol,Manuel} } @article {17783, title = {The priority curve algorithm for video summarization}, journal = {Information Systems}, volume = {31}, year = {2006}, month = {2006/11//}, pages = {679 - 695}, abstract = {In this paper, we introduce the concept of a priority curve associated with a video. We then provide an algorithm that can use the priority curve to create a summary (of a desired length) of any video. The summary thus created exhibits nice continuity properties and also avoids repetition. We have implemented the priority curve algorithm (PriCA) and compared it with other summarization algorithms in the literature with respect to both performance and the output quality. The quality of summaries was evaluated by a group of 200 students in Naples, Italy, who watched soccer videos. We show that PriCA is faster than existing algorithms and also produces better quality summaries. We also briefly describe a soccer video summarization system we have built on using the PriCA architecture and various (classical) image processing algorithms.}, keywords = {Content based retrieval, Video databases, Video summarization}, isbn = {0306-4379}, doi = {10.1016/j.is.2005.12.003}, url = {http://www.sciencedirect.com/science/article/pii/S0306437905001250}, author = {Albanese, M. and Fayzullin,M. and Picariello, A. and V.S. Subrahmanian} } @article {16875, title = {A probabilistic analysis of trie-based sorting of large collections of line segments in spatial databases}, journal = {SIAM Journal on Computing}, volume = {35}, year = {2006}, month = {2006///}, pages = {22 - 58}, author = {Lindenbaum,M. and Samet, Hanan and Hjaltason,G. R} } @article {12837, title = {Probabilistic I/O automata: Theories of two equivalences}, journal = {CONCUR 2006{\textendash}Concurrency Theory}, year = {2006}, month = {2006///}, pages = {343 - 357}, author = {Stark,E. and Cleaveland, Rance and Smolka,S.} } @article {14383, title = {Probabilistic, Logical and Relational Learning-Towards a Synthesis}, journal = {Dagstuhl Seminar Proceedings}, volume = {5051}, year = {2006}, month = {2006///}, author = {De Raedt,L. and Dietterich,T. and Getoor, Lise and Muggleton,S. H and Lloyd,J. W and Sears,T. D and Milch,B. and Marthi,B. and Russell,S. and Sontag,D.} } @article {17645, title = {Provable algorithms for parallel generalized sweep scheduling}, journal = {Journal of Parallel and Distributed Computing}, volume = {66}, year = {2006}, month = {2006///}, pages = {807 - 821}, author = {Anil Kumar,V. S and Marathe,M. V and Parthasarathy,S. and Srinivasan, Aravind and Zust,S.} } @article {12276, title = {Ranking search results in P2P systems}, journal = {Technical Report, CR-TR-4779, Department of Computer Science, University of Maryland}, year = {2006}, month = {2006///}, abstract = {P2P deployments are a natural infrastructure for buildingdistributed 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, and not 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 distributed setting. We analyze the overhead of our approach, and quantify exactly 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 can scale with little overhead to large systems, and b) the accuracy of the results ob- tained using distributed ranking is comparable to a cen- tralized implementation. }, author = {Gopalakrishnan,V. and Morselli,R. and Bhattacharjee, Bobby and Keleher,P. and Srinivasan, Aravind} } @article {17649, title = {Ranking search results in peer-to-peer systems}, journal = {Technical Reports from UMIACS}, year = {2006}, month = {2006///}, 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, and not 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 distributed setting. We analyze the overhead of our approach, and quantify exactly 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 can scale with little overhead to large systems, and b) the accuracy of the results obtained using distributed ranking is comparable to a centralized implementation.}, author = {Gopalakrishnan,V. and Morselli,R. and Bhattacharjee, Bobby and Keleher,P. and Srinivasan, Aravind} } @book {13182, title = {Real-Time Distributed Algorithms for Visual and Battlefield Reasoning}, year = {2006}, month = {2006///}, publisher = {MARYLAND UNIV COLLEGE PARK OFFICE OF RESEARCH ADMINISTRATION AND ADVANCEMENT}, organization = {MARYLAND UNIV COLLEGE PARK OFFICE OF RESEARCH ADMINISTRATION AND ADVANCEMENT}, abstract = {Information is key to the success of the next generation battlefield. There is a critical need to determine, in real-time, what the enemy is doing, and to interpret that information in the context of past related events. In this project we examined two aspects of this issue: development of a high-level task definition language for tasking a network of sensors to carry out given objectives, and interpreting recounted events so that past related scenarios could be automatically identified from a case database.}, author = {Davis, Larry S. and Basili, Victor R. and V.S. Subrahmanian and Reggia, James A. and Aloimonos, J.} } @conference {12374, title = {Reconfigurable image registration on FPGA platforms}, booktitle = {Biomedical Circuits and Systems Conference, 2006. BioCAS 2006. IEEE}, year = {2006}, month = {2006///}, pages = {154 - 157}, author = {Sen,M. and Hemaraj,Y. and Bhattacharyya, Shuvra S. and Shekhar,R.} } @conference {12379, title = {Register File Partitioning with Constraint Programming}, booktitle = {System-on-Chip, 2006. International Symposium on}, year = {2006}, month = {2006///}, pages = {1 - 4}, author = {Salmela,P. and Shen,C. C and Bhattacharyya, Shuvra S. and Takala,J.} } @conference {15251, title = {Relay Placement for Higher Order Connectivity in Wireless Sensor Networks}, booktitle = {INFOCOM 2006. 25th IEEE International Conference on Computer Communications. Proceedings}, year = {2006}, month = {2006/04//}, pages = {1 - 12}, abstract = {Not available}, doi = {10.1109/INFOCOM.2006.273}, author = {Kashyap,A. and Khuller, Samir and Shayman,M.} } @conference {13849, title = {Reranking for Sentence Boundary Detection in Conversational Speech}, booktitle = {2006 IEEE International Conference on Acoustics, Speech and Signal Processing, 2006. ICASSP 2006 Proceedings}, volume = {1}, year = {2006}, month = {2006/05/14/19}, pages = {I-I - I-I}, publisher = {IEEE}, organization = {IEEE}, abstract = {We present a reranking approach to sentence-like unit (SU) boundary detection, one of the EARS metadata extraction tasks. Techniques for generating relatively small n-best lists with high oracle accuracy are presented. For each candidate, features are derived from a range of information sources, including the output of a number of parsers. Our approach yields significant improvements over the best performing system from the NIST RT-04F community evaluation}, keywords = {Automatic speech recognition, conversational speech, data mining, Ear, EARS metadata extraction tasks, Feature extraction, hidden Markov models, meta data, Model driven engineering, NIST, NIST RT-04F community evaluation, oracle accuracy, performance evaluation, reranking, sentence-like unit boundary detection, Speech processing, Speech recognition, Telephony}, isbn = {1-4244-0469-X}, doi = {10.1109/ICASSP.2006.1660078}, author = {Roark,B. and Liu,Yang and Harper,M. and Stewart,R. and Lease,M. and Snover,M. and Shafran,I. and Dorr, Bonnie J and Hale,J. and Krasnyanskaya,A. and Yung,L.} } @article {17348, title = {Research-based web design \& usability guidelines}, journal = {Background and Methodology. US Department of Health and Human Services. Washington}, year = {2006}, month = {2006///}, author = {Leavitt,M.O. and Shneiderman, Ben} } @article {17650, title = {Resilient multicast using overlays}, journal = {IEEE/ACM Transactions on Networking}, volume = {14}, year = {2006}, month = {2006/04//}, pages = {237 - 248}, abstract = {We introduce Probabilistic Resilient Multicast (PRM): a multicast data recovery scheme that improves data delivery ratios while maintaining low end-to-end latencies. PRM has both a proactive and a reactive components; in this paper we describe how PRM can be used to improve the performance of application-layer multicast protocols especially when there are high packet losses and host failures. Through detailed analysis in this paper, we show that this loss recovery technique has efficient scaling properties-the overheads at each overlay node asymptotically decrease to zero with increasing group sizes. As a detailed case study, we show how PRM can be applied to the NICE application-layer multicast protocol. We present detailed simulations of the PRM-enhanced NICE protocol for 10 000 node Internet-like topologies. Simulations show that PRM achieves a high delivery ratio (>97\%) with a low latency bound (600 ms) for environments with high end-to-end network losses (1\%-5\%) and high topology change rates (5 changes per second) while incurring very low overheads (<5\%).}, keywords = {application-layer multicast protocols, Computer science, Data communication, Delay, Internet, Internet-like topologies, IP networks, loss recovery technique, Multicast, multicast data recovery scheme, Multicast protocols, Network topology, NETWORKS, overlays, Performance loss, probabilistic forwarding, probabilistic resilient multicast, Protocols, Resilience, Streaming media, telecommunication network topology, Terminology}, isbn = {1063-6692}, doi = {10.1109/TNET.2006.872579}, author = {Banerjee,S. and Lee,Seungjoon and Bhattacharjee, Bobby and Srinivasan, Aravind} } @conference {12275, title = {Resource Discovery Techniques in Distributed Desktop Grid Environments}, booktitle = {Proceedings of the 7th IEEE/ACM International Conference on Grid Computing}, series = {GRID {\textquoteright}06}, year = {2006}, month = {2006///}, pages = {9 - 16}, publisher = {IEEE Computer Society}, organization = {IEEE Computer Society}, address = {Washington, DC, USA}, abstract = {Desktop grids use opportunistic sharing to exploit large collections of personal computers and workstations across the Internet, achieving tremendous computing power at low cost. Traditional desktop grid systems are typically based on a client-server architecture, which has inherent shortcomings with respect to robustness, reliability and scalability. In this paper, we propose a decentralized, robust, highly available, and scalable infrastructure to match incoming jobs to available resources. Through a comparative analysis on the experimental results obtained via simulation of three different types of matchmaking algorithms under different workload scenarios, we show the trade-offs between effcient matchmaking and good load balancing in a fully decentralized, heterogeneous computational environment.}, isbn = {1-4244-0343-X}, doi = {10.1109/ICGRID.2006.310992}, url = {http://dx.doi.org/10.1109/ICGRID.2006.310992}, author = {Kim,Jik-Soo and Nam,Beomseok and Keleher,Peter and Marsh,Michael and Bhattacharjee, Bobby and Sussman, Alan} } @article {14641, title = {Retroviral DNA Integration: Viral and Cellular Determinants of Target-Site Selection}, journal = {PLoS PathogPLoS Pathog}, volume = {2}, year = {2006}, month = {2006/06/23/}, pages = {e60 - e60}, abstract = {Retroviruses differ in their preferences for sites for viral DNA integration in the chromosomes of infected cells. Human immunodeficiency virus (HIV) integrates preferentially within active transcription units, whereas murine leukemia virus (MLV) integrates preferentially near transcription start sites and CpG islands. We investigated the viral determinants of integration-site selection using HIV chimeras with MLV genes substituted for their HIV counterparts. We found that transferring the MLV integrase (IN) coding region into HIV (to make HIVmIN) caused the hybrid to integrate with a specificity close to that of MLV. Addition of MLV gag (to make HIVmGagmIN) further increased the similarity of target-site selection to that of MLV. A chimeric virus with MLV Gag only (HIVmGag) displayed targeting preferences different from that of both HIV and MLV, further implicating Gag proteins in targeting as well as IN. We also report a genome-wide analysis indicating that MLV, but not HIV, favors integration near DNase I{\textendash}hypersensitive sites (i.e., +/- 1 kb), and that HIVmIN and HIVmGagmIN also favored integration near these features. These findings reveal that IN is the principal viral determinant of integration specificity; they also reveal a new role for Gag-derived proteins, and strengthen models for integration targeting based on tethering of viral IN proteins to host proteins.}, doi = {10.1371/journal.ppat.0020060}, url = {UR - http://dx.plos.org/10.1371/journal.ppat.0020060,http://dx.plos.org/10.1371/journal.ppat.0020060}, author = {Lewinski,Mary K and Yamashita,Masahiro and Emerman,Michael and Ciuffi,Angela and Marshall,Heather and Crawford,Gregory and Collins,Francis and Shinn,Paul and Leipzig,Jeremy and Hannenhalli, Sridhar and Berry,Charles C and Ecker,Joseph R and Bushman,Frederic D.} } @article {17652, title = {Review of "The Random Projection Method by Santosh Vempala"}, journal = {SIGACT News}, volume = {37}, year = {2006}, month = {2006/12//}, pages = {41 - 43}, isbn = {0163-5700}, doi = {10.1145/1189056.1189066}, url = {http://doi.acm.org/10.1145/1189056.1189066}, author = {Srinivasan, Aravind} } @article {18506, title = {Revisiting Internet addressing: Back to the future}, volume = {MIT-CSAIL-TR-2006-025}, year = {2006}, month = {2006///}, institution = {Massachusetts Institute of Technology Computer Science and Artificial Intelligence Laboratory}, abstract = {IP prefixes undermine three goals of Internet routing:accurate reflection of network-layer reachability, secure routing messages, and effective traffic control. This pa- per presents Atomic IP (AIP), a simple change to Inter- net addressing (which in fact reverts to how addressing once worked), that allows Internet routing to achieve these goals. }, author = {Vutukuru,M. and Feamster, Nick and Walfish,M. and Balakrishnan,H. and Shenker,S.} } @article {18267, title = {Robust and secure image hashing}, journal = {Information Forensics and Security, IEEE Transactions on}, volume = {1}, year = {2006}, month = {2006/06//}, pages = {215 - 230}, abstract = {Image hash functions find extensive applications in content authentication, database search, and watermarking. This paper develops a novel algorithm for generating an image hash based on Fourier transform features and controlled randomization. We formulate the robustness of image hashing as a hypothesis testing problem and evaluate the performance under various image processing operations. We show that the proposed hash function is resilient to content-preserving modifications, such as moderate geometric and filtering distortions. We introduce a general framework to study and evaluate the security of image hashing systems. Under this new framework, we model the hash values as random variables and quantify its uncertainty in terms of differential entropy. Using this security framework, we analyze the security of the proposed schemes and several existing representative methods for image hashing. We then examine the security versus robustness tradeoff and show that the proposed hashing methods can provide excellent security and robustness.}, keywords = {content-preserving, cryptography;, differential, distortions;, entropy;, Filtering, Fourier, functions;, hash, hashing;, image, modifications;, processing;, secure, theory;, transform;, transforms;}, isbn = {1556-6013}, doi = {10.1109/TIFS.2006.873601}, author = {Swaminathan,A. and Mao,Yinian and M. Wu} } @article {15075, title = {Robust fuzzy extractors and authenticated key agreement from close secrets}, journal = {Advances in Cryptology-CRYPTO 2006}, year = {2006}, month = {2006///}, pages = {232 - 250}, abstract = {Consider two parties holding correlated random variables W and W', respectively, that are within distance t of each other in some metric space. These parties wish to agree on a uniformly distributed secret key R by sending a single message over an insecure channel controlled by an all-powerful adversary. We consider both the keyless case, where the parties share no additional secret information, and the keyed case, where the parties share a long-term secret SK that they can use to generate a sequence of session keys {R j } using multiple pairs {(W j , W' j )}. The former has applications to, e.g., biometric authentication, while the latter arises in, e.g., the bounded storage model with errors.Our results improve upon previous work in several respects: {\textendash} The best previous solution for the keyless case with no errors (i.e., t=0) requires the min-entropy of W to exceed 2|W|/3. We show a solution when the min-entropy of W exceeds the minimal threshold |W|/2. {\textendash} Previous solutions for the keyless case in the presence of errors (i.e., t>0) required random oracles. We give the first constructions (for certain metrics) in the standard model. {\textendash} Previous solutions for the keyed case were stateful. We give the first stateless solution. }, doi = {10.1007/11818175_14}, author = {Dodis,Y. and Katz, Jonathan and Reyzin,L. and Smith,A.} } @conference {15677, title = {Routing for data delivery in dynamic networks}, booktitle = {Proceedings of the IEEE MILCOM}, year = {2006}, month = {2006///}, pages = {1 - 7}, author = {Mundur, Padma and Lee,S. and Seligman,M.} } @article {15695, title = {Routing in Delay Tolerant Networks Using Storage Domains}, volume = {UMIACS-TR-2007-01}, year = {2006}, month = {2006/11/20/}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {In this paper, we present a routing algorithm for a class ofdynamic networks called the Delay Tolerant Networks (DTNs). The proposed algorithm takes into account the quintessential DTN characteristic namely, intermittent link connectivity. We modify the breadth first search (BFS) algorithm to take into account link state changes and find the quickest route between source and destination nodes. We adopt a message drop policy at intermediate nodes to incorporate storage constraint. We also introduce the idea of time-varying storage domains where all nodes connected for a length of time act as a single storage unit by sharing the aggregated storage capacity of the nodes. We evaluate the routing algorithm with and without storage domain in an extensive simulation. We analyze the performance using metrics such as delivery ratio, incomplete transfers with no routes and dropped messages. The DTN topology dynamics are analyzed by varying: number of nodes generating traffic, link probability, link availability through combinations of downtime/uptime values, storage per node, message size, and traffic. The delay performance of the proposed algorithms is conceptually the same as flooding-based algorithms but without the penalty of multiple copies. More significantly, we show that the Quickest Storage Domain (Quickest SD) algorithm distributes the storage demand across many nodes in the network topology, enabling balanced load and higher network utilization. In fact, we show that for the same level of performance, we can actually cut the storage requirement in half using the Quickest SD algorithm. }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu//handle/1903/4024}, author = {Mundur, Padma and Lee,Sookyoung and Seligman,Matthew} } @conference {15686, title = {Routing in intermittent network topologies}, booktitle = {Proceedings of the 9th ACM international symposium on Modeling analysis and simulation of wireless and mobile systems}, series = {MSWiM {\textquoteright}06}, year = {2006}, month = {2006///}, pages = {385 - 389}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, keywords = {delay tolerant network (DTN), performance evaluation, routing algorithms}, isbn = {1-59593-477-4}, doi = {10.1145/1164717.1164782}, url = {http://doi.acm.org/10.1145/1164717.1164782}, author = {Mundur, Padma and Lee,Sookyoung and Seligman,Matthew} } @article {14731, title = {Safe manual memory management in Cyclone}, journal = {Science of Computer Programming}, volume = {62}, year = {2006}, month = {2006/10/01/}, pages = {122 - 144}, abstract = {The goal of the Cyclone project is to investigate how to make a low-level C-like language safe. Our most difficult challenge has been providing programmers with control over memory management while retaining safety. This paper describes our experience trying to integrate and use effectively two previously-proposed, safe memory-management mechanisms: statically-scoped regions and tracked pointers. We found that these typing mechanisms can be combined to build alternative memory-management abstractions, such as reference counted objects and arenas with dynamic lifetimes, and thus provide a flexible basis. Our experience {\textemdash} porting C programs and device drivers, and building new applications for resource-constrained systems {\textemdash} confirms that experts can use these features to improve memory footprint and sometimes to improve throughput when used instead of, or in combination with, conservative garbage collection.}, keywords = {cyclone, Memory management, memory safety, Reaps, Reference counting, regions, unique pointers}, isbn = {0167-6423}, doi = {10.1016/j.scico.2006.02.003}, url = {http://www.sciencedirect.com/science/article/pii/S0167642306000785}, author = {Swamy,Nikhil and Hicks, Michael W. and Morrisett,Greg and Grossman,Dan and Jim,Trevor} } @conference {16873, title = {Scalable data collection and retrieval infrastructure for digital government applications}, booktitle = {Proceedings of the 2006 international conference on Digital government research}, series = {dg.o {\textquoteright}06}, year = {2006}, month = {2006///}, pages = {301 - 302}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {In this paper we describe highlights of the project titled "Scalable data collection infrastructure for digital government applications" under the auspices of the Digital Government Research Program of the National Science Foundation. Our research is focused on taking advantage of the distributed nature of data and the interaction with it. Our efforts have been directed at both the systems/theoretical and applications levels. On the systems and theoretical levels, we have continued our development of the BISTRO system (Section 2). On the applications level, work has commenced on the development of a mechanism for spatially tagging text documents for retrieval by search engines based on both content and spatial proximity (Section 3).}, doi = {10.1145/1146598.1146679}, url = {http://doi.acm.org/10.1145/1146598.1146679}, author = {Samet, Hanan and Golubchik,Leana} } @article {18159, title = {A Scalable Multiuser Framework for Video Over OFDM Networks: Fairness and Efficiency}, journal = {Circuits and Systems for Video Technology, IEEE Transactions on}, volume = {16}, year = {2006}, month = {2006/10//}, pages = {1217 - 1231}, abstract = {In this paper, we propose a framework to transmit multiple scalable video programs over downlink multiuser orthogonal frequency division multiplex (OFDM) networks in real time. The framework explores the scalability of the video codec and multidimensional diversity of multiuser OFDM systems to achieve the optimal service objectives subject to constraints on delay and limited system resources. We consider two essential service objectives, namely, the fairness and efficiency. Fairness concerns the video quality deviation among users who subscribe the same quality of service, and efficiency relates to how to attain the highest overall video quality using the available system resources. We formulate the fairness problem as minimizing the maximal end-to-end distortion received among all users and the efficiency problem as minimizing total end-to-end distortion of all users. Fast suboptimal algorithms are proposed to solve the above two optimization problems. The simulation results demonstrated that the proposed fairness algorithm outperforms a time division multiple (TDM) algorithm by 0.5 3 dB in terms of the worst received video quality among all users. In addition, the proposed framework can achieve a desired tradeoff between fairness and efficiency. For achieving the same average video quality among all users, the proposed framework can provide fairer video quality with 1 1.8 dB lower PSNR deviation than a TDM algorithm}, keywords = {algorithm;video, codec;video, coding;video, communication;, deviation;downlink, deviation;OFDM, distortion;multidimensional, diversity;multiple, division, end-to-end, framework;time, Frequency, modulation;diversity, multiple, multiplex, multiuser, network;efficiency, networks;video, objectives;optimization, of, OFDM, orthogonal, over, problem;fairness, problem;maximal, problems;quality, programs;multiuser, PSNR, QUALITY, reception;image, resolution;optimisation;quality, scalable, service, service;scalable, service;video, systems;optimal, video}, isbn = {1051-8215}, doi = {10.1109/TCSVT.2006.883513}, author = {Su,Guan-Ming and Han,Zhu and M. Wu and Liu,K. J.R} } @article {12926, title = {Seasonal Cholera Caused by Vibrio Cholerae Serogroups O1 and O139 in the Coastal Aquatic Environment of Bangladesh}, journal = {Applied and Environmental MicrobiologyAppl. Environ. Microbiol.}, volume = {72}, year = {2006}, month = {2006/06/01/}, pages = {4096 - 4104}, abstract = {Since Vibrio cholerae O139 first appeared in 1992, both O1 El Tor and O139 have been recognized as the epidemic serogroups, although their geographic distribution, endemicity, and reservoir are not fully understood. To address this lack of information, a study of the epidemiology and ecology of V. cholerae O1 and O139 was carried out in two coastal areas, Bakerganj and Mathbaria, Bangladesh, where cholera occurs seasonally. The results of a biweekly clinical study (January 2004 to May 2005), employing culture methods, and of an ecological study (monthly in Bakerganj and biweekly in Mathbaria from March 2004 to May 2005), employing direct and enrichment culture, colony blot hybridization, and direct fluorescent-antibody methods, showed that cholera is endemic in both Bakerganj and Mathbaria and that V. cholerae O1, O139, and non-O1/non-O139 are autochthonous to the aquatic environment. Although V. cholerae O1 and O139 were isolated from both areas, most noteworthy was the isolation of V. cholerae O139 in March, July, and September 2004 in Mathbaria, where seasonal cholera was clinically linked only to V. cholerae O1. In Mathbaria, V. cholerae O139 emerged as the sole cause of a significant outbreak of cholera in March 2005. V. cholerae O1 reemerged clinically in April 2005 and established dominance over V. cholerae O139, continuing to cause cholera in Mathbaria. In conclusion, the epidemic potential and coastal aquatic reservoir for V. cholerae O139 have been demonstrated. Based on the results of this study, the coastal ecosystem of the Bay of Bengal is concluded to be a significant reservoir for the epidemic serogroups of V. cholerae.}, isbn = {0099-2240, 1098-5336}, doi = {10.1128/AEM.00066-06}, url = {http://aem.asm.org/content/72/6/4096}, author = {Alam,Munirul and Hasan,Nur A. and Sadique,Abdus and Bhuiyan,N. A. and Ahmed,Kabir U. and Nusrin,Suraia and Nair,G. Balakrish and Siddique,A. K. and Sack,R. Bradley and Sack,David A. and Huq,Anwar and Rita R Colwell} } @conference {12625, title = {Segmentation and Probabilistic Registration of Articulated Body Models}, booktitle = {Pattern Recognition, 2006. ICPR 2006. 18th International Conference on}, volume = {2}, year = {2006}, month = {2006///}, pages = {92 - 96}, abstract = {There are different approaches to pose estimation and registration of different body parts using voxel data. We propose a general bottom-up approach in order to segment the voxels into different body parts. The voxels are first transformed into a high dimensional space which is the eigenspace of the Laplacian of the neighbourhood graph. We exploit the properties of this transformation and fit splines to the voxels belonging to different body segments in eigenspace. The boundary of the splines is determined by examination of the error in spline fitting. We then use a probabilistic approach to register the segmented body segments by utilizing their connectivity and prior knowledge of the general structure of the subjects. We present results on real data, containing both simple and complex poses. While we use human subjects in our experiment, the method is fairly general and can be applied to voxel-based registration of any articulated or non-rigid object composed of primarily 1-D parts}, keywords = {(mathematics);, and, approach;eigenspace;image, articulated, body, data;voxel-based, eigenfunctions;graph, estimation;probabilistic, fitting;voxel, graph;pose, models;bottom-up, registration;eigenvalues, registration;image, registration;spline, segmentation;neighbourhood, segmentation;probability;splines, theory;image}, doi = {10.1109/ICPR.2006.1034}, author = {Sundaresan, A. and Chellapa, Rama} } @conference {11979, title = {A sensory grammar for inferring behaviors in sensor networks}, booktitle = {Proceedings of the 5th international conference on Information processing in sensor networks}, series = {IPSN {\textquoteright}06}, year = {2006}, month = {2006///}, pages = {251 - 259}, publisher = {ACM}, organization = {ACM}, address = {Nashville, Tennessee, USA}, abstract = {The ability of a sensor network to parse out observable activities into a set of distinguishable actions is a powerful feature that can potentially enable many applications of sensor networks to everyday life situations. In this paper we introduce a framework that uses a hierarchy of Probabilistic Context Free Grammars (PCFGs) to perform such parsing. The power of the framework comes from the hierarchical organization of grammars that allows the use of simple local sensor measurements for reasoning about more macroscopic behaviors. Our presentation describes how to use a set of phonemes to construct grammars and how to achieve distributed operation using a messaging model. The proposed framework is flexible. It can be mapped to a network hierarchy or can be applied sequentially and across the network to infer behaviors as they unfold in space and time. We demonstrate this functionality by inferring simple motion patterns using a sequence of simple direction vectors obtained from our camera sensor network testbed.}, keywords = {algorithms, behavior identification, human activity, human factors, pcfg, real-time and embedded systems, sensor grammars, sensor networks}, isbn = {1-59593-334-4}, doi = {10.1145/1127777.1127817}, author = {Lymberopoulos, Dimitrios and Ogale, Abhijit S. and Savvides, Andreas and Aloimonos, J.} } @article {13857, title = {Sentence compression as a component of a multi-document summarization system}, journal = {Proceedings of the 2006 Document Understanding Workshop, New York}, year = {2006}, month = {2006///}, abstract = {We applied a single-document sentence-trimming approach (Trimmer) to the problem of multi-document summariza- tion. Trimmer was designed with the in- tention of compressing a lead sentence into a space consisting of tens of char- acters. In our Multi-Document Trimmer (MDT), we use Trimmer to generate multiple trimmed candidates for each sentence. Sentence selection is used to determine which trimmed candidates provide the best combination of topic coverage and brevity. We demonstrate that we were able to port Trimmer easily to this new problem. We also show that MDT generally ranked higher for recall than for precision, suggesting that MDT is currently more successful at finding relevant content than it is at weeding out irrelevant content. Finally, we present an error analysis that shows that, while sentence compressions is making space for additional sentences, more work is needed in the area of generating and se- lecting the right candidates. }, author = {Zajic, David and Dorr, Bonnie J and Jimmy Lin and Schwartz,R.} } @inbook {15806, title = {Sentence Trimming and Selection: Mixing and Matching}, booktitle = {DUC 06 Conference Proceedings}, year = {2006}, month = {2006///}, publisher = {U.S. National Inst. of Standards and Technology}, organization = {U.S. National Inst. of Standards and Technology}, abstract = {We describe how components from two distinct multi-document summarization systems were combined. Twenty four possible combinations of components were considered. We observed some contrasts between conservative and aggressive sentence compression (i.e., trimming) in the context of multi-document summarization. }, url = {http://duc.nist.gov/}, author = {Zajic, David and Dorr, Bonnie J and Jimmy Lin and O{\textquoteright}Leary, Dianne P. and Conroy,John M. and Schlesinger,Judith D.} } @article {12924, title = {Septaplex PCR assay for rapid identification of Vibrio cholerae including detection of virulence and int SXT genes}, journal = {FEMS Microbiology Letters}, volume = {265}, year = {2006}, month = {2006/12/01/}, pages = {208 - 214}, abstract = {In this study, we describe a septaplex PCR assay for rapid identification of Vibrio cholerae including detection of the virulence and intsxt genes. Conditions were optimized to amplify fragments of ISRrRNA (encoding for 16S{\textendash}23S rRNA gene, Intergenic spacer regions), O1rfb (O1 serogroup specific rfb), O139rfb (O139 serogroup specific rfb), ctxA (cholera toxin subunit A), tcpA (toxin coregulated pilus), and intsxt (sxt integron) simultaneously in a single PCR. The septaplex PCR was evaluated using 211 strains of V. cholerae and six water samples for in situ testing. PCR results were correlated with genotype data obtained by individual PCR and slot-blot assays. The one-step PCR described here can be used to identify V. cholerae accurately and rapidly. Also, the virulence and intsxt genes can be simultaneously detected, providing a useful method for monitoring pathogenic, intsxt-positive and nonpathogenic, intsxt-negative V. cholerae serogroups both in the environment and clinical settings.}, keywords = {DETECTION, intsxt, septaplex PCR, Vibrio cholerae, virulence}, isbn = {1574-6968}, doi = {10.1111/j.1574-6968.2006.00491.x}, url = {http://onlinelibrary.wiley.com/doi/10.1111/j.1574-6968.2006.00491.x/full}, author = {Mantri,Chinmay K. and Mohapatra,Saswat S. and Ramamurthy,Thandavarayan and Ghosh,Raikamal and Rita R Colwell and Singh,Durg V.} } @article {17658, title = {Session 8A-Combinatorial Optimization and Quantum Computing-Lower Bounds on the Deterministic and Quantum Communication Complexities of Hamming-Distance Problems}, journal = {Lecture Notes in Computer Science}, volume = {4288}, year = {2006}, month = {2006///}, pages = {628 - 637}, author = {Ambainis,A. and Gasarch,W. and Srinivasan, Aravind and Utis,A.} } @article {17356, title = {Severity and impact of computer user frustration: A comparison of student and workplace users}, journal = {Interacting with Computers}, volume = {18}, year = {2006}, month = {2006/03//}, pages = {187 - 207}, abstract = {User frustration with information and computing technology is a pervasive and persistent problem. When computers crash, network congestion causes delays, and poor user interfaces trigger confusion there are dramatic consequences for individuals, organizations, and society. These frustrations, not only cause personal dissatisfaction and loss of self-efficacy, but may disrupt workplaces, slow learning, and reduce participation in local and national communities. Our exploratory study of 107 student computer users and 50 workplace computer users shows high levels of frustration and loss of 1/3{\textendash}1/2 of time spent. This paper reports on the incident and individual factors that cause of frustration, and how they raise frustration severity. It examines the frustration impacts on the daily interactions of the users. The time lost and time to fix problem, and importance of task, strongly correlate with frustration levels for both student and workplace users. Differences between students and workplace users are discussed in the paper, as are implications for researchers.}, keywords = {Computer anxiety, Computer experience, Helpdesk, Training, User frustration, user interface design}, isbn = {0953-5438}, doi = {10.1016/j.intcom.2005.06.001}, url = {http://www.sciencedirect.com/science/article/pii/S0953543805000561}, author = {Lazar,Jonathan and Jones,Adam and Hackley,Mary and Shneiderman, Ben} } @conference {12608, title = {Shape-Regulated Particle Filtering for Tracking Non-Rigid Objects}, booktitle = {Image Processing, 2006 IEEE International Conference on}, year = {2006}, month = {2006/10//}, pages = {2813 - 2816}, abstract = {This paper presents an active contour based algorithm for tracking non-rigid objects in heavily cluttered scenes. We decompose the non-rigid contour tracking problem into three subproblems: 2D motion estimation, deformation detection, and shape regulation. First, we employ a particle filter to estimate the affine transform parameters between successive frames. Second, by using a dynamic object model, we generate a probabilistic map of deformation to reshape its contour. Finally, we project the updated model onto a trained shape subspace to constrain deformations to be within possible object appearances. Our experiments show that the proposed algorithm significantly improves the performance of the tracker}, keywords = {(numerical, 2D, algorithm;affine, based, contour, detection;dynamic, detection;motion, detection;parameter, estimation;active, estimation;object, estimation;particle, Filtering, filtering;probabilistic, filters;, map;shape-regulation;affine, methods);tracking, model;nonrigid, MOTION, object, scenes;deformation, tracking;parameter, transform;cluttered, transforms;clutter;edge}, doi = {10.1109/ICIP.2006.312993}, author = {Jie Shao and Chellapa, Rama and Porikli, F.} } @inbook {18806, title = {A Step Towards Automated Design of Side Actions in Injection Molding of Complex Parts}, booktitle = {Geometric Modeling and Processing - GMP 2006}, series = {Lecture Notes in Computer Science}, volume = {4077}, year = {2006}, month = {2006///}, pages = {500 - 513}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {Side actions contribute to mold cost by resulting in an additional manufacturing and assembly cost as well as by increasing the molding cycle time. Therefore, generating shapes of side actions requires solving a complex geometric optimization problem. Different objective functions may be needed depending upon different molding scenarios (e.g., prototyping versus large production runs). Manually designing side actions is a challenging task and requires considerable expertise. Automated design of side actions will significantly reduce mold design lead times. This paper describes algorithms for generating shapes of side actions to minimize a customizable molding cost function.}, keywords = {Computer science}, isbn = {978-3-540-36711-6}, url = {http://www.springerlink.com/content/w7q3212607500635/abstract/}, author = {Banerjee,Ashis and Gupta, Satyandra K.}, editor = {Kim,Myung-Soo and Shimada,Kenji} } @conference {17785, title = {A stochastic language for modelling opponent agents}, booktitle = {Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems}, year = {2006}, month = {2006///}, pages = {244 - 246}, abstract = {There are numerous cases where a reasoning agent needs toreason about the behavior of an opponent agent. In this pa- per, we propose a hybrid probabilistic logic language within which we can express what actions an opponent may take in a given situation. We present the syntaxis and semantics of the language, and the concept of a Maximally Probable Course of Action. }, author = {Simari,G. and Sliva,A. and Nau, Dana S. and V.S. Subrahmanian} } @conference {16086, title = {Strategies for evaluating information visualization tools: multi-dimensional in-depth long-term case studies}, booktitle = {Proceedings of the 2006 AVI workshop on BEyond time and errors: novel evaluation methods for information visualization}, series = {BELIV {\textquoteright}06}, year = {2006}, month = {2006///}, pages = {1 - 7}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {After an historical review of evaluation methods, we describe an emerging research method called Multi-dimensional In-depth Long-term Case studies (MILCs) which seems well adapted to study the creative activities that users of information visualization systems engage in. We propose that the efficacy of tools can be assessed by documenting 1) usage (observations, interviews, surveys, logging etc.) and 2) expert users{\textquoteright} success in achieving their professional goals. We summarize lessons from related ethnography methods used in HCI and provide guidelines for conducting MILCs for information visualization. We suggest ways to refine the methods for MILCs in modest sized projects and then envision ambitious projects with 3-10 researchers working over 1-3 years to understand individual and organizational use of information visualization by domain experts working at the frontiers of knowledge in their fields.}, isbn = {1-59593-562-2}, doi = {10.1145/1168149.1168158}, url = {http://doi.acm.org/10.1145/1168149.1168158}, author = {Shneiderman, Ben and Plaisant, Catherine} } @conference {17538, title = {A structural approach to latency prediction}, booktitle = {Proceedings of the 6th ACM SIGCOMM conference on Internet measurement}, series = {IMC {\textquoteright}06}, year = {2006}, month = {2006///}, pages = {99 - 104}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Several models have been recently proposed for predicting the latency of end to end Internet paths. These models treat the Internet as a black-box, ignoring its internal structure. While these models are simple, they can often fail systematically; for example, the most widely used models use metric embeddings that predict no benefit to detour routes even though half of all Internet routes can benefit from detours.In this paper, we adopt a structural approach that predicts path latency based on measurements of the Internet{\textquoteright}s routing topology, PoP connectivity, and routing policy. We find that our approach outperforms Vivaldi, the most widely used black-box model. Furthermore, unlike metric embeddings, our approach successfully predicts 65\% of detour routes in the Internet. The number of measurements used in our approach is comparable with that required by black box techniques, but using traceroutes instead of pings.}, keywords = {internet topology, latency prediction, route measurements}, isbn = {1-59593-561-4}, doi = {10.1145/1177080.1177092}, url = {http://doi.acm.org/10.1145/1177080.1177092}, author = {Madhyastha,Harsha V. and Anderson,Thomas and Krishnamurthy,Arvind and Spring, Neil and Venkataramani,Arun} } @article {17662, title = {Structure of social contact networks and their impact on epidemics}, journal = {DIMACS Series in Discrete Mathematics and Theoretical Computer Science}, volume = {70}, year = {2006}, month = {2006///}, pages = {181 - 181}, abstract = {Traditional epidemiological research has focused on rate-based differential-equation models on completely mixing populations. In this paper, we outline an approach based on a combination of net- work theory and discrete-event simulations to study epidemics in large urban areas. We survey some of our results published in Nature (2004) and the Proc. ACM-SIAM Symposium on Discrete Algorithms (2004), and present some new results on: (i) mathematical properties of large social contact networks, as well as (ii) simulation-based dynamic anal- ysis of disease-spread in such networks. We identify a number of new measures that are significant for understanding epidemics and for devel- oping new strategies in policy planning. We also perform a very detailed structural analysis of the social contact networks produced by TRAN- SIMS, a simulator for detailed transportation/traffic studies, and study two random graph models to generate realistic social networks: Chung- Lu{\textquoteright}s model and the configuration model. We also develop combinatorial formulations and approximation algorithms for quarantining, vaccina- tion and sensor placement, as aids to decision-making. }, author = {Eubank,S. and Kumar,V. S.A and Marathe,M. V and Srinivasan, Aravind and Wang,N.} } @article {13714, title = {A study of translation edit rate with targeted human annotation}, journal = {Proceedings of Association for Machine Translation in the Americas}, year = {2006}, month = {2006///}, pages = {223 - 231}, abstract = {We examine a new, intuitive measurefor evaluating machine-translation output that avoids the knowledge intensiveness of more meaning-based approaches, and the labor-intensiveness of human judg- ments. Translation Edit Rate (TER) mea- sures the amount of editing that a hu- man would have to perform to change a system output so it exactly matches a reference translation. We show that the single-reference variant of TER correlates as well with human judgments of MT quality as the four-reference variant of BLEU. We also define a human-targeted TER (or HTER) and show that it yields higher correlations with human judgments than BLEU{\textemdash}even when BLEU is given human-targeted references. Our results in- dicate that HTER correlates with human judgments better than HMETEOR and that the four-reference variants of TER and HTER correlate with human judg- ments as well as{\textemdash}or better than{\textemdash}a sec- ond human judgment does. }, author = {Snover,M. and Dorr, Bonnie J and Schwartz,R. and Micciulla,L. and Makhoul,J.} } @article {15031, title = {Synthetic-perturbation techniques for screening shared memory programs}, journal = {Software: Practice and Experience}, volume = {24}, year = {2006}, month = {2006/10/30/}, pages = {679 - 701}, abstract = {The synthetic-perturbation screening (SPS) methodology is based on an empirical approach; SPS introduces artificial perturbations into the MIMD program and captures the effects of such perturbations by using the modern branch of statistics called design of experiments. SPS can provide the basis of a powerful tool for screening MIMD programs for performance bottlenecks. This technique is portable across machines and architectures, and scales extremely well on massively parallel processors. The purpose of this paper is to explain the general approach and to extend it to address specific features that are the main source of poor performance on the shared memory programming model. These include performance degradation due to load imbalance and insufficient parallelism, and overhead introduced by synchronizations and by accessing shared data structures. We illustrate the practicality of SPS by demonstrating its use on two very different case studies: a large image understanding benchmark and a parallel quicksort.}, keywords = {Design of experiments, parallel programs, performance, Shared memory programming model, Synthetic perturbation}, isbn = {1097-024X}, doi = {10.1002/spe.4380240802}, url = {http://onlinelibrary.wiley.com/doi/10.1002/spe.4380240802/abstract}, author = {Snelick,Robert and JaJa, Joseph F. and Kacker,Raghu and Lyon,Gordon} } @article {17663, title = {System and method for locating a closest server in response to a client ...}, volume = {09/726,192}, year = {2006}, month = {2006/03/28/}, abstract = {A scalable system and method for locating a closest server in response to a client request via an interactive distribution network, such as the Internet, are provided. A closest content server is defined as having the least round trip time for responding to a client request. The system including a plurality of content servers; and a local server in communication with a plurality of clients, the local server acting as a proxy for communicating client requests from clients to a redirection server. Client network distance and load information is periodically collected at each content server in the network from clients communicating with each of the respective content servers. The redirection server periodically aggregates the network distance and load information from each content server to create client clusters from both current and previously aggregated network distance and load information. Each client cluster represents a division or partition of the total IP address space. Each...}, url = {http://www.google.com/patents?id=cE54AAAAEBAJ}, author = {Andrews,Matthew and Hofmann,Markus and Shepherd,Bruce and Srinivasan, Aravind and Winkler,Peter and Zane,Francis}, editor = {Lucent Technologies Inc.} } @book {12328, title = {System synthesis for optically-connected, multiprocessors on-chip}, year = {2006}, month = {2006///}, publisher = {Citeseer}, organization = {Citeseer}, author = {Bambha,N. K and Bhattacharyya, Shuvra S. and STUDIES,MARYLAND UNIV COLLEGE PARK INST FOR ADVANCED COMPUTER} } @article {15487, title = {Techniques and processes for improving the quality and performance of open-source software}, journal = {Software Process: Improvement and Practice}, volume = {11}, year = {2006}, month = {2006///}, pages = {163 - 176}, abstract = {Open-source development processes have emerged as an effective approach to reduce cycle-time and decrease design, implementation, and quality assurance (QA) costs for certain types of software, particularly systems infrastructure software, such as operating systems (OS), compilers and language processing tools, text and drawing editors, and middleware. This article presents two contributions to the study of open-source software processes. First, we describe key challenges of open-source software and illustrate how QA processes{\textemdash}specifically those tailored to open-source development{\textemdash}help mitigate these challenges better than traditional closed-source processes do. Second, we summarize results of empirical studies that evaluate how our Skoll distributed continuous quality assurance (DCQA) techniques and processes help to resolve key challenges in developing and validating open-source software. Our results show that: (a) using models to configure and guide the DCQA process improves developer understanding of open-source software, (b) improving the diversity of platform configurations helps QA engineers find defects missed during conventional testing, and (c) centralizing control of QA activities helps to eliminate redundant work. Copyright {\textcopyright} 2006 John Wiley \& Sons, Ltd.}, keywords = {distributed continuous quality assurance, open-source software development and testing}, isbn = {1099-1670}, doi = {10.1002/spip.260}, url = {http://onlinelibrary.wiley.com/doi/10.1002/spip.260/abstract}, author = {Porter, Adam and Yilmaz,Cemal and Memon, Atif M. and Krishna,Arvind S. and Schmidt,Douglas C. and Gokhale,Aniruddha} } @article {16949, title = {A telescope for high-dimensional data}, journal = {Computing in Science \& Engineering}, volume = {8}, year = {2006}, month = {2006/04//March}, pages = {48 - 53}, abstract = {Muscular dystrophy is a degenerative disease that destroys muscles and ultimately kills its victims. Researchers worldwide are racing to find a cure by trying to uncover the genetic processes that cause it. Given that a key process is muscle development, researchers at a consortium of 10 institutions are studying 1,000 men and women, ages 18 to 40 years, to see how their muscles enlarge with exercise. The 150 variables collected for each participant will make this data analysis task challenging for users of traditional statistical software tools. However, a new approach to visual data analysis is helping these researchers speed up their work. At the University of Maryland{\textquoteright}s Human-Computer Interaction Library, we developed an interactive approach to let researchers explore high-dimensional data in an orderly manner, focusing on specific features one at a time. The rank-by-feature framework lets them adjust controls to specify what they{\textquoteright}re looking for, and then, with only a glance, they can spot strong relationships among variables, find tight data clusters, or identify unexpected gaps. Sometimes surprising outliers invite further study as to whether they represent errors or an unusual outcome. Similar data analysis problems come up in meteorology, finance, chemistry, and other sciences in which complex relationships among many variables govern outcomes. The rank-by-feature framework could be helpful to many researchers, engineers, and managers because they can then steer their analyses toward the action}, keywords = {Chemistry, Data analysis, data mining, data visualisation, degenerative disease, Degenerative diseases, diseases, Finance, genetic process, Genetics, high-dimensional data, interactive data analysis, medical computing, Meteorology, muscle, muscle development, Muscles, muscular dystrophy, Rank-by-feature framework, software, software libraries, software tools, Telescopes, visual data, visual data analysis}, isbn = {1521-9615}, doi = {10.1109/MCSE.2006.21}, author = {Shneiderman, Ben} } @conference {13173, title = {Top-down, bottom-up multivalued default reasoning for identity maintenance}, booktitle = {Proceedings of the 4th ACM international workshop on Video surveillance and sensor networks}, series = {VSSN {\textquoteright}06}, year = {2006}, month = {2006///}, pages = {79 - 86}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Persistent tracking systems require the capacity to track individuals by maintaining identity across visibility gaps caused by occlusion events. In traditional computer vision systems, the flow of information is typically bottom-up. The low level image processing modules take video input, perform early vision tasks such as background subtraction and object detection,and pass this information to the high level reasoning module. This paper describes the architecture of a system that uses top-down information flow to perform identity maintenance across occlusion events. This system uses the high level reasoning module to provide control feedback to the low level image processing module to perform forensic analysis of archival video and actively acquire information required to arrive at identity decisions. This functionality is in addition to traditional bottom-up reasoning about identity, employing contextual cues and appearance matching, within the multivalued default logic framework proposed in [18]. This framework, in addition to bestowing upon the system the property of nonmonotonicity, also allows for it to qualitatively encode its confidence in the identity decisions it takes.}, keywords = {default logic, identity maintenance, nonmonotonic reasoning, tracking, visual surveillance}, isbn = {1-59593-496-0}, doi = {10.1145/1178782.1178795}, url = {http://doi.acm.org/10.1145/1178782.1178795}, author = {Shet,Vinay D. and Harwood,David and Davis, Larry S.} } @conference {15825, title = {Topic-focused multi-document summarization using an approximate oracle score}, booktitle = {Proceedings of the COLING/ACL on Main conference poster sessions}, series = {COLING-ACL {\textquoteright}06}, year = {2006}, month = {2006///}, pages = {152 - 159}, publisher = {Association for Computational Linguistics}, organization = {Association for Computational Linguistics}, address = {Stroudsburg, PA, USA}, abstract = {We consider the problem of producing a multi-document summary given a collection of documents. Since most successful methods of multi-document summarization are still largely extractive, in this paper, we explore just how well an extractive method can perform. We introduce an "oracle" score, based on the probability distribution of unigrams in human summaries. We then demonstrate that with the oracle score, we can generate extracts which score, on average, better than the human summaries, when evaluated with ROUGE. In addition, we introduce an approximation to the oracle score which produces a system with the best known performance for the 2005 Document Understanding Conference (DUC) evaluation.}, url = {http://dl.acm.org/citation.cfm?id=1273073.1273093}, author = {Conroy,John M. and Schlesinger,Judith D. and O{\textquoteright}Leary, Dianne P.} } @conference {17540, title = {Touring the internet in a TCP sidecar}, booktitle = {Proceedings of the 6th ACM SIGCOMM conference on Internet measurement}, series = {IMC {\textquoteright}06}, year = {2006}, month = {2006///}, pages = {339 - 344}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {An accurate router-level topology of the Internet would benefit many research areas, including network diagnosis, inter-domain traffic engineering, and overlay construction. We present TCP Sidecar and Passenger, two elements of a system for router-level Internet topology discovery. Sidecar transparently injects measurement probes into non-measurement TCP streams, while Passenger combines TTL-limited probes with the often-ignored IP record route option. The combined approach mitigates problems associated with traceroute-based topology discovery, including abuse reports, spurious edge inference from multi-path routing, unresolved IP aliases, long network timeouts, and link discovery behind NATs and firewalls. We believe that we are the first mapping project to measure MPLS use with ICMP extensions and record route behavior when the TTL is not decremented. We are able to discover NATs when monitoring TCP connections that tunnel through them. In this paper, we present preliminary results for TCP Sidecar and Passenger on PlanetLab. Our experiments inject measurement probes into traffic generated both from the CoDeeN Web proxy project and from a custom web crawler to 166,745 web sites.}, keywords = {network topology discovery, passenger, record route, sidecar}, isbn = {1-59593-561-4}, doi = {10.1145/1177080.1177093}, url = {http://doi.acm.org/10.1145/1177080.1177093}, author = {Sherwood,Rob and Spring, Neil} } @article {17434, title = {Toward an enriched (and revitalized) sense of help: Summary of an ASIS\&T 2005 panel session}, journal = {Bulletin of the American Society for Information Science and Technology}, volume = {32}, year = {2006}, month = {2006/06/01/}, pages = {23 - 26}, isbn = {1550-8366}, doi = {10.1002/bult.2006.1720320509}, url = {http://onlinelibrary.wiley.com/doi/10.1002/bult.2006.1720320509/abstract}, author = {Haas,Stephanie W and Denn,Sheila and Locke,David and Shneiderman, Ben and Brown,Laurie} } @article {12927, title = {Toxigenic Vibrio Cholerae in the Aquatic Environment of Mathbaria, Bangladesh}, journal = {Applied and Environmental MicrobiologyAppl. Environ. Microbiol.}, volume = {72}, year = {2006}, month = {2006/04/01/}, pages = {2849 - 2855}, abstract = {Toxigenic Vibrio cholerae, rarely isolated from the aquatic environment between cholera epidemics, can be detected in what is now understood to be a dormant stage, i.e., viable but nonculturable when standard bacteriological methods are used. In the research reported here, biofilms have proved to be a source of culturable V. cholerae, even in nonepidemic periods. Biweekly environmental surveillance for V. cholerae was carried out in Mathbaria, an area of cholera endemicity adjacent to the Bay of Bengal, with the focus on V. cholerae O1 and O139 Bengal. A total of 297 samples of water, phytoplankton, and zooplankton were collected between March and December 2004, yielding eight V. cholerae O1 and four O139 Bengal isolates. A combination of culture methods, multiplex-PCR, and direct fluorescent antibody (DFA) counting revealed the Mathbaria aquatic environment to be a reservoir for V. cholerae O1 and O139 Bengal. DFA results showed significant clumping of the bacteria during the interepidemic period for cholera, and the fluorescent micrographs revealed large numbers of V. cholerae O1 in thin films of exopolysaccharides (biofilm). A similar clumping of V. cholerae O1 was also observed in samples collected from Matlab, Bangladesh, where cholera also is endemic. Thus, the results of the study provided in situ evidence for V. cholerae O1 and O139 in the aquatic environment, predominantly as viable but nonculturable cells and culturable cells in biofilm consortia. The biofilm community is concluded to be an additional reservoir of cholera bacteria in the aquatic environment between seasonal epidemics of cholera in Bangladesh.}, isbn = {0099-2240, 1098-5336}, doi = {10.1128/AEM.72.4.2849-2855.2006}, url = {http://aem.asm.org/content/72/4/2849}, author = {Alam,Munirul and Sultana,Marzia and Nair,G. Balakrish and Sack,R. Bradley and Sack,David A. and Siddique,A. K. and Ali,Afsar and Huq,Anwar and Rita R Colwell} } @article {14085, title = {Trypanosoma cruzi mitochondrial maxicircles display species- and strain-specific variation and a conserved element in the non-coding region}, journal = {BMC Genomics}, volume = {7}, year = {2006}, month = {2006///}, pages = {60 - 60}, abstract = {BACKGROUND:The mitochondrial DNA of kinetoplastid flagellates is distinctive in the eukaryotic world due to its massive size, complex form and large sequence content. Comprised of catenated maxicircles that contain rRNA and protein-coding genes and thousands of heterogeneous minicircles encoding small guide RNAs, the kinetoplast network has evolved along with an extreme form of mRNA processing in the form of uridine insertion and deletion RNA editing. Many maxicircle-encoded mRNAs cannot be translated without this post-transcriptional sequence modification.RESULTS:We present the complete sequence and annotation of the Trypanosoma cruzi maxicircles for the CL Brener and Esmeraldo strains. Gene order is syntenic with Trypanosoma brucei and Leishmania tarentolae maxicircles. The non-coding components have strain-specific repetitive regions and a variable region that is unique for each strain with the exception of a conserved sequence element that may serve as an origin of replication, but shows no sequence identity with L. tarentolae or T. brucei. Alternative assemblies of the variable region demonstrate intra-strain heterogeneity of the maxicircle population. The extent of mRNA editing required for particular genes approximates that seen in T. brucei. Extensively edited genes were more divergent among the genera than non-edited and rRNA genes. Esmeraldo contains a unique 236-bp deletion that removes the 5{\textquoteright}-ends of ND4 and CR4 and the intergenic region. Esmeraldo shows additional insertions and deletions outside of areas edited in other species in ND5, MURF1, and MURF2, while CL Brener has a distinct insertion in MURF2.CONCLUSION:The CL Brener and Esmeraldo maxicircles represent two of three previously defined maxicircle clades and promise utility as taxonomic markers. Restoration of the disrupted reading frames might be accomplished by strain-specific RNA editing. Elements in the non-coding region may be important for replication, transcription, and anchoring of the maxicircle within the kinetoplast network.}, isbn = {1471-2164}, doi = {10.1186/1471-2164-7-60}, url = {http://www.biomedcentral.com/1471-2164/7/60}, author = {Westenberger,Scott and Cerqueira,Gustavo and El-Sayed, Najib M. and Zingales,Bianca and Campbell,David and Sturm,Nancy} } @conference {15343, title = {The turbulence structure of shockwave and boundary layer interaction in a compression corner}, booktitle = {44th AIAA Aerospace Meeting and Exhibit}, volume = {2006}, year = {2006}, month = {2006///}, address = {Reno, NV}, abstract = {Shockwave and turbulent boundary layer interactions (STBLI) result in intense localizedheating rates and pressure loads, making them extremely important flow features that must be identified for engineering design. The absence of detailed and complete experimental and numerical data at the same flow and boundary conditions is one of the major stumbling blocks in the development of accurate turbulence models for the prediction of STBLI. We use a set of direct numerical simulation data (Wu \& Martin, 2006) that has been validated against experiments (Bookey et al., 2005) at the same conditions to present detailed flow features of the STBLI over a compression corner at Mach 3 and low Reynolds number with Reθ=2100. Details regarding the evolution of the turbulence structure angle, characteristic streamwise length scales, and hairpin packets through the interaction are presented. The three-dimensionality of the turbulence field and main shock are illustrated and the strength of shocks and shocklets through the interaction are considered. }, author = {Martin, M.P and Smits,A. and Wu,M. and Ringuette,M.} } @conference {16869, title = {Using image similarity and asymmetry to detect breast cancer}, booktitle = {Proc. of SPIE Vol}, volume = {6144}, year = {2006}, month = {2006///}, pages = {61441S{\textendash}1 - 61441S{\textendash}1}, abstract = {Radiologists can use the differences between the left and right breasts, or asymmetry, in mammograms to helpdetect certain malignant breast cancers. An image similarity method is introduced to make use of this knowledge base to recognize breast cancer. Image similarity is determined using a contextual and then a spatial comparison. The mammograms are filtered to find the most contextually significant points, and then the resulting point set is analyzed for spatial similarity. We develop the analysis through a combination of modeling and supervised learning of model parameters. This process correctly classifies mammograms 80\% of the time and thus asymmetry is a measure that can play an important role in significantly improving computer-aided breast cancer detection systems. }, author = {Tahmoush,D. and Samet, Hanan} } @article {17518, title = {Using PlanetLab for network research}, journal = {ACM SIGOPS Operating Systems Review}, volume = {40}, year = {2006}, month = {2006/01/01/}, pages = {17 - 17}, isbn = {01635980}, doi = {10.1145/1113361.1113368}, url = {http://dl.acm.org/citation.cfm?id=1113368}, author = {Spring, Neil and Peterson,Larry and Bavier,Andy and Pait,Vivek} } @article {17480, title = {Using rhythms of relationships to understand e-mail archives}, journal = {Journal of the American Society for Information Science and Technology}, volume = {57}, year = {2006}, month = {2006/12/01/}, pages = {1936 - 1948}, abstract = {Due to e-mail{\textquoteright}s ubiquitous nature, millions of users are intimate with the technology; however, most users are only familiar with managing their own e-mail, which is an inherently different task from exploring an e-mail archive. Historians and social scientists believe that e-mail archives are important artifacts for understanding the individuals and communities they represent. To understand the conversations evidenced in an archive, context is needed. In this article, we present a new way to gain this necessary context: analyzing the temporal rhythms of social relationships. We provide methods for constructing meaningful rhythms from the e-mail headers by identifying relationships and interpreting their attributes. With these visualization techniques, e-mail archive explorers can uncover insights that may have been otherwise hidden in the archive. We apply our methods to an individual{\textquoteright}s 15-year e-mail archive, which consists of about 45,000 messages and over 4,000 relationships.}, isbn = {1532-2890}, doi = {10.1002/asi.20387}, url = {http://onlinelibrary.wiley.com/doi/10.1002/asi.20387/abstract}, author = {Perer,Adam and Shneiderman, Ben and Oard, Douglas} } @conference {16083, title = {VAST 2006 Contest - A Tale of Alderwood}, booktitle = {Visual Analytics Science And Technology, 2006 IEEE Symposium On}, year = {2006}, month = {2006/11/31/2}, pages = {215 - 216}, abstract = {Visual analytics experts realize that one effective way to push the field forward and to develop metrics for measuring the performance of various visual analytics components is to hold an annual competition. The first visual analytics science and technology (VAST) contest was held in conjunction with the 2006 IEEE VAST Symposium. The competition entailed the identification of possible political shenanigans in the fictitious town of Alderwood. A synthetic data set was made available as well as tasks. We summarize how we prepared and advertised the contest, developed some initial metrics for evaluation, and selected the winners. The winners were invited to participate at an additional live competition at the symposium to provide them with feedback from senior analysts}, keywords = {Alderwood;human, analysis;data, analytics, and, contest;data, information, interaction;sense, making;visual, Science, technology, visualisation;}, doi = {10.1109/VAST.2006.261420}, author = {Grinstein,G. and O{\textquoteright}Connell,T. and Laskowski,S. and Plaisant, Catherine and Scholtz,J. and Whiting,M.} } @article {12606, title = {Vehicle Fingerprinting Using Drive-By Sounds}, year = {2006}, month = {2006/11//}, institution = {CENTER FOR AUTOMATION RESEARCH, UNIVERSITY OF MARYLAND COLLEGE PARK}, abstract = {We estimate a vehicle{\textquoteright}s speed, width, and length by jointly estimating its acoustic wave-pattern using a single passive acoustic sensor that records the vehicle{\textquoteright}s drive-by noise. The acoustic wave-pattern is estimated using three envelope shape (ES) components, which approximate the shape of the received signal{\textquoteright}s power envelope. We incorporate the parameters of the ES components along with estimates of the vehicle engine RPM and number of cylinders to form a vehicle profile vector. This vector provides a compressed statistics that can be used for vehicle identification and classification. Vehicle speed estimation and classification results are provided using field data.}, keywords = {*ACOUSTIC DETECTORS, *GROUND VEHICLES, *SIGNAL PROCESSING, ACOUSTIC DETECTION AND DETECTORS, AMPLITUDE, Interference, PASSIVE SYSTEMS, spatial distribution, STATISTICAL PROCESSES, SURFACE TRANSPORTATION AND EQUIPMENT, SYMPOSIA, WAVE PROPAGATION}, url = {http://stinet.dtic.mil/oai/oai?\&verb=getRecord\&metadataPrefix=html\&identifier=ADA481471}, author = {Cevher, V. and Chellapa, Rama and Gurbuz, A.C. and Shah, F. and McClellan, J.H.} } @conference {16951, title = {A Visual Interface for Multivariate Temporal Data: Finding Patterns of Events across Multiple Histories}, booktitle = {Visual Analytics Science And Technology, 2006 IEEE Symposium On}, year = {2006}, month = {2006/11/31/Oct. }, pages = {167 - 174}, publisher = {IEEE}, organization = {IEEE}, abstract = {Finding patterns of events over time is important in searching patient histories, Web logs, news stories, and criminal activities. This paper presents PatternFinder, an integrated interface for query and result-set visualization for search and discovery of temporal patterns within multivariate and categorical data sets. We define temporal patterns as sequences of events with inter-event time spans. PatternFinder allows users to specify the attributes of events and time spans to produce powerful pattern queries that are difficult to express with other formalisms. We characterize the range of queries PatternFinder supports as users vary the specificity at which events and time spans are defined. Pattern Finder{\textquoteright}s query capabilities together with coupled ball-and-chain and tabular visualizations enable users to effectively query, explore and analyze event patterns both within and across data entities (e.g. patient histories, terrorist groups, Web logs, etc.)}, keywords = {ball-and-chain visualization, Chromium, Computer science, Data analysis, data visualisation, Data visualization, Database languages, event pattern discovery, Graphical user interfaces, History, Information Visualization, Medical treatment, multivariate temporal data, Pattern analysis, pattern recognition, PatternFinder integrated interface, Query processing, query visualization, result-set visualization, Spatial databases, tabular visualization, temporal pattern discovery, temporal pattern searching, Temporal query, user interface, User interfaces, visual databases, visual interface}, isbn = {1-4244-0591-2}, doi = {10.1109/VAST.2006.261421}, author = {Fails,J. A and Karlson,A. and Shahamat,L. and Shneiderman, Ben} } @inbook {19210, title = {Voting with Your Feet: An Investigative Study of the Relationship Between Place Visit Behavior and Preference}, booktitle = {UbiComp 2006: Ubiquitous Computing}, series = {Lecture Notes in Computer Science}, volume = {4206}, year = {2006}, month = {2006}, pages = {333 - 350}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {Real world recommendation systems, personalized mobile search, and online city guides could all benefit from data on personal place preferences. However, collecting explicit rating data of locations as users travel from place to place is impractical. This paper investigates the relationship between explicit place ratings and implicit aspects of travel behavior such as visit frequency and travel time. We conducted a four-week study with 16 participants using a novel sensor-based experience sampling tool, called My Experience (Me), which we developed for mobile phones. Over the course of the study Me was used to collect 3,458 in-situ questionnaires on 1,981 place visits. Our results show that, first, sensor-triggered experience sampling is a useful methodology for collecting targeted information in situ. Second, despite the complexities underlying travel routines and visit behavior, there exist positive correlations between place preference and automatically detectable features like visit frequency and travel time. And, third, we found that when combined, visit frequency and travel time result in stronger correlations with place rating than when measured individually. Finally, we found no significant difference in place ratings due to the presence of others.}, isbn = {978-3-540-39634-5}, url = {http://dx.doi.org/10.1007/11853565_20}, author = {Jon Froehlich and Chen,Mike and Smith,Ian and Potter,Fred}, editor = {Dourish,Paul and Friday,Adrian} } @article {12094, title = {Wireless Network Security and Interworking}, journal = {Proceedings of the IEEE}, volume = {94}, year = {2006}, month = {2006/02//}, pages = {455 - 466}, abstract = {A variety of wireless technologies have been standardized and commercialized, but no single technology is considered the best because of different coverage and bandwidth limitations. Thus, interworking between heterogeneous wireless networks is extremely important for ubiquitous and high-performance wireless communications. Security in interworking is a major challenge due to the vastly different security architectures used within each network. The goal of this paper is twofold. First, we provide a comprehensive discussion of security problems and current technologies in 3G and WLAN systems. Second, we provide introductory discussions about the security problems in interworking, the state-of-the-art solutions, and open problems.}, keywords = {3G mobile communication, 3G systems, Authentication, Bandwidth, Communication system security, computer network security, computer security, Data security, internetworking, Land mobile radio cellular systems, Paper technology, security architectures, security of data, telecommunication security, wireless communication, wireless communications, Wireless LAN, wireless network security, Wireless networks, wireless technologies, WLAN systems}, isbn = {0018-9219}, doi = {10.1109/JPROC.2005.862322}, author = {Shin,M. and Ma,J. and Mishra,A. and Arbaugh, William A.} } @article {17513, title = {Workplace user frustration with computers: an exploratory investigation of the causes and severity}, journal = {Behaviour \& Information Technology}, volume = {25}, year = {2006}, month = {2006///}, pages = {239 - 251}, abstract = {When hard-to-use computers cause users to become frustrated, it can affect workplace productivity, user mood and interactions with other co-workers. Previous research has examined the frustration that students and their families face in using computers. To learn more about the causes and measure the severity of user frustration with computers in the workplace, we collected modified time diaries from 50 workplace users, who spent an average of 5.1 hours on the computer. In this exploratory research, users reported wasting on average, 42~?~43\% of their time on the computer due to frustrating experiences. The largest number of frustrating experiences occurred while using word processors, email and web browsers. The causes of the frustrating experiences, the time lost due to the frustrating experiences, and the effects of the frustrating experiences on the mood of the users are discussed in this paper. Implications for designers, managers, users, information technology staff and policymakers are discussed.When hard-to-use computers cause users to become frustrated, it can affect workplace productivity, user mood and interactions with other co-workers. Previous research has examined the frustration that students and their families face in using computers. To learn more about the causes and measure the severity of user frustration with computers in the workplace, we collected modified time diaries from 50 workplace users, who spent an average of 5.1 hours on the computer. In this exploratory research, users reported wasting on average, 42~?~43\% of their time on the computer due to frustrating experiences. The largest number of frustrating experiences occurred while using word processors, email and web browsers. The causes of the frustrating experiences, the time lost due to the frustrating experiences, and the effects of the frustrating experiences on the mood of the users are discussed in this paper. Implications for designers, managers, users, information technology staff and policymakers are discussed. }, isbn = {0144-929X}, doi = {10.1080/01449290500196963}, url = {http://www.tandfonline.com/doi/abs/10.1080/01449290500196963}, author = {Lazar,Jonathan and Jones,Adam and Shneiderman, Ben} } @inbook {13416, title = {Active Constrained Clustering by Examining Spectral Eigenvectors}, booktitle = {Discovery ScienceDiscovery Science}, series = {Lecture Notes in Computer Science}, volume = {3735}, year = {2005}, month = {2005///}, pages = {294 - 307}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {This work focuses on the active selection of pairwise constraints for spectral clustering. We develop and analyze a technique for Active Constrained Clustering by Examining Spectral eigenvectorS (ACCESS) derived from a similarity matrix. The ACCESS method uses an analysis based on the theoretical properties of spectral decomposition to identify data items that are likely to be located on the boundaries of clusters, and for which providing constraints can resolve ambiguity in the cluster descriptions. Empirical results on three synthetic and five real data sets show that ACCESS significantly outperforms constrained spectral clustering using randomly selected constraints.}, isbn = {978-3-540-29230-2}, url = {http://dx.doi.org/10.1007/11563983_25}, author = {Xu,Qianjun and desJardins, Marie and Wagstaff,Kiri}, editor = {Hoffmann,Achim and Motoda,Hiroshi and Scheffer,Tobias} } @article {17791, title = {Aggregate operators in probabilistic databases}, journal = {J. ACM}, volume = {52}, year = {2005}, month = {2005/01//}, pages = {54 - 101}, abstract = {Though extensions to the relational data model have been proposed in order to handle probabilistic information, there has been very little work to date on handling aggregate operators in such databases. In this article, we present a very general notion of an aggregate operator and show how classical aggregation operators (such as COUNT, SUM, etc.) as well as statistical operators (such as percentiles, variance, etc.) are special cases of this general definition. We devise a formal linear programming based semantics for computing aggregates over probabilistic DBMSs, develop algorithms that satisfy this semantics, analyze their complexity, and introduce several families of approximation algorithms that run in polynomial time. We implemented all of these algorithms and tested them on a large set of data to help determine when each one is preferable.}, keywords = {Aggregates, probabilistic relational databases}, isbn = {0004-5411}, doi = {10.1145/1044731.1044734}, url = {http://doi.acm.org/10.1145/1044731.1044734}, author = {Ross,Robert and V.S. Subrahmanian and Grant,John} } @article {12813, title = {An Algebraic Theory Of Boundary Crossing Transitions}, journal = {Electronic Notes in Theoretical Computer Science}, volume = {115}, year = {2005}, month = {2005/01/18/}, pages = {69 - 88}, abstract = {This paper gives a process-algebraic semantics for the hierarchical state machine (HSM) fragment of Statecharts, in which state transitions are permitted to cross state boundaries. Although frowned upon by researchers as promoting unstructured modeling, such transitions are used extensively in practice to model parameterized start states and conditional exit states. The purpose of this work is to develop a compositional semantics for HSMs that may be fit together with compositional semantic accounts for Statecharts without boundary-crossing transitions in order to arrive at a compositional theory for virtually the whole Statecharts language. Our technical development consists of a process algebra for HSMs that is equipped with an operational semantics, an argument that bisimulation is a congruence for the algebra, a syntax-directed translation procedure for HSMs into the process algebra, and an equational axiomatization of the algebra.}, keywords = {Compositional Semantics, Formal Methods, Process algebra, Statecharts}, isbn = {1571-0661}, doi = {10.1016/j.entcs.2004.09.029}, url = {http://www.sciencedirect.com/science/article/pii/S1571066104053186}, author = {Ray,Arnab and Cleaveland, Rance and Skou,Arne} } @article {17683, title = {Algorithm 844: Computing sparse reduced-rank approximations to sparse matrices}, journal = {ACM Transactions on Mathematical Software-TOMS}, volume = {31}, year = {2005}, month = {2005///}, pages = {252 - 269}, author = {Berry,M. W and Pulatova,S. A and Stewart, G.W.} } @conference {12648, title = {Algorithmic and architectural design methodology for particle filters in hardware}, booktitle = {Computer Design: VLSI in Computers and Processors, 2005. ICCD 2005. Proceedings. 2005 IEEE International Conference on}, year = {2005}, month = {2005/10//}, pages = {275 - 280}, abstract = {In this paper, we present algorithmic and architectural methodology for building particle filters in hardware. Particle filtering is a new paradigm for filtering in presence of nonGaussian nonlinear state evolution and observation models. This technique has found wide-spread application in tracking, navigation, detection problems especially in a sensing environment. So far most particle filtering implementations are not lucrative for real time problems due to excessive computational complexity involved. In this paper, we re-derive the particle filtering theory to make it more amenable to simplified VLSI implementations. Furthermore, we present and analyze pipelined architectural methodology for designing these computational blocks. Finally, we present an application using the bearing only tracking problem and evaluate the proposed architecture and algorithmic methodology.}, keywords = {(numerical, algorithmic, architectural, architectures;, bearing, complexity;, computational, design, digital, evolution;, Filtering, filtering;, filters;, implementation;, methodology;, methods);, nonGaussian, nonlinear, only, Parallel, particle, pipeline, pipelined, problem;, processing;, state, tracking, VLSI, VLSI;}, doi = {10.1109/ICCD.2005.20}, author = {Sankaranarayanan,A. C and Chellapa, Rama and Srivastava, A.} } @conference {17550, title = {Algorithmic aspects of capacity in wireless networks}, booktitle = {Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems}, series = {SIGMETRICS {\textquoteright}05}, year = {2005}, month = {2005///}, pages = {133 - 144}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {This paper considers two inter-related questions: (i) Given a wireless ad-hoc network and a collection of source-destination pairs {(si,ti)}, what is the maximum throughput capacity of the network, i.e. the rate at which data from the sources to their corresponding destinations can be transferred in the network? (ii) Can network protocols be designed that jointly route the packets and schedule transmissions at rates close to the maximum throughput capacity? Much of the earlier work focused on random instances and proved analytical lower and upper bounds on the maximum throughput capacity. Here, in contrast, we consider arbitrary wireless networks. Further, we study the algorithmic aspects of the above questions: the goal is to design provably good algorithms for arbitrary instances. We develop analytical performance evaluation models and distributed algorithms for routing and scheduling which incorporate fairness, energy and dilation (path-length) requirements and provide a unified framework for utilizing the network close to its maximum throughput capacity.Motivated by certain popular wireless protocols used in practice, we also explore "shortest-path like" path selection strategies which maximize the network throughput. The theoretical results naturally suggest an interesting class of congestion aware link metrics which can be directly plugged into several existing routing protocols such as AODV, DSR, etc. We complement the theoretical analysis with extensive simulations. The results indicate that routes obtained using our congestion aware link metrics consistently yield higher throughput than hop-count based shortest path metrics.}, keywords = {capacity modeling, end-to-end scheduling, Linear programming, Wireless networks}, isbn = {1-59593-022-1}, doi = {10.1145/1064212.1064228}, url = {http://doi.acm.org/10.1145/1064212.1064228}, author = {Kumar,V. S. Anil and Marathe,Madhav V. and Parthasarathy,Srinivasan and Srinivasan, Aravind} } @conference {17895, title = {And away we go: understanding the complexity of launching complex HPC applications}, booktitle = {Proceedings of the second international workshop on Software engineering for high performance computing system applications}, series = {SE-HPCS {\textquoteright}05}, year = {2005}, month = {2005///}, pages = {45 - 49}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Although not well-studied, launching HPC applications is extremely complex. To better understand the launching process, we conducted a simple case study. Based in part on this study and an examination of existing toolkits, we have begun to develop a prototype environment to support HPC application launching.}, keywords = {development, high-performance, Productivity, software}, isbn = {1-59593-117-1}, doi = {10.1145/1145319.1145333}, url = {http://doi.acm.org/10.1145/1145319.1145333}, author = {Yoon,Il-Chul and Sussman, Alan and Porter, Adam} } @conference {17789, title = {Approximation results for probabilistic survivability}, booktitle = {Multi-Agent Security and Survivability, 2005 IEEE 2nd Symposium on}, year = {2005}, month = {2005/08//}, pages = {1 - 10}, abstract = {As multiagent systems (MASs) are increasingly used in industrial applications, the need to make them more robust and resilient against disruption increases dramatically. The author has developed a probabilistic model (assuming complete ignorance of dependencies between node failures) of survivability based on deploying each agent in a MAS on one or more nodes. Finding a deployment that maximizes survivability is highly intractable for two reasons: firstly, computing the survivability of any deployment is intractable, and secondly, going through an exponential number of deployments to find the best one adds another layer of intractability. In this paper, we study what happens when node failures are independent. We show that computing survivability in this environment is still intractable. We propose various heuristics to compute the survivability of a given deployment. We have implemented and tested all these heuristics. We report on the advantages and disadvantages of different heuristics in different environmental settings.}, keywords = {application;, computing;, failure;, fault, heuristic, heuristics, industrial, model;, multi-agent, multiagent, node, probabilistic, probability;, programming;, survivability;, system;, systems;, testing;, tolerant}, doi = {10.1109/MASSUR.2005.1507042}, author = {Zhang,Y. and Manister,E. and Kraus,S. and V.S. Subrahmanian} } @inbook {19486, title = {Architecting and Implementing Versatile Dependability}, booktitle = {Architecting Dependable Systems III}, series = {Lecture Notes in Computer Science}, year = {2005}, month = {2005/01/01/}, pages = {212 - 231}, publisher = {Springer Berlin Heidelberg}, organization = {Springer Berlin Heidelberg}, abstract = {Distributed applications must often consider and select the appropriate trade-offs among three important aspects {\textendash} fault-tolerance, performance and resources. We introduce a novel concept, called versatile dependability, that provides a framework for analyzing and reasoning about these trade-offs in dependable software architectures. We present the architecture of a middleware framework that implements versatile dependability by providing the appropriate {\textquotedblright}knobs{\textquotedblright} to tune and re-calibrate the trade-offs. Our framework can adjust the properties and the behavior of the system at development-time, at deployment-time, and throughout the application{\textquoteright}s life-cycle. This renders the versatile dependability approach useful both to applications that require static fault-tolerance configurations supporting the loss/addition of resources and changing workloads, as well as to applications that evolve in terms of their dependability requirements. Through a couple of specific examples, one on adapting the replication style at runtime and the other on tuning the system scalability under given constraints, we demonstrate concretely how versatile dependability can provide an extended coverage of the design space of dependable distributed systems.}, keywords = {Operating systems, software engineering}, isbn = {978-3-540-28968-5, 978-3-540-31648-0}, url = {http://link.springer.com/chapter/10.1007/11556169_10}, author = {Tudor Dumitras and Srivastava, Deepti and Narasimhan, Priya}, editor = {Lemos, Rog{\'e}rio de and Gacek, Cristina and Romanovsky, Alexander} } @conference {12673, title = {An architectural level design methodology for embedded face detection}, booktitle = {Proceedings of the 3rd IEEE/ACM/IFIP international conference on Hardware/software codesign and system synthesis}, series = {CODES+ISSS {\textquoteright}05}, year = {2005}, month = {2005///}, pages = {136 - 141}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Face detection and recognition research has attracted great attention in recent years. Automatic face detection has great potential in a large array of application areas, including banking and security system access control, video surveillance, and multimedia information retrieval. In this paper, we discuss an architectural level design methodology for implementation of an embedded face detection system on a reconfigurable system on chip. We present models for performance estimation and validate these models with experimental values obtained from implementing our system on an FPGA platform. This modeling approach is shown to be efficient, accurate, and intuitive for designers to work with. Using this approach, we present several design options that trade-off various architectural features.}, keywords = {design space exploration, Face detection, platforms, reconfigurable, system-level models}, isbn = {1-59593-161-9}, doi = {10.1145/1084834.1084872}, url = {http://doi.acm.org/10.1145/1084834.1084872}, author = {Kianzad,V. and Saha,S. and Schlessman,J. and Aggarwal,G. and Bhattacharyya, Shuvra S. and Wolf,W. and Chellapa, Rama} } @conference {14325, title = {Are GSM phones THE solution for localization?}, booktitle = {Mobile Computing Systems and Applications, 2006. WMCSA{\textquoteright}06. Proceedings. 7th IEEE Workshop on}, year = {2005}, month = {2005///}, pages = {34 - 42}, author = {Varshavsky,A. and Chen,M.Y. and de Lara,E. and Jon Froehlich and Haehnel,D. and Hightower,J. and LaMarca,A. and Potter,F. and Sohn,T. and Tang,K. and others} } @article {16961, title = {An Augmented Visual Query Mechanism for Finding Patterns in Time Series Data (2002)}, journal = {Institute for Systems Research Technical Reports}, year = {2005}, month = {2005///}, abstract = {Relatively few query tools exist for data exploration and pattern identification in time series data sets. In previous work we introduced Timeboxes. Timeboxes are rectangular, direct-manipulation queries for studying time-series datasets. We demonstrated how Timeboxes can be used to support interactive exploration via dynamic queries, along with overviews of query results and drag-and-drop support for query-by-example. In this paper, we extend our work by introducing Variable Time Timeboxes (VTT). VTTs are a natural generalization of Timeboxes, which permit the specification of queries that allow a degree of uncertainty in the time axis. We carefully motivate the need for these more expressive queries, and demonstrate the utility of our approach on several data sets.}, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/6495}, author = {Keogh,Eamonn and Hochheiser,Harry and Shneiderman, Ben} } @article {16990, title = {Bi-Level Hierarchical Layouts for Photo Libraries: Algorithms for Design Optimization with Quantum Content}, journal = {Institute for Systems Research Technical Reports}, year = {2005}, month = {2005///}, abstract = {A frequently-used layout for a collection of two-dimensional, fixed aspect-ratio objects, such as photo thumbnails, is the grid, in which rows and columns are configured to match the allowed space. However, in cases where these objects have some group relationship among them, it can be advantageous to show this relationship in the layout, rather than in textual captions. We use an annotated digital photo collection as a case study of an auto-layout technique in which a two-level hierarchy is generated, consisting of a primary, central region with secondary regions (typically 2-12 regions) surrounding it. We show that given specific requirements, this technique is also optimal, in the sense that it will generate the largest size for the objects. Since all objects are the same size we refer to them as quantum content. These algorithms are designed to be real-time, enabling a compelling interactive display as users resize the canvas, or move and resize the primary region. The interactive redisplay also occurs as users add regions or objects to a secondary region.}, keywords = {Societal Infrastructure Systems}, url = {http://drum.lib.umd.edu/handle/1903/6567}, author = {Kustanowitz,Jack and Shneiderman, Ben} } @conference {19027, title = {BIND: a fine-grained attestation service for secure distributed systems}, year = {2005}, month = {2005}, pages = {154 - 168}, abstract = {In this paper we propose BIND (binding instructions and data), a fine-grained attestation service for securing distributed systems. Code attestation has recently received considerable attention in trusted computing. However, current code attestation technology is relatively immature. First, due to the great variability in software versions and configurations, verification of the hash is difficult. Second, the time-of-use and time-of-attestation discrepancy remains to be addressed, since the code may be correct at the time of the attestation, but it may be compromised by the time of use. The goal of BIND is to address these issues and make code attestation more usable in securing distributed systems. BIND offers the following properties: (1) BIND performs fine-grained attestation. Instead of attesting to the entire memory content, BIND attests only to the piece of code we are concerned about. This greatly simplifies verification. (2) BIND narrows the gap between time-of-attestation and time-of-use. BIND measures a piece of code immediately before it is executed and uses a sandboxing mechanism to protect the execution of the attested code. (3) BIND ties the code attestation with the data that the code produces, such that we can pinpoint what code has been run to generate that data. In addition, by incorporating the verification of input data integrity into the attestation, BIND offers transitive integrity verification, i.e., through one signature, we can vouch for the entire chain of processes that have performed transformations over a piece of data. BIND offers a general solution toward establishing a trusted environment for distributed system designers.}, keywords = {BIND, binding instructions and data, code attestation, data integrity, digital signatures, distributed processing, fine-grained attestation service, input data integrity, program verification, sandboxing mechanism, secure distributed systems, signature, time-of-attestation, time-of-use, transitive integrity verification, trusted computing}, author = {Elaine Shi and Perrig, A. and Van Doorn, L.} } @article {16995, title = {Bridging the Digital Divide with Universal Usability (2001)}, journal = {Institute for Systems Research Technical Reports}, year = {2005}, month = {2005///}, abstract = {How do you explain a trashcan to a culture that doesn have one? How do you describe a top loss limit orderto retirees managing their funds? Can you design a text-only interface that conveys the contents and experience of an animated Flash presentation?

These puzzles emerged during the first ACM Conference on Universal Usability (http://www.acm.org/sigchi/cuu/), held on November 15-17, 2000 near Washington, DC. The international group of organizers, presenters, and attendees of this conference shared an unusual commitment and passion for making information and communications services accessible, usable, and useful. They want to see effective healthcare services and appealing distance education. They want to create successful e-commerce and accessible government services for all. Realizing these possibilities requires more than low-cost hardware or broadband networks. These mass- market services are often too complex, unusable, or irrelevant for too many users; usability and design become the keys to success.

The source of these problems was often attributed to designers who make incorrect assumptions about user knowledge. This leads to difficulties with technical terminology and advanced concepts that are not balanced by adequate online help or live assistance. Unfortunately, most designers never see the pain they inflict on novice and even expert users. These problems have contributed to the growing digital divide in internet technology adoption levels between lowincome poorly-educated and high-income well-educated users [2]. Even as the gap between men and women internet users has been eliminated and the gap between young and old is shrinking, the slow adoption rates by poor and poorly educated users remains a problem. Low-cost equipment is needed, but progress in design will help make internet services more accessible to more people.}, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/6478}, author = {Shneiderman, Ben} } @article {16100, title = {Broadening Access to Large Online Databases by Generalizing Query Previews (2000)}, journal = {Institute for Systems Research Technical Reports}, year = {2005}, month = {2005///}, abstract = {Companies, government agencies, and other types of organizations are making their large databases available to the world over the Internet. Current database front-ends do not give users information about the distribution of data. This leads many users to waste time and network resources posing queries that have either zero-hit or mega-hit result sets. Query previews form a novel visual approach for browsing large databases. Query previews supply data distribution information about the database that is being searched and give continuous feedback about the size of the result set for the query as it is being formed. On the other hand, query previews use only a few pre-selected attributes of the database. The distribution information is displayed only on these attributes. Unfortunately, many databases are formed of numerous relations and attributes. This paper introduces a generalization of query previews. We allow users to browse all of the relations and attributes of a database using a hierarchical browser. Any of the attributes can be used to display the distribution information, making query previews applicable to many public online databases.}, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/6474}, author = {Tanin,Egemen and Plaisant, Catherine and Shneiderman, Ben} } @article {16999, title = {Browsing Large Online Data Tables Using Generalized Query Previews (2001)}, journal = {Institute for Systems Research Technical Reports}, year = {2005}, month = {2005///}, abstract = {Companies, government agencies, and other organizations are making their data available to the world over the Internet. They often use large online relational tables for this purpose. Users query such tables with front-ends that typically use menus or form fillin interfaces, but these interfaces rarely give users information about the contents and distribution of the data. Such a situation leads users to waste time and network resources posing queries that have zero-hit or mega-hit results. Generalized query previews enable efficient browsing of large online databases by supplying data distribution information to the users. The data distribution information provides continuous feedback about the size of the result set as the query is being formed. Our paper presents a user interface architecture and discusses recent experimental findings. Our prototype system, ExpO, provides a flexible user interface for research and testing. The user study shows that for exploratory querying tasks, generalized query previews speed user performance and reduce network load.}, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/6483}, author = {Tanin,Egemen and Shneiderman, Ben} } @article {17002, title = {Building a Coherent Data Pipeline in Microarray Data Analyses: Optimization of Signal/Noise Ratios Using an Interactive Visualization Tool and a Novel Noise Filtering Method (2003)}, journal = {Institute for Systems Research Technical Reports}, year = {2005}, month = {2005///}, abstract = {Motivation: Sources of uncontrolled noise strongly influence data analysis in microarray studies, yet signal/noise ratios are rarely considered in microarray data analyses. We hypothesized that different research projects would have different sources and levels of confounding noise, and built an interactive visual analysis tool to test and define parameters in Affymetrix analyses that optimize the ratio of signal (desired biological variable) versus noise (confounding uncontrolled variables). Results: Five probe set algorithms were studied with and without statistical weighting of probe sets using Microarray Suite (MAS) 5.0 probe set detection p values. The signal/noise optimization method was tested in two large novel microarray datasets with different levels of confounding noise; a 105 sample U133A human muscle biopsy data set (11 groups) (extensive noise), and a 40 sample U74A inbred mouse lung data set (8 groups) (little noise). Success was measured using F-measure value of success of unsupervised clustering into appropriate biological groups (signal). We show that both probe set signal algorithm and probe set detection p-value weighting have a strong effect on signal/noise ratios, and that the different methods performed quite differently in the two data sets. Among the signal algorithms tested, dChip difference model with p-value weighting was the most consistent at maximizing the effect of the target biological variables on data interpretation of the two data sets. Availability: The Hierarchical Clustering Explorer 2.0 is [url=http://www.cs.umd.edu/hcil/hce/]available[/url] online and the improved version of the Hierarchical Clustering Explorer 2.0 with p-value weighting and Fmeasure is available upon request to the first author. Murine arrays (40 samples) are publicly available at the [url=http://microarray.cnmcresearch.org/pgadatatable.asp]PEPR resource.[/url] (Chen et al., 2004).}, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/6511}, author = {Seo,Jinwook and Bakay,Marina and Chen,Yi-Wen and Hilmer,Sara and Shneiderman, Ben and Hoffman,Eric P} } @article {17006, title = {Categorized Graphical Overviews for Web Search Results: An Exploratory Study using U.S. Government Agencies as a Meaningful and Stable Structure (2004)}, journal = {Institute for Systems Research Technical Reports}, year = {2005}, month = {2005///}, abstract = {Search engines are very effective at generating long lists of results that are highly relevant to user-provided query terms . But the lack of effective overviews presents challenges to users who seek to understand these results, especially for a complex task such as learning about a topic area, which requires gaining overviews of and exploring large sets of search results, identifying unusual documents, and understanding their context. Categorizing the results into comprehensible visual displays using meaningful and stable classifications can support user exploration and understanding of large sets of search results. This extended abstract presents a set of principles that we are developing for search result visualization. It also describes an exploratory study that investigated categorized overviews of search results for complex search tasks within the domain of U. S. government web sites, using a hierarchy based on the federal government organization.}, keywords = {Global Communication Systems}, url = {http://drum.lib.umd.edu/handle/1903/6534}, author = {Kules,Bill and Shneiderman, Ben} } @article {17008, title = {Catergorized Overviews for Web Search Results: Two Exploratory Studies in the US Government Domain}, journal = {Technical Reports from UMIACS}, year = {2005}, month = {2005///}, abstract = {Search engines are very effective at generating extensive lists of results that are highly relevant to user-provided query terms. But the lack of effective overviews challenges users who seek to understand these results, especially for complex tasks such as learning about a new topic, which require gaining overviews of and exploring large sets of search results, identifying unusual documents, and understanding their context. Categorizing the results into comprehensible visual displays using meaningful and stable classifications can support user exploration and understanding of large sets of search results. We conducted two exploratory studies to investigate categorized overviews of search results for complex search tasks within the domain of U. S. government web sites, using a hierarchy based on the federal government organization and a hierarchy generated by automated clustering. First we compared two overview conditions vs. a control (N=18) and found that participants performed better with and preferred the overview conditions. Then we compared automated clustering vs. an overview based on a government hierarchy (N=12) for several task types, and found that several factors appeared to influence the preferred overview. The studies motivated new requirements for the organization of and interaction with web search results: user-selectable organization of results and a lightweight mechanism for customizing hierarchies. The results were also used to refine a set of principles that we are developing for categorized search result visualization.}, author = {Kules,B. and Shneiderman, Ben} } @conference {13910, title = {Child{\textquoteright}s play: a comparison of desktop and physical interactive environments}, booktitle = {Proceedings of the 2005 conference on Interaction design and children}, year = {2005}, month = {2005///}, pages = {48 - 55}, author = {Fails,J. A and Druin, Allison and Guha,M.L. and Chipman,G. and Simms,S. and Churaman,W.} } @article {15678, title = {Class-based access control for distributed video-on-demand systems}, journal = {IEEE Transactions on Circuits and Systems for Video Technology}, volume = {15}, year = {2005}, month = {2005/07//}, pages = {844 - 853}, abstract = {The focus of this paper is the analysis of threshold-based admission control policies for distributed video-on-demand (VoD) systems. Traditionally, admission control methods control access to a resource based on the resource capacity. We have extended that concept to include the significance of an arriving request to the VoD system by enforcing additional threshold restrictions in the admission control process on request classes deemed less significant. We present an analytical model for computing blocking performance of the VoD system under threshold-based admission control. Extending the same methodology to a distributed VoD architecture we show through simulation that the threshold performance conforms to the analytical model. We also show that threshold-based analysis can work in conjunction with other request handling policies and are useful for manipulating the VoD performance since we are able to distinguish between different request classes based on their merit. Enforcing threshold restrictions with the option of downgrading blocked requests in a multirate service environment results in improved performance at the same time providing different levels of quality of service (QoS). In fact, we show that the downgrade option combined with threshold restrictions is a powerful tool for manipulating an incoming request mix over which we have no control into a workload that the VoD system can handle.}, keywords = {Access control, Admission control, Analytical models, blocking performance, class-based access control, Computational modeling, Computer architecture, Computer science, Distributed control, Distributed video-on-demand (VoD) system, distributed video-on-demand system, multimedia systems, multirate service model, Performance analysis, QoS, quality of service, request handling policy, resource allocation, resource capacity, telecommunication congestion control, threshold-based admission control, video on demand}, isbn = {1051-8215}, doi = {10.1109/TCSVT.2005.848351}, author = {Mundur, Padma and Sood,A. K and Simon,R.} } @conference {13277, title = {Clustering Techniques for Out-of-Core Multi-resolution Modeling}, booktitle = {Visualization Conference, IEEE}, year = {2005}, month = {2005///}, pages = {113 - 113}, publisher = {IEEE Computer Society}, organization = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, abstract = {Thanks to improvements in simulation tools, high resolution scanning facilities and multidimensional medical imaging, huge datasets are commonly available. Multi-resolution models manage the complexity of such data sets, by varying resolution and focusing detail in specific areas of interests. Since many currently available data sets cannot fit in main memory, the need arises to design data structures, construction and query algorithms for multi-resolution models which work in secondary memory.}, isbn = {0-7803-9462-3}, doi = {http://doi.ieeecomputersociety.org/10.1109/VIS.2005.15}, author = {Danovaro,Emanuele and De Floriani, Leila and Puppo,Enrico and Samet, Hanan} } @article {17018, title = {Colour-coded pixel-based highly interactive Web mapping for georeferenced data exploration}, journal = {International Journal of Geographical Information Science}, volume = {19}, year = {2005}, month = {2005///}, pages = {413 - 428}, abstract = {This paper describes a pixel?based technique that enables highly interactive Web choropleth maps for georeferenced data publishing and visual exploration. Instead of delivering geographic knowledge to the client in polygon?based vector formats, we encode geographic object IDs and shape information into highly compact pixel images (decoding maps). This allows the combination of raster and vector characteristics while avoiding the problems in the currently existing pixel?based (raster?image?based) or vector?based techniques. Differing from traditional pixel?based techniques that are static and allow very little user interaction, our pixel?based technique allows varieties of sub?second (less than 1?s) interface controls such as dynamic query, dynamic classification, geographic object data identification, user?setting adjusting, as well as turning on/off layers, panning and zooming, with no or minimum server support. Compared with Web GIS techniques that use vector geographic data, our technique avoids transferring over the network large vector geographic data. It also avoids the non?trivial client?side computation to interpret the vector data and render the maps. Our technique features a short initial download time, near?constant performance scalability for larger numbers of geographic objects, and download?map?segment?only?when?necessary which potentially reduces the overall data transfer over the network. As a result, it accommodates general public users with slow modem network connections and low?end machines, as well as users with fast T?1 connections and fast machines. The client?side (browser) is implemented as lightweight Java applets. YMap, an easy?to?use, user?task?oriented highly interactive mapping tool for visual georeferenced data exploration is implemented using this technique. The performance comparison of YMap to some other vector?based Web GIS demonstrates the feasibility and benefits of this technique.This paper describes a pixel?based technique that enables highly interactive Web choropleth maps for georeferenced data publishing and visual exploration. Instead of delivering geographic knowledge to the client in polygon?based vector formats, we encode geographic object IDs and shape information into highly compact pixel images (decoding maps). This allows the combination of raster and vector characteristics while avoiding the problems in the currently existing pixel?based (raster?image?based) or vector?based techniques. Differing from traditional pixel?based techniques that are static and allow very little user interaction, our pixel?based technique allows varieties of sub?second (less than 1?s) interface controls such as dynamic query, dynamic classification, geographic object data identification, user?setting adjusting, as well as turning on/off layers, panning and zooming, with no or minimum server support. Compared with Web GIS techniques that use vector geographic data, our technique avoids transferring over the network large vector geographic data. It also avoids the non?trivial client?side computation to interpret the vector data and render the maps. Our technique features a short initial download time, near?constant performance scalability for larger numbers of geographic objects, and download?map?segment?only?when?necessary which potentially reduces the overall data transfer over the network. As a result, it accommodates general public users with slow modem network connections and low?end machines, as well as users with fast T?1 connections and fast machines. The client?side (browser) is implemented as lightweight Java applets. YMap, an easy?to?use, user?task?oriented highly interactive mapping tool for visual georeferenced data exploration is implemented using this technique. The performance comparison of YMap to some other vector?based Web GIS demonstrates the feasibility and benefits of this technique. }, isbn = {1365-8816}, doi = {10.1080/1365881051233125120}, url = {http://www.tandfonline.com/doi/abs/10.1080/1365881051233125120}, author = {Zhao,Haixia and Shneiderman, Ben} } @article {14078, title = {Comparative Genomics of Trypanosomatid Parasitic Protozoa}, journal = {Science}, volume = {309}, year = {2005}, month = {2005/07/15/}, pages = {404 - 409}, abstract = {A comparison of gene content and genome architecture of Trypanosoma brucei, Trypanosoma cruzi, and Leishmania major, three related pathogens with different life cycles and disease pathology, revealed a conserved core proteome of about 6200 genes in large syntenic polycistronic gene clusters. Many species-specific genes, especially large surface antigen families, occur at nonsyntenic chromosome-internal and subtelomeric regions. Retroelements, structural RNAs, and gene family expansion are often associated with syntenic discontinuities that{\textemdash}along with gene divergence, acquisition and loss, and rearrangement within the syntenic regions{\textemdash}have shaped the genomes of each parasite. Contrary to recent reports, our analyses reveal no evidence that these species are descended from an ancestor that contained a photosynthetic endosymbiont.}, doi = {10.1126/science.1112181}, url = {http://www.sciencemag.org/content/309/5733/404.abstract}, author = {El-Sayed, Najib M. and Myler,Peter J. and Blandin,Ga{\"e}lle and Berriman,Matthew and Crabtree,Jonathan and Aggarwal,Gautam and Caler,Elisabet and Renauld,Hubert and Worthey,Elizabeth A. and Hertz-Fowler,Christiane and Ghedin,Elodie and Peacock,Christopher and Bartholomeu,Daniella C. and Haas,Brian J. and Tran,Anh-Nhi and Wortman,Jennifer R. and Alsmark,U. Cecilia M. and Angiuoli,Samuel and Anupama,Atashi and Badger,Jonathan and Bringaud,Frederic and Cadag,Eithon and Carlton,Jane M. and Cerqueira,Gustavo C. and Creasy,Todd and Delcher,Arthur L. and Djikeng,Appolinaire and Embley,T. Martin and Hauser,Christopher and Ivens,Alasdair C. and Kummerfeld,Sarah K. and Pereira-Leal,Jose B. and Nilsson,Daniel and Peterson,Jeremy and Salzberg,Steven L. and Shallom,Joshua and Silva,Joana C. and Sundaram,Jaideep and Westenberger,Scott and White,Owen and Melville,Sara E. and Donelson,John E. and Andersson,Bj{\"o}rn and Stuart,Kenneth D. and Hall,Neil} } @conference {17887, title = {Comparing the Performance of High-Level Middleware Systems in Shared and Distributed Memory Parallel Environments}, booktitle = {Parallel and Distributed Processing Symposium, 2005. Proceedings. 19th IEEE International}, year = {2005}, month = {2005/04//}, pages = {30 - 30}, publisher = {IEEE}, organization = {IEEE}, abstract = {The utilization of toolkits for writing parallel and/or distributed applications has been shown to greatly enhance developer{\textquoteright}s productivity. Such an approach hides many of the complexities associated with writing these applications, rather than relying solely on programming language aids and parallel library support, such as MPI or PVM. In this work, we evaluate three different middleware systems that have been used to implement a computation and I/O-intensive data analysis application from the domain of computer vision. This study shows the benefits and overheads associated with each of the middleware systems, in different homogeneous computational environments and with different workloads. Our results lead the way toward being able to make better decisions for tuning the application environment, for selecting the appropriate middleware, and also for designing more powerful middleware systems to efficiently build and run highly complex applications in both parallel and distributed computing environments.}, keywords = {Application software, Computer science, Computer vision, Data analysis, Distributed computing, distributed computing environment, distributed memory parallel environment, distributed shared memory systems, Educational institutions, high-level middleware system, I/O-intensive data analysis application, Libraries, Middleware, parallel computing environment, parallel library support, parallel memories, programming language, programming languages, Runtime environment, shared memory parallel environment, Writing}, isbn = {0-7695-2312-9}, doi = {10.1109/IPDPS.2005.144}, author = {Kim,Jik-Soo and Andrade,H. and Sussman, Alan} } @article {16920, title = {A Comparison of Voice Controlled and Mouse Controlled Web Browsing (2000)}, journal = {Institute for Systems Research Technical Reports}, year = {2005}, month = {2005///}, abstract = {Voice controlled web browsers allow users to navigate by speaking the text of a link or an associated number instead of clicking with a mouse. One such browser is Conversa, by Conversational Computing. This within subjects study with 18 subjects compared voice browsing with traditional mouse-based browsing. It attempted to identify which of three common hypertext forms (linear slide show, grid/tiled map, and hierarchical menu) are well suited to voice navigation, and whether voice navigation is helped by numbering links. The study shows that voice control adds approximately 50 percent to the performance time for certain types of tasks. Subjective satisfaction measures indicate that for voice browsing, textual links are preferable to numbered links.}, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/6475}, author = {Christian,Kevin and Kules,Bill and Shneiderman, Ben and Youssef,Adel} } @conference {12370, title = {Computer vision on FPGAs: Design methodology and its application to gesture recognition}, booktitle = {Computer Vision and Pattern Recognition-Workshops, 2005. CVPR Workshops. IEEE Computer Society Conference on}, year = {2005}, month = {2005///}, pages = {133 - 133}, author = {Sen,M. and Corretjer,I. and Haim,F. and Saha,S. and Bhattacharyya, Shuvra S. and Schlessman,J. and Wolf,W.} } @article {17030, title = {Content Index to Volume 18}, journal = {INTERNATIONAL JOURNAL OF HUMAN{\textendash}COMPUTER INTERACTION}, volume = {18}, year = {2005}, month = {2005///}, pages = {367 - 368}, author = {Kuniavsky,M. and Vaughan,M. and Bederson, Benjamin B. and Shneiderman, Ben and Rau,P.L.P. and from Menus,T. and Lane,D.M. and Napier,H.A. and Peres,S.C. and S{\'a}ndor,A.} } @article {17033, title = {Coordinating Overviews and Detail Views of WWW Log Data (2000)}, journal = {Institute for Systems Research Technical Reports}, year = {2005}, month = {2005///}, abstract = {Web server log analysis tools provide site operators with useful information regarding the visitors to their sites. Unfortunately, the utility of these tools is often limited by the use of aggregate summaries that hide the information associated with individual requests, and by the absence of contextual data that might help users interpret those summaries. Building upon earlier work in the use of starfield visualizations to display web site requests as individual data points [8], this paper describes the use of multiple-coordinated visualizations of web log data at varying granularities, and alongside additional related displays of appropriate contextual information.}, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/6476}, author = {Hochheiser,Harry and Shneiderman, Ben} } @article {17797, title = {The CPR model for summarizing video}, journal = {Multimedia Tools and Applications}, volume = {26}, year = {2005}, month = {2005///}, pages = {153 - 173}, abstract = {Most past work on video summarization has been based on selecting key frames from videos. We propose a model of video summarization based on three important parameters: Priority (of frames), Continuity (of the summary), and non-Repetition (of the summary). In short, a summary must include high priority frames and must be continuous and non-repetitive. An optimal summary is one that maximizes an objective function based on these three parameters. We show examples of how CPR parameters can be computed and provide algorithms to find optimal summaries based on the CPR approach. Finally, we briefly report on the performance of these algorithms.}, doi = {10.1007/s11042-005-0451-7}, author = {Fayzullin,M. and V.S. Subrahmanian and Picariello, A. and Sapino,M. L} } @article {17044, title = {Crisis and opportunity in computer science}, journal = {Commun. ACM}, volume = {48}, year = {2005}, month = {2005/11//}, pages = {27 - 28}, abstract = {The future of the field depends on winning back student enrollment, public interest in technology, and government research funding.}, isbn = {0001-0782}, doi = {10.1145/1096000.1096024}, url = {http://doi.acm.org/10.1145/1096000.1096024}, author = {Klawe,Maria and Shneiderman, Ben} } @article {12931, title = {Critical Factors Influencing the Occurrence of Vibrio Cholerae in the Environment of Bangladesh}, journal = {Applied and Environmental MicrobiologyAppl. Environ. Microbiol.}, volume = {71}, year = {2005}, month = {2005/08/01/}, pages = {4645 - 4654}, abstract = {The occurrence of outbreaks of cholera in Africa in 1970 and in Latin America in 1991, mainly in coastal communities, and the appearance of the new serotype Vibrio cholerae O139 in India and subsequently in Bangladesh have stimulated efforts to understand environmental factors influencing the growth and geographic distribution of epidemic Vibrio cholerae serotypes. Because of the severity of recent epidemics, cholera is now being considered by some infectious disease investigators as a {\textquotedblleft}reemerging{\textquotedblright} disease, prompting new work on the ecology of vibrios. Epidemiological and ecological surveillance for cholera has been under way in four rural, geographically separated locations in Bangladesh for the past 4 years, during which both clinical and environmental samples were collected at biweekly intervals. The clinical epidemiology portion of the research has been published (Sack et al., J. Infect. Dis. 187:96-101, 2003). The results of environmental sampling and analysis of the environmental and clinical data have revealed significant correlations of water temperature, water depth, rainfall, conductivity, and copepod counts with the occurrence of cholera toxin-producing bacteria (presumably V. cholerae). The lag periods between increases or decreases in units of factors, such as temperature and salinity, and occurrence of cholera correlate with biological parameters, e.g., plankton population blooms. The new information on the ecology of V. cholerae is proving useful in developing environmental models for the prediction of cholera epidemics.}, isbn = {0099-2240, 1098-5336}, doi = {10.1128/AEM.71.8.4645-4654.2005}, url = {http://aem.asm.org/content/71/8/4645}, author = {Huq,Anwar and Sack,R. Bradley and Nizam,Azhar and Longini,Ira M. and Nair,G. Balakrish and Ali,Afsar and Morris,J. Glenn and Khan,M. N. Huda and Siddique,A. Kasem and Yunus,Mohammed and Albert,M. John and Sack,David A. and Rita R Colwell} } @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.} } @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 {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 {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 {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 {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} } @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 {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 {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} } @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 {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 {18208, title = {Efficient bandwidth resource allocation for low-delay multiuser video streaming}, journal = {Circuits and Systems for Video Technology, IEEE Transactions on}, volume = {15}, year = {2005}, month = {2005/09//}, pages = {1124 - 1137}, abstract = {This paper studies efficient bandwidth resource allocation for streaming multiple MPEG-4 fine granularity scalability (FGS) video programs to multiple users. We begin with a simple single-user scenario and propose a rate-control algorithm that has low delay and achieves an excellent tradeoff between the average visual distortion and the quality fluctuation. The proposed algorithm employs two weight factors for adjusting the tradeoff, and the optimal choice of these factors is derived. We then extend to the multiuser case and propose a dynamic resource allocation algorithm with low delay and low computational complexity. By exploring the variations in the scene complexity of video programs as well as dynamically and jointly distributing the available system resources among users, our proposed algorithm provides low fluctuation of quality for each user, and can support consistent or differentiated quality among all users to meet applications{\textquoteright} needs. Experimental results show that compared to traditional look-ahead sliding-window approaches, our algorithm can achieve comparable visual quality and channel utilization at a much lower cost of delay, computation, and storage.}, keywords = {algorithm;, allocation, allocation;, approaches;, average, Bandwidth, channel, channels;, coding;, complexity;, computational, control;, distortion;, dynamic, efficient, fine, fluctuation;, granularity, look-ahead, low-delay, MPEG-4, multiple, multiuser, QUALITY, quality;, rate-control, resource, scalability, scenario;, single-user, sliding-window, streaming;, Telecommunication, utilization;, video, visual}, isbn = {1051-8215}, doi = {10.1109/TCSVT.2005.852626}, author = {Su,Guan-Ming and M. Wu} } @article {15745, title = {Efficient iterative algorithms for the stochastic finite element method with application to acoustic scattering}, journal = {Computer Methods in Applied Mechanics and Engineering}, volume = {194}, year = {2005}, month = {2005/03/18/}, pages = {1037 - 1055}, abstract = {In this study, we describe the algebraic computations required to implement the stochastic finite element method for solving problems in which uncertainty is restricted to right-hand side data coming from forcing functions or boundary conditions. We show that the solution can be represented in a compact outer product form which leads to efficiencies in both work and storage, and we demonstrate that block iterative methods for algebraic systems with multiple right-hand sides can be used to advantage to compute this solution. We also show how to generate a variety of statistical quantities from the computed solution. Finally, we examine the behavior of these statistical quantities in one setting derived from a model of acoustic scattering.}, keywords = {01, 28, 60, finite element, multigrid, Multiple right-hand side, Scattering, Stochastic}, isbn = {0045-7825}, doi = {10.1016/j.cma.2004.06.028}, url = {http://www.sciencedirect.com/science/article/pii/S0045782504003123}, author = {Elman, Howard and Ernst, Oliver G. and O{\textquoteright}Leary,Dianne P. and Stewart, Michael} } @conference {12282, title = {Efficient lookup on unstructured topologies}, booktitle = {Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing}, series = {PODC {\textquoteright}05}, year = {2005}, month = {2005///}, pages = {77 - 86}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {We present LMS, a protocol for efficient lookup on unstructured networks. Our protocol uses a virtual namespace without imposing specific topologies. It is more efficient than existing lookup protocols for unstructured networks, and thus is an attractive alternative for applications in which the topology cannot be structured as a Distributed Hash Table (DHT).We present analytic bounds for the worst-case performance of our protocol. Through detailed simulations (with up to 100,000 nodes), we show that the actual performance on realistic topologies is significantly better. We also show in both simulations and a complete implementation (which includes over five hundred nodes) that our protocol is inherently robust against multiple node failures and can adapt its replication strategy to optimize searches according to a specific heuristic. Moreover, the simulation demonstrates the resilience of LMS to high node turnover rates, and that it can easily adapt to orders of magnitude changes in network size. The overhead incurred by LMS is small, and its performance approaches that of DHTs on networks of similar size.}, keywords = {distributed algorithms, lookup protocols, peer-to-peer networks, random walks}, isbn = {1-58113-994-2}, doi = {10.1145/1073814.1073828}, url = {http://doi.acm.org/10.1145/1073814.1073828}, author = {Morselli,Ruggero and Bhattacharjee, Bobby and Srinivasan, Aravind and Marsh,Michael A} } @conference {16877, title = {An efficient nearest neighbor algorithm for P2P settings}, booktitle = {Proceedings of the 2005 national conference on Digital government research}, series = {dg.o {\textquoteright}05}, year = {2005}, month = {2005///}, pages = {21 - 28}, publisher = {Digital Government Society of North America}, organization = {Digital Government Society of North America}, abstract = {New Peer-to-Peer (P2P) applications like P2P job-employee seeker networks and P2P virtual cities, for application domains such as collaborative urban planning and forming virtual communities, are about to emerge. An important component in these applications is spatial data, i.e., data with locational components. Many requests initiated on spatial data involve finding the spatial objects that are nearest to a query location. In this paper, we propose an efficient algorithm that finds the spatial objects that are nearest to a given query location on a P2P network in the order of their minimum distance to the query point. The proposed algorithm makes use of a distributed spatial index that does not rely on the use of a central server. The algorithm is designed to be more efficient by utilizing the parallel nature of the P2P network. A demonstration of the proposed algorithm was implemented as a prototype P2P application that finds events and places of interest in a city.}, keywords = {geographic information systems, nearest neighbor query, peer-to-peer networks, quadtree, spatial data}, url = {http://dl.acm.org/citation.cfm?id=1065226.1065237}, author = {Tanin,Egemen and Nayar,Deepa and Samet, Hanan} } @conference {16879, title = {Efficient query processing on spatial networks}, booktitle = {Proceedings of the 13th annual ACM international workshop on Geographic information systems}, series = {GIS {\textquoteright}05}, year = {2005}, month = {2005///}, pages = {200 - 209}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {A framework for determining the shortest path and the distance between every pair of vertices on a spatial network is presented. The framework, termed SILC, uses path coherence between the shortest path and the spatial positions of vertices on the spatial network, thereby, resulting in an encoding that is compact in representation and fast in path and distance retrievals. Using this framework, a wide variety of spatial queries such as incremental nearest neighbor searches and spatial distance joins can be shown to work on datasets of locations residing on a spatial network of sufficiently large size. The suggested framework is suitable for both main memory and disk-resident datasets.}, keywords = {location-based services, path coherence, Query processing, SILC framework, Spatial databases, spatial networks}, isbn = {1-59593-146-5}, doi = {10.1145/1097064.1097093}, url = {http://doi.acm.org/10.1145/1097064.1097093}, author = {Sankaranarayanan,Jagan and Alborzi,Houman and Samet, Hanan} } @article {17592, title = {Efficient strategies for channel management in wireless lans}, journal = {UMD, CS Tech. Rep. CS-TR}, volume = {4729}, year = {2005}, month = {2005///}, abstract = {We define efficient algorithms for channel management (channelassignment and load balancing among APs) in 802.11-based WLANs that lead to better usage of the wireless spectrum. These algorithms (called CFAssign) are based on a {\textquotedblleft}conflict-free set coloring{\textquotedblright} for- mulation that jointly perform load balancing along with channel assignment. Such a formulation has a number of advantages. First, it explicitly captures interference effects at clients. Next, it intrinsi- cally exposes opportunities for better channel re-use. Finally, algo- rithms based on this formulation do not depend on specific physical RF models and hence can be applied efficiently to a wide-range of in-building as well as outdoor scenarios. We have performed extensive packet-level simulations and mea- surements on a deployed wireless testbed of 70 APs to validate the performance of our proposed algorithms. We show that in ad- dition to single network scenarios, CFAssign algorithms are well suited for channel assignment in scenarios where multiple wireless networks share the same physical space and contend for the same frequency spectrum. Our results over a wide range of scenarios indicate that CFAssign reduces the interference at clients by about 50-70\% in comparison to current best-known techniques. }, author = {Mishra,A. and Brik,V. and Banerjee,S. and Srinivasan, Aravind and Arbaugh, William A.} } @conference {14793, title = {EMPS: an environment for memory performance studies}, booktitle = {Parallel and Distributed Processing Symposium, 2005. Proceedings. 19th IEEE International}, year = {2005}, month = {2005/04//}, publisher = {IEEE}, organization = {IEEE}, abstract = {This paper describes an overview of environment for memory performance studies (EMPS). EMPS is a framework to allow different data gathering and simulation tools to be composed together to predict the performance of parallel programs on a variety of current and future high end computing (HEC) systems. The framework seeks to combine the automated nature of direct execution simulation with the predictive capabilities of performance modeling.}, keywords = {Application software, cache storage, Computational modeling, Concurrent computing, data gathering, Delay, digital simulation, Economic forecasting, EMP radiation effects, high end computing system, High performance computing, memory architecture, memory performance, Moore{\textquoteright}s Law, PARALLEL PROCESSING, parallel program, Predictive models, simulation tool, Writing}, isbn = {0-7695-2312-9}, doi = {10.1109/IPDPS.2005.196}, author = {Hollingsworth, Jeffrey K and Snavely, A. and Sbaraglia, S. and Ekanadham, K.} } @article {17135, title = {Envisioning help resources for the future information ecology: Toward an enriched sense of help}, journal = {Proceedings of the American Society for Information Science and Technology}, volume = {42}, year = {2005}, month = {2005/01/01/}, pages = {n/a-n/a - n/a-n/a}, isbn = {1550-8390}, doi = {10.1002/meet.14504201123}, url = {http://onlinelibrary.wiley.com/doi/10.1002/meet.14504201123/abstract}, author = {Haas,Stephanie W and Brown,Laurie and Denn,Sheila and Locke,David and Shneiderman, Ben} } @article {17698, title = {Error Analysis of the Quasi-Gram{\textendash}Schmidt Algorithm}, journal = {SIAM Journal on Matrix Analysis and Applications}, volume = {27}, year = {2005}, month = {2005///}, pages = {493 - 506}, abstract = {Let the $n\,{\times}\,p$ $(n\geq p)$ matrix $X$ have the QR factorization $X = QR$, where $R$ is an upper triangular matrix of order $p$ and $Q$ is orthonormal. This widely used decomposition has the drawback that $Q$ is not generally sparse even when $X$ is. One cure is to discard $Q$, retaining only $X$ and $R$. Products like $a = Q\trp y = R\itp X\trp y$ can then be formed by computing $b = X\trp y$ and solving the system $R\trp a = b$. This approach can be used to modify the Gram--Schmidt algorithm for computing $Q$ and $R$ to compute $R$ without forming $Q$ or altering $X$. Unfortunately, this quasi-Gram--Schmidt algorithm can produce inaccurate results. In this paper it is shown that with reorthogonalization the inaccuracies are bounded under certain natural conditions.}, keywords = {Gram{\textendash}Schmidt algorithm, orthogonalization, QR factorization, rounding-error analysis, sparse matrix}, doi = {10.1137/040607794}, url = {http://link.aip.org/link/?SML/27/493/1}, author = {Stewart, G.W.} } @conference {16372, title = {Evaluating and tuning a static analysis to find null pointer bugs}, booktitle = {Proceedings of the 6th ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering}, year = {2005}, month = {2005///}, pages = {13 - 19}, author = {Hovemeyer,D. and Spacco,J. and Pugh, William} } @article {15441, title = {An evolutionary testbed for software technology evaluation}, journal = {Innovations in Systems and Software Engineering}, volume = {1}, year = {2005}, month = {2005///}, pages = {3 - 11}, abstract = {Empirical evidence and technology evaluation are needed to close the gap between the state of the art and the state of the practice in software engineering. However, there are difficulties associated with evaluating technologies based on empirical evidence: insufficient specification of context variables, cost of experimentation, and risks associated with trying out new technologies. In this paper, we propose the idea of an evolutionary testbed for addressing these problems. We demonstrate the utility of the testbed in empirical studies involving two different research technologies applied to the testbed, as well as the results of these studies. The work is part of NASArsquos High Dependability Computing Project (HDCP), in which we are evaluating a wide range of new technologies for improving the dependability of NASA mission-critical systems.}, doi = {10.1007/s11334-005-0007-z}, author = {Lindvall,M. and Rus,I. and Shull, F. and Zelkowitz, Marvin V and Donzelli,P. and Memon, Atif M. and Basili, Victor R. and Costa,P. and Tvedt,R. and Hochstein, L.} } @article {16389, title = {EvoSTOC Contributions}, journal = {Applications of evolutionary computing: EvoWorkshops 2005, EvoBIO, EvoCOMNET, EvoHOT, EvoIASP, EvoMUSART, and EvoSTOC}, year = {2005}, month = {2005///}, author = {Merkle,D. and Middendorf,M. and Scheidler,A. and Avigad,G. and Moshaiov,A. and Brauner,N. and Parsopoulos,K.E. and Vrahatis,M.N. and Rand, William and Riolo,R} } @article {12794, title = {Executable requirements specifications using triggered message sequence charts}, journal = {Distributed Computing and Internet Technology}, year = {2005}, month = {2005///}, pages = {482 - 493}, author = {Sengupta,B. and Cleaveland, Rance} } @article {17154, title = {Exploring Personal Media: A Spatial Interface Supporting User-Defined Semantic Regions (2004)}, year = {2005}, month = {2005///}, abstract = {Graphical mechanisms for spatially organizing personal media data could enable users to fruitfully apply their mental models. This paper introduces Semantic Regions, an innovative way for users to construct mental models by drawing regions on 2D space and specifying the semantics for each region. Then users can apply personal ontologies to personal media data using the fling-and-flock metaphor. This allows photos (or other personal media) to be dragged to the display and automatically grouped according to time, geography, family trees, groups of friends, or other conceptual maps. The prototype implementation for Semantic Regions, MediaFinder, was validated with two usability tests for usage and construction of user-defined mental models. Applications and extensions are discussed.}, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/6513}, author = {Kang,Hyunmo and Shneiderman, Ben} } @article {16111, title = {Extending the Utility of Treemaps with Flexible Hierarchy (2004)}, year = {2005}, month = {2005///}, abstract = {Treemaps is a visualization technique for presenting hierarchical information on two dimensional displays. Prior implementations limit the visualization to pre-defined static hierarchies. Flexible hierarchy, a new capability of Treemap 4.0, enables users to define various hierarchies through dynamically selecting a series of data attributes so that they can discover patterns, clusters and outliers. This paper describes the design and implementation issues of flexible hierarchy. It then reports on a usability study which led to enhancements to the interface.}, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/6514}, author = {Chintalapani,Gouthami and Plaisant, Catherine and Shneiderman, Ben} } @article {17157, title = {Extending User Understanding of Federal Statistics in Tables (2000)}, journal = {Institute for Systems Research Technical Reports}, year = {2005}, month = {2005///}, abstract = {This paper describes progress toward improving user interfaces for US Federal government statistics that are presented in tables. Based on studies of user behaviors and needs related to statistical tables, we describe interfaces to assist diverse users with a range of statistical literacy to explore, find, understand, and use US Federal government statistics.}, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/6473}, author = {Marchionini,Gary and Hert,Carol and Liddy,Liz and Shneiderman, Ben} } @article {17167, title = {Finding Governmental Statistical Data on the Web: Three Empirical Studies of the FedStats Topics Page (2003)}, year = {2005}, month = {2005///}, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/6509}, author = {Ceaparu,Irina and Shneiderman, Ben} } @book {19347, title = {Finite Elements and Fast Iterative Solvers : with Applications in Incompressible Fluid Dynamics}, year = {2005}, month = {2005}, pages = {416}, publisher = {Oxford University Press}, organization = {Oxford University Press}, abstract = {The subject of this book is the efficient solution of partial differential equations (PDEs) that arise when modelling incompressible fluid flow. The material is organized into four groups of two chapters each, covering the Poisson equation (chapters 1 \& 2); the convection-diffucion equation (chapters 3 \& 4); the Stokes equations (chapters 5 \& 6); and the Navier-Stokes equations (chapters 7 \& 8). These equations represent important models within the domain of computational fluid dynamics, but they also arise in many other settings. For each PDE model, there is a chapter concerned with finite element discretization. For each problem and associated solvers there is a description of how to compute along with theoretical analysis which guides the choice of approaches. Illustrative numerical results occur throughout the book, which have been computed with the freely downloadable IFISS software. All numerical results should be reproducible by readers who have access to MATLAB and there is considerable scope for experimentation in the {\textquoteright}computational laboratory{\textquoteright} provided by the software. This book provides an excellent introduction to finite elements, iterative linear solvers and scientific computing aimed at graduates in engineering, numerical analysis, applied mathematics and interdisciplinary scientific computing. Including theoretical problems and practical exercises closely tied with freely downloadable MATLAB software, this book is an ideal teaching and learning resource.}, keywords = {Computers / Computer Science, Mathematics / Numerical Analysis, Science / Mechanics / Fluids, Science / Physics / General, Technology \& Engineering / Mechanical}, isbn = {9780191523786}, author = {Elman, Howard and Silvester, David J and Wathen, Andrew J} } @conference {13409, title = {A framework for decomposing reputation in MAS into competence and integrity}, booktitle = {Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems}, series = {AAMAS {\textquoteright}05}, year = {2005}, month = {2005///}, pages = {1253 - 254}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, isbn = {1-59593-093-0}, doi = {10.1145/1082473.1082719}, url = {http://doi.acm.org/10.1145/1082473.1082719}, author = {Smith,Michael J. and desJardins, Marie} } @article {12969, title = {A framework for set-oriented computation in inductive logic programming and its application in generalizing inverse entailment}, journal = {Inductive Logic Programming}, year = {2005}, month = {2005///}, pages = {69 - 86}, author = {Corrada Bravo, Hector and Page,D. and Ramakrishnan,R. and Shavlik,J. and Costa,V. S} } @conference {18875, title = {Game-tree search with combinatorially large belief states}, volume = {19}, year = {2005}, month = {2005///}, pages = {254 - 254}, abstract = {In games such as kriegspiel chess (a chess variantwhere players have no direct knowledge of the op- ponent{\textquoteright}s pieces{\textquoteright} locations) the belief state{\textquoteright}s sizes dwarf those of other partial information games like bridge, scrabble, and poker{\textendash}and there is no easy way to generate states satisfying the given observa- tions. We show that statistical sampling approaches can be developed to do well in such games. We show that it is not necessary for the random sample to consist only of game boards that satisfy each and every one of a player{\textquoteright}s observations. In fact, we win 24\% more often by beginning with such completely consistent boards and gradually switching (as the game progressed) to boards that are merely consistent with the latest observation. This surprising result is explained by noting that as the game progresses, a board that is consistent with the last move becomes more and more likely to be consistent with the entire set of observations, even if we have no idea what sequence of moves might have actually generated this board. }, url = {http://www.ijcai.org/papers/0878.pdf}, author = {Parker,A. and Nau, Dana S. and V.S. Subrahmanian} } @article {17177, title = {Generating and Querying Semantic Web Environments for Photo Libraries (2005)}, journal = {Institute for Systems Research Technical Reports}, year = {2005}, month = {2005///}, abstract = {Online photo libraries require a method to efficiently search a collection of photographs, and retrieve photos with similar attributes. Our motivation was to incorporate an existing collection of over 250 photographs of over 200 faculty members and events spanning 7 decades into a library called CS PhotoHistory that is available in hypertext and on the Semantic Web. In this paper, we identify challenges related to making this repository available on the Semantic Web, including issues of automation, modeling, and expressivity. Using CS PhotoHistory as a case study, we describe the process of creating an ontology and a querying interface for interacting with a digital photo library on the Semantic Web.}, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/6538}, author = {Axelrod,Adam and Golbeck,Jennifer and Shneiderman, Ben} } @conference {18394, title = {Generating testable hypotheses from tacit knowledge for high productivity computing}, booktitle = {Proceedings of the second international workshop on Software engineering for high performance computing system applications}, series = {SE-HPCS {\textquoteright}05}, year = {2005}, month = {2005///}, pages = {17 - 21}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {In this research, we are developing our understanding of how the high performance computing community develops effective parallel implementations of programs by collecting the folklore within the community. We use this folklore as the basis for a series of experiments, which we expect, will validate or negate these assumptions.}, keywords = {folklore elicitation, high productivity development time experimental studies, hypothesis generation, tacit knowledge solicitation, testable hypotheses}, isbn = {1-59593-117-1}, doi = {10.1145/1145319.1145325}, url = {http://doi.acm.org/10.1145/1145319.1145325}, author = {Asgari, Sima and Hochstein, Lorin and Basili, Victor R. and Zelkowitz, Marvin V and Hollingsworth, Jeffrey K and Carver, Jeff and Shull, Forrest} } @article {19077, title = {The genome of the protist parasite Entamoeba histolytica}, journal = {Nature}, volume = {433}, year = {2005}, month = {2005}, pages = {865 - 868}, author = {Loftus,B. and Anderson,I. and Davies,R. and Alsmark,U. C.M and Samuelson,J. and Amedeo,P. and Roncaglia,P. and Berriman,M. and Hirt,R. P and Mann,B. J and others} } @article {14071, title = {The Genome Sequence of Trypanosoma cruzi, Etiologic Agent of Chagas Disease}, journal = {Science}, volume = {309}, year = {2005}, month = {2005/07/15/}, pages = {409 - 415}, abstract = {Whole-genome sequencing of the protozoan pathogen Trypanosoma cruzi revealed that the diploid genome contains a predicted 22,570 proteins encoded by genes, of which 12,570 represent allelic pairs. Over 50\% of the genome consists of repeated sequences, such as retrotransposons and genes for large families of surface molecules, which include trans-sialidases, mucins, gp63s, and a large novel family (>1300 copies) of mucin-associated surface protein (MASP) genes. Analyses of the T. cruzi, T. brucei, and Leishmania major (Tritryp) genomes imply differences from other eukaryotes in DNA repair and initiation of replication and reflect their unusual mitochondrial DNA. Although the Tritryp lack several classes of signaling molecules, their kinomes contain a large and diverse set of protein kinases and phosphatases; their size and diversity imply previously unknown interactions and regulatory processes, which may be targets for intervention.}, doi = {10.1126/science.1112631}, url = {http://www.sciencemag.org/content/309/5733/409.abstract}, author = {El-Sayed, Najib M. and Myler,Peter J. and Bartholomeu,Daniella C. and Nilsson,Daniel and Aggarwal,Gautam and Tran,Anh-Nhi and Ghedin,Elodie and Worthey,Elizabeth A. and Delcher,Arthur L. and Blandin,Ga{\"e}lle and Westenberger,Scott J. and Caler,Elisabet and Cerqueira,Gustavo C. and Branche,Carole and Haas,Brian and Anupama,Atashi and Arner,Erik and {\r A}slund,Lena and Attipoe,Philip and Bontempi,Esteban and Bringaud,Fr{\'e}d{\'e}ric and Burton,Peter and Cadag,Eithon and Campbell,David A. and Carrington,Mark and Crabtree,Jonathan and Darban,Hamid and da Silveira,Jose Franco and de Jong,Pieter and Edwards,Kimberly and Englund,Paul T. and Fazelina,Gholam and Feldblyum,Tamara and Ferella,Marcela and Frasch,Alberto Carlos and Gull,Keith and Horn,David and Hou,Lihua and Huang,Yiting and Kindlund,Ellen and Klingbeil,Michele and Kluge,Sindy and Koo,Hean and Lacerda,Daniela and Levin,Mariano J. and Lorenzi,Hernan and Louie,Tin and Machado,Carlos Renato and McCulloch,Richard and McKenna,Alan and Mizuno,Yumi and Mottram,Jeremy C. and Nelson,Siri and Ochaya,Stephen and Osoegawa,Kazutoyo and Pai,Grace and Parsons,Marilyn and Pentony,Martin and Pettersson,Ulf and Pop, Mihai and Ramirez,Jose Luis and Rinta,Joel and Robertson,Laura and Salzberg,Steven L. and Sanchez,Daniel O. and Seyler,Amber and Sharma,Reuben and Shetty,Jyoti and Simpson,Anjana J. and Sisk,Ellen and Tammi,Martti T. and Tarleton,Rick and Teixeira,Santuza and Van Aken,Susan and Vogt,Christy and Ward,Pauline N. and Wickstead,Bill and Wortman,Jennifer and White,Owen and Fraser,Claire M. and Stuart,Kenneth D. and Andersson,Bj{\"o}rn} } @article {16291, title = {The Genome Sequence of Trypanosoma Cruzi, Etiologic Agent of Chagas Disease}, journal = {ScienceScience}, volume = {309}, year = {2005}, month = {2005/07/15/}, pages = {409 - 415}, abstract = {Whole-genome sequencing of the protozoan pathogen Trypanosoma cruzi revealed that the diploid genome contains a predicted 22,570 proteins encoded by genes, of which 12,570 represent allelic pairs. Over 50\% of the genome consists of repeated sequences, such as retrotransposons and genes for large families of surface molecules, which include trans-sialidases, mucins, gp63s, and a large novel family (>1300 copies) of mucin-associated surface protein (MASP) genes. Analyses of the T. cruzi, T. brucei, and Leishmania major (Tritryp) genomes imply differences from other eukaryotes in DNA repair and initiation of replication and reflect their unusual mitochondrial DNA. Although the Tritryp lack several classes of signaling molecules, their kinomes contain a large and diverse set of protein kinases and phosphatases; their size and diversity imply previously unknown interactions and regulatory processes, which may be targets for intervention.}, isbn = {0036-8075, 1095-9203}, doi = {10.1126/science.1112631}, url = {http://www.sciencemag.org/content/309/5733/409}, author = {El-Sayed, Najib M. and Myler,Peter J. and Bartholomeu,Daniella C. and Nilsson,Daniel and Aggarwal,Gautam and Tran,Anh-Nhi and Ghedin,Elodie and Worthey,Elizabeth A. and Delcher,Arthur L. and Blandin,Ga{\"e}lle and Westenberger,Scott J. and Caler,Elisabet and Cerqueira,Gustavo C. and Branche,Carole and Haas,Brian and Anupama,Atashi and Arner,Erik and {\r A}slund,Lena and Attipoe,Philip and Bontempi,Esteban and Bringaud,Fr{\'e}d{\'e}ric and Burton,Peter and Cadag,Eithon and Campbell,David A. and Carrington,Mark and Crabtree,Jonathan and Darban,Hamid and da Silveira,Jose Franco and de Jong,Pieter and Edwards,Kimberly and Englund,Paul T. and Fazelina,Gholam and Feldblyum,Tamara and Ferella,Marcela and Frasch,Alberto Carlos and Gull,Keith and Horn,David and Hou,Lihua and Huang,Yiting and Kindlund,Ellen and Klingbeil,Michele and Kluge,Sindy and Koo,Hean and Lacerda,Daniela and Levin,Mariano J. and Lorenzi,Hernan and Louie,Tin and Machado,Carlos Renato and McCulloch,Richard and McKenna,Alan and Mizuno,Yumi and Mottram,Jeremy C. and Nelson,Siri and Ochaya,Stephen and Osoegawa,Kazutoyo and Pai,Grace and Parsons,Marilyn and Pentony,Martin and Pettersson,Ulf and Pop, Mihai and Ramirez,Jose Luis and Rinta,Joel and Robertson,Laura and Salzberg,Steven L. and Sanchez,Daniel O. and Seyler,Amber and Sharma,Reuben and Shetty,Jyoti and Simpson,Anjana J. and Sisk,Ellen and Tammi,Martti T. and Tarleton,Rick and Teixeira,Santuza and Van Aken,Susan and Vogt,Christy and Ward,Pauline N. and Wickstead,Bill and Wortman,Jennifer and White,Owen and Fraser,Claire M. and Stuart,Kenneth D. and Andersson,Bj{\"o}rn} } @article {14616, title = {Genome-Wide Analysis of Chromosomal Features Repressing Human Immunodeficiency Virus Transcription}, journal = {Journal of VirologyJ. Virol.}, volume = {79}, year = {2005}, month = {2005/06/01/}, pages = {6610 - 6619}, abstract = {We have investigated regulatory sequences in noncoding human DNA that are associated with repression of an integrated human immunodeficiency virus type 1 (HIV-1) promoter. HIV-1 integration results in the formation of precise and homogeneous junctions between viral and host DNA, but integration takes place at many locations. Thus, the variation in HIV-1 gene expression at different integration sites reports the activity of regulatory sequences at nearby chromosomal positions. Negative regulation of HIV transcription is of particular interest because of its association with maintaining HIV in a latent state in cells from infected patients. To identify chromosomal regulators of HIV transcription, we infected Jurkat T cells with an HIV-based vector transducing green fluorescent protein (GFP) and separated cells into populations containing well-expressed (GFP-positive) or poorly expressed (GFP-negative) proviruses. We then determined the chromosomal locations of the two classes by sequencing 971 junctions between viral and cellular DNA. Possible effects of endogenous cellular transcription were characterized by transcriptional profiling. Low-level GFP expression correlated with integration in (i) gene deserts, (ii) centromeric heterochromatin, and (iii) very highly expressed cellular genes. These data provide a genome-wide picture of chromosomal features that repress transcription and suggest models for transcriptional latency in cells from HIV-infected patients.}, isbn = {0022-538X, 1098-5514}, doi = {10.1128/JVI.79.11.6610-6619.2005}, url = {http://jvi.asm.org/content/79/11/6610}, author = {Lewinski,M. K and Bisgrove,D. and Shinn,P. and Chen,H. and Hoffmann,C. and Hannenhalli, Sridhar and Verdin,E. and Berry,C. C and Ecker,J. R and Bushman,F. D} } @article {18845, title = {Geometric algorithms for computing cutter engagement functions in 2.5D milling operations}, journal = {Computer-Aided Design}, volume = {37}, year = {2005}, month = {2005/12//}, pages = {1469 - 1480}, abstract = {Cutter engagement is a measure that describes what portion of the cutter is involved in machining at a given instant of time. During profile milling of complex geometries, cutter engagement varies significantly along the cutter path. Cutter engagement information helps in determining the efficiency of the cutter path and also helps in improving it by adjusting the feed rate. This paper describes geometric algorithms for computing piece-wise continuous closed-form cutter engagement functions for 2.5D milling operations. The results produced by our algorithm are compared with the results obtained by discrete simulations of the cutting process and appear to match very well.}, keywords = {Cutter engagement, Cutter path planning, Feed rate adjustments}, isbn = {0010-4485}, doi = {10.1016/j.cad.2005.03.001}, url = {http://www.sciencedirect.com/science/article/pii/S0010448505000801}, author = {Gupta, Satyandra K. and Saini,Sunil K. and Spranklin,Brent W. and Yao,Zhiyang} } @conference {18882, title = {Going far, logically}, volume = {19}, year = {2005}, month = {2005///}, pages = {615 - 615}, abstract = {There are numerous applications where we need toensure that multiple moving objects are sufficiently far apart. Furthermore, in many moving object do- mains, there is positional indeterminacy {\textemdash} we are not 100\% sure exactly when a given moving object will be at a given location. [Yaman et al., 2004] provided a logic of motion but did not provide algo- rithms to ensure that moving objects are kept suf- ficiently far apart. In this paper, we extend their logic to include a {\textquotedblleft}far{\textquotedblright} predicate. We develop the CheckFar algorithm that checks if any given two objects will always be sufficiently far apart at dur- ing a time interval. We have run a set of experi- ments showing that our CheckFar algorithm scales very well. }, url = {http://www.cs.umd.edu/~nau/papers/yaman2005going.pdf}, author = {Yaman,F. and Nau, Dana S. and V.S. Subrahmanian} } @conference {17794, title = {A graph theoretical foundation for integrating RDF ontologies}, booktitle = {PROCEEDINGS OF THE NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE}, volume = {20}, year = {2005}, month = {2005///}, pages = {1442 - 1442}, abstract = {RDF ontologies are rapidly increasing in number. We studythe problem of integrating two RDF ontologies under a given set H of Horn clauses that specify semantic relationships be- tween terms in the ontology, as well as under a given set of negative constraints. We formally define the notion of a {\textquotedblleft}wit- ness{\textquotedblright} to the integrability of two RDF ontologies under such constraints. A witness represents a way of integrating the ontologies together. We define a {\textquotedblleft}minimal{\textquotedblright} witnesses and provide the polynomial CROW (Computing RDF Ontology Witness) algorithm to find a witness. We report on the per- formance of CROW both on DAML, SchemaWeb and Onto- Broker ontologies as well as on synthetically generated data. The experiments show that CROW works very well on real- life ontologies and scales to massive ontologies. }, author = {Udrea,O. and Deng,Y. and Ruckhaus,E. and V.S. Subrahmanian} } @conference {13335, title = {The half-edge tree: a compact data structure for level-of-detail tetrahedral meshes}, booktitle = {Shape Modeling and Applications, 2005 International Conference}, year = {2005}, month = {2005/06//}, pages = {332 - 337}, abstract = {We propose a new data structure for the compact encoding of a level-of detail (LOD) model of a three-dimensional scalar field based on unstructured tetrahedral meshes. Such data structure, called a half-edge tree (HET), is built through the iterative application of a half-edge collapse, i.e. by contracting an edge to one of its endpoints. We also show that selective refined meshes extracted from an HET contain on average about 34\% and up to 75\% less tetrahedra than those extracted from an LOD model built through a general edge collapse.}, keywords = {application;, compact, computational, data, detection;, edge, encoding;, generation;, geometry;, half-edge, iterative, level-of-detail, mesh, meshes;, methods;, model;, structure;, structures;, tetrahedral, tree, tree;}, doi = {10.1109/SMI.2005.47}, author = {Danovaro,E. and De Floriani, Leila and Magillo,P. and Puppo,E. and Sobrero,D. and Sokolovsky,N.} } @article {13784, title = {Headline Generation for Written and Broadcast News}, year = {2005}, month = {2005/03//}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {This technical report is an overview of work done on Headline Generation for written and broadcast news. The report covers HMM Hedge, a statistical approach based on the noisy channel model, Hedge Trimmer, a parse-and-trim approach using linguistically motivated trimming rules, and Topiary, a combination of Trimmer and Unsupervised Topic Discovery. Automatic evaluation of summaries using ROUGE and BLEU is described and used to evaluate the Headline Generation systems.}, keywords = {*INFORMATION RETRIEVAL, *RADIO BROADCASTING, AUTOMATIC, AUTOMATIC SUMMARIZATION, HEDGE TRIMMER, INFORMATION SCIENCE, RADIO COMMUNICATIONS, STATISTICAL PROCESSES, TEST AND EVALUATION, WORDS(LANGUAGE)}, url = {http://stinet.dtic.mil/oai/oai?\&verb=getRecord\&metadataPrefix=html\&identifier=ADA454198}, author = {Zajic, David and Dorr, Bonnie J and Schwartz,Richard} } @article {17187, title = {Help! I{\textquoteright}m Lost: User Frustration in Web Navigation (2003)}, journal = {Institute for Systems Research Technical Reports}, year = {2005}, month = {2005///}, abstract = {Computers can be valuable tools, and networked resources via the Internet can be beneficial to many different populations and communities. Unfortunately, when people are unable to reach their task goals due to frustrating experiences, this can hinder the effectiveness of technology. This research summary provides information about the user frustration research that has been performed at the University of Maryland and Towson University. Causes of user frustration are discussed in this research summary, along with the surprising finding that nearly one-third to one-half of the time spent in front of the computer is wasted due to frustrating experiences. Furthermore, when interfaces are planned to be deceptive and confusing, this}, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/6508}, author = {Lazar,Jonathan and Bessiere,Katie and Ceaparu,Irina and Robinson,John and Shneiderman, Ben} } @conference {16668, title = {The Hiero machine translation system: Extensions, evaluation, and analysis}, booktitle = {Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing}, year = {2005}, month = {2005///}, pages = {779 - 786}, author = {Chiang,D. and Lopez,A. and Madnani,N. and Monz,C. and Resnik, Philip and Subotin,M.} } @conference {17875, title = {High Performance Communication between Parallel Programs}, booktitle = {Parallel and Distributed Processing Symposium, 2005. Proceedings. 19th IEEE International}, year = {2005}, month = {2005/04//}, pages = {177b- 177b - 177b- 177b}, publisher = {IEEE}, organization = {IEEE}, abstract = {We present algorithms for high performance communication between message-passing parallel programs, and evaluate the algorithms as implemented in InterComm. InterComm is a framework to couple parallel programs in the presence of complex data distributions within a coupled application. Multiple parallel libraries and languages may be used in the different programs of a single coupled application. The ability to couple such programs is required in many emerging application areas, such as complex simulations that model physical phenomena at multiple scales and resolutions, and image data analysis applications. We describe the new algorithms we have developed for computing inter-program communication patterns. We present experimental results showing the performance of various algorithmic tradeoffs, and also compare performance against an earlier system.}, keywords = {Adaptive arrays, Analytical models, Chaotic communication, Computational modeling, Computer science, Data analysis, data distribution, Educational institutions, high performance communication, image data analysis, image resolution, inter-program communication patterns, InterComm, Libraries, Message passing, parallel languages, parallel libraries, parallel programming, parallel programs, performance evaluation, Wind}, isbn = {0-7695-2312-9}, doi = {10.1109/IPDPS.2005.243}, author = {Jae-Yong Lee and Sussman, Alan} } @conference {17214, title = {Human-computer interaction themes in digital government: web site comprehension and statistics visualization}, booktitle = {Proceedings of the 2005 national conference on Digital government research}, series = {dg.o {\textquoteright}05}, year = {2005}, month = {2005///}, pages = {7 - 8}, publisher = {Digital Government Society of North America}, organization = {Digital Government Society of North America}, abstract = {Digital government applications often involve web sites to provide information for citizens and visitors from essential services such as passport application or motor vehicle registration to discretionary, but highly popular applications such as recreation and parks information. Another aspect of government web sites is the delivery of statistical reports with summary tables, aggregated data resources, and extensive raw data files. This review focuses on human-computer interaction themes to improve designs of web sites and statistics visualization, ??? specifically as they relate to digital government sites. It also addresses research methods that are appropriate for digital government interfaces.}, url = {http://dl.acm.org/citation.cfm?id=1065226.1065230}, author = {Shneiderman, Ben} } @conference {16099, title = {"I hear the pattern": interactive sonification of geographical data patterns}, booktitle = {CHI {\textquoteright}05 extended abstracts on Human factors in computing systems}, series = {CHI EA {\textquoteright}05}, year = {2005}, month = {2005///}, pages = {1905 - 1908}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Interactive sonification (non-speech sound) is a novel strategy to present the geographical distribution patterns of statistical data to vision impaired users. We discuss the design space with dimensions of interaction actions, data representation forms, input devices, navigation structures, and sound feedback encoding. Two interfaces were designed, one using a keyboard and another using a smooth surface touch tablet. A study with three blind users shows that they are able to perceive patterns of 5-category values on both familiar and unknown maps, and learn new map geography, in both interfaces.}, keywords = {auditory user interfaces, information seeking, sonification, universal usability, vision impairment}, isbn = {1-59593-002-7}, doi = {10.1145/1056808.1057052}, url = {http://doi.acm.org/10.1145/1056808.1057052}, author = {Zhao,Haixia and Plaisant, Catherine and Shneiderman, Ben} } @inbook {12677, title = {Image Sequence Stabilization, Mosaicking, and Superresolution}, booktitle = {Handbook of Image and Video Processing (Second Edition)Handbook of Image and Video Processing (Second Edition)}, year = {2005}, month = {2005///}, pages = {309-VII - 309-VII}, publisher = {Academic Press}, organization = {Academic Press}, address = {Burlington}, abstract = {A sequence of temporal images gathered from a single sensor adds a whole new dimension to two-dimensional (2D) image data. Availability of an image sequence permits the measurement of quantities such as subpixel intensities, camera motion and depth, and detection and tracking of moving objects. In turn, the processing of image sequences necessitates the development of sophisticated techniques to extract this information. With the recent availability of powerful yet inexpensive computers, data storage systems, and image acquisition devices, image sequence analysis has transitioned from an esoteric research domain to a practical area with significant commercial interest.}, isbn = {978-0-12-119792-6}, url = {http://www.sciencedirect.com/science/article/pii/B9780121197926500826}, author = {Chellapa, Rama and Srinivasan, S. and Aggarwal,G. and Veeraraghavan,A.}, editor = {Al Bovik} } @article {17221, title = {Image-Based Highly Interactive Web Mapping for Geo-Referenced Data Publishing (2002)}, journal = {Institute for Systems Research Technical Reports}, year = {2005}, month = {2005///}, abstract = {This paper describes an image-based technique that enables highly interactive Web choropleth maps for geo-referenced data publishing and visual exploration. Geographic knowledge is encoded into raster images and delivered to the client, instead of in vector formats. Differing from traditional raster-imagebased approaches that are static and allow very little user interaction, it allows varieties of sub-second fine-grained interface controls such as dynamic query, dynamic classification, geographic object data identification, user setting adjusting, as well as turning on/off layers, panning and zooming, with no or minimum server support. Compared to Web GIS approaches that are based on vector geographic data, this technique has the features of short initial download time, near-constant performance scalability for larger numbers of geographic objects, and download-map-segment-only-when-necessary which potentially reduces the overall data transfer over the network. As a result, it accommodates general public users with slow modem network connections and low-end machines, as well as users with fast T-1 connections and fast machines. The client-side (browser) is implemented as light-weight Java applets. YMap, an easy-to-use, user-task-oriented highly interactive mapping tool prototype for visual georeferenced data exploration is implemented using this technique.}, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/6498}, author = {Zhao,Haixia and Shneiderman, Ben} } @article {16107, title = {Immediate Usability: A Case Study of Public Access Design for a Community Photo Library (2003)}, year = {2005}, month = {2005///}, abstract = {This paper describes a novel instantiation of a digital photo library in a public access system. It demonstrates how designers can utilize characteristics of a target user community (social constraints, trust, and a lack of anonymity) to provide capabilities that would be impractical in other types of public access systems. It also presents a compact set of design principles and guidelines for ensuring the immediate usability of public access information systems. These principles and guidelines were derived from our experience developing PhotoFinder Kiosk, a community photo library. Attendees of a major HCI conference (CHI 2001 Conference on Human Factors in Computing Systems) successfully used the tool to browse and annotate collections of photographs spanning 20 years of HCI-related conferences, producing a richly annotated photo history of the field of human-computer interaction. Observations and log data were used to evaluate the tool and develop the guidelines. They provide specific guidance for practitioners, as well as a useful framework for additional research in public access interfaces.}, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/6504}, author = {Kules,Bill and Kang,Hyunmo and Plaisant, Catherine and Rose,Anne and Shneiderman, Ben} } @article {16106, title = {Immediate Usability: Kiosk design principles from the CHI 2001 Photo Library (2001)}, year = {2005}, month = {2005///}, abstract = {This paper describes a novel set of design principles and guidelines for ensuring the immediate usability of public access systems. These principles and guidelines were formulated while developing PhotoFinder Kiosk, a community photo library. Attendees of CHI 2001 successfully used the tool to browse and annotate collections of photographs spanning 20 years of CHI and related conferences, producing a richly annotated photo history of the field of human-computer interaction. We used observations and log data to evaluate the tool and refine the guidelines. They provide specific guidance for practitioners, as well as a useful framework for additional research in public access interfaces.}, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/6488}, author = {Kules,Bill and Kang,Hyunmo and Plaisant, Catherine and Rose,Anne and Shneiderman, Ben} } @article {17223, title = {Improving Accessibility and Usability of Geo-referenced Statistical Data (2003)}, year = {2005}, month = {2005///}, abstract = {Several technology breakthroughs are needed to achieve the goals of universal accessibility and usability. These goals are especially challenging in the case of geo-referenced statistical data that many U.S. government agencies supply. We present technical and user-interface design challenges in accommodating users with low-end technology (slow network connection and low-end machine) and users who are blind or vision-impaired. Our solutions are presented and future work is discussed.}, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/6502}, author = {Zhao,Haixia and Plaisant, Catherine and Shneiderman, Ben} } @article {17228, title = {Improving Web-based Civic Information Access: A Case Study of the 50 US States (2002)}, year = {2005}, month = {2005///}, abstract = {An analysis of the home pages of all fifty U. S. states reveals great variety in key design features that influence efficacy. Some states had excessively large byte counts that would slow users connected by commonly-used 56K modems. Many web sites had low numbers of or poorly organized links that would make it hard for citizens to find what they were interested in. Features such as search boxes, privacy policies, online help, or contact information need to be added by several states. Our analysis concludes with ten recommendations and finds many further opportunities for individual states to improve their websites. However still greater benefits will come through collaboration among the states that would lead to consistency, appropriate tagging, and common tools.}, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/6494}, author = {Ceaparu,Irina and Shneiderman, Ben} } @article {16881, title = {Indexing issues in supporting similarity searching}, journal = {Advances in Multimedia Information Processing-PCM 2004}, year = {2005}, month = {2005///}, pages = {463 - 470}, abstract = {Indexing issues that arise in the support of similarity searching are presented. This includes a discussion of the curse of dimensionality, as well as multidimensional indexing, distance-based indexing, dimension reduction, and embedding methods.}, doi = {10.1007/978-3-540-30542-2_57}, author = {Samet, Hanan} } @conference {18774, title = {Information and Knowledge Modeling for Computer Supported Micro Electro-Mechanical Systems Design and Development}, year = {2005}, month = {2005///}, abstract = {In this paper, we present a preliminary research effort towardsan effective computer support environment for the design and development of micro-electro-mechanical systems (MEMS). We first identify the characteristics of MEMS product design and development processes and examine the state-of-the-art of MEMS Computer-aided Design (CAD) and simulation systems. We then propose a function-(environment-effect)-behavior- (principle-state)-form (FEEBPSF) framework based on the NIST core product model and its extensions for modeling MEMS products, and apply the OESM (open embedded system model) developed to model information and knowledge for embedded MEMS design and development. Moreover, in order to tackle the knowledge-intensive tasks of design and development for MEMS products, we develop a general and flexible knowledge repository, called KR-MEMS, based on the FEEBPSF framework and the Unified Modeling Language (UML)/ Extensible Markup Language (XML) model, and integrate KR-MEMS into a web-based MEMS design support system. Throughout the paper, a micro fluidic dispensing device (a biomedical device for drug-delivery) is used as an example to illustrate the concepts, models, and knowledge bases necessary to support the MEMS product design and development. }, url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.160.7822\&rep=rep1\&type=pdf}, author = {Zha,X. F. and Sriram,R.D. and Gupta,S.K.} } @article {18910, title = {Information gathering during planning for Web Service composition}, journal = {Web Semantics: Science, Services and Agents on the World Wide Web}, volume = {3}, year = {2005}, month = {2005/10//}, pages = {183 - 205}, abstract = {Hierarchical task network (HTN) based planning techniques have been applied to the problem of composing Web Services, especially when described using the OWL-S service ontologies. Many of the existing Web Services are either exclusively information providing or crucially depend on information-providing services. Thus, many interesting service compositions involve collecting information either during execution or during the composition process itself. In this paper, we focus on the latter issue. In particular, we present ENQUIRER , an HTN-planning algorithm designed for planning domains in which the information about the initial state of the world may not be complete, but it is discoverable through plan-time information-gathering queries. We have shown that ENQUIRER is sound and complete, and derived several mathematical relationships among the amount of available information, the likelihood of the planner finding a plan, and the quality of the plan found. We have performed experimental tests that confirmed our theoretical results and that demonstrated how ENQUIRER can be used for Web Service composition.}, keywords = {HTN planning, Information gathering, Web Service composition}, isbn = {1570-8268}, doi = {10.1016/j.websem.2005.07.001}, url = {http://www.sciencedirect.com/science/article/pii/S1570826805000168}, author = {Kuter,Ugur and Sirin,Evren and Parsia,Bijan and Nau, Dana S. and Hendler,James} } @conference {12803, title = {An integrated framework for scenarios and state machines}, booktitle = {Integrated Formal Methods}, year = {2005}, month = {2005///}, pages = {366 - 385}, author = {Sengupta,B. and Cleaveland, Rance} } @article {17247, title = {Interactive Color Mosaic and Dendogram Displays for Signal/Noise Optimization in Microarray Data Analysis (2003)}, journal = {Institute for Systems Research Technical Reports}, year = {2005}, month = {2005///}, abstract = {Data analysis and visualization is strongly influenced by noise and noise filters. There are multiple sources of oisein microarray data analysis, but signal/noise ratios are rarely optimized, or even considered. Here, we report a noise analysis of a novel 13 million oligonucleotide dataset - 25 human U133A (~500,000 features) profiles of patient muscle biposies. We use our recently described interactive visualization tool, the Hierarchical Clustering Explorer (HCE) to systemically address the effect of different noise filters on resolution of arrays into orrectbiological groups (unsupervised clustering into three patient groups of known diagnosis). We varied probe set interpretation methods (MAS 5.0, RMA), resent callfilters, and clustering linkage methods, and investigated the results in HCE. HCE interactive features enabled us to quickly see the impact of these three variables. Dendrogram displays showed the clustering results systematically, and color mosaic displays provided a visual support for the results. We show that each of these three variables has a strong effect on unsupervised clustering. For this dataset, the strength of the biological variable was maximized, and noise minimized, using MAS 5.0, 10\% present call filter, and Average Group Linkage. We propose a general method of using interactive tools to identify the optimal signal/noise balance or the optimal combination of these three variables to maximize the effect of the desired biological variable on data interpretation.}, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/6506}, author = {Seo,Jinwook and Bakay,Marina and Zhao,Po and Chen,Yi-Wen and Clarkson,Priscilla and Shneiderman, Ben and Hoffman,Eric P} } @article {17251, title = {Interactive Exploration of Multidimensional Microarray Data: Scatterplot Ordering, Gene Ontology Browser, and Profile Search (2003)}, journal = {Institute for Systems Research Technical Reports}, year = {2005}, month = {2005///}, abstract = {Multidimensional data sets are common in many research areas, including microarray experiment data sets. Genome researchers are using cluster analysis to find meaningful groups in microarray data. However, the high dimensionality of the data sets hinders users from finding interesting patterns, clusters, and outliers. Determining the biological significance of such features remains problematic due to the difficulties of integrating biological knowledge. In addition, it is not efficient to perform a cluster analysis over the whole data set in cases where researchers know the approximate temporal pattern of the gene expression that they are seeking.

To address these problems, we add three new features to the Hierarchical Clustering Explorer (HCE): (1) scatterplot ordering methods so that all 2D projections of a high dimensional data set can be ordered according to relevant criteria, (2) a gene ontology browser, coupled with clustering results so that known gene functions within a cluster can be easily studied, (3) a profile search so that genes with a certain temporal pattern can be easily identified.}, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/6528}, author = {Seo,Jinwook and Shneiderman, Ben} } @article {17255, title = {Interactive pattern search in time series}, journal = {Proceedings of SPIE}, volume = {5669}, year = {2005}, month = {2005/03/11/}, pages = {175 - 186}, abstract = {The need for pattern discovery in long time series data led researchers to develop algorithms for similarity search. Most of the literature about time series focuses on algorithms that index time series and bring the data into the main storage, thus providing fast information retrieval on large time series. This paper reviews the state of the art in visualizing time series, and focuses on techniques that enable users to visually and interactively query time series. Then, it presents TimeSearcher 2, a tool that enables users to explore multidimensional data using synchronized tables and graphs with overview+detail, filter the time series data to reduce the scope of the search, select an existing pattern to find similar occurrences, and interactively adjust similarity parameters to narrow the result set. This tool is an extension of previous work, TimeSearcher 1, which uses graphical timeboxes to interactively query time series data.}, isbn = {0277786X}, doi = {doi:10.1117/12.587537}, url = {http://spiedigitallibrary.org/proceedings/resource/2/psisdg/5669/1/175_1?isAuthorized=no}, author = {Buono,Paolo and Aris,Aleks and Plaisant, Catherine and Khella,Amir and Shneiderman, Ben} } @article {17256, title = {Interactive Pattern Search in Time Series (2004)}, year = {2005}, month = {2005///}, abstract = {The need for pattern discovery in long time series data led researchers to develop algorithms for similarity search. Most of the literature about time series focuses on algorithms that index time series and bring the data into the main storage, thus providing fast information retrieval on large time series. This paper reviews the state of the art in visualizing time series, and focuses on techniques that enable users to interactively query time series. Then it presents TimeSearcher 2, a tool that enables users to explore multidimensional data using coordinated tables and graphs with overview+detail, filter the time series data to reduce the scope of the search, select an existing pattern to find similar occurrences, and interactively adjust similarity parameters to narrow the result set. This tool is an extension of previous work, TimeSearcher 1, which uses graphical timeboxes to interactively query time series data.}, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/6519}, author = {Buono,Paolo and Aris,Aleks and Plaisant, Catherine and Khella,Amir and Shneiderman, Ben} } @article {17258, title = {Interactive sonification of choropleth maps}, journal = {IEEE Multimedia}, volume = {12}, year = {2005}, month = {2005/06//April}, pages = {26 - 35}, abstract = {Auditory information is an important channel for the visually impaired. Effective sonification (the use of non-speech audio to convey information) promotes equal working opportunities for people with vision impairments by helping them explore data collections for problem solving and decision making. Interactive sonification systems can make georeferenced data accessible to people with vision impairments. The authors compare methods for using sound to encode georeferenced data patterns and for navigating maps.}, keywords = {audio signal processing, audio user interfaces, Auditory (non-speech) feedback, auditory information, cartography, choropleth maps, data collections, decision making, Evaluation, Feedback, georeferenced data, Guidelines, handicapped aids, Hardware, HUMANS, information resources, interaction style, Interactive sonification, interactive systems, Navigation, nonspeech audio, problem solving, Problem-solving, sound, universal usability, US Government, User interfaces, vision impairments, World Wide Web}, isbn = {1070-986X}, doi = {10.1109/MMUL.2005.28}, author = {Zhao,Haixia and Smith,B. K and Norman,K. and Plaisant, Catherine and Shneiderman, Ben} } @article {17266, title = {Inventing Discovery Tools: Combining Information Visualization with Data Mining (2001)}, year = {2005}, month = {2005///}, abstract = {The growing use of information visualization tools and data mining algorithms stems from two separate lines of research. Information visualization researchers believe in the importance of giving users an overview and insight into the data distributions, while data mining researchers believe that statistical algorithms and machine learning can be relied on to find the interesting patterns. This paper discusses two issues that influence design of discovery tools: statistical algorithms vs. visual data presentation, and hypothesis testing vs. exploratory data analysis. I claim that a combined approach could lead to novel discovery tools that preserve user control, enable more effective exploration, and promote responsibility.}, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/6484}, author = {Shneiderman, Ben} } @conference {16098, title = {iSonic: interactive sonification for non-visual data exploration}, booktitle = {Proceedings of the 7th international ACM SIGACCESS conference on Computers and accessibility}, series = {Assets {\textquoteright}05}, year = {2005}, month = {2005///}, pages = {194 - 195}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {iSonic is an interactive sonification tool for vision impaired users to explore geo-referenced statistical data, such as population or crime rates by geographical regions. Users use a keyboard or a smooth surface touchpad to interact with coordinated map and table views of the data. The integrated use of musical sounds and speech allows users to grasp the overall data trends and to explore the data to get more details. Scenarios of use are described.}, keywords = {auditory user interfaces, information seeking, sonification, universal usability, vision impairment}, isbn = {1-59593-159-7}, doi = {10.1145/1090785.1090826}, url = {http://doi.acm.org/10.1145/1090785.1090826}, author = {Zhao,Haixia and Plaisant, Catherine and Shneiderman, Ben} } @article {13806, title = {Johns Hopkins summer workshop final report on parsing and spoken structural event detection}, journal = {Johns Hopkins University, Tech. Rep}, year = {2005}, month = {2005///}, abstract = {This report describes research conducted by the Parsing and Spoken Structural Event Detection(PaSSED) team as part of the 2005 Johns Hopkins Summer Workshop on Language Engineering. This project investigated the interaction between parsing and the detection of structural metadata in conversational speech, including sentence boundaries, edits (the reparandum portion of speech repairs), and fillers. In terms of parsing, we explored alternative methods of exploiting metadata information in parsing models and measured how varying accuracy in transcription and metadata information affects parsing accuracy. In the other direction, we similarly considered how syntactic and prosodic knowledge could be leveraged in metadata detection, measuring how this knowledge impacts metadata detection accuracy. As part of this work, we investigated metrics for evaluating parse accuracy in the presence of tran- scription and metadata detection errors, and we report on our experience using these metrics with several parsers and across varying experimental conditions. A range of methods for handling edits during pars- ing were evaluated in this research (excision, addition of markups to the input string, and grammar modification). We also developed a ToBI (a prosodic structure annotation scheme [SBP+92]) prosodic event classifier and describe its evaluation. Finally, we present methods for effective n-best sentence boundary candidate generation and reranking using syntactic, prosodic, and other features. These stud- ies are complemented by a second set of reranking investigations wherein we optimize sentence boundary detection explicitly to improve parse accuracy. The PaSSED project has: {\textbullet} investigated various techniques to enhance parsing of speech given metadata detection on conver- sational speech; {\textbullet} defined metrics for evaluating speech parsing accuracy, implemented them in the publically avail- able SParseval software package, and evaluated them under a wide variety of conditions; {\textbullet} recast SU detection as an n-best reranking problem with a relatively small n. Using this approach, we demonstrated significant improvements over a very strong baseline SU detection system. {\textbullet} reported on the interaction between parsing and metadata detection and their synergy; {\textbullet} fostered new collaborations and identified a number of interesting avenues for future work. }, author = {Harper,MP and Dorr, Bonnie J and Hale,J. and Roark,B. and Shafran,I. and Lease,M. and Liu,Y. and Snover,M. and Yung,L. and Krasnyanskaya,A.} } @conference {18237, title = {Joint uplink and downlink optimization for video conferencing over wireless LAN}, booktitle = {Acoustics, Speech, and Signal Processing, 2005. Proceedings. (ICASSP {\textquoteright}05). IEEE International Conference on}, volume = {2}, year = {2005}, month = {2005/03//}, pages = {ii/1101 - ii/1104 Vol. 2 - ii/1101 - ii/1104 Vol. 2}, abstract = {A real-time video conferencing framework is proposed for multiple conferencing pairs by jointly considering the uplink and downlink conditions within IEEE 802.11 networks. We formulate this system so as to minimize the maximal end-to-end expected distortion received by all users by selecting the PHY modes and transmission time. Compared with the strategy of individually optimizing uplink and downlink, the proposed framework outperforms by 3.67-8.65 dB for the average received PSNR among all users.}, keywords = {802.11, conferencing, conferencing;, distortion;, end-to-end, expected, IEEE, joint, LAN;, maximal, minimisation;, modes;, multiple, networks;, optimization;, pairs;, PHY, PSNR;, real-time, teleconferencing;, time;, transmission, uplink-downlink, video, wireless}, doi = {10.1109/ICASSP.2005.1415601}, author = {Su,Guan-Ming and Han,Zhu and M. Wu and Liu,K. J.R} } @article {17271, title = {Knowledge Discovery in High Dimensional Data: Case Studies and a User Survey for an Information Visualization Tool}, journal = {Institute for Systems Research Technical Reports}, year = {2005}, month = {2005///}, abstract = {Knowledge discovery in high dimensional data is a challenging enterprise, but new visual analytic tools appear to offer users remarkable powers if they are ready to learn new concepts and interfaces. Our 3-year effort to develop versions of the Hierarchical Clustering Explorer (HCE) began with building an interactive tool for exploring clustering results. It expanded, based on user needs, to include other potent analytic and visualization tools for multivariate data, especially the rank-by-feature framework. Our own successes using HCE provided some testimonial evidence of its utility, but we felt it necessary to get beyond our subjective impressions. This paper presents an evaluation of the Hierarchical Clustering Explorer (HCE) using three case studies and an email user survey (n=57) to focus on skill acquisition with the novel concepts and interface for the rank-by-feature framework. Knowledgeable and motivated users in diverse fields provided multiple perspectives that refined our understanding of strengths and weaknesses. A user survey confirmed the benefits of HCE, but gave less guidance about improvements. Both evaluations suggested improved training methods.}, keywords = {Information Visualization}, url = {http://drum.lib.umd.edu/handle/1903/6566}, author = {Seo,Jinwook and Shneiderman, Ben} } @inbook {16931, title = {A Knowledge Integration Framework for Information Visualization}, booktitle = {From Integrated Publication and Information Systems to Information and Knowledge EnvironmentsFrom Integrated Publication and Information Systems to Information and Knowledge Environments}, series = {Lecture Notes in Computer Science}, volume = {3379}, year = {2005}, month = {2005///}, pages = {207 - 220}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {Users can better understand complex data sets by combining insights from multiple coordinated visual displays that include relevant domain knowledge. When dealing with multidimensional data and clustering results, the most familiar displays and comprehensible are 1- and 2-dimensional projections (histograms, and scatterplots). Other easily understood displays of domain knowledge are tabular and hierarchical information for the same or related data sets. The novel parallel coordinates view [6] powered by a direct-manipulation search, offers strong advantages, but requires some training for most users. We provide a review of related work in the area of information visualization, and introduce new tools and interaction examples on how to incorporate users{\textquoteright} domain knowledge for understanding clustering results. Our examples present hierarchical clustering of gene expression data, coordinated with a parallel coordinates view and with the gene annotation and gene ontology.}, isbn = {978-3-540-24551-3}, url = {http://dx.doi.org/10.1007/978-3-540-31842-2_21}, author = {Seo,Jinwook and Shneiderman, Ben}, editor = {Hemmje,Matthias and Nieder{\'e}e,Claudia and Risse,Thomas} } @article {16932, title = {A Knowledge Integration Framework for Information Visualization (2004)}, journal = {Institute for Systems Research Technical Reports}, year = {2005}, month = {2005///}, abstract = {Users can better understand complex data sets by combining insights from multiple coordinated visual displays that include relevant domain knowl-edge. When dealing with multidimensional data and clustering results, the most familiar displays and comprehensible are 1- and 2-dimensional projections (his-tograms, and scatterplots). Other easily understood displays of domain knowl-edge are tabular and hierarchical information for the same or related data sets. The novel parallel coordinates view [6] powered by a direct-manipulation search, offers strong advantages, but requires some training for most users. We provide a review of related work in the area of information visualization, and introduce new tools and interaction examples on how to incorporate usersdo-main knowledge for understanding clustering results. Our examples present hi-erarchical clustering of gene expression data, coordinated with a parallel coor-dinates view and with the gene annotation and gene ontology.}, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/6525}, author = {Seo,Jinwook and Shneiderman, Ben} } @conference {17276, title = {Leonardo{\textquoteright}s laptop: human needs and the new computing technologies}, booktitle = {Proceedings of the 14th ACM international conference on Information and knowledge management}, series = {CIKM {\textquoteright}05}, year = {2005}, month = {2005///}, pages = {1 - 1}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {The old computing was about what computers could do; the new computing is about what people can do.To accelerate the shift from the old to the new computing designers need to:reduce computer user frustration. Recent studies show 46\% of time is lost to crashes, confusing instructions, navigation problems, etc. Public pressure for change could promote design improvements and increase reliability, thereby dramatically enhancing user experiences.promote universal usability. Interfaces must be tailorable to a wide range of hardware, software, and networks, and users. When broad services such as voting, healthcare, and education are envisioned, the challenge to designers is substantial.envision a future in which human needs more directly shape technology evolution. Four circles of human relationships and four human activities map out the human needs for mobility, ubiquity, creativity, and community. The World Wide Med and million-person communities will be accessible through desktop, palmtop and fingertip devices to support e-learning, e-business, e-healthcare, and e-government.Leonardo da Vinci could help as an inspirational muse for the new computing. His example could push designers to improve quality through scientific study and more elegant visual design. Leonardo{\textquoteright}s example can guide us to the new computing, which emphasizes empowerment, creativity, and collaboration. Information visualization and personal photo interfaces will be shown: PhotoMesa (www.cs.umd.edu/hcil/photomesa) and PhotoFinder (www.cs.umd.edu/hcil/photolib).For more: http://mitpress.mit.edu/leonardoslaptop and http://www.cs.umd.edu/hcil/newcomputing.}, isbn = {1-59593-140-6}, doi = {10.1145/1099554.1099555}, url = {http://doi.acm.org/10.1145/1099554.1099555}, author = {Shneiderman, Ben} } @article {17418, title = {The limits of speech recognition: Understanding acoustic memory and appreciating prosody (2000)}, journal = {Institute for Systems Research Technical Reports}, year = {2005}, month = {2005///}, abstract = {Human-human relationships are rarely a good model for the design of effective user interfaces. Spoken language is effective for human-human interaction (HHI), but it often has severe limitations when applied to human-computer interaction (HCI). Speech is slow for presenting information, it is difficult to review or edit, and it interferes with other cognitive tasks. However speech has proven to be useful for store-and-forward messages, alerts in busy environments, and input-output for blind or motor-impaired users. Speech recognition for control is helpful for hands-busy, eyes-busy, mobilityrequired, or hostile environments and it shows promise for use in telephone-based services. Dictation input is increasingly accurate, but adoption outside the disabled users community has been slow compared to visual interfaces. Obvious physical problems include fatigue from speaking continuously and the disruption in an office filled with people speaking.

By understanding the cognitive processes surrounding human acoustic memory and processing, interface designers may be able to integrate speech more effectively and guide users more successfully. Then by appreciating the differences between HHI and HCI designers may be able to choose appropriate applications for human use of speech with computers. The key distinction may be the rich emotional content conveyed by prosody -- the pacing, intonation, and amplitude in spoken language. Prosody is potent for HHI, but may be disruptive for HCI.}, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/6532}, author = {Shneiderman, Ben} } @article {16096, title = {Listening to Maps: User Evaluation of Interactive Sonifications of Geo-Referenced Data}, journal = {Institute for Systems Research Technical Reports}, year = {2005}, month = {2005///}, abstract = {In this paper, we summarize the Auditory Information Seeking Principle (AISP) (gist, navigate, filter, and details-ondemand). To improve blind access to geo-referenced statistical data, we developed several interactive sonifications, adhering to the above AISP. Two user studies are presented. In the first user study with nine sighted subjects, a preliminary map design is compared with an enhanced table design. The study shows subjects can recognize geographic data distribution patterns on a real map with 51 geographic regions, in both designs. The map-based design was strongly preferred. The study also shows evidence that AISP conforms to people information seeking strategies. Based on the observations from the first user study, a second user study was conducted with forty-eight sighted subjects comparing four map designs. The effects of using sound to encode vertical geographic positions and two map navigation methods were compared. The result is presented and future work is discussed.}, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/6518}, author = {Zhao,Haixia and Smith,Benjamin K and Norman,Kent L and Plaisant, Catherine and Shneiderman, Ben} } @article {17282, title = {Listening to Maps: User Evaluation of Interactive Sonifications of Geo-Referenced Data (2004)}, journal = {Institute for Systems Research Technical Reports}, year = {2005}, month = {2005///}, abstract = {In this paper, we summarize the Auditory Information Seeking Principle (AISP) (gist, navigate, filter, and details-ondemand). To improve blind access to geo-referenced statistical data, we developed several interactive sonifications, adhering to the above AISP. Two user studies are presented. In the first user study with nine sighted subjects, a preliminary map design is compared with an enhanced table design. The study shows subjects can recognize geographic data distribution patterns on a real map with 51 geographic regions, in both designs. The map-based design was strongly preferred. The study also shows evidence that AISP conforms to people information seeking strategies. Based on the observations from the first user study, a second user study was conducted with forty-eight sighted subjects comparing four map designs. The effects of using sound to encode vertical geographic positions and two map navigation methods were compared. The result is presented and future work is discussed.}, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/6518}, author = {Zhao,Haixia and Smith,Benjamin K and Norman,Kent L and Plaisant, Catherine and Shneiderman, Ben} } @conference {16298, title = {Main effects screening}, booktitle = {Proceedings of the 27th international conference on Software engineering - ICSE {\textquoteright}05}, year = {2005}, month = {2005///}, pages = {293 - 293}, address = {St. Louis, MO, USA}, doi = {10.1145/1062455.1062515}, url = {http://dl.acm.org/citation.cfm?id=1062515}, author = {Yilmaz,Cemal and Krishna,Arvind S. and Memon, Atif M. and Porter, Adam and Schmidt,Douglas C. and Gokhale,Aniruddha and Natarajan,Balachandran} } @conference {15453, title = {Main effects screening: a distributed continuous quality assurance process for monitoring performance degradation in evolving software systems}, booktitle = {Proceedings of the 27th international conference on Software engineering}, series = {ICSE {\textquoteright}05}, year = {2005}, month = {2005///}, pages = {293 - 302}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Developers of highly configurable performance-intensive software systems often use a type of in-house performance-oriented "regression testing" to ensure that their modifications have not adversely affected their software{\textquoteright}s performance across its large configuration space. Unfortunately, time and resource constraints often limit developers to in-house testing of a small number of configurations and unreliable extrapolation from these results to the entire configuration space, which allows many performance bottlenecks and sources of QoS degradation to escape detection until systems are fielded. To improve performance assessment of evolving systems across large configuration spaces, we have developed a distributed continuous quality assurance (DCQA) process called main effects screening that uses in-the-field resources to execute formally designed experiments to help reduce the configuration space, thereby allowing developers to perform more targeted in-house QA. We have evaluated this process via several feasibility studies on several large, widely-used performance-intensive software systems. Our results indicate that main effects screening can detect key sources of performance degradation in large-scale systems with significantly less effort than conventional techniques.}, keywords = {design of experiment theory, distributed continuous quality assurance, performance-oriented regression testing}, isbn = {1-58113-963-2}, doi = {10.1145/1062455.1062515}, url = {http://doi.acm.org/10.1145/1062455.1062515}, author = {Yilmaz,Cemal and Krishna,Arvind S. and Memon, Atif M. and Porter, Adam and Schmidt,Douglas C. and Gokhale,Aniruddha and Natarajan,Balachandran} } @conference {17284, title = {Maintaining concentration to achieve task completion}, booktitle = {Proceedings of the 2005 conference on Designing for User eXperience}, series = {DUX {\textquoteright}05}, year = {2005}, month = {2005///}, publisher = {AIGA: American Institute of Graphic Arts}, organization = {AIGA: American Institute of Graphic Arts}, address = {New York, NY, USA}, abstract = {When faced with a challenging goal, knowledge workers need to concentrate on their tasks so that they move forward toward completion. Since frustrations, distractions, and interruptions can interfere with their smooth progress, design strategies should enable users to maintain concentration. This paper promotes awareness of this issue, reviews related work, and suggests three initial strategies: Reduce short-term and working memory load, provide information abundant interfaces, and increase automaticity.}, keywords = {avoid interruption, calm, flow, focus, goal attainment, interface design, maintain concentration, situation awareness, task completion}, isbn = {1-59593-250-X}, url = {http://dl.acm.org/citation.cfm?id=1138235.1138246}, author = {Shneiderman, Ben and Bederson, Benjamin B.} } @conference {12192, title = {Maintaining concentration to achieve task completion}, booktitle = {Proceedings of the 2005 conference on Designing for User eXperience}, year = {2005}, month = {2005///}, pages = {9 - 9}, author = {Shneiderman, Ben and Bederson, Benjamin B.} } @conference {16734, title = {Maintaining Implicated Statistics in Constrained Environments}, booktitle = {Data Engineering, International Conference on}, year = {2005}, month = {2005///}, pages = {730 - 741}, publisher = {IEEE Computer Society}, organization = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, abstract = {Aggregated information regarding implicated entities is critical for online applications like network management, traffic characterization or identifying patters of resource consumption. Recently there has been a flurry of research for online aggregation on streams (like quantiles, hot items, hierarchical heavy hitters) but surprizingly the problem of summarizing implicated information in stream data has received no attention. As an example, consider an IP-network and the implication source {\textrightarrow} destination. Flash crowds, {\textemdash} such as those that follow recent sport events (like the olympics) or seek information regarding catastrophic events {\textemdash} or denial of service attacks direct a large volume of traffic from a huge number of sources to a very small number of destinations. In this paper we present novel randomized algorithms for monitoring such implications with constraints in both memory and processing power for environments like network routers. Our experiments demonstrate several factors of improvements over straightforward approaches.}, doi = {http://doi.ieeecomputersociety.org/10.1109/ICDE.2005.84}, author = {Sismanis,Yannis and Roussopoulos, Nick} } @article {17287, title = {Making Computer and Internet Usability a Priority (2000)}, year = {2005}, month = {2005///}, abstract = {As usability professionals, we are all too aware of the productivity losses, frustration, and lost business that results from poorly designed user interfaces. And we are uncomfortable with the risks created by poorly designed computer systems in life-critical applications such as air travel, medical care, and military applications. Yet despite the common sense of our approach, we still find it difficult to convince the technical and managerial communities that usability is a critical business parameter. While senior managers may support the concept of usability, project mangers and developers, coping with too tight schedules, often see it as a nicety that can be eliminated.}, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/6527}, author = {Kreitzberg,Charles B and Shneiderman, Ben} } @conference {12646, title = {Markerless Motion Capture using Multiple Cameras}, booktitle = {Computer Vision for Interactive and Intelligent Environment, 2005}, year = {2005}, month = {2005/11//}, pages = {15 - 26}, abstract = {Motion capture has important applications in different areas such as biomechanics, computer animation, and human-computer interaction. Current motion capture methods use passive markers that are attached to different body parts of the subject and are therefore intrusive in nature. In applications such as pathological human movement analysis, these markers may introduce an unknown artifact in the motion, and are, in general, cumbersome. We present computer vision based methods for performing markerless human motion capture. We model the human body as a set of super-quadrics connected in an articulated structure and propose algorithms to estimate the parameters of the model from video sequences. We compute a volume data (voxel) representation from the images and combine bottom-up approach with top down approach guided by our knowledge of the model. We propose a tracking algorithm that uses this model to track human pose. The tracker uses an iterative framework akin to an Iterated Extended Kalman Filter to estimate articulated human motion using multiple cues that combine both spatial and temporal information in a novel manner. We provide preliminary results using data collected from 8-16 cameras. The emphasis of our work is on models and algorithms that are able to scale with respect to the requirement for accuracy. Our ultimate objective is to build an end-to-end system that can integrate the above mentioned components into a completely automated markerless motion capture system.}, doi = {10.1109/CVIIE.2005.13}, author = {Sundaresan, A. and Chellapa, Rama} } @article {19499, title = {MEAD: support for Real-Time Fault-Tolerant CORBA}, journal = {Concurrency and Computation: Practice and Experience}, volume = {17}, year = {2005}, month = {2005///}, pages = {1527 - 1545}, abstract = {The OMG{\textquoteright}s Real-Time CORBA (RT-CORBA) and Fault-Tolerant CORBA (FT-CORBA) specifications make it possible for today{\textquoteright}s CORBA implementations to exhibit either real-time or fault tolerance in isolation. While real-time requires a priori knowledge of the system{\textquoteright}s temporal operation, fault tolerance necessarily deals with faults that occur unexpectedly, and with possibly unpredictable fault recovery times. The MEAD (Middleware for Embedded Adaptive Dependability) system attempts to identify and to reconcile the conflicts between real-time and fault tolerance, in a resource-aware manner, for distributed CORBA applications. MEAD supports transparent yet tunable fault tolerance in real-time, proactive dependability, resource-aware system adaptation to crash, communication and timing faults with bounded fault detection and fault recovery. Copyright {\textcopyright} 2005 John Wiley \& Sons, Ltd.}, keywords = {CORBA, Fault tolerance, non-determinism, predictability, real-time, recovery, trade-offs}, isbn = {1532-0634}, url = {http://onlinelibrary.wiley.com/doi/10.1002/cpe.882/abstract}, author = {Narasimhan, P. and Tudor Dumitras and Paulos, A. M. and Pertet, S. M. and Reverte, C. F. and Slember, J. G. and Srivastava, D.} } @conference {17288, title = {Meaningful presentations of photo libraries: rationale and applications of bi-level radial quantum layouts}, booktitle = {Proceedings of the 5th ACM/IEEE-CS Joint Conference on Digital Libraries, 2005. JCDL {\textquoteright}05}, year = {2005}, month = {2005/06/07/11}, pages = {188 - 196}, publisher = {IEEE}, organization = {IEEE}, abstract = {Searching photo libraries can be made more satisfying and successful if search results are presented in a way that allows users to gain an overview of the photo categories. Since photo layouts on computer displays are the primary way that users get an overview, we propose a novel approach to show more photos in meaningful groupings. Photo layouts can be linear strips, or zoomable three dimensional arrangements, but the most common form is the two-dimensional grid. This paper introduces a novel bi-level hierarchical layout with motivating examples. In a bilevel hierarchy, one region is designated for primary content - an image, text, or combination. Adjacent to that region, groups of photos are placed radially in an ordered fashion, such that the relationship of the single primary region to its many secondary regions is apparent. A compelling aspect is the interactive experience in which the layout is dynamically resized, allowing users to rapidly, incrementally, and reversibly alter the dimensions and content. It can accommodate hundreds of photos in dozens of regions, can be customized in a corner or center layout, and can scale from an element on a web page to a large poster size. On typical displays (1024 times 1280 or 1200 times 1600 pixels), bi-level radial quantum layouts can conveniently accommodate 2-20 regions with tens or hundreds of photos per region}, keywords = {1024 pixel, 1200 pixel, 1280 pixel, 1310720 pixel, 1600 pixel, 1920000 pixel, Application software, bi-level radial quantum layouts, Computer displays, Computer science, digital libraries, Educational institutions, Image retrieval, Layout, layout generation, Lifting equipment, linear strips, Permission, photo layouts, photo library searching, photo management, Photography, Quantum computing, software libraries, Strips, two-dimensional grid, User interfaces, visual databases, visual presentation, zoomable three dimensional arrangements}, isbn = {1-58113-876-8}, doi = {10.1145/1065385.1065431}, author = {Kustanowitz,J. and Shneiderman, Ben} } @conference {12280, title = {Measurement-based multipath multicast}, booktitle = {INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings IEEE}, volume = {4}, year = {2005}, month = {2005/03//}, pages = {2803 - 2808 vol. 4 - 2803 - 2808 vol. 4}, abstract = {We propose a measurement-based routing algorithm to load balance intradomain traffic along multiple paths for multiple multicast sources. Multiple paths are established using application-layer overlaying. The proposed algorithm is able to converge under different network models, where each model reflects a different set of assumptions about the multicasting capabilities of the network. The algorithm is derived from simultaneous perturbation stochastic approximation and relies only on noisy estimates from measurements. Simulation results are presented to demonstrate the additional benefits obtained by incrementally increasing the multicasting capabilities.}, keywords = {algorithm;, allocation;, application-layer, approximation, approximation;, balance, communication;, Convergence, convergence;, intradomain, load, measurement-based, methods;, Multicast, multipath, network, numerical, of, overlaying;, perturbation, processes;, resource, Routing, routing;, source;, Stochastic, techniques;, Telecommunication, theory;, traffic;}, doi = {10.1109/INFCOM.2005.1498566}, author = {Guven,T. and La,R.J. and Shayman,M.A. and Bhattacharjee, Bobby} } @article {17292, title = {MediaFinder: An Interface for Dynamic Personal Media Management with Semantic Regions (2003)}, year = {2005}, month = {2005///}, abstract = {Computer users deal with large amounts of personal media often face problems in managing and exploring it. This paper presents Semantic Regions, rectangular regions that enable users to specify their semantics or mental models, and the MediaFinder application, which uses Semantic Regions as the basis of a personal media management tool.}, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/6499}, author = {Kang,Hyunmo and Shneiderman, Ben} } @article {11910, title = {Method and system for providing physical security in an area of interest}, volume = {10/916,545}, year = {2005}, month = {2005/03/10/}, abstract = {A system for detecting the presence of an intruder in a protected area utilizes a received signal strength indicator (RSSI) value of signals broadcast from transmitting stations deployed in the protected area. The system includes monitoring points for receiving broadcast signals, measuring the RSSI values of the received signals, and transmitting the measured RSSI values to a security system server. The security system server analyzes the RSSI values, and initiates security measures when the physical security of the protected area is violated which is detected when the measured RSSI values deviate from a predetermined strength of the broadcast signals. The security system also has the ability to track objects in the protected area and keep track of their movement in real time and report such movement. The system may be based on a Wi-Fi infrastructure in the protected area.}, url = {http://www.google.com/patents?id=VIaWAAAAEBAJ}, author = {Agrawala, Ashok K. and Youssef,Moustafa Amin and Shahamat,Layla} } @article {13707, title = {A methodology for extrinsic evaluation of text summarization: Does ROUGE correlate}, journal = {Proceedings of the ACL Workshop on Intrinsic and Extrinsic Evaluation Measures for Machine Translation and/or Summarization}, year = {2005}, month = {2005///}, pages = {1 - 8}, abstract = {This paper demonstrates the usefulness of sum-maries in an extrinsic task of relevance judgment based on a new method for measuring agree- ment, Relevance-Prediction, which compares sub- jects{\textquoteright} judgments on summaries with their own judg- ments on full text documents. We demonstrate that, because this measure is more reliable than previ- ous gold-standard measures, we are able to make stronger statistical statements about the benefits of summarization. We found positive correlations be- tween ROUGE scores and two different summary types, where only weak or negative correlations were found using other agreement measures. How- ever, we show that ROUGE may be sensitive to the choice of summarization style. We discuss the im- portance of these results and the implications for fu- ture summarization evaluations. }, author = {Dorr, Bonnie J and Monz,C. and President,S. and Schwartz,R. and Zajic, David} } @article {16646, title = {Mirror symmetric topographic maps can arise from activity-dependent synaptic changes}, journal = {Neural computation}, volume = {17}, year = {2005}, month = {2005///}, pages = {1059 - 1083}, author = {Schulz,R. and Reggia, James A.} } @conference {12281, title = {Misbehaving TCP receivers can cause internet-wide congestion collapse}, booktitle = {Proceedings of the 12th ACM conference on Computer and communications security}, series = {CCS {\textquoteright}05}, year = {2005}, month = {2005///}, pages = {383 - 392}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {An optimistic acknowledgment (opt-ack) is an acknowledgment sent by a misbehaving client for a data segment that it has not received. Whereas previous work has focused on opt-ack as a means to greedily improve end-to-end performance, we study opt-ack exclusively as a denial of service attack. Specifically, an attacker sends optimistic acknowledgments to many victims in parallel, thereby amplifying its effective bandwidth by a factor of 30 million (worst case). Thus, even a relatively modest attacker can totally saturate the paths from many victims back to the attacker. Worse, a distributed network of compromised machines ("zombies") attacking in parallel can exploit over-provisioning in the Internet to bring about wide-spread, sustained congestion collapse.We implement this attack both in simulation and in a wide-area network, and show it severity both in terms of number of packets and total traffic generated. We engineer and implement a novel solution that does not require client or network modifications allowing for practical deployment. Additionally, we demonstrate the solution{\textquoteright}s efficiency on a real network.}, keywords = {Congestion control, distributed denial of service}, isbn = {1-59593-226-7}, doi = {10.1145/1102120.1102170}, url = {http://doi.acm.org/10.1145/1102120.1102170}, author = {Sherwood,Rob and Bhattacharjee, Bobby and Braud,Ryan} } @conference {12394, title = {Modeling image processing systems with homogeneous parameterized dataflow graphs}, booktitle = {Acoustics, Speech, and Signal Processing, 2005. Proceedings. (ICASSP {\textquoteright}05). IEEE International Conference on}, volume = {5}, year = {2005}, month = {2005/03//}, pages = {v/133 - v/136 Vol. 5 - v/133 - v/136 Vol. 5}, abstract = {We describe a new dataflow model called homogeneous parameterized dataflow (HPDF). This form of dynamic dataflow graph takes advantage of the fact that in a large number of image processing applications, data production and consumption rates, though dynamic, are equal across graph edges for any particular iteration, which leads to a homogeneous rate of actor execution, even though data production and consumption values are dynamic and vary across graph edges. We discuss existing dataflow models and formulate in detail the HPDF model. We develop examples of applications that are described naturally in terms of HPDF semantics and present experimental results that demonstrate the efficacy of the HPDF approach.}, keywords = {data consumption, data flow graphs, data production, dynamic dataflow graph, graph edges, homogeneous parameterized dataflow graphs, IMAGE PROCESSING, image processing system modeling, iteration, iterative methods}, doi = {10.1109/ICASSP.2005.1416258}, author = {Sen,Mainak and Bhattacharyya, Shuvra S. and Lv,Tiehan and Wolf,W.} } @conference {15135, title = {Modeling insider attacks on group key-exchange protocols}, booktitle = {Proceedings of the 12th ACM conference on Computer and communications security}, series = {CCS {\textquoteright}05}, year = {2005}, month = {2005///}, pages = {180 - 189}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Protocols for authenticated key exchange (AKE) allow parties within an insecure network to establish a common session key which can then be used to secure their future communication. It is fair to say that group AKE is currently less well understood than the case of two-party AKE; in particular, attacks by malicious insiders --- a concern specific to the group setting --- have so far been considered only in a relatively "ad-hoc" fashion. The main contribution of this work is to address this deficiency by providing a formal, comprehensive model and definition of security for group AKE which automatically encompasses insider attacks. We do so by defining an appropriate ideal functionality for group AKE within the universal composability (UC) framework. As a side benefit, any protocol secure with respect to our definition is secure even when run concurrently with other protocols, and the key generated by any such protocol may be used securely in any subsequent application.In addition to proposing this definition, we show that the resulting notion of security is strictly stronger than the one proposed by Bresson, et al. (termed "AKE-security"), and that our definition implies all previously-suggested notions of security against insider attacks. We also show a simple technique for converting any AKE-secure protocol into one secure with respect to our definition.}, keywords = {group key exchange, insider attacks, universal composability}, isbn = {1-59593-226-7}, doi = {10.1145/1102120.1102146}, url = {http://doi.acm.org/10.1145/1102120.1102146}, author = {Katz, Jonathan and Shin,Ji Sun} } @conference {18887, title = {A motion closed world asumption}, volume = {19}, year = {2005}, month = {2005///}, pages = {621 - 621}, abstract = {Yaman et. al. [Yaman et al., 2004] introduce {\textquotedblleft}gotheories{\textquotedblright} to reason about moving objects. In this paper, we show that this logic often does not allow us to infer that an object is not present at a given place or region, even though common sense would dictate that this is a reasonable inference to make. We define a class of models of go-theories called coherent models. We use this concept to define a motion closed world assumption (MCWA) and de- velop a notion of MCWA-entailment. We show that checking if a go-theory has a coherent model is NP-complete. An in atom checks if a given ob- ject is present in a given region sometime in a given time interval. We provide sound and complete al- gorithms to check if a ground in literal (positive or negative in atom) can be inferred from a go- theory using the MCWA. In our experiments our algorithms answer such queries in less than 1 sec- ond when there are up to 1,000 go-atoms per object. }, url = {http://ijcai.org/papers/1227.pdf}, author = {Yaman,F. and Nau, Dana S. and V.S. Subrahmanian} } @article {17298, title = {Motivating annotation for personal digital photo libraries: Lowering barriers while raising incentives}, journal = {University of Marlyand}, year = {2005}, month = {2005///}, abstract = {The value of personal digital photo libraries grows immensely when users invest effort to annotate their photos. Frameworksfor understanding annotation requirements could guide improved strategies that would motivate more users to invest the necessary effort. We propose one framework for annotation techniques along with the strengths and weaknesses of each one, and a second framework for target user groups and their motivations. Several applications are described that provide useful and information-rich representations, but which require good annotations, in the hope of providing incentives for high quality annotation. We describe how annotations make possible four novel presentations of personal photo collections: (1) Birthday Collage to show growth of a child over several years, (2) FamiliarFace to show family trees of photos, (3) Kaleidoscope to show photos of related people in an appealing tableau, and (4) TripPics to show photos from a sequential story such as a vacation trip. }, author = {Kustanowitz,J. and Shneiderman, Ben} } @conference {13310, title = {Multi-resolution out-of-core modeling of terrain and geological data}, booktitle = {Proceedings of the 13th annual ACM international workshop on Geographic information systems}, series = {GIS {\textquoteright}05}, year = {2005}, month = {2005///}, pages = {143 - 152}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Multi-resolution is a useful tool for managing the complexity of huge terrain and geological data sets. Since encoding large data sets may easily exceed main memory capabilities, data structures and algorithms capable of efficiently working in external memory are needed. In our work, we aim at developing an out-of-core multi-resolution model dimension-independent, that can be used for both terrains, represented by Triangulated Irregular Networks(TINs), and 3D data, such as geological data, represented by tetrahedral meshes. We have based our approach on a general multi-resolution model, that we have proposed in our previous work, which supports the extraction of variable-resolution representations. As first step, we have developed, in a prototype simulation system, a large number of clustering techniques for the modifications in a multi-resolution model. Here, we describe such techniques, and analyze and evaluate them experimentally. The result of this investigation has led us to select a specific clustering approach as the basis for an efficient out-of-core data structure.}, keywords = {Multi-resolution, out-of-core, terrain models}, isbn = {1-59593-146-5}, doi = {10.1145/1097064.1097085}, url = {http://doi.acm.org/10.1145/1097064.1097085}, author = {Danovaro,Emanuele and De Floriani, Leila and Puppo,Enrico and Samet, Hanan} } @conference {14710, title = {Mutatis mutandis: safe and predictable dynamic software updating}, booktitle = {Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages}, series = {POPL {\textquoteright}05}, year = {2005}, month = {2005///}, pages = {183 - 194}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Dynamic software updates can be used to fix bugs or add features to a running program without downtime. Essential for some applications and convenient for others, low-level dynamic updating has been used for many years. Perhaps surprisingly, there is little high-level understanding or language support to help programmers write dynamic updates effectively.To bridge this gap, we present Proteus, a core calculus for dynamic software updating in C-like languages that is flexible, safe, and predictable. Proteus supports dynamic updates to functions (even active ones), to named types and to data, allowing on-line evolution to match source-code evolution as we have observed it in practice. We ensure updates are type-safe by checking for a property we call "con-freeness" for updated types t at the point of update. This means that non-updated code will not use t concretely beyond that point (concrete usages are via explicit coercions) and thus t{\textquoteright}s representation can safely change. We show how con-freeness can be enforced dynamically for a particular program state. We additionally define a novel and efficient static updateability analysis to establish con-freeness statically, and can thus automatically infer program points at which all future (well-formed) updates will be type-safe. We have implemented our analysis for C and tested it on several well-known programs.}, keywords = {capability, dynamic software updating, proteus, Type inference, updateability analysis}, isbn = {1-58113-830-X}, doi = {10.1145/1040305.1040321}, url = {http://doi.acm.org/10.1145/1040305.1040321}, author = {Stoyle,Gareth and Hicks, Michael W. and Bierman,Gavin and Sewell,Peter and Neamtiu,Iulian} } @article {14027, title = {Neuromimetic sound representation for percept detection and manipulation}, journal = {EURASIP Journal on Applied Signal Processing}, volume = {9}, year = {2005}, month = {2005///}, pages = {1350 - 1350}, abstract = {The acoustic wave received at the ears is processed by the human auditory system to separate different sounds along the intensity,pitch, and timbre dimensions. Conventional Fourier-based signal processing, while endowed with fast algorithms, is unable to easily represent a signal along these attributes. In this paper, we discuss the creation of maximally separable sounds in auditory user interfaces and use a recently proposed cortical sound representation, which performs a biomimetic decomposition of an acoustic signal, to represent and manipulate sound for this purpose. We briefly overview algorithms for obtaining, manipulating, and inverting a cortical representation of a sound and describe algorithms for manipulating signal pitch and timbre separately. The algorithms are also used to create sound of an instrument between a {\textquotedblleft}guitar{\textquotedblright} and a {\textquotedblleft}trumpet.{\textquotedblright} Excellent sound quality can be achieved if processing time is not a concern, and intelligible signals can be reconstructed in reasonable processing time (about ten seconds of computational time for a one-second signal sampled at 8 kHz). Work on bringing the algorithms into the real-time processing domain is ongoing. }, author = {Zotkin,Dmitry N and Chi,T. and Shamma,S.A. and Duraiswami, Ramani} } @article {15329, title = {New experimental data of STBLI at DNS/LES accessible Reynolds numbers}, journal = {AIAA paper}, volume = {309}, year = {2005}, month = {2005///}, pages = {2005 - 2005}, author = {Bookey,P. and Wyckham,C. and Smits,A. J. and Martin, M.P} } @article {14932, title = {A new framework for addressing temporal range queries and some preliminary results}, journal = {Theoretical Computer Science}, volume = {332}, year = {2005}, month = {2005/02/28/}, pages = {109 - 121}, abstract = {Given a set of n objects, each characterized by d attributes specified at m fixed time instances, we are interested in the problem of designing space efficient indexing structures such that a class of temporal range search queries can be handled efficiently. When m = 1 , our problem reduces to the d-dimensional orthogonal search problem. We establish efficient data structures to handle several classes of the general problem. Our results include a linear size data structure that enables a query time of O ( log n log m + f ) for one-sided queries when d = 1 , where f is the number of objects satisfying the query. A similar result is shown for counting queries. We also show that the most general problem can be solved with a polylogarithmic query time using superlinear space data structures.}, keywords = {algorithms, Data structures, Orthogonal range search, temporal data}, isbn = {0304-3975}, doi = {10.1016/j.tcs.2004.10.013}, url = {http://www.sciencedirect.com/science/article/pii/S0304397504007005}, author = {Shi,Qingmin and JaJa, Joseph F.} } @conference {14861, title = {Non-negative lighting and specular object recognition}, booktitle = {Computer Vision, 2005. ICCV 2005. Tenth IEEE International Conference on}, volume = {2}, year = {2005}, month = {2005/10//}, pages = {1323 -1330 Vol. 2 - 1323 -1330 Vol. 2}, abstract = {Recognition of specular objects is particularly difficult because their appearance is much more sensitive to lighting changes than that of Lambertian objects. We consider an approach in which we use a 3D model to deduce the lighting that best matches the model to the image. In this case, an important constraint is that incident lighting should be non-negative everywhere. In this paper, we propose a new method to enforce this constraint and explore its usefulness in specular object recognition, using the spherical harmonic representation of lighting. The method follows from a novel extension of Szego{\textquoteright}s eigenvalue distribution theorem to spherical harmonics, and uses semidefinite programming to perform a constrained optimization. The new method is faster as well as more accurate than previous methods. Experiments on both synthetic and real data indicate that the constraint can improve recognition of specular objects by better separating the correct and incorrect models}, keywords = {and, distribution, eigenfunctions;image, eigenvalue, harmonic, Lambertian, lighting;nonnegative, lighting;semidefinite, matching;object, object, objects;Szego, optimization;incident, programming;specular, recognition;optimisation;, recognition;spherical, representation;eigenvalues, theorem;constrained}, doi = {10.1109/ICCV.2005.168}, author = {Shirdhonkar,S. and Jacobs, David W.} } @article {14903, title = {Non-negative lighting and specular object recognition}, journal = {Proc. of IEEE International Conference on Computer Vision}, volume = {2}, year = {2005}, month = {2005///}, author = {Jacobs, David W. and Shirdhonkar,S.} } @article {14992, title = {Novel transformation techniques using q-heaps with applications to computational geometry}, journal = {SIAM Journal on Computing}, volume = {34}, year = {2005}, month = {2005///}, pages = {1474 - 1492}, abstract = {Using the notions of Q-heaps and fusion trees developed by Fredman and Willard,we develop general transformation techniques to reduce a number of computational geometry prob- lems to their special versions in partially ranked spaces. In particular, we develop a fast fractional cascading technique, which uses linear space and enables sublogarithmic iterative search on catalog trees in the case when the degree of each node is bounded by O(log∈ n), for some constant ϵ > 0, where n is the total size of all the lists stored in the tree. We apply the fast fractional cascading tech- nique in combination with the other techniques to derive the first linear-space sublogarithmic time algorithms for the two fundamental geometric retrieval problems: orthogonal segment intersection and rectangular point enclosure. }, author = {Shi,Q. and JaJa, Joseph F.} } @article {15001, title = {Optimal and near-optimal algorithms for generalized intersection reporting on pointer machines}, journal = {Information Processing Letters}, volume = {95}, year = {2005}, month = {2005/08/16/}, pages = {382 - 388}, abstract = {We develop efficient algorithms for a number of generalized intersection reporting problems, including orthogonal and general segment intersection, 2D range searching, rectangular point enclosure, and rectangle intersection search. Our results for orthogonal and general segment intersection, 3-sided 2D range searching, and rectangular pointer enclosure problems match the lower bounds for their corresponding standard versions under the pointer machine model. Our results for the remaining problems improve upon the best known previous algorithms.}, keywords = {algorithms, computational geometry, Generalized intersection}, isbn = {0020-0190}, doi = {10.1016/j.ipl.2005.04.008}, url = {http://www.sciencedirect.com/science/article/pii/S0020019005001183}, author = {Shi,Qingmin and JaJa, Joseph F.} } @conference {17796, title = {Optimal status sets of heterogeneous agent programs}, booktitle = {Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems}, series = {AAMAS {\textquoteright}05}, year = {2005}, month = {2005///}, pages = {709 - 715}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {There are many situations where an agent can perform one of several sets of actions in responses to changes in its environment, and the agent chooses to perform the set of actions that optimizes some objective function. In past work, Eiter et. al. have proposed a rule based framework for programming agents on top of heterogeneous data sources, but they provide no solutions to the above problem. In this paper, we propose a semantics called optimal feasible status set semantics for agents which allows the agent to associate an objective function with feasible status sets and act according to the feasible status set that optimizes this objective function. We provide both an algorithm to compute exact optimal feasible status sets as well as the TierOpt and FastOpt algorithms to find (suboptimal) feasible status set much faster. We report on experiments on a suite of real agent applications showing that the heuristic algorithms works well in practice.}, keywords = {heterogeneous agents, heuristic search, non-ground representations, optimal status sets}, isbn = {1-59593-093-0}, doi = {10.1145/1082473.1082581}, url = {http://doi.acm.org/10.1145/1082473.1082581}, author = {Stroe,Bogdan and V.S. Subrahmanian and Dasgupta,Sudeshna} } @article {17313, title = {Ordered and Quantum Treemaps: Making Effective Use of 2D Space to Display Hierarchies (2001)}, year = {2005}, month = {2005///}, abstract = {Treemaps, a space- filling method of visualizing large hierarchical data sets, are receiving increasing attention. Several algorithms have been proposed to create more useful displays by controlling the aspect ratios of the rectangles that make up a treemap. While these algorithms do improve visibility of small items in a single layout, they introduce instability over time in the display of dynamically changing data, fail to preserve order of the underlying data, and create layouts that are difficult to visually search. In addition, continuous treemap algorithms are not suitable for displaying quantum-sized objects within them, such as images. This paper introduces several new treemap algorithms, which address these shortcomings. In addition, we show a new application of these treemaps, using them to present groups of images. The ordered treemap algorithms ensure that items near each other in the given order will be near each other in the treemap layout. Using experimental evidence from Monte Carlo trials, we show that compared to other layout algorithms ordered treemaps are more stable while maintaining relatively favorable aspect ratios of the constituent rectangles. A second test set uses stock market data. The quantum treemap algorithms modify the layout of the continuous treemap algorithms to generate rectangles that are integral multiples of an input object size. The quantum treemap algorithm has been applied to PhotoMesa, an application that supports browsing of large numbers of images.}, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/6486}, author = {Bederson, Benjamin B. and Shneiderman, Ben and Wattenberg,Martin} } @article {17315, title = {Ordered Treemap Layouts (2001)}, journal = {Institute for Systems Research Technical Reports}, year = {2005}, month = {2005///}, abstract = {Treemaps, a space-filling method of visualizing large hierarchical data sets, are receiving increasing attention. Several algorithms have been proposed to create more useful displays by controlling the aspect ratios of the rectangles that make up a treemap. While these algorithms do improve visibility of small items in a single layout, they introduce instability over time in the display of dynamically changing data, and fail to preserve an ordering of the underlying data. This paper introduces the ordered treemap, which addresses these two shortcomings. The ordered treemap algorithm ensures that items near each other in the given order will be near each other in the treemap layout. Using experimental evidence from Monte Carlo trials, we show that compared to other layout algorithms ordered treemaps are more stable while maintaining relatively low aspect ratios of the constituent rectangles. A second test set uses stock market data.}, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/6480}, author = {Shneiderman, Ben and Wattenberg,Martin} } @article {19609, title = {A parametric visualization software for the assignment problem}, journal = {Yugoslav Journal of Operations Research}, volume = {15}, year = {2005}, month = {2005///}, pages = {147 - 158}, isbn = {0354-0243}, url = {http://www.doiserbia.nb.rs/Article.aspx?id=0354-02430501147P\&AspxAutoDetectCookieSupport=1}, author = {Charalampos Papamanthou and Paparrizos, Konstantinos and Samaras, Nikolaos} } @article {16941, title = {A Photo History of SIGCHI: Evolution of Design from Personal to Public (2002)}, journal = {Institute for Systems Research Technical Reports}, year = {2005}, month = {2005///}, abstract = {For 20 years I have been photographing personalities and events in the emerging discipline of humanomputer interaction. Until now, only a few of these photos were published in newsletters or were shown to visitors who sought them out. Now this photo history is going from a personal record to a public archive. This archive should be interesting for professional members of this community who want to reminisce, as well as for historians and journalists who want to understand what happened. Students and Web surfers may also want to look at the people who created better interfaces and more satisfying user experiences.}, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/6529}, author = {Shneiderman, Ben} } @article {19039, title = {Pioneer: verifying code integrity and enforcing untampered code execution on legacy systems}, journal = {ACM SIGOPS Operating Systems Review}, volume = {39}, year = {2005}, month = {2005}, pages = {1 - 16}, abstract = {We propose a primitive, called Pioneer, as a first step towards verifiable code execution on untrusted legacy hosts. Pioneer does not require any hardware support such as secure co-processors or CPU-architecture extensions. We implement Pioneer on an Intel Pentium IV Xeon processor. Pioneer can be used as a basic building block to build security systems. We demonstrate this by building a kernel rootkit detector.}, keywords = {dynamic root of trust, rootkit detection, self-check-summing code, software-based code attestation, verifiable code execution}, isbn = {0163-5980}, url = {http://doi.acm.org/10.1145/1095809.1095812}, author = {Seshadri, Arvind and Luk, Mark and Elaine Shi and Perrig, Adrian and van Doorn, Leendert and Khosla, Pradeep} } @conference {15349, title = {Preliminary Study of the Turbulence Structure in Supersonic Boundary Layers using DNS Data}, booktitle = {35th AIAA Fluid Dynamics Conference}, year = {2005}, month = {2005///}, address = {Toronto, Canada}, abstract = {Direct numerical simulation data are used to visualize coherent structures in turbulentboundary layers at Mach numbers from 0.3 to 7. Different criteria to identify the three- dimensional turbulence structure are selected. We find that using the discriminant of the velocity gradient tensor, the swirling strength and the λ2 criteria give nearly identical results, with λ2 identifying more structures very close to the wall. }, author = {Taylor,E. M and Martin, M.P and Smits,A. J.} } @inbook {17793, title = {Probabilistic Ontologies and Relational Databases}, booktitle = {On the Move to Meaningful Internet Systems 2005: CoopIS, DOA, and ODBASEOn the Move to Meaningful Internet Systems 2005: CoopIS, DOA, and ODBASE}, series = {Lecture Notes in Computer Science}, volume = {3760}, year = {2005}, month = {2005///}, pages = {1 - 17}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {The relational algebra and calculus do not take the semantics of terms into account when answering queries. As a consequence, not all tuples that should be returned in response to a query are always returned, leading to low recall. In this paper, we propose the novel notion of a constrained probabilistic ontology (CPO). We developed the concept of a CPO-enhanced relation in which each attribute of a relation has an associated CPO. These CPOs describe relationships between terms occurring in the domain of that attribute. We show that the relational algebra can be extended to handle CPO-enhanced relations. This allows queries to yield sets of tuples, each of which has a probability of being correct.}, keywords = {Computer, Science}, isbn = {978-3-540-29736-9}, url = {http://dx.doi.org/10.1007/11575771_1}, author = {Udrea,Octavian and Yu,Deng and Hung,Edward and Subrahmanian,V.}, editor = {Meersman,Robert and Tari,Zahir} } @article {14100, title = {Promoter architecture and response to a positive regulator of archaeal transcription}, journal = {Molecular Microbiology}, volume = {56}, year = {2005}, month = {2005/05/01/}, pages = {625 - 637}, abstract = {The archaeal transcription apparatus is chimeric: its core components (RNA polymerase and basal factors) closely resemble those of eukaryotic RNA polymerase II, but the putative archaeal transcriptional regulators are overwhelmingly of bacterial type. Particular interest attaches to how these bacterial-type effectors, especially activators, regulate a eukaryote-like transcription system. The hyperthermophilic archaeon Methanocaldococcus jannaschii encodes a potent transcriptional activator, Ptr2, related to the Lrp/AsnC family of bacterial regulators. Ptr2 activates rubredoxin 2 (rb2) transcription through a bipartite upstream activating site (UAS), and conveys its stimulatory effects on its cognate transcription machinery through direct recruitment of the TATA binding protein (TBP). A functional dissection of the highly constrained architecture of the rb2 promoter shows that a {\textquoteleft}one-site{\textquoteright} minimal UAS suffices for activation by Ptr2, and specifies the required placement of this site. The presence of such a simplified UAS upstream of the natural rubrerythrin (rbr) promoter also suffices for positive regulation by Ptr2 in vitro, and TBP recruitment remains the primary means of transcriptional activation at this promoter.}, isbn = {1365-2958}, doi = {10.1111/j.1365-2958.2005.04563.x}, url = {http://onlinelibrary.wiley.com/doi/10.1111/j.1365-2958.2005.04563.x/abstract}, author = {Ouhammouch,Mohamed and Langham,Geoffrey E and Hausner,Winfried and Simpson,Anjana J. and El-Sayed, Najib M. and Geiduschek,E. Peter} } @article {17331, title = {Promoting Universal Usability with Multi-Layer Interface Design (2003)}, year = {2005}, month = {2005///}, abstract = {Increased interest in universal usability is causing some researchers to study advanced strategies for satisfying first-time as well as intermittent and expert users. This paper promotes the idea of multi-layer interface designs that enable first-time and novice users to begin with a limited set of features at layer 1. They can remain at layer 1, then move up to higher layers when needed or when they have time to learn further features. The arguments for and against multi-layer interfaces are presented with two example systems: a word processor with 8 layers and an interactive map with 3 layers. New research methods and directions are proposed.}, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/6510}, author = {Shneiderman, Ben} } @conference {17890, title = {Query planning for the grid: adapting to dynamic resource availability}, booktitle = {Cluster Computing and the Grid, IEEE International Symposium on}, volume = {2}, year = {2005}, month = {2005///}, pages = {751 - 758}, publisher = {IEEE Computer Society}, organization = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, abstract = {The availability of massive datasets, comprising sensor measurements or the results of scientific simulations, has had a significant impact on the methodology of scientific reasoning. Scientists require storage, bandwidth and computational capacity to query and analyze these datasets, to understand physical phenomena or to test hypotheses. This paper addresses the challenge of identifying and selecting resources to develop an evaluation plan for large scale data analysis queries when data processing capabilities and datasets are dispersed across nodes in one or more computing and storage clusters. We show that generating an optimal plan is hard and we propose heuristic techniques to find a good choice of resources. We also consider heuristics to cope with dynamic resource availability; in this situation we have stale information about reusable cached results (datasets) and the load on various nodes.}, isbn = {0-7803-9074-1}, doi = {http://doi.ieeecomputersociety.org/10.1109/CCGRID.2005.1558638}, author = {Zhang,K. and Andrade,H. and Raschid, Louiqa and Sussman, Alan} } @article {16943, title = {A Rank-by-Feature Framework for Interactive Exploration of Multidimensional Data (2004)}, journal = {Institute for Systems Research Technical Reports}, year = {2005}, month = {2005///}, abstract = {Interactive exploration of multidimensional data sets is challenging because: (1) it is difficult to comprehend patterns in more than three dimensions, and (2) current systems often are a patchwork of graphical and statistical methods leaving many researchers uncertain about how to explore their data in an orderly manner. We offer a set of principles and a novel rank-by-feature framework that could enable users to better understand distributions in one (1D) or two dimensions (2D), and then discover relationships, clusters, gaps, outliers, and other features. Users of our framework can view graphical presentations (histograms, boxplots, and scatterplots), and then choose a feature detection criterion to rank 1D or 2D axis-parallel projections. By combining information visualization techniques (overview, coordination, and dynamic query) with summaries and statistical methods users can systematically examine the most important 1D and 2D axis-parallel projections. We summarize our Graphics, Ranking, and Interaction for Discovery (GRID) principles as: (1) 1D, 2D, then features (2) graphics, ranking, summaries, then statistics. We implemented the rank-by-feature framework in the Hierarchical Clustering Explorer, but the same data exploration principles could enable users to organize their discovery process so as to produce more thorough analyses and extract deeper insights in any multidimensional data application, such as spreadsheets, statistical packages, or information visualization tools.}, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/6524}, author = {Seo,Jinwook and Shneiderman, Ben} } @article {16942, title = {A Rank-by-Feature Framework for Interactive Exploration of Multidimensional Data}, journal = {Information VisualizationInformation Visualization}, volume = {4}, year = {2005}, month = {2005/06/20/}, pages = {96 - 113}, abstract = {Interactive exploration of multidimensional data sets is challenging because: (1) it is difficult to comprehend patterns in more than three dimensions, and (2) current systems often are a patchwork of graphical and statistical methods leaving many researchers uncertain about how to explore their data in an orderly manner. We offer a set of principles and a novel rank-by-feature framework that could enable users to better understand distributions in one (1D) or two dimensions (2D), and then discover relationships, clusters, gaps, outliers, and other features. Users of our framework can view graphical presentations (histograms, boxplots, and scatterplots), and then choose a feature detection criterion to rank 1D or 2D axis-parallel projections. By combining information visualization techniques (overview, coordination, and dynamic query) with summaries and statistical methods users can systematically examine the most important 1D and 2D axis-parallel projections. We summarize our Graphics, Ranking, and Interaction for Discovery (GRID) principles as: (1) study 1D, study 2D, then find features (2) ranking guides insight, statistics confirm. We implemented the rank-by-feature framework in the Hierarchical Clustering Explorer, but the same data exploration principles could enable users to organize their discovery process so as to produce more thorough analyses and extract deeper insights in any multidimensional data application, such as spreadsheets, statistical packages, or information visualization tools.}, keywords = {dynamic query, exploratory data analysis, feature detection/selection, graphical displays, Information Visualization, Rank-by-feature framework}, isbn = {1473-8716, 1473-8724}, doi = {10.1057/palgrave.ivs.9500091}, url = {http://ivi.sagepub.com/content/4/2/96}, author = {Seo,Jinwook and Shneiderman, Ben} } @conference {17790, title = {RDF aggregate queries and views}, booktitle = {Data Engineering, 2005. ICDE 2005. Proceedings. 21st International Conference on}, year = {2005}, month = {2005/04//}, pages = {717 - 728}, abstract = {Resource description framework (RDF) is a rapidly expanding Web standard. RDF databases attempt to track the massive amounts of Web data and services available. In this paper, we study the problem of aggregate queries. We develop an algorithm to compute answers to aggregate queries over RDF databases and algorithms to maintain views involving those aggregates. Though RDF data can be stored in a standard relational DBMS (and hence we can execute standard relational aggregate queries and view maintenance methods on them), we show experimentally that our algorithms that operate directly on the RDF representation exhibit significantly superior performance.}, keywords = {aggregate, databases;, DBMS;, description, framework;, languages;, Maintenance, methods;, processing;, queries;, query, RDF, relational, resource, standard;, standards;, view, Web}, doi = {10.1109/ICDE.2005.121}, author = {Hung,E. and Deng,Yu and V.S. Subrahmanian} } @article {19025, title = {Recovering from Intrusions in the OSPF Data-plane}, year = {2005}, month = {2005}, institution = {School of Computer Science, Carnegie Mellon University}, abstract = {In this paper, we propose CONS-ROUTE, a data-plane intrusion recoverymechanism for securing the OSPF routing protocol. CONS-ROUTE allows routers to perform intrusion detection in a distributed manner. The intrusion detection outcome can be used globally to reevaluate routing decisions in a way that is resilient to the slandering attack, where a malicious router claims that a legitimate router is misbehaving. We evaluate CONS-ROUTE through simulation and compare it with several simple OSPF data plane resilience techniques. }, doi = {Technical Report}, url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.60.5274\&rep=rep1\&type=pdf$\#$page=51}, author = {Elaine Shi and Lu, Yong and Reid, Matt} } @article {15089, title = {Reducing complexity assumptions for statistically-hiding commitment}, journal = {Advances in Cryptology{\textendash}EUROCRYPT 2005}, year = {2005}, month = {2005///}, pages = {614 - 614}, abstract = {Determining the minimal assumptions needed to construct various cryptographic building blocks has been a focal point of research in theoretical cryptography. Here, we revisit the following question: what are the minimal assumptions needed to construct statistically-hiding commitment schemes? Previously, it was known how to construct such schemes based on one-way permutations. We improve upon this by constructing statistically-hiding commitment schemes based on approximable-preimage-size one-way functions. These are one-way functions for which there is an efficient way to approximate the number of preimages of a given output. A special case (for which we show a somewhat simpler construction) is that of regular one-way functions where all outputs have the same number of preimages.We utilize two different approaches in constructing statistically-hiding commitment schemes. Our first approach proceeds by showing that the scheme of Naor et al. can be implemented using any one-way function having an output distribution which is {\textquotedblleft}sufficiently similar{\textquotedblright} to uniform. We then construct one-way functions with this property from approximable-preimage-size one-way functions. Our second approach begins by constructing a commitment scheme which is statistically hiding against an honest-but-curious receiver. We then demonstrate a compiler which transforms any such commitment scheme into one which is statistically hiding even against a malicious receiver. This compiler and its analysis may be of independent interest. }, doi = {10.1007/11426639_4}, author = {Haitner,I. and Horvitz,O. and Katz, Jonathan and Koo,C. Y and Morselli,R. and Shaltiel,R.} } @inbook {16114, title = {Representing Unevenly-Spaced Time Series Data for Visualization and Interactive Exploration}, booktitle = {Human-Computer Interaction - INTERACT 2005Human-Computer Interaction - INTERACT 2005}, series = {Lecture Notes in Computer Science}, volume = {3585}, year = {2005}, month = {2005///}, pages = {835 - 846}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {Visualizing time series is useful to support discovery of relations and patterns in financial, genomic, medical and other applications. Often, measurements are equally spaced over time. We discuss the challenges of unevenly-spaced time series and present fourrepresentationmethods: sampled events, aggregated sampled events, event index and interleaved event index. We developed these methods while studying eBay auction data with TimeSearcher. We describe the advantages, disadvantages, choices for algorithms and parameters, and compare the different methods for different tasks. Interaction issues such as screen resolution, response time for dynamic queries, and learnability are governed by these decisions.}, isbn = {978-3-540-28943-2}, url = {http://dx.doi.org/10.1007/11555261_66}, author = {Aris,Aleks and Shneiderman, Ben and Plaisant, Catherine and Shmueli,Galit and Jank,Wolfgang}, editor = {Costabile,Maria and Patern{\`o},Fabio} } @article {16113, title = {Representing Unevenly-Spaced Time Series Data for Visualization and Interactive Exploration (2005)}, journal = {Institute for Systems Research Technical Reports}, year = {2005}, month = {2005///}, abstract = {Visualizing time series data is useful to support discovery of relations and patterns in financial, genomic, medical and other applications. In most time series, measurements are equally spaced over time. This paper discusses the challenges for unevenly-spaced time series data and presents four methods to represent them: sampled events, aggregated sampled events, event index and interleaved event index. We developed these methods while studying eBay auction data with TimeSearcher. We describe the advantages, disadvantages, choices for algorithms and parameters, and compare the different methods. Since each method has its advantages, this paper provides guidance for choosing the right combination of methods, algorithms, and parameters to solve a given problem for unevenly-spaced time series. Interaction issues such as screen resolution, response time for dynamic queries, and meaning of the visual display are governed by these decisions.}, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/6537}, author = {Aris,Aleks and Shneiderman, Ben and Plaisant, Catherine and Shmueli,Galit and Jank,Wolfgang} } @article {12082, title = {Robust routing in malicious environment for ad hoc networks}, journal = {Information Security Practice and Experience}, year = {2005}, month = {2005///}, pages = {36 - 47}, author = {Yu,Z. and Seng,C. Y and Jiang,T. and Wu,X. and Arbaugh, William A.} } @conference {16880, title = {Scalable data collection infrastructure for digital government applications}, booktitle = {Proceedings of the 2005 national conference on Digital government research}, series = {dg.o {\textquoteright}05}, year = {2005}, month = {2005///}, pages = {305 - 306}, publisher = {Digital Government Society of North America}, organization = {Digital Government Society of North America}, abstract = {Highlights are presented of a project on the development of a scalable data collection infrastructure of digital government applications. The approach takes advantage of both the distributed nature of the data and the distributed ways of interacting with it. The approach is three-parted having theoretical, systems, and application components. On the theoretical and systems levels, work has continued on the development of the BISTRO system. On the applications level, work has continued on the investigation of the use of peer-to-peer networks in a number of domains in which the proper handling of spatial data is important.}, url = {http://dl.acm.org/citation.cfm?id=1065226.1065333}, author = {Samet, Hanan and Tanin,Egemen and Golubchik,Leana} } @inbook {17656, title = {Scheduling on Unrelated Machines Under Tree-Like Precedence Constraints}, booktitle = {Approximation, Randomization and Combinatorial Optimization. Algorithms and TechniquesApproximation, Randomization and Combinatorial Optimization. Algorithms and Techniques}, series = {Lecture Notes in Computer Science}, volume = {3624}, year = {2005}, month = {2005///}, pages = {609 - 609}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {We present polylogarithmic approximations for the R | prec | C max and R | prec |∑ j w j C j problems, when the precedence constraints are {\textquotedblleft}treelike{\textquotedblright} {\textendash} i.e., when the undirected graph underlying the precedences is a forest. We also obtain improved bounds for the weighted completion time and flow time for the case of chains with restricted assignment {\textendash} this generalizes the job shop problem to these objective functions. We use the same lower bound of {\textquotedblleft}congestion+dilation{\textquotedblright}, as in other job shop scheduling approaches. The first step in our algorithm for the R | prec | C max problem with treelike precedences involves using the algorithm of Lenstra, Shmoys and Tardos to obtain a processor assignment with the congestion + dilation value within a constant factor of the optimal. We then show how to generalize the random delays technique of Leighton, Maggs and Rao to the case of trees. For the weighted completion time, we show a certain type of reduction to the makespan problem, which dovetails well with the lower bound we employ for the makespan problem. For the special case of chains, we show a dependent rounding technique which leads to improved bounds on the weighted completion time and new bicriteria bounds for the flow time.}, isbn = {978-3-540-28239-6}, url = {http://dx.doi.org/10.1007/11538462_13}, author = {Kumar, V. and Marathe,Madhav and Parthasarathy,Srinivasan and Srinivasan, Aravind}, editor = {Chekuri,Chandra and Jansen,Klaus and Rolim,Jos{\'e} and Trevisan,Luca} } @article {15088, title = {Secure remote authentication using biometric data}, journal = {Advances in Cryptology{\textendash}EUROCRYPT 2005}, year = {2005}, month = {2005///}, pages = {147 - 163}, abstract = {Biometric data offer a potential source of high-entropy, secret information that can be used in cryptographic protocols provided two issues are addressed: (1) biometric data are not uniformly distributed; and (2) they are not exactly reproducible. Recent work, most notably that of Dodis, Reyzin, and Smith, has shown how these obstacles may be overcome by allowing some auxiliary public information to be reliably sent from a server to the human user. Subsequent work of Boyen has shown how to extend these techniques, in the random oracle model, to enable unidirectional authentication from the user to the server without the assumption of a reliable communication channel.We show two efficient techniques enabling the use of biometric data to achieve mutual authentication or authenticated key exchange over a completely insecure (i.e., adversarially controlled) channel. In addition to achieving stronger security guarantees than the work of Boyen, we improve upon his solution in a number of other respects: we tolerate a broader class of errors and, in one case, improve upon the parameters of his solution and give a proof of security in the standard model. }, doi = {10.1007/11426639_9}, author = {Boyen,X. and Dodis,Y. and Katz, Jonathan and Ostrovsky,R. and Smith,A.} } @article {12775, title = {Secure requirements elicitation through triggered message sequence charts}, journal = {Distributed Computing and Internet Technology}, year = {2005}, month = {2005///}, pages = {273 - 282}, author = {Ray,A. and Sengupta,B. and Cleaveland, Rance} } @conference {18280, title = {Security of feature extraction in image hashing}, booktitle = {Acoustics, Speech, and Signal Processing, 2005. Proceedings. (ICASSP {\textquoteright}05). IEEE International Conference on}, volume = {2}, year = {2005}, month = {2005/03//}, pages = {ii/1041 - ii/1044 Vol. 2 - ii/1041 - ii/1044 Vol. 2}, abstract = {Security and robustness are two important requirements for image hash functions. We introduce "differential entropy" as a metric to quantify the amount of randomness in image hash functions and to study their security. We present a mathematical framework and derive expressions for the proposed security metric for various common image hashing schemes. Using the proposed security metric, we discuss the trade-offs between security and robustness in image hashing.}, keywords = {cryptography;, differential, digital, entropy;, extraction;, feature, functions;, hash, hashing;, image, metric;, processing;, randomness;, robustness;, Security, signature;, signatures;}, doi = {10.1109/ICASSP.2005.1415586}, author = {Swaminathan,A. and Mao,Yinian and M. Wu} } @conference {14341, title = {Seeking the source: software source code as a social and technical artifact}, booktitle = {Proceedings of the 2005 international ACM SIGGROUP conference on Supporting group work}, series = {GROUP {\textquoteright}05}, year = {2005}, month = {2005///}, pages = {197 - 206}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, keywords = {data mining, social networks, socio-technical systems, software repositories}, isbn = {1-59593-223-2}, doi = {10.1145/1099203.1099239}, url = {http://doi.acm.org/10.1145/1099203.1099239}, author = {de Souza,Cleidson and Jon Froehlich and Dourish,Paul} } @article {13713, title = {A sentence-trimming approach to multi-document summarization}, journal = {Proceedings of DUC2005}, year = {2005}, month = {2005///}, abstract = {We implemented an initial applicationof a sentence-trimming approach (Trim- mer) to the problem of multi-document summarization in the MSE2005 and DUC2005 tasks. Sentence trimming was incorporated into a feature-based summarization system, called Multi- Document Trimmer (MDT), by us- ing sentence trimming as both a pre- processing stage and a feature for sen- tence ranking. We demonstrate that we were able to port Trimmer easily to this new problem. Although the direct im- pact of sentence trimming was minimal compared to other features used in the system, the interaction of the other fea- tures resulted in trimmed sentences ac- counting for nearly half of the selected summary sentences. }, author = {Zajic, David and Dorr, Bonnie J and Jimmy Lin and Monz,C. and Schwartz,R.} } @article {16285, title = {Serendipitous discovery of Wolbachia genomes in multiple Drosophila species}, journal = {Genome Biology}, volume = {6}, year = {2005}, month = {2005/02/22/}, pages = {R23 - R23}, abstract = {The Trace Archive is a repository for the raw, unanalyzed data generated by large-scale genome sequencing projects. The existence of this data offers scientists the possibility of discovering additional genomic sequences beyond those originally sequenced. In particular, if the source DNA for a sequencing project came from a species that was colonized by another organism, then the project may yield substantial amounts of genomic DNA, including near-complete genomes, from the symbiotic or parasitic organism.}, isbn = {1465-6906}, doi = {10.1186/gb-2005-6-3-r23}, url = {http://genomebiology.com/2005/6/3/R23}, author = {Salzberg,Steven L. and Hotopp,Julie CD and Delcher,Arthur L. and Pop, Mihai and Smith,Douglas R. and Eisen,Michael B. and Nelson,William C.} } @article {17357, title = {Severity and Impact of Computer User Frustration: A Comparison of Student and Workplace Users (2002)}, year = {2005}, month = {2005///}, abstract = {User frustration with information and computing technology is a pervasive and persistent problem. When computers crash, network congestion causes delays, and poor user interfaces trigger confusion there are dramatic consequences for individuals, organizations, and society. These frustrations not only cause personal dissatisfaction and loss of self-efficacy, but may disrupt workplaces, slow learning, and reduce participation in local and national communities. Our study of 107 student computer users and 50 workplace computer users shows high levels of frustration and loss of 1/3 to 1/2 of time spent. This paper reports on the incident-specific and user-specific causes of frustration, and they raise frustration severity. It examines the frustration impacts on the daily interactions of the users. The time lost and time to fix problem, and importance of task, strongly correlate with frustration levels for both student and workplace users. Differences between students and workplace users are discussed in the paper.}, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/6496}, author = {Lazar,Jonathan and Jones,Adam and Hackley,Mary and Shneiderman, Ben} } @conference {17359, title = {Show Me! Guidelines for producing recorded demonstrations}, booktitle = {2005 IEEE Symposium on Visual Languages and Human-Centric Computing}, year = {2005}, month = {2005/09/20/24}, pages = {171 - 178}, publisher = {IEEE}, organization = {IEEE}, abstract = {Although recorded demonstrations (screen capture animations with narration) have become a popular form of instruction for user interfaces, little work has been done to describe guidelines for their design. Based on our experience in several projects, we offer a starting set of guidelines for the design of visually appealing and cognitively effective recorded demonstrations. Technical guidelines encourage users to keep file sizes small, strive for universal usability, and ensure user control etc. and provide tips to achieve those goals. Content guidelines include: create short demonstrations that focus on tasks, highlight each step with auditory and visual cues, synchronize narration and animation carefully, and create demonstrations with a clear beginning, middle, and end.}, keywords = {animation, auditory cues, Computer aided instruction, Computer animation, Computer Graphics, Computer interfaces, computer literacy, content guidelines, documentation, Government, Graphical user interfaces, Guidelines, Laboratories, narration, recorded demonstrations, screen capture animation, technical guidelines, usability, User interfaces, visual appeal, visual cues}, isbn = {0-7695-2443-5}, doi = {10.1109/VLHCC.2005.57}, author = {Plaisant, Catherine and Shneiderman, Ben} } @article {16102, title = {Show Me! Guidelines for Producing Recorded Demonstrations (2005)}, year = {2005}, month = {2005///}, abstract = {Although recorded demonstrations (screen capture animations with narration) have become a popular form of instruction for user interfaces, little work has been done to describe guidelines for their design. Based on our experience in several projects, we offer a starting set of guidelines for the design of recorded demonstrations. Technical guidelines encourage users to keep file sizes small, strive for universal usability, and ensure user control etc. and provide tips to achieve those goals. Content guidelines include: create short demonstrations that focus on tasks, highlight each step with auditory and visual cues, synchronize narration and animation carefully, and create demonstrations with a clear beginning, middle, and end.}, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/6533}, author = {Plaisant, Catherine and Shneiderman, Ben} } @article {17841, title = {A simulation and data analysis system for large-scale, data-driven oil reservoir simulation studies}, journal = {Concurrency and Computation: Practice and Experience}, volume = {17}, year = {2005}, month = {2005///}, pages = {1441 - 1467}, author = {Kurc, T. and Catalyurek,U. and Zhang,X. and Saltz, J. and Martino,R. and Wheeler,M. and Peszy{\'n}ska,M. and Sussman, Alan and Hansen,C. and Sen,M. and others} } @article {17362, title = {Snap-Together Visualization: A User Interface for Coordinating Visualizations via Relational Schemata (2000)}, year = {2005}, month = {2005///}, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/6470}, author = {North,Chris and Shneiderman, Ben} } @article {17368, title = {Social and Psychological Influences on Computer User Frustration (Newhagen book chapter, 2002)}, journal = {Institute for Systems Research Technical Reports}, year = {2005}, month = {2005///}, abstract = {As computer usage has proliferated, so has user frustration. Even devoted and knowledgeable users encounter annoying delays, incomprehensible messages, incompatible files, and indecipherable menus. The frustration generated by these problems can be personally disturbing and socially disruptive. Psychological and social perspectives on frustration may clarify the relationships among variables such as personality types, cultural factors, goal attainment, workplace anger, and computer anxiety. These perspectives may also help designers, managers, and users understand the range of responses to frustration, which could lead to effective interventions such as redesign of software, improved training, better online help, user discipline, and even resetting of national research priorities.}, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/6497}, author = {Bessiere,Katie and Ceaparu,Irina and Lazar,Jonathan and Robinson,John and Shneiderman, Ben} } @article {18431, title = {Software process improvement in small organizations: a case study}, journal = {Software, IEEE}, volume = {22}, year = {2005}, month = {2005/12//nov}, pages = {68 - 75}, abstract = {The Capability Maturity Model for software has become a major force in software development process improvement. We looked at the role of process improvement in the context of a small organization. Although the Capability Maturity Model integration is replacing the CMM, we focused on the older CMM. We had to look at more than which CMM key process areas apply to small businesses. Our overall goal was to institute good software development practices, we used the language of the CMM to gain the management{\textquoteright}s cooperation. Applying these practices is essential to managing growth, yet undertaking this effort without prior experience could impede a small company{\textquoteright}s innovative nature. This case study{\textquoteright}s purpose was to investigate the success factors of a software process improvement effort for a small software development organization.}, keywords = {area;, aspects;, capability, CMM, development, improvement;, key, management;, Maturity, model;, organisational, organization;, process, small, software}, isbn = {0740-7459}, doi = {10.1109/MS.2005.162}, author = {Dangle,K.C. and Larsen,P. and Shaw,M. and Zelkowitz, Marvin V} } @article {16357, title = {Software repository mining with Marmoset: an automated programming project snapshot and testing system}, journal = {ACM SIGSOFT Software Engineering Notes}, volume = {30}, year = {2005}, month = {2005///}, pages = {1 - 5}, author = {Spacco,J. and Strecker,J. and Hovemeyer,D. and Pugh, William} } @article {15026, title = {Space-efficient and fast algorithms for multidimensional dominance reporting and counting}, journal = {Algorithms and Computation}, year = {2005}, month = {2005///}, pages = {1755 - 1756}, abstract = {We present linear-space sub-logarithmic algorithms for handling the 3-dimensional dominance reporting and the 2-dimensional dominance counting problems. Under the RAM model as described in [M. L. Fredman and D. E. Willard. ldquoSurpassing the information theoretic bound with fusion treesrdquo, Journal of Computer and System Sciences, 47:424{\textendash}436, 1993], our algorithms achieve O(log n/loglog n+f) query time for the 3-dimensional dominance reporting problem, where f is the output size, and O(log n/loglog n) query time for the 2-dimensional dominance counting problem. We extend these results to any constant dimension d ge 3, achieving O(n(log n/loglog n)d {\textendash} 3) space and O((log n/loglog n)d {\textendash} 2+ f) query time for the reporting case and O(n(log n/loglog n)d {\textendash} 2) space and O((log n/loglog n)d {\textendash} 1) query time for the counting case.}, doi = {10.1007/978-3-540-30551-4_49}, author = {JaJa, Joseph F. and Mortensen,C. and Shi,Q.} } @conference {17888, title = {Spatial indexing of distributed multidimensional datasets}, booktitle = {IEEE International Symposium on Cluster Computing and the Grid, 2005. CCGrid 2005}, volume = {2}, year = {2005}, month = {2005/05/09/12}, pages = {743- 750 Vol. 2 - 743- 750 Vol. 2}, publisher = {IEEE}, organization = {IEEE}, abstract = {While declustering methods for distributed multidimensional indexing of large datasets have been researched widely in the past, replication techniques for multidimensional indexes have not been investigated deeply. In general, a centralized index server may become the performance bottleneck in a wide area network rather than the data servers, since the index is likely to be accessed more often than any of the datasets in the servers. In this paper, we present two different multidimensional indexing algorithms for a distributed environment - a centralized global index and a two-level hierarchical index. Our experimental results show that the centralized scheme does not scale well for either insertion or searching the index. In order to improve the scalability of the index server, we have employed a replication protocol for both the centralized and two-level index schemes that allows some inconsistency between replicas without affecting correctness. Our experiments show that the two-level hierarchical index scheme shows better scalability for both building and searching the index than the non-replicated centralized index, but replication can make the centralized index faster than the two-level hierarchical index for searching in some cases.}, keywords = {centralized global index algorithm, centralized index server, Computer science, database indexing, distributed databases, distributed multidimensional dataset, Educational institutions, File servers, Indexing, Large-scale systems, Multidimensional systems, Network servers, replication protocol, replication techniques, scalability, Sensor systems, spatial data structures, spatial indexing, two-level hierarchical index algorithm, wide area networks}, isbn = {0-7803-9074-1}, doi = {10.1109/CCGRID.2005.1558637}, author = {Nam,B. and Sussman, Alan} } @article {13865, title = {Structural metadata and parsing speech}, year = {2005}, month = {2005///}, institution = {JHU Language Engineering Workshop}, author = {Harper,M. and Dorr, Bonnie J and Hale,J. and Roark,B. and Shafran,I. and Lease,M. and Liu,Y. and Snover,M. and Yung,L. and Krasnyanskaya,A. and others} } @article {12284, title = {Stub Domain DDoS Detection}, year = {2005}, month = {2005///}, institution = {Technical Report of the Department of Computer Science, University of Maryland, College Park}, author = {Kommareddy,C. and Levin,D. and Bhattacharjee, Bobby and La,R.J. and Shayman,M.} } @conference {18781, title = {A system for performing content-based searches on a database of mechanical assemblies}, year = {2005}, month = {2005///}, address = {Orlando, Florida USA}, abstract = {The increased use of 3D CAD systems by productdevelopment organizations has resulted in large databases of assemblies; this explosion of assembly data will continue in the future. Currently, there are no effective content-based techniques to search these databases. Ability to perform content-based searches on these databases is expected to help the designers in the following two ways. First, it can facilitate reuse of existing assembly designs, and thereby reducing the design time. Second, a lot of useful Design for Manufacturing and Assembly (DFMA) knowledge is embedded in existing assemblies. Therefore a capability to locate existing assemblies and examine them can be used as a learning tool by the designers to learn from the existing assembly designs and hence transfer the best DFMA practices to new designers. This paper describes a system for performing content-based searches on assembly databases. We identify templates for comprehensive search definitions and describe algorithms to perform content-based searches for mechanical assemblies. We also illustrate capabilities of our system through several examples. }, url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.160.8372\&rep=rep1\&type=pdf}, author = {Deshmukh,A. S. and Gupta,S.K. and Karnik,M. V. and Sriram,R.D.} } @article {15034, title = {Techniques for indexing and querying temporal observations for a collection of objects}, journal = {Algorithms and Computation}, year = {2005}, month = {2005///}, pages = {822 - 834}, abstract = {We consider the problem of dynamically indexing temporal observations about a collection of objects, each observation consisting of a key identifying the object, a list of attribute values and a timestamp indicating the time at which these values were recorded. We make no assumptions about the rates at which these observations are collected, nor do we assume that the various objects have about the same number of observations. We develop indexing structures that are almost linear in the total number of observations available at any given time instance, and that support dynamic additions of new observations in polylogarithmic time. Moreover, these structures allow the quick handling of queries to identify objects whose attribute values fall within a certain range at every time instance of a specified time interval. Provably good bounds are established.}, doi = {10.1007/978-3-540-30551-4_70}, author = {Shi,Q. and JaJa, Joseph F.} } @conference {13471, title = {Temporal visualization of planning polygons for e~cient partitioning of geo-spatial data}, booktitle = {Information Visualization, 2005. INFOVIS 2005. IEEE Symposium on}, year = {2005}, month = {2005///}, pages = {211 - 218}, publisher = {IEEE}, organization = {IEEE}, abstract = {Partitioning of geo-spatial data for efficient allocation of resources such as schools and emergency health care services is driven by a need to provide better and more effective services. Partitioning of spatial data is a complex process that depends on numerous factors such as population, costs incurred in deploying or utilizing resources and target capacity of a resource. Moreover, complex data such as population distributions are dynamic i.e. they may change over time. Simple animation may not effectively show temporal changes in spatial data. We propose the use of three temporal visualization techniques -wedges, rings and time slices - to display the nature of change in temporal data in a single view. Along with maximizing resource utilization and minimizing utilization costs, a partition should also ensure the long term effectiveness of the plan. We use multi-attribute visualization techniques to highlight the strengths and identify the weaknesses of a partition. Comparative visualization techniques allow multiple partitions to be viewed simultaneously. Users can make informed decisions about how to partition geo spatial data by using a combination of our techniques for multi-attribute visualization, temporal visualization and comparative visualization.}, isbn = {0-7803-9464-X}, doi = {10.1109/INFVIS.2005.1532149}, url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1532149}, author = {Shanbhag,P. and Rheingans,P. and desJardins, Marie} } @article {16104, title = {Toward a Statistical Knowledge Network (2004)}, journal = {Institute for Systems Research Technical Reports}, year = {2005}, month = {2005///}, abstract = {Statistics support planning and decision making and enormous efforts are made to collect data and produce statistics at all levels of governance. An important principle of democratic societies is that government statistics should be accessible to the broadest possible constituencies to empower better plans and decisions in all aspects of life. Given the potential of near-ubiquitous Internet access in homes and workplaces and efforts by government agencies to mount websites, physical access to large volumes of government is close to a fait accompli. What remains a significant challenge is enabling access to the right statistical information at the right time and in the right form.}, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/6522}, author = {Marchionini,Gary and Haas,Stephanie and Plaisant, Catherine and Shneiderman, Ben and Hert,Carol} } @article {12671, title = {Tracking Algorithm Using Background-Foreground Motion Models and Multiple Cues}, journal = {ICASSP apos}, year = {2005}, month = {2005///}, pages = {233 - 236}, abstract = {We present a stochastic tracking algorithm for surveillance videoswhere targets are dim and of low resolution. Our tracker is mainly based on the particle filter algorithm. Two important novel fea- tures of the tracker include: A motion model consisting of both background and foreground motion parameters is built. Multiple cues are adaptively integrated in a system observation model when estimating the likelihood functions. Based on these features, the accuracy and robustness of the tracker has been improved, which is very important for surveillance problems. We present the results of applying the proposed algorithm to many videos. }, author = {Shao, J. and Zhou,S. K and Chellapa, Rama} } @conference {12652, title = {Tracking objects in video using motion and appearance models}, booktitle = {Image Processing, 2005. ICIP 2005. IEEE International Conference on}, volume = {2}, year = {2005}, month = {2005/09//}, pages = {II - 394-7 - II - 394-7}, abstract = {This paper proposes a visual tracking algorithm that combines motion and appearance in a statistical framework. It is assumed that image observations are generated simultaneously from a background model and a target appearance model. This is different from conventional appearance-based tracking, that does not use motion information. The proposed algorithm attempts to maximize the likelihood ratio of the tracked region, derived from appearance and background models. Incorporation of motion in appearance based tracking provides robust tracking, even when the target violates the appearance model. We show that the proposed algorithm performs well in tracking targets efficiently over long time intervals.}, keywords = {algorithm;, analysis;, appearance, background, estimation;, image, likelihood, maximum, model;, models;, MOTION, object, processing;, signal, target, tracking, tracking;, video, visual}, doi = {10.1109/ICIP.2005.1530075}, author = {Sankaranarayanan,A. C and Chellapa, Rama and Qinfen Zheng} } @article {14072, title = {Transcriptional profiling of the hyperthermophilic methanarchaeon Methanococcus jannaschii in response to lethal heat and non-lethal cold shock}, journal = {Environmental Microbiology}, volume = {7}, year = {2005}, month = {2005/06/01/}, pages = {789 - 797}, abstract = {Temperature shock of the hyperthermophilic methanarchaeon Methanococcus jannaschii from its optimal growth temperature of 85{\textdegree}C to 65{\textdegree}C and 95{\textdegree}C resulted in different transcriptional responses characteristic of both the direction of shock (heat or cold shock) and whether the shock was lethal. Specific outcomes of lethal heat shock to 95{\textdegree}C included upregulation of genes encoding chaperones, and downregulation of genes encoding subunits of the H+ transporting ATP synthase. A gene encoding an α subunit of a putative prefoldin was also upregulated, which may comprise a novel element in the protein processing pathway in M. jannaschii. Very different responses were observed upon cold shock to 65{\textdegree}C. These included upregulation of a gene encoding an RNA helicase and other genes involved in transcription and translation, and upregulation of genes coding for proteases and transport proteins. Also upregulated was a gene that codes for an 18~kDa FKBP-type PPIase, which may facilitate protein folding at low temperatures. Transcriptional profiling also revealed several hypothetical proteins that respond to temperature stress conditions.}, isbn = {1462-2920}, doi = {10.1111/j.1462-2920.2005.00751.x}, url = {http://onlinelibrary.wiley.com/doi/10.1111/j.1462-2920.2005.00751.x/abstract}, author = {Boonyaratanakornkit,Boonchai B and Simpson,Anjana J. and Whitehead,Timothy A and Fraser,Claire M. and El-Sayed, Najib M. and Clark,Douglas S} } @conference {17444, title = {Turning information visualization innovations into commercial products: lessons to guide the next success}, booktitle = {IEEE Symposium on Information Visualization, 2005. INFOVIS 2005}, year = {2005}, month = {2005/10/23/25}, pages = {241 - 244}, publisher = {IEEE}, organization = {IEEE}, abstract = {As information visualization matures as an academic research field, commercial spinoffs are proliferating, but success stories are harder to find. This is the normal process of emergence for new technologies, but the panel organizers believe that there are certain strategies that facilitate success. To teach these lessons, we have invited several key figures who are seeking to commercialize information visualization tools. The panelists make short presentations, engage in a moderated discussion, and respond to audience questions.}, keywords = {Books, commercial development, commercial product, Computer interfaces, Computer science, data visualisation, Data visualization, Educational institutions, exploratory data analysis, information visualization innovation, information visualization tool, innovation management, Laboratories, Management training, new technology emergence, Technological innovation, technology transfer, Turning, User interfaces}, isbn = {0-7803-9464-X}, doi = {10.1109/INFVIS.2005.1532153}, author = {Shneiderman, Ben and Rao,R. and Andrews,K. and Ahlberg,C. and Brodbeck,D. and Jewitt,T. and Mackinlay,J.} } @article {19581, title = {A Type and Effect System for Flexible Abstract Interpretation of Java: (Extended Abstract)}, journal = {Electronic Notes in Theoretical Computer Science}, volume = {131}, year = {2005}, month = {2005/05/24/}, pages = {111 - 124}, abstract = {This paper describes a flexible type and effect inference system for Featherweight Java (FJ). The effect terms generated by static type and effect inference embody the abstract interpretation of pro- gram event sequences. Flexibility in the analysis is obtained by post-processing of inferred effects, allowing a modular adaptation to extensions of the language. Several example transformations are discussed, including how inferred effects can be transformed to reflect the impact of exceptions on FJ control flow.}, keywords = {language security, object oriented languages, Type analysis}, isbn = {1571-0661}, url = {http://www.sciencedirect.com/science/article/pii/S1571066105002628}, author = {Skalka, Christian and Smith, Scott and David Van Horn} } @article {13881, title = {Umd/bbn at mse2005}, journal = {Proceedings of the MSE2005 track of the Association for Computational Linguistics Workshop on Intrinsic and Extrinsic Evaluation Meatures for MT and/or Summarization, Ann Arbor, MI}, year = {2005}, month = {2005///}, abstract = {We implemented an initial applicationof a sentence-trimming approach (Trim- mer) to the problem of multi-document summarization in the MSE2005 task. Sentence trimming was incorporated into a feature-based summarization sys- tem, called Multi-Document Trimmer (MDT), by using sentence trimming as both a pre-processing stage and a fea- ture for sentence ranking. We demon- strate that we were able to port Trimmer easily to this new problem, although the impact of sentence trimming was min- imal compared to other features used in the system. The performance of our sys- tem in the official MSE2005 task was around the middle of the pack (16 out of 27). After some minor bug fixes and a simple correction (dateline removal) we obtained an improvement on a post-hoc run on the test data. }, author = {Zajic, David and Dorr, Bonnie J and Jimmy Lin and Schwartz,R.} } @article {17448, title = {Understanding Clusters in Multidimensional Spaces: Making Meaning by Combining Insights from Coordinated Views of Domain Knowledge (2004)}, journal = {Institute for Systems Research Technical Reports}, year = {2005}, month = {2005///}, abstract = {Cluster analysis of multidimensional data is widely used in many research areas including financial, economical, sociological, and biological analyses. Finding natural subclasses in a data set not only reveals interesting patterns but also serves as a basis for further analyses. One of the troubles with cluster analysis is that evaluating how interesting a clustering result is to researchers is subjective, application-dependent, and even difficult to measure. This problem generally gets worse as dimensionality and the number of items grows. The remedy is to enable researchers to apply domain knowledge to facilitate insight about the significance of the clustering result. This article presents a way to better understand a clustering result by combining insights from two interactively coordinated visual displays of domain knowledge. The first is a parallel coordinates view powered by a direct-manipulation search. The second is a domain knowledge view containing a well-understood and meaningful tabular or hierarchical information for the same data set. Our examples depend on hierarchical clustering of gene expression data, coordinated with a parallel coordinates view and with the gene annotation and gene ontology.}, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/6512}, author = {Seo,Jinwook and Shneiderman, Ben} } @article {17456, title = {Universal Usability as a Stimulus to Advanced Interface Design (2001)}, year = {2005}, month = {2005///}, abstract = {The desire to make computing available to broader populations has historically been a motivation for research and innovation that led to new breakthroughs in usability. Menus, graphical user interfaces, and the World-Wide Web, are examples of innovative technological solutions that have arisen out of the challenge of bringing larger and more diverse groups of users into the world of computing. Universal usability is the latest such challenge: In order to build systems that are universally usable, designers must account for technology variety, user diversity, and gaps in user knowledge. These issues are particularly challenging and important in the context of increasing the usability of the World-Wide-Web. To raise awareness, we urge web designers to provide universal usability statements, to provide users with useful information about the usability of their sites. These statements can inform users and thereby reduce frustration and confusion. Further steps toward universal usability might be achieved through research aimed at developing tools that would encourage or promote usability. We close with five proposals for future research.}, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/6485}, author = {Shneiderman, Ben and Hochheiser,Harry} } @article {17465, title = {User Frustration with Technology in the Workplace (2004)}, journal = {Institute for Systems Research Technical Reports}, year = {2005}, month = {2005///}, abstract = {When hard to use computers cause users to become frustrated, it can affect workplace productivity, user mood, and interactions with other co-workers. Previous research has examined the frustration that graduate students and their families face in using computers. To learn more about the causes and effects of user frustration with computers in the workplace, we collected modified time diaries from 50 workplace users, who spent an average of 5.1 hours on the computer. In this experiment, users reported wasting on average, 42-43\% of their time on the computer due to frustrating experiences. The causes of the frustrating experiences, the time lost due to the frustrating experiences, and the effects of the frustrating experiences on the mood of the users are discussed in this paper. Implications for designers, managers, users, information technology staff, and policymakers are discussed.}, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/6515}, author = {Lazar,Jonathan and Jones,Adam and Bessiere,Katie and Ceaparu,Irina and Shneiderman, Ben} } @article {17476, title = {Using Categorical Information in Multidimensional Data Sets: Interactive Partition and Cluster Comparison}, journal = {Institute for Systems Research Technical Reports}, year = {2005}, month = {2005///}, abstract = {Multidimensional data sets often include categorical information. When most columns have categorical information, clustering the data set by similarity of categorical values can reveal interesting patterns in the data set. However, when the data set includes only a small number (one or two) of categorical columns, the categorical information is probably more useful as a way to partition the data set. For example, researchers might be interested in gene expression data for healthy vs. diseased patients or stock performance for common, preferred, or convertible shares. For these cases, we present a novel way to utilize the categorical information together with clustering algorithms. Instead of incorporating categorical information into the clustering process, we can partition the data set according to categorical information. Clustering is then performed with each subset to generate two or more clustering results, each of which is homogeneous (i.e. only includes the same categorical value for the categorical column). By comparing the partitioned clustering results, users can get meaningful insights into the data set: users can identify an interesting group of items that are differentially/similarly expressed in two different homogeneous partitions. The partition can be done in two different directions: (1) by rows if categorical information is available for each column (e.g. some columns are from disease samples and other columns are from healthy samples) or (2) by a column if a column contains categorical information (e.g. a column represents a categorical attribute such as colors or sex). We designed and implemented an interface to facilitate this interactive partition-based clustering results comparison. Coordination between clustering results displays and comparison results overview enables users to identify interesting clusters, and a simple grid display clearly reveals correspondence between two clusters.}, keywords = {Societal Infrastructure Systems}, url = {http://drum.lib.umd.edu/handle/1903/6568}, author = {Seo,Jinwook and Shneiderman, Ben} } @conference {14785, title = {Using Dynamic Tracing Sampling to Measure Long Running Programs}, booktitle = {Proceedings of the 2005 ACM/IEEE conference on Supercomputing}, series = {SC {\textquoteright}05}, year = {2005}, month = {2005///}, pages = {59{\textendash} - 59{\textendash}}, publisher = {IEEE Computer Society}, organization = {IEEE Computer Society}, abstract = {Detailed cache simulation can be useful to both system developers and application writers to understand an application{\textquoteright}s performance. However, measuring long running programs can be extremely slow. In this paper we present a technique to use dynamic sampling of trace snippets throughout an application{\textquoteright}s execution. We demonstrate that our approach improves accuracy compared to sampling a few timesteps at the beginning of execution by judiciously choosing the frequency, as well as the points in the control flow, at which samples are collected. Our approach is validated using the SIGMA tracing and simulation framework for the IBM Power family of processors.}, keywords = {data communications, design, experimentation, measurement, performance, tracing}, isbn = {1-59593-061-2}, doi = {http://dx.doi.org/10.1109/SC.2005.77}, url = {http://dx.doi.org/10.1109/SC.2005.77}, author = {Odom, Jeffrey and Hollingsworth, Jeffrey K and DeRose,Luiz and Ekanadham, Kattamuri and Sbaraglia, Simone} } @conference {13191, title = {VidMAP: video monitoring of activity with Prolog}, booktitle = {Advanced Video and Signal Based Surveillance, 2005. AVSS 2005. IEEE Conference on}, year = {2005}, month = {2005/09//}, pages = {224 - 229}, abstract = {This paper describes the architecture of a visual surveillance system that combines real time computer vision algorithms with logic programming to represent and recognize activities involving interactions amongst people, packages and the environments through which they move. The low level computer vision algorithms log primitive events of interest as observed facts, while the higher level Prolog based reasoning engine uses these facts in conjunction with predefined rules to recognize various activities in the input video streams. The system is illustrated in action on a multi-camera surveillance scenario that includes both security and safety violations.}, keywords = {activities, algorithms;, based, Computer, computerised, engine;, higher, image, level, Logic, monitoring;, multicamera, processing;, programming;, Prolog, PROLOG;, reasoning, recognition;, scenario;, signal, streaming;, streams;, Surveillance, surveillance;, system;, video, VISION, vision;, visual}, doi = {10.1109/AVSS.2005.1577271}, author = {Shet,V. D and Harwood,D. and Davis, Larry S.} } @article {17494, title = {Visual Specification of Queries for Finding Patterns in Time-Series Data (2001)}, year = {2005}, month = {2005///}, abstract = {Widespread interest in discovering features and trends in time- series has generated a need for tools that support interactive exploration.This paper introduces timeboxes: a powerful graphical, directmanipulation metaphor for the specification of queries over time-series datasets. Our TimeFinder implementation of timeboxes supports interactive formulation and modification of queries, thus speeding the process of exploring time-series data sets and guiding data mining. TimeFinder includes windows for timebox queries, individual time-series, and details-on-demand. Other features include drag-and-drop support for query-by-example and graphical envelopes for displaying the extent of the entire data set and result set from a given query. Extensions involving increased expressive power and general temporal data sets are discussed.}, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/6479}, author = {Hochheiser,Harry and Shneiderman, Ben} } @article {17499, title = {Visualization Methods for Personal Photo Collections: Browsing and Searching in the PhotoFinder (2000)}, year = {2005}, month = {2005///}, abstract = {Software tools for personal photo collection management are proliferating, but they usually have limited searching and browsing functions. We implemented the PhotoFinder prototype to enable non-technical users of personal photo collections to search and browse easily. PhotoFinder provides a set of visual Boolean query interfaces, coupled with dynamic query and query preview features. It gives users powerful search capabilities. Using a scatter plot thumbnail display and drag-and-drop interface, PhotoFinder is designed to be easy to use for searching and browsing photos.}, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/6472}, author = {Kang,Hyunmo and Shneiderman, Ben} } @article {17509, title = {Why Not Make Interfaces Better than 3D Reality? (2004)}, year = {2005}, month = {2005///}, abstract = {Some designers dream about building interfaces that approach the richness of 3D reality. They believe that the closer an interface resembles the real world, the easier the usage. They strive for resolution that matches filmith rapid camera movement and lively animated objects. This is a dubious proposition since user studies show that disorienting navigation, complex user actions, and annoying occlusions can slow performance in the real world as well as 3D interfaces.}, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/6523}, author = {Shneiderman, Ben} } @article {12713, title = {3d modelling of human motion using kinematic chains and multiple cameras for tracking}, journal = {Proc. of Eighth International Symposium on the}, year = {2004}, month = {2004///}, author = {Sundaresan, A. and RoyChowdhury, A. and Chellapa, Rama} } @article {12941, title = {Acinetobacter lipases: molecular biology, biochemical properties and biotechnological potential}, journal = {Journal of industrial microbiology \& biotechnology}, volume = {31}, year = {2004}, month = {2004///}, pages = {391 - 400}, abstract = {Lipases (EC 3.1.1.3) have received increased attention recently, evidenced by the increasing amount of information about lipases in the current literature. The renewed interest in this enzyme class is due primarily to investigations of their role in pathogenesis and their increasing use in biotechnological applications [38]. Also, many microbial lipases are available as commercial products, the majority of which are used in detergents, cosmetic production, food flavoring, and organic synthesis. Lipases are valued biocatalysts because they act under mild conditions, are highly stable in organic solvents, show broad substrate specificity, and usually show high regio- and/or stereo-selectivity in catalysis. A number of lipolytic strains of Acinetobacter have been isolated from a variety of sources and their lipases possess many biochemical properties similar to those that have been developed for biotechnological applications. This review discusses the biology of lipase expression in Acinetobacter, with emphasis on those aspects relevant to potential biotechnology applications.}, doi = {10.1007/s10295-004-0167-0}, author = {Snellman,E. A. and Rita R Colwell} } @article {11898, title = {Active deformable models using density estimation}, journal = {International Journal of Image and Graphics}, volume = {4}, year = {2004}, month = {2004///}, pages = {343 - 362}, author = {Abd-Almageed, Wael and Smith,C.E.} } @article {13417, title = {Adapting network structure for efficient team formation}, journal = {Proceedings of the AAAI 2004 Fall Symposium on Artificial Multi-agent Learning}, year = {2004}, month = {2004///}, author = {Gaston,M. and Simmons,J. and desJardins, Marie} } @conference {12296, title = {Adaptive replication in peer-to-peer systems}, booktitle = {Distributed Computing Systems, 2004. Proceedings. 24th International Conference on}, year = {2004}, month = {2004///}, pages = {360 - 369}, abstract = {Peer-to-peer systems can be used to form a low-latency decentralized data delivery system. Structured peer-to-peer systems provide both low latency and excellent load balance with uniform query and data distributions. Under the more common skewed access distributions, however, individual nodes are easily overloaded, resulting in poor global performance and lost messages. This paper describes a lightweight, adaptive, and system-neutral replication protocol, called LAR, that maintains low access latencies and good load balance even under highly skewed demand. We apply LAR to Chord and show that it has lower overhead and better performance than existing replication strategies.}, keywords = {adaptive, allocation;, data, databases;, decentralized, delivery, distributed, LAR, low-latency, peer-to-peer, processing;, protocol;, replicated, replication, resource, strategies;, structured, system-neutral, system;, systems;}, doi = {10.1109/ICDCS.2004.1281601}, author = {Gopalakrishnan,V. and Silaghi,B. and Bhattacharjee, Bobby and Keleher,P.} } @article {17803, title = {An algebra for powerpoint sources}, journal = {Multimedia Tools and Applications}, volume = {24}, year = {2004}, month = {2004///}, pages = {273 - 301}, abstract = {There are now millions of PowerPoint documents available within corporate intranets and/or over the Internet. In this paper, we develop a formal model of PowerPoint databases. We propose a relational style algebra called pptA (PowerPoint Algebra) to query PowerPoint databases. The algebra contains some new operators (such as the APPLY operator that changes properties of objects, slides and presentations) as well as interesting twists on relational operators (e.g. join and cartesian product allow different entities being joined together to share attributes whose values may be merged). We prove a set of equivalence results within this algebra. We have implemented a version of pptA{\textemdash}the paper provides a cost model and experimental results on the conditions under which these equivalences are useful.}, doi = {10.1023/B:MTAP.0000039422.87260.52}, author = {Fayzullin,M. and V.S. Subrahmanian} } @conference {12703, title = {Appearance-based tracking and recognition using the 3D trilinear tensor}, booktitle = {Acoustics, Speech, and Signal Processing, 2004. Proceedings. (ICASSP {\textquoteright}04). IEEE International Conference on}, volume = {3}, year = {2004}, month = {2004/05//}, pages = {iii - 613-16 vol.3 - iii - 613-16 vol.3}, abstract = {The paper presents an appearance-based adaptive algorithm for simultaneous tracking and recognition by generalizing the transformation model to 3D perspective transformation. A trilinear tensor operator is used to represent the 3D geometrical structure. The tensor is estimated by predicting the corresponding points using the existing affine-transformation based algorithm. The estimated tensor is used to synthesize novel views to update the appearance templates. Some experimental results using airborne video are presented.}, keywords = {3D, adaptive, affine-transformation, airborne, algorithm;, appearance, appearance-based, based, estimation;, geometrical, image, mathematical, novel, object, operator;, operators;, perspective, prediction;, processing;, recognition;, representation;, signal, structure, synthesis;, template, tensor, tensor;, tensors;, tracking;, transformation;, trilinear, updating;, video, video-based, video;, view}, doi = {10.1109/ICASSP.2004.1326619}, author = {Jie Shao and Zhou,S. K and Chellapa, Rama} } @article {15439, title = {Applying Model-based Distributed Continuous Quality Assurance Processes to Enhance Persistent Software Attributes}, journal = {IEEE Software}, volume = {21}, year = {2004}, month = {2004///}, pages = {32 - 40}, abstract = {Time and resource constraints often force developers of highlyconfigurable quality of service (QoS)-intensive software sys- tems to guarantee their system{\textquoteright}s persistent software attributes (PSAs) (e.g., functional correctness, portability, efficiency, and QoS) on very few platform configurations and to extrapolate from these configurations to the entire configuration space, which allows many sources of degradation to escape detec- tion until systems are fielded. This article illustrates how distributed continuous quality assurance (DCQA) processes help improve the assessment of these PSAs across large QoS- intensive software system configuration spaces. We also il- lustrate how model-based DCQA processes enable developers to run formally-designed screening experiments that isolate the most significant configuration options, such as different workload parameters, operating system, compiler flags, fea- ture sets, and/or run-time optimization controls. Our empir- ical results show that DCQA processes can be used monitor, safeguard, and enforce PSAs at an acceptable level of cost and effort. }, author = {Krishna,A. S and Yilmaz,C. and Memon, Atif M. and Porter, Adam and Schmidt,D. C and Gokhale,A. and Natarajan,B.} } @article {17561, title = {Approximation algorithms for partial covering problems}, journal = {Journal of Algorithms}, volume = {53}, year = {2004}, month = {2004/10//}, pages = {55 - 84}, abstract = {We study a generalization of covering problems called partial covering. Here we wish to cover only a desired number of elements, rather than covering all elements as in standard covering problems. For example, in k-partial set cover, we wish to choose a minimum number of sets to cover at least k elements. For k-partial set cover, if each element occurs in at most f sets, then we derive a primal-dual f-approximation algorithm (thus implying a 2-approximation for k-partial vertex cover) in polynomial time. Without making any assumption about the number of sets an element is in, for instances where each set has cardinality at most three, we obtain an approximation of 4/3. We also present better-than-2-approximation algorithms for k-partial vertex cover on bounded degree graphs, and for vertex cover on expanders of bounded average degree. We obtain a polynomial-time approximation scheme for k-partial vertex cover on planar graphs, and for covering k points in Rd by disks.}, keywords = {Approximation algorithms, Partial covering, Primal-dual methods, Randomized rounding, Set cover, Vertex cover}, isbn = {0196-6774}, doi = {10.1016/j.jalgor.2004.04.002}, url = {http://www.sciencedirect.com/science/article/pii/S0196677404000689}, author = {Gandhi,Rajiv and Khuller, Samir and Srinivasan, Aravind} } @article {13730, title = {Bbn/umd at duc-2004: Topiary}, journal = {Proceedings of the HLT-NAACL 2004 Document Understanding Workshop, Boston}, year = {2004}, month = {2004///}, pages = {112 - 119}, abstract = {This paper reports our results at DUC-2004 and describes our approach, im- plemented in a system called Topiary. We will show that the combination of linguistically motivated sentence com- pression with statistically selected topic terms performs better than either alone, according to some automatic summary evaluation measures. }, author = {Zajic, David and Dorr, Bonnie J and Schwartz,R.} } @conference {18020, title = {Bending light for multi-chip virtual PRAMs?}, booktitle = {Proc. 3rd Workshop on Non-Slicon Computation, held in conjunction with the 31st International Symposium on Computer Architecture (ISCA 2004)}, year = {2004}, month = {2004///}, pages = {19 - 23}, abstract = {A new paradigm for an all-to-alloptical interconnection network is presented. An interesting modeling aspect is that (limited) bending of optical communication channels is allowed. In a computer system, the paradigm could provide part of an interconnection fabric between several tens (e.g., 64) of chips comprising parallel processing elements and the first level of the cache. An optical interconnection network raises an intriguing possibility: obtain both improved performance and significant cost reduction with respect to standard serial computer system models. }, author = {Vishkin, Uzi and Smolyaninov,I.} } @conference {15901, title = {Building an information retrieval test collection for spontaneous conversational speech}, booktitle = {Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval}, series = {SIGIR {\textquoteright}04}, year = {2004}, month = {2004///}, pages = {41 - 48}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Test collections model use cases in ways that facilitate evaluation of information retrieval systems. This paper describes the use of search-guided relevance assessment to create a test collection for retrieval of spontaneous conversational speech. Approximately 10,000 thematically coherent segments were manually identified in 625 hours of oral history interviews with 246 individuals. Automatic speech recognition results, manually prepared summaries, controlled vocabulary indexing, and name authority control are available for every segment. Those features were leveraged by a team of four relevance assessors to identify topically relevant segments for 28 topics developed from actual user requests. Search-guided assessment yielded sufficient inter-annotator agreement to support formative evaluation during system development. Baseline results for ranked retrieval are presented to illustrate use of the collection.}, keywords = {assessment, Automatic speech recognition, oral history, search-guided relevance}, isbn = {1-58113-881-4}, doi = {10.1145/1008992.1009002}, url = {http://doi.acm.org/10.1145/1008992.1009002}, author = {Oard, Douglas and Soergel,Dagobert and David Doermann and Huang,Xiaoli and Murray,G. Craig and Wang,Jianqiang and Ramabhadran,Bhuvana and Franz,Martin and Gustman,Samuel and Mayfield,James and Kharevych,Liliya and Strassel,Stephanie} } @conference {18602, title = {The case for separating routing from routers}, booktitle = {Proceedings of the ACM SIGCOMM workshop on Future directions in network architecture}, series = {FDNA {\textquoteright}04}, year = {2004}, month = {2004///}, pages = {5 - 12}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Over the past decade, the complexity of the Internet{\textquoteright}s routing infrastructure has increased dramatically. This complexity and the problems it causes stem not just from various new demands made of the routing infrastructure, but also from fundamental limitations in the ability of today{\textquoteright}s distributed infrastructure to scalably cope with new requirements.The limitations in today{\textquoteright}s routing system arise in large part from the fully distributed path-selection computation that the IP routers in an autonomous system (AS) must perform. To overcome this weakness, interdomain routing should be separated from today{\textquoteright}s IP routers, which should simply forward packets (for the most part). Instead, a separate Routing Control Platform (RCP) should select routes on behalf of the IP routers in each AS and exchange reachability information with other domains.Our position is that an approach like RCP is a good way of coping with complexity while being responsive to new demands and can lead to a routing system that is substantially easier to manage than today. We present a design overview of RCP based on three architectural principles path computation based on a consistent view of network state, controlled interactions between routing protocol layers, and expressive specification of routing policies and discuss the architectural strengths and weaknesses of our proposal.}, keywords = {BGP, interdomain routing, routing architecture}, isbn = {1-58113-942-X}, doi = {10.1145/1016707.1016709}, url = {http://doi.acm.org/10.1145/1016707.1016709}, author = {Feamster, Nick and Balakrishnan,Hari and Rexford,Jennifer and Shaikh,Aman and van der Merwe,Jacobus} } @article {16249, title = {Comparative Genome Assembly}, journal = {Briefings in Bioinformatics}, volume = {5}, year = {2004}, month = {2004/09/01/}, pages = {237 - 248}, abstract = {One of the most complex and computationally intensive tasks of genome sequence analysis is genome assembly. Even today, few centres have the resources, in both software and hardware, to assemble a genome from the thousands or millions of individual sequences generated in a whole-genome shotgun sequencing project. With the rapid growth in the number of sequenced genomes has come an increase in the number of organisms for which two or more closely related species have been sequenced. This has created the possibility of building a comparative genome assembly algorithm, which can assemble a newly sequenced genome by mapping it onto a reference genome.We describe here a novel algorithm for comparative genome assembly that can accurately assemble a typical bacterial genome in less than four minutes on a standard desktop computer. The software is available as part of the open-source AMOS project.}, keywords = {Assembly, comparative genomics, open source, shotgun sequencing}, isbn = {1467-5463, 1477-4054}, doi = {10.1093/bib/5.3.237}, url = {http://bib.oxfordjournals.org/content/5/3/237}, author = {Pop, Mihai and Phillippy,Adam and Delcher,Arthur L. and Salzberg,Steven L.} } @conference {17845, title = {A Comparative Study of Spatial Indexing Techniques for Multidimensional Scientific Datasets}, booktitle = {Scientific and Statistical Database Management, International Conference on}, year = {2004}, month = {2004///}, pages = {171 - 171}, publisher = {IEEE Computer Society}, organization = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, abstract = {Scientific applications that query into very large multi-dimensional datasets are becoming more common. These datasets are growing in size every day, and are becoming truly enormous, making it infeasible to index individual data elements. We have instead been experimenting with chunking the datasets to index them, grouping data elements into small chunks of a fixed, but dataset-specific, size to take advantage of spatial locality. While spatial indexing structures based on R-trees perform reasonably well for the rectangular bounding boxes of such chunked datasets, other indexing structures based on KDB-trees, such as Hybrid trees, have been shown to perform very well for point data. In this paper, we investigate how all these indexing structures perform for multidimensional scientific datasets, and compare their features and performance with that of SH-trees, an extension of Hybrid trees, for indexing multi-dimensional rectangles. Our experimental results show that the algorithms for building and searching SH-trees outperform those for R-trees, R*-trees, and X-trees for both real application and synthetic datasets and queries. We show that the SH-tree algorithms perform well for both low and high dimensional data, and that they scale well to high dimensions both for building and searching the trees.}, doi = {http://doi.ieeecomputersociety.org/10.1109/SSDM.2004.1311209}, author = {Nam,Beomseok and Sussman, Alan} } @conference {14034, title = {Computation of Green{\textquoteright}s function for finite-size photonic crystals by boundary element method}, booktitle = {Antennas and Propagation Society International Symposium, 2004. IEEE}, volume = {4}, year = {2004}, month = {2004/06//}, pages = {4320 - 4323 Vol.4 - 4320 - 4323 Vol.4}, abstract = {We have derived a new integral equation method for computing the Green{\textquoteright}s function for 2D electromagnetic wave propagation in a finite size photonic crystal. The method is also used for deriving the multipole expansions for the case of circular cylinders. This derivation is different from the ones in the literature. Our numerical results show an excellent agreement of the two algorithms. In the future we would like to expand the method to the numerical solution of the three-dimensional electromagnetic problem.}, keywords = {2D, boundary, boundary-elements, circular, crystals;, cylinders;, electromagnetic, element, equation, equations;, expansions;, finite-size, function, function;, Green, Green{\textquoteright}s, integral, method;, methods;, multipole, photonic, propagation;, wave}, doi = {10.1109/APS.2004.1330307}, author = {Seydou,F. and Ramahi,O. and Duraiswami, Ramani and Seppdnen,T.} } @article {19626, title = {Computational experience with exterior point algorithms for the transportation problem}, journal = {Applied Mathematics and Computation}, volume = {158}, year = {2004}, month = {2004/11/05/}, pages = {459 - 475}, abstract = {An experimental computational study to compare the classical primal simplex algorithm and the exterior point algorithms for the transportation problem (TP) is presented. Totally, four algorithms are compared on uniformly randomly generated test problems. The results are very encouraging for one of the competitive algorithms. In particular, a dual forest exterior point algorithm is on average up to 4.5 times faster than network simplex algorithm on TPs of size 300 {\texttimes} 300 and for all classes. This result leads into corresponding savings in computational time. From the computational performance we conclude that as the problem size increases, exterior point algorithm get relatively faster.}, keywords = {Algorithm evaluation, Experimental computational study, Exterior point simplex algorithms, Network simplex algorithm, Transportation problem}, isbn = {0096-3003}, url = {http://www.sciencedirect.com/science/article/pii/S0096300303010294}, author = {Charalampos Papamanthou and Paparrizos, Konstantinos and Samaras, Nikolaos} } @conference {15647, title = {A computational framework for incremental motion}, booktitle = {Proceedings of the twentieth annual symposium on Computational geometry}, series = {SCG {\textquoteright}04}, year = {2004}, month = {2004///}, pages = {200 - 209}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {We propose a generic computational framework for maintaining a discrete geometric structure defined by a collection of static and mobile objects. We assume that the mobile objects move incrementally, that is, in discrete time steps. We assume that the structure to be maintained is a function of the current locations of the mobile and static objects (independent of their prior motion). Unlike other models for kinetic computation, we place no restrictions on the motion nor on its predictability.In order to handle unrestricted incremental motion, our framework is based on the coordination of two computational entities. The first is the incremental motion algorithm. It is responsible for maintaining the structure and a set of certificates, or conditions, that prove the structure{\textquoteright}s correctness. The other entity, called the motion processor, is responsible for handling all the low-level aspects of motion, including computing and/or tracking the motion of the mobile objects, answering queries about their current positions and velocities, and validating that the object motions satisfy simple motion estimates, which are generated by the incremental motion algorithm. Computational efficiency is measured in terms of the number of interactions between these two entities.}, keywords = {competitive analysis, incremental motion, kinetic data structures}, isbn = {1-58113-885-7}, doi = {10.1145/997817.997849}, url = {http://doi.acm.org/10.1145/997817.997849}, author = {Mount, Dave and Netanyahu,Nathan S. and Piatko,Christine D. and Silverman,Ruth and Wu,Angela Y.} } @conference {13281, title = {Constant-time navigation in four-dimensional nested simplicial meshes}, booktitle = {Shape Modeling Applications, 2004. Proceedings}, year = {2004}, month = {2004/06//}, pages = {221 - 230}, abstract = {We consider a recursive decomposition of a four-dimensional hypercube into a hierarchy of nested 4-dimensional simplexes, that we call pentatopes. The paper presents an algorithm for finding the neighbors of a pentatope along its five tetrahedral faces in constant time. To this aim, we develop a labeling technique for nested pentatopes that enables their identification by using location codes. The constant-time behavior is achieved through bit manipulation operations, thus avoiding traversing the simplicial hierarchy via pointer following. We discuss an application of this representation to multi-resolution representations of four-dimensional scalar fields. Extracting adaptive continuous approximations of the scalar field from such a model requires generating conforming meshes, i.e., meshes in which the pentatopes match along their tetrahedral faces. Our neighbor finding algorithm enables computing face-adjacent pentatopes efficiently.}, keywords = {4-dimensional, adaptive, algorithm;, approximations;, bit, codes;, computational, constant-time, continuous, decomposition;, face-adjacent, faces;, fields;, finding, following;, four-dimensional, generation;, geometry;, hierarchy;, hypercube;, location, manipulation, mesh, meshes;, multiresolution, navigation;, neighbor, nested, operations;, pentatopes;, pointer, recursive, representation;, scalar, simplexes;, simplicial, tetrahedral}, doi = {10.1109/SMI.2004.1314509}, author = {Lee,M. and De Floriani, Leila and Samet, Hanan} } @conference {12292, title = {A cooperative bulk transfer protocol}, booktitle = {IEEE Infocom}, year = {2004}, month = {2004///}, author = {Sherwood,R. and Braud,R. and Bhattacharjee, Bobby} } @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 {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 {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.} } @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} } @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.} } @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.} } @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} } @conference {18207, title = {Efficient bandwidth resource allocation for low-delay multiuser MPEG-4 video transmission}, booktitle = {Communications, 2004 IEEE International Conference on}, volume = {3}, year = {2004}, month = {2004/06//}, pages = {1308 - 1312 Vol.3 - 1308 - 1312 Vol.3}, abstract = {An efficient bandwidth resource allocation algorithm with low delay and low fluctuation of quality to transmit multiple MPEG-4 fine granularity scalability (FGS) video programs to multiple users is proposed in this paper. By exploring the variation in the scene complexity of each video program and jointly redistributing available system resources among users, our proposed algorithm provides low fluctuation of quality for each user and consistent quality among all users. Experimental results show that compared to a traditional look-ahead sliding-window approach, our scheme can achieve comparable perceptual quality and channel utilization at a much lower cost of delay, computation, and storage.}, keywords = {algorithm;, allocation, allocation;, approach;, Bandwidth, broadband, channel, channels;, coding;, delays;, expert, FGS;, fine, granularity, group;, look-ahead, moving, MPEG-4, multiuser, networks;, of, picture, program;, QUALITY, resource, scalability;, service;, sliding-window, transmission;, utilization;, video}, doi = {10.1109/ICC.2004.1312724}, author = {Su,Guan-Ming and M. Wu} } @article {17885, title = {Efficient Execution of Multi-Query Data Analysis Batches Using Compiler Optimization Strategies}, journal = {Languages and Compilers for Parallel Computing}, year = {2004}, month = {2004///}, abstract = {This work investigates the leverage that can be obtained from compiler optimization techniques for efficient execution of multi-query workloads in data analysis applications. Our approach is to address multi-query optimization at the algorithmic level, by transforming a declarative specification of scientific data analysis queries into a high-level imperative program that can be made more efficient by applying compiler optimization techniques. These techniques {\textendash} including loop fusion, common subexpression elimination and dead code elimination {\textendash} are employed to allow data and computation reuse across queries. We describe a preliminary experimental analysis on a real remote sensing application that analyzes very large quantities of satellite data. The results show our techniques achieve sizable reductions in the amount of computation and I/O necessary for executing query batches and in average execution times for the individual queries in a given batch.}, doi = {10.1007/978-3-540-24644-2_33}, author = {Andrade,H. and Aryangat,S. and Kurc, T. and Saltz, J. and Sussman, Alan} } @article {17687, title = {An Elsner-like perturbation theorem for generalized eigenvalues}, journal = {Linear Algebra and its Applications}, volume = {390}, year = {2004}, month = {2004/10/01/}, pages = {1 - 5}, abstract = {In 1985 Elsner established a general bound on the distance between an eigenvalue of a matrix and the closest eigenvalue of a perturbation of that matrix. In this note, we show that a similar result holds for the generalized eigenvalue problem.}, keywords = {eigenvalue, Elsner{\textquoteright}s theorem, Generalized eigenvalue, Perturbation theory}, isbn = {0024-3795}, doi = {10.1016/j.laa.2004.05.006}, url = {http://www.sciencedirect.com/science/article/pii/S0024379504002459}, author = {Stewart, G.W.} } @conference {12131, title = {Empirical-based estimation of the effect on software dependability of a technique for architecture conformance verification}, booktitle = {Proceedings of the ICSE 2004 Workshop on Architecting Dependable Systems, Edinburgh, UK}, year = {2004}, month = {2004///}, abstract = {The High Dependability Computing Program (HDCP)project is a NASA initiative for increasing dependability of software-based systems. It researches achieving high dependability by introducing new technologies. We focus on the evaluation of the effectiveness of technologies with respect to dependability. We employ empirical evaluation methods along with evaluation testbeds. In this paper, our technology evaluation approach is described. A testbed representative of air traffic control applications is used. An experiment to evaluate a technology to for identification of architectural violations is presented. }, author = {Asgari, S. and Basili, Victor R. and Costa,P. and Donzelli,P. and Hochstein, L. and Lindvall,M. and Rus,I. and Shull, F. and Tvedt,R. and Zelkowitz, Marvin V} } @article {15679, title = {End-to-end analysis of distributed video-on-demand systems}, journal = {IEEE Transactions on Multimedia}, volume = {6}, year = {2004}, month = {2004/02//}, pages = {129 - 141}, abstract = {The focus of the research presented in this paper is the end-to-end analysis of a distributed Video-on-Demand (VoD) system. We analyze the distributed architecture of a VoD system to design global request handling and admission control strategies and evaluate them using global metrics. The performance evaluation methodology developed in this paper helps in determining efficient ways of using all resources in the VoD architecture within the constraints of providing guaranteed high quality service to each request. For instance, our simulation results show that request handling policies based on limited redirection of blocked requests to other resources perform better than load sharing policies. We also show that request handling policies based on redirection have simpler connection establishment semantics than load sharing policies and, therefore, are easily incorporated into reservation or signaling protocols.}, keywords = {Admission control, admission control strategies, Analytical models, Computer science, distributed architecture, distributed video-on-demand systems, end-to-end analysis, global request handling, High-speed networks, Network servers, Next generation networking, Performance analysis, performance evaluation methodology, Protocols, request handling, reservation protocols, resource allocation, Resource management, signaling protocols, telecommunication congestion control, video on demand, Video sharing}, isbn = {1520-9210}, doi = {10.1109/TMM.2003.819757}, author = {Mundur, Padma and Simon,R. and Sood,A. K} } @conference {17593, title = {End-to-end packet-scheduling in wireless ad-hoc networks}, booktitle = {Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms}, series = {SODA {\textquoteright}04}, year = {2004}, month = {2004///}, pages = {1021 - 1030}, publisher = {Society for Industrial and Applied Mathematics}, organization = {Society for Industrial and Applied Mathematics}, address = {Philadelphia, PA, USA}, abstract = {Packet-scheduling is a particular challenge in wireless networks due to interference from nearby transmissions. A distance-2 interference model serves as a useful abstraction here, and we study packet routing and scheduling under this model. The main focus of our work is the development of fully-distributed (decentralized) protocols. We present polylogarithmic/constant factor approximation algorithms for various families of disk graphs (which capture the geometric nature of wireless-signal propagation), as well as near-optimal approximation algorithms for general graphs. The packet-scheduling work by L eighton, Maggs and Rao (Combinatorica, 1994) and a basic distributed coloring procedure, originally due to Luby (J. Computer and System Sciences, 1993), underlie many of our algorithms. Experimental work of Finocchi, Panconesi, and Silvestri (SODA 2002) showed that a natural modification of Luby{\textquoteright}s algorithm leads to improved performance, and a rigorous explanation of this was left as an open question; we prove that the modified algorithm is provably better in the worst-case. Finally, using simulations, we study the impact of the routing strategy and the choice of parameters on the performance of our distributed algorithm for unit disk graphs.}, isbn = {0-89871-558-X}, url = {http://dl.acm.org/citation.cfm?id=982792.982945}, author = {Kumar,V. S. Anil and Marathe,Madhav V. and Parthasarathy,Srinivasan and Srinivasan, Aravind} } @article {17697, title = {Error Analysis of the Quasi-Gram--Schmidt Algorithm}, volume = {UMIACS-TR-2004-17}, year = {2004}, month = {2004/04/19/}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {Let the $n{\times}p$ $(n\geq p)$ matrix $X$ have the QR~factorization$X = QR$, where $R$ is an upper triangular matrix of order $p$ and $Q$ is orthonormal. This widely used decomposition has the drawback that $Q$ is not generally sparse even when $X$ is. One cure is to discard $Q$ retaining only $X$ and $R$. Products like $a = Q\trp y = R\itp X\trp y$ can then be formed by computing $b = X\trp y$ and solving the system $R\trp a = b$. This approach can be used to modify the Gram--Schmidt algorithm for computing $Q$ and $R$ to compute $R$ without forming $Q$ or altering $X$. Unfortunately, this quasi-Gram--Schmidt algorithm can produce inaccurate results. In this paper it is shown that with reorthogonalization the inaccuracies are bounded under certain natural conditions. (UMIACS-TR-2004-17) }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/1346}, author = {Stewart, G.W.} } @conference {17155, title = {Extending the utility of treemaps with flexible hierarchy}, booktitle = {Eighth International Conference on Information Visualisation, 2004. IV 2004. Proceedings}, year = {2004}, month = {2004/07/14/16}, pages = {335 - 344}, publisher = {IEEE}, organization = {IEEE}, abstract = {Treemaps are a visualization technique for presenting hierarchical information on two-dimensional displays. Prior implementations limit the visualization to pre-defined static hierarchies. Flexible hierarchy, a new capability of Treemap 4.0, enables users to define various hierarchies through dynamically selecting a series of data attributes so that they can discover patterns, clusters and outliers. This work describes the design and implementation issues of flexible hierarchy. It then reports on a usability study, which led to enhancements to the interface.}, keywords = {2D displays, Computer displays, Computer science, data visualisation, Data visualization, Educational institutions, flexible hierarchy, graphical user interface, Graphical user interfaces, hierarchical information, Nominations and elections, Switches, Tree data structures, Tree graphs, Treemap 4.0, Two dimensional displays, usability, visualization technique}, isbn = {0-7695-2177-0}, doi = {10.1109/IV.2004.1320166}, author = {Chintalapani,G. and Plaisant, Catherine and Shneiderman, Ben} } @article {13771, title = {Extrinsic Evaluation of Automatic Metrics for Summarization}, year = {2004}, month = {2004/07/20/}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {This paper describes extrinsic-task evaluation of summarization. We show that it is possible to save time using summaries for relevance assessment without adversely impacting the degree of accuracy that would be possible with full documents. In addition, we demonstrate that the extrinsic task we have selected exhibits a high degree of interannotator agreement, i.e., consistent relevance decisions across subjects. We also conducted a composite experiment that better reflects the actual document selection process and found that using a surrogate improves the processing speed over reading the entire document. Finally, we have found a small yet statistically significant correlation between some of the intrinsic measures and a user{\textquoteright}s performance in an extrinsic task. The overall conclusion we can draw at this point is that ROUGE-1 does correlate with precision and to a somewhat lesser degree with accuracy, but that it remains to be investigated how stable these correlations are and how differences in ROUGE-1 translate into significant differences in human performance in an extrinsic task.}, keywords = {*ABSTRACTS, *ACCURACY, *DATA SUMMARIZATION, *DOCUMENT SUMMARIES, *DOCUMENTS, *READING MACHINES, *SOFTWARE METRICS, *STATISTICAL ANALYSIS, ABSTRACT SELECTION, ANNOTATIONS, Automation, COMPUTER PROGRAMMING AND SOFTWARE, COMPUTER SYSTEMS, CORRELATION TECHNIQUES, DATA PROCESSING, DOCUMENT SUMMARIES, EXTRINSIC TASKS, Information retrieval, INFORMATION SCIENCE, PERFORMANCE(HUMAN), PRECISION, RELEVANCY, ROUGE-1 COMPUTER PROGRAM, STATISTICS AND PROBABILITY, TEST AND EVALUATION}, url = {http://stinet.dtic.mil/oai/oai?\&verb=getRecord\&metadataPrefix=html\&identifier=ADA448065}, author = {Dorr, Bonnie J and Monz,Christof and Oard, Douglas and President,Stacy and Zajic, David and Schwartz,Richard} } @conference {17159, title = {Facilitating understanding of information visualizations: emerging principles and examples}, booktitle = {Eighth International Conference on Information Visualisation, 2004. IV 2004. Proceedings}, year = {2004}, month = {2004/07/14/16}, publisher = {IEEE}, organization = {IEEE}, abstract = {Summary form only given. The enthusiasm for information visualization has generated a wide variety of interesting tools for multi-dimensional, hierarchical, and other kinds of visualizations. However, some designs are readily accepted as understandable and useful, while others are perceived as confusing and useless. Controlled studies have begun to sort of some of the issues, but the insights of designers and usability tests are contributing interesting cognitive hypotheses for researchers and practical guidelines for developers. This paper offers examples of what works and what doesn{\textquoteright}t with a preliminary set of principles that might have wide applicability.}, keywords = {Computer science, data visualisation, Educational institutions, Guidelines, hierarchical visualization, HUMANS, Information Visualization, Laboratories, multidimensional visualization, Portable computers, Testing, usability, User interfaces, Visualization}, isbn = {0-7695-2177-0}, doi = {10.1109/IV.2004.1320117}, author = {Shneiderman, Ben} } @conference {18673, title = {Ferret: a host vulnerability checking tool}, year = {2004}, month = {2004/03//}, pages = {389 - 394}, abstract = {Evaluation of computing system security requires knowledge of the vulnerabilities present in the system and of potential attacks against the system. Vulnerabilities can be classified based on their location as application vulnerabilities, network vulnerabilities, or host vulnerabilities. We describe Ferret, a new software tool for checking host vulnerabilities. Ferret helps system administrators by quickly finding vulnerabilities that are present on a host. It is designed and implemented in a modular way: a different plug-in module is used for each vulnerability checked, and each possible output format is specified by a plug-in module. As a result, Ferret is extensible, and can easily be kept up-to-date through addition of checks for new vulnerabilities as they are discovered; the modular approach also makes it easy to provide specific configurations of Ferret tailored to specific operating systems or use environments. Ferret is a freely available open-source software implemented in Perl.}, keywords = {Ferret software tool, host vulnerability checking tool, open-source software, Perl, plug-in module, program verification, security auditing tool, security evaluation, security of data, software tools}, doi = {10.1109/PRDC.2004.1276595}, author = {Sharma,Anil and Martin,J.R. and Anand,N. and Michel Cukier and Sanders,W. H.} } @article {12998, title = {Few amino acid positions in {\i}t rpoB are associated with most of the rifampin resistance in {\i}t Mycobacterium tuberculosis}, journal = {BMC Bioinformatics}, volume = {5}, year = {2004}, month = {2004/09//}, pages = {137 - 137}, abstract = {BACKGROUND: Mutations in rpoB, the gene encoding the beta subunit of DNA-dependent RNA polymerase, are associated with rifampin resistance in Mycobacterium tuberculosis. Several studies have been conducted where minimum inhibitory concentration (MIC, which is defined as the minimum concentration of the antibiotic in a given culture medium below which bacterial growth is not inhibited) of rifampin has been measured and partial DNA sequences have been determined for rpoB in different isolates of M. tuberculosis. However, no model has been constructed to predict rifampin resistance based on sequence information alone. Such a model might provide the basis for quantifying rifampin resistance status based exclusively on DNA sequence data and thus eliminate the requirements for time consuming culturing and antibiotic testing of clinical isolates. RESULTS: Sequence data for amino acid positions 511-533 of rpoB and associated MIC of rifampin for different isolates of M. tuberculosis were taken from studies examining rifampin resistance in clinical samples from New York City and throughout Japan. We used tree-based statistical methods and random forests to generate models of the relationships between rpoB amino acid sequence and rifampin resistance. The proportion of variance explained by a relatively simple tree-based cross-validated regression model involving two amino acid positions (526 and 531) is 0.679. The first partition in the data, based on position 531, results in groups that differ one hundredfold in mean MIC (1.596 micrograms/ml and 159.676 micrograms/ml). The subsequent partition based on position 526, the most variable in this region, results in a > 354-fold difference in MIC. When considered as a classification problem (susceptible or resistant), a cross-validated tree-based model correctly classified most (0.884) of the observations and was very similar to the regression model. Random forest analysis of the MIC data as a continuous variable, a regression problem, produced a model that explained 0.861 of the variance. The random forest analysis of the MIC data as discrete classes produced a model that correctly classified 0.942 of the observations with sensitivity of 0.958 and specificity of 0.885. CONCLUSIONS: Highly accurate regression and classification models of rifampin resistance can be made based on this short sequence region. Models may be better with improved (and consistent) measurements of MIC and more sequence data.}, doi = {10.1186/1471-2105-5-137}, author = {Cummings, Michael P. and Segal,M. R} } @article {17165, title = {Finding governmental statistical data on the Web: A study of categorically organized links for the FedStats topics page}, journal = {Journal of the American Society for Information Science and Technology}, volume = {55}, year = {2004}, month = {2004/09/01/}, pages = {1008 - 1015}, abstract = {More than 100 U.S. governmental agencies offer links through FedStats, a centralized Web site that facilitates access to statistical tables, reports, and agencies. This and similar large collections need appropriate interfaces to guide the general public to easily and successfully find information they seek. This paper summarizes the results of 3 empirical studies of alternate organization concepts of the FedStats Topics Web page. Each study had 15 participants. The evolution from 645 alphabetically organized links, to 549 categorically organized links, to 215 categorically organized links tied to portal pages produced a steady rise in successful task completion from 15.6 to 24.4 to 42.2\%. User satisfaction also increased. We make recommendations based on these data and our observations of users.}, isbn = {1532-2890}, doi = {10.1002/asi.20052}, url = {http://onlinelibrary.wiley.com/doi/10.1002/asi.20052/abstract}, author = {Ceaparu,Irina and Shneiderman, Ben} } @article {17166, title = {Finding Governmental Statistical Data on the Web: Three Empirical Studies of the FedStats Topics Page}, journal = {Journal of the American Society for Information Science and Technology}, volume = {55}, year = {2004}, month = {2004///}, pages = {1008 - 1015}, abstract = {Governmental agencies provide statistical data on their web sites. These large collections of data need appropriate interfaces that would guide the general public, as well as the researchers, to easily and successfully find information they seek. This paper summarizes the results of three empirical studies with 15 users in each group of the FedStats Topics web page. The evolution from 645 alphabetically organized links, to 549 categorically organized links, to 215 categorically organized links tied to portal pages produced a steady rise in successful task completion from 15 \% to 28 \% to 42\%. User satisfaction also increased. We make recommendations based on these data and our observations of users.}, author = {Ceaparu,Irina and Shneiderman, Ben} } @conference {17894, title = {Flexible Control of Data Transfers between Parallel Programs}, booktitle = {Proceedings of the 5th IEEE/ACM International Workshop on Grid Computing}, series = {GRID {\textquoteright}04}, year = {2004}, month = {2004///}, pages = {226 - 234}, publisher = {IEEE Computer Society}, organization = {IEEE Computer Society}, address = {Washington, DC, USA}, abstract = {Allowing loose coupling between complex e-Science applications has many advantages, such as being able to easily incorporate new applications and to flexibly specify how the applications are connected to transfer data between them. To facilitate efficient, flexible data transfers between applications, in this paper we describe methods for making decisions at runtime about when such transfers will occur, and for flexibly specifying when data transfers are desired. We also present preliminary experimental results that measure the overheads incurred by our approach.}, isbn = {0-7695-2256-4}, doi = {10.1109/GRID.2004.31}, url = {http://dx.doi.org/10.1109/GRID.2004.31}, author = {Wu,Joe Shang-Chieh and Sussman, Alan} } @article {12715, title = {Gait-based human identification from a monocular video sequence}, journal = {Handbook on Pattern Recognition and Computer Vision}, year = {2004}, month = {2004///}, abstract = {Human gait is a spatio-temporal phenomenon that characterizes the motion char-acteristics of an individual. It is possible to detect and measure gait even in low- resolution video. In this chapter, we discuss algorithms for identifying people by their gait from a monocular video sequence. Human identification using gait, sim- ilar to text-based speaker identification, involves different individuals performing the same task and a template-matching approach is suitable for such problems. In situations where the amount of training data is limited, we demonstrate the utility of a simple width feature for gait recognition. By virtue of their determin- istic nature, template matching methods have limited noise resilience. In order to deal with noise we introduce a systematic approach to gait recognition by building representations for the structural and dynamic components of gait using exemplars and hidden Markov models (HMMs). The above methods assume that an exact side-view of the subject is available in the probe sequence. For the case when the person walks at an arbitrary angle far away from the camera we present a view invariant gait recognition algorithm which is based on synthesizing a side view of a person from an arbitrary monocular view. }, author = {Kale, A. and Sundaresan, A. and Roy Chowdhury, A.K. and Chellapa, Rama} } @article {18648, title = {A global-state-triggered fault injector for distributed system evaluation}, journal = {Parallel and Distributed Systems, IEEE Transactions on}, volume = {15}, year = {2004}, month = {2004/07//}, pages = {593 - 605}, abstract = {Validation of the dependability of distributed systems via fault injection is gaining importance because distributed systems are being increasingly used in environments with high dependability requirements. The fact that distributed systems can fail in subtle ways that depend on the state of multiple parts of the system suggests that a global-state-based fault injection mechanism should be used to validate them. However, global-state-based fault injection is challenging since it is very difficult in practice to maintain the global state of a distributed system at runtime with minimal intrusion into the system execution. We present Loki, a global-state-based fault injector, which has been designed with the goals of low intrusion, high precision, and high flexibility. Loki achieves these goals by utilizing the ideas of partial view of global state, optimistic synchronization, and offline analysis. In Loki, faults are injected based on a partial, view of the global state of the system, and a post-runtime analysis is performed to place events and injections into a single global timeline and to discard experiments with incorrect fault injections. Finally, the experiments with correct fault injections are used to estimate user-specified performance and dependability measures. A flexible measure language has been designed that facilitates the specification of a wide range of measures.}, keywords = {distributed processing, distributed system evaluation, fault tolerant computing, global-state-based fault injection mechanism, Loki, offline clock synchronization, performance evaluation, post-runtime analysis, Synchronisation, system recovery, user-specified performance}, isbn = {1045-9219}, doi = {10.1109/TPDS.2004.14}, author = {Chandra,Ramesh and Lefever,R.M. and Joshi,K.R. and Michel Cukier and Sanders,W. H.} } @article {17600, title = {Guest editors{\textquoteright} foreword: special issue: 35th annual ACM symposium on theory of computing}, journal = {Journal of Computer and System Sciences}, volume = {69}, year = {2004}, month = {2004///}, pages = {305 - 305}, author = {Khanna,S. and Srinivasan, Aravind} } @article {13783, title = {Headline evaluation experiment results}, year = {2004}, month = {2004///}, institution = {University of Maryland, College Park, MD. UMIACS-TR-2004-18}, abstract = {This technical report describes an experiment intending to show that different summarizationtechniques have an effect on human performance of an extrinsic task. The task is document selection in the context of information retrieval. We conclude that the task was too difficult and ambiguous for subjects to perform at the level required in order to make statistically significant claims about the relationship between summarization techniques and human performance. An alternate interpretation of the experimental results is described and plans for future experiments are discussed. }, author = {Zajic, David and Dorr, Bonnie J and Schwartz,R. and President,S.} } @conference {12287, title = {Hierarchical routing with soft-state replicas in TerraDir}, booktitle = {Parallel and Distributed Processing Symposium, 2004. Proceedings. 18th International}, year = {2004}, month = {2004/04//}, pages = {48 - 48}, abstract = {Summary form only given. Recent work on peer-to-peer systems has demonstrated the ability to deliver low latencies and good load balance when demand for data is relatively uniform. We describe an adaptive replication protocol that delivers low latencies, good load balance even when demand is heavily skewed. The protocol can withstand arbitrary and instantaneous changes in demand distribution. Our approach also addresses classical concerns related to topological constraints of asymmetrical namespaces, such as hierarchical bottlenecks in the context of hierarchical namespaces. The protocol replicates routing state in an ad-hoc manner based on profiled information, is lightweight, scalable, and requires no replica consistency guarantees.}, keywords = {ad-hoc, adaptive, allocation;, asymmetrical, balancing;, bottlenecks;, consistency, constraints;, delivering;, demand, distribution;, guarantees;, hierarchical, latency, load, low, namespaces;, peer-to-peer, protocol;, protocols;, replica, replicas;, replication, resource, routing;, soft-state, systems;, TerraDir;, topological}, doi = {10.1109/IPDPS.2004.1302967}, author = {Silaghi,B. and Gopalakrishnan,Vijay and Bhattacharjee, Bobby and Kelcher,P.} } @article {16239, title = {Hierarchical Scaffolding With Bambus}, journal = {Genome Research}, volume = {14}, year = {2004}, month = {2004/01/01/}, pages = {149 - 159}, abstract = {The output of a genome assembler generally comprises a collection of contiguous DNA sequences (contigs) whose relative placement along the genome is not defined. A procedure called scaffolding is commonly used to order and orient these contigs using paired read information. This ordering of contigs is an essential step when finishing and analyzing the data from a whole-genome shotgun project. Most recent assemblers include a scaffolding module; however, users have little control over the scaffolding algorithm or the information produced. We thus developed a general-purpose scaffolder, called Bambus, which affords users significant flexibility in controlling the scaffolding parameters. Bambus was used recently to scaffold the low-coverage draft dog genome data. Most significantly, Bambus enables the use of linking data other than that inferred from mate-pair information. For example, the sequence of a completed genome can be used to guide the scaffolding of a related organism. We present several applications of Bambus: support for finishing, comparative genomics, analysis of the haplotype structure of genomes, and scaffolding of a mammalian genome at low coverage. Bambus is available as an open-source package from our Web site.}, doi = {10.1101/gr.1536204}, url = {http://genome.cshlp.org/content/14/1/149.abstract}, author = {Pop, Mihai and Kosack,Daniel S. and Salzberg,Steven L.} } @article {18905, title = {HTN planning for Web Service composition using SHOP2}, journal = {Web Semantics: Science, Services and Agents on the World Wide Web}, volume = {1}, year = {2004}, month = {2004/10//}, pages = {377 - 396}, abstract = {Automated composition of Web Services can be achieved by using AI planning techniques. Hierarchical Task Network (HTN) planning is especially well-suited for this task. In this paper, we describe how HTN planning system SHOP2 can be used with OWL-S Web Service descriptions. We provide a sound and complete algorithm to translate OWL-S service descriptions to a SHOP2 domain. We prove the correctness of the algorithm by showing the correspondence to the situation calculus semantics of OWL-S. We implemented a system that plans over sets of OWL-S descriptions using SHOP2 and then executes the resulting plans over the Web. The system is also capable of executing information-providing Web Services during the planning process. We discuss the challenges and difficulties of using planning in the information-rich and human-oriented context of Web Services.}, keywords = {HTN planning, OWL-S, SHOP2, Web Service composition, Web services}, isbn = {1570-8268}, doi = {10.1016/j.websem.2004.06.005}, url = {http://www.sciencedirect.com/science/article/pii/S1570826804000113}, author = {Sirin,Evren and Parsia,Bijan and Wu,Dan and Hendler,James and Nau, Dana S.} } @conference {17202, title = {Human needs and mobile technologies: small, fast, and fun}, booktitle = {Proceedings of the 2nd international conference on Mobile systems, applications, and services}, series = {MobiSys {\textquoteright}04}, year = {2004}, month = {2004///}, pages = {1 - 1}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {The central thesis of "Leonardo{\textquoteright}s Laptop" (MIT Press, 2002) is that designers who are sensitive to human needs are more likely to make the breakthroughs that yield new technologies successes. Therefore, a theory of mobile devices would focus on compact devices that support human relationships, provide salient information, and enable creative expression. The foundations are not only the megahertz of connectivity, but also the usability and universality of interfaces. Demonstrations include digital photo applications, personal info, healthcare, and e-commerce.}, isbn = {1-58113-793-1}, doi = {10.1145/990064.990065}, url = {http://doi.acm.org/10.1145/990064.990065}, author = {Shneiderman, Ben} } @article {15875, title = {iCLEF 2003 at Maryland: Translation selection and document selection}, journal = {Comparative Evaluation of Multilingual Information Access Systems}, year = {2004}, month = {2004///}, pages = {231 - 265}, author = {Dorr, Bonnie J and He,D. and Luo,J. and Oard, Douglas and Schwartz,R. and Wang,J. and Zajic, David} } @inbook {13787, title = {iCLEF 2003 at Maryland: Translation Selection and Document Selection}, booktitle = {Comparative Evaluation of Multilingual Information Access SystemsComparative Evaluation of Multilingual Information Access Systems}, series = {Lecture Notes in Computer Science}, volume = {3237}, year = {2004}, month = {2004///}, pages = {231 - 265}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {Maryland performed two sets of experiments for the 2003 Cross-Language Evaluation Forum{\textquoteright}s interactive track, one focused on interactive selection of appropriate translations for query terms, the second focused on interactive selection of relevant documents. Translation selection was supported using possible synonyms discovered through back translation and two techniques for generating KeyWord In Context (KWIC) examples of usage. The results indicate that searchers typically achieved a similar search effectiveness using fewer query iterations when interactive translation selection was available. For document selection, a complete extract of the first 40 words of each news story was compared to a compressed extract generated using an automated parse-and-trim approach that approximates one way in which people can produce headlines. The results indicate that compressed {\textquotedblleft}headlines{\textquotedblright} result in faster assessment, but with a 20\% relative reduction in the F α = 0.8 search effectiveness measure.}, isbn = {978-3-540-24017-4}, url = {http://dx.doi.org/10.1007/978-3-540-30222-3_42}, author = {Dorr, Bonnie J and He,Daqing and Luo,Jun and Oard, Douglas and Schwartz,Richard and Wang,Jianqiang and Zajic, David}, editor = {Peters,Carol and Gonzalo,Julio and Braschler,Martin and Kluck,Michael} } @article {12690, title = {Identification of humans using gait}, journal = {Image Processing, IEEE Transactions on}, volume = {13}, year = {2004}, month = {2004/09//}, pages = {1163 - 1173}, abstract = {We propose a view-based approach to recognize humans from their gait. Two different image features have been considered: the width of the outer contour of the binarized silhouette of the walking person and the entire binary silhouette itself. To obtain the observation vector from the image features, we employ two different methods. In the first method, referred to as the indirect approach, the high-dimensional image feature is transformed to a lower dimensional space by generating what we call the frame to exemplar (FED) distance. The FED vector captures both structural and dynamic traits of each individual. For compact and effective gait representation and recognition, the gait information in the FED vector sequences is captured in a hidden Markov model (HMM). In the second method, referred to as the direct approach, we work with the feature vector directly (as opposed to computing the FED) and train an HMM. We estimate the HMM parameters (specifically the observation probability B) based on the distance between the exemplars and the image features. In this way, we avoid learning high-dimensional probability density functions. The statistical nature of the HMM lends overall robustness to representation and recognition. The performance of the methods is illustrated using several databases.}, keywords = {Automated;Reproducibility of Results;Sensitivity and Specificity;Signal Processing, binary silhouette;frame to exemplar distance;gait databases;gait recognition;hidden Markov model;human identification;image features;observation probability;observation vector;hidden Markov models;image recognition;image representation;image sequences;pro, Biological;Models, Computer-Assisted;Models, Computer-Assisted;Subtraction Technique;Task Performance and Analysis;Video Recording;, Statistical;Pattern Recognition}, isbn = {1057-7149}, doi = {10.1109/TIP.2004.832865}, author = {Kale, A. and Sundaresan, A. and Rajagopalan, AN and Cuntoor, N.P. and Roy-Chowdhury, A.K. and Kruger, V. and Chellapa, Rama} } @conference {18225, title = {Image hashing resilient to geometric and filtering operations}, booktitle = {Multimedia Signal Processing, 2004 IEEE 6th Workshop on}, year = {2004}, month = {2004/10/01/sept}, pages = {355 - 358}, abstract = {Image hash functions provide compact representations of images, which is useful for search and authentication applications. In this work, we have identified a general three step framework and proposed a new image hashing scheme that achieves a better overall performance than the existing approaches under various kinds of image processing distortions. By exploiting the properties of discrete polar Fourier transform and incorporating cryptographic keys, the proposed image hash is resilient to geometric and filtering operations, and is secure against guessing and forgery attacks.}, keywords = {compact, cryptographic, cryptography;, discrete, distortion;, Filtering, Fourier, function;, geometric, hash, image, key, key;, operation;, polar, PROCESSING, public, representation;, theory;, transform;, transforms;}, doi = {10.1109/MMSP.2004.1436566}, author = {Swaminathan,A. and Mao,Yinian and M. Wu} } @article {16115, title = {Immediate usability: a case study of public access design for a community photo library}, journal = {Interacting with Computers}, volume = {16}, year = {2004}, month = {2004/12//}, pages = {1171 - 1193}, abstract = {This paper describes a novel instantiation of a digital photo library in a public access system. It demonstrates how designers can utilize characteristics of a target user community (social constraints, trust, and a lack of anonymity) to provide capabilities, such as unrestricted annotation and uploading of photos, which would be impractical in other types of public access systems. It also presents a compact set of design principles and guidelines for ensuring the immediate usability of public access information systems. These principles and guidelines were derived from our experience developing PhotoFinder Kiosk, a community photo library. Attendees of a major HCI conference (CHI 2001 Conference on Human Factors in Computing Systems) successfully used the tool to browse and annotate collections of photographs spanning 20 years of HCI-related conferences, producing a richly annotated photo history of the field of human{\textendash}computer interaction. Observations and usage log data were used to evaluate the tool and develop the guidelines. They provide specific guidance for practitioners, as well as a useful framework for additional research in public access interfaces.}, keywords = {Casual use, Community photo library, direct annotation, direct manipulation, Drag-and-drop, Group annotation, Immediate usability, Photo collection, Public access system, Walk-up-and-use, Zero-trial learning}, isbn = {0953-5438}, doi = {10.1016/j.intcom.2004.07.005}, url = {http://www.sciencedirect.com/science/article/pii/S0953543804000840}, author = {Kules,Bill and Kang,Hyunmo and Plaisant, Catherine and Rose,Anne and Shneiderman, Ben} } @conference {17806, title = {Implementing stable semantics by linear programming}, booktitle = {Logic Programming and Non-Monotonic Reasoning, Proceedings of the Second International Workshop}, volume = {7}, year = {2004}, month = {2004///}, pages = {23 - 42}, author = {Bell,C. and Nerode,A. and Ng,R. T and V.S. Subrahmanian} } @conference {16887, title = {Importing abstract spatial data into the SAND database system}, booktitle = {Proceedings of the 2004 annual national conference on Digital government research}, series = {dg.o {\textquoteright}04}, year = {2004}, month = {2004///}, pages = {62:1{\textendash}62:2 - 62:1{\textendash}62:2}, publisher = {Digital Government Society of North America}, organization = {Digital Government Society of North America}, abstract = {The World Wide Web has opened ways to operate large applications by users with simple client platforms located half way around the world by connecting servers around the world together. We present a system that makes a centrally stored spatial database available to off-site users. Regardless of the specific platform available to a user, all they need to do is simply establish a link between their client and the server. Unlike well-known web-based services such as MapQuest [2] that rely on computational power of the server, our system distributes the workload among the client and the server in such a manner that the user will observe the system as being interactive, with minimal delay between the user action and appropriate response for most types of operations.}, url = {http://dl.acm.org/citation.cfm?id=1124191.1124253}, author = {Samet, Hanan and Brabec,Frantisek and Sankaranarayanan,Jagan} } @article {13227, title = {Improved Multiuser Detectors Employing Genetic Algorithms in a Space-Time Block Coded System, Yinggang Du and Kam Tai Chan}, journal = {Signal}, volume = {2004}, year = {2004}, month = {2004///}, pages = {640 - 648}, author = {Self-Similarity,G.R.U.I. and BenAbdelkader,C. and Cutler,R.G. and Davis, Larry S. and Local,F.R.U. and Global Features,J.H. and Yuen, P.C. and Lai,JH and Li,C.} } @article {17808, title = {Improving performance of heterogeneous agents}, journal = {Annals of Mathematics and Artificial Intelligence}, volume = {41}, year = {2004}, month = {2004///}, pages = {339 - 395}, author = {\textbackslash{\"O}zcan,F. and V.S. Subrahmanian and Dix,J.} } @conference {16308, title = {Improving the Quality of Performance-intensive Software via Model-integrated Distributed Continuous Quality Assurance}, booktitle = {Proceedings of the 8th International Conference on Software Reuse}, year = {2004}, month = {2004///}, author = {Krishna,A. S and Schmidt,D. C and Porter, Adam and Memon, Atif M. and Sevilla-Ruiz,D.} } @conference {16886, title = {Indexing distributed complex data for complex queries}, booktitle = {Proceedings of the 2004 annual national conference on Digital government research}, series = {dg.o {\textquoteright}04}, year = {2004}, month = {2004///}, pages = {63:1{\textendash}63:10 - 63:1{\textendash}63:10}, publisher = {Digital Government Society of North America}, organization = {Digital Government Society of North America}, abstract = {Peer-to-peer networks are becoming a common form of online data exchange. Querying data, mostly files, using keywords on peer-to-peer networks is well-known. But users cannot perform many types of queries on complex data and on many of the attributes of the data on such networks other than mostly exact-match queries. We introduce a distributed hashing-based index for enabling more powerful accesses on complex data over peer-to-peer networks that we expect to be commonly deployed for digital government applications. Preliminary experiments show that our index scales well and we believe that it can be extended to obtain similar indices for many other data types for performing various complex queries, such as range queries.}, url = {http://dl.acm.org/citation.cfm?id=1124191.1124254}, author = {Tanin,Egemen and Harwood,Aaron and Samet, Hanan} } @inbook {18909, title = {Information Gathering During Planning for Web Service Composition}, booktitle = {The Semantic Web {\textendash} ISWC 2004}, series = {Lecture Notes in Computer Science}, volume = {3298}, year = {2004}, month = {2004///}, pages = {335 - 349}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {Hierarchical Task-Network (HTN) based planning techniques have been applied to the problem of composing Web Services, especially when described using the OWL - S service ontologies. Many of the existing Web Services are either exclusively information providing or crucially depend on information-providing services. Thus, many interesting service compositions involve collecting information either during execution or during the composition process itself. In this paper, we focus on the latter issue. In particular, we present ENQUIRER , an HTN-planning algorithm designed for planning domains in which the information about the initial state of the world may not be complete, but it is discoverable through plan-time information-gathering queries. We have shown that ENQUIRER is sound and complete, and derived several mathematical relationships among the amount of available information, the likelihood of the planner finding a plan, and the quality of the plan found. We have performed experimental tests that confirmed our theoretical results and that demonstrated how ENQUIRER can be used in Web Service composition.}, keywords = {Computer science}, isbn = {978-3-540-23798-3}, url = {http://www.springerlink.com/content/v829m5080fc0bpng/abstract/}, author = {Kuter,Ugur and Sirin,Evren and Nau, Dana S. and Parsia,Bijan and Hendler,James}, editor = {McIlraith,Sheila and Plexousakis,Dimitris and van Harmelen,Frank} } @article {15850, title = {Interactive cross-language document selection}, journal = {information retrieval}, volume = {7}, year = {2004}, month = {2004///}, pages = {205 - 228}, author = {Oard, Douglas and Gonzalo,J. and Sanderson,M. and L{\'o}pez-Ostenero,F. and Wang,J.} } @article {17260, title = {Interactively Optimizing Signal-to-Noise Ratios in Expression Profiling: Project-Specific Algorithm Selection and Detection P-Value Weighting in Affymetrix Microarrays}, journal = {BioinformaticsBioinformatics}, volume = {20}, year = {2004}, month = {2004/11/01/}, pages = {2534 - 2544}, abstract = {Motivation: The most commonly utilized microarrays for mRNA profiling (Affymetrix) include {\textquoteleft}probe sets{\textquoteright} of a series of perfect match and mismatch probes (typically 22 oligonucleotides per probe set). There are an increasing number of reported {\textquoteleft}probe set algorithms{\textquoteright} that differ in their interpretation of a probe set to derive a single normalized {\textquoteleft}signal{\textquoteright} representative of expression of each mRNA. These algorithms are known to differ in accuracy and sensitivity, and optimization has been done using a small set of standardized control microarray data. We hypothesized that different mRNA profiling projects have varying sources and degrees of confounding noise, and that these should alter the choice of a specific probe set algorithm. Also, we hypothesized that use of the Microarray Suite (MAS) 5.0 probe set detection p-value as a weighting function would improve the performance of all probe set algorithms.Results: We built an interactive visual analysis software tool (HCE2W) to test and define parameters in Affymetrix analyses that optimize the ratio of signal (desired biological variable) versus noise (confounding uncontrolled variables). Five probe set algorithms were studied with and without statistical weighting of probe sets using the MAS 5.0 probe set detection p-values. The signal-to-noise ratio optimization method was tested in two large novel microarray datasets with different levels of confounding noise, a 105 sample U133A human muscle biopsy dataset (11 groups: mutation-defined, extensive noise), and a 40 sample U74A inbred mouse lung dataset (8 groups: little noise). Performance was measured by the ability of the specific probe set algorithm, with and without detection p-value weighting, to cluster samples into the appropriate biological groups (unsupervised agglomerative clustering with F-measure values). Of the total random sampling analyses, 50\% showed a highly statistically significant difference between probe set algorithms by ANOVA [F(4,10) > 14, p < 0.0001], with weighting by MAS 5.0 detection p-value showing significance in the mouse data by ANOVA [F(1,10) > 9, p < 0.013] and paired t-test [t(9) = -3.675, p = 0.005]. Probe set detection p-value weighting had the greatest positive effect on performance of dChip difference model, ProbeProfiler and RMA algorithms. Importantly, probe set algorithms did indeed perform differently depending on the specific project, most probably due to the degree of confounding noise. Our data indicate that significantly improved data analysis of mRNA profile projects can be achieved by optimizing the choice of probe set algorithm with the noise levels intrinsic to a project, with dChip difference model with MAS 5.0 detection p-value continuous weighting showing the best overall performance in both projects. Furthermore, both existing and newly developed probe set algorithms should incorporate a detection p-value weighting to improve performance. Availability: The Hierarchical Clustering Explorer 2.0 is available at http://www.cs.umd.edu/hcil/hce/. Murine arrays (40 samples) are publicly available at the PEPR resource (http://microarray.cnmcresearch.org/pgadatatable.asp; http://pepr.cnmcresearch.org; Chen et al., 2004). }, isbn = {1367-4803, 1460-2059}, doi = {10.1093/bioinformatics/bth280}, url = {http://bioinformatics.oxfordjournals.org/content/20/16/2534}, author = {Seo,Jinwook and Bakay,Marina and Chen,Yi-Wen and Hilmer,Sara and Shneiderman, Ben and Hoffman,Eric P} } @inbook {13795, title = {Interlingual Annotation for MT Development}, booktitle = {Machine Translation: From Real Users to ResearchMachine Translation: From Real Users to Research}, series = {Lecture Notes in Computer Science}, volume = {3265}, year = {2004}, month = {2004///}, pages = {236 - 245}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {MT systems that use only superficial representations, including the current generation of statistical MT systems, have been successful and useful. However, they will experience a plateau in quality, much like other {\textquotedblleft}silver bullet{\textquotedblright} approaches to MT. We pursue work on the development of interlingual representations for use in symbolic or hybrid MT systems. In this paper, we describe the creation of an interlingua and the development of a corpus of semantically annotated text, to be validated in six languages and evaluated in several ways. We have established a distributed, well-functioning research methodology, designed a preliminary interlingua notation, created annotation manuals and tools, developed a test collection in six languages with associated English translations, annotated some 150 translations, and designed and applied various annotation metrics. We describe the data sets being annotated and the interlingual (IL) representation language which uses two ontologies and a systematic theta-role list. We present the annotation tools built and outline the annotation process. Following this, we describe our evaluation methodology and conclude with a summary of issues that have arisen.}, isbn = {978-3-540-23300-8}, url = {http://dx.doi.org/10.1007/978-3-540-30194-3_26}, author = {Reeder,Florence and Dorr, Bonnie J and Farwell,David and Habash,Nizar and Helmreich,Stephen and Hovy,Eduard and Levin,Lori and Mitamura,Teruko and Miller,Keith and Rambow,Owen and Siddharthan,Advaith}, editor = {Frederking,Robert and Taylor,Kathryn} } @inbook {15766, title = {Left-Brain/Right-Brain Multi-Document Summarization}, booktitle = {DUC 04 Conference ProceedingsDUC 04 Conference Proceedings}, year = {2004}, month = {2004///}, publisher = {U.S. National Inst. of Standards and Technology}, organization = {U.S. National Inst. of Standards and Technology}, url = {\tt http://duc.nist.gov/}, author = {Conroy,John M. and Schlesinger,Judith D. and Goldstein,Jade and O{\textquoteright}Leary, Dianne P.} } @conference {13705, title = {A lexically-driven algorithm for disfluency detection}, booktitle = {Proceedings of HLT-NAACL 2004: Short Papers}, series = {HLT-NAACL-Short {\textquoteright}04}, year = {2004}, month = {2004///}, pages = {157 - 160}, publisher = {Association for Computational Linguistics}, organization = {Association for Computational Linguistics}, address = {Stroudsburg, PA, USA}, abstract = {This paper describes a transformation-based learning approach to disfluency detection in speech transcripts using primarily lexical features. Our method produces comparable results to two other systems that make heavy use of prosodic features, thus demonstrating that reasonable performance can be achieved without extensive prosodic cues. In addition, we show that it is possible to facilitate the identification of less frequently disfluent discourse markers by taking speaker style into account.}, isbn = {1-932432-24-8}, url = {http://dl.acm.org/citation.cfm?id=1613984.1614024}, author = {Snover,Matthew and Dorr, Bonnie J and Schwartz,Richard} } @conference {18881, title = {A logic of motion}, year = {2004}, month = {2004///}, pages = {85 - 94}, abstract = {There are numerous applications such as air traffic manage- ment, cellular phone location tracking, and vehicle protection systems where there is a critical need to reason about moving objects. In this paper, we propose a formal logic of motion (LOM for short). We provide a formal syntax for LOM, as well as a model theory for LOM. In addition, we develop al- gorithms to check consistency of LOM theories, as well as to answer certain kinds of queries posed to LOM theories. We have implemented these algorithms in a prototype LOM sys- tem - we describe experiments showing that such queries can be efficiently executed in practice.}, url = {http://www.aaai.org/Papers/KR/2004/KR04-011.pdf}, author = {Yaman,F. and Nau, Dana S. and V.S. Subrahmanian} } @article {17804, title = {Maintaining RDF views}, year = {2004}, month = {2004///}, institution = {Tech. Rep. CS-TR-4612 (UMIACS-TR-2004-54)}, abstract = {Resource Description Framework (RDF) has been recommended bythe World Wide Web Consortium for integrating web data. RDF specifications are increasingly being stored in RDF databases. Many applications will maintain views over RDF databases {\textendash} these views may describe resources of interest to the owner of the views. As data about the resources available on the web is subject to frequent change, there is a need to incrementally maintain such views. We present algorithms to maintain materialized RDF views when data is inserted into, deleted from, or modified in RDF database instances. We have developed a prototype of our algorithms. For each of these three cases, we compare the performance of our algorithm against the naive approach of storing RDF data in a relational database and using the standard view maintenance algorithm }, author = {Deng,Y. and Hung,E. and V.S. Subrahmanian} } @inbook {16889, title = {Maintenance of Spatial Semijoin Queries on Moving Points}, booktitle = {Proceedings 2004 VLDB ConferenceProceedings 2004 VLDB Conference}, year = {2004}, month = {2004///}, pages = {828 - 839}, publisher = {Morgan Kaufmann}, organization = {Morgan Kaufmann}, address = {St Louis}, abstract = {In this paper, we address the maintenance of spatial semijoin queries over continuously moving points, where points are modeled as linear functions of time. This is analogous to the maintenance of a materialized view except, as time advances, the query result may change independently of updates. As in a materialized view, we assume there is no prior knowledge of updates before they occur. We present a new approach, continuous fuzzy sets (CFS), to maintain continuous spatial semijoins efficiently. CFS is compared experimentally to a simple scaling of previous work. The result is significantly better performance of CFS compared to previous work by up to an order of magnitude in some cases.}, isbn = {978-0-12-088469-8}, url = {http://www.sciencedirect.com/science/article/pii/B9780120884698500735}, author = {Iwerks,Glenn S. and Samet, Hanan and Smith,Kenneth P.} } @article {15861, title = {Mandarin-English Information (MEI): investigating translingual speech retrieval}, journal = {Computer Speech \& Language}, volume = {18}, year = {2004}, month = {2004/04//}, pages = {163 - 179}, abstract = {This paper describes the Mandarin{\^a}{\texteuro}{\textquotedblleft}English Information (MEI) project, where we investigated the problem of cross-language spoken document retrieval (CL-SDR), and developed one of the first English{\^a}{\texteuro}{\textquotedblleft}Chinese CL-SDR systems. Our system accepts an entire English news story (text) as query, and retrieves relevant Chinese broadcast news stories (audio) from the document collection. Hence, this is a cross-language and cross-media retrieval task. We applied a multi-scale approach to our problem, which unifies the use of phrases, words and subwords in retrieval. The English queries are translated into Chinese by means of a dictionary-based approach, where we have integrated phrase-based translation with word-by-word translation. Untranslatable named entities are transliterated by a novel subword translation technique. The multi-scale approach can be divided into three subtasks {\^a}{\texteuro}{\textquotedblleft} multi-scale query formulation, multi-scale audio indexing (by speech recognition) and multi-scale retrieval. Experimental results demonstrate that the use of phrase-based translation and subword translation gave performance gains, and multi-scale retrieval outperforms word-based retrieval.}, keywords = {English{\^a}{\texteuro}{\textquotedblleft}Chinese cross-language spoken document retrieval, Multi-scale spoken document retrieval}, isbn = {0885-2308}, doi = {10.1016/j.csl.2003.09.003}, url = {http://www.sciencedirect.com/science/article/pii/S0885230803000524}, author = {Meng,Helen M. and Chen,Berlin and Khudanpur,Sanjeev and Levow,Gina-Anne and Lo,Wai-Kit and Oard, Douglas and Schone,Patrick and Tang,Karen and Wang,Hsin-Min and Wang,Jianqiang} } @article {17800, title = {MASS: Multiagent Security and Survivability}, journal = {Monitoring, Security and Rescue Techniques in Multiagent Systems}, year = {2004}, month = {2004///}, pages = {112 - 112}, abstract = {Multiagent applications are not likely to be very useful in thereal world if they are unable to ensure the security and survivability of agents in the multiagent system. In this talk, I will focus on survivabil- ity of MASs and present a set of architectures that can greatly enhance survivability of MASs. I will discuss the advantages and disadvantages of the architectures and discuss their impact on scalability of the MAS applications. The talk reflects joint work with S. Kraus, C. Tas and Y. Zhang. }, author = {V.S. Subrahmanian} } @conference {12291, title = {Measurement based optimal multi-path routing}, booktitle = {INFOCOM 2004. Twenty-third AnnualJoint Conference of the IEEE Computer and Communications Societies}, volume = {1}, year = {2004}, month = {2004/03//}, pages = {187 - 196}, abstract = {We propose a new architecture for efficient network monitoring and measurements in a traditional IP network. This new architecture enables establishment of multiple paths (tunnels) between source-destination pairs without having to modify the underlying routing protocol(s). Based on the proposed architecture we propose a measurement-based multipath routing algorithm derived from simultaneous perturbation stochastic approximation. The proposed algorithm does not assume that the gradient of analytical cost function is known to the algorithm, but rather relies on noisy estimates from measurements. Using the analytical model presented in the paper we prove the convergence of the algorithm to the optimal solution. Simulation results are presented to demonstrate the advantages of the proposed algorithm under a variety of network scenarios. A comparative study with an existing optimal routing algorithm, MATE, is also provided}, keywords = {algorithm;network, approximation;routing, IP, measurement;network, monitoring;optimization;perturbation, multipath, network;measurement-based, networks;Internet;optimisation;routing, processes;, protocol;IP, protocols;stochastic, Routing, Stochastic}, doi = {10.1109/INFCOM.2004.1354493}, author = {Guven,T. and Kommareddy,C. and La,R.J. and Shayman,M.A. and Bhattacharjee, Bobby} } @article {17624, title = {Method of designing signaling networks for internet telephony}, volume = {:~09/517,658}, year = {2004}, month = {2004/02/03/}, abstract = {A method is disclosed for designing a signaling network of call coordinators (CCs) for internet telephony. The new method can be used to design a CC network of arbitrary size that satisfies, with high probability, limitations on the maximum number of sockets per CC and on the maximum number of hops between an arbitrary pair of switches in the network. According to the disclosed method, the network of CCs is treated initially as a collection of isolated points, one point for each CC. Then, links are added between pairs of CCs, excluding pairs lying within the same switch. The links are added randomly, but with a particular probability p, which may be different for different pairs. Thus, whether a given link is added depends, in effect, upon the outcome of a loaded coin toss in which the probability of a positive outcome is p.}, url = {http://www.google.com/patents?id=VTsSAAAAEBAJ}, author = {Aravamudan,Murali and Kumaran,Krishnan and Ramakrishnan,Kajamalai Gopalaswamy and Srinivasan, Aravind}, editor = {Lucent Technologies Inc.} } @conference {13902, title = {Mixing ideas: a new technique for working with young children as design partners}, booktitle = {Proceedings of the 2004 conference on Interaction design and children: building a community}, year = {2004}, month = {2004///}, pages = {35 - 42}, author = {Guha,M.L. and Druin, Allison and Chipman,G. and Fails,J. A and Simms,S. and Farber,A.} } @article {15446, title = {Model-Based Approaches-Validating Quality of Service for Reusable Software Via Model-Integrated Distributed Continuous Quality Assurance}, journal = {Lecture Notes in Computer Science}, volume = {3107}, year = {2004}, month = {2004///}, pages = {286 - 295}, author = {Krishna,A. S and Schmidt,D. C and Memon, Atif M. and Porter, Adam and Sevilla,D.} } @article {15454, title = {A Model-based Distributed Continuous Quality Assurance Process to Enhance the Quality of Service of Evolving Performance-intensive Software Systems}, journal = {Proceedings of the 2nd ICSE Workshop on Remote Analysis and Measurement of Software Systems (RAMSS), Edinburgh, Scotland, UK}, year = {2004}, month = {2004///}, abstract = {Performance-intensive software, such as that found in high-perfo-rmance computing systems and distributed real-time and embedded systems, increasingly executes on a multitude of platforms and user contexts. To ensure that performance-intensive software meets its quality of service (QoS) requirements, it must often be fine-tuned to specific platforms/contexts by adjusting many (in some cases hun- dreds of) configuration options. Developers who write these types of systems must therefore try to ensure that their additions and mod- ifications work across this large configuration space. In practice, however, time and resource constraints often force developers to assess performance on very few configurations and to extrapolate from these to the entire configuration space, which allows many performance bottlenecks and sources of QoS degradation to escape detection until systems are fielded. To improve the assessment of performance across large config- uration spaces, we present a model-based approach to develop- ing and deploying a new distributed continuous quality assurance (DCQA) process. Our approach builds upon and extends the Skoll environment, which is developing and validating novel software QA processes and tools that leverage the extensive computing resources of worldwide user communities in a distributed, continuous man- ner to significantly and rapidly improve software quality. This pa- per describes how our new DCQA performance assessment process enables developers to run formally-designed screening experiments that isolate the most significant options. After that, exhaustive ex- periments (on the now much smaller configuration space) are con- ducted. We implemented this process using model-based software tools and executed it in the Skoll environment to demonstrate its ef- fectiveness via two experiments on widely used QoS-enabled mid- dleware. Our results show that model-based DCQA processes im- proves developer insight into the effect of system changes on per- formance at an acceptable cost. }, author = {Yilmaz,C. and Krishna,A. S and Memon, Atif M. and Porter, Adam and Schmidt,D. C and Gokhale,A. and Natarajan,B.} } @article {17626, title = {Modelling disease outbreaks in realistic urban social networks}, journal = {Nature}, volume = {429}, year = {2004}, month = {2004/05/13/}, pages = {180 - 184}, abstract = {Most mathematical models for the spread of disease use differential equations based on uniform mixing assumptions1 or ad hoc models for the contact process2, 3, 4. Here we explore the use of dynamic bipartite graphs to model the physical contact patterns that result from movements of individuals between specific locations. The graphs are generated by large-scale individual-based urban traffic simulations built on actual census, land-use and population-mobility data. We find that the contact network among people is a strongly connected small-world-like5 graph with a well-defined scale for the degree distribution. However, the locations graph is scale-free6, which allows highly efficient outbreak detection by placing sensors in the hubs of the locations network. Within this large-scale simulation framework, we then analyse the relative merits of several proposed mitigation strategies for smallpox spread. Our results suggest that outbreaks can be contained by a strategy of targeted vaccination combined with early detection without resorting to mass vaccination of a population.}, isbn = {0028-0836}, doi = {10.1038/nature02541}, url = {http://www.nature.com/nature/journal/v429/n6988/full/nature02541.html}, author = {Eubank,Stephen and Guclu,Hasan and Kumar,V. S. Anil and Marathe,Madhav V. and Srinivasan, Aravind and Toroczkai,Zolt|[aacute]|n and Wang,Nan} } @article {17296, title = {Motivating annotation for digital photographs: Lowering barriers while raising incentives}, year = {2004}, month = {2004///}, abstract = {Frameworks for understanding annotation requirements could guide improved strategies that would motivate more users to invest the necessary effort. We propose one framework for annotation techniques along with the st rengths and weaknesses of each one, and a second framework for target user groups and their motivations. Several applications are described that provide useful and information-rich representations, but which require good annotations, in the hope of providing incentives for high quality annotation. We describe how annotations make possible four novel presentations of photo collections: (1) Birthday Collage to show growth of a child over several years, (2) FamiliarFace to show family trees of photos, (3) Kaleidoscope to show photos of related people in an appeal tableau, and (4) TripPics to show photos from a sequential story such as a vacation trip.}, author = {Kustanowitz,J. and Shneiderman, Ben} } @article {16369, title = {Mpjava: High-performance message passing in java using java. nio}, journal = {Languages and Compilers for Parallel Computing}, year = {2004}, month = {2004///}, pages = {323 - 339}, author = {Pugh, William and Spacco,J.} } @article {13226, title = {Multi-cue exemplar-based nonparametric model for gesture recognition}, journal = {Indian Conference on Computer Vision, Graphics and Image Processing}, year = {2004}, month = {2004///}, pages = {16 - 18}, abstract = {This paper presents an approach for a multi-cue, view-based recognition of gestures. We describe an exemplar- based technique that combines two different forms of exem- plars - shape exemplars and motion exemplars - in a uni- fied probabilistic framework. Each gesture is represented as a sequence of learned body poses as well as a sequence of learned motion parameters. The shape exemplars are comprised of pose contours, and the motion exemplars are represented as affine motion parameters extracted using a robust estimation approach. The probabilistic framework learns by employing a nonparametric estimation technique to model the exemplar distributions. It imposes temporal constraints between different exemplars through a learned Hidden Markov Model (HMM) for each gesture. We use the proposed multi-cue approach to recognize a set of four- teen gestures and contrast it against a shape only, single- cue based system. }, author = {Shet,V. D and Prasad,V. S.N and Elgammal,A. and Yacoob,Yaser and Davis, Larry S.} } @conference {12286, title = {Multi-dimensional quorum sets for read-few write-many replica control protocols}, booktitle = {Cluster Computing and the Grid, 2004. CCGrid 2004. IEEE International Symposium on}, year = {2004}, month = {2004/04//}, pages = {355 - 362}, abstract = {We describe d-spaces, a replica control protocol defined in terms of quorum sets on multi-dimensional logical structures. Our work is motivated by asymmetrical access patterns, where the number of read accesses to data are dominant relative to update accesses, i.e. where the protocols should be read-few write-many. D-spaces are optimal with respect to quorum group sizes. The quality of the tradeoff between read efficiency and update availability is not matched by existing quorum protocols. We also propose a novel scheme for implementing d-spaces that combines caching and local information to provide a best-effort form of global views. This allows quorum reconfiguration to be lightweight without impacting access latencies, even when the rate of membership changes is very high.}, keywords = {accesses;, availability;, cache, caching;, Communication, complexity;, CONTROL, d-spaces;, distributed, efficiency;, lightweight, logical, multi-dimensional, processing;, protocols;, quorum, read, read-few, reconfiguration;, replica, sets;, storage;, structures;, update, write-many}, doi = {10.1109/CCGrid.2004.1336588}, author = {Silaghi,B. and Keleher,P. and Bhattacharjee, Bobby} } @conference {12683, title = {Multiple view tracking of humans modelled by kinematic chains}, booktitle = {Image Processing, 2004. ICIP {\textquoteright}04. 2004 International Conference on}, volume = {2}, year = {2004}, month = {2004/10//}, pages = {1009 - 1012 Vol.2 - 1009 - 1012 Vol.2}, abstract = {We use a kinematic chain to model human body motion. We estimate the kinematic chain motion parameters using pixel displacements calculated from video sequences obtained from multiple calibrated cameras to perform tracking. We derive a linear relation between the 2D motion of pixels in terms of the 3D motion parameters of various body parts using a perspective projection model for the cameras, a rigid body motion model for the base body and the kinematic chain model for the body parts. An error analysis of the estimator is provided, leading to an iterative algorithm for calculating the motion parameters from the pixel displacements. We provide experimental results to demonstrate the accuracy of our formulation. We also compare our iterative algorithm to the noniterative algorithm and discuss its robustness in the presence of noise.}, keywords = {3D, algorithm;, analysis;, body, calibrated, cameras;, chain, displacement;, error, estimation;, human, image, iterative, kinematic, kinematics;, methods;, model;, MOTION, motion;, multiple, parameters;, perspective, Pixel, processing;, projection, sequences;, signal, tracking;, video, view}, doi = {10.1109/ICIP.2004.1419472}, author = {Sundaresan, A. and Chellapa, Rama and RoyChowdhury, R.} } @article {13308, title = {Multi-resolution modeling, visualization and streaming of volume meshes}, journal = {Eurographics 2004, Tutorials 2: Multi-resolution Modeling, Visualization and Streaming of Volume Meshes}, year = {2004}, month = {2004///}, author = {Cignoni,P. and De Floriani, Leila and Lindstrom,P. and Pascucci,V. and Rossignac,J. and Silva,C.} } @article {13267, title = {A multi-resolution topological representation for non-manifold meshes}, journal = {Computer-Aided Design}, volume = {36}, year = {2004}, month = {2004/02//}, pages = {141 - 159}, abstract = {We address the problem of representing and processing 3D objects, described through simplicial meshes, which consist of parts of mixed dimensions, and with a non-manifold topology, at different levels of detail. First, we describe a multi-resolution model, that we call a non-manifold multi-tessellation (NMT), and we consider the selective refinement query, which is at the heart of several analysis operations on multi-resolution meshes. Next, we focus on a specific instance of a NMT, generated by simplifying simplicial meshes based on vertex-pair contraction, and we describe a compact data structure for encoding such a model. We also propose a new data structure for two-dimensional simplicial meshes, capable of representing both connectivity and adjacency information with a small memory overhead, which is used to describe the mesh extracted from an NMT through selective refinement. Finally, we present algorithms to efficiently perform updates on such a data structure.}, keywords = {Data structures, Multi-resolution, Non-manifold modeling}, isbn = {0010-4485}, doi = {10.1016/S0010-4485(03)00058-7}, url = {http://www.sciencedirect.com/science/article/pii/S0010448503000587}, author = {De Floriani, Leila and Magillo,Paola and Puppo,Enrico and Sobrero,Davide} } @conference {18729, title = {New directions in design for manufacturing}, year = {2004}, month = {2004///}, pages = {1 - 9}, abstract = {This paper gives an overview of research that is expandingthe domain of design for manufacturing (DFM) into new and important areas. This paper covers DFM and concurrent engineering, DFM for conceptual design, DFM for embodiment design, DFM for detailed design, design for production, platform design for reducing time-to-market, design for system quality, design for life cycle costs, and design for environment. The paper concludes with some general guidelines that suggest how manufacturing firms can develop useful, effective DFM tools. }, url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.198.8706\&rep=rep1\&type=pdf}, author = {Herrmann,J.W. and Cooper,J. and Gupta,S.K. and Hayes,C. C. and Ishii,K. and Kazmer,D. and Sandborn,P. A. and Wood,W. H.} } @conference {17805, title = {Oasys: An opinion analysis system}, booktitle = {AAAI Spring symposium on Computational Approaches to Analyzing Weblogs}, year = {2004}, month = {2004///}, abstract = {There are numerous applications in which we would like toassess what opinions are being expressed in text documents. For example, Martha Stewart{\textquoteright}s company may have wished to assess the degree of harshness of news articles about her in the recent past. Likewise, a World Bank official may wish to as- sess the degree of criticism of a proposed dam in Bangladesh. The ability to gauge opinion on a given topic is therefore of critical interest. In this paper, we develop a suite of algo- rithms which take as input, a set D of documents as well as a topic t, and gauge the degree of opinion expressed about topic t in the set D of documents. Our algorithms can return both a number (larger the number, more positive the opinion) as well as a qualitative opinion (e.g. harsh, complimentary). We as- sess the accuracy of these algorithms via human experiments and show that the best of these algorithms can accurately re- flect human opinions. We have also conducted performance experiments showing that our algorithms are computationally fast. }, author = {Cesarano,C. and Dorr, Bonnie J and Picariello, A. and Reforgiato,D. and Sagoff,A. and V.S. Subrahmanian} } @article {16884, title = {Object-based and image-based object representations}, journal = {ACM Comput. Surv.}, volume = {36}, year = {2004}, month = {2004/06//}, pages = {159 - 217}, abstract = {An overview is presented of object-based and image-based representations of objects by their interiors. The representations are distinguished by the manner in which they can be used to answer two fundamental queries in database applications: (1) Feature query: given an object, determine its constituent cells (i.e., their locations in space). (2) Location query: given a cell (i.e., a location in space), determine the identity of the object (or objects) of which it is a member as well as the remaining constituent cells of the object (or objects). Regardless of the representation that is used, the generation of responses to the feature and location queries is facilitated by building an index (i.e., the result of a sort) either on the objects or on their locations in space, and implementing it using an access structure that correlates the objects with the locations. Assuming the presence of an access structure, implicit (i.e., image-based) representations are described that are good for finding the objects associated with a particular location or cell (i.e., the location query), while requiring that all cells be examined when determining the locations associated with a particular object (i.e., the feature query). In contrast, explicit (i.e., object-based) representations are good for the feature query, while requiring that all objects be examined when trying to respond to the location query. The goal is to be able to answer both types of queries with one representation and without possibly having to examine every cell. Representations are presented that achieve this goal by imposing containment hierarchies on either space (i.e., the cells in the space in which the objects are found), or objects. In the former case, space is aggregated into successively larger-sized chunks (i.e., blocks), while in the latter, objects are aggregated into successively larger groups (in terms of the number of objects that they contain). The former is applicable to image-based interior-based representations of which the space pyramid is an example. The latter is applicable to object-based interior-based representations of which the R-tree is an example. The actual mechanics of many of these representations are demonstrated in the VASCO JAVA applets found at http://www.cs.umd.edu/\~{}hjs/quadtree/index.html.}, keywords = {Access methods, feature query, geographic information systems (GIS), image space, location query, object space, octrees, Pyramids, quadtrees, R-trees, space-filling curves, Spatial databases}, isbn = {0360-0300}, doi = {10.1145/1031120.1031123}, url = {http://doi.acm.org/10.1145/1031120.1031123}, author = {Samet, Hanan} } @article {12939, title = {Occurrence and distribution of Vibrio cholerae in the coastal environment of Peru}, journal = {Environmental Microbiology}, volume = {6}, year = {2004}, month = {2004/07/01/}, pages = {699 - 706}, abstract = {The occurrence and distribution of Vibrio cholerae in sea water and plankton along the coast of Peru were studied from October 1997 to June 2000, and included the 1997{\textendash}98 El Ni{\~n}o event. Samples were collected at four sites in coastal waters off Peru at monthly intervals. Of 178 samples collected and tested, V. cholerae O1 was cultured from 10 (5.6\%) samples, and V. cholerae O1 was detected by direct fluorescent antibody assay in 26 out of 159 samples tested (16.4\%). Based on the number of cholera cases reported in Peru from 1997 to 2000, a significant correlation was observed between cholera incidence and elevated sea surface temperature (SST) along the coast of Peru (P~<~0.001). From the results of this study, coastal sea water and zooplankton are concluded to be a reservoir for V. cholerae in Peru. The climate{\textendash}cholera relationship observed for the 1997{\textendash}98 El Ni{\~n}o year suggests that an early warning system for cholera risk can be established for Peru and neighbouring Latin American countries.}, isbn = {1462-2920}, doi = {10.1111/j.1462-2920.2004.00601.x}, url = {http://onlinelibrary.wiley.com/doi/10.1111/j.1462-2920.2004.00601.x/abstract?userIsAuthenticated=false\&deniedAccessCustomisedMessage=}, author = {Gil,Ana I. and Louis,Val{\'e}rie R. and Rivera,Irma N. G. and Lipp,Erin and Huq,Anwar and Lanata,Claudio F. and Taylor,David N. and Russek-Cohen,Estelle and Choopun,Nipa and Sack,R. Bradley and Rita R Colwell} } @article {17798, title = {Optimal models of disjunctive logic programs: semantics, complexity, and computation}, journal = {Knowledge and Data Engineering, IEEE Transactions on}, volume = {16}, year = {2004}, month = {2004/04//}, pages = {487 - 503}, abstract = {Almost all semantics for logic programs with negation identify a set, SEM(P), of models of program P, as the intended semantics of P, and any model M in this class is considered a possible meaning of P with regard to the semantics the user has in mind. Thus, for example, in the case of stable models [M. Gelfond et al., (1988)], choice models [D. Sacca et al., (1990)], answer sets [M. Gelfond et al., (1991)], etc., different possible models correspond to different ways of "completing" the incomplete information in the logic program. However, different end-users may have different ideas on which of these different models in SEM(P) is a reasonable one from their point of view. For instance, given SEM(P), user U1 may prefer model M1 isin;SEM(P) to model M2 isin;SEM(P) based on some evaluation criterion that she has. We develop a logic program semantics based on optimal models. This semantics does not add yet another semantics to the logic programming arena - it takes as input an existing semantics SEM(P) and a user-specified objective function Obj, and yields a new semantics Opt(P)_ sube; SEM(P) that realizes the objective function within the framework of preferred models identified already by SEM(P). Thus, the user who may or may not know anything about logic programming has considerable flexibility in making the system reflect her own objectives by building "on top" of existing semantics known to the system. In addition to the declarative semantics, we provide a complete complexity analysis and algorithms to compute optimal models under varied conditions when SEM(P) is the stable model semantics, the minimal models semantics, and the all-models semantics.}, keywords = {complexity;, computational, disjunctive, function;, knowledge, LANGUAGE, Logic, minimal, model, nonmonotonic, objective, optimisation;, OPTIMIZATION, problems;, program, Programming, programming;, reasoning;, representation;, semantics;, stable, user-specified}, isbn = {1041-4347}, doi = {10.1109/TKDE.2004.1269672}, author = {Leone,N. and Scarcello,F. and V.S. Subrahmanian} } @article {12938, title = {Pandemic strains of O3:K6 Vibrio parahaemolyticus in the aquatic environment of Bangladesh}, journal = {Canadian Journal of Microbiology}, volume = {50}, year = {2004}, month = {2004/10//}, pages = {827 - 834}, abstract = {A total of 1500 environmental strains of Vibrio parahaemolyticus, isolated from the aquatic environment of Bangladesh, were screened for the presence of a major V. parahaemolyticus virulence factor, the thermostable direct haemolysin (tdh) gene, by the colony blot hybridization method using a digoxigenin-labeled tdh gene probe. Of 1500 strains, 5 carried the tdh sequence, which was further confirmed by PCR using primers specific for the tdh gene. Examination by PCR confirmed that the 5 strains were V. parahamolyticus and lacked the thermostable direct haemolysin-related haemolysin (trh) gene, the alternative major virulence gene known to be absent in pandemic strains. All 5 strains gave positive Kanagawa phenomenon reaction with characteristic beta-haemolysis on Wagatsuma agar medium. Southern blot analysis of the HindIII-digested chromosomal DNA demonstrated, in all 5 strains, the presence of 2 tdh genes common to strains positive for Kanagawa phenomenon. However, the 5 strains were found to belong to 3 different serotypes (O3:K29, O4:K37, and O3:K6). The 2 with pandemic serotype O3:K6 gave positive results in group-specific PCR and ORF8 PCR assays, characteristics unique to the pandemic clone. Clonal variations among the 5 isolates were analyzed by comparing RAPD and ribotyping patterns. Results showed different patterns for the 3 serotypes, but the pattern was identical among the O3:K6 strains. This is the first report on the isolation of pandemic O3:K6 strains of V. parahaemolyticus from the aquatic environment of Bangladesh.}, url = {http://umd.library.ingentaconnect.com/content/nrc/cjm/2004/00000050/00000010/art00007}, author = {Islam,M. S. and Tasmin,Rizwana and Khan,Sirajul I. s l a m and Bakht,Habibul B. M. and Mahmood,Zahid H. a y a t and Rahman,M. Z. i a u r and Bhuiyan,Nurul A. m i n and Nishibuchi,Mitsuaki and Nair,G. B. a l a k r i s h and Sack,R. B. r a d l e y and Huq,Anwar and Rita R Colwell and Sack,David A.} } @article {15015, title = {PAWN: Producer-Archive Workflow Network in support of digital preservation}, volume = {UMIACS-TR-2004}, year = {2004}, month = {2004///}, pages = {2006 - 2006}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {We describe the design and the implementation of the PAWN (Producer {\textendash} ArchiveWorkflow Network) environment to enable secure and distributed ingestion of digital objects into a persistent archive. PAWN was developed to capture the core elements required for long term preservation of digital objects as identified by previous research in the digital library and archiving communities. In fact, PAWN can be viewed as an implementation of the Ingest Process as defined by the Open Archival Information System (OAIS) Reference Model, and is currently being used to ingest significant collections into a pilot persistent archive developed through a collaboration between the San Diego Supercomputer Center, the University of Maryland, and the National Archives and Records Administration. We make use of METS (Metadata Encoding and Transmission Standards) to encapsulate content, structural, descriptive, and preservation metadata. The basic software components are based on open standards and web technologies, and hence are platform independent. }, author = {Smorul,M. and JaJa, Joseph F. and Wang, Y. and McCall,F.} } @inbook {18915, title = {Plan Databases: Model and Algebra}, booktitle = {Foundations of Information and Knowledge Systems}, series = {Lecture Notes in Computer Science}, volume = {2942}, year = {2004}, month = {2004///}, pages = {302 - 319}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {Despite the fact that thousands of applications manipulate plans, there has been no work to date on managing large databases of plans. In this paper, we first propose a formal model of plan databases. We describe important notions of consistency and coherence for such databases. We then propose a set of operators similar to the relational algebra to query such databases of plans.}, keywords = {Computer science}, isbn = {978-3-540-20965-2}, url = {http://www.springerlink.com/content/yqhlqtu4te18q2e1/abstract/}, author = {Yaman,Fusun and Adali,Sibel and Nau, Dana S. and Sapino,Maria and Subrahmanian,V.}, editor = {Seipel,Dietmar and Turull-Torres,Jos{\'e}} } @article {15498, title = {Preserving distributed systems critical properties: a model-driven approach}, journal = {Software, IEEE}, volume = {21}, year = {2004}, month = {2004///}, pages = {32 - 40}, abstract = {The need for creating predictability in distributed systems is most often specified in terms of quality-of-service (QoS) requirements, which help define the acceptable levels of dependability with which capabilities such as processing capacity, data throughput, or service availability reach users. For longer-term properties such as scalability, maintainability, adaptability, and system security, we can similarly use persistent software attributes (PSAs) to specify how and to what degree such properties must remain intact as a network expands and evolves over time. The Skoll distributed continuous software quality assurance process helps to identify viable system and software configurations for meeting stringent QOS and PSA requirements by coordinating the use of distributed computing resources. The authors tested their process using the large, rapidly evolving ACE+TAO middleware suite.}, keywords = {configuration management, formal verification, Middleware, middleware suite, model-driven approach, persistent software attributes, QoS requirements, Quality assurance, quality of service, quality-of-service, Skoll distributed computing resources, software configuration, Software maintenance, Software quality, software quality assurance process, system dependability}, isbn = {0740-7459}, doi = {10.1109/MS.2004.50}, author = {Yilmaz,C. and Memon, Atif M. and Porter, Adam and Krishna,A. S and Schmidt,D. C and Gokhale,A. and Natarajan,B.} } @conference {17802, title = {The priority curve algorithm for video summarization}, booktitle = {Proceedings of the 2nd ACM international workshop on Multimedia databases}, series = {MMDB {\textquoteright}04}, year = {2004}, month = {2004///}, pages = {28 - 35}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {In this paper, we introduce the concept of a priority curve associated with a video. We then provide an algorithm that can use the priority curve to create a summary (of a desired length) of any video. The summary thus created exhibits nice continuity properties and also avoids repetition. We have implemented the priority curve algorithm (PCA) and compared it with other summarization algorithms in the literature. We show that PCA is faster than existing algorithms and also produces better quality summaries. The quality of summaries was evaluated by a group of 200 students in Naples, Italy, who watched soccer videos. We also briefly describe a soccer video summarization system we have built on using the PCA architecture and various (classical) image processing algorithms.}, keywords = {probabilistic, Summarization, system, video}, isbn = {1-58113-975-6}, doi = {10.1145/1032604.1032611}, url = {http://doi.acm.org/10.1145/1032604.1032611}, author = {Fayzullin,M. and V.S. Subrahmanian and Albanese, M. and Picariello, A.} } @article {12080, title = {Proactive key distribution using neighbor graphs}, journal = {IEEE Wireless Communications}, volume = {11}, year = {2004}, month = {2004/02//}, pages = {26 - 36}, abstract = {User mobility in wireless data networks is increasing because of technological advances, and the desire for voice and multimedia applications. These applications, however, require that handoffs between base stations (or access points) be fast to maintain the quality of the connections. In this article we introduce a novel data structure, the neighbor graph, that dynamically captures the mobility topology of a wireless network. We show how neighbor graphs can be utilized to obtain a 99 percent reduction in the authentication time of an IEEE 802.11 handoff (full EAP-TLS) by proactively distributing necessary key material one hop ahead of the mobile user. We also present a reactive method for fast authentication that requires only firmware changes to access points and hence can easily be deployed on existing wireless networks.}, keywords = {access points, Authentication, authentication time, Base stations, Communication system security, Delay, graph theory, GSM, IEEE 802.11 handoff, Land mobile radio cellular systems, Message authentication, mobile radio, Multiaccess communication, neighbor graph, Network topology, Roaming, telecommunication security, Telephone sets, user mobility, Wi-Fi networks, wireless data networks, Wireless LAN, Wireless networks}, isbn = {1536-1284}, doi = {10.1109/MWC.2004.1269714}, author = {Mishra,A. and Min Ho Shin and Petroni,N. L. and Clancy,T. C and Arbaugh, William A.} } @conference {16120, title = {Project highlight: toward the statistical knowledge network}, booktitle = {Proceedings of the 2004 annual national conference on Digital government research}, series = {dg.o {\textquoteright}04}, year = {2004}, month = {2004///}, pages = {125:1{\textendash}125:2 - 125:1{\textendash}125:2}, publisher = {Digital Government Society of North America}, organization = {Digital Government Society of North America}, abstract = {This project aims to help people find and understand government statistical information. To achieve this goal, we envision a statistical knowledge network that brings stakeholders from government at all levels together with citizens who provide or seek statistical information. The linchpin of this network is a series of human-computer interfaces that facilitate information seeking, understanding, and use. In turn, these interfaces depend on high-quality metadata and intra-agency cooperation. In this briefing, we summarize our accomplishments in the second year of the project.}, url = {http://dl.acm.org/citation.cfm?id=1124191.1124316}, author = {Marchionini,Gary and Haas,Stephanie and Shneiderman, Ben and Plaisant, Catherine and Hert,Carol A.} } @conference {16944, title = {A Rank-by-Feature Framework for Unsupervised Multidimensional Data Exploration Using Low Dimensional Projections}, booktitle = {IEEE Symposium on Information Visualization, 2004. INFOVIS 2004}, year = {2004}, month = {2004///}, pages = {65 - 72}, publisher = {IEEE}, organization = {IEEE}, abstract = {Exploratory analysis of multidimensional data sets is challenging because of the difficulty in comprehending more than three dimensions. Two fundamental statistical principles for the exploratory analysis are (1) to examine each dimension first and then find relationships among dimensions, and (2) to try graphical displays first and then find numerical summaries (D.S. Moore, (1999). We implement these principles in a novel conceptual framework called the rank-by-feature framework. In the framework, users can choose a ranking criterion interesting to them and sort 1D or 2D axis-parallel projections according to the criterion. We introduce the rank-by-feature prism that is a color-coded lower-triangular matrix that guides users to desired features. Statistical graphs (histogram, boxplot, and scatterplot) and information visualization techniques (overview, coordination, and dynamic query) are combined to help users effectively traverse 1D and 2D axis-parallel projections, and finally to help them interactively find interesting features}, keywords = {axis-parallel projections, boxplot, color-coded lower-triangular matrix, computational complexity, computational geometry, Computer displays, Computer science, Computer vision, Data analysis, data mining, data visualisation, Data visualization, Displays, dynamic query, Educational institutions, exploratory data analysis, feature detection, feature detection/selection, Feature extraction, feature selection, graph theory, graphical displays, histogram, Information Visualization, interactive systems, Laboratories, Multidimensional systems, Principal component analysis, rank-by-feature prism, scatterplot, statistical analysis, statistical graphics, statistical graphs, unsupervised multidimensional data exploration, very large databases}, isbn = {0-7803-8779-3}, doi = {10.1109/INFVIS.2004.3}, author = {Seo,J. and Shneiderman, Ben} } @article {13852, title = {RT-S: Surface rich transcription scoring, methodology, and initial results}, journal = {Proc. DARPA Rich Transcription Workshop}, year = {2004}, month = {2004///}, abstract = {In this paper we present a methodoly for the scoring ofpunctuation annotated texts, as well as a preliminary system to perform the task. We modify SCLITE{\textquoteright}s scoring method- ology to support scoring of punctuation. Using this method- ology, we show that the error rate of an initial automatic sys- tem is comparable to annotator inconsistency. However, the use of multiple references allows us to differentiate between human inconsistencies and system errors. }, author = {Snover,M. and Schwartz,R. and Dorr, Bonnie J and Makhoul,J.} } @conference {12298, title = {Scalable resilient media streaming}, booktitle = {Proceedings of the 14th international workshop on Network and operating systems support for digital audio and video}, series = {NOSSDAV {\textquoteright}04}, year = {2004}, month = {2004///}, pages = {4 - 9}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {We present a low-overhead media streaming system, called SRMS (Scalable Resilient Media Streaming) that can be used to scalably deliver streaming data to a large group of receivers. SRMS uses overlay multicast for data distribution. to a large group of users. SRMS leverages a probabilistic loss recovery technique to provide high data delivery guarantees even under large network losses and overlay node failures. The clients in the SRMS system are able to interoperate with existing media streaming servers that use RTP for data transport. One of the interesting features of SRMS is that it can simultaneously support clients with disparate access bandwidths. It enables the necessary bandwidth adaptations using standard Real-time Transport Protocol (RTP) mechanisms, e.g. RTP translators. We have implemented and evaluated the SRMS system in detail on an emulated network as well as on a wide-area testbed with up to 128 clients. Our results show that clients using SRMS achieve high (97\%) data delivery ratios with low overheads (<5\%) even for a very dynamic network (up to five membership changes per minute).}, keywords = {media streaming, Multicast, overlay network, Resilience}, isbn = {1-58113-801-6}, doi = {10.1145/1005847.1005851}, url = {http://doi.acm.org/10.1145/1005847.1005851}, author = {Banerjee,Suman and Lee,Seungjoon and Braud,Ryan and Bhattacharjee, Bobby and Srinivasan, Aravind} } @article {13325, title = {Selective refinement queries for volume visualization of unstructured tetrahedral meshes}, journal = {Visualization and Computer Graphics, IEEE Transactions on}, volume = {10}, year = {2004}, month = {2004///}, pages = {29 - 45}, abstract = {We address the problem of the efficient visualization of large irregular volume data sets by exploiting a multiresolution model based on tetrahedral meshes. Multiresolution models, also called Level-Of-Detail (LOD) models, allow encoding the whole data set at a virtually continuous range of different resolutions. We have identified a set of queries for extracting meshes at variable resolution from a multiresolution model, based on field values, domain location, or opacity of the transfer function. Such queries allow trading off between resolution and speed in visualization. We define a new compact data structure for encoding a multiresolution tetrahedral mesh built through edge collapses to support selective refinement efficiently and show that such a structure has a storage cost from 3 to 5.5 times lower than standard data structures used for tetrahedral meshes. The data structures and variable resolution queries have been implemented together with state-of-the art visualization techniques in a system for the interactive visualization of three-dimensional scalar fields defined on tetrahedral meshes. Experimental results show that selective refinement queries can support interactive visualization of large data sets.}, keywords = {Automated;Signal Processing, Computer-Assisted;Imaging, Computer-Assisted;User-Computer Interface;, data structure;geometric modeling;interactive visualization;large data sets;multiresolution model;selective refinement queries;unstructured tetrahedral meshes;variable resolution queries;volume data visualization;data visualisation;mesh generation;query p, Three-Dimensional;Online Systems;Pattern Recognition}, isbn = {1077-2626}, doi = {10.1109/TVCG.2004.1260756}, author = {Cignoni,P. and De Floriani, Leila and Magillo,P. and Puppo,E. and Scopigno,R.} } @article {15273, title = {A semidefinite programming approach to side chain positioning with new rounding strategies}, journal = {INFORMS Journal on Computing}, volume = {16}, year = {2004}, month = {2004///}, pages = {380 - 392}, author = {Chazelle,B. and Kingsford, Carl and Singh,M.} } @conference {16885, title = {A serverless 3D world}, booktitle = {Proceedings of the 12th annual ACM international workshop on Geographic information systems}, series = {GIS {\textquoteright}04}, year = {2004}, month = {2004///}, pages = {157 - 165}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Online multi-participant virtual-world systems have attracted significant interest from the Internet community but are hindered by their inability to efficiently support interactivity for a large number of participants. Current solutions divide a large virtual-world into a few mutually exclusive zones, with each zone controlled by a different server, and/or limit the number of participants per server or per virtual-world. Peer-to-Peer (P2P) systems are known to provide excellent scalability in a networked environment (one peer is introduced to the system by each participant), however current P2P applications can only provide file sharing and other forms of relatively simple data communications. In this paper, we present a generic 3D virtual-world application that runs on a P2P network with no central administration or server. Two issues are addressed by this paper to enable such a spatial application on a P2P network. First, we demonstrate how to index and query a 3D space on a dynamic distributed network. Second, we show how to build such a complex application from the ground level of a P2P routing algorithm. Our work leads to new directions for the development of online virtual-worlds that we believe can be used for many government, industry, and public domain applications.}, keywords = {distributed hash tables, peer-to-peer systems, spatial data, virtual-worlds}, isbn = {1-58113-979-9}, doi = {10.1145/1032222.1032246}, url = {http://doi.acm.org/10.1145/1032222.1032246}, author = {Tanin,Egemen and Harwood,Aaron and Samet, Hanan and Nutanong,Sarana and Truong,Minh Tri} } @article {17657, title = {SESSION 2: STREAMING}, journal = {Proceedings of the 14th International Workshop on Network and Operating Systems Support for Digital Audio and Video: NOSSDAV 2003: June 16-18, 2004, Cork, Ireland}, year = {2004}, month = {2004///}, pages = {3 - 3}, author = {Banerjee,S. and Lee,S. and Braud,R. and Bhattacharjee, Bobby and Srinivasan, Aravind and Chu,Y. and Zhang,H. and Sinha,R. and Papadopoulos,C. and Boustead,P. and others} } @conference {12684, title = {Simultaneous background and foreground modeling for tracking in surveillance video}, booktitle = {Image Processing, 2004. ICIP {\textquoteright}04. 2004 International Conference on}, volume = {2}, year = {2004}, month = {2004/10//}, pages = {1053 - 1056 Vol.2 - 1053 - 1056 Vol.2}, abstract = {We present a stochastic tracking algorithm for surveillance video where targets are dim and at low resolution. The algorithm builds motion models for both background and foreground by integrating motion and intensity information. Some other merits of the algorithm include adaptive selection of feature points for scene description and defining proper cost functions for displacement estimation. The experimental results show tracking robustness and precision in a challenging video sequences.}, keywords = {algorithm;, analysis;, background-foreground, displacement, estimation;, image, information;, INTENSITY, modeling;, MOTION, processes;, processing;, resolution;, sequences;, signal, Stochastic, Surveillance, surveillance;, tracking, tracking;, video}, doi = {10.1109/ICIP.2004.1419483}, author = {Shao, J. and Zhou,S. K and Chellapa, Rama} } @conference {15468, title = {Skoll: distributed continuous quality assurance}, booktitle = {Software Engineering, 2004. ICSE 2004. Proceedings. 26th International Conference on}, year = {2004}, month = {2004/05//}, pages = {459 - 468}, abstract = {Quality assurance (QA) tasks, such as testing, profiling, and performance evaluation, have historically been done in-house on developer-generated workloads and regression suites. Since this approach is inadequate for many systems, tools and processes are being developed to improve software quality by increasing user participation in the QA process. A limitation of these approaches is that they focus on isolated mechanisms, not on the coordination and control policies and tools needed to make the global QA process efficient, effective, and scalable. To address these issues, we have initiated the Skoll project, which is developing and validating novel software QA processes and tools that leverage the extensive computing resources of worldwide user communities in a distributed, continuous manner to significantly and rapidly improve software quality. This paper provides several contributions to the study of distributed continuous QA. First, it illustrates the structure and functionality of a generic around-the-world, around-the-clock QA process and describes several sophisticated tools that support this process. Second, it describes several QA scenarios built using these tools and process. Finally, it presents a feasibility study applying these scenarios to a 1MLOC+ software package called ACE+TAO. While much work remains to be done, the study suggests that the Skoll process and tools effectively manage and control distributed, continuous QA processes. Using Skoll we rapidly identified problems that had taken the ACE+TAO developers substantially longer to find and several of which had previously not been found. Moreover, automatic analysis of QA task results often provided developers information that quickly led them to the root cause of the problems.}, keywords = {1MLOC+ software package, ACE+TAO, around-the-clock QA process, around-the-world QA process, distributed continuous QA, distributed continuous quality assurance, distributed programming, program verification, Quality assurance, Skoll, software performance evaluation, software profiling, Software quality, Software testing}, doi = {10.1109/ICSE.2004.1317468}, author = {Memon, Atif M. and Porter, Adam and Yilmaz,C. and Nagarajan,A. and Schmidt,D. and Natarajan,B.} } @conference {12288, title = {Slurpie: a cooperative bulk data transfer protocol}, booktitle = {INFOCOM 2004. Twenty-third AnnualJoint Conference of the IEEE Computer and Communications Societies}, volume = {2}, year = {2004}, month = {2004/03//}, pages = {941 - 951 vol.2 - 941 - 951 vol.2}, abstract = {We present Slurpie: a peer-to-peer protocol for bulk data transfer. Slurpie is specifically designed to reduce client download times for large, popular files, and to reduce load on servers that serve these files. Slurpie employs a novel adaptive downloading strategy to increase client performance, and employs a randomized backoff strategy to precisely control load on the server. We describe a full implementation of the Slurpie protocol, and present results from both controlled local-area and wide-area testbeds. Our results show that Slurpie clients improve performance as the size of the network increases, and the server is completely insulated from large flash crowds entering the Slurpie network.}, keywords = {adaptive, bulk, client-server, clients;, computing;, cooperative, data, data;, downloading, network;, peer-to-peer, protocol;, protocols;, Slurpie, strategy;, systems;, transfer, transport}, doi = {10.1109/INFCOM.2004.1356981}, author = {Sherwood,R. and Braud,R. and Bhattacharjee, Bobby} } @inbook {17367, title = {Social and psychological influences on computer user frustration}, booktitle = {Media access: Social and psychological dimensions of new technology useMedia access: Social and psychological dimensions of new technology use}, year = {2004}, month = {2004///}, pages = {91 - 103}, author = {Bessiere,K. and Ceaparu,I. and Lazar,J. and Robinson,J. and Shneiderman, Ben} } @article {16890, title = {SoftPOSIT: Simultaneous pose and correspondence determination}, journal = {International Journal of Computer Vision}, volume = {59}, year = {2004}, month = {2004///}, pages = {259 - 284}, abstract = {The problem of pose estimation arises in many areas of computer vision, including object recognition, object tracking, site inspection and updating, and autonomous navigation when scene models are available. We present a new algorithm, called SoftPOSIT, for determining the pose of a 3D object from a single 2D image when correspondences between object points and image points are not known. The algorithm combines the iterative softassign algorithm (Gold and Rangarajan, 1996; Gold et al., 1998) for computing correspondences and the iterative POSIT algorithm (DeMenthon and Davis, 1995) for computing object pose under a full-perspective camera model. Our algorithm, unlike most previous algorithms for pose determination, does not have to hypothesize small sets of matches and then verify the remaining image points. Instead, all possible matches are treated identically throughout the search for an optimal pose. The performance of the algorithm is extensively evaluated in Monte Carlo simulations on synthetic data under a variety of levels of clutter, occlusion, and image noise. These tests show that the algorithm performs well in a variety of difficult scenarios, and empirical evidence suggests that the algorithm has an asymptotic run-time complexity that is better than previous methods by a factor of the number of image points. The algorithm is being applied to a number of practical autonomous vehicle navigation problems including the registration of 3D architectural models of a city to images, and the docking of small robots onto larger robots.}, doi = {10.1023/B:VISI.0000025800.10423.1f}, author = {David,P. and DeMenthon,D. and Duraiswami, Ramani and Samet, Hanan} } @article {16117, title = {Sonification of geo-referenced data for auditory information seeking: Design principle and pilot study}, journal = {Proceedings of ICAD}, year = {2004}, month = {2004///}, abstract = {We present an Auditory Information Seeking Principle (AISP)(gist, navigate, filter, and details-on-demand) modeled after the visual information seeking mantra [1]. We propose that data sonification designs should conform to this principle. We also present some design challenges imposed by human auditory perception characteristics. To improve blind access to geo- referenced statistical data, we developed two preliminary sonifications adhering to the above AISP, an enhanced table and a spatial choropleth map. Our pilot study shows people can recognize geographic data distribution patterns on a real map with 51 geographic regions, in both designs. The study also shows evidence that AISP conforms to people{\textquoteright}s information seeking strategies. Future work is discussed, including the improvement of the choropleth map design. }, author = {Zhao,H. and Plaisant, Catherine and Shneiderman, Ben and Duraiswami, Ramani} } @article {17659, title = {Special issue: 35th Annual ACM Symposium on Theory of Computing}, journal = {Journal of Computer and System Sciences}, volume = {69}, year = {2004}, month = {2004/11//}, pages = {305 - 305}, isbn = {0022-0000}, doi = {10.1016/j.jcss.2004.06.004}, url = {http://www.sciencedirect.com/science/article/pii/S0022000004000881}, author = {Khanna,Sanjeev and Srinivasan, Aravind} } @conference {17661, title = {Structural and algorithmic aspects of massive social networks}, booktitle = {Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms}, series = {SODA {\textquoteright}04}, year = {2004}, month = {2004///}, pages = {718 - 727}, publisher = {Society for Industrial and Applied Mathematics}, organization = {Society for Industrial and Applied Mathematics}, address = {Philadelphia, PA, USA}, abstract = {We study the algorithmic and structural properties of very large, realistic social contact networks. We consider the social network for the city of Portland, Oregon, USA, developed as a part of the TRANSIMS/EpiSims project at the Los Alamos National Laboratory. The most expressive social contact network is a bipartite graph, with two types of nodes: people and locations; edges represent people visiting locations on a typical day. Three types of results are presented. (i) Our empirical results show that many basic characteristics of the dataset are well-modeled by a random graph approach suggested by Fan Chung Graham and Lincoln Lu (the CL-model), with a power-law degree distribution. (ii) We obtain fast approximation algorithms for computing basic structural properties such as clustering coefficients and shortest paths distribution. We also study the dominating set problem for such networks; this problem arose in connection with optimal sensor-placement for disease-detection. We present a fast approximation algorithm for computing near-optimal dominating sets. (iii) Given the close approximations provided by the CL-model to our original dataset and the large data-volume, we investigate fast methods for generating such random graphs. We present methods that can generate such a random network in near-linear time, and show that these variants asymptotically share many key features of the CL-model, and also match the Portland social network.The structural results have been used to study the impact of policy decisions for controlling large-scale epidemics in urban environments.}, isbn = {0-89871-558-X}, url = {http://dl.acm.org/citation.cfm?id=982792.982902}, author = {Eubank,Stephen and Kumar,V. S. Anil and Marathe,Madhav V. and Srinivasan, Aravind and Wang,Nan} } @conference {14761, title = {Studying code development for high performance computing: the HPCS program}, booktitle = {First International Workshop On Software Engineering for High Performance Computing System Applications}, year = {2004}, month = {2004///}, pages = {32 - 32}, author = {Carver, J. and Asgari, S. and Basili, Victor R. and Hochstein, L. and Hollingsworth, Jeffrey K and Shull, F. and Zelkowitz, Marvin V} } @conference {19046, title = {The sybil attack in sensor networks: analysis \& defenses}, series = {IPSN {\textquoteright}04}, year = {2004}, month = {2004}, pages = {259 - 268}, publisher = {ACM}, organization = {ACM}, abstract = {Security is important for many sensor network applications. A particularly harmful attack against sensor and ad hoc networks is known as the Sybil attack [6], where a node illegitimately claims multiple identities. This paper systematically analyzes the threat posed by the Sybil attack to wireless sensor networks. We demonstrate that the attack can be exceedingly detrimental to many important functions of the sensor network such as routing, resource allocation, misbehavior detection, etc. We establish a classification of different types of the Sybil attack, which enables us to better understand the threats posed by each type, and better design countermeasures against each type. We then propose several novel techniques to defend against the Sybil attack, and analyze their effectiveness quantitatively.}, keywords = {Security, sensor networks, sybil attack}, isbn = {1-58113-846-6}, url = {http://doi.acm.org/10.1145/984622.984660}, author = {Newsome, James and Elaine Shi and Song, Dawn and Perrig, Adrian} } @conference {12393, title = {Systematic exploitation of data parallelism in hardware synthesis of DSP applications}, booktitle = {Acoustics, Speech, and Signal Processing, 2004. Proceedings. (ICASSP {\textquoteright}04). IEEE International Conference on}, volume = {5}, year = {2004}, month = {2004/05//}, pages = {V - 229-32 vol.5 - V - 229-32 vol.5}, abstract = {We describe an approach that we have explored for low-power synthesis and optimization of image, video, and digital signal processing (DSP) applications. In particular, we consider the systematic exploitation of data parallelism across the operations of an application dataflow graph when synthesizing a dedicated hardware implementation. Data parallelism occurs commonly in DSP applications, and provides flexible opportunities to increase throughput or lower power consumption. Exploiting this parallelism in a dedicated hardware implementation comes at the expense of increased resource requirements, which must be balanced carefully when applying the technique in a design tool. We propose a high level synthesis algorithm to determine the data parallelism factor for each computation, and, based on the area and performance trade-off curve, design an efficient hardware representation of the dataflow graph. For performance estimation, our approach uses a cyclostatic dataflow intermediate representation of the hardware structure under synthesis. We then apply an automatic hardware generation framework to build the actual circuit.}, keywords = {area-performance trade-off curve, automatic Verilog code generation, circuit optimisation, data flow graphs, data parallelism, dedicated hardware implementation synthesis, design tool, Digital signal processing, DSP applications, embedded systems, hardware description languages, hardware synthesis, high level synthesis, high level synthesis algorithm, IMAGE PROCESSING, PARALLEL PROCESSING, power consumption, Signal processing, synchronous dataflow graph, video processing}, doi = {10.1109/ICASSP.2004.1327089}, author = {Sen,M. and Bhattacharyya, Shuvra S.} } @article {16566, title = {Temporally asymmetric learning supports sequence processing in multi-winner self-organizing maps}, journal = {Neural Computation}, volume = {16}, year = {2004}, month = {2004///}, pages = {535 - 561}, author = {Schulz,R. and Reggia, James A.} } @conference {17891, title = {Time and space optimization for processing groups of multi-dimensional scientific queries}, booktitle = {Proceedings of the 18th annual international conference on Supercomputing}, series = {ICS {\textquoteright}04}, year = {2004}, month = {2004///}, pages = {95 - 105}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Data analysis applications in areas as diverse as remote sensing and telepathology require operating on and processing very large datasets. For such applications to execute efficiently, careful attention must be paid to the storage, retrieval, and manipulation of the datasets. This paper addresses the optimizations performed by a high performance database system that processes groups of data analysis requests for these applications, which we call queries. The system performs end-to-end processing of the requests, formulated as PostgreSQL declarative queries. The queries are converted into imperative descriptions, multiple imperative descriptions are merged into a single execution plan, the plan is optimized to decrease execution time via common compiler optimization techniques, and, finally, the plan is optimized to decrease memory consumption. The last two steps are experimentally shown to effectively reduc the amount of time required while conserving memory space as a group of queries is processed by the database.}, keywords = {multi-query optimization, Scientific databases}, isbn = {1-58113-839-3}, doi = {10.1145/1006209.1006224}, url = {http://doi.acm.org/10.1145/1006209.1006224}, author = {Aryangat,Suresh and Andrade,Henrique and Sussman, Alan} } @article {14048, title = {TM Electromagnetic Scattering from 2D Multilayered Dielectric Bodies-Numerical Solution}, journal = {Applied Computational Electromagnetics Society journal}, year = {2004}, month = {2004///}, pages = {100 - 107}, abstract = {An integral equation approach is derived for an electromagnetic scattering from an M arbitrary multilayereddielectric domain. The integral equation is valid for the 2D and 3D Helmholtz equation. Here we show the numerical solution for the 2D case by using the Nystr{\"o}m method. For validating the method we develop a mode matching method for the case when the domains are multilayered circular cylinders and give numerical results for illustrating the algorithm. }, author = {Duraiswami, Ramani and Seydou,F. and Gumerov, Nail A.} } @conference {17801, title = {TOSS: an extension of TAX with ontologies and similarity queries}, booktitle = {Proceedings of the 2004 ACM SIGMOD international conference on Management of data}, series = {SIGMOD {\textquoteright}04}, year = {2004}, month = {2004///}, pages = {719 - 730}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {TAX is perhaps the best known extension of the relational algebra to handle queries to XML databases. One problem with TAX (as with many existing relational DBMSs) is that the semantics of terms in a TAX DB are not taken into account when answering queries. Thus, even though TAX answers queries with 100\% precision, the recall of TAX is relatively low. Our TOSS system improves the recall of TAX via the concept of a similarity enhanced ontology (SEO). Intuitively, an ontology is a set of graphs describing relationships (such as isa, partof, etc.) between terms in a DB. An SEO also evaluates how similarities between terms (e.g. "J. Ullman", "Jeff Ullman", and "Jeffrey Ullman") affect ontologies. Finally, we show how the algebra proposed in TAX can be extended to take SEOs into account. The result is a system that provides a much higher answer quality than TAX does alone (quality is defined as the square root of the product of precision and recall). We experimentally evaluate the TOSS system on the DBLP and SIGMOD bibliographic databases and show that TOSS has acceptable performance.}, keywords = {ontologies, semantic integration of heterogeneous data, similarity enhancement, XML databases}, isbn = {1-58113-859-8}, doi = {10.1145/1007568.1007649}, url = {http://doi.acm.org/10.1145/1007568.1007649}, author = {Hung,Edward and Deng,Yu and V.S. Subrahmanian} } @conference {14749, title = {Transparent proxies for java futures}, booktitle = {Proceedings of the 19th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications}, series = {OOPSLA {\textquoteright}04}, year = {2004}, month = {2004///}, pages = {206 - 223}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {A proxy object is a surrogate or placeholder that controls access to another target object. Proxies can be used to support distributed programming, lazy or parallel evaluation, access control, and other simple forms of behavioral reflection. However, wrapper proxies (like futures or suspensions> for yet-to-be-computed results) can require significant code changes to be used in statically-typed languages, while proxies more generally can inadvertently violate assumptions of transparency, resulting in subtle bugs. To solve these problems, we have designed and implemented a simple framework for proxy programming that employs a static analysis based on qualifier inference, but with additional novelties. Code for using wrapper proxies is automatically introduced via a classfile-to-classfile transformation, and potential violations of transparency are signaled to the programmer. We have formalized our analysis and proven it sound. Our framework has a variety of applications, including support for asynchronous method calls returning futures. Experimental results demonstrate the benefits of our framework: programmers are relieved of managing and/or checking proxy usage, analysis times are reasonably fast, overheads introduced by added dynamic checks are negligible, and performance improvements can be significant. For example, changing two lines in a simple RMI-based peer-to-peer application and then using our framework resulted in a large performance gain.}, keywords = {future, java, proxy, Type inference, type qualifier}, isbn = {1-58113-831-8}, doi = {10.1145/1028976.1028994}, url = {http://doi.acm.org/10.1145/1028976.1028994}, author = {Pratikakis,Polyvios and Spacco,Jaime and Hicks, Michael W.} } @article {18725, title = {Ubistatins Inhibit Proteasome-Dependent Degradation by Binding the Ubiquitin Chain}, journal = {Science}, volume = {306}, year = {2004}, month = {2004/10/01/}, pages = {117 - 120}, abstract = {To identify previously unknown small molecules that inhibit cell cycle machinery, we performed a chemical genetic screen in Xenopus extracts. One class of inhibitors, termed ubistatins, blocked cell cycle progression by inhibiting cyclin B proteolysis and inhibited degradation of ubiquitinated Sic1 by purified proteasomes. Ubistatins blocked the binding of ubiquitinated substrates to the proteasome by targeting the ubiquitin-ubiquitin interface of Lys48-linked chains. The same interface is recognized by ubiquitin-chain receptors of the proteasome, indicating that ubistatins act by disrupting a critical protein-protein interaction in the ubiquitin-proteasome system.}, doi = {10.1126/science.1100946}, url = {http://www.sciencemag.org/cgi/content/abstract/sci;306/5693/117}, author = {Verma,Rati and Peters,Noel R. and D{\textquoteright}Onofrio,Mariapina and Tochtrop,Gregory P. and Sakamoto,Kathleen M. and Varadan,Ranjani and Zhang,Mingsheng and Coffino,Philip and Fushman, David and Deshaies,Raymond J. and King,Randall W.} } @article {14376, title = {Understanding tuberculosis epidemiology using structured statistical models}, journal = {Artificial Intelligence in Medicine}, volume = {30}, year = {2004}, month = {2004/03//}, pages = {233 - 256}, abstract = {Molecular epidemiological studies can provide novel insights into the transmission of infectious diseases such as tuberculosis. Typically, risk factors for transmission are identified using traditional hypothesis-driven statistical methods such as logistic regression. However, limitations become apparent in these approaches as the scope of these studies expand to include additional epidemiological and bacterial genomic data. Here we examine the use of Bayesian models to analyze tuberculosis epidemiology. We begin by exploring the use of Bayesian networks (BNs) to identify the distribution of tuberculosis patient attributes (including demographic and clinical attributes). Using existing algorithms for constructing BNs from observational data, we learned a BN from data about tuberculosis patients collected in San Francisco from 1991 to 1999. We verified that the resulting probabilistic models did in fact capture known statistical relationships. Next, we examine the use of newly introduced methods for representing and automatically constructing probabilistic models in structured domains. We use statistical relational models (SRMs) to model distributions over relational domains. SRMs are ideally suited to richly structured epidemiological data. We use a data-driven method to construct a statistical relational model directly from data stored in a relational database. The resulting model reveals the relationships between variables in the data and describes their distribution. We applied this procedure to the data on tuberculosis patients in San Francisco from 1991 to 1999, their Mycobacterium tuberculosis strains, and data on contact investigations. The resulting statistical relational model corroborated previously reported findings and revealed several novel associations. These models illustrate the potential for this approach to reveal relationships within richly structured data that may not be apparent using conventional statistical approaches. We show that Bayesian methods, in particular statistical relational models, are an important tool for understanding infectious disease epidemiology.}, keywords = {Bayesian networks, epidemiology, Probabilistic and statistical relational models, Tuberculosis}, isbn = {0933-3657}, doi = {10.1016/j.artmed.2003.11.003}, url = {http://www.sciencedirect.com/science/article/pii/S0933365703001337}, author = {Getoor, Lise and Rhee,Jeanne T and Koller,Daphne and Small,Peter} } @article {17460, title = {Universal Usability: Pushing Human-Computer Interaction Research to Empower Every Citizen}, journal = {Media access: social and psychological dimensions of new technology use}, year = {2004}, month = {2004///}, pages = {255 - 255}, author = {Shneiderman, Ben} } @article {13886, title = {Use of Minimal Lexical Conceptual Structures for Single-Document Summarization}, year = {2004}, month = {2004/06//}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {This reports provides an overview of the findings and software that have evolved from the Use of Minimal Lexical Conceptual Structures for Single-Document Summarization project over the last six months. We present the major goals that have been achieved and discuss some of the open issues that we intend to address in the near future. This report also contains some details on the usage of some software that has been implemented during the project.}, keywords = {*COMPUTATIONAL LINGUISTICS, AUTOMATIC HEADLINE GENERATION, CYBERNETICS, DOCUMENT SUMMARIZATION, Information retrieval, INFORMATION SCIENCE, linguistics, Machine translation}, url = {http://stinet.dtic.mil/oai/oai?\&verb=getRecord\&metadataPrefix=html\&identifier=ADA458797}, author = {Dorr, Bonnie J and Habash,Nizar Y and Monz,Christof and Schwartz,Richard} } @article {17469, title = {User interface design with speech technologies : A cognitive limitations review}, journal = {Sprache und Datenverarbeitung}, volume = {28}, year = {2004}, month = {2004///}, pages = {101 - 109}, keywords = {Communication homme-machine, computational linguistics, Human-computer communication, interface, Linguistique informatique, Speech processing, Traitement automatique de la parole}, isbn = {0343-5202}, url = {http://cat.inist.fr/?aModele=afficheN\&cpsidt=16961708}, author = {Shneiderman, Ben} } @inbook {16293, title = {Using the TIGR Assembler in Shotgun Sequencing Projects}, booktitle = {Bacterial Artificial Chromosomes}, series = {Methods in Molecular Biology}, volume = {255}, year = {2004}, month = {2004///}, pages = {279 - 294}, publisher = {Humana Press}, organization = {Humana Press}, abstract = {The TIGR Assembler (TA) ( 1 ) is the sequence assembly program used in sequencing projects at The Institute for Genomic Research (TIGR). Development of the TA was based on the experience obtained in more than 20 sequencing projects completed at TIGR ( see http://www.tigr.org ). This extensive experience led to a sequence assembler that produces few misassemblies ( 2 , 3 ) and has been used successfully in whole-genome shotgun sequencing of prokaryotic and eukaryotic organisms, bacterial artificial chromosome-based sequencing of eukaryotic organisms, and expressed sequence tag assembly.}, isbn = {978-1-59259-752-9}, url = {http://dx.doi.org/10.1385/1-59259-752-1:279}, author = {Pop, Mihai and Kosack,Dan}, editor = {Zhao,Shaying and Stodolsky,Marvin} } @conference {17807, title = {Utilizing volatile external information during planning}, booktitle = {Proceedings of the European Conference on Artificial Intelligence (ECAI)}, year = {2004}, month = {2004///}, pages = {647 - 651}, author = {Au,T. C and Nau, Dana S. and V.S. Subrahmanian} } @article {15490, title = {Validating quality of service for reusable software via model-integrated distributed continuous quality assurance}, journal = {Software Reuse: Methods, Techniques, and Tools}, year = {2004}, month = {2004///}, pages = {286 - 295}, abstract = {Quality assurance (QA) tasks, such as testing, profiling, and performance evaluation, have historically been done in-house on developer-generated workloads and regression suites. Performance-intensive systems software, such as that found in the scientific computing grid and distributed real-time and embedded (DRE) domains, increasingly run on heterogeneous combinations of OS, compiler, and hardware platforms. Such software has stringent quality of service (QoS) requirements and often provides a variety of configuration options to optimize QoS. As a result, QA performed solely in-house is inadequate since it is hard to manage software variability, i.e., ensuring software quality on all supported target platforms across all desired configuration options. This paper describes how the Skoll project is addressing these issues by developing advanced QA processes and tools that leverage the extensive computing resources of user communities in a distributed, continuous manner to improve key software quality attributes.}, doi = {10.1007/978-3-540-27799-6_24}, author = {Krishna,A. and Schmidt,D. and Memon, Atif M. and Porter, Adam and Sevilla,D.} } @article {12942, title = {Variation of toxigenic Vibrio cholerae O1 in the aquatic environment of Bangladesh and its correlation with the clinical strains}, journal = {Microbiology and immunology}, volume = {48}, year = {2004}, month = {2004///}, pages = {773 - 777}, author = {Islam,M. S. and Talukder,K. A. and Khan,N. H. and Mahmud,Z. H. and Rahman,M. Z. and Nair,G. B. and Siddique,A. K. M. and Yunus,M. and Sack,D. A. and Sack,R. B. and Rita R Colwell} } @article {16888, title = {Visual Content Mining in Multimedia Documents-Indexing Issues in Supporting Similarity Searching}, journal = {Lecture Notes in Computer Science}, volume = {3332}, year = {2004}, month = {2004///}, pages = {463 - 470}, author = {Samet, Hanan} } @article {17496, title = {Visualization and analysis of microarray and gene ontology data with treemaps}, journal = {BMC Bioinformatics}, volume = {5}, year = {2004}, month = {2004/06/28/}, pages = {84 - 84}, abstract = {The increasing complexity of genomic data presents several challenges for biologists. Limited computer monitor views of data complexity and the dynamic nature of data in the midst of discovery increase the challenge of integrating experimental results with information resources. The use of Gene Ontology enables researchers to summarize results of quantitative analyses in this framework, but the limitations of typical browser presentation restrict data access.}, isbn = {1471-2105}, doi = {10.1186/1471-2105-5-84}, url = {http://www.biomedcentral.com/1471-2105/5/84}, author = {Baehrecke,Eric H and Dang,Niem and Babaria,Ketan and Shneiderman, Ben} } @article {14578, title = {Whole-genome shotgun assembly and comparison of human genome assemblies}, journal = {Proceedings of the National Academy of Sciences of the United States of America}, volume = {101}, year = {2004}, month = {2004///}, pages = {1916 - 1916}, author = {Istrail,S. and Sutton,G. G and Florea,L. and Halpern,A. L and Mobarry,C. M and Lippert,R. and Walenz,B. and Shatkay,H. and Dew,I. and Miller,J. R and others} } @article {14486, title = {A workshop report: mining for and from the Semantic Web at KDD 2004}, journal = {SIGKDD Explor. Newsl.}, volume = {6}, year = {2004}, month = {2004/12//}, pages = {142 - 143}, abstract = {The international workshop on Mining for and from the Semantic Web (MSW) at the KDD 2004 successfully brought together people from the communities Semantic Web and Knowledge Discovery. The goal of the workshop was to strengthen the communication and interaction between these communities as there is currently an agreement that both can benefit largely from each other. Overall the contributions and discussions showed that today mining for the semantic web is the primarily targeted research area. However, with a growing amount of available semantic web data also mining from the semantic web will be more prominent.}, isbn = {1931-0145}, doi = {10.1145/1046456.1046482}, url = {http://doi.acm.org/10.1145/1046456.1046482}, author = {Hotho,Andreas and Sure,York and Getoor, Lise} } @book {18790, title = {19th Biennial Conference on Mechanical Vibration and Noise}, year = {2003}, month = {2003///}, publisher = {American Society of Mechanical Engineers}, organization = {American Society of Mechanical Engineers}, author = {Gupta,A. K. and Fadel,G. M. and Lewicki,D. G. and Shabana,A. A. and Royston,T. J. and Gupta,S.K. and Hayes,C. and Herrmann,J.W. and Dym,C. L. and Schmidt,L. C.} } @conference {14055, title = {A 2D profile reconstruction in a multilayered waveguide structure}, booktitle = {Antennas and Propagation Society International Symposium, 2003. IEEE}, volume = {1}, year = {2003}, month = {2003/06//}, pages = {531 - 534 vol.1 - 531 - 534 vol.1}, abstract = {We discuss the problem of finding a profile or its location for a 2D scattering of electromagnetic waves with fixed frequencies in a waveguide multilayered domain. We use the dual space method (DSM) of Colton and Monk. Our goal is to extend our previous work of TE and TM cases to the more complicated case of a waveguide. We emphasize on the frequency range in the reconstruction.}, keywords = {(mathematics);, 2D, dual, duality, electromagnetic, equations;, inhomogeneous, Maxwell, media;, method;, multilayered, multilayers;, profile, reconstruction;, scattering;, space, structure;, theory;, wave, waveguide, waveguides;}, doi = {10.1109/APS.2003.1217513}, author = {Seydou,F. and Duraiswami, Ramani and Seppanen,T.} } @article {12955, title = {A 4-Year Study of the Epidemiology of Vibrio Cholerae in Four Rural Areas of Bangladesh}, journal = {Journal of Infectious DiseasesJ Infect Dis.}, volume = {187}, year = {2003}, month = {2003/01/01/}, pages = {96 - 101}, abstract = {How Vibrio cholerae spreads around the world and what determines its seasonal peaks in endemic areas are not known. These features of cholera have been hypothesized to be primarily the result of environmental factors associated with aquatic habitats that can now be identified. Since 1997, fortnightly surveillance in 4 widely separated geographic locations in Bangladesh has been performed to identify patients with cholera and to collect environmental data. A total of 5670 patients (53\% <5 years of age) have been studied; 14.3\% had cholera (10.4\% due to V. cholerae O1 El Tor, 3.8\% due to O139). Both serogroups were found in all locations; outbreaks were seasonal and often occurred simultaneously. Water-use patterns showed that bathing and washing clothes in tube-well water was significantly protective in two of the sites. These data will be correlated with environmental factors, to develop a model for prediction of cholera outbreaks}, isbn = {0022-1899, 1537-6613}, doi = {10.1086/345865}, url = {http://jid.oxfordjournals.org/content/187/1/96}, author = {Sack,R. Bradley and Siddique,A. Kasem and Longini,Ira M. and Nizam,Azhar and Yunus,Md and M. Sirajul Islam and Morris,Jr and Ali,Afsar and Huq,Anwar and Nair,G. Balakrish and Qadri,Firdausi and Faruque,Shah M. and Sack,David A. and Rita R Colwell} } @conference {16901, title = {Accessing diverse geo-referenced data sources with the SAND spatial DBMS}, booktitle = {Proceedings of the 2003 annual national conference on Digital government research}, series = {dg.o {\textquoteright}03}, year = {2003}, month = {2003///}, pages = {1 - 4}, publisher = {Digital Government Society of North America}, organization = {Digital Government Society of North America}, abstract = {The Internet has become the most frequently accessed medium for obtaining various types of data. In particular, government agencies, academic institutions, and private enterprises have published gigabytes of geo-referenced data on the Web. However, to obtain geo-referenced data from the Web successfully, systems must be designed to be capable of understanding the data sets published in different data formats. Also, even if the data sets are available in a simple known format, they often have poorly defined structures. With these issues in mind, we have developed an Internet-enabled data collection and conversion utility that interfaces with our prototype spatial database system, SAND. Using this utility, data can be retrieved from many different sources on the Web and converted into a format understandable by the SAND spatial database management system. Our collection and conversion utility is able to import the most popular data formats; namely, ESRI Shapefiles, Microsoft Excel files, HTML files, and GML files. Data in unstructured formats are verified for correct selection of the data types and handling of missing tuples before the insertion operation into the database. Moreover, our utility makes it possible to download any nonspatial data set and combine it internally with a relevant spatial data set. These features are accessible through a spreadsheet-like interface for online editing and structuring of data.}, url = {http://dl.acm.org/citation.cfm?id=1123196.1123206}, author = {Sankaranarayanan,Jagan and Tanin,Egemen and Samet, Hanan and Brabec,Frantisek} } @article {18652, title = {An adaptive quality of service aware middleware for replicated services}, journal = {Parallel and Distributed Systems, IEEE Transactions on}, volume = {14}, year = {2003}, month = {2003/11//}, pages = {1112 - 1125}, abstract = {A dependable middleware should be able to adaptively share the distributed resources it manages in order to meet diverse application requirements, even when the quality of service (QoS) is degraded due to uncertain variations in load and unanticipated failures. We have addressed this issue in the context of a dependable middleware that adaptively manages replicated servers to deliver a timely and consistent response to time-sensitive client applications. These applications have specific temporal and consistency requirements, and can tolerate a certain degree of relaxed consistency in exchange for better response time. We propose a flexible QoS model that allows clients to specify their timeliness and consistency constraints. We also propose an adaptive framework that dynamically selects replicas to service a client{\textquoteright}s request based on the prediction made by probabilistic models. These models use the feedback from online performance monitoring of the replicas to provide probabilistic guarantees for meeting a client{\textquoteright}s QoS specification. The experimental results we have obtained demonstrate the role of feedback and the efficacy of simple analytical models for adaptively sharing the available replicas among the users under different workload scenarios.}, keywords = {distributed resource sharing, Middleware, online performance monitoring, probabilistic modeling, QoS specification, quality of service, replica consistency, replicated services, resource allocation, time-sensitive client applications, timeliness constraints}, isbn = {1045-9219}, doi = {10.1109/TPDS.2003.1247672}, author = {Krishnamurthy,Sudha and Sanders,W. H. and Michel Cukier} } @inbook {12738, title = {Airborne Video Registration for Activity Monitoring}, booktitle = {Video RegistrationVideo Registration}, series = {The Kluwer International Series in Video Computing}, volume = {5}, year = {2003}, month = {2003///}, pages = {130 - 143}, publisher = {Springer US}, organization = {Springer US}, abstract = {The analysis of ground activities involving vehicles and humans is of interest in airborne surveillance applications. The high spatiotemporal resolution of a video camera makes it the sensor of choice for such applications. In the past, video sensors were not preferred, precisely because of the high volume of data generated, which had to be processed manually for the most part. Further, the moving platform gives rise to numerous false alarms.}, isbn = {978-1-4615-0459-7}, url = {http://dx.doi.org/10.1007/978-1-4615-0459-7_6}, author = {Shekhar,Chandra and Chellapa, Rama}, editor = {Shah,Mubarak and Kumar,Rakesh and Shah,Mubarak} } @article {14058, title = {Analysis of particular phononic structures using single integral equations}, journal = {The Journal of the Acoustical Society of America}, volume = {113}, year = {2003}, month = {2003///}, pages = {2284 - 2284}, abstract = {A fast method for determining phononic (and photonic) bandgaps in composite materials is developed. It is known that in the propagation of waves in a 3D medium containing N scatterers arranged periodically, there exist refractive indices for which such structures have bandgaps, i.e., frequencies for which no waves can propagate inside. Our task is to find the frequencies that generate these prohibited waves. This requires the solution of an eigenvalue problem for the Helmholtz operator. To solve this problem we choose an alternate route which uses boundary integral equations. We derive a single integral equation on each of the interfaces between the outer region and the scatterers, considering a general transmission boundary condition, by using a hybrid method using layer potentials and Green{\textquoteright}s formula. This approach reduces the number of unknowns considerably in comparison to other methods, but requires the treatment of large dense matrices and many matrix vector multiplications. To remedy this, we use the Fast Multipole Method. For solving the eigenvalue problem we discuss two methods: the Newton method and a method based on the Cauchy formula. Details of the numerical implementation, and results will be presented for different cases: sound hard, sound soft, impedance and transmission boundary conditions. [Work partially supported by NSF Award 0219681 is gratefully acknowledged.]}, url = {http://link.aip.org/link/?JAS/113/2284/1}, author = {Seydou,Fadoulourahmane and Duraiswami, Ramani and Gumerov, Nail A.} } @article {12091, title = {An Analysis of the Layer 2 Handoff costs in Wireless Local Area Networks}, journal = {ACM Computer Communications Review}, volume = {33}, year = {2003}, month = {2003///}, author = {Mishra,A. and Shin,M. H. and Arbaugh, William A.} } @article {17637, title = {On the approximability of clique and related maximization problems}, journal = {Journal of Computer and System Sciences}, volume = {67}, year = {2003}, month = {2003/11//}, pages = {633 - 651}, abstract = {We consider approximations of the form n1-o(1) for the Maximum Clique problem, where n is the number of vertices in the input graph and where the {\textquotedblleft}o(1){\textquotedblright} term goes to zero as n increases. We show that sufficiently strong negative results for such problems, which we call strong inapproximability results, have interesting consequences for exact computation. A simple sampling method underlies most of our results.}, keywords = {Approximation algorithms, Clique, Inapproximability, Independent set, Packing integer programs, random sampling}, isbn = {0022-0000}, doi = {10.1016/S0022-0000(03)00110-7}, url = {http://www.sciencedirect.com/science/article/pii/S0022000003001107}, author = {Srinivasan, Aravind} } @article {17556, title = {Approximating the domatic number}, journal = {SIAM Journal on Computing}, volume = {32}, year = {2003}, month = {2003///}, pages = {172 - 195}, abstract = {A set of vertices in a graph is a dominating set if every vertex outside the set hasa neighbor in the set. The domatic number problem is that of partitioning the vertices of a graph into the maximum number of disjoint dominating sets. Let n denote the number of vertices, δ the minimum degree, and ∆ the maximum degree. We show that every graph has a domatic partition with (1 - o(1))(δ + 1)/ ln n dominating sets and, moreover, that such a domatic partition can be found in polynomial-time. This implies a (1 + o(1)) ln n-approximation algorithm for domatic number, since the domatic number is always at most δ+1. We also show this to be essentially best possible. Namely, extending the approximation hardness of set cover by combining multiprover protocols with zero-knowledge techniques, we show that for every ϵ > 0, a (1 - ϵ) ln n-approximation implies that NP ⊆ DTIME(nO(log log n)). This makes domatic number the first natural maximization problem (known to the authors) that is provably approximable to within polylogarithmic factors but no better. We also show that every graph has a domatic partition with (1 - o(1))(δ + 1)/ ln ∆ dominating sets, where the {\textquotedblleft}o(1){\textquotedblright} term goes to zero as ∆ increases. This can be turned into an efficient algorithm that produces a domatic partition of {\textohm}(δ/ ln ∆) sets. }, author = {Feige,U. and Halld{\'o}rsson,M.M. and Kortsarz,G. and Srinivasan, Aravind} } @inbook {17558, title = {Approximation Algorithms for Channel Allocation Problems in Broadcast Networks}, booktitle = {Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques}, series = {Lecture Notes in Computer Science}, volume = {2764}, year = {2003}, month = {2003///}, pages = {821 - 826}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {We study two packing problems that arise in the area of dissemination-based information systems; a second theme is the study of distributed approximation algorithms. The problems considered have the property that the space occupied by a collection of objects together could be significantly less than the sum of the sizes of the individual objects. In the Channel Allocation Problem , there are users who request subsets of items. There are a fixed number of channels that can carry an arbitrary amount of information. Each user must get all of the requested items from one channel, i.e., all the data items of each request must be broadcast on some channel. The load on any channel is the number of items that are broadcast on that channel; the objective is to minimize the maximum load on any channel. We present approximation algorithms for this problem and also show that the problem is MAX-SNP hard. The second problem is the Edge Partitioning Problem addressed by Goldschmidt, Hochbaum, Levin, and Olinick ( Networks, 41:13-23, 2003 ). Each channel here can deliver information to at most k users, and we aim to minimize the total load on all channels. We present an O ( n 1/3 ){\textendash}approximation algorithm and also show that the algorithm can be made fully distributed with the same approximation guarantee; we also generalize to the case of hypergraphs.}, isbn = {978-3-540-40770-6}, url = {http://dx.doi.org/10.1007/978-3-540-45198-3_5}, author = {Gandhi,Rajiv and Khuller, Samir and Srinivasan, Aravind and Wang,Nan}, editor = {Arora,Sanjeev and Jansen,Klaus and Rolim,Jos{\'e} and Sahai,Amit} } @article {18661, title = {AQuA: an adaptive architecture that provides dependable distributed objects}, journal = {Computers, IEEE Transactions on}, volume = {52}, year = {2003}, month = {2003/01//}, pages = {31 - 50}, abstract = {Building dependable distributed systems from commercial off-the-shelf components is of growing practical importance. For both cost and production reasons, there is interest in approaches and architectures that facilitate building such systems. The AQuA architecture is one such approach; its goal is to provide adaptive fault tolerance to CORBA applications by replicating objects. The AQuA architecture allows application programmers to request desired levels of dependability during applications{\textquoteright} runtimes. It provides fault tolerance mechanisms to ensure that a CORBA client can always obtain reliable services, even if the CORBA server object that provides the desired services suffers from crash failures and value faults. AQuA includes a replicated dependability manager that provides dependability management by configuring the system in response to applications{\textquoteright} requests and changes in system resources due to faults. It uses Maestro/Ensemble to provide group communication services. It contains a gateway to intercept standard CORBA IIOP messages to allow any standard CORBA application to use AQuA. It provides different types of replication schemes to forward messages reliably to the remote replicated objects. All of the replication schemes ensure strong, data consistency among replicas. This paper describes the AQuA architecture and presents, in detail, the active replication pass-first scheme. In addition, the interface to the dependability manager and the design of the dependability manager replication are also described. Finally, we describe performance measurements that were conducted for the active replication pass-first scheme, and we present results from our study of fault detection, recovery, and blocking times.}, keywords = {active replication pass-first scheme, adaptive architecture, adaptive fault tolerance, AQuA, CORBA, data consistency, data integrity, dependable distributed objects, distributed object management, performance measurements, quality of service, replicated dependability manager, replication schemes, software fault tolerance, system resources}, isbn = {0018-9340}, doi = {10.1109/TC.2003.1159752}, author = {Ren,Yansong and Bakken,D. E. and Courtney,T. and Michel Cukier and Karr,D. A. and Rubel,P. and Sabnis,C. and Sanders,W. H. and Schantz,R.E. and Seri,M.} } @article {13250, title = {AUDIO-P2. 1: PITCH AND TIMBRE MANIPULATIONS USING CORTICAL REPRESENTATION OF SOUND}, journal = {IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS SPEECH AND SIGNAL PROCESSING}, volume = {5}, year = {2003}, month = {2003///}, author = {Zotkin,Dmitry N and Shamma,S.A. and Ru,P. and Duraiswami, Ramani and Davis, Larry S.} } @article {14061, title = {Augmented intelligibility in simultaneous multi-talker environments}, journal = {Proc. International Conference on Auditory Display (ICAD{\textquoteright}03)}, year = {2003}, month = {2003///}, pages = {71 - 74}, abstract = {Speech intelligibility can be severely compromised inenvironments where there are several competing speakers. It may be possible, however, to improve speech intelligibility in such environments by manipulating certain acoustic parameters known to facilitate the segregation of competing signals. The first step in designing such a feature-rich audio display is to understand the significant elements of human auditory perception that affect information transmission capacity. We review a series of experiments to examine the impact of different audio-display design parameters on overall intelligibility of simultaneous speech messages and show how using these features may improve intelligibility. }, author = {Mesgarani,N. and Shamma,S. and Grant,K.W. and Duraiswami, Ramani} } @conference {14904, title = {Automatic thumbnail cropping and its effectiveness}, booktitle = {Proceedings of the 16th annual ACM symposium on User interface software and technology}, series = {UIST {\textquoteright}03}, year = {2003}, month = {2003///}, pages = {95 - 104}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Thumbnail images provide users of image retrieval and browsing systems with a method for quickly scanning large numbers of images. Recognizing the objects in an image is important in many retrieval tasks, but thumbnails generated by shrinking the original image often render objects illegible. We study the ability of computer vision systems to detect key components of images so that automated cropping, prior to shrinking, can render objects more recognizable. We evaluate automatic cropping techniques 1) based on a general method that detects salient portions of images, and 2) based on automatic face detection. Our user study shows that these methods result in small thumbnails that are substantially more recognizable and easier to find in the context of visual search.}, keywords = {Face detection, image cropping, saliency map, thumbnail, usability study, visual search, zoomable user interfaces}, isbn = {1-58113-636-6}, doi = {10.1145/964696.964707}, url = {http://doi.acm.org/10.1145/964696.964707}, author = {Suh,Bongwon and Ling,Haibin and Bederson, Benjamin B. and Jacobs, David W.} } @conference {12191, title = {Automatic thumbnail cropping and its effectiveness}, booktitle = {Proceedings of the 16th annual ACM symposium on User interface software and technology}, year = {2003}, month = {2003///}, pages = {95 - 104}, author = {Suh,B. and Ling,H. and Bederson, Benjamin B. and Jacobs, David W.} } @inbook {18896, title = {Automating DAML-S Web Services Composition Using SHOP2}, booktitle = {The Semantic Web - ISWC 2003}, series = {Lecture Notes in Computer Science}, volume = {2870}, year = {2003}, month = {2003///}, pages = {195 - 210}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {The DAML-S Process Model is designed to support the application of AI planning techniques to the automated composition of Web services. SHOP2 is an Hierarchical Task Network (HTN) planner well-suited for working with the Process Model. We have proven the correspondence between the semantics of SHOP2 and the situation calculus semantics of the Process Model. We have also implemented a system which soundly and completely plans over sets of DAML-S descriptions using a SHOP2 planner, and then executes the resulting plans over the Web. We discuss the challenges and difficulties of using SHOP2 in the information-rich and human-oriented context of Web services.}, keywords = {Computer science}, isbn = {978-3-540-20362-9}, url = {http://www.springerlink.com/content/rm5ejwlmbw0mdv97/abstract/}, author = {Wu,Dan and Parsia,Bijan and Sirin,Evren and Hendler,James and Nau, Dana S.}, editor = {Fensel,Dieter and Sycara,Katia and Mylopoulos,John} } @article {15239, title = {Bistro: a scalable and secure data transfer service for digital government applications}, journal = {Communications of the ACM}, volume = {46}, year = {2003}, month = {2003/01//}, pages = {50 - 51}, abstract = {Government at all levels is a major collector and provider of data.Our project focuses on the collection of data over wide-area networks (WANs) and addresses the scalability issues that arise in the context of Internet-based massive data collection applications. Furthermore, security, due to the need for privacy and integrity of the data, is a central issue for data collection applications that use a public infrastructure such as the Internet. Numerous digital government applications require data collection over WANs [5].One compelling example of such an application is the Internal Revenue Service{\textquoteright}s electronic submission of income tax forms. Other digital government applications include collecting census data, federal statistics, and surveys; gathering and tallying of electronic votes; collecting crime data for the U.S. Justice department; collecting data from sensors for disaster response applications; collecting data from geological surveys; collecting electronic filings of patents, permits, and securities (for SEC) applications; grant proposals and contract bids submissions; and so on. All these applications have scalability and security needs in common.The poor performance that may be experienced by current digital government users, given the existing state of technology (as in Figure 1a), is largely due to how (independent) data transfers using TCP/IP work over the Internet. TCP/IP is good at equally sharing bandwidth between data streams, which in large-scale applications can lead to poor performance for individual clients (as they receive only a very small share of this bandwidth). Given that TCP/IP is here to stay for the foreseeable future, what is needed is a scalable yet cost- effective solution that can be easily deployed over the existing Internet technology.We are designing and developing a system called Bistro, which addresses the scalability needs of digital government data collection applications while allowing them to share the same infrastructure and resources efficiently, cost-effectively, and securely [1]. Bistro{\textquoteright}s basic approach is to introduce intermediate hosts---bistros---which allow replacement of a traditionally "synchronized client push" approach with a "nonsynchronized combination of client-push and server-pull" approach (as depicted in Figure 1b). This in turn allows spreading of the workload on the destination server and the network over time, with subsequent elimination of hot spots as well as significant improvements in performance for both clients and servers. Our ongoing research [2, 4] indicates that orders of magnitude of improvement can be achieved with the Bistro architecture and the corresponding data collection algorithms it affords.Bistro{\textquoteright}s design allows for a gradual deployment and experimentation over the Internet (by simply downloading Bistro server software and installing it on public servers). Bistro{\textquoteright}s security protocol and trust structure [3] are designed such that only encrypted data travels through (not necessarily trusted) bistros. This means a government agency does not need to trust bistros installed by other agencies or commercial institutions. At the same time, these (untrusted) bistros can significantly improve the agency{\textquoteright}s data collection performance. Each application (within each agency) can have its own scalability, security, fault tolerance, and other data collection needs, and these applications and agencies can still share available resources, if so desired, across all Bistro servers.We believe an appropriately designed single infrastructure such as Bistro can address all digital government wide-area data collection needs in a scalable, secure, and cost-effective manner. (For more information, see bourbon.usc.edu/iml/bistro/.}, isbn = {0001-0782}, doi = {10.1145/602421.602448}, url = {http://doi.acm.org/10.1145/602421.602448}, author = {Golubchik,Leana and Cheng,William C. and Chou,Cheng-Fu and Khuller, Samir and Samet, Hanan and Wan,C. Justin} } @article {16899, title = {Bistro: a scalable and secure data transfer service for digital government applications}, journal = {Commun. ACM}, volume = {46}, year = {2003}, month = {2003/01//}, pages = {50 - 51}, abstract = {Government at all levels is a major collector and provider of data.Our project focuses on the collection of data over wide-area networks (WANs) and addresses the scalability issues that arise in the context of Internet-based massive data collection applications. Furthermore, security, due to the need for privacy and integrity of the data, is a central issue for data collection applications that use a public infrastructure such as the Internet. Numerous digital government applications require data collection over WANs [5].One compelling example of such an application is the Internal Revenue Service{\textquoteright}s electronic submission of income tax forms. Other digital government applications include collecting census data, federal statistics, and surveys; gathering and tallying of electronic votes; collecting crime data for the U.S. Justice department; collecting data from sensors for disaster response applications; collecting data from geological surveys; collecting electronic filings of patents, permits, and securities (for SEC) applications; grant proposals and contract bids submissions; and so on. All these applications have scalability and security needs in common.The poor performance that may be experienced by current digital government users, given the existing state of technology (as in Figure 1a), is largely due to how (independent) data transfers using TCP/IP work over the Internet. TCP/IP is good at equally sharing bandwidth between data streams, which in large-scale applications can lead to poor performance for individual clients (as they receive only a very small share of this bandwidth). Given that TCP/IP is here to stay for the foreseeable future, what is needed is a scalable yet cost- effective solution that can be easily deployed over the existing Internet technology.We are designing and developing a system called Bistro, which addresses the scalability needs of digital government data collection applications while allowing them to share the same infrastructure and resources efficiently, cost-effectively, and securely [1]. Bistro{\textquoteright}s basic approach is to introduce intermediate hosts---bistros---which allow replacement of a traditionally "synchronized client push" approach with a "nonsynchronized combination of client-push and server-pull" approach (as depicted in Figure 1b). This in turn allows spreading of the workload on the destination server and the network over time, with subsequent elimination of hot spots as well as significant improvements in performance for both clients and servers. Our ongoing research [2, 4] indicates that orders of magnitude of improvement can be achieved with the Bistro architecture and the corresponding data collection algorithms it affords.Bistro{\textquoteright}s design allows for a gradual deployment and experimentation over the Internet (by simply downloading Bistro server software and installing it on public servers). Bistro{\textquoteright}s security protocol and trust structure [3] are designed such that only encrypted data travels through (not necessarily trusted) bistros. This means a government agency does not need to trust bistros installed by other agencies or commercial institutions. At the same time, these (untrusted) bistros can significantly improve the agency{\textquoteright}s data collection performance. Each application (within each agency) can have its own scalability, security, fault tolerance, and other data collection needs, and these applications and agencies can still share available resources, if so desired, across all Bistro servers.We believe an appropriately designed single infrastructure such as Bistro can address all digital government wide-area data collection needs in a scalable, secure, and cost-effective manner. (For more information, see bourbon.usc.edu/iml/bistro/.}, isbn = {0001-0782}, doi = {10.1145/602421.602448}, url = {http://doi.acm.org/10.1145/602421.602448}, author = {Golubchik,Leana and Cheng,William C. and Chou,Cheng-Fu and Khuller, Samir and Samet, Hanan and Wan,C. Justin} } @conference {14054, title = {A boundary element method for electromagnetic scattering by multiple cylinders}, booktitle = {Antennas and Propagation Society International Symposium, 2003. IEEE}, volume = {3}, year = {2003}, month = {2003/06//}, pages = {516 - 519 vol.3 - 516 - 519 vol.3}, abstract = {An integral equation approach is derived for an electromagnetic scattering from M multiple cylinders. The problem is two-dimensional and the integral equation is solved using the Nystrom method. We give numerical examples that illustrate the algorithm.}, keywords = {algorithm;, boundary, boundary-elements, cylinders;, electromagnetic, element, equations;, Fredholm, integral, method;, methods;, multiple, Nystrom, scattering;, two-dimensional, type, wave}, doi = {10.1109/APS.2003.1219899}, author = {Seydou,F. and Duraiswami, Ramani and Seppanen,T.} } @article {16996, title = {Bringing Treasures to the Surface: Previews and Overviews in a Prototype for the Library of Congress National Digital Library}, journal = {The craft of information visualization: readings and reflections}, year = {2003}, month = {2003///}, pages = {388 - 388}, author = {Marchionini,A.S. and Nation,D. and Karasik,S. and Cronnell,T. and Shneiderman, Ben and Spotfire,V.D.M.U. and Bederson, Benjamin B. and Data,T.S. and Hochheiser,H. and Shneiderman, Ben and others} } @inbook {16128, title = {Broadening Access to Large Online Databases by Generalizing Query Previews}, booktitle = {The Craft of Information VisualizationThe Craft of Information Visualization}, year = {2003}, month = {2003///}, pages = {31 - 37}, publisher = {Morgan Kaufmann}, organization = {Morgan Kaufmann}, address = {San Francisco}, abstract = {Companies, government agencies, and other types of organizations are making their large databases available to the world over the Internet. Current database front-ends do not give users information about the distribution of data. This leads many users to waste time and network resources posing queries that have either zero-hit or mega-hit result sets. Query previews form a novel visual approach for browsing large databases. Query previews supply data distribution information about the database that is being searched and give continuous feedback about the size of the result set for the query as it is being formed. On the other hand, query previews use only a few pre-selected attributes of the database. The distribution information is displayed only on these attributes. Unfortunately, many databases are formed of numerous relations and attributes. This paper introduces a generalization of query previews. We allow users to browse all of the relations and attributes of a database using a hierarchical browser. Any of the attributes can be used to display the distribution information, making query previews applicable to many public online databases.}, isbn = {978-1-55860-915-0}, url = {http://www.sciencedirect.com/science/article/pii/B978155860915050007X}, author = {Tanin,Egemen and Plaisant, Catherine and Shneiderman, Ben}, editor = {Bederson, Benjamin B. and Shneiderman, Ben} } @article {17694, title = {Building an Old-Fashioned Sparse Solver}, volume = {UMIACS-TR-2003-95}, year = {2003}, month = {2003/09/25/}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {A sparse matrix is a matrix with very few nonzero elements. Manyapplications in diverse fields give rise to linear systems of the form $Ax = b$, where $A$ is sparse. The problem in solving these systems is to take advantage of the preponderance of zero elements to reduce both memory use and comutation time. The purpose of this paper is to introduce students (and perhaps their teachers) to sparse matrix technology. It is impossible to treat all the techniques developed since the subject started in the 1960{\textquoteright}s. Instead, this paper constructs a sparse solver for positive definite systems that would have been state of the art around 1980, emphasizing equally theory and computational practice. It is hoped that a mastery of this material will allow the reader to study the subject independently. (UMIACS-TR-2003-95) }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/1312}, author = {Stewart, G.W.} } @conference {13359, title = {Cache-and-query for wide area sensor databases}, booktitle = {Proceedings of the 2003 ACM SIGMOD international conference on Management of data}, series = {SIGMOD {\textquoteright}03}, year = {2003}, month = {2003///}, pages = {503 - 514}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Webcams, microphones, pressure gauges and other sensors provide exciting new opportunities for querying and monitoring the physical world. In this paper we focus on querying wide area sensor databases, containing (XML) data derived from sensors spread over tens to thousands of miles. We present the first scalable system for executing XPATH queries on such databases. The system maintains the logical view of the data as a single XML document, while physically the data is fragmented across any number of host nodes. For scalability, sensor data is stored close to the sensors, but can be cached elsewhere as dictated by the queries. Our design enables self starting distributed queries that jump directly to the lowest common ancestor of the query result, dramatically reducing query response times. We present a novel query-evaluate gather technique (using XSLT) for detecting (1) which data in a local database fragment is part of the query result, and (2) how to gather the missing parts. We define partitioning and cache invariants that ensure that even partial matches on cached data are exploited and that correct answers are returned, despite our dynamic query-driven caching. Experimental results demonstrate that our techniques dramatically increase query throughputs and decrease query response times in wide area sensor databases.}, isbn = {1-58113-634-X}, doi = {10.1145/872757.872818}, url = {http://doi.acm.org/10.1145/872757.872818}, author = {Deshpande, Amol and Nath,Suman and Gibbons,Phillip B. and Seshan,Srinivasan} } @conference {16904, title = {Continuous k-nearest neighbor queries for continuously moving points with updates}, booktitle = {Proceedings of the 29th international conference on Very large data bases-Volume 29}, year = {2003}, month = {2003///}, pages = {512 - 523}, author = {Iwerks,G. S and Samet, Hanan and Smith,K.} } @conference {12304, title = {Cooperative peer groups in NICE}, booktitle = {INFOCOM 2003. Twenty-Second Annual Joint Conference of the IEEE Computer and Communications. IEEE Societies}, volume = {2}, year = {2003}, month = {2003///}, pages = {1272 - 1282 vol.2 - 1272 - 1282 vol.2}, abstract = {A distributed scheme for trust inference in peer-to-peer networks is presented. Our work is in context of the NICE system, which is a platform for implementing cooperative applications over the Internet. We describe a technique for efficiently storing user reputation information in a completely decentralized manner, and show how this information can be used to efficiently identify noncooperative users in NICE. We present a simulation based study of our algorithms, in which we show our scheme scales to thousands of users using modest amounts of storage, processing, and bandwidth at any individual node. Lastly, we show that our scheme is robust and can form cooperative groups in systems where the vast majority of users are malicious.}, keywords = {algorithm;, cooperative, decentralized, distributed, identification;, individual, inference, inference;, information, Internet;, malicious, manner;, mechanisms;, networks;, NICE, node;, noncooperative, peer-to-peer, platform;, reputation, retrieval;, storage;, system;, trust, users, users;}, doi = {10.1109/INFCOM.2003.1208963}, author = {Lee,S. and Sherwood,R. and Bhattacharjee, Bobby} } @article {16515, title = {Cost minimization during simulated evolution of paired neural networks leads to asymmetries and specialization}, journal = {Cognitive Systems Research}, volume = {4}, year = {2003}, month = {2003///}, pages = {365 - 383}, author = {Shkuro,Y. and Reggia, James A.} } @inbook {17639, title = {On the Covering Steiner Problem}, booktitle = {FST TCS 2003: Foundations of Software Technology and Theoretical Computer ScienceFST TCS 2003: Foundations of Software Technology and Theoretical Computer Science}, series = {Lecture Notes in Computer Science}, volume = {2914}, year = {2003}, month = {2003///}, pages = {244 - 251}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {The Covering Steiner problem is a common generalization of the k -MST and Group Steiner problems. An instance of the Covering Steiner problem consists of an undirected graph with edge-costs, and some subsets of vertices called groups , with each group being equipped with a non-negative integer value (called its requirement ); the problem is to find a minimum-cost tree which spans at least the required number of vertices from every group. When all requirements are equal to 1, this is the Group Steiner problem. While many covering problems (e.g., the covering integer programs such as set cover) become easier to approximate as the requirements increase, the Covering Steiner problem remains at least as hard to approximate as the Group Steiner problem; in fact, the best guarantees previously known for the Covering Steiner problem were worse than those for Group Steiner as the requirements became large. In this work, we present an improved approximation algorithm whose guarantee equals the best known guarantee for the Group Steiner problem.}, isbn = {978-3-540-20680-4}, url = {http://dx.doi.org/10.1007/978-3-540-24597-1_21}, author = {Gupta,Anupam and Srinivasan, Aravind}, editor = {Pandya,Paritosh and Radhakrishnan,Jaikumar} } @conference {17812, title = {The CPR model for summarizing video}, booktitle = {Proceedings of the 1st ACM international workshop on Multimedia databases}, series = {MMDB {\textquoteright}03}, year = {2003}, month = {2003///}, pages = {2 - 9}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Most past work on video summarization has been based on selecting key frames from videos. We propose a model of video summarization based on three important parameters: Priority (of frames), Continuity (of the summary), and non-Repetition (of the summary). In short, a summary must include high priority frames, must be continuous and non-repetitive. An optimal summary is one that maximizes an objective function based on these three parameters. We develop formal definitions of all these concepts and provide algorithms to find optimal summaries. We briefly report on the performance of these algorithms.}, keywords = {multimedia, Summarization, video}, isbn = {1-58113-726-5}, doi = {10.1145/951676.951679}, url = {http://doi.acm.org/10.1145/951676.951679}, author = {Fayzullin,M. and V.S. Subrahmanian and Picariello, A. and Sapino,M. L} } @book {17406, title = {The craft of information visualization: readings and reflections}, year = {2003}, month = {2003///}, publisher = {Morgan Kaufmann}, organization = {Morgan Kaufmann}, abstract = {Since the beginning of the computer age, researchers from many disciplines have sought to facilitate people{\textquoteright}s use of computers and to provide ways for scientists to make sense of the immense quantities of data coming out of them. One gainful result of these efforts has been the field of information visualization, whose technology is increasingly applied in scientific research, digital libraries, data mining, financial data analysis, market studies, manufacturing production control, and data discovery.This book collects 38 of the key papers on information visualization from a leading and prominent research lab, the University of Maryland{\textquoteright}s Human-Computer Interaction Lab (HCIL). Celebrating HCIL{\textquoteright}s 20th anniversary, this book presents a coherent body of work from a respected community that has had many success stories with its research and commercial spin-offs. Each chapter contains an introduction specifically written for this volume by two leading HCI researchers, to describe the connections among those papers and reveal HCIL{\textquoteright}s individual approach to developing innovations.*Presents key ideas, novel interfaces, and major applications of information visualization tools, embedded in inspirational prototypes.*Techniques can be widely applied in scientific research, digital libraries, data mining, financial data analysis, business market studies, manufacturing production control, drug discovery, and genomic studies.*Provides an "insider" view to the scientific process and evolution of innovation, as told by the researchers themselves.*This work comes from the prominent and high profile University of Maryland{\textquoteright}s Human Computer Interaction Lab}, keywords = {Computers / Computer Graphics, Computers / Computer Science, Computers / Digital Media / Desktop Publishing, Computers / General, Computers / Social Aspects / Human-Computer Interaction, Computers / User Interfaces, Human-computer interaction, Information Visualization, Science / General, User-centered system design}, isbn = {9781558609150}, author = {Bederson, Benjamin B. and Shneiderman, Ben} } @article {15380, title = {Critical fields and pulse durations for precessional switching of thin magnetic films}, journal = {Magnetics, IEEE Transactions on}, volume = {39}, year = {2003}, month = {2003/09//}, pages = {2504 - 2506}, abstract = {The precessional switching process of a uniformly magnetized thin film with in-plane anisotropy subject to pulsed magnetic fields applied in the film plane is analyzed. Critical fields required to achieve switching are studied for the case when the applied field is constant during the pulse duration and forms arbitrary angles with the hard axis. By using two integrals of magnetization motion, the explicit expressions for the critical field are derived. The formulas for durations of rectangular magnetic field pulses that guarantee the precessional switching of magnetization are presented as well.}, keywords = {anisotropy;, axis;, critical, durations;, field;, fields;, film;, films;, hard, in-plane, integrals;, magnetic, magnetisation, magnetization, magnetization;, magnetized, motion;, precessional, pulse, pulsed, rectangular, reversal;, switching;, thin, uniformly}, isbn = {0018-9464}, doi = {10.1109/TMAG.2003.816454}, author = {Bertotti,G. and Mayergoyz, Issak D and Serpico,C.} } @article {13752, title = {Cross-language headline generation for Hindi}, journal = {ACM Transactions on Asian Language Information Processing (TALIP)}, volume = {2}, year = {2003}, month = {2003/09//}, pages = {270 - 289}, abstract = {This paper presents new approaches to headline generation for English newspaper texts, with an eye toward the production of document surrogates for document selection in cross-language information retrieval. This task is difficult because the user must make decisions about relevance based on (often poor) translations of retrieved documents. To facilitate the decision-making process we need translations that can be assessed rapidly and accurately; our approach is to provide an English headline for the non-English document. We describe two approaches to headline generation and their application to the recent DARPA TIDES-2003 Surprise Language Exercise for Hindi. For comparison, we also implemented an alternative method for surrogate generation: a system that produces topic lists for (Hindi) articles. We present the results of a series of experiments comparing each of these approaches. We demonstrate in both automatic and human evaluations that our linguistically motivated approach outperforms two other surrogate-generation methods: a statistical system and a topic discovery system.}, isbn = {1530-0226}, doi = {10.1145/979872.979878}, url = {http://doi.acm.org/10.1145/979872.979878}, author = {Dorr, Bonnie J and Zajic, David and Schwartz,Richard} } @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} } @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 {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.} } @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} } @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 {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} } @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 {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} } @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} } @article {12950, title = {Effect of treatment on the dynamics of circulating hypodermin C in cattle naturally infested with Hypoderma lineatum (Diptera: Oestridae)}, journal = {Veterinary Parasitology}, volume = {113}, year = {2003}, month = {2003/05/01/}, pages = {263 - 272}, abstract = {An antigen capture ELISA, using a murine monoclonal antibody recognising recombinant hypodermin C (rHyC), was used to evaluate the influence of early treatment with eprinomectin (Eprinex{\textregistered}) or fenthion (Spotton{\textregistered}) on the kinetics of circulating hypodermin C in calves naturally infested with Hypoderma lineatum. No viable larvae were collected from treated animals, whereas a variable number of warbles were found in control animals. Treatment provoked a decrease in circulating HyC levels that was significant 9 days post-treatment (p.t.). Circulating antigen levels in the treated cattle remained detectable for approximately 99 days p.t. In contrast, control animals had no detectable antigen at 64 days p.t., 42 days earlier than in the treated animals. These results suggest that larvae were either gradually killed, resulting in slow release of antigen or they were encapsulated, leading to the slow liberation of antigen. Kinetics of circulating HyC did not differ among the two insecticide treatments. Antibodies persisted, in all groups, throughout the 120-day study. These results suggest that the antigen capture ELISA will be useful as a technique for detecting successful treatment of cattle grub infestations and for the detection of new infestations in previously infested cattle.}, keywords = {Capture ELISA, Cattle-arthropoda, Control methods-arthropoda, Eprinomectin, Fenthion, Hypoderma spp.}, isbn = {0304-4017}, doi = {10.1016/S0304-4017(03)00084-0}, url = {http://www.sciencedirect.com/science/article/pii/S0304401703000840}, author = {Douglas D Colwell and Panadero-Fontan,Rosario and L{\'o}pez-Sandez,Ceferino and Parra-Fernandez,Francisco and Paz-Silva,A and S{\'a}nchez-Andrade,Rita and D{\i}́ez-Ba{\~n}os,Pablo} } @conference {16772, title = {Efficient dissemination of aggregate data over the wireless web}, booktitle = {International Workshop on the Web and Databases (WebDB)}, year = {2003}, month = {2003///}, pages = {93 - 98}, author = {Sharaf,M. A and Sismanis,Y. and Labrinidis,A. and Chrysanthis,P. and Roussopoulos, Nick} } @article {12305, title = {Efficient peer-to-peer searches using result-caching}, journal = {Peer-to-Peer Systems II}, year = {2003}, month = {2003///}, pages = {225 - 236}, abstract = {Existing peer-to-peer systems implement a single function well: data lookup. There is now a wealth of research describing how to reliably disseminate, and to later retrieve, data in a scalable and load-balanced manner.}, author = {Bhattacharjee, Bobby and Chawathe,S. and Gopalakrishnan,V. and Keleher,P. and Silaghi,B.} } @conference {14051, title = {Electromagnetic scattering from a multilayered cylindrical waveguide}, booktitle = {Antennas and Propagation Society International Symposium, 2003. IEEE}, volume = {3}, year = {2003}, month = {2003/06//}, pages = {332 - 335 vol.3 - 332 - 335 vol.3}, abstract = {This paper is devoted to electromagnetic scattering from an N multilayered circular cylinder. We consider waveguides in the z direction; that is, we look for the solution of Maxwell equations along the z direction. We assume a dielectric core and derive a mode matching approach for solving the problem. A numerical result is presented that illustrates the algorithm.}, keywords = {circular, core;, cylinder;, cylindrical, dielectric, dielectric-loaded, electromagnetic, EM, equations;, matching;, Maxwell, mode, multilayered, scattering;, theory;, wave, waveguide, waveguide;, waveguides;}, doi = {10.1109/APS.2003.1219855}, author = {Seydou,F. and Duraiswami, Ramani and Seppanen,T.} } @conference {12200, title = {Electronic voting system usability issues}, booktitle = {Proceedings of the SIGCHI conference on Human factors in computing systems}, year = {2003}, month = {2003///}, pages = {145 - 152}, author = {Bederson, Benjamin B. and Lee,B. and Sherman,R.M. and Herrnson,P.S. and Niemi,R.G.} } @article {12952, title = {Emergence and Evolution of Vibrio Cholerae O139}, journal = {Proceedings of the National Academy of SciencesPNAS}, volume = {100}, year = {2003}, month = {2003/02/04/}, pages = {1304 - 1309}, abstract = {The emergence of Vibrio cholerae O139 Bengal during 1992{\textendash}1993 was associated with large epidemics of cholera in India and Bangladesh and, initially, with a total displacement of the existing V. cholerae O1 strains. However, the O1 strains reemerged in 1994 and initiated a series of disappearance and reemergence of either of the two serogroups that was associated with temporal genetic and phenotypic changes sustained by the strains. Since the initial emergence of the O139 vibrios, new variants of the pathogen derived from multiple progenitors have been isolated and characterized. The clinical and epidemiological characteristics of these strains have been studied. Rapid genetic reassortment in O139 strains appears to be a response to the changing epidemiology of V. cholerae O1 and also a strategy for persistence in competition with strains of the O1 serogroup. The emergence of V. cholerae O139 has provided a unique opportunity to witness genetic changes in V. cholerae that may be associated with displacement of an existing serogroup by a newly emerging one and, thus, provide new insights into the epidemiology of cholera. The genetic changes and natural selection involving both environmental and host factors are likely to influence profoundly the genetics, epidemiology, and evolution of toxigenic V. cholerae, not only in the Ganges Delta region of India and Bangladesh, but also in other areas of endemic and epidemic cholera.}, isbn = {0027-8424, 1091-6490}, doi = {10.1073/pnas.0337468100}, url = {http://www.pnas.org/content/100/3/1304}, author = {Faruque,Shah M. and Sack,David A. and Sack,R. Bradley and Rita R Colwell and Takeda,Yoshifumi and Nair,G. Balakrish} } @inbook {17136, title = {Errors}, booktitle = {Encyclopedia of Computer ScienceEncyclopedia of Computer Science}, year = {2003}, month = {2003///}, pages = {677 - 680}, publisher = {John Wiley and Sons Ltd.}, organization = {John Wiley and Sons Ltd.}, address = {Chichester, UK}, abstract = {The indignant customer who receives an incorrect bill from a department store probably does not care what the source of the error was or even that, almost certainly, the fault was not a computer{\textquoteright}s but rather that of its data entry personnel or programmers. Neither is the astronaut who is descending toward the surface of the Moon very concerned about the precise source of the error that caused the onboard computer to fail. But an understanding of the sources of errors in computers is important to anyone who wishes to use or comprehend digital computers.}, isbn = {0-470-86412-5}, url = {http://dl.acm.org/citation.cfm?id=1074100.1074382}, author = {Ralston,Anthony and Shneiderman, Ben} } @conference {13240, title = {Exemplar-based tracking and recognition of arm gestures}, booktitle = {Image and Signal Processing and Analysis, 2003. ISPA 2003. Proceedings of the 3rd International Symposium on}, volume = {2}, year = {2003}, month = {2003/09//}, pages = {656 - 661 Vol.2 - 656 - 661 Vol.2}, abstract = {This paper presents a probabilistic exemplar-based framework for recognizing gestures. The approach is based on representing each gesture as a sequence of learned body poses. The gestures are recognized through a probabilistic framework for matching these body poses and for imposing temporal constrains between different poses. Matching individual poses to image data is performed using a probabilistic formulation for edge matching to obtain a likelihood measurement for each individual pose. The paper introduces a correspondence-free weighted matching scheme for edge templates that emphasize discriminating features in the matching. The weighting does not require establishing correspondences between the different pose models. The probabilistic framework also imposes temporal constrains between different pose through a learned hidden Markov model (HMM) of each gesture.}, keywords = {arm, constrains;, correspondence-free, edge, exemplar-based, framework;, gesture, hidden, HMM;, image, logic;, Markov, MATCHING, matching;, model;, models;, probabilistic, recognition;, scheme;, segmentation;, temporal, tracking;, weighted}, doi = {10.1109/ISPA.2003.1296358}, author = {Elgammal,A. and Shet,V. and Yacoob,Yaser and Davis, Larry S.} } @conference {18656, title = {An experimental evaluation of correlated network partitions in the Coda distributed file system}, year = {2003}, month = {2003/10//}, pages = {273 - 282}, abstract = {Experimental evaluation is an important way to assess distributed systems, and fault injection is the dominant technique in this area for the evaluation of a system{\textquoteright}s dependability. For distributed systems, network failure is an important fault model. Physical network failures often have far-reaching effects, giving rise to multiple correlated failures as seen by higher-level protocols. This paper presents an experimental evaluation, using the Loki fault injector, which provides insight into the impact that correlated network partitions have on the Coda distributed file system. In this evaluation, Loki created a network partition between two Coda file servers, during which updates were made at each server to the same replicated data volume. Upon repair of the partition, a client requested directory resolution to converge the diverging replicas. At various stages of the resolution, Loki invoked a second correlated network partition, thus allowing us to evaluate its impact on the system{\textquoteright}s correctness, performance, and availability.}, keywords = {client-server systems, Coda distributed file system, correlated network partitions, distributed file systems, experimental evaluation, fault model, Loki fault injector, multiple correlated failures, network failure, Network topology, performance evaluation, replicated data, replicated databases, software fault tolerance, system performance evaluation}, doi = {10.1109/RELDIS.2003.1238077}, author = {Lefever,R.M. and Michel Cukier and Sanders,W. H.} } @conference {17834, title = {Exploiting Functional Decomposition for Efficient Parallel Processing of Multiple Data Analysis Queries}, booktitle = {Parallel and Distributed Processing Symposium, International}, year = {2003}, month = {2003///}, pages = {81a - 81a}, publisher = {IEEE Computer Society}, organization = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, abstract = {Reuse is a powerful method for increasing system performance. In this paper, we examine functional decomposition for improving data and computation reuse and, therefore, overall query execution performance in the context of data analysis applications. Additionally, we look at the performance effects of using various projection primitives that make it possible to transform intermediate results generated by a query so that they can be reused by a new query. A satellite data analysis application is used to experimentally show the performance benefits achieved using functional decomposition and projection primitives.}, doi = {http://doi.ieeecomputersociety.org/10.1109/IPDPS.2003.1213184}, author = {Andrade,Henrique and Kurc,Tahsin and Sussman, Alan and Saltz,Joel} } @article {14964, title = {Fast Algorithms for 3-D Dominance Reporting and Counting}, volume = {UMIACS-TR-2003-06}, year = {2003}, month = {2003/02/05/}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {We present in this paper fast algorithms for the 3-D dominance reportingand counting problems, and generalize the results to the d-dimensional case. Our 3-D dominance reporting algorithm achieves $O(\log n/\log\log n +f)$ query time using $O(n\log^{\epsilon}n)$ space, where $f$ is the number of points satisfying the query and $\epsilon>0$ is an arbitrary small constant. For the 3-D dominance counting problem (which is equivalent to the 3-D range counting problem), our algorithm runs in $O((\log n/\log\log n)^2)$ time using $O(nlog^{1+\epsilon}n/\log\log n)$ space. Also UMIACS-TR-2003-06 }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/1253}, author = {Shi,Qingmin and JaJa, Joseph F.} } @article {14965, title = {Fast algorithms for a class of temporal range queries}, journal = {Algorithms and Data Structures}, year = {2003}, month = {2003///}, pages = {91 - 102}, abstract = {Given a set of n objects, each characterized by d attributes specified at m fixed time instances, we are interested in the problem of designing efficient indexing structures such that the following type of queries can be handled efficiently: given d value ranges and a time interval, report or count all the objects whose attributes fall within the corresponding d value ranges at each time instance lying in the specified time interval. We establish efficient data structures to handle several classes of the general problem. Our results include a linear size data structure that enables a query time of O(log n log m + f) for one-sided queries when d=1, where f is the output size. We also show that the most general problem can be solved with polylogarithmic query time using nonlinear space data structures.}, doi = {10.1007/978-3-540-45078-8_9}, author = {Shi,Q. and JaJa, Joseph F.} } @article {14969, title = {Fast Fractional Cascading and Its Applications}, volume = {UMIACS-TR-2003-71}, year = {2003}, month = {2003/08/01/}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {Using the notions of Q-heaps and fusion trees developed by Fredman andWillard, we develop a faster version of the fractional cascading technique while maintaining the linear space structure. The new version enables sublogarithmic iterative search in the case when we have a search tree and the degree of each node is bounded by $O(\log^{\epsilon}n)$, for some constant $\epsilon >0$, where $n$ is the total size of all the lists stored in the tree. The fast fractional cascading technique is used in combination with other techniques to derive sublogarithmic time algorithms for the geometric retrieval problems: orthogonal segment intersection and rectangular point enclosure. The new algorithms use $O(n)$ space and achieve a query time of $O(\log n/\log\log n + f)$, where $f$ is the number of objects satisfying the query. All our algorithms assume the version of the RAM model used by Fredman and Willard. (UMIACS-TR-2003-71) }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/1296}, author = {Shi,Qingmin and JaJa, Joseph F.} } @conference {18340, title = {Footloose: a case for physical eventual consistency and selective conflict resolution}, booktitle = {Mobile Computing Systems and Applications, 2003. Proceedings. Fifth IEEE Workshop on}, year = {2003}, month = {2003///}, pages = {170 - 179}, publisher = {IEEE}, organization = {IEEE}, abstract = {Users are increasingly inundated with small devices with communication and storage capabilities. Unfortunately, the user is still responsible for reconciling all of the devices whenever a change is made. We present Footloose, a user-centered data store that can share data and reconcile conflicts across diverse devices. Footloose is an optimistic system based on physical eventual consistency: consistency based on the movement of devices, and selective conflict resolution, which allows conflicts to flow through devices that cannot resolve the conflict to devices that can. Using these techniques, Footloose can present consistent views of data on the devices closest to the user without user interaction.}, isbn = {0-7695-1995-4}, doi = {10.1109/MCSA.2003.1240778}, url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1240778}, author = {Paluska and Saff and Yeh and Chen} } @article {18638, title = {Formal verification of an intrusion-tolerant group membership protocol}, journal = {IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS E SERIES D}, volume = {86}, year = {2003}, month = {2003///}, pages = {2612 - 2622}, abstract = {The traditional approach for establishing thecorrectness of group communication protocols is through rigor- ous arguments. While this is a valid approach, the likelihood of subtle errors in the design and implementation of such complex distributed protocols is not negligible. The use of formal verifi- cation methods has been widely advocated to instill confidence in the correctness of protocols. In this paper, we describe how we used the SPIN model checker to formally verify a group mem- bership protocol that is part of an intrusion-tolerant group com- munication system. We describe how we successfully tackled the state-space explosion problem by determining the right abstrac- tion level for formally specifying the protocol. The verification exercise not only formally showed that the protocol satisfies its correctness claims, but also provided information that will help us make the protocol more efficient without violating correctness. key words: intrusion tolerance, group communication systems, validation, formal methods }, url = {https://www.perform.csl.illinois.edu/Papers/USAN_papers/03RAM01.pdf}, author = {Ramasamy,H. V. and Michel Cukier and Sanders,W. H.} } @article {14697, title = {Formalizing dynamic software updating}, journal = {Proceedings of the Second International Workshop on Unanticipated Software Evolution (USE)}, year = {2003}, month = {2003///}, abstract = {Dynamic software updating (DSU) enables running programs to beupdated with new code and data without interrupting their execution. A number of DSU systems have been designed, but there is still little rig- orous understanding of how to use DSU technology so that updates are safe. As a first step in this direction, we introduce a small update calculus with a precise mathematical semantics. The calculus is formulated as an extension of a typed lambda calculus, and supports updating technology similar to that of the programming language Erlang [2]. Our goal is to provide a simple yet expressive foundation for reasoning about dynam- ically updateable software. In this paper, we present the details of the calculus, give some examples of its expressive power, and discuss how it might be used or extended to guarantee safety properties. }, author = {Bierman,G. and Hicks, Michael W. and Sewell,P. and Stoyle,G.} } @article {17674, title = {A Fortran 95 Matrix Wrapper}, volume = {UMIACS-TR-2003-89}, year = {2003}, month = {2003/09/02/}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {{\Matran} is an wrapper written in Fortran~95 that implements matrixoperations and computes matrix decompositions using {\lapack} and the {\blas}. This document describes a preliminary release of {\matran}, which treats only real matrices. Its purpose is to get outside comments and suggestions before the package jells. Consequently, this documentation is slanted toward the experienced programmer familiar with both matrix computations and Fortran~90/95. User oriented documentation will accompany the final release. (UMIACS-TR-2003-89) }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/1308}, author = {Stewart, G.W.} } @article {16290, title = {The genome sequence of Bacillus anthracis Ames and comparison to closely related bacteria}, journal = {Nature}, volume = {423}, year = {2003}, month = {2003/05/01/}, pages = {81 - 86}, abstract = {Bacillus anthracis is an endospore-forming bacterium that causes inhalational anthrax1. Key virulence genes are found on plasmids (extra-chromosomal, circular, double-stranded DNA molecules) pXO1 (ref. 2) and pXO2 (ref. 3). To identify additional genes that might contribute to virulence, we analysed the complete sequence of the chromosome of B. anthracis Ames (about 5.23 megabases). We found several chromosomally encoded proteins that may contribute to pathogenicity{\textemdash}including haemolysins, phospholipases and iron acquisition functions{\textemdash}and identified numerous surface proteins that might be important targets for vaccines and drugs. Almost all these putative chromosomal virulence and surface proteins have homologues in Bacillus cereus, highlighting the similarity of B. anthracis to near-neighbours that are not associated with anthrax4. By performing a comparative genome hybridization of 19 B. cereus and Bacillus thuringiensis strains against a B. anthracis DNA microarray, we confirmed the general similarity of chromosomal genes among this group of close relatives. However, we found that the gene sequences of pXO1 and pXO2 were more variable between strains, suggesting plasmid mobility in the group. The complete sequence of B. anthracis is a step towards a better understanding of anthrax pathogenesis.}, isbn = {0028-0836}, doi = {10.1038/nature01586}, url = {http://www.nature.com/nature/journal/v423/n6935/full/nature01586.html}, author = {Read,Timothy D. and Peterson,Scott N. and Tourasse,Nicolas and Baillie,Les W. and Paulsen,Ian T. and Nelson,Karen E. and Tettelin,Herv|[eacute]| and Fouts,Derrick E. and Eisen,Jonathan A. and Gill,Steven R. and Holtzapple,Erik K. and |[Oslash]|kstad,Ole Andreas and Helgason,Erlendur and Rilstone,Jennifer and Wu,Martin and Kolonay,James F. and Beanan,Maureen J. and Dodson,Robert J. and Brinkac,Lauren M. and Gwinn,Michelle and DeBoy,Robert T. and Madpu,Ramana and Daugherty,Sean C. and Durkin,A. Scott and Haft,Daniel H. and Nelson,William C. and Peterson,Jeremy D. and Pop, Mihai and Khouri,Hoda M. and Radune,Diana and Benton,Jonathan L. and Mahamoud,Yasmin and Jiang,Lingxia and Hance,Ioana R. and Weidman,Janice F. and Berry,Kristi J. and Plaut,Roger D. and Wolf,Alex M. and Watkins,Kisha L. and Nierman,William C. and Hazen,Alyson and Cline,Robin and Redmond,Caroline and Thwaite,Joanne E. and White,Owen and Salzberg,Steven L. and Thomason,Brendan and Friedlander,Arthur M. and Koehler,Theresa M. and Hanna,Philip C. and Kolst|[oslash]|,Anne-Brit and Fraser,Claire M.} } @article {15387, title = {Geometrical analysis of precessional switching and relaxation in uniformly magnetized bodies}, journal = {Magnetics, IEEE Transactions on}, volume = {39}, year = {2003}, month = {2003/09//}, pages = {2501 - 2503}, abstract = {Precessional switching and relaxation in a single-domain particle or film is studied by using the Landau-Lifshitz-Gilbert equation. The analysis of the switching process is based on the explicit knowledge of two integrals of motion for the magnetization dynamics in the conservative case. The knowledge of these integrals of motions enables one to carry out the geometrical analysis of the system and give the complete phase portrait. The relaxation process which occurs after the magnetization is reversed is analyzed by using geometrical methods and it is showed that the dynamical system exhibits entanglement of separatrices and riddled basins of attraction.}, keywords = {analysis;, attraction;, basins, bodies;, dynamical, dynamics;, entanglement;, equation;, film;, films;, geometrical, integrals, Landau-Lifshitz-Gilbert, magnetic, magnetisation, magnetization, magnetized, motion;, of, particle;, particles;, phase, portrait;, precessional, relaxation;, reversal;, riddled, separatrices;, single-domain, spin, switching;, system;, thin, uniformly}, isbn = {0018-9464}, doi = {10.1109/TMAG.2003.816453}, author = {Bertotti,G. and Mayergoyz, Issak D and Serpico,C. and d{\textquoteright}Aquino,M.} } @article {17185, title = {HCIL Technical Report Listing (1993-2002)}, journal = {The craft of information visualization: readings and reflections}, volume = {27}, year = {2003}, month = {2003///}, pages = {393 - 393}, author = {Ceaparu,I. and Druin, Allison and Guimbretiere,F. and Manipulation,D. and Shneiderman, Ben and Westerlurid,B. and Keogh,E. and Hochheiser,H. and Shrieidemian,B. and Shneidemiari,B. and others} } @conference {13785, title = {Hedge Trimmer: a parse-and-trim approach to headline generation}, booktitle = {Proceedings of the HLT-NAACL 03 on Text summarization workshop - Volume 5}, series = {HLT-NAACL-DUC {\textquoteright}03}, year = {2003}, month = {2003///}, pages = {1 - 8}, publisher = {Association for Computational Linguistics}, organization = {Association for Computational Linguistics}, address = {Stroudsburg, PA, USA}, abstract = {This paper presents Hedge Trimmer, a HEaDline GEneration system that creates a headline for a newspaper story using linguistically-motivated heuristics to guide the choice of a potential headline. We present feasibility tests used to establish the validity of an approach that constructs a headline by selecting words in order from a story. In addition, we describe experimental results that demonstrate the effectiveness of our linguistically-motivated approach over a HMM-based model, using both human evaluation and automatic metrics for comparing the two approaches.}, doi = {10.3115/1119467.1119468}, url = {http://dx.doi.org/10.3115/1119467.1119468}, author = {Dorr, Bonnie J and Zajic, David and Schwartz,Richard} } @article {17188, title = {Help! I{\textquoteright}m lost: User frustration in web navigation}, journal = {IT \& Society}, volume = {1}, year = {2003}, month = {2003///}, pages = {18 - 26}, abstract = {Computers can be valuable tools, and networked resources via the Internet can be beneficial to many different populations and communities. Unfortunately, when people are unable to reach their task goals due to frustrating experiences, this can hinder the effectiveness of technology. This research summary provides information about the user frustration research that has been performed at the University of Maryland and Towson University. Causes of user frustration are discussed in this research summary, along with the surprising finding that nearly one-third to one-half of the time spent in front of the computer is wasted due to frustrating experiences. Furthermore, when interfaces are planned to be deceptive and confusing, this can lead to increased frustration. Implications for designers and users are discussed.}, author = {Lazar,J. and Bessiere,K. and Ceaparu,I. and Robinson,J. and Shneiderman, Ben} } @conference {16138, title = {Helping users get started with visual interfaces: multi-layered interfaces, integrated initial guidance and video demonstrations}, booktitle = {Proceedings of the 2003 annual national conference on Digital government research}, series = {dg.o {\textquoteright}03}, year = {2003}, month = {2003///}, pages = {1 - 1}, publisher = {Digital Government Society of North America}, organization = {Digital Government Society of North America}, abstract = {We are investigating new ways to help users learn to use public access interactive tools, in particular for the visual exploration of government statistics. Our work led to a series of interfaces using multi-layered design, a new help method called Integrated Initial Guidance, and video demonstrations. Multi-layer designs structure an interface so that a simpler interface is available for users to get started and more complex features are accessed as users move through the more advanced layers. Integrated Initial Guidance provides help within the working interface, right at the start of the application. Using the metaphor of "sticky notes" overlaid on top of the functional interface locates the main widgets, demonstrates their manipulation, and explains the resulting actions using preset activations of the interface.}, url = {http://dl.acm.org/citation.cfm?id=1123196.1123257}, author = {Kang,Hyunmo and Plaisant, Catherine and Shneiderman, Ben} } @conference {12720, title = {A hidden Markov model based framework for recognition of humans from gait sequences}, booktitle = {Image Processing, 2003. ICIP 2003. Proceedings. 2003 International Conference on}, volume = {2}, year = {2003}, month = {2003/09//}, pages = {II - 93-6 vol.3 - II - 93-6 vol.3}, abstract = {In this paper we propose a generic framework based on hidden Markov models (HMMs) for recognition of individuals from their gait. The HMM framework is suitable, because the gait of an individual can be visualized as his adopting postures from a set, in a sequence which has an underlying structured probabilistic nature. The postures that the individual adopts can be regarded as the states of the HMM and are typical to that individual and provide a means of discrimination. The framework assumes that, during gait, the individual transitions between N discrete postures or states but it is not dependent on the particular feature vector used to represent the gait information contained in the postures. The framework, thus, provides flexibility in the selection of the feature vector. The statistical nature of the HMM lends robustness to the model. In this paper we use the binarized background-subtracted image as the feature vector and use different distance metrics, such as those based on the L1 and L2 norms of the vector difference, and the normalized inner product of the vectors, to measure the similarity between feature vectors. The results we obtain are better than the baseline recognition rates reported before.}, keywords = {analysis;, background-subtracted, binarized, discrete, distance, feature, Gait, hidden, human, image, image;, Markov, metrics;, model;, models;, postures;, recognition;, sequences;, vector;}, doi = {10.1109/ICIP.2003.1246624}, author = {Sundaresan,Aravind and RoyChowdhury,Amit and Chellapa, Rama} } @conference {16758, title = {Hierarchical dwarfs for the rollup cube}, booktitle = {Proceedings of the 6th ACM international workshop on Data warehousing and OLAP - DOLAP {\textquoteright}03}, year = {2003}, month = {2003///}, pages = {17 - 17}, address = {New Orleans, Louisiana, USA}, doi = {10.1145/956060.956064}, url = {http://dl.acm.org/citation.cfm?id=956064}, author = {Sismanis,Yannis and Deligiannakis,Antonios and Kotidis,Yannis and Roussopoulos, Nick} } @conference {17892, title = {A high performance multi-perspective vision studio}, booktitle = {Proceedings of the 17th annual international conference on Supercomputing}, series = {ICS {\textquoteright}03}, year = {2003}, month = {2003///}, pages = {348 - 357}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {We describe a multi-perspective vision studio as a flexible high performance framework for solving complex image processing and machine vision problems on multi-view image sequences. The studio abstracts multi-view image data from image sequence acquisition facilities, stores and catalogs sequences in a high performance distributed database, allows customization of back-end processing services, and can serve custom client applications, thus helping make multi-view video sequence processing efficient and generic. To illustrate our approach, we describe two multi-perspective studio applications, and discuss performance and scalability results.}, keywords = {database, distributed system, high-performance, IMAGE PROCESSING, multi-perspective, VISION, volumetric reconstruction}, isbn = {1-58113-733-8}, doi = {10.1145/782814.782862}, url = {http://doi.acm.org/10.1145/782814.782862}, author = {Borovikov,Eugene and Sussman, Alan} } @article {17220, title = {Image-based highly interactive Web mapping for geo-referenced data publishing}, journal = {Technical Reports from UMIACS}, year = {2003}, month = {2003/01/21/}, abstract = {This paper describes an image-based technique that enables highly interactiveWeb choropleth maps for geo-referenced data publishing and visual exploration. Geographic knowledge is encoded into raster images and delivered to the client, instead of in vector formats. Differing from traditional raster-image-based approaches that are static and allow very little user interaction, it allows varieties of sub-second fine-grained interface controls such as dynamic query, dynamic classification, geographic object data identification, user setting adjusting, as well as turning on/off layers, panning and zooming, with no or minimum server support. Compared to Web GIS approaches that are based on vector geographic data, this technique has the features of short initial download time, near-constant performance scalability for larger numbers of geographic objects, and download-map-segment-only-when-necessary which potentially reduces the overall data transfer over the network. As a result, it accommodates general public users with slow modem network connections and low-end machines, as well as users with fast T-1 connections and fast machines. The client-side (browser) is implemented as light-weight Java applets. YMap, an easy-to-use, user-task-oriented highly interactive mapping tool prototype for visual geo-referenced data exploration is implemented using this technique. (UMIACS-TR-2003-02) (HCIL-TR-2002-26) }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/1248}, author = {Zhao,Haixia and Shneiderman, Ben} } @article {16125, title = {Immediate Usability: Kiosk design principles from the CHI 2001 Photo Library}, journal = {Technical Reports from UMIACS}, year = {2003}, month = {2003/01/21/}, abstract = {This paper describes a novel set of design principles and guidelines forensuring the immediate usability of public access systems. These principles and guidelines were formulated while developing PhotoFinder Kiosk, a community photo library. Attendees of CHI 2001 successfully used the tool to browse and annotate collections of photographs spanning 20 years of CHI and related conferences, producing a richly annotated photo history of the field of human-computer interaction. We used observations and log data to evaluate the tool and refine the guidelines. They provide specific guidance for practitioners, as well as a useful framework for additional research in public access interfaces. Keywords Photo collection, community photo library, group annotation, public access system, direct annotation, direct manipulation, drag-and-drop, immediate usability, zero-trial learning, walk-up-and-use, casual use. (UMIACS-TR-2001-71) (HCIL-TR-2001-23) }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/1155}, author = {Kules,Bill and Kang,Hyunmo and Plaisant, Catherine and Rose,Anne and Shneiderman, Ben} } @article {17552, title = {An Improved Approximation Ratio for the Covering Steiner Problem}, journal = {Theory of Computing}, volume = {2}, year = {2003}, month = {2003///}, pages = {53 - 64}, abstract = {In the Covering Steiner problem, we are given an undirected graph with edge-costs, and some subsets of vertices called groups, with each group being equipped with a non-negative integer value (called its requirement); the problem is to find a minimum-cost tree which spans at least the required number of vertices from every group. The Covering Steiner problem is a common generalization of the k-MST and the Group Steiner problems; indeed, when all the vertices of the graph lie in one group with a requirement of k, we get the k-MST problem, and when there are multiple groups with unit requirements, we obtain the Group Steiner problem. While many covering problems (e.g., the covering integer programs such as set cover) become easier to approximate as the requirements increase, the Covering Steiner problem remains at least as hard to approximate as the Group Steiner problem; in fact, the best guarantees previously known for the Covering Steiner problem were worse than those for Group Steiner as the requirements became large. In this work, we present an improved approximation algorithm whose guarantee equals the best known guarantee for the Group Steiner problem.}, url = {http://repository.cmu.edu/compsci/850}, author = {Gupta,Anupam and Srinivasan, Aravind} } @article {16892, title = {Improved search heuristics for the sa-tree}, journal = {Pattern Recognition Letters}, volume = {24}, year = {2003}, month = {2003/11//}, pages = {2785 - 2795}, abstract = {The sa-tree is an interesting metric space indexing structure that is inspired by the Voronoi diagram. In essence, the sa-tree records a portion of the Delaunay graph of the data set, a graph whose vertices are the Voronoi cells, with edges between adjacent cells. An improvement is presented on the original search strategy for the sa-tree. This consists of details on the intuition behind the improvement as well as the original search strategy and a proof of their correctness. Furthermore, it is shown how to adapt an incremental nearest neighbor algorithm to the sa-tree, which allows computing nearest neighbor in a progressive manner. Unlike other adaptations, the resulting algorithm does not take the unnecessary steps to ensure that keys of {\textquotedblleft}node{\textquotedblright} elements are monotonically non-decreasing.}, keywords = {distance-based indexing, Metric spaces, Nearest neighbor algorithms}, isbn = {0167-8655}, doi = {10.1016/S0167-8655(03)00122-3}, url = {http://www.sciencedirect.com/science/article/pii/S0167865503001223}, author = {Hjaltason,G{\i}́sli R. and Samet, Hanan} } @conference {16900, title = {Improving access to large volumes of online data}, 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 = {The Internet has recently become the medium of interaction with large volumes of data. Enterprises in the public and private sectors made their databases available over the Internet. Working with such large volumes of online data is a challenging task. For efficient access to large data from remote locations we introduced APPOINT (an Approach for Peer-to-Peer Offloading the INTernet). In APPOINT, active clients of a client-server architecture act on the server{\textquoteright}s behalf and communicate with each other to transfer large volumes of online data more efficiently. In essence, a server is enabled to appoint alternatives and create a scalable collaborative virtual mirror from the active clients. Multiple parameters such as availability of clients and bandwidth information on clients are considered to decide on how to best forward a download request. APPOINT is built as an add-on to existing client-server systems. A library of functions, with a simple application programming interface (API) that can be used within an existing client-server system to improve the service, is developed. Our experimental findings show that APPOINT can dramatically improve the performance of existing client-server based database systems.}, url = {http://dl.acm.org/citation.cfm?id=1123196.1123260}, author = {Tanin,Egemen and Samet, Hanan} } @conference {17878, title = {Improving access to multi-dimensional self-describing scientific datasets}, booktitle = {3rd IEEE/ACM International Symposium on Cluster Computing and the Grid, 2003. Proceedings. CCGrid 2003}, year = {2003}, month = {2003/05/12/15}, pages = {172 - 179}, publisher = {IEEE}, organization = {IEEE}, abstract = {Applications that query into very large multidimensional datasets are becoming more common. Many self-describing scientific data file formats have also emerged, which have structural metadata to help navigate the multi-dimensional arrays that are stored in the files. The files may also contain application-specific semantic metadata. In this paper, we discuss efficient methods for performing searches for subsets of multi-dimensional data objects, using semantic information to build multidimensional indexes, and group data items into properly sized chunks to maximize disk I/O bandwidth. This work is the first step in the design and implementation of a generic indexing library that will work with various high-dimension scientific data file formats containing semantic information about the stored data. To validate the approach, we have implemented indexing structures for NASA remote sensing data stored in the HDF format with a specific schema (HDF-EOS), and show the performance improvements that are gained from indexing the datasets, compared to using the existing HDF library for accessing the data.}, keywords = {Application software, application-specific semantic metadata, Bandwidth, Computer science, database indexing, disk I/O bandwidth, distributed databases, Educational institutions, Indexing, indexing structures, Libraries, meta data, Middleware, multidimensional arrays, multidimensional datasets, Multidimensional systems, NASA, NASA remote sensing data, Navigation, query formulation, self-describing scientific data file formats, structural metadata, very large databases}, isbn = {0-7695-1919-9}, doi = {10.1109/CCGRID.2003.1199366}, author = {Nam,B. and Sussman, Alan} } @article {16124, title = {Improving Accessibility and Usability of Geo-referenced Statistical Data}, year = {2003}, month = {2003/06/04/}, abstract = {Several technology breakthroughs are needed to achieve the goals ofuniversal accessibility and usability. These goals are especially challenging in the case of geo-referenced statistical data that many U.S. government agencies supply. We present technical and user-interface design challenges in accommodating users with low-end technology (slow network connection and low-end machine) and users who are blind or vision-impaired. Our solutions are presented and future work is discussed. (UMIACS-TR-2003-37) (HCIL-2003-11) }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/1277}, author = {Zhao,Haixia and Plaisant, Catherine and Shneiderman, Ben} } @article {18980, title = {Improving the Arabidopsis genome annotation using maximal transcript alignment assemblies}, journal = {Nucleic Acids ResearchNucl. Acids Res.}, volume = {31}, year = {2003}, month = {2003/10/01/}, pages = {5654 - 5666}, abstract = {The spliced alignment of expressed sequence data to genomic sequence has proven a key tool in the comprehensive annotation of genes in eukaryotic genomes. A novel algorithm was developed to assemble clusters of overlapping transcript alignments (ESTs and full-length cDNAs) into maximal alignment assemblies, thereby comprehensively incorporating all available transcript data and capturing subtle splicing variations. Complete and partial gene structures identified by this method were used to improve The Institute for Genomic Research Arabidopsis genome annotation (TIGR release v.4.0). The alignment assemblies permitted the automated modeling of several novel genes and >1000 alternative splicing variations as well as updates (including UTR annotations) to nearly half of the \~{}27 000 annotated protein coding genes. The algorithm of the Program to Assemble Spliced Alignments (PASA) tool is described, as well as the results of automated updates to Arabidopsis gene annotations.}, isbn = {0305-1048, 1362-4962}, doi = {10.1093/nar/gkg770}, url = {http://nar.oxfordjournals.org/content/31/19/5654}, author = {Haas,Brian J. and Delcher,Arthur L. and Mount, Stephen M. and Wortman,Jennifer R. and Jr,Roger K. Smith and Hannick,Linda I. and Maiti,Rama and Ronning,Catherine M. and Rusch,Douglas B and Town,Christopher D. and Salzberg,Steven L. and White,Owen} } @article {17229, title = {In vivo filtering of in vitro expression data reveals MyoD targets}, journal = {Comptes Rendus Biologies}, volume = {326}, year = {2003}, month = {2003/10//}, pages = {1049 - 1065}, abstract = {A published set of downstream targets of MyoD defined in a well-controlled in vitro experiment was filtered for relevance to muscle regeneration using a 27-time-point in vivo murine regeneration series. Using interactive hierarchical and Bayes soft clustering, only a minority of the targets defined in vitro can be confirmed in vivo (\~{}50\% of induced transcripts, and none of repressed transcripts). This approach provided strong support that 18 targets including of MyoD are biologically relevant during myoblast differentiation. To cite this article: P.~Zhao et al., C.~R. Biologies 326 (2003).}, keywords = {clustering, expression profiling, Microarray, micror{\'e}seaux, muscle regeneration, MyoD, profil d{\textquoteright}expression, r{\'e}g{\'e}n{\'e}ration musculaire, regroupement}, isbn = {1631-0691}, doi = {10.1016/j.crvi.2003.09.035}, url = {http://www.sciencedirect.com/science/article/pii/S1631069103002324}, author = {Zhao,Po and Seo,Jinwook and Wang,Zuyi and Wang,Yue and Shneiderman, Ben and Hoffman,Eric P} } @article {16891, title = {Index-driven similarity search in metric spaces (Survey Article)}, journal = {ACM Trans. Database Syst.}, volume = {28}, year = {2003}, month = {2003/12//}, pages = {517 - 580}, abstract = {Similarity search is a very important operation in multimedia databases and other database applications involving complex objects, and involves finding objects in a data set S similar to a query object q, based on some similarity measure. In this article, we focus on methods for similarity search that make the general assumption that similarity is represented with a distance metric d. Existing methods for handling similarity search in this setting typically fall into one of two classes. The first directly indexes the objects based on distances (distance-based indexing), while the second is based on mapping to a vector space (mapping-based approach). The main part of this article is dedicated to a survey of distance-based indexing methods, but we also briefly outline how search occurs in mapping-based methods. We also present a general framework for performing search based on distances, and present algorithms for common types of queries that operate on an arbitrary "search hierarchy." These algorithms can be applied on each of the methods presented, provided a suitable search hierarchy is defined.}, keywords = {distance-based indexing, Hiearchical metric data structures, nearest neighbor queries, range queries, Ranking, similarity searching}, isbn = {0362-5915}, doi = {10.1145/958942.958948}, url = {http://doi.acm.org/10.1145/958942.958948}, author = {Hjaltason,Gisli R. and Samet, Hanan} } @inbook {17237, title = {Innovating the Interaction}, booktitle = {The craft of information visualization: readings and reflectionsThe craft of information visualization: readings and reflections}, year = {2003}, month = {2003///}, pages = {295 - 295}, publisher = {Morgan Kaufmann}, organization = {Morgan Kaufmann}, address = {San Francisco}, isbn = {978-1-55860-915-0}, author = {Bederson, Benjamin B. and Plaisant, Catherine and Mushlin,R. and Snyder,A. and Li,J. and Heller,D. and Shneiderman, Ben and Hochheiser,H. and Fekete,J. D and Czenvinski,M.} } @conference {14053, title = {Integral equation solution of electromagnetic scattering from a multilayered cylindrical waveguide}, booktitle = {Antennas and Propagation Society International Symposium, 2003. IEEE}, volume = {3}, year = {2003}, month = {2003/06//}, pages = {524 - 527 vol.3 - 524 - 527 vol.3}, abstract = {This paper is devoted to the electromagnetic scattering from an N multilayered cylinder. We consider waveguides in the z direction, that is: we look for the solution of Maxwell equations along the z direction. We assume a dielectric core and discuss the problem for the case of general domains. We use an integral equation approach to solve the problem and the Nystrom method for the numerical approximation.}, keywords = {approximation, circular, core;, cylinder;, cylindrical, dielectric, dielectric-loaded, electromagnetic, EM, equations;, integral, Maxwell, method;, multilayered, numerical, Nystrom, scattering;, theory;, wave, waveguide, waveguides;}, doi = {10.1109/APS.2003.1219901}, author = {Seydou,F. and Duraiswami, Ramani and Seppanen,T.} } @conference {17615, title = {Integrality ratio for group Steiner trees and directed steiner trees}, booktitle = {Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms}, series = {SODA {\textquoteright}03}, year = {2003}, month = {2003///}, pages = {275 - 284}, publisher = {Society for Industrial and Applied Mathematics}, organization = {Society for Industrial and Applied Mathematics}, address = {Philadelphia, PA, USA}, abstract = {We present an Ω(log2k) lower bound on the integrality ratio of the flow-based relaxation for the Group Steiner Tree problem, where k denotes the number of groups; this holds even for input graphs that are Hierarchically Well-Separated Trees, introduced by Bartal [Symp. Foundations of Computer Science, pp. 184--193, 1996], in which case this lower bound is tight. This relaxation appears to be the only one that have been studied for the problem, as well as for its generalization, the Directed Steiner Tree problem. For the latter problem, our results imply an Ω(log2n/(log logn)2) integrality ratio, where n is the number of vertices in the graph. For both problems, this is the first known lower bound on the integrality ratio that is superlogarithmic in the input size. We also show algorithmically that the integrality ratio for Group Steiner Tree is much better for certain families of instances, which helps pinpoint the types of instances that appear to be most difficult to approximate.}, isbn = {0-89871-538-5}, url = {http://dl.acm.org/citation.cfm?id=644108.644155}, author = {Halperin,Eran and Kortsarz,Guy and Krauthgamer,Robert and Srinivasan, Aravind and Wang,Nan} } @conference {12782, title = {The integrated CWB-NC/PIOAtool for functional verification and performance analysis of concurrent systems}, booktitle = {Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems}, year = {2003}, month = {2003///}, pages = {431 - 436}, author = {Zhang,D. and Cleaveland, Rance and Stark,E. W} } @conference {17248, title = {Interactive color mosaic and dendrogram displays for signal/noise optimization in microarray data analysis}, booktitle = {Multimedia and Expo, 2003. ICME{\textquoteright}03. Proceedings. 2003 International Conference on}, volume = {3}, year = {2003}, month = {2003///}, pages = {III{\textendash}461 - III{\textendash}461}, abstract = {Data analysis and visualization is strongly influenced by noise and noise filters. There are multiple sources of oisein microarray data analysis, but signal/noise ratios are rarely optimized, or even considered. Here, we report a noise analysis of a novel 13 million oligonucleotide dataset - 25 human U133A (~500,000 features) profiles of patient muscle biposies. We use our recently described interactive visualization tool, the Hierarchical Clustering Explorer (HCE) to systemically address the effect of different noise filters on resolution of arrays into orrectbiological groups (unsupervised clustering into three patient groups of known diagnosis). We varied probe set interpretation methods (MAS 5.0, RMA), resent callfilters, and clustering linkage methods, and investigated the results in HCE. HCE interactive features enabled us to quickly see the impact of these three variables. Dendrogram displays showed the clustering results systematically, and color mosaic displays provided a visual support for the results. We show that each of these three variables has a strong effect on unsupervised clustering. For this dataset, the strength of the biological variable was maximized, and noise minimized, using MAS 5.0, 10\% present call filter, and Average Group Linkage. We propose a general method of using interactive tools to identify the optimal signal/noise balance or the optimal combination of these three variables to maximize the effect of the desired biological variable on data interpretation.}, author = {Seo,J. and Bakay,M. and Zhao,P. and Chen,Y.W. and Clarkson,P. and Shneiderman, Ben and Hoffman,E.P.} } @article {13299, title = {Interactive Visualization of Large Tetrahedral Meshes through Selective Refinement}, journal = {IEEE Transactions on Visualization and Computer Graphics}, year = {2003}, month = {2003///}, abstract = {In this paper, we address the problem of the efficient visualization of very largeirregular volume datasets. To this aim, we exploit a multiresolution representation based on a domain decomposition into tetrahedral cells. A new compact data struc- ture is described which encodes the whole dataset at a virtually continuous range of different resolutions, with a storage cost six times lower than a standard data struc- ture for tetrahedral meshes. Such structure supports on-line selective refinement to focus resolution on areas that the user considers more critical, based on either field values, or domain location, or opacity of the transfer function. Selective refinement is used to trade-off between resolution and speed in visualization, according to user needs and hardware constraints. These features have been implemented in a new system, called TAn2 (Tetrahedra Analyzer), for the interactive visualization of three- dimensional scalar fields defined on very large tetrahedral meshes. Multiresolution representation and selective refinement make the system fully scalable with respect to the size of the dataset and to hardware requirements. }, author = {Cignoni,P. and De Floriani, Leila and Magillo,P. and Puppo,E. and Scopigno,R. and di Genova,U.} } @conference {16903, title = {The internet spatial spreadsheet: enabling remote visualization of dynamic spatial data and ongoing query results over a network}, booktitle = {Proceedings of the 11th ACM international symposium on Advances in geographic information systems}, series = {GIS {\textquoteright}03}, year = {2003}, month = {2003///}, pages = {154 - 160}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Moving object databases store and process data for objects that change location frequently. Materialized views maintained over time must be updated to reflect changes due to the motion of objects in their environment. To visualize view query results, displays must be updated to reflect the change. In this paper we present the Internet Spatial Spreadsheet (ISS) as a means to organize, query, and visualize changing spatial data in a network environment such as the Internet.The goal of the ISS is to keep client visualizations of query results up to date with the server state. This is accomplished by pushing the minimal set of spatial data needed for rendering query results on the client. Incremental changes to query results are subsequently transmitted to the client as the database is updated to keep the visualization current. Additional constraints in the network environment such as firewall limitations are also considered.}, keywords = {client server, GIS, Spatial databases, Visualization}, isbn = {1-58113-730-3}, doi = {10.1145/956676.956697}, url = {http://doi.acm.org/10.1145/956676.956697}, author = {Iwerks,Glenn S. and Samet, Hanan} } @article {12300, title = {Intradomain Overlays: Architecture and Applications}, journal = {Technical Reports from UMIACS, UMIACS-TR-2003-70}, year = {2003}, month = {2003/08/01/}, abstract = {We introduce an architecture for {\textquoteleft}{\textquoteleft}Intradomain Overlays{\textquoteright}{\textquoteright}, where a subset of routers within a domain is augmented with a dedicated host. These strategically placed hosts form an overlay network, and we describe a number of applications for such overlays. These applications include efficient network monitoring, policy- and load-based packet re-routing, and network resource accounting. In this paper, we elaborate on the network monitoring application and describe a distributed protocol for monitoring routers within an AS which has been augmented with a few overlay nodes. The routers and other infrastructure are unaware of the overlay nodes, and the monitoring of individual elements is conducted using plain SNMP. We describe techniques for efficiently synthesizing and transporting the monitored SNMP data, and present results using trace data collected from an AS with 400+ routers. Our results show that the overlay-based monitoring reduces overheads by 2--4 orders of magnitude, and thus enables much finer grained monitoring and traffic engineering than is otherwise possible. (UMIACS-TR-2003-70) }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/1295}, author = {Kommareddy,Christopher and Guven,Tuna and Bhattacharjee, Bobby and La,Richard and Shayman,Mark} } @article {17264, title = {INTRODUCTION TO VOLUME 1, ISSUE 3: WEB NAVIGATION}, journal = {IT\&SOCIETY}, volume = {1}, year = {2003}, month = {2003///}, author = {Shneiderman, Ben and Lazar,J. and IVORY,M.} } @article {13376, title = {IRIS: Internet-scale Resource-Intensive Sensor Services}, journal = {Intel Research, UC Berkeley, Carnegie Mellon University}, year = {2003}, month = {2003///}, abstract = {The proliferation and affordability of smart sensors such aswebcams, microphones etc., has created opportunities for exciting new classes of distributed services. A key stum- bling block to mining these rich information sources is the lack of a common, scalable networked infrastructure for col- lecting, filtering, and combining the video feeds, extracting the useful information, and enabling distributed queries. In this demo, we demonstrate the design and an early prototype of such an infrastructure, called IRIS (Internet- scale Resource-Intensive Sensor services). IRIS is a poten- tially global network of smart sensor nodes, with webcams or other sensors, and organizing nodes that provide the means to query recent and historical sensor-based data. IRIS ex- ploits the fact that high-volume sensor feeds are typically attached to devices with significant computing power and storage, and running a standard operating system. Aggres- sive filtering, smart query routing, and semantic caching are used to dramatically reduce network bandwidth utilization and improve query response times, as we will demonstrate. The service that we demonstrate here is that of a park- ing space finder. This service utilizes webcams that monitor parking spaces to answer queries such as the availability of parking spaces near a user{\textquoteright}s destination. }, author = {Deshpande, Amol and Nath,S. and Gibbons,P.B. and Seshan,S.} } @conference {13378, title = {IrisNet: an architecture for internet-scale sensing services}, booktitle = {Proceedings of the 29th international conference on Very large data bases - Volume 29}, series = {VLDB {\textquoteright}03}, year = {2003}, month = {2003///}, pages = {1137 - 1140}, publisher = {VLDB Endowment}, organization = {VLDB Endowment}, abstract = {We demonstrate the design and an early prototype of IrisNet (Internet-scale Resource-Intensive Sensor Network services), a common, scalable networked infrastructure for deploying wide area sensing services. IrisNet is a potentially global network of smart sensing nodes, with webcams or other monitoring devices, and organizing nodes that provide the means to query recent and historical sensor-based data. IrisNet exploits the fact that high-volume sensor feeds are typically attached to devices with significant computing power and storage, and running a standard operating system. It uses aggressive filtering, smart query routing, and semantic caching to dramatically reduce network bandwidth utilization and improve query response times, as we demonstrate. Our demo will present two services built on Iris-Net, from two very different application domains. The first one, a parking space finder, utilizes webcams that monitor parking spaces to answer queries such as the availability of parking spaces near a user{\textquoteright}s destination. The second one, a distributed infrastructure monitor, uses measurement tools installed in individual nodes of a large distributed infrastructure to answer queries such as average network bandwidth usage of a set of nodes.}, isbn = {0-12-722442-4}, url = {http://dl.acm.org/citation.cfm?id=1315451.1315568}, author = {Nath,Suman and Deshpande, Amol and Ke,Yan and Gibbons,Phillip B. and Karp,Brad and Seshan,Srinivasan} } @article {16895, title = {Iterative spatial join}, journal = {ACM Trans. Database Syst.}, volume = {28}, year = {2003}, month = {2003/09//}, pages = {230 - 256}, abstract = {The key issue in performing spatial joins is finding the pairs of intersecting rectangles. For unindexed data sets, this is usually resolved by partitioning the data and then performing a plane sweep on the individual partitions. The resulting join can be viewed as a two-step process where the partition corresponds to a hash-based join while the plane-sweep corresponds to a sort-merge join. In this article, we look at extending the idea of the sort-merge join for one-dimensional data to multiple dimensions and introduce the Iterative Spatial Join. As with the sort-merge join, the Iterative Spatial Join is best suited to cases where the data is already sorted. However, as we show in the experiments, the Iterative Spatial Join performs well when internal memory is limited, compared to the partitioning methods. This suggests that the Iterative Spatial Join would be useful for very large data sets or in situations where internal memory is a shared resource and is therefore limited, such as with today{\textquoteright}s database engines which share internal memory amongst several queries. Furthermore, the performance of the Iterative Spatial Join is predictable and has no parameters which need to be tuned, unlike other algorithms. The Iterative Spatial Join is based on a plane sweep algorithm, which requires the entire data set to fit in internal memory. When internal memory overflows, the Iterative Spatial Join simply makes additional passes on the data, thereby exhibiting only a gradual performance degradation. To demonstrate the use and efficacy of the Iterative Spatial Join, we first examine and analyze current approaches to performing spatial joins, and then give a detailed analysis of the Iterative Spatial Join as well as present the results of extensive testing of the algorithm, including a comparison with partitioning-based spatial join methods. These tests show that the Iterative Spatial Join overcomes the performance limitations of the other algorithms for data sets of all sizes as well as differing amounts of internal memory.}, keywords = {external memory algorithms, plane-sweep, Spatial databases, Spatial join}, isbn = {0362-5915}, doi = {10.1145/937598.937600}, url = {http://doi.acm.org/10.1145/937598.937600}, author = {Jacox,Edwin H. and Samet, Hanan} } @conference {11896, title = {Kernel snakes: non-parametric active contour models}, booktitle = {IEEE International Conference on Systems, Man and Cybernetics, 2003}, volume = {1}, year = {2003}, month = {2003/10//}, pages = {240- 244 vol.1 - 240- 244 vol.1}, publisher = {IEEE}, organization = {IEEE}, abstract = {In this paper, a new non-parametric generalized formulation to statistical pressure snakes is presented. We discuss the shortcomings of the traditional pressure snakes. We then introduce a new generic pressure model that alleviates these shortcomings, based on the Bayesian decision theory. Non-parametric techniques are used to obtain the statistical models that drive the snake. We discuss the advantages of using the proposed non-parametric model compared to other parametric techniques. Multi-colored-target tracking is used to demonstrate the performance of the proposed approach. Experimental results show enhanced, real-time performance.}, keywords = {Active contours, Artificial intelligence, Bayes methods, Bayesian decision theory, Bayesian methods, decision theory, Deformable models, Image edge detection, Image segmentation, Intelligent robots, Kernel, kernel snakes, Laboratories, multicolored target tracking, nonparametric active contour models, nonparametric generalized formulation, nonparametric model, nonparametric statistics, nonparametric techniques, real time performance, Robot vision systems, statistical pressure snakes, target tracking}, isbn = {0-7803-7952-7}, doi = {10.1109/ICSMC.2003.1243822}, author = {Abd-Almageed, Wael and Smith,C.E. and Ramadan,S.} } @conference {13247, title = {Learning dynamics for exemplar-based gesture recognition}, booktitle = {Computer Vision and Pattern Recognition, 2003. Proceedings. 2003 IEEE Computer Society Conference on}, volume = {1}, year = {2003}, month = {2003/06//}, pages = {I-571 - I-578 vol.1 - I-571 - I-578 vol.1}, abstract = {This paper addresses the problem of capturing the dynamics for exemplar-based recognition systems. Traditional HMM provides a probabilistic tool to capture system dynamics and in exemplar paradigm, HMM states are typically coupled with the exemplars. Alternatively, we propose a non-parametric HMM approach that uses a discrete HMM with arbitrary states (decoupled from exemplars) to capture the dynamics over a large exemplar space where a nonparametric estimation approach is used to model the exemplar distribution. This reduces the need for lengthy and non-optimal training of the HMM observation model. We used the proposed approach for view-based recognition of gestures. The approach is based on representing each gesture as a sequence of learned body poses (exemplars). The gestures are recognized through a probabilistic framework for matching these body poses and for imposing temporal constraints between different poses using the proposed non-parametric HMM.}, keywords = {arbitrary, body, by, Computer, constraint;, detection;, discrete, distribution, dynamics;, edge, estimation;, example;, exemplar, exemplar-based, extraction;, feature, framework;, gesture, gesture;, hidden, HMM;, human, image, learning, Markov, matching;, model;, models;, motion;, nonparametric, pose, probabilistic, recognition;, sequence;, space;, state;, statistics;, system, temporal, tool;, view-based, vision;}, doi = {10.1109/CVPR.2003.1211405}, author = {Elgammal,A. and Shet,V. and Yacoob,Yaser and Davis, Larry S.} } @book {17277, title = {Leonardo{\textquoteright}s Laptop: Human Needs and the New Computing Technologies}, year = {2003}, month = {2003/09/01/}, publisher = {MIT Press}, organization = {MIT Press}, abstract = {2003 IEEE-USAB Award for Distinguished Literary Contributions Furthering Public Understanding of the Profession. and Selected as a Finalist in the category of Computer/Internet in the 2002 Independent Publisher Book Awards (IPPYs) presented by Independent Publisher MagazineBen Shneiderman{\textquoteright}s book dramatically raises computer users{\textquoteright} expectations of what they should get from technology. He opens their eyes to new possibilities and invites them to think freshly about future technology. He challenges developers to build products that better support human needs and that are usable at any bandwidth. Shneiderman proposes Leonardo da Vinci as an inspirational muse for the "new computing." He wonders how Leonardo would use a laptop and what applications he would create.Shneiderman shifts the focus from what computers can do to what users can do. A key transformation is to what he calls "universal usability," enabling participation by young and old, novice and expert, able and disabled. This transformation would empower those yearning for literacy or coping with their limitations. Shneiderman proposes new computing applications in education, medicine, business, and government. He envisions a World Wide Med that delivers secure patient histories in local languages at any emergency room and thriving million-person communities for e-commerce and e-government. Raising larger questions about human relationships and society, he explores the computer{\textquoteright}s potential to support creativity, consensus-seeking, and conflict resolution. Each chapter ends with a Skeptic{\textquoteright}s Corner that challenges assumptions about trust, privacy, and digital divides.}, keywords = {Computers / Data Processing, Computers / Data Processing / General, Computers / Data Processing / Storage \& Retrieval, Computers / Social Aspects / Human-Computer Interaction, Computers / System Administration / Storage \& Retrieval, Electronic data processing, Human-computer interaction, Technological forecasting, Technology \& Engineering / Social Aspects}, isbn = {9780262692991}, author = {Shneiderman, Ben} } @inbook {16129, title = {LifeLines: Using Visualization to Enhance Navigation and Analysis of Patient Records}, booktitle = {The Craft of Information VisualizationThe Craft of Information Visualization}, year = {2003}, month = {2003///}, pages = {308 - 312}, publisher = {Morgan Kaufmann}, organization = {Morgan Kaufmann}, address = {San Francisco}, isbn = {978-1-55860-915-0}, url = {http://www.sciencedirect.com/science/article/pii/B978155860915050038X}, author = {Plaisant, Catherine and Mushlin,Richard and Snyder,Aaron and Li,Jia and Heller,Dan and Shneiderman, Ben}, editor = {Bederson, Benjamin B. and Shneiderman, Ben} } @article {12392, title = {Logic foundry: rapid prototyping for FPGA-based DSP systems}, journal = {EURASIP J. Appl. Signal Process.}, volume = {2003}, year = {2003}, month = {2003/01//}, pages = {565 - 579}, abstract = {We introduce the Logic Foundry, a system for the rapid creation and integration of FPGA-based digital signal processing systems. Recognizing that some of the greatest challenges in creating FPGA-based systems occur in the integration of the various components, we have proposed a system that targets the following four areas of integration: design flow integration, component integration, platform integration, and software integration. Using the Logic Foundry, a system can be easily specified, and then automatically constructed and integrated with system level software.}, keywords = {CAD tools, Design methodology, DSP, FPGA, integration, rapid prototyping}, isbn = {1110-8657}, doi = {10.1155/S1110865703301039}, url = {http://dx.doi.org/10.1155/S1110865703301039}, author = {Spivey,Gary and Bhattacharyya, Shuvra S. and Nakajima,Kazuo} } @article {15769, title = {Machine and Human Performance for Single- and Multi-Document Summarization}, journal = {IEEE Intelligent Systems (special issue on Natural Language Processing)}, volume = {18}, year = {2003}, month = {2003///}, pages = {46 - 54}, url = {http://csdl.computer.org/comp/mags/ex/2003/01/x1toc.htmhttp://csdl.computer.org/comp/mags/ex/2003/01/x1toc.htm}, author = {Schlesinger,Judith D. and Conroy,John M. and Okurowski,Mary Ellen and O{\textquoteright}Leary, Dianne P.} } @article {15847, title = {Making miracles: Interactive translingual search for cebuano and hindi}, journal = {ACM Transactions on Asian Language Information Processing (TALIP)}, volume = {2}, year = {2003}, month = {2003///}, pages = {219 - 244}, author = {He,D. and Oard, Douglas and Wang,J. and Luo,J. and Demner-Fushman,D. and Darwish,K. and Resnik, Philip and Khudanpur,S. and Nossal,M. and Subotin,M. and others} } @article {17706, title = {Matrix Algorithms, Volume II: Eigensystems}, journal = {Applied Mechanics Reviews}, volume = {56}, year = {2003}, month = {2003///}, pages = {B2-B2 - B2-B2}, keywords = {algorithm theory, Eigenvalues and eigenfunctions, linear algebra, matrix algebra, reviews}, doi = {10.1115/1.1523352}, url = {http://link.aip.org/link/?AMR/56/B2/1}, author = {Stewart, G.W. and Author and Mahajan,A. and Reviewer} } @conference {13596, title = {Measuring Structural Similarity of Document Pages for Searching Document Image Databases}, booktitle = {5th IASTEDInternational Conference on Signal and Image Processing}, year = {2003}, month = {2003/08//}, pages = {320 - 325}, abstract = {Current document management and database systems provide text search and retrieval capabilities, but generally lack the ability to utilize the documents{\^a}{\texteuro}{\texttrademark} logical and physical structures. This paper describes a general system for document image retrieval that is able to make use of document structure. It discusses the use of structural similarity for retrieval; it defines a measure of structural similarity between document images based on content area overlap, and also compares similarity ratings based on this measure with human relevance judgments.}, author = {Shin,C. and David Doermann and Rosenfeld, A.} } @conference {17291, title = {MediaFinder: an interface for dynamic personal media management with semantic regions}, booktitle = {CHI {\textquoteright}03 extended abstracts on Human factors in computing systems}, series = {CHI EA {\textquoteright}03}, year = {2003}, month = {2003///}, pages = {764 - 765}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Computer users deal with large amounts of personal media often face problems in managing and exploring it. This paper presents Semantic Regions, rectangular regions that enable users to specify their semantics or mental models, and the MediaFinder application, which uses Semantic Regions as the basis of a personal media management tool.}, keywords = {dynamic queries, Fling-and-flock, Personal media management, spatial information organization, User interfaces}, isbn = {1-58113-637-4}, doi = {10.1145/765891.765977}, url = {http://doi.acm.org/10.1145/765891.765977}, author = {Kang,Hyunmo and Shneiderman, Ben} } @article {17709, title = {Memory leaks in derived types revisited}, journal = {SIGPLAN Fortran Forum}, volume = {22}, year = {2003}, month = {2003/12//}, pages = {25 - 27}, abstract = {In a note in the Fortran Forum, Markus describes a technique for avoiding memory leaks with derived types. In this note, we show by a simple example that this technique does not work when the object in question is a parameter in nested subprogram invocations. A fix is proposed and illustrated with code from MATRAN, a Fortran 95 package for performing matrix manipulations.}, isbn = {1061-7264}, doi = {10.1145/962180.962183}, url = {http://doi.acm.org/10.1145/962180.962183}, author = {Stewart, G.W.} } @article {13386, title = {MobiCom poster: mining a world of smart sensors}, journal = {SIGMOBILE Mob. Comput. Commun. Rev.}, volume = {7}, year = {2003}, month = {2003/01//}, pages = {34 - 36}, isbn = {1559-1662}, doi = {10.1145/881978.881987}, url = {http://doi.acm.org/10.1145/881978.881987}, author = {Nath,Suman and Deshpande, Amol and Gibbons,Phillip B. and Seshan,Srinivasan} } @conference {16137, title = {New approaches to help users get started with visual interfaces: multi-layered interfaces and integrated initial guidance}, 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 = {We are investigating new ways to help users learn to use public access interactive tools, in particular for the visual exploration of government statistics. Our work led to a series of interfaces using multi-layered design and a new help method called Integrated Initial Guidance. Multi-layer designs structure an interface so that a simpler interface is available for users to get started and more complex features are accessed as users move through the more advanced layers. Integrated Initial Guidance provides help within the working interface, right at the start of the application. Using the metaphor of "sticky notes" overlaid on top of the functional interface locates the main widgets, demonstrates their manipulation, and explains the resulting actions using preset animation of the interface. Usability testing with 12 participants led to refined designs and guidelines for the design of Integrated Initial Guidance interfaces.}, url = {http://dl.acm.org/citation.cfm?id=1123196.1123269}, author = {Kang,Hyunmo and Plaisant, Catherine and Shneiderman, Ben} } @conference {11905, title = {Non-parametric expectation maximization: a learning automata approach}, booktitle = {IEEE International Conference on Systems, Man and Cybernetics, 2003}, volume = {3}, year = {2003}, month = {2003/10//}, pages = {2996- 3001 vol.3 - 2996- 3001 vol.3}, publisher = {IEEE}, organization = {IEEE}, abstract = {The famous expectation maximization technique suffers two major drawbacks. First, the number of components has to be specified apriori. Also, the expectation maximization is sensitive to initialization. In this paper, we present a new stochastic technique for estimating the mixture parameters. Parzen Window is used to estimate a discrete estimate of the PDF of the given data. Stochastic learning automata is then used to select the mixture parameters that minimize the distance between the discrete estimate of the PDF and the estimate of the expectation maximization. The validity of the proposed approach is verified using bivariate simulation data.}, keywords = {Automatic speech recognition, bivariate simulation data, Computational modeling, Computer vision, Density functional theory, expectation maximization technique, learning automata, mixture parameters estimation, nonparametric expectation maximization, nonparametric statistics, optimisation, parameter estimation, Parzen Window, PDF, probability, probability density function, Speech processing, Speech recognition, stochastic learning automata, Stochastic processes, stochastic technique}, isbn = {0-7803-7952-7}, doi = {10.1109/ICSMC.2003.1244347}, author = {Abd-Almageed, Wael and El-Osery,A. and Smith,C.E.} } @article {14943, title = {An O(n)-Space O(log n/log log n + f)-Query Time Algorithm for 3-D Dominance Reporting}, volume = {UMIACS-TR-2003-77}, year = {2003}, month = {2003/08/01/}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {We present a linear-space algorithm for handling the {\emthree-dimensional dominance reporting problem}: given a set $S$ of $n$ three-dimensional points, design a data structure for $S$ so that the points in $S$ which dominate a given query point can be reported quickly. Under the variation of the RAM model introduced by Fredman and Willard~\cite{Fredman94}, our algorithm achieves $O(\log n/\log\log n+f)$ query time, where $f$ is the number of points reported. Extensions to higher dimensions are also reported. (UMIACS-TR-2003-77) }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/1301}, author = {Shi,Qingmin and JaJa, Joseph F.} } @article {16722, title = {The Opsis project: materialized views for data warehouses and the web}, journal = {Advances in Informatics}, year = {2003}, month = {2003///}, pages = {64 - 81}, author = {Roussopoulos, Nick and Kotidis,Y. and Labrinidis,A. and Sismanis,Y.} } @article {17810, title = {Optimizing Heavily Loaded Agents}, year = {2003}, month = {2003/06//}, institution = {Department of Computer Science, University of Maryland, College Park}, abstract = {We develop algorithms to help scale software agents built on top of heterogeneous, legacy codebases. The algorithms apply to large data sets, to large volumes of workloads on agents, as well as algorithms for computationally intensive functions.}, author = {V.S. Subrahmanian} } @article {12954, title = {Pathogenic Potential of Environmental Vibrio Cholerae Strains Carrying Genetic Variants of the Toxin-Coregulated Pilus Pathogenicity Island}, journal = {Infection and ImmunityInfect. Immun.}, volume = {71}, year = {2003}, month = {2003/02/01/}, pages = {1020 - 1025}, abstract = {The major virulence factors of toxigenic Vibrio cholerae are cholera toxin (CT), which is encoded by a lysogenic bacteriophage (CTXΦ), and toxin-coregulated pilus (TCP), an essential colonization factor which is also the receptor for CTXΦ. The genes for the biosynthesis of TCP are part of a larger genetic element known as the TCP pathogenicity island. To assess their pathogenic potential, we analyzed environmental strains of V. cholerae carrying genetic variants of the TCP pathogenicity island for colonization of infant mice, susceptibility to CTXΦ, and diarrheagenicity in adult rabbits. Analysis of 14 environmental strains, including 3 strains carrying a new allele of the tcpA gene, 9 strains carrying a new allele of the toxT gene, and 2 strains carrying conventional tcpA and toxT genes, showed that all strains colonized infant mice with various efficiencies in competition with a control El Tor biotype strain of V. cholerae O1. Five of the 14 strains were susceptible to CTXΦ, and these transductants produced CT and caused diarrhea in adult rabbits. These results suggested that the new alleles of the tcpA and toxT genes found in environmental strains of V. cholerae encode biologically active gene products. Detection of functional homologs of the TCP island genes in environmental strains may have implications for understanding the origin and evolution of virulence genes of V. cholerae.}, isbn = {0019-9567, 1098-5522}, doi = {10.1128/IAI.71.2.1020-1025.2003}, url = {http://iai.asm.org/content/71/2/1020}, author = {Faruque,Shah M. and Kamruzzaman,M. and Meraj,Ismail M. and Chowdhury,Nityananda and Nair,G. Balakrish and Sack,R. Bradley and Rita R Colwell and Sack,David A.} } @inbook {15786, title = {Performance of a Three-Stage System for Multi-Document Summarization}, booktitle = {DUC 03 Conference ProceedingsDUC 03 Conference Proceedings}, year = {2003}, month = {2003///}, publisher = {U.S. National Inst. of Standards and Technology}, organization = {U.S. National Inst. of Standards and Technology}, url = {http://duc.nist.gov/http://duc.nist.gov/}, author = {Dunlavy,Daniel M. and Conroy,John M. and Schlesinger,Judith D. and Goodman,Sarah A. and Okurowski,Mary Ellen and O{\textquoteright}Leary, Dianne P. and Halteren,Hans van} } @article {12945, title = {Persistence of adhesive properties in Vibrio cholerae after long-term exposure to sea water}, journal = {Environmental Microbiology}, volume = {5}, year = {2003}, month = {2003/10/01/}, pages = {850 - 858}, abstract = {The effect of exposure to artificial sea water (ASW) on the ability of classical Vibrio cholerae O1 cells to interact with chitin-containing substrates and human intestinal cells was studied. Incubation of vibrios in ASW at 5{\textdegree}C and 18{\textdegree}C resulted in two kinds of cell responses: the viable but non-culturable (VBNC) state (i.e.~<0.1 colony forming unit ml-1) at 5{\textdegree}C, and starvation (i.e. maintenance of culturability of the population) at 18{\textdegree}C. The latter remained rod shaped and, after 40~days{\textquoteright} incubation, presented a 47{\textendash}58\% reduction in the number of cells attached to chitin, a 48{\textendash}53\% reduction in the number of bacteria adhering to copepods, and a 48{\textendash}54\% reduction in the number of bacteria adhering to human cultured intestinal cells, compared to control cells not suspended in ASW. Bacteria suspended in ASW at 5{\textdegree}C became coccoid and, after 40~days, showed 34{\textendash}42\% fewer cells attached to chitin, 52{\textendash}55\% fewer adhering to copep-ods, and 45{\textendash}48\% fewer cells adhering to intestinal cell monolayers, compared to controls. Sarkosyl-insoluble membrane proteins that bind chitin particles were isolated and analysed by SDS-PAGE. After 40~days incubation in ASW at both 5{\textdegree}C and 18{\textdegree}C vibrios expressed chitin-binding ligands similar to bacteria harvested in the stationary growth phase. It is concluded that as vibrios do not lose adhesive properties after long-term exposure to ASW, it is important to include methods for VBNC bacteria when testing environmental and clinical samples for purposes of public health safety.}, isbn = {1462-2920}, doi = {10.1046/j.1462-2920.2003.00498.x}, url = {http://onlinelibrary.wiley.com/doi/10.1046/j.1462-2920.2003.00498.x/abstract?userIsAuthenticated=false\&deniedAccessCustomisedMessage=}, author = {Pruzzo,Carla and Tarsi,Renato and Del Mar Lle{\`o},Maria and Signoretto,Caterina and Zampini,Massimiliano and Pane,Luigi and Rita R Colwell and Canepari,Pietro} } @conference {18469, title = {Pitch and timbre manipulations using cortical representation of sound}, booktitle = {Multimedia and Expo, IEEE International Conference on}, volume = {3}, year = {2003}, month = {2003///}, pages = {381 - 384}, publisher = {IEEE Computer Society}, organization = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, abstract = {The sound receiver at the ears is processed by humans using signal processing that separate the signal along intensity, pitch and timbre dimensions. Conventional Fourier-based signal processing, while endowed with fast algorithms, is unable to easily represent signal along these attributes. In this paper we use a cortical representation to represent the manipulate sound. We briefly overview algorithms for obtaining, manipulating and inverting cortical representation of sound and describe algorithms for manipulating signal pitch and timbre separately. The algorithms are first used to create sound of an instrument between a guitar and a trumpet. Applications to creating maximally separable sounds in auditory user interfaces are discussed.}, isbn = {0-7803-7965-9}, doi = {http://doi.ieeecomputersociety.org/10.1109/ICME.2003.1221328}, author = {Zotkin,Dmitry N and Shamma,S.A. and Ru,P. and Duraiswami, Ramani and Davis, Larry S.} } @article {13410, title = {A planner for composing services described in DAML-S}, journal = {International Conference on Automated Planning and Scheduling (ICAPS) 2003 Workshop on planning for web services}, year = {2003}, month = {2003///}, author = {Sheshagiri,M. and desJardins, Marie and Finin,T.} } @article {17724, title = {On the powers of a matrix with perturbations}, journal = {Numerische Mathematik}, volume = {96}, year = {2003}, month = {2003///}, pages = {363 - 376}, abstract = {Let A be a matrix of order n. The properties of the powers A k of A have been extensively studied in the literature. This paper concerns the perturbed powers Pk=(A+Ek)(A+Ek-1)(A+E1) where the E k are perturbation matrices. We will treat three problems concerning the asymptotic behavior of the perturbed powers. First, determine conditions under which Pk0 . Second, determine the limiting structure of P k . Third, investigate the convergence of the power method with error: that is, given u 1 , determine the behavior of u k =ngr k P k u 1 , where ngr k is a suitable scaling factor.}, doi = {10.1007/s00211-003-0470-0}, author = {Stewart, G.W.} } @conference {17811, title = {Probabilistically survivable mass}, booktitle = {INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE}, volume = {18}, year = {2003}, month = {2003///}, pages = {789 - 795}, abstract = {Multiagent systems (MAS) can "go down" for alarge number of reasons, ranging from system mal- functions and power failures to malicious attacks. The placement of agents on nodes is called a de- ployment of the MAS. We develop a probabilis- tic model of survivability of a deployed MAS and provide two algorithms to compute the probability of survival of a deployed MAS. Our probabilistic model docs not make independence assumptions though such assumptions can be added if so de- sired. An optimal deployment of a MAS is one that maximizes its survival probability. We provide a mathematical answerto this question, an algorithm that computes an exact solution to this problem, as well as several algorithms that quickly compute approximate solutions to the problem. We have implemented our algorithms - our implementation demonstrates that computing deployments can be done scalably. }, author = {Kraus,S. and V.S. Subrahmanian and Tas,N. C} } @article {12788, title = {A process-algebraic language for probabilistic I/O automata}, journal = {CONCUR 2003-Concurrency Theory}, year = {2003}, month = {2003///}, pages = {193 - 207}, author = {Stark,E. W and Cleaveland, Rance and Smolka,S. A} } @article {16897, title = {Properties of embedding methods for similarity searching in metric spaces}, journal = {Pattern Analysis and Machine Intelligence, IEEE Transactions on}, volume = {25}, year = {2003}, month = {2003/05//}, pages = {530 - 549}, abstract = {Complex data types-such as images, documents, DNA sequences, etc.-are becoming increasingly important in modern database applications. A typical query in many of these applications seeks to find objects that are similar to some target object, where (dis)similarity is defined by some distance function. Often, the cost of evaluating the distance between two objects is very high. Thus, the number of distance evaluations should be kept at a minimum, while (ideally) maintaining the quality of the result. One way to approach this goal is to embed the data objects in a vector space so that the distances of the embedded objects approximates the actual distances. Thus, queries can be performed (for the most part) on the embedded objects. We are especially interested in examining the issue of whether or not the embedding methods will ensure that no relevant objects are left out. Particular attention is paid to the SparseMap, FastMap, and MetricMap embedding methods. SparseMap is a variant of Lipschitz embeddings, while FastMap and MetricMap are inspired by dimension reduction methods for Euclidean spaces. We show that, in general, none of these embedding methods guarantee that queries on the embedded objects have no false dismissals, while also demonstrating the limited cases in which the guarantee does hold. Moreover, we describe a variant of SparseMap that allows queries with no false dismissals. In addition, we show that with FastMap and MetricMap, the distances of the embedded objects can be much greater than the actual distances. This makes it impossible (or at least impractical) to modify FastMap and MetricMap to guarantee no false dismissals.}, keywords = {complex, contractiveness;, data, databases;, decomposition;, dimension, distance, distortion;, DNA, documents;, EMBEDDING, embeddings;, Euclidean, evaluations;, FastMap;, images;, Lipschitz, methods;, metric, MetricMap;, multimedia, processing;, query, reduction, search;, searching;, sequences;, similarity, singular, spaces;, SparseMap;, types;, value}, isbn = {0162-8828}, doi = {10.1109/TPAMI.2003.1195989}, author = {Hjaltason,G. R and Samet, Hanan} } @conference {14387, title = {PXML: a probabilistic semistructured data model and algebra}, booktitle = {Data Engineering, 2003. Proceedings. 19th International Conference on}, year = {2003}, month = {2003/03//}, pages = {467 - 478}, abstract = {Despite the recent proliferation of work on semistructured data models, there has been little work to date on supporting uncertainty in these models. We propose a model for probabilistic semistructured data (PSD). The advantage of our approach is that it supports a flexible representation that allows the specification of a wide class of distributions over semistructured instances. We provide two semantics for the model and show that the semantics are probabilistically coherent. Next, we develop an extension of the relational algebra to handle probabilistic semistructured data and describe efficient algorithms for answering queries that use this algebra. Finally, we present experimental results showing the efficiency of our algorithms.}, keywords = {algebra;, data, databases;, instances;, model;, models;, probabilistic, processing;, PXML;, query, relational, semistructured, structures;, tree, XML;}, doi = {10.1109/ICDE.2003.1260814}, author = {Hung,E. and Getoor, Lise and V.S. Subrahmanian} } @article {17522, title = {Quantifying the causes of path inflation}, journal = {Topology}, volume = {100}, year = {2003}, month = {2003///}, pages = {2 - 1}, author = {Spring, Neil and Mahajan,R. and Anderson,T.} } @conference {14543, title = {Random MAX SAT, random MAX CUT, and their phase transitions}, booktitle = {Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms}, year = {2003}, month = {2003///}, pages = {364 - 373}, author = {Coppersmith,D. and Gamarnik,D. and Hajiaghayi, Mohammad T. and Sorkin,G. B} } @article {15019, title = {Recovery of a Digital Image Collection Through the SDSC/UMD/NARA Prototype Persistent Archive}, volume = {UMIACS-TR-2003-105}, year = {2003}, month = {2003/11/25/}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {The San Diego Supercomputer Center (SDSC), the University of Maryland, and theNational Archives and Records Administration (NARA) are collaborating on building a pilot persistent archive using and extending data grid and digital library technologies. The current prototype consists of node servers at SDSC, University of Maryland, and NARA, connected through the Storage Request Broker (SRB) data grid middleware, and currently holds several terabytes of NARA selected collections. In particular, a historically important image collection that was on the verge of becoming inaccessible was fully restored and ingested into our pilot system. In this report, we describe the methodology behind our approach to fully restore this image collection and the process used to ingest it into the prototype persistent archive. (UMIACS-TR-2003-105) }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/1321}, author = {Smorul,Mike and JaJa, Joseph F. and McCall,Fritz and Brown,Susan Fitch and Moore,Reagan and Marciano,Richard and Chen,Sheau-Yen and Lopez,Rick and Chadduck,Robert} } @article {12953, title = {Reduction of Cholera in Bangladeshi Villages by Simple Filtration}, journal = {Proceedings of the National Academy of SciencesPNAS}, volume = {100}, year = {2003}, month = {2003/02/04/}, pages = {1051 - 1055}, abstract = {Based on results of ecological studies demonstrating that Vibrio cholerae, the etiological agent of epidemic cholera, is commensal to zooplankton, notably copepods, a simple filtration procedure was developed whereby zooplankton, most phytoplankton, and particulates >20 μm were removed from water before use. Effective deployment of this filtration procedure, from September 1999 through July 2002 in 65 villages of rural Bangladesh, of which the total population for the entire study comprised ≈133,000 individuals, yielded a 48\% reduction in cholera (P < 0.005) compared with the control.}, isbn = {0027-8424, 1091-6490}, doi = {10.1073/pnas.0237386100}, url = {http://www.pnas.org/content/100/3/1051}, author = {Rita R Colwell and Huq,Anwar and M. Sirajul Islam and K. M. A. Aziz and Yunus,M. and N. Huda Khan and A. Mahmud and Sack,R. Bradley and Nair,G. B. and J. Chakraborty and Sack,David A. and E. Russek-Cohen} } @article {15410, title = {Regression testing of GUIs}, journal = {ACM SIGSOFT Software Engineering Notes}, volume = {28}, year = {2003}, month = {2003/09//}, pages = {118 - 127}, abstract = {Although graphical user interfaces (GUIs) constitute a large part of the software being developed today and are typically created using rapid prototyping, there are no effective regression testing techniques for GUIs. The needs of GUI regression testing differ from those of traditional software. When the structure of a GUI is modified, test cases from the original GUI are either reusable or unusable on the modified GUI. Since GUI test case generation is expensive, our goal is to make the unusable test cases usable. The idea of reusing these unusable (a.k.a. obsolete) test cases has not been explored before. In this paper, we show that for GUIs, the unusability of a large number of test cases is a serious problem. We present a novel GUI regression testing technique that first automatically determines the usable and unusable test cases from a test suite after a GUI modification. It then determines which of the unusable test cases can be repaired so they can execute on the modified GUI. The last step is to repair the test cases. Our technique is integrated into a GUI testing framework that, given a test case, automatically executes it on the GUI. We implemented our regression testing technique and demonstrate for two case studies that our approach is effective in that many of the test cases can be repaired, and is practical in terms of its time performance.}, keywords = {call-tree, classification of events, GUI call-graph, GUI control-flow graph, GUI testing, regression testing, repairing test cases}, isbn = {0163-5948}, doi = {10.1145/949952.940088}, url = {http://doi.acm.org/10.1145/949952.940088}, author = {Memon, Atif M. and Soffa,Mary Lou} } @article {12153, title = {Replicated studies: building a body of knowledge about software reading techniques}, journal = {SERIES ON SOFTWARE ENGINEERING AND KNOWLEDGE ENGINEERING}, volume = {12}, year = {2003}, month = {2003///}, pages = {39 - 84}, author = {Shull, F. and Carver, J. and Travassos,G.H. and Maldonado,J.C. and Conradi,R. and Basili, Victor R.} } @article {12302, title = {Resilient multicast using overlays}, journal = {SIGMETRICS Perform. Eval. Rev.}, volume = {31}, year = {2003}, month = {2003/06//}, pages = {102 - 113}, abstract = {We introduce PRM (Probabilistic Resilient Multicast): a multicast data recovery scheme that improves data delivery ratios while maintaining low end-to-end latencies. PRM has both a proactive and a reactive component; in this paper we describe how PRM can be used to improve the performance of application-layer multicast protocols, especially when there are high packet losses and host failures. Further, using analytic techniques, we show that PRM can guarantee arbitrarily high data delivery ratios and low latency bounds. As a detailed case study, we show how PRM can be applied to the NICE application-layer multicast protocol. We present detailed simulations of the PRM-enhanced NICE protocol for 10,000 node Internet-like topologies. Simulations show that PRM achieves a high delivery ratio (> 97\%) with a low latency bound (600 ms) for environments with high end-to-end network losses (1-5\%) and high topology change rates (5 changes per second) while incurring very low overheads (< 5\%).}, keywords = {overlay multicast, randomized forwarding, Resilience}, isbn = {0163-5999}, doi = {10.1145/885651.781041}, url = {http://doi.acm.org/10.1145/885651.781041}, author = {Banerjee,Suman and Lee,Seungjoon and Bhattacharjee, Bobby and Srinivasan, Aravind} } @conference {15963, title = {RGL study in a hybrid real-time system}, booktitle = {Proceedings of the IASTED NCI}, year = {2003}, month = {2003///}, author = {Hennacy,K. and Swamy,N. and Perlis, Don} } @conference {15140, title = {Round efficiency of multi-party computation with a dishonest majority}, booktitle = {Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques}, series = {EUROCRYPT{\textquoteright}03}, year = {2003}, month = {2003///}, pages = {578 - 595}, publisher = {Springer-Verlag}, organization = {Springer-Verlag}, address = {Berlin, Heidelberg}, abstract = {We consider the round complexity of multi-party computation in the presence of a static adversary who controls a majority of the parties. Here, n players wish to securely compute some functionality and up to n - 1 of these players may be arbitrarily malicious. Previous protocols for this setting (when a broadcast channel is available) require O(n) rounds. We present two protocols with improved round complexity: The first assumes only the existence of trapdoor permutations and dense cryptosystems, and achieves round complexity O(log n) based on a proof scheduling technique of Chor and Rabin [13]; the second requires a stronger hardness assumption (along with the non-black-box techniques of Barak [2]) and achieves O(1) round complexity.}, isbn = {3-540-14039-5}, url = {http://dl.acm.org/citation.cfm?id=1766171.1766222}, author = {Katz, Jonathan and Ostrovsky,Rafail and Smith,Adam} } @conference {17530, title = {Scriptroute: A public Internet measurement facility}, booktitle = {Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems-Volume 4}, year = {2003}, month = {2003///}, pages = {17 - 17}, author = {Spring, Neil and Wetherall,D. and Anderson,T.} } @article {15839, title = {Searching large collections of recorded speech: A preliminary study}, journal = {Proceedings of the American Society for Information Science and Technology}, volume = {40}, year = {2003}, month = {2003///}, pages = {330 - 339}, author = {Kim,J. and Oard, Douglas and Soergel,D.} } @conference {16780, title = {SEB-tree: An approach to index continuously moving objects}, booktitle = {Mobile Data Management}, year = {2003}, month = {2003///}, pages = {340 - 344}, author = {Song,Z. and Roussopoulos, Nick} } @article {17814, title = {Secure agents}, journal = {Annals of Mathematics and Artificial Intelligence}, volume = {37}, year = {2003}, month = {2003///}, pages = {169 - 235}, abstract = {With the rapid proliferation of software agents, there comes an increased need for agents to ensure that they do not provide data and/or services to unauthorized users. We first develop an abstract definition of what it means for an agent to preserve data/action security. Most often, this requires an agent to have knowledge that is impossible to acquire {\textendash} hence, we then develop approximate security checks that take into account, the fact that an agent usually has incomplete/approximate beliefs about other agents. We develop two types of security checks {\textendash} static ones that can be checked prior to deploying the agent, and dynamic ones that are executed at run time. We prove that a number of these problems are undecidable, but under certain conditions, they are decidable and (our definition of) security can be guaranteed. Finally, we propose a language within which the developer of an agent can specify her security needs, and present provably correct algorithms for static/dynamic security verification.}, doi = {10.1023/A:1020233522878}, author = {Bonatti,P. A and Kraus,S. and V.S. Subrahmanian} } @article {14653, title = {A secure PLAN}, journal = {IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews}, volume = {33}, year = {2003}, month = {2003/08//}, pages = {413 - 426}, abstract = {Active networks, being programmable, promise greater flexibility than current networks. Programmability, however, may introduce safety and security risks. This correspondence describes the design and implementation of a security architecture for the active network PLANet. Security is obtained with a two-level architecture that combines a functionally restricted packet language, PLAN, with an environment of general-purpose service routines governed by trust management. In particular, a technique is used which expands or contracts a packet{\textquoteright}s service environment based on its level of privilege, termed namespace-based security. The design and implementation of an active-network firewall and virtual private network is used as an application of the security architecture. Measurements of the system show that the addition of the firewall imposes an approximately 34\% latency overhead and as little as a 6.7\% space overhead to incoming packets.}, keywords = {active networks, active-network firewall, Authentication, Authorization, Contracts, cryptography, Environmental management, Extraterrestrial measurements, functionally restricted packet language, general-purpose service routines, Internet, latency overhead, namespace-based security, packet switching, PLANet, Planets, privilege level, programmable networks, Safety, safety risks, secure PLAN, security of data, security risks, trust management, two-level architecture, virtual private network, Virtual private networks, Web and internet services}, isbn = {1094-6977}, doi = {10.1109/TSMCC.2003.817347}, author = {Hicks, Michael W. and Keromytis,A. D and Smith,J. M} } @inbook {16132, title = {Seeing the World Through Image Libraries}, booktitle = {The craft of information visualization: readings and reflectionsThe craft of information visualization: readings and reflections}, year = {2003}, month = {2003///}, pages = {47 - 47}, publisher = {Morgan Kaufmann Publishers Inc.}, organization = {Morgan Kaufmann Publishers Inc.}, isbn = {978-1-55860-915-0}, author = {North,C. and Shneiderman, Ben and Plaisant, Catherine and Kang,H. and Bederson, Benjamin B.} } @article {14104, title = {The sequence and analysis of Trypanosoma brucei chromosome II}, journal = {Nucleic acids research}, volume = {31}, year = {2003}, month = {2003///}, pages = {4856 - 4856}, author = {El-Sayed, Najib M. and Ghedin,E. and Song,J. and MacLeod,A. and Bringaud,F. and Larkin,C. and Wanless,D. and Peterson,J. and Hou,L. and Taylor,S. and others} } @article {18995, title = {Sex-lethal splicing autoregulation in vivo: interactions between SEX-LETHAL, the U1 snRNP and U2AF underlie male exon skipping}, journal = {DevelopmentDevelopment}, volume = {130}, year = {2003}, month = {2003/02/01/}, pages = {463 - 471}, abstract = {Alternative splicing of the Sex-lethal pre-mRNA has long served as a model example of a regulated splicing event, yet the mechanism by which the female-specific SEX-LETHAL RNA-binding protein prevents inclusion of the translation-terminating male exon is not understood. Thus far, the only general splicing factor for which there is in vivo evidence for a regulatory role in the pathway leading to male-exon skipping is sans-fille (snf), a protein component of the spliceosomal U1 and U2 snRNPs. Its role, however, has remained enigmatic because of questions about whether SNF acts as part of an intact snRNP or a free protein. We provide evidence that SEX-LETHAL interacts with SANS-FILLE in the context of the U1 snRNP, through the characterization of a point mutation that interferes with both assembly into the U1 snRNP and complex formation with SEX-LETHAL. Moreover, we find that SEX-LETHAL associates with other integral U1 snRNP components, and we provide genetic evidence to support the biological relevance of these physical interactions. Similar genetic and biochemical approaches also link SEX-LETHAL with the heterodimeric splicing factor, U2AF. These studies point specifically to a mechanism by which SEX-LETHAL represses splicing by interacting with these key splicing factors at both ends of the regulated male exon. Moreover, because U2AF and the U1 snRNP are only associated transiently with the pre-mRNA during the course of spliceosome assembly, our studies are difficult to reconcile with the current model that proposes that the SEX-LETHAL blocks splicing at the second catalytic step, and instead argue that the SEX-LETHAL protein acts after splice site recognition, but before catalysis begins.}, keywords = {Drosophila, SNF, Splicing regulation, SXL, U1 snRNP, U2AF}, isbn = {0950-1991, 1477-9129}, doi = {10.1242/dev.00274}, url = {http://dev.biologists.org/content/130/3/463}, author = {Nagengast,Alexis A. and Stitzinger,Shane M. and Tseng,Chin-Hsiu and Mount, Stephen M. and Salz,Helen K.} } @conference {14050, title = {A simplified Newton method for the inverse orthotropic problem}, booktitle = {Antennas and Propagation Society International Symposium, 2003. IEEE}, volume = {1}, year = {2003}, month = {2003/06//}, pages = {535 - 538 vol.1 - 535 - 538 vol.1}, abstract = {We consider one of the most challenging inverse problems in electromagnetic scattering for inhomogeneous medium. We try to reconstruct the elements of a matrix from scattering data in an orthotropic medium. To solve the inverse problem, we implement a simplified Newton method and present some numerical results.}, keywords = {algebra;, electromagnetic, inhomogeneous, inverse, matrix, matrix;, media;, medium;, method;, Newton, orthotropic, problem;, problems;, scattering;, wave}, doi = {10.1109/APS.2003.1217514}, author = {Seydou,F. and Seppanen,T. and Duraiswami, Ramani} } @conference {16896, title = {Simultaneous pose and correspondence determination using line features}, booktitle = {Computer Vision and Pattern Recognition, 2003. Proceedings. 2003 IEEE Computer Society Conference on}, volume = {2}, year = {2003}, month = {2003/06//}, pages = {II-424 - II-431 vol.2 - II-424 - II-431 vol.2}, abstract = {We present a new robust line matching algorithm for solving the model-to-image registration problem. Given a model consisting of 3D lines and a cluttered perspective image of this model, the algorithm simultaneously estimates the pose of the model and the correspondences of model lines to image lines. The algorithm combines softassign for determining correspondences and POSIT for determining pose. Integrating these algorithms into a deterministic annealing procedure allows the correspondence and pose to evolve from initially uncertain values to a joint local optimum. This research extends to line features the SoftPOSIT algorithm proposed recently for point features. Lines detected in images are typically more stable than points and are less likely to be produced by clutter and noise, especially in man-made environments. Experiments on synthetic and real imagery with high levels of clutter, occlusion, and noise demonstrate the robustness of the algorithm.}, keywords = {algorithm;, algorithms;, annealing;, clutter;, cluttered, Computer, correspondence, detection;, determination;, deterministic, environment;, extraction;, feature, feature;, image, image;, imagery;, images;, joint, line, local, man-made, MATCHING, matching;, measurement;, model-to-image, noise;, occlusion;, optimum;, perspective, point, pose, position, problem;, processing;, real, realistic, registration, simulated, softassign;, SoftPOSIT, stereo, synthetic, vision;}, doi = {10.1109/CVPR.2003.1211499}, author = {David,P. and DeMenthon,D. and Duraiswami, Ramani and Samet, Hanan} } @article {15027, title = {Space-Efficient and Fast Algorithms for Multidimensional Dominance Reporting and Range Counting}, volume = {UMIACS-TR-2003-101}, year = {2003}, month = {2003/11/25/}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {We present linear-space sublogarithmic algorithms for handling the {\emthree-dimensional dominance reporting problem} and the {\em two-dimensional range counting problem}. Under the RAM model as described in~[M.~L. Fredman and D.~E. Willard. {\textquoteleft}{\textquoteleft}Surpassing the information theoretic bound with fusion trees{\textquoteright}{\textquoteright}, {\em Journal of Computer and System Sciences}, 47:424--436, 1993], our algorithms achieve $O(\log n/\log\log n+f)$ query time for 3-D dominance reporting, where $f$ is the number of points reported, and $O(\log n/\log\log n)$ query time for 2-D range counting case. We extend these results to any constant dimension $d$ achieving $O(n(\log n/\log\log n)^{d-3})$-space and $O((\log n/\log\log )^{d-2}+f)$-query time for the reporting case and $O(n(\log n/\log\log n)^{d-2})$-space and $O((\log n/\log\log n)^{d-1})$ query time for the counting case. (UMIACS-TR-2003-101) }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/1318}, author = {Shi,Qingmin and JaJa, Joseph F. and Mortensen,Christian} } @conference {12208, title = {Starting an intergenerational technology design team: a case study}, booktitle = {Proceedings of the 2003 conference on Interaction design and children}, series = {IDC {\textquoteright}03}, year = {2003}, month = {2003///}, pages = {51 - 58}, publisher = {ACM}, organization = {ACM}, address = {Preston, England}, abstract = {This paper presents a case study of the first three months of a new intergenerational design team with children ages 10--13. It discusses the research and design methods used for working with children of this age group, the challenges and opportunities of starting a new team, and the lessons learned.}, keywords = {children, cooperative inquiry, design methods, educational applications, intergenerational design teams, participatory design}, isbn = {1-58113-732-X}, doi = {10.1145/953536.953545}, author = {Knudtzon,Kendra and Druin, Allison and Kaplan,Nancy and Summers,Kathryn and Chisik,Yoram and Kulkarni,Rahul and Moulthrop,Stuart and Weeks,Holly and Bederson, Benjamin B.} } @article {17387, title = {Supporting statistical electronic table usage by citizens}, journal = {Commun. ACM}, volume = {46}, year = {2003}, month = {2003/01//}, pages = {52 - 54}, abstract = {Over 70 agencies at the federal level are charged with collecting data and producing and disseminating statistics. These statistics are used to inform government policy, shape health care initiatives, provide information on the state of the economy, and others. They also have significant impact on the lives of citizens who use the statistics, for example, to determine job opportunities, changes in social security benefits, and quality of life in particular areas. Our digital government project developed several specific technologies to support the location, manipulation, and understanding of a quintessential format for statistical information---the table.}, isbn = {0001-0782}, doi = {10.1145/602421.602449}, url = {http://doi.acm.org/10.1145/602421.602449}, author = {Hert,Carol A. and Liddy,Elizabeth D. and Shneiderman, Ben and Marchionini,Gary} } @article {18749, title = {A system for generating process and material selection advice during embodiment design of mechanical components}, journal = {Journal of manufacturing systems}, volume = {22}, year = {2003}, month = {2003///}, pages = {28 - 45}, abstract = {This paper describes a systematic approach to material and process selection during theembodiment design of mechanical components and a system for generating process and material selection advice. Quite often during the embodiment design stage, design requirements are not precisely defined. Therefore, the system described in this paper accounts for imprecision in design requirements during generation and evaluation of alternative process sequences and material options. To reduce the computational effort, the system uses a depth-first branch-and- bound search algorithm. This aids in exploring promising process sequences and material options that can be used to meet the given set of design requirements. Various process sequences and material options are evaluated by using a commercial cost estimation tool. }, url = {ftp://ftp.eng.umd.edu/:/home/glue/s/k/skgupta/backup/pub/Publication/JMS03_Gupta.pdf}, author = {Gupta,S.K. and Chen,Y. and Feng,S. and Sriram,R.} } @article {13344, title = {TelegraphCQ: An architectural status report}, journal = {IEEE Data Engineering Bulletin}, volume = {26}, year = {2003}, month = {2003///}, pages = {11 - 18}, author = {Krishnamurthy, S. and Chandrasekaran,S. and Cooper,O. and Deshpande, Amol and Franklin,M.J. and Hellerstein,J. M and Hong,W. and Madden,S. and Reiss,F. and Shah,M. A} } @conference {13405, title = {TelegraphCQ: continuous dataflow processing}, booktitle = {Proceedings of the 2003 ACM SIGMOD international conference on Management of data}, series = {SIGMOD {\textquoteright}03}, year = {2003}, month = {2003///}, pages = {668 - 668}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, isbn = {1-58113-634-X}, doi = {10.1145/872757.872857}, url = {http://doi.acm.org/10.1145/872757.872857}, author = {Chandrasekaran,Sirish and Cooper,Owen and Deshpande, Amol and Franklin,Michael J. and Hellerstein,Joseph M. and Wei Hong and Krishnamurthy,Sailesh and Madden,Samuel R. and Reiss,Fred and Shah,Mehul A.} } @article {17809, title = {Temporal probabilistic object bases}, journal = {Knowledge and Data Engineering, IEEE Transactions on}, volume = {15}, year = {2003}, month = {2003/08//july}, pages = {921 - 939}, abstract = {There are numerous applications where we have to deal with temporal uncertainty associated with objects. The ability to automatically store and manipulate time, probabilities, and objects is important. We propose a data model and algebra for temporal probabilistic object bases (TPOBs), which allows us to specify the probability with which an event occurs at a given time point. In explicit TPOB-instances, the sets of time points along with their probability intervals are explicitly enumerated. In implicit TPOB-instances, sets of time points are expressed by constraints and their probability intervals by probability distribution functions. Thus, implicit object base instances are succinct representations of explicit ones; they allow for an efficient implementation of algebraic operations, while their explicit counterparts make defining algebraic operations easy. We extend the relational algebra to both explicit and implicit instances and prove that the operations on implicit instances correctly implement their counterpart on explicit instances.}, keywords = {algebra;, algebraic, bases;, constraints;, data, database, database;, databases;, distribution, explicit, functions;, handling;, implicit, instances;, integrity;, intervals;, management;, model;, models;, object, object-oriented, operations;, probabilistic, probability, probability;, relational, temporal, theory;, Uncertainty, uncertainty;}, isbn = {1041-4347}, doi = {10.1109/TKDE.2003.1209009}, author = {Biazzo,V. and Giugno,R. and Lukasiewicz,T. and V.S. Subrahmanian} } @article {17427, title = {Theories for Understanding Information Visualization}, journal = {The craft of information visualization: readings and reflections}, year = {2003}, month = {2003///}, pages = {349 - 349}, author = {Shneiderman, Ben} } @conference {14052, title = {Three dimensional acoustic scattering from an M multilayered domain via an integral equation approach}, booktitle = {Antennas and Propagation Society International Symposium, 2003. IEEE}, volume = {1}, year = {2003}, month = {2003/06//}, pages = {669 - 672 vol.1 - 669 - 672 vol.1}, abstract = {An integral equation approach is derived for three dimensional acoustic scattering from an M multilayered domain. The integral equation is solved using the collocation method. To validate the method, we compare the exact and approximate results. The numerous matrix vector multiplications of our method may be thought a disadvantage. This problem can be overcome by using fast multiple methods where these operations are done very quickly.}, keywords = {acoustic, collocation, dimensional, domain;, equation;, equations;, fast, inhomogeneous, integral, matrix, media;, method;, methods;, multilayered, multilayers;, multiple, multiplication;, multiplications;, scattering;, three, vector, wave}, doi = {10.1109/APS.2003.1217547}, author = {Seydou,F. and Duraiswami, Ramani and Seppanen,T.} } @conference {16133, title = {Toward a statistical knowledge network}, 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 = {This paper describes an architecture for a statistical knowledge network that depends on user interfaces as the glue among the components. These interfaces aim to serve non-expert users with diverse needs and statistical and computing experiences. Such interfaces are crucially dependent on different indexing schemes and good metadata.}, url = {http://dl.acm.org/citation.cfm?id=1123196.1123312}, author = {Marchionini,Gary and Haas,Stephanie and Plaisant, Catherine and Shneiderman, Ben and Hert,Carol} } @conference {12840, title = {Towards formal but flexible scenarios}, booktitle = {2nd International Workshop on Scenarios and State Machines: Models, Algorithms and Tools}, year = {2003}, month = {2003///}, author = {Sengupta,B. and Cleaveland, Rance} } @conference {12839, title = {TRIM: A tool for triggered message sequence charts}, booktitle = {Computer Aided Verification}, year = {2003}, month = {2003///}, pages = {106 - 109}, author = {Sengupta,B. and Cleaveland, Rance} } @article {14057, title = {Two methods for solving a 3D acoustic inverse scattering problem}, journal = {The Journal of the Acoustical Society of America}, volume = {113}, year = {2003}, month = {2003///}, pages = {2191 - 2191}, abstract = {We consider the problem of finding the refractive index of a buried object by using far-field measurements in an inhomogeneous medium. We describe two methods for solving the inverse problem. Both methods are implemented in two steps in order to better deal with the ill-posedness of the problem. In the first method an integral equation of the first kind is derived for the far-field operator which is solved via least-squares and Tikhonov regularization. We then use the solution of the integral equation to derive an over-posed boundary value problem, i.e., the Helmholtz equation in a bounded domain with Cauchy data on the boundary. The index that satisfies this over-posed problem most closely is obtained via the Levenberg{\textendash}Marquardt algorithm. The second method is an iterative method and is based on the Lippmann{\textendash}Schwinger equation. It is implemented via the Newton method. The first step consists, as for the other method. Here we use a Fourier integral approach and regularization via discretization. The second step is to obtain the index by iterating the Lippmann{\textendash}Schwinger equation starting with the Born approximation.}, url = {http://link.aip.org/link/?JAS/113/2191/5}, author = {Seydou,Fadoulourahmane and Gumerov, Nail A. and Duraiswami, Ramani} } @article {17449, title = {Understanding Computer User Frustration: Measuring and Modeling the Disruption from Poor Designs}, journal = {Technical Reports from UMIACS}, year = {2003}, month = {2003/01/21/}, abstract = {User frustration in the use of information and computing technology is apervasive and persistent problem. When computers crash, network congestion causes delays, and poor user interfaces trigger confusion there are dramatic consequences for individuals, organizations, and society. These frustrations not only cause personal dissatisfaction and loss of self-efficacy, but may disrupt workplaces, slow learning, and reduce participation in local and national communities. We propose a Computing Frustration Model with incident specific and individual variables to guide research. Our study of 108 computer users shows high levels of frustration and loss of 1/3 to 1/2 of time spent. The importance of the users{\textquoteright} goals and the severity of the disruption were correlated with frustration. Those who had strong self-efficacy, indicated by a willingness to stick to solving the problem, reported lower levels of frustration. Implications for users, software developers, managers, and policymakers are discussed. Keywords: user frustration, user interface design, training, helpdesk, computer experience, computer anxiety (UMIACS-TR-2002-89) (HCIL-TR-2002-18) }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/1233}, author = {Bessiere,Katie and Ceaparu,Irina and Lazar,Jonathan and Robinson,John and Shneiderman, Ben} } @article {17450, title = {Understanding Hierarchical Clustering Results by Interactive Exploration of Dendrograms: A Case Study with Genomic Microarray Data}, journal = {Technical Reports from UMIACS}, year = {2003}, month = {2003/01/21/}, abstract = {Abstract: Hierarchical clustering is widely used to find patterns inmulti-dimensional datasets, especially for genomic microarray data. Finding groups of genes with similar expression patterns can lead to better understanding of the functions of genes. Early software tools produced only printed results, while newer ones enabled some online exploration. We describe four general techniques that could be used in interactive explorations of clustering algorithms: (1) overview of the entire dataset, coupled with a detail view so that high-level patterns and hot spots can be easily found and examined, (2) dynamic query controls so that users can restrict the number of clusters they view at a time and show those clusters more clearly, (3) coordinated displays: the overview mosaic has a bi-directional link to 2-dimensional scattergrams, (4) cluster comparisons to allow researchers to see how different clustering algorithms group the genes. (UMIACS-TR-2002-50) (HCIL-TR-2002-10) }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/1203}, author = {Seo,Jinwook and Shneiderman, Ben} } @conference {12299, title = {On the use of flow migration for handling short-term overloads}, booktitle = {Global Telecommunications Conference, 2003. GLOBECOM {\textquoteright}03. IEEE}, volume = {6}, year = {2003}, month = {2003/12//}, pages = {3108 - 3112 vol.6 - 3108 - 3112 vol.6}, abstract = {In this work, we investigate flow migration as a mechanism to sustain QoS to network users during short-term overloads in the context of an MPLS IP network. We experiment with three different control techniques: static long-term optimal mapping of flows to LSPs; on-line locally optimal mapping of flows to LSPs at flow set-up time; and dynamic flow migration in response to transient congestion. These techniques are applicable over different timescales, have different run-time overheads, and require different levels of monitoring and control software inside the network. We present results both from detailed simulations and a complete implementation using software IP routers. We use voice-over-IP as our test application, and show that if end-to-end quality is to be maintained during short unpredictable bursts of high load, then a fast-timescale control such as migration is required.}, keywords = {computing;, CONGESTION, congestion;, CONTROL, control;, dynamic, end-to-end, engineering, fast-timescale, flow, Internet, IP, label, long-term, mapping;, migration;, MPLS, multiprotocol, network, network;, networks;, of, optimal, overloads;, protocol;, QoS;, QUALITY, quality;, routers;, routing;, service;, set-up, short-term, software, software;, static, switching;, Telecommunication, telephony;, time;, transient, voice-over-IP;}, doi = {10.1109/GLOCOM.2003.1258807}, author = {Kuo,Kuo-Tung and Phuvoravan,S. and Bhattacharjee, Bobby and Jun La,R. and Shayman,M. and Chang,Hyeong Soo} } @article {16898, title = {Use of the SAND spatial browser for digital government applications}, journal = {Commun. ACM}, volume = {46}, year = {2003}, month = {2003/01//}, pages = {61 - 64}, abstract = {Numerous federal agencies produce official statistics made accessible to ordinary citizens for searching and data retrieval. This is frequently done via the Internet through a Web browser interface. If this data is presented in textual format, it can often be searched and retrieved by such attributes as topic, responsible agency, keywords, or press release. However, if the data is of spatial nature, for example, in the form of a map, then using text-based queries is often too cumbersome for the intended audience. We describe the use of the SAND Spatial Browser to provide more power to users of these databases by enabling them to define and explore the specific spatial region of interest graphically. The SAND Spatial Browser allows users to form either purely spatial or mixed spatial/nonspatial queries intuitively, which can present information to users that might have been missed if only a textual interface was available.}, keywords = {GIS}, isbn = {0001-0782}, doi = {10.1145/602421.602453}, url = {http://doi.acm.org/10.1145/602421.602453}, author = {Samet, Hanan and Alborzi,Houman and Brabec,Franti{\v s}ek and Esperan{\c c}a,Claudio and Hjaltason,G{\'\i}sli R. and Morgan,Frank and Tanin,Egemen} } @article {12165, title = {User interface evaluation and empirically-based evolution of a prototype experience management tool}, journal = {Software Engineering, IEEE Transactions on}, volume = {29}, year = {2003}, month = {2003/09//}, pages = {838 - 850}, abstract = {Experience management refers to the capture, structuring, analysis, synthesis, and reuse of an organization{\textquoteright}s experience in the form of documents, plans, templates, processes, data, etc. The problem of managing experience effectively is not unique to software development, but the field of software engineering has had a high-level approach to this problem for some time. The Experience Factory is an organizational infrastructure whose goal is to produce, store, and reuse experiences gained in a software development organization. This paper describes The Q-Labs Experience Management System (Q-Labs EMS), which is based on the Experience Factory concept and was developed for use in a multinational software engineering consultancy. A critical aspect of the Q-Labs EMS project is its emphasis on empirical evaluation as a major driver of its development and evolution. The initial prototype requirements were grounded in the organizational needs and vision of Q-Labs, as were the goals and evaluation criteria later used to evaluate the prototype. However, the Q-Labs EMS architecture, data model, and user interface were designed to evolve, based on evolving user needs. This paper describes this approach, including the evaluation that was conducted of the initial prototype and its implications for the further development of systems to support software experience management.}, keywords = {data, development;, empirical, EMS;, engineering;, evaluation;, experience, experience;, Factory;, interface, interfaces;, knowledge, management, management;, model;, models;, organization, performance, prototype, Q-Labs, re-engineering;, reusability;, reuse;, software, system;, systems, tool;, user}, isbn = {0098-5589}, doi = {10.1109/TSE.2003.1232288}, author = {Seaman,C.B and Mendonca,M.G. and Basili, Victor R. and Kim,Y. M} } @conference {17524, title = {User-level internet path diagnosis}, booktitle = {ACM SIGOPS Operating Systems Review}, volume = {37}, year = {2003}, month = {2003///}, pages = {106 - 119}, author = {Mahajan,R. and Spring, Neil and Wetherall,D. and Anderson,T.} } @conference {16123, title = {Using Visualization Tools to Gain Insight Into Your Data}, booktitle = {SPE Annual Technical Conference and Exhibition}, year = {2003}, month = {2003/10//}, publisher = {Society of Petroleum Engineers}, organization = {Society of Petroleum Engineers}, abstract = {When the term {\textquoteleft}visualization{\textquoteright} is used in the oil and gas industry, it is usually referring to the viewing of complex geologic structures in three-dimensional space. This paper illustrates insights gained by applying interactive visual environments to petroleum industry data that has traditionally been presented in spreadsheets, line graphs, and bar charts. Two information visualization tools, Treemap and SpaceTree, will be shown applied to a variety of oilfield related data.}, isbn = {9781555631529}, doi = {10.2118/84439-MS}, url = {http://www.onepetro.org/mslib/servlet/onepetropreview?id=00084439}, author = {Plaisant, Catherine and Chintalapani,G. and Lukehart,C. and Schiro,D. and Ryan,J.} } @conference {16906, title = {VASCO: visualizing and animating spatial constructs and operations}, booktitle = {Proceedings of the nineteenth annual symposium on Computational geometry}, series = {SCG {\textquoteright}03}, year = {2003}, month = {2003///}, pages = {374 - 375}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {A video is used to demonstrate a set of spatial index JAVA applets that enable users on the worldwide web to experiment with a number of variants of the quadtree spatial data structure for different spatial data types, and, most importantly, enable them to see in an animated manner how a number of basic search operations are executed for them. The spatial data types are points, line segments, rectangles, and regions. The search operations are the window query (i.e., a spatial range query) and a nearest neighbor query that enables ranking spatial objects in the order of their distance from a given query object. The representations and algorithms are visualized and animated in a consistent manner using the same primitives and colors so that the differences between the effects of the representations can be easily understood. The video demonstrates the PR quadtree, PM1 quadtree, and R-tree. The applets can be found at: www.cs.umd.edu/~hjs/quadtree/.}, keywords = {k-d trees, Nearest neighbor algorithms, quadtrees, R-trees, Visualization}, isbn = {1-58113-663-3}, doi = {10.1145/777792.777849}, url = {http://doi.acm.org/10.1145/777792.777849}, author = {Brabec,Frantivsek and Samet, Hanan and Yilmaz,Cemal} } @article {17849, title = {The virtual microscope}, journal = {IEEE Transactions on Information Technology in Biomedicine}, volume = {7}, year = {2003}, month = {2003/12//}, pages = {230 - 248}, abstract = {We present the design and implementation of the virtual microscope, a software system employing a client/server architecture to provide a realistic emulation of a high power light microscope. The system provides a form of completely digital telepathology, allowing simultaneous access to archived digital slide images by multiple clients. The main problem the system targets is storing and processing the extremely large quantities of data required to represent a collection of slides. The virtual microscope client software runs on the end user{\textquoteright}s PC or workstation, while database software for storing, retrieving and processing the microscope image data runs on a parallel computer or on a set of workstations at one or more potentially remote sites. We have designed and implemented two versions of the data server software. One implementation is a customization of a database system framework that is optimized for a tightly coupled parallel machine with attached local disks. The second implementation is component-based, and has been designed to accommodate access to and processing of data in a distributed, heterogeneous environment. We also have developed caching client software, implemented in Java, to achieve good response time and portability across different computer platforms. The performance results presented show that the Virtual Microscope systems scales well, so that many clients can be adequately serviced by an appropriately configured data server.}, keywords = {biomedical optical imaging, client software, client/server architecture, Computer architecture, Computer Graphics, computer platforms, Computer simulation, Concurrent computing, configured data server, data server software, database management systems, database software, Database systems, digital slide images, digital telepathology, diseases, emulation, Environment, Equipment Design, Equipment Failure Analysis, high power light microscope, Image databases, Image Enhancement, Image Interpretation, Computer-Assisted, Image retrieval, Information retrieval, Information Storage and Retrieval, java, local disks, microscope image data, Microscopy, multiple clients, optical microscopy, PACS, software, Software design, software system, Software systems, Systems Integration, Telepathology, User-Computer Interface, virtual microscope design, Virtual reality, Workstations}, isbn = {1089-7771}, doi = {10.1109/TITB.2004.823952}, author = {Catalyurek,U. and Beynon,M. D and Chang,Chialin and Kurc, T. and Sussman, Alan and Saltz, J.} } @inbook {16135, title = {Visual Information Management for Network Configuration}, booktitle = {The Craft of Information VisualizationThe Craft of Information Visualization}, year = {2003}, month = {2003///}, pages = {239 - 256}, publisher = {Morgan Kaufmann}, organization = {Morgan Kaufmann}, address = {San Francisco}, abstract = {Current network management systems rely heavily on forms in their user interfaces. The interfaces reflect the intricacies of the network hardware components but provide little support for guiding users through tasks. There is a scarcity of useful graphical visualizations and decision-support tools.}, isbn = {978-1-55860-915-0}, url = {http://www.sciencedirect.com/science/article/pii/B9781558609150500329}, author = {Kumar,Harsha and Plaisant, Catherine and Teittinen,Marko and Shneiderman, Ben}, editor = {Bederson, Benjamin B. and Shneiderman, Ben} } @article {17500, title = {Visualization Viewpoints}, journal = {IEEE Computer Graphics and Applications}, volume = {23}, year = {2003}, month = {2003///}, pages = {12 - 15}, author = {Shneiderman, Ben} } @conference {15285, title = {What makes a good answer? The role of context in question answering}, booktitle = {Human-Computer Interaction, Interact {\textquoteright}03}, year = {2003}, month = {2003///}, pages = {25 - 25}, author = {Jimmy Lin and Quan,D. and Sinha,V. and Bakshi,K. and Huynh,D. and Katz,B. and Karger,D. R} } @article {17672, title = {When does a random Robin Hood win?}, journal = {Theoretical Computer Science}, volume = {304}, year = {2003}, month = {2003/07/28/}, pages = {477 - 484}, abstract = {A certain two-person infinite game (between {\textquotedblleft}Robin Hood{\textquotedblright} and the {\textquotedblleft}Sheriff{\textquotedblright}) has been studied in the context of set theory. In certain cases, it is known that for any deterministic strategy of Robin Hood{\textquoteright}s, if the Sheriff knows Robin Hood{\textquoteright}s strategy, he can adapt a winning counter-strategy. We show that in these cases, Robin Hood wins with {\textquotedblleft}probability one{\textquotedblright} if he adopts a natural random strategy. We then characterize when this random strategy has the almost-surely winning property. We also explore the case of a random Sheriff versus a deterministic Robin Hood.}, keywords = {Games, Randomized strategy, STRATEGY}, isbn = {0304-3975}, doi = {10.1016/S0304-3975(03)00289-5}, url = {http://www.sciencedirect.com/science/article/pii/S0304397503002895}, author = {Gasarch,William and Golub,Evan and Srinivasan, Aravind} } @conference {16141, title = {Which comes first, usability or utility?}, booktitle = {Proceedings of the 14th IEEE Visualization 2003 (VIS{\textquoteright}03)}, series = {VIS {\textquoteright}03}, year = {2003}, month = {2003///}, pages = {112{\textendash} - 112{\textendash}}, publisher = {IEEE Computer Society}, organization = {IEEE Computer Society}, address = {Washington, DC, USA}, isbn = {0-7695-2030-8}, doi = {10.1109/VISUAL.2003.1250426}, url = {http://dx.doi.org/10.1109/VISUAL.2003.1250426}, author = {Grinstein,Georges and Kobsa,Alfred and Plaisant, Catherine and Shneiderman, Ben and Stasko,John T} } @article {17508, title = {Why not make interfaces better than 3D reality?}, journal = {IEEE Computer Graphics and Applications}, volume = {23}, year = {2003}, month = {2003/12//Nov}, pages = {12 - 15}, abstract = {Many constrained interfaces are designed to be simpler than the real world by restricting movement, limiting interface actions, and keeping interface objects in a plane. However, the strong utility of pure 3D interfaces for medical, architectural, product design, and scientific visualization means that interface design for pure 3D remains an important challenge. An intriguing possibility is that enhanced 3D interfaces might offer simpler navigation, more compelling functionality, safer movements, and less occlusion, than 3D reality, especially for information exploration and visualization tasks. Such features can enable superhuman capabilities such as faster-than-light teleportation, flying through objects, and X-ray vision. Enhanced 3D interfaces might have supernatural tools such as magic wands for instantly shrinking, enlarging, duplicating, or sending objects and enchanted environments that provide error prevention, history keeping, and programming-by-demonstration. Playful game designers and creative application developers have already pushed the technology further than those who seek merely to mimic reality. Advanced designs are marked by their support of rapid situation awareness through effective overviews, reduced numbers of actions to accomplish tasks; and prompt, meaningful feedback for user actions. This article reviews these clever enhanced 3D-design features and encourages approaches that facilitate user tasks rather than mimic reality.}, keywords = {3D interfaces, 3D reality, Atmosphere, Avatars, Cities and towns, Collaboration, Computer displays, Computer Graphics, error prevention, history keeping, information exploration, Information Visualization, movements, Navigation, occlusion, overviews, programming-by-demonstration, rapid situation awareness, Testing, usability, user action feedback, User interfaces, Virtual reality, Visualization}, isbn = {0272-1716}, doi = {10.1109/MCG.2003.1242376}, author = {Shneiderman, Ben} } @inbook {16131, title = {The World{\textquoteright}s Information in Digital Libraries}, booktitle = {The craft of information visualization: readings and reflectionsThe craft of information visualization: readings and reflections}, year = {2003}, month = {2003///}, pages = {149 - 149}, publisher = {Morgan Kaufmann Publishers Inc.}, organization = {Morgan Kaufmann Publishers Inc.}, isbn = {978-1-55860-915-0}, author = {Plaisant, Catherine and Marchimini,G. and Bruns,T. and Komlodi,A. and Campbell,L. and Rose,A. and Ding,G.M. and Beale Jr,J. and Nolet,V. and Shneiderman, Ben and others} } @article {13414, title = {AAAI 2002 Workshops}, journal = {AI Magazine}, volume = {23}, year = {2002}, month = {2002/12/15/}, pages = {113 - 113}, isbn = {0738-4602}, doi = {10.1609/aimag.v23i4.1678}, url = {http://www.aaai.org/ojs/index.php/aimagazine/article/viewArticle/1678}, author = {Blake,Brian and Haigh,Karen and Hexmoor,Henry and Falcone,Rino and Soh,Leen-Kiat and Baral,Chitta and McIlraith,Sheila and Gmytrasiewicz,Piotr and Parsons,Simon and Malaka,Rainer and Krueger,Antonio and Bouquet,Paolo and Smart,Bill and Kurumantani,Koichi and Pease,Adam and Brenner,Michael and desJardins, Marie and Junker,Ulrich and Delgrande,Jim and Doyle,Jon and Rossi,Francesca and Schaub,Torsten and Gomes,Carla and Walsh,Toby and Guo,Haipeng and Horvitz,Eric J and Ide,Nancy and Welty,Chris and Anger,Frank D and Guegen,Hans W and Ligozat,Gerald} } @article {16952, title = {ACM{\textquoteright}s computing professionals face new challenges}, journal = {Communications of the ACM}, volume = {45}, year = {2002}, month = {2002/02//}, pages = {31 - 34}, abstract = {Technologists can make a difference on so many critical fronts.}, isbn = {0001-0782}, doi = {10.1145/503124.503142}, url = {http://doi.acm.org/10.1145/503124.503142}, author = {Shneiderman, Ben} } @conference {17883, title = {Active Proxy-G: Optimizing the query execution process in the Grid}, booktitle = {Proceedings of the 2002 ACM/IEEE conference on Supercomputing}, year = {2002}, month = {2002///}, pages = {1 - 15}, author = {Andrade,H. and Kurc, T. and Sussman, Alan and Saltz, J.} } @article {11915, title = {AD (Attacker Defender) Game}, journal = {Technical Reports from UMIACS, UMIACS-TR-2001-45}, year = {2002}, month = {2002/01/31/}, abstract = {Information Dynamics is a framework for agent-based systems that givesa central position to the role of information, time, and the value of information. We illustrate system design in the Information Dynamics Framework by developing an intelligence game called AD involving attackers, defenders and targets operating in some space of locations. The goal of the attackers is to destroy all targets. Target destruction takes place when the number of attackers in the target{\textquoteright}s neighborhood exceeds the number of defenders in this neighborhood by a value WINNING_DIFFERENCE. The goal of defenders is to prevent attackers from achieving their goal. (Also UMIACS-TR-2001-45) }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/1142}, author = {Kochut,Andrzej and Agrawala, Ashok K. and Larsen,Ronald L and A. Udaya Shankar} } @conference {18651, title = {An adaptive framework for tunable consistency and timeliness using replication}, year = {2002}, month = {2002///}, pages = {17 - 26}, abstract = {One well-known challenge in using replication to service multiple clients concurrently is that of delivering a timely and consistent response to the clients. In this paper, we address this problem in the context of client applications that have specific temporal and consistency requirements. These applications can tolerate a certain degree of relaxed consistency, in exchange for better response time. We propose a flexible QoS model that allows these clients to specify their temporal and consistency constraints. In order to select replicas to serve these clients, we need to control of the inconsistency of the replicas, so that we have a large enough pool of replicas with the appropriate state to meet a client{\textquoteright}s timeliness, consistency, and dependability requirements. We describe an adaptive framework that uses lazy update propagation to control the replica inconsistency and employs a probabilistic approach to select replicas dynamically to service a client, based on its QoS specification. The probabilistic approach predicts the ability of a replica to meet a client{\textquoteright}s QoS specification by using the performance history collected by monitoring the replicas at runtime. We conclude with experimental results based on our implementation.}, keywords = {adaptive framework, concurrent multiple client service, consistency requirements, dependability requirements, distributed object management, flexible QoS model, lazy update propagation, performance history, probabilistic approach, Protocols, quality of service, replication, temporal requirements, timely consistent response, tunable consistency, tunable timeliness}, doi = {10.1109/DSN.2002.1028882}, author = {Krishnamurthy, S. and Sanders,W. H. and Michel Cukier} } @article {17680, title = {Addendum to "A Krylov--Schur Algorithm for Large Eigenproblems"}, volume = {UMIACS-TR-2001-90}, year = {2002}, month = {2002/01/31/}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {In this addendum to an earlier paper by the author, it is shown how tocompute a Krylov decomposition corresponding to an arbitrary Rayleigh-Quotient. This decomposition can be used to restart an Arnoldi process, with a selection of the Ritz vectors corresponding to the Rayleigh quotient. (Also UMIACS-TR-2001-90) }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/1171}, author = {Stewart, G.W.} } @conference {17819, title = {Agents dealing with time and uncertainty}, booktitle = {Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 2}, series = {AAMAS {\textquoteright}02}, year = {2002}, month = {2002///}, pages = {912 - 919}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Situated agents in the real world need to handle the fact that events occur frequently, as well as the fact that the agent typically has uncertain knowledge about what is true in the world. The ability to reason about both time and uncertainty is therefore very important. In this paper, we develop a formal theory of agents that can reason about both time and uncertainty. The theory extends the notion of agents described in [10, 21] and proposes the notion of temporal probabilistic (or TP) agents. A formal semantics for TP-agents is proposed - this semantics is described via structures called feasible TP-status interpretations (FTPSI{\textquoteright}s). TP-agents continuously evaluate changes (in the state of the environment they are situated in) and compute appropriate FTPSI{\textquoteright}s. For a class of TP-agents called positive TP-agents, we develop a provably sound and complete procedure to compute FTPSI{\textquoteright}s.}, keywords = {formalisms and logics, logic programming, probabilistic/uncertain reasoning, temporal reasoning, theories of agency}, isbn = {1-58113-480-0}, doi = {10.1145/544862.544953}, url = {http://doi.acm.org/10.1145/544862.544953}, author = {Dix,J{\"u}rgen and Kraus,Sarit and V.S. Subrahmanian} } @book {15676, title = {Algorithm Engineering and Experiments: 4th International Workshop, Alenex 2002, San Francisco, Ca, Usa, January 4-5. 2002 : Revised Papers}, year = {2002}, month = {2002/09/17/}, publisher = {Springer}, organization = {Springer}, abstract = {This book constitutes the thoroughly refereed post-proceedings of the 4th International Workshop on Algorithm Engineering and Experiments, ALENEX 2002, held in San Francisico, CA, USA in January 2002.The 15 revised full papers presented were carefully reviewed and selected from 34 submissions. Among the topics addressed are hewistics for algorithms, combinatorial optimization, searching, graph computation, network optimization, scheduling, computational geometry, sorting, and clustering algorithms.}, keywords = {Architecture / General, Artificial intelligence, Computer algorithms, Computer algorithms/ Congresses, COMPUTERS, Computers / Computer Graphics, Computers / Computer Science, Computers / Data Modeling \& Design, Computers / Data Processing, Computers / General, Computers / Programming / Algorithms, Electronic books, Mathematics / Discrete Mathematics, Medical / General}, isbn = {9783540439776}, author = {Mount, Dave and Stein,Clifford} } @article {15541, title = {Algorithmic issues in modeling motion}, journal = {ACM Comput. Surv.}, volume = {34}, year = {2002}, month = {2002/12//}, pages = {550 - 572}, abstract = {This article is a survey of research areas in which motion plays a pivotal role. The aim of the article is to review current approaches to modeling motion together with related data structures and algorithms, and to summarize the challenges that lie ahead in producing a more unified theory of motion representation that would be useful across several disciplines.}, keywords = {computational geometry, Computer vision, mobile networks, modeling, molecular biology, motion modeling, physical simulation, robotoics, spatio-temporal databases}, isbn = {0360-0300}, doi = {10.1145/592642.592647}, url = {http://doi.acm.org/10.1145/592642.592647}, author = {Agarwal,Pankaj K. and Guibas,Leonidas J. and Edelsbrunner,Herbert and Erickson,Jeff and Isard,Michael and Har-Peled,Sariel and Hershberger,John and Jensen,Christian and Kavraki,Lydia and Koehl,Patrice and Lin,Ming and Manocha,Dinesh and Metaxas,Dimitris and Mirtich,Brian and Mount, Dave and Muthukrishnan,S. and Pai,Dinesh and Sacks,Elisha and Snoeyink,Jack and Suri,Subhash and Wolefson,Ouri} } @article {15682, title = {The Analysis and Performance of Multi-Rate Service in Distributed Video-on-Demand Systems}, journal = {Multimedia Tools and Applications}, volume = {17}, year = {2002}, month = {2002///}, pages = {51 - 75}, author = {Mundur, Padma and Simon,R. and Sood,A.} } @conference {16909, title = {APPOINT: an Approach for Peer-to-Peer Offloading the INTernet}, booktitle = {Proceedings of the 2002 annual national conference on Digital government research}, series = {dg.o {\textquoteright}02}, year = {2002}, month = {2002///}, pages = {1 - 7}, publisher = {Digital Government Society of North America}, organization = {Digital Government Society of North America}, abstract = {The Internet has recently become the medium of interaction with large volumes of online data. Enterprises in the public and private sectors made their data archives available over the Internet. Working with such large volumes of online data is a challenging task. APPOINT (an Approach for Peer-to-Peer Offloading the INTernet), a centralized peer-to-peer approach that helps users of the Internet transfer large volumes of online data efficiently, is introduced with this paper. In APPOINT, active clients of a client-server architecture act on the server{\textquoteright}s behalf and communicate with each other to decrease network latency, improve service bandwidth, and resolve server congestions. In essence, a server is enabled to appoint alternatives when needed and create a scalable collaborative virtual mirror from the active clients. Multiple parameters such as locality and availability to decide on how to best forward a download request are considered. The problems that can arise in symmetric upload requests are also addressed. APPOINT is an ongoing project and it is being built as an add-on to existing client-server systems. A library of functions, with a simple application programming interface (API) that can be used within an existing client-server system to improve the service, is currently being developed.}, url = {http://dl.acm.org/citation.cfm?id=1123098.1123102}, author = {Tanin,Egemen and Samet, Hanan} } @article {17563, title = {Approximation algorithms for the covering Steiner problem}, journal = {Random Structures \& Algorithms}, volume = {20}, year = {2002}, month = {2002/05/01/}, pages = {465 - 482}, abstract = {The covering Steiner problem is a generalization of both the k-MST and the group Steiner problems: given an edge-weighted graph, with subsets of vertices called the groups, and a nonnegative integer value (called the requirement) for each group, the problem is to find a minimum-weight tree spanning at least the required number of vertices of every group. When all requirements are equal to 1, this becomes the group Steiner problem, while if there is only one group which contains all vertices of the graph the problem reduces to k-MST with k equal to the requirement of this unique group. We discuss two different (but equivalent) linear relaxations of the problem for the case when the given graph is a tree and construct polylogarithmic approximation algorithms based on randomized LP rounding of these relaxations. By using a probabilistic approximation of general metrics by tree metrics due to Bartal, our algorithms also solve the covering Steiner problem on general graphs with a further polylogarithmic worsening in the approximation ratio. {\textcopyright} 2002 Wiley Periodicals, Inc. Random Struct. Alg., 20:465{\textendash}483, 2002}, isbn = {1098-2418}, doi = {10.1002/rsa.10038}, url = {http://onlinelibrary.wiley.com/doi/10.1002/rsa.10038/abstract?systemMessage=Wiley+Online+Library+will+be+disrupted+17+March+from+10-14+GMT+\%2806-10+EDT\%29+for+essential+maintenance}, author = {Konjevod,Goran and Ravi,R. and Srinivasan, Aravind} } @article {12312, title = {Are virtualized overlay networks too much of a good thing?}, journal = {Peer-to-Peer Systems}, year = {2002}, month = {2002///}, pages = {225 - 231}, abstract = {The majority of recent high-profile work in peer-to-peer networks has approached the problem of location by abstracting over object lookup services. Namespace virtualization in the overlay layer provides load balance and provable bounds on latency at low costs.We contend that namespace virtualization comes at a significant cost for applications that naturally describe their data sets in a hierarchical manner. Opportunities for enhancing browsing, prefetching and efficient attribute-based searches are lost. A hierarchy exposes relationships between items near to each other in the topology; virtualization of the namespace discards this information even if present at client, higherlevel protocols. We advocate encoding application hierarchies directly into the structure of the overlay network, and revisit this argument through a newly proposed distributed directory service. }, author = {Keleher,P. and Bhattacharjee, Bobby and Silaghi,B.} } @inbook {16960, title = {An Augmented Visual Query Mechanism for Finding Patterns in Time Series Data}, booktitle = {Flexible Query Answering SystemsFlexible Query Answering Systems}, series = {Lecture Notes in Computer Science}, volume = {2522}, year = {2002}, month = {2002///}, pages = {240 - 250}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {Relatively few query tools exist for data exploration and pattern identification in time series data sets. In previous work we introduced Timeboxes . Timeboxes are rectangular, direct-manipulation queries for studying time-series datasets. We demonstrated how Timeboxes can be used to support interactive exploration via dynamic queries, along with overviews of query results and drag-and-drop support for query-by-example. In this paper, we extend our work by introducing Variable Time Timeboxes (VTT). VTTs are a natural generalization of Timeboxes, which permit the specification of queries that allow a degree of uncertainty in the time axis. We carefully motivate the need for these more expressive queries, and demonstrate the utility of our approach on several data sets.}, isbn = {978-3-540-00074-7}, url = {http://dx.doi.org/10.1007/3-540-36109-X_19}, author = {Keogh,Eamonn and Hochheiser,Harry and Shneiderman, Ben}, editor = {Carbonell,Jaime and Siekmann,J{\"o}rg and Andreasen,Troels and Christiansen,Henning and Motro,Amihai and Legind Larsen,Henrik} } @article {13727, title = {Automatic headline generation for newspaper stories}, journal = {Proceedings of the ACL-2002 Workshop on Text Summarization}, year = {2002}, month = {2002///}, abstract = {In this paper we propose a novelapplication of Hidden Markov Models to automatic generation of informative headlines for English texts. We propose four decoding parameters to make the headlines appear more like Headlinese, the language of informative newspaper headlines. We also allow for morphological variation in words between headline and story English. Informal and formal evaluations indicate that our approach produces informative headlines, mimicking a Headlinese style generated by humans. }, author = {Zajic, David and Dorr, Bonnie J and Schwartz,R.} } @conference {13729, title = {Automatic transcription of Czech language oral history in the MALACH project: resources and initial experiments}, booktitle = {Proceedings of the The 5th International Conference on Text, Speech and Dialogue}, year = {2002}, month = {2002///}, pages = {57 - 64}, author = {Oard, Douglas and Demner-Fushman,D. and Hajic,J. and Ramabhadran,B. and Gustman,S. and Byrne,WJ and Soergel,D. and Dorr, Bonnie J and Resnik, Philip and Picheny,M.} } @article {14107, title = {Block preconditioners for the discrete incompressible Navier{\textendash}Stokes equations}, journal = {International Journal for Numerical Methods in Fluids}, volume = {40}, year = {2002}, month = {2002/09/30/}, pages = {333 - 344}, abstract = {We examine the convergence characteristics of iterative methods based on a new preconditioning operator for solving the linear systems arising from discretization and linearization of the steady-state Navier{\textendash}Stokes equations. For steady-state problems, we show that the preconditioned problem has an eigenvalue distribution consisting of a tightly clustered set together with a small number of outliers. These characteristics are directly correlated with the convergence properties of iterative solvers, with convergence rates independent of mesh size and only mildly dependent on viscosity. For evolutionary problems, we show that implicit treatment of the time derivatives leads to systems for which convergence is essentially independent of viscosity. Copyright {\textcopyright} 2002 John Wiley \& Sons, Ltd.}, keywords = {Iterative algorithms, Navier{\textendash}Stokes equations, preconditioning}, isbn = {1097-0363}, doi = {10.1002/fld.311}, url = {http://onlinelibrary.wiley.com/doi/10.1002/fld.311/abstract}, author = {Elman, Howard and Silvester, David J and Wathen, Andrew J} } @article {16993, title = {Book Preview-Leonardo{\textquoteright}s Laptop: Human Needs and the New Computing Technologies}, journal = {Interactions-New York}, volume = {9}, year = {2002}, month = {2002///}, pages = {43 - 43}, author = {Shneiderman, Ben} } @conference {17868, title = {On cache replacement policies for servicing mixed data intensive query workloads}, booktitle = {Proceedings of the 2nd Workshop on Caching, Coherence, and Consistency, held in conjunction with the 16th ACM International Conference on Supercomputing}, year = {2002}, month = {2002///}, abstract = {When data analysis applications are employed in a multi-client environment, a data server must service multiple si- multaneous queries, each of which may employ complex user-defined data structures and operations on the data. It is then necessary to harness inter- and intra-query com- monalities and system resources to improve the performance of the data server. We have developed a framework and customizable middleware to enable reuse of intermediate and final results among queries, through an in-memory ac- tive semantic cache and user-defined transformation func- tions. Since resources such as processing power and mem- ory space are limited on the machine hosting the server, ef- fective scheduling of incoming queries and efficient cache replacement policies are challenging issues that must be ad- dressed. We have worked on the scheduling problem in ear- lier work, and in this paper we describe and evaluate several cache replacement policies. We present experimental eval- uation of the policies on a shared-memory parallel system using two applications from different application domains. }, author = {Andrade,H. and Kurc, T. and Sussman, Alan and Borovikov,E. and Saltz, J.} } @conference {17009, title = {CHI@20: fighting our way from marginality to power}, booktitle = {CHI {\textquoteright}02 extended abstracts on Human factors in computing systems}, series = {CHI EA {\textquoteright}02}, year = {2002}, month = {2002///}, pages = {688 - 691}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {The Special Interest Group on Computer Human Interaction (SIGCHI) has had a successful history of 20 years of growth in its numbers and influence. To help guide the continued evolution of the academic discipline and professional community, we invite several senior members to offer their visions for what the field of CHI actually accomplished over the past several decades, and what do we still need to accomplish? What do we need to do differently/ better/smarter? What haven{\textquoteright}t we tried because the technology, the money or the will wasn{\textquoteright}t there in the past, but perhaps is now.The CHI field is more than just technology. We understand that our work can have a profound effect on individuals, families, neighborhoods, corporations, and countries. We know that we can influence education, commerce, healthcare, and government. How can we contribute to bridging the digital divides in developed and developing countries? What agendas can we offer for the academic, research, industrial, and civic spheres for the next 20 years? How can we be more ambitious? How can we truly serve human needs.}, keywords = {education, future vision, Human-computer interaction, practice, professional, THEORY, usability engineering}, isbn = {1-58113-454-1}, doi = {10.1145/506443.506548}, url = {http://doi.acm.org/10.1145/506443.506548}, author = {Shneiderman, Ben and Card,Stuart and Norman,Donald A. and Tremaine,Marilyn and Waldrop,M. Mitchell} } @conference {17575, title = {Clustering and server selection using passive monitoring}, booktitle = {IEEE INFOCOM 2002. Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings}, volume = {3}, year = {2002}, month = {2002///}, pages = {1717- 1725 vol.3 - 1717- 1725 vol.3}, publisher = {IEEE}, organization = {IEEE}, abstract = {We consider the problem of client assignment in a distributed system of content servers. We present a system called Webmapper for clustering IP addresses and assigning each cluster to an optimal content server. The system is passive in that the only information it uses comes from monitoring the TCP connections between the clients and the servers. It is also flexible in that it makes no a priori assumptions about network topology and server placement and it can react quickly to changing network conditions. We present experimental results to evaluate the performance of Webmapper.}, keywords = {client assignment, client-server systems, clustering, content servers, Delay, distributed system, Educational institutions, Internet, IP addresses, Monitoring, network conditions, Network servers, Network topology, optimal content server, passive monitoring, server selection, Space technology, TCPIP, Transport protocols, Web pages, Web server, Webmapper}, isbn = {0-7803-7476-2}, doi = {10.1109/INFCOM.2002.1019425}, author = {Andrews,M. and Shepherd,B. and Srinivasan, Aravind and Winkler,P. and Zane,F.} } @inbook {14598, title = {Combinatorial Algorithms for Design of DNA Arrays}, booktitle = {Chip TechnologyChip Technology}, series = {Advances in Biochemical Engineering/Biotechnology}, volume = {77}, year = {2002}, month = {2002///}, pages = {1 - 19}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {Optimal design of DNA arrays requires the development of algorithms with two-fold goals: reducing the effects caused by unintended illumination ( border length minimization problem ) and reducing the complexity of masks ( mask decomposition problem ). We describe algorithms that reduce the number of rectangles in mask decomposition by 20{\textendash}30\% as compared to a standard array design under the assumption that the arrangement of oligonucleotides on the array is fixed. This algorithm produces provably optimal solution for all studied real instances of array design. We also address the difficult problem of finding an arrangement which minimizes the border length and come up with a new idea of threading that significantly reduces the border length as compared to standard designs.}, isbn = {978-3-540-43215-9}, url = {http://dx.doi.org/10.1007/3-540-45713-5_1}, author = {Hannenhalli, Sridhar and Hubbell,Earl and Lipshutz,Robert and Pevzner,Pavel}, editor = {Hoheisel,J{\"o}rg and Brazma,A. and B{\"u}ssow,K. and Cantor,C. and Christians,F. and Chui,G. and Diaz,R. and Drmanac,R. and Drmanac,S. and Eickhoff,H. and Fellenberg,K. and Hannenhalli, Sridhar and Hoheisel,J. and Hou,A. and Hubbell,E. and Jin,H. and Jin,P. and Jurinke,C. and Konthur,Z. and K{\"o}ster,H. and Kwon,S. and Lacy,S. and Lehrach,H. and Lipshutz,R. and Little,D. and Lueking,A. and McGall,G. and Moeur,B. and Nordhoff,E. and Nyarsik,L. and Pevzner,P. and Robinson,A. and Sarkans,U. and Shafto,J. and Sohail,M. and Southern,E. and Swanson,D. and Ukrainczyk,T. and van den Boom,D. and Vilo,J. and Vingron,M. and Walter,G. and Xu,C.} } @article {16250, title = {Comparative Genome Sequencing for Discovery of Novel Polymorphisms in Bacillus Anthracis}, journal = {Science}, volume = {296}, year = {2002}, month = {2002/06/14/}, pages = {2028 - 2033}, abstract = {Comparison of the whole-genome sequence ofBacillus anthracis isolated from a victim of a recent bioterrorist anthrax attack with a reference reveals 60 new markers that include single nucleotide polymorphisms (SNPs), inserted or deleted sequences, and tandem repeats. Genome comparison detected four high-quality SNPs between the two sequenced B. anthracischromosomes and seven differences among different preparations of the reference genome. These markers have been tested on a collection of anthrax isolates and were found to divide these samples into distinct families. These results demonstrate that genome-based analysis of microbial pathogens will provide a powerful new tool for investigation of infectious disease outbreaks.}, isbn = {0036-8075, 1095-9203}, doi = {10.1126/science.1071837}, url = {http://www.sciencemag.org/content/296/5575/2028}, author = {Read,Timothy D. and Salzberg,Steven L. and Pop, Mihai and Shumway,Martin and Umayam,Lowell and Jiang,Lingxia and Holtzapple,Erik and Busch,Joseph D and Smith,Kimothy L and Schupp,James M and Solomon,Daniel and Keim,Paul and Fraser,Claire M.} } @conference {12372, title = {A component architecture for FPGA-based, DSP system design}, booktitle = {Application-Specific Systems, Architectures and Processors, 2002. Proceedings. The IEEE International Conference on}, year = {2002}, month = {2002///}, pages = {41 - 51}, author = {Spivey,G. and Bhattacharyya, Shuvra S. and Nakajima,K.} } @article {17818, title = {Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A}, journal = {Kowalski, Part I}, year = {2002}, month = {2002///}, pages = {586 - 625}, author = {Eiter,T. and Mascardi,V. and V.S. Subrahmanian} } @conference {18645, title = {A configurable CORBA gateway for providing adaptable system properties}, year = {2002}, month = {2002///}, url = {https://www.perform.csl.illinois.edu/Papers/USAN_papers/02SER01.pdf}, author = {Seri,M. and Courtney,T. and Michel Cukier and Gupta,V. and Krishnmamurthy,S. and Lyons,J. and Ramasamy,H. and Ren,J. and Sanders,W. H.} } @conference {16914, title = {Content-based image retrieval using Fourier descriptors on a logo database}, booktitle = {Pattern Recognition, 2002. Proceedings. 16th International Conference on}, volume = {3}, year = {2002}, month = {2002///}, pages = {521 - 524 vol.3 - 521 - 524 vol.3}, abstract = {A system that enables the pictorial specification of queries in an image database is described. The queries are comprised of rectangle, polygon, ellipse, and B-spline shapes. The queries specify which shapes should appear in the target image as well as spatial constraints on the distance between them and their relative position. The retrieval process makes use of an abstraction of the contour of the shape which is invariant against translation, scale, rotation, and starting point, that is based on the use of Fourier descriptors. These abstractions are used in a system to locate logos in an image database. The utility of this approach is illustrated using some sample queries.}, keywords = {abstraction;, analysis;, constraints;, content-based, contour, database, database;, databases;, descriptors;, detection;, edge, Fourier, image, logos;, pictorial, processing;, query, retrieval;, SHAPE, spatial, specification;, theory;, visual}, doi = {10.1109/ICPR.2002.1047991}, author = {Folkers,A. and Samet, Hanan} } @conference {11904, title = {Contour migration: solving object ambiguity with shape-space visual guidance}, booktitle = {IEEE/RSJ International Conference on Intelligent Robots and Systems, 2002}, volume = {1}, year = {2002}, month = {2002///}, pages = {330- 335 vol.1 - 330- 335 vol.1}, publisher = {IEEE}, organization = {IEEE}, abstract = {A fundamental problem in computer vision is the issue of shape ambiguity. Simply stated, a silhouette cannot uniquely identify an object or an object{\textquoteright}s classification since many unique objects can present identical occluding contours. This problem has no solution in the general case for a monocular vision system. This paper presents a method for disambiguating objects during silhouette matching using a visual servoing system. This method identifies the camera motion(s) that gives disambiguating views of the objects. These motions are identified through a new technique called contour migration. The occluding contour{\textquoteright}s shape is used to identify objects or object classes that are potential matches for that shape. A contour migration is then determined that disambiguates the possible matches by purposive viewpoint adjustment. The technique is demonstrated using an example set of objects.}, keywords = {Artificial intelligence, camera motion, CAMERAS, Computer vision, contour migration, Databases, edge detection, Intelligent robots, Laboratories, Machine vision, object ambiguity, Object recognition, pattern matching, Robot vision systems, servomechanisms, SHAPE, shape matching, shape-space visual guidance, silhouette matching, visual servoing}, isbn = {0-7803-7398-7}, doi = {10.1109/IRDS.2002.1041410}, author = {Abd-Almageed, Wael and Smith,C.E.} } @article {12125, title = {COTS-based software development: Processes and open issues}, journal = {Journal of Systems and Software}, volume = {61}, year = {2002}, month = {2002/04/01/}, pages = {189 - 199}, abstract = {The work described in this paper is an investigation of the COTS-based software development within a particular NASA environment, with an emphasis on the processes used. Fifteen projects using a COTS-based approach were studied and their actual process was documented. This process is evaluated to identify essential differences in comparison to traditional software development. The main differences, and the activities for which projects require more guidance, are requirements definition and COTS selection, high level design, integration and testing. Starting from these empirical observations, a new process and set of guidelines for COTS-based development are developed and briefly presented.}, keywords = {Commercial off-the-shelf, Component-based, COTS, empirical study, Software development process}, isbn = {0164-1212}, doi = {10.1016/S0164-1212(01)00147-9}, url = {http://www.sciencedirect.com/science/article/pii/S0164121201001479}, author = {Morisio,M and Seaman,C.B and Basili, Victor R. and Parra,A.T and Kraft,S.E and Condon,S.E} } @article {17038, title = {Creativity support tools}, journal = {Commun. ACM}, volume = {45}, year = {2002}, month = {2002/10//}, pages = {116 - 120}, abstract = {Establishing a framework of activities for creative work.}, isbn = {0001-0782}, doi = {10.1145/570907.570945}, url = {http://doi.acm.org/10.1145/570907.570945}, author = {Shneiderman, Ben} } @conference {17040, title = {Creativity support tools: a tutorial overview}, booktitle = {Proceedings of the 4th conference on Creativity \& cognition}, series = {C\&C {\textquoteright}02}, year = {2002}, month = {2002///}, pages = {1 - 2}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {The tutorial begins with a model of creative processes and refines it into design principles. Participants will learn of eight ways to improve software that supports human creative processes: - searching and browsing digital libraries - visualizing data and processes, - consulting with peers and mentors, -thinking by free associations, -exploring solutions: what- if tools, -composing artifacts and performances, -reviewing and replaying session histories, and -disseminating results.These practical suggestions can be integrated into existing software applications, built into web services, or serve as the framework for novel tools. Software examples will be shown and brainstorming sessions will use projects from participants.}, keywords = {consultation, creativity, design environments, empowerment, innovation, knowledge work, models of the user creativity, software integration, software tools}, isbn = {1-58113-465-7}, doi = {10.1145/581710.581711}, url = {http://doi.acm.org/10.1145/581710.581711}, author = {Shneiderman, Ben} } @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 {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.} } @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 {16512, title = {Effects of callosal lesions in a model of letter perception}, journal = {Cognitive, Affective, \& Behavioral Neuroscience}, volume = {2}, year = {2002}, month = {2002///}, pages = {37 - 37}, author = {Shevtsova,N. and Reggia, James A.} } @article {15613, title = {An efficient k-means clustering algorithm: analysis and implementation}, journal = {Pattern Analysis and Machine Intelligence, IEEE Transactions on}, volume = {24}, year = {2002}, month = {2002/07//}, pages = {881 - 892}, abstract = {In k-means clustering, we are given a set of n data points in d-dimensional space Rd and an integer k and the problem is to determine a set of k points in Rd, called centers, so as to minimize the mean squared distance from each data point to its nearest center. A popular heuristic for k-means clustering is Lloyd{\textquoteright}s (1982) algorithm. We present a simple and efficient implementation of Lloyd{\textquoteright}s k-means clustering algorithm, which we call the filtering algorithm. This algorithm is easy to implement, requiring a kd-tree as the only major data structure. We establish the practical efficiency of the filtering algorithm in two ways. First, we present a data-sensitive analysis of the algorithm{\textquoteright}s running time, which shows that the algorithm runs faster as the separation between clusters increases. Second, we present a number of empirical studies both on synthetically generated data and on real data sets from applications in color quantization, data compression, and image segmentation}, keywords = {algorithm;color, algorithm;image, algorithm;kd-tree;mean, analysis;filtering, clustering, clustering;, compression;data, distance;covariance, Lloyd, matrices;filtering, quantization;data, segmentation;k-means, squared, structure;data-sensitive, theory;pattern}, isbn = {0162-8828}, doi = {10.1109/TPAMI.2002.1017616}, author = {Kanungo,T. and Mount, Dave and Netanyahu,N. S and Piatko,C. D and Silverman,R. and Wu,A. Y} } @conference {17838, title = {Efficient Manipulation of Large Datasets on Heterogeneous Storage Systems}, booktitle = {Parallel and Distributed Processing Symposium, International}, volume = {2}, year = {2002}, month = {2002///}, pages = {0084 - 0084}, publisher = {IEEE Computer Society}, organization = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, abstract = {In this paper we are concerned with the efficient use of a collection of disk-based storage systems and computing platforms in a heterogeneous setting for retrieving and processing large scientific datasets. We demonstrate, in the context of a data-intensive visualization application, how heterogeneity affects performance and show a set of optimization techniques that can be used to improve performance in a component-based framework. In particular, we examine the application of parallelism via transparent copies of application components in the pipelined processing of data.}, keywords = {component-based frameworks, data-intensive computing, load balancing}, isbn = {0-7695-1573-8}, doi = {http://doi.ieeecomputersociety.org/10.1109/IPDPS.2002.1015655}, author = {Beynon,Michael D. and Sussman, Alan and Kurc,Tahsin and Catalyurek,Umit and Saltz,Joel} } @conference {14961, title = {Efficient techniques for range search queries on earth science data}, booktitle = {Scientific and Statistical Database Management, 2002. Proceedings. 14th International Conference on}, year = {2002}, month = {2002///}, pages = {142 - 151}, abstract = {We consider the problem of organizing large scale earth science raster data to efficiently handle queries for identifying regions whose parameters fall within certain range values specified by the queries. This problem seems to be critical to enabling basic data mining tasks such as determining associations between physical phenomena and spatial factors, detecting changes and trends, and content based retrieval. We assume that the input is too large to fit in internal memory and hence focus on data structures and algorithms that minimize the I/O bounds. A new data structure, called a tree-of-regions (ToR), is introduced and involves a combination of an R-tree and efficient representation of regions. It is shown that such a data structure enables the handling of range queries in an optimal I/O time, under certain reasonable assumptions. We also show that updates to the ToR can be handled efficiently. Experimental results for a variety of multi-valued earth science data illustrate the fast execution times of a wide range of queries, as predicted by our theoretical analysis.}, keywords = {based, computing;, content, data, data;, databases;, Earth, factors;, large, mining, mining;, natural, processing;, queries;, query, range, raster, retrieval;, scale, Science, sciences, search, spatial, structures;, tasks;, temporal, tree, tree-of-regions;, visual}, doi = {10.1109/SSDM.2002.1029714}, author = {Shi,Qingmin and JaJa, Joseph F.} } @article {18385, title = {Empirical findings in agile methods}, journal = {Extreme Programming and Agile Methods{\textemdash}XP/Agile Universe 2002}, year = {2002}, month = {2002///}, pages = {81 - 92}, abstract = {In recent years, the use of, interest in, and controversy about Agile methodologies have realized dramatic growth. Anecdotal evidence is rising regarding the effectiveness of agile methodologies in certain environments and for specified projects. However, collection and analysis of empirical evidence of this effectiveness and classification of appropriate environments for Agile projects has not been conducted. Researchers from four institutions organized an eWorkshop to synchronously and virtually discuss and gather experiences and knowledge from eighteen Agile experts spread across the globe. These experts characterized Agile Methods and communicated experiences using these methods on small to very large teams. They discussed the importance of staffing Agile teams with highly skilled developers. They shared common success factors and identified warning signs of problems in Agile projects. These and other findings and heuristics gathered through this valuable exchange can be useful to researchers and to practitioners as they establish an experience base for better decision making.}, doi = {10.1007/3-540-45672-4_19}, author = {Lindvall,M. and Basili, Victor R. and Boehm,B. and Costa,P. and Dangle,K. and Shull, F. and Tesoriero,R. and Williams,L. and Zelkowitz, Marvin V} } @inbook {17817, title = {Error-Tolerant Agents}, booktitle = {Computational Logic: Logic Programming and BeyondComputational Logic: Logic Programming and Beyond}, series = {Lecture Notes in Computer Science}, volume = {2407}, year = {2002}, month = {2002///}, pages = {83 - 104}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {The use of agents in today{\textquoteright}s Internet world is expanding rapidly. Yet, agent developers proceed largely under the optimistic assumption that agents will be error-free. Errors may arise in agents for numerous reasons {\textemdash} agents may share a workspace with other agents or humans and updates made by these other entities may cause an agent to face a situation that it was not explicitly programmed to deal with. Likewise, errors in coding agents may lead to inconsistent situations where it is unclear how the agent should act. In this paper, we define an agent execution model that allows agents to continue acting {\textquotedblleft}reasonably{\textquotedblright} even when some errors of the above types occur. More importantly, in our framework, agents take {\textquotedblleft}repair{\textquotedblright} actions automatically when confronted with such situations, but while taking such repair actions, they can often continue to engage in work and/or interactions with other agents that are unaffected by repairs.}, keywords = {Computer, Science}, isbn = {978-3-540-43959-2}, url = {http://dx.doi.org/10.1007/3-540-45628-7_22}, author = {Eiter,Thomas and Mascardi,Viviana and Subrahmanian,V.}, editor = {Kakas,Antonis and Sadri,Fariba} } @article {16915, title = {Evaluation of the SoftPOSIT Model-to-Image Registration Algorithm}, journal = {Technical Reports from UMIACS, UMIACS-TR-2002-22}, year = {2002}, month = {2002///}, abstract = {The problem of pose estimation arises in many areas of computer vision, including object recognition,object tracking, site inspection and updating, and autonomous navigation when scene models are avail- able. We present a new algorithm, called SoftPOSIT, for determining the pose of a 3D object from a single 2D image when correspondences between model points and image points are not known. The algorithm combines Gold{\textquoteright}s iterative softassign algorithm [20, 21] for computing correspondences and DeMenthon{\textquoteright}s iterative POSIT algorithm [14] for computing object pose under a full-perspective camera model. Our algorithm, unlike most previous algorithms for pose determination, does not have to hypoth- esize small sets of matches and then verify the remaining image points. Instead, all possible matches are treated identically throughout the search for an optimal pose. The performance of the algorithm is extensively evaluated in Monte Carlo simulations on synthetic data under a variety of levels of clutter, occlusion, and image noise. These tests show that the algorithm performs well in a variety of difficult sce- narios, and empirical evidence suggests that the algorithm has an asymptotic run-time complexity that is better than previous methods by a factor of the number of image points. The algorithm is being applied to a number of practical autonomous vehicle navigation problems including the registration of 3D archi- tectural models of a city to images, and the docking of small robots onto larger robots. }, author = {David,P. and DeMenthon,D. and Duraiswami, Ramani and Samet, Hanan} } @inbook {14692, title = {Evolution in Action: Using Active Networking to Evolve Network Support for Mobility}, booktitle = {Active NetworksActive Networks}, series = {Lecture Notes in Computer Science}, volume = {2546}, year = {2002}, month = {2002///}, pages = {146 - 161}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {A key early objective of Active Networking (AN) was to support on-the-fly network evolution. Although AN has been used relatively extensively to build application-customized protocols and even whole networking systems, demonstrations of evolution have been limited. This paper examines three AN mechanisms and how they enable evolution: active packets and plug-in extensions, well-known to the AN community, and update extensions, which are novel to AN. We devote our presentation to a series of demonstrations of how each type of evolution can be applied to the problem of adding support for mobility to a network. This represents the most large-scale demonstration of AN evolution to date. These demonstrations show what previous AN research has not: that AN technology can, in fact, support very significant changes to the network, even while the network is operational.}, isbn = {978-3-540-00223-9}, url = {http://dx.doi.org/10.1007/3-540-36199-5_12}, author = {Seong-Kyu,Song and Shannon,Stephen and Hicks, Michael W. and Nettles,Scott}, editor = {Sterbenz,James and Takada,Osamu and Tschudin,Christian and Plattner,Bernhard} } @conference {17889, title = {Executing Multiple Pipelined Data Analysis Operations in the Grid}, booktitle = {SC Conference}, year = {2002}, month = {2002///}, pages = {54 - 54}, publisher = {IEEE Computer Society}, organization = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, abstract = {Processing of data in many data analysis applications can be represented as an acyclic, coarse grain data flow, from data sources to the client. This paper is concerned with scheduling of multiple data analysis operations, each of which is represented as a pipelined chain of processing on data. We define the scheduling problem for effectively placing components onto Grid resources, and propose two scheduling algorithms. Experimental results are presented using a visualization application.}, doi = {http://doi.ieeecomputersociety.org/10.1109/SC.2002.10015}, author = {Spencer,Matthew and Ferreira,Renato and Beynon,Michael and Kurc,Tahsin and Catalyurek,Umit and Sussman, Alan and Saltz,Joel} } @article {17146, title = {Expandable indexes vs. sequential menus for searching hierarchies on the World Wide Web}, journal = {Behaviour \& Information Technology}, volume = {21}, year = {2002}, month = {2002///}, pages = {201 - 207}, abstract = {An experiment is reported that compared expandable indexes providing full menu context with sequential menus providing only partial context. Menu depth was varied using hierarchies of two, three and four levels deep in an asymmetric structure of 457 root level items. Menus were presented on the World Wide Web within a browser. Participants searched for specific targets. Results suggest that reducing the depth of hierarchies improves performance in terms of speed and search efficiency. Surprisingly, expandable indexes resulted in poorer performance with deeper hierarchies than did sequential menus.An experiment is reported that compared expandable indexes providing full menu context with sequential menus providing only partial context. Menu depth was varied using hierarchies of two, three and four levels deep in an asymmetric structure of 457 root level items. Menus were presented on the World Wide Web within a browser. Participants searched for specific targets. Results suggest that reducing the depth of hierarchies improves performance in terms of speed and search efficiency. Surprisingly, expandable indexes resulted in poorer performance with deeper hierarchies than did sequential menus. }, isbn = {0144-929X}, doi = {10.1080/0144929021000009045}, url = {http://www.tandfonline.com/doi/abs/10.1080/0144929021000009045}, author = {Zaphiris,Panayiotis and Shneiderman, Ben and Norman,Kent L} } @article {12159, title = {The Experience factory organization}, journal = {IEEE Software}, volume = {19}, year = {2002}, month = {2002///}, pages = {30 - 31}, author = {Basili, Victor R. and Seaman,C.} } @article {12133, title = {Experience in implementing a learning software organization}, journal = {Software, IEEE}, volume = {19}, year = {2002}, month = {2002/06//may}, pages = {46 - 49}, abstract = {In an effort to improve software development and acquisition processes and explicitly reuse knowledge from previous software projects, DaimlerChrysler created a software experience center (SEC). The authors report on challenges the company faced in creating the SEC}, keywords = {ACQUISITION, center;software, centres;project, DaimlerChrysler;explicit, development, experience, improvement;, improvement;automobile, industry;computer, knowledge, management;software, organization;previous, process, processes;software, projects;software, reuse;learning, software}, isbn = {0740-7459}, doi = {10.1109/MS.2002.1003453}, author = {Schneider,K. and von Hunnius,J.-P. and Basili, Victor R.} } @conference {12763, title = {An experimental evaluation of linear and kernel-based methods for face recognition}, booktitle = {Applications of Computer Vision, 2002. (WACV 2002). Proceedings. Sixth IEEE Workshop on}, year = {2002}, month = {2002///}, pages = {13 - 18}, abstract = {In this paper we present the results of a comparative study of linear and kernel-based methods for face recognition. The methods used for dimensionality reduction are Principal Component Analysis (PCA), Kernel Principal Component Analysis (KPCA), Linear Discriminant Analysis (LDA) and Kernel Discriminant Analysis (KDA). The methods used for classification are Nearest Neighbor (NN) and Support Vector Machine (SVM). In addition, these classification methods are applied on raw images to gauge the performance of these dimensionality reduction techniques. All experiments have been performed on images from UMIST Face Database.}, keywords = {analysis;, classification;, component, discriminant, Face, image, Kernel, linear, Machine;, nearest, neighbor;, principal, recognition;, Support, vector}, doi = {10.1109/ACV.2002.1182137}, author = {Gupta, H. and Agrawala, Ashok K. and Pruthi, T. and Shekhar, C. and Chellapa, Rama} } @inbook {18671, title = {Experimental Evaluation of the Unavailability Induced by a Group Membership Protocol}, booktitle = {Dependable Computing EDCC-4}, series = {Lecture Notes in Computer Science}, volume = {2485}, year = {2002}, month = {2002///}, pages = {644 - 648}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {Group communication is an important paradigm for building highly available distributed systems. However, group membership operations often require the system to block message traffic, causing system services to become unavailable. This makes it important to quantify the unavailability induced by membership operations. This paper experimentally evaluates the blocking behavior of the group membership protocol of the Ensemble group communication system using a novel global-state-based fault injection technique. In doing so, we demonstrate how a layered distributed protocol such as the Ensemble group membership protocol can be modeled in terms of a state machine abstraction, and show how the resulting global state space can be used to specify fault triggers and define important measures on the system. Using this approach, we evaluate the cost associated with important states of the protocol under varying workload and group size. We also evaluate the sensitivity of the protocol to the occurrence of a second correlated crash failure during its operation.}, keywords = {Computer science}, isbn = {978-3-540-00012-9}, url = {http://www.springerlink.com/content/mnkd4upqr14w2r7e/abstract/}, author = {Joshi,Kaustubh and Michel Cukier and Sanders,William}, editor = {Bondavalli,Andrea and Thevenod-Fosse,Pascale} } @article {18762, title = {Extracting articulation models from CAD models of parts with curved surfaces}, journal = {TRANSACTIONS-AMERICAN SOCIETY OF MECHANICAL ENGINEERS JOURNAL OF MECHANICAL DESIGN}, volume = {124}, year = {2002}, month = {2002///}, pages = {106 - 114}, abstract = {Degrees of freedom in an assembly are realized by creating mating features that permit relativemotion between parts. In complex assemblies, interactions between individual degrees of freedom may result in a behavior different from the intended behavior. In addition, current methods perform assembly reasoning by approximating curved surfaces as piecewise linear surfaces. Therefore, it is important to be able to: reason about assemblies using exact representations of curved surfaces; verify global motion behavior of parts in the assembly; and create motion simulations of the assembly by examination of the geometry. In this paper, we present a linear algebraic constraint method to automatically construct the space of allowed instantaneous motions of an assembly from the geometry of its constituent parts. Our work builds on previous work on linear contact mechanics and on our previous work on curved surface contact mechanics. We enumerate the conditions under which general curved surfaces can be represented using a finite number of constraints linear in the instantaneous velocities. We compose such constraints to build a space of allowed instantaneous velocities for the assembly. The space is then described as a set-theoretic sum of contact-preserving and contact-breaking motion sub-spaces. Analysis of each subspace provides feedback to the designer, which we demonstrate through the use of an example assembly {\textendash} a 4-part arm. Finally, the results of the analysis of a 4-bar linkage are compared to those from mechanism theory. }, url = {http://www-2.cs.cmu.edu/afs/cs.cmu.edu/user/cjp/www/pubs/MechDes02.pdf}, author = {Sinha,R. and Gupta,S.K. and Paredis,C. J. J. and Khosla,P. K.} } @conference {11893, title = {Eye tracking using active deformable models}, booktitle = {Proc. of the IIIrd Indian Conference on Computer Vision, Graphics and Image Processing}, year = {2002}, month = {2002///}, author = {Ramadan,S. and Abd-Almageed, Wael and Smith,C.E.} } @conference {18676, title = {Formal specification and verification of a group membership protocol for an intrusion-tolerant group communication system}, year = {2002}, month = {2002/12//}, pages = {9 - 18}, abstract = {We describe a group membership protocol that is part of an intrusion-tolerant group communication system, and present an effort to use formal tools to model and validate our protocol. We describe in detail the most difficult part of the validation exercise, which was the determination of the right level of abstraction of the protocol for formally specifying the protocol. The validation exercise not only formally showed that the protocol satisfies its correctness claims, but also provided information that will help us make the protocol more efficient without violating correctness.}, keywords = {computer network reliability, distributed processing, distributed systems, fault tolerant computing, formal specification, formal verification, group membership protocol, intrusion-tolerant group communication system, PROMELA, Protocols}, doi = {10.1109/PRDC.2002.1185613}, author = {Ramasamy,H. V. and Michel Cukier and Sanders,W. H.} } @article {12822, title = {Generic tools for verifying concurrent systems}, journal = {Science of Computer Programming}, volume = {42}, year = {2002}, month = {2002/01//}, pages = {39 - 47}, abstract = {Despite the enormous strides made in automatic verification technology over the past decade and a half, tools such as model checkers remain relatively underused in the development of software. One reason for this is that the bewildering array of specification and verification formalisms complicates the development and adoption by users of relevant tool support. This paper proposes a remedy to this state of affairs in the case of finite-state concurrent systems by describing an approach to developing customizable yet efficient verification tools.}, keywords = {Model checking, Operational semantics, Process algebra, Specification, verification, Verification tools}, isbn = {0167-6423}, doi = {10.1016/S0167-6423(01)00033-8}, url = {http://www.sciencedirect.com/science/article/pii/S0167642301000338}, author = {Cleaveland, Rance and Sims,Steven T.} } @article {16270, title = {Genome sequence and comparative analysis of the model rodent malaria parasite Plasmodium yoelii yoelii}, journal = {Nature}, volume = {419}, year = {2002}, month = {2002/10/03/}, pages = {512 - 519}, abstract = {Species of malaria parasite that infect rodents have long been used as models for malaria disease research. Here we report the whole-genome shotgun sequence of one species, Plasmodium yoelii yoelii, and comparative studies with the genome of the human malaria parasite Plasmodium falciparum clone 3D7. A synteny map of 2,212 P. y. yoelii contiguous DNA sequences (contigs) aligned to 14 P. falciparum chromosomes reveals marked conservation of gene synteny within the body of each chromosome. Of about 5,300 P. falciparum genes, more than 3,300 P. y. yoelii orthologues of predominantly metabolic function were identified. Over 800 copies of a variant antigen gene located in subtelomeric regions were found. This is the first genome sequence of a model eukaryotic parasite, and it provides insight into the use of such systems in the modelling of Plasmodium biology and disease.}, isbn = {0028-0836}, doi = {10.1038/nature01099}, url = {http://www.nature.com/nature/journal/v419/n6906/full/nature01099.html}, author = {Carlton,Jane M. and Angiuoli,Samuel V and Suh,Bernard B. and Kooij,Taco W. and Pertea,Mihaela and Silva,Joana C. and Ermolaeva,Maria D. and Allen,Jonathan E and Jeremy D Selengut and Koo,Hean L. and Peterson,Jeremy D. and Pop, Mihai and Kosack,Daniel S. and Shumway,Martin F. and Bidwell,Shelby L. and Shallom,Shamira J. and Aken,Susan E. van and Riedmuller,Steven B. and Feldblyum,Tamara V. and Cho,Jennifer K. and Quackenbush,John and Sedegah,Martha and Shoaibi,Azadeh and Cummings,Leda M. and Florens,Laurence and Yates,John R. and Raine,J. Dale and Sinden,Robert E. and Harris,Michael A. and Cunningham,Deirdre A. and Preiser,Peter R. and Bergman,Lawrence W. and Vaidya,Akhil B. and Lin,Leo H. van and Janse,Chris J. and Waters,Andrew P. and Smith,Hamilton O. and White,Owen R. and Salzberg,Steven L. and Venter,J. Craig and Fraser,Claire M. and Hoffman,Stephen L. and Gardner,Malcolm J. and Carucci,Daniel J.} } @article {16237, title = {Genome Sequence Assembly: Algorithms and Issues}, volume = {35}, year = {2002}, month = {2002///}, pages = {47 - 54}, abstract = {Ultimately, genome sequencing seeks to provide an organism{\textquoteright}s complete DNA sequence. Automation of DNA sequencing allowed scientists to decode entire genomes and gave birth to genomics, the analytic and comparative study of genomes. Although genomes can include billions of nucleotides, the chemical reactions researchers use to decode the DNA are accurate for only about 600 to 700 nucleotides at a time.The DNA reads that sequencing produces must then be assembled into a complete picture of the genome. Errors and certain DNA characteristics complicate assembly. Resolving these problemsentails an additional and costly finishing phase that involves extensive human intervention. Assembly programs can dramatically reduce this cost by taking into account additional informationobtained during finishing. Algorithms that can assemble millions of DNA fragments into gene sequences underlie the current revolution in biotechnology, helping researchers build the growingdatabase of complete genomes.}, isbn = {0018-9162}, author = {Pop, Mihai and Salzberg,Steven L. and Shumway,Martin} } @article {12962, title = {Genomic profiles of clinical and environmental isolates of Vibrio cholerae O1 in cholera-endemic areas of Bangladesh}, journal = {Proceedings of the National Academy of Sciences}, volume = {99}, year = {2002}, month = {2002///}, pages = {12409 - 12409}, abstract = {Diversity, relatedness, and ecological interactions of toxigenic Vibrio cholerae O1 populations in two distinctive habitats, the human intestine and the aquatic environment, were analyzed. Twenty environmental isolates and 42 clinical isolates were selected for study by matching serotype, geographic location of isolation in Bangladesh, and season of isolation. Genetic profiling was done by enterobacterial repetitive intergenic consensus sequence{\textendash}PCR, optimized for profiling by using the fully sequenced V. cholerae El Tor N16961 genome. Five significant clonal clusters of haplotypes were found from 57 electrophoretic types. Isolates from different areas or habitats intermingled in two of the five significant clusters. Frequencies of haplotypes differed significantly only between the environmental populations (exact test; P < 0.05). Analysis of molecular variance yielded a population genetic structure reflecting the differentiating effects of geographic area, habitat, and sampling time. Although a parameter confounding the latter differences explained 9\% of the total molecular variance in the entire population (P < 0.01), the net effect of habitat and time could not be separated because of the small number of environmental isolates included in the study. Five subpopulations from a single area were determined, and from these we were able to estimate a relative differentiating effect of habitat, which was small compared with the effect of temporal change. In conclusion, the resulting population structure supports the hypothesis that spatial and temporal fluctuations in the composition of toxigenic V. cholerae populations in the aquatic environment can cause shifts in the dynamics of the disease.}, isbn = {0027-8424, 1091-6490}, doi = {10.1073/pnas.192426499}, url = {http://www.pnas.org/content/99/19/12409}, author = {Zo,Y. G. and Rivera,I. N. G. and E. Russek-Cohen and Islam,M. S. and Siddique,A. K. and Yunus,M. and Sack,R. B. and Huq,A. and Rita R Colwell} } @conference {17178, title = {Getting real about speech: overdue or overhyped?}, booktitle = {CHI {\textquoteright}02 extended abstracts on Human factors in computing systems}, series = {CHI EA {\textquoteright}02}, year = {2002}, month = {2002///}, pages = {708 - 709}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Speech has recently made headway towards becoming a more mainstream interface modality. For example, there is an increasing number of call center applications, especially in the airline and banking industries. However, speech still has many properties that cause its use to be problematic, such as its inappropriateness in both very quiet and very noisy environments, and the tendency of speech to increase cognitive load. Concerns about such problems are valid; however, they do not explain why the use of speech is so controversial in the HCI community. This panel would like to address the issues underlying the controversy around speech, by discussing the current state of the art, the reasons it is so difficult to build a good speech interface, and how HCI research can contribute to the development of speech interfaces.}, keywords = {cognitive load, social responses, speech interfaces}, isbn = {1-58113-454-1}, doi = {10.1145/506443.506557}, url = {http://doi.acm.org/10.1145/506443.506557}, author = {James,Frankie and Lai,Jennifer and Suhm,Bernhard and Balentine,Bruce and Makhoul,John and Nass,Clifford and Shneiderman, Ben} } @conference {13047, title = {GLEANS: A generator of logical extracts and abstracts for nice summaries}, booktitle = {Workshop on Automatic Summarization}, year = {2002}, month = {2002///}, pages = {9 - 14}, author = {Daum{\'e}, Hal and Echihabi,A. and Marcu,D. and Munteanu,D. and Soricut,R.} } @conference {13566, title = {Hidden loop recovery for handwriting recognition}, booktitle = {Frontiers in Handwriting Recognition, 2002. Proceedings. Eighth International Workshop on}, year = {2002}, month = {2002///}, pages = {375 - 380}, abstract = {One significant challenge in the recognition of off-line handwriting is in the interpretation of loop structures. Although this information is readily available in online representation, close proximity of strokes often merges their centers making them difficult to identify. In this paper a novel approach to the recovery of hidden loops in off-line scanned document images is presented. The proposed algorithm seeks blobs that resemble truncated ellipses. We use a sophisticated form analysis method based on mutual distance measurements between the two sides of a symmetric shape. The experimental results are compared with the ground truth of the online representations of each off-line word image. More than 86\% percent of the meaningful loops are handled correctly.}, keywords = {analysis;, character, contour, cursive, detection;, distance, edge, ellipses;, form, handwritten, hidden, loop, measurements;, mutual, partitioning;, recognition;, recovery;, SHAPE, shape;, sophisticated, strokes;, symmetric, truncated, word}, doi = {10.1109/IWFHR.2002.1030939}, author = {David Doermann and Intrator,N. and Rivin,E. and Steinherz,T.} } @conference {11894, title = {Hidden Markov models for silhouette classification}, booktitle = {Automation Congress, 2002 Proceedings of the 5th Biannual World}, volume = {13}, year = {2002}, month = {2002///}, pages = {395 - 402}, publisher = {IEEE}, organization = {IEEE}, abstract = {In this paper, a new technique for object classification from silhouettes is presented. Hidden Markov models are used as a classification mechanism. Through a set of experiments, we show the validity of our approach and show its invariance under severe rotation conditions. Also, a comparison with other techniques that use hidden Markov models for object classification from silhouettes is presented.}, keywords = {Computer vision, Feature extraction, Fourier transforms, hidden Markov models, HMM, image classification, Neural networks, object classification, Object recognition, parameter estimation, pattern recognition, Probability distribution, Shape measurement, silhouette classification, Wavelet transforms}, isbn = {1-889335-18-5}, doi = {10.1109/WAC.2002.1049575}, author = {Abd-Almageed, Wael and Smith,C.} } @conference {13931, title = {How young can our design partners be}, booktitle = {Proceedings of the Participatory Design Conference}, year = {2002}, month = {2002///}, pages = {272 - 277}, author = {Farber,A. and Druin, Allison and Chipman,G. and Julian,D. and Somashekhar,S.} } @article {17219, title = {IEEE Multimedia: Visions and views: Meeting human needs with new digital imaging technologies}, journal = {IEEE Distributed Systems Online}, volume = {3}, year = {2002}, month = {2002///}, author = {Shneiderman, Ben} } @article {15111, title = {Implementation of chosen-ciphertext attacks against PGP and GnuPG}, journal = {Information Security}, year = {2002}, month = {2002///}, pages = {90 - 101}, abstract = {We recently noted [6] that PGP and other e-mail encryption protocols are, in theory, highly vulnerable to chosen-ciphertext attacks in which the recipient of the e-mail acts as an unwitting {\textquotedblleft}decryption oracle{\textquotedblright}. We argued further that such attacks are quite feasible and therefore represent a serious concern. Here, we investigate these claims in more detail by attempting to implement the suggested attacks. On one hand, we are able to successfully implement the described attacks against PGP and GnuPG (two widely-used software packages) in a number of different settings. On the other hand, we show that the attacks largely fail when data is compressed before encryption.Interestingly, the attacks are unsuccessful for largely fortuitous reasons; resistance to these attacks does not seem due to any conscious effort made to prevent them. Based on our work, we discuss those instances in which chosen-ciphertext attacks do indeed represent an important threat and hence must be taken into account in order to maintain confidentiality. We also recommend changes in the OpenPGP standard [3] to reduce the effectiveness of our attacks in these settings. }, doi = {10.1007/3-540-45811-5_7}, author = {Jallad,K. and Katz, Jonathan and Schneier,B.} } @inbook {17604, title = {Improved Approximation Algorithms for the Partial Vertex Cover Problem}, booktitle = {Approximation Algorithms for Combinatorial OptimizationApproximation Algorithms for Combinatorial Optimization}, series = {Lecture Notes in Computer Science}, volume = {2462}, year = {2002}, month = {2002///}, pages = {161 - 174}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {The partial vertex cover problem is a generalization of the vertex cover problem:given an undirected graph G = ( V,E ) and an integer k , we wish to choose a minimum number of vertices such that at least k edges are covered. Just as for vertex cover, 2-approximation algorithms are known for this problem, and it is of interest to see if we can do better than this.The current-best approximation ratio for partial vertex cover, when parameterized by the maximum degree d of G , is (2 - Θ (1/ d )).We improve on this by presenting a $$ {\l}eft( 2 - \Theta {\l}eft( \tfrac{\l}n {\l}n d {\l}n d \right) \right) $$ -approximation algorithm for partial vertex cover using semidefinite programming, matching the current-best bound for vertex cover. Our algorithmuses a new rounding technique, which involves a delicate probabilistic analysis.}, isbn = {978-3-540-44186-1}, url = {http://dx.doi.org/10.1007/3-540-45753-4_15}, author = {Halperin,Eran and Srinivasan, Aravind}, editor = {Jansen,Klaus and Leonardi,Stefano and Vazirani,Vijay} } @article {17816, title = {Improving Performance of Agents by Activity Partitioning}, journal = {Technical Reports from UMIACS, UMIACS-TR-2002-96}, year = {2002}, month = {2002///}, abstract = {There is growing interest in software agents that provide a variety of services to humans, other agents, and third party software applications. Some of these agents are engaged in hundreds of activities at any given time point. In such cases, agents may try to examine a set A of activities and leverage commonalities between them in order to reduce their load. We call this activity merging. Unfortunately, in most application domains, activity merging turns out to be NP-complete. Thus, for each application domain, there is an integer k (which varies from domain to domain) such that activity merging can merge up to k activities while satisfying the application{\textquoteright}s performance expectations. In this paper, we consider the problem of what to do when the set of activities exceeds k. Our approach partitions A into disjoint sets A1 union A2 union ... union An such that each Ai contains at most k activities in it (thus the activities in each Ai can be merged using a merging algorithm). When creating such partitions, we would like to ensure that the activities inside each Ai share a lot of commonality, so that merging yields a lot of savings. In this paper, we propose two optimal algorithms (based on the A* algorithm and the branch and bound paradigm), as well as numerous greedy algorithms to solve the problem. We have implemented these algorithms and conducted detailed experiments. The results point out which algorithms are most appropriate for scaling agent performance.}, author = {Ozcan,F. and V.S. Subrahmanian} } @conference {17227, title = {Improving Web-based civic information access: a case study of the 50 US states}, booktitle = {2002 International Symposium on Technology and Society, 2002. (ISTAS{\textquoteright}02)}, year = {2002}, month = {2002///}, pages = {275 - 282}, publisher = {IEEE}, organization = {IEEE}, abstract = {An analysis of the home pages of all fifty US states reveals great variety in key design features that influence efficacy. Some states had excessively large byte counts that would slow users connected by commonly-used 56 K modems. Many web sites had low numbers of or poorly organized links that would make it hard for citizens to find what they were interested in. Features such as search boxes, privacy policies, online help, or contact information need to be added by several states. Our analysis concludes with ten recommendations and finds many further opportunities for individual states to improve their Websites. However still greater benefits will come through collaboration among the states that would lead to consistency, appropriate tagging, and common tools.}, keywords = {Computer aided software engineering, Computer science, contact information, Educational institutions, government data processing, Guidelines, home page design features, information resources, Laboratories, Modems, Navigation, online help, privacy, privacy policies, search boxes, Tagging, Uniform resource locators, US states, USA, User interfaces, Web sites, Web-based civic information access}, isbn = {0-7803-7284-0}, doi = {10.1109/ISTAS.2002.1013826}, author = {Ceaparu,I. and Shneiderman, Ben} } @article {12963, title = {In vitro adhesion to human cells by viable but nonculturable Enterococcus faecalis}, journal = {Current microbiology}, volume = {45}, year = {2002}, month = {2002///}, pages = {105 - 110}, abstract = {The ability of viable but nonculturable (VBNC) Enterococcus faecalis to adhere to Caco-2 and Girardi heart cultured cells and to urinary tract epithelial cells (ECs) was studied. Enterococci were harvested during the vegetative growth phase (early exponential and stationary), in the VBNC state, and after recovery of the ability to divide. VBNC bacteria maintained their adherence capability but the efficiency of attachment was reduced by about 50 to 70\%, depending on the target cell employed. The decrease was transient, since enterococci that regained their culturability showed adherence values similar to those observed for actively growing cells. Analysis of the invasive properties of E. faecalis revealed that the VBNC state caused a decrease in the number of bacteria that entered the cultured HEK cells as a result of the reduction in the number of adhering bacteria. These results highlight the importance of studies of the VBNC phenomenon, with respect to both microbial survival in the environment and the impact on human health.}, doi = {10.1007/s00284-001-0089-2}, author = {Pruzzo,C. and Tarsi,R. and Lle{\`o},M. M. and Signoretto,C. and Zampini,M. and Rita R Colwell and Canepari,P.} } @article {17230, title = {In Web we trust: establishing strategic trust among online customers}, journal = {E-Service: new directions in theory and practice}, year = {2002}, month = {2002///}, pages = {90 - 107}, abstract = {Electronic commerce (e-commerce) provides an important chance for established large companies to gain more customers as well as for new small companies to have a good start and rapid growth. However, establishing trust between customers and companies through web interface, a key component of successful e-service, is not as easy as through human-buyer-human-seller interaction. In the past few years, a number of experiments have been conducted in order to determine the factors that influence customers{\textquoteright} trust in online businesses. The goal of our experiment was to establish which features that appear on commercial websites are trust-inducing. Our study focused on three independent variables: customer service (limited and extensive), testimonial (self and external) and security features representation (graphics and text). We designed the homepages of eight web sites with all combinations of treatments of the three independent variables. Each of the 52 subjects reviewed all the eight homepages and gave them a relative rank of trustworthiness. After the experiment subjects answered additional e-trust related questions. The experiment results and the survey support the belief that specific customer service commitments, third party testimonials and graphic security representations are important in establishing strategic trust among on-line customers.}, author = {Ceaparu,I. and Demner,D. and Hung,E. and Zhao,H. and Shneiderman, Ben} } @conference {17539, title = {Inferring link weights using end-to-end measurements}, booktitle = {Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment}, series = {IMW {\textquoteright}02}, year = {2002}, month = {2002///}, pages = {231 - 236}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {We describe a novel constraint-based approach to approximate ISP link weights using only end-to-end measurements. Common routing protocols such as OSPF and IS-IS choose least-cost paths using link weights, so inferred weights provide a simple, concise, and useful model of intradomain routing. Our approach extends router-level ISP maps, which include only connectivity, with link weights that are consistent with routing. Our inferred weights agree well with observed routing: while our inferred weights fully characterize the set of shortest paths between 84--99\% of the router-pairs, alternative models based on hop count and latency do so for only 47--81\% of the pairs.}, isbn = {1-58113-603-X}, doi = {10.1145/637201.637237}, url = {http://doi.acm.org/10.1145/637201.637237}, author = {Mahajan,Ratul and Spring, Neil and Wetherall,David and Anderson,Tom} } @article {16907, title = {Integration of local and global shape analysis for logo classification}, journal = {Pattern Recognition Letters}, volume = {23}, year = {2002}, month = {2002/10//}, pages = {1449 - 1457}, abstract = {A comparison is made of global and local methods for the shape analysis of logos in an image database. The qualities of the methods are judged by using the shape signatures to define a similarity metric on the logos. As representatives for the two classes of methods, we use the negative shape method which is based on local shape information and a wavelet-based method which makes use of global information. We apply both methods to images with different kinds of degradations and examine how a particular degradation highlights the strengths and shortcomings of each method. Finally, we use these results to develop a new adaptive weighting scheme which is based on the relative performances of the two methods. This scheme gives rise to a new method that is much more robust with respect to all degradations examined and works by automatically predicting if the negative shape or wavelet method is performing better.}, keywords = {Image databases, Logos, shape recognition, shape representation, Symbol recognition}, isbn = {0167-8655}, doi = {10.1016/S0167-8655(02)00105-8}, url = {http://www.sciencedirect.com/science/article/pii/S0167865502001058}, author = {Neumann, Jan and Samet, Hanan and Soffer,Aya} } @conference {17243, title = {Interacting with identification technology: can it make us more secure?}, booktitle = {CHI {\textquoteright}02 extended abstracts on Human factors in computing systems}, series = {CHI EA {\textquoteright}02}, year = {2002}, month = {2002///}, pages = {564 - 565}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, keywords = {Biometrics, civil liberties, face recognition, national id card, privacy, Security}, isbn = {1-58113-454-1}, doi = {10.1145/506443.506484}, url = {http://doi.acm.org/10.1145/506443.506484}, author = {Scholtz,Jean and Johnson,Jeff and Shneiderman, Ben and Hope-Tindall,Peter and Gosling,Marcus and Phillips,Jonathon and Wexelblat,Alan} } @article {13444, title = {Interactive, Incremental Scheduling for Virtual Telescopes in Education}, journal = {THIRD INTERNATIONAL NASA WORKSHOP ON PLANNING AND SCHEDULING FOR SPACE}, year = {2002}, month = {2002///}, pages = {27--29 - 27--29}, abstract = {The Telescopes in Education (TIE) project, which began in 1992, provides remote access for students to control large observatory telescopes in real time. TIE began with a single telescope, and with manual evaluation and scheduling of student requests. With the sucess of TIE, 20 or more additional telescopes are expected to come on line. With proportionally more student requests, we anticipate that managing the requests and telescope resources will rapidly become too complex and time-consuming to handle manually. To respond to this problem, the Virtual Telescopes in Education (VTIE) project was begun last year. VTIE will provide networked capabilities for automated proposal preparation and evaluation, scheduling, and data archival. This paper describes the interactive scheduling capability that is under development for VTIE. Accepted observation requests will be incrementally and interactively scheduled by a constraint-based scheduler, and rescheduled as needed in response to dynamically changing weather and telescope conditions. The scheduling system incorporates a novel method for cost-sensitive constraint satisfaction, which will enable modeling of the costs of data gathering and user interaction during schedule repair.}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.134.4105}, author = {Rathod,Priyang and desJardins, Marie and Sansare,Suryakant} } @article {17259, title = {Interactively exploring hierarchical clustering results [gene identification]}, journal = {Computer}, volume = {35}, year = {2002}, month = {2002/07//}, pages = {80 - 86}, abstract = {To date, work in microarrays, sequenced genomes and bioinformatics has focused largely on algorithmic methods for processing and manipulating vast biological data sets. Future improvements will likely provide users with guidance in selecting the most appropriate algorithms and metrics for identifying meaningful clusters-interesting patterns in large data sets, such as groups of genes with similar profiles. Hierarchical clustering has been shown to be effective in microarray data analysis for identifying genes with similar profiles and thus possibly with similar functions. Users also need an efficient visualization tool, however, to facilitate pattern extraction from microarray data sets. The Hierarchical Clustering Explorer integrates four interactive features to provide information visualization techniques that allow users to control the processes and interact with the results. Thus, hybrid approaches that combine powerful algorithms with interactive visualization tools will join the strengths of fast processors with the detailed understanding of domain experts}, keywords = {algorithmic methods, arrays, Bioinformatics, biological data sets, biology computing, Data analysis, data mining, data visualisation, Data visualization, DNA, Fluorescence, gene functions, gene identification, gene profiles, Genetics, Genomics, Hierarchical Clustering Explorer, hierarchical systems, interactive exploration, interactive information visualization tool, interactive systems, Large screen displays, meaningful cluster identification, metrics, microarray data analysis, pattern clustering, pattern extraction, Process control, Sensor arrays, sequenced genomes, Tiles}, isbn = {0018-9162}, doi = {10.1109/MC.2002.1016905}, author = {Seo,Jinwook and Shneiderman, Ben} } @article {13377, title = {Irisnet: An architecture for compute-intensive wide-area sensor network services}, journal = {Intel Corporation, Pittsburgh IRPTR-02}, volume = {10}, year = {2002}, month = {2002///}, abstract = {Previous work on sensor networks has targeted adhoc wireless networks of closely-colocated, resource- constrained scalar sensor motes. Such work has over- looked richer sensor types such as webcams and mi- crophones, which are typically attached to Internet- connected machines with significant computing power and storage. In this paper, we describe IrisNet (Internet- scale Resource-Intensive Sensor Network services), an architecture for wide-area sensor networks based on these more capable sensing nodes. IrisNet provides a common, scalable software infrastructure that enables the flexible creation of sensor-based Internet services. It dramatically reduces network bandwidth utilization through the use of senselets, binary code fragments that perform intensive data filtering at the sensing nodes, leveraging the available processing power and mem- ory. IrisNet employs a two-tier hierarchy of sensing nodes and query processing nodes. Key features of IrisNet include flexible data partitioning, efficient and protected sharing of sensor nodes, low-latency queries, partial match caching, query-specified freshness toler- ances, and monitoring and logging support. This pa- per reports on experiments with a working IrisNet pro- totype running a parking space finder service, demon- strating the effectiveness of IrisNet{\textquoteright}s features in achiev- ing scalability and reducing query response times. }, author = {Nath,S. and Deshpande, Amol and Ke,Y. and Gibbons,P. and Karp,B. and Seshan,S.} } @conference {12107, title = {A light-weight process for capturing and evolving defect reduction experience}, booktitle = {Engineering of Complex Computer Systems, 2002. Proceedings. Eighth IEEE International Conference on}, year = {2002}, month = {2002/12//}, pages = {129 - 132}, abstract = {Selecting technologies for developing software is a crucial activity in software projects. Defect reduction is an example of an area in which software developers have to decide what technologies to use. CeBASE is a NSF funded project that has the role of improving software development by providing decision support on the selection of techniques and tools. The decision support is based on empirical data organized in experience bases and refined into high-level models. Empirical data is collected through various activities, for example through eWorkshops in which experts discuss important issues, and formalized using the lightweight knowledge dust to knowledge pearl process.}, keywords = {bases;experience, CeBASE;NSF, defect, development;software, experience;software, funded, knowledge;software, management;lightweight, management;software, project;decision, projects;software, reduction, reusability;software, reuse;software, support;eWorkshops;experience, tools;, tools;knowledge}, doi = {10.1109/ICECCS.2002.1181505}, author = {Basili, Victor R. and Lindvall,M. and Shull, F.} } @article {16911, title = {A Linear Iterative Approach for Hierarchical Shortest Path Finding}, journal = {Technical Reports from UMIACS, UMIACS-TR-2002-97}, year = {2002}, month = {2002///}, abstract = {We present a hierarchical approach that subdivides a network with $n$ vertices into $r$ regions with the same number $m$ of vertices ($n = r m$) and creates higher levels merging a constant number $c$ of adjacent regions. We propose linear iterative algorithms to find a shortest path and to expand this path into the lowest level. Since our approach is non-recursive, the complexity constants are small and the algorithms are more efficient in practice than other recursive optimal approaches. A hybrid shortest path algorithm to perform intra-regional queries in the lowest level is introduced. This strategy uses a subsequence of vertices that belong to the shortest path while actually computing the whole shortest path. The hybrid algorithm requires $O(m)$ time and space assuming an uniform distribution of vertices. This represents a further improvement concerning space, since a path view approach requires $O(m^{1.5})$ space in the lowest level. For higher $k$-levels, a path view approach spends $O(1)$ time and requires $O(c^k m)$ space.}, author = {Samet, Hanan and Filho,Gutemberg Guerra} } @conference {15624, title = {A local search approximation algorithm for k-means clustering}, booktitle = {Proceedings of the eighteenth annual symposium on Computational geometry}, series = {SCG {\textquoteright}02}, year = {2002}, month = {2002///}, pages = {10 - 18}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {In k-means clustering we are given a set of n data points in d-dimensional space Rd and an integer k, and the problem is to determine a set of k points in {\'O}C;d, called centers, to minimize the mean squared distance from each data point to its nearest center. No exact polynomial-time algorithms are known for this problem. Although asymptotically efficient approximation algorithms exist, these algorithms are not practical due to the extremely high constant factors involved. There are many heuristics that are used in practice, but we know of no bounds on their performance.We consider the question of whether there exists a simple and practical approximation algorithm for k-means clustering. We present a local improvement heuristic based on swapping centers in and out. We prove that this yields a (9+\&egr;)-approximation algorithm. We show that the approximation factor is almost tight, by giving an example for which the algorithm achieves an approximation factor of (9-\&egr;). To establish the practical value of the heuristic, we present an empirical study that shows that, when combined with Lloyd{\textquoteright}s algorithm, this heuristic performs quite well in practice.}, keywords = {Approximation algorithms, clustering, computational geometry, k-means, local search}, isbn = {1-58113-504-1}, doi = {10.1145/513400.513402}, url = {http://doi.acm.org/10.1145/513400.513402}, author = {Kanungo,Tapas and Mount, Dave and Netanyahu,Nathan S. and Piatko,Christine D. and Silverman,Ruth and Wu,Angela Y.} } @conference {17520, title = {Measuring ISP topologies with Rocketfuel}, booktitle = {ACM SIGCOMM Computer Communication Review}, volume = {32}, year = {2002}, month = {2002///}, pages = {133 - 145}, author = {Spring, Neil and Mahajan,R. and Wetherall,D.} } @article {17290, title = {Media Conversion from Visual to Audio: Voice Browsers}, journal = {Technical Reports of the Computer Science Department}, year = {2002}, month = {2002/12/19/}, abstract = {There is a large amount of information on the World Wide Web that is atthe fingertips of anyone with access to the internet. However, so far this information has primarily been used by people who connect to the web via traditional computer. This is about to change. Recent advances in wireless communication, speech recognition, and speech synthesis technologies have made it possible to access this information from any place, and at any time. In this paper, we discuss voice browsers as compared to current web browsers. Some of the primary techniques of universal accessible design are listed with their relation to voice browsers and some ideas are offered to help authors implementing these considerations when designing web pages. The new voice markup language is briefly discussed. }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/534}, author = {Youssef,Adel and Shneiderman, Ben} } @article {17293, title = {Meeting human needs with new digital imaging technologies}, journal = {IEEE Multimedia}, volume = {9}, year = {2002}, month = {2002/12//Oct}, pages = {8 - 14}, abstract = {It{\textquoteright}s a visual world. Images capture many people{\textquoteright}s thrills, emotions, and concerns. Art can shock or inspire, and family photos are some of our greatest treasures. It{\textquoteright}s not surprising that visual information is a vital component of the new computing. Most people depend on visual input to understand the world around them and as a basis for further creative activities. The popularity of visual media such as photos, short videos, and animations attests to their mainstream acceptance. Digital photos and image-laden Web pages have already become major computing applications, but users still want higher-resolution images and faster downloads}, keywords = {animation, animations, Computer applications, digital images, digital imaging technologies, Helium, History, HUMANS, Image databases, IMAGE PROCESSING, Photography, photos, software libraries, Videos, visual media, Web pages}, isbn = {1070-986X}, doi = {10.1109/MMUL.2002.1041942}, author = {Shneiderman, Ben} } @conference {11899, title = {Mixture models for dynamic statistical pressure snakes}, booktitle = {16th International Conference on Pattern Recognition, 2002. Proceedings}, volume = {2}, year = {2002}, month = {2002///}, pages = {721- 724 vol.2 - 721- 724 vol.2}, publisher = {IEEE}, organization = {IEEE}, abstract = {This paper introduces a new approach to statistical pressure snakes. It uses statistical modeling for both object and background to obtain a more robust pressure model. The Expectation Maximization (EM) algorithm is used to model the data into a Mixture of Gaussians (MoG). Bayesian theory is then employed as a decision making mechanism. Experimental results using the traditional pressure model and the new mixture pressure model demonstrate the effectiveness of the new models.}, keywords = {active contour models, Active contours, Artificial intelligence, Bayes methods, Bayesian methods, Bayesian theory, complex colored object, Computer vision, decision making, decision making mechanism, dynamic statistical pressure snakes, Equations, expectation maximization algorithm, Gaussian distribution, image colour analysis, Image edge detection, Image segmentation, Intelligent robots, mixture models, mixture of Gaussians, mixture pressure model, Robot vision systems, robust pressure model, Robustness, segmentation results, statistical analysis, statistical modeling}, isbn = {0-7695-1695-X}, doi = {10.1109/ICPR.2002.1048404}, author = {Abd-Almageed, Wael and Smith,C.E.} } @conference {17835, title = {Multiple Query Optimization for Data Analysis Applications on Clusters of SMPs}, booktitle = {2nd IEEE/ACM International Symposium on Cluster Computing and the Grid, 2002}, year = {2002}, month = {2002/05/21/24}, pages = {154 - 154}, publisher = {IEEE}, organization = {IEEE}, abstract = {This paper is concerned with the efficient execution of multiple query workloads on a cluster of SMPs. We target applications that access and manipulate large scientific datasets. Queries in these applications involve user-defined processing operations and distributed data structures to hold intermediate and final results. Our goal is to implement system components to leverage previously computed query results and to effectively utilize processing power and aggregated I/O bandwidth on SMP nodes so that both single queries and multi-query batches can be efficiently executed.}, keywords = {Aggregates, Application software, Bandwidth, Data analysis, Data structures, Delay, Query processing, scheduling, Subcontracting, Switched-mode power supply}, isbn = {0-7695-1582-7}, doi = {10.1109/CCGRID.2002.1017123}, author = {Andrade,H. and Kurc, T. and Sussman, Alan and Saltz, J.} } @conference {13317, title = {Multiresolution tetrahedral meshes: an analysis and a comparison}, booktitle = {Shape Modeling International, 2002. Proceedings}, year = {2002}, month = {2002///}, pages = {83 - 91}, abstract = {We deal with the problem of analyzing and visualizing large-size volume data sets. To this aim, we consider multiresolution representations based on a decomposition of the field domain into tetrahedral cells. We compare two types of multiresolution representations that differ on the rule applied to refine an initial coarse mesh: one is based on tetrahedron bisection, and one based on vertex split. The two representations can be viewed as instances of a common multiresolution model, that we call a multiresolution mesh. Encoding data structures for the two representations are briefly described. An experimental comparison on structured volume data sets is presented}, keywords = {(computer, bisection;vertex, cells;tetrahedron, data, generation;rendering, geometry;data, graphics);solid, meshes;rendering;tetrahedral, modelling;, refinement;multiresolution, representations;multiresolution, sets;mesh, split;computational, structures;data, tetrahedral, visualisation;mesh, visualization;experiment;large-size, volume}, doi = {10.1109/SMI.2002.1003532}, author = {Danovaro,E. and De Floriani, Leila and Lee,M. and Samet, Hanan} } @article {16913, title = {Octree approximation and compression methods}, journal = {Proc. of the 1st Intl. Symp. on 3D Data Processing, Visualization, and Transmission}, year = {2002}, month = {2002///}, abstract = {Techniques are presented to progressively approximateand compress in a lossless manner two-colored (i.e. bi- nary) 3D objects (as well as objects of arbitrary dimen- sionality). The objects are represented by a region octree implemented using a pointerless representation based on locational codes. Approximation is achieved through the use of a forest. This method labels the internal nodes of the octree as GB or GW, depending on the number of chil- dren being of type GB or GW. In addition, all BLACK nodes are labeled GB, while all WHITE nodes are labeled GW. A number of different image approximation methods are dis- cussed that make use of a forest. The advantage of these methods is that they are progressive which means that as more of the object is transmitted, the better is the approx- imation. This makes these methods attractive for use on the worldwide web. Progressive transmission has the draw- back that there is an overhead in requiring extra storage. A progressive forest-based approximation and transmission method is presented where the total amount of data that is transmitted is not larger than MIN(B,W), where B and W are the number of BLACK and WHITE blocks, respectively, in the region octree of the set of objects. }, author = {Samet, Hanan and Kochut, A.} } @article {17836, title = {Optimizing execution of component-based applications using group instances}, journal = {Future Generation Computer Systems}, volume = {18}, year = {2002}, month = {2002/03//}, pages = {435 - 448}, abstract = {Recent research on programming models for developing applications on the Grid has proposed component-based models as a viable approach, in which an application is composed of multiple interacting computational objects. We have been developing a framework, called filter-stream programming, for building data-intensive applications that query, analyze and manipulate very large datasets in a distributed environment. In this model, the processing structure of an application is represented as a set of processing units, referred to as filters. In this paper, we develop the problem of scheduling instances of a filter group. A filter group is a set of filters collectively performing a computation for an application. In particular, we seek the answer to the following question: should a new instance be created, or an existing one reused? We experimentally investigate the effects on performance of instantiating multiple filter groups under varying application characteristics.}, keywords = {DataCutter, Grid, Wide-area network}, isbn = {0167-739X}, doi = {10.1016/S0167-739X(01)00070-X}, url = {http://www.sciencedirect.com/science/article/pii/S0167739X0100070X}, author = {Beynon,Michael D. and Kurc,Tahsin and Sussman, Alan and Saltz,Joel} } @article {17312, title = {Ordered and quantum treemaps: Making effective use of 2D space to display hierarchies}, journal = {ACM Transactions on Graphics (TOG)}, volume = {21}, year = {2002}, month = {2002/10//}, pages = {833 - 854}, abstract = {Treemaps, a space-filling method for visualizing large hierarchical data sets, are receiving increasing attention. Several algorithms have been previously proposed to create more useful displays by controlling the aspect ratios of the rectangles that make up a treemap. While these algorithms do improve visibility of small items in a single layout, they introduce instability over time in the display of dynamically changing data, fail to preserve order of the underlying data, and create layouts that are difficult to visually search. In addition, continuous treemap algorithms are not suitable for displaying fixed-sized objects within them, such as images.This paper introduces a new "strip" treemap algorithm which addresses these shortcomings, and analyzes other "pivot" algorithms we recently developed showing the trade-offs between them. These ordered treemap algorithms ensure that items near each other in the given order will be near each other in the treemap layout. Using experimental evidence from Monte Carlo trials and from actual stock market data, we show that, compared to other layout algorithms, ordered treemaps are more stable, while maintaining relatively favorable aspect ratios of the constituent rectangles. A user study with 20 participants clarifies the human performance benefits of the new algorithms. Finally, we present quantum treemap algorithms, which modify the layout of the continuous treemap algorithms to generate rectangles that are integral multiples of an input object size. The quantum treemap algorithm has been applied to PhotoMesa, an application that supports browsing of large numbers of images.}, keywords = {hierarchies, Human-computer interaction, image browsers, Information Visualization, jazz, ordered treemaps, treemaps, TREES, zoomable user interfaces (ZUIs).}, isbn = {0730-0301}, doi = {10.1145/571647.571649}, url = {http://doi.acm.org/10.1145/571647.571649}, author = {Bederson, Benjamin B. and Shneiderman, Ben and Wattenberg,Martin} } @conference {12206, title = {OZONE: A zoomable interface for navigating ontology information}, booktitle = {Proceedings of the Working Conference on Advanced Visual Interfaces}, year = {2002}, month = {2002///}, pages = {139 - 143}, author = {Suh,B. and Bederson, Benjamin B.} } @conference {17642, title = {P5 : a protocol for scalable anonymous communication}, booktitle = {2002 IEEE Symposium on Security and Privacy, 2002. Proceedings}, year = {2002}, month = {2002///}, pages = {58 - 70}, publisher = {IEEE}, organization = {IEEE}, abstract = {We present a protocol for anonymous communication over the Internet. Our protocol, called P5 (peer-to-peer personal privacy protocol) provides sender-, receiver-, and sender-receiver anonymity. P5 is designed to be implemented over current Internet protocols, and does not require any special infrastructure support. A novel feature of P5 is that it allows individual participants to trade-off degree of anonymity for communication efficiency, and hence can be used to scalably implement large anonymous groups. We present a description of P5, an analysis of its anonymity and communication efficiency, and evaluate its performance using detailed packet-level simulations.}, keywords = {Broadcasting, communication efficiency, Computer science, cryptography, data privacy, Educational institutions, Internet, large anonymous groups, P5 protocol, packet-level simulations, Particle measurements, Peer to peer computing, peer-to-peer personal privacy protocol, privacy, Protocols, receiver anonymity, scalable anonymous communication, security of data, sender anonymity, sender-receiver anonymity, Size measurement, telecommunication security}, isbn = {0-7695-1543-6}, doi = {10.1109/SECPRI.2002.1004362}, author = {Sherwood,R. and Bhattacharjee, Bobby and Srinivasan, Aravind} } @article {14163, title = {A Parallel Block Multi-level Preconditioner for the 3D Incompressible Navier--Stokes Equations}, volume = {UMIACS-TR-2002-95}, year = {2002}, month = {2002/10/25/}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {The development of robust and efficient algorithms for both steady-statesimulations and fully-implicit time integration of the Navier--Stokes equations is an active research topic. To be effective, the linear subproblems generated by these methods require solution techniques that exhibit robust and rapid convergence. In particular, they should be insensitive to parameters in the problem such as mesh size, time step, and Reynolds number. In this context, we explore a parallel preconditioner based on a block factorization of the coefficient matrix generated in an Oseen nonlinear iteration for the primitive variable formulation of the system. The key to this preconditioner is the approximation of a certain Schur complement operator by a technique first proposed by Kay, Loghin, and Wathen [25] and Silvester, Elman, Kay, and Wathen [45]. The resulting operator entails subsidiary computations (solutions of pressure Poisson and convection--diffusion subproblems) that are similar to those required for decoupled solution methods; however, in this case these solutions are applied as preconditioners to the coupled Oseen system. One important aspect of this approach is that the convection--diffusion and Poisson subproblems are significantly easier to solve than the entire coupled system, and a solver can be built using tools developed for the subproblems. In this paper, we apply smoothed aggregation algebraic multigrid to both subproblems. Previous work has focused on demonstrating the optimality of these preconditioners with respect to mesh size on serial, two-dimensional, steady-state computations employing geometric multi-grid methods; we focus on extending these methods to large-scale, parallel, three-dimensional, transient and steady-state simulations employing algebraic multigrid (AMG) methods. Our results display nearly optimal convergence rates for steady-state solutions as well as for transient solutions over a wide range of CFL numbers on the two-dimensional and three-dimensional lid-driven cavity problem. Also UMIACS-TR-2002-95 }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu//handle/1903/1239}, author = {Elman, Howard and Howle, V. E and Shadid,John and Tuminaro,Ray} } @article {15540, title = {Partitioning planar graphs with costs and weights}, journal = {4th International Workshop on Algorithm Engineering and Experiments}, volume = {2409}, year = {2002}, month = {2002///}, pages = {98 - 110}, abstract = {A graph separator is a set of vertices or edges whose removal divides an input graph into components of bounded size. This paper describes new algorithms for computing separators in planar graphs as well as techniques that can be used to speed up their implementation and improve the partition quality. In particular, we consider planar graphs with costs and weights on the vertices, where weights are used to estimate the sizes of the components and costs are used to estimate the size of the separator. We show that one can find a small separator that divides the graph into components of bounded size. We describe implementations of the partitioning algorithms and discuss results of our experiments.}, author = {Mount, Dave and Stein,C.} } @conference {18683, title = {Passive replication schemes in AQuA}, year = {2002}, month = {2002/12//}, pages = {125 - 130}, abstract = {Building large-scale distributed object-oriented systems that provide multidimensional quality of service (QoS) in terms of fault tolerance, scalability, and performance is challenging. In order to meet this challenge, we need an architecture that can ensure that applications{\textquoteright} requirements can be met while providing reusable technologies and software solutions. This paper describes techniques, based on the AQuA architecture, that enhance the applications{\textquoteright} dependability and scalability by introducing two types of group members and a novel passive replication scheme. In addition, we describe how to make the management structure itself dependable by using the passive replication scheme. Finally, we provide performance measurements for the passive replication scheme.}, keywords = {AQuA architecture, distributed object management, Fault tolerance, group members, large-scale distributed object-oriented systems, management structure, multidimensional quality of service, passive replication scheme, performance measurements, reusable technologies, scalability, software fault tolerance, software performance evaluation, software reusability, software solutions}, doi = {10.1109/PRDC.2002.1185628}, author = {Ren,Yansong and Rubel,P. and Seri,M. and Michel Cukier and Sanders,W. H. and Courtney,T.} } @article {14137, title = {Performance and analysis of saddle point preconditioners for the discrete steady-state Navier-Stokes equations}, journal = {Numerische Mathematik}, volume = {90}, year = {2002}, month = {2002///}, pages = {665 - 688}, author = {Elman, Howard and Silvester, D. J and Wathen, A. J} } @conference {18684, title = {Performance evaluation of a probabilistic replica selection algorithm}, year = {2002}, month = {2002///}, pages = {119 - 127}, abstract = {When executing time-sensitive distributed applications, a middleware that provides dependability and timeliness is faced with the important problem of preventing timing failures both under normal conditions and when the quality of service is degraded due to replica failures and transient overload on the server. To address this problem, we have designed a probabilistic model-based replica selection algorithm that allows a middleware to choose a set of replicas to service a client based on their ability to meet a client{\textquoteright}s timeliness requirements. This selection is done based on the prediction made by a probabilistic model that uses the performance history of replicas as inputs. In this paper, we describe the experiments we have conducted to evaluate the ability of this dynamic selection algorithm to meet a client{\textquoteright}s timing requirements, and compare it with that of a static and round-robin selection scheme under different scenarios}, keywords = {client-server systems, Dependability, distributed object management, dynamic selection algorithm, Middleware, probabilistic model, probabilistic model-based replica selection algorithm, probability, quality of service, real-time systems, replica failures, round-robin selection scheme, static scheme, time-sensitive distributed applications, timeliness, timing failures, transient overload}, doi = {10.1109/WORDS.2002.1000044}, author = {Krishnamurthy, S. and Sanders,W. H. and Michel Cukier} } @conference {18685, title = {Performance evaluation of a QoS-aware framework for providing tunable consistency and timeliness}, year = {2002}, month = {2002///}, pages = {214 - 223}, abstract = {Strong replica consistency models ensure that the data delivered by a replica always includes the latest updates, although this may result in poor response times. On the other hand, weak replica consistency models provide quicker access to information, but do not usually provide guarantees about the degree of staleness in the data they deliver. In order to support emerging distributed applications that are characterized by high concurrency demands, an increasing shift towards dynamic content, and timely delivery, we need quality of service models that allow us to explore the intermediate space between these two extreme approaches to replica consistency. Further, for better support of time-sensitive applications that can tolerate relaxed consistency in exchange for better responsiveness, we need to understand how the desired level of consistency affects the timeliness of a response. The QoS model we have developed to realize these objectives considers both timeliness and consistency, and treats consistency along two dimensions: order and staleness. We evaluate experimentally the framework we have developed to study the timeliness/consistency tradeoffs for replicated services and present experimental results that compare these tradeoffs in the context of sequential and FIFO ordering.}, keywords = {client-server systems, Computer networks, CORBA-based middleware, distributed applications, distributed object management, Network servers, QoS, quality of service, replica consistency, replicated services, server replicas, timeliness}, doi = {10.1109/IWQoS.2002.1006589}, author = {Krishnamurthy, S. and Sanders,W. H. and Michel Cukier} } @conference {17886, title = {Persistent caching in a multiple query optimization framework}, booktitle = {Proceedings of the 6th Workshop on Languages, Compilers, and Run-Time Systems for Scalable Computers}, year = {2002}, month = {2002///}, abstract = {This paper focuses on persistent caching in multi-client en-vironments, which aims to improve the performance of a data server by caching on disk query results that can be expensive to produce. We present and evaluate extensions to an existing multi-query optimization framework, called MQO, to incorporate persistent caching capabilities. }, author = {Andrade,H. and Kurc, T. and Catalyurek,U. and Sussman, Alan and Saltz, J.} } @article {15399, title = {Perturbation technique for LLG dynamics in uniformly magnetized bodies subject to RF fields}, journal = {Magnetics, IEEE Transactions on}, volume = {38}, year = {2002}, month = {2002/09//}, pages = {2403 - 2405}, abstract = {The problem of magnetization dynamics of a uniformly magnetized uniaxial particle or film, under elliptically polarized applied field, is considered. In the special case of circularly polarized applied field and particles (films) with a symmetry axis, pure time-harmonic magnetization modes exist that can be computed analytically. Deviations from these highly symmetric conditions are treated as perturbation of the symmetric case. The perturbation technique leads to the exactly solvable system of linear differential equations for the perturbations which enables one to compute higher order magnetization harmonic. The analytical solutions are obtained and then compared with numerical results.}, keywords = {analytical, anisotropy, anisotropy;, applied, bodies;, circularly, component;, constant-in-time, constant;, damping, demagnetisation;, demagnetizing, differential, dynamics;, effective, elliptically, equation;, equations;, exactly, factors;, field;, film;, films;, Frequency, gyromagnetic, harmonic;, higher, Landau-Lifshitz-Gilbert, large, linear, magnetic, magnetisation;, magnetization, magnetization;, magnetized, modes;, MOTION, order, partial, particle;, particles;, perturbation, polarized, radio, ratio;, RF, saturation, solution;, solvable, system;, technique;, techniques;, thin, time-harmonic, uniaxial, uniformly}, isbn = {0018-9464}, doi = {10.1109/TMAG.2002.803596}, author = {Bertotti,G. and Mayergoyz, Issak D and Serpico,C.} } @article {16148, title = {A photo history of SIGCHI: evolution of design from personal to public}, journal = {interactions}, volume = {9}, year = {2002}, month = {2002/05//}, pages = {17 - 23}, abstract = {For 20 years I have been photographing personalities and events in the emerging discipline of human--computer interaction. Until now, only a few of these photos were published in newsletters or were shown to visitors who sought them out. Now this photo history is going from a personal record to a public archive. This archive should be interesting for professional members of this community who want to reminisce, as well as for historians and journalists who want to understand what happened. Students and Web surfers may also want to look at the people who created better interfaces and more satisfying user experiences.}, isbn = {1072-5520}, doi = {10.1145/506671.506682}, url = {http://doi.acm.org/10.1145/506671.506682}, author = {Shneiderman, Ben and Kang,Hyunmo and Kules,Bill and Plaisant, Catherine and Rose,Anne and Rucheir,Richesh} } @conference {13906, title = {Physical Programming: Designing Tools for Children to Create Physical Interactive}, booktitle = {Proceedings: SIGCHI}, year = {2002}, month = {2002///}, author = {Montemayor,J. and Druin, Allison and Farber,A. and Simms,S. and Churaman,W.} } @article {16560, title = {Predicting nearest agent distances in artificial worlds}, journal = {Artificial life}, volume = {8}, year = {2002}, month = {2002///}, pages = {247 - 264}, author = {Schulz,R. and Reggia, James A.} } @article {17815, title = {Presentation planning for distributed VoD systems}, journal = {Knowledge and Data Engineering, IEEE Transactions on}, volume = {14}, year = {2002}, month = {2002/10//sep}, pages = {1059 - 1077}, abstract = {A distributed video-on-demand (VoD) system is one where a collection of video data is located at dispersed sites across a computer network. In a single site environment, a local video server retrieves video data from its local storage device. However, in distributed VoD systems, when a customer requests a movie from the local server, the server may need to interact with other servers located across the network. In this paper, we present different types of presentation plans that a local server can construct in order to satisfy a customer request. Informally speaking, a presentation plan is a temporally synchronized sequence of steps that the local server must perform in order to present the requested movie to the customer. This involves obtaining commitments from other video servers, obtaining commitments from the network service provider, as well as making commitments of local resources, while keeping within the limitations of available bandwidth, available buffer, and customer data consumption rates. Furthermore, in order to evaluate the quality of a presentation plan, we introduce two measures of optimality for presentation plans: minimizing wait time for a customer and minimizing access bandwidth which, informally speaking, specifies how much network/disk bandwidth is used. We develop algorithms to compute three different optimal presentation plans that work at a block level, or at a segment level, or with a hybrid mix of the two, and compare their performance through simulation experiments. We have also mathematically proven effects of increased buffer or bandwidth and data replications for presentation plans which had previously been verified experimentally in the literature.}, keywords = {Computer, computing;, databases;, demand;, distributed, local, multimedia, network;, on, optimal, plan;, plans;, presentation, presentation;, server;, servers;, video, video-on-demand;, VoD;}, isbn = {1041-4347}, doi = {10.1109/TKDE.2002.1033774}, author = {Hwang,Eenjun and Prabhakaran,B. and V.S. Subrahmanian} } @article {11914, title = {A Probabilistic Clustering-Based Indoor Location Determination System}, journal = {Technical Reports from UMIACS, UMIACS-TR-2002-30}, year = {2002}, month = {2002/04/04/}, abstract = {We present an indoor location determination system based on signalstrength probability distributions for tackling the noisy wireless channel and clustering to reduce computation requirements. We provide two implementation techniques, namely, Joint Clustering and Incremental Triangulation and describe their tradeoffs in terms of location determination accuracy and computation requirement. Both techniques have been incorporated in two implemented context-aware systems: User Positioning System and the Rover System, both running on Compaq iPAQ Pocket PC{\textquoteright}s with Familiar distribution of Linux for PDA{\textquoteright}s. The results obtained show that both techniques give the user location with over 90\% accuracy to within 7 feet with very low computation requirements, hence enabling a set of context-aware applications. Also UMIACS-TR-2002-30 }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/1192}, author = {Youssef,Moustafa A and Agrawala, Ashok K. and A. Udaya Shankar and Noh,Sam H} } @inbook {12755, title = {Probabilistic Human Recognition from Video}, booktitle = {Computer Vision {\textemdash} ECCV 2002Computer Vision {\textemdash} ECCV 2002}, series = {Lecture Notes in Computer Science}, volume = {2352}, year = {2002}, month = {2002///}, pages = {173 - 183}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {This paper presents a method for incorporating temporal information in a video sequence for the task of human recognition. A time series state space model, parameterized by a tracking state vector and a recognizing identity variable , is proposed to simultaneously characterize the kinematics and identity. Two sequential importance sampling (SIS) methods, a brute-force version and an efficient version, are developed to provide numerical solutions to the model. The joint distribution of both state vector and identity variable is estimated at each time instant and then propagated to the next time instant. Marginalization over the state vector yields a robust estimate of the posterior distribution of the identity variable. Due to the propagation of identity and kinematics, a degeneracy in posterior probability of the identity variable is achieved to give improved recognition. This evolving behavior is characterized using changes in entropy . The effectiveness of this approach is illustrated using experimental results on low resolution face data and upper body data.}, isbn = {978-3-540-43746-8}, url = {http://dx.doi.org/10.1007/3-540-47977-5_45}, author = {Zhou,Shaohua and Chellapa, Rama}, editor = {Heyden,Anders and Sparr,Gunnar and Nielsen,Mads and Johansen,Peter} } @conference {18635, title = {Probabilistic validation of intrusion tolerance}, year = {2002}, month = {2002///}, pages = {78 - 79}, url = {https://www.perform.csl.illinois.edu/Papers/USAN_papers/02SAN02.pdf}, author = {Sanders,W. H. and Michel Cukier and Webber,F. and Pal,P. and Watro,R.} } @article {17865, title = {Processing large-scale multi-dimensional data in parallel and distributed environments}, journal = {Parallel Computing}, volume = {28}, year = {2002}, month = {2002/05//}, pages = {827 - 859}, abstract = {Analysis of data is an important step in understanding and solving a scientific problem. Analysis involves extracting the data of interest from all the available raw data in a dataset and processing it into a data product. However, in many areas of science and engineering, a scientist{\textquoteright}s ability to analyze information is increasingly becoming hindered by dataset sizes. The vast amount of data in scientific datasets makes it a difficult task to efficiently access the data of interest, and manage potentially heterogeneous system resources to process the data. Subsetting and aggregation are common operations executed in a wide range of data-intensive applications. We argue that common runtime and programming support can be developed for applications that query and manipulate large datasets. This paper presents a compendium of frameworks and methods we have developed to support efficient execution of subsetting and aggregation operations in applications that query and manipulate large, multi-dimensional datasets in parallel and distributed computing environments.}, keywords = {Data-intensive applications, Distributed computing, Multi-dimensional datasets, PARALLEL PROCESSING, Runtime systems}, isbn = {0167-8191}, doi = {10.1016/S0167-8191(02)00097-2}, url = {http://www.sciencedirect.com/science/article/pii/S0167819102000972}, author = {Beynon,Michael and Chang,Chialin and Catalyurek,Umit and Kurc,Tahsin and Sussman, Alan and Andrade,Henrique and Ferreira,Renato and Saltz,Joel} } @article {17330, title = {Promoting universal usability with multi-layer interface design}, journal = {ACM SIGCAPH Computers and the Physically Handicapped}, year = {2002}, month = {2002/06//}, pages = {1 - 8}, abstract = {Increased interest in universal usability is causing some researchers to study advanced strategies for satisfying first-time as well as intermittent and expert users. This paper promotes the idea of multi-layer interface designs that enable first-time and novice users to begin with a limited set of features at layer 1. They can remain at layer 1, then move up to higher layers when needed or when they have time to learn further features. The arguments for and against multi-layer interfaces are presented with two example systems: a word processor with 8 layers and an interactive map with 3 layers. New research methods and directions are proposed.}, keywords = {first-time user, Graphical user interfaces, multi-layer interface, novice user, online help, universal usability}, isbn = {0163-5727}, doi = {10.1145/960201.957206}, url = {http://doi.acm.org/10.1145/960201.957206}, author = {Shneiderman, Ben} } @article {12957, title = {Purification and properties of the extracellular lipase, LipA, of Acinetobacter sp. RAG-1}, journal = {European Journal of Biochemistry}, volume = {269}, year = {2002}, month = {2002/12/01/}, pages = {5771 - 5779}, abstract = {An extracellular lipase, LipA, extracted from Acinetobacter sp. RAG-1 grown on hexadecane was purified and properties of the enzyme investigated. The enzyme is released into the growth medium during the transition to stationary phase. The lipase was harvested from cells grown to stationary phase, and purified with 22\% yield and > 10-fold purification. The protein demonstrates little affinity for anion exchange resins, with contaminating proteins removed by passing crude supernatants over a Mono Q column. The lipase was bound to a butyl Sepharose column and eluted in a Triton~X-100 gradient. The molecular mass (33~kDa) was determined employing SDS/PAGE. LipA was found to be stable at pH~5.8{\textendash}9.0, with optimal activity at 9.0. The lipase remained active at temperatures up to 70~{\textdegree}C, with maximal activity observed at 55~{\textdegree}C. LipA is active against a wide range of fatty acid esters of p-nitrophenyl, but preferentially attacks medium length acyl chains (C6, C8). The enzyme demonstrates hydrolytic activity in emulsions of both medium and long chain triglycerides, as demonstrated by zymogram analysis. RAG-1 lipase is stabilized by Ca2+, with no loss in activity observed in preparations containing the cation, compared to a 70\% loss over 30~h without Ca2+. The lipase is strongly inhibited by EDTA, Hg2+, and Cu2+, but shows no loss in activity after incubation with other metals or inhibitors examined in this study. The protein retains more than 75\% of its initial activity after exposure to organic solvents, but is rapidly deactivated by pyridine. RAG-1 lipase offers potential for use as a biocatalyst.}, keywords = {Acinetobacter sp. RAG-1, LipA, lipase, protein purification, zymogram}, isbn = {1432-1033}, doi = {10.1046/j.1432-1033.2002.03235.x}, url = {http://onlinelibrary.wiley.com/doi/10.1046/j.1432-1033.2002.03235.x/full}, author = {Snellman,Erick A. and Sullivan,Elise R. and Rita R Colwell} } @conference {18690, title = {Quantifying the cost of providing intrusion tolerance in group communication systems}, year = {2002}, month = {2002///}, pages = {229 - 238}, abstract = {Group communication systems that provide consistent group membership and reliable, ordered multicast properties in the presence of faults resulting from malicious intrusions have not been analyzed extensively to quantify the cost of tolerating these intrusions. This paper attempts to quantify this cost by presenting results from an experimental evaluation of three new intrusion-tolerant microprotocols that have been added to an existing crash-fault-tolerant group communication system. The results are analyzed to identify the parts that contribute the most overhead during provision of intrusion tolerance at the group communication system level.}, keywords = {consistent group membership, crash-fault-tolerant group communication system, cryptography, finite state machines, groupware, intrusion-tolerant microprotocols, malicious intrusions, multicast communication, reliable ordered multicast properties, security of data, Transport protocols}, doi = {10.1109/DSN.2002.1028904}, author = {Ramasamy,H. V. and Pandey,P. and Lyons,J. and Michel Cukier and Sanders,W. H.} } @conference {12310, title = {Query routing in the TerraDir distributed directory}, booktitle = {Proceedings of the SPIE ITCOM}, volume = {4868}, year = {2002}, month = {2002///}, pages = {299 - 309}, abstract = {We present the design and evaluation of the query-routing protocol of the TerraDir distributed directory.TerraDir is a wide-area distributed directory designed for hierarchical namespaces, and provides a lookup service for mapping keys to objects. We introduce distributed lookup and caching algorithms that leverage the underlying data hierarchy. Our algorithms provide efficient lookups while avoiding the load imbalances often associated with hierarchical systems. The TerraDir load balancing scheme also incorporates a node replication algorithm that provides configurable failure resilience with provably low overheads. }, author = {Silaghi,B. and Bhattacharjee, Bobby and Keleher,P.} } @book {14636, title = {RECOMB {\textquoteright}02: Proceedings of the sixth annual international conference on Computational biology}, year = {2002}, month = {2002///}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {The papers in this volume were presented at the Sixth Annual International Conference on Computational Biology RECOMB 2002, held in Washington, D.C. on April 18-21, 2002. The RECOMB series was started in 1997 by Sorin Istrail, Pavel Pevzner and Michael Waterman. RECOMB {\textquoteright}99 took place in Lyon, France, RECOMB 2000 was held in Tokyo, Japan, and RECOMB 2001 was held in Montreal, Quebec, Canada.This year{\textquoteright}s call for papers gave rise to 118 submissions, out of which the program committee selected 35 papers to be presented at the conference and included in the proceedings. Each submission was refereed by at least three members of the program committee. After the completion of the referees{\textquoteright} reports, an extensive web-based discussion took place.RECOMB 2002 had 8 invited speakers: Ruben Abagyan (The Scripps Research Institute), Ali H. Brivanlou (Rockefeller University), Evan Eichler (Case Western Reserve University), Harold "Skip" Garner (University of Texas Southwestern Medical Center at Dallas), David Ho (Rockefeller University), Gerry Rubin (Howard Hughes Medical Institute), J. Craig Venter (Celera) and Marc Vidal (Dana-Farber Cancer Institute). The Stanislaw Ulam Memorial Lecture was given by J. Craig Venter. The Distinguished Biology Lecture was given by David Ho. The Distinguished New Technologies Lecture was given by Harold Garner.Complete final versions of many of the papers presented in the conference will appear in a special issue of the Journal of Computational Biology, which is closely affiliated with the conference.}, isbn = {1-58113-498-3}, editor = {Myers,Gene and Hannenhalli, Sridhar and Sankoff,David and Istrail,Sorin and Pevzner,Pavel and Waterman,Michael} } @conference {16910, title = {Remote access to large spatial databases}, booktitle = {Proceedings of the 10th ACM international symposium on Advances in geographic information systems}, series = {GIS {\textquoteright}02}, year = {2002}, month = {2002///}, pages = {5 - 10}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Enterprises in the public and private sectors have been making their large spatial data archives available over the Internet. However, interactive work with such large volumes of online spatial data is a challenging task. We propose two efficient approaches to remote access to large spatial data. First, we introduce a client-server architecture where the work is distributed between the server and the individual clients for spatial query evaluation, data visualization, and data management. We enable the minimization of the requirements for system resources on the client side while maximizing system responsiveness as well as the number of connections one server can handle concurrently. Second, for prolonged periods of access to large online data, we introduce APPOINT (an Approach for Peer-to-Peer Offloading the INTernet). This is a centralized peer-to-peer approach that helps Internet users transfer large volumes of online data efficiently. In APPOINT, active clients of the client-server architecture act on the server{\textquoteright}s behalf and communicate with each other to decrease network latency, improve service bandwidth, and resolve server congestions.}, keywords = {client/server, GIS, Internet, peer-to-peer}, isbn = {1-58113-591-2}, doi = {10.1145/585147.585150}, url = {http://doi.acm.org/10.1145/585147.585150}, author = {Tanin,Egemen and Brabec,Franti{\v s}ek and Samet, Hanan} } @conference {16912, title = {Remote thin-client access to spatial database systems}, booktitle = {Proceedings of the 2002 annual national conference on Digital government research}, series = {dg.o {\textquoteright}02}, year = {2002}, month = {2002///}, pages = {1 - 8}, publisher = {Digital Government Society of North America}, organization = {Digital Government Society of North America}, abstract = {Numerous federal agencies produce official statistics that are made accessible to ordinary citizens for searching and data retrieval. This is often done via the Internet through a web browser interface. If this data is presented in textual format, it can often be searched and retrieved by such attributes as topic, responsible agency, keywords, or press release. However, if the data is of spatial nature, e.g., in the form of a map, then using text-based queries is often too cumbersome for the intended audience. We propose to use the capabilities of the SAND Spatial Browser to provide more power to users of these databases. Using the SAND Spatial Browser allows users to define the spatial region of interest with greater specificity, instead of forcing them to retrieve data just for a particular location or a region with a predefined boundary. They can also make use of ranking which is the ability to retrieve data in the order of distance from other instances of the data or aggregates of data that are user-defined. Work is distributed between the SAND server and the individual clients for query evaluation, data visualization and data management. This enables the minimization of the necessary requirements for system resources on the client side while maximizing the number of connections one server can handle concurrently. Concrete experience with interfacing the SAND system with FedStats data is also discussed.}, url = {http://dl.acm.org/citation.cfm?id=1123098.1123170}, author = {Samet, Hanan and Brabec,Franti{\v s}ek} } @conference {17859, title = {Scheduling multiple data visualization query workloads on a shared memory machine}, booktitle = {Parallel and Distributed Processing Symposium., Proceedings International, IPDPS 2002, Abstracts and CD-ROM}, year = {2002}, month = {2002///}, pages = {11 - 18}, publisher = {IEEE}, organization = {IEEE}, abstract = {Query scheduling plays an important role when systems are faced with limited resources and high workloads. It becomes even more relevant for servers applying multiple query optimization techniques to batches of queries, in which portions of datasets as well as intermediate results are maintained in memory to speed up query evaluation. We present a dynamic query scheduling model based on a priority queue implementation using a directed graph and a strategy for ranking queries. We examine the relative performance of several ranking strategies on a shared-memory machine using two different versions of an application, called the Virtual Microscope, for browsing digitized microscopy images}, keywords = {Atomic force microscopy, Biomedical informatics, Computer science, Data analysis, data visualisation, Data visualization, datasets, deductive databases, digitized microscopy image browsing, directed graph, directed graphs, dynamic query scheduling model, Educational institutions, high workloads, image database, limited resources, multiple data visualization query workloads, multiple query optimization, performance, priority queue, Processor scheduling, Query processing, query ranking, Relational databases, scheduling, shared memory machine, shared memory systems, Virtual Microscope, visual databases}, isbn = {0-7695-1573-8}, doi = {10.1109/IPDPS.2002.1015482}, author = {Andrade,H. and Kurc, T. and Sussman, Alan and Saltz, J.} } @conference {14654, title = {A secure PLAN (extended version)}, booktitle = {DARPA Active NEtworks Conference and Exposition, 2002. Proceedings}, year = {2002}, month = {2002///}, pages = {224 - 237}, publisher = {IEEE}, organization = {IEEE}, abstract = {Active networks promise greater flexibility than current networks, but threaten safety and security by virtue of their programmability. We describe the design and implementation of a security architecture for the active network PLANet (Hicks et al., 1999). Security is obtained with a two-level architecture that combines a functionally restricted packet language, PLAN (Hicks et al., 1998), with an environment of general-purpose service routines governed by trust management (Blaze et al., 1996). In particular, we employ a technique which expands or contracts a packet{\textquoteright}s service environment based on its level of privilege, termed namespace-based security. As an application of our security architecture, we present the design and implementation of an active-network firewall. We find that the addition of the firewall imposes an approximately 34\% latency overhead and as little as a 6.7\% space overhead to incoming packets}, keywords = {active internetwork, active networks, active-network firewall, Authentication, authorisation, Authorization, Cities and towns, Computer networks, Computer science, cryptography, functionally restricted packet language, general-purpose service routines, Information security, internetworking, IP networks, latency overhead, namespace-based security, PLAN, PLANet, Planets, programmability, Safety, security architecture, telecommunication security, trust management, two-level architecture, Web and internet services}, isbn = {0-7695-1564-9}, doi = {10.1109/DANCE.2002.1003496}, author = {Hicks, Michael W. and Keromytis,A. D and Smith,J. M} } @conference {14779, title = {SIGMA: A Simulator Infrastructure to Guide Memory Analysis}, booktitle = {SC Conference}, year = {2002}, month = {2002///}, pages = {1 - 1}, publisher = {IEEE Computer Society}, organization = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, abstract = {In this paper we present SIGMA (Simulation Infrastructure to Guide Memory Analysis), a new data collection framework and family of cache analysis tools. The SIGMA environment provides detailed cache information by gathering memory reference data using software-based instrumentation. This infrastructure can facilitate quick probing into the factors that influence the performance of an application by highlighting bottleneck scenarios including: excessive cache/TLB misses and inefficient data layouts. The tool can also assist in perturbation analysis to determine performance variations caused by changes to architecture or program. Our validation tests using the SPEC Swim benchmark show that most of the performance metrics obtained with SIGMA are within 1\% of the metrics obtained with hardware performance counters, with the advantage that SIGMA provides performance data on a data structure level, as specified by the programmer.}, doi = {http://doi.ieeecomputersociety.org/10.1109/SC.2002.10055}, author = {DeRose,Luiz and Ekanadham, K. and Hollingsworth, Jeffrey K and Sbaraglia, Simone} } @article {16908, title = {Speeding up construction of PMR quadtree-based spatial indexes}, journal = {The VLDB Journal}, volume = {11}, year = {2002}, month = {2002/10//}, pages = {109 - 137}, abstract = {Spatial indexes, such as those based on the quadtree, are important in spatial databases for efficient execution of queries involving spatial constraints, especially when the queries involve spatial joins. In this paper we present a number of techniques for speeding up the construction of quadtree-based spatial indexes, specifically the PMR quadtree, which can index arbitrary spatial data. We assume a quadtree implementation using the {\textquotedblleft}linear quadtree{\textquotedblright}, a disk-resident representation that stores objects contained in the leaf nodes of the quadtree in a linear index (e.g., a B-tree) ordered based on a space-filling curve. We present two complementary techniques: an improved insertion algorithm and a bulk-loading method. The bulk-loading method can be extended to handle bulk-insertions into an existing PMR quadtree. We make some analytical observations about the I/O cost and CPU cost of our PMR quadtree bulk-loading algorithm, and conduct an extensive empirical study of the techniques presented in the paper. Our techniques are found to yield significant speedup compared to traditional quadtree building methods, even when the size of a main memory buffer is very small compared to the size of the resulting quadtrees.}, keywords = {Bulk-loading, I/O, spatial indexing}, isbn = {1066-8888}, doi = {10.1007/s00778-002-0067-8}, url = {http://dx.doi.org/10.1007/s00778-002-0067-8}, author = {Hjaltason,Gisli R. and Samet, Hanan} } @conference {15897, title = {Supporting access to large digital oral history archives}, booktitle = {Proceedings of the 2nd ACM/IEEE-CS joint conference on Digital libraries}, series = {JCDL {\textquoteright}02}, year = {2002}, month = {2002///}, pages = {18 - 27}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {This paper describes our experience with the creation, indexing, and provision of access to a very large archive of videotaped oral histories - 116,000 hours of digitized interviews in 32 languages from 52,000 survivors, liberators, rescuers, and witnesses of the Nazi Holocaust. It goes on to identify a set of critical research issues that must be addressed if we are to provide full and detailed access to collections of this size: issues in user requirement studies, automatic speech recognition, automatic classification, segmentation, summarization, retrieval, and user interfaces. The paper ends by inviting others to discuss use of these materials in their own research.}, keywords = {cataloging, oral history, research agenda}, isbn = {1-58113-513-0}, doi = {10.1145/544220.544224}, url = {http://doi.acm.org/10.1145/544220.544224}, author = {Gustman,Samuel and Soergel,Dagobert and Oard, Douglas and Byrne,William and Picheny,Michael and Ramabhadran,Bhuvana and Greenberg,Douglas} } @article {17973, title = {System and method for entering text in a virtual environment}, volume = {:~09/364,433}, year = {2002}, month = {2002/06/18/}, abstract = {A system and method for entering text in a virtual environment by sensory gloves. The user enters a key that represents one or more letters by simulating a press of a keyboard in the gloves. The user calibrates the gloves by entering text, during which time the system establishes threshold values that represent simulated presses for each finger. After the initial calibration of the sensory gloves, the user enters text with simulated finger presses. The system distinguishes which movements are intended as simulated finger presses by examining the relative motions of fingers and maintaining dynamic thresholds. Errors are alleviated by providing feedback to the user, such as beeps and a visual display of the fingers and the current text. Because keys may represent more than one character, the system determines the intended text by probabilistic analysis and the Viterbi algorithm.}, url = {http://www.google.com/patents?id=w0QJAAAAEBAJ}, author = {Evans,Francine and Skiena,Steven and Varshney, Amitabh}, editor = {The Research Foundation of the State University of New York} } @conference {13474, title = {Three-dimensional visualization of hierarchical task network plans}, booktitle = {In Proceedings of the 3rd International NASA Workshop on Planning and Scheduling for}, year = {2002}, month = {2002///}, abstract = {Artificial Intelligence (AI) planning techniques, particularly hierarchical task network (HTN) planners, can produce very complex plans, with many sequential and parallel actions decomposed into multiple levels of abstraction.}, author = {Kundu,K. and Sessions,C. and desJardins, Marie and Rheingans,P.} } @article {12827, title = {Triggered message sequence charts}, journal = {ACM SIGSOFT Software Engineering Notes}, volume = {27}, year = {2002}, month = {2002/11/01/}, pages = {167 - 167}, isbn = {01635948}, doi = {10.1145/605466.605492}, url = {http://dl.acm.org/citation.cfm?id=605492}, author = {Sengupta,Bikram and Cleaveland, Rance} } @article {14101, title = {Trypanosoma cruzi: RNA structure and post-transcriptional control of tubulin gene expression}, journal = {Experimental Parasitology}, volume = {102}, year = {2002}, month = {2002/11//}, pages = {123 - 133}, abstract = {Changes in tubulin expression are among the biochemical and morphological adaptations that occur during the life cycle of Trypanosomatids. To investigate the mechanism responsible for the differential accumulation of tubulin mRNAs in Trypanosoma cruzi, we determine the sequences of [alpha]- and [beta]-tubulin transcripts and analyzed their expression during the life cycle of the parasite. Two [beta]-tubulin mRNAs of 1.9 and 2.3~kb were found to differ mainly by an additional 369 nucleotides at the end of the 3{\textquoteright} untranslated region (UTR). Although their transcription rates are similar in epimastigotes and amastigotes, [alpha]- and [beta]-tubulin transcripts are 3- to 6-fold more abundant in epimastigotes than in trypomastigotes and amastigotes. Accordingly, the half-lives of [alpha]- and [beta]-tubulin mRNAs are significantly higher in epimastigotes than in amastigotes. Transient transfection experiments indicated that positive regulatory elements occur in the 3{\textquoteright} UTR plus downstream intergenic region of the [alpha]-tubulin gene and that both positive and negative elements occur in the equivalent regions of the [beta]-tubulin gene.Index Descriptions and Abbreviations: Kinetoplastida; Trypanosoma cruzi; tubulin; gene regulation; PCR, polymerase chain reaction; UTR, untranslated region; IR, intergenic region; SL, spliced leader; BAC, bacterial artificial chromosome.}, isbn = {0014-4894}, doi = {16/S0014-4894(03)00034-1}, url = {http://www.sciencedirect.com/science/article/pii/S0014489403000341}, author = {Bartholomeu,Daniella C. and Silva,Rosiane A. and Galv{\~a}o,Lucia M. C. and El-Sayed, Najib M. and Donelson,John E. and Teixeira,Santuza M.R.} } @article {17451, title = {Understanding human reactivites and relationships: an excerpt from Leonardo{\textquoteright}s laptop}, journal = {interactions}, volume = {9}, year = {2002}, month = {2002/09//}, pages = {40 - 53}, abstract = {"These notes reveal the intimate tie in Leonardo{\textquoteright}s thinking between{\textellipsis} phenomena in general and the need to put such information to practical use."
--- A. Richard Turner, Inventing Leonardo, 1994, p 184}, isbn = {1072-5520}, doi = {10.1145/566981.566982}, url = {http://doi.acm.org/10.1145/566981.566982}, author = {Shneiderman, Ben} } @inbook {15826, title = {Understanding Machine Performance in the Context of Human Performance for Multi-document Summarization}, booktitle = {DUC 02 Conference ProceedingsDUC 02 Conference Proceedings}, year = {2002}, month = {2002///}, publisher = {U.S. National Inst. of Standards and Technology}, organization = {U.S. National Inst. of Standards and Technology}, abstract = {We present a discussion of our summarization algorithm -- both single and multi-document -- along with a discussion of the evaluation experiments we have undertaken, what we have learned from them, and how we intend to utilize this information.}, url = {http://duc.nist.gov/http://duc.nist.gov/}, author = {Schlesinger,J.D. and Okurowski,M. E. and Conroy,J.M. and O{\textquoteright}Leary, Dianne P. and Taylor,A. and Hobbs,J. and Wilson,H. T.} } @article {16789, title = {Using Hilbert curve in image storing and retrieving}, journal = {Information Systems}, volume = {27}, year = {2002}, month = {2002/12//}, pages = {523 - 536}, abstract = {In this paper, we propose a method to accelerate the speed of subset query on uncompressed images. First, we change the method to store images: the pixels of images are stored on the disk in the Hilbert order instead of row-wise order that is used in traditional methods. After studying the properties of the Hilbert curve, we give a new algorithm which greatly reduces the number of data segments in subset query range. Although, we have to retrieve more data than necessary, because the speed of sequential readings is much faster than the speed of random access readings, it takes about 10\% less elapsed time in our algorithm than in the traditional algorithms to execute the subset queries. In some systems, the saving is as much as 90\%.}, keywords = {Hilbert order, Row-wise order, Subset query}, isbn = {0306-4379}, doi = {16/S0306-4379(02)00019-4}, url = {http://www.sciencedirect.com/science/article/pii/S0306437902000194}, author = {Song,Zhexuan and Roussopoulos, Nick} } @article {13479, title = {Virtual Telescopes in Education}, journal = {Journal of Digital Information}, volume = {2}, year = {2002}, month = {2002///}, abstract = {Virtual Telescopes in Education is providing the services required to operate a virtual observatory comprising distributed telescopes, including an interactive, constraint-based scheduling service, data and resource archive, proposal preparation and review environment, and a VTIE Journal. A major goal of VTIE is to elicit from learners questions about the nature of celestial objects and the physical processes that give rise to the spectacular imagery that catches their imaginations. Generation of constrained science questions will assist learners in the science process. To achieve interoperability with other NSDL resources, our approach follows the Open Archives Initiative and the W3C Semantic Web activity.}, author = {Hoban,S. and desJardins, Marie and Farrell,N. and Rathod,P. and Sachs,J. and Sansare,S. and Yesha,Y. and Keating,J. and Busschots,B. and Means,J. and others} } @article {17492, title = {Visual queries for finding patterns in time series data}, journal = {University of Maryland, Computer Science Dept. Tech Report, CS-TR-4365}, year = {2002}, month = {2002///}, abstract = {Few tools exist for data exploration and pattern iden-tification in time series data sets. Timeboxes are rectan- gular, direct-manipulation queries for studying time-series datasets. Timeboxes are the primary query tool in our Time- Searcher application, which supports interactive explo- ration via dynamic queries, along with overviews of query results and drag-and-drop support for query-by-example. This paper describes the TimeSearcher application and pos- sible extensions to the timebox query model, along with a discussion of the use of TimeSearcher for exploring a time series data set involving gene expression profiles. }, author = {Hochheiser,H. and Shneiderman, Ben} } @article {12175, title = {A visual search tool for early elementary science students}, journal = {Journal of Science Education and Technology}, volume = {11}, year = {2002}, month = {2002///}, pages = {49 - 57}, author = {Revelle,G. and Druin, Allison and Platner,M. and Bederson, Benjamin B. and Hourcade,J. P and Sherman,L.} } @article {17670, title = {Wavelength rerouting in optical networks, or the Venetian Routing problem}, journal = {Journal of Algorithms}, volume = {45}, year = {2002}, month = {2002/11//}, pages = {93 - 125}, abstract = {Wavelength rerouting has been suggested as a viable and cost-effective method to improve the blocking performance of wavelength-routed wavelength-division multiplexing (WDM) networks. This method leads to the following combinatorial optimization problem, dubbed Venetian Routing. Given a directed multigraph G along with two vertices s and t and a collection of pairwise arc-disjoint paths, we wish to find an st-path which arc-intersects the smallest possible number of the given paths. In this paper we prove the computational hardness of this problem even in various special cases, and present several approximation algorithms for its solution. In particular we show a non-trivial connection between Venetian Routing and Label Cover.}, keywords = {Approximation algorithms, Label Cover, Optical networks, Shortest paths, Wavelength rerouting, Wavelength-division multiplexing}, isbn = {0196-6774}, doi = {10.1016/S0196-6774(02)00214-6}, url = {http://www.sciencedirect.com/science/article/pii/S0196677402002146}, author = {Caprara,Alberto and Italiano,Giuseppe F. and Mohan,G. and Panconesi,Alessandro and Srinivasan, Aravind} } @conference {18453, title = {What we have learned about fighting defects}, booktitle = {Software Metrics, 2002. Proceedings. Eighth IEEE Symposium on}, year = {2002}, month = {2002///}, pages = {249 - 258}, abstract = {The Center for Empirically Based Software Engineering helps improve software development by providing guidelines for selecting development techniques, recommending areas for further research, and supporting software engineering education. A central activity toward achieving this goal has been the running of "e- Workshops" that capture expert knowledge with a minimum of overhead effort to formulate heuristics on a particular topic. The resulting heuristics are a useful summary of the current state of knowledge in an area based on expert opinion. This paper discusses the results to date of a series of e-Workshops on software defect reduction. The original discussion items are presented along with an encapsulated summary of the expert discussion. The reformulated heuristics can be useful both to researchers (for pointing out gaps in the current state of the knowledge requiring further investigation) and to practitioners (for benchmarking or setting expectations about development practices).}, keywords = {based, Center, Computer, defect, development;, education;, electronic, Empiric, engineering, engineering;, eWorkshops;, for, heuristics;, reduction;, Science, software, workshops;}, doi = {10.1109/METRIC.2002.1011343}, author = {Shull, F. and Basili, Victor R. and Boehm,B. and Brown,A. W and Costa,P. and Lindvall,M. and Port,D. and Rus,I. and Tesoriero,R. and Zelkowitz, Marvin V} } @article {12087, title = {Your 802.11 network has no clothes}, journal = {IEEE Communications Magazine}, volume = {9}, year = {2002}, month = {2002///}, pages = {44 - 51}, author = {Mishra,A. and Shin,M. and Arbaugh, William A.} } @article {18650, title = {An adaptive algorithm for tolerating value faults and crash failures}, journal = {Parallel and Distributed Systems, IEEE Transactions on}, volume = {12}, year = {2001}, month = {2001/02//}, pages = {173 - 192}, abstract = {The AQuA architecture provides adaptive fault tolerance to CORBA applications by replicating objects and providing a high-level method that an application can use to specify its desired level of dependability. This paper presents the algorithms that AQUA uses, when an application{\textquoteright}s dependability requirements can change at runtime, to tolerate both value faults in applications and crash failures simultaneously. In particular, we provide an active replication communication scheme that maintains data consistency among replicas, detects crash failures, collates the messages generated by replicated objects, and delivers the result of each vote. We also present an adaptive majority voting algorithm that enables the correct ongoing vote while both the number of replicas and the majority size dynamically change. Together, these two algorithms form the basis of the mechanism for tolerating and recovering from value faults and crash failures in AQuA}, keywords = {active replication communication, adaptive algorithm, adaptive fault tolerance, adaptive majority voting algorithm, AQuA architecture, client-server systems, CORBA, crash failures, data consistency, data integrity, Dependability, distributed object management, fault tolerant computing, objects replication, value faults}, isbn = {1045-9219}, doi = {10.1109/71.910872}, author = {Ren,Yansong and Michel Cukier and Sanders,W. H.} } @article {17681, title = {Adjusting the Rayleigh Quotient in Semiorthogonal Lanczos Methods}, volume = {UMIACS-TR-2001-31}, year = {2001}, month = {2001/05/10/}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {In a semiorthogonal Lanczos algorithm, the orthogonality of theLanczos vectors is allowed to deteriorate to roughly the square root of the rounding unit, after which the current vectors are reorthogonalized. A theorem of Simon \cite{simo:84} shows that the Rayleigh quotient\,---\,i.e., the tridiagonal matrix produced by the Lanczos recursion\,---\,contains fully accurate approximations to the Ritz values in spite of the lack of orthogonality. Unfortunately, the same lack of orthogonality can cause the Ritz vectors to fail to converge. It also makes the classical estimate for the residual norm misleadingly small. In this note we show how to adjust the Rayleigh quotient to overcome this problem. (Cross-referenced as UMIACS-TR-2001-31) }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/1132}, author = {Stewart, G.W.} } @article {15596, title = {Approximating large convolutions in digital images}, journal = {Image Processing, IEEE Transactions on}, volume = {10}, year = {2001}, month = {2001/12//}, pages = {1826 - 1835}, abstract = {Computing discrete two-dimensional (2-D) convolutions is an important problem in image processing. In mathematical morphology, an important variant is that of computing binary convolutions, where the kernel of the convolution is a 0-1 valued function. This operation can be quite costly, especially when large kernels are involved. We present an algorithm for computing convolutions of this form, where the kernel of the binary convolution is derived from a convex polygon. Because the kernel is a geometric object, we allow the algorithm some flexibility in how it elects to digitize the convex kernel at each placement, as long as the digitization satisfies certain reasonable requirements. We say that such a convolution is valid. Given this flexibility we show that it is possible to compute binary convolutions more efficiently than would normally be possible for large kernels. Our main result is an algorithm which, given an m times;n image and a k-sided convex polygonal kernel K, computes a valid convolution in O(kmn) time. Unlike standard algorithms for computing correlations and convolutions, the running time is independent of the area or perimeter of K, and our techniques do not rely on computing fast Fourier transforms. Our algorithm is based on a novel use of Bresenham{\textquoteright}s (1965) line-drawing algorithm and prefix-sums to update the convolution incrementally as the kernel is moved from one position to another across the image}, keywords = {2D, algorithm;binary, approximation;mathematical, convolution, convolution;binary, convolutions;Bresenham{\textquoteright}s, convolutions;convex, convolutions;geometric, images;discrete, kernel;convex, kernel;digital, line-drawing, morphology;, morphology;approximation, object;image, polygonal, processing;large, processing;mathematical, theory;convolution;image, two-dimensional}, isbn = {1057-7149}, doi = {10.1109/83.974567}, author = {Mount, Dave and Kanungo,T. and Netanyahu,N. S and Piatko,C. and Silverman,R. and Wu,A. Y} } @article {15236, title = {Approximation algorithms for partial covering problems}, journal = {Automata, Languages and Programming}, year = {2001}, month = {2001///}, pages = {225 - 236}, abstract = {We study the generalization of covering problems to partial covering. Here we wish to cover only a desired number of elements, rather than covering all elements as in standard covering problems. For example, in k-set cover, we wish to choose a minimum number of sets to cover at least k elements. For k-set cover, if each element occurs in at most f sets, then we derive a primal-dual f-approximation algorithm (thus implying a 2-approximation for k-vertex cover) in polynomial time. In addition to its simplicity, this algorithm has the advantage of being parallelizable. For instances where each set has cardinality at most three, we obtain an approximation of 4/3. We also present better-than-2-approximation algorithms for k-vertex cover on bounded degree graphs, and for vertex cover on expanders of bounded average degree. We obtain a polynomial-time approximation scheme for k-vertex cover on planar graphs, and for covering points in R d by disks.}, doi = {10.1007/3-540-48224-5_19}, author = {Gandhi,R. and Khuller, Samir and Srinivasan, Aravind} } @conference {15353, title = {Assessment of the k-epsilon turbulence model for compressible flows using direct simulation data}, booktitle = {39th AIAA Aerospace Sciences Meeting and Exhibit}, year = {2001}, month = {2001///}, address = {Reno, NV}, abstract = {We evaluate the k-epsilon turbulence model using direct numerical simulation (DNS) data of a Mach 4 boundary layer. We find that the low Reynolds number damping functions for the Reynolds stress must be corrected by the density ratio to match the DNS data. We present the budget of the k equation and assess the modeling of the various source terms. The models for all the source terms, except for the production and dilatational dissipation terms, are found to be adequate. Finally, we present the solenoidal dissipation rate equation and compute its budget using the boundary layer data. We compare this equation with the dissipation rate equation in an incompressible flow to show the equivalence between the two equations. This is the basis for modeling the solenoidal dissipation equation. However, an additional term in the equation due to variation of fluid viscosity needs to be modeled.}, author = {Sinha,K. and Candler,G. V and Martin, M.P} } @conference {12823, title = {Automated Validation of Software Models}, booktitle = {Automated Software Engineering, International Conference on}, year = {2001}, month = {2001///}, pages = {91 - 91}, publisher = {IEEE Computer Society}, organization = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, abstract = {This paper describes the application of an automated verification tool to a software model developed at Ford. Ford already has in place an advanced model-based software development framework that employs the Matlab?, Simulink?, and Stateflow? modeling tools. During this project we applied the invariant checker Salsa to a Simulink?/ Stateflow? model of automotive software to check for nondeterminism, missing cases, dead code, and redundant code. During the analysis, a number of anomalies were detected that had not been found during manual review. We argue that the detection and correction of these problems demonstrates a cost-effective application of formal verification that elevates our level of confidence in the model.}, isbn = {0-7695-1426-X}, doi = {http://doi.ieeecomputersociety.org/10.1109/ASE.2001.989794}, author = {Sims,Steve and Cleaveland, Rance and Butts,Ken and Ranville,Scott} } @article {17691, title = {Backward Error Bounds for Approximate Krylov Subspaces}, volume = {UMIACS-TR-2001-32}, year = {2001}, month = {2001/05/10/}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {Let $A$ be a matrix of order $n$ and let $\clu\subset\comp^{n}$ be asubspace of dimension $k$. In this note we determine a matrix $E$ of minimal norm such that $\clu$ is a Krylov subspace of $A+E$. (Cross-referenced as UMIACS-TR-2001-32) }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/1133}, author = {Stewart, G.W.} } @book {16985, title = {Becoming a Scholar in the Digital Age}, year = {2001}, month = {2001///}, publisher = {National Research Council}, organization = {National Research Council}, keywords = {bibtex-import, digital-library, dlbook}, author = {Duderstadt,James and Arms,William and Messina,Paul and Ellisman,Mark and Atkins,Daniel and Fox,Edward and Shneiderman, Ben and Nissenbaum,Helen and Lederberg,Joshua} } @article {17568, title = {Better Approximation Guarantees for Job-Shop Scheduling}, journal = {SIAM Journal on Discrete Mathematics}, volume = {14}, year = {2001}, month = {2001///}, pages = {67 - 67}, abstract = {Job-shop scheduling is a classical NP-hard problem. Shmoys, Stein, and Wein presented the first polynomial-time approximation algorithm for this problem that has a good (polylogarithmic) approximation guarantee. We improve the approximation guarantee of their work and present further improvements for some important NP-hard special cases of this problem (e.g., in the preemptive case where machines can suspend work on operations and later resume). We also present NC algorithms with improved approximation guarantees for some NP-hard special cases.}, isbn = {08954801}, doi = {10.1137/S0895480199326104}, url = {http://link.aip.org/link/SJDMEC/v14/i1/p67/s1\&Agg=doi}, author = {Goldberg,Leslie Ann and Paterson,Mike and Srinivasan, Aravind and Sweedyk,Elizabeth} } @article {12123, title = {Building an Experience Base for Software Engineering: A report on the first CeBASE eWorkshop}, journal = {Product Focused Software Process Improvement}, year = {2001}, month = {2001///}, pages = {110 - 125}, abstract = {New information is obtained by research and disseminated by papers in conferences and journals. The synthesis of knowledge depends upon social discourse among the experts in a given domain to discuss the impact of this new information. Meetings among such experts are, however, expensive and time consuming. In this paper we discuss the organization of CeBASE, a center whose goal is the collection and dissemination of empirically-based software engineering knowledge, and the concept of the online workshop or eWorkshop as a way to use the Internet to minimize the needs of face-to-face meetings. We discuss the design of our eWorkshop and give the results of one eWorkshop that discussed the impact of defect reduction strategies.We want to thank Barry Boehm, Scott Henninger, Rayford Vaughn, Winsor Brown, Dan Port and Michael Frey as well as all participants for their contribution to the success of the eWorkshop. We also want to thank students at USC and UMD for their contribution in testing the system and Jennifer Dix for proof reading this paper. }, doi = {10.1007/3-540-44813-6_13}, author = {Basili, Victor R. and Tesoriero,R. and Costa,P. and Lindvall,M. and Rus,I. and Shull, F. and Zelkowitz, Marvin V} } @conference {17025, title = {Component-based, user-constructed, multiple-view visualization}, booktitle = {CHI {\textquoteright}01 extended abstracts on Human factors in computing systems}, series = {CHI EA {\textquoteright}01}, year = {2001}, month = {2001///}, pages = {201 - 202}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {A major hindrance to the usage of information visualization in common tasks is that typically a new visualization interface must be custom programmed to suit each task. This video demonstrates a system and user interface that attempts to solve this problem by enabling end users to construct their own multiple-view visualization interfaces that are appropriate for their tasks and data. Users accomplish this by snapping together component visualizations and specifying tight couplings between them. Then they can use their newly constructed visualization interfaces to perform their tasks.}, keywords = {Information Visualization, multiple views, software components, Specification, tight coupling, user interface}, isbn = {1-58113-340-5}, doi = {10.1145/634067.634188}, url = {http://doi.acm.org/10.1145/634067.634188}, author = {North,Chris and Shneiderman, Ben} } @article {16536, title = {Conditions enabling the emergence of inter-agent signalling in an artificial world}, journal = {Artificial Life}, volume = {7}, year = {2001}, month = {2001///}, pages = {3 - 32}, author = {Reggia, James A. and Schulz,R. and Wilkinson,G. S and Uriagereka,J.} } @conference {15455, title = {Coverage criteria for GUI testing}, booktitle = {Proceedings of the 8th European software engineering conference held jointly with 9th ACM SIGSOFT international symposium on Foundations of software engineering}, series = {ESEC/FSE-9}, year = {2001}, month = {2001///}, pages = {256 - 267}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {A widespread recognition of the usefulness of graphical user interfaces (GUIs) has established their importance as critical components of today{\textquoteright}s software. GUIs have characteristics different from traditional software, and conventional testing techniques do not directly apply to GUIs. This paper{\textquoteright}s focus is on coverage critieria for GUIs, important rules that provide an objective measure of test quality. We present new coverage criteria to help determine whether a GUI has been adequately tested. These coverage criteria use events and event sequences to specify a measure of test adequacy. Since the total number of permutations of event sequences in any non-trivial GUI is extremely large, the GUI{\textquoteright}s hierarchical structure is exploited to identify the important event sequences to be tested. A GUI is decomposed into GUI components, each of which is used as a basic unit of testing. A representation of a GUI component, called an event-flow graph, identifies the interaction of events within a component and intra-component criteria are used to evaluate the adequacy of tests on these events. The hierarchical relationship among components is represented by an integration tree, and inter-component coverage criteria are used to evaluate the adequacy of test sequences that cross components. Algorithms are given to construct event-flow graphs and an integration tree for a given GUI, and to evaluate the coverage of a given test suite with respect to the new coverage criteria. A case study illustrates the usefulness of the coverage report to guide further testing and an important correlation between event-based coverage of a GUI and statement coverage of its software{\textquoteright}s underlying code.}, keywords = {component testing, event-based coverage, event-flow graph, GUI test coverage, GUI testing, integration tree}, isbn = {1-58113-390-1}, doi = {10.1145/503209.503244}, url = {http://doi.acm.org/10.1145/503209.503244}, author = {Memon, Atif M. and Soffa,Mary Lou and Pollack,Martha E.} } @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} } @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.} } @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} } @conference {17588, title = {Efficient algorithms for location and sizing problems in network design}, booktitle = {IEEE Global Telecommunications Conference, 2001. GLOBECOM {\textquoteright}01}, volume = {4}, year = {2001}, month = {2001///}, pages = {2586-2590 vol.4 - 2586-2590 vol.4}, publisher = {IEEE}, organization = {IEEE}, abstract = {Large-scale location, sizing and homing problems of distributed network elements, have received much attention recently due to the massive deployment of broadband communication networks for services like Internet telephony and Web caching. Key considerations in designing these networks include modularity of capacity, economies of scale in cost, and reliability. We formulate a general class of such network design problems as Mixed-Integer Programs. These problems are computationally intractable in general; under various asymptotic conditions, we show how to compute near-optimal solutions. To deal with arbitrary instances, we develop new algorithms based on linear programming, as well as greedy randomized adaptive search. These algorithms achieved near-optimal solutions with reasonable computation time for our experiments}, keywords = {Algorithm design and analysis, Broadband communication, broadband communication networks, broadband networks, capacity modularity, Communication networks, computer network reliability, distributed network elements, Economies of scale, greedy randomized adaptive search, homing, integer programming, Intelligent networks, Internet telephony, large-scale location problems, Large-scale systems, Linear programming, mixed-integer programs, near-optimal solutions, network design, Optical switches, randomised algorithms, reliability, search problems, sizing, Technological innovation, telecommunication network planning, Web caching}, isbn = {0-7803-7206-9}, doi = {10.1109/GLOCOM.2001.966243}, author = {Kumaran,K. and Srinivasan, Aravind and Qiong Wang and Lanning,S. and Ramakrishnan,K. G} } @inbook {15072, title = {Efficient and Non-interactive Non-malleable Commitment}, booktitle = {Advances in Cryptology {\textemdash} EUROCRYPT 2001Advances in Cryptology {\textemdash} EUROCRYPT 2001}, series = {Lecture Notes in Computer Science}, volume = {2045}, year = {2001}, month = {2001///}, pages = {40 - 59}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {We present new constructions of non-malleable commitment schemes, in the public parameter model (where a trusted party makes parameters available to all parties), based on the discrete logarithm or RSA assumptions. The main features of our schemes are: they achieve near-optimal communication for arbitrarily-large messages and are non-interactive . Previous schemes either required (several rounds of) interaction or focused on achieving non-malleable commitment based on general assumptions and were thus efficient only when committing to a single bit. Although our main constructions are for the case of perfectly-hiding commitment, we also present a communication-efficient, non-interactive commitment scheme (based on general assumptions) that is perfectly binding.}, keywords = {Computer science}, isbn = {978-3-540-42070-5}, url = {http://www.springerlink.com/content/nhbj60a9da101w0r/abstract/}, author = {Di Crescenzo,Giovanni and Katz, Jonathan and Ostrovsky,Rafail and Smith,Adam}, editor = {Pfitzmann,Birgit} } @conference {17851, title = {An efficient system for multi-perspective imaging and volumetric shape analysis}, booktitle = {Proceedings of the 2001 Workshop on Parallel and Distributed Computing in Imaging Processing, Video Processing, and Multimedia}, year = {2001}, month = {2001///}, author = {Borovikov,E. and Sussman, Alan and Davis, Larry S.} } @article {17719, title = {On the eigensystems of graded matrices}, journal = {Numerische Mathematik}, volume = {90}, year = {2001}, month = {2001///}, pages = {349 - 370}, doi = {10.1007/s002110100290}, author = {Stewart, G.W.} } @article {16157, title = {Enabling Commuters to Find the Best Route: An Interface for Analyzing Driving History Logs}, journal = {Proceedings of the IFIP Conference on Human-Computer Interaction (Interact2001)}, year = {2001}, month = {2001///}, pages = {799 - 800}, abstract = {This paper describes a prototype interface design for an automobile driving history log. It allows drivers to choose the best route among several alternatives for their common trips. Recorded data includes time to complete the travel, fuel consumption, and number of stops.}, author = {Konishi,M. and Plaisant, Catherine and Shneiderman, Ben} } @article {12847, title = {Equivalence and preorder checking for finite-state systems}, journal = {Handbook of Process Algebra}, year = {2001}, month = {2001///}, pages = {391 - 424}, author = {Cleaveland, Rance and Sokolsky,O.} } @article {17116, title = {E-tables: Non-specialist use and understanding of statistical data}, journal = {SURFACE, the Syracuse University Research Facility And Collaborative Environment}, year = {2001}, month = {2001///}, pages = {33 - 33}, abstract = {This paper provides a progress report on a project that aims to understand how people think about and understand statistical data presented in tables. The focus is on people who are not statistical specialists. To this end, studies of various user populations were conducted, underlying data enrichment and explanation was investigated, and interactive user interface prototypes were developed and tested.}, author = {Marchionini,G. and Hert,C. and Shneiderman, Ben and Liddy,L.} } @conference {12120, title = {An experience management system for a software engineering research organization}, booktitle = {Software Engineering Workshop, 2001. Proceedings. 26th Annual NASA Goddard}, year = {2001}, month = {2001///}, pages = {29 - 35}, abstract = {Most businesses rely on the fact that their employees possess relevant knowledge and that they can apply it to the task at hand. The problem is that this knowledge is not owned by the organization. It is owned and controlled by its employees. Maintaining an appropriate level of knowledge in the organization is a very important issue. It is, however, not an easy task for most organizations, and it is particularly problematic for software organizations, which are human- and knowledge-intensive. Knowledge management is a relatively new area that has attempted to address these problems. This paper introduces an approach called the "knowledge dust-to-pearls" approach. This approach addresses some of the issues with knowledge management by providing low-barrier mechanisms to "jump start" the experience base. This approach allows the experience base to become more useful more quickly than traditional approaches. This paper describes the approach and gives an example of its use at the Fraunhofer Center for Experimental Software Engineering, Maryland, USA}, keywords = {and, approach;knowledge, base;experience, Center, control;knowledge, data, development, dust-to-pearls, engineering, Engineering;business, engineering;software, experimental, for, Fraunhofer, houses;, knowledge;employee, knowledge;experience, level, maintenance;knowledge, management, management;knowledge, management;software, mechanisms;software, organization;software, organizational, organizations;administrative, organizations;knowledge, organizations;low-barrier, ownership;knowledge-intensive, processing;personnel;research, research, software, system;human-intensive}, doi = {10.1109/SEW.2001.992652}, author = {Basili, Victor R. and Costa,P. and Lindvall,M. and Mendonca,M. and Seaman,C. and Tesoriero,R. and Zelkowitz, Marvin V} } @inbook {17594, title = {Experimental Analysis of Algorithms for Bilateral-Contract Clearing Mechanisms Arising in Deregulated Power Industry}, booktitle = {Algorithm EngineeringAlgorithm Engineering}, series = {Lecture Notes in Computer Science}, volume = {2141}, year = {2001}, month = {2001///}, pages = {172 - 184}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {We consider the bilateral contract satisfaction problem arising from electrical power networks due to the proposed deregulation of the electric utility industry in the USA. Given a network and a (multi)set of pairs of vertices (contracts) with associated demands, the goal is to find the maximum number of simultaneously satisfiable contracts. We study how four different algorithms perform in fairly realistic settings; we use an approximate electrical power network from Colorado. Our experiments show that three heuristics outperform a theoretically better algorithm. We also test the algorithms on four types of scenarios that are likely to occur in a deregulated marketplace. Our results show that the networks that are adequate in a regulated marketplace might be inadequate for satisfying all the bilateral contracts in a deregulated industry.}, isbn = {978-3-540-42500-7}, url = {http://dx.doi.org/10.1007/3-540-44688-5_14}, author = {Barrett,Chris and Cook,Doug and Hicks,Gregory and Faber,Vance and Marathe,Achla and Marathe,Madhav and Srinivasan, Aravind and Sussmann,Yoram and Thornquist,Heidi}, editor = {Brodal,Gerth and Frigioni,Daniele and Marchetti-Spaccamela,Alberto} } @article {17149, title = {Exploration of Large Online Data Tables Using Generalized Query Previews}, journal = {University of Maryland Computer Science Technical Report (June 2001)}, year = {2001}, month = {2001///}, abstract = {Companies, government agencies, and other organizations are making their data available to the world over the Internet. These organizations often store their data as large online relational database tables. Users query these databases with front-ends that mostly use menus or form fillin interfaces, but these interfaces rarely give users information about the contents and distribution of the data. This situation leads users to waste time and network resources posing queries that have zero-hit or mega-hit results. Generalized query previews form a user interface architecture for efficient browsing of large online databases by supplying data distribution information to the users. The data distribution information provides an overview of the data. Generalized query previews give continuous feedback about the size of the results as the query is being formed. This provides a preview of the results. This paper presents the generalized query previews user interface architecture and our experimental findings. Our user study shows that for exploratory querying tasks, generalized query previews speed user performance and reduce network load. Categories and Subject Descriptors: H.5.2 [Information Interfaces and Presentation]: User Interfaces - Graphical user interfaces (GUI), H.3.5 [Information Storage and Retrieval]: Online Information Services - Web-based services. General Terms: Design, Human Factors, Experimentation. Keywords: Visual Data Mining, Information Visualization, Graphical User Interfaces, Relational Databases, Database Querying, Online Databases, Dynamic Queries, Previews and Overviews.}, author = {Tanin,E. and Shneiderman, Ben} } @conference {12315, title = {Finding close friends on the Internet}, booktitle = {Network Protocols, 2001. Ninth International Conference on}, year = {2001}, month = {2001/11//}, pages = {301 - 309}, abstract = {We consider the problem of finding nearby application-peers (close friends) over the Internet. We focus on unicast-only solutions and introduce a new scheme -Beaconing-for finding peers that are near. Our scheme uses distance measurement points (called beacons) and can be implemented entirely in the application-layer without investing in large infrastructure changes. We present an extensive evaluation of Beaconing and compare it to existing schemes including Expanding Ring searches and Triangulation. Our experiments show that 3-8 beacons are sufficient to provide efficient peer-location service on 10 000 node Internet-like topologies. Further, our results are 2-5 times more accurate than existing techniques. We also present results from an implementation of Beaconing over a non-trivial wide-area testbed. In our experiments, Beaconing is able to efficiently (< 3 K Bytes and < 50 packets on average), quickly (< 1 second on average), and accurately (< 20 ms error on average) find nearby peers on the Internet.}, keywords = {application-layer;, application-peers;, Beaconing;, beacons;, close, distance, Expanding, friends;, Internet-like, Internet;, IP;, measurement, nearby, network, peer-location, points;, protocols;, Ring, searches;, service;, solutions;, testbed;, topologies;, topology;, transport, Triangulation;, unicast-only, wide-area}, doi = {10.1109/ICNP.2001.992910}, author = {Kommareddy,C. and Shankar,N. and Bhattacharjee, Bobby} } @conference {17599, title = {Finding large independent sets of hypergraphs in parallel}, booktitle = {Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures}, series = {SPAA {\textquoteright}01}, year = {2001}, month = {2001///}, pages = {163 - 168}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {A basic problem in hypergraphs is that of finding a large independent set-one of guaranteed size-in a given hypergraph. Understanding the parallel complexity of this and related independent set problems on hypergraphs is a fundamental open issue in parallel computation. Caro and Tuza (J. Graph Theory, Vol. 15, pp. 99-107, 1991) have shown a certain lower bound \&agr;k(H) on the size of a maximum independent set in a given k-uniform hypergraph H, and have also presented an efficien sequential algorithm to find an independent set of size \&agr;k (H). They also show that \&agr;k (H) is the size of the maximum independent set for various hypergraph families. Here, we develop the first RNC algorithm to find an independent set of size \&agr;k(H), and also derandomize it for various special cases. We also present lower bounds on independent set size and corresponding RNC algorithms for non-uniform hypergraphs.}, keywords = {hypergraphs, independent sets, Parallel algorithms, randomized algorithms}, isbn = {1-58113-409-6}, doi = {10.1145/378580.378622}, url = {http://doi.acm.org/10.1145/378580.378622}, author = {Shachnai,Hadas and Srinivasan, Aravind} } @article {17821, title = {Flexible support for multiple access control policies}, journal = {ACM Trans. Database Syst.}, volume = {26}, year = {2001}, month = {2001/06//}, pages = {214 - 260}, abstract = {Although several access control policies can be devised for controlling access to information, all existing authorization models, and the corresponding enforcement mechanisms, are based on a specific policy (usually the closed policy). As a consequence, although different policy choices are possible in theory, in practice only a specific policy can actually be applied within a given system. In this paper, we present a unified framework that can enforce multiple access control policies within a single system. The framework is based on a language through which users can specify security policies to be enforced on specific accesses. The language allows the specification of both positive and negative authorizations and incorporates notions of authorization derivation, conflict resolution, and decision strategies. Different strategies may be applied to different users, groups, objects, or roles, based on the needs of the security policy. The overall result is a flexible and powerful, yet simple, framework that can easily capture many of the traditional access control policies as well as protection requirements that exist in real-world applications, but are seldom supported by existing systems. The major advantage of our approach is that it can be used to specify different access control policies that can all coexist in the same system and be enforced by the same security server.}, keywords = {access control policy, Authorization, logic programming}, isbn = {0362-5915}, doi = {10.1145/383891.383894}, url = {http://doi.acm.org/10.1145/383891.383894}, author = {Jajodia,Sushil and Samarati,Pierangela and Sapino,Maria Luisa and V.S. Subrahmanian} } @conference {16736, title = {Hashing moving objects}, booktitle = {Mobile Data Management}, year = {2001}, month = {2001///}, pages = {161 - 172}, author = {Song,Z. and Roussopoulos, Nick} } @article {15473, title = {Hierarchical GUI test case generation using automated planning}, journal = {Software Engineering, IEEE Transactions on}, volume = {27}, year = {2001}, month = {2001/02//}, pages = {144 - 155}, abstract = {The widespread use of GUIs for interacting with software is leading to the construction of more and more complex GUIs. With the growing complexity come challenges in testing the correctness of a GUI and its underlying software. We present a new technique to automatically generate test cases for GUIs that exploits planning, a well-developed and used technique in artificial intelligence. Given a set of operators, an initial state, and a goal state, a planner produces a sequence of the operators that will transform the initial state to the goal state. Our test case generation technique enables efficient application of planning by first creating a hierarchical model of a GUI based on its structure. The GUI model consists of hierarchical planning operators representing the possible events in the GUI. The test designer defines the preconditions and effects of the hierarchical operators, which are input into a plan-generation system. The test designer also creates scenarios that represent typical initial and goal states for a GUI user. The planner then generates plans representing sequences of GUI interactions that a user might employ to reach the goal state from the initial state. We implemented our test case generation system, called Planning Assisted Tester for Graphical User Interface Systems (PATHS) and experimentally evaluated its practicality and effectiveness. We describe a prototype implementation of PATHS and report on the results of controlled experiments to generate test cases for Microsoft{\textquoteright}s WordPad}, keywords = {Artificial intelligence, automated planning, automatic test case generation, Automatic testing, correctness testing, goal state, Graphical user interfaces, hierarchical GUI test case generation, initial state, Microsoft WordPad, operators, plan-generation system, planning (artificial intelligence), Planning Assisted Tester for Graphical User Interface Systems, program testing, software}, isbn = {0098-5589}, doi = {10.1109/32.908959}, author = {Memon, Atif M. and Pollack,M. E and Soffa,M. L} } @conference {17858, title = {A hypergraph-based workload partitioning strategy for parallel data aggregation}, booktitle = {Proceedings of the Eleventh SIAM Conference on Parallel Processing for Scientific Computing}, year = {2001}, month = {2001///}, author = {Chang,C. and Kurc, T. and Sussman, Alan and Catalyurek,U. and Saltz, J.} } @article {17610, title = {Improved Bounds on the Sample Complexity of Learning}, journal = {Journal of Computer and System Sciences}, volume = {62}, year = {2001}, month = {2001/05//}, pages = {516 - 527}, abstract = {We present a new general upper bound on the number of examples required to estimate all of the expectations of a set of random variables uniformly well. The quality of the estimates is measured using a variant of the relative error proposed by Haussler and Pollard. We also show that our bound is within a constant factor of the best possible. Our upper bound implies improved bounds on the sample complexity of learning according to Haussler{\textquoteright}s decision theoretic model.}, keywords = {agnostic learning, empirical process theory, machine learning, PAC learning, sample complexity}, isbn = {0022-0000}, doi = {10.1006/jcss.2000.1741}, url = {http://www.sciencedirect.com/science/article/pii/S0022000000917410}, author = {Li,Yi and Long,Philip M. and Srinivasan, Aravind} } @conference {17234, title = {Information Visualization: The Path from Innovation to Adoption}, booktitle = {Information Visualisation, International Conference on}, year = {2001}, month = {2001///}, pages = {0003 - 0003}, publisher = {IEEE Computer Society}, organization = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, isbn = {0-7695-1195-3}, doi = {http://doi.ieeecomputersociety.org/10.1109/IV.2001.10004}, author = {Shneiderman, Ben} } @article {18731, title = {Intelligent assembly modeling and simulation}, journal = {Assembly Automation}, volume = {21}, year = {2001}, month = {2001///}, pages = {215 - 235}, abstract = {Because of the intense competition in the current global economy, a company must conceive, design, and manufacture new products quickly and inexpensively. The design cycle can be shortened through simulation. Rapid technical advances in many different areas of scientific computing provide the enabling technologies for creating a comprehensive simulation and visualization environment for assembly design and planning. An intelligent environment has been built in which simple simulation tools can be composed into complex simulations for detecting potential assembly problems. The goal in this research is to develop high fidelity assembly simulation and visualization tools that can detect assembly related problems without going through physical mock-ups. In addition, these tools can be used to create easy-to-visualize instructions for performing assembly and service operations.}, url = {http://www.ingentaconnect.com/content/mcb/033/2001/00000021/00000003/art00004}, author = {Gupta,S.K. and Paredis,C. J. J. and Sinha,R.} } @inbook {17252, title = {Interactive Exploration of Time Series Data}, booktitle = {Discovery ScienceDiscovery Science}, series = {Lecture Notes in Computer Science}, volume = {2226}, year = {2001}, month = {2001///}, pages = {441 - 446}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {Widespread interest in discovering features and trends in time- series has generated a need for tools that support interactive exploration.This paper introduces timeboxes: a powerful direct-manipulation metaphor for the specification of queries over time series datasets. Our TimeSearcher implementation of timeboxes supports interactive formulation and modification of queries, thus speeding the process of exploring time series data sets and guiding data mining.}, isbn = {978-3-540-42956-2}, url = {http://dx.doi.org/10.1007/3-540-45650-3_38}, author = {Hochheiser,Harry and Shneiderman, Ben}, editor = {Jantke,Klaus and Shinohara,Ayumi} } @conference {18634, title = {Intrusion tolerance approaches in ITUA}, volume = {64}, year = {2001}, month = {2001///}, url = {http://www.dist-systems.bbn.com/papers/2001/ICDSN/01CUK01.pdf}, author = {Michel Cukier and Lyons,J. and Pandey,P. and Ramasamy,H. V. and Sanders,W. H. and Pal,P. and Webber,F. and Schantz,R. and Loyall,J. and Watro,R.} } @inbook {17265, title = {Inventing Discovery Tools: Combining Information Visualization with Data Mining}, booktitle = {Discovery Science}, series = {Lecture Notes in Computer Science}, volume = {2226}, year = {2001}, month = {2001///}, pages = {17 - 28}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {The growing use of information visualization tools and data mining algorithms stems from two separate lines of research. Information visualization researchers believe in the importance of giving users an overview and insight into the data distributions, while data mining researchers believe that statistical algorithms and machine learning can be relied on to find the interesting patterns. This paper discusses two issues that influence design of discovery tools: statistical algorithms vs. visual data presentation, and hypothesis testing vs. exploratory data analysis. I claim that a combined approach could lead to novel discovery tools that preserve user control, enable more effective exploration, and promote responsibility.}, isbn = {978-3-540-42956-2}, url = {http://dx.doi.org/10.1007/3-540-45650-3_4}, author = {Shneiderman, Ben}, editor = {Jantke,Klaus and Shinohara,Ayumi} } @article {16756, title = {K-nearest neighbor search for moving query point}, journal = {Advances in Spatial and Temporal Databases}, year = {2001}, month = {2001///}, pages = {79 - 96}, author = {Song,Z. and Roussopoulos, Nick} } @conference {16307, title = {Leveraging open-source communities to improve the quality \& performance of open-source software}, booktitle = {Proceedings of the 1st Workshop on Open Source Software Engineering}, year = {2001}, month = {2001///}, author = {Schmidt,D. C and Porter, Adam} } @conference {15899, title = {Mandarin-English Information (MEI): investigating translingual speech retrieval}, booktitle = {Proceedings of the first international conference on Human language technology research}, series = {HLT {\textquoteright}01}, year = {2001}, month = {2001///}, pages = {1 - 7}, publisher = {Association for Computational Linguistics}, organization = {Association for Computational Linguistics}, address = {Stroudsburg, PA, USA}, abstract = {This paper describes the Mandarin-English Information (MEI) project, where we investigated the problem of cross-language spoken document retrieval (CL-SDR), and developed one of the first English-Chinese CL-SDR systems. Our system accepts an entire English news story (text) as query, and retrieves relevant Chinese broadcast news stories (audio) from the document collection. Hence this is a cross-language and cross-media retrieval task. We applied a multi-scale approach to our problem, which unifies the use of phrases, words and subwords in retrieval. The English queries are translated into Chinese by means of a dictionary-based approach, where we have integrated phrase-based translation with word-by-word translation. Untranslatable named entities are transliterated by a novel subword translation technique. The multi-scale approach can be divided into three subtasks -- multi-scale query formulation, multi-scale audio indexing (by speech recognition) and multi-scale retrieval. Experimental results demonstrate that the use of phrase-based translation and subword translation gave performance gains, and multi-scale retrieval outperforms word-based retrieval.}, keywords = {cross-language, English-Chinese, spoken document retrieval}, doi = {10.3115/1072133.1072202}, url = {http://dx.doi.org/10.3115/1072133.1072202}, author = {Meng,Helen and Chen,Berlin and Khudanpur,Sanjeev and Levow,Gina-Anne and Lo,Wai-Kit and Oard, Douglas and Schone,Patrick and Tang,Karen and Wang,Hsin-Min and Wang,Jianqiang} } @book {17708, title = {Matrix Algorithms: Eigensystems}, year = {2001}, month = {2001/08/30/}, publisher = {SIAM}, organization = {SIAM}, abstract = {This is the second volume in a projected five-volume survey of numerical linear algebra and matrix algorithms. It treats the numerical solution of dense and large-scale eigenvalue problems with an emphasis on algorithms and the theoretical background required to understand them. The notes and reference sections contain pointers to other methods along with historical comments. The book is divided into two parts: dense eigenproblems and large eigenproblems. The first part gives a full treatment of the widely used QR algorithm, which is then applied to the solution of generalized eigenproblems and the computation of the singular value decomposition. The second part treats Krylov sequence methods such as the Lanczos and Arnoldi algorithms and presents a new treatment of the Jacobi-Davidson method. These volumes are not intended to be encyclopedic, but provide the reader with the theoretical and practical background to read the research literature and implement or modify new algorithms.}, keywords = {eigenvalues, Mathematics / Algebra / Linear, Mathematics / Applied, Mathematics / General, Mathematics / Mathematical Analysis, Mathematics / Matrices, Mathematics / Numerical Analysis, Matrices, Medical / General}, isbn = {9780898715033}, author = {Stewart, G.W.} } @article {17628, title = {Near-optimal design of MP S tunnels with shared recovery}, journal = {DIMACS Mini-Workshop on Quality of Service Issues in the Internet}, year = {2001}, month = {2001///}, abstract = {We describe the optimization problem associ-ated with the concurrent routing of demands with guar- anteed shared recovery in case of network failures. This problem arises in routing with protection in meshes and is known to be hard. We describe the problem in the context of the efficient design of restorable MP S tunnels in optical networks. The underlying design gives rise to a stochastic optimization problem that is equivalent to a (very) large- scale linear programming (LP) problem that explicitly in- corporates the network failure scenarios. The feasible re- gion for this LP is given by combined packing and cover- ing constraints for concurrent and optimal multicommodity flows. We develop a novel -approximation procedure for this problem and demonstrate its performance for a variety of real network sizes. An attraction of our approach is that its main computation consists of routing flow along a pair of short paths and these paths are easily found. Commer- cial general-purpose LP solvers are typically unable to solve these problems once they become large enough, while our approach scales for large networks. We conclude that the proposed scheme provides guaranteed approximation to the design of restorable MP S tunnels with shared protection within realistic network settings. }, author = {Fleischer,L. and Meyerson,A. and Saniee,I. and Shepherd,FB and Srinivasan, Aravind} } @conference {17632, title = {New approaches to covering and packing problems}, booktitle = {Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms}, series = {SODA {\textquoteright}01}, year = {2001}, month = {2001///}, pages = {567 - 576}, publisher = {Society for Industrial and Applied Mathematics}, organization = {Society for Industrial and Applied Mathematics}, address = {Philadelphia, PA, USA}, abstract = {Covering and packing integer programs model a large family of combinatorial optimization problems. The current-best approximation algorithms for these are an instance of the basic probabilistic method: showing that a certain randomized approach produces a good approximation with positive probability. This approach seems inherently sequential; by employing the method of alteration we present the first RNC and NC approximation algorithms that match the best sequential guarantees. Extending our approach, we get the first RNC and NC approximation algorithms for certain multi-criteria versions of these problems. We also present the first NC algorithms for two packing and covering problems that are not subsumed by the above result: finding large independent sets in graphs, and rounding fractional Group Steiner solutions on trees.}, isbn = {0-89871-490-7}, url = {http://dl.acm.org/citation.cfm?id=365411.365535}, author = {Srinivasan, Aravind} } @article {17667, title = {The one-inclusion graph algorithm is near-optimal for the prediction model of learning}, journal = {IEEE Transactions on Information Theory}, volume = {47}, year = {2001}, month = {2001/03//}, pages = {1257 - 1261}, abstract = {Haussler, Littlestone and Warmuth (1994) described a general-purpose algorithm for learning according to the prediction model, and proved an upper bound on the probability that their algorithm makes a mistake in terms of the number of examples seen and the Vapnik-Chervonenkis (VC) dimension of the concept class being learned. We show that their bound is within a factor of 1+o(1) of the best possible such bound for any algorithm}, keywords = {Computer science, concept class, general-purpose algorithm, graph theory, learning prediction model, learning systems, near-optimal algorithm, Neural networks, one-inclusion graph algorithm, optimisation, Prediction algorithms, prediction theory, Predictive models, probability, Probability distribution, Upper bound, Vapnik-Chervonenkis dimension, Virtual colonoscopy}, isbn = {0018-9448}, doi = {10.1109/18.915700}, author = {Li,Yi and Long,P. M and Srinivasan, Aravind} } @conference {17824, title = {Optimal Agent Selection}, booktitle = {KI 2001: advances in artificial intelligence: Joint German/Austrian Conference on AI, Vienna, Austria, September 19-21, 2001: proceedings}, year = {2001}, month = {2001///}, pages = {2 - 2}, abstract = {The Internet contains a vast array of sources that provide identical or similar services. When an agent needs to solve a problem, it may split the problem into {\textquotedblleft}subproblems{\textquotedblright} and find an agent to solve each of the subproblems. Later, it may combine the results of these subproblems to solve the original problem. In this case, the agent is faced with the task of determining to which agents to assign the subproblems.We call this the agent selection problem (ASP for short). Solving ASP is complex because it must take into account several different parameters. For instance, different agents might take different amounts of time to process a request. Different agents might provide varying {\textquotedblleft}qualities{\textquotedblright} of answers. Network latencies associated with different agents might vary. In this paper, we first formalize the agent selection problem and show that it is NP-hard. We then propose a generic cost function that is general enough to take into account the costs of (i) network and server loads, (ii) source computations, and (iii) internal mediator costs. We then develop exact and heuristic based algorithms to solve the agent selection problem.}, author = {Ozcan,F. and V.S. Subrahmanian and Golubchik,L.} } @conference {17314, title = {Ordered treemap layouts}, booktitle = {IEEE Symposium on Information Visualization, 2001. INFOVIS 2001}, year = {2001}, month = {2001///}, pages = {73 - 78}, publisher = {IEEE}, organization = {IEEE}, keywords = {Clustering algorithms, Computer science, Data visualization, Displays, Electronic switching systems, Filling, Monte Carlo methods, Read only memory, Testing}, isbn = {0-7695-7342-5}, doi = {10.1109/INFVIS.2001.963283}, author = {Shneiderman, Ben and Wattenberg,M.} } @conference {17825, title = {Partitioning activities for agents}, booktitle = {INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE}, volume = {17}, year = {2001}, month = {2001///}, pages = {1218 - 1228}, abstract = {There are now numerous agent applications thattrack interests of thousands of users in situations where changes occur continuously. [Shim et al., 1994] suggested that such agents can be made effi- cient by merging commonalities in their activities. However, past algorithms cannot merge more than 10 or 20 concurrent activities. We develop tech- niques so that a large number of concurrent activ- ities (typically over 1000) can be partitioned into components (groups of activities) of small size (e.g. 10 to 50) so that each component{\textquoteright}s activities can be merged using previously developed algorithms (e.g. [Shim et al., 1994]). We first formalize the prob- lem and show that finding optimal partitions is NP- hard. We then develop three algorithms - Greedy, A -based and BAB (branch and bound). A -based and BAB are both guaranteed to compute optimal solutions. Greedy on the other hand uses heuris- tics and typically finds suboptimal solutions. We implemented all three algorithms. We experimen- tally show that the greedy algorithm finds partitions whose costs are at most 14\% worse than that found by A -based and BAB {\textemdash} however, Greedy is able to handle over thousand concurrent requests very fast while the other two methods are much slower and able to handle only 10-20 requests. Hence, Greedy appears to be the best. }, author = {Ozcan,F. and V.S. Subrahmanian} } @conference {17873, title = {Performance optimization for data intensive grid applications}, booktitle = {Active Middleware Services, 2001. Third Annual International Workshop on}, year = {2001}, month = {2001///}, pages = {97 - 105}, author = {Beynon,M. D and Sussman, Alan and Catalyurek,U. and Kurc, T. and Saltz, J.} } @article {12070, title = {The price of safety in an active network}, journal = {Journal of Communications and Networks}, volume = {3}, year = {2001}, month = {2001///}, pages = {4 - 18}, author = {Alexander,D. S and Menage,P. B and Keromytis,A. D and Arbaugh, William A. and Anagnostakis,K. G and Smith,J. M} } @article {14399, title = {Probabilistic models of text and link structure for hypertext classification}, journal = {IJCAI workshop on text learning: beyond supervision}, year = {2001}, month = {2001///}, pages = {24 - 29}, abstract = {Most text classification methods treat each document as anindependent instance. However, in many text domains, doc- uments are linked and the topics of linked documents are cor- related. For example, web pages of related topics are often connected by hyperlinks and scientific papers from related fields are commonly linked by citations. We propose a unified probabilistic model for both the textual content and the link structure of a document collection. Our model is based on the recently introduced framework of Probabilistic Relational Models (PRMs), which allows us to capture cor- relations between linked documents. We show how to learn these models from data and use them efficiently for classifi- cation. Since exact methods for classification in these large models are intractable, we utilize belief propagation, an ap- proximate inference algorithm. Belief propagation automat- ically induces a very natural behavior, where our knowledge about one document helps us classify related ones, which in turn help us classify others. We present preliminary empiri- cal results on a dataset of university web pages. }, author = {Getoor, Lise and Segal,E. and Taskar,B. and Koller,D.} } @article {17820, title = {Probabilistic object bases}, journal = {ACM Trans. Database Syst.}, volume = {26}, year = {2001}, month = {2001/09//}, pages = {264 - 312}, abstract = {Although there are many applications where an object-oriented data model is a good way of representing and querying data, current object database systems are unable to handle objects whose attributes are uncertain. In this article, we extend previous work by Kornatzky and Shimony to develop an algebra to handle object bases with uncertainty. We propose concepts of consistency for such object bases, together with an NP-completeness result, and classes of probabilistic object bases for which consistency is polynomially checkable. In addition, as certain operations involve conjunctions and disjunctions of events, and as the probability of conjunctive and disjunctive events depends both on the probabilities of the primitive events involved as well as on what is known (if anything) about the relationship between the events, we show how all our algebraic operations may be performed under arbitrary probabilistic conjunction and disjunction strategies. We also develop a host of equivalence results in our algebra, which may be used as rewrite rules for query optimization. Last but not least, we have developed a prototype probabilistic object base server on top of ObjectStore. We describe experiments to assess the efficiency of different possible rewrite rules.}, keywords = {consistency, object-oriented database, probabilistic object algebra, probabilistic object base, probability, query language, Query optimization}, isbn = {0362-5915}, doi = {10.1145/502030.502031}, url = {http://doi.acm.org/10.1145/502030.502031}, author = {Eiter,Thomas and Lu,James J. and Lukasiewicz,Thomas and V.S. Subrahmanian} } @article {17828, title = {Probabilistic temporal databases}, journal = {ACM Transaction on Database Systems}, volume = {26}, year = {2001}, month = {2001///}, pages = {41 - 95}, author = {Alex,D. and Robert,R. and V.S. Subrahmanian} } @article {17823, title = {Probabilistic temporal databases, I: algebra}, journal = {ACM Trans. Database Syst.}, volume = {26}, year = {2001}, month = {2001/03//}, pages = {41 - 95}, abstract = {Dyreson and Snodgrass have drawn attention to the fact that, in many temporal database applications, there is often uncertainty about the start time of events, the end time of events, and the duration of events. When the granularity of time is small (e.g., milliseconds), a statement such as {\textquotedblleft}Packet p was shipped sometime during the first 5 days of January, 1998{\textquotedblright} leads to a massive amount of uncertainty (5{\texttimes}24{\texttimes}60{\texttimes}60{\texttimes}1000) possibilities. As noted in Zaniolo et al. [1997], past attempts to deal with uncertainty in databases have been restricted to relatively small amounts of uncertainty in attributes. Dyreson and Snodgrass have taken an important first step towards solving this problem.In this article, we first introduce the syntax of Temporal-Probabilistic (TP) relations and then show how they can be converted to an explicit, significantly more space-consuming form, called Annotated Relations. We then present a theoretical annotated temporal algebra (TATA). Being explicit, TATA is convenient for specifying how the algebraic operations should behave, but is impractical to use because annotated relations are overwhelmingly large. Next, we present a temporal probabilistic algebra (TPA). We show that our definition of the TP-algebra provides a correct implementation of TATA despite the fact that it operates on implicit, succinct TP-relations instead of overwhemingly large annotated relations. Finally, we report on timings for an implementation of the TP-Algebra built on top of ODBC. }, isbn = {0362-5915}, doi = {10.1145/383734.383736}, url = {http://doi.acm.org/10.1145/383734.383736}, author = {Dekhtyar,Alex and Ross,Robert and V.S. Subrahmanian} } @article {17827, title = {Probabilistic Temporal Databases, II: Calculus and Query Processing}, journal = {Technical Reports from UMIACS, UMIACS-TR-2001-79}, year = {2001}, month = {2001///}, abstract = {There is a vast class of applications in which we know that a certain event occurred, but do not know exactly when it occurred. However, as studied by Dyreson and Snodgrass \cite{ds98}, there are many natural scenarios where probability distributions exist and quantify this uncertainty. Dekhtyar et. al. extended Dyreson and Snodgrass{\textquoteright}s work and defined an extension of the relational algebra to handle such data. The first contribution of this paper is a declarative temporal probabilistic (TP for short) calculus which we show is equivalent in expressive power to the temporal probabilistic algebra of Dekhtyar et. al. Our second major contribution is a set of equivalence and containment results for the TP-algebra. Our third contribution is the development of cost models that may be used to estimate the cost of TP-algebra operations. Our fourth contribution is an experimental evaluation of the accuracy of our cost models and the use of the equivalence results as rewrite rules for optimizing queries by using an implementation of TP-databases on top of ODBC.}, author = {Dekhtyar,A. and Ozcan,F. and Ross,R. and V.S. Subrahmanian} } @conference {12110, title = {A prototype experience management system for a software consulting organization}, booktitle = {Thirteenth International Conference on Software Engineering and Knowledge Engineering}, year = {2001}, month = {2001///}, pages = {29 - 36}, abstract = {The Experience Management System (EMS) is aimed atsupporting the capture and reuse of software-related experience, based on the Experience Factory concept. It is being developed for use in a multinational software engineering consultancy, Q-Labs. Currently, a prototype EMS exists and has been evaluated. This paper focuses on the EMS architecture, underlying data model, implementation, and user interface. }, author = {Mendon{\c c}a Neto,M. G. and Seaman,C. and Basili, Victor R. and Kim,Y. M} } @conference {17826, title = {Provisional authorizations}, booktitle = {E-commerce Security and Privacy}, volume = {2}, year = {2001}, month = {2001///}, pages = {133 - 159}, abstract = {Past generations of access control systems, when faced with an access request, have issued a {\textquotedblleft}yes{\textquotedblright} (resp. {\textquotedblleft}no{\textquotedblright}) answer to the access request resulting in access being granted (resp. denied). In this chapter, we ar-gue that for the world{\textquoteright}s rapidly proliferating business to business (B2B) applications and auctions, {\textquotedblleft}yes/no{\textquotedblright} responses are just not enough. We propose the notion of a {\textquotedblleft}provisional authorization{\textquotedblright} which intuitively says {\textquotedblleft}You may perform the desired access provided you cause condition C to be satisfied.{\textquotedblright} For instance, a user accessing an online brokerage may receive some information if he fills out his name/address, but not otherwise. While a variety of such provisional authorization mecha-nisms exist on the web, they are all hardcoded on an application by application basis. We show that given (almost) any logic L, we may define a provisional authorization specification language pASLL. pASLL is based on the declarative, polynomially evaluable authorization spec-ification language ASL proposed by Jajodia et al [JSS97]. We define programs in pASLL, and specify how given any access request, we must find a {\textquotedblleft}weakest{\textquotedblright} precondition under which the access can be granted (in the worst case, if this weakest precondition is {\textquotedblleft}false{\textquotedblright} this amounts to a denial). We develop a model theoretic semantics for pASLL and show how it can be applied to online sealed-bid auction servers and online contracting.}, doi = {10.1007/978-1-4615-1467-1_8}, author = {Jajodia,S. and Kudo,M. and V.S. Subrahmanian} } @article {18265, title = {Reading between the lines: Lessons from the SDMI challenge}, journal = {Proceedings of the 10th USENIX Security Symposium}, year = {2001}, month = {2001///}, pages = {13 - 17}, abstract = {The Secure Digital Music Initiative is a consortium ofparties interested in preventing piracy of digital music, and to this end they are developing architectures for con- tent protection on untrusted platforms. SDMI recently held a challenge to test the strength of four watermark- ing technologies, and two other security technologies. No documentation explained the implementations of the technologies, and neither watermark embedding nor de- tecting software was directly accessible to challenge par- ticipants. We nevertheless accepted the challenge, and explored the inner workings of the technologies. We re- port on our results here. }, author = {Craver,S.A. and Wu,M. and Liu,B. and Stubblefield,A. and Swartzlander,B. and Wallach,D.S. and Dean,D. and Felten,E.W.} } @article {13015, title = {Relating amino acid sequence to phenotype: analysis of peptide-binding data}, journal = {Biometrics}, volume = {57}, year = {2001}, month = {2001/06//}, pages = {632 - 642}, abstract = {We illustrate data analytic concerns that arise in the context of relating genotype, as represented by amino acid sequence, to phenotypes (outcomes). The present application examines whether peptides that bind to a particular major histocompatibility complex (MHC) class I molecule have characteristic amino acid sequences. However, the concerns identified and addressed are considerably more general. It is recognized that simple rules for predicting binding based solely on preferences for specific amino acids in certain (anchor) positions of the peptide{\textquoteright}s amino acid sequence are generally inadequate and that binding is potentially influenced by all sequence positions as well as between-position interactions. The desire to elucidate these more complex prediction rules has spawned various modeling attempts, the shortcomings of which provide motivation for the methods adopted here. Because of (i) this need to model between-position interactions, (ii) amino acids constituting a highly (20) multilevel unordered categorical covariate, and (iii) there frequently being numerous such covariates (i.e., positions) comprising the sequence, standard regression/classification techniques are problematic due to the proliferation of indicator variables required for encoding the sequence position covariates and attendant interactions. These difficulties have led to analyses based on (continuous) properties (e.g., molecular weights) of the amino acids. However, there is potential information loss in such an approach if the properties used are incomplete and/or do not capture the mechanism underlying association with the phenotype. Here we demonstrate that handling unordered categorical covariates with numerous levels and accompanying interactions can be done effectively using classification trees and recently devised bump-hunting methods. We further tackle the question of whether observed associations are attributable to amino acid properties as well as addressing the assessment and implications of between-position covariation.}, author = {Segal,M. R and Cummings, Michael P. and Hubbard,A. E} } @article {18710, title = {Rescuing a destabilized protein fold through backbone cyclization}, journal = {Journal of Molecular Biology}, volume = {308}, year = {2001}, month = {2001/05/18/}, pages = {1045 - 1062}, abstract = {We describe the physicochemical characterization of various circular and linear forms of the \~{}60 residue N-terminal Src homology 3 (SH3) domain from the murine c-Crk adapter protein. Structural, dynamic, thermodynamic, kinetic and biochemical studies reveal that backbone circularization does not prevent the adoption of the natural folded structure in any of the circular proteins. Both the folding and unfolding rate of the protein increased slightly upon circularization. Circularization did not lead to a significant thermodynamic stabilization of the full-length protein, suggesting that destabilizing enthalpic effects (e.g. strain) negate the expected favorable entropic contribution to overall stability. In contrast, we find circularization results in a dramatic stabilization of a truncated version of the SH3 domain lacking a key glutamate residue. The ability to rescue the destabilized mutant indicates that circularization may be a useful tool in protein engineering programs geared towards generating minimized proteins.}, keywords = {circular protein, ligation, SH3 domain}, isbn = {0022-2836}, doi = {10.1006/jmbi.2001.4631}, url = {http://www.sciencedirect.com/science/article/pii/S0022283601946315}, author = {Camarero,Julio A and Fushman, David and Sato,Satoshi and Giriat,Izabela and Cowburn,David and Raleigh,Daniel P and Muir,Tom W} } @article {15296, title = {The role of a natural language conversational interface in online sales: A case study}, journal = {International Journal of Speech Technology}, volume = {4}, year = {2001}, month = {2001///}, pages = {285 - 295}, abstract = {This paper describes the evaluation of a natural language dialog-based navigation system (HappyAssistant) that helps users access e-commerce sites to find relevant information about products and services. The prototype system leverages technologies in natural language processing and human-computer interaction to create a faster and more intuitive way of interacting with websites, especially for less experienced users. The result of a comparative study shows that users prefer the natural language-enabled navigation two to one over the menu driven navigation. In addition, the study confirmed the efficiency of using natural language dialog in terms of the number of clicks and the amount of time required to obtain the relevant information. In the case study, as compared to the menu driven system, the average number of clicks used in the natural language system was reduced by 63.2\% and the average time was reduced by 33.3\%.}, doi = {10.1023/A:1011316909641}, author = {Chai,J. and Jimmy Lin and Zadrozny,W. and Ye,Y. and Stys-Budzikowska,M. and Horvath,V. and Kambhatla,N. and Wolf,C.} } @article {18271, title = {Rotation, scale, and translation resilient public watermarking for images using a log-polar fourier transform}, year = {2001}, month = {2001/08/28/}, abstract = {A method for detecting a watermark signal in digital image data. The detecting method includes the steps of: computing a log-polar Fourier transform of the image data to obtain a log-polar Fourier spectrum; projecting the log-polar Fourier spectrum down to a lower dimensional space to obtain an extracted signal; comparing the extracted signal to a target watermark signal; and declaring the presence or absence of the target watermark signal in the image data based on the comparison. Also provided is a method for inserting a watermark signal in digital image data to obtain a watermarked image. The inserting method includes the steps of: computing a log-polar Fourier transform of the image data to obtain a log-polar Fourier spectrum; projecting the log-polar Fourier spectrum down to a lower dimensional space to obtain an extracted signal; modifying the extracted signal such that it is similar to a target watermark; performing a one-to-many mapping of the modified signal back to...}, url = {http://www.google.com/patents?id=v4AIAAAAEBAJ}, author = {Bloom,Jeffrey A. and Cox,Ingemar J. and Miller,Matthew L. and M. Wu and Lin,Ching-Yung and Lui,Yui Man}, editor = {Signafy, Inc.} } @article {18274, title = {Secure Health Information Sharing System: SHARE}, journal = {Proceedings of the AMIA SymposiumProc AMIA Symp}, year = {2001}, month = {2001///}, pages = {1060 - 1060}, isbn = {1531-605X}, author = {M. Wu and Mui,Lik and Mohtashemi,Mojdeh and Szolovits,Peter} } @article {16799, title = {Shared index scans for data warehouses}, journal = {Data Warehousing and Knowledge Discovery}, year = {2001}, month = {2001///}, pages = {307 - 316}, author = {Kotidis1*,Y. and Sismanis,Y. and Roussopoulos, Nick} } @article {14170, title = {The Statistics of Optical Flow}, journal = {Computer Vision and Image Understanding}, volume = {82}, year = {2001}, month = {2001/04//}, pages = {1 - 32}, abstract = {When processing image sequences some representation of image motion must be derived as a first stage. The most often used representation is the optical flow field, which is a set of velocity measurements of image patterns. It is well known that it is very difficult to estimate accurate optical flow at locations in an image which correspond to scene discontinuities. What is less well known, however, is that even at the locations corresponding to smooth scene surfaces, the optical flow field often cannot be estimated accurately.Noise in the data causes many optical flow estimation techniques to give biased flow estimates. Very often there is consistent bias: the estimate tends to be an underestimate in length and to be in a direction closer to the majority of the gradients in the patch. This paper studies all three major categories of flow estimation methods{\textemdash}gradient-based, energy-based, and correlation methods, and it analyzes different ways of compounding one-dimensional motion estimates (image gradients, spatiotemporal frequency triplets, local correlation estimates) into two-dimensional velocity estimates, including linear and nonlinear methods. Correcting for the bias would require knowledge of the noise parameters. In many situations, however, these are difficult to estimate accurately, as they change with the dynamic imagery in unpredictable and complex ways. Thus, the bias really is a problem inherent to optical flow estimation. We argue that the bias is also integral to the human visual system. It is the cause of the illusory perception of motion in the Ouchi pattern and also explains various psychophysical studies of the perception of moving plaids. }, isbn = {1077-3142}, doi = {10.1006/cviu.2000.0900}, url = {http://www.sciencedirect.com/science/article/pii/S1077314200909007}, author = {Ferm{\"u}ller, Cornelia and Shulman,David and Aloimonos, J.} } @conference {16708, title = {Supervised sense tagging using support vector machines}, booktitle = {Proceedings of the Second International Workshop on Evaluating Word Sense Disambiguation Systems (SENSEVAL-2)}, year = {2001}, month = {2001///}, pages = {59 - 62}, author = {Cabezas,C. and Resnik, Philip and Stevens,J.} } @article {17385, title = {Supporting creativity with advanced information-abundant user interfaces}, journal = {Human-Centered Computing, Online Communities, and Virtual Environments}, year = {2001}, month = {2001///}, pages = {469 - 480}, author = {Shneiderman, Ben} } @article {17822, title = {Temporal agent programs}, journal = {Artificial Intelligence}, volume = {127}, year = {2001}, month = {2001/03//}, pages = {87 - 135}, abstract = {The {\textquotedblleft}agent program{\textquotedblright} framework introduced by Eiter, Subrahmanian and Pick [Artificial Intelligence 108 (1{\textendash}2) (1999) 179], supports developing agents on top of arbitrary legacy code. Such agents are continuously engaged in an {\textquotedblleft}event\&$\#$xa0;occurs{\textrightarrow}think{\textrightarrow}act{\textrightarrow}event\&$\#$xa0;occurs{\textellipsis}{\textquotedblright} cycle. However, this framework has two major limitations: (1)all actions are assumed to have no duration, and (2) all actions are taken now, but cannot be scheduled for the future. In this paper, we present the concept of a {\textquotedblleft}temporal agent program{\textquotedblright} (tap for short) and show that using taps, it is possible to build agents on top of legacy code that can reason about the past and about the future, and that can make temporal commitments for the future now. We develop a formal semantics for such agents, extending the concept of a status set proposed by Eiter et al., and develop algorithms to compute the status sets associated with temporal agent programs. Last, but not least, we show how taps support the decision making of collaborative agents. }, keywords = {agents, Heterogenous systems, Information integration, logic programming, temporal reasoning}, isbn = {0004-3702}, doi = {10.1016/S0004-3702(01)00052-2}, url = {http://www.sciencedirect.com/science/article/pii/S0004370201000522}, author = {Dix,J{\"u}rgen and Kraus,Sarit and V.S. Subrahmanian} } @conference {12021, title = {Towards the ultimate motion capture technology}, booktitle = {Deformable avatars: IFIP TC5/WG5. 10 DEFORM{\textquoteright}2000 Workshop, November 29-30, 2000, Geneva, Switzerland and AVATARS{\textquoteright}2000 Workshop, November 30-December 1, 2000, Lausanne, Switzerland}, volume = {68}, year = {2001}, month = {2001///}, pages = {143 - 143}, author = {Stuart, B. and Baker, P. and Aloimonos, J.} } @inbook {17459, title = {Universal usability: a research agenda for human{\textemdash}computer interaction to empower every citizen}, booktitle = {Frontiers of human-centred computing, online communities and virtual environmentsFrontiers of human-centred computing, online communities and virtual environments}, year = {2001}, month = {2001///}, pages = {179 - 189}, publisher = {Springer-Verlag}, organization = {Springer-Verlag}, address = {London, UK}, isbn = {1-85233-238-7}, author = {Shneiderman, Ben} } @article {17455, title = {Universal usability as a stimulus to advanced interface design}, journal = {Behaviour \& Information Technology}, volume = {20}, year = {2001}, month = {2001///}, pages = {367 - 376}, abstract = {The desire to make computing available to broader populations has historically been a motivation for research and innovation that led to new breakthroughs in usability. Menus, graphical user interfaces and the World Wide Web are examples of innovative technological solutions that have arisen out of the challenge of bringing larger and more diverse groups of users into the world of computing. Universal usability is the latest such challenge: In order to build systems that are universally usable, designers must account for technology variety, user diversity and gaps in user knowledge. These issues are particularly challenging and important in the context of increasing the usability of the World Wide Web. To raise awareness, web designers are urged to provide universal usability statements that offer users information about the usability of their sites. These statements can inform users and thereby reduce frustration and confusion. Further steps toward universal usability might be achieved through research aimed at developing tools that would encourage or promote usability. The paper closes with five proposals for future research.The desire to make computing available to broader populations has historically been a motivation for research and innovation that led to new breakthroughs in usability. Menus, graphical user interfaces and the World Wide Web are examples of innovative technological solutions that have arisen out of the challenge of bringing larger and more diverse groups of users into the world of computing. Universal usability is the latest such challenge: In order to build systems that are universally usable, designers must account for technology variety, user diversity and gaps in user knowledge. These issues are particularly challenging and important in the context of increasing the usability of the World Wide Web. To raise awareness, web designers are urged to provide universal usability statements that offer users information about the usability of their sites. These statements can inform users and thereby reduce frustration and confusion. Further steps toward universal usability might be achieved through research aimed at developing tools that would encourage or promote usability. The paper closes with five proposals for future research. }, isbn = {0144-929X}, doi = {10.1080/01449290110083602}, url = {http://www.tandfonline.com/doi/abs/10.1080/01449290110083602}, author = {Shneiderman, Ben and Hochheiser,Harry} } @article {17457, title = {Universal usability statements: Marking the trail for all users}, journal = {interactions}, volume = {8}, year = {2001}, month = {2001/03//}, pages = {16 - 18}, isbn = {1072-5520}, doi = {10.1145/361897.361913}, url = {http://doi.acm.org/10.1145/361897.361913}, author = {Hochheiser,Harry and Shneiderman, Ben} } @article {17461, title = {University of Maryland, USA}, journal = {Fifth International Conference on Information Visualisation: 25-27 July 2001 London, England: Proceedings}, year = {2001}, month = {2001///}, pages = {3 - 3}, author = {Shneiderman, Ben} } @conference {16761, title = {Update propagation strategies for improving the quality of data on the web}, booktitle = {PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON VERY LARGE DATA BASES}, year = {2001}, month = {2001///}, pages = {391 - 400}, author = {Labrinidis,A. and Roussopoulos, Nick and SCIENCE,MARYLAND UNIV COLLEGE PARK DEPT OF COMPUTER} } @article {17478, title = {Using interactive visualizations of WWW log data to characterize access patterns and inform site design}, journal = {Journal of the American Society for Information Science and Technology}, volume = {52}, year = {2001}, month = {2001/01/01/}, pages = {331 - 343}, abstract = {HTTP server log files provide Web site operators with substantial detail regarding the visitors to their sites. Interest in interpreting this data has spawned an active market for software packages that summarize and analyze this data, providing histograms, pie graphs, and other charts summarizing usage patterns. Although useful, these summaries obscure useful information and restrict users to passive interpretation of static displays. Interactive visualizations can be used to provide users with greater abilities to interpret and explore Web log data. By combining two-dimensional displays of thousands of individual access requests, color, and size coding for additional attributes, and facilities for zooming and filtering, these visualizations provide capabilities for examining data that exceed those of traditional Web log analysis tools. We introduce a series of interactive visualizations that can be used to explore server data across various dimensions. Possible uses of these visualizations are discussed, and difficulties of data collection, presentation, and interpretation are explored.}, isbn = {1532-2890}, doi = {10.1002/1532-2890(2000)9999:9999<::AID-ASI1066>3.0.CO;2-Y}, url = {http://onlinelibrary.wiley.com/doi/10.1002/1532-2890(2000)9999:9999\%3C::AID-ASI1066\%3E3.0.CO;2-Y/abstract}, author = {Hochheiser,Harry and Shneiderman, Ben} } @article {17493, title = {Visual specification of queries for finding patterns in time-series data}, journal = {Proceedings of discovery science}, year = {2001}, month = {2001///}, pages = {441 - 446}, abstract = {Widespread interest in discovering features and trends in time- series has generated a need for tools that support interactive exploration.This paper introduces timeboxes: a powerful graphical, direct-manipulation metaphor for the specification of queries over time-series datasets. Our TimeFinder implementation of timeboxes supports interactive formulation and modification of queries, thus speeding the process of exploring time-series data sets and guiding data mining. TimeFinder includes windows for timebox queries, individual time-series, and details-on-demand. Other features include drag-and-drop support for� query-by-example and graphical envelopes for displaying the extent of the entire data set and result set from a given query. Extensions involving increased expressive power and general temporal data sets are discussed.}, author = {Hochheiser,H. and Shneiderman, Ben} } @article {17842, title = {Visualization of large data sets with the Active Data Repository}, journal = {IEEE Computer Graphics and Applications}, volume = {21}, year = {2001}, month = {2001/08//Jul}, pages = {24 - 33}, abstract = {We implement ray-casting-based volume rendering and isosurface rendering methods using the Active Data Repository (ADR) for visualizing out-of-core data sets. We have developed the ADR object-oriented framework to provide support for applications that employ range queries with user-defined mapping and aggregation operations on large-scale multidimensional data. ADR targets distributed-memory parallel machines with one or more disks attached to each node. It is designed as a set of modular services implemented in C++, which can be customized for application-specific processing. The ADR runtime system supports common operations such as memory management, data retrieval, and scheduling of processing across a parallel machine}, keywords = {active data repository, ADR runtime system, Algorithm design and analysis, application-specific processing, C++, data mining, data retrieval, data visualisation, Data visualization, distributed-memory parallel machines, Indexing, Information retrieval, isosurface rendering, Isosurfaces, large data sets, large-scale multidimensional data, Memory management, modular services, out-of-core data sets, parallel machine, Parallel machines, Partitioning algorithms, ray-casting-based volume rendering, Rendering (computer graphics), Runtime, software libraries, storage management}, isbn = {0272-1716}, doi = {10.1109/38.933521}, author = {Kurc, T. and Catalyurek,U. and Chang,Chialin and Sussman, Alan and Saltz, J.} } @article {13353, title = {Adaptive query processing: Technology in evolution}, journal = {IEEE Data Engineering Bulletin}, volume = {23}, year = {2000}, month = {2000///}, pages = {7 - 18}, abstract = {As query engines are scaled and federated, they must cope with highly unpredictable and changeableenvironments. In the Telegraph project, we are attempting to architect and implement a continuously adaptive query engine suitable for global-area systems, massive parallelism, and sensor networks. To set the stage for our research, we present a survey of prior work on adaptive query processing, focusing on three characterizations of adaptivity: the frequency of adaptivity, the effects of adaptivity, and the extent of adaptivity. Given this survey, we sketch directions for research in the Telegraph project. }, author = {Hellerstein,J. M and Franklin,M.J. and Chandrasekaran,S. and Deshpande, Amol and Hildrum,K. and Madden,S. and Raman,V. and Shah,M. A} } @article {14661, title = {Agents in Network Management}, journal = {Technical Reports (CIS)}, year = {2000}, month = {2000/02/26/}, abstract = {The ubiquity and complexity of modern networks require automated management and control. With increases in scale, automated solutions based on simple data access models such as SNMP will give way to more distributed and algorithmic techniques. This article outlines present and near-term solutions based on the ideas of active networks and mobile agents, which permit sophisticated programmable control and management of ultra large scale networks.}, url = {http://repository.upenn.edu/cis_reports/138}, author = {Ertugay,Osman and Hicks, Michael W. and Smith,Jonathan and Kornblum,Jessica} } @conference {15639, title = {The analysis of a simple k-means clustering algorithm}, booktitle = {Proceedings of the sixteenth annual symposium on Computational geometry}, series = {SCG {\textquoteright}00}, year = {2000}, month = {2000///}, pages = {100 - 109}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, isbn = {1-58113-224-7}, doi = {10.1145/336154.336189}, url = {http://doi.acm.org/10.1145/336154.336189}, author = {Kanungo,Tapas and Mount, Dave and Netanyahu,Nathan S. and Piatko,Christine and Silverman,Ruth and Wu,Angela Y.} } @inbook {14197, title = {Analyzing Action Representations}, booktitle = {Algebraic Frames for the Perception-Action CycleAlgebraic Frames for the Perception-Action Cycle}, series = {Lecture Notes in Computer Science}, volume = {1888}, year = {2000}, month = {2000///}, pages = {1 - 21}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {We argue that actions represent the basic seed of intelligence underlying perception of the environment, and the representations encoding actions should be the starting point upon which further studies of cognition are built. In this paper we make a first effort in characterizing these action representations. In particular, from the study of simple actions related to 3D rigid motion interpretation, we deduce a number of principles for the possible computations responsible for the interpretation of space-time geometry. Using these principles, we then discuss possible avenues on how to proceed in analyzing the representations of more complex human actions.}, isbn = {978-3-540-41013-3}, url = {http://dx.doi.org/10.1007/10722492_1}, author = {Aloimonos, J. and Ferm{\"u}ller, Cornelia}, editor = {Sommer,Gerald and Zeevi,Yehoshua} } @article {17555, title = {Approximating low-congestion routing and column-restricted packing problems}, journal = {Information Processing Letters}, volume = {74}, year = {2000}, month = {2000/04//}, pages = {19 - 25}, abstract = {We contribute to a body of research asserting that the fractional and integral optima of column-sparse integer programs are {\textquotedblleft}nearby{\textquotedblright}. This yields improved approximation algorithms for some generalizations of the knapsack problem, with applications to low-congestion routing in networks, file replication in distributed databases, and other packing problems.}, keywords = {algorithms, Approximation algorithms, integer programming, Packing, Routing}, isbn = {0020-0190}, doi = {10.1016/S0020-0190(00)00033-8}, url = {http://www.sciencedirect.com/science/article/pii/S0020019000000338}, author = {Baveja,Alok and Srinivasan, Aravind} } @article {17560, title = {Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems}, journal = {Mathematics of Operations ResearchMathematics of Operations Research}, volume = {25}, year = {2000}, month = {2000/05/01/}, pages = {255 - 280}, abstract = {Given a network and a set of connection requests on it, we consider the maximum edge-disjoint paths and related generalizations and routing problems that arise in assigning paths for these requests. We present improved approximation algorithms and/or integrality gaps for all problems considered; the central theme of this work is the underlying multicommodity flow relaxation. Applications of these techniques to approximating families of packing integer programs are also presented.}, keywords = {Approximation algorithms, Disjoint paths, integer programming, Linear programming, multicommodity flow, Packing, randomized algorithms, rounding, Routing, unsplittable flow}, isbn = {0364-765X, 1526-5471}, doi = {10.1287/moor.25.2.255.12228}, url = {http://mor.journal.informs.org/content/25/2/255}, author = {Baveja,Alok and Srinivasan, Aravind} } @article {17686, title = {An Arnoldi--Schur Algorithm for Large Eigenproblems}, volume = {UMIACS-TR-2000-21}, year = {2000}, month = {2000/04/25/}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {Sorensen{\textquoteright}s iteratively restarted Arnoldi algorithm is one of the mostsuccessful and flexible methods for finding a few eigenpairs of a large matrix. However, the need to preserve structure of the Arnoldi decomposition, on which the algorithm is based, restricts the range of transformations that can be performed on it. In consequence, it is difficult to deflate converged Ritz vectors from the decomposition. Moreover, the potential forward instability of the implicit QR algorithm can cause unwanted Ritz vectors to persist in the computation. In this paper we introduce a generalized Arnoldi decomposition that solves both problems in a natural and efficient manner. (Also cross-referenced as UMIACS-TR-2000-21) }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/1066}, author = {Stewart, G.W.} } @conference {15336, title = {Assessment of Temperature Fluctuation Models for RANS Simulations of Hypersonic Reacting Flows}, booktitle = {38th AIAA Aerospace Sciences Meeting and Exhibit}, year = {2000}, month = {2000///}, address = {Reno, NV}, abstract = {Turbulence-chemistry interactions play an important role in various fluid flow problems. In a hypersonic boundary layer, these interactions can alter the surface heating rate of the vehicle by modifying the temperature profile across the layer. The effect of these interactions is accounted for in a Reynolds-averaged Navier Stokes (RANS) simulation using a probability density function (PDF) of the temperature distribution. In this paper, two presumed PDF models are considered, namely, the Martin and Candler model and the Gaffney et al. model, and their accuracy is assessed by comparing to direct numerical simulation (DNS) of homogeneous isotropic turbulence. TheMartin and Candler model reproduces the turbulence-chemistry interactions in the flow correctly whereas the Gaffney model overpredicts the temperature fluctuations.}, author = {Sinha,K. and Martin, M.P and Candler,G. V} } @article {15464, title = {Automated test oracles for GUIs}, journal = {SIGSOFT Softw. Eng. Notes}, volume = {25}, year = {2000}, month = {2000/11//}, pages = {30 - 39}, abstract = {Graphical User Interfaces (GUIs) are critical components of today{\textquoteright}s software. Because GUIs have different characteristics than traditional software, conventional testing techniques do not apply to GUI software. In previous work, we presented an approach to generate GUI test cases, which take the form of sequences of actions. In this paper we develop a test oracle technique to determine if a GUI behaves as expected for a given test case. Our oracle uses a formal model of a GUI, expressed as sets of objects, object properties, and actions. Given the formal model and a test case, our oracle automatically derives the expected state for every action in the test case. We represent the actual state of an executing GUI in terms of objects and their properties derived from the GUI{\textquoteright}s execution. Using the actual state acquired from an execution monitor, our oracle automatically compares the expected and actual states after each action to verify the correctness of the GUI for the test case. We implemented the oracle as a component in our GUI testing system, called Planning Assisted Tester for grapHical user interface Systems (PATHS), which is based on AI planning. We experimentally evaluated the practicality and effectiveness of our oracle technique and report on the results of experiments to test and verify the behavior of our version of the Microsoft WordPad{\textquoteright}s GUI.}, keywords = {automated oracles, GUI test oracles, GUI testing}, isbn = {0163-5948}, doi = {10.1145/357474.355050}, url = {http://doi.acm.org/10.1145/357474.355050}, author = {Memon, Atif M. and Pollack,Martha E. and Soffa,Mary Lou} } @article {15231, title = {The capacitated k-center problem}, journal = {SIAM Journal on Discrete Mathematics}, volume = {13}, year = {2000}, month = {2000///}, pages = {403 - 403}, author = {Khuller, Samir and Sussmann,Y. J} } @article {15131, title = {A chosen ciphertext attack against several e-mail encryption protocols}, journal = {Ninth USENIX Security Symposium}, year = {2000}, month = {2000///}, author = {Katz, Jonathan and Schneier,B.} } @article {15568, title = {Chromatic nearest neighbor searching: A query sensitive approach}, journal = {Computational Geometry}, volume = {17}, year = {2000}, month = {2000/12//}, pages = {97 - 119}, abstract = {The nearest neighbor problem is that of preprocessing a set P of n data points in Rd so that, given any query point q, the closest point in P to q can be determined efficiently. In the chromatic nearest neighbor problem, each point of P is assigned a color, and the problem is to determine the color of the nearest point to the query point. More generally, given k⩾1, the problem is to determine the color occurring most frequently among the k nearest neighbors. The chromatic version of the nearest neighbor problem is used in many applications in pattern recognition and learning. In this paper we present a simple algorithm for solving the chromatic k nearest neighbor problem. We provide a query sensitive analysis, which shows that if the color classes form spatially well separated clusters (as often happens in practice), then queries can be answered quite efficiently. We also allow the user to specify an error bound ε⩾0, and consider the same problem in the context of approximate nearest neighbor searching. We present empirical evidence that for well clustered data sets, this approach leads to significant improvements in efficiency.}, keywords = {BBD trees, Branch-and-bound search, Chromatic nearest neighbors, Classification algorithms, Multidimensional searching, pattern recognition, Query sensitive analysis}, isbn = {0925-7721}, doi = {10.1016/S0925-7721(00)00021-3}, url = {http://www.sciencedirect.com/science/article/pii/S0925772100000213}, author = {Mount, Dave and Netanyahu,Nathan S. and Silverman,Ruth and Wu,Angela Y.} } @article {17576, title = {Combinatorial Problems Arising in Deregulated Electrical Power Industry: Survey and Future Directions}, journal = {NONCONVEX OPTIMIZATION AND ITS APPLICATIONS}, volume = {42}, year = {2000}, month = {2000///}, pages = {138 - 162}, author = {Cook,D. and Hicks,G. and Faber,V. and Marathe,M. V and Srinivasan, Aravind and Sussmann,Y. J and Thornquist,H.} } @conference {18032, title = {Communication complexity of document exchange}, booktitle = {Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms}, series = {SODA {\textquoteright}00}, year = {2000}, month = {2000///}, pages = {197 - 206}, publisher = {Society for Industrial and Applied Mathematics}, organization = {Society for Industrial and Applied Mathematics}, address = {Philadelphia, PA, USA}, isbn = {0-89871-453-2}, url = {http://dl.acm.org/citation.cfm?id=338219.338252}, author = {Cormode,Graham and Paterson,Mike and Sahinalp,S{\"u}leyman Cenk and Vishkin, Uzi} } @conference {16919, title = {A comparison of voice controlled and mouse controlled web browsing}, booktitle = {Proceedings of the fourth international ACM conference on Assistive technologies}, series = {Assets {\textquoteright}00}, year = {2000}, month = {2000///}, pages = {72 - 79}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, keywords = {human-computer, interaction, User interfaces, voice browsers, voice recognition, web browsing}, isbn = {1-58113-313-8}, doi = {10.1145/354324.354345}, url = {http://doi.acm.org/10.1145/354324.354345}, author = {Christian,Kevin and Kules,Bill and Shneiderman, Ben and Youssef,Adel} } @article {17579, title = {Contention resolution with constant expected delay}, journal = {J. ACM}, volume = {47}, year = {2000}, month = {2000/11//}, pages = {1048 - 1096}, abstract = {We study contention resolution in a multiple-access channel such as the Ethernet channel. In the model that we consider, n users generate messages for the channel according to a probability distribution. Raghavan and Upfal have given a protocol in which the expected delay (time to get serviced) of every message is O(log n) when messages are generated according to a Bernoulli distribution with generation rate up to about 1/10. Our main results are the following protocols: (a) one in which the expected average message delay is O(1) when messages are generated according to a Bernoulli distribution with a generation rate smaller than 1/e, and (b) one in which the expected delay of any message is O(1) for an analogous model in which users are synchronized (i.e., they agree about the time), there are potentially an infinite number of users, and messages are generated according to a Poisson distribution with generation rate up to 1/e. (Each message constitutes a new user.)To achieve (a), we first show how to simulate (b) using n synchronized users, and then show how to build the synchronization into the protocol.}, keywords = {contention resolution, Ethernet, Markov chains, multiple-access channel}, isbn = {0004-5411}, doi = {10.1145/355541.355567}, url = {http://doi.acm.org/10.1145/355541.355567}, author = {Goldberg,Leslie Ann and Mackenzie,Philip D. and Paterson,Mike and Srinivasan, Aravind} } @article {17032, title = {Coordinating overviews and detail views of WWW log data}, journal = {Workshop on New Paradigms in Information Visualization and Manipulation (NPIVM 2000), ACM Press}, year = {2000}, month = {2000///}, abstract = {Web server log analysis tools provide site operators with useful information regarding the visitors to their sites.� Unfortunately, the utility of these tools is often limited by the use of aggregate summaries that hide the information associated with individual requests, and by the absence of contextual data that might help users interpret those summaries. Building upon earlier work in the use of starfield visualizations to display web site requests as individual data points [8], this paper describes the use of multiple-coordinated visualizations of web log data at varying granularities, and alongside additional related displays of appropriate contextual information.}, author = {Hochheiser,H. and Shneiderman, Ben} } @conference {16617, title = {Cortical inhibition as explained by the competitive distribution hypothesis}, booktitle = {Network models for control and processing}, year = {2000}, month = {2000///}, pages = {31 - 62}, author = {Reggia, James A. and Sutton III,G. G. and Lynne,C. and D{\textquoteright}Autrechy,S. C and Armentrout,S. L} } @article {17036, title = {Creating creativity: user interfaces for supporting innovation}, journal = {ACM Trans. Comput.-Hum. Interact.}, volume = {7}, year = {2000}, month = {2000/03//}, pages = {114 - 138}, abstract = {A challenge for human-computer interaction researchers and user interf ace designers is to construct information technologies that support creativity. This ambitious goal can be attained by building on an adequate understanding of creative processes. This article offers a four-phase framework for creativity that might assist designers in providing effective tools for users: (1)Collect: learn from provious works stored in libraries, the Web, etc.; (2) Relate: consult with peers and mentors at early, middle, and late stages, (3)Create: explore, compose, evaluate possible solutions; and (4) Donate: disseminate the results and contribute to the libraries. Within this integrated framework, this article proposes eight activities that require human-computer interaction research and advanced user interface design. A scenario about an architect illustrates the process of creative work within such an environment.}, keywords = {creativity support tools, direct manipulation, Graphical user interfaces, Human-computer interaction, Information Visualization}, isbn = {1073-0516}, doi = {10.1145/344949.345077}, url = {http://doi.acm.org/10.1145/344949.345077}, author = {Shneiderman, Ben} } @article {17043, title = {Credit for computer crashes?}, journal = {Ubiquity}, volume = {1}, year = {2000}, month = {2000///}, pages = {2 - 9}, author = {Gehl,J. and Shneiderman, Ben} } @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.} } @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} } @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} } @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 {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 {14764, title = {Efficient performance prediction for large-scale, data-intensive applications}, journal = {International Journal of High Performance Computing Applications}, volume = {14}, year = {2000}, month = {2000///}, pages = {216 - 216}, author = {Kurc, T. and Uysal, M. and Eom, H. and Hollingsworth, Jeffrey K and Saltz, J. and Sussman, Alan} } @article {17907, title = {Efficiently computing and updating triangle strips for real-time rendering}, journal = {Computer Aided Design}, volume = {32}, year = {2000}, month = {2000///}, pages = {753 - 772}, abstract = {Triangle strips are a widely used hardware-supported data-structure to compactly represent and efficiently render polygonal meshes. In thispaper we survey the efficient generation of triangle strips as well as their variants. We present efficient algorithms for partitioning polygonal meshes into triangle strips. Triangle strips have traditionally used a buffer size of two vertices. In this paper we also study the impact of larger buffer sizes and various queuing disciplines on the effectiveness of triangle strips. View-dependent simplification has emerged as a powerful tool for graphics acceleration in visualization of complex environments. However, in a view-dependent framework the triangle mesh connectivity changes at every frame making it difficult to use triangle strips. In this paper we present a novel data-structure, Skip Strip, that efficiently maintains triangle strips during such view-dependent changes. A Skip Strip stores the vertex hierarchy nodes in a skip-list-like manner with path compression. We anticipate that Skip Strips will provide a road-map to combine rendering acceleration techniques for static datasets, typical of retained-mode graphics applications, with those for dynamic datasets found in immediate-mode applications. }, author = {El-Sana,J. and Evans,F. and Kalaiah,A. and Varshney, Amitabh and Skiena,S. and Azanli,E.} } @book {12383, title = {Embedded multiprocessors: Scheduling and synchronization}, volume = {3}, year = {2000}, month = {2000///}, publisher = {CRC}, organization = {CRC}, author = {Sriram,S. and Bhattacharyya, Shuvra S.} } @article {18440, title = {The experimental validation and packaging of software technologies}, journal = {ACM SIGSOFT Software Engineering Notes}, volume = {25}, year = {2000}, month = {2000/01//}, pages = {82 - 83}, isbn = {0163-5948}, doi = {10.1145/340855.341021}, url = {http://doi.acm.org/10.1145/340855.341021}, author = {Shull, Forrest and Basili, Victor R. and Zelkowitz, Marvin V} } @conference {16453, title = {Exploiting concurrency in a DBMS implementation for production systems}, booktitle = {Proceedings of the first international symposium on Databases in parallel and distributed systems}, year = {2000}, month = {2000///}, pages = {34 - 45}, author = {Raschid, Louiqa and Sellis,T. and Lin,C. C} } @conference {17156, title = {Extending understanding of federal statistics in tables}, booktitle = {Proceedings of the 2000 annual national conference on Digital government research}, series = {dg.o {\textquoteright}00}, year = {2000}, month = {2000///}, pages = {1 - 7}, publisher = {Digital Government Society of North America}, organization = {Digital Government Society of North America}, abstract = {This paper describes progress toward improving user interfaces for US Federal government statistics that are presented in tables. Based on studies of user behaviors and needs related to statistical tables, we describe interfaces to assist diverse users with a range of statistical literacy to explore, find, understand, and use US Federal government statistics.}, keywords = {data exploration, dynamic queries, Statistics, tablular data, User interfaces}, url = {http://dl.acm.org/citation.cfm?id=1123075.1123079}, author = {Marchionini,Gary and Hert,Carol and Liddy,Liz and Shneiderman, Ben} } @article {16161, title = {Facilitating data exploration with query previews: A study of user performance and preference}, journal = {Behaviour \& Information Technology}, volume = {19}, year = {2000}, month = {2000///}, pages = {393 - 403}, abstract = {Networked and local data exploration systems that use command languages, menus, or form fill-in interfaces rarely give users an indication of the distribution of data. This often leads users to waste time, posing queries that have zero-hit or mega-hit results. Query previews are a novel visual approach for browsing databases. Query previews supply users with data distribution information for selected attributes of the database, and give continuous feedback about the size of the result set as the query is being formed. Subsequent refinements might be necessary to narrow the search. As there is a risk that query previews are an additional step, leading to a more complex and slow search process, a within-subjects empirical study was ran with 12 subjects who used interfaces with and without query previews and with minimized network delays. Even with 12 subjects and minimized network delays statistically significant differences were found, showing that query previews could speed up performance 1.6 to 2.1 times and lead to higher user satisfaction.Networked and local data exploration systems that use command languages, menus, or form fill-in interfaces rarely give users an indication of the distribution of data. This often leads users to waste time, posing queries that have zero-hit or mega-hit results. Query previews are a novel visual approach for browsing databases. Query previews supply users with data distribution information for selected attributes of the database, and give continuous feedback about the size of the result set as the query is being formed. Subsequent refinements might be necessary to narrow the search. As there is a risk that query previews are an additional step, leading to a more complex and slow search process, a within-subjects empirical study was ran with 12 subjects who used interfaces with and without query previews and with minimized network delays. Even with 12 subjects and minimized network delays statistically significant differences were found, showing that query previews could speed up performance 1.6 to 2.1 times and lead to higher user satisfaction. }, isbn = {0144-929X}, doi = {10.1080/014492900750052651}, url = {http://www.tandfonline.com/doi/abs/10.1080/014492900750052651}, author = {Tanin,Egemen and Lotem,Amnon and Haddadin,Ihab and Shneiderman, Ben and Plaisant, Catherine and Slaughter,Laura} } @article {15234, title = {Fault tolerant K-center problems}, journal = {Theoretical Computer Science}, volume = {242}, year = {2000}, month = {2000/07/06/}, pages = {237 - 245}, abstract = {The basic K-center problem is a fundamental facility location problem, where we are asked to locate K facilities in a graph, and to assign vertices to facilities, so as to minimize the maximum distance from a vertex to the facility to which it is assigned. This problem is known to be NP-hard, and several optimal approximation algorithms that achieve an approximation factor of 2 have been developed for it. We focus our attention on a generalization of this problem, where each vertex is required to have a set of α (α⩽K) centers close to it. In particular, we study two different versions of this problem. In the first version, each vertex is required to have at least α centers close to it. In the second version, each vertex that does not have a center placed on it is required to have at least α centers close to it. For both these versions we are able to provide polynomial time approximation algorithms that achieve constant approximation factors for any α. For the first version we give an algorithm that achieves an approximation factor of 3 for any α, and achieves an approximation factor of 2 for α\<4. For the second version, we provide algorithms with approximation factors of 2 for any α. The best possible approximation factor for even the basic K-center problem is 2, assuming P/=NP. In addition, we give a polynomial time approximation algorithm for a generalization of the K-supplier problem where a subset of at most K supplier nodes must be selected as centers so that every demand node has at least α centers close to it. For this version our approximation factor is 3. The best possible approximation factor for even the basic K-supplier problem is 3, assuming P/=NP.}, keywords = {Approximation algorithms, Facility location, Fault-tolerance, K-center}, isbn = {0304-3975}, doi = {10.1016/S0304-3975(98)00222-9}, url = {http://www.sciencedirect.com/science/article/pii/S0304397598002229}, author = {Khuller, Samir and Pless,Robert and Sussmann,Yoram J.} } @article {12810, title = {GCCS: A graphical coordination language for system specification}, journal = {Coordination Languages and Models}, year = {2000}, month = {2000///}, pages = {207 - 212}, author = {Cleaveland, Rance and Du,X. and Smolka,S.} } @article {17675, title = {A Generalization of Saad{\textquoteright}s Theorem on Rayleigh-Ritz Approximations}, volume = {UMIACS-TR-99-78}, year = {2000}, month = {2000/02/04/}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {Let $(\lambda,x)$ be an eigenpair of the Hermitian matrix $A$ of order$n$ and let $(\mu,u)$ be a Ritz pair from a subspace $\clk$ of $\comp^{2}$. Saad has given a simple inequality bounding $\sin\angle(x,u)$ in terms of $\sin\angle(x,\clk)$. In this note we show that this inequality can be extended to an equally simple inequality for eigenspaces of non-Hermitian matrices. (Also cross-referenced as UMIACS-TR-99-78) }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/1050}, author = {Stewart, G.W.} } @article {18960, title = {The genome sequence of Drosophila melanogaster}, journal = {Science}, volume = {287}, year = {2000}, month = {2000///}, pages = {2185 - 2185}, abstract = {The fly Drosophila melanogaster is one of the most intensively studied organisms in biology and serves as a model system for the investigation of many developmental and cellular processes common to higher eukaryotes, including humans. We have determined the nucleotide sequence of nearly all of the \~{}120-megabase euchromatic portion of theDrosophila genome using a whole-genome shotgun sequencing strategy supported by extensive clone-based sequence and a high-quality bacterial artificial chromosome physical map. Efforts are under way to close the remaining gaps; however, the sequence is of sufficient accuracy and contiguity to be declared substantially complete and to support an initial analysis of genome structure and preliminary gene annotation and interpretation. The genome encodes \~{}13,600 genes, somewhat fewer than the smaller Caenorhabditis elegansgenome, but with comparable functional diversity.}, isbn = {0036-8075, 1095-9203}, doi = {10.1126/science.287.5461.2185}, url = {http://www.sciencemag.org/content/287/5461/2185}, author = {Adams,M.D. and Celniker,S.E. and Holt,R.A. and Evans,C.A. and Gocayne,J.D. and Amanatides,P.G. and Scherer,S.E. and Li,P.W. and Hoskins,R.A. and Galle,R.F. and others} } @conference {13567, title = {Hidden Markov Models for Images}, booktitle = {ICPR}, year = {2000}, month = {2000///}, pages = {147 - 150}, abstract = {In this paper we investigate how speech recognition techniques can be extended to image processing. We describe a method for learning statistical models of images using a second order hidden Markov mesh model. First, an image can be segmented in a way that best matches its statistical model by an approach related to the dynamic programming used for segmenting Markov chains. Second, given an image segmentation a statistical model (3D state transition matrix and observation distributions within states) can be estimated. These two steps are repeated until convergence to provide both a segmentation and a statistical model of the image. We also describe a semi-Markov modeling technique in which the distributions of widths and heights of segmented regions are modeled explicitly by gamma distributions in a way related to explicit duration modeling in HMMs. Finally, we propose a statistical distance measure between images based on the similarity of their statistical models for classication and retrieval tasks.}, author = {DeMenthon,D. and Stuckelberg,M. Vuilleumier and David Doermann} } @article {17603, title = {Improved Algorithms via Approximations of Probability Distributions}, journal = {Journal of Computer and System Sciences}, volume = {61}, year = {2000}, month = {2000/08//}, pages = {81 - 107}, abstract = {We present two techniques for constructing sample spaces that approximate probability distributions. The first is a simple method for constructing the small-bias probability spaces introduced by Naor and Naor. We show how to efficiently combine this construction with the method of conditional probabilities to yield improved parallel algorithms for problems such as set discrepancy, finding large cuts in graphs, and finding large acyclic subgraphs. The second is a construction of small probability spaces approximating general independent distributions which are of smaller size than the constructions of Even, Goldreich, Luby, Nisan, and Veli{\v c}kovi{\'c}.}, keywords = {derandomization, discrepancy, explicit constructions, graph coloring, Parallel algorithms, small sample spaces}, isbn = {0022-0000}, doi = {10.1006/jcss.1999.1695}, url = {http://www.sciencedirect.com/science/article/pii/S0022000099916951}, author = {Chari,Suresh and Rohatgi,Pankaj and Srinivasan, Aravind} } @article {14128, title = {Iterative methods for stabilized discrete convection-diffusion problems}, journal = {IMA journal of numerical analysis}, volume = {20}, year = {2000}, month = {2000///}, pages = {333 - 333}, author = {Shih, Y. T and Elman, Howard} } @article {17705, title = {Iterative regularization and MINRES}, journal = {SIAM Journal on Matrix Analysis and Applications}, volume = {21}, year = {2000}, month = {2000///}, pages = {613 - 628}, abstract = {In this paper we present three theorems which give insight into the regularizingproperties of MINRES. While our theory does not completely characterize the regularizing behavior of the algorithm, it provides a partial explanation of the observed behavior of the method. Unlike traditional attempts to explain the regularizing properties of Krylov subspace methods, our approach focuses on convergence properties of the residual rather than on convergence analysis of the harmonic Ritz values. The import of our analysis is illustrated by two examples. In particular, our theoret- ical and numerical results support the following important observation: in some circumstances the dimension of the optimal Krylov subspace can be much smaller than the number of the components of the truncated spectral solution that must be computed to attain comparable accuracy. }, author = {Kilmer,M. and Stewart, G.W.} } @article {14980, title = {Kronos: A software system for the processing and retrieval of large-scale AVHRR data sets}, journal = {PE \& RS- Photogrammetric Engineering and Remote Sensing}, volume = {66}, year = {2000}, month = {2000///}, pages = {1073 - 1082}, abstract = {Raw remotely sensed satellite data have to be processed andmapped into a standard projection in order to produce a multi- temporal data set which can then be used for regional or global Earth science studies. However, traditional methods of processing remotely sensed satellite data have inherent limitations because they are based on a fixed processing chain. Different users may need the data in different forms with possibly different processing steps; hence, additional transformations may have to be applied to the processed data, resulting in potentially significant errors. In this paper, we describe a software system, Kronos, for the generation of custom-tailored products from the Advanced Very High Resolution Radiometer (AVHRR) sensor. It allows the generation of a rich set of products that can be easily specified through a simple interface by scientists wishing to carry out Earth system modeling or analysis. Kronos is based on a flexible methodology and consists of four major components: ingest and preprocessing, indexing and storage, a search and processing engine, and a Java interface. After geo-location and calibration, every pixel is indexed and stored using a combination of data structures. Following the users{\textquoteright} queries, data are selectively retrieved and secondary processing such as atmospheric correction, compositing, and projection are performed as specified. The processing is divided into two stages, the first of which involves the geo-location and calibration of the remotely sensed data and, hence, results in no loss of information. The second stage involves the retrieval of the appropriate data subsets and the application of the secondary processing specified by the user. This scheme allows the indexing and the storage of data from different sensors without any loss of information and, therefore, allows assimilation of data from multiple sensors. User specified processing can be applied later as needed. }, author = {Zhang,Z. and JaJa, Joseph F. and Bader, D.A. and Kalluri, SNV and Song,H. and El Saleous,N. and Vermote,E. and Townshend,J.R.G.} } @article {17417, title = {The limits of speech recognition}, journal = {Communications of the ACM}, volume = {43}, year = {2000}, month = {2000/09//}, pages = {63 - 65}, isbn = {0001-0782}, doi = {10.1145/348941.348990}, url = {http://doi.acm.org/10.1145/348941.348990}, author = {Shneiderman, Ben} } @conference {13583, title = {Live multimedia adaptation through wireless hybrid networks}, booktitle = {Multimedia and Expo, 2000. ICME 2000. 2000 IEEE International Conference on}, volume = {3}, year = {2000}, month = {2000///}, pages = {1697 -1700 vol.3 - 1697 -1700 vol.3}, abstract = {We present new techniques to intelligently adapt and combine multimedia presentations in real-time, mobile service environments. We present the techniques necessary to perform mobile multimedia processing for multiple video streams with ldquo;value-adding rdquo; information. The adaptation uses video analysis, content-recognition and automated annotation to provide scalable and interactive presentations over hybrid networks to mobile terminals. As a concrete case, we present a mobile surveillance service called Princess, which has several video sources and supports control information, terminal adaptation and end-to-end service}, keywords = {adaptation;mobile, adaptation;value-adding, analysis;wireless, annotation;content-recognition;end-to-end, communication;multimedia, communication;real-time, hybrid, information;video, LAN;, multimedia, networks;mobile, Princess;automated, processing;mobile, service;live, service;mobile, streams;real-time, Surveillance, system;terminal, systems;surveillance;wireless, terminals;multiple, video}, doi = {10.1109/ICME.2000.871098}, author = {Koivisto,A. and Pietkainen,P. and Sauvola,J. and David Doermann} } @conference {18678, title = {Loki: a state-driven fault injector for distributed systems}, year = {2000}, month = {2000///}, pages = {237 - 242}, abstract = {Distributed applications can fail in subtle ways that depend on the state of multiple parts of a system. This complicates the validation of such systems via fault injection, since it suggests that faults should be injected based on the global state of the system. In Loki, fault injection is performed based on a partial view of the global state of a distributed system, i.e. faults injected in one node of the system can depend on the state of other nodes. Once faults are injected, a post-runtime analysis, using off-line clock synchronization, is used to place events and injections on a single global timeline and to determine whether the intended faults were properly injected. Finally, experiments containing successful fault injections are used to estimate the specified measures. In addition to briefly reviewing the concepts behind Loki and its organization, we detail Loki{\textquoteright}s user interface. In particular, we describe the graphical user interfaces for specifying state machines and faults, for executing a campaign and for verifying whether the faults were properly injected}, keywords = {campaign execution, computer testing, distributed applications failure, distributed processing, distributed system validation, Fault diagnosis, fault event placement, fault specification, global system state, global timeline, Graphical user interfaces, Loki, off-line clock synchronization, post-runtime analysis, specified measures estimation, state machine specification, state-driven fault injection, Synchronisation}, doi = {10.1109/ICDSN.2000.857544}, author = {Chandra,R. and Lefever,R.M. and Michel Cukier and Sanders,W. H.} } @article {17617, title = {Low discrepancy sets yield approximate min-wise independent permutation families}, journal = {Information Processing Letters}, volume = {73}, year = {2000}, month = {2000/01/31/}, pages = {29 - 32}, abstract = {Motivated by a problem of filtering near-duplicate Web documents, Broder, Charikar, Frieze and Mitzenmacher defined the following notion of ϵ-approximate min-wise independent permutation families. A multiset F of permutations of {0,1,{\textellipsis},n-1} is such a family if for all K⫅{0,1,{\textellipsis},n-1} and any x∈K, a permutation π chosen uniformly at random from F satisfies |Pr[min{π(K)}=π(x)]-1|K||<=ϵ|K|. We show connections of such families with low discrepancy sets for geometric rectangles, and give explicit constructions of such families F of size nO(logn) for ϵ=1/nΘ(1), improving upon the previously best-known bound of Indyk. We also present polynomial-size constructions when the min-wise condition is required only for |K|<=2O(log2/3n), with ϵ>=2-O(log2/3n).}, keywords = {combinatorial problems, Document filtering, explicit constructions, Information retrieval, Min-wise independent permutations, Pseudorandom permutations}, isbn = {0020-0190}, doi = {10.1016/S0020-0190(99)00163-5}, url = {http://www.sciencedirect.com/science/article/pii/S0020019099001635}, author = {Saks,Michael and Srinivasan, Aravind and Zhou,Shiyu and Zuckerman,David} } @article {17619, title = {Low-discrepancy sets for high-dimensional rectangles: a survey}, journal = {Bulletin of the EATCS}, volume = {70}, year = {2000}, month = {2000///}, pages = {67 - 76}, abstract = {A sub-area of discrepancy theory that has received much attention in computer science re-cently, is that of explicit constructions of low-discrepancy point sets for various types of rectangle families in high dimension. This research has led to interesting applications in error-control cod- ing, distributed protocols, Web document filtering, derandomization, and other areas. We give a short survey of this area here. }, author = {Srinivasan, Aravind} } @article {17286, title = {Making Computer and Internet Usability a Priority}, year = {2000}, month = {2000/10/04/}, abstract = {A management oriented essay on how to promote usability inorganizations. It begins with crafting the message (Good usability is good business). Then it deals with creating a cultural shift in information technology and software engineering departments, so that the impact of poor design and the benefits of improvements are widely understood. It closes with an eight-step call to action. Keywords: usability, technology fluency, user-centered design, software engineering (Also cross-referenced as UMIACS-TR-2000-70) }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/1106}, author = {Kreitzberg,Charles B and Shneiderman, Ben} } @conference {14987, title = {MOCHA: a database middleware system featuring automatic deployment of application-specific functionality}, booktitle = {Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, Dallas, Texas}, year = {2000}, month = {2000///}, author = {Rodr{\i}guez-Martinez,M. and Roussopoulos, Nick and McGann,J. M and Keyley,S. and Katz,V. and Song,Z. and JaJa, Joseph F.} } @conference {14232, title = {Multi-camera networks: eyes from eyes}, booktitle = {IEEE Workshop on Omnidirectional Vision, 2000. Proceedings}, year = {2000}, month = {2000///}, pages = {11 - 18}, publisher = {IEEE}, organization = {IEEE}, abstract = {Autonomous or semi-autonomous intelligent systems, in order to function appropriately, need to create models of their environment, i.e., models of space time. These are descriptions of objects and scenes and descriptions of changes of space over time, that is, events and actions. Despite the large amount of research on this problem, as a community we are still far from developing robust descriptions of a system{\textquoteright}s spatiotemporal environment using video input (image sequences). Undoubtedly, some progress has been made regarding the understanding of estimating the structure of visual space, but it has not led to solutions to specific applications. There is, however, an alternative approach which is in line with today{\textquoteright}s {\textquotedblleft}zeitgeist.{\textquotedblright} The vision of artificial systems can be enhanced by providing them with new eyes. If conventional video cameras are put together in various configurations, new sensors can be constructed that have much more power and the way they {\textquotedblleft}see{\textquotedblright} the world makes it much easier to solve problems of vision. This research is motivated by examining the wide variety of eye design in the biological world and obtaining inspiration for an ensemble of computational studies that relate how a system sees to what that system does (i.e. relating perception to action). This, coupled with the geometry of multiple views that has flourished in terms of theoretical results in the past few years, points to new ways of constructing powerful imaging devices which suit particular tasks in robotics, visualization, video processing, virtual reality and various computer vision applications, better than conventional cameras. This paper presents a number of new sensors that we built using common video cameras and shows their superiority with regard to developing models of space and motion}, keywords = {Biosensors, CAMERAS, Computer vision, Eyes, Image sequences, intelligent systems, Layout, Machine vision, Robot vision systems, Robustness, Spatiotemporal phenomena, video cameras, Virtual reality}, isbn = {0-7695-0704-2}, doi = {10.1109/OMNVIS.2000.853797}, author = {Ferm{\"u}ller, Cornelia and Aloimonos, J. and Baker, P. and Pless, R. and Neumann, J. and Stuart, B.} } @article {17676, title = {A new relative perturbation theorem for singular subspaces}, journal = {Linear Algebra and its Applications}, volume = {313}, year = {2000}, month = {2000/07/01/}, pages = {41 - 51}, abstract = {This note addresses the sensitivity of singular subspaces of a matrix under relative perturbations. It employs a new technique of separating a multiplicative perturbation D into two components: one is the distance of a scalar multiple of D to the nearest unitary matrix Q and the other is the distance of Q to the identity. Consequently, the new bounds reflect the intrinsic differences in how left and right multiplicative perturbations affect left and right singular subspaces.}, keywords = {Multiplicative perturbation, Relative gap, Relative perturbation theory, Singular subspace}, isbn = {0024-3795}, doi = {10.1016/S0024-3795(00)00074-4}, url = {http://www.sciencedirect.com/science/article/pii/S0024379500000744}, author = {Li,Ren-Cang and Stewart, G.W.} } @conference {17640, title = {Optimal design of signaling networks for Internet telephony}, booktitle = {IEEE INFOCOM 2000. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings}, volume = {2}, year = {2000}, month = {2000///}, pages = {707-716 vol.2 - 707-716 vol.2}, publisher = {IEEE}, organization = {IEEE}, abstract = {We present an approach for efficient design of a signaling network for a network of software switches supporting Internet telephony. While one may take an integer programming approach to solve this problem, it quickly becomes intractable even for modest-sized networks. Instead, our topology design uses random graphs that we show to be nearly optimal in cost, highly connected, and computationally efficient even for large networks. We then formulate a quadratic assignment problem (QAP) to map the abstract topology into the physical network to achieve optimal load balancing for given demand forecasts, which we solve using randomized heuristics. Numerical results on several example networks illustrate the performance and computational efficiency of our method. A graphical design tool has been developed based on our algorithms}, keywords = {bandwidth allocation, Computational efficiency, Computer networks, Cost function, Demand forecasting, demand forecasts, graph theory, graphical design tool, Internet telephony, Linear programming, Load forecasting, Load management, Network topology, optimal design, optimal load balancing, optimisation, performance, quadratic assignment problem, random graphs, randomised algorithms, randomized heuristics, Signal design, signaling networks, Switches, telecommunication signalling, topology design}, isbn = {0-7803-5880-5}, doi = {10.1109/INFCOM.2000.832245}, author = {Srinivasan, Aravind and Ramakrishnan,K. G and Kumaran,K. and Aravamudan,M. and Naqvi,S.} } @conference {17880, title = {Optimizing retrieval and processing of multi-dimensional scientific datasets}, booktitle = {Parallel and Distributed Processing Symposium, 2000. IPDPS 2000. Proceedings. 14th International}, year = {2000}, month = {2000///}, pages = {405 - 410}, publisher = {IEEE}, organization = {IEEE}, abstract = {We have developed the Active Data Repository (ADR), an infrastructure that integrates storage, retrieval, and processing of large multi-dimensional scientific datasets on distributed memory parallel machines with multiple disks attached to each node. In earlier work, we proposed three strategies for processing range queries within the ADR framework. Our experimental results show that the relative performance of the strategies changes under varying application characteristics and machine configurations. In this work we investigate approaches to guide and automate the selection of the best strategy for a given application and machine configuration. We describe analytical models to predict the relative performance of the strategies where input data elements are uniformly distributed in the attribute space of the output dataset, restricting the output dataset to be a regular d-dimensional array}, keywords = {active data repository, Area measurement, Computer science, Data analysis, distributed memory parallel machines, Educational institutions, Information retrieval, Information Storage and Retrieval, infrastructure, Microscopy, Microwave integrated circuits, multi-dimensional scientific datasets retrieval, PARALLEL PROCESSING, Pathology, range queries, regular d-dimensional array, Satellites, Tomography}, isbn = {0-7695-0574-0}, doi = {10.1109/IPDPS.2000.846013}, author = {Chang,Chialin and Kurc, T. and Sussman, Alan and Saltz, J.} } @article {17319, title = {Performance Benefits of Simultaneous Over Sequential Menus as Task Complexity Increases}, journal = {International Journal of Human-Computer Interaction}, volume = {12}, year = {2000}, month = {2000///}, pages = {173 - 192}, abstract = {To date, experimental comparisons of menu layouts have concentrated on variants of hierarchical structures of sequentially presented menus. Simultaneous menus-layouts that present multiple active menus on a screen at the same time-are an alternative arrangement that may be useful in many Web design situations. This article describes an experiment involving a between-subject comparison of simultaneous menus and their traditional sequential counterparts. A total of 20 experienced Web users used either simultaneous or sequential menus in a standard Web browser to answer questions based on U.S. Census data. Our results suggest that appropriate use of simultaneous menus can lead to improved task performance speeds without harming subjective satisfaction measures. For novice users performing simple tasks, the simplicity of sequential menus appears to be helpful, but experienced users performing complex tasks may benefit from simultaneous menus. Design improvements can amplify the benefits of simultaneous menu layouts.To date, experimental comparisons of menu layouts have concentrated on variants of hierarchical structures of sequentially presented menus. Simultaneous menus-layouts that present multiple active menus on a screen at the same time-are an alternative arrangement that may be useful in many Web design situations. This article describes an experiment involving a between-subject comparison of simultaneous menus and their traditional sequential counterparts. A total of 20 experienced Web users used either simultaneous or sequential menus in a standard Web browser to answer questions based on U.S. Census data. Our results suggest that appropriate use of simultaneous menus can lead to improved task performance speeds without harming subjective satisfaction measures. For novice users performing simple tasks, the simplicity of sequential menus appears to be helpful, but experienced users performing complex tasks may benefit from simultaneous menus. Design improvements can amplify the benefits of simultaneous menu layouts. }, isbn = {1044-7318}, doi = {10.1207/S15327590IJHC1202_2}, url = {http://www.tandfonline.com/doi/abs/10.1207/S15327590IJHC1202_2}, author = {Hochheiser,Harry and Shneiderman, Ben} } @article {13011, title = {Phylogenetic relationships of Acanthocephala based on analysis of 18S ribosomal RNA gene sequences}, journal = {J Mol Evol}, volume = {50}, year = {2000}, month = {2000/06//}, pages = {532 - 540}, abstract = {Acanthocephala (thorny-headed worms) is a phylum of endoparasites of vertebrates and arthropods, included among the most phylogenetically basal tripoblastic pseudocoelomates. The phylum is divided into three classes: Archiacanthocephala, Palaeacanthocephala, and Eoacanthocephala. These classes are distinguished by morphological characters such as location of lacunar canals, persistence of ligament sacs in females, number and type of cement glands in males, number and size of proboscis hooks, host taxonomy, and ecology. To understand better the phylogenetic relationships within Acanthocephala, and between Acanthocephala and Rotifera, we sequenced the nearly complete 18S rRNA genes of nine species from the three classes of Acanthocephala and four species of Rotifera from the classes Bdelloidea and Monogononta. Phylogenetic relationships were inferred by maximum-likelihood analyses of these new sequences and others previously determined. The analyses showed that Acanthocephala is the sister group to a clade including Eoacanthocephala and Palaeacanthocephala. Archiacanthocephala exhibited a slower rate of evolution at the nucleotide level, as evidenced by shorter branch lengths for the group. We found statistically significant support for the monophyly of Rotifera, represented in our analysis by species from the clade Eurotatoria, which includes the classes Bdelloidea and Monogononta. Eurotatoria also appears as the sister group to Acanthocephala.}, author = {Garc{\'\i}a-Varela,M and P{\'e}rez-Ponce de Le{\'o}n,G. and de la Torre,P and Cummings, Michael P. and Sarma,SS and Laclette,J. P} } @article {15449, title = {A planning-based approach to GUI testing}, journal = {Proceedings of The 13th International Software/Internet Quality Week}, year = {2000}, month = {2000///}, author = {Memon, Atif M. and Pollack,M. E and Soffa,M. L} } @article {18987, title = {Pre-Messenger RNA Processing Factors in the Drosophila Genome}, journal = {The Journal of Cell BiologyJ Cell Biol}, volume = {150}, year = {2000}, month = {2000/07/24/}, pages = {F37-F44 - F37-F44}, abstract = {In eukaryotes, messenger RNAs are generated by a process that includes coordinated splicing and 3' end formation. Factors essential for the splicing of mRNA precursors (pre-mRNA) in eukaryotes have been identified primarily through the study of nuclear extracts derived from mammalian cells and Saccharomyces cerevisiae genetics. Here, we identify homologues of most known pre-mRNA processing factors in the recently completed sequence of the Drosophila genome. The set of proteins required for RNA processing shows remarkably little variation among eukaryotic species, and individual proteins are highly conserved. In general, proteins involved in the mechanics of RNA processing are even more conserved than proteins involved in the interpretation of RNA processing signals. The genome does not appear to contain a gene for the U11 RNA, or for a protein unique to the U11 snRNP, which raises the possibility that the U12-dependent spliceosome functions without U11 in Drosophila.}, isbn = {0021-9525, 1540-8140}, doi = {10.1083/jcb.150.2.F37}, url = {http://jcb.rupress.org/content/150/2/F37}, author = {Mount, Stephen M. and Salz,Helen K.} } @article {17327, title = {Previews and overviews in digital libraries: Designing surrogates to support visual information seeking}, journal = {Journal of the American Society for Information Science}, volume = {51}, year = {2000}, month = {2000/01/01/}, pages = {380 - 393}, abstract = {To aid designers of digital library interfaces, we present a framework for the design of information representations in terms of previews and overviews. Previews and overviews are graphic or textual representations of information abstracted from primary information objects. Previews act as surrogates for one or a few objects and overviews represent collections of objects. A design framework is elaborated in terms of the following three dimensions: (1) what information objects are available to users, (2) how information objects are related and displayed, and (3) how users can manipulate information objects. When utilized properly, previews and overviews allow users to rapidly discriminate objects of interest from those not of interest, and to more fully understand the scope and nature of digital libraries. This article presents a definition of previews and overviews in context, provides design guidelines, and describes four example applications.}, isbn = {1097-4571}, doi = {10.1002/(SICI)1097-4571(2000)51:4<380::AID-ASI7>3.0.CO;2-5}, url = {http://onlinelibrary.wiley.com/doi/10.1002/(SICI)1097-4571(2000)51:4\%3C380::AID-ASI7\%3E3.0.CO;2-5/abstract;jsessionid=E15C609DE95671E0E91A862B8AFD1CC6.d03t01}, author = {Greene,Stephan and Marchionini,Gary and Plaisant, Catherine and Shneiderman, Ben} } @article {17521, title = {A protocol-independent technique for eliminating redundant network traffic}, journal = {ACM SIGCOMM Computer Communication Review}, volume = {30}, year = {2000}, month = {2000///}, pages = {87 - 95}, author = {Spring, Neil and Wetherall,D.} } @article {15607, title = {Quantile approximation for robust statistical estimation and k-enclosing problems}, journal = {International Journal of Computational Geometry and Applications}, volume = {10}, year = {2000}, month = {2000///}, pages = {593 - 608}, abstract = {Given a set P of n points in Rd, a fundamental problem in computational geometryis concerned with finding the smallest shape of some type that encloses all the points of P. Well-known instances of this problem include finding the smallest enclosing box, minimum volume ball, and minimum volume annulus. In this paper we consider the following variant: Given a set of n points in Rd, find the smallest shape in question that contains at least k points or a certain quantile of the data. This type of problem is known as a k-enclosing problem. We present a simple algorithmic framework for computing quantile approximations for the minimum strip, ellipsoid, and annulus containing a given quantile of the points. The algorithms run in O(n log n) time. }, author = {Mount, Dave and Netanyahu,N. S and Piatko,C. D and Silverman,R. and Wu,A. Y} } @conference {17532, title = {Receiver based management of low bandwidth access links}, booktitle = {IEEE INFOCOM 2000. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings}, volume = {1}, year = {2000}, month = {2000///}, pages = {245-254 vol.1 - 245-254 vol.1}, publisher = {IEEE}, organization = {IEEE}, abstract = {In this paper, we describe a receiver-based congestion control policy that leverages TCP flow control mechanisms to prioritize mixed traffic loads across access links. We manage queueing at the access link to: (1) improve the response time of interactive network applications; (2) reduce congestion-related packet losses; while (3) maintaining high throughput for bulk-transfer applications. Our policy controls queue length by manipulating receive socket buffer sizes. We have implemented this solution in a dynamically loadable Linux kernel module, and tested it over low-bandwidth links. Our approach yields a 7-fold improvement in packet latency over an unmodified system while maintaining 94\% link utilization. In the common case, congestion-related packet losses at the access link can be eliminated. Finally, by prioritizing short flows, we show that our system reduces the time to download a complex Web page during a large background transfer by a factor of two}, keywords = {Bandwidth, buffer storage, bulk-transfer applications, complex Web page, congestion control policy, Delay, dynamically loadable Linux kernel module, information resources, interactive network, Internet, Kernel, link utilization, Linux, low-bandwidth access links, mixed traffic load, packet latency, queue length, queueing theory, receive socket buffer sizes, receiver-based management, response time, short flow prioritizing, Size control, Sockets, subscriber loops, TCP flow control, telecommunication congestion control, telecommunication network management, Telecommunication traffic, Testing, Throughput, Transport protocols, Unix, Web pages}, isbn = {0-7803-5880-5}, doi = {10.1109/INFCOM.2000.832194}, author = {Spring, Neil and Chesire,M. and Berryman,M. and Sahasranaman,V. and Anderson,T. and Bershad,B.} } @article {17345, title = {Report on closing the digital divide: meeting of the Deparment of Commerce, Washington, DC December 9, 1999}, journal = {ACM SIGCHI Bulletin}, volume = {32}, year = {2000}, month = {2000/04//}, pages = {43 - 44}, isbn = {0736-6906}, doi = {10.1145/360405.360445}, url = {http://doi.acm.org/10.1145/360405.360445}, author = {Shneiderman, Ben} } @article {17347, title = {Research Alerts}, journal = {Interactions}, volume = {7}, year = {2000}, month = {2000/11//}, pages = {9 - 17}, isbn = {1072-5520}, doi = {10.1145/352580.352583}, url = {http://doi.acm.org/10.1145/352580.352583}, editor = {Shneiderman, Ben} } @article {12363, title = {Resynchronization for multiprocessor DSP systems}, journal = {Circuits and Systems I: Fundamental Theory and Applications, IEEE Transactions on}, volume = {47}, year = {2000}, month = {2000///}, pages = {1597 - 1609}, author = {Bhattacharyya, Shuvra S. and Sriram,S. and Lee,E. A} } @article {17651, title = {Retrieval scheduling for collaborative multimedia presentations}, journal = {Multimedia Systems}, volume = {8}, year = {2000}, month = {2000///}, pages = {146 - 155}, abstract = {The single-system approach is no longer sufficient to handle the load on popular Internet servers, especially for those offering extensive multimedia content. Such services have to be replicated to enhance their availability, performance, and reliability. In a highly replicated and available environment, server selection is an important issue. In this paper, we propose an application-layer broker (ALB) for this purpose. ALB employs a content-based, client-centric approach to negotiate with the servers and to identify the best server for the requested objects. ALB aims to maximize client buffer utilization in order to efficiently handle dynamic user interactions such as skip, reverse presentation, go back in time. We also present details of a collaborative multimedia presentation platform that we have developed based on ALB.}, isbn = {0942-4962}, url = {http://dx.doi.org/10.1007/s005300050157}, author = {Bai,Ping and Prabhakaran,B. and Srinivasan, Aravind} } @inbook {14732, title = {Scalable Resource Control in Active Networks}, booktitle = {Active NetworksActive Networks}, series = {Lecture Notes in Computer Science}, volume = {1942}, year = {2000}, month = {2000///}, pages = {343 - 357}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {The increased complexity of the service model relative to store-and-forward routers has made resource management one of the paramount concerns in active networking research and engineering. In this paper,we address two major challenges in scaling resource management-to-many-node active networks. The first is the use of market mechanisms and trading amongst nodes and programs with varying degrees of competition and cooperation to provide a scalable approach to managing active network resources. The second is the use of a trust-management architecture to ensure that the participants in the resource management marketplace have a policy-driven {\textquotedblleft}rule of law{\textquotedblright} in which marketplace decisions can be made and relied upon. We have used lottery scheduling and the Keynote trust-management system for our implementation, for which we provide some initial performance indications.}, isbn = {978-3-540-41179-6}, url = {http://dx.doi.org/10.1007/3-540-40057-5_25}, author = {Anagnostakis,Kostas and Hicks, Michael W. and Ioannidis,Sotiris and Keromytis,Angelos and Smith,Jonathan}, editor = {Yasuda,Hiroshi} } @article {12089, title = {Secure quality of service handling: SQoSH}, journal = {IEEE Communications Magazine}, volume = {38}, year = {2000}, month = {2000/04//}, pages = {106 - 112}, abstract = {Proposals for programmable network infrastructures, such as active networks and open signaling, provide programmers with access to network resources and data structures. The motivation for providing these interfaces is accelerated introduction of new services, but exposure of the interfaces introduces many new security risks. We describe some of the security issues raised by active networks. We then describe our secure active network environment (SANE) architecture. SANE was designed as a security infrastructure for active networks, and was implemented in the SwitchWare architecture. SANE restricts the actions that loaded modules can perform by restricting the resources that can be named; this is further extended to remote invocation by means of cryptographic credentials. SANE can be extended to support restricted control of quality of service in a programmable network element. The Piglet lightweight device kernel provides a {\textquotedblleft}virtual clock{\textquotedblright} type of scheduling discipline for network traffic, and exports several tuning knobs with which the clock can be adjusted. The ALIEN active loader provides safe access to these knobs to modules that operate on the network element. Thus, the proposed SQoSH architecture is able to provide safe, secure access to network resources, while allowing these resources to be managed by end users needing customized networking services. A desirable consequence of SQoSH{\textquoteright}s integration of access control and resource control is that a large class of denial-of-service attacks, unaddressed solely with access control and cryptographic protocols, can now be prevented}, keywords = {Acceleration, Access control, active networks, ALIEN active loader, Clocks, Computer network management, cryptographic credentials, cryptography, customized networking services, Data security, Data structures, denial-of-service attacks, interfaces, Kernel, loaded modules, network resources, network traffic, open signaling, packet switching, Piglet lightweight device kernel, programmable network element, programmable network infrastructures, Programming profession, Proposals, quality of service, remote invocation, resource control, restricted control of quality of service, SANE, scheduling, scheduling discipline, secure active network environment architecture, secure quality of service handling, security infrastructure, security risks, SQoSH, SwitchWare architecture, telecommunication security, tuning knobs, virtual clock}, isbn = {0163-6804}, doi = {10.1109/35.833566}, author = {Alexander,D. S and Arbaugh, William A. and Keromytis,A. D and Muir,S. and Smith,J. M} } @conference {16162, title = {Simulation based learning environments and the use of learning histories}, booktitle = {CHI {\textquoteright}00 extended abstracts on Human factors in computing systems}, series = {CHI EA {\textquoteright}00}, year = {2000}, month = {2000///}, pages = {2 - 3}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {We have developed an application framework for constructing simulation-based learning environments using dynamic simulations and visualizations to represent realistic time-dependent behavior. The development environment is described and many examples are given. In particular we will focus on the learning historian which provides users and learners with a manipulatable recording of their actions which facilitates the exchange of annotated history records among peers and mentors.}, keywords = {education, engineering, History, learning, simulation}, isbn = {1-58113-248-4}, doi = {10.1145/633292.633294}, url = {http://doi.acm.org/10.1145/633292.633294}, author = {Rose,A. and Salter,R. and Keswani,S. and Kositsyna,N. and Plaisant, Catherine and Rubloff,G. and Shneiderman, Ben} } @article {16651, title = {A SIMULATION ENVIRONMENT FOR EVOLVING MULTIAGENT COMMUNICATION}, volume = {UMIACS-TR-2000-64}, year = {2000}, month = {2000/09/15/}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {A simulation environment has been created to support study of emergentcommunication. Multiple agents exist in a two-dimensional world where they must find food and avoid predators. While non-communicating agents may survive, the world is configured so that survival and fitness can be enhanced through the use of inter-agent communication. The goal with this version of the simulator is to determine conditions under which simple communication (signaling) emerges and persists during an evolutionary process. (Also cross-referenced as UMIACS-TR-2000-64) }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu//handle/1903/1101}, author = {Reggia, James A. and Schultz,Reiner and Uriagereka,Juan and Wilkinson,Jerry} } @conference {17361, title = {Snap-together visualization: a user interface for coordinating visualizations via relational schemata}, booktitle = {Proceedings of the working conference on Advanced visual interfaces}, series = {AVI {\textquoteright}00}, year = {2000}, month = {2000///}, pages = {128 - 135}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Multiple coordinated visualizations enable users to rapidly explore complex information. However, users often need unforeseen combinations of coordinated visualizations that are appropriate for their data. Snap-Together Visualization enables data users to rapidly and dynamically mix and match visualizations and coordinations to construct custom exploration interfaces without programming. Snap{\textquoteright}s conceptual model is based on the relational database model. Users load relations into visualizations then coordinate them based on the relational joins between them. Users can create different types of coordinations such as: brushing, drill down, overview and detail view, and synchronized scrolling. Visualization developers can make their independent visualizations snap-able with a simple API.Evaluation of Snap revealed benefits, cognitive issues, and usability concerns. Data savvy users were very capable and thrilled to rapidly construct powerful coordinated visualizations. A snapped overview and detail-view coordination improved user performance by 30-80\%, depending on task. }, keywords = {Coordination, Information Visualization, multiple views, relational database, tight coupling, user interface, user study}, isbn = {1-58113-252-2}, doi = {10.1145/345513.345282}, url = {http://doi.acm.org/10.1145/345513.345282}, author = {North,Chris and Shneiderman, Ben} } @article {17363, title = {Snap-together visualization: can users construct and operate coordinated visualizations?}, journal = {International Journal of Human-Computer Studies}, volume = {53}, year = {2000}, month = {2000/11//}, pages = {715 - 739}, abstract = {Multiple coordinated visualizations enable users to rapidly explore complex information. However, users often need unforeseen combinations of coordinated visualizations. Snap-together visualization (Snap) enables users to rapidly and dynamically construct coordinated{\textendash}visualization interfaces, customized for their data, without programming. Users U001load data into desired visualizations, then construct coordinations between them for brushing and linking, overview and detail view, drill down, etc. Snap formalizes a conceptual model of visualization coordination based on the relational data model. Visualization developers can easily Snap-enable their independent visualizations using a simple API.Empirical evaluation reveals benefits, cognitive issues and usability concerns with coordination concepts and Snap. Two user studies explore coordination construction and operation. Data-savvy users successfully, enthusiastically and rapidly constructed powerful coordinated{\textendash}visualization interfaces of their own. Operating an overview-and-detail coordination reliably improved user performance by 30{\textendash}80\% over detail-only and uncoordinated interfaces for most tasks. }, isbn = {1071-5819}, doi = {10.1006/ijhc.2000.0418}, url = {http://www.sciencedirect.com/science/article/pii/S107158190090418X}, author = {North,Chris and Shneiderman, Ben} } @article {17365, title = {Snap-together visualization: Evaluating coordination usage and construction}, journal = {Int{\textquoteright}l Journal of Human-Computer Studies special issue on Empirical Studies of Information Visualization}, volume = {53}, year = {2000}, month = {2000///}, pages = {715 - 739}, abstract = {Multiple coordinated visualizations enable users to rapidly explore complex information. However, users often need unforeseen combinations of coordinated visualizations. Snap-Together Visualization is a conceptual model, based on the relational model, and system to enable users to quickly coordinate otherwise-independent visualization tools. Users construct customized browsing environments with coordinations for selecting, navigating, and loading data, without programming.Evaluation revealed benefits, cognitive issues, and usability concerns with coordination concepts and the Snap system. Two user studies explore the value of coordination usage and the learnability of coordination construction. The overview and detail-view coordination improved user performance by 30-80\%, depending on task. Data savvy users were very capable and thrilled to rapidly construct powerful coordinated visualizations. }, author = {North,C. and Shneiderman, Ben} } @conference {15903, title = {Structured translation for cross-language information retrieval}, booktitle = {Proceedings of the 23rd annual international ACM SIGIR conference on Research and development in information retrieval}, series = {SIGIR {\textquoteright}00}, year = {2000}, month = {2000///}, pages = {120 - 127}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {The paper introduces a query translation model that reflects the structure of the cross-language information retrieval task. The model is based on a structured bilingual dictionary in which the translations of each term are clustered into groups with distinct meanings. Query translation is modeled as a two-stage process, with the system first determining the intended meaning of a query term and then selecting translations appropriate to that meaning that might appear in the document collection. An implementation of structured translation based on automatic dictionary clustering is described and evaluated by using Chinese queries to retrieve English documents. Structured translation achieved an average precision that was statistically indistinguishable from Pirkola{\textquoteright}s technique for very short queries, but Pirkola{\textquoteright}s technique outperformed structured translation on long queries. The paper concludes with some observations on future work to improve retrieval effectiveness and on other potential uses of structured translation in interactive cross-language retrieval applications.}, isbn = {1-58113-226-3}, doi = {10.1145/345508.345562}, url = {http://doi.acm.org/10.1145/345508.345562}, author = {Sperer,Ruth and Oard, Douglas} } @conference {17386, title = {Supporting creativity with powerful composition tools for artifacts and performances}, booktitle = {Proceedings of the 33rd Annual Hawaii International Conference on System Sciences, 2000}, year = {2000}, month = {2000/01/04/7}, publisher = {IEEE}, organization = {IEEE}, abstract = {Modern software such as word processors, slide preparation/presentation tools, or music composition packages are designed to produce artifacts or performances. Now, some designers are expanding their goals to include creativity support into their software. This essay builds on the genex framework for creativity, which has four phases and eight activities. It focuses on the composition activity by considering tools to support initiation, revision, and evaluation. Some existing tools provide partial support that suggests ways in which to develop more ambitious low, middle, and high level tools. The goal is to enable more people to be more creative more of the time.}, keywords = {artifacts, Artificial intelligence, composition tools, Computer science, Context modeling, creativity, creativity support, Educational institutions, Information retrieval, Laboratories, Manufacturing, music composition, performances, Software design, software libraries, software tools, US Department of Transportation}, isbn = {0-7695-0493-0}, doi = {10.1109/HICSS.2000.926896}, author = {Shneiderman, Ben} } @article {16950, title = {A Trip Report on Creativity and Cognition 1999: An Insider{\textquoteright}s Report on a Far Out Conference}, journal = {SIGCHI BULLETIN}, volume = {32}, year = {2000}, month = {2000///}, pages = {43 - 46}, author = {Shneiderman, Ben and Hewett,T.} } @article {17454, title = {Universal usability}, journal = {Communications of the ACM}, volume = {43}, year = {2000}, month = {2000/05//}, pages = {84 - 91}, isbn = {0001-0782}, doi = {10.1145/332833.332843}, url = {http://doi.acm.org/10.1145/332833.332843}, author = {Shneiderman, Ben} } @conference {16796, title = {Using Hilbert curve in image storing and retrieving}, booktitle = {Proceedings of the 2000 ACM workshops on Multimedia - MULTIMEDIA {\textquoteright}00}, year = {2000}, month = {2000///}, pages = {167 - 170}, address = {Los Angeles, California, United States}, doi = {10.1145/357744.357921}, url = {http://dl.acm.org/citation.cfm?id=357921}, author = {Song,Zhexuan and Roussopoulos, Nick} } @conference {17669, title = {The value of strong inapproximability results for clique}, booktitle = {Proceedings of the thirty-second annual ACM symposium on Theory of computing}, series = {STOC {\textquoteright}00}, year = {2000}, month = {2000///}, pages = {144 - 152}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, keywords = {P vs. NP, Approximation algorithms, Clique, inapproximabilit, Independent set, Packing integer programs, random sampling}, isbn = {1-58113-184-4}, doi = {10.1145/335305.335322}, url = {http://doi.acm.org/10.1145/335305.335322}, author = {Srinivasan, Aravind} } @conference {17498, title = {Visualization methods for personal photo collections: browsing and searching in the PhotoFinder}, booktitle = {2000 IEEE International Conference on Multimedia and Expo, 2000. ICME 2000}, volume = {3}, year = {2000}, month = {2000///}, pages = {1539-1542 vol.3 - 1539-1542 vol.3}, publisher = {IEEE}, organization = {IEEE}, abstract = {Software tools for personal photo collection management are proliferating, but they usually have limited searching and browsing functions. We implemented the PhotoFinder prototype to enable non-technical users of personal photo collections to search and browse easily. PhotoFinder provides a set of visual Boolean query interfaces, coupled with dynamic query and query preview features. It gives users powerful search capabilities. Using a scatter plot thumbnail display and drag-and-drop interface, PhotoFinder is designed to be easy to use for searching and browsing photos}, keywords = {Browsing, Computer science, digital photo library, Displays, drag-and-drop interface, dynamic query, Educational institutions, Filters, Histograms, Image retrieval, personal computing, personal photo collections, photo collection management, PhotoFinder, Prototypes, query preview, scatter plot thumbnail display, Scattering, searching, software libraries, software tools, User interfaces, visual Boolean query interfaces, visual databases, Visualization, visualization methods}, isbn = {0-7803-6536-4}, doi = {10.1109/ICME.2000.871061}, author = {Kang,Hyunmo and Shneiderman, Ben} } @conference {17501, title = {Visualizing digital library search results with categorical and hierarchical axes}, booktitle = {Proceedings of the fifth ACM conference on Digital libraries}, series = {DL {\textquoteright}00}, year = {2000}, month = {2000///}, pages = {57 - 66}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Digital library search results are usually shown as a textual list, with 10-20 items per page. Viewing several thousand search results at once on a two-dimensional display with continuous variables is a promising alternative. Since these displays can overwhelm some users, we created a simplified two-dimensional display that uses categorical and hierarchical axes, called hieraxes. Users appreciate the meaningful and limited number of terms on each hieraxis. At each grid point of the display we show a cluster of color-coded dots or a bar chart. Users see the entire result set and can then click on labels to move down a level in the hierarchy. Handling broad hierarchies and arranging for imposed hierarchies led to additional design innovations. We applied hieraxes to a digital video library of science topics used by middle school teachers, a legal information system, and a technical library using the ACM Computing Classification System. Feedback from usability testing with 32 subjects revealed strengths and weaknesses.}, keywords = {categorical axes, digital libraries, Graphical user interfaces, hierarchy, hieraxes, Information Visualization}, isbn = {1-58113-231-X}, doi = {10.1145/336597.336637}, url = {http://doi.acm.org/10.1145/336597.336637}, author = {Shneiderman, Ben and Feldman,David and Rose,Anne and Grau,Xavier Ferr{\'e}} } @inbook {17671, title = {Wavelength Rerouting in Optical Networks, or the Venetian Routing Problem}, booktitle = {Approximation Algorithms for Combinatorial Optimization}, series = {Lecture Notes in Computer Science}, volume = {1913}, year = {2000}, month = {2000///}, pages = {71 - 84}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {Wavelength rerouting has been suggested as a viable and cost-effective method to improve the blocking performance of wavelength-routed Wavelength-Division Multiplexing (WDM) networks. This method leads to the following combinatorial optimization problem, dubbed Venetian Routing. Given a directed multigraph G along with two vertices s and t and a collection of pairwise arc-disjoint paths, we wish to find an st -path which arc-intersects the smallest possible number of such paths. In this paper we prove the computational hardness oft his problem even in various special cases, and present several approximation algorithms for its solution. In particular we show a non-trivial connection between Venetian Routing and Label Cover.}, isbn = {978-3-540-67996-7}, url = {http://dx.doi.org/10.1007/3-540-44436-X_9}, author = {Caprara,Alberto and Italiano,Giuseppe and Mohan,G. and Panconesi,Alessandro and Srinivasan, Aravind}, editor = {Jansen,Klaus and Khuller, Samir} } @conference {15052, title = {Web based progressive transmission for browsing remotely sensed imagery}, booktitle = {Geoscience and Remote Sensing Symposium, 2000. Proceedings. IGARSS 2000. IEEE 2000 International}, volume = {2}, year = {2000}, month = {2000///}, pages = {591 -593 vol.2 - 591 -593 vol.2}, abstract = {This paper describes an image representation technique that entails progressive refinement of user specified regions of interest (ROI) of large images. Progressive refinement to original quality can be accomplished in theory. However, due to heavy burden on storage resources for the authors{\textquoteright} applications, they restrict the refinement to about 25\% of the original data resolution. A wavelet decomposition of the data combined with scalar and vector quantization (VQ) of the high frequency components and JPEG/DCT compression of low frequency component is used as representation framework. Their software will reconstruct the region selected by the user from its wavelet decomposition such that it fills up the preview window with the appropriate subimages at the desired resolution, including full resolution stored for preview. Further refinement from the first preview can be obtained progressively by transmitting high frequency coefficients from low resolution to high resolution which are compressed by variant of vector quantization called model-based VQ (MVQ). The user will have an option for progressive build up of the ROIs until full resolution stored or terminate the transmission at any time during the progressive refinement}, keywords = {based, decomposition;geophysical, image;model-based, interest;remote, interest;vector, mapping;user, mapping;vector, measurement, of, processing;geophysical, processing;image, Progressive, quantisation;wavelet, quantization;wavelet, refinement;region, regions, representation;land, representation;remote, sensing;scalar;terrain, sensing;terrain, signal, specified, specified;user, surface;large, technique;image, techniques;image, transforms;, transmission;browsing;geophysical, VQ;progressive, Web}, doi = {10.1109/IGARSS.2000.861640}, author = {Mareboyana,M. and Srivastava,S. and JaJa, Joseph F.} } @article {16916, title = {1D, 2D, 3D}, journal = {Readings in information visualization}, year = {1999}, month = {1999///}, pages = {57 - 61}, author = {Card,S.K. and Mackinlay,J.D. and Shneiderman, Ben} } @article {16762, title = {The active MultiSync controller of the cubetree storage organization}, journal = {ACM SIGMOD Record}, volume = {28}, year = {1999}, month = {1999///}, pages = {582 - 583}, author = {Roussopoulos, Nick and Kotidis,Y. and Sismanis,Y.} } @conference {16955, title = {Agents vs. direct manipulation: what{\textquoteright}s best to disentangle the Web?}, booktitle = {Proceedings of the eighth international conference on World Wide Web}, year = {1999}, month = {1999///}, author = {S{\'a}nchez,J.A. and Etzioni,O. and Kautz,H. and Lieberman,H. and Shneiderman, Ben} } @article {16954, title = {Agents vs. direct manipulation: what{\textquoteright}s best to disentangle the Web?}, journal = {Computer Networks: The International Journal of Computer and Telecommunications Networking}, volume = {31}, year = {1999}, month = {1999/05//}, pages = {1765 - 1767}, isbn = {1389-1286}, url = {http://dl.acm.org/citation.cfm?id=313009.313142}, author = {S{\'a}nchez,J. Alfredo and Etzioni,Oren and Kautz,Henry and Lieberman,Henry and Shneiderman, Ben} } @article {16958, title = {Alternate geometry}, journal = {Readings in information visualization}, year = {1999}, month = {1999///}, pages = {381 - 381}, author = {Card,S.K. and Mackinlay,J.D. and Shneiderman, Ben} } @article {17685, title = {An analysis of the Rayleigh-Ritz method for approximating eigenspaces}, year = {1999}, month = {1999///}, institution = {Math. Comp}, abstract = {Abstract. This paper concerns the Rayleigh{\textendash}Ritz method for computing an approximation to an eigenspace X of a general matrix A from a subspace W that contains an approximation to X. The method produces a pair (N, \~{} X) that purports to approximate a pair (L, X), where X is a basis for X and AX = XL. In this paper we consider the convergence of (N, \~{} X) as the sine ɛ of the angle between X and W approaches zero. It is shown that under a natural hypothesis {\textemdash} called the uniform separation condition {\textemdash} the Ritz pairs (N, \~{} X) converge to the eigenpair (L, X). When one is concerned with eigenvalues and eigenvectors, one can compute certain refined Ritz vectors whose convergence is guaranteed, even when the uniform separation condition is not satisfied. An attractive feature of the analysis is that it does not assume that A has distinct eigenvalues or is diagonalizable. 1.}, author = {Jia,Zhongxiao and Stewart, G.W.} } @conference {17553, title = {Application-layer broker for scalable Internet services with resource reservation}, booktitle = {Proceedings of the seventh ACM international conference on Multimedia (Part 2)}, series = {MULTIMEDIA {\textquoteright}99}, year = {1999}, month = {1999///}, pages = {103 - 106}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, isbn = {1-58113-239-5}, doi = {10.1145/319878.319906}, url = {http://doi.acm.org/10.1145/319878.319906}, author = {Bai,Ping and Prabhakaran,B. and Srinivasan, Aravind} } @article {16977, title = {Applications and implications}, journal = {Readings in information visualization}, year = {1999}, month = {1999///}, pages = {625 - 635}, author = {Card,S.K. and Mackinlay,J.D. and Shneiderman, Ben} } @article {17565, title = {Approximation algorithms via randomized rounding: a survey}, journal = {Lectures on Approximation and Randomized Algorithms (M. Karonski and HJ Promel, editors), Series in Advanced Topics in Mathematics, Polish Scientific Publishers PWN}, year = {1999}, month = {1999///}, pages = {9 - 71}, abstract = {Approximation algorithms provide a natural way to approach computationally hardproblems. There are currently many known paradigms in this area, including greedy al- gorithms, primal-dual methods, methods based on mathematical programming (linear and semide nite programming in particular), local improvement, and \low distortion" embeddings of general metric spaces into special families of metric spaces. Random- ization is a useful ingredient in many of these approaches, and particularly so in the form of randomized rounding of a suitable relaxation of a given problem. We survey this technique here, with a focus on correlation inequalities and their applications. }, author = {Srinivasan, Aravind} } @article {16991, title = {Bifocal lens}, journal = {Readings in information visualization}, year = {1999}, month = {1999///}, pages = {331 - 332}, author = {Card,S.K. and Mackinlay,J.D. and Shneiderman, Ben} } @inbook {16170, title = {Browsing hierarchical data with multi-level dynamic queries}, booktitle = {Readings in information visualizationReadings in information visualization}, year = {1999}, month = {1999///}, pages = {295 - 305}, publisher = {Morgan Kaufmann Publishers Inc.}, organization = {Morgan Kaufmann Publishers Inc.}, isbn = {9781558605336}, author = {Kumar,H. P and Plaisant, Catherine and Shneiderman, Ben} } @conference {18666, title = {Building dependable distributed applications using AQUA}, year = {1999}, month = {1999///}, pages = {189 - 196}, abstract = {Building dependable distributed systems using ad hoc methods is a challenging task. Without proper support, an application programmer must face the daunting requirement of having to provide fault tolerance at the application level, in addition to dealing with the complexities of the distributed application itself. This approach requires a deep knowledge of fault tolerance on the part of the application designer, and has a high implementation cost. What is needed is a systematic approach to providing dependability to distributed applications. Proteus, part of the AQuA architecture, fills this need and provides facilities to make a standard distributed CORBA application dependable, with minimal changes to an application. Furthermore, it permits applications to specify, either directly or via the Quality Objects (QuO) infrastructure, the level of dependability they expect of a remote object, and will attempt to configure the system to achieve the requested dependability level. Our previous papers have focused on the architecture and implementation of Proteus. This paper describes how to construct dependable applications using the AQuA architecture, by describing the interface that a programmer is presented with and the graphical monitoring facilities that it provides}, keywords = {ad hoc methods, application programmer, AQuA, complexities, computational complexity, dependable distributed applications, distributed CORBA application, distributed object management, Fault tolerance, fault tolerant computing, proteus}, doi = {10.1109/HASE.1999.809494}, author = {Ren,J. and Michel Cukier and Rubel,P. and Sanders,W. H. and Bakken,D. E. and Karr,D. A.} } @conference {13520, title = {Classification of Document Page Images}, booktitle = {SDIUT99}, year = {1999}, month = {1999///}, pages = {166 - 175}, author = {Shin,C. and David Doermann} } @article {18693, title = {A comparative study of the backbone dynamics of two closely related lipid binding proteins: Bovine heart fatty acid binding protein and porcine ileal lipid binding protein}, journal = {Molecular and Cellular Biochemistry}, volume = {192}, year = {1999}, month = {1999///}, pages = {109 - 121}, abstract = {The backbone dynamics of bovine heart fatty acid binding protein (H-FABP) and porcine ileal lipid binding protein (ILBP) were studied by 15N NMR relaxation (T1 and T2) and steady state heteronuclear 15N1H NOE measurements. The microdynamic parameters characterizing the backbone mobility were determined using the {\textquoteleft}model-free{\textquoteright} approach. For H-FABP, the non-terminal backbone amide groups display a rather compact protein structure of low flexibility. In contrast, for ILBP an increased number of backbone amide groups display unusually high internal mobility. Furthermore, the data indicate a higher degree of conformational exchange processes in the {\textmu}sec-msec time range for ILBP compared to H-FABP. These results suggest significant differences in the conformational stability for these two structurally highly homologous members of the fatty acid binding protein family.}, keywords = {Biomedical and Life Sciences}, isbn = {0300-8177}, doi = {10.1023/A:1006834708786}, url = {http://www.springerlink.com/content/w2j255781546j880/abstract/}, author = {L{\"u}cke,Christian and Fushman, David and Ludwig,Christian and Hamilton,James A. and Sacchettini,James C. and R{\"u}terjans,Heinz} } @article {15502, title = {Comparing causal-link and propositional planners: Tradeoffs between plan length and domain size}, year = {1999}, month = {1999///}, institution = {Technical Report 99-06, University of Pittsburgh, Pittsburgh}, abstract = {Recent studies have shown that propositional planners, which de-rive from Graphplan and SATPLAN, can generate significantly longer plans than causal-link planners. We present experimental evidence demonstrating that while this may be true, propositional planners also have important limitations relative to the causal-link planners: specifically, they can generate plans only for smaller domains, where the size of a domain is defined by the number of distinguishable objects it contains. Our experiments were conducted in the domain of code optimization, in which the states of the world represent states of the computer program code and the planning operators are the optimiza- tion operators. This domain is well-suited to studying the trade-offs between plan length and domain size, because it is straightforward to manipulate both these factors. On the basis of our experiments, we conclude that causal-link and propositional planners have complementary strengths. }, author = {Memon, Atif M. and Pollack,M. and Soffa,M. L} } @conference {15640, title = {Computing nearest neighbors for moving points and applications to clustering}, booktitle = {Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms}, series = {SODA {\textquoteright}99}, year = {1999}, month = {1999///}, pages = {931 - 932}, publisher = {Society for Industrial and Applied Mathematics}, organization = {Society for Industrial and Applied Mathematics}, address = {Philadelphia, PA, USA}, isbn = {0-89871-434-6}, url = {http://dl.acm.org/citation.cfm?id=314500.315095}, author = {Kanungo,Tapas and Mount, Dave and Netanyahu,Nathan S. and Piatko,Christine and Silverman,Ruth and Wu,Angela Y.} } @book {13528, title = {Content-Based Access to Multimedia Information: From Technology Trends to Sate of the Art}, year = {1999}, month = {1999///}, publisher = {Kluwer}, organization = {Kluwer}, author = {Perry,B. and Chang,S-K. and Dinsmore,J. and David Doermann and Rosenfeld, A. and Stevens,S.} } @conference {17840, title = {Coupling multiple simulations via a high performance customizable database system}, booktitle = {Proceedings of the Ninth SIAM Conference on Parallel Processing for Scientific Computing}, year = {1999}, month = {1999///}, author = {Kurc,T. M and Sussman, Alan and Saltz, J.} } @article {17035, title = {Creating Creativity for Everyone: User Interfaces for Supporting Innovation}, journal = {Institute for Systems Research Technical Reports}, year = {1999}, month = {1999///}, abstract = {A challenge for human-computer interaction researchers and user interface designers is to construct information technologies that support creativity.This ambitious goal can be attained by building on an adequate understand-ing of creative processes. This paper offers the four-phase genex frame-work for generating excellence: - Collect: learn from previous works stored in digital libraries- Relate: consult with peers and mentors at early, middle and late stages- Create: explore, compose, and evaluate possible solutions - Donate: disseminate the results and contribute to the digital libraries Within this integrated framework, this paper proposes eight activities that require human-computer interaction research and advanced user inter-face design. A scenario about an architect illustrates the process of creative work within a genex environment.}, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/6010}, author = {Shneiderman, Ben} } @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} } @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} } @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} } @book {14149, title = {Efficient preconditioning of the linearized Navier-Stokes equations}, year = {1999}, month = {1999///}, publisher = {Citeseer}, organization = {Citeseer}, author = {Silvester, D. and Elman, Howard and Kay, D. and Wathen, A.} } @article {16172, title = {The end of zero-hit queries: query previews for NASA{\textquoteright}s Global Change Master Directory}, journal = {International Journal on Digital Libraries}, volume = {2}, year = {1999}, month = {1999///}, pages = {79 - 90}, abstract = {The Human-Computer Interaction Laboratory (HCIL) of the University of Maryland and NASA have collaborated over three years to refine and apply user interface research concepts developed at HCIL in order to improve the usability of NASA data services. The research focused on dynamic query user interfaces, visualization, and overview + preview designs. An operational prototype, using query previews, was implemented with NASA{\textquoteright}s Global Change Master Directory (GCMD), a directory service for earth science datasets. Users can see the histogram of the data distribution over several attributes and choose among attribute values. A result bar shows the cardinality of the result set, thereby preventing users from submitting queries that would have zero hits. Our experience confirmed the importance of metadata accuracy and completeness. The query preview interfaces make visible the problems or gaps in the metadata that are undetectable with classic form fill-in interfaces. This could be seen as a problem, but we think that it will have a long-term beneficial effect on the quality of the metadata as data providers will be compelled to produce more complete and accurate metadata. The adaptation of the research prototype to the NASA data required revised data structures and algorithms.}, isbn = {1432-5012}, url = {http://dx.doi.org/10.1007/s007990050039}, author = {Greene,Stephan and Tanin,Egemen and Plaisant, Catherine and Shneiderman, Ben and Olsen,Lola and Major,Gene and Johns,Steve} } @conference {15692, title = {End-to-end request handling in distributed Video-on-Demand systems}, booktitle = {Proceedings of the CNDS Conference (Society for Computer Simulation)}, year = {1999}, month = {1999///}, pages = {151 - 157}, author = {Mundur, Padma and Simon,R. and Sood,A.} } @article {12767, title = {On the evolution of reactive components: A process-algebraic approach}, journal = {Lecture notes in computer science}, year = {1999}, month = {1999///}, pages = {161 - 175}, author = {M\{\"u}ller-Olm,M. and Steffen,B. and Cleaveland, Rance} } @article {16971, title = {An Exploratory Study of Video Browsing, User Interface Designs and Research Methodologies: Effectiveness in Information Seeking Tasks}, journal = {PROCEEDINGS OF THE ANNUAL MEETING-AMERICAN SOCIETY FOR INFORMATION SCIENCE}, volume = {36}, year = {1999}, month = {1999///}, pages = {681 - 692}, abstract = {The purpose of this exploratory study is to develop research methods to compare the effectiveness of two video browsing interface designs, or surrogates one static (storyboard) and one dynamic (slide show) on two distinct information seeking tasks (gist determination and object recognition). Although video data is multimodal, potentially consisting of images, speech, sound, and text, the surrogates tested depend on image data only and use key frames or stills extracted from source video. A test system was developed to determine the effects of different key frame displays on user performance in specified information seeking tasks. The independent variables were interface display and task type. The dependent variables were task accuracy and subjective satisfaction. Covariates included spatial visual ability and time-to-completion. The study used a repeated block factorial 2x2 design; each of 20 participants interacted with all four interface-task combinations. No statistically significant results for task accuracy were found. Statistically significant differences were found, however, for user satisfaction with the display types: users assessed the static display to be "easier" to use than the dynamic display for both task types, even though there were no performance differences. This methodological approach provides a useful way to learn about the relationship between surrogate types and user tasks during video browsing.}, author = {Tse,T. and Vegh,S. and Shneiderman, Ben and Marchionini,G.} } @conference {18672, title = {Fault injection based on a partial view of the global state of a distributed system}, year = {1999}, month = {1999///}, pages = {168 - 177}, abstract = {This paper describes the basis for and preliminary implementation of a new fault injector, called Loki, developed specifically for distributed systems. Loki addresses issues related to injecting correlated faults in distributed systems. In Loki, fault injection is performed based on a partial view of the global state of an application. In particular, facilities are provided to pass user-specified state information between nodes to provide a partial view of the global state in order to try to inject complex faults successfully. A post-runtime analysis, using an off-line clock synchronization and a bounding technique, is used to place events and injections on a single global time-line and determine whether the intended faults were properly injected. Finally, observations containing successful fault injections are used to estimate specified dependability measures. In addition to describing the details of our new approach, we present experimental results obtained from a preliminary implementation in order to illustrate Loki{\textquoteright}s ability to inject complex faults predictably}, keywords = {bounding technique, clock synchronization, distributed programming, distributed software systems, fault injection, Loki, post-runtime analysis, program testing, program verification, software reliability, Synchronisation}, doi = {10.1109/RELDIS.1999.805093}, author = {Michel Cukier and Chandra,R. and Henke,D. and Pistole,J. and Sanders,W. H.} } @inbook {17170, title = {Fisheye views}, booktitle = {Readings in information visualizationReadings in information visualization}, year = {1999}, month = {1999///}, pages = {311 - 311}, author = {Card,S.K. and Mackinlay,J.D. and Shneiderman, Ben} } @inbook {17172, title = {Focus+ context}, booktitle = {Readings in information visualizationReadings in information visualization}, year = {1999}, month = {1999///}, pages = {306 - 309}, author = {Card,S.K. and Mackinlay,J.D. and Shneiderman, Ben} } @article {17700, title = {Four algorithms for the efficient computation of truncated pivoted QR approximations to a sparse matrix}, journal = {Numerische Mathematik}, volume = {83}, year = {1999}, month = {1999///}, pages = {313 - 323}, abstract = {In this paper we propose four algorithms to compute truncated pivoted QR approximations to a sparse matrix. Three are based on the Gram{\textendash}Schmidt algorithm and the other on Householder triangularization. All four algorithms leave the original matrix unchanged, and the only additional storage requirements are arrays to contain the factorization itself. Thus, the algorithms are particularly suited to determining low-rank approximations to a sparse matrix.}, doi = {10.1007/s002110050451}, author = {Stewart, G.W.} } @conference {15386, title = {Gate leakage current simulation by Boltzmann transport equation and its dependence on the gate oxide thickness}, booktitle = {Simulation of Semiconductor Processes and Devices, 1999. SISPAD {\textquoteright}99. 1999 International Conference on}, year = {1999}, month = {1999///}, pages = {247 - 250}, abstract = {As device dimensions shrink toward 0.1 mu;m, gate oxides are becoming so thin that MOSFET gate leakage current and oxide degradation are becoming limiting issues. We provide a more rigorous way to calculate gate leakage current. To achieve this we build upon the Spherical Harmonic Method of modeling, which deterministically solves the Boltzmann equation for an entire device. The method gives the distribution function and is 1000 times faster than MC. Once the distribution function is calculated, the tunneling probability is derived from the first principle WKB method. The barrier lowering effect is accounted for by the method of image charges. We calculate gate leakage current as a function of DC bias. The thermionic and tunneling components are compared at different DC bias points. The dependence of gate leakage current on gate oxide thickness is simulated}, keywords = {30, angstrom;60, angstrom;Boltzmann, Bias, calculations;leakage, charges;spherical, component;tunneling, current, currents;semiconductor, dependence;method, dependence;MOSFET;barrier, device, effect;distribution, equation;DC, equation;MOSFET;WKB, function;first, harmonic, image, leakage, lowering, method, method;gate, model;thermionic, models;tunnelling;, of, oxide, principle, probability;Boltzmann, simulation;gate, thickness, transport, WKB}, doi = {10.1109/SISPAD.1999.799307}, author = {Han,Zhiyi and Lin,Chung-Kai and Goldsman,N. and Mayergoyz, Issak D and Yu,S. and Stettler,M.} } @conference {14927, title = {A hierarchical data archiving and processing system to generate custom tailored products from AVHRR data}, booktitle = {Geoscience and Remote Sensing Symposium, 1999. IGARSS {\textquoteright}99 Proceedings. IEEE 1999 International}, volume = {5}, year = {1999}, month = {1999///}, pages = {2374 -2376 vol.5 - 2374 -2376 vol.5}, abstract = {A novel indexing scheme is described to catalogue satellite data on a pixel basis. The objective of this research is to develop an efficient methodology to archive, retrieve and process satellite data, so that data products can be generated to meet the specific needs of individual scientists. When requesting data, users can specify the spatial and temporal resolution, geographic projection, choice of atmospheric correction, and the data selection methodology. The data processing is done in two stages. Satellite data is calibrated, navigated and quality flags are appended in the initial processing. This processed data is then indexed and stored. Secondary processing such as atmospheric correction and projection are done after a user requests the data to create custom made products. By dividing the processing in to two stages saves time, since the basic processing tasks such as navigation and calibration which are common to all requests are not repeated when different users request satellite data. The indexing scheme described can be extended to allow fusion of data sets from different sensors}, keywords = {archiving;image, AVHRR;GIS;PACS;custom, data, image;land, image;remote, mapping;, mapping;PACS;geophysical, measurement, PROCESSING, processing;geophysical, product;data, remote, scheme;infrared, sensing;optical, sensing;terrain, signal, surface;multispectral, system;indexing, tailored, technique;hierarchical, techniques;remote}, doi = {10.1109/IGARSS.1999.771514}, author = {Kalluri, SNV and Zhang,Z. and JaJa, Joseph F. and Bader, D.A. and Song,H. and El Saleous,N. and Vermote,E. and Townshend,J.R.G.} } @article {17207, title = {Human values and the future of technology: a declaration of responsibility}, journal = {ACM SIGCAS Computers and Society}, volume = {29}, year = {1999}, month = {1999/09//}, pages = {5 - 9}, abstract = {We can make a difference in shaping the future by ensuring that computers "serve human needs (Mumford, 1934)." By making explicit the enduring values that we hold dear we can guide computer system designers and developers for the next decade, century, and thereafter. After setting our high-level goals we can pursue the components and seek the process for fulfilling them. High-level goals might include peace, excellent health care, adequate nutrition, accessible education, communication, freedom of expression, support for creative exploration, safety, and socially constructive entertainment. Computer technology can help attain these high-level goals if we clearly state measurable objectives, obtain participation of professionals, and design effective human-computer interfaces. Design considerations include adequate attention to individual differences among users, support of social and organizational structures, design for reliability and safety, provision of access by the elderly, handicapped, or illiterate, and appropriate user controlled adaptation. With suitable theories and empirical research we can achieve ease of learning, rapid performance, low error rates, and good retention over time, while preserving high subjective satisfaction. To raise the consciousness of designers and achieve these goals, we must generate an international debate, stimulate discussions within organizations, and interact with other intellectual communities. This paper calls for a focus on the "you" and "I" in developing improved user interface (UI) research and systems, offers a Declaration of Responsibility, and proposes a Social Impact Statement for major computing projects.}, isbn = {0095-2737}, doi = {10.1145/572183.572185}, url = {http://doi.acm.org/10.1145/572183.572185}, author = {Shneiderman, Ben} } @article {17209, title = {Human-centered computing, online communities, and virtual environments}, journal = {IEEE Computer Graphics and Applications}, volume = {19}, year = {1999}, month = {1999/12//Nov}, pages = {70 - 74}, abstract = {This report summarizes results of the first EC/NSF joint Advanced Research Workshop, which identified key research challenges and opportunities in information technology. The group agreed that the first joint research workshop should concentrate on the themes of human-centered computing and VEs. Human-centered computing is perceived as an area of strategic importance because of the move towards greater decentralization and decomposition in the location and provision of computation. The area of VEs is one where increased collaboration should speed progress in solving some of the more intractable problems in building effective applications}, keywords = {Books, Collaboration, Collaborative work, Conferences, EC/NSF joint Advanced Research Workshop, Feeds, Human computer interaction, human-centered computing, Internet, Joining materials, Laboratories, Online communities, Research initiatives, USA Councils, User interfaces, Virtual environment, virtual environments, Virtual reality}, isbn = {0272-1716}, doi = {10.1109/38.799742}, author = {Brown,J. R and van Dam,A. and Earnshaw,R. and Encarnacao,J. and Guedj,R. and Preece,J. and Shneiderman, Ben and Vince,J.} } @article {17606, title = {Improved Approximation Guarantees for Packing and Covering Integer Programs}, journal = {SIAM Journal on Computing}, volume = {29}, year = {1999}, month = {1999///}, pages = {648 - 648}, abstract = {Several important NP-hard combinatorial optimization problems can be posed as packing/covering integer programs; the randomized rounding technique of Raghavan and Thompson is a powerful tool with which to approximate them well. We present one elementary unifying property of all these integer linear programs and use the FKG correlation inequality to derive an improved analysis of randomized rounding on them. This yields a pessimistic estimator, thus presenting deterministic polynomial-time algorithms for them with approximation guarantees that are significantly better than those known.}, isbn = {00975397}, doi = {10.1137/S0097539796314240}, url = {http://link.aip.org/link/SMJCAT/v29/i2/p648/s1\&Agg=doi}, author = {Srinivasan, Aravind} } @article {17235, title = {Information workspaces}, journal = {Readings in information visualization}, year = {1999}, month = {1999///}, pages = {513 - 514}, author = {Card,S.K. and Mackinlay,J.D. and Shneiderman, Ben} } @article {17236, title = {Infosphere, workspace, tools, objects}, journal = {Readings in information visualization}, year = {1999}, month = {1999///}, pages = {463 - 464}, author = {Card,S.K. and Mackinlay,J.D. and Shneiderman, Ben} } @conference {17874, title = {Infrastructure for building parallel database systems for multi-dimensional data}, booktitle = {IPPS}, year = {1999}, month = {1999///}, pages = {582 - 582}, author = {Chang,C. and Ferreira,R. and Sussman, Alan and Saltz, J.} } @conference {15691, title = {Integrated admission control in hierarchical video-on-demand systems}, booktitle = {IEEE International Conference on Multimedia Computing and Systems, 1999}, volume = {1}, year = {1999}, month = {1999/07//}, pages = {220-225 vol.1 - 220-225 vol.1}, publisher = {IEEE}, organization = {IEEE}, abstract = {We develop a unified model of a hierarchical video-on-demand (VoD) system by integrating the storage and the network subsystems. Rather than restricting the analysis to an isolated subsystem the performance of the VoD system is analyzed as an end-to-end system. On a system-wide basis, request handling and admission control policies are designed to minimize global performance metrics. Through our simulation, we compare different request handling policies and show that a hierarchical VoD architecture with request handling that allows retrials at more than one resource will minimize overall blocking}, keywords = {Admission control, Bandwidth, blocking, Computer science, Design methodology, end-to-end system, hierarchical video-on-demand systems, integrated admission control, Intelligent networks, Load management, Motion pictures, Network servers, network subsystem, performance, Performance analysis, performance evaluation, quality of service, request handling, resource allocation, Resource management, simulation, storage subsystem, video on demand, video servers}, isbn = {0-7695-0253-9}, doi = {10.1109/MMCS.1999.779196}, author = {Mundur, Padma and Simon,R. and Sood,A.} } @inbook {17245, title = {Interaction}, booktitle = {Readings in information visualizationReadings in information visualization}, year = {1999}, month = {1999///}, pages = {231 - 234}, publisher = {Morgan Kaufmann Publishers Inc.}, organization = {Morgan Kaufmann Publishers Inc.}, address = {San Francisco}, isbn = {1-55860-533-9}, author = {Card,S.K. and Mackinlay,J.D. and Shneiderman, Ben} } @inbook {17246, title = {Interactive analysis}, booktitle = {Readings in information visualizationReadings in information visualization}, year = {1999}, month = {1999///}, pages = {261 - 262}, publisher = {Morgan Kaufmann Publishers Inc.}, organization = {Morgan Kaufmann Publishers Inc.}, address = {San Francisco}, isbn = {1-55860-533-9}, author = {Card,S.K. and Mackinlay,J.D. and Shneiderman, Ben} } @article {16165, title = {Interface and data architecture for query preview in networked information systems}, journal = {ACM Trans. Inf. Syst.}, volume = {17}, year = {1999}, month = {1999/07//}, pages = {320 - 341}, abstract = {There are numerous problems associated with formulating queries onnetworked information systems. These include increased data volume and complexity, accompanied by slow network access. This article proposes a new approach to a network query user interfaces that consists of two phases: query preview and query refinement. This new approach is based on the concepts of dynamic queries and query previews, which guides users in rapidly and dynamically eliminating undesired records, reducing the data volume to a manageable size, and refining queries locally before submission over a network. Examples of two applications are given: a Restaurant Finder and a prototype for NASA{\textquoteright}s Earth Observing Systems Data Information Systems (EOSDIS). Data architecture is discussed, and user feedback is presented. }, keywords = {direct manipulation, dynamic query, EOSDIS, graphical user interface, query preview, query refinement, science data}, isbn = {1046-8188}, doi = {10.1145/314516.314522}, url = {http://doi.acm.org/10.1145/314516.314522}, author = {Plaisant, Catherine and Shneiderman, Ben and Doan,Khoa and Bruns,Tom} } @conference {16972, title = {An international SIGCHI research agenda}, booktitle = {CHI {\textquoteright}99 extended abstracts on Human factors in computing systems}, series = {CHI EA {\textquoteright}99}, year = {1999}, month = {1999///}, pages = {171 - 171}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {The goal of this workshop is to articulate an HCI research agenda statement, along with plans for continued refinement with the greater CHI community and plans for disseminating the information beyond the CHI community. There are been several similar prior efforts, including:{\textbullet} 1998 Universal Access program [2]{\textbullet} European community report, "Building the European Information Society for Us All" [1];{\textbullet} CHI 97 workshop [5] and paper [6], "HCI Research and Practice Agenda based on Human Needs {\textellipsis}";{\textbullet} CHI 96 Workshop, "CHI Ten-Year View{\textellipsis}" [3];{\textbullet} 1995 US National Science Foundation report, "New Directions in Human-Computer Interaction {\textellipsis}" [9];{\textbullet} 1995 report from the US National Research Council [7];{\textbullet} 1991 report, "{\textellipsis}HCI{\textellipsis} Serving Human Needs" [4]}, keywords = {agenda, human-computer, interaction, research}, isbn = {1-58113-158-5}, doi = {10.1145/632716.632821}, url = {http://doi.acm.org/10.1145/632716.632821}, author = {Scholtz,Jean C. and Muller,Michael and Novick,David and Olsen,Jr.,Dan R. and Shneiderman, Ben and Wharton,Cathleen} } @inbook {17262, title = {Internet and Infosphere}, booktitle = {Readings in information visualizationReadings in information visualization}, year = {1999}, month = {1999///}, pages = {465 - 468}, publisher = {Morgan Kaufmann Publishers Inc.}, organization = {Morgan Kaufmann Publishers Inc.}, address = {San Francisco}, isbn = {1-55860-533-9}, author = {Card,S.K. and Mackinlay,J.D. and Shneiderman, Ben} } @article {17263, title = {Introduction to Special Issue on Usability Engineering}, journal = {Empirical Software Engineering}, volume = {4}, year = {1999}, month = {1999///}, pages = {5 - 10}, isbn = {1382-3256}, url = {http://dx.doi.org/10.1023/A:1009852413783}, author = {Scholtz,Jean and Shneiderman, Ben} } @conference {16520, title = {Lesion effects in a bihemispheric letter-identification model}, booktitle = {Neural Networks, 1999. IJCNN{\textquoteright}99. International Joint Conference on}, volume = {1}, year = {1999}, month = {1999///}, pages = {215 - 218}, author = {Shevtsova,N. and Reggia, James A.} } @inbook {16169, title = {LifeLines: Visualizing Personal Histories}, booktitle = {Readings in Information Visualization: Using Vision to ThinkReadings in Information Visualization: Using Vision to Think}, year = {1999}, month = {1999///}, pages = {285 - 285}, publisher = {Morgan Kaufmann Publishers Inc.}, organization = {Morgan Kaufmann Publishers Inc.}, isbn = {9781558605336}, author = {Kumar,H. P and Plaisant, Catherine and Shneiderman, Ben} } @article {12779, title = {Local model checking and protocol analysis}, journal = {International Journal on Software Tools for Technology Transfer (STTT)}, volume = {2}, year = {1999}, month = {1999///}, pages = {219 - 241}, author = {Du,X. and Smolka,S. A and Cleaveland, Rance} } @conference {13601, title = {Model Based Graphics Recognition}, booktitle = {GREC}, year = {1999}, month = {1999///}, pages = {136 - 143}, author = {Stuckelberg,M.V. and David Doermann} } @conference {16579, title = {A model of lateralization and asymmetries in cortical maps}, booktitle = {Neural Networks, 1999. IJCNN{\textquoteright}99. International Joint Conference on}, volume = {1}, year = {1999}, month = {1999///}, pages = {121 - 124}, author = {Levitan,S. and Stoica,I. and Reggia, James A.} } @article {14112, title = {Modified streamline diffusion schemes for convection-diffusion problems}, journal = {Computer Methods in Applied Mechanics and Engineering}, volume = {174}, year = {1999}, month = {1999/05/04/}, pages = {137 - 151}, abstract = {We consider the design of robust and accurate finite element approximation methods for solving convection--diffusion problems. We develop some two-parameter streamline diffusion schemes with piecewise bilinear (or linear) trial functions and show that these schemes satisfy the necessary conditions for L2-uniform convergence of order greater than 1/2 introduced by Stynes and Tobiska M. Stynes and L. Tobiska, Necessary L2-uniform convergence conditions for difference schemes for two dimensional convection--diffusion problems, Comput. Math. Applic. 29 (1995) 45-53. For smooth problems, the schemes satisfy error bounds of the form O(h)u2 in an energy norm. In addition, extensive numerical experiments show that they effectively reproduce boundary layers and internal layers caused by discontinuities on relatively coarse grids, without any requirements on alignment of flow and grid.}, isbn = {0045-7825}, doi = {16/S0045-7825(98)00283-7}, url = {http://www.sciencedirect.com/science/article/pii/S0045782598002837}, author = {Shih,Yin-Tzer and Elman, Howard} } @article {15853, title = {Multilingual Information Discovery and AccesS (MIDAS): A Joint ACM DL{\textquoteright}99/ ACM SIGIR{\textquoteright}99 Workshop.}, journal = {D-Lib MagazineD-Lib Magazine}, volume = {5}, year = {1999}, month = {1999///}, pages = {1 - 12}, abstract = {Discusses a multidisciplinary workshop that addressed issues concerning internationally distributed information networks. Highlights include multilingual information access in media other than character-coded text; cross-language information retrieval and multilingual metadata; and evaluation of multilingual systems. (LRW)}, keywords = {Distributed computing, Electronic Media}, isbn = {ISSN-1082-9873}, url = {http://www.eric.ed.gov/ERICWebPortal/detail?accno=EJ601937}, author = {Oard, Douglas and Peters,Carol and Ruiz,Miguel and Frederking,Robert and Klavans,Judith and Sheridan,Paraic} } @conference {17302, title = {Multiple dimensions> 3}, booktitle = {Readings in information visualization}, year = {1999}, month = {1999///}, pages = {93 - 95}, publisher = {Morgan Kaufmann Publishers Inc.}, organization = {Morgan Kaufmann Publishers Inc.}, address = {San Francisco}, isbn = {1-55860-533-9}, author = {Card,S.K. and Mackinlay,J.D. and Shneiderman, Ben} } @conference {13616, title = {On musical score recognition using probabilistic reasoning}, booktitle = {Document Analysis and Recognition, 1999. ICDAR {\textquoteright}99. Proceedings of the Fifth International Conference on}, year = {1999}, month = {1999/09//}, pages = {115 - 118}, abstract = {We present a probabilistic framework for document analysis and recognition and illustrate it on the problem of musical score recognition. Our system uses an explicit descriptive model of the document class to find the most likely interpretation of a scanned document image. In contrast to the traditional pipeline architecture, we carry out all stages of the analysis with a single inference engine, allowing for an end-to-end propagation of the uncertainty. The global modeling structure is similar to a stochastic attribute grammar, and local parameters are estimated using hidden Markov models}, keywords = {analysis;document, attribute, class;document, descriptive, document, engine;local, estimation;musical, grammar;attribute, grammars;character, handling;, image, interpretation;stochastic, Markov, mechanisms;music;uncertainty, model;global, modeling, models;inference, parameter, processing;image, propagation;explicit, reasoning;scanned, recognition;document, recognition;end-to-end, recognition;inference, recognition;probabilistic, score, structure;hidden, Uncertainty}, doi = {10.1109/ICDAR.1999.791738}, author = {Stuckelberg,M.V. and David Doermann} } @article {18862, title = {Nano-to-millimeter scale integrated systems}, journal = {Components and Packaging Technologies, IEEE Transactions on}, volume = {22}, year = {1999}, month = {1999/06//}, pages = {338 - 343}, abstract = {Over the last several years various industries have been developing nano, micro, and millimeter scale technologies, which have resulted in components ranging from quantum transistors, to widely commercialized integrated circuits, to microelectromechanical sensors. A common emphasis of these fabrication industries has been on the integration of different functions in miniaturized systems; however, the technology currently used to realize these systems is monolithic. A unique class of hybrid technology systems is Integrated nano to millimeter (In2m) systems. An In2m system typically has components spanning multiple sizes, diverse technology domains, and mixtures of electrical, mechanical, thermal, chemical, fluidic, and biological functions}, keywords = {fabrication technology, In2m, integrated nano to millimeter system, micromechanical devices, nanotechnology}, isbn = {1521-3331}, doi = {10.1109/6144.774758}, author = {Last,H.R. and Deeds,M. and Garvick,D. and Kavetsky,R. and Sandborn,P. A. and Magrab,E. B. and Gupta,S.K.} } @conference {15687, title = {Network service selection for distributed multimedia applications}, booktitle = {Third International Conference on Computational Intelligence and Multimedia Applications, 1999. ICCIMA {\textquoteright}99. Proceedings}, year = {1999}, month = {1999///}, pages = {388 - 392}, publisher = {IEEE}, organization = {IEEE}, abstract = {An important question in the development of system support for distributed multimedia is the type of network service offered to applications. This paper compares two network service disciplines: weighted fair queueing (WFQ) and non-preemptive earliest deadline first (NEDF). We show that, for a broad class of high-bandwidth distributed multimedia applications, WFQ outperforms NEDF in terms of network throughput while still providing an application-adequate end-to-end service. This result holds despite the fact that NEDF offers applications far greater flexibility in terms of control over end-to-end delivery delay}, keywords = {Admission control, Application software, application-adequate end-to-end service, Bandwidth, Communication system traffic control, Computer science, Delay, distributed processing, end-to-end delivery delay control, flexibility, high-bandwidth distributed multimedia applications, interactive multimedia, multimedia systems, network service selection, network throughput, nonpreemptive earliest deadline first, queueing theory, Regulators, system support, telecommunication services, Throughput, Traffic control, weighted fair queueing}, isbn = {0-7695-0300-4}, doi = {10.1109/ICCIMA.1999.798561}, author = {Simon,R. and Sood,A. and Mundur, Padma} } @article {16634, title = {A neural network model of lateralization during letter identification}, journal = {Journal of Cognitive Neuroscience}, volume = {11}, year = {1999}, month = {1999///}, pages = {167 - 181}, author = {Shevtsova,N. and Reggia, James A.} } @conference {17631, title = {New algorithmic aspects of the Local Lemma with applications to routing and partitioning}, booktitle = {Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms}, series = {SODA {\textquoteright}99}, year = {1999}, month = {1999///}, pages = {643 - 652}, publisher = {Society for Industrial and Applied Mathematics}, organization = {Society for Industrial and Applied Mathematics}, address = {Philadelphia, PA, USA}, isbn = {0-89871-434-6}, url = {http://dl.acm.org/citation.cfm?id=314500.314886}, author = {Leighton,Tom and Rao,Satish and Srinivasan, Aravind} } @article {17855, title = {Object-relational queries into multidimensional databases with the active data repository}, journal = {Parallel Processing Letters}, volume = {9}, year = {1999}, month = {1999///}, pages = {173 - 195}, author = {Ferreira,R. and Kurc, T. and Beynon, M. and Chang,C. and Sussman, Alan and Saltz,J. H} } @article {17715, title = {On Orthogonalization in the Inverse Power Method}, volume = {UMIACS-TR-99-64}, year = {1999}, month = {1999/10/13/}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {When the inverse power method is used to compute eigenvectors of asymmetric matrix corresponding to close eigenvalues, the computed eigenvectors may not be orthogonal. The cure for the problem is to orthogonalize the vectors using the Gram--Schmidt algorithm. In this note it is shown that the orthogonalization process does not cause the quality of the eigenvectors to deteriorate. Also cross-referenced as UMIACS-TR-99-64 }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/1038}, author = {Stewart, G.W.} } @article {18409, title = {OSMA Software Program: Domain Analysis Guidebook}, journal = {Technical Reports from UMIACS, UMIACS-TR-99-16}, year = {1999}, month = {1999/03/31/}, abstract = {Domain analysis is the process of identifying and organizing knowledge abouta class of problems. This guidebook presents a method of performing experience domain analysis in software development organizations. The purpose of the guidebook is to facilitate the reader in characterizing two given development environments, applying domain analysis to model each, and then applying an evaluation process, based upon the Goal/Metric/Paradigm, to transfer a given development technology from one of the environments to the other. This guidebook describes this process and gives an example of its use within NASA. Also cross-referenced as UMIACS-TR-99-16 }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/1000}, author = {Basili, Victor R. and Seaman,Carolyn and Tesoriero,Roseanne and Zelkowitz, Marvin V} } @inbook {17317, title = {Overview+ detail}, booktitle = {Readings in information visualizationReadings in information visualization}, year = {1999}, month = {1999///}, pages = {285 - 286}, author = {Card,S.K. and Mackinlay,J.D. and Shneiderman, Ben} } @book {14913, title = {Perceptual Organization in Computer Vision}, year = {1999}, month = {1999///}, publisher = {Academic Press}, organization = {Academic Press}, author = {Boyer,K.L. and Sarkar,S. and Feldman,J. and Granlund,G. and Horaud,R. and Hutchinson,S. and Jacobs, David W. and Kak,A. and Lowe,D. and Malik,J.} } @conference {17863, title = {Performance impact of proxies in data intensive client-server applications}, booktitle = {Proceedings of the 13th international conference on Supercomputing}, year = {1999}, month = {1999///}, pages = {383 - 390}, author = {Beynon,M. D and Sussman, Alan and Saltz, J.} } @article {17322, title = {Perspective-based Usability Inspection: An Empirical Validation of Efficacy}, journal = {Empirical Software Engineering}, volume = {4}, year = {1999}, month = {1999///}, pages = {43 - 69}, abstract = {Inspection is a fundamental means of achieving software usability. Past research showed that the current usability inspection techniques were rather ineffective. We developed perspective-based usability inspection, which divides the large variety of usability issues along different perspectives and focuses each inspection session on one perspective. We conducted a controlled experiment to study its effectiveness, using a post-test only control group experimental design, with 24 professionals as subjects. The control group used heuristic evaluation, which is the most popular technique for usability inspection. The experimental design and the results are presented, which show that inspectors applying perspective-based inspection not only found more usability problems related to their assigned perspectives, but also found more overall problems. Perspective-based inspection was shown to be more effective for the aggregated results of multiple inspectors, finding about 30\% more usability problems for 3 inspectors. A management implication of this study is that assigning inspectors more specific responsibilities leads to higher performance. Internal and external threats to validity are discussed to help better interpret the results and to guide future empirical studies.}, isbn = {1382-3256}, url = {http://dx.doi.org/10.1023/A:1009803214692}, author = {Zhang,Zhijun and Basili, Victor R. and Shneiderman, Ben} } @conference {17323, title = {Physical data}, booktitle = {Readings in information visualization}, year = {1999}, month = {1999///}, pages = {37 - 38}, publisher = {Morgan Kaufmann Publishers Inc.}, organization = {Morgan Kaufmann Publishers Inc.}, address = {San Francisco}, isbn = {1-55860-533-9}, author = {Card,S.K. and Mackinlay,J.D. and Shneiderman, Ben} } @article {17324, title = {Pixel Data Access for End-User Programming and Graphical Macros}, journal = {Technical Reports from UMIACS}, year = {1999}, month = {1999/05/25/}, abstract = {Pixel Data Access is an interprocess communication technique that enablesusers of graphical user interfaces to automate certain tasks. By accessing the contents of the display buffer, users can search for pixel representations of interface elements, and then initiate actions such as mouse clicks and keyboard entries. While this technique has limitations it offers users of current systems some unusually powerful features that are especially appealing in the area of end-user programming. Also cross-referenced as UMIACS-TR-99-27 }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/1009}, author = {Potter,Richard and Shneiderman, Ben} } @conference {17535, title = {Predicting the CPU availability of time-shared Unix systems on the computational grid}, booktitle = {The Eighth International Symposium on High Performance Distributed Computing, 1999. Proceedings}, year = {1999}, month = {1999///}, pages = {105 - 112}, publisher = {IEEE}, organization = {IEEE}, abstract = {Focuses on the problem of making short- and medium-term forecasts of CPU availability on time-shared Unix systems. We evaluate the accuracy with which availability can be measured using the Unix load average, the Unix utility {\textquotedblleft}vmstat{\textquotedblright} and the Network Weather Service (NWS) CPU sensor that uses both. We also examine the autocorrelation between successive CPU measurements to determine their degree of self-similarity. While our observations show a long-range autocorrelation dependence, we demonstrate how this dependence manifests itself in the short- and medium-term predictability of the CPU resources in our study}, keywords = {accuracy, Application software, Autocorrelation, Availability, Central Processing Unit, computational grid, correlation methods, CPU availability prediction, CPU resources predictability, CPU sensor, Dynamic scheduling, grid computing, Load forecasting, long-range autocorrelation dependence, medium-term forecasts, network operating systems, Network Weather Service, NWS, performance evaluation, self-similarity degree, short-term forecasts, successive CPU measurements, Time measurement, Time sharing computer systems, time-shared Unix systems, time-sharing systems, Unix, Unix load average, vmstat utility, Weather forecasting}, isbn = {0-7803-5681-0}, doi = {10.1109/HPDC.1999.805288}, author = {Wolski,R. and Spring, Neil and Hayes,J.} } @conference {18689, title = {Proteus: a flexible infrastructure to implement adaptive fault tolerance in AQuA}, year = {1999}, month = {1999/11//}, pages = {149 - 168}, abstract = {Building dependable distributed systems from commercial off-the-shelf components is of growing practical importance. For both cost and production reasons, there is interest in approaches and architectures that facilitate building such systems. The AQuA architecture is one such approach; its goal is to provide adaptive fault tolerance to CORBA applications by replicating objects, providing a high-level method for applications to specify their desired dependability, and providing a dependability manager that attempts to reconfigure a system at runtime so that dependability requests are satisfied. This paper describes how dependability is provided in AQuA. In particular it describes Proteus, the part of AQuA that dynamically manages replicated distributed objects to make them dependable. Given a dependability request, Proteus chooses a fault tolerance approach and reconfigures the system to try to meet the request. The infrastructure of Proteus is described in this paper, along with its use in implementing active replication and a simple dependability policy}, keywords = {adaptive fault tolerance, AQuA, commercial off-the-shelf components, CORBA applications, cost, dependable distributed systems, distributed object management, object replication, proteus, reconfigurable architectures, Runtime, Software architecture, software fault tolerance}, doi = {10.1109/DCFTS.1999.814294}, author = {Sabnis,C. and Michel Cukier and Ren,J. and Rubel,P. and Sanders,W. H. and Bakken,D. E. and Karr,D.} } @article {17737, title = {The QLP Approximation to the Singular Value Decomposition}, journal = {SIAM Journal on Scientific Computing}, volume = {20}, year = {1999}, month = {1999///}, pages = {1336 - 1348}, abstract = {In this paper we introduce a new decomposition called the pivoted QLP decomposition. It is computed by applying pivoted orthogonal triangularization to the columns of the matrix X in question to get an upper triangular factor R and then applying the same procedure to the rows of R to get a lower triangular matrix L. The diagonal elements of R are called the R-values of X; those of L are called the L-values. Numerical examples show that the L-values track the singular values of X with considerable fidelity---far better than the R-values. At a gap in the L-values the decomposition provides orthonormal bases of analogues of row, column, and null spaces provided of X. The decomposition requires no more than twice the work required for a pivoted QR decomposition. The computation of R and L can be interleaved, so that the computation can be terminated at any suitable point, which makes the decomposition especially suitable for low-rank determination problems. The interleaved algorithm also suggests a new, efficient 2-norm estimator.}, keywords = {pivoted QR decomposition, QLP decomposition, rank determination, singular value decomposition}, doi = {10.1137/S1064827597319519}, url = {http://link.aip.org/link/?SCE/20/1336/1}, author = {Stewart, G.W.} } @conference {17871, title = {Querying Very Large Multi-dimensional Datasets in ADR}, booktitle = {In Proceedings of SC99: High Performance Networking and Computing}, year = {1999}, month = {1999///}, author = {Chialin,T. K and Kurc, T. and Chang,C. and Ferreira,R. and Sussman, Alan and Saltz, J.} } @book {17339, title = {Readings in Information Visualization: Using Vision to Think}, year = {1999}, month = {1999/01/25/}, publisher = {Morgan Kaufmann}, organization = {Morgan Kaufmann}, abstract = {This groundbreaking book defines the emerging field of information visualization and offers the first-ever collection of the classic papers of the discipline, with introductions and analytical discussions of each topic and paper. The authors{\textquoteright} intention is to present papers that focus on the use of visualization to discover relationships, using interactive graphics to amplify thought. This book is intended for research professionals in academia and industry; new graduate students and professors who want to begin work in this burgeoning field; professionals involved in financial data analysis, statistics, and information design; scientific data managers; and professionals involved in medical, bioinformatics, and other areas.* Full-color reproduction throughout* Author power team - an exciting and timely collaboration between the field{\textquoteright}s pioneering, most-respected names* The only book on Information Visualization with the depth necessary for use as a text or as a reference for the information professional* Text includes the classic source papers as well as a collection of cutting edge work}, keywords = {Computer Graphics, Computers / Computer Engineering, Computers / Computer Graphics, Computers / Computer Graphics / General, Computers / Computer Science, Computers / General, Computers / Information Technology, Computers / Information Theory, Computers / Intelligence (AI) \& Semantics, Computers / Social Aspects / Human-Computer Interaction, IMAGE PROCESSING, Information display systems, Information Visualization, Psychology / General, Visualization}, isbn = {9781558605336}, author = {Card,Stuart K. and Mackinlay,Jock D. and Shneiderman, Ben} } @conference {17529, title = {Running EveryWare on the computational grid}, booktitle = {Proceedings of the 1999 ACM/IEEE conference on Supercomputing (CDROM)}, year = {1999}, month = {1999///}, pages = {6{\textendash}es - 6{\textendash}es}, author = {Wolski,R. and Brevik,J. and Krintz,C. and Obertelli,G. and Spring, Neil and Su,A.} } @conference {13930, title = {Single display groupware: a model for co-present collaboration}, booktitle = {Proceedings of the SIGCHI conference on Human factors in computing systems: the CHI is the limit}, year = {1999}, month = {1999///}, pages = {286 - 293}, author = {Stewart,J. and Bederson, Benjamin B. and Druin, Allison} } @article {16368, title = {SIPR: A new framework for generating efficient code for sparse matrix computations}, journal = {Languages and Compilers for Parallel Computing}, year = {1999}, month = {1999///}, pages = {213 - 229}, author = {Pugh, William and Shpeisman,T.} } @article {17364, title = {Snap-Together Visualization: Coordinating Multiple Views to Explore Information}, journal = {Technical Reports from UMIACS}, year = {1999}, month = {1999/06/08/}, abstract = {Information visualizations with multiple coordinated views enable users torapidly explore complex data and discover relationships. However, it is usually difficult for users to find or create the coordinated visualizations they need. Snap-Together Visualization allows users to coordinate multiple views that are customized to their needs. Users query their relational database and load results into desired visualizations. Then they specify coordinations between visualizations for selecting, navigating, or re-querying. Developers can make independent visualization tools {\textquoteright}snap-able{\textquoteright} by including a few hooks. Also cross-referenced as UMIACS-TR-99-28 }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/1010}, author = {North,Chris and Shneiderman, Ben} } @article {13349, title = {A Study of the Structure of the Web}, journal = {University of California, Berkeley}, year = {1999}, month = {1999///}, abstract = {The World Wide Web is a huge, growing repository of information on a wide range of topics. It is alsobecoming important, commercially and sociologically, as a place of human interaction within different communities. In this paper we present an experimental study of the structure of the Web. We analyze link topologies of various communities, and patterns of mirroring of content, on 1997 and 1999 snapshots of the Web. Our results give insight into patterns of interaction within communities and how they evolve, as well as patterns of data replication. We also describe the techniques we have developed for performing complex processing on this large data set, and our experiences in doing so. We present new algorithms for finding partial and complete mirrors in URL hierarchies; these are also of independent interest for search and redirection. In order to study and visualize link topologies of different communities, we have developed techniques to compact these large link graphs without much information loss. }, author = {Deshpande, Amol and Huang,R. and Raman,V. and Riggs,T. and Song,D. and Subramanian,L.} } @article {17548, title = {A survey of the role of multicommodity flow and randomization in network design and routing}, journal = {American Mathematical Society, Series in Discrete Mathematics and Theoretical Computer Science}, volume = {43}, year = {1999}, month = {1999///}, pages = {271 - 302}, author = {Srinivasan, Aravind} } @conference {16173, title = {Temporal, geographical and categorical aggregations viewed through coordinated displays: a case study with highway incident data}, booktitle = {Proceedings of the 1999 workshop on new paradigms in information visualization and manipulation in conjunction with the eighth ACM internation conference on Information and knowledge management}, series = {NPIVM {\textquoteright}99}, year = {1999}, month = {1999///}, pages = {26 - 34}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Information visualization displays can hold a limited number of data points, typically a few thousand, before they get crowded. One way to solve this problem with larger data sets is to create aggregates. Aggregations were used together with the Snap-Together Visualization system to coordinate the visual displays of aggregates and their content. If two displays each hold one thousand items then rapid access and visibility can be maintained for a million points. This paper presents examples based on a database of highway incident data.}, isbn = {1-58113-254-9}, doi = {10.1145/331770.331780}, url = {http://doi.acm.org/10.1145/331770.331780}, author = {Fredrikson,Anna and North,Chris and Plaisant, Catherine and Shneiderman, Ben} } @article {16171, title = {Temporal visualization for legal case histories}, journal = {PROCEEDINGS OF THE ANNUAL MEETING-AMERICAN SOCIETY FOR INFORMATION SCIENCE}, volume = {36}, year = {1999}, month = {1999///}, pages = {271 - 279}, abstract = {This paper discusses visualization of legal information using a tool for temporal information called LifeLines. The direct and indirect histories of cases can become very complex. We explored ways that LifeLines could aid in viewing the links between the original case and the direct and indirect histories. The Apple Computer, Inc. v. Microsoft Corporation and Hewlett Packard Company case is used to illustrate the prototype. For example, if users want to find out how the rulings or statutes changed throughout this case, they could retrieve this information within a single display. Using the timeline, users could also choose at which point in time they would like to begin viewing the case. LifeLines support various views of a case{\textquoteright}s history. For instance, users can view the trial history of a case, the references involved in a case, and citations made to a case. The paper describes improvements to LifeLines that could help in providing a more useful visualization of case history.}, author = {Harris,C. and Allen,R.B. and Plaisant, Catherine and Shneiderman, Ben} } @article {17398, title = {TennisViewer: A Browser for Competition Trees}, journal = {Readings in information visualization: using vision to think}, year = {1999}, month = {1999///}, pages = {149 - 149}, author = {Johnson,B. and Shneiderman, Ben and Baker,MJ and Eick,SG} } @inbook {17399, title = {Text in 1D}, booktitle = {Readings in information visualizationReadings in information visualization}, year = {1999}, month = {1999///}, pages = {411 - 412}, publisher = {Morgan Kaufmann Publishers Inc.}, organization = {Morgan Kaufmann Publishers Inc.}, address = {San Francisco}, isbn = {1-55860-533-9}, author = {Card,S.K. and Mackinlay,J.D. and Shneiderman, Ben} } @inbook {17400, title = {Text in 2D}, booktitle = {Readings in information visualizationReadings in information visualization}, year = {1999}, month = {1999///}, pages = {431 - 431}, publisher = {Morgan Kaufmann Publishers Inc.}, organization = {Morgan Kaufmann Publishers Inc.}, address = {San Francisco}, isbn = {1-55860-533-9}, author = {Card,S.K. and Mackinlay,J.D. and Shneiderman, Ben} } @inbook {17401, title = {Text in 3D}, booktitle = {Readings in information visualizationReadings in information visualization}, year = {1999}, month = {1999///}, pages = {440 - 441}, publisher = {Morgan Kaufmann Publishers Inc.}, organization = {Morgan Kaufmann Publishers Inc.}, address = {San Francisco}, isbn = {1-55860-533-9}, author = {Card,S.K. and Mackinlay,J.D. and Shneiderman, Ben} } @inbook {17402, title = {Text in 3D+ time}, booktitle = {Readings in information visualizationReadings in information visualization}, year = {1999}, month = {1999///}, pages = {451 - 451}, publisher = {Morgan Kaufmann Publishers Inc.}, organization = {Morgan Kaufmann Publishers Inc.}, address = {San Francisco}, isbn = {1-55860-533-9}, author = {Card,S.K. and Mackinlay,J.D. and Shneiderman, Ben} } @conference {17443, title = {Trust me, I{\textquoteright}m accountable: trust and accountability online}, booktitle = {CHI {\textquoteright}99 extended abstracts on Human factors in computing systems}, series = {CHI EA {\textquoteright}99}, year = {1999}, month = {1999///}, pages = {79 - 80}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {We live in an increasingly wired world. According to Robert Putnam, people are spending less time in persistent personal face to face interactions and more time in pursuits such as watching TV and using the Internet. At the same time, independently measured "social capital" -- the extent to which we trust and work for a common good -- is declining. In this panel, we explore: the impacts of electronic media on trust and accountability; whether and how electronic media can be designed and used to increase deserved trust and accountability; the relationship between protecting privacy and increasing the efficacy of communication; and how people{\textquoteright}s tendency to treat computers as social actors impacts these issues. In brief, how can modern technology enhance humanity{\textquoteright}s humanity?}, keywords = {accountability, anonymity, Communication, computers and society, ethics, Internet, media effects, privacy, Reciprocity, repute, social actors, social capital, social impacts, trust, value-sensitive design, wired world, WWW}, isbn = {1-58113-158-5}, doi = {10.1145/632716.632766}, url = {http://doi.acm.org/10.1145/632716.632766}, author = {Friedman,Batya and Thomas,John C. and Grudin,Jonathan and Nass,Clifford and Nissenbaum,Helen and Schlager,Mark and Shneiderman, Ben} } @article {17452, title = {Understanding Patterns of User Visits to Web Sites: Interactive Starfield Visualization of WWW Log Data-Short Version}, journal = {Tech Report HCIL-99-06}, year = {1999}, month = {1999///}, abstract = {HTTP server log files provide Web site operators with substantial detail regarding the visitors to their sites. Interest in interpreting this data has spawned an active market for software packages that summarize and analyze this data, providing histograms, pie graphs, and other charts summarizing usage patterns. While useful, these summaries obscure useful information and restrict users to passive interpretation of static displays.Interactive starfield visualizations can be used to provide users with greater abilities to interpret and explore web log data. By combining two-dimensional displays of thousands of individual access requests, color and size coding for additional attributes, and facilities for zooming and filtering, these visualizations provide capabilities for examining data that exceed those of traditional web log analysis tools. We introduce a series of interactive starfield visualizations, which can be used to explore server data across various dimensions. Possible uses of these visualizations are discussed, and difficulties of data collection, presentation, and interpretation are explored. }, author = {Hochheiser,H. and Shneiderman, Ben} } @conference {17473, title = {User interfaces for creativity support tools}, booktitle = {Proceedings of the 3rd conference on Creativity \& cognition}, series = {C\&C {\textquoteright}99}, year = {1999}, month = {1999///}, pages = {15 - 22}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, isbn = {1-58113-078-3}, doi = {10.1145/317561.317565}, url = {http://doi.acm.org/10.1145/317561.317565}, author = {Shneiderman, Ben} } @conference {15467, title = {Using a goal-driven approach to generate test cases for GUIs}, booktitle = {Software Engineering, 1999. Proceedings of the 1999 International Conference on}, year = {1999}, month = {1999/05//}, pages = {257 - 266}, abstract = {The widespread use of GUIs for interacting with software is leading to the construction of more and more complex GUIs. With the growing complexity comes challenges in testing the correctness of a GUI and the underlying software. We present a new technique to automatically generate test cases for GUIs that exploits planning, a well developed and used technique in artificial intelligence. Given a set of operators, an initial state and a goal state, a planner produces a sequence of the operators that will change the initial state to the goal state. Our test case generation technique first analyzes a GUI and derives hierarchical planning operators from the actions in the GUI. The test designer determines the preconditions and effects of the hierarchical operators, which are then input into a planning system. With the knowledge of the GUI and the way in which the user will interact with the GUI, the test designer creates sets of initial and goal states. Given these initial and final states of the GUI, a hierarchical planner produces plans, or a set of test cases, that enable the goal state to be reached. Our technique has the additional benefit of putting verification commands into the test cases automatically. We implemented our technique by developing the GUI analyzer and extending a planner. We generated test cases for Microsoft{\textquoteright}s Word-Pad to demonstrate the viability and practicality of the approach.}, keywords = {Artificial intelligence, automatic test case generation, goal state, goal-driven approach, Graphical user interfaces, GUIs, hierarchical planning operators, initial state, Microsoft Word-Pad, operators, planning (artificial intelligence), program testing, software, verification commands}, author = {Memon, Atif M. and Pollack,M. E and Soffa,M. L} } @article {17479, title = {Using Interactive Visualizations of WWW Log Data to Characterize Access Patterns and Inform Site Design}, year = {1999}, month = {1999///}, abstract = {HTTP server log files provide Web site operators with substantial detail regarding the visitors to their sites. Interest ininterpreting this data has spawned an active market for software packages that summarize and analyze this data, providing histograms, pie graphs, and other charts summarizing usage patterns. While useful, these summaries obscureuseful information and restrict users to passive interpretation of static displays. Interactive visualizations can be used to provide users with greater abilities to interpret and explore web log data. Bycombining two-dimensional displays of thousands of individual access requests, color and size coding for additional attributes, and facilities for zooming and filtering, these visualizations provide capabilities for examining data that exceed those of traditional web log analysis tools.

We introduce a series of interactive visualizations that can be used to explore server data across various dimensions. Sample visualizations of server data from two web sites are presented. Coordinated, snap-together visualizations (STVs) of log data are introduced as a means of gaining additional expressive power. Possible uses of these visualizations are discussed, and difficulties of data collection, presentation, and interpretation are explored.}, keywords = {Information Visualization, log file analysis, World Wide Web}, url = {http://drum.lib.umd.edu/handle/1903/6034}, author = {Hochheiser,Harry and Shneiderman, Ben} } @article {14441, title = {Using probabilistic relational models for collaborative filtering}, journal = {Proc. Workshop Web Usage Analysis and User Profiling (WEBKDD{\textquoteright}99)}, year = {1999}, month = {1999///}, abstract = {Recent projects in collaborative filtering and information filtering address the task of inferring user prefer-ence relationships for products or information. The data on which these inferences are based typically con- sists of pairs of people and items. The items may be information sources (such as web pages or newspaper articles) or products (such as books, software, movies or CDs). We are interested in making recommen- dations or predictions. Traditional approaches to the problem derive from classical algorithms in statistical pattern recognition and machine learning. The majority of these approaches assume a {\textquotedblright}flat{\textquotedblright} data repre- sentation for each object, and focus on a single dyadic relationship between the objects. In this paper, we examine a richer model that allows us to reason about many different relations at the same time. We build on the recent work on probabilistic relational models (PRMs), and describe how PRMs can be applied to the task of collaborative filtering. PRMs allow us to represent uncertainty about the existence of relationships in the model and allow the properties of an object to depend probabilistically both on other properties of that object and on properties of related objects. }, author = {Getoor, Lise and Sahami,M.} } @article {17482, title = {Using vision to think}, journal = {Readings in information visualization: using vision to think}, year = {1999}, month = {1999///}, pages = {579 - 581}, author = {Card,S.K. and Mackinlay,J.D. and Shneiderman, Ben} } @conference {17504, title = {Visually enhanced objects}, booktitle = {Readings in information visualization}, year = {1999}, month = {1999///}, pages = {561 - 561}, publisher = {Morgan Kaufmann Publishers Inc.}, organization = {Morgan Kaufmann Publishers Inc.}, address = {San Francisco}, isbn = {1-55860-533-9}, author = {Card,S.K. and Mackinlay,J.D. and Shneiderman, Ben} } @article {17514, title = {Zoom-Only Vs Overview-Detail Pair: A Study in Browsing Techniques as Applied to Patient Histories}, journal = {University of Maryland Technical Report, CS-TR}, volume = {4028}, year = {1999}, month = {1999///}, pages = {12 - 12}, author = {Ghosh,P. and Shneiderman, Ben} } @conference {18754, title = {3D spatial layouts using a-teams}, year = {1998}, month = {1998///}, abstract = {Spatial layout is the problem of arranging a set of componentsin an enclosure such that a set of objectives and constraints is sat- isfied. The constraints may include non-interference of objects, accessibility requirements and connection cost limits. Spatial lay- out problems are found primarily in the domains of electrical en- gineering and mechanical engineering in the design of integrated circuits and mechanical or electromechanical artifacts. Traditional approaches include ad-hoc (or specialized) heuristics, Genetic Al- gorithms and Simulated Annealing. The A-Teams approach pro- vides a way of synergistically combining these approaches in a modular agent based fashion. A-Teams are also open to the addi- tion of new agents. Modifications in the task requirements trans- late to modifications in the agent mix. In this paper we describe how modular A-Team based optimization can be used to solve 3 dimensional spatial layout problems. }, url = {http://www-2.cs.cmu.edu/afs/cs.cmu.edu/user/cjp/www/pubs/DETC98.pdf}, author = {Sachdev,S. and Paredis,C. J. J. and Gupta,S.K. and Talukdar,S. N.} } @article {15683, title = {Access Policies for Distributed Video-on-Demand Systems}, journal = {Journal of the WAS, Special Issue on Communications, 85 (2)}, year = {1998}, month = {1998///}, author = {Simon,R. and Mundur, Padma and Sood,A.} } @article {17717, title = {On the adjugate matrix}, journal = {Linear Algebra and its Applications}, volume = {283}, year = {1998}, month = {1998/11/01/}, pages = {151 - 164}, abstract = {The adjugate AA of a matrix A is the transpose of the matrix of the co-factors of the elements of A. The computation of the adjugate from its definition involves the computation of n2 determinants of order (n-1){\textemdash}a prohibitively expensive O(n4) process. On the other hand, the computation from the formula AA = det (A)A-1 breaks down when A is singular and is potentially unstable when A is ill-conditioned with respect to inversion. In this paper we first show that the adjugate can be perfectly conditioned, even when A is ill-conditioned. We then show that if due care is taken the adjugate can be accurately computed from the inverse, even when the latter has been inaccurately computed. In Appendix A we give a formal derivation of an observation of Wilkinson on the accuracy of computed inverses.}, isbn = {0024-3795}, doi = {10.1016/S0024-3795(98)10098-8}, url = {http://www.sciencedirect.com/science/article/pii/S0024379598100988}, author = {Stewart, G.W.} } @conference {17525, title = {Application level scheduling of gene sequence comparison on metacomputers}, booktitle = {Proceedings of the 12th international conference on Supercomputing}, year = {1998}, month = {1998///}, pages = {141 - 148}, author = {Spring, Neil and Wolski,R.} } @article {15651, title = {Approximating large convolutions in digital images}, journal = {PROCEEDINGS-SPIE THE INTERNATIONAL SOCIETY FOR OPTICAL ENGINEERING}, year = {1998}, month = {1998///}, pages = {216 - 227}, abstract = {Computing discrete two-dimensional convolutions is an important problem in image processing. In mathematicalmorphology, an important variant is that of computing binary convolutions, where the kernel of the convolution is a 0{1 valued function. This operation can be quite costly, especially when large kernels are involved. In this paper, we present an algorithm for computing convolutions of this form, where the kernel of the binary convolution is derived from a convex polygon. Because the kernel is a geometric object, we allow the algorithm some exibility in how it elects to digitize the convex kernel at each placement, as long as the digitization satis es certain reasonable requirements. We say that such a convolution is valid. Given this exibility we show that it is possible to compute binary convolutions more e ciently than would normally be possible for large kernels. Our main result is an algorithm, which given an m n image and a k-sided convex polygonal kernel, computes a valid convolution in time O(kmn) time. Unlike standard algorithms for computing correlations and convolutions, the running time is independent of the area or perimeter of K, and our techniques do not rely on computing fast Fourier transforms. Our algorithm is based on a novel use of Bresenham{\textquoteright}s line-drawing algorithm and pre x-sums to update the convolution e ciently as the kernel is moved from one position to another across the image. }, author = {Kanungo,T. and Mount, Dave and Netanyahu,N. S and Piatko,C. and Silverman,R. and Wu,A. Y} } @conference {18662, title = {AQuA: an adaptive architecture that provides dependable distributed objects}, booktitle = {Seventeenth IEEE Symposium on Reliable Distributed Systems}, year = {1998}, month = {1998/10//}, pages = {245 - 253}, abstract = {Dependable distributed systems are difficult to build. This is particularly true if they have dependability requirements that change during the execution of an application, and are built with commercial off-the-shelf hardware. In that case, fault tolerance must be achieved using middleware software, and mechanisms must be provided to communicate the dependability requirements of a distributed application to the system and to adapt the system{\textquoteright}s configuration to try to achieve the desired dependability. The AQuA architecture allows distributed applications to request a desired level of availability using the Quality Objects (QuO) framework and includes a dependability manager that attempts to meet requested availability levels by configuring the system in response to outside requests and changes in system resources due to faults. The AQuA architecture uses the QuO runtime to process and invoke availability requests, the Proteus dependability manager to configure the system in response to faults and availability requests, and the Ensemble protocol stack to provide group communication services. Furthermore, a CORBA interface is provided to application objects using the AQuA gateway. The gateway provides a mechanism to translate between process-level communication, as supported by Ensemble, and IIOP messages, understood by Object Request Brokers. Both active and passive replication are supported, and the replication type to use is chosen based on the performance and dependability requirements of particular distributed applications}, keywords = {adaptive architecture, AQuA, availability requests, client-server systems, commercial off-the-shelf hardware, CORBA, dependability manager, dependability requirements, dependable distributed objects, distributed object management, Ensemble protocol stack, Fault tolerance, group communication services, middleware software, Object Request Brokers, process-level communication, proteus, Quality Objects, replication, software fault tolerance, Software quality}, doi = {10.1109/RELDIS.1998.740506}, author = {Cukier, Michel and Ren,J. and Sabnis,C. and Henke,D. and Pistole,J. and Sanders,W. H. and Bakken,D. E. and Berman,M.E. and Karr,D. A. and Schantz,R.E.} } @article {15675, title = {On the Area of Overlap of Translated Polygons}, volume = {CS-TR-3201}, year = {1998}, month = {1998/10/15/}, institution = {Department of Computer Science, University of Maryland, College Park}, abstract = {(Also cross-referenced as CAR-TR-699) Given two simple polygons P and Q in the plane and a translation vector t E R2, the area-oJ-overlap function of P and Q is the function Ar(t) = Area(P n (t + Q)), where t + Q denotes Q translated by t. This function has a number of applications in areas such as motion planning and object recognition. We present a number of mathematical results regarding this function. We also provide efficient algorithms for computing a representation of this function, and for tracing contour curves of constant area of o verlap. }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu//handle/1903/403}, author = {Mount, Dave and Silverman,Ruth and Wu,Angela Y.} } @article {16979, title = {Assessing users{\textquoteright} subjective satisfaction with the Information System for Youth Services (ISYS)}, journal = {Institute for Systems Research Technical Reports}, year = {1998}, month = {1998/10/15/}, abstract = {In this investigation, the Questionnaire for User Interaction Satisfaction(QUIS 5.5), a tool for assessing users{\textquoteright} subjective satisfaction with specific aspects of the human/computer interface was used to assess the strengths and weaknesses of the Info rmation System for Youth Services (ISYS). ISYS is used by over 600 employees of the Maryland State Department of Juvenile Services (DJS) as a tracking device for juvenile offenders. Ratings and comments were collected from 254 DJS employees who use ISYS. The overall mean rating across all questions was 5.1 on a one to nine scale. The ten highest and lowest rated questions were identified. The QUIS allowed us to isolate subgroups which were compared with mean ratings from four measures of specific interfac e factors. The comments obtained from users provided suggestions, complaints and endorsements of the system. Also cross-referenced as CAR-TR-768 }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/431}, author = {Slaughter,Laura and Norman,Kent L and Shneiderman, Ben} } @conference {12102, title = {Automated recovery in a secure bootstrap process}, booktitle = {Proceedings of the Symposium on Network and Distributed Systems Security (NDSS{\textquoteright}98)}, year = {1998}, month = {1998///}, pages = {155 - 167}, author = {Arbaugh, William A. and Keromytis,A. D and Farber,D. J and Smith,J. M} } @book {17692, title = {Basic decompositions}, volume = {1}, year = {1998}, month = {1998///}, publisher = {Soc. for Industrial and Applied Mathematics}, organization = {Soc. for Industrial and Applied Mathematics}, author = {Stewart, G.W.} } @article {13731, title = {Bilingual Lexicon Construction Using Large Corpora}, year = {1998}, month = {1998/10/15/}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {This paper introduces a method for learning bilingual term and sentencelevel alignments for the purpose of building lexicons. Combining statistical techniques with linguistic knowledge, a general algorithm is developed for learning term and sentence alignments from large bilingual corpora with high accuracy. This is achieved through the use of filtered linguistic feedback between term and sentence alignment processes. An implementation of this algorithm, TAG-ALIGN, is evaluated against approaches similar to [Brown et al. 1993] that apply Bayesian techniques for term alignment, and [Gale and Church 1991] a dynamic programming method for aligning sentences. The ultimate goal is to produce large bilingual lexicons with a high degree of accuracy from potentially noisy corpora. (Also cross-referenced as UMIACS-TR-97-50) }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/832}, author = {Shen,Wade and Dorr, Bonnie J} } @article {17001, title = {Browsing Unix Directories With Dynamic Queries: An Evaluation of Three Information Display Techniques}, journal = {Technical Reports of the Computer Science Department}, year = {1998}, month = {1998/10/15/}, abstract = {We designed, implemented, and evaluated an innovative concept fordynamic queries which involves the direct manipulation of small databases. Our domain was directories in a Unix file system. Dynamic queries allow users to formulate queries and explore the databases with graphical widgets, such as sliders and buttons, without requiring them to have any knowledge about the underlying structure of the database query languages, or command language syntax. Three interfaces for presenting directories were developed and tested with eighteen subjects in a within-subject design. The results of the formative evaluation yielded some useful guidelines for software designers. (Also cross-referenced as CAR-TR-605) }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/379}, author = {Liao,Holmes and Osada,Masakazu and Shneiderman, Ben} } @article {17005, title = {Buttons vs. menus: An exploratory study of pull-down menu selection as compared to button bars}, journal = {Technical Reports of the Computer Science Department}, year = {1998}, month = {1998/10/15/}, abstract = {Button bars are a relatively new interaction method intended to speedup application use as compared to pull-down menus. This exploratory study compares three command selection methods: pull-down menus, button bars, and user choice of pull-down menus or button bars. Effectiveness was measured in two ways: speed of selection and error rate. 15 participants performed 15 word processor related tasks. Results show that in frequently used functions, such as character attribute selection (bold, italic, u nderline, etc.), button bars are faster. There were no statistically significant differences in error rates between the three interaction methods. (Also cross-referenced as CAR-TR-764) }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/428}, author = {Ellis,Jason and Tran,Chi and Ryoo,Jake and Shneiderman, Ben} } @conference {18740, title = {Capturing articulation in assemblies from component geometry}, year = {1998}, month = {1998///}, abstract = {This paper presents a method to extract instantaneous artic-ulation from part geometry, based on surface mating constraints as well as constraints imposed by other incidental contacts. Many assemblies contain joints, each of which have degrees of freedom associated with them. These joints allow the relative positions of parts in the mechanism to change as the joints are articulated. Being able to represent these joints and their behav- ior is important from the designers perspective because it enables him or her to verify whether kinematic requirements have been met.Therefore, it is useful to be able to obtain such joint informa- tion directly from part geometry and contact physics. The method presented here handles all lower pairs of kine- matic joints. Surface mating contacts are classified into one of three types: planar, spherical and cylindrical. The contacts are represented by algebraic inequalities describing the translational and angular velocities at the contact. Non-penetration conditions are written for a finite set of points on the boundary of each contact face, and it is shown that the finite set of conditions is representative of the entire boundary and the region enclosed by the boundary. Simultaneous satisfaction of the non-penetration conditions at all the contact surfaces between a pair of bodies is represented by a 6-dimensional simplex, which can be solved using linear programming. }, url = {http://www-cgi.cs.cmu.edu/afs/cs.cmu.edu/user/cjp/www/pubs/DAC98.pdf}, author = {Sinha,R. and Paredis,C. J. J. and Gupta,S.K. and Khosla,P. K.} } @article {17014, title = {Codex, Memex, Genex: The Pursuit of Transformational Technologies}, journal = {International Journal of Human-Computer Interaction}, volume = {10}, year = {1998}, month = {1998///}, pages = {87 - 106}, abstract = {Handwritten codexes or printed books transformed society by allowing users to preserve and transmit information. Today, leather-bound volumes and illuminated manuscripts are giving way to animated image maps and hot links. Vannevarr Bush{\textquoteright}s memex has inspired the World Wide Web, which provides users with vast information resources and convenient communications. In looking to the future, we might again transform society by building genexes?generators of excellence. Such inspirational environment would empower personal and collaborative creativity by enabling users to: Collect information from an existing domain of knowledge. Create innovations using advanced tools. Consult with peers or mentors in the field. Disseminate the results widely. This article describes how a framework for an integrated set of software tools might support this 4-phase model of creative in science, medicine, the arts, and beyond. Current initiatives are positive and encouraging, but they do not work in an integrated fashion often miss vital components, and are frequently poorly designed. A well-conceived and clearly stated framework could guide design efforts, coordinate planning, and speed development.Handwritten codexes or printed books transformed society by allowing users to preserve and transmit information. Today, leather-bound volumes and illuminated manuscripts are giving way to animated image maps and hot links. Vannevarr Bush{\textquoteright}s memex has inspired the World Wide Web, which provides users with vast information resources and convenient communications. In looking to the future, we might again transform society by building genexes?generators of excellence. Such inspirational environment would empower personal and collaborative creativity by enabling users to: Collect information from an existing domain of knowledge. Create innovations using advanced tools. Consult with peers or mentors in the field. Disseminate the results widely. This article describes how a framework for an integrated set of software tools might support this 4-phase model of creative in science, medicine, the arts, and beyond. Current initiatives are positive and encouraging, but they do not work in an integrated fashion often miss vital components, and are frequently poorly designed. A well-conceived and clearly stated framework could guide design efforts, coordinate planning, and speed development. }, isbn = {1044-7318}, doi = {10.1207/s15327590ijhc1002_1}, url = {http://www.tandfonline.com/doi/abs/10.1207/s15327590ijhc1002_1}, author = {Shneiderman, Ben} } @article {16544, title = {Computational studies of lateralization of phoneme sequence generation}, journal = {Neural Computation}, volume = {10}, year = {1998}, month = {1998///}, pages = {1277 - 1297}, author = {Reggia, James A. and Goodall,S. and Shkuro,Y.} } @article {17718, title = {On the convergence of a new Rayleigh quotient method with applications to large eigenproblems}, journal = {Electronic Transactions on Numerical Analysis}, volume = {7}, year = {1998}, month = {1998///}, pages = {182 - 189}, abstract = {In this paper we propose a variant of the Rayleigh quotient method to compute an eigenvalue and cor-responding eigenvectors of a matrix. It is based on the observation that eigenvectors of a matrix with eigenvalue zero are also singular vectors corresponding to zero singular values. Instead of computing eigenvector approximations by the inverse power method, we take them to be the singular vectors corresponding to the smallest singular value of the shifted matrix. If these singular vectors are computed exactly the method is quadratically convergent. However, ex- act singular vectors are not required for convergence, and the resulting method combined with Golub{\textendash}Kahan{\textendash}Krylov bidiagonalization looks promising for enhancement/refinement methods for large eigenvalue problems. }, author = {Oleary,D. P. and Stewart, G.W.} } @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} } @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 {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 {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.} } @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 {17122, title = {Educational Journeys on the Web Frontier}, journal = {Educom Review}, volume = {33}, year = {1998}, month = {1998///}, pages = {10 - 14}, author = {Shneiderman, Ben} } @article {17125, title = {Elastic windows: design, implementation, and evaluation of multi-window operations}, journal = {Software: Practice and Experience}, volume = {28}, year = {1998}, month = {1998/03/01/}, pages = {225 - 248}, abstract = {Most windowing systems follow the independent overlapping windows approach, which emerged as an answer to the needs of early computer users. Due to advances in computers, display technology, and increased information needs, modern users demand more functionality from window management systems. We propose Elastic Windows with improved spatial layout and rapid multi-window operations as an alternative to current window management strategies. In this approach, multi-window operations are achieved by issuing operations on window groups hierarchically organized in a space-filling tiled layout similar to TreeMaps.1 Sophisticated multi-window operations have been developed to handle fast task-switching and to structure the work environment of users to their rapidly changing needs. We claim that these multi-window operations and the tiled spatial layout dynamics decrease the cognitive load on users by decreasing the number of window operations. This paper describes the Elastic Windows interface in detail and then presents a user study conducted to compare the performance of 12 users with Elastic Windows and traditional Independent Overlapping Windows. User performance was measured in terms of task environment setup, switching, and task execution for 2, 6, and 12 window situations. Elastic Windows users had statistically significantly faster performance for all tasks in 6 and 12 window situations. These results suggest promising possibilities for multiple window operations and hierarchical nesting, which can be applied to the next generation of tiled as well as overlapped window managers. {\textcopyright} 1998 John Wiley \& Sons, Ltd.}, keywords = {hierarchical windows, multi-window operations, personal role management, window management, windowing system evaluation, World Wide Web}, isbn = {1097-024X}, doi = {10.1002/(SICI)1097-024X(199803)28:3<225::AID-SPE151>3.0.CO;2-D}, url = {http://onlinelibrary.wiley.com/doi/10.1002/(SICI)1097-024X(199803)28:3\%3C225::AID-SPE151\%3E3.0.CO;2-D/abstract}, author = {Kandogan,Eser and Shneiderman, Ben} } @article {17130, title = {Emergent patterns of teaching/learning in electronic classrooms}, journal = {Educational Technology Research and Development}, volume = {46}, year = {1998}, month = {1998///}, pages = {23 - 42}, abstract = {Novel patterns of teaching/learning have emerged from faculty and students who use our three teaching/learning theaters at the University of Maryland, College Park. These fully-equipped electronic classrooms have been used by 74 faculty in 264 semester-long courses since the fall of 1991 with largely enthusiastic reception by both faculty and students. The designers of the teaching/learning theaters sought to provide a technologically rich environment and a support staff so that faculty could concentrate on changing the traditional lecture from its unidirectional information flow to a more collaborative activity. As faculty have evolved their personal styles in using the electronic classrooms, novel patterns of teaching/learning have emerged. In addition to enhanced lectures, we identified three common patterns: (a) active individual learning, (b) small-group collaborative learning, and (c) entire-class collaborative learning.}, isbn = {1042-1629}, url = {http://dx.doi.org/10.1007/BF02299671}, author = {Shneiderman, Ben and Borkowski,Ellen and Alavi,Maryam and Norman,Kent} } @article {16964, title = {An Empirical Study of Perspective-Based Usability Inspection}, journal = {Proceedings of the Human Factors and Ergonomics Society Annual MeetingProceedings of the Human Factors and Ergonomics Society Annual Meeting}, volume = {42}, year = {1998}, month = {1998/10/01/}, pages = {1346 - 1350}, abstract = {Inspection is a fundamental means of achieving software usability. Past research showed that during usability inspection the success rate (percentage of problems detected) of each individual inspector was rather low. We developed perspective-based usability inspection, which divides the large variety of usability issues along different perspectives and focuses each inspection session on one perspective. We conducted a controlled experiment to study its effectiveness, using a post-test only control group experimental design, with 24 professionals as subjects. The control group used heuristic evaluation, which is the most popular technique for usability inspection. The experimental results are that 1) for usability problems covered by each perspective, the inspectors using that perspective had higher success rate than others; 2) for all usability problems, perspective inspectors had higher average success rate than heuristic inspectors; 3) for all usability problems, the union of three perspective inspectors (with one from each perspective) had higher average success rate than the union of three heuristic inspectors.}, isbn = {1071-1813,}, doi = {10.1177/154193129804201904}, url = {http://pro.sagepub.com/content/42/19/1346}, author = {Zhang,Zhijun and Basili, Victor R. and Shneiderman, Ben} } @article {17134, title = {Engagement Theory: A Framework for Technology-Based Teaching and Learning.}, journal = {Educational TechnologyEducational Technology}, volume = {38}, year = {1998}, month = {1998///}, pages = {20 - 23}, abstract = {Discusses engagement theory (students meaningfully engaged in learning activities through interaction with others and worthwhile tasks) and the three components, collaboration, project orientation, and authentic focus, and outlines research questions to establish its efficacy. (PEN)}, keywords = {Computer Uses in Education, Cooperation, Educational Technology, Educational Theories, Instructional Effectiveness, interaction, Learning Activities, Research Needs, Student Motivation, Student Projects, Teaching Methods}, isbn = {ISSN-0013-1962}, url = {http://www.eric.ed.gov/ERICWebPortal/detail?accno=EJ573955}, author = {Kearsley,Greg and Shneiderman, Ben} } @article {17595, title = {Explicit OR-dispersers with polylogarithmic degree}, journal = {Journal of the ACM (JACM)}, volume = {45}, year = {1998}, month = {1998/01//}, pages = {123 - 154}, abstract = {An (N, M, T)-OR-disperser is a bipartite multigraph G=(V, W, E) with |V| = N, and |W| = M, having the following expansion property: any subset of V having at least T vertices has a neighbor set of size at least M/2. For any pair of constants \&xgr;, \&lgr;, 1 >= \&xgr; > \&lgr; >= 0, any sufficiently large N, and for any T >= 2(logN) M <= 2(log N)\&lgr;, we give an explicit elementary construction of an (N, M, T)-OR-disperser such that the out-degree of any vertex in V is at most polylogarithmic in N. Using this with known applications of OR-dispersers yields several results. First, our construction implies that the complexity class Strong-RP defined by Sipser, equals RP. Second, for any fixed \&eegr; > 0, we give the first polynomial-time simulation of RP algorithms using the output of any {\textquotedblleft}\&eegr;-minimally random{\textquotedblright} source. For any integral R > 0, such a source accepts a single request for an R-bit string and generates the string according to a distribution that assigns probability at most 2-R\&eegr; to any string. It is minimally random in the sense that any weaker source is insufficient to do a black-box polynomial-time simulation of RP algorithms.}, keywords = {derandomization, expander graphs, explicit constructions, hardness of approximation, hashing lemmas, imperfect sources of randomness, measures of information, pseudo-random generators, randomized computation, time-space tradeoffs}, isbn = {0004-5411}, doi = {10.1145/273865.273915}, url = {http://doi.acm.org/10.1145/273865.273915}, author = {Saks,Michael and Srinivasan, Aravind and Zhou,Shiyu} } @article {17413, title = {The Eyes Have It: User Interfaces for Information Visualization}, journal = {Information Visualization}, volume = {1452}, year = {1998}, month = {1998///}, pages = {1519 - 1519}, author = {Shneiderman, Ben} } @article {16178, title = {Facilitating Network Data Exploration with Query Previews: A Study of User Performance and Preference}, journal = {Technical Reports of the Computer Science Department}, year = {1998}, month = {1998/10/15/}, abstract = {Current network data exploration systems which use command languages (e.g.SQL) or form fill-in interfaces fail to give users an indication of the distribution of data items. This leads many users to waste time posing queries which have zero-hit or mega-hit result sets. Query previewing is a novel visual approach for browsing huge networked information warehouses. Query previews supply data distribution information about the database that is being searched and give continuous feedback about the size of the result set for the query as it is being formed. Our within-subjects empirical comparison studied 12 subjects using a form fill-in interface with and without query previews. We found statistically significant differences showing that query previews sped up performance 1.6 to 2.1 times and led to higher subjective satisfaction. (Also cross-referenced as UMIACS-98-14) }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/488}, author = {Tanin,Egemen and Lotem,Amnon and Haddadin,Ihab and Shneiderman, Ben and Plaisant, Catherine and Slaughter,Laura} } @article {15226, title = {Facility Location with Dynamic Distance Functions}, journal = {Journal of Combinatorial Optimization}, volume = {2}, year = {1998}, month = {1998///}, pages = {199 - 217}, abstract = {Facility location problems have always been studied with theassumption that the edge lengths in the network are static anddo not change over time. The underlying network could be used to model a city street networkfor emergency facility location/hospitals, or an electronic network for locating information centers. In any case, it is clear that due to trafficcongestion the traversal time on links changes with time. Very often, we have estimates as to how the edge lengths change over time, and our objective is to choose a set of locations (vertices) ascenters, such that at every time instant each vertex has a center close to it (clearly, the center close to a vertex may change over time). We also provide approximation algorithms as well as hardness results forthe K-center problem under this model. This is the first comprehensive study regarding approximation algorithmsfor facility location for good time-invariant solutions.}, doi = {10.1023/A:1009796525600}, author = {Khuller, Samir and Sussmann,Y. J and Bhatia,Randeep and Guha,Sudipto} } @article {17699, title = {Four algorithms for the efficient computation of truncated pivoted QR approximation to a sparse matrix}, volume = {TR-98-12}, year = {1998}, month = {1998///}, institution = {University of Maryland, College Park}, abstract = {In this paper we propose four algorithms to compute truncated pivoted QR approximations to a sparse matrix. Three are based on the Gram{\textendash}Schmidt algorithm and the other on Householder triangularization. All four algorithms leave the original matrix unchanged, and the only additional storage requirements are arrays to contain the factorization itself. Thus, the algorithms are particularly suited to determining low-rank approximations to a sparse matrix.}, author = {Stewart, G.W.} } @article {17702, title = {Gaussian Elimination, Perturbation Theory and Markov Chains}, volume = {UMIACS-TR-92-23}, year = {1998}, month = {1998/10/15/}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {The purpose of this paper is to describe the special problems thatemerge when Gaussian elimination is used to determinin the steady-state vector of a Markov chain. (Also cross-referenced as UMIACS-TR-92-23) }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/564}, author = {Stewart, G.W.} } @article {17712, title = {On hyperbolic triangularization: Stability and pivoting}, journal = {SIAM journal on matrix analysis and applications}, volume = {19}, year = {1998}, month = {1998///}, pages = {847 - 860}, abstract = {This paper treats the problem of triangularizing a matrix by hyperbolic Householdertransformations. The stability of this method, which finds application in block updating and fast algorithms for Toeplitz-like matrices, has been analyzed only in special cases. Here we give a gen- eral analysis which shows that two distinct implementations of the individual transformations are relationally stable. The analysis also shows that pivoting is required for the entire triangularization algorithm to be stable. }, author = {Stewart,M. and Stewart, G.W.} } @article {17703, title = {Implementing an Algorithm for Solving Block Hessenberg Systems}, volume = {UMIACS-TR-94-70}, year = {1998}, month = {1998/10/15/}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {This paper describes the implementation of a recursive descent methodfor solving block Hessenberg systems. Although the algorithm is conceptually simple, its implementation in C (a natural choice of language given the recursive nature of the algorithm and its data) is nontrivial. Particularly important is the balance between ease of use, computational efficiency, and flexibility. (Also cross-referenced as UMIACS-TR-94-70) }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/642}, author = {Stewart, G.W.} } @conference {17609, title = {Improved bounds and algorithms for hypergraph two-coloring}, booktitle = {39th Annual Symposium on Foundations of Computer Science, 1998. Proceedings}, year = {1998}, month = {1998/11/08/11}, pages = {684 - 693}, publisher = {IEEE}, organization = {IEEE}, abstract = {We show that for all large n, every n-uniform hypergraph with at most 0.7√(n/lnn){\texttimes}2n edges can be two-colored. We, in fact, present fast algorithms that output a proper two-coloring with high probability for such hypergraphs. We also derandomize and parallelize these algorithms, to derive NC1 versions of these results. This makes progress on a problem of Erdos (1963), improving the previous-best bound of n1/3-0(1){\texttimes}2n due to Beck (1978). We further generalize this to a {\textquotedblleft}local{\textquotedblright} version, improving on one of the first applications of the Lovasz Local Lemma}, keywords = {algorithms, Application software, Approximation algorithms, bounds, computational geometry, Computer science, Contracts, Erbium, graph colouring, History, hypergraph two-coloring, Lab-on-a-chip, MATHEMATICS, n-uniform hypergraph, Parallel algorithms, Polynomials, probability}, isbn = {0-8186-9172-7}, doi = {10.1109/SFCS.1998.743519}, author = {Radhakrishnan,J. and Srinivasan, Aravind} } @article {16182, title = {Incorporating String Search in a Hypertext System:User Interface and Signature File Design Issues}, journal = {Technical Reports of the Computer Science Department}, year = {1998}, month = {1998/10/15/}, abstract = {Hypertext systems provide an appealing mechanism forinformally browsing databases by traversing selectable links. However, in many fact finding situations string search is an effective complement to browsing. This paper describes the application of the signature file method to achieve rapid and convenient string search in small personal computer hypertext environments. The method has been implemented in a prototype, as well as in a commercial product. Performance data for search times and storage space are presented from a commercial hypertext database. User interface issues are then discussed. Experience with the string search interface indicates that it was used sucessfully by novice users. (Also cross-referenced as CAR-TR-448) }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/359}, author = {Faloutsos,Christos and Lee,Raymond and Plaisant, Catherine and Shneiderman, Ben} } @article {17704, title = {Incremental Condition Calculation and Column Selection}, volume = {UMIACS-TR-90-87}, year = {1998}, month = {1998/10/15/}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {This paper describes a method for calculating the condition number ofa matrix in the Frobenius norm that can be used to select columns in the course of computing a QR decomposition. When the number of rows of the matrix is much greater than the number of columns, the additional overhead is negligible. Limited numerical experiments suggest that the method is quite good at finding gaps in the singular values of the matrix. Additional files are available via anonymous ftp at: thales.cs.umd.edu in the directory pub/reports (Also cross-referenced as UMIACS-TR-90-87) }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/550}, author = {Stewart, G.W.} } @article {17710, title = {On an Inexpensive Triangular Approximation to the Singular Value Decomposition}, volume = {UMIACS-TR-97-75}, year = {1998}, month = {1998/10/15/}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {In this paper we introduce a new decomposition called the pivotedQLP~decomposition. It is computed by applying pivoted orthogonal triangularization to the columns of the matrix $X$ in question to get an upper triangular factor $R$ and then applying the same procedure to the rows of $R$ to get a lower triangular matrix $L$. The diagonal elements of $R$ are called the R-values of $X$; those of $L$ are called the L-values. Numerical examples show that the L-values track the singular values of $X$ with considerable fidelity\,---\,far better than the R-values. At a gap in the L-values the decomposition provides orthonormal bases of analogues of row, column, and null spaces provided of $X$. The decomposition requires no more than twice the work required for a pivoted QR~decomposition. The computation of $R$ and $L$ can be interleaved, so that the computation can be the rows of $R$ to get a lower triangular matrix $L$. The diagonal elements of $R$ are called the R-values of $X$; those of $L$ are called the L-values. Numerical examples show that the L-values track the singular values of $X$ with considerable fidelity\,---\,far better than the R-values. At a gap in the L-values the decomposition provides orthonormal bases of analogues of row, column, and null spaces provided of $X$. The decomposition requires no more than twice the work required for a pivoted QR~decomposition. The computation of $R$ and $L$ can be interleaved, so that the computation can be terminated at any suitable point, which makes the decomposition especially suitable for low-rank determination problems. The interleaved algorithm also suggests a new, efficient 2-norm estimator. (Also cross-referenced as UMIACS-TR-97-75) }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/920}, author = {Stewart, G.W.} } @conference {12781, title = {Infinite Probabilistic and Nonprobabilistic Testing*}, booktitle = {Foundations of software technology and theoretical computer science: 18th Conference, Chennai, India, December 17-19, 1998: proceedings}, year = {1998}, month = {1998///}, pages = {209 - 209}, author = {Kumar,K. N and Cleaveland, Rance and Smolka,S. A} } @article {17713, title = {On Infinitely Many Algorithms for Solving Equations}, volume = {UMIACS-TR-92-121}, year = {1998}, month = {1998/10/15/}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {Translated by G. W. StewartThis report contains a translation of {\textquoteleft}{\textquoteleft}Ueber unendlich viele Algorithmen zur Aufl\"osung der Gleichungen,{\textquoteright}{\textquoteright} a paper by E. Schr\"oder which appeared in {\it Mathematische Annalen\/} in 1870. (Also cross-referenced as UMIACS-TR-92-121) }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/577}, author = {Schroeder,E. and Stewart, G.W.} } @article {16184, title = {An information architecture to support the visualization of personal histories}, journal = {Information Processing \& Management}, volume = {34}, year = {1998}, month = {1998/09//}, pages = {581 - 597}, abstract = {This paper proposes an information architecture for personal history data and describes how the data model can be extended to a runtime model for a compact visualization using graphical timelines. Our information architecture was developed for juvenile justice and medical patient records, but is usable in other application domains such as personal resumes, financial histories, or customer support. Our model groups personal history events into aggregates that are contained in facets (e.g., doctor visits, hospitalizations, or lab tests). Crosslinks enable representation of arbitrary relationships across events and aggregates. Data attributes, such as severity, can be mapped by data administrators to visual attributes such as color and line thickness. End-users have powerful controls over the display contents, and they can modify the mapping to fit their tasks.}, keywords = {Graphical user interfaces, Information Visualization, LifeLines, medical patient record, personal histories, temporal data, timelines}, isbn = {0306-4573}, doi = {10.1016/S0306-4573(98)00024-7}, url = {http://www.sciencedirect.com/science/article/pii/S0306457398000247}, author = {Plaisant, Catherine and Shneiderman, Ben and Mushlin,Rich} } @conference {16186, title = {Information visualization advanced interface and Web design}, booktitle = {CHI 98 conference summary on Human factors in computing systems}, series = {CHI {\textquoteright}98}, year = {1998}, month = {1998///}, pages = {145 - 146}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, isbn = {1-58113-028-7}, doi = {10.1145/286498.286625}, url = {http://doi.acm.org/10.1145/286498.286625}, author = {Shneiderman, Ben and Plaisant, Catherine} } @conference {18739, title = {An intelligent environment for simulating mechanical assembly operations}, year = {1998}, month = {1998///}, pages = {13 - 16}, abstract = {Rapid technical advances in many different areas of scientificcomputing provide the enabling technologies for creating a com- prehensive simulation and visualization environment for assembly design and planning. We have built an intelligent environment in which simple simulations can be composed together to create com- plex simulations for detecting potential assembly problems. Our goal in this project is to develop high fidelity assembly simulation and visualization tools that can detect assembly related problems without going through physical mock-ups. In addition, these tools can be used to create easy-to-visualize instructions for performing assembly and service operations. }, url = {http://www.cs.cmu.edu/afs/cs.cmu.edu/Web/People/paredis/pubs/DFM98.pdf}, author = {Gupta,S.K. and Paredis,C. J. J. and Sinha,R. and Wang,C. H. and Brown,P. F.} } @article {17257, title = {Interactive Smooth Zoomming in a Starfield Information Visualization}, journal = {Technical Reports of the Computer Science Department}, year = {1998}, month = {1998/10/15/}, abstract = {This paper discusses the design and implementation of interactivesmooth zooming of a starfield display. A starfield display is a two dimensional scatterplot of a multidimensional database where every item from the database is represented as a small colored glyph whose position is determined by its ranking along ordinal attributes of the items laid out on the axes. One way of navigating this visual information is by using a zooming tool to incrementally zoom in on the items by varying the attribute range on either axis independently - such zooming causes the glyphs to move continuously and to grow or shrink. To get a feeling of flying through the data, users should be able to track the motion of each glyph without getting distracted by flicker or large jumps - conditions that necessitate high display refresh rates and closely spaced glyphs on successive frames. Although the use of high-speed hardware can achieve the required visual effect for small databases, the twin software bottlenecks of rapidly accessing display items and constructing a new display image fundamentally retard the refresh rate. Our work explores several methods to overcome these bottlenecks, presents a taxonomy of various zooming methods and introduces a new widget, the zoom bar, that facilitates zooming. (Also cross-referenced as CAR-TR-714) (Also cross-referenced as ISR-TR-94-46) }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/411}, author = {Jog,Ninad and Shneiderman, Ben} } @inbook {13815, title = {Lexical Allocation in Interlingua-Based Machine Translation of Spatial Expressions}, booktitle = {Representation and processing of spatial expressions}, year = {1998}, month = {1998///}, pages = {125 - 125}, author = {Dorr, Bonnie J and Voss,C.R. and Sencan,M.U.} } @article {17281, title = {LifeLines: using visualization to enhance navigation and analysis of patient records.}, journal = {Proceedings of the AMIA Symposium}, year = {1998}, month = {1998///}, pages = {76 - 80}, abstract = {LifeLines provide a general visualization environment for personal histories. We explore its use for clinical patient records. A Java user interface is described, which presents a one-screen overview of a computerized patient record using timelines. Problems, diagnoses, test results or medications can be represented as dots or horizontal lines. Zooming provides more details; line color and thickness illustrate relationships or significance. The visual display acts as a giant menu, giving direct access to the data.}, isbn = {1531-605X}, author = {Plaisant, Catherine and Mushlin,R. and Snyder,A. and Li,J. and Heller,D. and Shneiderman, Ben} } @article {16190, title = {LifeLines: using visualization to enhance navigation and analysis of patient records}, journal = {In Proceedings of the 1998 American Medical Informatic Association Annual Fall SymposiumProc AMIA Symp}, year = {1998}, month = {1998///}, pages = {76 - 80}, abstract = {LifeLines provide a general visualization environment for personal histories. We explore its use for clinical patient records. A Java user interface is described, which presents a one-screen overview of a computerized patient record using timelines. Problems, diagnoses, test results or medications can be represented as dots or horizontal lines. Zooming provides more details; line color and thickness illustrate relationships or significance. The visual display acts as a giant menu, giving direct access to the data.}, isbn = {1531-605X}, author = {Plaisant, Catherine and Mushlin,R. and Snyder,A. and Li,J. and Heller,D. and Shneiderman, Ben} } @inbook {17618, title = {Low-bandwidth routing and electrical power networks}, booktitle = {Automata, Languages and ProgrammingAutomata, Languages and Programming}, series = {Lecture Notes in Computer Science}, volume = {1443}, year = {1998}, month = {1998///}, pages = {604 - 615}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {Given a graph G and a (multi-)set of pairs of vertices in it, the classical NP-hard maximum edge-disjoint-paths problem (MDP) is to connect as many of the given pairs as possible using pairwise edge-disjoint paths in G . We study a relative of this problem: we have a network with fixed link capacities that may have to service large demands when necessary. In particular, individual demands are allowed to exceed capacities, and thus flows for some request pairs necessarily have to be split into different flow-paths. This is the framework for computational problems arising from: (i) electrical power networks due to the proposed deregulation of the electric utility industry in the USA, and (ii) applications such as real-time Internet services (e.g., telephone, fax, video). We show that these problems come in a few variants, some efficiently solvable and many NP -hard; we also present approximation algorithms for many of the NP -hard variants presented. Some of our approximation algorithms benefit from certain improved tail estimates that we derive; the latter also yield improved approximations for a family of packing integer programs.}, isbn = {978-3-540-64781-2}, url = {http://dx.doi.org/10.1007/BFb0055088}, author = {Cook,Doug and Faber,Vance and Marathe,Madhav and Srinivasan, Aravind and Sussmann,Yoram}, editor = {Larsen,Kim and Skyum,Sven and Winskel,Glynn} } @book {17707, title = {Matrix Algorithms: Basic decompositions}, year = {1998}, month = {1998/08/01/}, publisher = {SIAM}, organization = {SIAM}, abstract = {This thorough, concise, and superbly written volume is the first in a self-contained five-volume series devoted to matrix algorithms. It focuses on the computation of matrix decompositions - the factorization of matrices into products of similar ones. The first two chapters provide the required background from mathematics and computer science needed to work effectively in matrix computations. The remaining chapters are devoted to the computation and applications of the LU and QR decompositions. The series is aimed at the nonspecialist who needs more than black-box proficiency with matrix computations. A certain knowledge of elementary analysis and linear algebra is assumed, as well as a reasonable amount of programming experience. The guiding principle, that if something is worth explaining, it is worth explaining fully, has necessarily restricted the scope of the series, but the selection of topics should give the reader a sound basis for further study.}, keywords = {Mathematics / Algebra / General, Mathematics / Algebra / Linear, Mathematics / Applied, Mathematics / Mathematical Analysis, Mathematics / Matrices, Mathematics / Numerical Analysis, Matrices}, isbn = {9780898714142}, author = {Stewart, G.W.} } @article {15674, title = {Minimum Enclosures with Specified Angles}, volume = {CS-TR-3219}, year = {1998}, month = {1998/10/15/}, institution = {Department of Computer Science, University of Maryland, College Park}, abstract = {Given a convex polygon P, an m-envelope is a convex m-sidedpolygon that contains P. Given any convex polygon P, and any sequence of m > 3 angles A = ((11Xct2X@..ckm) we consider the problem of computing the minimum area m-envelope for P whose counte rclockwise sequence of exterior angles is given by A. We show that such envelopes can be computed in O(nm log m) time. The main result on which the correctness of the algorithm rests is a flushness condition stating that for any locally minimum enclosure with specified angles, one of its sides must be collinear with one of the sides of P. (Also cross-referenced as CAR-TR-701) }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu//handle/1903/405}, author = {Mount, Dave and Silverman,Ruth} } @conference {17627, title = {Multicommodity flow and circuit switching}, booktitle = {, Proceedings of the Thirty-First Hawaii International Conference on System Sciences, 1998}, volume = {7}, year = {1998}, month = {1998/01/06/9}, pages = {459-465 vol.7 - 459-465 vol.7}, publisher = {IEEE}, organization = {IEEE}, abstract = {Given a set of request pairs in a network, the problem of routing virtual circuits with low congestion is to connect each pair by a path so that few paths use the same link in the network. We build on an earlier multicommodity flow based approach of Leighton and Rao (1996) to show that short flow paths lead to path selections with low congestion. This shows that such good path selections exist for constant-degree expanders with strong expansion, generalizing a result of (Broder et al., 1994). We also show, for infinitely many n, n-vertex undirected graphs Gn along with a set T of connection requests, such that: T is fractionally realizable using flow-paths that impose a (fractional) congestion of at most 1; but any rounding of such a flow to the given set of flow-paths, leads to a congestion of Ω(log n/log log n). This is progress on a long-standing open problem}, keywords = {Application software, Bandwidth, circuit switching, Computer science, constant-degree expanders, graph theory, High speed integrated circuits, Integrated circuit technology, Laboratories, low congestion, MATHEMATICS, multicommodity flow, National electric code, network routing, path selections, Routing, short flow paths, Switching circuits, switching theory, undirected graphs, virtual circuit routing}, isbn = {0-8186-8255-8}, doi = {10.1109/HICSS.1998.649241}, author = {Leighton,T. and Rao,S. and Srinivasan, Aravind} } @article {15611, title = {An optimal algorithm for approximate nearest neighbor searching fixed dimensions}, journal = {Journal of the ACM (JACM)}, volume = {45}, year = {1998}, month = {1998/11//}, pages = {891 - 923}, abstract = {Consider a set of S of n data points in real d-dimensional space, Rd, where distances are measured using any Minkowski metric. In nearest neighbor searching, we preprocess S into a data structure, so that given any query point q ∈ Rd, is the closest point of S to q can be reported quickly. Given any positive real \&egr;, data point p is a (1 +\&egr;)-approximate nearest neighbor of q if its distance from q is within a factor of (1 + \&egr;) of the distance to the true nearest neighbor. We show that it is possible to preprocess a set of n points in Rd in O(dn log n) time and O(dn) space, so that given a query point q ∈ Rd, and \&egr; > 0, a (1 + \&egr;)-approximate nearest neighbor of q can be computed in O(cd, \&egr; log n) time, where cd,\&egr;<=d 1 + 6d/e;d is a factor depending only on dimension and \&egr;. In general, we show that given an integer k >= 1, (1 + \&egr;)-approximations to the k nearest neighbors of q can be computed in additional O(kd log n) time.}, keywords = {Approximation algorithms, Box-decomposition trees, closet-point queries, nearest neighbor searching, post-office problem, priority search}, isbn = {0004-5411}, doi = {10.1145/293347.293348}, url = {http://doi.acm.org/10.1145/293347.293348}, author = {Arya,Sunil and Mount, Dave and Netanyahu,Nathan S. and Silverman,Ruth and Wu,Angela Y.} } @conference {14302, title = {Partial online cycle elimination in inclusion constraint graphs}, booktitle = {ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)}, year = {1998}, month = {1998///}, author = {Aiken,A. and Fhndrich,M. and Foster, Jeffrey S. and Su,Z.} } @conference {14809, title = {Performance measurement using low perturbation and high precision hardware assists}, booktitle = {, The 19th IEEE Real-Time Systems Symposium, 1998. Proceedings}, year = {1998}, month = {1998/12/02/4}, pages = {379 - 388}, publisher = {IEEE}, organization = {IEEE}, abstract = {We present the design and implementation of MultiKron PCI, a hardware performance monitor that can be plugged into any computer with a free PCI bus slot. The monitor provides a series of high-resolution timers, and the ability to monitor the utilization of the PCI bus. We also demonstrate how the monitor can be integrated with online performance monitoring tools such as the Paradyn parallel performance measurement tools to improve the overhead of key timer operations by a factor of 25. In addition, we present a series of case studies using the MultiKron hardware performance monitor to measure and tune high-performance parallel completing applications. By using the monitor, we were able to find and correct a performance bug in a popular implementation of the MPI message passing library that caused some communication primitives to run at one half their potential speed}, keywords = {Clocks, Computerized monitoring, Counting circuits, Debugging, Hardware, hardware performance monitor, high precision hardware assists, low perturbation, measurement, MPI message passing library, MultiKron hardware performance monitor, MultiKron PCI, NIST, online performance monitoring tools, Paradyn parallel performance measurement tools, PCI bus slot, performance bug, performance evaluation, performance measurement, program debugging, program testing, real-time systems, Runtime, Timing}, isbn = {0-8186-9212-X}, doi = {10.1109/REAL.1998.739771}, author = {Mink, A. and Salamon, W. and Hollingsworth, Jeffrey K and Arunachalam, R.} } @article {17722, title = {On the Perturbation of LU, Cholesky, and QR Factorizations}, volume = {UMIACS-TR-92-24}, year = {1998}, month = {1998/10/15/}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {To appear in SIMAXIn this paper error bounds are derived for a first order expansion of the LU factorization of a perturbation of the identity. The results are applied to obtain perturbation expansions of the LU, Cholesky, and QR factorizations. (Also cross-referenced as UMIACS-TR-92-24) }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/565}, author = {Stewart, G.W.} } @article {17730, title = {Perturbation Theory for the Singular Value Decomposition}, volume = {UMIACS-TR-90-124}, year = {1998}, month = {1998/10/15/}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {The singular value decomposition has a number of applications in digitalsignal processing. However, the the decomposition must be computed from a matrix consisting of both signal and noise. It is therefore important to be able to assess the effects of the noise on the singular values and singular vectors\,---\,a problem in classical perturbation theory. In this paper we survey the perturbation theory of the singular value decomposition. (Also cross-referenced as UMIACS-TR-90-124) Appeared in SVD and Signal Processing, II, R. J. Vacarro ed., Elsevier, Amsterdam, 1991. }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/552}, author = {Stewart, G.W.} } @conference {18454, title = {Pictorial query trees for query specification in image databases}, booktitle = {Fourteenth International Conference on Pattern Recognition, 1998. Proceedings}, volume = {1}, year = {1998}, month = {1998/08//}, pages = {919-921 vol.1 - 919-921 vol.1}, publisher = {IEEE}, organization = {IEEE}, abstract = {A technique that enables specifying complex queries in image databases using pictorial query trees is presented. The leaves of a pictorial query tree correspond to individual pictorial queries that specify which objects should appear in the target images as well as how many occurrences of each object are required. In addition, the minimum required certainty of matching between query-image objects and database-image objects, as well as spatial constraints that specify bounds on the distance between objects and the relative direction between them are also specified. Internal nodes in the query tree represent logical operations (AND, OR, XOR) and their negations on the set of pictorial queries (or subtrees) represented by its children. The syntax of query trees is described. Algorithms for processing individual pictorial queries and for parsing and computing the overall result of a pictorial query tree are outlined}, keywords = {Automation, complex queries, Computer science, content-based retrieval, Database systems, database-image objects, Educational institutions, Electrical capacitance tomography, grammars, Image databases, Image matching, parsing, pictorial query trees, Postal services, query specification, query-image objects, spatial constraints, syntax, visual databases}, isbn = {0-8186-8512-3}, doi = {10.1109/ICPR.1998.711383}, author = {Soffer,A. and Samet, Hanan and Zotkin,Dmitry N} } @article {12778, title = {Probabilistic resource failure in real-time process algebra}, journal = {CONCUR{\textquoteright}98 Concurrency Theory}, year = {1998}, month = {1998///}, pages = {465 - 472}, author = {Philippou,A. and Cleaveland, Rance and Lee,I. and Smolka,S. and Sokolsky,O.} } @article {17333, title = {Providing Advisory Notices for UNIX Command Users: Design, Implementation, and Empirical Evaluations}, journal = {Technical Reports of the Computer Science Department}, year = {1998}, month = {1998/10/15/}, abstract = {UNIX Notices (UN) was developed to study the problems in providing advice tousers of complex systems. The issues studied were: what, when, and how to present the advice. The first experiment with 24 subjects examined how different presentation styles affect the effectiveness of UNs advice. The three presentation styles studied were: notice appears in separate window; notice appears only on request; notice appears in users window immediately. The results showed that the third style was significantly more effective than the first style. Furthermore, the results indicated that the most effective presentation method is also the most disruptive. The second experiment with 29 subjects studied how delay in the advice feedback affects the performance of UN. The treatments were: immediate feedback, feedback at end of session, and no feedback. Over a period of 6 weeks, the commands entered by the subjects were logged and studied. The results showed that immediate feedback caused subjects to repeat significantly fewer inefficient command sequences. However, immediate feedback and feedback at end of session may have given subjects a negative feeling towards UNIX. (Also cross-referenced as CAR-TR-651) }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/387}, author = {Kuah,Boon-Teck and Shneiderman, Ben} } @article {17731, title = {QR Sometimes Beats Jacobi}, volume = {UMIACS-TR-95-32}, year = {1998}, month = {1998/10/15/}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {This note exhibits a symmetric matrix having a small eigenvalue that iscomputed accurately by the QR algorithm but not by Jacobi{\textquoteright}s method. (Also cross-referenced as UMIACS-TR-95-32) }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/709}, author = {Stewart, G.W.} } @article {17342, title = {Reflections on authoring, editing and managing hypertex}, journal = {Technical Reports of the Computer Science Department}, year = {1998}, month = {1998/10/15/}, abstract = {This chapter offers recommendations for potential authors of hypertextdocuments based on the experience of designing a hypertext system and of creating a series of substantial hypertext databases on personal computers and larger workstations. Advice on choosing projects, identifying useful author tool features, and structuring knowledge is presented. Additional issues such as the design of the root document, article size, and conversion from existing databases are covered. While hypertext has exciting potentials, the dangers of poor design must be overcome to create attractive and effective products. (Also cross-referenced as CAR-TR-410) }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/357}, author = {Shneiderman, Ben} } @article {17343, title = {Relate{\textendash}Create{\textendash}Donate: a teaching/learning philosophy for the cyber-generation}, journal = {Computers \& Education}, volume = {31}, year = {1998}, month = {1998/08//}, pages = {25 - 39}, isbn = {0360-1315}, doi = {10.1016/S0360-1315(98)00014-1}, url = {http://www.sciencedirect.com/science/article/pii/S0360131598000141}, author = {Shneiderman, Ben} } @article {17733, title = {Rounding Errors in Solving Block Hessenberg Systems}, volume = {UMIACS-TR-94-105}, year = {1998}, month = {1998/10/15/}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {A rounding error analysis is presented for a divide-and-conquer algorithm to solve linear systems with block Hessenberg matrices. Conditions are derived under which the algorithm computes a backward stable solution. The algorithm is shown to be stable for diagonally dominant matrices and for M-matrices. (Also cross-referenced as UMIACS-TR-94-105) }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/661}, author = {Von Matt,Urs and Stewart, G.W.} } @article {12072, title = {Safety and security of programmable network infrastructures}, journal = {IEEE Communications Magazine}, volume = {36}, year = {1998}, month = {1998/10//}, pages = {84 - 92}, abstract = {Safety and security are two reliability properties of a system. A {\textquotedblleft}safe{\textquotedblright} system provides protection against errors of trusted users, while a {\textquotedblleft}secure{\textquotedblright} system protects against errors introduced by untrusted users. There is considerable overlap between mechanisms to support each property. Requirements for rapid service creation have stimulated the development of programmable network infrastructures, where end users or service providers can customize the properties of a network infrastructure while it continues to operate. A central concern of potential users of such systems is their reliability and, most specifically, their safety and security. In this article we explain the impact the network service model and architecture have on safety and security, and provide a model with which policies can be translated into restrictions of a general system. We illustrate these ideas with the Secure Active Network Environment (SANE) architecture, which provides a means of controlling access to the functions provided by any programmable infrastructure}, keywords = {Access control, error protection, IP networks, Multicast protocols, network architecture, network operating systems, network service model, operating system, Power system dynamics, Power system modeling, Power system reliability, programmable languages, programmable network infrastructures, programming languages, Proposals, Protection, reliability properties, Safety, Secure Active Network Environment, Security, security of data, service creation, service providers, Switches, telecommunication computing, telecommunication network reliability, Web and internet services}, isbn = {0163-6804}, doi = {10.1109/35.722141}, author = {Alexander,S. and Arbaugh, William A. and Keromytis,A. D and Smith,J. M} } @article {17951, title = {Salient Frame Detection for Molecular Dynamics Simulations}, journal = {Scientific Visualization: Interactions, Features, Metaphors}, volume = {2}, year = {1998}, month = {1998///}, pages = {160 - 175}, abstract = {Saliency-based analysis can be applied to time-varying 3D datasetsfor the purpose of summarization, abstraction, and motion analysis. As the sizes of time-varying datasets continue to grow, it becomes more and more difficult to comprehend vast amounts of data and information in a short period of time. Au- tomatically generated thumbnail images and previewing of time-varying datasets can help viewers explore and understand the datasets significantly faster as well as provide new insights. In this paper, we introduce a novel method for detect- ing salient frames for molecular dynamics simulations. Our method effectively detects crucial transitions in simulated mechanosensitive ion channel (MscS), in agreement with experimental data. }, author = {Kim,Y. and Patro,R. and Ip,C. Y and O{\textquoteright}Leary,D. P and Anishkin,A. and Sukharev,S. and Varshney, Amitabh} } @article {12101, title = {A secure active network environment architecture: realization in SwitchWare}, journal = {IEEE Network}, volume = {12}, year = {1998}, month = {1998/06//May}, pages = {37 - 45}, abstract = {An active network is a network infrastructure which is programmable on a per-user or even per-packet basis. Increasing the flexibility of such network infrastructures invites new security risks. Coping with these security risks represents the most fundamental contribution of active network research. The security concerns can be divided into those which affect the network as a whole and those which affect individual elements. It is clear that the element problems must be solved first, since the integrity of network-level solutions will be based on trust in the network elements. In this article we describe the architecture and implementation of a secure active network environment (SANE), which we believe provides a basis for implementing secure network-level solutions. We guarantee that a node begins operation in a trusted state with the AEGIS secure bootstrap architecture. We guarantee that the system remains in a trusted state by applying dynamic integrity checks in the network element{\textquoteright}s runtime system, using a novel naming system, and applying node-to-node authentication when needed. The construction of an extended LAN is discussed}, keywords = {access protocols, AEGIS secure bootstrap architecture, architecture, Authentication, Collaboration, Communication switching, dynamic integrity checks, extended LAN, Functional programming, implementation, integrity, Intelligent networks, IP networks, Local area networks, network infrastructure, network infrastructures, network operating systems, network-level solutions, node, node-to-node authentication, packet switching, Proposals, ramming system, SANE, secure active network environment architecture, security of data, Switches, SwitchWare, trusted state, Web and internet services}, isbn = {0890-8044}, doi = {10.1109/65.690960}, author = {Alexander,D. S and Arbaugh, William A. and Keromytis,A. D and Smith,J. M} } @article {12103, title = {Security for virtual private intranets}, journal = {Computer}, volume = {31}, year = {1998}, month = {1998/09//}, pages = {48 - 55}, abstract = {As telecommuting grows, businesses must consider security when extending their network environment to employees{\textquoteright} homes. Researchers at the University of Pennsylvania have addressed the problem with smart cards, operating system modifications, and network authentication. We note the distinction between trust and integrity: trust is determined through the verification of components and the dependencies among them, while integrity demonstrates that components haven{\textquoteright}t been modified. Thus integrity checking in a trustworthy system is about preserving an established trust or trust relationship. Our solution to the challenge of isolating functional roles that may share a single hardware platform is called secure identity based lending (SIBL). SIBL provides multiple personalities by partitioning the hard drive into n+1 partitions, where n is the number of supported personalities. All personalities use the system partition for core operating system components and shared applications. Each of the personalities is also associated with one of the remaining partitions, which are encrypted using a symmetric algorithm}, keywords = {businesses, Clouds, Companies, core operating system components, cryptography, Data security, employee homes, encryption, functional roles, hard drive, Home computing, home working, integrity checking, Internet, Local area networks, multiple personalities, network authentication, network environment, operating system modifications, Operating systems, Roads, secure identity based lending, security management, security of data, shared applications, SIBL, single hardware platform, smart cards, symmetric algorithm, system partition, telecommuting, Teleworking, trust relationship, trustworthy system, virtual private intranets}, isbn = {0018-9162}, doi = {10.1109/2.708450}, author = {Arbaugh, William A. and Davin,J. R and Farber,D. J and Smith,J. M} } @article {17375, title = {Sorting out searching: a user-interface framework for text searches}, journal = {Communications of the ACM}, volume = {41}, year = {1998}, month = {1998/04//}, pages = {95 - 98}, isbn = {0001-0782}, doi = {10.1145/273035.273069}, url = {http://doi.acm.org/10.1145/273035.273069}, author = {Shneiderman, Ben and Byrd,Donald and Croft,W. Bruce} } @article {17734, title = {SRRIT--A FORTRAN Subroutine to Calculate the Dominant Invariant Subspace of a Nonsymmetric Matrix}, volume = {UMIACS-TR-92-61}, year = {1998}, month = {1998/10/15/}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {SRRIT is a FORTRAN program to calculate an approximateorthonormal basis for a dominant invariant subspace of a real matrix $A$ by the method of simultaneous iteration \cite{stewart76a}. Specifically, given an integer $m$, {\sl SRRIT} attempts to compute a matrix $Q$ with $m$ orthonormal columns and real quasi-triangular matrix $T$ of order $m$ such that the equation \[ AQ = QT \] is satisfied up to a tolerance specified by the user. The eigenvalues of $T$ are approximations to the $m$ largest eigenvalues of $A$, and the columns of $Q$ span the invariant subspace corresponding to those eigenvalues. {\sl SRRIT} references $A$ only through a user provided subroutine to form the product $AQ$; hence it is suitable for large sparse problems. (Also cross-referenced as UMIACS-TR-92-61) }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/572}, author = {Bai,Z. and Stewart, G.W.} } @article {17716, title = {On Sublinear Convergence}, volume = {UMIACS-TR-95-92}, year = {1998}, month = {1998/10/15/}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {This note develops a theory of sublinearly convergingsequences, including a categorization of the rates of convergence and a method for determining the rate from an iteration function. (Also cross-referenced as UMIACS-TR-95-92) }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/760}, author = {Stewart, G.W.} } @article {12079, title = {The SwitchWare active network architecture}, journal = {IEEE Network}, volume = {12}, year = {1998}, month = {1998/06//May}, pages = {29 - 36}, abstract = {Active networks must balance the flexibility of a programmable network infrastructure against the safety and security requirements inherent in sharing that infrastructure. Furthermore, this balance must be achieved while maintaining the usability of the network. The SwitchWare active network architecture is a novel approach to achieving this balance using three layers: active packets, which contain mobile programs that replace traditional packets; active extensions, which provide services on the network elements and can be dynamically loaded; and a secure active router infrastructure, which forms a high-integrity base on which the security of the other layers depends. In addition to integrity checking and cryptography-based authentication, security in our architecture depends heavily on verification techniques from programming languages, such as strong type checking}, keywords = {active extensions, active packets, Authentication, Computer languages, Computer networks, cryptography, cryptography-based authentication, high-integrity base, integrity checking, IP networks, LAN interconnection, mobile programs, network operating systems, packet switching, programmable network infrastructure, programming languages, Protocols, Safety, safety requirements, scalability, secure active router infrastructure, Security, security requirements, services, strong type checking, Switches, SwitchWare active network architecture, telecommunication network routing, Tin, usability, verification techniques}, isbn = {0890-8044}, doi = {10.1109/65.690959}, author = {Alexander,D. S and Arbaugh, William A. and Hicks, Michael W. and Kakkar,P. and Keromytis,A. D and Moore,J. T and Gunter,C. A and Nettles,S. M and Smith,J. M} } @article {14745, title = {The switchware active network implementation}, journal = {The ML Workshop, International Conference on Functional Programming (ICFP)}, year = {1998}, month = {1998///}, author = {Alexander,D. S and Hicks, Michael W. and Kakkar,P. and Keromytis,A. D and Shaw,M. and Moore,J. T and Gunter,C. A and Jim,T. and Nettles,S. M and Smith,J. M} } @article {17833, title = {T2}, journal = {ACM SIGMOD Record}, volume = {27}, year = {1998}, month = {1998/03/01/}, pages = {58 - 66}, isbn = {01635808}, doi = {10.1145/273244.273264}, url = {http://dl.acm.org/citation.cfm?id=273264}, author = {Chang,Chialin and Acharya,Anurag and Sussman, Alan and Saltz,Joel} } @conference {15680, title = {Threshold-based admission control for multi-class video-on-demand systems}, booktitle = {Performance, Computing and Communications, 1998. IPCCC {\textquoteright}98., IEEE International}, year = {1998}, month = {1998/02/16/18}, pages = {154 - 160}, publisher = {IEEE}, organization = {IEEE}, abstract = {The next generation of distributed digital video-on-demand (VoD) systems will use admission control tests to ensure that users receive predictable and guaranteed service. If the system cannot support a new request then that request is blocked This paper presents an analytical model to evaluate unified admission control strategies for distributed VoD systems with multiple video classes. We prove that there exists a computationally efficient technique to determine the blocking probabilities for newly arriving requests. Through numerical analysis we show the effect of different admission control policies on overall system blocking rates}, keywords = {Admission control, admission control tests, analytical model, Analytical models, blocking probabilities, buffer storage, Computer architecture, distributed digital VoD systems, File servers, guaranteed service, High-speed networks, interactive video, Motion pictures, multi-class video-on-demand systems, multimedia systems, Network servers, newly arriving requests, numerical analysis, Predictive models, probability, recursive algorithm, system blocking rates, telecommunication congestion control, threshold-based admission control, unified admission control}, isbn = {0-7803-4468-5}, doi = {10.1109/PCCC.1998.659937}, author = {Mundur, Padma and Sood,A. and Simon,R.} } @article {17741, title = {Time-Domain Extraction of Broad-Band Sources by Tikhonov-Phillips Regularization of Triangular Toeplitz Kernels*}, volume = {UMIACS-TR-95-87}, year = {1998}, month = {1998/10/15/}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {Single receiver source deconvolution in a shallow waterenvironment is an ill-posed problem whose difficulty is compounded by the multipath nature of the propagation operator. If only sources that are quiescent prior to some initial time to are considered, the result of discretizatizing the problem in the time domain is an ill-conditioned triangular Toeplitz system. In this paper we show how an algorithm of Elden can be used to implement Tikhonov-Phillips regularization for this system. Unlike the multichannel deconvolution techniques used in underwater acoustics, this method can extract source signatures using the outputs of a single sensor. In addition, when the propagation is multipath and source signature extraction is performed as part of an optimization procedure for environmental inversion, we can work with shorter time windows so that the process becomes computationally more efficient than frequency domain deconvolution. A number of examples of the use of the Tikhonov-Philips regularization method for source series extraction are provided. (Also cross-referenced as UMIACS-TR-95-87) }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/755}, author = {Roginsky,Jacob and Stewart, G.W.} } @article {17441, title = {Treemaps for space-constrained visualization of hierarchies}, journal = {ACM Transactions on Graphics (TOG) Volume}, volume = {11}, year = {1998}, month = {1998///}, pages = {92 - 99}, author = {Shneiderman, Ben} } @book {13028, title = {Trends in the Early Careers of Life Scientists}, year = {1998}, month = {1998///}, publisher = {National Academy Press}, organization = {National Academy Press}, address = {Washington, DC}, author = {Tilghman,S and Astin,HS and Brinkley,W and Chilton,MD and Cummings, Michael P. and Ehrenberg,RG and Fox,MF and Glenn,K and Green,PJ and Hans,S and Kelman,A and LaPidus,J and Levin,B and McIntosh,JR and Riecken,H and Stephen,PE} } @article {13029, title = {Trends in the early careers of life scientists - Preface and executive summary}, journal = {Mol Biol Cell}, volume = {9}, year = {1998}, month = {1998/11//}, pages = {3007 - 3015}, author = {Tilghman,S and Astin,HS and Brinkley,W and Chilton,MD and Cummings, Michael P. and Ehrenberg,RG and Fox,MF and Glenn,K and Green,PJ and Hans,S and Kelman,A and LaPidus,J and Levin,B and McIntosh,JR and Riecken,H and Stephen,PE} } @article {17739, title = {The Triangular Matrices of Gaussian Elimination and Related Decompositions}, volume = {UMIACS-TR-95-91}, year = {1998}, month = {1998/10/15/}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {It has become a commonplace that triangular systems are solved tohigher accuracy than their condition would warrant. This observation is not true in general, and counterexamples are easy to construct. However, it is often true of the triangular matrices from pivoted LU or QR decompositions. It is shown that this fact is closely connected with the rank-revealing character of these decompositions. (Also cross-referenced as UMIACS-TR-95-91) }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/759}, author = {Stewart, G.W.} } @article {17742, title = {Two Algorithms for the The Efficient Computation of Truncated Pivoted QR Approximations to a Sparse Matrix}, volume = {UMIACS-TR-98-12}, year = {1998}, month = {1998/10/15/}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {In this note we propose two algorithms to compute truncated pivoted QRapproximations to a sparse matrix. One is based on the Gram--Schmidt algorithm, and the other on Householder triangularization. Both algorithms leave the original matrix unchanged, and the only additional storage requirements are arrays to contain the factorization itself. Thus, the algorithms are particularly suited to determining low-rank approximations to a sparse matrix. (Also cross-referenced as UMIACS-TR-98-12) }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/941}, author = {Stewart, G.W.} } @article {17743, title = {Two Simple Residual Bounds for the Eigenvalues of Hermitian Matrices}, volume = {UMIACS-TR-89-123}, year = {1998}, month = {1998/10/15/}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {Let $A$ be Hermitian and let the orthonormal columns of $X$ span anapproximate invariant subspace of $X$. Then the residual $R = AX-XM$ $(M=X\ctp AX)$ will be small. The theorems of this paper bound the distance of the spectrum of $M$ from the spectrum of $A$ in terms of appropriate norms of $R$. Appeared in SIAM J. Mat. Anal. Appl. 12 (1991) 205--208. (Also cross-referenced as UMIACS-TR-89-123) }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/545}, author = {Stewart, G.W.} } @article {16175, title = {Understanding Transportation Management Systems Performance with a Simulation-Based Learning Environment}, journal = {Technical Reports of the Computer Science Department}, year = {1998}, month = {1998/12/05/}, abstract = {We have developed a simulation-based learning environment to provide systemdesigners and operators with an appreciation of the impact of incidents on traffic delay. We used an application framework developed at the University of Maryland for constructing simulation-based learning environments called SimPLE (Simulated Processes in a Learning Environment). Environments developed with SimPLE use dynamic simulations and visualizations to represent realistic time-dependent behavior and are coupled with guidance material and other software aids that facilitate learning. The simulation allows learners to close freeway lanes and divert traffic to an arterial road. Users can see the effect of the detour on freeway and arterial delay. Users can then adjust signal timing interactively on a time space diagram and watch the effect of their adjustment on green band changes and on arterial delays and total delays. }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/500}, author = {Plaisant, Catherine and Tarnoff,Phil and Saraf,Aditya and Rose,Anne} } @article {16177, title = {User Interface Reengineering: A Diagnostic Approach}, journal = {Technical Reports of the Computer Science Department}, year = {1998}, month = {1998/10/15/}, abstract = {User interface technology has advanced rapidly in recent years.Incorporating new developments in existing systems could result in substantial improvements in usability, thereby improving performance and user satisfaction, while shortening training an d reducing error rates. Our focus is on low-effort high-payoff improvements to aspects such as data display and entry, consistency, messages, documentation, and system access. This paper provides guidelines for managers and designers responsible for use r interface reengineering, based on the experience we gained from six projects, and compiles our observations, recommendations and outcomes. (Also cross-referenced as CAR-TR-767) }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/430}, author = {Vanniamparampil,Ajit J and Shneiderman, Ben and Plaisant, Catherine and Rose,Anne} } @conference {17477, title = {Using elastic windows for World-Wide Web Browsing}, booktitle = {CHI 98 conference summary on Human factors in computing systems}, series = {CHI {\textquoteright}98}, year = {1998}, month = {1998///}, pages = {189 - 190}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, keywords = {elastic windows, User interfaces, window management, World-wide web}, isbn = {1-58113-028-7}, doi = {10.1145/286498.286666}, url = {http://doi.acm.org/10.1145/286498.286666}, author = {Kandogan,Eser and Shneiderman, Ben} } @conference {14468, title = {Utility elicitation as a classification problem}, booktitle = {Proceedings of the Fourteenth conference on Uncertainty in artificial intelligence}, series = {UAI{\textquoteright}98}, year = {1998}, month = {1998///}, pages = {79 - 88}, publisher = {Morgan Kaufmann Publishers Inc.}, organization = {Morgan Kaufmann Publishers Inc.}, address = {San Francisco, CA, USA}, abstract = {We investigate the application of classification techniques to utility elicitation. In a decision problem, two sets of parameters must generally be elicited: the probabilities and the utilities. While the prior and conditional probabilities in the model do not change from user to user, the utility models do. Thus it is necessary to elicit a utility model separately for each new user. Elicitation is long and tedious, particularly if the outcome space is large and not decomposable. There are two common approaches to utility function elicitation. The first is to base the determination of the user{\textquoteright}s utility function solely on elicitation of qualitative preferences. The second makes assumptions about the form and decomposability of the utility function. Here we take a different approach: we attempt to identify the new user{\textquoteright}s utility function based on classification relative to a database of previously collected utility functions. We do this by identifying clusters of utility functions that minimize an appropriate distance measure. Having identified the clusters, we develop a classification scheme that requires many fewer and simpler assessments than full utility elicitation and is more robust than utility elicitation based solely on preferences. We have tested our algorithm on a small database of utility functions in a prenatal diagnosis domain and the results are quite promising.}, isbn = {1-55860-555-X}, url = {http://dl.acm.org/citation.cfm?id=2074094.2074104}, author = {Chajewska,Urszula and Getoor, Lise and Norman,Joseph and Shahar,Yuval} } @article {17495, title = {Visual User Interfaces for Information Exploration}, journal = {Technical Reports of the Computer Science Department}, year = {1998}, month = {1998/10/15/}, abstract = {The next generation of database management, directory browsing,information retrieval, hypermedia, scientific data management, and library systems can enable convenient exploration of growing information spaces by a wider range of users. User interface designers can provide more powerful search techniques, more comprehensible query facilities, better presentation methods, and smoother integration of technology with task. This paper offers novel graphical and direct manipulation approaches to query formulation and information presentation/manipulation. These approaches include a graphical approach to restricted boolean query formulation based on generalization/aggregation hierarchies, a filter/flow metaphor for complete boolean expressions, dynamic query methods with continuous visual presentation of results as the query is changed (possibly employing parallel computation), and color-coded 2-dimensional space-filling tree-maps that present multiple-level hierarchies in a single display (hundreds of directories and more than a thousand files can be seen at once). (Also cross-referenced as CAR-TR-577) }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/373}, author = {Shneiderman, Ben} } @conference {16189, title = {Visualizing medical records with LifeLines}, booktitle = {CHI 98 conference summary on Human factors in computing systems}, series = {CHI {\textquoteright}98}, year = {1998}, month = {1998///}, pages = {28 - 29}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, keywords = {healthcare, History, medical record, overview, timeline, Visualization}, isbn = {1-58113-028-7}, doi = {10.1145/286498.286513}, url = {http://doi.acm.org/10.1145/286498.286513}, author = {Plaisant, Catherine and Heller,Daniel and Li,Jia and Shneiderman, Ben and Mushlin,Rich and Karat,John} } @article {17502, title = {Visualizing Personal Histories: A Workshop, July 21-22, 1997}, journal = {ACM SIGCHI Bulletin}, volume = {30}, year = {1998}, month = {1998/01//}, pages = {34 - 35}, isbn = {0736-6906}, doi = {10.1145/280571.280585}, url = {http://doi.acm.org/10.1145/280571.280585}, author = {Shneiderman, Ben} } @conference {17269, title = {Is the Web really different from everything else?}, booktitle = {CHI 98 conference summary on Human factors in computing systems}, series = {CHI {\textquoteright}98}, year = {1998}, month = {1998///}, pages = {92 - 93}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, keywords = {design, user experience, World Wide Web}, isbn = {1-58113-028-7}, doi = {10.1145/286498.286545}, url = {http://doi.acm.org/10.1145/286498.286545}, author = {Shneiderman, Ben and Nielsen,Jakob and Butler,Scott and Levi,Michael and Conrad,Frederick} } @conference {13921, title = {When Two Hands Are Better Than One: Enhancing Collaboration Using Single Display Groupware. CHI{\textquoteright}98}, booktitle = {Extended Abstracts}, year = {1998}, month = {1998///}, pages = {287 - 288}, author = {Stewart,J. and Raybourn,E. and Bederson, Benjamin B. and Druin, Allison} } @article {17679, title = {Accuracy and Stability of Numerical Algorithms}, journal = {SIAM Review}, volume = {39}, year = {1997}, month = {1997///}, pages = {164 - 165}, author = {Higham,N. J and Stewart, G.W.} } @conference {13492, title = {ADistributed Management System for Testing Document Image Database Analysis Algorithms}, booktitle = {ICDAR}, year = {1997}, month = {1997///}, pages = {989 - 995}, author = {David Doermann and Sauvola,J. and Haapakoski,S. and Kauniskangas,H. and Seppanen,T. and Pietikainen,M.} } @article {17682, title = {Algorithm 776: SRRIT: a Fortran subroutine to calculate the dominant invariant subspace of a nonsymmetric matrix}, journal = {ACM Trans. Math. Softw.}, volume = {23}, year = {1997}, month = {1997/12//}, pages = {494 - 513}, abstract = {SRRT is a Fortran program to calculate an approximate orthonomral basis fr a dominant invariant subspace of a real matrix A by the method of simultaneous iteration. Specifically, given an integer m, SRRIT computes a matrix Q with m orthonormal columns and real quasi-triangular matrix T or order m such that the equation AQ = QT is satisfied up to a tolerance specified by the user. The eigenvalues of T are approximations to the m eigenvalues of largest absolute magnitude of A and the columns of Q span the invariant subspace corresponding to those eigenvalues. SRRIT references A only through a user-provided subroutine to form the product AQ; hence it is suitable for large sparse problems.}, keywords = {invariant subspace, nonsymmetric eigenvalue problem, project method}, isbn = {0098-3500}, doi = {10.1145/279232.279234}, url = {http://doi.acm.org/10.1145/279232.279234}, author = {Bai,Z. and Stewart, G.W.} } @conference {17554, title = {Approximating hyper-rectangles: learning and pseudo-random sets}, booktitle = {Proceedings of the twenty-ninth annual ACM symposium on Theory of computing}, series = {STOC {\textquoteright}97}, year = {1997}, month = {1997///}, pages = {314 - 323}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, keywords = {approximations of distributions, derandomization, explicit constructions, machine learning, multiple-instance learning, PAC learning, pseudorandomness, Ramsey graphs, random graphs, rectangles, sample complexity}, isbn = {0-89791-888-6}, doi = {10.1145/258533.258611}, url = {http://doi.acm.org/10.1145/258533.258611}, author = {Auer,Peter and Long,Philip M. and Srinivasan, Aravind} } @conference {17567, title = {Better approximation guarantees for job-shop scheduling}, booktitle = {Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms}, series = {SODA {\textquoteright}97}, year = {1997}, month = {1997///}, pages = {599 - 608}, publisher = {Society for Industrial and Applied Mathematics}, organization = {Society for Industrial and Applied Mathematics}, address = {Philadelphia, PA, USA}, isbn = {0-89871-390-0}, url = {http://dl.acm.org/citation.cfm?id=314161.314395}, author = {Goldberg,Leslie Ann and Paterson,Mike and Srinivasan, Aravind and Sweedyk,Elizabeth} } @article {16986, title = {Between hope and fear}, journal = {Communications of the ACM}, volume = {40}, year = {1997}, month = {1997/02//}, pages = {59 - 62}, isbn = {0001-0782}, doi = {10.1145/253671.253706}, url = {http://doi.acm.org/10.1145/253671.253706}, author = {Shneiderman, Ben} } @article {16992, title = {Book Preview-Designing the User Interface: Strategies for Effective Human-Computer Interaction}, journal = {Interactions-New York}, volume = {4}, year = {1997}, month = {1997///}, pages = {61 - 61}, author = {Shneiderman, Ben} } @article {16194, title = {Browsing hierarchical data with multi-level dynamic queries and pruning}, journal = {International Journal of Human-Computer Studies}, volume = {46}, year = {1997}, month = {1997/01//}, pages = {103 - 124}, abstract = {Users often must browse hierarchies with thousands of nodes in search of those that best match their information needs. ThePDQ Tree-browser(Pruning with Dynamic Queries) visualization tool was specified, designed and developed for this purpose. This tool presents trees in two tightly-coupled views, one a detailed view and the other an overview. Users can use dynamic queries, a method for rapidly filtering data, to filter nodes at each level of the tree. The dynamic query panels are user-customizable. Sub-trees of unselected nodes are pruned out, leading to compact views of relevant nodes. Usability testing of the PDQ Tree-browser, done with eight subjects, helped assess strengths and identify possible improvements. The PDQ Tree-browser was used in Network Management (600 nodes) and UniversityFinder (1100 nodes) applications. A controlled experiment, with 24 subjects, showed that pruning significantly improved performance speed and subjective user satisfaction. Future research directions are suggested.}, isbn = {1071-5819}, doi = {10.1006/ijhc.1996.0085}, url = {http://www.sciencedirect.com/science/article/pii/S1071581996900853}, author = {Kumar,Harsha P. and Plaisant, Catherine and Shneiderman, Ben} } @article {17012, title = {Clarifying search: A user-interface framework for text searches}, journal = {D-lib magazine}, volume = {3}, year = {1997}, month = {1997///}, pages = {18 - 20}, abstract = {Current user interfaces for textual database searching leave much to be desired: individually, they are often confusing, and as a group, they are seriously inconsistent. We propose a four- phase framework for user-interface design: the framework provides common structure and terminology for searching while preserving the distinct features of individual collections and search mechanisms. Users will benefit from faster learning, increased comprehension, and better control, leading to more effective searches and higher satisfaction.}, author = {Shneiderman, Ben and Byrd,D. and Croft, W.B.} } @inbook {17027, title = {Comprehension and object recognition capabilities for presentations of simultaneous video key frame surrogates}, booktitle = {Research and Advanced Technology for Digital LibrariesResearch and Advanced Technology for Digital Libraries}, series = {Lecture Notes in Computer Science}, volume = {1324}, year = {1997}, month = {1997///}, pages = {41 - 54}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {The demand for more efficient browsing of video data is expected to increase as greater access to this type of data becomes available. This experiment looked at one technique for displaying video data using key frame surrogates that are presented as a ldquoslide showrdquo. Subjects viewed key frames for between one and four video clips simultaneously. Following this presentation, the subjects performed object recognition and gist comprehension tasks in order to determine human thresholds for divided attention between these multiple displays. It was our belief that subject performance would degrade as the number of slide shows shown simultaneously increased. For object recognition and gist comprehension tasks, a decrease in performance between the one slide show display and the two, three or four slide show displays was found. In the case of two or three video presentations, performance is about the same, and there remains adequate object recognition abilities and comprehension of the video clips. Performance drops off to unacceptable levels when four slide shows are displayed at once.}, isbn = {978-3-540-63554-3}, url = {http://dx.doi.org/10.1007/BFb0026720}, author = {Slaughters,Laura and Shneiderman, Ben and Marchionini,Gary}, editor = {Peters,Carol and Thanos,Costantino} } @conference {17545, title = {A constant-factor approximation algorithm for packet routing, and balancing local vs. global criteria}, booktitle = {Proceedings of the twenty-ninth annual ACM symposium on Theory of computing}, series = {STOC {\textquoteright}97}, year = {1997}, month = {1997///}, pages = {636 - 643}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, keywords = {Approximation algorithms, covering integer programs, discrete ham-sandwich theorems, Linear programming, packet routing, randomized algorithms, Randomized rounding, rounding theorems}, isbn = {0-89791-888-6}, doi = {10.1145/258533.258658}, url = {http://doi.acm.org/10.1145/258533.258658}, author = {Srinivasan, Aravind and Teo,Chung-Piaw} } @conference {13529, title = {Content-based Image Retrieval Using Composite Features}, booktitle = {Proceedings of the 1997 Scandinavian Conference on Image Analysis}, year = {1997}, month = {1997///}, pages = {35 - 42}, abstract = {In this paper, we demonstrate methods for content-based image retrieval problems utilizing a specially designed retrieval architecture implemented within the {\textquoteright}Intelligent Image Retrieval{\textquoteright} system (IIR). The method consists of new image features in the retrieval context, including segmentation methods and use of image frames. They are combined in a unique way with color, texture, shape and localization information with a special data ion construction in a graphical user interface. The IIR system provides an efficient retrieval architecture utilizing a tailored query language, retrieval mechanisms and an object-oriented database enabling the use of complex data structures and relations needed for successful query processing. Functionality and performance of methods and architecture are illustrated with a series of tests using a database that consists of several hundred {\textquoteright}scene{\textquoteright} images.}, author = {Kauniskangas,H. and Sauvola,J. and Pietikainen,M. and David Doermann} } @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 {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 {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 {17901, title = {Efficient triangle strips for fast rendering}, journal = {ACM Transactions on Graphics}, year = {1997}, month = {1997///}, author = {Evans,F. and Skiena,S. and Varshney, Amitabh} } @conference {17124, title = {Elastic Windows: a hierarchical multi-window World-Wide Web browser}, booktitle = {Proceedings of the 10th annual ACM symposium on User interface software and technology}, year = {1997}, month = {1997///}, pages = {169 - 177}, author = {Kandogan,E. and Shneiderman, Ben} } @conference {17126, title = {Elastic Windows: evaluation of multi-window operations}, booktitle = {Proceedings of the SIGCHI conference on Human factors in computing systems}, year = {1997}, month = {1997///}, pages = {250 - 257}, author = {Kandogan,E. and Shneiderman, Ben} } @article {17934, title = {Enabling virtual reality for large-scale mechanical CAD datasets}, journal = {Proceedings of ASME Design Engineering Technical Conferences, Sept}, volume = {14}, year = {1997}, month = {1997///}, pages = {17 - 17}, abstract = {Reconciling scene realism with interactivity has emerged asone of the most important areas in making virtual reality fea- sible for large-scale mechanical CAD datasets consisting of sev- eral millions of primitives. This paper surveys our research and related work for achieving interactivity without sacrificing real- ism in virtual reality walkthroughs and flythroughs of polygonal CAD datasets. We outline our recent work on efficient genera- tion of triangle strips from polygonal models that takes advan- tage of compression of connectivity information. This results in substantial savings in rendering, transmission, and storage. We outline our work on genus-reducing simplifications as well as real-time view-dependent simplifications that allow on-the-fly selection amongst multiple levels of detail, based upon lighting and viewing parameters. Our method allows multiple levels of detail to coexist on the same object at different regions and to merge seamlessly without any cracks or shading artifacts. We also present an overview of our work on hardware-assisted image- based rendering that allows interactive exploration of computer- generated scenes. }, author = {Varshney, Amitabh and El-Sana,J. and Evans,F. and Darsa,L. and Costa,B. and Skiena,S.} } @article {16297, title = {An experiment to assess the cost-benefits of code inspections in large scale software development}, journal = {IEEE Transactions on Software Engineering}, volume = {23}, year = {1997}, month = {1997/06//}, pages = {329 - 346}, abstract = {We conducted a long term experiment to compare the costs and benefits of several different software inspection methods. These methods were applied by professional developers to a commercial software product they were creating. Because the laboratory for this experiment was a live development effort, we took special care to minimize cost and risk to the project, while maximizing our ability to gather useful data. The article has several goals: (1) to describe the experiment{\textquoteright}s design and show how we used simulation techniques to optimize it; (2) to present our results and discuss their implications for both software practitioners and researchers; and (3) to discuss several new questions raised by our findings. For each inspection, we randomly assigned three independent variables: (1) the number of reviewers on each inspection team (1, 2, or 4); (2) the number of teams inspecting the code unit (1 or 2); and (3) the requirement that defects be repaired between the first and second team{\textquoteright}s inspections. The reviewers for each inspection were randomly selected without replacement from a pool of 11 experienced software developers. The dependent variables for each inspection included inspection interval (elapsed time), total effort, and the defect detection rate. Our results showed that these treatments did not significantly influence the defect detection effectiveness, but that certain combinations of changes dramatically increased the inspection interval}, keywords = {Analysis of variance, code inspection cost benefits, code unit, commercial software product, Computer Society, cost-benefit analysis, Costs, defect detection effectiveness, defect detection rate, Design optimization, experienced software developers, experiment design, independent variables, Inspection, inspection interval, inspection team, Laboratories, large scale software development, Large-scale systems, live development effort, long term experiment, professional aspects, professional developers, Programming, reviewers, simulation techniques, software cost estimation, software inspection methods, software practitioners, Software quality, Switches}, isbn = {0098-5589}, doi = {10.1109/32.601071}, author = {Porter, Adam and Siy,H. P and Toman,C. A and Votta,L. G.} } @article {16925, title = {A framework for search interfaces}, journal = {IEEE Software}, volume = {14}, year = {1997}, month = {1997/04//Mar}, pages = {18 - 20}, abstract = {Searching textual databases can be confusing for users. Popular search systems for the World Wide Web and stand alone systems typically provide a simple interface: users type in keywords and receive a relevance ranked list of 10 results. This is appealing in its simplicity, but users are often frustrated because search results are confusing or aspects of the search are out of their control. If we are to improve user performance, reduce mistaken assumptions, and increase successful searches, we need more predictable design. To coordinate design practice, we suggest a four-phase framework that would satisfy first time, intermittent, and frequent users accessing a variety of textual and multimedia libraries}, keywords = {Abstracts, Cities and towns, Databases, Delay, design practice, four-phase framework, frequent users, Information retrieval, Information services, Libraries, multimedia libraries, online front-ends, popular search systems, predictable design, Protection, relevance ranked list, search interfaces, search results, stand alone systems, textual database searching, Thesauri, User interfaces, user performance, word processing, World Wide Web}, isbn = {0740-7459}, doi = {10.1109/52.582969}, author = {Shneiderman, Ben} } @inbook {14265, title = {The geometry of visual space distortion}, booktitle = {Algebraic Frames for the Perception-Action CycleAlgebraic Frames for the Perception-Action Cycle}, series = {Lecture Notes in Computer Science}, volume = {1315}, year = {1997}, month = {1997///}, pages = {249 - 277}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {The encounter of perception and action happens at the intermediate representations of space-time. In many of the computational models employed in the past, it has been assumed that a metric representation of physical space can be derived by visual means. Psychophysical experiments, as well as computational considerations, can convince us that the perception of space and shape has a much more complicated nature, and that only a distorted version of actual, physical space can be computed. This paper develops a computational geometric model that explains why such distortion might take place. The basic idea is that, both in stereo and motion, we perceive the world from multiple views. Given the rigid transformation between the views and the properties of the image correspondence, the depth of the scene can be obtained. Even a slight error in the rigid transformation parameters causes distortion of the computed depth of the scene. The unified framework introduced here describes this distortion in computational terms. We characterize the space of distortions by its level sets, that is, we characterize the systematic distortion via a family of iso-distortion surfaces which describes the locus over which depths are distorted by some multiplicative factor. Clearly, functions of the distorted space exhibiting some sort of invariance, produce desirable representations for biological and artificial systems [13]. Given that humans{\textquoteright} estimation of egomotion or estimation of the extrinsic parameters of the stereo apparatus is likely to be imprecise, the framework is used to explain a number of psychophysical experiments on the perception of depth from motion or stereo.}, isbn = {978-3-540-63517-8}, url = {http://dx.doi.org/10.1007/BFb0017872}, author = {Ferm{\"u}ller, Cornelia and LoongFah Cheong and Aloimonos, J.}, editor = {Sommer,Gerald and Koenderink,Jan} } @article {16926, title = {A grander goal: A thousand-fold increase in human capabilities}, journal = {Educom review}, volume = {32}, year = {1997}, month = {1997///}, pages = {4 - 10}, author = {Shneiderman, Ben} } @conference {13561, title = {Graphical Tools and Techniques for Querying Document Databases}, booktitle = {BSDIA}, year = {1997}, month = {1997///}, pages = {213 - 224}, author = {Sauvola,J. and David Doermann and Kauniskangas,H. and Shin,C. and Koivusaari,M. and Pietikainen,M.} } @conference {16328, title = {If your version control system could talk}, booktitle = {ICSE Workshop on Process Modelling and Empirical Studies of Software Engineering}, year = {1997}, month = {1997///}, author = {Ball,T. and Kim,J. M and Porter, Adam and Siy,H. P} } @conference {17543, title = {Implementing a performance forecasting system for metacomputing: the Network Weather Service}, booktitle = {Proceedings of the 1997 ACM/IEEE conference on Supercomputing (CDROM)}, series = {Supercomputing {\textquoteright}97}, year = {1997}, month = {1997///}, pages = {1 - 19}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {In this paper we describe the design and implementation of a system called the Network Weather Service (NWS) that takes periodic measurements of deliverable resource performance from distributed networked resources, and uses numerical models to dynamically generate forecasts of future performance levels. These performance forecasts, along with measures of performance fluctuation (e.g. the mean square prediction error) and forecast lifetime that the NWS generates, are made available to schedulers and other resource management mechanisms at runtime so that they may determine the quality-of-service that will be available from each resource.We describe the architecture of the NWS and implementations that we have developed and are currently deploying for the Legion [13] and Globus/Nexus [7] metacomputing infrastructures. We also detail NWS forecasts of resource performance using both the Legion and Globus/Nexus implementations. Our results show that simple forecasting techniques substantially outperform measurements of current conditions (commonly used to gauge resource availability and load) in terms of prediction accuracy. In addition, the techniques we have employed are almost as accurate as substantially more complex modeling methods. We compare our techniques to a sophisticated time-series analysis system in terms of forecasting accuracy and computational complexity.}, isbn = {0-89791-985-8}, doi = {10.1145/509593.509600}, url = {http://doi.acm.org/10.1145/509593.509600}, author = {Wolski,Rich and Spring, Neil and Peterson,Chris} } @conference {17607, title = {Improved approximations for edge-disjoint paths, unsplittable flow, and related routing problems}, booktitle = {, 38th Annual Symposium on Foundations of Computer Science, 1997. Proceedings}, year = {1997}, month = {1997/10/20/22}, pages = {416 - 425}, publisher = {IEEE}, organization = {IEEE}, abstract = {We present improved approximation algorithms for a family of problems involving edge-disjoint paths and unsplittable flow, and for some related routing problems. The central theme of all our algorithms is the underlying multi-commodity flow relaxation}, keywords = {Approximation algorithms, Bandwidth, Channel allocation, computational complexity, Computer science, edge-disjoint paths, graph theory, High speed integrated circuits, IEL, Image motion analysis, Information systems, multi-commodity flow relaxation, Multiprocessor interconnection networks, network routing, Optical fiber networks, Routing, routing problems, unsplittable flow}, isbn = {0-8186-8197-7}, doi = {10.1109/SFCS.1997.646130}, author = {Srinivasan, Aravind} } @article {17612, title = {Improved parallel approximation of a class of integer programming problems}, journal = {Algorithmica}, volume = {17}, year = {1997}, month = {1997///}, pages = {449 - 462}, abstract = {We present a method to derandomize RNC algorithms, converting them to NC algorithms. Using it, we show how to approximate a class of NP-hard integer programming problems in NC , to within factors better than the current-best NC algorithms (of Berger and Rompel and Motwani et al. ); in some cases, the approximation factors are as good as the best-known sequential algorithms, due to Raghavan. This class includes problems such as global wire-routing in VLSI gate arrays and a generalization of telephone network planning in SONET rings. Also for a subfamily of the {\textquotedblleft}packing{\textquotedblright} integer programs, we provide the first NC approximation algorithms; this includes problems such as maximum matchings in hypergraphs, and generalizations. The key to the utility of our method is that it involves sums of superpolynomially many terms, which can however be computed in NC ; this superpolynomiality is the bottleneck for some earlier approaches, due to Berger and Rompel and Motwani et al.}, isbn = {0178-4617}, url = {http://dx.doi.org/10.1007/BF02523683}, author = {Alon,N. and Srinivasan, Aravind} } @conference {17614, title = {Improving the discrepancy bound for sparse matrices: better approximations for sparse lattice approximation problems}, booktitle = {Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms}, series = {SODA {\textquoteright}97}, year = {1997}, month = {1997///}, pages = {692 - 701}, publisher = {Society for Industrial and Applied Mathematics}, organization = {Society for Industrial and Applied Mathematics}, address = {Philadelphia, PA, USA}, isbn = {0-89871-390-0}, url = {http://dl.acm.org/citation.cfm?id=314161.314418}, author = {Srinivasan, Aravind} } @conference {17240, title = {Intelligent software agents vs. user-controlled direct manipulation: a debate}, booktitle = {CHI {\textquoteright}97 extended abstracts on Human factors in computing systems: looking to the future}, series = {CHI EA {\textquoteright}97}, year = {1997}, month = {1997///}, pages = {105 - 106}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Critical issues in human-computer interaction - in particular, the advantages and disadvantages of intelligent agents and direct manipulation - will be discussed, debated, and hotly contested. The intent of the participants is to strike an appropriate balance between a serious discussion of the issues and an entertaining debate.}, keywords = {agents, direct manipulation, graphical representation, intelligent interfaces}, isbn = {0-89791-926-2}, doi = {10.1145/1120212.1120281}, url = {http://doi.acm.org/10.1145/1120212.1120281}, author = {Maes,Pattie and Shneiderman, Ben and Miller,Jim} } @conference {17881, title = {Interoperability of data parallel runtime libraries}, booktitle = {IPPS}, year = {1997}, month = {1997///}, pages = {451 - 451}, author = {Edjlali,G. and Sussman, Alan and Saltz, J.} } @article {14148, title = {Iterative methods for problems in computational fluid dynamics}, journal = {Iterative Methods in Scientific Computing}, year = {1997}, month = {1997///}, pages = {271 - 327}, author = {Elman, Howard and Silvester, D. J and Wathen, A. J} } @conference {12217, title = {KidPad: a design collaboration between children, technologists, and educators}, booktitle = {Proceedings of the SIGCHI conference on Human factors in computing systems}, year = {1997}, month = {1997///}, pages = {463 - 470}, author = {Druin, Allison and Stewart,J. and Proft,D. and Bederson, Benjamin B. and Hollan,J.} } @article {14627, title = {Local Rules for Protein Folding on a Triangular Lattice and Generalized Hydrophobicity in the HP Model}, journal = {Journal of Computational Biology}, volume = {4}, year = {1997}, month = {1997/01//}, pages = {275 - 296}, abstract = {We consider the problem of determining the three-dimensional folding of a protein given its one-dimensional amino acid sequence. We use the HP model for protein folding proposed by Dill (1985), which models protein as a chain of amino acid residues that are either hydrophobic or polar, and hydrophobic interactions are the dominant initial driving force for the protein folding. Hart and Istrail (1996a) gave approximation algorithms for folding proteins on the cubic lattice under the HP model. In this paper, we examine the choice of a lattice by considering its algorithmic and geometric implications and argue that the triangular lattice is a more reasonable choice. We present a set of folding rules for a triangular lattice and analyze the approximation ratio they achieve. In addition, we introduce a generalization of the HP model to account for residues having different levels of hydrophobicity. After describing the biological foundation for this generalization, we show that in the new model we are able to achieve similar constant factor approximation guarantees on the triangular lattice as were achieved in the standard HP model. While the structures derived from our folding rules are probably still far from biological reality, we hope that having a set of folding rules with different properties will yield more interesting folds when combined.}, isbn = {1066-5277, 1557-8666}, doi = {10.1089/cmb.1997.4.275}, url = {http://www.liebertonline.com/doi/abs/10.1089/cmb.1997.4.275}, author = {Agarwala,Richa and Batzoglou,Serafim and Dan{\v c}{\'\i}K,Vlado and Decatur,Scott E. and Hannenhalli, Sridhar and Farach,Martin and Muthukrishnan,S. and Skiena,Steven} } @article {13586, title = {Locally adaptive document skew detection}, journal = {Proceedings of SPIE}, volume = {3027}, year = {1997}, month = {1997/04/03/}, pages = {96 - 108}, abstract = {This paper proposes a new approach to the detection of local orientation and skew in document images. It is based on the observation that there are many documents where a single global estimate of the page skew is not sufficient. These documents require local adaptation to deal robustly with todays complex configurations of components on the page. The approach attempts to identify regions in the image which exhibit locally consistent physical properties and consistent physical properties and consistent orientation. To do this, we rapidly compute a coarse segmentation and delineate regions which differ with respect to layout and/or physical content. Each region is classified as text, graphics, mixed text/graphics, image or background using local features and additional features are extracted to estimate orientation. The local orientation decisions are propagated where appropriate to resolve ambiguity and to produce a global estimate of the skew for the page. The implementation of our algorithms is demonstrated on a set of images which have multiple regions with different orientations.}, isbn = {0277786X}, doi = {doi:10.1117/12.270063}, url = {http://spiedigitallibrary.org/proceedings/resource/2/psisdg/3027/1/96_1?isAuthorized=no}, author = {Sauvola,Jaakko J and David Doermann and Pietikaeinen,Matti} } @article {17283, title = {Low-effort, high-payoff user interface reengineering}, journal = {IEEE Software}, volume = {14}, year = {1997}, month = {1997/08//Jul}, pages = {66 - 72}, abstract = {Although increasingly sophisticated design methodologies for developing new user interfaces exist, low-effort, high-payoff user interface reengineering represents a new direction-and opportunity. Yet reengineering a working system is complex and risky because of the potential disruption to users and managers, their justifiable fear of change, and the lack of guarantees that such changes will be for the better. Our largely positive experiences with the projects described here lead us to believe that user interface reengineering is a viable and important process. Low effort, high-payoff improvement recommendations can probably be made for most existing systems. Nevertheless, a narrowly focused user interface reengineering plan may be inappropriate when the major problems lie outside the scope of the user interface, such as inadequate functionalities, frequent crashes, and network problems. Attempts at improving less severe problems while ignoring deeper ones may be perceived as insensitive by the users. In such cases it is important to consider either making similar short-term improvements for other parts of the systems or postponing short-term user interface reengineering in favour of a more complete system reengineering. Similarly, the need for interface stability might outweigh the benefits of the short-term improvements if a complete reengineering is planned for the near future. But most likely these proposed diagnostic strategies and opportunities for improvement are only a prelude to the much larger task of business reengineering, which implies extensive user interface reengineering}, keywords = {Business process re-engineering, complete system reengineering, Design methodology, Error analysis, Hardware, inadequate functionalities, interface stability, iterative methods, low-effort high-payoff user interface reengineering, short-term improvements, short-term user interface reengineering, software engineering, Software testing, System analysis and design, System testing, systems re-engineering, User centered design, user centred design, User interfaces}, isbn = {0740-7459}, doi = {10.1109/52.595958}, author = {Plaisant, Catherine and Rose,A. and Shneiderman, Ben and Vanniamparampil,A. J} } @article {17714, title = {On markov chains with sluggish transients}, journal = {Communications in Statistics. Stochastic Models}, volume = {13}, year = {1997}, month = {1997///}, pages = {85 - 94}, abstract = {In this note it is shown how to construct a Markov chain whose subdominant eigenvalue does not predict the decay of its transient}, isbn = {0882-0287}, doi = {10.1080/15326349708807414}, url = {http://www.tandfonline.com/doi/abs/10.1080/15326349708807414}, author = {Stewart, G.W.} } @conference {17623, title = {Mechanism design for intellectual property rights protection}, booktitle = {Proceedings of the eighteenth international conference on Information systems}, series = {ICIS {\textquoteright}97}, year = {1997}, month = {1997///}, pages = {448{\textendash} - 448{\textendash}}, publisher = {Association for Information Systems}, organization = {Association for Information Systems}, address = {Atlanta, GA, USA}, url = {http://dl.acm.org/citation.cfm?id=353071.353206}, author = {Giridharan,P. S. and Srinivasan, Aravind} } @article {15523, title = {Model generation and state generation for disjunctive logic programs}, journal = {The Journal of Logic Programming}, volume = {32}, year = {1997}, month = {1997/07//}, pages = {49 - 69}, abstract = {This paper investigates two fixpoint approaches for minimal model reasoning with disjunctive logic programs P. The first one, called model generation, is based on an operator TPINT defined on sets of Herbrand interpretations whose least fixpoint is logically equivalent to the set of minimal Herbrand models of the program. The second approach, called state generation, uses a fixpoint operation TPs based on hyperresolution. It operates on disjunctive Herbrand states, and its least fixpoint is the set of logical consequences of P, the so-called minimal model state of the program. We establish a useful relationship between hyperresolution by PPs and model generation by TPINT. Then we investigate the problem of continuity of the two operators TPs and TPINT. It is known that the operator TPs is continuous, and so it reaches its least fixpoint in at most ω iterations. On the other hand, the question of whether TPINT is continuous has been open. We show by a counterexample that TPINT is not continuous. Nevertheless, we prove that it converges towards its least fixpoint in at most ω iterations, too, as follows from the relationship that we show exists between hyperresolution and model generation. We define an iterative version of TPINT that computes the perfect model semantics of stratified disjunctive logic programs. On each stratum of the program, this operator converges in at most ω iterations. Model generations for the stable semantics and the partial stable semantics are respectively achieved by using this iterative operator together with the evidential transformation and the 3-S transformation.}, isbn = {0743-1066}, doi = {10.1016/S0743-1066(96)00116-1}, url = {http://www.sciencedirect.com/science/article/pii/S0743106696001161}, author = {Seipel,Dietmar and Minker, Jack and Ruiz,Carolina} } @article {17954, title = {Multiresolution surface modeling}, journal = {SIGGRAPH 1997 Course Notes}, year = {1997}, month = {1997///}, author = {Heckbert,P. and Rossignac,J. and Hoppe,H. and Schroeder,W. and Soucy,M. and Varshney, Amitabh} } @article {17419, title = {The next generation of graphical user interfaces: information visualization and better window management}, journal = {Displays}, volume = {17}, year = {1997}, month = {1997/05/01/}, pages = {125 - 129}, isbn = {0141-9382}, doi = {10.1016/S0141-9382(97)00005-X}, url = {http://www.sciencedirect.com/science/article/pii/S014193829700005X}, author = {Shneiderman, Ben} } @article {12366, title = {Optimizing synchronization in multiprocessor DSP systems}, journal = {Signal Processing, IEEE Transactions on}, volume = {45}, year = {1997}, month = {1997///}, pages = {1605 - 1618}, author = {Bhattacharyya, Shuvra S. and Sriram,S. and Lee,E. A} } @article {17729, title = {Perturbation analysis for the QR decomposition}, journal = {SIAM Journal on Matrix Analysis and Applications}, volume = {18}, year = {1997}, month = {1997///}, pages = {775 - 791}, author = {Chang,X. C. and Paige,C. C. and Stewart, G.W.} } @article {17721, title = {On the Perturbation of LU and Cholesky Factors}, journal = {IMA Journal of Numerical AnalysisIMA J Numer Anal}, volume = {17}, year = {1997}, month = {1997/01/01/}, pages = {1 - 6}, abstract = {In a recent paper, Chang and Paige have shown that the usual perturbation bounds for Cholesky factors can systematically overestimate the errors. In this note we sharpen their results and extend them to the factors of the LU decomposition. The results are based on a new formula for the first-order terms of the error in the factors.}, isbn = {0272-4979, 1464-3642}, doi = {10.1093/imanum/17.1.1}, url = {http://imajna.oxfordjournals.org/content/17/1/1}, author = {Stewart, G.W.} } @conference {15625, title = {A practical approximation algorithm for the LMS line estimator}, booktitle = {Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms}, series = {SODA {\textquoteright}97}, year = {1997}, month = {1997///}, pages = {473 - 482}, publisher = {Society for Industrial and Applied Mathematics}, organization = {Society for Industrial and Applied Mathematics}, address = {Philadelphia, PA, USA}, keywords = {Approximation algorithms, least median-of-squares regression, line arrangements, line fitting, randomized algorithms, robust estimation}, isbn = {0-89871-390-0}, url = {http://dl.acm.org/citation.cfm?id=314161.314349}, author = {Mount, Dave and Netanyahu,Nathan S. and Romanik,Kathleen and Silverman,Ruth and Wu,Angela Y.} } @conference {18687, title = {Probabilistic verification of a synchronous round-based consensus protocol}, year = {1997}, month = {1997/10//}, pages = {165 - 174}, abstract = {Consensus protocols are used in a variety of reliable distributed systems, including both safety-critical and business-critical applications. The correctness of a consensus protocol is usually shown, by making assumptions about the environment in which it executes, and then proving properties about the protocol. But proofs about a protocol{\textquoteright}s behavior are only as good as the assumptions which were made to obtain them, and violation of these assumptions can lead to unpredicted and serious consequences. We present a new approach for the probabilistic verification of synchronous round based consensus protocols. In doing so, we make stochastic assumptions about the environment in which a protocol operates, and derive probabilities of proper and non proper behavior. We thus can account for the violation of assumptions made in traditional proof techniques. To obtain the desired probabilities, the approach enumerates possible states that can be reached during an execution of the protocol, and computes the probability of achieving the desired properties for a given fault and network environment. We illustrate the use of this approach via the evaluation of a simple consensus protocol operating under a realistic environment which includes performance, omission, and crash failures}, keywords = {business-critical applications, consensus protocol correctness, crash failures, formal verification, network environment, probabilistic verification, probabilities, probability, program verification, proper behavior, protocol behavior, Protocols, realistic environment, reliable distributed systems, safety-critical applications, simple consensus protocol, software reliability, stochastic assumptions, synchronous round based consensus protocol, synchronous round based consensus protocols, traditional proof techniques}, doi = {10.1109/RELDIS.1997.632812}, author = {Duggal,H.S. and Michel Cukier and Sanders,W. H.} } @article {16199, title = {Query previews for networked information systems: a case study with NASA environmental data}, journal = {SIGMOD Record}, volume = {26}, year = {1997}, month = {1997///}, pages = {75 - 81}, abstract = {Formulating queries on networked information systemsis laden with problems: data diversity, data complexity, network growth, varied user base, and slow network access. This paper proposes a new approach to a network query user interface which consists of two phases: query preview and query refinement. This new approach is based on dynamic queries and tight coupling, guiding users to rapidly and dynamically eliminate undesired items, reduce the data volume to a manageable size, and refine queries locally before submission over a network. A two-phase dynamic query system for NASA{\textquoteright}s Earth Observing Systems--Data Information Systems (EOSDIS) is presented. The prototype was well received by the team of scientists who evaluated the interface. }, author = {Doan,K. and Plaisant, Catherine and Shneiderman, Ben and Bruns,T.} } @conference {16196, title = {Query previews in networked information systems: the case of EOSDIS}, booktitle = {CHI {\textquoteright}97 extended abstracts on Human factors in computing systems: looking to the future}, series = {CHI EA {\textquoteright}97}, year = {1997}, month = {1997///}, pages = {202 - 203}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Dynamic queries have been shown to be an effective technique to browse information, and to find patterns and exceptions. Dynamic queries involve the interactive control by a user of visual query parameters that generate rapid (100 ms update), animated, and visual displays of database search results. The data of early implementations was stored in local memory to guarantee optimal speed. Problems arise when the data is very large and distributed over a network. To overcome the problems of slow networks and data volume we propose a two-phase approach to query formulation using query previews and query refinements [1]. Preview mechanisms have been used in the past [2] and we believe that their use will be a major component of successful networked information systems interfaces (e.g. [3]).}, keywords = {direct manipulation, dynamic query, earth science, network information system, query preview, Visualization}, isbn = {0-89791-926-2}, doi = {10.1145/1120212.1120343}, url = {http://doi.acm.org/10.1145/1120212.1120343}, author = {Plaisant, Catherine and Bruns,Tom and Shneiderman, Ben and Doan,Khoa} } @article {17647, title = {Randomized Distributed Edge Coloring via an Extension of the Chernoff--Hoeffding Bounds}, journal = {SIAM Journal on Computing}, volume = {26}, year = {1997}, month = {1997///}, pages = {350 - 350}, abstract = {Certain types of routing, scheduling, and resource-allocation problems in a distributed setting can be modeled as edge-coloring problems. We present fast and simple randomized algorithms for edge coloring a graph in the synchronous distributed point-to-point model of computation. Our algorithms compute an edge coloring of a graph $G$ with $n$ nodes and maximum degree $\Delta$ with at most $1.6 \Delta + O(\log^{1+ \delta} n)$ colors with high probability (arbitrarily close to 1) for any fixed $\delta > 0$; they run in polylogarithmic time. The upper bound on the number of colors improves upon the $(2 \Delta - 1)$-coloring achievable by a simple reduction to vertex coloring.To analyze the performance of our algorithms, we introduce new techniques for proving upper bounds on the tail probabilities of certain random variables. The Chernoff--Hoeffding bounds are fundamental tools that are used very frequently in estimating tail probabilities. However, they assume stochastic independence among certain random variables, which may not always hold. Our results extend the Chernoff--Hoeffding bounds to certain types of random variables which are not stochastically independent. We believe that these results are of independent interest and merit further study. }, isbn = {00975397}, doi = {10.1137/S0097539793250767}, url = {http://link.aip.org/link/SMJCAT/v26/i2/p350/s1\&Agg=doi}, author = {Panconesi,Alessandro and Srinivasan, Aravind} } @article {17879, title = {Run-time and compiler support for programming in adaptive parallel environments}, journal = {Scientific Programming}, volume = {6}, year = {1997}, month = {1997///}, pages = {215 - 227}, author = {Edjlali,G. and Agrawal,G. and Sussman, Alan and Humphries,J. and Saltz, J.} } @article {17654, title = {Scheduling and load-balancing via randomization}, volume = {TR11/97}, year = {1997}, month = {1997/11/01/undef}, institution = {DSpace at School of Computing, NUS}, author = {Srinivasan, Aravind} } @conference {17848, title = {Scheduling in a high performance remote-sensing data server}, booktitle = {Proceedings of the Eighth SIAM Conference on Parallel Processing for Scientific Computing. SIAM}, year = {1997}, month = {1997///}, author = {Chang,C. and Sussman, Alan and Saltz, J.} } @conference {12092, title = {A secure and reliable bootstrap architecture}, booktitle = {, 1997 IEEE Symposium on Security and Privacy, 1997. Proceedings}, year = {1997}, month = {1997/05/04/7}, pages = {65 - 71}, publisher = {IEEE}, organization = {IEEE}, abstract = {In a computer system, the integrity of lower layers is typically treated as axiomatic by higher layers. Under the presumption that the hardware comprising the machine (the lowest layer) is valid, the integrity of a layer can be guaranteed if and only if: (1) the integrity of the lower layers is checked and (2) transitions to higher layers occur only after integrity checks on them are complete. The resulting integrity {\textquotedblleft}chain{\textquotedblright} inductively guarantees system integrity. When these conditions are not met, as they typically are not in the bootstrapping (initialization) of a computer system, no integrity guarantees can be made, yet these guarantees are increasingly important to diverse applications such as Internet commerce, security systems and {\textquotedblleft}active networks{\textquotedblright}. In this paper, we describe the AEGIS architecture for initializing a computer system. It validates integrity at each layer transition in the bootstrap process. AEGIS also includes a recovery process for integrity check failures, and we show how this results in robust systems}, keywords = {active networks, AEGIS architecture, bootstrap architecture, Computer architecture, computer bootstrapping, data integrity, Distributed computing, Hardware, hardware validity, initialization, integrity chain, integrity check failures, Internet, Internet commerce, IP networks, Laboratories, lower-layer integrity, Microprogramming, Operating systems, recovery process, reliability, robust systems, Robustness, Security, security of data, software reliability, system integrity guarantees, system recovery, transitions, Virtual machining}, isbn = {0-8186-7828-3}, doi = {10.1109/SECPRI.1997.601317}, author = {Arbaugh, William A. and Farber,D. J and Smith,J. M} } @article {16948, title = {A Taxonomy of Multiple Window Coordination}, journal = {Institute for Systems Research Technical Reports}, year = {1997}, month = {1997///}, abstract = {In current windowing environments, individual windows are treated independently, making it difficult for users to coordinate information across multiple windows. While coordinated multi- window strategies are increasingly used in visualization and web user interfaces, designs are inflexible and haphazard. The space of such linked-window strategies is not well understood and largely unexplored. This paper presents a taxonomy of coordinations, identifies important components, and reviews example interfaces. This 2x3 taxonomy provides guidelines for designers of applications, user interface toolkits, and window managers. We hope to encourage construction of generalized, end- user programmable, robust, multiple-window coordination capabilities.}, keywords = {Human-Computer Interaction,}, url = {http://drum.lib.umd.edu/handle/1903/5892}, author = {North,Chris and Shneiderman, Ben} } @conference {13658, title = {Techniques for Automated Testing for Automated Testing of Document Analysis Algorithms}, booktitle = {Proceedings of the First Brazilian Symposium on Document Image Analysis}, year = {1997}, month = {1997///}, pages = {201 - 212}, author = {Sauvola,J. and Kauniskangas,H. and David Doermann and Pietikainen,M.} } @article {15562, title = {Testing simple polygons}, journal = {Computational Geometry}, volume = {8}, year = {1997}, month = {1997/07//}, pages = {97 - 114}, abstract = {We consider the problem of verifying a simple polygon in the plane using {\textquotedblleft}test points{\textquotedblright}. A test point is a geometric probe that takes as input a point in Euclidean space, and returns {\textquotedblleft}+{\textquotedblright} if the point is inside the object being probed or {\textquotedblleft}-{\textquotedblright} if it is outside. A verification procedure takes as input a description of a target object, including its location and orientation, and it produces a set of test points that are used to verify whether a test object matches the description. We give a procedure for verifying an n-sided, non-degenerate, simple target polygon using 5n test points. This testing strategy works even if the test polygon has n + 1 vertices, and we show a lower bound of 3n + 1 test points for this case. We also give algorithms using O(n) test points for simple polygons that may be degenerate and for test polygons that may have up to n + 2 vertices. All of these algorithms work for polygons with holes. We also discuss extensions of our results to higher dimensions.}, keywords = {probing, Testing, Verifying}, isbn = {0925-7721}, doi = {10.1016/S0925-7721(96)00015-6}, url = {http://www.sciencedirect.com/science/article/pii/S0925772196000156}, author = {Arkin,Esther M. and Belleville,Patrice and Mitchell,Joseph S.B. and Mount, Dave and Romanik,Kathleen and Salzberg,Steven and Souvaine,Diane} } @conference {17856, title = {Titan: a High-Performance Remote-sensing Database}, booktitle = {In Proceedings of the 1997 International Conference on Data Engineering}, year = {1997}, month = {1997///}, author = {Bongki,C. C and Chang,C. and Moon,B. and Acharya, A. and Shock,C. and Sussman, Alan and Saltz, J.} } @article {17738, title = {The Triangular Matrices of Gaussian Elimination and Related Decompositions}, journal = {IMA Journal of Numerical Analysis}, volume = {17}, year = {1997}, month = {1997/01/01/}, pages = {7 - 16}, abstract = {It has become commonplace that triangular systems are solved to higher accuracy than their condition would warrant. This observation is not true in general, and counterexamples are easy to construct. However, it is often true of the triangular matrices from pivoted LU or QR decompositions. It is shown that this fact is closely connected with the rank-revealing character of these decompositions.}, isbn = {0272-4979, 1464-3642}, doi = {10.1093/imanum/17.1.7}, url = {http://imajna.oxfordjournals.org/content/17/1/7}, author = {Stewart, G.W.} } @article {16197, title = {User Interface Reengineering: Low-Effort, High-Payoff Strategies}, journal = {IEEE Software}, volume = {14}, year = {1997}, month = {1997///}, pages = {66 - 72}, abstract = {User interface technology has advanced rapidly in recent years. Incorporating new developments in existing systems could result in substantial improvements in usability, thereby improving performance and user satisfaction, while shortening training and reducing error rates. We describe low-effort, high-payoff strategies that focus attention on improvements to data display and entry, consistency, messages, documentation, system access and additional functionality. We report on experience from six projects, describing observations, recommendations and outcomes. We close with guidance for managers and designers who are responsible for user interface reengineering.}, author = {Plaisant, Catherine and Rose,A. and Shneiderman, Ben and Vanniamparampil,A. J} } @article {17472, title = {User Interfaces for a Complex Robotic Task: A Comparison of Tiles vs. Overlapped Windows}, journal = {Institute for Systems Research Technical Reports}, year = {1997}, month = {1997///}, abstract = {High complexity tasks, such as remote teleoperation of robotic vehicles, often require multiple windows. For these complex tasks, the windows necessary for task completion, may occupy more area than available on a single visual display unit (VDU). Since the focus of the robotic task constantly changes, modular control panels that can be opened, closed, and moved on the screen are invaluable to the operator. This study describes a specific robotic task and the need for a multi window interface that can be easily manipulated. This paper examines two multi-window management strategies: tiled (fixed size) and arbitrary overlap. Multi-window searches were performed using the two management styles and they were compared on the basis of search completion time and error rates. Results with 35 novice users showed faster completion times for the tiled management strategy than for the arbitrary overlap strategy. Over factors such as the number of windows available, the number of displayed windows workload of opening or closing windows, and effect of learning are discussed.}, keywords = {Human computer interaction, overlapped, Systems Integration Methodology, tiled, user interface design, window management}, url = {http://drum.lib.umd.edu/handle/1903/5874}, author = {Lane,J. Corde and Kuester,Steven P and Shneiderman, Ben} } @conference {17846, title = {The virtual microscope.}, booktitle = {Proceedings of the AMIA Annual Fall Symposium}, year = {1997}, month = {1997///}, pages = {449 - 449}, author = {Ferreira,R. and Moon,B. and Humphries,J. and Sussman, Alan and Saltz, J. and Miller,R. and Demarzo,A.} } @article {17485, title = {Visual and textual consistency checking tools for graphical user interfaces}, journal = {IEEE Transactions on Software Engineering}, volume = {23}, year = {1997}, month = {1997/11//}, pages = {722 - 735}, abstract = {Designing user interfaces with consistent visual and textual properties is difficult. To demonstrate the harmful effects of inconsistency, we conducted an experiment with 60 subjects. Inconsistent interface terminology slowed user performance by 10 to 25 percent. Unfortunately, contemporary software tools provide only modest support for consistency control. Therefore, we developed SHERLOCK, a family of consistency analysis tools, which evaluates visual and textual properties of user interfaces. It provides graphical analysis tools such as a dialog box summary table that presents a compact overview of visual properties of all dialog boxes. SHERLOCK provides terminology analysis tools including an interface concordance, an interface spellchecker, and terminology baskets to check for inconsistent use of familiar groups of terms. Button analysis tools include a button concordance and a button layout table to detect variant capitalization, distinct typefaces, distinct colors, variant button sizes, and inconsistent button placements. We describe the design, software architecture, and the use of SHERLOCK. We tested SHERLOCK with four commercial prototypes. The outputs, analysis, and feedback from designers of the applications are presented}, keywords = {button analysis tools, Color, dialog box summary table, experiment, graphical analysis tools, Graphical user interfaces, human factors, inconsistent interface terminology, interface color, interface spell checker, Output feedback, Prototypes, SHERLOCK, Software architecture, Software design, software metrics, software prototyping, software tools, Terminology, terminology analysis tools, Testing, textual consistency checking tools, user interface management systems, User interfaces, user performance, visual consistency checking tools}, isbn = {0098-5589}, doi = {10.1109/32.637386}, author = {Mahajan,R. and Shneiderman, Ben} } @article {16198, title = {Visual Information Seeking in Digital Image Libraries: The Visible Human Explorer}, journal = {Information in Images}, year = {1997}, month = {1997///}, abstract = {This chapter presents the Visible Human Explorer user interface, developed at theHuman-Computer Interaction Lab of the University of Maryland at College Park, for remotely accessing the National Library of Medicine{\textquoteright}s Visible Human digital image library. With the interface, users can visualize the library, browse contents, locate data of interest, and retrieve and zoom on desired image details. The interface presents a pair of tightly coupled views of library data: an overview of the overall search space, and a preview of high-resolution images available for retrieval. To explore, the user sweeps the views through the search space and receives smooth, rapid, visual feedback of contents. Desired details are automatically downloaded over the internet from the library. The interface software is completely functional (runs on Sun Workstations) and freely available for public use, at: http://www.nlm.nih.gov/. We also present several human-computer interaction design principles used to create the Visible Human Explorer interface, describe how these were applied to the design, and discuss issues in employing these techniques in user interfaces for other information collections. These principles are direct manipulation, visual information seeking, query previews, and multiple tightly coupled views. We illustrate these concepts with a plethora of pictures of user interface screens. Please also check the included CD-ROM for additional illustration media. }, author = {North,C. and Shneiderman, Ben and Plaisant, Catherine} } @article {17728, title = {On the weighting method for least squares problems with linear equality constraints}, journal = {BIT Numerical Mathematics}, volume = {37}, year = {1997}, month = {1997///}, pages = {961 - 967}, abstract = {The weighting method for solving a least squares problem with linear equality constraints multiplies the constraints by a large number and appends them to the top of the least squares problem, which is then solved by standard techniques. In this paper we give a new analysis of the method, based on the QR decomposition, that exhibits many features of the algorithm. In particular it suggests a natural criterion for chosing the weighting factor.}, doi = {10.1007/BF02510363}, author = {Stewart, G.W.} } @article {12177, title = {A zooming web browser}, journal = {Human Factors in Web Development}, year = {1997}, month = {1997///}, author = {Bederson, Benjamin B. and Hollan,J.D. and Stewart,J. and Rogers,D. and Druin, Allison and Vick,D. and Ring,L. and Grose,E. and Forsythe,C.} } @article {16953, title = {Advanced graphic user interfaces: elastic and tightly coupled windows}, journal = {ACM Comput. Surv.}, volume = {28}, year = {1996}, month = {1996/12//}, isbn = {0360-0300}, doi = {10.1145/242224.242409}, url = {http://doi.acm.org/10.1145/242224.242409}, author = {Shneiderman, Ben} } @article {17638, title = {On the Complexity of Distributed Network Decomposition}, journal = {Journal of Algorithms}, volume = {20}, year = {1996}, month = {1996/03//}, pages = {356 - 374}, abstract = {In this paper, we improve the bounds for computing a network decomposition distributively and deterministically. Our algorithm computes an (nϵ(n),nϵ(n))-decomposition innO(ϵ(n))time, where[formula]. As a corollary we obtain improved deterministic bounds for distributively computing several graph structures such as maximal independent sets and Δ-vertex colorings. We also show that the class of graphs G whose maximum degree isnO(δ(n))where δ(n)=1/log lognis complete for the task of computing a near-optimal decomposition, i.e., a (logn, logn)-decomposition, in polylog(n) time. This is a corollary of a more general characterization, which pinpoints the weak points of existing network decomposition algorithms. Completeness is to be intended in the following sense: if we have an algorithmAthat computes a near-optimal decomposition in polylog(n) time for graphs inG, then we can compute a near-optimal decomposition in polylog(n) time for all graphs.}, isbn = {0196-6774}, doi = {10.1006/jagm.1996.0017}, url = {http://www.sciencedirect.com/science/article/pii/S0196677496900176}, author = {Panconesi,Alessandro and Srinivasan, Aravind} } @conference {12844, title = {The Concurrency Factory: A development environment for concurrent systems}, booktitle = {Computer Aided Verification}, year = {1996}, month = {1996///}, pages = {398 - 401}, author = {Cleaveland, Rance and Lewis,P. and Smolka,S. and Sokolsky,O.} } @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 {12066, title = {Early detection of independent motion from active control of normal image flow patterns}, journal = {Systems, Man, and Cybernetics, Part B: Cybernetics, IEEE Transactions on}, volume = {26}, year = {1996}, month = {1996///}, pages = {42 - 52}, author = {Sharma, R. and Aloimonos, J.} } @conference {18038, title = {Efficient approximate and dynamic matching of patterns using a labeling paradigm}, booktitle = {Foundations of Computer Science, 1996. Proceedings., 37th Annual Symposium on}, year = {1996}, month = {1996/10//}, pages = {320 - 328}, abstract = {A key approach in string processing algorithmics has been the labeling paradigm which is based on assigning labels to some of the substrings of a given string. If these labels are chosen consistently, they can enable fast comparisons of substrings. Until the first optimal parallel algorithm for suffix tree construction was given by the authors in 1994 the labeling paradigm was considered not to be competitive with other approaches. They show that this general method is also useful for several central problems in the area of string processing: approximate string matching, dynamic dictionary matching, and dynamic text indexing. The approximate string matching problem deals with finding all substrings of a text which match a pattern ldquo;approximately rdquo;, i.e., with at most m differences. The differences can be in the form of inserted, deleted, or replaced characters. The text indexing problem deals with finding all occurrences of a pattern in a text, after the text is preprocessed. In the dynamic text indexing problem, updates to the text in the form of insertions and deletions of substrings are permitted. The dictionary matching problem deals with finding all occurrences of each pattern set of a set of patterns in a text, after the pattern set is preprocessed. In the dynamic dictionary matching problem, insertions and deletions of patterns to the pattern set are permitted}, keywords = {algorithm;replaced, algorithmics;substrings;suffix, algorithms;pattern, approximate, characters;dynamic, characters;labeling, characters;string, complexity;indexing;parallel, construction;computational, data, dictionary, dynamic, indexing;efficient, matching;deleted, matching;dynamic, matching;efficient, matching;inserted, matching;string, matching;tree, paradigm;optimal, Parallel, pattern, PROCESSING, string, structures;, text, tree}, doi = {10.1109/SFCS.1996.548491}, author = {Sahinalp,S. C and Vishkin, Uzi} } @article {16379, title = {Efficient distribution analysis via graph contraction}, journal = {Languages and Compilers for Parallel Computing}, year = {1996}, month = {1996///}, pages = {377 - 391}, author = {Sheffler,T. and Schreiber,R. and Pugh, William and Gilbert,J. and Chatterjee,S.} } @conference {17127, title = {Elastic windows: improved spatial layout and rapid multiple window operations}, booktitle = {Proceedings of the workshop on Advanced visual interfaces}, series = {AVI {\textquoteright}96}, year = {1996}, month = {1996///}, pages = {29 - 38}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Most windowing systems follow the independent overlapping windows approach, which emerged as an answer to the needs of the 80s{\textquoteright} application and technology. Advances in computers, display technology, and the applications demand more functionality from window management systems. Based on these changes and the problems of current windowing appraoches, we have updated the requirements for multiwindow systems to guide new methods of window management. We propose elastic windows with improved spatial layout and rapid multi-window operations. Multi-window operations are achieved by issuing operations on window groups hierachically organized in a space-filling tiled layout. Sophisticated multi-window operations and spatial layout dynamics helps users to handle fast task-switching and to structure thier work environment to their rapidly changing needs. We claim that these multi-window operations and the improved spatial layout decrease the cognitive load on users. Users found our prototype system to be comprehensible and enjoyable as they playfully explored the way multiple windows are reshaped.}, keywords = {CAD, elastic windows, multi-window operations, personal role manager, programming environment, task switching, window manager}, isbn = {0-89791-834-7}, doi = {10.1145/948449.948454}, url = {http://doi.acm.org/10.1145/948449.948454}, author = {Kandogan,Eser and Shneiderman, Ben} } @article {18438, title = {The empirical investigation of Perspective-Based Reading}, journal = {Empirical Software Engineering}, volume = {1}, year = {1996}, month = {1996///}, pages = {133 - 164}, abstract = {We consider reading techniques a fundamental means of achieving high quality software. Due to the lack of research in this area, we are experimenting with the application and comparison of various reading techniques. This paper deals with our experiences with a family of reading techniques known as Perspective-Based Reading (PBR), and its application to requirements documents. The goal of PBR is to provide operational scenarios where members of a review team read a document from a particular perspective, e.g., tester, developer, user. Our assumption is that the combination of different perspectives provides better coverage of the document, i.e., uncovers a wider range of defects, than the same number of readers using their usual technique.}, keywords = {Computer, Science}, isbn = {1382-3256}, url = {http://dx.doi.org/10.1007/BF00368702}, author = {Basili, Victor R. and Green,Scott and Laitenberger,Oliver and Lanubile,Filippo and Shull, Forrest and S{\o}rumg{\r a}rd,Sivert and Zelkowitz, Marvin V} } @conference {17551, title = {An extension of the Lov{\'a}sz Local Lemma, and its applications to integer programming}, booktitle = {Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms}, series = {SODA {\textquoteright}96}, year = {1996}, month = {1996///}, pages = {6 - 15}, publisher = {Society for Industrial and Applied Mathematics}, organization = {Society for Industrial and Applied Mathematics}, address = {Philadelphia, PA, USA}, isbn = {0-89871-366-8}, url = {http://dl.acm.org/citation.cfm?id=313852.313866}, author = {Srinivasan, Aravind} } @conference {17412, title = {The eyes have it: a task by data type taxonomy for information visualizations}, booktitle = {, IEEE Symposium on Visual Languages, 1996. Proceedings}, year = {1996}, month = {1996/09/03/6}, pages = {336 - 343}, publisher = {IEEE}, organization = {IEEE}, abstract = {A useful starting point for designing advanced graphical user interfaces is the visual information seeking Mantra: overview first, zoom and filter, then details on demand. But this is only a starting point in trying to understand the rich and varied set of information visualizations that have been proposed in recent years. The paper offers a task by data type taxonomy with seven data types (one, two, three dimensional data, temporal and multi dimensional data, and tree and network data) and seven tasks (overview, zoom, filter, details-on-demand, relate, history, and extracts)}, keywords = {advanced graphical user interface design, Art, data mining, data type taxonomy, data visualisation, Data visualization, Displays, Eyes, Graphical user interfaces, Information filtering, Information filters, information visualizations, multi dimensional data, Multimedia databases, network data, Taxonomy, visual databases, visual information seeking, visual programming}, isbn = {0-8186-7508-X}, doi = {10.1109/VL.1996.545307}, author = {Shneiderman, Ben} } @article {14132, title = {Fast nonsymmetric iterations and preconditioning for Navier-Stokes equations}, journal = {SIAM Journal on Scientific Computing}, volume = {17}, year = {1996}, month = {1996///}, pages = {33 - 46}, author = {Elman, Howard and Silvester, D.} } @article {18042, title = {A fast parallel algorithm for finding the convex hull of a sorted point set}, journal = {International Journal of Computational Geometry and Applications}, volume = {6}, year = {1996}, month = {1996///}, pages = {231 - 242}, author = {Berkman,O. and Schieber,B. and Vishkin, Uzi} } @conference {17860, title = {A high performance image database system for remotely sensed imagery}, booktitle = {Euro-Par{\textquoteright}96 Parallel Processing}, year = {1996}, month = {1996///}, pages = {109 - 122}, author = {Shock,C. and Chang,C. and Davis, Larry S. and Goward,S. and Saltz, J. and Sussman, Alan} } @article {16206, title = {Hybrid network management (communication systems)}, journal = {16th AIAA International Communications Satellite Systems Conference}, year = {1996}, month = {1996///}, abstract = {We describe our collaborative efforts towards the design and implementation of a next-generation integrated network management system for hybrid networks (INMS/HN). We describe the overall software architecture of the system at its current stage of development. This NMS is specifically designed to address issues relevant to complex heterogeneous networks consisting of seamlessly interoperable terrestrial and satellite networks. NMSs are a key element for interoperability in such networks. We describe the integration of configuration management and performance management. The next step in this integration is fault management. In particular, we describe the object model, issues concerning the graphical user interface, browsing tools, performance data graphical widget displays, and management information database organization issues.}, author = {Baras,J. S and Ball,M. and Karne,R. K and Kelley,S. and Jang,K.D. and Plaisant, Catherine and Roussopoulos, Nick and Stathatos,K. and Vakhutinsky,A. and Valluri,J.} } @article {18703, title = {Identification of the Binding Site for Acidic Phospholipids on the PH Domain of Dynamin: Implications for Stimulation of GTPase Activity}, journal = {Journal of Molecular Biology}, volume = {255}, year = {1996}, month = {1996/01/12/}, pages = {14 - 21}, abstract = {It has recently been suggested that pleckstrin homology (PH) domains bind specifically to phospholipids, with phosphatidylinositol-4,5-bisphosphate (PtdIns(4,5)P2) being most strongly bound. This observation suggests that PH domains may be responsible for membrane association of proteins in which they occur. Further, this membrane association may be regulated by enzymes that modify lipid head groups to which PH domains may bind. We have studied the binding of phospholipids to the PH domain of human dynamin, a 100 kDa GTPase that is involved in the initial stages of endocytosis. We describe a rapid method for screening PH domain/ligand interactions that gives precise binding constants. We confirm that PtdIns(4,5)P2can bind to dynamin PH domain, although not in an aggregated state. Using NMR spectroscopy, we have mapped a specific site on the surface of dynamin PH domain of which binding of gIns(1,4,5)P3(the head-group skeleton of PtdIns(4,5)P2) occurs. The relative affinity of acidic phospholipids for dynamin PH domain correlates with their ability to activate the GTPase of dynamin. We propose, therefore, that the interaction of these phospholipids with dynamin is likely to occurviathe PH domain. Given the fact that PH domains are often found in pro- teins associated with GTPase activity, or in guanine nucleotide exchange factors, we suggest that one role of PH domains may be to couple phosphatidylinositol signalling to GTP hydrolysis.}, keywords = {Fluorescence, ligand binding, NMR, PH domain, phospholipid}, isbn = {0022-2836}, doi = {10.1006/jmbi.1996.0002}, url = {http://www.sciencedirect.com/science/article/pii/S0022283696900029}, author = {Zheng,Jie and Cahill,Sean M. and Lemmon,Mark A. and Fushman, David and Schlessinger,Joseph and Cowburn,David} } @article {17231, title = {Incremental data structures and algorithms for dynamic query interfaces}, journal = {ACM SIGMOD Record}, volume = {25}, year = {1996}, month = {1996/12//}, pages = {21 - 24}, abstract = {Dynamic query interfaces (DQIs) form a recently developed method of database access that provides continuous realtime feedback to the user during the query formulation process. 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 approach to DQI algorithms that works well with large databases.}, keywords = {algorithm, data structure, database, direct manipulation, dynamic query, Information Visualization, user interface}, isbn = {0163-5808}, doi = {10.1145/245882.245891}, url = {http://doi.acm.org/10.1145/245882.245891}, author = {Tanin,Egemen and Beigel,Richard and Shneiderman, Ben} } @article {16202, title = {Integrated network management of hybrid networks}, journal = {AIP Conference Proceedings}, volume = {361}, year = {1996}, month = {1996/03/01/}, pages = {345 - 350}, abstract = {We describe our collaborative efforts towards the design and implementation of a next generation integrated network management system for hybrid networks (INMS/HN). We describe the overall software architecture of the system at its current stage of development. This network management system is specifically designed to address issues relevant for complex heterogeneous networks consisting of seamlessly interoperable terrestrial and satellite networks. Network management systems are a key element for interoperability in such networks. We describe the integration of configuration management and performance management. The next step in this integration is fault management. In particular we describe the object model, issues of the Graphical User Interface (GUI), browsing tools and performance data graphical widget displays, management information database (MIB) organization issues. Several components of the system are being commercialized by Hughes Network Systems. {\textcopyright} 1996 American Institute of Physics.}, isbn = {0094243X}, doi = {doi:10.1063/1.50028}, url = {http://proceedings.aip.org/resource/2/apcpcs/361/1/345_1?isAuthorized=no}, author = {Baras,John S and Ball,Mike and Karne,Ramesh K and Kelley,Steve and Jang,Kap D and Plaisant, Catherine and Roussopoulos, Nick and Stathatos,Kostas and Vakhutinsky,Andrew and Jaibharat,Valluri and Whitefield,David} } @conference {16203, title = {LifeLines: visualizing personal histories}, booktitle = {Proceedings of the SIGCHI conference on Human factors in computing systems: common ground}, series = {CHI {\textquoteright}96}, year = {1996}, month = {1996///}, pages = {221 - 227}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, keywords = {History, justice, medical record, overview, personal record, screen design, screen management, timeline, Visualization}, isbn = {0-89791-777-4}, doi = {10.1145/238386.238493}, url = {http://doi.acm.org/10.1145/238386.238493}, author = {Plaisant, Catherine and Milash,Brett and Rose,Anne and Widoff,Seth and Shneiderman, Ben} } @conference {13924, title = {Local tools: an alternative to tool palettes}, booktitle = {Proceedings of the 9th annual ACM symposium on User interface software and technology}, year = {1996}, month = {1996///}, pages = {169 - 170}, author = {Bederson, Benjamin B. and Hollan,J.D. and Druin, Allison and Stewart,J. and Rogers,D. and Proft,D.} } @article {12785, title = {Modeling and verifying distributed systems using priorities: A case study}, journal = {Software - Concepts and Tools}, volume = {17}, year = {1996}, month = {1996///}, pages = {50 - 62}, author = {Cleaveland, Rance and Natarajan,V. and Sims,S. and Luettgen,G.} } @conference {12835, title = {The NCSU concurrency workbench}, booktitle = {Computer Aided Verification}, year = {1996}, month = {1996///}, pages = {394 - 397}, author = {Cleaveland, Rance and Sims,S.} } @conference {17959, title = {Optimizing triangle strips for fast rendering}, booktitle = {Visualization {\textquoteright}96. Proceedings.}, year = {1996}, month = {1996/11/27/1}, pages = {319 - 326}, abstract = {Almost all scientific visualization involving surfaces is currently done via triangles. The speed at which such triangulated surfaces can be displayed is crucial to interactive visualization and is bounded by the rate at which triangulated data can be sent to the graphics subsystem for rendering. Partitioning polygonal models into triangle strips can significantly reduce rendering times over transmitting each triangle individually. We present new and efficient algorithms for constructing triangle strips from partially triangulated models, and experimental results showing these strips are on average 15\% better than those from previous codes. Further, we study the impact of larger buffer sizes and various queuing disciplines on the effectiveness of triangle strips.}, keywords = {buffer, data;triangulated, disciplines;rendering, model, models;polygonal, optimisation;triangulated, partitioning;queuing, rendering;graphics, sizes;fast, strip, subsystem;interactive, surfaces;data, times;scientific, triangulated, visualisation;, visualization;partially, visualization;triangle}, doi = {10.1109/VISUAL.1996.568125}, author = {Evans,F. and Skiena,S. and Varshney, Amitabh} } @article {14568, title = {Positional sequencing by hybridization}, journal = {Computer applications in the biosciences : CABIOS}, volume = {12}, year = {1996}, month = {1996/02/01/}, pages = {19 - 24}, abstract = {Sequencing by hybridization (SBH) is a promising alternative to the classical DNA sequencing approaches. However, the resolving power of SBH is rather low: with 64kb sequencing chips, unknown DNA fragments only as long as 200 bp can be reconstructed in a single SBH experiment. To improve the resolving power of SBH, positional SBH (PSBH) has recently been suggested; this allows (with additional experimental work) approximate positions of every l-tuple in a target DNA fragment to be measured. We study the positional Eulerian path problem motivated by PSBH. The input to the positional eulerian path problem is an Eulerian graph G( V, E) in which every edge has an associated range of integers and the problem is to find an Eulerian path el, {\textellipsis}, e|E| in G such that the range of ei, contains i. We show that the positional Eulerian path problem is NP-complete even when the maximum out-degree (in-degree) of any vertex in the graph is 2. On a positive note we present polynomial algorithms to solve a special case of PSBH (bounded PSBH), where the range of the allowed positions for any edge is bounded by a constant (it corresponds to accurate experimental measurements of positions in PSBH). Moreover, if the positions of every l-tuple in an unknown DNA fragment of length n are measured with O(log n) error, then our algorithm runs in polynomial time. We also present an estimate of the resolving power of PSBH for a more realistic case when positions are measured with Θ(n) error.}, doi = {10.1093/bioinformatics/12.1.19}, url = {http://bioinformatics.oxfordjournals.org/content/12/1/19.abstract}, author = {Hannenhalli, Sridhar and Feldman,William and Lewis,Herbert F. and Skiena,Steven S. and Pevzner,Pavel A.} } @article {12824, title = {Priorities for modeling and verifying distributed systems}, journal = {Tools and Algorithms for the Construction and Analysis of Systems}, year = {1996}, month = {1996///}, pages = {278 - 297}, author = {Cleaveland, Rance and L\{\"u}ttgen,G. and Natarajan,V. and Sims,S.} } @conference {14249, title = {Qualitative depth and FOE information via smoothed flow}, booktitle = {Proceedings of the 20th workshop of the Austrian Association for Pattern Recognition (OAGM/AAPR) on Pattern recognition 1996}, year = {1996}, month = {1996///}, pages = {207 - 213}, publisher = {R. Oldenbourg Verlag GmbH}, organization = {R. Oldenbourg Verlag GmbH}, address = {Munich, Germany, Germany}, isbn = {3-486-23865-5}, url = {http://dl.acm.org/citation.cfm?id=258081.258100}, author = {Shulman,David and Ferm{\"u}ller, Cornelia} } @conference {17335, title = {Query previews in networked information systems}, booktitle = {Proceedings of the Third Forum on Research and Technology Advances in Digital Libraries, 1996. ADL {\textquoteright}96}, year = {1996}, month = {1996/05/13/15}, pages = {120 - 129}, publisher = {IEEE}, organization = {IEEE}, abstract = {In a networked information system (such as the NASA Earth Observing System-Data Information System (EOS-DIS)), there are three major obstacles facing users in a querying process: network performance, data volume and data complexity. In order to overcome these obstacles, we propose a two phase approach to query formulation. The two phases are the Query Preview and the Query Refinement. In the Query Preview phase, users formulate an initial query by selecting rough attribute values. The estimated number of matching data sets is shown, graphically on preview bars which allows users to rapidly focus on a manageable number of relevant data sets. Query previews also prevent wasted steps by eliminating zero hit queries. When the estimated number of data sets is long enough, the initial query is submitted to the network which returns the metadata of the data sets for further refinement in the Query Refinement phase. The two phase approach to query formulation overcomes slow network performance, and reduces the data volume and data complexity, problems. This approach is especially appropriate for users who do not have extensive knowledge about the data and who prefer an exploratory method to discover data patterns and exceptions. Using this approach, we have developed dynamic query user interfaces to allow users to formulate their queries across a networked environment}, keywords = {Computer networks, data complexity, data mining, data patterns, data volume, dynamic query user interfaces, Educational institutions, EOS-DIS, exploratory method, Information retrieval, Information services, Information systems, Intelligent networks, interactive systems, Laboratories, Manipulator dynamics, matching data sets, NASA Earth Observing System-Data Information System, Network performance, networked environment, networked information systems, query formulation, query preview, query refinement, querying process, rough attribute values, User interfaces, visual databases, zero hit queries}, isbn = {0-8186-7403-2}, doi = {10.1109/ADL.1996.502522}, author = {Donn,K. and Plaisant, Catherine and Shneiderman, Ben} } @conference {16201, title = {Query previews in networked information systems}, booktitle = {Research and Technology Advances in Digital Libraries, 1996. ADL {\textquoteright}96., Proceedings of the Third Forum on}, year = {1996}, month = {1996/05//}, pages = {120 - 129}, abstract = {In a networked information system (such as the NASA Earth Observing System-Data Information System (EOS-DIS)), there are three major obstacles facing users in a querying process: network performance, data volume and data complexity. In order to overcome these obstacles, we propose a two phase approach to query formulation. The two phases are the Query Preview and the Query Refinement. In the Query Preview phase, users formulate an initial query by selecting rough attribute values. The estimated number of matching data sets is shown, graphically on preview bars which allows users to rapidly focus on a manageable number of relevant data sets. Query previews also prevent wasted steps by eliminating zero hit queries. When the estimated number of data sets is long enough, the initial query is submitted to the network which returns the metadata of the data sets for further refinement in the Query Refinement phase. The two phase approach to query formulation overcomes slow network performance, and reduces the data volume and data complexity, problems. This approach is especially appropriate for users who do not have extensive knowledge about the data and who prefer an exploratory method to discover data patterns and exceptions. Using this approach, we have developed dynamic query user interfaces to allow users to formulate their queries across a networked environment}, keywords = {attribute, complexity;data, data, Earth, environment;networked, EOS-DIS;NASA, formulation;querying, formulation;user, hit, information, interfaces;, interfaces;exploratory, method;matching, networks;information, Observing, patterns;data, performance;networked, Preview;Query, process;rough, queries;computer, query, refinement;data, retrieval;information, services;interactive, sets;network, System-Data, System;Query, systems;query, user, values;zero, volume;dynamic}, doi = {10.1109/ADL.1996.502522}, author = {Donn,K. and Plaisant, Catherine and Shneiderman, Ben} } @article {17732, title = {Rounding errors in solving block Hessenberg systems}, journal = {Mathematics of Computation}, volume = {65}, year = {1996}, month = {1996/01//}, pages = {115 - 135}, abstract = {A rounding error analysis is presented for a divide-and-conquer algorithm to solve linear systems with block Hessenberg matrices. Conditions are derived under which the algorithm computes a stable solution. The algorithm is shown to be stable for block diagonally dominant matrices and for M-matrices.}, keywords = {block diagonally dominant matrices, block Hessenberg matrices, Linear systems, M-matrices, rounding error analysis}, isbn = {0025-5718}, doi = {10.1090/S0025-5718-96-00667-9}, url = {http://dx.doi.org/10.1090/S0025-5718-96-00667-9}, author = {Von Matt,Urs and Stewart, G.W.} } @conference {17872, title = {Runtime coupling of data-parallel programs}, booktitle = {Proceedings of the 10th international conference on Supercomputing}, year = {1996}, month = {1996///}, pages = {229 - 236}, author = {Ranganathan,M. and Acharya, A. and Edjlali,G. and Sussman, Alan and Saltz, J.} } @conference {17371, title = {Social impact statements: engaging public participation in information technology design}, booktitle = {Proceedings of the symposium on Computers and the quality of life}, series = {CQL {\textquoteright}96}, year = {1996}, month = {1996///}, pages = {90 - 96}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, isbn = {0-89791-827-4}, doi = {10.1145/238339.238378}, url = {http://doi.acm.org/10.1145/238339.238378}, author = {Shneiderman, Ben and Rose,Anne} } @inbook {18680, title = {On stratified sampling for high coverage estimations}, booktitle = {Dependable Computing {\textemdash} EDCC-2}, series = {Lecture Notes in Computer Science}, volume = {1150}, year = {1996}, month = {1996///}, pages = {35 - 54}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {This paper addresses the problem of estimating the coverage of a fault tolerance mechanism through statistical processing of observations collected in faultinjection experiments. In an earlier paper, several techniques for sampling the fault/activity input space of a fault tolerance mechanism were presented. Various estimators based on simple sampling in the whole space and stratified sampling in a partitioned space were studied; confidence limits were derived based on a normal approximation. In this paper, the validity of this approximation is analyzed, especially for high coverage systems. The theory of confidence regions is then introduced to estimate the coverage without approximation when, for practical reasons, stratification is used. Three statistics are considered for defining confidence regions. It is shown that one of these statistics {\textemdash} a vectorial statistic {\textemdash} is often more conservative than the other two. However, only the vectorial statistic is computationally tractable. The results obtained are compared with those based on approximation by means of three hypothetical example systems.}, keywords = {Computer science}, isbn = {978-3-540-61772-3}, url = {http://www.springerlink.com/content/7t2w2u472601h730/abstract/}, author = {Powell,David and Michel Cukier and Arlat,Jean}, editor = {Hlawiczka,Andrzej and Silva,Jo{\~a}o and Simoncini,Luca} } @conference {17897, title = {Stripe: a software tool for efficient triangle strips}, booktitle = {ACM SIGGRAPH 96 Visual Proceedings: The art and interdisciplinary programs of SIGGRAPH {\textquoteright}96}, series = {SIGGRAPH {\textquoteright}96}, year = {1996}, month = {1996///}, pages = {153{\textendash} - 153{\textendash}}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, isbn = {0-89791-784-7}, doi = {10.1145/253607.253894}, url = {http://doi.acm.org/10.1145/253607.253894}, author = {Evans,Francine and Skiena,Steven and Varshney, Amitabh} } @article {17429, title = {Tools for creating and exploiting content}, journal = {Getty Art History Information Program (1996) Research Agenda for Networked Cultural Heritage, Santa Monica. CA: Getty AHIP}, year = {1996}, month = {1996///}, pages = {27 - 30}, author = {Kolker,R. and Shneiderman, Ben} } @article {16349, title = {Transitive closure of infinite graphs and its applications}, journal = {Languages and Compilers for Parallel Computing}, year = {1996}, month = {1996///}, pages = {126 - 140}, author = {Kelly,W. and Pugh, William and Rosser,E. and Shpeisman,T.} } @conference {14796, title = {Tuning the performance of I/O-intensive parallel applications}, booktitle = {Proceedings of the fourth workshop on I/O in parallel and distributed systems: part of the federated computing research conference}, year = {1996}, month = {1996///}, pages = {15 - 27}, author = {Acharya, A. and Uysal, M. and Bennett, R. and Mendelson, A. and Beynon, M. and Hollingsworth, Jeffrey K and Saltz, J. and Sussman, Alan} } @conference {16204, title = {User controlled overviews of an image library: a case study of the visible human}, booktitle = {Proceedings of the first ACM international conference on Digital libraries}, series = {DL {\textquoteright}96}, year = {1996}, month = {1996///}, pages = {74 - 82}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, keywords = {Browsing, digital library, image database, information exploration, Information retrieval, Internet, medical image, remote access, user interface, Visualization, World-wide web}, isbn = {0-89791-830-4}, doi = {10.1145/226931.226946}, url = {http://doi.acm.org/10.1145/226931.226946}, author = {North,Chris and Shneiderman, Ben and Plaisant, Catherine} } @conference {17490, title = {Visual metaphor and the problem of complexity in the design of Web sites: techniques for generating, recognizing and visualizing structure}, booktitle = {Proceedings of the the seventh ACM conference on Hypertext}, series = {HYPERTEXT {\textquoteright}96}, year = {1996}, month = {1996///}, pages = {257{\textendash} - 257{\textendash}}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, isbn = {0-89791-778-2}, doi = {10.1145/234828.234854}, url = {http://doi.acm.org/10.1145/234828.234854}, author = {Joyce,Michael and Kolker,Robert and Moulthrop,Stuart and Shneiderman, Ben and Unsworth,John Merritt} } @conference {16211, title = {An applied ethnographic method for redesigning user interfaces}, booktitle = {Proceedings of the 1st conference on Designing interactive systems: processes, practices, methods, \& techniques}, series = {DIS {\textquoteright}95}, year = {1995}, month = {1995///}, pages = {115 - 122}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, isbn = {0-89791-673-5}, doi = {10.1145/225434.225447}, url = {http://doi.acm.org/10.1145/225434.225447}, author = {Rose,Anne and Shneiderman, Ben and Plaisant, Catherine} } @article {14073, title = {cDNA expressed sequence tags of Trypanosoma brucei rhodesiense provide new insights into the biology of the parasite}, journal = {Molecular and Biochemical Parasitology}, volume = {73}, year = {1995}, month = {1995/07//}, pages = {75 - 90}, abstract = {A total of 518 expressed sequence tags (ESTs) have been generated from clones randomly selected from a cDNA library and a spliced leader sub-library of a Trypanosoma brucei rhodesiense bloodstream clone. 205 (39\%) of the clones were identified based on matches to 113 unique genes in the public databases. Of these, 71 cDNAs display significant similarities to genes in unrelated organisms encoding metabolic enzymes, signal transduction proteins, transcription factors, ribosomal proteins, histones, a proliferation-associated protein and thimet oligopeptidase, among others. 313 of the cDNAs are not related to any other sequences in the databases. These cDNA ESTs provide new avenues of research for exploring both the novel trypanosome-specific genes and the genome organization of this parasite, as well as a resource for identifying trypanosome homologs to genes expressed in other organisms.}, keywords = {cDNA, Expressed sequence tag, Trypanosoma brucei rhodesiense}, isbn = {0166-6851}, doi = {16/0166-6851(95)00098-L}, url = {http://www.sciencedirect.com/science/article/pii/016668519500098L}, author = {El-Sayed, Najib M. and Alarcon,Clara M. and Beck,John C. and Sheffield,Val C. and Donelson,John E.} } @article {14406, title = {The COLLAGE/KHOROS link: Planning for image processing tasks}, journal = {Integrated Planning Applications}, year = {1995}, month = {1995///}, pages = {67 - 76}, author = {Lansky,A. and Friedman,M. and Getoor, Lise and Schmidler,S. and Short Jr,N.} } @article {15538, title = {Combining databases with prioritized information}, journal = {Journal of Intelligent Information Systems}, volume = {4}, year = {1995}, month = {1995///}, pages = {231 - 260}, abstract = {To solve a problem one may need to combine the knowledge of several different experts. It can happen that some of the claims of one or more experts may be in conflict with the claims of other experts. There may be several such points of conflict and any claim may be involved in several different such points of conflict. In that case, the user of the knowledge of experts may prefer a certain claim to another in one conflict-point without necessarily preferring that statement in another conflict-point.Our work constructs a framework within which the consequences of a set of such preferences (expressed as priorities among sets of statements) can be computed. We give four types of semantics for priorities, three of which are shown to be equivalent to one another. The fourth type of semantics for priorities is shown to be more cautious than the other three. In terms of these semantics for priorities, we give a function for combining knowledge from different sources such that the combined knowledge is conflict-free and satisfies all the priorities. }, doi = {10.1007/BF00961654}, author = {Pradhan,S. and Minker, Jack and V.S. Subrahmanian} } @article {17026, title = {Comprehensible, Predictable, and Controllable User Interfaces}, journal = {AMERICAN PROGRAMMER}, volume = {8}, year = {1995}, month = {1995///}, pages = {2 - 2}, author = {Shneiderman, Ben} } @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} } @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 {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 {13762, title = {Efficient parsing for Korean and English: A parameterized message-passing approach}, journal = {Computational Linguistics}, volume = {21}, year = {1995}, month = {1995///}, pages = {255 - 263}, author = {Dorr, Bonnie J and Lee,J. and Lin,D. and Suh,S.} } @conference {15649, title = {Euclidean spanners: short, thin, and lanky}, booktitle = {Proceedings of the twenty-seventh annual ACM symposium on Theory of computing}, series = {STOC {\textquoteright}95}, year = {1995}, month = {1995///}, pages = {489 - 498}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, isbn = {0-89791-718-9}, doi = {10.1145/225058.225191}, url = {http://doi.acm.org/10.1145/225058.225191}, author = {Arya,Sunil and Das,Gautam and Mount, Dave and Salowe,Jeffrey S. and Smid,Michiel} } @article {17142, title = {Evaluating Spatial and Textual Style of Displays}, journal = {Institute for Systems Research Technical Reports}, year = {1995}, month = {1995///}, abstract = {The next generation of Graphic User Interfaces (GUIs) will offer rapid access to perceptually-rich, information abundant, and cognitively consistent interfaces. These new GUIs will be subjected to usability tests and expert reviews, plus new analysis methods and novel metrics to help guide designers. We have developed and tested first generation concordance tools to help developers to review terminology, capitalization, and abbreviation. We have also developed a dialog box summary table to help developers spot patterns and identify possible inconsistencies in layout, color fonts, font size, font style, and ordering of widgets. In this study we also explored the use of metrics such as widget counts, balance, alignment, density, and aspect ratios to provide further clues about where redesigns might be appropriate. Preliminary experience with several commercial projects is encouraging.}, keywords = {human-computer interaction, Systems Integration Methodology}, url = {http://drum.lib.umd.edu/handle/1903/5639}, author = {Shneiderman, Ben and Chimera,Richard and Jog,Ninog and Stimart,Ren and White,David} } @article {16922, title = {A Family of User Interface Consistency Checking Tools}, journal = {Institute for Systems Research Technical Reports}, year = {1995}, month = {1995///}, abstract = {Incorporating evaluation metrics with GUI development tools will help designers create consistent interfaces in the future. Complexity in design of interfaces makes efficient evaluation impossible by a single consistency checking evaluation tool. Our focus is on developing a family of evaluation tools in order to make the evaluation process less cumbersome. We have developed a dialog box typeface and color table to facilitate detection of anomalies in color, font, font size, and font style. Concordance tools have been developed to spot variant capitalization and abbreviations globally in the interface and specifically in the button widgets. As buttons are frequently used widgets, a button layout table has been created to spot any inconsistencies in height, width and relative position between a given group of buttons if present. Finally, a terminology basket tool has been created to identify unwanted synonyms of computer related terms used in the interface which may be misleading to the end user.}, keywords = {automated metrics, concordance tools, consistency checking tools, Human-computer interaction, spatial, Systems Integration Methodology, textual evaluation tools, user interface}, url = {http://drum.lib.umd.edu/handle/1903/5640}, author = {Mahajan,Rohit and Shneiderman, Ben} } @article {16923, title = {A Family of User Interface Consistency Checking Tools: Design and Development of SHERLOCK}, journal = {Proceedings of the Twentieth Annual Software Engineering Workshop}, year = {1995}, month = {1995///}, abstract = {Incorporating evaluation metrics with GUI development tools will help designers create consistent interfaces in the future. Complexity in design of interfaces makes efficient evaluation infeasible by a single consistency checking evaluation tool. Our focus is on developing a family of consistency checking tools to evaluate spatial layout and terminology in user interfaces and make the evaluation process less cumbersome. We have Created a dialog box summary table to provide a compact overview of spatial and visual properties of dozens or hundreds of dialog boxes of the interface. Interface concordance tool has been developed to spot variant capitalization and abbreviations in interface terminology. As buttons are most frequent used widgets, a button concordance tool and a button layout table has been constructed. Button concordance identifies variant capitalization, distinct typefaces, distinct background colors and variant sizes in buttons. Button layout table spots any inconsistencies in height, width and relative position between a given group of buttons. A spell checking tools which detects spelling errors in interface terms has also been included in the tool set. Finally, a terminology basket tool has been created to identify unwanted synonyms of computer related terms used in the interface. These tools are integrated together as SHERLOCK, a family of six consistency checking tools to expedite the evaluation process and provide feedback to the designers plus aid Usability Testing.}, author = {Mahajan,R. and Shneiderman, Ben} } @article {12825, title = {A front-end generator for verification tools}, journal = {Tools and Algorithms for the Construction and Analysis of Systems}, year = {1995}, month = {1995///}, pages = {153 - 173}, author = {Cleaveland, Rance and Madelaine,E. and Sims,S.} } @article {17701, title = {Gauss, Statistics, and Gaussian Elimination}, journal = {Journal of Computational and Graphical Statistics}, volume = {4}, year = {1995}, month = {1995/03/01/}, pages = {1 - 11}, abstract = {Gaussian elimination is the algorithm of choice for the solution of dense linear systems of equations. However, Gauss himself originally introduced his elimination procedure as a way of determining the precision of least squares estimates and only later described the computational algorithm. This article tells the story of Gauss, his algorithm, and its relation to his probabilistic development of least squares.}, isbn = {1061-8600}, doi = {10.2307/1390624}, url = {http://www.jstor.org/stable/1390624}, author = {Stewart, G.W.} } @article {17711, title = {On graded QR decompositions of products of matrices}, journal = {Electronic Transactions on Numerical Analysis}, volume = {3}, year = {1995}, month = {1995///}, pages = {39 - 49}, abstract = {This paper is concerned with the singular values and vectors of a product Mm =A1A2 ... Am of matrices of order n. The chief difficulty with computing them directly from Mm is that with increasing m the ratio of the small to the large singular values of Mm may fall below the rounding unit, so that the former are computed inaccurately. The solution proposed here is to compute recursively the factorization Mm = QRPT, where Q is orthogonal, R is a graded upper triangular, and PT is a permutation. }, author = {Stewart, G.W.} } @article {17204, title = {HUMAN VALUE AND THE FUTURE OF TECHNOLOGY}, journal = {Human factors in information systems: emerging theoretical bases}, year = {1995}, month = {1995///}, pages = {355 - 355}, author = {Shneiderman, Ben} } @book {17211, title = {Human-Computer Interaction Laboratory 1995 Video Reports}, year = {1995}, month = {1995///}, publisher = {University of Maryland at College Park, Human/Computer Interaction Laboratory}, organization = {University of Maryland at College Park, Human/Computer Interaction Laboratory}, author = {Plaisant, Catherine and Morrison,S. and Skokowski,C. and Reesch,J. and Shneiderman, Ben and Laboratory,University of Maryland at College Park. Human/Computer Interaction and Channel,F.} } @article {17222, title = {Image-browser taxonomy and guidelines for designers}, journal = {IEEE Software}, volume = {12}, year = {1995}, month = {1995/03//}, pages = {21 - 32}, abstract = {In many applications users must browse large images. Most designers merely use two one-dimensional scroll bars or ad hoc designs for two-dimensional scroll bars. However, the complexity of two-dimensional browsing suggests that more careful analysis, design, and evaluation might lead to significant improvements. Our exploration of existing 2D browsers has led us to identify many features and a wide variety of tasks performed with the browsers. We introduce an informal specification technique to describe 2D browsers and a task taxonomy, suggest design features and guidelines, and assess existing strategies. We focus on the tools to explore a selected image and so do not cover techniques to browse a series of images or to browse large-image databases}, keywords = {analysis, Computer Graphics, design, designer guidelines, Equations, Europe, Evaluation, Formal specifications, Graphical user interfaces, Guidelines, IMAGE PROCESSING, image-browser taxonomy, informal specification technique, Laboratories, large image browsing, Layout, Road transportation, selected image exploration, SHAPE, Software design, task taxonomy, Taxonomy, tools, two-dimensional browsing, user interface management systems, visual databases}, isbn = {0740-7459}, doi = {10.1109/52.368260}, author = {Plaisant, Catherine and Carr,D. and Shneiderman, Ben} } @article {17605, title = {Improved approximation guarantees for packing and covering integer programs}, year = {1995}, month = {1995/09//}, abstract = {Several important NP-hard combinatorial optimization problems canbe posed as packing/covering integer programs; the randomized rounding technique of Raghavan \& Thompson is a powerful tool to approximate them well. We present one elementary unifying property of all these in- teger programs (IPs), and use the FKG correlation inequality to derive an improved analysis of randomized rounding on them. This also yields a pessimistic estimator, thus presenting deterministic polynomial-time algo- rithms for them with approximation guarantees signi cantly better than those known. }, author = {Srinivasan, Aravind} } @conference {17608, title = {Improved approximations of packing and covering problems}, booktitle = {Proceedings of the twenty-seventh annual ACM symposium on Theory of computing}, series = {STOC {\textquoteright}95}, year = {1995}, month = {1995///}, pages = {268 - 276}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, isbn = {0-89791-718-9}, doi = {10.1145/225058.225138}, url = {http://doi.acm.org/10.1145/225058.225138}, author = {Srinivasan, Aravind} } @article {17416, title = {The info superhighway: for the people}, journal = {Communications of the ACM}, volume = {38}, year = {1995}, month = {1995/01//}, pages = {162{\textendash} - 162{\textendash}}, abstract = {The opportunities are attractive, but some pavers of the Information Superhighway (ISH) are too eager to pour concrete. They risk making rough roads that will alienate the very users they seek. These technologically oriented ISH devotees may be building dramatic overpasses and painting stripes without figuring out where the highway should be going. I believe greater attention should be paid to identifying appropriate services, designing a consistent user interface, and developing a clearer model of the diverse user communities.}, isbn = {0001-0782}, doi = {10.1145/204865.204898}, url = {http://doi.acm.org/10.1145/204865.204898}, author = {Shneiderman, Ben} } @article {17839, title = {An integrated runtime and compile-time approach for parallelizing structured and block structured applications}, journal = {IEEE Transactions on Parallel and Distributed Systems}, volume = {6}, year = {1995}, month = {1995/07//}, pages = {747 - 754}, abstract = {In compiling applications for distributed memory machines, runtime analysis is required when data to be communicated cannot be determined at compile-time. One such class of applications requiring runtime analysis is block structured codes. These codes employ multiple structured meshes, which may be nested (for multigrid codes) and/or irregularly coupled (called multiblock or irregularly coupled regular mesh problems). In this paper, we present runtime and compile-time analysis for compiling such applications on distributed memory parallel machines in an efficient and machine-independent fashion. We have designed and implemented a runtime library which supports the runtime analysis required. The library is currently implemented on several different systems. We have also developed compiler analysis for determining data access patterns at compile time and inserting calls to the appropriate runtime routines. Our methods can be used by compilers for HPF-like parallel programming languages in compiling codes in which data distribution, loop bounds and/or strides are unknown at compile-time. To demonstrate the efficacy of our approach, we have implemented our compiler analysis in the Fortran 90D/HPF compiler developed at Syracuse University. We have experimented with a multi-bloc Navier-Stokes solver template and a multigrid code. Our experimental results show that our primitives have low runtime communication overheads and the compiler parallelized codes perform within 20\% of the codes parallelized by manually inserting calls to the runtime library}, keywords = {Bandwidth, block structured applications, block structured codes, compile-time approach, compiling applications, data access patterns, Data analysis, Delay, distributed memory machines, distributed memory systems, FORTRAN, Fortran 90D/HPF compiler, High performance computing, HPF-like parallel programming languages, integrated runtime approach, irregularly coupled regular mesh problems, multigrid code, Navier-Stokes solver template, Parallel machines, parallel programming, Pattern analysis, performance evaluation, program compilers, Program processors, Runtime library, Uninterruptible power systems}, isbn = {1045-9219}, doi = {10.1109/71.395403}, author = {Agrawal,G. and Sussman, Alan and Saltz, J.} } @inbook {17241, title = {Interacting with computers}, booktitle = {Human-computer interactionHuman-computer interaction}, year = {1995}, month = {1995///}, pages = {399 - 400}, publisher = {Morgan Kaufmann Publishers Inc.}, organization = {Morgan Kaufmann Publishers Inc.}, address = {San Francisco}, isbn = {1-55860-246-1}, author = {Shneiderman, Ben} } @article {17688, title = {An Iterative Method for Solving Linear Inequalities}, volume = {CS-TR-1833}, year = {1995}, month = {1995/02/06/}, institution = {Department of Computer Science, University of Maryland, College Park}, abstract = {This paper describes and analyzes a method for finding nontrivialsolutions of the inequality $Ax \geq 0$, where $A$ is an $m \times n$ matrix of rank $n$. The method is based on the observation that a certain function $f$ has a unique minimum if and only if the inequality {\it fails to have} a nontrivial solution. Moreover, if there is a solution, an attempt to minimize $f$ will produce a sequence that will diverge in a direction that converges to a solution of the inequality. The technique can also be used to solve inhomogeneous inequalities and hence linear programming problems, although no claims are made about competitiveness with existing methods. }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/355}, author = {Stewart, G.W.} } @conference {14981, title = {Land cover dynamics investigation using parallel computers}, booktitle = {Geoscience and Remote Sensing Symposium, 1995. IGARSS {\textquoteright}95. {\textquoteright}Quantitative Remote Sensing for Science and Applications{\textquoteright}, International}, volume = {1}, year = {1995}, month = {1995//10/14}, pages = {332 -334 vol.1 - 332 -334 vol.1}, abstract = {A comprehensive and highly interdisciplinary research program is being carried out to investigate global land cover dynamics in heterogeneous parallel computing environments. Some of the problems are addressed including atmospheric correction, mixture modeling, image classifications by Markovian random fields and by segmentation, global image/map databases, object oriented parallel programming and parallel/IO. During the initial two years project, significant progress has been made in all of these areas}, keywords = {; geographic information system; geophysical measurement technique; geophysics computing; image classification; image map database; image segmentation; land cover dynamics; land surface; mixture modeling; object oriented programming; optical imaging; para, GIS; IR imaging; Markovian random fields; atmospheric correction}, doi = {10.1109/IGARSS.1995.520273}, author = {Liang, S. and Davis, Larry S. and Townshend,J. and Chellapa, Rama and DeFries, R. and Dubayah, R. and Goward,S. and JaJa, Joseph F. and Krishnamachar, S. and Roussopoulos, Nick and Saltz, J. and Samet, Hanan and Shock,T. and Srinivasan, M.} } @article {13814, title = {Lexical allocation in interlingua-based machine translation of spatial expressions}, journal = {Working Notes for IJCAI-95 Workshop on the Representation and Processing of Spatial Expressions, Montreal, Canada}, year = {1995}, month = {1995///}, abstract = {Given a spatial expression, or its computationalsemantic form, how is the expression{\textquoteright}s spatial semantics to be allocated lexically, i.e., among entries in the lexicon? In interlingua-based ma- chine translation (MT) research, lexical alloca- tion is the problem of allocating or subdividing a linguistic expression{\textquoteright}s full interlingual (IL) structure into the substructures that are lexical IL forms, i.e., in the lexicon. Here we present our work developing IL forms and an IL lexicon for translating English spatial expressions into Turkish. We examine several co-occurrence patterns between motion verbs (spatial place- ment and displacement) and directional adpo- sitions (particles in English, postpositions in Turkish) and the lexical allocation of spatial vectors in these patterns }, author = {Voss,C.R. and Dorr, Bonnie J and Sencan,M.U.} } @article {17666, title = {The local nature of Δ-coloring and its algorithmic applications}, journal = {Combinatorica}, volume = {15}, year = {1995}, month = {1995///}, pages = {255 - 280}, abstract = {Given a connected graph G =( V, E ) with | V |= n and maximum degree Δ such that G is neither a complete graph nor an odd cycle, Brooks{\textquoteright} theorem states that G can be colored with Δ colors. We generalize this as follows: let G - v be Δ-colored; then, v can be colored by considering the vertices in an O (log Δ n ) radius around v and by recoloring an O (log Δ n ) length {\textquotedblleft}augmenting path{\textquotedblright} inside it. Using this, we show that Δ-coloring G is reducible in O (log 3 n /logΔ) time to (Δ+1)-vertex coloring G in a distributed model of computation. This leads to fast distributed algorithms and a linear-processor NC algorithm for Δ-coloring.}, isbn = {0209-9683}, url = {http://dx.doi.org/10.1007/BF01200759}, author = {Panconesi,Alessandro and Srinivasan, Aravind} } @conference {15599, title = {M.H.M: Euclidean spanners: short, thin, and lanky}, booktitle = {In: 27th ACM Symposium on Theory of Computing}, year = {1995}, month = {1995///}, pages = {489 - 498}, publisher = {ACM press}, organization = {ACM press}, abstract = {Euclidean spanners are important data structures in geometric algorithm design, because they provide a means of approximating the complete Euclidean graph with only O(n) edges, so that the shortest path length between each pair of points is not more than a constant factor longer than the Euclidean distance between the points. In many applications of spanners, it is important that the spanner possess a number of additional properties: low tot al edge weight, bounded degree, and low diameter. Existing research on spanners has considered one property or the other. We show that it is possible to build spanners in optimal O (n log n) time and O(n) space that achieve optimal or near optimal tradeoffs between all combinations of these *Max-Planck-Institut fiir Informatik, D-66123 Saarbrucken,}, author = {Arya,Sunil and Dast,Gautam and Mount, Dave and Salowe,Jeffrey S. and Smid,Michiel} } @article {12213, title = {A miniaturized space-variant active vision system: Cortex-I}, journal = {Machine Vision and applications}, volume = {8}, year = {1995}, month = {1995///}, pages = {101 - 109}, author = {Bederson, Benjamin B. and Wallace,R.S. and Schwartz,E.} } @article {16210, title = {Next generation network management technology}, journal = {AIP Conference Proceedings}, volume = {325}, year = {1995}, month = {1995/01/25/}, pages = {75 - 82}, abstract = {Today{\textquoteright}s telecommunications networks are becoming increasingly large, complex, mission critical and heterogeneous in several dimensions. For example, the underlying physical transmission facilities of a given network may be {\textquoteleft}{\textquoteleft}mixed media{\textquoteright}{\textquoteright} (copper, fiber-optic, radio, and satellite); the subnetworks may be acquired from different vendors due to economic, performance, or general availability reasons; the information being transmitted over the network may be {\textquoteleft}{\textquoteleft}multimedia{\textquoteright}{\textquoteright} (video, data, voice, and images) and, finally, varying performance criteria may be imposed e.g., data transfer may require high throughput while the others, whose concern is voice communications, may require low call blocking probability. For these reasons, future telecommunications networks are expected to be highly complex in their services and operations. Due to this growing complexity and the disparity among management systems for individual sub-networks, efficient network management systems have become critical to the current and future success of telecommunications companies. This paper addresses a research and development effort which focuses on prototyping configuration management, since that is the central process of network management and all other network management functions must be built upon it. Our prototype incorporates ergonomically designed graphical user interfaces tailored to the network configuration management subsystem and to the proposed advanced object-oriented database structure. The resulting design concept follows open standards such as Open Systems Interconnection (OSI) and incorporates object oriented programming methodology to associate data with functions, permit customization, and provide an open architecture environment. {\textcopyright} 1995 American Institute of Physics}, isbn = {0094243X}, doi = {doi:10.1063/1.47255}, url = {http://proceedings.aip.org/resource/2/apcpcs/325/1/75_1?isAuthorized=no}, author = {Baras,John S and Atallah,George C and Ball,Mike and Goli,Shravan and Karne,Ramesh K and Kelley,Steve and Kumar,Harsha and Plaisant, Catherine and Roussopoulos, Nick and Schneiderman,Ben and Srinivasarao,Mulugu and Stathatos,Kosta and Teittinen,Marko and Whitefield,David} } @conference {17316, title = {Organization overviews and role management: inspiration for future desktop environments}, booktitle = {Proceedings of the Fourth Workshop on Enabling Technologies: Infrastructure for Collaborative Enterprises, 1995}, year = {1995}, month = {1995/04/20/22}, pages = {14 - 22}, publisher = {IEEE}, organization = {IEEE}, abstract = {In our exploration of future work environments for the World Bank we proposed two concepts. First, organization overviews provide a consistent support to present the results of a variety of manual or semi-automated searches. Second this view can be adapted or expanded for each class of users to finally map the multiple personal roles an individual has in an organization. After command line interfaces, graphical user interfaces, and the current {\textquotedblleft}docu-centric{\textquotedblright} designs, a natural direction is towards a role-centered approach where we believe the emphasis is on the management of those multiple roles. Large visual overviews of the organization can be rapidly manipulated and zoomed in on to reveal the multiple roles each individual plays. Each role involves coordination with groups of people and accomplishment of tasks within a schedule}, keywords = {Asia, bank data processing, Databases, Environmental economics, Environmental management, future desktop environments, Graphical user interfaces, human resource management, management information systems, Management training, multiple personal roles, office automation, organization overviews, personnel, Project management, Prototypes, role management, role-centered approach, scheduling, semi-automated searches, User interfaces, Utility programs, World Bank}, isbn = {0-8186-7019-3}, doi = {10.1109/ENABL.1995.484544}, author = {Plaisant, Catherine and Shneiderman, Ben} } @article {16377, title = {Parametric dispatching of hard real-time tasks}, journal = {IEEE Transactions on ComputersIEEE Trans. Comput.}, volume = {44}, year = {1995}, month = {1995/03//}, pages = {471 - 479}, isbn = {00189340}, doi = {10.1109/12.372041}, url = {http://dl.acm.org/citation.cfm?id=626999}, author = {Gerber,R. and Pugh, William and Saksena,M.} } @article {17723, title = {On the perturbation of Schur complement in positive semidefinite matrix}, volume = {TR-95-38}, year = {1995}, month = {1995///}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {This note gives perturbation bounds for the Schur complement of apositive definite matrix in a positive semidefinite matrix. }, author = {Stewart, G.W.} } @article {16207, title = {QUERY PREVIEWS IN NETWORKED INFORMATION SYSTEMS}, journal = {Institute for Systems Research Technical Reports}, year = {1995}, month = {1995/10//}, abstract = {In a networked information system, there are three major obstacles facing users in a querying process: network performance, data volume and data complexity. In order to overcome these obstacles, we propose a two-phase approach to dynamic query formulation by volume preview. The two phases are the Query Preview and Query Refinement. In the Query Preview phase, users formulate an initial query by selecting desired attribute values. The volume of matching data sets is shown graphically on preview bars which aid users to rapidly eliminate undesired data sets, and focus on a manageable number of relevant data sets. Query previews also prevent wasted steps by eliminating zero-hit queries. When the estimated number of data sets is low enough, the initial query is submitted to the network, which returns the metadata of the data sets for further refinement in the Query Refinement phase. The two-phase approach to query formulation overcomes slow network performance, and reduces the data volume and data complexity problems. This approach is especially appropriate for users who prefer the exploratory method to discover data patterns and exceptions during the query formulation process. Using this approach, we have developed dynamic query user interfaces to allow users to formulate their queries across a networked environment.}, author = {Doan,K. and Plaisant, Catherine and Shneiderman, Ben} } @article {17648, title = {Randomness-Optimal Unique Element Isolation with Applications to Perfect Matching and Related Problems}, journal = {SIAM Journal on Computing}, volume = {24}, year = {1995}, month = {1995///}, pages = {1036 - 1036}, abstract = {In this paper, we precisely characterize the randomness complexity of the unique element isolation problem, a crucial step in the $RNC$ algorithm for perfect matching by Mulmuley, Vazirani, and Vazirani [Combinatorica, 7 (1987), pp. 105{\textendash}113] and in several other applications. Given a set $S$ and an unknown family $\mathcal{F} \subseteq 2^{S}$ with $|\mathcal{F}| \leq Z$, we present a scheme for assigning polynomially bounded weights to the elements of $S$ using only $O(\log Z + \log |S|)$ random bits, such that the minimum weight set in $\mathcal{F}$ is unique with high probability. This generalizes the solution of Mulmuley, Vazirani, and Vazirani, who use $O(S \log S)$ bits, independent of $Z$. We also provide a matching lower bound for the randomness complexity of this problem. The new weight assignment scheme yields a randomness-efficient $RNC^{2}$ algorithm for perfect matching which uses $O(\log Z + \log n)$ random bits, where $Z$ is any given upper bound on the number of perfect matchings in the input graph. This generalizes the result of Grigoriev and Karpinski [Proc. IEEE Symposium on Foundations of computer Science, 1987, pp. 166{\textendash}172], who presentan $NC^{3}$ algorithm when $Z$ is polynomial and improves the running time in this case. The worst-case randomness complexity of our algorithm is $O(n \log (m/n))$ random bits improving on the previous bound of $O(m \log n)$. Our scheme also gives randomness-efficient solutions for several problems where unique element isolation is used, such as $RNC$ algorithms for variants of matching and basic problems on linear matroids. We obtain a randomness-efficient random reduction from SAT to USAT, the language of uniquely satisfiable formulas, which can be derandomized in the case of languages in Few $P$ to yield new proofs of the results Few $P \subseteq \oplus P$ and Few $P \subseteq C_{=} P$.}, isbn = {00975397}, doi = {10.1137/S0097539793250330}, url = {http://link.aip.org/link/SMJCAT/v24/i5/p1036/s1\&Agg=doi}, author = {Chari,Suresh and Rohatgi,Pankaj and Srinivasan, Aravind} } @article {13679, title = {The representation of document structure: A generic object-process approach}, volume = {CAR-TR-785}, year = {1995}, month = {1995///}, institution = {University of Maryland, College Park}, author = {Dori,D. and David Doermann and Shin,C. and Haralick,R. and Phillips,I. and Buchman,M. and Ross,D.} } @article {13466, title = {Representing a student{\textquoteright}s learning states and transitions}, journal = {American Association of Artificial Intelligence Spring Symposium on Representing Mental States and Mechanisms}, year = {1995}, month = {1995///}, abstract = {We describe an ongoing project to develop an adaptive training system (ATS) that dynamically models a student{\textquoteright}s learning processes and can provide specialized tutoring adapted to a student{\textquoteright}s knowledge state and learning style. The student modeling component of the ATS, ML-Modeler, uses machine learning (ML) techniques to emulate the student{\textquoteright}s novice-toexpert transition. ML-Modeler infers which learning methods the student has used to reach the current knowledge state by comparing the student{\textquoteright}s solution trace to an expert solution and generating plausible hypotheses about what misconceptions and errors the student has made. A case-based approach is used to generate hypotheses through incorrectly applying analogy, overgeneralization, and overspecialization. The student and expert models use a network-based representation that includes abstract concepts and relationships as well as strategies for problem solving. Fuzzy methods are used to represent the uncertainty in the student model. This paper describes the design of the ATS and ML-Modeler, and gives a detailed example of how the system would model and tutor the student in a typical session. The domain we use for this example is high-school level chemistry.}, author = {Gurer,D. and desJardins, Marie and Schlager,M.} } @article {17726, title = {On the solution of block Hessenberg systems}, journal = {Numerical Linear Algebra with Applications}, volume = {2}, year = {1995}, month = {1995/05/01/}, pages = {287 - 296}, abstract = {This paper describes a divide-and-conquer strategy for solving block Hessenberg systems. For dense matrices the method is as efficient as Gaussian elimination; however, because it works almost entirely with the original blocks, it is much more efficient for sparse matrices or matrices whose blocks can be generated on the fly. For Toeplitz matrices, the algorithm can be combined with the fast Fourier transform.}, keywords = {block Hessenberg matrix, Block Toeplitz matrix, linear system, queue}, isbn = {1099-1506}, doi = {10.1002/nla.1680020309}, url = {http://onlinelibrary.wiley.com/doi/10.1002/nla.1680020309/abstract}, author = {Stewart, G.W.} } @conference {17660, title = {Splitters and near-optimal derandomization}, booktitle = {, 36th Annual Symposium on Foundations of Computer Science, 1995. Proceedings}, year = {1995}, month = {1995/10/23/25}, pages = {182 - 191}, publisher = {IEEE}, organization = {IEEE}, abstract = {We present a fairly general method for finding deterministic constructions obeying what we call k-restrictions; this yields structures of size not much larger than the probabilistic bound. The structures constructed by our method include (n,k)-universal sets (a collection of binary vectors of length n such that for any subset of size k of the indices, all 2k configurations appear) and families of perfect hash functions. The near-optimal constructions of these objects imply the very efficient derandomization of algorithms in learning, of fixed-subgraph finding algorithms, and of near optimal ΣIIΣ threshold formulae. In addition, they derandomize the reduction showing the hardness of approximation of set cover. They also yield deterministic constructions for a local-coloring protocol, and for exhaustive testing of circuits}, keywords = {Boosting, Circuit testing, computational complexity, computational linguistics, Computer science, Contracts, derandomization, deterministic constructions, Educational institutions, Engineering profession, exhaustive testing, fairly general method, fixed-subgraph finding algorithms, hardness of approximation, Information systems, k-restrictions, learning, local-coloring protocol, MATHEMATICS, near-optimal constructions, near-optimal derandomization, Parallel algorithms, probabilistic bound, probability, Protocols, randomised algorithms, Set cover, splitters}, isbn = {0-8186-7183-1}, doi = {10.1109/SFCS.1995.492475}, author = {Naor,M. and Schulman,L. J and Srinivasan, Aravind} } @article {17727, title = {On the stability of sequential updates and downdates}, journal = {Signal Processing, IEEE Transactions on}, volume = {43}, year = {1995}, month = {1995/11//}, pages = {2642 - 2648}, abstract = {The updating and downdating of Cholesky decompositions has important applications in a number of areas. There is essentially one standard updating algorithm, based on plane rotations, which is backward stable. Three downdating algorithms have been treated in the literature: the LINPACK algorithm, the method of hyperbolic transformations, and Chambers{\textquoteright} (1971) algorithm. Although none of these algorithms is backward stable, the first and third satisfy a relational stability condition. It is shown that relational stability extends to a sequence of updates and downdates. In consequence, other things being equal, if the final decomposition in the sequence is well conditioned, it will be accurately computed, even though intermediate decompositions may be almost completely inaccurate. These results are also applied to the two-sided orthogonal decompositions, such as the URV decomposition}, keywords = {algorithm;Cholesky, algorithm;downdating, algorithm;error, algorithm;URV, algorithms;hyperbolic, analysis;matrix, analysis;sequential, Chambers{\textquoteright}, condition;rounding, decomposition;backward, decomposition;numerical, decomposition;plane, decompositions;LINPACK, decompositions;updating, downdates;sequential, error, errors;sequences;, orthogonal, rotations;relational, stability, stability;roundoff, stable, transformations;matrix, updates;stability;two-sided}, isbn = {1053-587X}, doi = {10.1109/78.482114}, author = {Stewart, G.W.} } @article {17380, title = {Starfield information visualization with interactive smooth zooming}, journal = {Proc. IFIP 2.6 Visual Databases Systems}, year = {1995}, month = {1995///}, pages = {3 - 14}, abstract = {This paper discusses the design and implementation of interactive smooth zooming of a starfield display (which is a visualization of a multi-attribute database) and introduces the zoom bar, a new widget for zooming and panning. Whereas traditional zoom techniques are based on zooming towards or away from a focal point, this paper introduces a novel approach based on zooming towards or away from a fixed line.Starfield displays plot items from a database as small selectable glyphs using two of the ordinal attributes of the data as the variables along the display axes. One way of filtering this visual information is by changing the range of displayed values on either of the display axes. If this is done incrementally and smoothly, the starfield display appears to zoom in and out, and users can track the motion of the glyphs without getting disoriented by sudden, large changes in context. }, author = {Jog,N. and Shneiderman, Ben} } @inbook {17381, title = {Starfield visualization with interactive smooth zooming}, booktitle = {Visual database systems, IIIVisual database systems, III}, volume = {3}, year = {1995}, month = {1995///}, pages = {1 - 1}, abstract = {This paper discusses the design and implementation of interactive smooth zooming of a starfield display (which is a visualization of a multi-attribute database) and introduces the zoom bar, a new widget for zooming and panning. Whereas traditional zoom techniques are based on zooming towards or away from a focal point, this paper introduces a novel approach based on zooming towards or away from a fixed line.Starfield displays plot items from a database as small selectable glyphs using two of the ordinal attributes of the data as the variables along the display axes. One way of filtering this visual information is by changing the range of displayed values on either of the display axes. If this is done incrementally and smoothly, the starfield display appears to zoom in and out, and users can track the motion of the glyphs without getting disoriented by sudden, large changes in context. }, author = {Jogt,NK and Shneiderman, Ben} } @article {17388, title = {Survival of the fittest: the evolution of multimedia user interfaces}, journal = {ACM Computing Surveys}, volume = {27}, year = {1995}, month = {1995/12//}, pages = {557 - 559}, isbn = {0360-0300}, doi = {10.1145/234782.234789}, url = {http://doi.acm.org/10.1145/234782.234789}, author = {Preece,Jenny and Shneiderman, Ben} } @article {17740, title = {Theory of the Combination of Observations Least Subject to Errors}, journal = {SIAM, Philadelphia.[Translation of Gauss (1821, 1823, 1826).]}, year = {1995}, month = {1995///}, author = {Stewart, G.W.} } @article {15043, title = {Using synthetic perturbations and statistical screening to assay shared-memory programs}, journal = {Information processing letters}, volume = {54}, year = {1995}, month = {1995///}, pages = {147 - 153}, author = {Snelick,R. and JaJa, Joseph F. and Kacker,R. and Lyon,G.} } @article {17481, title = {Using Treemaps to Visualize the Analytic Hierarchy Process}, journal = {Information Systems ResearchInformation Systems Research}, volume = {6}, year = {1995}, month = {1995/12/01/}, pages = {357 - 375}, abstract = {Treemaps, a visualization method for large hierarchical data spaces, are used to augment the capabilities of the Analytic Hierarchy Process (AHP) for decision-making. Two direct manipulation tools, presented metaphorically as a {\textquotedblleft}pump{\textquotedblright} and a {\textquotedblleft}hook,{\textquotedblright} were developed and applied to the treemap to support AHP sensitivity analysis. Users can change the importance of criteria dynamically on the two-dimensional treemap and immediately see the impact on the outcome of the decision. This fluid process dramatically speeds up exploration and provides a better understanding of the relative impact of the component criteria. A usability study with six subjects using a prototype AHP application showed that treemap representation was acceptable from a visualization and data operation standpoint.}, keywords = {AHP, analytic hierarchy process, decision support, treemap, User interfaces, Visualization}, isbn = {1047-7047, 1526-5536}, doi = {10.1287/isre.6.4.357}, url = {http://isr.journal.informs.org/content/6/4/357}, author = {Asahi,Toshiyuki and Turo,David and Shneiderman, Ben} } @article {17483, title = {Vision, Graphic Design, and Visual Display}, journal = {Readings in human-computer interaction: toward the year 2000}, year = {1995}, month = {1995///}, pages = {411 - 411}, author = {Marcus,A. and Murch,G.M. and Baecker,R. and Small,I. and Mander,R. and Ahlberg,C. and Shneiderman, Ben} } @conference {17486, title = {Visual decision-making: using treemaps for the analytic hierarchy process}, booktitle = {Conference companion on Human factors in computing systems}, series = {CHI {\textquoteright}95}, year = {1995}, month = {1995///}, pages = {405 - 406}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, isbn = {0-89791-755-3}, doi = {10.1145/223355.223747}, url = {http://doi.acm.org/10.1145/223355.223747}, author = {Asahi,Toshiyuki and Turo,David and Shneiderman, Ben} } @inbook {15829, title = {What is Fundamental for Markov Chains: First Passage Times, Fundamental Matrices, and Group Generalized Inverses}, booktitle = {Proceedings of the Second International Workshop on Markov ChainsProceedings of the Second International Workshop on Markov Chains}, year = {1995}, month = {1995///}, pages = {151 - 161}, publisher = {Kluwer Academic Publishers}, organization = {Kluwer Academic Publishers}, author = {Heyman,D. P. and O{\textquoteright}Leary, Dianne P.}, editor = {Stewart,W.} } @article {17512, title = {Windows of opportunity in electronic classrooms}, journal = {Communications of the ACM}, volume = {38}, year = {1995}, month = {1995/11//}, pages = {19 - 24}, abstract = {Paradigm-shifting landmark buildings are cherished by their occupants and remembered because they reshape our expectations of schools, homes, or offices. Classic examples include Thomas Jefferson{\textquoteright}s communal design of the {\textquotedblleft}academical village{\textquotedblright} at the University of Virginia where faculty and students lived close to classrooms, Frank Lloyd Wright{\textquoteright}s organic harmony with nature in Fallingwater (in western Pennsylvania) where the waterfall sounds and leafy surroundings offered a stress-reducing getaway for an urban executive, or Kevin Roche{\textquoteright}s open glass-walled Ford Foundation (in New York City) that promoted new team-oriented management strategies.}, isbn = {0001-0782}, doi = {10.1145/219717.219725}, url = {http://doi.acm.org/10.1145/219717.219725}, author = {Shneiderman, Ben and Alavi,Maryann and Norman,Kent and Borkowski,Ellen Yu} } @article {16643, title = {Adaptation of noncompetitive and competitive neural networks to focal lesions}, journal = {Journal of Artificial Neural Networks}, volume = {1}, year = {1994}, month = {1994///}, pages = {51 - 60}, author = {Weinrich,M. and Sutton,G. G and Reggia, James A. and D{\textquoteright}Autrechy,C. L} } @conference {17404, title = {The alphaslider: a compact and rapid selector}, booktitle = {Proceedings of the SIGCHI conference on Human factors in computing systems: celebrating interdependence}, series = {CHI {\textquoteright}94}, year = {1994}, month = {1994///}, pages = {365 - 371}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, keywords = {Alphaslider, dynamic queries, menus, selection technology, widget}, isbn = {0-89791-650-6}, doi = {10.1145/191666.191790}, url = {http://doi.acm.org/10.1145/191666.191790}, author = {Ahlberg,Christopher and Shneiderman, Ben} } @article {18964, title = {An Atlas of Drosophila Genes: Sequences and Molecular Features}, journal = {Journal of Heredity}, volume = {85}, year = {1994}, month = {1994///}, pages = {495 - 496}, author = {Maroni,G. and Mount, Stephen M. and Cavener,DR and Cavener,BA and Sharp,PM and Lloyd,AT and Schaeffer,SW} } @article {16982, title = {AVI {\textquoteright}94: An International Workshop}, journal = {ACM SIGCHI Bulletin}, volume = {26}, year = {1994}, month = {1994/10//}, pages = {54 - 55}, abstract = {The fresh Mediterranean breezes of innovation enlivened the workshop conversations at Advanced Visual Interfaces {\textquoteright}94 (Bari, Italy June 1--4, 1994). More than 100 participants met on the flower-gardened grounds of the Grande Albergo di Villa Romanazzi Carducci, whose modern hotel plus conference center complemented the beautifully restored old villa and the marble-lined swimming pool. Being together with active professionals from Europe and America for 4 days gave us an in-depth chance to learn about each other{\textquoteright}s professional and personal outlooks. The ancient Roman architecture and the traditional Italian surroundings reminded us that the impact of our work could also last for two thousand years and shape many people{\textquoteright}s daily lives.}, isbn = {0736-6906}, doi = {10.1145/191642.1047934}, url = {http://doi.acm.org/10.1145/191642.1047934}, author = {Shneiderman, Ben and Badre,AI and Santos,Paulo} } @conference {16987, title = {Beyond accuracy, reliability, and efficiency: criteria for a good computer system}, booktitle = {Conference companion on Human factors in computing systems}, series = {CHI {\textquoteright}94}, year = {1994}, month = {1994///}, pages = {195 - 198}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, isbn = {0-89791-651-4}, doi = {10.1145/259963.260253}, url = {http://doi.acm.org/10.1145/259963.260253}, author = {Friedman,Batya and Levenson,Nancy and Shneiderman, Ben and Suchman,Lucy and Winograd,Terry} } @conference {17577, title = {Computing with very weak random sources}, booktitle = {, 35th Annual Symposium on Foundations of Computer Science, 1994 Proceedings}, year = {1994}, month = {1994/11/20/22}, pages = {264 - 275}, publisher = {IEEE}, organization = {IEEE}, abstract = {For any fixed ε>0, we show how to simulate RP algorithms in time nO(log n) using the output of a δ-source with min-entropy R(ε). Such a weak random source is asked once for R(ε) bits; it outputs an R-bit string such that any string has probability at most 2-R(ε). If ε>1-1/(k+1), our BPP simulations take time nO(log(k n)) (log(k) is the logarithm iterated k times). We also give a polynomial-time BPP simulation using Chor-Goldreich sources of min-entropy RΩ(1), which is optimal. We present applications to time-space tradeoffs, expander constructions, and the hardness of approximation. Also of interest is our randomness-efficient Leftover Hash Lemma, found independently by Goldreich and Wigderson}, keywords = {Application software, BPP simulations, Chor-Goldreich sources, computational complexity, Computational modeling, Computer science, Computer simulation, cryptography, distributed algorithms, expander constructions, hardness, MATHEMATICS, min-entropy, Physics computing, Polynomials, probability, R-bit string, randomness-efficient Leftover Hash Lemma, RP algorithms simulation, Testing, time-space tradeoffs, very weak random sources}, isbn = {0-8186-6580-7}, doi = {10.1109/SFCS.1994.365688}, author = {Srinivasan, Aravind and Zuckerman,D.} } @article {14138, title = {On the convergence of line iterative methods for cyclically reduced non-symmetrizable linear systems}, journal = {Numerische Mathematik}, volume = {67}, year = {1994}, month = {1994///}, pages = {177 - 190}, author = {Elman, Howard and Golub, G. H and Starke, G.} } @article {16621, title = {Cortical map reorganization as a competitive process}, journal = {Neural Computation}, volume = {6}, year = {1994}, month = {1994///}, pages = {1 - 13}, author = {Sutton III,G. G. and Reggia, James A. and Armentrout,S. L and D{\textquoteright}Autrechy,C. L} } @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.} } @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} } @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} } @article {17120, title = {Education by engagement and construction: Can distance learning be better than face-to-face}, journal = {Unpublished manuscript, University of Maryland, College Park}, year = {1994}, month = {1994///}, abstract = {This essay describes an emerging theory of "education by engagement and construction," in which students work in teams to create ambitious projects with results that are presented to someone other than the professor. The video shows how a distance learning Graduate Computer Science Seminar titled "Virtual Reality, Telepresence and Beyond" was conducted according to this theory. The intense interactions by satellite TV and electronic mail may have created a greater sense of interaction and intimacy among the students than many face-to-face courses. (Video available as part of the HCIL 1994 Video Reports, contact hcil-info@cs.umd.edu for ordering information)}, author = {Shneiderman, Ben} } @article {16553, title = {Effects of normalization constraints on competitive learning}, journal = {Neural Networks, IEEE Transactions on}, volume = {5}, year = {1994}, month = {1994///}, pages = {502 - 504}, author = {Sutton,G. G and Reggia, James A.} } @conference {17896, title = {Efficient runtime support for parallelizing block structured applications}, booktitle = {Scalable High-Performance Computing Conference, 1994., Proceedings of the}, year = {1994}, month = {1994/05//}, pages = {158 - 167}, abstract = {Scientific and engineering applications often involve structured meshes. These meshes may be nested (for multigrid codes) and/or irregularly coupled (called multiblock or irregularly coupled regular mesh problems). We describe a runtime library for parallelizing these applications on distributed memory parallel machines in an efficient and machine-independent fashion. This runtime library is implemented on several different systems. This library can be used by application programmers to port applications by hand and can also be used by a compiler to handle communication for these applications. Our experimental results show that our primitives have low runtime communication overheads. We have used this library to port a multiblock template and a multigrid code. Effort is also underway to port a complete multiblock computational fluid dynamics code using our library}, keywords = {application programmers, block structured applications, distributed memory parallel machines, distributed memory systems, engineering applications, irregularly coupled regular mesh problems, machine-independent, multiblock, multiblock computational fluid dynamics code, multiblock template, multigrid codes, Parallel machines, parallel programming, Physics computing, runtime communication overhead, Runtime library, runtime support, scientific applications, software reusability, structured meshes}, doi = {10.1109/SHPCC.1994.296639}, author = {Agrawal,G. and Sussman, Alan and Saltz, J.} } @article {16970, title = {An exploratory evaluation of three interfaces for browsing large hierarchical tables of contents}, journal = {ACM Trans. Inf. Syst.}, volume = {12}, year = {1994}, month = {1994/10//}, pages = {383 - 406}, abstract = {Three different interfaces were used to browse a large (1296 items) table of contents. A fully expanded stable interface, expand/contract interface, and multipane interface were studied in a between-groups experiment with 41 novice participants. Nine timed fact retrieval tasks were performed; each task is analyzed and discussed separately. We found that both the expand/contract and multipane interfaces produced significantly faster times than the stable interface for many tasks using this large hierarchy; other advantages of the expand/contract and multipane interfaces over the stable interface are discussed. The animation characteristics of the expand/contract interface appear to play a major role. Refinements to the multipane and expand/contract interfaces are suggested. A predictive model for measuring navigation effort of each interface is presented.}, keywords = {Browsing, hierarchies, table of contents, User interfaces}, isbn = {1046-8188}, doi = {10.1145/185462.185483}, url = {http://doi.acm.org/10.1145/185462.185483}, author = {Chimera,Richard and Shneiderman, Ben} } @article {12816, title = {Fully abstract characterizations of testing preorders for probabilistic processes}, journal = {CONCUR{\textquoteright}94: Concurrency Theory}, year = {1994}, month = {1994///}, pages = {497 - 512}, author = {Yuen,S. and Cleaveland, Rance and Dayar,Z. and Smolka,S.} } @inbook {16213, title = {The future of graphic user interfaces: Personal role managers}, booktitle = {People and Computers}, year = {1994}, month = {1994///}, pages = {444 - 444}, publisher = {Cambridge University Press}, organization = {Cambridge University Press}, isbn = {9780521485579}, author = {Shneiderman, Ben and Plaisant, Catherine} } @conference {17876, title = {High performance computing for land cover dynamics}, booktitle = {Pattern Recognition, 1994. Vol. 3-Conference C: Signal Processing, Proceedings of the 12th IAPR International Conference on}, year = {1994}, month = {1994///}, pages = {234 - 238}, author = {Parulekar,R. and Davis, Larry S. and Chellapa, Rama and Saltz, J. and Sussman, Alan and Townshend,J.} } @article {16215, title = {Image Browsers: Taxonomy, Guidelines, and Informal Specifications}, journal = {Institute for Systems Research Technical Reports}, year = {1994}, month = {1994///}, abstract = {Image browsing is necessary in numerous applications. Designers have merely used two one-dimensional scroll bars or they have made ad hoc designs for a two-dimensional scroll bar. However, the complexity of two-dimensional browsing suggests that more careful analysis, design, and evaluation might lead to significant improvements. We present a task taxonomy for image browsing, suggest design features and guidelines, assess existing strategies, and introduce an informal specification}, keywords = {Graphics, Systems Integration, use interface}, url = {http://drum.lib.umd.edu/handle/1903/5591}, author = {Plaisant, Catherine and Carr,David A and Shneiderman, Ben} } @book {17244, title = {Interacting with virtual environments}, year = {1994}, month = {1994///}, publisher = {John Wiley \& Sons}, organization = {John Wiley \& Sons}, author = {MacDonald,L. and Vince,J. and Shneiderman, Ben} } @conference {17857, title = {Jovian: A framework for optimizing parallel I/O}, booktitle = {Scalable Parallel Libraries Conference, 1994., Proceedings of the 1994}, year = {1994}, month = {1994///}, pages = {10 - 20}, author = {Bennett, R. and Bryant,K. and Sussman, Alan and Das,R. and Saltz, J.} } @conference {15948, title = {Meta-languages, reflection principles and self-reference}, booktitle = {Handbook of logic in artificial intelligence and logic programming}, year = {1994}, month = {1994///}, pages = {323 - 358}, author = {Perlis, Don and V.S. Subrahmanian} } @article {12216, title = {A miniature pan-tilt actuator: the spherical pointing motor}, journal = {IEEE Transactions on Robotics and Automation}, volume = {10}, year = {1994}, month = {1994/06//}, pages = {298 - 308}, abstract = {A pan-tilt mechanism is a computer-controlled actuator designed to point an object such as a camera sensor. For applications in active vision, a pan-tilt mechanism should be accurate, fast, small, inexpensive and have low power requirements. The authors have designed and constructed a new type of actuator meeting these requirements, which incorporates both pan and tilt into a single, two-degree-of-freedom device. The spherical pointing motor (SPM) consists of three orthogonal motor windings in a permanent magnetic field, configured to move a small camera mounted on a gimbal. It is an absolute positioning device and is run open-loop. The SPM is capable of panning and tilting a load of 15 grams, for example a CCD image sensor, at rotational velocities of several hundred degrees per second with a repeatability of .15{\textdegree}. The authors have also built a miniature camera consisting of a single CCD sensor chip and miniature lens assembly that fits on the rotor of this motor. In this paper, the authors discuss the theory of the SPM, which includes its basic electromagnetic principles, and derive the relationship between applied currents and resultant motor position. The authors present an automatic calibration procedure and discuss open- and closed-loop control strategies. Finally, the authors present the physical characteristics and results of their prototype}, keywords = {absolute positioning device, active vision, Actuators, Application software, Assembly, automatic calibration, camera sensor, CAMERAS, CCD image sensors, CCD sensor chip, Charge coupled devices, Charge-coupled image sensors, closed-loop control strategies, computerised control, Lenses, Magnetic fields, miniature lens assembly, miniature pan-tilt actuator, open-loop control strategies, orthogonal motor windings, pan-tilt mechanism, Permanent magnet motors, position control, Scanning probe microscopy, spherical pointing motor, two-degree-of-freedom device}, isbn = {1042-296X}, doi = {10.1109/70.294205}, author = {Bederson, Benjamin B. and Wallace,R.S. and Schwartz,E.L.} } @article {17305, title = {Navigating in hyperspace: designing a structure-based toolbox}, journal = {Communications of the ACM}, volume = {37}, year = {1994}, month = {1994/02//}, pages = {87 - 96}, isbn = {0001-0782}, doi = {10.1145/175235.175242}, url = {http://doi.acm.org/10.1145/175235.175242}, author = {Rivlin,Ehud and Botafogo,Rodrigo and Shneiderman, Ben} } @article {16217, title = {Next Generation Network Management Technology}, year = {1994}, month = {1994///}, abstract = {Today{\textquoteright}s telecommunications networks are becoming increasingly large, complex, mission critical and heterogeneous in several dimensions. For example, the underlying physical transmission facilities of a given network may be ﲭixed media (copper, fiber- optic, radio, and satellite); the sub networks may be acquired from different vendors due to economic, performance, or general availability reasons; the information being transmitted over the network may be ﲭultimedia (video, data, voice, and images) and, finally, varying performance criteria may be imposed e.g. data transfer may require high throughput while the others, whose concern is voice communications, may require low call blocking probability. For these reasons, future telecommunications networks are expected to be highly complex in their services and operations. Due to this growing complexity and the disparity among management systems for individual sub networks, efficient network management systems have become critical to the current and future success of telecommunications companies. This paper addresses a research and development effort which focuses on prototyping configuration management, since that is the central process of network management and all other network management functions must be built upon it. Our prototype incorporates ergonomically designed graphical user interfaces tailored to the network configuration management subsystem and to the proposed advanced object-oriented database structure. The resulting design concept follows open standards such as Open Systems Interconnection (OSI) and incorporates object oriented programming methodology to associate data with functions, permit customization, and provide an open architecture environment.

}, keywords = {Constraints for Network Management., Network Configuration Management, network management, Object Oriented Data Base Model for Network Management, Rules, Systems Integration, Visual Information Management for Network Configuration Management}, url = {http://drum.lib.umd.edu/handle/1903/5519}, author = {Atallah,George C and Ball,Michael O and Baras,John S and Goli,Shravan K and Karne,Ramesh K and Kelley,Stephen and Kumar,Harsha P. and Plaisant, Catherine and Roussopoulos, Nick and Shneiderman, Ben and Srinivasarao,Mulugu and Stathatos,Kostas and Teittinen,Marko and Whitefield,David} } @article {13711, title = {A paradigm for non-head-driven parsing: Parameterized message-passing}, journal = {Proceedings of the International Conference on New Methods in Language Processing, Manchester, UK}, year = {1994}, month = {1994///}, author = {Dorr, Bonnie J and Lin,D. and Lee,J. and Suh,S.} } @article {18051, title = {On a parallel-algorithms method for string matching problems}, journal = {Lecture Notes in Computer Science}, volume = {778}, year = {1994}, month = {1994///}, pages = {22 - 32}, author = {Sahinalp,S. C and Vishkin, Uzi} } @inbook {18049, title = {On a parallel-algorithms method for string matching problems (overview)}, booktitle = {Algorithms and ComplexityAlgorithms and Complexity}, series = {Lecture Notes in Computer Science}, volume = {778}, year = {1994}, month = {1994///}, pages = {22 - 32}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, keywords = {Computer, Science}, isbn = {978-3-540-57811-6}, url = {http://dx.doi.org/10.1007/3-540-57811-0_3}, author = {Sahinalp,Suleyman and Vishkin, Uzi}, editor = {Bonuccelli,M. and Crescenzi,P. and Petreschi,R.} } @conference {15641, title = {Query-sensitive ray shooting}, booktitle = {Proceedings of the tenth annual symposium on Computational geometry}, series = {SCG {\textquoteright}94}, year = {1994}, month = {1994///}, pages = {359 - 368}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, isbn = {0-89791-648-4}, doi = {10.1145/177424.178094}, url = {http://doi.acm.org/10.1145/177424.178094}, author = {Mitchell,Joseph S.B. and Mount, Dave and Suri,Subhash} } @article {17337, title = {QUEST{\textemdash}Query Environment for Science Teaching}, journal = {Digital Libraries{\textquoteright} 94}, year = {1994}, month = {1994///}, abstract = {QUery Environment for Science Teaching (QUEST) is a proposed digital library implementation consisting of a set of research projects dealing with data capture and organization, content analysis, information seeking and visual interfaces.The QUEST team includes a large number of renown technical collaborators and prominent source collaborators, as well as a significant number of contributors in the University of Maryland, the central, co-ordinating agency.A large collection of multidisciplinary materials in visual and textual formats, made accessible to us by our source collaborators, will be organized to allow integrated access by users from the science education community, that is elementary school through college level teachers. QUEST will be structured so as to provide seamless access to widespread resources on disparate subjects. We intend to provide first-rate subject analysis and representation in order to provide ready access. QUEST will be accessible nationally by means of Mosaic. We propose to provide highly sophisticated querying, browsing and information investigation facilities which will handle integrated textual and visual materials without difficulty. They will be augmented by online reference and referral services, immediately accessible by the user. QUEST will provide a comprehensive information resource for science education accessible through a dynamic, visual user interface. }, author = {Shneiderman, Ben and Rosenfeld, A. and Marchioni,G. and Holliday,W. and Ricart, G. and Faloutsos,С. and Dick,J.} } @conference {15588, title = {Randomized and deterministic algorithms for geometric spanners of small diameter}, booktitle = {Foundations of Computer Science, 1994 Proceedings., 35th Annual Symposium on}, year = {1994}, month = {1994/11//}, pages = {703 - 712}, abstract = {Let S be a set of n points in IRd and let t gt;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 p. 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. Randomized and deterministic algorithms are given for constructing t-spanners consisting of O(n) edges and having O(log n) diameter. Also, it is shown how to maintain the randomized t-spanner under random insertions and deletions. Previously, no results were known for spanners with low spanner diameter and for maintaining spanners under insertions and deletions}, keywords = {computational geometry, deletions, deterministic algorithms, directed graph, directed graphs, geometric spanners, insertions, randomised algorithms, randomized algorithms}, doi = {10.1109/SFCS.1994.365722}, author = {Arya,S. and Mount, Dave and Smid,M.} } @article {17422, title = {The river beyond the rapids: responsive services for responsible users}, journal = {Connecting the DOE community: partnerships in information}, year = {1994}, month = {1994///}, pages = {25 - 26}, abstract = {Providing responsive services to all members of our society will require new corporate alliances that put the users and their needs ahead of the pursuit of new technology. Responsive systems are the boats on which responsible users will travel to their work, social communities, and entertainment. With responsive systems users can take responsibility for what they promise to do and derive satisfaction from accomplishing their tasks. The keys to user responsibility are comprehensible, predictable, and controllable interfaces.}, author = {Shneiderman, Ben} } @article {16476, title = {A simulation-based study on the concurrent execution of rules in a database environment}, journal = {Journal of Parallel and Distributed computing}, volume = {20}, year = {1994}, month = {1994///}, pages = {20 - 42}, author = {Raschid, Louiqa and Sellis,T. and Delis,A.} } @article {12183, title = {Space variant image processing}, journal = {International Journal of Computer Vision}, volume = {13}, year = {1994}, month = {1994///}, pages = {71 - 90}, author = {Wallace,R.S. and Ong,P.W. and Bederson, Benjamin B. and Schwartz,E.L.} } @article {17379, title = {Split menus: effectively using selection frequency to organize menus}, journal = {ACM Transactions on Computer-Human Interaction}, volume = {1}, year = {1994}, month = {1994/03//}, pages = {27 - 51}, abstract = {When some items in a menu are selected more frequently than others, as is often the case, designers or individual users may be able to speed performance and improve preference ratings by placing several high-frequency items at the top of the menu. Design guidelines for split menus were developed and applied. Split menus were implemented and tested in two in situ usability studies and a controlled experiment. In the usability studies performance times were reduced by 17 to 58\% depending on the site and menus. In the controlled experiment split menus were significantly faster than alphabetic menus and yielded significantly higher subjective preferences. A possible resolution to the continuing debate among cognitive theorists about predicting menu selection times is offered. We conjecture and offer evidence that, at least when selecting items from pull-down menus, a logarithmic model applies to familiar (high-frequency) items, and a linear model to unfamiliar (low-frequency) items.}, keywords = {Human-computer interaction, menus, selection frequency, split menus, user interface}, isbn = {1073-0516}, doi = {10.1145/174630.174632}, url = {http://doi.acm.org/10.1145/174630.174632}, author = {Sears,Andrew and Shneiderman, Ben} } @conference {18050, title = {Symmetry breaking for suffix tree construction}, booktitle = {Proceedings of the twenty-sixth annual ACM symposium on Theory of computing}, year = {1994}, month = {1994///}, pages = {300 - 309}, author = {Sahinalp,S. C and Vishkin, Uzi} } @article {15828, title = {URV ESPRIT for tracking time-varying signals}, journal = {Signal Processing, IEEE Transactions on}, volume = {42}, year = {1994}, month = {1994/12//}, pages = {3441 - 3448}, abstract = {ESPRIT is an algorithm for determining the fixed directions of arrival of a set of narrowband signals at an array of sensors. Unfortunately, its computational burden makes it unsuitable for real time processing of signals with time-varying directions of arrival. The authors develop a new implementation of ESPRIT that has potential for real time processing. It is based on a rank-revealing URV decomposition, rather than the eigendecomposition or singular value decomposition used in previous ESPRIT algorithms. The authors demonstrate its performance on simulated data representing both constant and time-varying signals. They find that the URV-based ESPRIT algorithm is effective for estimating time-varying directions-of-arrival at considerable computational savings over the SVD-based algorithm}, keywords = {arrival;narrowband, decomposition;real, directions, ESPRIT;fixed, estimation;real-time, of, processing;time-varying, signals;performance;rank-revealing, signals;tracking;direction-of-arrival, systems;time-varying, systems;tracking;, TIME, URV}, isbn = {1053-587X}, doi = {10.1109/78.340778}, author = {Liu,K. J.R and O{\textquoteright}Leary, Dianne P. and Stewart, G.W. and Wu,Y.-J.J.} } @article {17464, title = {User Controlled Smooth Zooming for Information Visualization}, journal = {Institute for Systems Research Technical Reports}, year = {1994}, month = {1994///}, abstract = {This paper discusses the design and implementation of user controlled smooth zooming of a starfield display. A starfield display is a two dimensional graphical visualization of a multidimensional database where every item from the database is represented as a small colored rectangle whose position is determined by its ranking along ordinal attributes of the items laid out on the axes. One way of navigating this visual information is by using a zooming tool to incrementally zoom in on the items by varying the attribute range on either axis independently - such zooming causes the rectangles to move continuously and to grow or shrink. To get a feeling of flying through the data, users should be able to track the motion of each rectangle without getting distracted by flicker or large jumps - conditions that necessitate high display refresh rates and closely spaced rectangles on successive frames. Although the use of high-speed hardware can achieve the required visual effect for small databases, the twin software bottlenecks of rapidly accessing display items and constructing a new display image fundamentally retard the refresh rate. Our work explores several methods to overcome these bottlenecks, presents a taxonomy of various zooming methods and introduces a new widget, the zoom bar, that facilitates zooming.

}, keywords = {animation, dynamic queries, starfield display, Systems Integration, visualization zooming, zoom bar}, url = {http://drum.lib.umd.edu/handle/1903/5520}, author = {Jog,Ninog and Shneiderman, Ben} } @conference {17489, title = {Visual information seeking: tight coupling of dynamic query filters with starfield displays}, booktitle = {Proceedings of the SIGCHI conference on Human factors in computing systems: celebrating interdependence}, series = {CHI {\textquoteright}94}, year = {1994}, month = {1994///}, pages = {313 - 317}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, keywords = {database query, dynamic queries, information seeking, starfield displays, tight coupling}, isbn = {0-89791-650-6}, doi = {10.1145/191666.191775}, url = {http://doi.acm.org/10.1145/191666.191775}, author = {Ahlberg,Christopher and Shneiderman, Ben} } @article {17488, title = {Visual information seeking using the FilmFinder}, journal = {ACM CHI94 Conference, Boston}, year = {1994}, month = {1994///}, author = {Ahlberg,C. and Shneiderman, Ben} } @conference {17497, title = {Visualization in the information highway}, booktitle = {Proceedings of the conference on Visualization {\textquoteright}94}, series = {VIS {\textquoteright}94}, year = {1994}, month = {1994///}, pages = {4 - 7}, publisher = {IEEE Computer Society Press}, organization = {IEEE Computer Society Press}, address = {Los Alamitos, CA, USA}, isbn = {0-7803-2521-4}, url = {http://dl.acm.org/citation.cfm?id=951087.951091}, author = {Gershon,Nahum and Card,Stuart K. and Roth,Steven F. and Shneiderman, Ben} } @conference {15713, title = {An adaptive ESPRIT based on URV decomposition}, booktitle = {Acoustics, Speech, and Signal Processing, 1993. ICASSP-93., 1993 IEEE International Conference on}, volume = {4}, year = {1993}, month = {1993/04//}, pages = {37 -40 vol.4 - 37 -40 vol.4}, abstract = {ESPRIT is an algorithm for determining the fixed directions of arrival of a set of narrowband signals at an array of sensors. Its computational burden makes it unsuitable for real-time processing of signals with time-varying directions of arrival. The authors develop a new implementation of ESPRIT that has potential for real-time processing. It is based on a rank-revealing URV decomposition, rather than the eigendecomposition or singular value decomposition (SVD) used in previous ESPRIT algorithms. Its performance is demonstrated on simulated data representing both constant and time-varying signals. It is shown that the URV-based ESPRIT algorithm is effective for estimating time-varying directions-of-arrival at considerable computational savings over the SVD-based algorithm.<>}, keywords = {algorithm;array, complexity;parameter, decomposition;real-time, ESPRIT, estimation;real-time, filters;array, of, processing;adaptive, processing;computational, savings;performance;rank-revealing, sensors;computational, signal, systems;, systems;time-varying, URV, URV-based}, doi = {10.1109/ICASSP.1993.319588}, author = {Liu,K. J.R and O{\textquoteright}Leary, Dianne P. and Stewart, G.W. and Wu,Y.-J.J.} } @article {16740, title = {ADMS: a testbed for incremental access methods}, journal = {IEEE Transactions on Knowledge and Data Engineering}, volume = {5}, year = {1993}, month = {1993/10//}, pages = {762 - 774}, abstract = {ADMS is an advanced database management system developed-to experiment with incremental access methods for large and distributed databases. It has been developed over the past eight years at the University of Maryland. The paper provides an overview of ADMS, and describes its capabilities and the performance attained by its incremental access methods. This paper also describes an enhanced client-server architecture that allows an incremental gateway access to multiple heterogeneous commercial database management systems}, keywords = {Add-drop multiplexers, ADMS, advanced database management system, client-server architecture, commercial database management systems, Computational modeling, Database systems, distributed databases, heterogeneous DBMS, incremental access methods, incremental gateway, Information retrieval, interoperability, join index, large databases, Navigation, network operating systems, Object oriented databases, Object oriented modeling, Query processing, System testing, very large databases, view index, Workstations}, isbn = {1041-4347}, doi = {10.1109/69.243508}, author = {Roussopoulos, Nick and Economou,N. and Stamenas,A.} } @article {16956, title = {Alpha Slider: Searching Textual Lists with Sliders}, journal = {Institute for Systems Research Technical Reports}, year = {1993}, month = {1993///}, abstract = {AlphaSlider is a query interface that uses a direct manipulation slider to select words, phrases, or names from an existing list. This paper introduces a prototype of AlphaSlider, describes the design issues, reports on an experimental evaluation, and offers directions for further research. The experiment tested 24 subjects selecting items from lists of 40, 80, 160, and 320 entries. Mean selection times only doubled with the 8-fold increase in list length. Users quickly accommodated to this selection method.}, keywords = {direct manipulation, Human-computer interaction, keyboard data entry, sliders, Systems Integration, touchscreen}, url = {http://drum.lib.umd.edu/handle/1903/5397}, author = {Osada,M. and Liao,Holmes and Shneiderman, Ben} } @article {16957, title = {Alphaslider: Development and Evaluation of Text Retrieval Methods Using Sliders}, journal = {Ninth Symposium on Human Interface}, year = {1993}, month = {1993///}, pages = {91 - 94}, abstract = {AlphaSlider is a query interface that uses a direct manipulation slider to select words, phrases, or names from an existing list. This paper introduces a prototype of AlphaSlider, describes the design issues, reports on an experimental evaluation, and offers directions for further research. The experiment tested 24 subjects selecting items from lists of 40, 80, 160, and 320 entries. Mean selection times only doubled with the 8-fold increase in list length. Users quickly accommodated to this selection method.}, author = {Osada,M. and Liao,H. and Shneiderman, Ben} } @conference {17884, title = {Applying the CHAOS/PARTI library to irregular problems in computational chemistry and computational aerodynamics}, booktitle = {Scalable Parallel Libraries Conference, 1993., Proceedings of the}, year = {1993}, month = {1993///}, pages = {45 - 56}, author = {Das,R. and Hwang,Y. S and Uysal, M. and Saltz, J. and Sussman, Alan} } @article {15665, title = {On the area of overlap of translated polygons}, journal = {SPIE Vision Geometry II}, volume = {2060}, year = {1993}, month = {1993///}, pages = {254 - 264}, abstract = {Given two simple polygons P and Q in the plane and a translation vector t 2R2, the area-of-overlap function of P and Q is the function Ar(t) = Area(P \(t + Q)), where t + Q denotes Q translated by t. This function has a number of applications in areas such as motion planning and object recognition. We present a number of mathematical results regarding this function. We also provide e cient algorithms for computing a representation of this function, and for tracing contour curves of constant area-of-overlap. }, author = {Mount, Dave and Silverman,R. and Wu,A.} } @article {16988, title = {Beyond intelligent machines: just do it}, journal = {IEEE Software}, volume = {10}, year = {1993}, month = {1993/01//}, pages = {100 - 103}, abstract = {The author argues that users want a sense of direct and immediate control over computers that differs from how they interact with people. He presents several examples of these predictable and controllable interfaces developed in the lab. The examples include tree maps and dynamic queries.<>}, keywords = {Artificial intelligence, Computer aided instruction, Computer errors, controllable interfaces, Displays, dynamic queries, Educational institutions, History, HUMANS, intelligent machines, learning systems, Machine intelligence, predictable interfaces, Speech recognition, tree maps, User interfaces}, isbn = {0740-7459}, doi = {10.1109/52.207235}, author = {Shneiderman, Ben} } @conference {16989, title = {Beyond the graphical user interface (abstract)}, booktitle = {Proceedings of the 1993 ACM conference on Computer science}, series = {CSC {\textquoteright}93}, year = {1993}, month = {1993///}, pages = {510{\textendash} - 510{\textendash}}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {The wildly popular graphical user interfaces are a dramatic improvement over earlier interaction styles, but the next generation of user interfaces is already being fashioned. The future will be dynamic, spatial, gestural, colorful, ubiquitous, often auditory, and sometimes virtual. The dominance of visual information with hi-res images and full-motion video will push the hardware requirements, absorb network capacity, and challenge the algorithm designers. As human-computer interaction researchers accumulate experimental data and theory matures, novel input devices, information visualization displays, and interaction strategies will emerge.}, isbn = {0-89791-558-5}, doi = {10.1145/170791.171139}, url = {http://doi.acm.org/10.1145/170791.171139}, author = {Shneiderman, Ben} } @conference {17000, title = {Browsing Unix directories with dynamic queries: An analytical and experimental evaluation}, booktitle = {Proc. Ninth Japanese Symp. Human Interface}, year = {1993}, month = {1993///}, pages = {95 - 98}, abstract = {We designed, implemented, and evaluated an innovative concept for dynamic queries which involves the direct manipulation of small databases. Our domain was directories in a Unix file system. Dynamic queries allow users to formulate queries and explore the databases with graphical widgets, such as sliders and buttons, without requiring them to have any knowledge about the underlying structure of the database query languages, or command language syntax. Three interfaces for presenting directories were developed and tested with eighteen subjects in a within-subject design. The results of the formative evaluation yielded some useful guidelines for software designers.}, author = {Liao,H. and Osada,M. and Shneiderman, Ben} } @article {17003, title = {Building HCI partnerships and infrastructure}, journal = {Behaviour \& Information Technology}, volume = {12}, year = {1993}, month = {1993///}, pages = {130 - 135}, abstract = {As policymakers and technology planners respond to the growing activity in human?computer interaction, a broad perspective may be helpful. This article offers a top-down view of current activities and suggests opportunities and challenges for the continued growth of HCI. Partnerships among universities, corporations, government agencies, and professional societies are proposed. Infrastructure needs to support this new discipline are outlined.Abstract As policymakers and technology planners respond to the growing activity in human?computer interaction, a broad perspective may be helpful. This article offers a top-down view of current activities and suggests opportunities and challenges for the continued growth of HCI. Partnerships among universities, corporations, government agencies, and professional societies are proposed. Infrastructure needs to support this new discipline are outlined. }, isbn = {0144-929X}, doi = {10.1080/01449299308924373}, url = {http://www.tandfonline.com/doi/abs/10.1080/01449299308924373}, author = {Shneiderman, Ben and LEWIS,CLAYTON} } @article {17004, title = {Building Partnerships and Infrastructure}, journal = {Communications of the ACM}, volume = {32}, year = {1993}, month = {1993///}, pages = {9 - 23}, abstract = {As policymakers and technology planners respond to the growingactivity in human-computer interaction, a broad perspective may be helpful. This article offers a top-down view of current activities and suggests opportunities and challenges for the continued growth of HCI. Partnerships among universities, corporations, government agencies, and professional societies are proposed. Infrastructure needs to support this new discipline are outlined. }, author = {Shneiderman, Ben and Lewis,C.} } @conference {17573, title = {Chernoff-Hoeffding bounds for applications with limited independence}, booktitle = {Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms}, series = {SODA {\textquoteright}93}, year = {1993}, month = {1993///}, pages = {331 - 340}, publisher = {Society for Industrial and Applied Mathematics}, organization = {Society for Industrial and Applied Mathematics}, address = {Philadelphia, PA, USA}, isbn = {0-89871-313-7}, url = {http://dl.acm.org/citation.cfm?id=313559.313797}, author = {Schmidt,Jeanette P. and Siegel,Alan and Srinivasan, Aravind} } @article {12780, title = {The concurrency workbench: a semantics-based tool for the verification of concurrent systems}, journal = {ACM Transactions on Programming Languages and Systems}, volume = {15}, year = {1993}, month = {1993/01/01/}, pages = {36 - 72}, isbn = {01640925}, doi = {10.1145/151646.151648}, url = {http://dl.acm.org/citation.cfm?id=151648}, author = {Cleaveland, Rance and Parrow,Joachim and Steffen,Bernhard} } @conference {12201, title = {Control and design of the spherical pointing motor}, booktitle = {, 1993 IEEE International Conference on Robotics and Automation, 1993. Proceedings}, year = {1993}, month = {1993/05/02/6}, pages = {630-636 vol.2 - 630-636 vol.2}, publisher = {IEEE}, organization = {IEEE}, abstract = {A miniature pan-tilt actuator, the spherical pointing motor (SPM) has been built. The SPM is an absolute positioning device, designed to orient a small camera sensor in two degrees-of-rotational-freedom. It is 4 cm{\texttimes}5 cm{\texttimes}6 cm and weighs 160 g. The operating principle of the SPM is to orient a permanent magnet to the magnetic field induced by three orthogonal coils by applying the appropriate ratio of currents to the coils. The open-loop control and design of the SPM are described. Physical characteristics and velocity measurements of the prototype are reported. The SPM is modeled with a simple second order system. Without control, it oscillates substantially when a single impulse is applied. By applying a second impulse without feedback, the oscillation can be reduced by as much as a factor of ten}, keywords = {absolute positioning device, Actuators, camera sensor, CAMERAS, Coils, electric actuators, electric motors, Magnetic field measurement, Magnetic sensors, Open loop systems, open-loop control, orthogonal coils, pan-tilt actuator, permanent magnet, Permanent magnet motors, Permanent magnets, position control, Scanning probe microscopy, second order system, spherical pointing motor, velocity control, Velocity measurement, velocity measurements}, isbn = {0-8186-3450-2}, doi = {10.1109/ROBOT.1993.291888}, author = {Bederson, Benjamin B. and Wallace,R.S. and Schwartz,E.L.} } @article {16440, title = {Coupling production systems and database systems: A homogeneous approach}, journal = {Knowledge and Data Engineering, IEEE Transactions on}, volume = {5}, year = {1993}, month = {1993///}, pages = {240 - 256}, author = {Sellis,T. and Lin,C. C and Raschid, Louiqa} } @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} } @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.} } @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 {17121, title = {Education by engagement and construction: Experiences in the AT\&T teaching theater}, journal = {Educational Multimedia and Hypermedia Annual. Association for the Advancement of Computing in Education, Charlottesville, Virg}, year = {1993}, month = {1993///}, pages = {471 - 479}, author = {Shneiderman, Ben} } @article {17133, title = {Engagement and construction: Educational strategies for the post-TV era}, journal = {Journal of Computing in Higher Education}, volume = {4}, year = {1993}, month = {1993///}, pages = {106 - 116}, abstract = {THE POST-TV MEDIA of computers (hypermedia, graphic user interfaces, word processors, spreadsheets, databases, sound, music, animation, etc.) and communications (electronic mail, bulletin boards, groupware, fax, video, etc.) enables teachers, students, and parents to creatively develop education by engagement and construction. Students should be given the chance to engage with each other in team projects, preferably situated in the world outside the classroom, with the goal of constructing a product that is useful or interesting to someone other than the teacher. Challenges remain such as scaling up from small class projects to lecture sections with hundreds of students, covering the curriculum that is currently required by many school districts, and evaluating performance. However, there seems to be no turning back and, anyway, the children of the Nintendo and Video Age are eager to press fast forward.}, isbn = {1042-1726}, url = {http://dx.doi.org/10.1007/BF02941067}, author = {Shneiderman, Ben} } @inbook {16218, title = {Evaluating three museum installations of a hypertext system}, booktitle = {Sparks of innovation in human-computer interaction}, volume = {40}, year = {1993}, month = {1993///}, pages = {404 - 404}, publisher = {Intellect Books}, organization = {Intellect Books}, isbn = {9781567500783}, author = {Shneiderman, Ben and Brethauer,D. and Plaisant, Catherine and Potter,R.} } @article {17163, title = {Finding facts vs. browsing knowledge in hypertext systems}, journal = {Sparks of innovation in human-computer interaction}, year = {1993}, month = {1993///}, pages = {103 - 103}, author = {Marchionini,G. and Shneiderman, Ben} } @article {17169, title = {First steps toward positive contributions}, journal = {Communications of the ACM}, volume = {36}, year = {1993}, month = {1993///}, pages = {15 - 16}, author = {Shneiderman, Ben} } @article {16929, title = {A graphical filter/flow representation of Boolean queries: A prototype implementation and evaluation}, journal = {Journal of the American Society for Information Science}, volume = {44}, year = {1993}, month = {1993/07/01/}, pages = {327 - 339}, abstract = {One of the powerful applications of Boolean expression is to allow users to extract relevant information from a database. Unfortunately, previous research has shown that users have difficulty specifying Boolean queries. In an attempt to overcome this limitation, a graphical Filter/Flow representation of Boolean queries was designed to provide users with an interface that visually conveys the meaning of the Boolean operators (AND, OR, and NOT). This was accomplished by implementing a graphical interface prototype that uses the metaphor of water flowing through filters. Twenty subjects having no experience with Boolean logic participated in an experiment comparing the Boolean operations represented in the Filter/Flow interface with a text-only SQL interface. The subjects independently performed five comprehension tasks and five composition tasks in each of the interfaces. A significant difference (p < 0.05) in the total number of correct queries in each of the comprehension and composition tasks was found favoring Filter/Flow. {\textcopyright} 1993 John Wiley \& Sons, Inc.}, isbn = {1097-4571}, doi = {10.1002/(SICI)1097-4571(199307)44:6<327::AID-ASI3>3.0.CO;2-J}, url = {http://onlinelibrary.wiley.com/doi/10.1002/(SICI)1097-4571(199307)44:6\%3C327::AID-ASI3\%3E3.0.CO;2-J/abstract;jsessionid=76B714851135D8044D4E03335B4D39A0.d01t04}, author = {Young,Degi and Shneiderman, Ben} } @article {16930, title = {A graphical query interface based on aggregation/generalization hierarchies}, journal = {Information Systems}, volume = {18}, year = {1993}, month = {1993/06//}, pages = {215 - 232}, abstract = {In order for automated information systems to be used effectively, they must be made easily accessible to a wide range of users and with short training periods. This work proposes a method of organizing documents based on the concepts of aggregation and generalization hierarchies. We propose a graphical user interface to provide a more intuitive form of Boolean query. This design is based on mapping the nodes of the aggregation hierarchy to Boolean intersection operations, mapping the nodes of the generalization hierarchy to Boolean union operations, and providing a concrete, graphical, manipulable representation of both of these node types. Finally, a working prototype interface was constructed and evaluated experimentally against a classical command-line Boolean query interface. In this formative evaluation with sixteen subjects, the graphical interface produced less than one-tenth the errors of the textual interface, on average. Significant differences in time spent specifying queries were not found. Observations and comments provide guidance for designers.}, keywords = {aggregation/generalization hierarchies, empirical test, Graphical user interfaces, visual queries}, isbn = {0306-4379}, doi = {10.1016/0306-4379(93)90018-V}, url = {http://www.sciencedirect.com/science/article/pii/030643799390018V}, author = {Weiland,William J and Shneiderman, Ben} } @article {17225, title = {Improving the accuracy of touchscreens: an experimental evaluation of three strategies}, journal = {Sparks of innovation in human-computer interaction}, year = {1993}, month = {1993///}, pages = {161 - 161}, author = {Potter,R.L. and Weldon,L.J. and Shneiderman, Ben} } @article {17267, title = {Investigating touchscreen typing: the effect of keyboard size on typing speed}, journal = {Behaviour \& Information Technology}, volume = {12}, year = {1993}, month = {1993///}, pages = {17 - 22}, abstract = {Abstract Two studies investigated the effect keyboard size has on typing speed and error rates for touchscreen keyboards using the lift-off strategy. A cursor appeared when users touched the screen and a key was selected when they lifted their finger from the screen. Four keyboard sizes were investigated ranging from 24.6 cm to 6.8 cm wide. Results indicate that novices can type approximately 10 words per minute (WPM) on the smallest keyboard and 20 WPM on the largest. Experienced users improved to 21 WPM on the smallest keyboard and 32 WPM on the largest. These results indicate that, although slower, small touchscreen keyboards can be used for limited data entry when the presence of a regular keyboard is not practical. Applications include portable pocket-sized or palmtop computers, messaging systems, and personal information resources. Results also suggest the increased importance of experience on these smaller keyboards. Research directions are suggested.Abstract Two studies investigated the effect keyboard size has on typing speed and error rates for touchscreen keyboards using the lift-off strategy. A cursor appeared when users touched the screen and a key was selected when they lifted their finger from the screen. Four keyboard sizes were investigated ranging from 24.6 cm to 6.8 cm wide. Results indicate that novices can type approximately 10 words per minute (WPM) on the smallest keyboard and 20 WPM on the largest. Experienced users improved to 21 WPM on the smallest keyboard and 32 WPM on the largest. These results indicate that, although slower, small touchscreen keyboards can be used for limited data entry when the presence of a regular keyboard is not practical. Applications include portable pocket-sized or palmtop computers, messaging systems, and personal information resources. Results also suggest the increased importance of experience on these smaller keyboards. Research directions are suggested. }, isbn = {0144-929X}, doi = {10.1080/01449299308924362}, url = {http://www.tandfonline.com/doi/abs/10.1080/01449299308924362}, author = {Sears,Andrew and REVIS,DOREEN and SWATSKI,JANET and CRITTENDEN,ROB and Shneiderman, Ben} } @article {12770, title = {A linear-time model-checking algorithm for the alternation-free modal mu-calculus}, journal = {Formal methods in system design}, volume = {2}, year = {1993}, month = {1993///}, pages = {121 - 147}, author = {Cleaveland, Rance and Steffen,B.} } @article {15630, title = {On The Maximum Number of Intersections of Two Polyhedra in 2 and 3 Dimensions}, journal = {Proceedings of the Fifth Canadian Conference on Computational Geometry, Waterloo, Ontario}, year = {1993}, month = {1993///}, pages = {49 - 54}, abstract = {We obtain exact bounds on the maximum number of in-tersections between two polygons with prescribed edge counts. In three dimensions, we obtain exact bounds on the number of intersecting face-pairs of two polyhe- dra with prescribed face counts when the polyhedra are convex, and lower bounds in the general case. }, author = {Dillencourt,M. B and Mount, Dave and Saalfeld,A.J.} } @article {16938, title = {A nonanthropomorphic style guide: overcoming the Humpty Dumpty syndrome}, journal = {Sparks of innovation in human-computer interaction}, year = {1993}, month = {1993///}, pages = {331 - 331}, author = {Shneiderman, Ben} } @article {18068, title = {Optimal doubly logarithmic parallel algorithms based on finding all nearest smaller values}, journal = {Journal of Algorithms}, volume = {14}, year = {1993}, month = {1993///}, pages = {344 - 370}, author = {Berkman,O. and Schieber,B. and Vishkin, Uzi} } @article {15554, title = {Point probe decision trees for geometric concept classes}, journal = {Algorithms and Data Structures}, year = {1993}, month = {1993///}, pages = {95 - 106}, abstract = {A fundamental problem in model-based computer vision is that of identifying to which of a given set of concept classes of geometric models an observed model belongs. Considering a ldquoproberdquo to be an oracle that tells whether or not the observed model is present at a given point in an image, we study the problem of computing efficient strategies (ldquodecision treesrdquo) for probing an image, with the goal to minimize the number of probes necessary (in the worst case) to determine in which class the observed model belongs. We prove a hardness result and give strategies that obtain decision trees whose height is within a log factor of optimal.These results grew out of discussions that began in a series of workshops on Geometric Probing in Computer Vision, sponsored by the Center for Night Vision and Electro-Optics, Fort Belvoir, Virginia, and monitored by the U.S. Army Research Office. The views, opinions, and/or findings contained in this report are those of the authors and should not be construed as an official Department of the Army position, policy, or decision, unless so designated by other documentation. }, doi = {10.1007/3-540-57155-8_239}, author = {Arkin,E. and Goodrich,M. and Mitchell,J. and Mount, Dave and Piatko,C. and Skiena,S.} } @conference {17325, title = {Potentials and limitations of pen-based computers}, booktitle = {Proceedings of the 1993 ACM conference on Computer science}, series = {CSC {\textquoteright}93}, year = {1993}, month = {1993///}, pages = {536 - 539}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {There are four possible genres of input devices that can be attached to personal workstations; keyboard, mouse, pen, and voice. For investigating potentials and limitations of pen-based computers, we propose to compare those four categories as different types of man-machine communication channel.Even though arrow keys allow a limited scope of 2D capability in keyboard usage, the primary use of a keyboard is typing. Typing generates a linear sequence of discrete characters. The maximum speed of typing is roughly 10 characters per second, hence the bandwidth of 100 (10{\texttimes}10) bps. A mouse is used primarily for pointing (menu item/object selection) and then for dragging (moving and re-sizing objects). Mouse pointing generates a discrete information of a point location on a 2D (planer) plane with the maximum speed of 2 clicking per second. Each pointing may generate 20 bits of information with the bandwidth of 40 (2{\texttimes}20) bps. Mouse dragging generates a continuous geometric pattern in 2D. Assuming the maximum rate of 40 selections per second in the eight (3 bits) possible directions of dragging, the bandwidth of mouse dragging peaks at 120 (40{\texttimes}3) bps. The usage of pen on a planer flat surface of LCD unit can be divided into scribing and tapping. By scribing we mean a generation of continuous pen strokes forming a character, a gesture, or a picture. Scribing includes drawing and gesturing. Tapping corresponds to a mouse clicking. Tapping may be considered as a special kind of gesture as in the PenPoint operating system. The bandwidth of scribing can be calculated in the same manner as for mouse dragging. With the maximum rate of 100 selections of direction per second for pen, scribing may produce strokes with the speed of 300 (100{\texttimes}3) bps. The bandwidth of pen tapping is almost the same as that of a mouse clicking except that a selection of a point is easier by a pen (3 tappings per second) than by a mouse (2 clickings per second). Talking through a microphone generates a linear sequence of continuous speech with a high degree of redundancy. Using the CELP speech compression algorithm, the bandwidth of normal speech can be reduced to 4800 bps. By vocal signaling we mean a generation of a sequence of discrete messages each of which consists of different pitches and loudness levels. The maximum rate of signaling could be 5 messages per second with 10 differentiable pitches and 10 levels of loudness producing the bandwidth of 35 (5{\texttimes}7) bps. Note that mouse dragging, pen scribing, and voice talking, each produces continuous data objects. Only after quantization by sampling, the data objects can be represented by discrete data structure. By precision we mean the degree of ease in duplicating the identical information using the same input technology. Keyboard is a high precision device because there is no difficulty in generating the same character over and over again. Drawing by a mouse is more difficult than drawing by a pen, because pen is easier to control than mouse. Precision of voice is low because it is difficult to duplicate the sound of the same pitch and the same volume. By latency we mean the set-up time necessary to start generating a stream of information. The latency of using keyboard and mouse is larger than the latency of using pen and voice. By translation we mean a process of converting the information generated by the input device into a sequence of discrete symbols, i.e., a transduction of a continuous data type to a discrete data type. Translation for a keyboard is not necessary. Translation of a mouse click on a menu item requires a finite table look-up which is rather simple operation. Translation of pen scribing and mouse dragging involves a handwriting recognition algorithm which is still a difficult problem at present time. Voice recognition is a very difficult problem. With the assumption that real-time translation is feasible for handwriting recognition and speech recognition, the efficiency of input device for text entry can be measured by how many characters can be entered in a second (cps). A simulated keyboard on CRT is used for entering text by a mouse. Long handwriting on a pen computer is used for a pen. When personal workstations become down-sized, the physical dimension of an input/output device becomes a dominant factor for the mobility of workstations. Keyboard and mouse are portable but intrusive. Wireless pen is mobile and less intrusive. Voice can be ubiquitous but intrusive. One conclusion we can draw from the above analysis is that pen is mightier than mouse. A pen can replace a mouse any time any place. However, keyboard, pen, and voice have different strong points and weak points. They compensate with each other. Therefore, we predict that future workstations will carry multi-modal user-interface with any combination of keyboard, pen, and voice. }, isbn = {0-89791-558-5}, doi = {10.1145/170791.171171}, url = {http://doi.acm.org/10.1145/170791.171171}, author = {Citrin,Wayne and Halbert,Dan and Hewitt,Carl and Meyrowitz,Norm and Shneiderman, Ben} } @article {17326, title = {Preface to Sparks of Innovation in Human-Computer Interaction}, journal = {Sparks of innovation in human-computer interaction}, year = {1993}, month = {1993///}, author = {Shneiderman, Ben} } @article {12035, title = {Probabilistic analysis of some navigation strategies in a dynamic environment}, journal = {Systems, Man and Cybernetics, IEEE Transactions on}, volume = {23}, year = {1993}, month = {1993///}, pages = {1465 - 1474}, author = {Sharma, R. and Mount, Dave and Aloimonos, J.} } @article {17332, title = {Protecting rights in user interface designs}, journal = {Sparks of innovation in human-computer interaction}, year = {1993}, month = {1993///}, pages = {351 - 351}, author = {Shneiderman, Ben} } @inbook {16223, title = {Remote direct manipulation: A case study of a telemedicine workstation}, booktitle = {Sparks of innovation in human-computer interactionSparks of innovation in human-computer interaction}, year = {1993}, month = {1993///}, pages = {51 - 51}, publisher = {Intellect Books}, organization = {Intellect Books}, isbn = {9781567500783}, author = {Keil-Slawik,R. and Plaisant, Catherine and Shneiderman, Ben} } @article {17351, title = {Restructuring knowledge for an electronic encyclopedia}, journal = {Sparks of innovation in human-computer interaction}, volume = {615}, year = {1993}, month = {1993///}, pages = {123 - 123}, author = {Kreitzberg,C.B. and Shneiderman, Ben} } @inbook {16221, title = {Scheduling home control devices: a case study of the transition from the research project to a product}, booktitle = {Sparks of innovation in human-computer interactionSparks of innovation in human-computer interaction}, year = {1993}, month = {1993///}, pages = {205 - 205}, publisher = {Intellect Books}, organization = {Intellect Books}, isbn = {9781567500783}, author = {Plaisant, Catherine and Shneiderman, Ben and Battagtia,J.} } @book {17376, title = {Sparks of innovation in human-computer interaction}, year = {1993}, month = {1993///}, publisher = {Intellect Books}, organization = {Intellect Books}, abstract = {These key papers from the 10th anniversary of the Human-Computer Interaction Laboratory (HCIL) at the University of Maryland, exemplify different research methodologies, and show the maturation of human-computer interaction research. The first section introduces how HCIL does what they do, including some of their failures and background stories that are not appropriate for journal papers. This book is a tribute to the faculty, staff, visitors, and students who have shared in a decade of work.}, keywords = {Computers / Interactive \& Multimedia, Computers / Social Aspects / Human-Computer Interaction, Human-computer interaction}, isbn = {9781567500783}, author = {Shneiderman, Ben} } @article {17377, title = {Speech versus mouse commands for word processing: an empirical evaluation}, journal = {International Journal of Man-Machine Studies}, volume = {39}, year = {1993}, month = {1993/10//}, pages = {667 - 687}, abstract = {Despite advances in speech technology, human factors research since the late 1970s has provided only weak evidence that automatic speech recognition devices are superior to conventional input devices such as keyboards and mice. However, recent studies indicate that there may be advantages to providing an additional input channel based on speech input to supplement the more common input modes. Recently the authors conducted an experiment to demonstrate the advantages of using speech-activated commands over mouse-activated commands for word processing applications when, in both cases, the keyboard is used for text entry and the mouse for direct manipulation. Sixteen experimental subjects, all professionals and all but one novice users of speech input, performed four simple word processing tasks using both input groups in this counterbalanced experiment. Performance times for all tasks were significantly faster when using speech to activate commands as opposed to using the mouse. On average, the reduction in task time due to using speech was 18{\textperiodcentered}7\%. The error rates due to subject mistakes were roughly the same for both input groups, and recognition errors, averaged over all the tasks, occurred for 6{\textperiodcentered}3\% of the speech-activated commands. Subjects made significantly more memorization errors when using speech as compared with the mouse for command activation. Overall, the subjects reacted positively to using speech input and preferred it over the mouse for command activation; however, they also voiced concerns about recognition accuracy, the interference of background noise, inadequate feedback and slow response time. The authors believe that the results of the experiment provide evidence for the utility of speech input for command activation in application programs.}, isbn = {0020-7373}, doi = {10.1006/imms.1993.1078}, url = {http://www.sciencedirect.com/science/article/pii/S0020737383710783}, author = {Karl,Lewis R. and Pettey,Michael and Shneiderman, Ben} } @article {16945, title = {A study of file manipulation by novices using commands vs, direct manipulation}, journal = {Sparks of innovation in human-computer interaction}, year = {1993}, month = {1993///}, pages = {39 - 39}, author = {Margono,S. and Shneiderman, Ben} } @article {17664, title = {Techniques for probabilistic analysis and randomness-efficient computation}, journal = {Computer Science Technical Reports, Cornell University}, year = {1993}, month = {1993/08//undefin}, abstract = {Randomness is well-recognized as an important computational resource in theoretical computer science. Not only are there classical problems for which the only known "efficient" solutions are randomized, but there are problems for which randomness can be used to circumvent deterministic lower bounds. However, standard tools available for probabilistic analysis such as the Chernoff-Hoeffding bounds are not sufficiently powerful in all situations; second, since there are no known "true" sources of randomness, there is a need to develop general techniques for reducing/removing randomness from randomized algorithms. This thesis addresses these two issues. Certain types of scheduling and resource allocation problems in a distributed setting can be modeled as edge coloring problems. In Chapter 2, we present a fast and simple randomized algorithm for edge coloring a graph, in the synchronous distributed point-to-point model of computation. Our algorithm computes an edge-coloring of a graph $G$ with $n$ nodes and maximum degree $\Delta$ with at most $(1.6 + \epsilon) \Delta + O(\log^{2+\delta} n)$ colors with high probability, for any fixed $\epsilon, \delta, greater than 0$. To analyze our algorithm, we introduce techniques for proving upper bounds on the tails of random variables, extending the Chernoff-Hoeffding (CH) bounds to some types of dependent random variables. This is joint work with A. Panconesi [91]. In Chapter 3, we show that the CH bounds for the tails of the sums of bounded and independent random variables $X_{1}, \ldots, X_{n}$ require only limited independence among the $X_{i}$s. We show that if $X_{1}, \ldots, X_{n}$ lie in [0,1] and are $k$-wise independent, then $Pr(X \geq E[\sum_{i}X_{i}](1 + \delta))$ can be upper bounded by the CH bound, if $k \geq \mu \cdot min\{\delta,\delta^{2}\}$. This leads to algorithms that require a reduced amount of randomness for any analysis which uses the CH bounds. This is joint work with J.P. Schmidt and A. Siegel [108]. In Chapter 4, we present an $RNC^{2}$ algorithm for the perfect matching problem which uses $O(\log Z)$ random bits where $Z$ is any given upper bound on the number of perfect matchings in the graph, generalizing results of Grigoriev and Karpinski. Underlying our algorithm is a randomness-optimal generalization of the Isolating Lemma of Mulmuley, Vazirani and Vazirani, which also leads to other applications. This is joint work with S. Chari and P. Rohatgi [26].}, author = {Srinivasan, Aravind} } @article {17432, title = {Touchscreens now offer compelling uses}, journal = {Sparks of innovation in human-computer interaction}, year = {1993}, month = {1993///}, pages = {187 - 187}, author = {Shneiderman, Ben} } @article {17440, title = {Treemaps}, journal = {Sparks of innovation in human-computer interaction}, volume = {284}, year = {1993}, month = {1993///}, pages = {309 - 309}, author = {Johnson,B. and Shneiderman, Ben} } @article {17466, title = {User interface consistency: an evaluation of original and revised interfaces for a videodisk library}, journal = {Sparks of innovation in human-computer interaction}, year = {1993}, month = {1993///}, pages = {259 - 259}, author = {Chimera,R. and Shneiderman, Ben} } @article {16782, title = {Using differential technlques to efficiently support transaction time}, journal = {The VLDB JournalVLDB Journal}, volume = {2}, year = {1993}, month = {1993/01//}, pages = {75 - 111}, isbn = {1066-8888}, doi = {10.1007/BF01231799}, url = {http://dl.acm.org/citation.cfm?id=615162}, author = {Jensen,Christian S. and Mark,Leo and Roussopoulos, Nick and Sells,Timos} } @conference {15044, title = {Using Synthetic-Perturbation Techniques for Tuning Shared Memory Programs}, booktitle = {Parallel Processing, 1993. ICPP 1993. International Conference on}, volume = {2}, year = {1993}, month = {1993/08//}, pages = {2 - 10}, abstract = {The Synthetic-Perturbation Tuning (SPT) methodology is base d on compirical approach that introduces artificial delays into the MIMD program and captures the effects of such delays by using the modrn branch statistics called design of experiments.}, doi = {10.1109/ICPP.1993.184}, author = {Snelick,Robert and JaJa, Joseph F. and Kacker,Raghu and Lyon,Gordon} } @conference {16976, title = {Anthropomorphism: from Eliza to Terminator 2}, booktitle = {Proceedings of the SIGCHI conference on Human factors in computing systems}, series = {CHI {\textquoteright}92}, year = {1992}, month = {1992///}, pages = {67 - 70}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, isbn = {0-89791-513-5}, doi = {10.1145/142750.142760}, url = {http://doi.acm.org/10.1145/142750.142760}, author = {Don,Abbe and Brennan,Susan and Laurel,Brenda and Shneiderman, Ben} } @article {14199, title = {Behavioral Visual Motion Analysis,"}, journal = {Proceedings, DARPA Image Understanding Workshop}, year = {1992}, month = {1992///}, pages = {521 - 541}, author = {Aloimonos, J. and Duri{\c c},Z. and Ferm{\"u}ller, Cornelia and Huang, L. and Rivlin,E. and Sharma, R.} } @article {16567, title = {A competitive distribution theory of neocortical dynamics}, journal = {Neural Computation}, volume = {4}, year = {1992}, month = {1992///}, pages = {287 - 317}, author = {Reggia, James A. and D{\textquoteright}Autrechy,C. L and Sutton III,G. G. and Weinrich,M.} } @article {12044, title = {Coordinated motion planning: the warehouseman{\textquoteright}s problem with constraints on free space}, journal = {Systems, Man and Cybernetics, IEEE Transactions on}, volume = {22}, year = {1992}, month = {1992///}, pages = {130 - 141}, author = {Sharma, R. and Aloimonos, J.} } @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} } @inbook {17119, title = {Education by engagement and construction: a strategic education initiative for a multimedia renewal of American education}, booktitle = {Sociomedia: Hypermedia, Multimedia and the Social Creation of KnowledgeSociomedia: Hypermedia, Multimedia and the Social Creation of Knowledge}, year = {1992}, month = {1992///}, pages = {13 - 26}, author = {Shneiderman, Ben} } @conference {15207, title = {Efficient minimum cost matching using quadrangle inequality}, booktitle = {Foundations of Computer Science, 1992. Proceedings., 33rd Annual Symposium on}, year = {1992}, month = {1992/10//}, pages = {583 - 592}, abstract = {The authors present efficient algorithms for finding a minimum cost perfect matching, and for solving the transportation problem in bipartite graphs, G = (Red cup; Blue, Red times; Blue), where |Red| = n, |Blue| = m, n les; m, and the cost function obeys the quadrangle inequality. The first results assume that all the red points and all the blue points lie on a curve that is homeomorphic to either a line or a circle and the cost function is given by the Euclidean distance along the curve. They present a linear time algorithm for the matching problem. They generalize the method to solve the corresponding transportation problem in O((m+n)log(m+n)) time. The next result is an O(n log m) algorithm for minimum cost matching when the cost array is a bitonic Monge array. An example of this is when the red points lie on one straight line and the blue points lie on another straight line (that is not necessarily parallel to the first one). Finally, they provide a weakly polynomial algorithm for the transportation problem in which the associated cost array is a bitonic Monge array}, keywords = {algorithm;, array;, bipartite, bitonic, blue, complexity;, computational, cost, distance;, Euclidean, function;, geometry;, graph, graphs;, inequality;, linear, MATCHING, matching;, minimisation;, minimum, Monge, perfect, points;, polynomial, problem;, quadrangle, red, theory;, TIME, transportation, transportation;, weakly}, doi = {10.1109/SFCS.1992.267793}, author = {Aggarwal,A. and Bar-Noy,A. and Khuller, Samir and Kravets,D. and Schieber,B.} } @conference {16502, title = {Experiments on the concurrent rule execution in database systems}, booktitle = {Tools with Artificial Intelligence, 1992. TAI{\textquoteright}92, Proceedings., Fourth International Conference on}, year = {1992}, month = {1992///}, pages = {405 - 412}, author = {Delis,A. and Raschid, Louiqa and Sellis,T.} } @conference {17597, title = {Fast randomized algorithms for distributed edge coloring}, booktitle = {Proceedings of the eleventh annual ACM symposium on Principles of distributed computing}, series = {PODC {\textquoteright}92}, year = {1992}, month = {1992///}, pages = {251 - 262}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, isbn = {0-89791-495-3}, doi = {10.1145/135419.135465}, url = {http://doi.acm.org/10.1145/135419.135465}, author = {Panconesi,Alessandro and Srinivasan, Aravind} } @book {16924, title = {A formative evaluation of three interfaces for browsing directories using dynamic queries}, year = {1992}, month = {1992///}, publisher = {University of Maryland, Center for Automation Research, Computer Vision Laboratory}, organization = {University of Maryland, Center for Automation Research, Computer Vision Laboratory}, author = {Liao,H.S. and Osada,M. and Shneiderman, Ben} } @article {17546, title = {A Generalization of Brooks{\textquoteright} Theorem}, journal = {Computer Science Technical Reports}, year = {1992}, month = {1992/09//}, abstract = {Given a connected graph $G = (V, E)$ with $n$ vertices and maximum degree $\Delta$ such that $\Delta \geq$ 3 and $G$ is not a complete graph, Brooks{\textquoteright} theorem shows that $G$ is $\Delta$-colorable. We prove a generalization of this theorem: assume inductively that all but one vertex $v$ is colored; then, $v$ can be colored by considering the vertices (and their colors) in just an $O$ (log $n$) radius around $v$. Our proof uses a probabilistic technique to link the connectivity and diameter of "almost-regular" graphs, which could have other applications too.}, author = {Srinivasan, Aravind} } @book {16928, title = {A Graphical Filter/flow Representation of Boolean Queries: A Prototype Implementation}, year = {1992}, month = {1992///}, publisher = {University of Maryland, Center for Automation Research, Computer Vision Laboratory}, organization = {University of Maryland, Center for Automation Research, Computer Vision Laboratory}, author = {Young,D. and Shneiderman, Ben} } @conference {17611, title = {Improved distributed algorithms for coloring and network decomposition problems}, booktitle = {Proceedings of the twenty-fourth annual ACM symposium on Theory of computing}, series = {STOC {\textquoteright}92}, year = {1992}, month = {1992///}, pages = {581 - 592}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, isbn = {0-89791-511-9}, doi = {10.1145/129712.129769}, url = {http://doi.acm.org/10.1145/129712.129769}, author = {Panconesi,Alessandro and Srinivasan, Aravind} } @article {15206, title = {On independent spanning trees}, journal = {Information Processing Letters}, volume = {42}, year = {1992}, month = {1992/07/24/}, pages = {321 - 323}, abstract = {We prove that if any k-vertex connected graph has k vertex independent spanning trees, then any k-edge connected graph has k edge independent spanning trees. Thus, answering a question raised by Zehavi and Itai [J. Graph Theory 13 (1989)] in the affirmative.}, keywords = {combinatorial problems, edge connectivity, spanning trees, vertex connectivity}, isbn = {0020-0190}, doi = {10.1016/0020-0190(92)90230-S}, url = {http://www.sciencedirect.com/science/article/pii/002001909290230S}, author = {Khuller, Samir and Schieber,Baruch} } @conference {16654, title = {Lateral cortical inhibition without lateral inhibitory connections}, booktitle = {Neural Networks, 1992. IJCNN., International Joint Conference on}, volume = {3}, year = {1992}, month = {1992/06//}, pages = {415 -420 vol.3 - 415 -420 vol.3}, abstract = {The authors consider how a set of neurons forming a cortical column, none of which individually can competitively distribute its activity, can function collectively to produce competitive distribution of activation. To address this issue, they describe a model cortical column composed of three populations of excitatory neurons that collectively distribute their activity competitively. The idea of competitive distribution and the neural circuitry that could bring it about are described. Computer simulation results, implications, and testable predictions of the theory are presented}, keywords = {brain models, competitive distribution of activation, digital simulation, excitatory neurons, lateral cortical inhibition, neural circuitry, neurophysiology, physiological models}, doi = {10.1109/IJCNN.1992.227139}, author = {Reggia, James A. and Sutton,G. and D{\textquoteright}Autrechy,C. L and Weinrich,M.} } @conference {17866, title = {Model-driven mapping onto distributed memory parallel computers}, booktitle = {Proceedings of the 1992 ACM/IEEE conference on Supercomputing}, year = {1992}, month = {1992///}, pages = {818 - 829}, author = {Sussman, Alan} } @conference {18406, title = {On the nature of bias and defects in the software specification process}, booktitle = {Computer Software and Applications Conference, 1992. COMPSAC {\textquoteright}92. Proceedings., Sixteenth Annual International}, year = {1992}, month = {1992/09//}, pages = {17 - 24}, abstract = {Implementation bias in a specification is an arbitrary constraint in the solution space. The authors describe the problem of bias and then present a model of the specification and design processes describing individual subprocesses in terms of precision/detail programs, and a model of bias in multi-attribute software specifications. While studying how bias is introduced into a specification it was realized that software defects and bias are dual problems of a single phenomenon. This has been used to explain the large proportion of faults found during the coding phase at the Software Engineering Laboratory at NASA Goddard Space Flight Center}, keywords = {Center;NASA;Software, defects;software, engineering, Flight, Goddard, Laboratory;bias;coding, phase;design, processes;multiattribute, reliability;, reliability;formal, software, space, specification;software}, doi = {10.1109/CMPSAC.1992.217609}, author = {Straub,P. and Zelkowitz, Marvin V} } @article {16225, title = {A new era for high precision touchscreens}, journal = {Advances in human-computer interaction}, volume = {3}, year = {1992}, month = {1992///}, pages = {1 - 33}, abstract = {While many input devices allow interfaces to be customized, increased directness distinguishes touchscreens. Touchscreens are easy to learn to use, fast, and result in low error rates when interfaces are designed carefully. Many actions which are diffi cult with a mouse, joystick, or keyboard are simple when using a touchscreen. Making rapid selections at widely separated locations on the screen, signing your name, dragging the hands of a clock in a circular motion are all simple when using a touchscre en, but may be awkward using other devices. This paper presents recent empirical research which can provide a basis for theories of touchscreen usage. We believe recent improvements warrant increased use of touchscreens.}, author = {Sears,A. and Plaisant, Catherine and Shneiderman, Ben} } @article {16226, title = {A new era for touchscreen applications: High precision, dragging icons, and refined feedback}, journal = {Advances in Human-Computer Interaction}, volume = {3}, year = {1992}, month = {1992///}, author = {Sears,A. and Plaisant, Catherine and Shneiderman, Ben} } @article {16441, title = {A parallel pipelined strategy for evaluating linear recursive predicates in a multiprocessor environment.}, journal = {J. Parallel Distrib. Comput.}, volume = {14}, year = {1992}, month = {1992///}, pages = {146 - 162}, author = {Raschid, Louiqa and Su,S. Y.W} } @article {17830, title = {PARTI primitives for unstructured and block structured problems}, journal = {Computing Systems in Engineering}, volume = {3}, year = {1992}, month = {1992///}, pages = {73 - 86}, abstract = {This paper describes a set of primitives (PARTI) developed to efficiently execute unstructured and block structured problems on distributed memory parallel machines. We present experimental data from a three-dimensional unstructured Euler solver run on the Intel Touchstone Delta to demonstrate the usefulness of our methods.}, isbn = {0956-0521}, doi = {10.1016/0956-0521(92)90096-2}, url = {http://www.sciencedirect.com/science/article/pii/0956052192900962}, author = {Sussman, Alan and Saltz, J. and Das,R. and Gupta,S. and Mavriplis,D. and Ponnusamy,R. and Crowley,K.} } @conference {17935, title = {Real-time procedural textures}, booktitle = {Proceedings of the 1992 symposium on Interactive 3D graphics}, series = {I3D {\textquoteright}92}, year = {1992}, month = {1992///}, pages = {95 - 100}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, isbn = {0-89791-467-8}, doi = {10.1145/147156.147171}, url = {http://doi.acm.org/10.1145/147156.147171}, author = {Rhoades,John and Turk,Greg and Bell,Andrew and State,Andrei and Neumann,Ulrich and Varshney, Amitabh} } @article {16224, title = {Scheduling home control devices: design issues and usability evaluation of four touchscreen interfaces}, journal = {International Journal of Man-Machine Studies}, volume = {36}, year = {1992}, month = {1992/03//}, pages = {375 - 393}, abstract = {This article describes four different user interfaces supporting scheduling two-state (ON/OFF) devices over time periods ranging from minutes to days. The touchscreen-based user interfaces including a digital 12-h clock, 24-h linear and 24-h dial prototypes are described and compared on a feature by feature basis. A formative usability test with 14 subjects, feedback from more than 30 reviewers, and the flexibility to add functions favour the 24-h linear version.}, isbn = {0020-7373}, doi = {10.1016/0020-7373(92)90040-R}, url = {http://www.sciencedirect.com/science/article/pii/002073739290040R}, author = {Plaisant, Catherine and Shneiderman, Ben} } @article {17971, title = {Six Generations of Building Walkthrough: Final Technical Report to the National Science Foundation}, year = {1992}, month = {1992///}, institution = {University of North Carolina at Chapel Hill}, address = {Chapel Hill, NC, USA}, author = {Brooks,Frederick P. and Airey,John and Alspaugh,John and Bell,Andrew and Brown,Randolph and Hill,Curtis and Nimscheck,Uwe and Rheingans,Penny and Rohlf,John and Smith,Dana and Turner,Douglass and Varshney, Amitabh and Wang,Yulan and Weber,Hans and Yuan,Xialin} } @article {17372, title = {Socially responsible computing I: a call to action following the LA riots}, journal = {ACM SIGCHI Bulletin}, volume = {24}, year = {1992}, month = {1992///}, pages = {14 - 15}, author = {Shneiderman, Ben} } @article {17373, title = {Socially responsible computing II: first steps on the path to positive contributions}, journal = {ACM SIGCHI Bulletin}, volume = {24}, year = {1992}, month = {1992/07//}, pages = {16 - 17}, abstract = {Now that we are past the initial emotional responses to the LA riots, maybe we can use these tragic events as a stimulus for innovative and constructive efforts. Computing professionals have been active in social causes on an individual basis and in some large projects, but with the growing maturity of our industry we can promote larger initiatives and accept greater responsibility.}, isbn = {0736-6906}, doi = {10.1145/134421.134432}, url = {http://doi.acm.org/10.1145/134421.134432}, author = {Shneiderman, Ben} } @article {19000, title = {Splicing signals in Drosophila: intron size, information content, and consensus sequences}, journal = {Nucleic Acids ResearchNucl. Acids Res.}, volume = {20}, year = {1992}, month = {1992/08/25/}, pages = {4255 - 4262}, abstract = {A database of 209 Drosophila Introns was extracted from Genbank (release number 64.0) and examined by a number of methods in order to characterize features that might serve as signals for messenger RNA splicing. A tight distribution of sizes was observed: while the smallest introns in the database are 51 nucleotides, more than half are less than 80 nucleotides in length, and most of these have lengths in the range of 59 {\textendash} 67 nucleotides. Drosophila splice sites found in large and small introns differ in only minor ways from each other and from those found in vertebrate Introns. However, larger introns have greater pyrimidlne-richness in the region between 11 and 21 nucleotides upstream of 3' splice sites. The Drosophila branchpoint consensus matrix resembles C T A A T (in which branch formation occurs at the underlined A), and differs from the corresponding mammalian signal in the absence of G at the position immediately preceding the branchpoint. The distribution of occurrences of this sequence suggests a minimum distance between 5' splice shies and branchpoints of about 38 nucleotides, and a minimum distance between 3' splice sites and branchpoints of 15 nucleotides. The methods we have used detect no information in exon sequences other than in the few nucleotides immediately adjacent to the splice sites. However, Drosophila resembles many other species in that there is a discontinuity in A + T content between exons and introns, which are A + T rich.}, isbn = {0305-1048, 1362-4962}, doi = {10.1093/nar/20.16.4255}, url = {http://nar.oxfordjournals.org/content/20/16/4255}, author = {Mount, Stephen M. and Burks,Christian and Herts,Gerald and Stormo,Gary D. and White,Owen and Fields,Chris} } @article {17382, title = {Structural analysis of hypertexts: identifying hierarchies and useful metrics}, journal = {ACM Transactions on Information Systems}, volume = {10}, year = {1992}, month = {1992/04//}, pages = {142 - 180}, abstract = {Hypertext users often suffer from the {\textquotedblleft}lost in hyperspace{\textquotedblright} problem: disorientation from too many jumps while traversing a complex network. One solution to this problem is improved authoring to create more comprehensible structures. This paper proposes several authoring tools, based on hypertext structure analysis.In many hypertext systems authors are encouraged to create hierarchical structures, but when writing, the hierarchy is lost because of the inclusion of cross-reference links. The first part of this paper looks at ways of recovering lost hierarchies and finding new ones, offering authors different views of the same hypertext. The second part helps authors by identifying properties of the hypertext document. Multiple metrics are developed including compactness and stratum. Compactness indicates the intrinsic connectedness of the hypertext, and stratum reveals to what degree the hypertext is organized so that some nodes must be read before others. Several existing hypertexts are used to illustrate the benefits of each technique. The collection of techniques provides a multifaceted view of the hypertext, which should allow authors to reduce undesired structural complexity and create documents that readers can traverse more easily. }, keywords = {graph theory, hierarchies, hypertext, metrics, structural analysis}, isbn = {1046-8188}, doi = {10.1145/146802.146826}, url = {http://doi.acm.org/10.1145/146802.146826}, author = {Botafogo,Rodrigo A. and Rivlin,Ehud and Shneiderman, Ben} } @article {12776, title = {Testing preorders for probabilistic processes}, journal = {Automata, Languages and Programming}, year = {1992}, month = {1992///}, pages = {708 - 719}, author = {Cleaveland, Rance and Smolka,S. and Zwarico,A.} } @article {16230, title = {Touchscreen interfaces for alphanumeric data entry}, journal = {Human Factors and Ergonomics Society Annual Meeting Proceedings}, volume = {36}, year = {1992}, month = {1992///}, pages = {293 - 297}, author = {Plaisant, Catherine and Sears,A.} } @article {17437, title = {Tree visualization with tree-maps: 2-d space-filling approach}, journal = {ACM Transactions on Graphics}, volume = {11}, year = {1992}, month = {1992/01//}, pages = {92 - 99}, isbn = {0730-0301}, doi = {10.1145/102377.115768}, url = {http://doi.acm.org/10.1145/102377.115768}, author = {Shneiderman, Ben} } @conference {12172, title = {Two miniature pan-tilt devices}, booktitle = {Robotics and Automation, 1992. Proceedings., 1992 IEEE International Conference on}, year = {1992}, month = {1992///}, pages = {658 - 663}, author = {Bederson, Benjamin B. and Wallace,R.S. and Schwartz,E.L.} } @conference {12193, title = {Voice-bandwidth visual communication through logmaps: the Telecortex}, booktitle = {Applications of Computer Vision, Proceedings, 1992., IEEE Workshop on}, year = {1992}, month = {1992///}, pages = {4 - 10}, author = {Wallace,R.S. and Bederson, Benjamin B. and Schwartz,E.L.} } @conference {16781, title = {An algebra and calculus for relational multidatabase systems}, booktitle = {, First International Workshop on Interoperability in Multidatabase Systems, 1991. IMS {\textquoteright}91. Proceedings}, year = {1991}, month = {1991/04//}, pages = {118 - 124}, publisher = {IEEE}, organization = {IEEE}, abstract = {With the existence of many autonomous databases widely accessible through computer networks, users will require the capability to jointly manipulate data in different databases. A multidatabase system provides such a capability through a multidatabase manipulation language. The authors propose a theoretical foundation for such languages by presenting a multirelational algebra and calculus based on the relational algebra and calculus. The proposal is illustrated by various queries on an example multidatabase}, keywords = {Algebra, autonomous databases, Calculus, Computer networks, Computer science, Data models, Data structures, Database systems, database theory, distributed databases, Military computing, multidatabase manipulation language, multidatabase system, multirelational algebra, query languages, relational algebra, Relational databases, Spatial databases, theoretical foundation}, isbn = {0-8186-2205-9}, doi = {10.1109/IMS.1991.153694}, author = {Grant,J. and Litwin,W. and Roussopoulos, Nick and Sellis,T.} } @article {15574, title = {Combinatorial and computational aspects of Minkowski decompositions}, journal = {Contemporary Mathematics}, volume = {119}, year = {1991}, month = {1991///}, pages = {107 - 124}, author = {Mount, Dave and Silverman,R.} } @article {16622, title = {Competitive activation mechanisms in connectionist models}, journal = {Advances in control networks and large-scale parallel distributed processing models}, volume = {1}, year = {1991}, month = {1991///}, pages = {119 - 119}, author = {Reggia, James A. and Sutton,G. and Cho,S.} } @article {12819, title = {Computing behavioural relations, logically}, journal = {Automata, Languages and Programming}, year = {1991}, month = {1991///}, pages = {127 - 138}, author = {Cleaveland, Rance and Steffen,B.} } @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} } @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.} } @inbook {17118, title = {Editing to structure a reader{\textquoteright}s experience}, booktitle = {Hypertext/hypermedia handbookHypertext/hypermedia handbook}, year = {1991}, month = {1991///}, pages = {143 - 164}, author = {Shneiderman, Ben and Kreitzberg,C. and Berk,E.} } @article {17589, title = {Efficient algorithms for the minimum weighted dominating clique problem on permutation graphs}, journal = {Theoretical Computer Science}, volume = {91}, year = {1991}, month = {1991/12/09/}, pages = {1 - 21}, abstract = {Given a graph G=(V, E) with real weights assigned to its vertices, a clique of G that also dominates its vertex set V, is called a dominating clique (DC) of G. Given a permutation graph G with all its vertices having nonnegative weights, and its permutation representation, the problem addressed in this paper is that of finding any minimum weight DC of G. We improve the existing O(|V|2) algorithm for this problem to O(|V|log|V|). The space complexity of our algorithm is O(|V|). We also present a |V| processor, O(log|V|) time, O(|V|log|V|) space parallel EREW PRAM algorithm for this problem.}, isbn = {0304-3975}, doi = {10.1016/0304-3975(91)90265-4}, url = {http://www.sciencedirect.com/science/article/pii/0304397591902654}, author = {Srinivasan, Aravind and Pandu Rangan,C.} } @article {17137, title = {ESP{\textquoteright}91 Panel on The Best of ESP}, journal = {Empirical studies of programmers: fourth workshop}, year = {1991}, month = {1991///}, pages = {1 - 1}, author = {Zweben,S. and Curtis,B. and Shneiderman, Ben} } @article {17634, title = {On finding the minimum bandwidth of interval graphs}, journal = {Information and Computation}, volume = {95}, year = {1991}, month = {1991/12//}, pages = {218 - 224}, abstract = {Let G = (V, E) be an interval graph, with |V| = n, and |E| = m. An O(n2 log n) algorithm was proposed in Kratsch (Inform Comput. 74, 140{\textendash}158 (1987)) to find the bandwidth of G. We show that this algorithm is wrong, and provide a corrected version of the same. Also, it was observed in [4] that the bandwidth of a proper interval graph can be computed in O(n log n + m) time. We show how this idea can be modified slightly to yield an O(n = m) algorithm.}, isbn = {0890-5401}, doi = {10.1016/0890-5401(91)90045-4}, url = {http://www.sciencedirect.com/science/article/pii/0890540191900454}, author = {Mahesh,R. and Rangan,C.Pandu and Srinivasan, Aravind} } @book {12786, title = {Gdr: A visualization tool for graph algorithms}, year = {1991}, month = {1991///}, publisher = {Citeseer}, organization = {Citeseer}, author = {Stallmann,M. and Cleaveland, Rance and Hebbar,P.} } @article {17190, title = {High precision touchscreens: design strategies and comparisons with a mouse}, journal = {International Journal of Man-Machine Studies}, volume = {34}, year = {1991}, month = {1991/04//}, pages = {593 - 613}, abstract = {Three studies were conducted comparing speed of performance, error rates and user preference ratings for three selection devices. The devices tested were a touchscreen, a touchscreen with stabilization (stabilization software filters and smooths raw data from hardware), and a mouse. The task was the selection of rectangular targets 1, 4, 16 and 32 pixels per side (0{\textperiodcentered}4 {\texttimes} 0{\textperiodcentered}6, 1{\textperiodcentered}7 {\texttimes} 2{\textperiodcentered}2, 6{\textperiodcentered}9 {\texttimes} 9{\textperiodcentered}0, 13{\textperiodcentered}8 {\texttimes} 17{\textperiodcentered}9 mm respectively). Touchscreen users were able to point at single pixel targets, thereby countering widespread expectations of poor touchscreen resolution. The results show no difference in performance between the mouse and touchscreen for targets ranging from 32 to 4 pixels per side. In addition, stabilization significantly reduced the error rates for the touchscreen when selecting small targets. These results imply that touchscreens, when properly used, have attractive advantages in selecting targets as small as 4 pixels per size (approximately one-quarter of the size of a single character). A variant of Fitts{\textquoteright} Law is proposed to predict touchscreen pointing times. Ideas for future research are also presented.}, isbn = {0020-7373}, doi = {10.1016/0020-7373(91)90037-8}, url = {http://www.sciencedirect.com/science/article/pii/0020737391900378}, author = {Sears,Andrew and Shneiderman, Ben} } @article {17206, title = {Human values and the future of technology: a declaration of responsibility}, journal = {ACM SIGCHI Bulletin}, volume = {23}, year = {1991}, month = {1991/01//}, pages = {11 - 16}, abstract = {"We must learn to balance the material wonders of technology with the spiritual demands of our human nature."---John Naisbitt (1982).We can make a difference in shaping the future by ensurin g that computers "serve human needs (Mumford, 1934)." By making explicit the enduring values that we hold dear we can guide computer system designers and developers for the next decade, century, and thereafter. After setting our high-level goals we can pursue the components and seek the process for fulfilling them.High-level goals might include peace, excellent health care, adequate nutrition, accessible education, communication, freedom of expression, support for creative exploration, safety, and socially constructive entertainment. Computer technology can help attain these high-level goals if we clearly state measurable objectives, obtain participation of professionals, and design effective human-computer interfaces. Design considerations include adequate attention to individual differences among users, support of social and organizational structures, design for reliability and safety, provision of access by the elderly, handicapped, or illiterate, and appropriate user controlled adaptation. With suitable theories and empirical research we can achieve ease of learning, rapid performance, low error rates, and good retention over time, while preserving high subjective satisfaction.To raise the consciousness of designers and achieve these goals, we must generate an international debate, stimulate discussions within organizations, and interact with other intellectual communities. This paper calls for a focus on the "you" and "I" in developing improved user interface (UI) research and systems, offers a Declaration of Responsibility, and proposes a Social Impact Statement for major computing projects.}, isbn = {0736-6906}, doi = {10.1145/122672.122674}, url = {http://doi.acm.org/10.1145/122672.122674}, author = {Shneiderman, Ben} } @conference {17218, title = {Identifying aggregates in hypertext structures}, booktitle = {Proceedings of the third annual ACM conference on Hypertext}, series = {HYPERTEXT {\textquoteright}91}, year = {1991}, month = {1991///}, pages = {63 - 74}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, isbn = {0-89791-461-9}, doi = {10.1145/122974.122981}, url = {http://doi.acm.org/10.1145/122974.122981}, author = {Botafogo,Rodrigo A. and Shneiderman, Ben} } @conference {16332, title = {Metric-driven analysis and feedback systems for enabling empirically guided software development}, booktitle = {Proceedings of the 13th international conference on Software engineering}, year = {1991}, month = {1991///}, pages = {288 - 298}, author = {Selby,R. W and Porter, Adam and Schmidt,D. C and Berney,J.} } @article {11930, title = {Modeling of cross traffic in conjunction with deterministic analysis of queues}, year = {1991}, month = {1991///}, institution = {University of Maryland at College Park}, address = {College Park, MD, USA}, author = {Agrawala, Ashok K. and Sanghi,Dheeraj} } @article {11989, title = {A multi-frame approach to visual motion perception}, journal = {International Journal of Computer Vision}, volume = {6}, year = {1991}, month = {1991///}, pages = {245 - 255}, author = {Spetsakis, M. and Aloimonos, J.} } @conference {16232, title = {Scheduling on-off home control devices}, booktitle = {Proceedings of the SIGCHI conference on Human factors in computing systems: Reaching through technology}, series = {CHI {\textquoteright}91}, year = {1991}, month = {1991///}, pages = {459 - 460}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, isbn = {0-89791-383-3}, doi = {10.1145/108844.109002}, url = {http://doi.acm.org/10.1145/108844.109002}, author = {Plaisant, Catherine and Shneiderman, Ben} } @article {16947, title = {A taxonomy and rule base for the selection of interaction styles}, journal = {Human factors for informatics usability}, year = {1991}, month = {1991///}, pages = {325 - 325}, author = {Shneiderman, Ben} } @article {17430, title = {Touch screens now offer compelling uses}, journal = {IEEE Software}, volume = {8}, year = {1991}, month = {1991/03//}, pages = {93 - 94}, abstract = {Research on improving the user interfaces of touch screen applications is described. The advantages of touch screens are discusses, their current capabilities are examined, and possible future developments are considered.<>}, keywords = {Application software, Computer aided instruction, Computer displays, Computer science, Cultural differences, Fingers, future developments, information resources, Marketing and sales, Mice, Psychology, touch screen applications, touch sensitive screens, User interfaces}, isbn = {0740-7459}, doi = {10.1109/52.73754}, author = {Shneiderman, Ben} } @conference {17438, title = {Tree-maps: a space-filling approach to the visualization of hierarchical information structures}, booktitle = {, IEEE Conference on Visualization, 1991. Visualization {\textquoteright}91, Proceedings}, year = {1991}, month = {1991/10/22/25}, pages = {284 - 291}, publisher = {IEEE}, organization = {IEEE}, abstract = {A method for visualizing hierarchically structured information is described. The tree-map visualization technique makes 100\% use of the available display space, mapping the full hierarchy onto a rectangular region in a space-filling manner. This efficient use of space allows very large hierarchies to be displayed in their entirety and facilitates the presentation of semantic information. Tree-maps can depict both the structure and content of the hierarchy. However, the approach is best suited to hierarchies in which the content of the leaf nodes and the structure of the hierarchy are of primary importance, and the content information associated with internal nodes is largely derived from their children}, keywords = {Computer displays, Computer Graphics, Computer science, Data analysis, display space, Educational institutions, Feedback, hierarchical information structures, HUMANS, Laboratories, Libraries, Marine vehicles, rectangular region, semantic information, space-filling approach, tree-map visualization technique, trees (mathematics), Two dimensional displays, Visualization}, isbn = {0-8186-2245-8}, doi = {10.1109/VISUAL.1991.175815}, author = {Johnson,B. and Shneiderman, Ben} } @article {17510, title = {Window control strategies for hypertext traversal: An empirical study}, journal = {Proc. 29th Annual ACM DC Technical Symposium}, year = {1991}, month = {1991///}, abstract = {Nowadays, larger and higher resolution screens supporting multiple windows are widely available. They are often used to traverse hypertext databases for fact retrieval, education or casual browsing. This paper describes a study comparing two methods of window control strategies for article placement in four, equal sized and tiled windows (By tiled we mean non-overlapping, non-movable and non-resizable windows, which together cover the entire screen.) The first placement strategy - Automatic Panning (A P) - was controlled by the system software and the second placement strategy - User Controlled Placement (UCP) - trasferred control to the users. The task required subjects to answer questions about the content of a hypertext. Statistical analysis shows that subjective preference was significantly higher and amount of backtracking was significantly lower for the user controlled placement. Speed differences did not prove to be significant, although there was consistent tendency favoring the automatic pa nning strategy.}, author = {Lifshitz,J. and Shneiderman, Ben} } @article {17403, title = {The advantages of hypertext for large information spaces; where are the big systems?}, journal = {Hypertext: concepts, systems and applications: proceedings of the First European Conference on Hypertext, INRIA, France, November 1990}, year = {1990}, month = {1990///}, pages = {343 - 343}, author = {Shneiderman, Ben and Deter,R.} } @conference {16568, title = {Competitive learning using competitive activation rules}, booktitle = {Neural Networks, 1990., 1990 IJCNN International Joint Conference on}, year = {1990}, month = {1990///}, pages = {285 - 291}, author = {Sutton III,G. G. and Reggia, James A. and Maisog,J. M} } @article {15731, title = {Computing the eigenvalues and eigenvectors of symmetric arrowhead matrices}, journal = {Journal of Computational Physics}, volume = {90}, year = {1990}, month = {1990/10//}, pages = {497 - 505}, isbn = {0021-9991}, doi = {10.1016/0021-9991(90)90177-3}, url = {http://www.sciencedirect.com/science/article/pii/0021999190901773}, author = {O{\textquoteright}Leary, Dianne P. and Stewart, G.W.} } @conference {12772, title = {The concurrency workbench}, booktitle = {Automatic Verification Methods for Finite State Systems}, year = {1990}, month = {1990///}, pages = {24 - 37}, author = {Cleaveland, Rance and Parrow,J. and Steffen,B.} } @article {16805, title = {Efficient compilation of large rule bases using logical access paths}, journal = {Information Systems}, volume = {15}, year = {1990}, month = {1990///}, pages = {73 - 84}, abstract = {This paper presents an efficient way to compile and store large deductive databases. Deductive rules are modeled through logical access paths and then integrated into a global structure, the Rule-base Access Path Schema (RAP Schema). The RAP Schema stores information on the interrelationships that exist among the computations required for rule executions. Ground data as well as data derived through some rule executions and cached for later reuse are also modeled in the RAP Schema. Some of the advantages of using this rule base organization scheme include the automatic detection of shared computations, the inclusion of cached results of rule executions and query results in the knowledge base. The details of the compilation and query processing phases are the focus of the paper.}, isbn = {0306-4379}, doi = {16/0306-4379(90)90017-J}, url = {http://www.sciencedirect.com/science/article/pii/030643799090017J}, author = {Sellis,Timos K. and Roussopoulos, Nick and Ng,Raymond T.} } @article {16330, title = {Empirically guided software development using metric-based classification trees}, journal = {IEEE Software}, volume = {7}, year = {1990}, month = {1990/03//}, pages = {46 - 54}, abstract = {The identification of high-risk components early in the life cycle is addressed. A solution that casts this as a classification problem is examined. The proposed approach derives models of problematic components, based on their measurable attributes and those of their development processes. The models provide a basis for forecasting which components are likely to share the same high-risk properties, such as being error-prone or having a high development cost. Developers can use these classification techniques to localize the troublesome 20\% of the system. The method for generating the models, called automatic generation of metric-based classification trees, uses metrics from previous releases or projects to identify components that are historically high-risk.}, keywords = {Application software, Area measurement, automatic generation, classification problem, Classification tree analysis, Costs, empirically guided software development, Error correction, life cycle, measurable attributes, metric-based classification trees, Predictive models, Programming, software engineering, Software measurement, software metrics, Software systems}, isbn = {0740-7459}, doi = {10.1109/52.50773}, author = {Porter, Adam and Selby,R. W} } @article {17139, title = {EVALUATING HYPERMEDIA SYSTEMS}, journal = {Human factors in computing systems: CHI{\textquoteright}90 Conference proceedings, April 1-5, Seattle}, year = {1990}, month = {1990///}, pages = {387 - 387}, author = {Ehrlich,K. and Microsytems,S. and Marchionini,G. and Nielsen,J. and Shneiderman, Ben} } @article {16342, title = {Evaluating techniques for generating metric-based classification trees}, journal = {Journal of Systems and Software}, volume = {12}, year = {1990}, month = {1990/07//}, pages = {209 - 218}, abstract = {Metric-based classification trees provide an approach for identifying user-specified classes of high-risk software components throughout the software lifecycle. Based on measurable attributes of software components and processors, this empirically guided approach derives models of problematic software components. These models, which are represented as classification trees, are used on future systems to identify components likely to share the same high-risk properties. Example high-risk component properties include being fault-prone, change-prone, or effort-prone, or containing certain types of faults. Identifying these components allows developers to focus the application of specialized techniques and tools for analyzing, testing, and constructing software. A validation study using metric data from 16 NASA systems showed that the trees had an average classification accuracy of 79.3\% for fault-prone and effort-prone components in that environment.One fundamental feature of the classification tree generation algorithm is the method used for partitioning the metric data values into mutually exclusive and exhaustive ranges. This study compares the accuracy and the complexity of trees resulting from five techniques for partitioning metric data values. The techniques are quartiles, octiles, and three methods based on least weight subsequence (LWS-[chi]) analysis, where [chi] is the upper bound on the number of partitions. The LWS-3 and LWS-5 partition techniques resulted in trees with higher accuracy (in terms of completeness and consistency) than did quartiles and octiles. LWS-3 and LWS-5 trees were not statistically different in terms of accuracy, but LWS-3 trees had lower complexity than all other methods in terms of the number of unique metrics required. The trees from the three LWS methods (LWS-3, LWS-5, and LWS-8) had lower complexity than did the trees from quartiles and octiles. In general, the results indicate that distribution-sensitive partition techniques that use only relatively few partitions, such as the least weight subsequence techniques LWS-3 and LWS-5, can increase accuracy and decrease complexity in classification trees. Classification analysis techniques, along with other empirically based analysis techniques for large-scale software, will be supported in the Amadeus measurement and empirical analysis system. }, isbn = {0164-1212}, doi = {16/0164-1212(90)90041-J}, url = {http://www.sciencedirect.com/science/article/pii/016412129090041J}, author = {Porter, Adam and Selby,Richard W.} } @article {17145, title = {Examining usability for a training-oriented hypertext: Can hyper-activity be good?}, journal = {Electronic Publishing}, volume = {3}, year = {1990}, month = {1990///}, pages = {207 - 225}, abstract = {We describe the design and evaluation of a hypertext-based tutorial for hypertext authors. This85-article tutorial represents an innovative application of hypertext to procedural learning. The work has been influenced by Carroll{\textquoteright}s minimalist model, and by the syntactic/semantic semantic model of user behavior. The usability study involved eight subjects who studied the Hyperties Author Tutorial (HAT) for approximately one hour and then performed a set of authoring tasks in an average of 21 minutes. All users successfully completed the tasks. As a result of the study, we provide a characterization of appropriate uses of hypertext for training, and describe the meaning of a hyper-active environment. }, author = {Jones,T. and Shneiderman, Ben} } @article {18082, title = {Finding all nearest neighbors for convex polygons in parallel: a new lower bound technique and a matching algorithm}, journal = {Discrete Applied Mathematics}, volume = {29}, year = {1990}, month = {1990///}, pages = {97 - 111}, author = {Schieber,B. and Vishkin, Uzi} } @book {17173, title = {FORTRAN Programming: A Spiral Approach}, year = {1990}, month = {1990///}, publisher = {Harcourt Brace College Publishers}, organization = {Harcourt Brace College Publishers}, isbn = {0155280155}, author = {Kreitzberg,C.B. and Shneiderman, Ben} } @article {17176, title = {Future directions for human-computer interaction}, journal = {International Journal of Human-Computer Interaction}, volume = {2}, year = {1990}, month = {1990///}, pages = {73 - 90}, abstract = {This article offers a set of goals for user interface development, followed by scenarios of future developments. The applications include home control, hypermedia, office automation, digital photography, collaborative meetings/classrooms, public access, professional workstations, and medical record keeping. Also, predictions are made for some of the underlying technologies such as User Interface Management Systems, remote control, flexible search, display devices, and touchscreens.This article offers a set of goals for user interface development, followed by scenarios of future developments. The applications include home control, hypermedia, office automation, digital photography, collaborative meetings/classrooms, public access, professional workstations, and medical record keeping. Also, predictions are made for some of the underlying technologies such as User Interface Management Systems, remote control, flexible search, display devices, and touchscreens. }, isbn = {1044-7318}, doi = {10.1080/10447319009525971}, url = {http://www.tandfonline.com/doi/abs/10.1080/10447319009525971}, author = {Shneiderman, Ben} } @conference {17205, title = {Human values and the future of technology: a declaration of empowerment}, booktitle = {Proceedings of the conference on Computers and the quality of life}, series = {CQL {\textquoteright}90}, year = {1990}, month = {1990///}, pages = {1 - 6}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, isbn = {0-89791-403-1}, doi = {10.1145/97344.97360}, url = {http://doi.acm.org/10.1145/97344.97360}, author = {Shneiderman, Ben} } @article {15609, title = {Packing and covering the plane with translates of a convex polygon}, journal = {Journal of Algorithms}, volume = {11}, year = {1990}, month = {1990/12//}, pages = {564 - 580}, abstract = {A covering of the Euclidean plane by a polygon P is a system of translated copies of P whose union is the plane, and a packing of P in the plane is a system of translated copies of P whose interiors are disjoint. A lattice covering is a covering in which the translates are defined by the points of a lattice, and a lattice packing is defined similarly. We show that, given a convex polygon P with n vertices, the densest lattice packing of P in the plane can be found in O(n) time. We also show that the sparsest lattice covering of the plane by a centrally symmetric convex polygon can be solved in O(n) time. Our approach utilizes results from classical geometry that reduce these packing and covering problems to the problems of finding certain extremal enclosed figures within the polygon.}, isbn = {0196-6774}, doi = {10.1016/0196-6774(90)90010-C}, url = {http://www.sciencedirect.com/science/article/pii/019667749090010C}, author = {Mount, Dave and Silverman,Ruth} } @article {12821, title = {A preorder for partial process specifications}, journal = {CONCUR{\textquoteright}90 Theories of Concurrency: Unification and Extension}, year = {1990}, month = {1990///}, pages = {141 - 151}, author = {Cleaveland, Rance and Steffen,B.} } @article {12009, title = {Structure from motion using line correspondences}, journal = {International Journal of Computer VisionInt J Comput Vision}, volume = {4}, year = {1990}, month = {1990/06//}, pages = {171 - 183}, isbn = {0920-5691}, doi = {10.1007/BF00054994}, url = {http://www.springerlink.com/content/r4h10053528335k2/}, author = {Spetsakis, Minas E. and Aloimonos, J.} } @conference {16575, title = {Supervised and reinforced competitive learning}, booktitle = {Neural Networks, 1990., 1990 IJCNN International Joint Conference on}, year = {1990}, month = {1990///}, pages = {563 - 567}, author = {Sutton III,G. G. and Reggia, James A. and Maisog,J. M} } @conference {17431, title = {Touchscreen field specification for public access database queries: let your fingers do the walking}, booktitle = {Proceedings of the 1990 ACM annual conference on Cooperation}, series = {CSC {\textquoteright}90}, year = {1990}, month = {1990///}, pages = {1 - 7}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Database query is becoming a common task in public access systems; touchscreens can provide an appealing interface for such a system. This paper explores three interfaces for constructing queries on alphabetic field values with a touchscreen interface; including a QWERTY keyboard, an Alphabetic keyboard, and a Reduced Input Data Entry (RIDE) interface. The RIDE interface allows field values to be entered with fewer {\textquotedblleft}keystrokes{\textquotedblright} (touches) than either keyboard while eliminating certain errors. In one test database, the RIDE interface required 69\% fewer keystrokes than either keyboard interface.}, isbn = {0-89791-348-5}, doi = {10.1145/100348.100349}, url = {http://doi.acm.org/10.1145/100348.100349}, author = {Sears,Andrew and Kochavy,Yoram and Shneiderman, Ben} } @conference {11991, title = {A Unified Theory Of Structure From Motion}, booktitle = {Proceedings of DARPA Image Understanding Workshop}, year = {1990}, month = {1990///}, pages = {271 - 283}, author = {Spetsakis, M. and Aloimonos, J.} } @conference {12797, title = {When is {\textquoteleft}partial{\textquoteright} adequate? A logic-based proof technique using partial specifications}, booktitle = {Logic in Computer Science, 1990. LICS {\textquoteright}90, Proceedings., Fifth Annual IEEE Symposium on e}, year = {1990}, month = {1990/06/04/7}, pages = {440 - 449}, publisher = {IEEE}, organization = {IEEE}, abstract = {A technique is presented for ascertaining when a (finite-state) partial process specification is adequate, in the sense of being specified enough, for contexts in which it is to be used. The method relies on the automatic generation of a modal formula from the partial specification; if the remainder of the network satisfies this formula, then any process that meets the specification is guaranteed to ensure correct behavior of the overall system. Using the results, the authors develop compositional proof rules for establishing the correctness of networks of parallel processes and illustrate their use with several examples}, keywords = {Calculus, Carbon capture and storage, compositional proof rules, Computer science, Concurrent computing, Context, correctness, formal specification, logic-based proof technique, modal formula, parallel processes, partial process specification, partial specifications, specification adequacy, State-space methods, Technological innovation}, isbn = {0-8186-2073-0}, doi = {10.1109/LICS.1990.113768}, author = {Cleaveland, Rance and Steffen,B.} } @article {16234, title = {Automatically transforming regularly structured linear documents into hypertext.}, journal = {Electronic Publishing}, volume = {2}, year = {1989}, month = {1989///}, pages = {211 - 229}, abstract = {Fully automatic conversion of a paper-based document into hypertext can be achieved in manycases if the original document is naturally partitioned into a collection of small-sized pieces that are unambiguously and consistently structured. We describe the methodology that we have used successfully to design and implement several straightforward conversions from the original document{\textquoteright}s machine-readable markup. }, author = {Furuta,R. and Plaisant, Catherine and Shneiderman, Ben} } @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 {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} } @conference {15199, title = {Efficient parallel algorithms for testing connectivity and finding disjoint s-t paths in graphs}, booktitle = {Foundations of Computer Science, 1989., 30th Annual Symposium on}, year = {1989}, month = {1989/11/01/oct}, pages = {288 - 293}, abstract = {An efficient parallel algorithm for testing whether a graph G is K-vertex connected, for any fixed k, is presented. The algorithm runs in O(log n) time and uses nC(n,m) processors on a concurrent-read, concurrent-write parallel random-access machine (CRCW PRAM), where n and m are the number of vertices and edges of G and C(n,m) is the number of processors required to compute the connected components of G in logarithmic time. An optimal speedup algorithm for computing connected components would induce an optimal speedup algorithm for testing k -vertex connectivity, for any k gt;4. To develop the algorithm, an efficient parallel algorithm is designed for the following disjoint s-t paths problem: Given a graph G and two specified vertices s and t, find k-vertex disjoint paths between s and t, if they exist. If no such paths exist, find a set of at most k-1 vertices whose removal disconnects s and t. The parallel algorithm for this problem runs in O(log n) time using C(n,m) processors. It is shown how to modify the algorithm to find k-edge disjoint paths, if they exist. This yields an efficient parallel algorithm for testing whether a graph G is k-edge connected, for any fixed k. The algorithm runs in O(log n) time and uses nC (n,n) processors on a CRCW PRAM. Again, an optimal speedup algorithm for computing connected components would induce an optimal speedup algorithm for testing k-edge connectivity}, keywords = {algorithm;parallel, algorithms;random-access, algorithms;testing, complexity;graph, connectivity;computational, connectivity;optimal, CRCW, disjoint, paths;graphs;k-edge, paths;k-vertex, PRAM;disjoint, s-t, speedup, storage;, theory;parallel}, doi = {10.1109/SFCS.1989.63492}, author = {Khuller, Samir and Schieber,B.} } @article {16969, title = {An experimental evaluation of three touch screen strategies within a hypertext database}, journal = {International Journal of Human-Computer Interaction}, volume = {1}, year = {1989}, month = {1989///}, pages = {41 - 52}, abstract = {High resolution touch screens and novel usage strategies have overcome earlier problems with parallax and inaccurate pointing. A study testing the utility of three touch screen strategies within the Hyperties hypertext environment was performed. This provided a replication and extension of an earlier touch screen strategy comparison that focused on small closely?spaced targets. The experiment compared three touch screen strategies in three experimental tasks that reflect hypertext usage. The results showed that a strategy that only uses the initial impact with the touch screen causes the user to miss the target more than other touch strategies. A statistically significant difference in errors was found. Our results should encourage system implementers and touch screen hardware designers to support ?touch mouse? strategies that enable cursor dragging on the touch screen surface.High resolution touch screens and novel usage strategies have overcome earlier problems with parallax and inaccurate pointing. A study testing the utility of three touch screen strategies within the Hyperties hypertext environment was performed. This provided a replication and extension of an earlier touch screen strategy comparison that focused on small closely?spaced targets. The experiment compared three touch screen strategies in three experimental tasks that reflect hypertext usage. The results showed that a strategy that only uses the initial impact with the touch screen causes the user to miss the target more than other touch strategies. A statistically significant difference in errors was found. Our results should encourage system implementers and touch screen hardware designers to support ?touch mouse? strategies that enable cursor dragging on the touch screen surface. }, isbn = {1044-7318}, doi = {10.1080/10447318909525956}, url = {http://www.tandfonline.com/doi/abs/10.1080/10447318909525956}, author = {Potter,Richard and Berman,Mitchell and Shneiderman, Ben} } @article {16648, title = {Functional and psychosocial effects of multimodality limb-sparing therapy in patients with soft tissue sarcomas}, journal = {Journal of Clinical Oncology}, volume = {7}, year = {1989}, month = {1989///}, pages = {1217 - 1217}, author = {Chang,A. E and Steinberg,S. M and Culnane,M. and Lampert,M. H and Reggia, James A. and Simpson,C. G and Hicks,J. E and White,D. E and Yang,J. J and Glatstein,E.} } @conference {17210, title = {Human-computer interaction lab, University of Maryland}, booktitle = {Proceedings of the SIGCHI conference on Human factors in computing systems: Wings for the mind}, series = {CHI {\textquoteright}89}, year = {1989}, month = {1989///}, pages = {309 - 310}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, isbn = {0-89791-301-9}, doi = {10.1145/67449.67509}, url = {http://doi.acm.org/10.1145/67449.67509}, author = {Shneiderman, Ben} } @article {17212, title = {Human-Computer Interaction Laboratory, University of Maryland, Center for Automation Research}, journal = {CHI}, volume = {89}, year = {1989}, month = {1989///}, pages = {309 - 310}, author = {Shneiderman, Ben} } @conference {17215, title = {Hypertext and software engineering}, booktitle = {Proceedings of the second annual ACM conference on Hypertext}, series = {HYPERTEXT {\textquoteright}89}, year = {1989}, month = {1989///}, pages = {395 - 396}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {The purpose of this panel is to bring together researchers in software engineering and hypertext and help identify the major issues in the application of hypertext technology and concepts to software engineering and vice versa.}, isbn = {0-89791-339-6}, doi = {10.1145/74224.74259}, url = {http://doi.acm.org/10.1145/74224.74259}, author = {Balzer,R. and Begeman,M. and Garg,P. K. and Schwartz,M. and Shneiderman, Ben} } @article {17216, title = {Hypertext hands-on!}, journal = {Tech Report HCIL-89-06}, year = {1989}, month = {1989///}, abstract = {This innovative book/software package provides the first hands-on nontechnical introduction to hypertext. Hypertext is a computer technology for manipulating information; in a grander sense, it is a new way of reading and writing. With the IBM-PC disket tes provided in this package, you will learn about hypertext by experiencing it. You will discover what it is like to read interactively, to find information according to your own needs and interests. Both the book and the software versions cover the basic concepts of hypertext, typical hypertext applications, and currently available authoring systems. They also raise important design and implementations issues. The book is self-contained an can be read from beginning to end without a computer. The software is also self-contained and, presenting hypertext in hypertext form, can be read in any order you choose. Since the two versions contain largely similar material, they provide an interesting basis for comparison between conventional text presentation and hypertext.}, author = {Shneiderman, Ben and Kearsley,G.} } @article {17253, title = {Interactive graphics interfaces in hypertext systems}, journal = {Proc. 28th Annual ACM DC Technical Symposium}, volume = {23}, year = {1989}, month = {1989///}, pages = {28 - 28}, abstract = {One of the key design aspects of hypertext systems is the rapid selection of items displayed on the screen in a direct manipulation manner. The user can select next or back page turning icons or buttons, or select another item that might jump to a remote destination. Authors and browsers are confronted with the problem of recognizing and selecting these choices in textual and graphic databases. This paper discusses the problems and offers a variety of solutions.}, author = {Weiland,W. and Shneiderman, Ben} } @article {11954, title = {Learning early-vision computations}, journal = {JOSA A}, volume = {6}, year = {1989}, month = {1989///}, pages = {908 - 919}, author = {Aloimonos, J. and Shulman, D.} } @conference {17278, title = {Lessons learned from the ACM hypertext on hypertext project}, booktitle = {Proceedings of the second annual ACM conference on Hypertext}, series = {HYPERTEXT {\textquoteright}89}, year = {1989}, month = {1989///}, pages = {385 - 386}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, isbn = {0-89791-339-6}, doi = {10.1145/74224.74255}, url = {http://doi.acm.org/10.1145/74224.74255}, author = {Rous,B. and Shneiderman, Ben and Yankelovich,N. and Yoder,E.} } @conference {11974, title = {Optimal motion estimation}, booktitle = {Workshop on Visual Motion, 1989.,Proceedings}, year = {1989}, month = {1989/03/20/22}, pages = {229 - 237}, publisher = {IEEE}, organization = {IEEE}, abstract = {The problem of using feature correspondences to recover the structure and 3D motion of a moving object from its successive images is analyzed. They formulate the problem as a quadratic minimization problem with a nonlinear constraint. Then they derive the condition for the solution to be optimal under the assumption of Gaussian noise in the input, in the maximum-likelihood-principle sense. The authors present two efficient ways to approximate it and discuss some inherent limitations of the structure-from-motion problem when two frames are used that should be taken into account in robotics applications that involve dynamic imagery. Finally, it is shown that some of the difficulties inherent in the two-frame approach disappear when redundancy in the data is introduced. This is concluded from experiments using a structure-from-motion algorithm that is based on multiple frames and uses only the rigidity assumption}, keywords = {3D motion interpretation, Automation, Computer vision, computerised pattern recognition, computerised picture processing, constraint minimization, dynamic imagery, Educational institutions, feature correspondences, Gaussian noise, Image motion analysis, Laboratories, maximum-likelihood-principle, Minimization methods, Motion analysis, Motion estimation, motion parameters, moving object, multiple frames, nonlinear constraint, Optical computing, optimal motion estimation, parameter estimation, quadratic minimization, quadratic programming, redundancy, rigidity assumption, robotics applications, structure-from-motion, successive images, two-frame}, isbn = {0-8186-1903-1}, doi = {10.1109/WVM.1989.47114}, author = {Spetsakis, M. E and Aloimonos, J.} } @conference {12793, title = {A semantics based verification tool for finite state systems}, booktitle = {Proceedings of the IFIP WG6}, volume = {1}, year = {1989}, month = {1989///}, pages = {287 - 302}, author = {Cleaveland, Rance and Parrow,J. and Steffen,B.} } @article {17366, title = {Social and Individual Impact}, journal = {Educational Media International}, volume = {26}, year = {1989}, month = {1989///}, pages = {101 - 106}, isbn = {0952-3987}, doi = {10.1080/0952398890260208}, url = {http://www.tandfonline.com/doi/abs/10.1080/0952398890260208}, author = {Shneiderman, Ben} } @conference {16320, title = {Software metric classification trees help guide the maintenance of large-scale systems}, booktitle = {, Conference on Software Maintenance, 1989., Proceedings}, year = {1989}, month = {1989/10/16/19}, pages = {116 - 123}, publisher = {IEEE}, organization = {IEEE}, abstract = {The 80:20 rule states that approximately 20\% of a software system is responsible for 80\% of its errors. The authors propose an automated method for generating empirically-based models of error-prone software objects. These models are intended to help localize the troublesome 20\%. The method uses a recursive algorithm to automatically generate classification trees whose nodes are multivalued functions based on software metrics. The purpose of the classification trees is to identify components that are likely to be error prone or costly, so that developers can focus their resources accordingly. A feasibility study was conducted using 16 NASA projects. On average, the classification trees correctly identified 79.3\% of the software modules that had high development effort or faults}, keywords = {automated method, automatic programming, classification, Classification tree analysis, classification trees, Computer errors, empirically-based models, error-prone software objects, Fault diagnosis, feasibility study, high development effort, Large-scale systems, multivalued functions, NASA, NASA projects, recursive algorithm, Software algorithms, software engineering, Software maintenance, Software measurement, software metrics, software modules, Software systems, trees (mathematics)}, isbn = {0-8186-1965-1}, doi = {10.1109/ICSM.1989.65202}, author = {Selby,R. W and Porter, Adam} } @article {16235, title = {A spectrum of automatic hypertext constructions}, journal = {Hypermedia}, volume = {1}, year = {1989}, month = {1989///}, pages = {179 - 195}, abstract = {We describe our experiences with four separate conversions from paper documents into hypertext and discuss the lessons we have learned. The paper document{\textquoteright}s organization affects the ease with which it can be converted and the appropriateness of the resu lting hypertext. The form of the paper document{\textquoteright}s machine-readable {\textquoteleft}markup{\textquoteright} description affects the ability to transform the structure automatically. Designing the link structures that tie together the parts of the hypertext takes special care in automa ting, as badly-designed and incorrectly-formed links destroy the integrity of the hypertext. Overall, each of the conversions followed the same basic methodology, providing the handle for the development of {\textquoteleft}power tools{\textquoteright} that can be applied to simplify s ubsequent conversions.}, author = {Furuta,R. and Plaisant, Catherine and Shneiderman, Ben} } @article {17425, title = {The user interface in a hypertext, multiwindow program browser}, journal = {Interacting with computers}, volume = {1}, year = {1989}, month = {1989///}, pages = {301 - 337}, author = {Seabrook,R.H.C. and Shneiderman, Ben} } @book {17474, title = {User-Friendly Computer Interfaces}, year = {1989}, month = {1989///}, publisher = {Chantico Pub. Co.}, organization = {Chantico Pub. Co.}, address = {Carrollton, Texas}, isbn = {1557110956}, author = {Shneiderman, Ben} } @article {16537, title = {Analysis of competition-based spreading activation in connectionist models}, journal = {International journal of man-machine studies}, volume = {28}, year = {1988}, month = {1988///}, pages = {77 - 97}, author = {Wang,P. Y and Seidman,S. B and Reggia, James A.} } @article {14118, title = {Block-Preconditioned Conjugate-Gradient-Like Methods for Numerical Reservoir Simulation}, journal = {SPE Reservoir EngineeringSPERE}, volume = {3}, year = {1988}, month = {1988/02//}, isbn = {0885-9248}, doi = {10.2118/13534-PA}, url = {http://www.onepetro.org/mslib/servlet/onepetropreview?id=00013534\&soc=SPE}, author = {Eisenstat, Stanley and Elman, Howard and Schlutz, Martin} } @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 {17117, title = {Ecological studies of professional programmers}, journal = {Commun. ACM}, volume = {31}, year = {1988}, month = {1988/11//}, pages = {1256 - 1258}, abstract = {For over two decades, software psychology researchers have been developing insights to software productivity and quality by investigating builders and users of software. This research has been diverse in both its approach and its impacts. It has introduced systematic behavioral measurement into the software development process and into research on new software techniques and technologies, and has also opened up new social and cognitive interpretations of software processes [5, 12].We now see evidence of a new thrust in software psychology coming to the fore, one in which usability researchers are direct participants in the definition and creation of new software artifacts. We call this paradigm Ecological Design, to emphasize (1) that realistic software situations are being confronted on their own terms, and (2) that the work is directed toward design results, not merely toward evaluation and description in the service of design goals. The reorientation towards studying teamwork was prompted in 1971 by Weinberg and followed by a few researchers at that time, but the movement has accelerated with the recent and intense interest in computer supported collaborative work [15]. This was apparent in the papers presented at the two workshops on Empirical Studies of Programmers [10, 13]. An accompanying shift has also occurred in the software engineering community. The traditional waterfall model of software development with the precise specification of a provable topdown design is giving way to newer exploratory styles of program development that emphasize rapid prototyping and iterative refinement. The shift from product to process also puts greater emphasis on team organization, group processes, management policies, reusability, development tools, design methods, debugging strategies, and maintenance [6]. The three papers in this special section exemplify this new paradigm. Rosson, Maass, and Kellogg and Curtis, Krasner, and Iscoe describe highly qualitative studies of professional designers that produced specific technical proposals for improving software tools and the coordination of project management, an assessment of major bottlenecks, and a new framework for thinking about software design as a learning and communication process. Soloway, Pinto, Letovsky, Littman, and Lampert describe the design and exploration of software documentation that grew out of similarly qualitative studies of program maintenance. We caution that this research paradigm is still in its infancy: setting design requirements and developing prototypes are not traditional activities of psychological researchers. These roles are still emerging, still being reconciled with the earlier paradigms. The particular projects highlighted here are only the beginning; the field continues to evolve, as more researchers are attracted, as more topics are explored, as more methods are developed. Thus, despite the shortcomings of any particular project, the trajectory of this paradigm seems clear to us: it is the development of ideas that directly impact productivity and quality in software. Indeed, part of our intention in presenting this special section is to encourage more and more rapid development of the new paradigm. }, isbn = {0001-0782}, doi = {10.1145/50087.214900}, url = {http://doi.acm.org/10.1145/50087.214900}, author = {Shneiderman, Ben and Carroll,John M.} } @article {16791, title = {An efficient pictorial database system for PSQL}, journal = {IEEE Transactions on Software Engineering}, volume = {14}, year = {1988}, month = {1988/05//}, pages = {639 - 650}, abstract = {Pictorial databases require efficient and direct spatial search based on the analog form of spatial objects and relationships instead of search based on some cumbersome alphanumeric encodings of the pictures. A description is given of PSQL, a query language that allows pictorial domains to be presented to the user in their analog form and allows him or her to do direct manipulation on the objects found on those domains. Direct spatial search and computation on the pictures is done using efficient data structures, R- and R+-trees (multidimensional B-trees), which are excellent devices for searching spatial objects and relationships found on pictures}, keywords = {alphanumeric encodings, Computer science, Data structures, Database languages, database management systems, Database systems, Encoding, Image coding, Image databases, multidimensional B-trees, Object oriented databases, pictorial database system, PSQL, query language, query languages, R+-trees, Relational databases, Spatial databases, spatial objects, spatial search, User interfaces}, isbn = {0098-5589}, doi = {10.1109/32.6141}, author = {Roussopoulos, Nick and Faloutsos,C. and Sellis,T.} } @conference {16962, title = {An empirical comparison of pie vs. linear menus}, booktitle = {Proceedings of the SIGCHI conference on Human factors in computing systems}, series = {CHI {\textquoteright}88}, year = {1988}, month = {1988///}, pages = {95 - 100}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Menus are largely formatted in a linear fashion listing items from the top to bottom of the screen or window. Pull down menus are a common example of this format. Bitmapped computer displays, however, allow greater freedom in the placement, font, and general presentation of menus. A pie menu is a format where the items are placed along the circumference of a circle at equal radial distances from the center. Pie menus gain over traditional linear menus by reducing target seek time, lowering error rates by fixing the distance factor and increasing the target size in Fitts{\textquoteright}s Law, minimizing the drift distance after target selection, and are, in general, subjectively equivalent to the linear style.}, isbn = {0-201-14237-6}, doi = {10.1145/57167.57182}, url = {http://doi.acm.org/10.1145/57167.57182}, author = {Callahan,J. and Hopkins,D. and Weiser,M. and Shneiderman, Ben} } @article {16745, title = {Expert database systems: Efficient support for engineering environments}, journal = {Data \& Knowledge Engineering}, volume = {3}, year = {1988}, month = {1988/09//}, pages = {71 - 85}, abstract = {Manufacturing and Engineering processes use both large scale data and knowledge bases, and the use of expert systems in such environments has become a necessity. Expert Database Systems have evolved from conventional database systems to meet the requirements of current Artificial Intelligence applications. However, future Expert Database Systems will contain knowledge bases of significant size which makes main memory insufficient and the use of a database system a necessity. We propose an effective way of building High Performance Expert Database Systems to support manufacturing and engineering environments. These systems are based on Incremental Computation Models; such models utilize results of previous computations by merging them with newly derived results of computations on small increments representing changes in the database. Our system will be able to support very large knowledge bases by utilizing novel structures and access methods and by using a very sophisticated inference engine based on incremental computation models.}, keywords = {engineering databases, Expert database systems, high performance systems, incremental computation models}, isbn = {0169-023X}, doi = {16/0169-023X(88)90007-9}, url = {http://www.sciencedirect.com/science/article/pii/0169023X88900079}, author = {Sellis,T. and Roussopoulos, Nick and Mark,L. and Faloutsos,C.} } @article {17164, title = {Finding facts vs. browsing knowledge in hypertext systems}, journal = {Computer}, volume = {21}, year = {1988}, month = {1988/01//}, pages = {70 - 80}, abstract = {The authors discuss the role of information retrieval, interface design, and cognitive science in hypertext research. They present a user-centered framework for information-seeking that has been used in evaluating two hypertext systems. They apply the framework to key design issues related to information retrieval in hypertext systems.<>}, keywords = {browsing knowledge, Cognitive science, cognitive systems, Electronic publishing, hypertext research, hypertext systems, Information retrieval, information retrieval systems, information-seeking, interface design, User interfaces, word processing}, isbn = {0018-9162}, doi = {10.1109/2.222119}, author = {Marchionini,G. and Shneiderman, Ben} } @conference {18088, title = {On finding lowest common ancestors: simplification and parallelization}, booktitle = {VLSI Algorithms and Architectures}, year = {1988}, month = {1988///}, pages = {111 - 123}, author = {Schieber,B. and Vishkin, Uzi} } @article {16640, title = {A general-purpose simulation environment for developing connectionist models}, journal = {Simulation}, volume = {51}, year = {1988}, month = {1988///}, pages = {5 - 5}, author = {D{\textquoteright}Autrechy,C. L and Reggia, James A. and Sutton,G. G and Goodall,S. M} } @conference {15637, title = {Globally-Equiangular triangulations of co-circular points in 0(n log n) time}, booktitle = {Proceedings of the fourth annual symposium on Computational geometry}, series = {SCG {\textquoteright}88}, year = {1988}, month = {1988///}, pages = {143 - 152}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, isbn = {0-89791-270-5}, doi = {10.1145/73393.73408}, url = {http://doi.acm.org/10.1145/73393.73408}, author = {Mount, Dave and Saalfeld,A.} } @book {17217, title = {Hypertext on hypertext: IBM PC \& compatibles}, year = {1988}, month = {1988///}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, isbn = {0-89791-280-2}, editor = {Shneiderman, Ben} } @conference {14975, title = {Input sensitive VLSI layouts for graphs of arbitrary degree}, booktitle = {VLSI Algorithms and Architectures}, year = {1988}, month = {1988///}, pages = {268 - 277}, abstract = {A general method to find area-efficient VLSI layouts of graphs of arbitrary degree is presented. For graphs of maximum degree Δ, the layouts obtained are smaller by a factor of Δ2 than those obtained using existing methods.Optimal planar layouts, and near-optimal nonplanar layouts are also derived for planar graphs of arbitrary degree and gauge. The results span the spectrum between outerplanar graphs (gauge 1), and arbitrary planar graphs (gauge O(n)). Optimality is established by developing families of planar graphs of varying gauge and degree, and proving lower bounds on their layout area. These techniques can be combined to exhibit a trade-off between area and the number of contact cuts. The resulting scheme is sensitive to all three parameters that affect the area: the maximum degree, the gauge, and the number of contact cuts. }, doi = {10.1007/BFb0040394}, author = {Sherlekar,D. and JaJa, Joseph F.} } @article {16323, title = {Learning from examples: generation and evaluation of decision trees for software resource analysis}, journal = {IEEE Transactions on Software Engineering}, volume = {14}, year = {1988}, month = {1988/12//}, pages = {1743 - 1757}, abstract = {A general solution method for the automatic generation of decision (or classification) trees is investigated. The approach is to provide insights through in-depth empirical characterization and evaluation of decision trees for one problem domain, specifically, that of software resource data analysis. The purpose of the decision trees is to identify classes of objects (software modules) that had high development effort, i.e. in the uppermost quartile relative to past data. Sixteen software systems ranging from 3000 to 112000 source lines have been selected for analysis from a NASA production environment. The collection and analysis of 74 attributes (or metrics), for over 4700 objects, capture a multitude of information about the objects: development effort, faults, changes, design style, and implementation style. A total of 9600 decision trees are automatically generated and evaluated. The analysis focuses on the characterization and evaluation of decision tree accuracy, complexity, and composition. The decision trees correctly identified 79.3\% of the software modules that had high development effort or faults, on the average across all 9600 trees. The decision trees generated from the best parameter combinations correctly identified 88.4\% of the modules on the average. Visualization of the results is emphasized, and sample decision trees are included}, keywords = {Analysis of variance, Artificial intelligence, Classification tree analysis, Data analysis, decision theory, Decision trees, Fault diagnosis, Information analysis, machine learning, metrics, NASA, production environment, software engineering, software modules, software resource analysis, Software systems, Termination of employment, trees (mathematics)}, isbn = {0098-5589}, doi = {10.1109/32.9061}, author = {Selby,R. W and Porter, Adam} } @conference {11957, title = {Optimal Computing Of Structure From Motion Using Point Correspondences In Two Frames}, booktitle = {Proceedings of Second International Conference on Computer Vision}, year = {1988}, month = {1988/12/05/8}, pages = {449 - 453}, publisher = {IEEE}, organization = {IEEE}, keywords = {Automation, Computer vision, Educational institutions, Gaussian noise, Image motion analysis, Laboratories, Least squares approximation, Least squares methods, Motion estimation, Optical computing}, isbn = {0-8186-0883-8}, doi = {10.1109/CCV.1988.590022}, author = {Spetsakis, M. E and Aloimonos, J.} } @article {18098, title = {Parallel construction of a suffix tree with applications}, journal = {Algorithmica}, volume = {3}, year = {1988}, month = {1988///}, pages = {347 - 365}, author = {Apostolico,A. and Iliopoulos,C. and Landau,G. M and Schieber,B. and Vishkin, Uzi} } @conference {16655, title = {Parallel set covering algorithms}, booktitle = {Artificial Intelligence Applications, 1988., Proceedings of the Fourth Conference on}, year = {1988}, month = {1988/03//}, pages = {274 - 279}, abstract = {The authors develop some parallel algorithms for set covering. A brief introduction is given into the parsimonious set covering theory, and algorithms using one type of parsimony called irredundancy are developed. They also discuss several machine-independent parallel constructs that are used to express the parallel algorithms. The algorithms were tested on the Butterfly parallel processor system. The authors present some of the tests conducted and their analyses. Finally, the merits and limitations of the algorithms that were identified during the tests are presented}, keywords = {Butterfly parallel processor system, irredundancy, Parallel algorithms, parsimonious set covering theory, set covering, set theory}, doi = {10.1109/CAIA.1988.196115}, author = {Sekar,S. and Reggia, James A.} } @article {17354, title = {Selection devices for user of an electronic encyclopedia: An empirical comparison of four possibilities}, journal = {Information Processing \& Management}, volume = {24}, year = {1988}, month = {1988///}, pages = {665 - 680}, abstract = {This study measured the speed, error rates, and subjective evaluation of arrow-jump keys, a jump-mouse, number keys, and a touch screen in an interactive encyclopedia. A summary of previous studies comparing selection devices and strategies is presented to provide the background for this study. We found the touch screen to be the fastest in time, the least accurate but the overall favorite of the participants. The results are discussed and improvements are suggested accordingly.}, isbn = {0306-4573}, doi = {10.1016/0306-4573(88)90004-0}, url = {http://www.sciencedirect.com/science/article/pii/0306457388900040}, author = {Ostroff,Daniel and Shneiderman, Ben} } @article {16561, title = {Self-processing networks and their biomedical implications}, journal = {Proceedings of the IEEE}, volume = {76}, year = {1988}, month = {1988///}, pages = {680 - 692}, author = {Reggia, James A. and Sutton III,G. G.} } @article {12067, title = {Shape from patterns: Regularization}, journal = {International journal of computer vision}, volume = {2}, year = {1988}, month = {1988///}, pages = {171 - 187}, author = {Aloimonos, J. and Swain, M.} } @book {17471, title = {User interface strategies {\textquoteright}88 (videotape)}, year = {1988}, month = {1988///}, publisher = {University of Maryland at College Park}, organization = {University of Maryland at College Park}, address = {College Park, MD, USA}, author = {Shneiderman, Ben and Malone,Thomas and Norman,Donald and Foley,James} } @article {17505, title = {We can design better user interfaces: A review of human-computer interaction styles}, journal = {Ergonomics}, volume = {31}, year = {1988}, month = {1988///}, pages = {699 - 710}, abstract = {The widespread use of computers has opened a new dimension of application for the ergonomic sciences. This review recommends three pillars to support the user interface design process: guidelines documents, User Interface Management Systems, and usability labs for iterative testing. Then it presents five primary interaction styles: menu selection, form fill-in, command language, natural language and direct manipulation. The author encourages greater attention to direct manipulation in which the objects and actions are visible, the actions are invoked by selection or pointing, and the impact is immediately visible and reversible.The widespread use of computers has opened a new dimension of application for the ergonomic sciences. This review recommends three pillars to support the user interface design process: guidelines documents, User Interface Management Systems, and usability labs for iterative testing. Then it presents five primary interaction styles: menu selection, form fill-in, command language, natural language and direct manipulation. The author encourages greater attention to direct manipulation in which the objects and actions are visible, the actions are invoked by selection or pointing, and the impact is immediately visible and reversible. }, isbn = {0014-0139}, doi = {10.1080/00140138808966713}, url = {http://www.tandfonline.com/doi/abs/10.1080/00140138808966713}, author = {Shneiderman, Ben} } @conference {15618, title = {Algorithms for covering and packing and applications to CAD/CAM (abstract only): preliminary results}, booktitle = {Proceedings of the 15th annual conference on Computer Science}, series = {CSC {\textquoteright}87}, year = {1987}, month = {1987///}, pages = {439{\textendash} - 439{\textendash}}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Computational geometry deals with the computational complexity of geometric problems within the framework of the analysis of algorithms. Numerous applications have been found to computer graphics, computer-aided design, pattern recognition and robotics.Among the geometric problems are bin packing problems. C.A. Roger {\textquotedblleft}Packing and Covering{\textquotedblright}, Cambridge University Press (1964) studied these problems. Many of these are hard problems, and very few have been solved. Some packing problems are the restriction of a very interesting problem in CAM (computer-aided manufacture). In the manufacture of clothing, certain parts, such as sleeves, are laid out as repeated polygonal copies and combinations on a bolt of cloth. This pattern layout is traditionally (and currently) done by hand. It{\textquoteright}s a candidate for automation. We propose some special cases of this problem whose solution can be extended to practical use. We are working on several geometric questions involving packing translations of objects. Classical results in mathematics demonstrate equivalence between certain packing problems and finding optimal enclosed figures. J. O{\textquoteright}Rourke et al [{\textquotedblleft}An optimal algorithm for finding minimal enclosing triangles{\textquotedblright}, J. of Algorithms 7, 258-264 (1986)], as well as V. Klee and M. Laskowski [{\textquotedblleft}Finding the smallest triangles containing a given convex polygon{\textquotedblright}, J. of Algorithms 6, 359-375 (1985)] have produced algorithms for finding a smallest area triangle containing (or enclosing) a given polygon. Smallest area convex polygons of a certain type, containing a given set, can be viewed as larger pieces of fabric containing pattern to be cut out. We have an optimal algorithm for finding largest enclosed polygons for a given set. We also have preliminary results for smallest enclosing polygons. These results have theoretical interest, and have applications to robotics and collision avoidance, as well as to manufacture. }, isbn = {0-89791-218-7}, doi = {10.1145/322917.323100}, url = {http://doi.acm.org/10.1145/322917.323100}, author = {Mount, Dave and Silverman,Ruth} } @article {16757, title = {Analysis of object oriented spatial access methods}, journal = {ACM SIGMOD Record}, volume = {16}, year = {1987}, month = {1987///}, pages = {426 - 439}, author = {Faloutsos,C. and Sellis,T. and Roussopoulos, Nick} } @conference {17029, title = {Computer-supported cooperative work (panel): is this REALLY a new field of research?}, booktitle = {Proceedings of the SIGCHI/GI conference on Human factors in computing systems and graphics interface}, series = {CHI {\textquoteright}87}, year = {1987}, month = {1987///}, pages = {227 - 228}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, isbn = {0-89791-213-6}, doi = {10.1145/29933.275634}, url = {http://doi.acm.org/10.1145/29933.275634}, author = {Greif,Irene and Curtis,Bill and Krasner,Herb and Malone,Thomas W. and Shneiderman, Ben} } @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} } @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 {16965, title = {An evaluation of jump-ahead techniques in menu selection}, journal = {Behaviour \& Information Technology}, volume = {6}, year = {1987}, month = {1987///}, pages = {97 - 108}, abstract = {Menu selection systems provide a means of selecting operations and retrieving information which requires little training and reduces the need for memorizing complex command sequences. However, a major disadvantage of many menu selection systems is that experienced users cannot traverse the menu tree significantly faster than novices. A common solution to this problem is to provide the menu selection system with a jump-ahead capability.The purpose of this research was to evaluate two jump-ahead methods (type-ahead and direct-access). In the type-ahead method the user anticipates a selection on each of several successive menus and enters as many selections at one time as desired. In the direct-access method, each menu frame is assigned a unique name which the user must enter to locate it. Thirty-two students were given training on an information retrieval system for college course information and were required to learn the two jump-ahead methods in a counterbalanced design. The direct-access method resulted in fewer traversals to learn the system, lower error rates, and reduced learning time. The subjective impressions, obtained from post-experiment questionnaires and oral comments, indicated that the direct-access jump-ahead method was also preferred in a frequently used menu selection system. }, isbn = {0144-929X}, doi = {10.1080/01449298708901820}, url = {http://www.tandfonline.com/doi/abs/10.1080/01449298708901820}, author = {Laverson,Alan and Norman,Kent and Shneiderman, Ben} } @article {15756, title = {From Determinacy to Systaltic Arrays}, journal = {Computers, IEEE Transactions on}, volume = {C-36}, year = {1987}, month = {1987/11//}, pages = {1355 - 1359}, abstract = {In this paper we extend a model of Karp and Miller for parallel computation. We show that the extended model is deterministic, in the sense that under different scheduling regimes each process in the computation consumes the same input and generates the same output. Moreover, if the computation halts, the final state is independent of scheduling. The model is applied to the generation of precedence graphs, from which lower time bounds may be deduced, and to the synchronization of systolic arrays by local rather than global control.}, isbn = {0018-9340}, doi = {10.1109/TC.1987.5009475}, author = {O{\textquoteright}Leary, Dianne P. and Stewart, G.W.} } @article {12048, title = {Learning shape computations}, journal = {Proc. DARPA Image}, year = {1987}, month = {1987///}, author = {Aloimonos, J. and Shulman, D.} } @conference {17829, title = {Mapping a single-assignment language onto the Warp systolic array}, booktitle = {Functional Programming Languages and Computer Architecture}, year = {1987}, month = {1987///}, pages = {347 - 363}, author = {Gross,T. and Sussman, Alan} } @article {18103, title = {Parallel construction of a suffix tree}, journal = {Automata, Languages and Programming}, year = {1987}, month = {1987///}, pages = {314 - 325}, author = {Landau,G. and Schieber,B. and Vishkin, Uzi} } @article {16726, title = {The R+-tree: A dynamic index for multi-dimensional data}, journal = {Proceedings of VLDB 1987}, year = {1987}, month = {1987///}, pages = {507 - 518}, author = {Sellis,T. and Roussopoulos, Nick and Faloutsos,C.} } @article {11953, title = {Spatiotemporal blur paths for image flow estimation (A)}, journal = {Journal of the Optical Society of America A}, volume = {4}, year = {1987}, month = {1987///}, pages = {35 - 35}, author = {Spetsakis, M. E and Aloimonos, J.} } @book {12064, title = {Structure from Motion from Line Correspondencies: New Results}, year = {1987}, month = {1987///}, author = {Science, University of Maryland at College Park. Dept. of Computer and Spetsakis, M. E and Aloimonos, J. and Research, University of Maryland at College Park. Center for Automation} } @article {17384, title = {Subjective user evaluation of CF PASCAL programming tools}, journal = {Department of Computer Science and Human-Computer Interaction Laboratory Working Paper}, year = {1987}, month = {1987///}, abstract = {This study investigated subjective evaluations of two programming environments: 1) SUPPORT, an interactive programming environment with a syntax directed editor on a personal computer and 2) a batch run environment on a large mainframe computer. Participants were students in a 15 week introductory computer science course. In Part 1, one group of 128 first used SUPPORT, while another group of 85 programmed on a mainframe environment. After 6 weeks they were given an evaluative questionnaire and then switched programming environments. In Part 2, 68 used SUPPORT and 60 used the mainframe. At the twelfth week of the course, they were given two questionnaires, one evaluating the environment they had used in the last 6 weeks and one comparing both enviro nments. A measure of programming performance (exam and programming project grades) was also collected. SUPPORT was predicted to reduce the burden of remembering syntactic details resulting in better performance and higher subjective evaluations. Unexpectedly, the SUPPORT users did not earn statistically significantly higher grades. Furthermore, participants expressed a preference for the mainframe over SUPPORT. Specific items on the questionnaires were used to diagnose the strengths and weaknesses of each environment. Designers of syntax directed editors should focus on reducing the syntactic burden not only in programming , but also in the user interface of these tools.}, author = {Chin,JP and Norman,K. L and Shneiderman, Ben} } @article {17428, title = {Time Stress Effects on Two Menu Selection Systems}, journal = {Proceedings of the Human Factors and Ergonomics Society Annual MeetingProceedings of the Human Factors and Ergonomics Society Annual Meeting}, volume = {31}, year = {1987}, month = {1987/09/01/}, pages = {727 - 731}, abstract = {The optimal number of menu items per display screen has been the topic of considerable debate and study. On the one hand, some designers have packed many items into each menu to conserve space and reduce the number of menus, whereas on the other hand there are designers who prefer a sparse display for menu structures and other videotex information. This study evaluated the effects of a broad/shallow menu compared to a narrow/deep menu structure under two conditions of time stress for inexperienced users. Results indicated that time stress both slowed performance, and increased errors. In addition, it was demonstrated that the broad/shallow menu was faster and resulted in fewer errors. Implications for menu design are discussed.}, isbn = {1071-1813,}, doi = {10.1177/154193128703100708}, url = {http://pro.sagepub.com/content/31/7/727}, author = {Wallace,Daniel F and Anderson,Nancy S and Shneiderman, Ben} } @conference {17467, title = {User interface design and evaluation for an electronic encyclopedia}, booktitle = {Proc. of the 2nd International Conference on Human-Computer Interaction}, year = {1987}, month = {1987///}, abstract = {The Interactive Encyclopedia System (TIES) has been under development since Fall 1983. It enables users to easily traverse a database of articles by merely pointing at highlighted words in context. This embedded menus approach to hypertext and its user interface design are described with three exploratory studies of TIES use. Plans for future development and studies are offered.}, author = {Shneiderman, Ben} } @conference {17468, title = {User interface design for the Hyperties electronic encyclopedia (panel session)}, booktitle = {Proceedings of the ACM conference on Hypertext}, series = {HYPERTEXT {\textquoteright}87}, year = {1987}, month = {1987///}, pages = {189 - 194}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, isbn = {0-89791-340-X}, doi = {10.1145/317426.317441}, url = {http://doi.acm.org/10.1145/317426.317441}, author = {Shneiderman, Ben} } @article {17511, title = {Window control strategies for on-line text traversal}, journal = {Department of Computer Science and Human Computer Interaction Laboratory, University of Maryland, College Park, MD (correspondence with B. Schneiderman)}, year = {1987}, month = {1987///}, abstract = {Larger and higher resolution screens that support multiple windows are now widely available. They are often used to traverse hypertext databases for fact retrieval, education or casual browsing. This paper introduces window control strategies that we implemented, describes their cognitive complexity, and characterizes the tasks that users might encounter. An infomal usage by dozens of visitors and a usability test with four subjects performing information search tasks revealed the limitations of several strategies and guided us to select user control of article placement in a tiled non-overlapping multiple window display.}, author = {Lifshitz,K. and Shneiderman, Ben} } @article {11933, title = {Algorithm for concurrency control in replicated databases.}, journal = {COMP. SYST. SCI. ENG.}, volume = {1}, year = {1986}, month = {1986///}, pages = {75 - 81}, abstract = {A replicated database system is a distributed database system in which some data objects are stored redundantly at multiple sites to improve the reliability of the system. Without proper control mechanisms, the consistency of a replicated database system could be violated. A new scheme to increase the reliability as well as the degree of concurrency is described. It allows transactions to operate on a data object so long as one or more token copies are available. The scheme also exploits the fact that, for recovery reasons, there are two values for one data object. It is proved that transactions executed according to this scheme preserve consistency.}, author = {Son,S. H and Agrawala, Ashok K.} } @article {16978, title = {Applying direct manipulation concepts: direct manipulation dik operating system (DMDOS)}, journal = {SIGSOFT Softw. Eng. Notes}, volume = {11}, year = {1986}, month = {1986/04//}, pages = {22 - 26}, abstract = {Software engineers are often called upon to design user interfaces, but strategies and guidelines are only beginning to emerge. Shneiderman (1983) introduced the term "Direct Manipulation" to describe user interfaces which have:1) continuous representation of the objects of interest.2) physical actions (movement and selection by mouse, joystick, touch screen, etc.) or labeled button presses instead of complex Syntax.3) rapid, incremental, reversible operations whose impact on the object of interest is immediately visible.4) layered or spiral approach to learning that permits usage with minimal knowledge.The concepts of direct manipulation has been applied in some distinctive systems such as XEROX STAR and APPLE Macintosh, and many application software products such as spread sheets, word processors, drawing tools, desk-top managers, etc.However, the basic software of personal computers, the operating system, is still often based on command language concepts. This paper describes DMDOS (Direct Manipulation Disk Operating System), that we designed by applying the concepts of direct manipulation. to MS-DOS on the IBM PC.}, isbn = {0163-5948}, doi = {10.1145/382248.382815}, url = {http://doi.acm.org/10.1145/382248.382815}, author = {Iseki,Osamu and Shneiderman, Ben} } @article {15717, title = {Assignment and scheduling in parallel matrix factorization}, journal = {Linear Algebra and its Applications}, volume = {77}, year = {1986}, month = {1986/05//}, pages = {275 - 299}, abstract = {We consider the problem of factoring a dense n{\texttimes}n matrix on a network consisting of P MIMD processors, with no shared memory, when the network is smaller than the number of elements in the matrix (P\<n2). The specific example analyzed is a computational network that arises in computing the LU, QR, or Cholesky factorizations. We prove that if the nodes of the network are evenly distributed among processors and if computations are scheduled by a round-robin or a least-recently-executed scheduling algorithm, then optimal order of speedup is achieved. However, such speedup is not necessarily achieved for other scheduling algorithms or if the computation for the nodes is inappropriately split across processors, and we give examples of these phenomena. Lower bounds on execution time for the algorithm are established for two important node-assignment strategies.}, isbn = {0024-3795}, doi = {10.1016/0024-3795(86)90172-2}, url = {http://www.sciencedirect.com/science/article/pii/0024379586901722}, author = {O{\textquoteright}Leary, Dianne P. and Stewart, G.W.} } @article {17268, title = {Is Bigger Better?: The Effects of Display Size on Program Reading}, journal = {Tech Report HCIL-86-08}, year = {1986}, month = {1986///}, abstract = {An experiment was conducted in which four window sizes (10, 22, 60 and 120 lines) were compared for their effectiveness for program reading. The largest window, in which the entire program could be seen at one time, was found significantly better, in both time to complete the reading task and the number of correct answers in the reading task. Subjects also preferred the larger windows to the smaller windows.}, author = {Reisel,J.F. and Shneiderman, Ben} } @article {17015, title = {Cognitive layouts of windows and multiple screens for user interfaces}, journal = {International Journal of Man-Machine Studies}, volume = {25}, year = {1986}, month = {1986/08//}, pages = {229 - 248}, abstract = {In order to make computers easier to use and more versatile many system designers are exploring the use of multiple windows on a single screen and multiple coordinated screens in a single work station displaying linked or related information. The designers of such systems attempt to take into account the characteristics of the human user and the structure of the tasks to be performed. Central to this design issue is the way in which the user views and cognitively processes information presented in the windows or in multiple screens. This paper develops a theory of the {\textquotedblleft}cognitive layout{\textquotedblright} of information presented in multiple windows or screens. It is assumed that users adopt a cognitive representation or layout of the type of information to be presented and the relationships among the windows or screens and the information they contain. A number of cognitive layouts are derived from theories in cognitive psychology and are discussed in terms of the intent of the software driving the system and congruence with the cognitive processing of the information. It is hypothesized that the particular layout adopted by a user will drastically affect the user{\textquoteright}s understanding and expectation of events at the human-computer interface and could either greatly facilitate or frustrate the interaction. Ways of ensuring the former and avoiding the latter are discussed in terms of implementations on existing multiple-window and multiple-screen systems.}, isbn = {0020-7373}, doi = {10.1016/S0020-7373(86)80077-3}, url = {http://www.sciencedirect.com/science/article/pii/S0020737386800773}, author = {Norman,Kent L and Weldon,Linda J. and Shneiderman, Ben} } @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 {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 {17131, title = {Empirical studies of programmers: The territory, paths, and destinations}, journal = {Empirical studies of programmers}, year = {1986}, month = {1986///}, pages = {1 - 12}, abstract = {This paper attempts to describe the varied intellectual territory thatprogrammers work in. It offers several paths for researchers who wish to explore this territory: controlled experiments, observational or field studies, surveys, and cognitive theories. Finally, this paper suggests several important destinations for researchers: refining the use of current languages, improving present and future languages, developing special purpose languages, and improving tools and methods. }, author = {Shneiderman, Ben} } @article {16967, title = {An experimental comparison of a mouse and arrow-jump keys for an interactive encyclopedia}, journal = {International Journal of Man-Machine Studies}, volume = {24}, year = {1986}, month = {1986/01//}, pages = {29 - 45}, abstract = {This paper reports on an experiment which was conducted to examine relative merits of using a mouse or arrow-jump keys to select text in an interactive encyclopedia. Timed path traversais were performed by subjects using each device, and were followed by subjective questions. Personality and background of the subjects were recorded to see if those attributes would affect device preference and performance. The arrow-jump keys were found to have the quickest traversal times for paths with either short or long target distances. The subjective responses indicated that the arrow-jump method was overwhelmingly preferred over the mouse method. Personality type was not found to play a critical role.}, isbn = {0020-7373}, doi = {10.1016/S0020-7373(86)80038-4}, url = {http://www.sciencedirect.com/science/article/pii/S0020737386800384}, author = {Ewing,John and Mehrabanzad,Simin and Sheck,Scott and Ostroff,Dan and Shneiderman, Ben} } @article {17213, title = {Human-computer interaction research at the University of Maryland}, journal = {ACM SIGCHI Bulletin}, volume = {17}, year = {1986}, month = {1986/01//}, pages = {27 - 32}, abstract = {The Human-Computer Interaction Laboratory (HCIL) is a unit of the Center for Automation Research at the Univesity of Maryland. HCIL is an interdisciplinary research group whose participants are faculty in the Departments of Computer Science and Psychology and the Colleges of Library and Information Services, Business, and Education. In addition, staff scienctists, graduate students, and undergraduates contribute to this small, but lively community that pursues empirical studies of people using computers.Our support comes from industrial research projects, government grants, the State of Maryland, and the University of Maryland. Projects often become interrelated in surprising ways enabling individuals to cooperate constructively. Some of our efforts during the past year are described below.}, isbn = {0736-6906}, doi = {10.1145/15671.15673}, url = {http://doi.acm.org/10.1145/15671.15673}, author = {Shneiderman, Ben} } @article {14131, title = {A Hybrid Chebyshev Krylov Subspace Algorithm for Solving Nonsymmetric Systems of Linear Equations}, journal = {SIAM Journal on Scientific and Statistical ComputingSIAM J. Sci. and Stat. Comput.}, volume = {7}, year = {1986}, month = {1986///}, pages = {840 - 840}, isbn = {01965204}, doi = {10.1137/0907057}, url = {http://link.aip.org/link/SJOCE3/v7/i3/p840/s1\&Agg=doi}, author = {Elman, Howard and Saad, Youcef and Saylor, Paul E.} } @article {17261, title = {Interfaces: multi-media and multi-user}, journal = {Computer Supported Cooperative Work: Proceedings of the 1986 ACM conference on Computer-supported cooperative work}, year = {1986}, month = {1986///}, author = {Shneiderman, Ben} } @article {17274, title = {Learning disabled students{\textquoteright} difficulties in learning to use a word processor: implications for design}, journal = {ACM SIGCHI Bulletin}, volume = {17}, year = {1986}, month = {1986/01//}, pages = {41 - 46}, abstract = {Learning disabled students can derive great benefits from using work processors. The ability to produce a neat, printed copy can increase motivation and encourage writing for a wider audience. The editing power makes revision possible without tedious re-copying, thus freeing students and teachers to approach writing as a process involving repeated drafts. Specific problems with handwriting and spelling can also be circumvented. However, learning to use the editing capabilities often presents problems for students, especially those with learning difficulties. Word processors must be designed that are simple, easy to learn, and yet powerful. This study makes software design recommendations based on a study of learning disabled students learning to use word processing.Two groups of four LD students (4th-6th grade) were given twelve hours of word processing instruction using two word processors. Detailed records of progess and errors were made during learning and a final assessment task. Specific design problems are reported and recommendations are made for tasks such as cursor movement, insertion/deletion, use of nulls, blanks, and formatting characters, and overall organization.}, isbn = {0736-6906}, doi = {10.1145/15671.15675}, url = {http://doi.acm.org/10.1145/15671.15675}, author = {MacArthur,Charles A. and Shneiderman, Ben} } @article {17275, title = {Learning Disabled Students{\textquoteright} Difficulties in Learning to Use A Word Processor: Implications for Instruction and Software Evaluation}, journal = {Journal of Learning DisabilitiesJ Learn Disabil}, volume = {19}, year = {1986}, month = {1986/04/01/}, pages = {248 - 253}, abstract = {Learning disabled (LD) students can derive great benefits from using word processors. The ability to produce a neat, printed copy can increase motivation and encourage writing for a wider audience. The editing power makes revision possible without tedious recopying, thus freeing students and teachers to approach writing as a process involving repeated drafts. Specific problems with handwriting and spelling can also be circumvented. However, learning to use a word processor often presents problems. Based on a study of LD students learning to use word processing, this paper makes recommendations for evaluating word processing software and designing instruction that is sensitive to students difficulties.}, isbn = {0022-2194,}, doi = {10.1177/002221948601900414}, url = {http://ldx.sagepub.com/content/19/4/248}, author = {MacArthur,Charles A. and Shneiderman, Ben} } @article {17308, title = {No members, no officers, no dues: A ten year history of the software psychology society}, journal = {ACM SIGCHI Bulletin}, volume = {18}, year = {1986}, month = {1986/10//}, pages = {14 - 16}, abstract = {For ten years we have joyfully overcome our insecurity with anarchy and successfully conducted the "business" of the Software Psychology Society. Our business has always been science; to improve our understanding of how people use computers. The two-horse team of computer science and psychology usually pulled in the same direction. Sometimes it leaned towards design guidelines, software, and hardware, other times it leaned towards cognitive models, personality theory, and human problem-solving. Mostly our travel was steadied by an appreciation of the importance of empirical studies, data collection, and controlled experiments with an occasional diversion into theoretical models or inspirational system designs. Our destinations have included programming and command language design, human-computer interaction models, menu selection strategies, natural language interaction, software engineering metrics and methods, educational packages, expert system user interfaces, voice communications and conferencing systems, screen readability, use of color, user interface management systems, and text editor design.}, isbn = {0736-6906}, doi = {10.1145/15683.15685}, url = {http://doi.acm.org/10.1145/15683.15685}, author = {Shneiderman, Ben} } @article {18105, title = {Parallel ear decomposition search (EDS) and st-numbering in graphs}, journal = {Theoretical Computer Science}, volume = {47}, year = {1986}, month = {1986///}, pages = {277 - 298}, author = {Maon,Y. and Schieber,B. and Vishkin, Uzi} } @conference {16456, title = {A parallel processing strategy for evaluating recursive queries}, booktitle = {Proceedings of the 12th International Conference on Very Large Data Bases}, year = {1986}, month = {1986///}, pages = {412 - 419}, author = {Raschid, Louiqa and Su,S. Y.W} } @conference {16004, title = {A Parallel Self-Modifying Default Reasoning System}, booktitle = {AAAI}, year = {1986}, month = {1986///}, pages = {923 - 927}, author = {Minker, Jack and Perlis, Don and Subramanian,K.} } @article {14162, title = {Polynomial iteration for nonsymmetric indefinite linear systems}, journal = {Numerical Analysis}, year = {1986}, month = {1986///}, pages = {103 - 117}, author = {Elman, Howard and Streit, R.} } @conference {11934, title = {Practicality of non-interfering checkpoints in distributed database systems}, booktitle = {IEEE Real-Time Systems Symposium, New Orleans, Louisiana}, year = {1986}, month = {1986///}, pages = {234 - 241}, author = {Son,S. H and Agrawala, Ashok K.} } @article {14157, title = {Preconditioning by Fast Direct Methods for Nonself-Adjoint Nonseparable Elliptic Equations}, journal = {SIAM Journal on Numerical Analysis}, volume = {23}, year = {1986}, month = {1986/02/01/}, pages = {44 - 57}, abstract = {We consider the use of fast direct methods as preconditioners for iterative methods for computing the numerical solution of nonself-adjoint elliptic boundary value problems. We derive bounds on convergence rates that are independent of discretization mesh size. For two-dimensional problems on rectangular domains, discretized on an n {\texttimes} n grid, these bounds lead to asymptotic operation counts of O(n2 log n log ε-1) to achieve relative error ε and O(n2(log n)2) to reach truncation error.}, isbn = {0036-1429}, url = {http://www.jstor.org/stable/2157450}, author = {Elman, Howard and Schultz, Martin H.} } @article {17355, title = {Seven plus or minus two central issues in human-computer interaction}, journal = {ACM SIGCHI Bulletin - Special issue: CHI {\textquoteright}86 Conference Proceedings}, volume = {17}, year = {1986}, month = {1986/04//}, pages = {343 - 349}, abstract = {This paper offers seven issues and specific challenges for researchers and developers of human-computer interaction. These issues are: interaction styles, input techniques, output organization, response time, error handling, individual differences, explanatory and predictive theories.}, isbn = {0736-6906}, doi = {10.1145/22339.22394}, url = {http://doi.acm.org/10.1145/22339.22394}, author = {Shneiderman, Ben} } @article {16445, title = {A Special-Function Unit for Sorting and Sort-Based Database Operations}, journal = {IEEE Transactions on Computers}, volume = {C-35}, year = {1986}, month = {1986/12//}, pages = {1071 - 1077}, abstract = {Achieving efficiency in database management functions is a fundamental problem underlying many computer applications. Efficiency is difficult to achieve using the traditional general-purpose von Neumann processors. Recent advances in microelectronic technologies have prompted many new research activities in the design, implementation, and application of database machines which are tailored for processing database management functions. To build an efficient system, the software algorithms designed for this type of system need to be tailored to take advantage of the hardware characteristics of these machines. Furthermore, special hardware units should be used, if they are cost- effective, to execute or to assist the execution of these software algorithms.}, keywords = {Application software, Computer applications, Database machines, Hardware, hardware sorter, Microelectronics, Software algorithms, Software design, Software systems, sort-based algorithms for database operations, sorting, special-function processor, Technology management}, isbn = {0018-9340}, doi = {10.1109/TC.1986.1676715}, author = {Raschid, Louiqa and Fei,T. and Lam,H. and Su,S. Y.W} } @book {17017, title = {Cognitive Representations of Windows and Multiple Screen Layouts of Computer Interfaces}, year = {1985}, month = {1985///}, publisher = {University of Maryland}, organization = {University of Maryland}, author = {Norman,K. L and Weldon,L.J. and Shneiderman, Ben} } @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} } @article {17198, title = {Human factors issues of manuals, online help, and tutorials}, journal = {Empirical foundations of information and software science}, volume = {1984}, year = {1985}, month = {1985///}, pages = {107 - 107}, author = {Shneiderman, Ben} } @article {17273, title = {Learning a menu selection tree: training methods compared}, journal = {Behaviour \& Information Technology}, volume = {4}, year = {1985}, month = {1985///}, pages = {81 - 91}, abstract = {Abstract Abstract. Menu selection systems sometimes present learning problems for novice users. This comparison of four training methods for novice users found that the global tree diagram of the menu system was superior to command sequence and frame presentation methods, and somewhat better than trial and error. Methods were evaluated on the basis of (1) number of target nodes found, (2) mean number of selections to a target node, (3) recall of the menu structure, and (4) subjective rating of ease of learning.Abstract Abstract. Menu selection systems sometimes present learning problems for novice users. This comparison of four training methods for novice users found that the global tree diagram of the menu system was superior to command sequence and frame presentation methods, and somewhat better than trial and error. Methods were evaluated on the basis of (1) number of target nodes found, (2) mean number of selections to a target node, (3) recall of the menu structure, and (4) subjective rating of ease of learning. }, isbn = {0144-929X}, doi = {10.1080/01449298508901790}, url = {http://www.tandfonline.com/doi/abs/10.1080/01449298508901790}, author = {Parton,Diana and Huffman,Keith and Pridgen,Patty and Norman,Kent and Shneiderman, Ben} } @article {16935, title = {A model programming environment}, journal = {Advances in Human-Computer Interaction}, volume = {1}, year = {1985}, month = {1985///}, pages = {105 - 132}, author = {Shneiderman, Ben} } @article {17320, title = {Performance on content-free menus as a function of study method}, journal = {Tech Report HCIL-85-03}, year = {1985}, month = {1985///}, author = {Schwartz,J.P. and Norman,K. L and Shneiderman, Ben} } @article {17420, title = {The Psychology of Program Documentation}, journal = {Conference on Software Maintenance, 1985, Sheraton Inn Washington-Northwest, November 11-13, 1985}, year = {1985}, month = {1985///}, pages = {191 - 191}, author = {Brooks,R. and Sheppard,S. and Shneiderman, Ben} } @article {17424, title = {The Structure of Information in Online and Paper Technical Manuals}, journal = {Proceedings of the Human Factors and Ergonomics Society Annual MeetingProceedings of the Human Factors and Ergonomics Society Annual Meeting}, volume = {29}, year = {1985}, month = {1985/10/01/}, pages = {1110 - 1113}, abstract = {An experiment was conducted to compare online computer manuals to paper manuals. For each type of manual there were two different database structures {\textendash} a linear (sequential) structure and a tree structure. The results showed that people using the paper manuals were faster at performing a switch setting task based on information in the manual than were people using the online manuals. No significant differences were found in speed of performance between the linear and tree structures. Nor were there any differences in the number of correct switch settings for the different types of manuals. The subjective evaluation data revealed that the online manuals were rated as better and judged to be more organized than the paper manuals.}, isbn = {1071-1813,}, doi = {10.1177/154193128502901207}, url = {http://pro.sagepub.com/content/29/12/1110}, author = {Weldon,Linda J. and Koved,Larry and Shneiderman, Ben} } @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} } @article {16968, title = {An experimental comparison of tabular and graphic data presentation}, journal = {International Journal of Man-Machine Studies}, volume = {20}, year = {1984}, month = {1984/06//}, pages = {545 - 566}, abstract = {We present the results of our experiment designed to test the hypothesis that more usable information can be conveyed using a combination of graphical and tabular data then by using either form alone. Our independent variables were memory (recall and non-recall) and form (tables, graphs, or both). Comprehension was measured with a multiple choice exam consisting of three types of questions (retrieve, compare, or compare/calculate answers). Both non-recall and tabular treatments significantly increased comprehension. Combinations of graphs and tables produced slower but more accurate performance. An executive should use the form with which he/she is most familiar and comfortable.}, isbn = {0020-7373}, doi = {10.1016/S0020-7373(84)80029-2}, url = {http://www.sciencedirect.com/science/article/pii/S0020737384800292}, author = {Powers,Matthew and Lashley,Conda and Sanchez,Pamela and Shneiderman, Ben} } @article {17196, title = {Human Factors in Interactive Medical Systems}, journal = {Proceedings of the Annual Symposium on Computer Application in Medical CareProc Annu Symp Comput Appl Med Care}, year = {1984}, month = {1984/11/07/}, pages = {96 - 96}, isbn = {0195-4210}, author = {Shneiderman, Ben} } @book {17279, title = {Let{\textquoteright}s Learn BASIC: A Kids{\textquoteright} Introduction to BASIC Programming on IBM Personal Computers}, year = {1984}, month = {1984///}, publisher = {Little Brown and Company}, organization = {Little Brown and Company}, isbn = {0316787264}, author = {Shneiderman, Ben} } @article {17294, title = {Memory For Menus: Effects of Study Mode}, journal = {University of Maryland Computer Science Technical Report Series, CS-TR-1412}, year = {1984}, month = {1984///}, abstract = {Menu selection systems require a certain amount of training in order for users to remember how to access target functions. In this experiment users studied four different types of documentation before searching for target words in a content-free menu containing no meaningful relationships among terms. Documentation was presented to subjects in one of four modes of study. In the Command Mode subjects studied sequences of choices to arrive at a desired target. In the Menu Frame Mode subjects studied individual frames in the menu system. In the Global Tree Mode subjects studied a diagram of the menu tree. Finally, in the Trial and Error Mode subjects studied the menu system by actually selecting alternatives. Although the Global Tree and Command Sequence Groups found the most target words during the test phase, the four groups did not differ significantly. On the other hand, differences in the ability to recall menu terms were significant with the command Sequence and Menu Frame Groups recalling the most terms. Furthermore, results indicated that the type of training fundamentally affected the type of information used in order to find targets. Subjects in the Command Sequence and Menu Frame Groups tended to rely on recall of menu terms. Furthermore, all groups relied heavily on memory of the menu tree except for the Command Squence Group. Results of this study are related to practical considerations for the design of menu selection systems.}, author = {Norman,K. L and Schwartz,J.P. and Shneiderman, Ben} } @article {18405, title = {Monitoring an Ada software development}, journal = {ACM SIG Ada Letters}, volume = {IV}, year = {1984}, month = {1984/07//}, pages = {32 - 39}, isbn = {1094-3641}, doi = {10.1145/998401.998402}, url = {http://doi.acm.org/10.1145/998401.998402}, author = {Basili, Victor R. and Chang,Shih and Gannon,John and Katz,Elizabeth and Panlilio-Yap,N. Monina and Ramsey,Connie Loggia and Zelkowitz, Marvin V and Bailey,John and Kruesi,Elizabeth and Sheppard,Sylvia} } @article {17349, title = {Response time and display rate in human performance with computers}, journal = {ACM Comput. Surv.}, volume = {16}, year = {1984}, month = {1984/09//}, pages = {265 - 285}, isbn = {0360-0300}, doi = {10.1145/2514.2517}, url = {http://doi.acm.org/10.1145/2514.2517}, author = {Shneiderman, Ben} } @article {18991, title = {RNA splicing and the involvement of small ribonucleoproteins}, journal = {Modern cell biology}, volume = {3}, year = {1984}, month = {1984///}, pages = {249 - 297}, keywords = {Article synth{\`e}se, Articulo sintesis, review, Ribonucleoprotein, Ribonucleoproteina, Ribonucl{\'e}oprot{\'e}ine, RNA, Sn-RNA, splicing}, isbn = {0745-3000}, url = {http://cat.inist.fr/?aModele=afficheN\&cpsidt=9051421}, author = {Mount, Stephen M. and Steitz,J. A.} } @article {18130, title = {Solving NP-hard problems on graphs that are almost trees and an application to facility location problems}, journal = {Journal of the ACM (JACM)}, volume = {31}, year = {1984}, month = {1984///}, pages = {459 - 473}, author = {Gurevich,Y. and Stockmeyer,L. and Vishkin, Uzi} } @article {17410, title = {The effect of scope delimiters on program comprehension}, journal = {Software: Practice and Experience}, volume = {13}, year = {1983}, month = {1983/09/01/}, pages = {817 - 824}, abstract = {Scope delimiters, such as BEGIN-END or DO-END, are used in many programming languages, but they can lengthen and clutter a program listing. This paper provides experimental evidence that ENDIF or ENDWHILE statement terminators make for easier to comprehend programs than BEGIN-END pairs surrounding compound statements.}, keywords = {Programming language design, Scope delimiters, Software psychology}, isbn = {1097-024X}, doi = {10.1002/spe.4380130908}, url = {http://onlinelibrary.wiley.com/doi/10.1002/spe.4380130908/abstract}, author = {Sykes,Floyd and Tillman,Raymond T and Shneiderman, Ben} } @article {16963, title = {An empirical comparison of two PLATO text editors.}, journal = {Journal of Computer-Based Instruction}, volume = {10}, year = {1983}, month = {1983///}, pages = {43 - 50}, abstract = {Two PLATO system text editors were evaluated with 14 nonprogrammers and 14 programmers who were either university staff or college students. Half of each group learned the "plain" editor, which had 8 commands and 3 screens of HELP material; while the other half of each group learned the "fancy" editor, which had 15 commands and 1 screen of HELP material. The fancy editor is a subset of the widely used TUTOR editor, but nonprogrammers preferred the plain editor. Faster learning, faster performance, fewer invocations of HELP material, and fewer requests for human assistance were characteristic of the plain editor.}, author = {Shneiderman, Ben and Hill,R. and Jacob,R. and Mah,W.} } @article {17141, title = {Evaluating multiple coordinated windows for programming workstations}, journal = {NASA. Goddard Space Flight Center Proc. of the Eighth Ann. Software Eng. Workshop 11 p(SEE N 84-23137 13-61)}, year = {1983}, month = {1983///}, abstract = {Programmers might benefit from larger screens with multiple windows or multiple screens, especially if convenient coordination among screens are arranged. Uses for multiple coordinated displays in a programmers workstation are explored. Initial efforts focus on the potential applications, a command language for coordinating the displays, and the psychological basis for effective utilization so as to avoid information overload. Subsequent efforts will be devoted to implementing the concepts and performing controlled psychologically oriented experiments to validate the hypotheses.}, author = {Shneiderman, Ben and GRANTHAM,C. and Norman,K. and ROGERS,J. and Roussopoulos, Nick} } @article {17191, title = {High-tech can stimulate creative action: the increased ease-of-use of computers supports individual competence and productive work}, journal = {SIGCHI Bull.}, volume = {14}, year = {1983}, month = {1983/04//}, pages = {6 - 7}, abstract = {Jokes about the complexity and error-prone use of computer systems reflect the experience of many people. Computer anxiety, terminal terror, and network neurosis are modern maladies - but help is on the way!}, isbn = {0736-6906}, doi = {10.1145/1044188.1044189}, url = {http://doi.acm.org/10.1145/1044188.1044189}, author = {Shneiderman, Ben} } @article {17193, title = {Human engineering management plan for interactive systems}, journal = {Proceedings COMPCON}, volume = {83}, year = {1983}, month = {1983///}, author = {Shneiderman, Ben} } @inbook {17199, title = {Human factors of interactive software}, booktitle = {Enduser Systems and Their Human FactorsEnduser Systems and Their Human Factors}, series = {Lecture Notes in Computer Science}, volume = {150}, year = {1983}, month = {1983///}, pages = {9 - 29}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {There is intense interest about human factors issues in interactive computer systems for life-critical applications, industrial/commercial uses, and personal computing in the office or home. Primary design goals include proper functionality, adequate reliability, suitable cost, and adherence to schedule. Measurable human factors issues include time to learn, speed of performance, rate of errors, subjective satisfaction, and retention over time. Specific human factors acceptance tests are described as a natural complement to hardware and software acceptance tests. Project management ideas, information resources, and potential research directions are presented.}, isbn = {978-3-540-12273-9}, url = {http://dx.doi.org/10.1007/3-540-12273-7_16}, author = {Shneiderman, Ben}, editor = {Blaser,Albrecht and Zoeppritz,Magdalena} } @article {14147, title = {The (new) Yale sparse matrix package}, journal = {Elliptic problem solvers II}, year = {1983}, month = {1983///}, pages = {45 - 52}, author = {Eisenstat, S. C and Elman, Howard and Schultz, M. H and Sherman, A. H} } @article {17328, title = {Program indentation and comprehensibility}, journal = {Communications of the ACM}, volume = {26}, year = {1983}, month = {1983/11//}, pages = {861 - 867}, keywords = {indentation, program format, program readability}, isbn = {0001-0782}, doi = {10.1145/182.358437}, url = {http://doi.acm.org/10.1145/182.358437}, author = {Miara,Richard J. and Musselman,Joyce A. and Navarro,Juan A. and Shneiderman, Ben} } @article {18981, title = {RNA processing: Lessons from mutant globins}, journal = {Nature}, volume = {303}, year = {1983}, month = {1983/06/02/}, pages = {380 - 381}, isbn = {0028-0836}, doi = {10.1038/303380a0}, url = {http://ukpmc.ac.uk/abstract/MED/6855891/reload=0;jsessionid=6LgsyNwDXt7LrUcZkgTq.12}, author = {Mount, Stephen M. and Steitz,Joan} } @article {18996, title = {Small Ribonucleoproteins from Eukaryotes: Structures and Roles in RNA Biogenesis}, journal = {Cold Spring Harbor Symposia on Quantitative BiologyCold Spring Harb Symp Quant Biol}, volume = {47}, year = {1983}, month = {1983/01/01/}, pages = {893 - 900}, abstract = {Detailed reviews describing work presented at the annual Cold Spring Harbor Symposia on Quantitative Biology}, isbn = {0091-7451, 1943-4456}, doi = {10.1101/SQB.1983.047.01.103}, url = {http://symposium.cshlp.org/content/47/893}, author = {Steitz,J. A. and Wolin,S. L. and Rinke,J. and Pettersson,I. and Mount, Stephen M. and Lerner,E. A. and Hinterberger,M. and Gottlieb,E.} } @article {18999, title = {Splicing of messenger RNA precursors is inhibited by antisera to small nuclear ribonucleoprotein}, journal = {Cell}, volume = {35}, year = {1983}, month = {1983/11//}, pages = {101 - 107}, isbn = {00928674}, doi = {10.1016/0092-8674(83)90212-X}, url = {http://ukpmc.ac.uk/abstract/MED/6194895}, author = {Padgett,Richard A. and Mount, Stephen M. and Steitz,Joan A. and Sharp,Phillip A.} } @article {19006, title = {The U1 small nuclear RNA-protein complex selectively binds a 5' splice site in vitro}, journal = {Cell}, volume = {33}, year = {1983}, month = {1983/06//}, pages = {509 - 518}, abstract = {The ability of purified U1 small nuclear RNA-protein complexes (U1 snRNPs) to bind in vitro to two RNAs transcribed from recombinant DNA clones by bacteriophage T7 RNA polymerase has been studied. A transcript which contains sequences corresponding to the small intron and flanking exons of the major mouse beta-globin gene is bound in marked preference to an RNA devoid of splice site sequences. The site of U1 snRNP binding to the globin RNA has been defined by T1 ribonuclease digestion of the RNA-U1 snRNP complex. A 15-17-nucleotide region, including the 5{\textquoteright} splice site, remains undigested and complexed with the snRNP such that it can be co-precipitated by antibodies directed against the U1 snRNP. Partial proteinase K digestion of the U1 snRNP abolishes interaction with the globin RNA, indicating that the snRNP proteins contribute significantly to RNA binding. No RNA cleavage, splicing, or recognition of the 3{\textquoteright} splice site by U1 snRNPs has been detected. Our results are discussed in terms of the probable role of U1 snRNPs in the messenger RNA splicing of eucaryotic cell nuclei.}, isbn = {00928674}, doi = {10.1016/0092-8674(83)90432-4}, url = {http://ukpmc.ac.uk/abstract/MED/6190573}, author = {Mount, Stephen M. and Pettersson,Ingvar and Hinterberger,Monique and Karmas,Aavo and Steitz,Joan A.} } @article {14142, title = {Variational Iterative Methods for Nonsymmetric Systems of Linear Equations}, journal = {SIAM Journal on Numerical Analysis}, volume = {20}, year = {1983}, month = {1983/04/01/}, pages = {345 - 357}, abstract = {We consider a class of iterative algorithms for solving systems of linear equations where the coefficient matrix is nonsymmetric with positive-definite symmetric part. The algorithms are modelled after the conjugate gradient method, and are well suited for large sparse systems. They do not make use of any associated symmetric problems. Convergence results and error bounds are presented.}, isbn = {0036-1429}, url = {http://www.jstor.org/stable/2157222}, author = {Eisenstat, Stanley C. and Elman, Howard and Schultz, Martin H.} } @article {16959, title = {An architecture for automatic relational database sytem conversion}, journal = {ACM Trans. Database Syst.}, volume = {7}, year = {1982}, month = {1982/06//}, pages = {235 - 257}, abstract = {Changes in requirements for database systems necessitate schema restructuring, database translation, and application or query program conversion. An alternative to the lengthy manual revision process is proposed by offering a set of 15 transformations keyed to the relational model of data and the relational algebra. Motivations, examples, and detailed descriptions are provided.}, keywords = {automatic conversion, Database systems, relational model, transformations}, isbn = {0362-5915}, doi = {10.1145/319702.319724}, url = {http://doi.acm.org/10.1145/319702.319724}, author = {Shneiderman, Ben and Thomas,Glenn} } @conference {16981, title = {Automatic database system conversion: schema revision, data translation, and source-to-source program transformation}, booktitle = {Proceedings of the June 7-10, 1982, national computer conference}, series = {AFIPS {\textquoteright}82}, year = {1982}, month = {1982///}, pages = {579 - 587}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Changing data requirements present database administrators with a difficult problem: the revision of the schema, the translation of the stored database, and the conversion of the numerous application programs. This paper describes an automatic database system conversion facility which provides one approach for coping with this problem. The Pure Definition Language and the Pure Manipulation Language have been designed to facilitate the conversions specified in the Pure Transformation Language. Two conversions and their effect on retrievals are demonstrated.}, isbn = {0-88283-035-X}, doi = {10.1145/1500774.1500849}, url = {http://doi.acm.org/10.1145/1500774.1500849}, author = {Shneiderman, Ben and Thomas,Glenn} } @conference {18142, title = {A complexity theory for unbounded fan-in parallelism}, booktitle = {23rd Annual Symposium on Foundations of Computer Science}, year = {1982}, month = {1982///}, pages = {1 - 13}, author = {Chandra,A. K and Stockmeyer,L. J and Vishkin, Uzi} } @article {17031, title = {Control flow and data structure documentation: two experiments}, journal = {Commun. ACM}, volume = {25}, year = {1982}, month = {1982/01//}, pages = {55 - 63}, abstract = {Two experiments were carried out to assess the utility of external documentation aids such as macro flowcharts, pseudocode, data structure diagrams, and data structure descriptions. A 223 line Pascal program which manipulates four arrays was used. The program interactively handles commands that allow the user to manage five lists of items. A comprehension test was given to participants along with varying kinds of external documentation. The results indicate that for this program the data structure information was more helpful than the control flow information, independently of whether textual or graphic formats were used.}, keywords = {data structure diagrams, pseudocode}, isbn = {0001-0782}, doi = {10.1145/358315.358391}, url = {http://doi.acm.org/10.1145/358315.358391}, author = {Shneiderman, Ben} } @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 {17160, title = {Fighting for the User.}, journal = {Bulletin of the American Society for Information ScienceBulletin of the American Society for Information Science}, volume = {9}, year = {1982}, month = {1982///}, pages = {27 - 29}, abstract = {Redesign of human-computer interface for users of computerized information systems can make substantial difference in training time, performance speed, error rates, and user satisfaction. Information and computer scientists are using controlled psychologically oriented experimentation, and evaluations during system development and active use to test design impact on human performance measures. (EJS)}, keywords = {Automation, design, Formative Evaluation, Human Factors Engineering, Information systems, Input Output Devices, Man Machine Systems, Online Systems, performance, Summative Evaluation, Systems Development, Technological Advancement}, url = {http://www.eric.ed.gov/ERICWebPortal/detail?accno=EJ276739}, author = {Shneiderman, Ben} } @article {17415, title = {The future of interactive systems and the emergence of direct manipulation}, journal = {Behaviour \& Information Technology}, volume = {1}, year = {1982}, month = {1982///}, pages = {237 - 256}, abstract = {Abstract This paper suggests three motivations for the strong interest in human factors{\textquoteright} aspects of user interfaces and reviews five design issues: command language versus menu selection, response time and display rates, wording of system messages, on-line tutorials, explanations and help messages and hardware devices. Five methods and tools for system development are considered: participatory design, specification methods, software implementation tools, pilot studies and acceptance tests and evolutionary refinement based on user feedback. The final portion of the paper presents direct manipulation, an approach which promises to become widely used in interactive systems. Direct manipulation involves representation of the object of interest, rapid incremental reversible actions and physical action instead of complex syntax.Abstract This paper suggests three motivations for the strong interest in human factors{\textquoteright} aspects of user interfaces and reviews five design issues: command language versus menu selection, response time and display rates, wording of system messages, on-line tutorials, explanations and help messages and hardware devices. Five methods and tools for system development are considered: participatory design, specification methods, software implementation tools, pilot studies and acceptance tests and evolutionary refinement based on user feedback. The final portion of the paper presents direct manipulation, an approach which promises to become widely used in interactive systems. Direct manipulation involves representation of the object of interest, rapid incremental reversible actions and physical action instead of complex syntax. }, isbn = {0144-929X}, doi = {10.1080/01449298208914450}, url = {http://www.tandfonline.com/doi/abs/10.1080/01449298208914450}, author = {Shneiderman, Ben} } @article {17301, title = {Multiparty Grammars and Related Features for Defining Interactive Systems}, journal = {IEEE Transactions on Systems, Man and Cybernetics}, volume = {12}, year = {1982}, month = {1982/03//}, pages = {148 - 154}, abstract = {Multiparty grammars are introduced which contain labeled nonterminals to indicate the party that produces the terminal string. For interactive person-computer systems, both the user commands and system responses can be described by the linked BNF grammars. Multiparty grammars may also be used to describe communication among several people (by way of computers or in normal dialogue), network protocols among several machines, or complex interactions involving several people and machines. Visual features such as underlining, reversal, blinking, and color, window declarations, and dynamic operations dependent on cursor movement are also covered.}, keywords = {Application software, Computer aided instruction, Computer displays, Computer languages, Computer networks, Debugging, HUMANS, interactive systems, Protocols, Writing}, isbn = {0018-9472}, doi = {10.1109/TSMC.1982.4308798}, author = {Shneiderman, Ben} } @article {18141, title = {An O (logn) parallel connectivity algorithm}, journal = {Journal of Algorithms}, volume = {3}, year = {1982}, month = {1982///}, pages = {57 - 67}, author = {Shiloach,Y. and Vishkin, Uzi} } @article {18140, title = {An O (n2log n) parallel max-flow algorithm}, journal = {Journal of Algorithms}, volume = {3}, year = {1982}, month = {1982///}, pages = {128 - 146}, author = {Shiloach,Y. and Vishkin, Uzi} } @article {18139, title = {parallel MAX-FLOW algorithm}, journal = {Journal of Algorithms}, volume = {3}, year = {1982}, month = {1982///}, pages = {128 - 146}, author = {Shiloach,Y. and Vishkin, Uzi and An,O.} } @article {17350, title = {Response to N. C. Rowe{\textquoteright}s review}, journal = {ACM SIGMOD Record}, volume = {13}, year = {1982}, month = {1982/09//}, pages = {98 - 98}, isbn = {0163-5808}, doi = {10.1145/984514.984521}, url = {http://doi.acm.org/10.1145/984514.984521}, author = {Shneiderman, Ben} } @article {19002, title = {Structure and function of small ribonucleoproteins from eukaryotic cells}, journal = {Princess Takamatsu symposiaInt. Symp. Princess Takamatsu Cancer Res. Fund}, volume = {12}, year = {1982}, month = {1982///}, pages = {101 - 107}, abstract = {Autoantibodies from patients with systemic lupus erythematosus and other related diseases have been used to identify and study small RNA-protein complexes from mammalian cells. Properties of three previously described and several new classes of small ribonucleoproteins (RNPs) are reviewed. The sequence of Drosophila U1 RNA reveals that the region proposed to pair with 5{\textquoteright} splice junctions is conserved, while that proposed to interact with 3{\textquoteright} junctions diverges; this forces some revision of the model for U1 small nuclear (sn)RNP participation in hnRNA splicing. Further characterization of the Ro and La small RNPs has shown that the Ro small cytoplasmic (sc)RNPs are a subclass of La RNPs. Both tRNA and 5S rRNA precursors are at least transiently associated with the La protein. This raises the possibility that the La protein may be an RNA polymerase III transcription factor.}, keywords = {Antigen-Antibody Complex, Autoantibodies, HUMANS, Lupus Erythematosus, Systemic, Nucleoproteins, Ribonucleoproteins, RNA Polymerase III, Transcription, Genetic}, url = {http://www.ncbi.nlm.nih.gov/pubmed/7166547}, author = {Steitz,J. A. and Berg,C and Gottlieb,E. and Hardin,J A and Hashimoto,C and Hendrick,J P and Hinterberger,M. and Krikeles,M and Lerner,M R and Mount, Stephen M.} } @book {17390, title = {System message design: Guidelines and experimental results}, year = {1982}, month = {1982///}, publisher = {Ablex Publishing Company: Norwood, NJ}, organization = {Ablex Publishing Company: Norwood, NJ}, author = {Shneiderman, Ben} } @article {17391, title = {SYSTEM MESSAGE GUIDELINES: POSITIVE TONE, CONSTRUCTIVE, SPECIFIC, AND USER CENTERED}, journal = {Gathering Information for Problem Formulation}, year = {1982}, month = {1982///}, author = {Shneiderman, Ben} } @article {17394, title = {Teaching software psychology experimentation through team projects}, journal = {ACM SIGCSE Bulletin}, volume = {14}, year = {1982}, month = {1982/09//}, pages = {38 - 40}, isbn = {0097-8418}, doi = {10.1145/989322.989331}, url = {http://doi.acm.org/10.1145/989322.989331}, author = {Shneiderman, Ben} } @article {15696, title = {A Bidiagonalization-Regularization Procedure for Large Scale Discretizations of Ill-Posed Problems}, journal = {SIAM Journal on Scientific and Statistical Computing}, volume = {2}, year = {1981}, month = {1981///}, pages = {474 - 489}, abstract = {In this paper, we consider ill-posed problems which discretize to linear least squares problems with matrices $K$ of high dimensions. The algorithm proposed uses $K$ only as an operator and does not need to explicitly store or modify it. A method related to one of Lanczos is used to project the problem onto a subspace for which $K$ is bidiagonal. It is then an easy matter to solve the projected problem by standard regularization techniques. These ideas are illustrated with some integral equations of the first kind with convolution kernels, and sample numerical results are given.}, keywords = {first kind integral equation, ill-posed problems, Lanczos algorithm, regularization}, doi = {10.1137/0902037}, url = {http://link.aip.org/link/?SCE/2/474/1}, author = {O{\textquoteright}Leary, Dianne P. and Simmons,John A.} } @article {17019, title = {Comments from a Letter Written on July 19, 1978}, journal = {Software Engineering, IEEE Transactions on}, year = {1981}, month = {1981///}, pages = {370 - 371}, author = {Shneiderman, Ben} } @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} } @article {17151, title = {Exploratory research on training aids for naive users of interactive systems}, journal = {Proceedings of the 44th ASIS Annual Meeting}, volume = {18}, year = {1981}, month = {1981///}, pages = {65 - 67}, author = {Stevens,P. and Shneiderman, Ben} } @article {18144, title = {Finding the maximum, merging, and sorting in a parallel computation model}, journal = {Journal of Algorithms}, volume = {2}, year = {1981}, month = {1981///}, pages = {88 - 102}, author = {Shiloach,Y. and Vishkin, Uzi} } @article {17192, title = {Human Aspects of Computing Editor Control Flow and Data Structure Documentation: Two Experiments}, journal = {Human factors in software development}, year = {1981}, month = {1981///}, pages = {365 - 365}, author = {Shneiderman, Ben} } @article {17197, title = {HUMAN FACTORS ISSUES IN DESIGNING INTERACTIVE SYSTEMS}, journal = {Proceedings-Compcon}, volume = {25}, year = {1981}, month = {1981///}, pages = {116 - 116}, author = {Shneiderman, Ben} } @article {17201, title = {Human factors studies with system message styles (abstract only)}, journal = {ACM SIGSOC Bulletin}, volume = {13}, year = {1981}, month = {1981/05//}, pages = {138{\textendash} - 138{\textendash}}, abstract = {Computer systems often contain messages which are imprecise ({\textquoteright}SYNTAX ERROR{\textquoteright}), hostile ({\textquoteright}FATAL ERROR, RUN ABORTED{\textquoteright}), cryptic ({\textquoteright}IEH291H{\textquoteright}), or obscure ({\textquoteright}CTL DAMAGE, TRANS ERR{\textquoteright}). Such messages may be acceptable to computer professionals who regularly use a specific system, but they lead to frustration for novices and for professionals who are using new features or facilities.We have conducted five studies using COBOL compiler syntax errors and text editor command errors to measure the impact of improving the wording of system messages. The results indicate that increased specificity, more positive tone, and greater clarity can improve correction rates and user satisfaction.An overview of the experimental results will be presented along with guidelines for writing system messages.}, isbn = {0163-5794}, doi = {10.1145/1015579.810979}, url = {http://doi.acm.org/10.1145/1015579.810979}, author = {Shneiderman, Ben} } @article {16939, title = {A note on human factors issues of natural language interaction with database systems}, journal = {Information Systems}, volume = {6}, year = {1981}, month = {1981///}, pages = {125 - 129}, abstract = {Efforts at constructing natural language computer systems have turned to implementing database query facilities. If the application domain is limited there is renewed hope for the success of natural language interfaces. This paper reviews arguments for and against such facilities, stresses research in human semantic knowledge, and emphasizes controlled psychologically oriented experimentation. The results of recent experiments are reported.}, isbn = {0306-4379}, doi = {10.1016/0306-4379(81)90034-X}, url = {http://www.sciencedirect.com/science/article/pii/030643798190034X}, author = {Shneiderman, Ben} } @conference {17334, title = {Putting the human factor into systems development}, booktitle = {Proceedings of the eighteenth annual computer personnel research conference}, series = {SIGCPR {\textquoteright}81}, year = {1981}, month = {1981///}, pages = {1 - 13}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {As the community of computer users expands beyond experienced professionals to encompass novice users with little technical training, human factors considerations must play a larger role. {\textquotedblleft}Computer shock{\textquotedblright} and {\textquotedblleft}terminal terror{\textquotedblright} cannot be cured, they must be prevented by more careful human engineering during the system design phase. This paper offers four approaches to including human factors considerations during system design. These approaches focus on increasing user involvement and emphasize extensive pilot testing. Human factors cannot be added as refinements to a completed design; they must be a central concern during the initial requirements analysis and through every design stage.}, isbn = {0-89791-044-3}, doi = {10.1145/800051.801845}, url = {http://doi.acm.org/10.1145/800051.801845}, author = {Shneiderman, Ben} } @article {18993, title = {Sequence of U1 RNA from Drosophila melanogaster: implications for U1 secondary structure and possible involvement in splicing}, journal = {Nucleic Acids ResearchNucl. Acids Res.}, volume = {9}, year = {1981}, month = {1981/12/11/}, pages = {6351 - 6368}, abstract = {U1 RNA from cultured Drosophila melanogaster cells (Kc) was identified by its ability to be recognized, as an RNP, by anti-(U1)RNP antibodies from human lupus patients. Its sequence was deduced largely from direct analysis of the RNA molecule and then confirmed by DNA sequence determinations on a genomic clone isolated by hybridization to Drosophila U1 RNA. The Drosophila U1 RNA sequence exhibits 72\% agreement with human U1 RNA. Nucleotides 3-11, which are complementary to the entire consensus sequence for donor (5') splice junctions in hnRNA, and to part of the acceptor (3') consensus, are exactly conserved. However, nucleotides 14-21, postulated to interact only with acceptor junctions, differ. Comparison of the Drosophila U1 sequence with vertebrate U1 sequences allows a particular secondary structure model to be preferred over others. These results are consistent with the hypothesis that U1 snRNPs are involved in splicing, but suggest specific modifications of the model detailing molecular interactions between U1 RNA and hnRNA during the splicing reaction.}, isbn = {0305-1048, 1362-4962}, doi = {10.1093/nar/9.23.6351}, url = {http://nar.oxfordjournals.org/content/9/23/6351}, author = {Mount, Stephen M. and Steitz,Joan A.} } @article {19007, title = {Transcription of cloned tRNA and 5S RNA genes in a Drosophila cell free extract}, journal = {Nucleic Acids ResearchNucl. Acids Res.}, volume = {9}, year = {1981}, month = {1981/08/25/}, pages = {3907 - 3918}, abstract = {We describe the preparation of a cell-free extract from Drosophila Kc cells which allows transcription of a variety of cloned eukaryotic RNA polymerase III genes. The extract has low RNA-processing nuclease activity and thus the major products obtained are primary transcripts.}, isbn = {0305-1048, 1362-4962}, doi = {10.1093/nar/9.16.3907}, url = {http://nar.oxfordjournals.org/content/9/16/3907}, author = {Dingermann,Theodor and Sharp,Stephen and Appel,Bernd and DeFranco,Donald and Mount, Stephen M. and Heiermann,Reinhard and Pongs,Olaf and S{\"o}ll,Dieter} } @article {18967, title = {Are snRNPs involved in splicing?}, journal = {Nature}, volume = {283}, year = {1980}, month = {1980/01/10/}, pages = {220 - 224}, abstract = {Discrete, stable small RNA molecules are found in the nuclei of cells from a wide variety of eukaryotic organisms. Many of these small nuclear RNA (snRNA) species, which range in size from about 90 to 220 nucleotides, have been well-characterised biochemically, and some sequenced. However, their function has remained obscure. The most abundant snRNA species exist as a closely related set of RNA{\textendash}protein complexes called small nuclear ribonucleoproteins (snRNPs). snRNPs are the antigens recognised by antibodies from some patients with lupus erythematosus (LE), an autoimmune rheumatic disease. Anti-RNP antibodies from lupus sera selectively precipitate snRNP species containing Ula7 and Ulb9 RNAs from mouse Ehrlich ascites cell nuclei, whereas anti-Sm antibodies bind these snRNPs and four others containing U2, U4, US and U6 RNAs. Both antibody systems precipitate the same seven prominent nuclear proteins (molecular weight 12,000{\textendash}32,000). All molecules of the snRNAs U1, U2, U4, U5 and U6 appear to exist in the form of antigenic snRNPs9. The particles sediment at about 10S and each probably contains a single snRNA molecule. Indirect immunofluorescence studies using anti-RNP and anti-Sm sera confirm the nuclear (but non-nucleolar) location of the antigenic snRNPs. Here we present several lines of evidence that suggest a direct involvement of snRNPs in the splicing of hnRNA. Most intriguing is the observation that the nucleotide sequence at the 5' end of U1 RNA exhibits extensive complementarity to those across splice junctions in hnRNA molecules.}, doi = {10.1038/283220a0}, url = {http://www.nature.com/nature/journal/v283/n5743/abs/283220a0.html}, author = {Lerner,Michael R. and Boyle,John A. and Mount, Stephen M. and Wolin,Sandra L. and Steitz,Joan A.} } @article {16980, title = {Automatic database system conversion: A transformation language approach to sub-schema implementation}, journal = {IEEE Computer Software and Applications Conference}, year = {1980}, month = {1980///}, pages = {80 - 88}, author = {Thomas,G. and Shneiderman, Ben} } @article {16966, title = {An experiment using memorization/reconstruction as a measure of programmer ability}, journal = {International Journal of Man-Machine Studies}, volume = {13}, year = {1980}, month = {1980/10//}, pages = {339 - 354}, abstract = {Measuring the abilities of programmers in a classroom or organizational setting is not a trivial task. Current approaches are not always accurate or reliable. This paper describes an experiment which provides evidence that performance on a memorization/recon- struction test can be used as a measure or predictor of programmer ability. The contribution of indentation in program comprehension is also examined.}, isbn = {0020-7373}, doi = {10.1016/S0020-7373(80)80047-2}, url = {http://www.sciencedirect.com/science/article/pii/S0020737380800472}, author = {Di Persio,Tom and Isbister,Dan and Shneiderman, Ben} } @article {17182, title = {Hardware options, evaluation metrics, and a design sequence for interactive information systems}, journal = {Information \& Management}, volume = {3}, year = {1980}, month = {1980///}, pages = {3 - 18}, abstract = {Interactive information systems must satisfy a wide variety of users, serve a broad range of tasks, and be suited to diverse hardware environments. This paper concentrates on three aspects of interactive information systems design: hardware options, evaluation metrics, and a possible design sequence. Rigorous pilot studies are emphasized, and supporting experimental evidence is offered.}, keywords = {casual users, design sequence, evaluation metrics, ferminal design, human factor, Interactive information systems}, isbn = {0378-7206}, doi = {10.1016/0378-7206(80)90026-9}, url = {http://www.sciencedirect.com/science/article/pii/0378720680900269}, author = {Shneiderman, Ben} } @article {17194, title = {HUMAN FACTORS EXPERIMENTS FOR REFINING INTERACTIVE SYSTEM DESIGNS}, journal = {Proceedings-Compcon}, volume = {21}, year = {1980}, month = {1980///}, pages = {123 - 123}, author = {Shneiderman, Ben} } @article {17200, title = {Human Factors of Software Design and Development}, journal = {Software Configuration Management}, year = {1980}, month = {1980///}, pages = {67 - 67}, author = {Weiser,M. and Shneiderman, Ben} } @conference {17304, title = {Natural vs. precise concise languages for human operation of computers: research issues and experimental approaches}, booktitle = {Proceedings of the 18th annual meeting on Association for Computational Linguistics}, series = {ACL {\textquoteright}80}, year = {1980}, month = {1980///}, pages = {139 - 141}, publisher = {Association for Computational Linguistics}, organization = {Association for Computational Linguistics}, address = {Stroudsburg, PA, USA}, abstract = {This paper raises concerns that natural language front ends for computer systems can limit a researcher{\textquoteright}s scope of thinking, yield inappropriately complex systems, and exaggerate public fear of computers. Alternative modes of computer use are suggested and the role of psychologically oriented controlled experimentation is emphasized. Research methods and recent experimental results are briefly reviewed.}, doi = {10.3115/981436.981478}, url = {http://dx.doi.org/10.3115/981436.981478}, author = {Shneiderman, Ben} } @conference {17318, title = {Path expressions for complex queries and automatic database program conversion}, booktitle = {Proceedings of the sixth international conference on Very Large Data Bases - Volume 6}, series = {VLDB {\textquoteright}80}, year = {1980}, month = {1980///}, pages = {33 - 44}, publisher = {VLDB Endowment}, organization = {VLDB Endowment}, abstract = {Our efforts to develop an automatic database system conversion facility yielded a powerful, yet simple query language which was designed for ease of conversion. The path expression of this query language is a convenient and appealing notation for describing complex traversals with multiple boolean qualifications. This paper describes the path expression, shows how automatic conversions can be done, introduces the boolean functions as part of the basic path expression, offers four extensions (path macros, implied path, path replacement, and path optimization), and discusses some implementation issues.}, keywords = {data definition language, data manipulation language, Database conversion, Database systems, path expressions, program conversion, query languages, transformation language}, url = {http://dl.acm.org/citation.cfm?id=1286887.1286891}, author = {Shneiderman, Ben and Thomas,Glenn} } @book {17374, title = {Software psychology: Human factors in computer and information systems (Winthrop computer systems series)}, year = {1980}, month = {1980///}, publisher = {Winthrop Publishers}, organization = {Winthrop Publishers}, isbn = {0876268165}, 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} } @article {15750, title = {Estimating the Largest Eigenvalue of a Positive Definite Matrix}, journal = {Mathematics of Computation}, volume = {33}, year = {1979}, month = {1979///}, pages = {1289 - 1292}, author = {O{\textquoteright}Leary, Dianne P. and Stewart, G.W. and Vandergraft,James S.} } @article {17195, title = {Human Factors Experiments in Designing Interactive Systems}, journal = {Computer}, volume = {12}, year = {1979}, month = {1979/12//}, pages = {9 - 19}, abstract = {Successful industrial design gracefully unites esthetics and function at minimum cost. However, designers face special problems when they apply their skills to interactive computer systems.}, keywords = {Application software, Computer languages, Design engineering, Home computing, human factors, interactive systems, Process design, Testing}, isbn = {0018-9162}, doi = {10.1109/MC.1979.1658571}, author = {Shneiderman, Ben} } @inbook {15767, title = {Linear programming Problems Arising from Partial Differential Equations}, booktitle = {Sparse Matrix Proceedings 1978Sparse Matrix Proceedings 1978}, year = {1979}, month = {1979///}, pages = {25 - 40}, publisher = {SIAM Press}, organization = {SIAM Press}, address = {Philadelphia}, author = {O{\textquoteright}Leary, Dianne P.}, editor = {Duff,Iain S. and Stewart, G.W.} } @book {18413, title = {Principles of software engineering and design}, year = {1979}, month = {1979///}, publisher = {Prentice Hall Professional Technical Reference}, organization = {Prentice Hall Professional Technical Reference}, isbn = {013710202X}, author = {Zelkowitz, Marvin V and Shaw,A. C and Gannon,J. D} } @article {17389, title = {Syntactic/semantic interactions in programmer behavior: A model and experimental results}, journal = {International Journal of Parallel Programming}, volume = {8}, year = {1979}, month = {1979///}, pages = {219 - 238}, abstract = {This paper presents a cognitive framework for describing behaviors involved in program composition, comprehension, debugging, modification, and the acquisition of new programming concepts, skills, and knowledge. An information processing model is presented which includes a long-term store of semantic and syntactic knowledge, and a working memory in which problem solutions are constructed. New experimental evidence is presented to support the model of syntactic/semantic interaction.}, isbn = {0885-7458}, url = {http://dx.doi.org/10.1007/BF00977789}, author = {Shneiderman, Ben and Mayer,Richard} } @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 {17226, title = {Improving the human factors aspect of database interactions}, journal = {ACM Trans. Database Syst.}, volume = {3}, year = {1978}, month = {1978/12//}, pages = {417 - 439}, abstract = {The widespread dissemination of computer and information systems to nontechnically trained individuals requires a new approach to the design and development of database interfaces. This paper provides the motivational background for controlled psychological experimentation in exploring the person/machine interface. Frameworks for the reductionist approach are given, research methods discussed, research issues presented, and a small experiment is offered as an example of what can be accomplished. This experiment is a comparison of natural and artificial language query facilities. Although subjects posed approximately equal numbers of valid queries with either facility, natural language users made significantly more invalid queries which could not be answered from the database that was described.}, keywords = {Data models, Database systems, experimentation, human factors, natural language interfaces, Psychology, query languages}, isbn = {0362-5915}, doi = {10.1145/320289.320295}, url = {http://doi.acm.org/10.1145/320289.320295}, author = {Shneiderman, Ben} } @article {17232, title = {Information policy issues: selecting a policy framework and defining the schema horizon}, journal = {Information \& Management}, volume = {1}, year = {1978}, month = {1978///}, pages = {207 - 218}, abstract = {Technical advances in database management systems are rebalancing organizational structures as management seeks to accommodate these powerful new tools. Managers must participate in establishing a framework for policy decisions and in setting goals for database usage. First, responsibility and authority must be delegated to management and not technical personnel. Second, the bounds of the application, called the schema horizon, should be carefully considered. This paper covers ten information policy issues within these two caregories and attempts to clarify management tasks.}, keywords = {conceptual schema, data independence, data mode theory, data submodels, database administrator, Database management, decision making, extended set theory, external schema, functional model, internal schema, management information systems, organizational behavior, organizational design, schema}, isbn = {0378-7206}, doi = {10.1016/0378-7206(78)90027-7}, url = {http://www.sciencedirect.com/science/article/pii/0378720678900277}, author = {Shneiderman, Ben} } @article {17270, title = {Jump searching: a fast sequential search technique}, journal = {Communications of the ACM}, volume = {21}, year = {1978}, month = {1978/10//}, pages = {831 - 834}, abstract = {When sequential file structures must be used and binary searching is not feasible, jump searching becomes an appealing alternative. This paper explores variants of the classic jump searching scheme where the optimum jump size is the square root of the number of records. Multiple level and variable size jump strategies are explored, appropriate applications are discussed and performance is evaluated.}, keywords = {database structures, file management, index searching, jump searching, search strategies, sequential files}, isbn = {0001-0782}, doi = {10.1145/359619.359623}, url = {http://doi.acm.org/10.1145/359619.359623}, author = {Shneiderman, Ben} } @conference {17321, title = {Personality and programming: Time-sharing vs. batch preference}, booktitle = {Proceedings of the 1978 annual conference - Volume 2}, series = {ACM {\textquoteright}78}, year = {1978}, month = {1978///}, pages = {561 - 569}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Only within the past ten years has some attention been given to psychological concerns of human-machine interface. A review of the literature in this area reveals that personality has received the least attention, but interest is growing. If critical personality factors can be isolated and associated with particular programming tasks, such information could be a useful tool for education as well as management. The hypothesis of this exploratory study was that two personality dimensions, assertiveness and locus of control, influence a programmer{\textquoteright}s choice of batch or interactive processing for program development. Locus of control relates to the perception an individual has of his/her influence over events. Assertiveness allows an individual expression in a manner that fully communicates personal desires without infringing upon the rights of others. These two dimensions and the programmer{\textquoteright}s preference for batch or interactive mode were studied through a questionnaire survey of experienced programmers.}, keywords = {Assertive/passive, batch processing, Locus of control, Personality, Programming, Psychology, Time sharing}, isbn = {0-89791-000-1}, doi = {10.1145/800178.810092}, url = {http://doi.acm.org/10.1145/800178.810092}, author = {Lee,Jeanne M. and Shneiderman, Ben} } @article {17446, title = {Two experimental comparisons of relational and hierarchical database models}, journal = {International Journal of Man-Machine Studies}, volume = {10}, year = {1978}, month = {1978/11//}, pages = {625 - 637}, abstract = {The data model is a central feature which characterizes and distinguishes database management systems. This paper presents two experimental comparative studies of two prominent data models; the relational and hierarchical models. Comprehension, problem solving situation and memorization tasks were performed by undergraduate subjects. Significant effects were found for the data model, presentation order, subject background and tasks.}, isbn = {0020-7373}, doi = {10.1016/S0020-7373(78)80024-8}, url = {http://www.sciencedirect.com/science/article/pii/S0020737378800248}, author = {Brosey,Margaret and 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} } @conference {17140, title = {Evaluating introductory programming textbooks: A guide for students, instructors, authors and publishers}, booktitle = {SIGCSE {\textquoteright}77 Proceedings of the eighth SIGCSE technical symposium on Computer science education}, volume = {9}, year = {1977}, month = {1977/02//}, pages = {56 - 58}, abstract = {My father counseled me not to give advice to others. Inspite of that admonition, I have an irrepressible desire to make some highly subjective, potentially pompous remarks about introductory programming language textbooks. During the past nine years I have evaluated dozens of manuscripts for eight publishers and hundreds of books for teaching term-length introductory courses in FORTRAN, BASIC, PL/I, PASCAL, COBOL and assembly languages. I have co-authored two FORTRAN texts and developed two independent study guides to programming. Each time I see a text, I make judgments by reacting to the material, rather than by comparing the material to a pre-determined set of criteria. In order to provide a {\textquotedblleft}structured{\textquotedblright} review process (no computer-science oriented paper is complete without a reference to {\textquotedblleft}structure{\textquotedblright}), I offer the following criteria for evaluating texts. This list is far from complete, but it is a beginning.}, doi = {10.1145/382175.803434}, url = {http://doi.acm.org/10.1145/382175.803434}, author = {Shneiderman, Ben} } @article {17147, title = {Experimental investigations of the utility of detailed flowcharts in programming}, journal = {Communications of the ACM}, volume = {20}, year = {1977}, month = {1977/06//}, pages = {373 - 381}, abstract = {This paper describes previous research on flowcharts and a series of controlled experiments to test the utility of detailed flowcharts as an aid to program composition, comprehension, debugging, and modification. No statistically significant difference between flowchart and nonflowchart groups has been shown, thereby calling into question the utility of detailed flowcharting. A program of further research is suggested.}, keywords = {Debugging, experimental testing, flowcharts, human factors, modification, program composition, program comprehension}, isbn = {0001-0782}, doi = {10.1145/359605.359610}, url = {http://doi.acm.org/10.1145/359605.359610}, author = {Shneiderman, Ben and Mayer,Richard and McKay,Don and Heller,Peter} } @article {17289, title = {Measuring computer program quality and comprehension}, journal = {International Journal of Man-Machine Studies}, volume = {9}, year = {1977}, month = {1977/07//}, pages = {465 - 478}, abstract = {Judging the relative quality of computer programs and a programmer{\textquoteright}s comprehension of a given program has proven to be a difficult task. Ability to debug, modify, hand simulate execution or respond to questions about the program all have their weaknesses as comprehension metrics. This paper offers experimental evidence which supports the use of memorization/recall tasks as a further basis for judging program quality and programmer comprehension. A syntactic/semantic model of programmer behavior is presented to provide a basis for this hypothesis.}, keywords = {cognitive psychology, commenting, memorization, modification, program design, programmer behavior, Programming, programming experiments, programming languages, RECALL, structured programming}, isbn = {0020-7373}, doi = {10.1016/S0020-7373(77)80014-X}, url = {http://www.sciencedirect.com/science/article/pii/S002073737780014X}, author = {Shneiderman, Ben} } @article {17341, title = {Reduced combined indexes for efficient multiple attribute retrieval}, journal = {Information Systems}, volume = {2}, year = {1977}, month = {1977///}, pages = {149 - 154}, abstract = {Combined indexes were proposed by Lum[4] as an alternative to the traditional approach of single attribute indexes. The combined index approach is appealing for queries requiring conjunctions of attribute values since it eliminates the time consuming intersections. The penalty of wasted auxiliary storage space in the combined index approach can be minimized by adopting the Reduced Combined Index technique proposed in this paper.}, isbn = {0306-4379}, doi = {10.1016/0306-4379(77)90003-5}, url = {http://www.sciencedirect.com/science/article/pii/0306437977900035}, author = {Shneiderman, Ben} } @article {17393, title = {Teaching programming: A spiral approach to syntax and semantics}, journal = {Computers \& Education}, volume = {1}, year = {1977}, month = {1977///}, pages = {193 - 197}, abstract = {Coupling the recently proposed syntactic/semantic model of programmer behavior [1] with classic educational psychological theories yields new insights to teaching programming to novices. These new insights should make programming education more natural to students. alleviate {\textquotedblleft}computer shock{\textquotedblright} (the analog of {\textquotedblleft}math anxiety{\textquotedblright} [2]) and promote the development of widespread {\textquotedblleft}computer literacy{\textquotedblright}.The spiral approach is the parallel acquisition of syntactic and semantic knowledge in a sequence which provokes student interest by using meaningful examples, builds on previous knowledge, is in harmony with the student{\textquoteright}s cognitive skills, provides reinforcement of recently acquired material and develops confidence through successful accomplishment of increasingly difficult tasks. The relationship of structured programming and flowcharts to the spiral approach is discussed. }, isbn = {0360-1315}, doi = {10.1016/0360-1315(77)90008-2}, url = {http://www.sciencedirect.com/science/article/pii/0360131577900082}, author = {Shneiderman, Ben} } @conference {17463, title = {Use of peer ratings in evaluating computer program quality}, booktitle = {Proceedings of the fifteenth annual SIGCPR conference}, series = {SIGCPR {\textquoteright}77}, year = {1977}, month = {1977///}, pages = {218 - 226}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Peer review techniques can be useful tools for supplementing programmer education, improving cooperation and communication within programming teams, and providing programmer self-evaluation. This paper will explore the benefits of peer review for practicing professional programmers and describe a framework for administration of an annual or semi-annual peer review process.}, doi = {10.1145/800100.803247}, url = {http://doi.acm.org/10.1145/800100.803247}, author = {Anderson,Nancy and Shneiderman, Ben} } @article {16984, title = {Batched searching of sequential and tree structured files}, journal = {ACM Trans. Database Syst.}, volume = {1}, year = {1976}, month = {1976/09//}, pages = {268 - 275}, abstract = {The technique of batching searches has been ignored in the context of disk based online data retrieval systems. This paper suggests that batching be reconsidered for such systems since the potential reduction in processor demand may actually reduce response time. An analysis with sample numerical results and algorithms is presented.}, keywords = {B-trees, batched searching, Data structures, Database systems, file management, Indexes, informational retrieval, sequential files, tree structures}, isbn = {0362-5915}, doi = {10.1145/320473.320487}, url = {http://doi.acm.org/10.1145/320473.320487}, author = {Shneiderman, Ben} } @book {11940, title = {The EXEC-8 Log System: Error Analysis}, year = {1976}, month = {1976///}, publisher = {University of Maryland, Dept. of Computer Science}, organization = {University of Maryland, Dept. of Computer Science}, author = {Mohr,J. M and Agrawala, Ashok K. and Flanagan,J. F. and Science,University of Maryland. Dept. of Computer} } @article {17150, title = {Exploratory experiments in programmer behavior}, journal = {International Journal of Parallel Programming}, volume = {5}, year = {1976}, month = {1976///}, pages = {123 - 143}, abstract = {The techniques of cognitive psychological experimentation can help resolve specific issues in programming and explore the broader issues of programmer behavior. This paper describes the methodological questions of such experimentation and presents two exploratory experiments: a memorization task and a comparison of the arithmetic and logical IF statements infortran.}, isbn = {0885-7458}, url = {http://dx.doi.org/10.1007/BF00975629}, author = {Shneiderman, Ben} } @article {16973, title = {An internship in information systems: Combining computer science education with realistic problems}, journal = {SIGCSE Bull.}, volume = {8}, year = {1976}, month = {1976/07//}, pages = {80 - 83}, abstract = {Computer science graduates who become professional programmers will have a direct and substantial influence on the impact of applications, but little in traditional computer science training curriculum prepares them for this serious responsibility. Recognizing this situation, we designed a two term sequence for advanced undergraduates and masters students which would not only provide them with the required academic knowledge. The educational atmosphere that we tried to create resembles the internship phase followed in teacher training, medical schools, law schools, clinical psychology and other disciplines.}, isbn = {0097-8418}, doi = {10.1145/952991.804761}, url = {http://doi.acm.org/10.1145/952991.804761}, author = {Buck,John and Shneiderman, Ben} } @article {17433, title = {Toward a theory of encoded data structures and data translation}, journal = {International Journal of Parallel Programming}, volume = {5}, year = {1976}, month = {1976///}, pages = {33 - 43}, abstract = {Several models of data base systems have distinguished levels of abstraction ranging from the high-level entity set model down to the low-level physical device level. This paper presents a model for describing data encodings, an intermediate level which focuses on the relationship among data items as demonstrated by contiguity or by pointer connections. Multiple data encodings for a file are shown and transformation functions that describe the translation between data encodings are discussed.}, isbn = {0885-7458}, url = {http://dx.doi.org/10.1007/BF00991070}, author = {Shneiderman, Ben and Shapiro,Stuart C.} } @article {17436, title = {Travels in computerland or incompatibilities and interfaces::, Addison-Wesley, Reading, Mass., 1974}, journal = {Information Processing \& Management}, volume = {12}, year = {1976}, month = {1976///}, pages = {230 - 230}, author = {Shneiderman, Ben} } @article {17016, title = {Cognitive psychology and programming language design}, journal = {ACM SIGPLAN Notices}, volume = {10}, year = {1975}, month = {1975/07//}, pages = {46 - 47}, isbn = {0362-1340}, doi = {10.1145/987305.987314}, url = {http://doi.acm.org/10.1145/987305.987314}, author = {Shneiderman, Ben} } @conference {17148, title = {Experimental testing in programming languages, stylistic considerations and design techniques}, booktitle = {Proceedings of the May 19-22, 1975, national computer conference and exposition}, series = {AFIPS {\textquoteright}75}, year = {1975}, month = {1975///}, pages = {653 - 656}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {In the early stages of the development of high-level languages, radically differing alternatives were often promulgated. Each language had a dedicated corps of adherents who advocated the primacy of their facility. Turbulent debates among the protagonists were a common affair at conferences and in the trade journals. Now as the field matures, the vehement discussions have subsided and there is a widespread recognition of the usefulness of a variety of languages. Even the proponents of a single universal language have softened their tone and have accepted the multiple language condition.}, doi = {10.1145/1499949.1500087}, url = {http://doi.acm.org/10.1145/1499949.1500087}, author = {Shneiderman, Ben} } @book {17447, title = {Two Exploratory Experiments in Program Comprehension}, year = {1975}, month = {1975///}, publisher = {Indiana University, Computer Science Department}, organization = {Indiana University, Computer Science Department}, author = {Shneiderman, Ben and Ho,M.H.} } @article {17405, title = {The chemistry of control structures}, journal = {ACM SIGPLAN Notices}, volume = {9}, year = {1974}, month = {1974/12//}, pages = {29 - 34}, isbn = {0362-1340}, doi = {10.1145/953246.953249}, url = {http://doi.acm.org/10.1145/953246.953249}, author = {Shneiderman, Ben} } @article {16934, title = {A model for optimizing indexed file structures}, journal = {International Journal of Parallel Programming}, volume = {3}, year = {1974}, month = {1974///}, pages = {91 - 101}, abstract = {Multilevel indexes have long been used for accessing records in sorted files. Given the access cost at each level, the total cost of retrieving a record from the file can be substantially reduced by selecting the proper size of the index at each level. Organizations involving a variable number of levels are covered and binary searching is compared to sequential searching.}, isbn = {0885-7458}, url = {http://dx.doi.org/10.1007/BF01355589}, author = {Shneiderman, Ben} } @article {17310, title = {Opportunities for data base reorganization}, journal = {ACM SIGMOD Record}, volume = {6}, year = {1974}, month = {1974/12//}, pages = {1 - 8}, isbn = {0163-5808}, doi = {10.1145/983082.983083}, url = {http://doi.acm.org/10.1145/983082.983083}, author = {Shneiderman, Ben} } @article {17383, title = {Structured data structures}, journal = {Communications of the ACM}, volume = {17}, year = {1974}, month = {1974/10//}, pages = {566 - 574}, abstract = {Programming systems which permit arbitrary linked list structures enable the user to create complicated structures without sufficient protection. Deletions can result in unreachable data elements, and there is no guarantee that additions will be performed properly. To remedy this situation, this paper proposes a Data Structure Description and Manipulation Language which provides for the creation of a restricted class of data structures but ensures the correctness of the program. This is accomplished by an explicit structure declaration facility, a restriction on the permissible operations, and execution-time checks.}, keywords = {data base management system, Data structures, structured programming}, isbn = {0001-0782}, doi = {10.1145/355620.361170}, url = {http://doi.acm.org/10.1145/355620.361170}, author = {Shneiderman, Ben and Scheuermann,Peter} } @article {17171, title = {Flowchart techniques for structured programming}, journal = {ACM SIGPLAN Notices}, volume = {8}, year = {1973}, month = {1973/08//}, pages = {12 - 26}, abstract = {With the advent of structured programming and GOTO-less programming a method is needed to model computation in simply ordered structures, each representing a complete thought possibly defined in terms of other thoughts as yet undefined. A model is needed which prevents unrestricted transfers of control and has a control structure closer to languages amenable to structured programming. We present an attempt at such a model.}, isbn = {0362-1340}, doi = {10.1145/953349.953350}, url = {http://doi.acm.org/10.1145/953349.953350}, author = {Nassi,I. and Shneiderman, Ben} } @article {17311, title = {Optimum data base reorganization points}, journal = {Communications of the ACM}, volume = {16}, year = {1973}, month = {1973/06//}, pages = {362 - 365}, abstract = {In certain data base organization schemes the cost per access may increase due to structural inefficiencies caused by update. By reorganizing the data base the cost per access may be reduced. However, the high cost of a reorganization prohibits frequent reorganizations. This paper examines strategies for selecting the optimum reorganization points.}, keywords = {data base, files, Information retrieval, reorganization}, isbn = {0001-0782}, doi = {10.1145/362248.362267}, url = {http://doi.acm.org/10.1145/362248.362267}, author = {Shneiderman, Ben} } @book {17411, title = {The Elements of FORTRAN Style: Techniques for Effective Programming}, year = {1972}, month = {1972///}, publisher = {Harcourt Brace College Publishers}, organization = {Harcourt Brace College Publishers}, isbn = {0155221566}, author = {Kreitzberg,Charles B and Shneiderman, Ben} } @article {16927, title = {A graph theoretic model of data structures}, journal = {SIGIR Forum}, volume = {7}, year = {1972}, month = {1972/12//}, pages = {36 - 44}, abstract = {The widespread development of large shared data bases has proceeded mainly on empirical notions. Only in the past few years have there been attempts at formalizing the underlying concepts into a theory of data structures. The present models have been founded on the well-established mathematical theories of sets, relations and graphs, but few descriptions have been sufficiently developed to meet the needs of a complete theory of data structures. The set theoretic formalism offered by Childs(1) or Schwartz(2) or the relational model by Codd(3) are useful but fail to give a complete description of the complex structures found in modern data bases. The graph theoretic concepts found in papers by Harary and Hsiao(4) and Earley(5) are more appealing but need further elaboration. This paper is an attempt to develop a graph theoretic model into a useful formalism for describing and manipulating data structures.}, isbn = {0163-5840}, doi = {10.1145/1095495.1095499}, url = {http://doi.acm.org/10.1145/1095495.1095499}, author = {Heller,J. and Shneiderman, Ben} } @article {17028, title = {Computer science education and social relevance}, journal = {ACM SIGCSE Bulletin}, volume = {3}, year = {1971}, month = {1971/03//}, pages = {21 - 24}, abstract = {The rise of computer science as a theoretical discipline should not be allowed to proceed without promoting the study of the social implications and applications of the field. This paper describes an undergraduate course whose primary goal is to foster an understanding of how computers can be used for socially relevant purposes. The students were required to propose and execute a project which could benefit people directly. The projects are described and suggestions for further work are given.The rapid rise of Computer Science as a major field of university study is unprecedented. In 25 years digital computers have risen from a laboratory experiment to a full-fledged academic discipline. Most major universities have created Departments of Computer Science and offer advanced degrees.}, isbn = {0097-8418}, doi = {10.1145/873674.873677}, url = {http://doi.acm.org/10.1145/873674.873677}, author = {Shneiderman, Ben} }