@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 {20449, title = {Quantum Capacitance-Limited MoS2 Biosensors Enable Remote Label-Free Enzyme Measurements}, journal = {Nanoscale}, year = {2019}, month = {Jan-01-2019}, issn = {2040-3364}, doi = {10.1039/C9NR03171E}, url = {http://pubs.rsc.org/en/Content/ArticleLanding/2019/NR/C9NR03171Ehttp://pubs.rsc.org/en/content/articlepdf/2019/NR/C9NR03171E}, author = {Le, Son T and Guros, Nicholas B and Bruce, Robert C and Cardone, Antonio and Amin, Niranjana D and Zhang, Siyuan and Klauda, Jeffery and Pant, Harish C and Richter, Curt A and Balijepalli, Arvind} } @article {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} } @conference {20251, title = {Interpolation-Based Gray-Level Co-Occurrence Matrix Computation for Texture Directionality Estimation}, booktitle = {IEEE 22nd Signal Processing Algorithms, Architectures, Arrangements, and Applications Conference}, year = {2018}, month = {12/06/2018}, publisher = {IEEE}, organization = {IEEE}, address = {Poznan, Poland}, abstract = {A novel interpolation-based model for the computation of the Gray Level Co-occurrence Matrix (GLCM) is presented. The model enables GLCM computation for any real valued angles and offsets, as opposed to the traditional, lattice-based model. A texture directionality estimation algorithm is defined using the GLCM-derived correlation feature. The robustness of the algorithm with respect to image blur and additive Gaussian noise is evaluated. It is concluded that directionality estimation is robust to image blur and low noise levels. For high noise levels, the mean error increases but remains bounded. The performance of the directionality estimation algorithm is illustrated on fluorescence microscopy images of fibroblast cells. The algorithm was implemented in C++ and the source code is available in an openly accessible repository.}, isbn = { 978-8-3620-6533-2}, doi = {10.23919/SPA.2018.8563413 }, url = {https://ieeexplore.ieee.org/document/8563413}, author = {Marcin Kociolek and Mary Brady and Peter Bajcsy and Cardone, Antonio} } @article {20299, title = {Occurrence of Vibrio cholerae in water reservoirs of Burkina Faso}, journal = {Research in Microbiology}, volume = {169}, year = {2018}, month = {Jan-01-2018}, pages = {1 - 10}, abstract = {Africa is currently an important region in which cholera epidemics occur. Little is known about the presence of Vibrio cholerae in freshwater bodies in Africa. There are ca. 1700 lakes and reservoirs in Burkina Faso, most of which have been built within recent decades to secure water resources. The purpose of this study was to investigate the presence of V. cholerae in the water of reservoirs, using the most-probable-number polymerase chain reaction. Results showed that V. cholerae could be detected in water samples collected from 14 of 39 sampled reservoirs. The concentrations varied from 0 MPN/l to more than 1100 MPN/l. Fifty strains of V. cholerae isolated on CHROMagar{\texttrademark} vibrio were identified as V. cholerae non-O1/non-O139, none of which carried the ctxA gene. A significant positive correlation was found between the presence of V. cholerae in the reservoirs and both alkaline pH and phytoplankton biomass. V. cholerae was present in significantly higher numbers in reservoirs of urban areas than in rural areas. Since V. cholerae non-O1/non-O139 has been shown to be a causative agent of endemic diarrheal outbreaks, their presence in Burkina Faso reservoirs suggests they may play a role in gastroenteritis in that country.}, issn = {09232508}, doi = {10.1016/j.resmic.2017.08.004}, url = {https://www.sciencedirect.com/science/article/pii/S092325081730147X?via\%3Dihub}, author = {Kabor{\'e}, Saidou and Cecchi, Philippe and Mosser, Thomas and Toubiana, Myl{\`e}ne and Traor{\'e}, Oumar and Ouattara, Aboubakar S. and Traor{\'e}, Alfred S. and Barro, Nicolas and Rita R Colwell and Monfort, Patrick} } @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 {20315, title = {Assessment of Risk of Cholera in Haiti following Hurricane Matthew}, journal = {The American Journal of Tropical Medicine and Hygiene}, volume = {97}, year = {2017}, month = {Jul-09-2017}, pages = {896 - 903}, abstract = {Damage to the inferior and fragile water and sanitation infrastructure of Haiti after Hurricane Matthew has created an urgent public health emergency in terms of likelihood of cholera occurring in the human population. Using satellite-derived data on precipitation, gridded air temperature, and hurricane path and with information on water and sanitation (WASH) infrastructure, we tracked changing environmental conditions conducive for growth of pathogenic vibrios. Based on these data, we predicted and validated the likelihood of cholera cases occurring past hurricane. The risk of cholera in the southwestern part of Haiti remained relatively high since November 2016 to the present. Findings of this study provide a contemporary process for monitoring ground conditions that can guide public health intervention to control cholera in human population by providing access to vaccines, safe WASH facilities. Assuming current social and behavioral patterns remain constant, it is recommended that WASH infrastructure should be improved and considered a priority especially before 2017 rainy season.}, issn = {0002-9637}, doi = {10.4269/ajtmh.17-0048}, url = {http://www.ajtmh.org/content/journals/10.4269/ajtmh.17-0048}, author = {Huq, Anwar and Anwar, Rifat and Rita R Colwell and McDonald, Michael D. and Khan, Rakib and Jutla, Antarpreet and Akanda, Shafqat} } @article {20310, title = {Comparative genomic analysis and characterization of incompatibility group FIB plasmid encoded virulence factors of Salmonella enterica isolated from food sources}, journal = {BMC Genomics}, year = {2017}, month = {Jan-12-2017}, abstract = {BACKGROUND: The degree to which the chromosomal mediated iron acquisition system contributes to virulence of many bacterial pathogens is well defined. However, the functional roles of plasmid encoded iron acquisition systems, specifically Sit and aerobactin, have yet to be determined for Salmonella spp. In a recent study, Salmonella enterica strains isolated from different food sources were sequenced on the Illumina MiSeq platform and found to harbor the incompatibility group (Inc) FIB plasmid. In this study, we examined sequence diversity and the contribution of factors encoded on the IncFIB plasmid to the virulence of S. enterica. RESULTS: Whole genome sequences of seven S. enterica isolates were compared to genomes of serovars of S. enterica isolated from food, animal, and human sources. SeqSero analysis predicted that six strains were serovar Typhimurium and one was Heidelberg. Among the S. Typhimurium strains, single nucleotide polymorphism (SNP)-based phylogenetic analyses revealed that five of the isolates clustered as a single monophyletic S. Typhimurium subclade, while one of the other strains branched with S. Typhimurium from a bovine source. DNA sequence based phylogenetic diversity analyses showed that the IncFIB plasmid-encoded Sit and aerobactin iron acquisition systems are conserved among bacterial species including S. enterica. The IncFIB plasmid was transferred to an IncFIB plasmid deficient strain of S. enterica by conjugation. The transconjugant SE819::IncFIB persisted in human intestinal epithelial (Caco-2) cells at a higher rate than the recipient SE819. Genes of the Sit and aerobactin operons in the IncFIB plasmid were differentially expressed in iron-rich and iron-depleted growth media. CONCLUSIONS: Minimal sequence diversity was detected in the Sit and aerobactin operons in the IncFIB plasmids present among different bacterial species, including foodborne Salmonella strains. IncFIB plasmid encoded factors play a role during infection under low-iron conditions in host cells.}, doi = {10.1186/s12864-017-3954-5}, url = {https://bmcgenomics.biomedcentral.com/articles/10.1186/s12864-017-3954-5}, author = {Khajanchi, Bijay K. and Hasan, Nur A. and Choi, Seon Young and Han, Jing and Zhao, Shaohua and Rita R Colwell and Cerniglia, Carl E. and Foley, Steven L.} } @article {20318, title = {CRISPR-Cas and Contact-Dependent Secretion Systems Present on Excisable Pathogenicity Islands with Conserved Recombination Modules}, journal = {Journal of Bacteriology}, year = {2017}, month = {Mar-05-2018}, abstract = {Pathogenicity islands (PAIs) are mobile integrated genetic elements that contain a diverse range of virulence factors. PAIs integrate into the host chromosome at a tRNA locus that contains their specific bacterial attachment site, attB, via integrase-mediated site-specific recombination generating attL and attR sites. We identified conserved recombination modules (integrases and att sites) previously described in choleragenic Vibrio cholerae PAIs but with novel cargo genes. Clustered regularly interspaced short palindromic repeat (CRISPR)-associated proteins (Cas proteins) and a type VI secretion system (T6SS) gene cluster were identified at the Vibrio pathogenicity island 1 (VPI-1) insertion site in 19 V. cholerae strains and contained the same recombination module. Two divergent type I-F CRISPR-Cas systems were identified, which differed in Cas protein homology and content. The CRISPR repeat sequence was identical among all V. cholerae strains, but the CRISPR spacer sequences and the number of spacers varied. In silico analysis suggests that the CRISPR-Cas systems were active against phages and plasmids. A type III secretion system (T3SS) was present in 12 V. cholerae strains on a 68-kb island inserted at the same tRNA-serine insertion site as VPI-2 and contained the same recombination module. Bioinformatics analysis showed that two divergent T3SSs exist among the strains examined. Both the CRISPR and T3SS islands excised site specifically from the bacterial chromosome as complete units, and the cognate integrases were essential for this excision. These data demonstrated that identical recombination modules that catalyze integration and excision from the chromosome can acquire diverse cargo genes, signifying a novel method of acquisition for both CRISPR-Cas systems and T3SSs.}, issn = {0021-9193}, doi = {10.1128/JB.00842-16}, url = {http://jb.asm.org/lookup/doi/10.1128/JB.00842-16}, author = {Carpenter, Megan R. and Kalburge, Sai S. and Borowski, Joseph D. and Peters, Molly C. and Rita R Colwell and Boyd, E. Fidelma}, editor = {DiRita, Victor J.} } @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 {20322, title = {Hydroclimatic sustainability assessment of changing climate on cholera in the Ganges-Brahmaputra basin}, journal = {Advances in Water Resources}, volume = {108}, year = {2017}, month = {Jan-10-2017}, pages = {332 - 344}, abstract = {The association of cholera and climate has been extensively documented. However, determining the effects of changing climate on the occurrence of disease remains a challenge. Bimodal peaks of cholera in Bengal Delta are hypothesized to be linked to asymmetric flow of the Ganges and Brahmaputra rivers. Spring cholera is related to intrusion of bacteria-laden coastal seawater during low flow seasons, while autumn cholera results from cross-contamination of water resources when high flows in the rivers cause massive inundation. Coarse resolution of General Circulation Model (GCM) output (usually at 100 {\textendash} 300 km)cannot be used to evaluate variability at the local scale(10{\textendash}20 km),hence the goal of this study was to develop a framework that could be used to understand impacts of climate change on occurrence of cholera. Instead of a traditional approach of downscaling precipitation, streamflow of the two rivers was directly linked to GCM outputs, achieving reasonable accuracy (R2 = 0.89 for the Ganges and R2 = 0.91 for the Brahmaputra)using machine learning algorithms (Support Vector Regression-Particle Swarm Optimization). Copula methods were used to determine probabilistic risks of cholera under several discharge conditions. Key results, using model outputs from ECHAM5, GFDL, andHadCM3for A1B and A2 scenarios, suggest that the combined low flow of the two rivers may increase in the future, with high flows increasing for first half of this century, decreasing thereafter. Spring and autumn cholera, assuming societal conditions remain constant e.g., at the current rate, may decrease. However significant shifts were noted in the magnitude of river discharge suggesting that cholera dynamics of the delta may well demonstrate an uncertain predictable pattern of occurrence over the next century.}, issn = {03091708}, doi = {10.1016/j.advwatres.2016.11.018}, url = {https://linkinghub.elsevier.com/retrieve/pii/S030917081630728X}, author = {Nasr-Azadani, Fariborz and Khan, Rakibul and Rahimikollu, Javad and Unnikrishnan, Avinash and Akanda, Ali and Alam, Munirul and Huq, Anwar and Jutla, Antarpreet and Rita R Colwell} } @article {20323, title = {Natural Disasters and Cholera Outbreaks: Current Understanding and Future Outlook}, journal = {Current Environmental Health Reports}, year = {2017}, month = {Jan-03-2017}, pages = {99 - 107}, abstract = {Purpose of Review Diarrheal diseases remain a serious global public health threat, especially for those populations lacking access to safe water and sanitation infrastructure. Although association of several diarrheal diseases, e.g., cholera, shigellosis, etc., with climatic processes has been documented, the global human population remains at heightened risk of outbreak of diseases after natural disasters, such as earthquakes, floods, or droughts. In this review, cholera was selected as a signature diarrheal disease and the role of natural disasters in triggering and transmitting cholera was analyzed. Recent Findings Key observations include identification of an inherent feedback loop that includes societal structure, prevailing climatic processes, and spatio-temporal seasonal variability of natural disasters. Data obtained from satellite-based remote sensing are concluded to have application, although limited, in predicting risks of a cholera outbreak(s). Summary We argue that with the advent of new high spectral and spatial resolution data, earth observation systems should be seamlessly integrated in a decision support mechanism to be mobilize resources when a region suffers a natural disaster. A framework is proposed that can be used to assess the impact of natural disasters with response to outbreak of cholera, providing assessment of short- and long-term influence of climatic processes on disease outbreaks.}, doi = {10.1007/s40572-017-0132-5}, url = {http://link.springer.com/10.1007/s40572-017-0132-5}, author = {Jutla, Antarpreet and Khan, Rakibul and Rita R Colwell} } @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.} } @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 {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 {20337, title = {Environmental Surveillance for Toxigenic Vibrio cholerae in Surface Waters of Haiti}, journal = {The American Journal of Tropical Medicine and Hygiene}, volume = {92}, year = {2015}, month = {Jul-01-2015}, pages = {118 - 125}, abstract = {Epidemic cholera was reported in Haiti in 2010, with no information available on the occurrence or geographic distribution of toxigenic Vibrio cholerae in Haitian waters. In a series of field visits conducted in Haiti between 2011 and 2013, water and plankton samples were collected at 19 sites. Vibrio cholerae was detected using culture, polymerase chain reaction, and direct viable count methods (DFA-DVC). Cholera toxin genes were detected by polymerase chain reaction in broth enrichments of samples collected in all visits except March 2012. Toxigenic V. cholerae was isolated from river water in 2011 and 2013. Whole genome sequencing revealed that these isolates were a match to the outbreak strain. The DFA-DVC tests were positive for V. cholerae O1 in plankton samples collected from multiple sites. Results of this survey show that toxigenic V. cholerae could be recovered from surface waters in Haiti more than 2 years after the onset of the epidemic.}, issn = {0002-9637}, doi = {10.4269/ajtmh.13-0601}, url = {http://www.ajtmh.org/content/journals/10.4269/ajtmh.13-0601}, author = {Hill, Vincent R. and Humphrys, Michael S. and Kahler, Amy M. and Boncy, Jacques and Tarr, Cheryl L. and Huq, Anwar and Chen, Arlene and Katz, Lee S. and Mull, Bonnie J. and Derado, Gordana and Haley, Bradd J. and Freeman, Nicole and Rita R Colwell and Turnsek, Maryann} } @conference {20066, title = {Estimating Actin Fiber Orientation using Interpolation-Based Grey-Level Co-Occurrence Matrix Computation}, booktitle = {BioImage Informatics Conference }, year = {2015}, month = {10/2015}, author = {Cardone, Antonio and Brady, Mary and Kociolek, Marcin and Bajcsy, Peter} } @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 {20319, title = {Occurrence and Diversity of Clinically Important Vibrio Species in the Aquatic Environment of Georgia}, journal = {Frontiers in Public Health}, year = {2015}, month = {10/2015}, doi = {10.3389/fpubh.2015.00232}, url = {http://journal.frontiersin.org/Article/10.3389/fpubh.2015.00232/}, author = {Kokashvili, Tamar and Whitehouse, Chris A. and Tskhvediani, Ana and Grim, Christopher J. and Elbakidze, Tinatin and Mitaishvili, Nino and Janelidze, Nino and Jaiani, Ekaterine and Haley, Bradd J. and Lashkhi, Nino and Huq, Anwar and Rita R Colwell and Tediashvili, Marina} } @conference {20067, title = {Segmentation and sub-cellular feature-based analysis of microscopy images}, booktitle = {BioImage Informatics Conference }, year = {2015}, month = {10/2015}, author = {Cardone, Antonio and Chalfoun, Joe and Peskin, Adele and Bajcsy, Peter and Kociolek, Marcin and Bhadriraju, Kiran and Brady, Mary} } @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 {20340, title = {A unified initiative to harness Earth{\textquoteright}s microbiomes}, journal = {Science}, year = {2015}, month = {Jun-10-2017}, pages = {507 - 508}, issn = {0036-8075}, doi = {10.1126/science.aac8480}, url = {http://www.sciencemag.org/cgi/doi/10.1126/science.aac8480}, author = {Alivisatos, A. P. and Blaser, M. J. and Brodie, E. L. and Chun, M. and Dangl, J. L. and Donohue, T. J. and Dorrestein, P. C. and Gilbert, J. A. and Green, J. L. and Jansson, J. K. and Knight, R. and Maxon, M. E. and McFall-Ngai, M. J. and Miller, J. F. and Pollard, K. S. and Ruby, E. G. and Taha, S. A. and Rita R Colwell} } @article {20359, title = {Vibrio metoecus sp. nov., a close relative of Vibrio cholerae isolated from coastal brackish ponds and clinical specimens}, journal = {INTERNATIONAL JOURNAL OF SYSTEMATIC AND EVOLUTIONARY MICROBIOLOGY}, year = {2014}, month = {Jan-09-2014}, pages = {3208 - 3214}, issn = {1466-5026}, doi = {10.1099/ijs.0.060145-0}, url = {http://ijs.microbiologyresearch.org/content/journal/ijsem/10.1099/ijs.0.060145-0}, author = {Kirchberger, P. C. and Turnsek, M. and Hunt, D. E. and Haley, B. J. and Rita R Colwell and Polz, M. F. and Tarr, C. L. and Boucher, Y.} } @inbook {19639, title = {On Minimal Assumptions for Sender-Deniable Public Key Encryption}, booktitle = {Public-Key Cryptography {\textendash} PKC 2014}, series = {Lecture Notes in Computer Science}, year = {2014}, month = {2014/01/01/}, pages = {574 - 591}, publisher = {Springer Berlin Heidelberg}, organization = {Springer Berlin Heidelberg}, abstract = {The primitive of deniable encryption was introduced by Canetti et al. (CRYPTO, 1997). Deniable encryption is an encryption scheme with the added feature that after transmitting a message m, both sender and receiver may produce random coins showing that the transmitted ciphertext was an encryption of any message m' in the message space. Deniable encryption is a key tool for constructing incoercible protocols, since it allows a party to send one message and later provide apparent evidence to a coercer that a different message was sent. In addition, deniable encryption may be used to obtain adaptively-secure multiparty computation (MPC) protocols and is secure under selective-opening attacks. Different flavors such as sender-deniable and receiver-deniable encryption, where only the sender or receiver produce fake random coins, have been considered. Recently, over 15 years after the primitive was first introduced, Sahai and Waters (IACR Cryptology ePrint Archive, 2013), gave the first construction of sender-deniable encryption schemes with super-polynomial security, where an adversary has negligible advantage in distinguishing real and fake openings. Their construction is based on the construction of an indistinguishability obfuscator for general programs recently introduced in a breakthrough result of Garg et al. (FOCS, 2013). Although feasibility has now been demonstrated, the question of determining the minimal assumptions necessary for sender-deniable encryption with super-polynomial security remains open. The primitive of simulatable public key encryption (PKE), introduced by Damg{\r a}rd and Nielsen (CRYPTO, 2000), is a public key encryption scheme with additional properties that allow oblivious sampling of public keys and ciphertexts. It is one of the low-level primitives used to construct adaptively-secure MPC protocols and was used by O{\textquoteright}Neill et al. in their construction of bi-deniable encryption in the multi-distributional model (CRYPTO, 2011). Moreover, the original construction of sender-deniable encryption with polynomial security given by Canetti et al. can be instantiated with simulatable PKE. Thus, a natural question to ask is whether it is possible to construct sender-deniable encryption with super-polynomial security from simulatable PKE. In this work, we investigate the possibility of constructing sender-deniable public key encryption from simulatable PKE in a black-box manner. We show that there is no black-box construction of sender-deniable public key encryption with super-polynomial security from simulatable PKE. This indicates that improving on the original construction of Canetti et al. requires the use of non-black-box techniques, stronger assumptions, or interaction, thus giving some evidence that strong assumptions such as those used by Sahai and Waters are necessary.}, keywords = {Algorithm Analysis and Problem Complexity, black-box separation, Coding and Information Theory, Data Encryption, sender-deniable encryption, simulatable PKE, Systems and Data Security}, isbn = {978-3-642-54630-3, 978-3-642-54631-0}, url = {http://link.springer.com/chapter/10.1007/978-3-642-54631-0_33}, author = {Dana Dachman-Soled}, editor = {Krawczyk, Hugo} } @article {20362, title = {Molecular diversity and predictability of Vibrio parahaemolyticus along the Georgian coastal zone of the Black Sea}, journal = {Frontiers in Microbiology}, volume = {5}, year = {2014}, month = {Jan-01-2014}, abstract = {Vibrio parahaemolyticus is a leading cause of seafood-related gastroenteritis and is also an autochthonous member of marine and estuarine environments worldwide. One-hundred seventy strains of V. parahaemolyticus were isolated from water and plankton samples collected along the Georgian coast of the Black Sea during 28 months of sample collection. All isolated strains were tested for presence of tlh, trh, and tdh. A subset of strains were serotyped and tested for additional factors and markers of pandemicity. Twenty-six serotypes, five of which are clinically relevant, were identified. Although all 170 isolates were negative for tdh, trh, and the Kanagawa Phenomenon, 7 possessed the GS-PCR sequence and 27 the 850 bp sequence of V. parahaemolyticus pandemic strains. The V. parahaemolyticus population in the Black Sea was estimated to be genomically heterogeneous by rep-PCR and the serodiversity observed did not correlate with rep-PCR genomic diversity. Statistical modeling was used to predict presence of V. parahaemolyticus as a function of water temperature, with strongest concordance observed for Green Cape site samples (Percent of total variance = 70, P < 0.001). Results demonstrate a diverse population of V. parahaemolyticus in the Black Sea, some of which carry pandemic markers, with increased water temperature correlated to an increase in abundance of V. parahaemolyticus.}, doi = {10.3389/fmicb.2014.00045}, url = {http://journal.frontiersin.org/article/10.3389/fmicb.2014.00045}, author = {Haley, Bradd J. and Kokashvili, Tamar and Tskshvediani, Ana and Janelidze, Nino and Mitaishvili, Nino and Grim, Christopher J. and Constantin_de_Magny, Guillaume and Chen, Arlene J. and Taviani, Elisa and Eliashvili, Tamar and Tediashvili, Marina and Whitehouse, Chris A. and Rita R Colwell and Huq, Anwar} } @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 {19669, title = {Stable isotope labeling of phosphoproteins for large-scale phosphorylation rate determination}, journal = {Molecular \& Cellular Proteomics}, year = {2014}, month = {2014/02/16/}, abstract = {Signals that control response to stimuli and cellular function are transmitted through dynamic phosphorylation of thousands of proteins by protein kinases. Many techniques have been developed to study phosphorylation dynamics, including several mass spectrometry (MS)-based methods. Over the last few decades, substantial developments have been made in MS techniques for the large-scale identification of proteins and their post-translational modifications. Nevertheless, all of the current MS-based techniques for quantifying protein phosphorylation dynamics rely on the measurement of changes in peptide abundance levels and many methods suffer from low confidence in phosphopeptide identification due to poor fragmentation. Here we have optimized an approach for the Stable Isotope Labeling of Amino acids by Phosphate (SILAP) using [gamma-18O4]ATP in nucleo to determine global site-specific phosphorylation rates. The advantages of this metabolic labeling technique are: increased confidence in phosphorylated peptide identification, direct labeling of phosphorylation sites, measurement phosphorylation rates, and the identification of actively phosphorylated sites in a cell-like environment. In this study we calculated approximate rate constants for over 500 phosphorylation sites based on labeling progress curves. We measured a wide range of phosphorylation rate constants from 0.34 min-1 to 0.001 min-1. Finally, we applied SILAP to determine sites that have different phosphorylation kinetics during G1/S and M phase. We found that most sites have very similar phosphorylation rates under both conditions; however a small subset of sites on proteins involved in the mitotic spindle were more actively phosphorylated during M phase, while proteins involved in DNA replication and transcription were more actively phosphorylated during G1/S phase.}, keywords = {DYNAMICS, Phosphoproteins*, Phosphoproteome, Phosphorylation, Post-translational modifications*, Signal Transduction*, turnover}, isbn = {1535-9476, 1535-9484}, url = {http://www.mcponline.org/content/early/2014/02/16/mcp.O113.036145}, author = {Molden, Rosalynn C. and Goya, Jonathan and Zia Khan and Garcia, Benjamin A.} } @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 {19698, title = {A Dataset for Quality Assessment of Camera Captured Document Images}, year = {2013}, month = {0002/00/03}, abstract = {Abstract{\textemdash}With the proliferation of cameras on mobile devices there is an increased desire to image document pages as an alternative to scanning. However, the quality of captured document images is often lower than its scanned equivalent due to hardware limitations ...}, url = {http://lampsrv02.umiacs.umd.edu/pubs/Papers/kumar-data-13/kumar-data-13.pdf}, author = {Kumar, J and Ye, P and David Doermann} } @article {19657, title = {Distinct Rap1 Activity States Control the Extent of Epithelial Invagination via α-Catenin}, journal = {Developmental Cell}, volume = {25}, year = {2013}, month = {2013/05/13/}, pages = {299 - 309}, abstract = {Localized cell shape change initiates epithelial folding, while neighboring cell invagination determines the final depth of an epithelial fold. The mechanism that controls the extent of invagination remains unknown. During Drosophila gastrulation, a higher number of cells undergo invagination to form the deep posterior dorsal fold, whereas far fewer cells become incorporated into the initially very similar anterior dorsal fold. We find that a decrease in α-catenin activity causes the anterior fold to invaginate as extensively as the posterior fold. In contrast, constitutive activation of the small GTPase Rap1 restricts invagination of both dorsal folds in an α-catenin-dependent manner. Rap1 activity appears spatially modulated by Rapgap1, whose expression levels are high in the cells that flank the posterior fold but low in the anterior fold. We propose a model whereby distinct activity states of Rap1 modulate α-catenin-dependent coupling between junctions and actin to control the extent of epithelial invagination.}, isbn = {1534-5807}, url = {http://www.sciencedirect.com/science/article/pii/S1534580713001937}, author = {Wang, Yu-Chiun and Zia Khan and Wieschaus, Eric~F.} } @article {20367, title = {Drug response and genetic properties of Vibrio cholerae associated with endemic cholera in north-eastern Thailand, 2003-2011}, journal = {Journal of Medical Microbiology}, year = {2013}, month = {Jan-04-2013}, pages = {599 - 609}, abstract = {Cholera, caused by Vibrio cholerae, results in significant morbidity and mortality worldwide, including Thailand. Representative V. cholerae strains associated with endemic cholera (n = 32), including strains (n = 3) from surface water sources, in Khon Kaen, Thailand (2003{\textendash}2011), were subjected to microbiological, molecular and phylogenetic analyses. According to phenotypic and related genetic data, all tested V. cholerae strains belonged to serogroup O1, biotype El Tor (ET), Inaba (IN) or Ogawa (OG). All of the strains were sensitive to gentamicin and ciprofloxacin, while multidrug-resistant (MDR) strains showing resistance to erythromycin, tetracycline, trimethoprim/sulfamethoxazole and ampicillin were predominant in 2007. V. cholerae strains isolated before and after 2007 were non-MDR. All except six diarrhoeal strains possessed ctxA and ctxB genes and were toxigenic altered ET, confirmed by MAMA-PCR and DNA sequencing. Year-wise data revealed that V. cholerae INET strains isolated between 2003 and 2004, plus one strain isolated in 2007, lacked the RS1 sequence (rstC) and toxin-linked cryptic plasmid (TLC)-specific genetic marker, but possessed CTXCL prophage genes ctxB CL and rstR CL. A sharp genetic transition was noted, namely the majority of V. cholerae strains in 2007 and all in 2010 and 2011 were not repressor genotype rstR CL but instead were rstR ET, and all ctx + strains possessed RS1 and TLC-specific genetic markers. DNA sequencing data revealed that strains isolated since 2007 had a mutation in the tcpA gene at amino acid position 64 (N{\textrightarrow}S). Four clonal types, mostly of environmental origin, including subtypes, reflected genetic diversity, while distinct signatures were observed for clonally related, altered ET from Thailand, Vietnam and Bangladesh, confirmed by distinct subclustering patterns observed in the PFGE (NotI)-based dendrogram, suggesting that endemic cholera is caused by V. cholerae indigenous to Khon Kaen.}, issn = {0022-2615}, doi = {10.1099/jmm.0.053801-0}, url = {http://jmm.microbiologyresearch.org/content/journal/jmm/10.1099/jmm.0.053801-0}, author = {Chomvarin, C. and Johura, F.-T. and Mannan, S. B. and Jumroenjit, W. and Kanoktippornchai, B. and Tangkanakul, W. and Tantisuwichwong, N. and Huttayananont, S. and Watanabe, H. and Hasan, N. A. and Huq, A. and Cravioto, A. and Rita R Colwell and Alam, M.} } @conference {19213, title = {Mind the Theoretical Gap: Interpreting, Using, and Developing Behavioral Theory in HCI Research}, booktitle = {CHI 2013 To Appear}, year = {2013}, month = {2013}, author = {Hekler, E. B. and Klasnja,P. and Jon Froehlich and Buman, M. P.} } @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} } @article {19666, title = {Primate Transcript and Protein Expression Levels Evolve Under Compensatory Selection Pressures}, journal = {Science}, volume = {342}, year = {2013}, month = {2013/11/29/}, pages = {1100 - 1104}, abstract = {Changes in gene regulation have likely played an important role in the evolution of primates. Differences in messenger RNA (mRNA) expression levels across primates have often been documented; however, it is not yet known to what extent measurements of divergence in mRNA levels reflect divergence in protein expression levels, which are probably more important in determining phenotypic differences. We used high-resolution, quantitative mass spectrometry to collect protein expression measurements from human, chimpanzee, and rhesus macaque lymphoblastoid cell lines and compared them to transcript expression data from the same samples. We found dozens of genes with significant expression differences between species at the mRNA level yet little or no difference in protein expression. Overall, our data suggest that protein expression levels evolve under stronger evolutionary constraint than mRNA levels.Don{\textquoteright}t Ape Protein Variation Changes in DNA and messenger RNA (mRNA) expression levels have been used to estimate evolutionary changes between species. However protein expression levels may better reflect selection on divergent and constrained phenotypes. Khan et al. (p. 1100, published online 17 October; see the Perspective by Vogel) measured the differences among and within species between mRNA expression and protein levels in humans, chimpanzees, and rhesus macaques, identifying protein transcripts that seem to be under lineage-specific constraint between humans and chimpanzees. }, isbn = {0036-8075, 1095-9203}, url = {http://www.sciencemag.org/content/342/6162/1100}, author = {Zia Khan and Ford, Michael J. and Cusanovich, Darren A. and Mitrano, Amy and Pritchard, Jonathan K. and Gilad, Yoav} } @conference {19308, title = {Real-time No-Reference Image Quality Assessment based on Filter Learning}, booktitle = {International Conference on Computer Vision and Pattern Recognition (CVPR)}, year = {2013}, author = {Ye,Peng and Kumar,Jayant and Kang,Le and David Doermann} } @article {19371, title = {Segmenting time-lapse phase contrast images of adjacent NIH 3T3 cells.}, journal = {Journal of microscopy}, volume = {249}, year = {2013}, month = {2013 Jan}, pages = {41-52}, abstract = {We present a new method for segmenting phase contrast images of NIH 3T3 fibroblast cells that is accurate even when cells are physically in contact with each other. The problem of segmentation, when cells are in contact, poses a challenge to the accurate automation of cell counting, tracking and lineage modelling in cell biology. The segmentation method presented in this paper consists of (1) background reconstruction to obtain noise-free foreground pixels and (2) incorporation of biological insight about dividing and nondividing cells into the segmentation process to achieve reliable separation of foreground pixels defined as pixels associated with individual cells. The segmentation results for a time-lapse image stack were compared against 238 manually segmented images (8219 cells) provided by experts, which we consider as reference data. We chose two metrics to measure the accuracy of segmentation: the {\textquoteright}Adjusted Rand Index{\textquoteright} which compares similarities at a pixel level between masks resulting from manual and automated segmentation, and the {\textquoteright}Number of Cells per Field{\textquoteright} (NCF) which compares the number of cells identified in the field by manual versus automated analysis. Our results show that the automated segmentation compared to manual segmentation has an average adjusted rand index of 0.96 (1 being a perfect match), with a standard deviation of 0.03, and an average difference of the two numbers of cells per field equal to 5.39\% with a standard deviation of 4.6\%.}, keywords = {Animals, Cell Adhesion, Cell Count, Cell Division, Cell Shape, Computational Biology, Fibroblasts, Image Processing, Computer-Assisted, Mice, Microscopy, Phase-Contrast, NIH 3T3 Cells, Reproducibility of results, Sensitivity and Specificity, Time-Lapse Imaging}, issn = {1365-2818}, doi = {10.1111/j.1365-2818.2012.03678.x}, author = {Chalfoun, J and Kociolek, M and Dima, A and Halter, M and Cardone, Antonio and Peskin, A and Bajcsy, P and Brady, M.} } @article {19694, title = {Structural similarity for document image classification and retrieval}, journal = {Pattern Recognition Letters}, year = {2013}, month = {2013/00/01}, abstract = {Abstract This paper presents a novel approach to defining document image structural similarity for the applications of classification and retrieval. We first build a codebook of SURF descriptors extracted from a set of representative training images. We then encode ...}, doi = {10.1016/j.patrec.2013.10.030}, url = {http://linkinghub.elsevier.com/retrieve/pii/S0167865513004224}, author = {Kumar, Jayant and Ye, Peng and David Doermann} } @conference {19307, title = {Unsupervised Classification of Structurally Similar Document Images}, booktitle = {International Conference on Document Analysis and Recognition}, year = {2013}, author = {Kumar,Jayant and David Doermann} } @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 {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} } @conference {18541, title = {$\#$bias: Measuring the Tweeting Behavior of Propagandists}, booktitle = {Sixth International AAAI Conference on Weblogs and Social Media}, year = {2012}, month = {2012/05/20/}, abstract = {$\#$bias: Measuring the Tweeting Behavior of Propagandists}, url = {http://www.aaai.org/ocs/index.php/ICWSM/ICWSM12/paper/view/4588}, author = {Lumezanu,Cristian and Feamster, Nick and Klein,Hans} } @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} } @inbook {19632, title = {Computational Extractors and Pseudorandomness}, booktitle = {Theory of Cryptography}, series = {Lecture Notes in Computer Science}, year = {2012}, month = {2012/01/01/}, pages = {383 - 403}, publisher = {Springer Berlin Heidelberg}, organization = {Springer Berlin Heidelberg}, abstract = {Computational extractors are efficient procedures that map a source of sufficiently high min-entropy to an output that is computationally indistinguishable from uniform. By relaxing the statistical closeness property of traditional randomness extractors one hopes to improve the efficiency and entropy parameters of these extractors, while keeping their utility for cryptographic applications. In this work we investigate computational extractors and consider questions of existence and inherent complexity from the theoretical and practical angles, with particular focus on the relationship to pseudorandomness. An obvious way to build a computational extractor is via the {\textquotedblleft}extract-then-prg{\textquotedblright} method: apply a statistical extractor and use its output to seed a PRG. This approach carries with it the entropy cost inherent to implementing statistical extractors, namely, the source entropy needs to be substantially higher than the PRG{\textquoteright}s seed length. It also requires a PRG and thus relies on one-way functions. We study the necessity of one-way functions in the construction of computational extractors and determine matching lower and upper bounds on the {\textquotedblleft}black-box efficiency{\textquotedblright} of generic constructions of computational extractors that use a one-way permutation as an oracle. Under this efficiency measure we prove a direct correspondence between the complexity of computational extractors and that of pseudorandom generators, showing the optimality of the extract-then-prg approach for generic constructions of computational extractors and confirming the intuition that to build a computational extractor via a PRG one needs to make up for the entropy gap intrinsic to statistical extractors. On the other hand, we show that with stronger cryptographic primitives one can have more entropy- and computationally-efficient constructions. In particular, we show a construction of a very practical computational extractor from any weak PRF without resorting to statistical extractors.}, keywords = {Algorithm Analysis and Problem Complexity, Coding and Information Theory, Computer Communication Networks, Data Encryption, Math Applications in Computer Science, Systems and Data Security}, isbn = {978-3-642-28913-2, 978-3-642-28914-9}, url = {http://link.springer.com/chapter/10.1007/978-3-642-28914-9_22}, author = {Dana Dachman-Soled and Gennaro, Rosario and Krawczyk, Hugo and Malkin, Tal}, editor = {Cramer, Ronald} } @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 {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} } @article {19655, title = {Differential positioning of adherens junctions is associated with initiation of epithelial folding}, journal = {Nature}, volume = {484}, year = {2012}, month = {2012/04/19/}, pages = {390 - 393}, abstract = {During tissue morphogenesis, simple epithelial sheets undergo folding to form complex structures. The prevailing model underlying epithelial folding involves cell shape changes driven by myosin-dependent apical constriction. Here we describe an alternative mechanism that requires differential positioning of adherens junctions controlled by modulation of epithelial apical{\textendash}basal polarity. Using live embryo imaging, we show that before the initiation of dorsal transverse folds during Drosophila gastrulation, adherens junctions shift basally in the initiating cells, but maintain their original subapical positioning in the neighbouring cells. Junctional positioning in the dorsal epithelium depends on the polarity proteins Bazooka and Par-1. In particular, the basal shift that occurs in the initiating cells is associated with a progressive decrease in Par-1 levels. We show that uniform reduction of the activity of Bazooka or Par-1 results in uniform apical or lateral positioning of junctions and in each case dorsal fold initiation is abolished. In addition, an increase in the Bazooka/Par-1 ratio causes formation of ectopic dorsal folds. The basal shift of junctions not only alters the apical shape of the initiating cells, but also forces the lateral membrane of the adjacent cells to bend towards the initiating cells, thereby facilitating tissue deformation. Our data thus establish a direct link between modification of epithelial polarity and initiation of epithelial folding.}, keywords = {cell biology, developmental biology}, isbn = {0028-0836}, url = {http://www.nature.com/nature/journal/v484/n7394/abs/nature10938.html}, author = {Wang, Yu-Chiun and Zia Khan and Kaschube, Matthias and Wieschaus, Eric F.} } @article {19658, title = {Drosophila Src regulates anisotropic apical surface growth to control epithelial tube size}, journal = {Nature Cell Biology}, volume = {14}, year = {2012}, month = {2012/05//}, pages = {518 - 525}, abstract = {Networks of epithelial and endothelial tubes are essential for the function of organs such as the lung, kidney and vascular system. The sizes and shapes of these tubes are highly regulated to match their individual functions. Defects in tube size can cause debilitating diseases such as polycystic kidney disease and ischaemia. It is therefore critical to understand how tube dimensions are regulated. Here we identify the tyrosine kinase Src as an instructive regulator of epithelial-tube length in the Drosophila tracheal system. Loss-of-function Src42 mutations shorten tracheal tubes, whereas Src42 overexpression elongates them. Surprisingly, Src42 acts distinctly from known tube-size pathways and regulates both the amount of apical surface growth and, with the conserved formin dDaam, the direction of growth. Quantitative three-dimensional image analysis reveals that Src42- and dDaam-mutant tracheal cells expand more in the circumferential than the axial dimension, resulting in tubes that are shorter in length{\textemdash}but larger in diameter{\textemdash}than wild-type tubes. Thus, Src42 and dDaam control tube dimensions by regulating the direction of anisotropic growth, a mechanism that has not previously been described.}, isbn = {1465-7392}, url = {http://www.nature.com/ncb/journal/v14/n5/abs/ncb2467.html}, author = {Nelson, Kevin S. and Zia Khan and Moln{\'a}r, Imre and Mih{\'a}ly, J{\'o}zsef and Kaschube, Matthias and Beitel, Greg J.} } @conference {19599, title = {Dynamic Searchable Symmetric Encryption}, booktitle = {CCS {\textquoteright}12 Proceedings of the 2012 ACM Conference on Computer and Communications Security }, series = {CCS {\textquoteright}12}, year = {2012}, month = {2012///}, pages = {965 - 976}, publisher = {ACM}, organization = {ACM}, abstract = {Searchable symmetric encryption (SSE) allows a client to encrypt its data in such a way that this data can still be searched. The most immediate application of SSE is to cloud storage, where it enables a client to securely outsource its data to an untrusted cloud provider without sacrificing the ability to search over it. SSE has been the focus of active research and a multitude of schemes that achieve various levels of security and efficiency have been proposed. Any practical SSE scheme, however, should (at a minimum) satisfy the following properties: sublinear search time, security against adaptive chosen-keyword attacks, compact indexes and the ability to add and delete files efficiently. Unfortunately, none of the previously-known SSE constructions achieve all these properties at the same time. This severely limits the practical value of SSE and decreases its chance of deployment in real-world cloud storage systems. To address this, we propose the first SSE scheme to satisfy all the properties outlined above. Our construction extends the inverted index approach (Curtmola et al., CCS 2006) in several non-trivial ways and introduces new techniques for the design of SSE. In addition, we implement our scheme and conduct a performance evaluation, showing that our approach is highly efficient and ready for deployment.}, keywords = {Cloud computing, cloud storage, searchable symmetric encryption}, isbn = {978-1-4503-1651-4}, url = {http://doi.acm.org/10.1145/2382196.2382298}, author = {Kamara, Seny and Charalampos Papamanthou and Roeder, Tom} } @article {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 {19660, title = {Global secretome analysis identifies novel mediators of bone metastasis}, journal = {Cell Research}, volume = {22}, year = {2012}, month = {2012/09//}, pages = {1339 - 1355}, abstract = {Bone is the one of the most common sites of distant metastasis of solid tumors. Secreted proteins are known to influence pathological interactions between metastatic cancer cells and the bone stroma. To comprehensively profile secreted proteins associated with bone metastasis, we used quantitative and non-quantitative mass spectrometry to globally analyze the secretomes of nine cell lines of varying bone metastatic ability from multiple species and cancer types. By comparing the secretomes of parental cells and their bone metastatic derivatives, we identified the secreted proteins that were uniquely associated with bone metastasis in these cell lines. We then incorporated bioinformatic analyses of large clinical metastasis datasets to obtain a list of candidate novel bone metastasis proteins of several functional classes that were strongly associated with both clinical and experimental bone metastasis. Functional validation of selected proteins indicated that in vivo bone metastasis can be promoted by high expression of (1) the salivary cystatins CST1, CST2, and CST4; (2) the plasminogen activators PLAT and PLAU; or (3) the collagen functionality proteins PLOD2 and COL6A1. Overall, our study has uncovered several new secreted mediators of bone metastasis and therefore demonstrated that secretome analysis is a powerful method for identification of novel biomarkers and candidate therapeutic targets.}, keywords = {bone, cancer, metastasis, proteomics, secretome}, isbn = {1001-0602}, url = {http://www.nature.com/cr/journal/v22/n9/abs/cr201289a.html}, author = {Blanco, Mario Andres and LeRoy, Gary and Zia Khan and Ale{\v c}kovi{\'c}, Ma{\v s}a and Zee, Barry M. and Garcia, Benjamin A. and Kang, Yibin} } @article {19721, title = {InterPro in 2011: new developments in the family and domain prediction database.}, journal = {Nucleic Acids Res}, volume = {40}, year = {2012}, month = {2012 Jan}, pages = {D306-12}, abstract = {

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

}, keywords = {Databases, Protein, Protein Structure, Tertiary, Proteins, Sequence Analysis, Protein, software, Terminology as Topic, User-Computer Interface}, issn = {1362-4962}, doi = {10.1093/nar/gkr948}, author = {Hunter, Sarah and Jones, Philip and Mitchell, Alex and Apweiler, Rolf and Attwood, Teresa K and Bateman, Alex and Bernard, Thomas and Binns, David and Bork, Peer and Burge, Sarah and de Castro, Edouard and Coggill, Penny and Corbett, Matthew and Das, Ujjwal and Daugherty, Louise and Duquenne, Lauranne and Finn, Robert D and Fraser, Matthew and Gough, Julian and Haft, Daniel and Hulo, Nicolas and Kahn, Daniel and Kelly, Elizabeth and Letunic, Ivica and Lonsdale, David and Lopez, Rodrigo and Madera, Martin and Maslen, John and McAnulla, Craig and McDowall, Jennifer and McMenamin, Conor and Mi, Huaiyu and Mutowo-Muellenet, Prudence and Mulder, Nicola and Natale, Darren and Orengo, Christine and Pesseat, Sebastien and Punta, Marco and Quinn, Antony F and Rivoire, Catherine and Sangrador-Vegas, Amaia and Jeremy D Selengut and Sigrist, Christian J A and Scheremetjew, Maxim and Tate, John and Thimmajanarthanan, Manjulapramila and Thomas, Paul D and Wu, Cathy H and Yeats, Corin and Yong, Siew-Yit} } @conference {19316, title = {Learning Document Structure for Retrieval and Classification}, booktitle = {International Conference on Pattern Recognition (ICPR 2012)}, year = {2012}, pages = {1558-1561}, abstract = {In this paper, we present a method for the retrieval of document images with chosen layout characteristics. The proposed method is based on statistics of patch codewords over different regions of image. We begin with a set of wanted and a random set of unwanted images representative of a large heterogeneous collection. We then use raw-image patches extracted from the unlabeled images to learn a codebook. To model the spatial relationships between patches, the image is recursively partitioned horizontally and vertically, and a histogram of patch-codewords is computed in each partition. The resulting set of features give a high precision and recall for the retrieval of hand-drawn and machine-print table-documents, and unconstrained mixed form-type documents, when trained using a random forest classifier. We compare our method to the spatial-pyramid method, and show that the proposed approach for learning layout characteristics is competitive for document images.}, author = {Kumar,Jayant and Ye,Peng and David Doermann} } @conference {19319, title = {Learning Text-line Segmentation using Codebooks and Graph Partitioning}, booktitle = {International Conference on Frontiers in Handwriting Recognition (ICFHR)}, year = {2012}, pages = {63-68}, abstract = {In this paper, we present a codebook based method for handwritten text-line segmentation which uses image patches in the training data to learn a graph-based similarity for clustering. We first construct a codebook of image-patches using K-medoids, and obtain exemplars which encode local evidence. We then obtain the corresponding codewords for all patches extracted from a given image and construct a similarity graph using the learned evidence and partitioned to obtain textlines. Our learning based approach performs well on a field dataset containing degraded and un-constrained handwritten Arabic document images. Results on ICDAR 2009 segmentation contest dataset show that the method is competitive with previous approaches.}, author = {Kang,Le and Kumar,Jayant and Ye,Peng and David Doermann} } @article {18540, title = {Lithium: Event-Driven Network Control}, volume = {GT-CS-12-03}, year = {2012}, month = {2012///}, institution = {Georgia Institute of Technology}, abstract = {This paper introduces event-driven network control, a network control framework that makes networks easier to manage by automating many tasks that must currently be performed by manually modifying low-level, distributed, and complex device configuration. We identify four policy domains that inherently capture many events: time, user, history, and traffic flow. We then present Lithium, an event-driven network control framework that can implement policies expressed using these domains. Lithium can support policies that automatically react to a wide range of events, from fluctuations in traffic volumes to changes in the time of day. Lithium allows network operators to specify networkwide policies in terms of a high-level, event-driven policy model, as opposed to configuring individual network devices with low-level commands. To show that Lithium is practical, general, and applicable in different types of network scenarios, we have deployed Lithium in both a campus network and a home network and used it to implement more flexible and dynamic network policies. We also perform evaluations to show that Lithium introduces negligible overhead beyond a conventional OpenFlow-based control framework.}, url = {http://hdl.handle.net/1853/43377}, author = {Kim,H. and Voellmy,A. and Burnett,S. and Feamster, Nick and Clark,R.} } @conference {13585, title = {Local Segmentation of Touching Characters using Contour based Shape Decomposition}, booktitle = {Document Analysis Systems}, year = {2012}, month = {2012///}, abstract = {We propose a contour based shape decomposition approach that provides local segmentation of touching characters. The shape contour is linearized into edgelets and edgelets are merged into boundary fragments. Connection cost between boundary fragments is obtained by considering local smoothness, connection length and a stroke-level property Similar Stroke Rate. Samples of connections among boundary fragments are randomly generated and the one with the minimum global cost is selected to produce optimal segmentation of the shape. To obtain a binary segmentation using this approach, we make an iterative search for the parameters that yields two components on a shape. Experimental results on a number of synthetic shape images and the LTP dataset showed that this contour based shape decomposition technique is promising and it is effective on providing local segmentation of touching characters.}, author = {Kang,Le and David Doermann and Cao,Huiagu and Prasad,Rohit and Natarajan,Prem} } @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 {19168, title = {Media, Aggregators and the Link Economy: Strategic Hyperlink Formation in Content Networks}, journal = {Management Science}, year = {2012}, abstract = {A key property of the World Wide Web is the possibility for firms to place virtually costless links to third-party content as a substitute or complement to their own content. This ability to hyperlink has enabled new types of players, such as search engines and content aggregators, to successfully enter content ecosystems, attracting traffic and revenues by hosting links to the content of others. This, in turn, has sparked a heated controversy between content producers and aggregators regarding the legitimacy and social costs/benefits of uninhibited free linking. This work is the first to model the implications of interrelated and strategic hyper-linking and content investments. Our results provide a nuanced view of the much-touted {\textquotedblleft}link economy,{\textquotedblright} highlighting both the beneficial consequences and the drawbacks of free hyperlinks for content producers and consumers. We show that content sites can reduce competition and improve profits by forming links to each other; in such networks one site makes high investments in content and other sites link to it. Interestingly, competitive dynamics often preclude the formation of link networks, even in settings where they would improve everyone{\textquoteright}s profits. Furthermore, such networks improve economic efficiency only when all members have similar abilities to produce content; otherwise the less capable nodes can free-ride on the content of the more capable nodes, reducing profits for the capable nodes as well as the average content quality available to consumers. Within these networks, aggregators have both positive and negative effects. By making it easier for consumers to access good quality content they increase the appeal of the entire content ecosystem relative to the alternatives. To the extent that this increases the total traffic flowing into the content ecosystem, aggregators can help increase the profits of the highest quality content sites. At the same time, however, the market entry of aggregators takes away some of the revenue that would otherwise go to content sites. Finally, by placing links to only a subset of available content, aggregators further increase competitive pressure on content sites. Interestingly, this can increase the likelihood that such sites will then attempt to alleviate the competitive pressure by forming link networks. }, author = {Dellarocas, Chris and Katona,Zsolt and Rand, William} } @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 {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 {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 {15108, title = {Quid Pro Quo-tocols: Strengthening Semi-Honest Protocols with Dual Execution}, journal = {IEEE Symposium on Security and Privacy}, year = {2012}, month = {2012///}, abstract = {Known protocols for secure two-party computa-tion that are designed to provide full security against malicious behavior are significantly less efficient than protocols intended only to thwart semi-honest adversaries. We present a concrete design and implementation of protocols achieving security guarantees that are much stronger than are possible with semi-honest protocols, at minimal extra cost. Specifically, we consider protocols in which a malicious adversary may learn a single (arbitrary) bit of additional information about the honest party{\textquoteright}s input. Correctness of the honest party{\textquoteright}s output is still guaranteed. Adapting prior work of Mohassel and Franklin, the basic idea in our protocols is to conduct two separate runs of a (specific) semi-honest, garbled-circuit protocol, with the parties swapping roles, followed by an inexpensive secure equality test. We provide a rigorous definition and prove that this protocol leaks no more than one additional bit against a malicious adversary. In addition, we propose some heuristic enhancements to reduce the overall information a cheating adversary learns. Our experiments show that protocols meeting this security level can be implemented at cost very close to that of protocols that only achieve semi-honest security. Our results indicate that this model enables the large-scale, practical applications possible within the semi-honest security model, while providing stronger security guarantees. }, author = {Huang,Y. and Katz, Jonathan and Evans,D.} } @article {15163, title = {Review of efficient secure two-party protocols: techniques and constructions by Carmit Hazay and Yehuda Lindell}, journal = {SIGACT News}, volume = {43}, year = {2012}, month = {2012/03//}, pages = {21 - 23}, isbn = {0163-5700}, doi = {10.1145/2160649.2160656}, url = {http://doi.acm.org/10.1145/2160649.2160656}, author = {Katz, Jonathan} } @inbook {18597, title = {Re-wiring Activity of Malicious Networks}, booktitle = {Passive and Active MeasurementPassive and Active Measurement}, series = {Lecture Notes in Computer Science}, volume = {7192}, year = {2012}, month = {2012///}, pages = {116 - 125}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {This paper studies the AS-level re-wiring dynamics (changes in the connectivity) of malicious networks. Anecdotal evidence suggests that some malicious ASes that are primarily involved in nefarious activities on the Internet, were sequentially de-peered by providers before their final cut-off (as occurred in the well-publicized cases of Atrivo/Intercage). We present the first systematic study of the re-wiring dynamics of malicious ASes. We tracked the ASes that were listed by Hostexploit over the last two years and compared their AS-level re-wiring dynamics with non-reported ASes. Using a publicly available dataset of Customer-Provider (CP) relations in the Internet{\textquoteright}s AS graph, we studied how interconnection between autonomous systems evolves, both for ASes that provide connectivity for attackers and ASes that were not reported as malicious. We find that malicious networks are more aggressive both in forming links with providers and changing their upstream connectivity than other ASes. Our results indicate that the re-wiring dynamics of the networks that host attacks are stable over time, despite the evolving nature of the attacks themselves, which suggests that existing defense mechanisms could benefit from incorporating these features.}, keywords = {Computer science}, isbn = {978-3-642-28536-3}, url = {http://www.springerlink.com/content/95vn833728404877/abstract/}, author = {Konte,Maria and Feamster, Nick}, editor = {Taft,Nina and Ricciato,Fabio} } @article {15182, title = {Secure multi-party computation of boolean circuits with applications to privacy in on-line marketplaces}, journal = {Topics in Cryptology{\textendash}CT-RSA 2012}, year = {2012}, month = {2012///}, pages = {416 - 432}, abstract = {Protocols for generic secure multi-party computation (MPC) generally come in two forms: they either represent the function being computed as a boolean circuit, or as an arithmetic circuit over a large field. Either type of protocol can be used for any function, but the choice of which protocol to use can have a significant impact on efficiency. The magnitude of the effect, however, has never been quantified.With this in mind, we implement the MPC protocol of Goldreich, Micali, and Wigderson [13], which uses a boolean representation and is secure against a semi-honest adversary corrupting any number of parties. We then consider applications of secure MPC in on-line marketplaces, where customers select resources advertised by providers and it is desired to ensure privacy to the extent possible. Problems here are more naturally formulated in terms of boolean circuits, and we study the performance of our MPC implementation relative to existing ones that use an arithmetic-circuit representation. Our protocol easily handles tens of customers/providers and thousands of resources, and outperforms existing implementations including FairplayMP [3], VIFF [11], and SEPIA [7]. }, doi = {10.1007/978-3-642-27954-6_26}, author = {Choi,S. and Hwang,K.W. and Katz, Jonathan and Malkin,T. and Rubenstein,D.} } @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} } @conference {19314, title = {Sharpness Estimation for Document and Scene Images}, booktitle = {International Conference on Pattern Recognition (ICPR 2012)}, year = {2012}, pages = {3292-3295}, abstract = {Images of document pages have different characteristics than images of natural scenes, and so the sharpness measures developed for natural scene images do not necessarily extend to document images primarily composed of text. We present an efficient and simple method for effectively estimating the sharpness/ blurriness of document images that also performs well on natural scenes. Our method can be used to predict the sharpness in scenarios where images are blurred due to camera-motion (or hand-shake), defocus, or inherent properties of the imaging system. The proposed method outperforms the perceptually-based, no-reference sharpness work of [1] and [4], which was shown to perform better than 14 other no-reference sharpness measures on the LIVE dataset.}, author = {Kumar,Jayant and Chen, Francine and David Doermann} } @article {19132, title = {Structure, function and diversity of the healthy human microbiome}, journal = {Nature}, volume = {486}, year = {2012}, month = {2012}, pages = {207 - 214}, abstract = {Studies of the human microbiome have revealed that even healthy individuals differ remarkably in the microbes that occupy habitats such as the gut, skin and vagina. Much of this diversity remains unexplained, although diet, environment, host genetics and early microbial exposure have all been implicated. Accordingly, to characterize the ecology of human-associated microbial communities, the Human Microbiome Project has analysed the largest cohort and set of distinct, clinically relevant body habitats so far. We found the diversity and abundance of each habitat{\textquoteright}s signature microbes to vary widely even among healthy subjects, with strong niche specialization both within and among individuals. The project encountered an estimated 81{\textendash}99\% of the genera, enzyme families and community configurations occupied by the healthy Western microbiome. Metagenomic carriage of metabolic pathways was stable among individuals despite variation in community structure, and ethnic/racial background proved to be one of the strongest associations of both pathways and microbes with clinical metadata. These results thus delineate the range of structural and functional configurations normal in the microbial communities of a healthy population, enabling future characterization of the epidemiology, ecology and translational applications of the human microbiome.}, author = {Huttenhower, C. and Gevers, D. and Knight,R. and Abubucker, S. and Badger, J.H. and Chinwalla, A.T. and Creasy, H.H. and Earl, A.M. and Fitzgerald, M.G. and Fulton, R.S. and others} } @article {15115, title = {Two-server password-only authenticated key exchange}, journal = {Journal of Computer and System Sciences}, volume = {78}, year = {2012}, month = {2012/03//}, pages = {651 - 669}, abstract = {Typical protocols for password-based authentication assume a single server that stores all the information (e.g., the password) necessary to authenticate a user. An inherent limitation of this approach, assuming low-entropy passwords are used, is that the user's password is exposed if this server is ever compromised. To address this issue, it has been suggested to share a user's password information among multiple servers, and to have these servers cooperate (possibly in a threshold manner) when the user wants to authenticate. We show here a two-server version of the password-only key-exchange protocol of Katz, Ostrovsky, and Yung (the KOY protocol). Our work gives the first secure two-server protocol for the password-only setting (in which the user need remember only a password, and not the servers' public keys), and is the first two-server protocol (in any setting) with a proof of security in the standard model. Our work thus fills a gap left by the work of MacKenzie et al. (2006) [31] and Di Raimondo and Gennaro (2006) [16]. As an additional benefit of our work, we show modifications that improve the efficiency of the original KOY protocol.}, keywords = {Key-exchange protocols, passwords}, isbn = {0022-0000}, doi = {10.1016/j.jcss.2011.09.005}, url = {http://www.sciencedirect.com/science/article/pii/S0022000011001048}, author = {Katz, Jonathan and MacKenzie,Philip and Taban,Gelareh and Gligor,Virgil} } @conference {13684, title = {Unsupervised Feature Learning Framework for No-reference Image Quality Assessment}, booktitle = {CVPR}, year = {2012}, month = {2012///}, abstract = {In this paper, we present an efficient general-purpose objective no-reference (NR) image quality assessment (IQA) framework based on unsupervised feature learning. The goal is to build a computational model to automatically predict human perceived image quality without a reference image and without knowing the distortion present in the image. Previous approaches for this problem typically rely on hand-crafted features which are carefully designed based on prior knowledge. In contrast, we use raw-image-patches extracted from a set of unlabeled images to learn a dictionary in an unsupervised manner. We use soft-assignment coding with max pooling to obtain effective image representations for quality estimation. The proposed algorithm is very computationally appealing, using raw image patches as local descriptors and using soft-assignment for encoding. Furthermore, unlike previous methods, our unsupervised feature learning strategy enables our method to adapt to different domains. CORNIA (Codebook Representation for No-Reference Image Assessment) was tested on LIVE database and shown to perform statistically better than full-reference quality measure structural similarity index (SSIM) and was shown to be comparable to state-of-the-art general purpose NR-IQA algorithms.}, author = {Ye,Peng and Kumar,Jayant and Kang,Le and David Doermann} } @article {15117, title = {Which Languages Have 4-Round Zero-Knowledge Proofs?}, journal = {Journal of cryptology}, volume = {25}, year = {2012}, month = {2012///}, pages = {41 - 56}, abstract = {We show that if a language L has a 4-round, black-box, computational zero-knowledge proof system with negligible soundness error, then . Assuming the polynomial hierarchy does not collapse, this means in particular that NP-complete languages do not have 4-round zero-knowledge proofs with black-box simulation.}, doi = {10.1007/s00145-010-9081-y}, author = {Katz, Jonathan} } @article {19181, title = {Ability-based design: Concept, principles and examples}, journal = {ACM Transactions on Accessible Computing (TACCESS)}, volume = {3}, year = {2011}, month = {2011}, author = {Wobbrock,J.O. and Kane,S.K. and Gajos,K.Z. and Harada,S. and Jon Froehlich} } @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} } @article {15158, title = {On Achieving the" Best of Both Worlds" in Secure Multiparty Computation}, journal = {SIAM Journal on Computing}, volume = {40}, year = {2011}, month = {2011///}, pages = {122 - 122}, abstract = {Two settings are traditionally considered for secure multiparty computation, de-pending on whether or not a majority of the parties are assumed to be honest. Existing protocols that assume an honest majority provide {\textquotedblleft}full security{\textquotedblright} (and, in particular, guarantee output delivery and fairness) when this assumption holds, but are completely insecure if this assumption is violated. On the other hand, known protocols tolerating an arbitrary number of corruptions do not guarantee fairness or output delivery even if only a single party is dishonest. It is natural to wonder whether it is possible to achieve the {\textquotedblleft}best of both worlds{\textquotedblright}: namely, a single protocol that simultaneously achieves the best possible security in both the above settings. Here, we rule out this possibility (at least for general functionalities) and show some positive results regarding what can be achieved. }, author = {Ishai,Y. and Katz, Jonathan and Kushilevitz,E. and Lindell,Y. and Petrank,E.} } @article {15142, title = {Adaptively secure broadcast, revisited}, journal = {Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing}, year = {2011}, month = {2011///}, abstract = {We consider the classical problem of synchronous broadcast with dishonest majority, whena public-key infrastructure and digital signatures are available. In a surprising result, Hirt and Zikas (Eurocrypt 2010) recently observed that all existing protocols for this task are insecure against an adaptive adversary who can choose which parties to corrupt as the protocol progresses. Moreover, they prove an impossibility result for adaptively secure broadcast in their setting. We argue that the communication model adopted by Hirt and Zikas is unrealistically pes- simistic. We revisit the problem of adaptively secure broadcast in a more natural synchronous model (with rushing), and show that broadcast is possible in this setting for an arbitrary num- ber of corruptions. Our positive result holds under a strong, simulation-based definition in the universal-composability framework. We also study the impact of adaptive attacks on protocols for secure multi-party computation where broadcast is used as a sub-routine. }, author = {Garay,J. A and Katz, Jonathan and Kumaresan,R. and Zhou,H.S.} } @article {19279, title = {Analysis of SystemC actor networks for efficient synthesis}, journal = {ACM Trans. Embed. Comput. Syst.}, volume = {10}, year = {2011}, month = {2011}, pages = {18:1 - 18:34}, abstract = {Applications in the signal processing domain are often modeled by dataflow graphs. Due to heterogeneous complexity requirements, these graphs contain both dynamic and static dataflow actors. In previous work, we presented a generalized clustering approach for these heterogeneous dataflow graphs in the presence of unbounded buffers. This clustering approach allows the application of static scheduling methodologies for static parts of an application during embedded software generation for multiprocessor systems. It systematically exploits the predictability and efficiency of the static dataflow model to obtain latency and throughput improvements. In this article, we present a generalization of this clustering technique to dataflow graphs with bounded buffers, therefore enabling synthesis for embedded systems without dynamic memory allocation. Furthermore, a case study is given to demonstrate the performance benefits of the approach.}, keywords = {actor-oriented design, clustering, Dataflow analysis, scheduling}, isbn = {1539-9087}, url = {http://doi.acm.org/10.1145/1880050.1880054}, author = {Falk, Joachim and Zebelein, Christian and Keinert, Joachim and Haubelt, Christian and Teich, Juergen and Bhattacharyya, Shuvra S.} } @conference {19269, title = {Applying graphics processor acceleration in a software defined radio prototyping environment}, booktitle = {2011 22nd IEEE International Symposium on Rapid System Prototyping (RSP)}, year = {2011}, month = {2011}, pages = {67 - 73}, abstract = {With higher bandwidth requirements and more complex protocols, software defined radio (SDR) has ever growing computational demands. SDR applications have different levels of parallelism that can be exploited on multicore platforms, but design and programming difficulties have inhibited the adoption of specialized multicore platforms like graphics processors (GPUs). In this work we propose a new design flow that augments a popular existing SDR development environment (GNU Radio), with a dataflow foundation and a stand-alone GPU accelerated library. The approach gives an SDR developer the ability to prototype a GPU accelerated application and explore its design space fast and effectively. We demonstrate this design flow on a standard SDR benchmark and show that deciding how to utilize a GPU can be non-trivial for even relatively simple applications.}, keywords = {Acceleration, coprocessors, dataflow foundation, GNU radio, Graphics processing unit, graphics processor acceleration, Kernel, Libraries, multicore platforms, Multicore processing, PARALLEL PROCESSING, Pipelines, Protocols, software defined radio prototyping environment, software radio, stand-alone GPU accelerated library}, author = {Plishker,W. and Zaki, G.F. and Bhattacharyya, Shuvra S. and Clancy, C. and Kuykendall, J.} } @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 {16246, title = {Assessing the benefits of using mate-pairs to resolve repeats in de novo short-read prokaryotic assemblies}, journal = {BMC Bioinformatics}, volume = {12}, year = {2011}, month = {2011/04/13/}, pages = {95 - 95}, abstract = {Next-generation sequencing technologies allow genomes to be sequenced more quickly and less expensively than ever before. However, as sequencing technology has improved, the difficulty of de novo genome assembly has increased, due in large part to the shorter reads generated by the new technologies. The use of mated sequences (referred to as mate-pairs) is a standard means of disambiguating assemblies to obtain a more complete picture of the genome without resorting to manual finishing. Here, we examine the effectiveness of mate-pair information in resolving repeated sequences in the DNA (a paramount issue to overcome). While it has been empirically accepted that mate-pairs improve assemblies, and a variety of assemblers use mate-pairs in the context of repeat resolution, the effectiveness of mate-pairs in this context has not been systematically evaluated in previous literature.}, isbn = {1471-2105}, doi = {10.1186/1471-2105-12-95}, url = {http://www.biomedcentral.com/1471-2105/12/95}, author = {Wetzel,Joshua and Kingsford, Carl and Pop, Mihai} } @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} } @article {19114, title = {Bambus 2: scaffolding metagenomes}, journal = {Bioinformatics}, volume = {27}, year = {2011}, month = {2011}, pages = {2964 - 2971}, author = {Koren, S. and Treangen, T.J. and Pop, Mihai} } @conference {12398, title = {Believe Me{\textemdash}We Can Do This! Annotating Persuasive Acts in Blog Text}, booktitle = {Workshops at the Twenty-Fifth AAAI Conference on Artificial Intelligence}, year = {2011}, month = {2011///}, author = {Anand,P. and King,J. and Jordan Boyd-Graber and Wagner,E. and Martell,C. and Oard, Douglas and Resnik, Philip} } @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 {12984, title = {Can Deliberately Incomplete Gene Sample Augmentation Improve a Phylogeny Estimate for the Advanced Moths and Butterflies (Hexapoda: Lepidoptera)?}, journal = {Systematic BiologySyst Biol}, volume = {60}, year = {2011}, month = {2011/12/01/}, pages = {782 - 796}, abstract = {This paper addresses the question of whether one can economically improve the robustness of a molecular phylogeny estimate by increasing gene sampling in only a subset of taxa, without having the analysis invalidated by artifacts arising from large blocks of missing data. Our case study stems from an ongoing effort to resolve poorly understood deeper relationships in the large clade Ditrysia ( > 150,000 species) of the insect order Lepidoptera (butterflies and moths). Seeking to remedy the overall weak support for deeper divergences in an initial study based on five nuclear genes (6.6 kb) in 123 exemplars, we nearly tripled the total gene sample (to 26 genes, 18.4 kb) but only in a third (41) of the taxa. The resulting partially augmented data matrix (45\% intentionally missing data) consistently increased bootstrap support for groupings previously identified in the five-gene (nearly) complete matrix, while introducing no contradictory groupings of the kind that missing data have been predicted to produce. Our results add to growing evidence that data sets differing substantially in gene and taxon sampling can often be safely and profitably combined. The strongest overall support for nodes above the family level came from including all nucleotide changes, while partitioning sites into sets undergoing mostly nonsynonymous versus mostly synonymous change. In contrast, support for the deepest node for which any persuasive molecular evidence has yet emerged (78{\textendash}85\% bootstrap) was weak or nonexistent unless synonymous change was entirely excluded, a result plausibly attributed to compositional heterogeneity. This node (Gelechioidea + Apoditrysia), tentatively proposed by previous authors on the basis of four morphological synapomorphies, is the first major subset of ditrysian superfamilies to receive strong statistical support in any phylogenetic study. A {\textquotedblleft}more-genes-only{\textquotedblright} data set (41 taxa{\texttimes}26 genes) also gave strong signal for a second deep grouping (Macrolepidoptera) that was obscured, but not strongly contradicted, in more taxon-rich analyses.}, keywords = {Ditrysia, gene sampling, Hexapoda, Lepidoptera, missing data, molecular phylogenetics, nuclear genes, taxon sampling}, isbn = {1063-5157, 1076-836X}, doi = {10.1093/sysbio/syr079}, url = {http://sysbio.oxfordjournals.org/content/60/6/782}, author = {Cho,Soowon and Zwick,Andreas and Regier,Jerome C and Mitter,Charles and Cummings, Michael P. and Yao,Jianxiu and Du,Zaile and Zhao,Hong and Kawahara,Akito Y and Weller,Susan and Davis,Donald R and Baixeras,Joaquin and Brown,John W and Parr,Cynthia} } @conference {18328, title = {A case for query by image and text content: searching computer help using screenshots and keywords}, booktitle = {Proceedings of the 20th international conference on World wide web}, series = {WWW {\textquoteright}11}, year = {2011}, month = {2011///}, pages = {775 - 784}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {The multimedia information retrieval community has dedicated extensive research effort to the problem of content-based image retrieval (CBIR). However, these systems find their main limitation in the difficulty of creating pictorial queries. As a result, few systems offer the option of querying by visual examples, and rely on automatic concept detection and tagging techniques to provide support for searching visual content using textual queries.This paper proposes and studies a practical multimodal web search scenario, where CBIR fits intuitively to improve the retrieval of rich information queries. Many online articles contain useful know-how knowledge about computer applications. These articles tend to be richly illustrated by screenshots. We present a system to search for such software know-how articles that leverages the visual correspondences between screenshots. Users can naturally create pictorial queries simply by taking a screenshot of the application to retrieve a list of articles containing a matching screenshot. We build a prototype comprising 150k articles that are classified into walkthrough, book, gallery, and general categories, and provide a comprehensive evaluation of this system, focusing on technical (accuracy of CBIR techniques) and usability (perceived system usefulness) aspects. We also consider the study of added value features of such a visual-supported search, including the ability to perform cross-lingual queries. We find that the system is able to retrieve matching screenshots for a wide variety of programs, across language boundaries, and provide subjectively more useful results than keyword-based web and image search engines. }, keywords = {content-based image retrieval, multimodal search, online help}, isbn = {978-1-4503-0632-4}, doi = {10.1145/1963405.1963513}, url = {http://doi.acm.org/10.1145/1963405.1963513}, author = {Tom Yeh and White,Brandyn and San Pedro,Jose and Katz,Boriz and Davis, Larry S.} } @conference {13080, title = {A case for query by image and text content: searching computer help using screenshots and keywords}, booktitle = {Proceedings of the 20th international conference on World wide web}, series = {WWW {\textquoteright}11}, year = {2011}, month = {2011///}, pages = {775 - 784}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {The multimedia information retrieval community has dedicated extensive research effort to the problem of content-based image retrieval (CBIR). However, these systems find their main limitation in the difficulty of creating pictorial queries. As a result, few systems offer the option of querying by visual examples, and rely on automatic concept detection and tagging techniques to provide support for searching visual content using textual queries. This paper proposes and studies a practical multimodal web search scenario, where CBIR fits intuitively to improve the retrieval of rich information queries. Many online articles contain useful know-how knowledge about computer applications. These articles tend to be richly illustrated by screenshots. We present a system to search for such software know-how articles that leverages the visual correspondences between screenshots. Users can naturally create pictorial queries simply by taking a screenshot of the application to retrieve a list of articles containing a matching screenshot. We build a prototype comprising 150k articles that are classified into walkthrough, book, gallery, and general categories, and provide a comprehensive evaluation of this system, focusing on technical (accuracy of CBIR techniques) and usability (perceived system usefulness) aspects. We also consider the study of added value features of such a visual-supported search, including the ability to perform cross-lingual queries. We find that the system is able to retrieve matching screenshots for a wide variety of programs, across language boundaries, and provide subjectively more useful results than keyword-based web and image search engines.}, keywords = {content-based image retrieval, multimodal search, online help}, isbn = {978-1-4503-0632-4}, doi = {10.1145/1963405.1963513}, url = {http://doi.acm.org/10.1145/1963405.1963513}, author = {Tom Yeh and White,Brandyn and San Pedro,Jose and Katz,Boriz and Davis, Larry S.} } @conference {14326, title = {CHI 2011 sustainability community invited panel: challenges ahead}, booktitle = {2011 annual conference extended abstracts on Human factors in computing systems}, series = {CHI EA {\textquoteright}11}, year = {2011}, month = {2011///}, pages = {73 - 76}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {As part of a new CHI Sustainability Community, focused on environmental sustainability, this panel will discuss specific ways in which HCI research will be critical in finding solutions to this global challenge. While research to date has primarily focused on the end consumer, the panel will be challenged with enlarging the discussion to include the designer as a target user and to consider interfaces and interactions that support sustainable design and sustainable manufacturing, as well as sustainable consumption. Specifically, to make real progress, we seek to enumerate ways that HCI needs to grow, as well as to find ways that can help more HCI researchers to become involved.}, keywords = {design, Environment, sustainability; community, user behavior}, doi = {10.1145/1979482.1979484}, url = {http://doi.acm.org/10.1145/1979482.1979484}, author = {Khan,Azam and Bartram,Lyn and Blevis,Eli and DiSalvo,Carl and Jon Froehlich and Kurtenbach,Gordon} } @article {12869, title = {Clonal transmission, dual peak, and off-season cholera in Bangladesh}, journal = {Infection Ecology \& Epidemiology}, volume = {1}, year = {2011}, month = {08/2011}, abstract = {Vibrio cholerae is an estuarine bacterium associated with a single peak of cholera (March{\textendash}May) in coastal villages of Bangladesh. For an unknown reason, however, cholera occurs in a unique dual peak (March{\textendash}May and September{\textendash}November) pattern in the city of Dhaka that is bordered by a heavily polluted freshwater river system and flood embankment. In August 2007, extreme flooding was accompanied by an unusually severe diarrhea outbreak in Dhaka that resulted in a record high illness. This study was aimed to understand the unusual outbreak and if it was related to the circulation of a new V. cholerae clone. Nineteen V. cholerae isolated during the peak of the 2007 outbreak were subjected to extensive phenotypic and molecular analyses, including multi-locus genetic screening by polymerase chain reaction (PCR), sequence-typing of the ctxB gene, and pulsed-field gel electrophoresis (PFGE). Factors associated with the unusual incidence of cholera were determined and analysis of the disease severity was done. Overall, microbiological and molecular data confirmed that the hypervirulent V. cholerae was O1 biotype El Tor (ET) that possessed cholera toxin (CT) of the classical biotype. The PFGE (NotI) and dendrogram clustering confirmed that the strains were clonal and related to the pre-2007 variant ET from Dhaka and Matlab and resembled one of two distinct clones of the variant ET confirmed to be present in the estuarine ecosystem of Bangladesh. Results of the analyses of both diarrheal case data for three consecutive years (2006{\textendash}2008) and regional hydroclimatology over three decades (1980{\textendash}2009) clearly indicate that the pattern of cholera occurring in Dhaka, and not seen at other endemic sites, was associated with flood waters transmitting the infectious clone circulating via the fecal-oral route during and between the dual seasonal cholera peaks in Dhaka. Circular river systems and flood embankment likely facilitate transmission of infectious V. cholerae throughout the year that leads to both sudden and off-season outbreaks in the densely populated urban ecosystem of Dhaka. Clonal recycling of hybrid El Tor with increasing virulence in a changing climate and in a region with a growing urban population represents a serious public health concern for Bangladesh.}, doi = {10.3402/iee.v1i0.7273}, author = {Alam,M. and Islam,A. and Bhuiyan,N. A. and Rahim,N. and Hossain,A. and Khan,G. Y. and Ahmed,D. and Watanabe,H. and Izumiya,H. and Faruque,A. S. G. and Rita R Colwell} } @conference {14447, title = {Collective graph identification}, booktitle = {Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining}, series = {KDD {\textquoteright}11}, year = {2011}, month = {2011///}, pages = {87 - 95}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Data describing networks (communication networks, transaction networks, disease transmission networks, collaboration networks, etc.) is becoming increasingly ubiquitous. While this observational data is useful, it often only hints at the actual underlying social or technological structures which give rise to the interactions. For example, an email communication network provides useful insight but is not the same as the "real" social network among individuals. In this paper, we introduce the problem of graph identification, i.e., the discovery of the true graph structure underlying an observed network. We cast the problem as a probabilistic inference task, in which we must infer the nodes, edges, and node labels of a hidden graph, based on evidence provided by the observed network. This in turn corresponds to the problems of performing entity resolution, link prediction, and node labeling to infer the hidden graph. While each of these problems have been studied separately, they have never been considered together as a coherent task. We present a simple yet novel approach to address all three problems simultaneously. Our approach, called C3, consists of Coupled Collective Classifiers that are iteratively applied to propagate information among solutions to the problems. We empirically demonstrate that C3 is superior, in terms of both predictive accuracy and runtime, to state-of-the-art probabilistic approaches on three real-world problems.}, keywords = {collective classification, entity resolution, link prediction, semi-supervised learning}, isbn = {978-1-4503-0813-7}, doi = {10.1145/2020408.2020429}, url = {http://doi.acm.org/10.1145/2020408.2020429}, author = {Namata,Galileo Mark and Kok,Stanley and Getoor, Lise} } @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 {15126, title = {Complete Fairness in Secure Two-Party Computation}, journal = {Journal of the ACM}, volume = {58}, year = {2011}, month = {2011/12//}, pages = {24:1{\textendash}24:37 - 24:1{\textendash}24:37}, abstract = {In the setting of secure two-party computation, two mutually distrusting parties wish to compute some function of their inputs while preserving, to the extent possible, various security properties such as privacy, correctness, and more. One desirable property is fairness which guarantees, informally, that if one party receives its output, then the other party does too. Cleve [1986] showed that complete fairness cannot be achieved in general without an honest majority. Since then, the accepted folklore has been that nothing non-trivial can be computed with complete fairness in the two-party setting. We demonstrate that this folklore belief is false by showing completely fair protocols for various nontrivial functions in the two-party setting based on standard cryptographic assumptions. We first show feasibility of obtaining complete fairness when computing any function over polynomial-size domains that does not contain an {\textquotedblleft}embedded XOR{\textquotedblright}; this class of functions includes boolean AND/OR as well as Yao{\textquoteright}s {\textquotedblleft}millionaires{\textquoteright} problem{\textquotedblright}. We also demonstrate feasibility for certain functions that do contain an embedded XOR, though we prove a lower bound showing that any completely fair protocol for such functions must have round complexity super-logarithmic in the security parameter. Our results demonstrate that the question of completely fair secure computation without an honest majority is far from closed.}, keywords = {cryptography, fairness, secure computation}, isbn = {0004-5411}, doi = {10.1145/2049697.2049698}, url = {http://doi.acm.org/10.1145/2049697.2049698}, author = {Gordon,S. Dov and Hazay,Carmit and Katz, Jonathan and Lindell,Yehuda} } @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 {15085, title = {Constant-Round Private Function Evaluation with Linear Complexity}, journal = {Advances in Cryptology{\textendash}ASIACRYPT 2011}, year = {2011}, month = {2011///}, pages = {556 - 571}, abstract = {We consider the problem of private function evaluation (PFE) in the two-party setting. Here, informally, one party holds an input x while the other holds a (circuit describing a) function f; the goal is for one (or both) of the parties to learn f(x) while revealing nothing more to either party. In contrast to the usual setting of secure computation, where the function being computed is known to both parties, PFE is useful in settings where the function (i.e., algorithm) itself must remain secret, e.g., because it is proprietary or classified.It is known that PFE can be reduced to standard secure computation by having the parties evaluate a universal circuit, and this is the approach taken in most prior work. Using a universal circuit, however, introduces additional overhead and results in a more complex implementation. We show here a completely new technique for PFE that avoids universal circuits, and results in constant-round protocols with communication/computational complexity linear in the size of the circuit computing f. This gives the first constant-round protocol for PFE with linear complexity (without using fully homomorphic encryption), even restricted to semi-honest adversaries. }, doi = {10.1007/978-3-642-25385-0_30}, author = {Katz, Jonathan and Malka,L.} } @article {15280, title = {A cost-aggregating integer linear program for motif finding}, journal = {Journal of Discrete Algorithms}, volume = {9}, year = {2011}, month = {2011/12//}, pages = {326 - 334}, abstract = {In the motif finding problem one seeks a set of mutually similar substrings within a collection of biological sequences. This is an important and widely-studied problem, as such shared motifs in DNA often correspond to regulatory elements. We study a combinatorial framework where the goal is to find substrings of a given length such that the sum of their pairwise distances is minimized. We describe a novel integer linear program for the problem, which uses the fact that distances between substrings come from a limited set of possibilities allowing for aggregate consideration of sequence position pairs with the same distances. We show how to tighten its linear programming relaxation by adding an exponential set of constraints and give an efficient separation algorithm that can find violated constraints, thereby showing that the tightened linear program can still be solved in polynomial time. We apply our approach to find optimal solutions for the motif finding problem and show that it is effective in practice in uncovering known transcription factor binding sites.}, keywords = {Computational Biology, Integer linear programming, Sequence motif finding}, isbn = {1570-8667}, doi = {10.1016/j.jda.2011.04.001}, url = {http://www.sciencedirect.com/science/article/pii/S157086671100044X}, author = {Kingsford, Carl and Zaslavsky,Elena and Singh,Mona} } @conference {17861, title = {Decentralized, accurate, and low-cost network bandwidth prediction}, booktitle = {2011 Proceedings IEEE INFOCOM}, year = {2011}, month = {2011/04/10/15}, pages = {6 - 10}, publisher = {IEEE}, organization = {IEEE}, abstract = {The distributed nature of modern computing makes end-to-end prediction of network bandwidth increasingly important. Our work is inspired by prior work that treats the Internet and bandwidth as an approximate tree metric space. This paper presents a decentralized, accurate, and low cost system that predicts pairwise bandwidth between hosts. We describe an algorithm to construct a distributed tree that embeds bandwidth measurements. The correctness of the algorithm is provable when driven by precise measurements. We then describe three novel heuristics that achieve high accuracy for predicting bandwidth even with imprecise input data. Simulation experiments with a real-world dataset confirm that our approach shows high accuracy with low cost.}, keywords = {accuracy, approximate tree metric space, Bandwidth, bandwidth allocation, bandwidth measurement, decentralized low cost system, distributed tree, end-to-end prediction, Extraterrestrial measurements, Internet, low-cost network bandwidth prediction, Measurement uncertainty, pairwise bandwidth, Peer to peer computing, Prediction algorithms, trees (mathematics)}, isbn = {978-1-4244-9919-9}, doi = {10.1109/INFCOM.2011.5935251}, author = {Sukhyun Song and Keleher,P. and Bhattacharjee, Bobby and Sussman, Alan} } @book {15188, title = {Decision and Game Theory for Security: Second International Conference, GameSec 2011, College Park, MD, Maryland, USA, November 14-15, 2011, Proceedings}, year = {2011}, month = {2011/12/27/}, publisher = {Springer}, organization = {Springer}, abstract = {This book constitutes the refereed proceedings of the Second International Conference on Decision and Game Theory for Security, GameSec 2011, held in College Park, Maryland, USA, in November 2011. The 16 revised full papers and 2 plenary keynotes presented were carefully reviewed and selected from numerous submissions. The papers are organized in topical sections on attacks, adversaries, and game theory, wireless adhoc and sensor networks, network games, security insurance, security and trust in social networks and security investments.}, keywords = {Business \& Economics / Information Management, Computers / Hardware / Network Hardware, Computers / Information Technology, Computers / Programming / Algorithms, Computers / Security / General, Mathematics / Applied, Mathematics / Game Theory, Mathematics / General}, isbn = {9783642252792}, author = {Baras,John S and Katz, Jonathan and Altman,Eitan} } @article {19656, title = {Direct targeting of Sec23a by miR-200s influences cancer cell secretome and promotes metastatic colonization}, journal = {Nature Medicine}, volume = {17}, year = {2011}, month = {2011/09//}, pages = {1101 - 1108}, abstract = {Although the role of miR-200s in regulating E-cadherin expression and epithelial-to-mesenchymal transition is well established, their influence on metastatic colonization remains controversial. Here we have used clinical and experimental models of breast cancer metastasis to discover a pro-metastatic role of miR-200s that goes beyond their regulation of E-cadherin and epithelial phenotype. Overexpression of miR-200s is associated with increased risk of metastasis in breast cancer and promotes metastatic colonization in mouse models, phenotypes that cannot be recapitulated by E-cadherin expression alone. Genomic and proteomic analyses revealed global shifts in gene expression upon miR-200 overexpression toward that of highly metastatic cells. miR-200s promote metastatic colonization partly through direct targeting of Sec23a, which mediates secretion of metastasis-suppressive proteins, including Igfbp4 and Tinagl1, as validated by functional and clinical correlation studies. Overall, these findings suggest a pleiotropic role of miR-200s in promoting metastatic colonization by influencing E-cadherin{\textendash}dependent epithelial traits and Sec23a-mediated tumor cell secretome.View full text }, isbn = {1078-8956}, url = {http://www.nature.com/nm/journal/v17/n9/abs/nm.2401.html}, author = {Korpal, Manav and Ell, Brian J. and Buffa, Francesca M. and Ibrahim, Toni and Blanco, Mario A. and Celi{\`a}-Terrassa, Toni and Mercatali, Laura and Zia Khan and Goodarzi, Hani and Hua, Yuling and Wei, Yong and Hu, Guohong and Garcia, Benjamin A. and Ragoussis, Jiannis and Amadori, Dino and Harris, Adrian L. and Kang, Yibin} } @conference {13541, title = {Document Image Classification and Labeling using Multiple Instance Learning}, booktitle = {Intl. Conf. on Document Analysis and Recognition (ICDAR 11)}, year = {2011}, month = {2011///}, pages = {1059 - 1063}, abstract = {The labeling of large sets of images for training or testing analysis systems can be a very costly and time-consuming process. Multiple instance learning (MIL) is a generalization of traditional supervised learning which relaxes the need for exact labels on training instances. Instead, the labels are required only for a set of instances known as bags. In this paper, we apply MIL to the retrieval and localization of signatures and the retrieval of images containing machine-printed text, and show that a gain of 15-20\% in performance can be achieved over the supervised learning with weak-labeling. We also compare our approach to supervised learning with fully annotated training data and report a competitive accuracy for MIL. Using our experiments on real-world datasets, we show that MIL is a good alternative when the training data has only document-level annotation.}, author = {Kumar,Jayant and Pillai,Jaishanker and David Doermann} } @article {19257, title = {The DSPCAD Lightweight Dataflow Environment: Introduction to LIDE Version 0.1}, year = {2011}, month = {2011}, abstract = {LIDE (the DSPCAD Lightweight Dataflow Environment) is a flexible,lightweight design environment that allows designers to experiment with dataflow-based approaches for design and implementation of digital signal processing (DSP) systems. LIDE contains libraries of dataflow graph elements (primitive actors, hierarchical actors, and edges) and utilities that assist designers in modeling, simulating, and implementing DSP systems using formal dataflow techniques. The libraries of dataflow graph elements (mainly actors) contained in LIDE provide useful building blocks that can be used to construct signal processing applications, and that can be used as examples that designers can adapt to create their own, customized LIDE actors. Furthermore, by using LIDE along with the DSPCAD Integrative Command Line Environment (DICE), designers can efficiently create and execute unit tests for user-designed actors. This report provides an introduction to LIDE. The report includes details on the process for setting up the LIDE environment, and covers methods for using pre-designed libraries of graph elements, as well as creating user-designed libraries and associated utilities using the C language. The report also gives an introduction to the C language plug-in for dicelang. This plug-in, called dicelang-C, provides features for efficient C-based project development and maintenance that are useful to apply when working with LIDE. }, keywords = {Technical Report}, isbn = {UMIACS-TR-2011-17}, doi = {Technical Report}, url = {http://drum.lib.umd.edu//handle/1903/12147}, author = {Chung-Ching Shen and Wang, Lai-Huei and Cho, Inkeun and Kim, Scott and Won, Stephen and Plishker,William and Bhattacharyya, Shuvra S.} } @article {15130, title = {Efficient privacy-preserving biometric identification}, journal = {Network and Distributed System Security Symposium}, year = {2011}, month = {2011///}, abstract = {We present an efficient matching protocol that can be usedin many privacy-preserving biometric identification systems in the semi-honest setting. Our most general technical con- tribution is a new backtracking protocol that uses the by- product of evaluating a garbled circuit to enable efficient oblivious information retrieval. We also present a more ef- ficient protocol for computing the Euclidean distances of vectors, and optimized circuits for finding the closest match between a point held by one party and a set of points held by another. We evaluate our protocols by implementing a practical privacy-preserving fingerprint matching system. }, author = {Huang,Y. and Malka,L. and Evans,D. and Katz, Jonathan} } @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 {15263, title = {Energy efficient monitoring in sensor networks}, journal = {Algorithmica}, volume = {59}, year = {2011}, month = {2011///}, pages = {94 - 114}, abstract = {We study a set of problems related to efficient battery energy utilization for monitoring applications in a wireless sensor network with the goal to increase the sensor network lifetime. We study several generalizations of a basic problem called Set k-Cover. The problem can be described as follows: we are given a set of sensors, and a set of targets to be monitored. Each target can be monitored by a subset of the sensors. To increase the lifetime of the sensor network, we would like to partition the sensors into k sets (or time-slots), and activate each set of sensors in a different time-slot, thus extending the battery life of the sensors by a factor of k. The goal is to find a partitioning that maximizes the total coverage of the targets for a given k. This problem is known to be NP-hard. We develop an improved approximation algorithm for this problem using a reduction to Max k-Cut. Moreover, we are able to demonstrate that this algorithm is efficient, and yields almost optimal solutions in practice.We also consider generalizations of this problem in several different directions. First, we allow each sensor to be active in α different sets (time-slots). This means that the battery life is extended by a factor of k, and allows for a richer space of solutions. We also consider different coverage requirements, such as requiring that all targets, or at least a certain number of targets, be covered in each time slot. In the Set k-Cover formulation, there is no requirement that a target be monitored at all, or in any number of time slots. We develop a randomized rounding algorithm for this problem. We also consider extensions where each sensor can monitor only a bounded number of targets in any time-slot, and not all the targets adjacent to it. This kind of problem may arise when a sensor has a directional camera, or some other physical constraint might prevent it from monitoring all adjacent targets even when it is active. We develop the first approximation algorithms for this problem. }, doi = {10.1007/s00453-010-9407-z}, author = {Deshpande, Amol and Khuller, Samir and Malekian,A. and Toossi,M.} } @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} } @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} } @article {18526, title = {The Evolution of Network Configuration: A Tale of Two Campuses}, journal = {Networks}, volume = {7}, year = {2011}, month = {2011///}, pages = {18 - 18}, abstract = {Studying network configuration evolution can improve our under- standing of the evolving complexity of networks and can be helpful in making network configuration less error-prone. Unfortunately, the nature of changes that operators make to network configuration is poorly understood. Towards improving our understanding, we examine and analyze five years of router, switch, and firewall con- figurations from two large campus networks using the logs from version control systems used to store the configurations. We study how network configuration is distributed across different network operations tasks and how the configuration for each task evolves over time, for different types of devices and for different loca- tions in the network. To understand the trends of how configura- tion evolves over time, we study the extent to which configuration for various tasks are added, modified, or deleted. We also study whether certain devices experience configuration changes more fre- quently than others, as well as whether configuration changes tend to focus on specific portions of the configuration (or on specific tasks). We also investigate when network operators make configu- ration changes of various types. Our results concerning configura- tion changes can help the designers of configuration languages un- derstand which aspects of configuration might be more automated or tested more rigorously and may ultimately help improve config- uration languages.}, author = {Kim,H. and Benson,T. and Akella,A. and Feamster, Nick} } @article {15265, title = {Extracting Between-Pathway Models from E-MAP Interactions Using Expected Graph Compression}, journal = {Journal of Computational Biology}, volume = {18}, year = {2011}, month = {2011///}, pages = {379 - 390}, author = {Kelley,D. R and Kingsford, Carl} } @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} } @conference {13554, title = {Fast Rule-line Removal using Integral Images and Support Vector Machines}, booktitle = {Intl. Conf. on Document Analysis and Recognition (ICDAR 11)}, year = {2011}, month = {2011///}, pages = {584 - 588}, abstract = {In this paper, we present a fast and effective method for removing pre-printed rule-lines in handwritten document images. We use an integral-image representation which allows fast computation of features and apply techniques for large scale Support Vector learning using a data selection strategy to sample a small subset of training data. Results on both constructed and real-world data sets show that the method is effective for rule-line removal. We compare our method to a subspace-based method and show that better accuracy can be achieved in considerably less time. The integral-image based features proposed in the paper are generic and can be applied to other problems as well.}, author = {Kumar,Jayant and David Doermann} } @article {15184, title = {Faster secure two-party computation using garbled circuits}, journal = {USENIX Security Symposium}, year = {2011}, month = {2011///}, abstract = {Secure two-party computation enables two parties toevaluate a function cooperatively without revealing to ei- ther party anything beyond the function{\textquoteright}s output. The garbled-circuit technique, a generic approach to secure two-party computation for semi-honest participants, was developed by Yao in the 1980s, but has been viewed as being of limited practical significance due to its in- efficiency. We demonstrate several techniques for im- proving the running time and memory requirements of the garbled-circuit technique, resulting in an implemen- tation of generic secure two-party computation that is significantly faster than any previously reported while also scaling to arbitrarily large circuits. We validate our approach by demonstrating secure computation of cir- cuits with over 109 gates at a rate of roughly 10 {\textmu}s per garbled gate, and showing order-of-magnitude improve- ments over the best previous privacy-preserving proto- cols for computing Hamming distance, Levenshtein dis- tance, Smith-Waterman genome alignment, and AES. }, author = {Huang,Y. and Evans,D. and Katz, Jonathan and Malka,L.} } @book {15187, title = {GameSec{\textquoteright}11: Proceedings of the Second international conference on Decision and Game Theory for Security}, year = {2011}, month = {2011///}, publisher = {Springer-Verlag}, organization = {Springer-Verlag}, address = {Berlin, Heidelberg}, isbn = {978-3-642-25279-2}, editor = {Baras,John S and Katz, Jonathan and Altman,Eitan} } @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} } @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 {13003, title = {Increased gene sampling provides stronger support for higher-level groups within gracillariid leaf mining moths and relatives (Lepidoptera: Gracillariidae)}, journal = {BMC Evol Biol}, volume = {11:182}, year = {2011}, month = {2011///}, author = {Kawahara,A. Y and Ohshima,I and Kawakita,A and Regier,J. C and Mitter,C and Cummings, Michael P. and Davis,DR and Wagner,DL and De Prinis,J and Lopez-Vaamonde,C} } @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.} } @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} } @article {15174, title = {Limits of computational differential privacy in the client/server setting}, journal = {Theory of Cryptography}, year = {2011}, month = {2011///}, pages = {417 - 431}, abstract = {Differential privacy is a well established definition guaranteeing that queries to a database do not reveal {\textquotedblleft}too much{\textquotedblright} information about specific individuals who have contributed to the database. The standard definition of differential privacy is information theoretic in nature, but it is natural to consider computational relaxations and to explore what can be achieved with respect to such notions. Mironov et al. (Crypto 2009) and McGregor et al. (FOCS 2010) recently introduced and studied several variants of computational differential privacy, and show that in the two-party setting (where data is split between two parties) these relaxations can offer significant advantages.Left open by prior work was the extent, if any, to which computational differential privacy can help in the usual client/server setting where the entire database resides at the server, and the client poses queries on this data. We show, for queries with output in ℝ n (for constant n) and with respect to a large class of utilities, that any computationally private mechanism can be converted to a statistically private mechanism that is equally efficient and achieves roughly the same utility. }, doi = {10.1007/978-3-642-19571-6_25}, author = {Groce,A. and Katz, Jonathan and Yerukhimovich,A.} } @article {15167, title = {Limits on the power of zero-knowledge proofs in cryptographic constructions}, journal = {Theory of Cryptography}, year = {2011}, month = {2011///}, pages = {559 - 578}, abstract = {For over 20 years, black-box impossibility results have been used to argue the infeasibility of constructing certain cryptographic primitives (e.g., key agreement) from others (e.g., one-way functions). A widely recognized limitation of such impossibility results, however, is that they say nothing about the usefulness of (known) nonblack-box techniques. This is unsatisfying, as we would at least like to rule out constructions using the set of techniques we have at our disposal.With this motivation in mind, we suggest a new framework for black-box constructions that encompasses constructions with a nonblack-box flavor: specifically, those that rely on zero-knowledge proofs relative to some oracle. We show that our framework is powerful enough to capture the Naor-Yung/Sahai paradigm for building a (shielding) CCA-secure public-key encryption scheme from a CPA-secure one, something ruled out by prior black-box separation results. On the other hand, we show that several black-box impossibility results still hold even in a setting that allows for zero-knowledge proofs. }, doi = {10.1007/978-3-642-19571-6_34}, author = {Brakerski,Z. and Katz, Jonathan and Segev,G. and Yerukhimovich,A.} } @conference {14830, title = {Localizing parts of faces using a consensus of exemplars}, booktitle = {Computer Vision and Pattern Recognition (CVPR), 2011 IEEE Conference on}, year = {2011}, month = {2011/06//}, pages = {545 - 552}, abstract = {We present a novel approach to localizing parts in images of human faces. The approach combines the output of local detectors with a non-parametric set of global models for the part locations based on over one thousand hand-labeled exemplar images. By assuming that the global models generate the part locations as hidden variables, we derive a Bayesian objective function. This function is optimized using a consensus of models for these hidden variables. The resulting localizer handles a much wider range of expression, pose, lighting and occlusion than prior ones. We show excellent performance on a new dataset gathered from the internet and show that our localizer achieves state-of-the-art performance on the less challenging BioID dataset.}, keywords = {Bayesian, faces;lighting;occlusion;pose;Bayes, function;exemplar, images;expression;face, localization;human, methods;face, objective, part, recognition;}, doi = {10.1109/CVPR.2011.5995602}, author = {Belhumeur,P. N. and Jacobs, David W. and Kriegman, D.J. and Kumar,N.} } @article {19276, title = {Model-based precision analysis and optimization for digital signal processors}, journal = {Proceedings of the European Signal Processing Conference}, year = {2011}, month = {2011}, pages = {506 - 510}, abstract = {Embedded signal processing has witnessed explosive growth in re-cent years in both scientific and consumer applications, driving the need for complex, high-performance signal processing systems that are largely application driven. In order to efficiently implement these systems on programmable platforms such as digital signal processors (DSPs), it is important to analyze and optimize the ap- plication design from early stages of the design process. A key per- formance concern for designers is choosing the data format. In this work, we propose a systematic and efficient design flow involving model-based design to analyze application data sets and precision requirements. We demonstrate this design flow with an exploration study into the required precision for eigenvalue decomposition (EVD) using the Jacobi algorithm. We demonstrate that with a high degree of structured analysis and automation, we are able to analyze the data set to derive an efficient data format, and optimize important parts of the algorithm with respect to precision. }, author = {Kedilaya, Soujanya and Plishker,William and Purkovic, Aleksandar and Johnson, Brian and Bhattacharyya, Shuvra S.} } @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 {16489, title = {New models and algorithms for throughput maximization in broadcast scheduling}, journal = {Approximation and Online Algorithms}, year = {2011}, month = {2011///}, pages = {71 - 82}, author = {Chekuri,C. and Gal,A. and Im,S. and Khuller, Samir and Li,J. and McCutchen,R. and Moseley,B. and Raschid, Louiqa} } @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} } @conference {14994, title = {NSF/IEEE-TCPP curriculum initiative on parallel and distributed computing: core topics for undergraduates}, booktitle = {Proceedings of the 42nd ACM technical symposium on Computer science education}, year = {2011}, month = {2011///}, pages = {617 - 618}, author = {Prasad,S. K. and Chtchelkanova,A. and Das,S. and Dehne,F. and Gouda,M. and Gupta,A. and JaJa, Joseph F. and Kant,K. and La Salle,A. and LeBlanc,R. and others} } @article {13083, title = {Object Detection and Tracking for Intelligent Video Surveillance}, journal = {Multimedia Analysis, Processing and Communications}, year = {2011}, month = {2011///}, pages = {265 - 288}, 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 = {Kim,K. and Davis, Larry S.} } @article {15069, title = {Private Set Intersection: Are Garbled Circuits Better than Custom Protocols?}, journal = {19th Network and Distributed Security Symposium}, year = {2011}, month = {2011///}, abstract = {Cryptographic protocols for Private Set Intersection (PSI)are the basis for many important privacy-preserving ap- plications. Over the past few years, intensive research has been devoted to designing custom protocols for PSI based on homomorphic encryption and other public-key tech- niques, apparently due to the belief that solutions using generic approaches would be impractical. This paper ex- plores the validity of that belief. We develop three classes of protocols targeted to different set sizes and domains, all based on Yao{\textquoteright}s generic garbled-circuit method. We then compare the performance of our protocols to the fastest custom PSI protocols in the literature. Our results show that a careful application of garbled circuits leads to solu- tions that can run on million-element sets on typical desk- tops, and that can be competitive with the fastest custom protocols. Moreover, generic protocols like ours can be used directly for performing more complex secure com- putations, something we demonstrate by adding a simple information-auditing mechanism to our PSI protocols. }, author = {Huang,Y. and Evans,D. and Katz, Jonathan} } @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} } @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 {16033, title = {Research Directions in Data Wrangling: Visualizations and Transformations for Usable and Credible Data}, journal = {Information VisualizationInformation Visualization}, volume = {10}, year = {2011}, month = {2011/10/01/}, pages = {271 - 288}, abstract = {In spite of advances in technologies for working with data, analysts still spend an inordinate amount of time diagnosing data quality issues and manipulating data into a usable form. This process of {\textquoteleft}data wrangling{\textquoteright} often constitutes the most tedious and time-consuming aspect of analysis. Though data cleaning and integration arelongstanding issues in the database community, relatively little research has explored how interactive visualization can advance the state of the art. In this article, we review the challenges and opportunities associated with addressing data quality issues. We argue that analysts might more effectively wrangle data through new interactive systems that integrate data verification, transformation, and visualization. We identify a number of outstanding research questions, including how appropriate visual encodings can facilitate apprehension of missing data, discrepant values, and uncertainty; how interactive visualizations might facilitate data transform specification; and how recorded provenance and social interaction might enable wider reuse, verification, and modification of data transformations.}, keywords = {data cleaning, data quality, data transformation, Uncertainty, Visualization}, isbn = {1473-8716, 1473-8724}, doi = {10.1177/1473871611415994}, url = {http://ivi.sagepub.com/content/10/4/271}, author = {Kandel,Sean and Heer,Jeffrey and Plaisant, Catherine and Kennedy,Jessie and Van Ham,Frank and Riche,Nathalie Henry and Weaver,Chris and Lee,Bongshin and Brodbeck,Dominique and Buono,Paolo} } @article {15178, title = {Round-optimal password-based authenticated key exchange}, journal = {Theory of Cryptography}, year = {2011}, month = {2011///}, pages = {293 - 310}, abstract = {We show a general framework for constructing password-based authenticated key exchange protocols with optimal round complexity {\textemdash} one message per party, sent simultaneously {\textemdash} in the standard model, assuming a common reference string. When our framework is instantiated using bilinear-map cryptosystems, the resulting protocol is also (reasonably) efficient. Somewhat surprisingly, our framework can be adapted to give protocols in the standard model that are universally composable while still using only one (simultaneous) round.}, doi = {10.1007/978-3-642-19571-6_18}, author = {Katz, Jonathan and Vaikuntanathan,V.} } @article {15190, title = {Secure computation with sublinear amortized work}, year = {2011}, month = {2011///}, institution = {Cryptology ePrint Archive, Report 2011/482}, abstract = {Traditional approaches to secure computation begin by representing the function f beingcomputed as a circuit. For any function f that depends on each of its inputs, this implies a protocol with complexity at least linear in the input size. In fact, linear running time is inherent for secure computation of non-trivial functions, since each party must {\textquotedblleft}touch{\textquotedblright} every bit of their input lest information about other party{\textquoteright}s input be leaked. This seems to rule out many interesting applications of secure computation in scenarios where at least one of the inputs is huge and sublinear-time algorithms can be utilized in the insecure setting; private database search is a prime example. We present an approach to secure two-party computation that yields sublinear-time proto- cols, in an amortized sense, for functions that can be computed in sublinear time on a random access machine (RAM). Furthermore, a party whose input is {\textquotedblleft}small{\textquotedblright} is required to maintain only small state. We provide a generic protocol that achieves the claimed complexity, based on any oblivious RAM and any protocol for secure two-party computation. We then present an optimized version of this protocol, where generic secure two-party computation is used only for evaluating a small number of simple operations. }, author = {Gordon,D. and Katz, Jonathan and Kolesnikov,V. and Malkin,T. and Raykova,M. and Vahlis,Y.} } @conference {13642, title = {Segmentation of Handwritten Textlines in Presence of Touching Components}, booktitle = {Intl. Conf. on Document Analysis and Recognition (ICDAR 11)}, year = {2011}, month = {2011///}, pages = {109 - 113}, abstract = {This paper presents an approach to textline extraction in handwritten document images which combines local and global techniques. We propose a graph-based technique to detect touching and proximity errors that are common with handwritten text lines. In a refinement step, we use Expectation-Maximization (EM) to iteratively split the error segments to obtain correct text-lines. We show improvement in accuracies using our correction method on datasets of Arabic document images. Results on a set of artificially generated proximity images show that the method is effective for handling touching errors in handwritten document images.}, author = {Kumar,Jayant and Kang,Le and David Doermann and Abd-Almageed, Wael} } @conference {13403, title = {Sensitivity analysis and explanations for robust query evaluation in probabilistic databases}, booktitle = {Proceedings of the 2011 international conference on Management of data}, year = {2011}, month = {2011///}, pages = {841 - 852}, abstract = {Probabilistic database systems have successfully established them-selves as a tool for managing uncertain data. However, much of the research in this area has focused on efficient query evaluation and has largely ignored two key issues that commonly arise in uncer- tain data management: First, how to provide explanations for query results, e.g., {\textquotedblleft}Why is this tuple in my result?{\textquotedblright} or {\textquotedblleft}Why does this output tuple have such high probability?{\textquotedblright}. Second, the problem of determining the sensitive input tuples for the given query, e.g., users are interested to know the input tuples that can substantially alter the output, when their probabilities are modified (since they may be unsure about the input probability values). Existing systems pro- vide the lineage/provenance of each of the output tuples in addition to the output probabilities, which is a boolean formula indicating the dependence of the output tuple on the input tuples. However, lineage does not immediately provide a quantitative relationship and it is not informative when we have multiple output tuples. In this paper, we propose a unified framework that can handle both the issues mentioned above to facilitate robust query processing. We formally define the notions of influence and explanations and provide algorithms to determine the top-l influential set of variables and the top-l set of explanations for a variety of queries, including conjunctive queries, probabilistic threshold queries, top-k queries and aggregation queries. Further, our framework naturally enables highly efficient incremental evaluation when input probabilities are modified (e.g., if uncertainty is resolved). Our preliminary exper- imental results demonstrate the benefits of our framework for per- forming robust query processing over probabilistic databases. }, author = {Kanagal,B. and Li,J. and Deshpande, Amol} } @conference {13643, title = {Shape Codebook based Handwritten and Machine Printed Text Zone Extraction}, booktitle = {Document Recognition and Retrieval}, year = {2011}, month = {2011/01//}, pages = {7874:1-8 - 7874:1-8}, address = {San Francisco}, abstract = {We present a novel method for extracting handwritten and printed text zones from noisy document images with mixed content. We use Triple-Adjacent-Segment (TAS) based features which encode local shape characteristics of text in a consistent manner. We first construct two different codebooks of the shape features extracted from a set of handwritten and printed text documents. In the next step, we compute the normalized histogram of codewords for each segmented zone and use it to train Support Vector Machine (SVM) classifier. Due to a codebook based approach, our method is robust to the background noise present in the image. The TAS features used are invariant to translation, scale and rotation of text. In our experimental results, we show that a pixel-weighted zone classification accuracy of 98\% can be achieved for noisy Arabic documents. Further, we demonstrate the effectiveness of our method for document page classification and show that a high precision can be achieved for machine printed documents. The proposed method is robust to the size of zones, which may contain text content at word, line or paragraph level.}, author = {Kumar,Jayant and Prasad,Rohit and Cao,Huiagu and Abd-Almageed, Wael and David Doermann and Natarajan,Prem} } @inbook {17378, title = {Speeding Up Network Layout and Centrality Measures for Social Computing Goals}, booktitle = {Social Computing, Behavioral-Cultural Modeling and PredictionSocial Computing, Behavioral-Cultural Modeling and Prediction}, series = {Lecture Notes in Computer Science}, volume = {6589}, year = {2011}, month = {2011///}, pages = {244 - 251}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {This paper presents strategies for speeding up calculation of graph metrics and layout by exploiting the parallel architecture of modern day Graphics Processing Units (GPU), specifically Compute Unified Device Architecture ( CUDA ) by Nvidia . Graph centrality metrics like Eigenvector , Betweenness , Page Rank and layout algorithms like Fruchterman - Rheingold are essential components of Social Network Analysis ( SNA ). With the growth in adoption of SNA in different domains and increasing availability of huge networked datasets for analysis, social network analysts require faster tools that are also scalable. Our results, using NodeXL, show up to 802 times speedup for a Fruchterman-Rheingold graph layout and up to 17,972 times speedup for Eigenvector centrality metric calculations on a 240 core CUDA-capable GPU.}, isbn = {978-3-642-19655-3}, url = {http://dx.doi.org/10.1007/978-3-642-19656-0_35}, author = {Sharma,Puneet and Khurana,Udayan and Shneiderman, Ben and Scharrenbroich,Max and Locke,John}, editor = {Salerno,John and Yang,Shanchieh and Nau, Dana S. and Chai,Sun-Ki} } @article {12860, title = {Temperature regulation of virulence factors in the pathogen Vibrio coralliilyticus}, journal = {The ISME Journal}, volume = {6}, year = {2011}, month = {2011/12/08/}, pages = {835 - 846}, abstract = {Sea surface temperatures (SST) are rising because of global climate change. As a result, pathogenic Vibrio species that infect humans and marine organisms during warmer summer months are of growing concern. Coral reefs, in particular, are already experiencing unprecedented degradation worldwide due in part to infectious disease outbreaks and bleaching episodes that are exacerbated by increasing SST. For example, Vibrio coralliilyticus, a globally distributed bacterium associated with multiple coral diseases, infects corals at temperatures above 27 {\textdegree}C. The mechanisms underlying this temperature-dependent pathogenicity, however, are unknown. In this study, we identify potential virulence mechanisms using whole genome sequencing of V. coralliilyticus ATCC (American Type Culture Collection) BAA-450. Furthermore, we demonstrate direct temperature regulation of numerous virulence factors using proteomic analysis and bioassays. Virulence factors involved in motility, host degradation, secretion, antimicrobial resistance and transcriptional regulation are upregulated at the higher virulent temperature of 27 {\textdegree}C, concurrent with phenotypic changes in motility, antibiotic resistance, hemolysis, cytotoxicity and bioluminescence. These results provide evidence that temperature regulates multiple virulence mechanisms in V. coralliilyticus, independent of abundance. The ecological and biological significance of this temperature-dependent virulence response is reinforced by climate change models that predict tropical SST to consistently exceed 27 {\textdegree}C during the spring, summer and fall seasons. We propose V. coralliilyticus as a model Gram-negative bacterium to study temperature-dependent pathogenicity in Vibrio-related diseases.}, keywords = {ecophysiology, ecosystems, environmental biotechnology, geomicrobiology, ISME J, microbe interactions, microbial communities, microbial ecology, microbial engineering, microbial epidemiology, microbial genomics, microorganisms}, isbn = {1751-7362}, doi = {10.1038/ismej.2011.154}, url = {http://www.nature.com/ismej/journal/v6/n4/full/ismej2011154a.html}, author = {Kimes,Nikole E. and Grim,Christopher J. and Johnson,Wesley R. and Hasan,Nur A. and Tall,Ben D. and Kothary,Mahendra H. and Kiss,Hajnalka and Munk,A. Christine and Tapia,Roxanne and Green,Lance and Detter,Chris and Bruce,David C. and Brettin,Thomas S. and Rita R Colwell and Morris,Pamela J.} } @conference {13659, title = {Template based Segmentation of Touching Components in Handwritten Text Lines}, booktitle = {11th Intl. Conf. on Document Analysis and Recognition (ICDAR{\textquoteright}11)}, year = {2011}, month = {2011///}, pages = {569 - 573}, abstract = {In this paper, we present a template based approach to the segmentation of touching components in handwritten text lines. Local patches around touching components are identified and a dictionary is created consisting of template patches together with correct segmentations. We use two shape context based methods to compute similarity between input patches and dictionary templates to find the best match. The template{\textquoteright}s known segmentation is then transformed to segment the input patch. Experiments are carried on a dataset of touching text lines.}, author = {Kang,Le and David Doermann} } @conference {17979, title = {Toolchain for Programming, Simulating and Studying the XMT Many-Core Architecture}, booktitle = {Parallel and Distributed Processing Workshops and Phd Forum (IPDPSW), 2011 IEEE International Symposium on}, year = {2011}, month = {2011/05//}, pages = {1282 - 1291}, abstract = {The Explicit Multi-Threading (XMT) is a general-purpose many-core computing platform, with the vision of a 1000-core chip that is easy to program but does not compromise on performance. This paper presents a publicly available tool chain for XMT, complete with a highly configurable cycle-accurate simulator and an optimizing compiler. The XMT tool chain has matured and has been validated to a point where its description merits publication. In particular, research and experimentation enabled by the tool chain played a central role in supporting the ease-of-programming and performance aspects of the XMT architecture. The compiler and the simulator are also important milestones for an efficient programmer{\textquoteright}s workflow from PRAM algorithms to programs that run on the shared memory XMT hardware. This workflow is a key component in accomplishing the dual goal of ease-of-programming and performance. The applicability of our tool chain extends beyond specific XMT choices. It can be used to explore the much greater design space of shared memory many-cores by system researchers or by programmers. As the tool chain can practically run on any computer, it provides a supportive environment for teaching parallel algorithmic thinking with a programming component. Unobstructed by techniques such as decomposition-first and programming for locality, this environment may be useful in deferring the teaching of these techniques, when desired, to more advanced or platform-specific courses.}, keywords = {algorithm;XMT, architecture;XMT, architectures;shared, chain;cycle-accurate, compiler;programmer, compilers;parallel, component;shared, computing;optimizing, hardware;shared, many-core, many-core;concurrency, memory, multithreading;general-purpose, PRAM, simulator;ease-of-programming;explicit, systems;, theory;multi-threading;optimising, tool, workflow;programming, XMT}, doi = {10.1109/IPDPS.2011.270}, author = {Keceli,F. and Tzannes,A. and Caragea,G.C. and Barua,R. and Vishkin, Uzi} } @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 {18810, title = {A Two Degree of Freedom Nanopositioner With Electrothermal Actuator for Decoupled Motion}, year = {2011}, month = {2011///}, pages = {447 - 457}, publisher = {ASME}, organization = {ASME}, abstract = {Building a two degree-of-freedom (2 DOF) MEMS nanopositioner with decoupled X-Y motion has been a challenge in nanopositioner design. In this paper a novel design concept on making the decoupled motion of the MEMS nanopositioner is suggested. The suggested nanopositioner has two electrothermal actuators and employs a fully nested motion platform with suspended anchors. The suggested MEMS nanopositioner is capable of delivering displacement from the electrothermal actuator to the motion platform without coupled motion between the two X-Y axes. The design concept, finite element analysis (FEA) results, fabrication procedures and the performance of the 2 DOF nanopositioner is presented. In order to test the nanopositioner moving platform decoupled motion, one actuator moves the platform by 60 {\textmu}m, while the other actuator is kept at the same position. The platform position cross talk error was measured to be less than 1 {\textmu}m standard deviation.}, isbn = {978-0-7918-5484-6}, doi = {10.1115/DETC2011-48619}, url = {http://link.aip.org/link/ASMECP/v2011/i54846/p447/s1\&Agg=doi}, author = {Kim,Yong-Sik and Dagalakis,Nicholas G. and Gupta, Satyandra K.} } @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 {15193, title = {Universally composable synchronous computation}, year = {2011}, month = {2011///}, institution = {Cryptology ePrint Archive, Report 2011/310, 2011. http://eprint. iacr. org}, abstract = {In synchronous networks, protocols can achieve security guarantees that are not possible in an asynchronousworld: i.e., they can simultaneously achieve input completeness (all honest parties{\textquoteright} inputs are included in the computation) and guaranteed termination (honest parties do not {\textquotedblleft}hang{\textquotedblright} indefinitely). In practice truly syn- chronous networks rarely exist, but synchrony can be emulated if channels have (known) latency and parties have loosely synchronized clocks. The framework of universal composability (UC) is inherently asynchronous, but several approaches for adding synchrony to the framework have been proposed. However, we show that the existing proposals do not provide the expected guarantees. Given this, we propose a {\textquotedblleft}clean slate{\textquotedblright} approach to defining synchrony in the UC framework by introducing functionalities exactly meant to model, respectively, bounded-delay networks and loosely synchronized clocks. We show that the expected guarantees of synchronous computation can be realized given these functionalities, and that previous models can all be expressed within our new framework. }, author = {Katz, Jonathan and Maurer,U. and Tackmann,B. and Zikas,V.} } @conference {19259, title = {Vectorization and mapping of software defined radio applications on heterogeneous multi-processor platforms}, booktitle = {2011 IEEE Workshop on Signal Processing Systems (SiPS)}, year = {2011}, month = {2011}, pages = {31 - 36}, abstract = {A variety of multiprocessor architectures have proliferated even for off-the-shelf computing platforms. To improve performance and productivity for common heterogeneous systems, we have developed a workflow to generate efficient solutions. By starting with a formal description of an application and the mapping problem we are able to generate a range of designs that efficiently trade-of latency and throughput. In this approach, efficient utilization of SIMD cores is achieved by applying extensive block processing in conjunction with efficient mapping and scheduling. We demonstrate our approach through an integration into the GNU Radio environment for software defined radio system design.}, keywords = {Benchmark testing, block processing, Design methodology, formal description, GNU radio environment, Graphic Processor Unit, Graphics processing unit, heterogeneous multiprocessor platform, mapping problem, Multicore processing, Multiprocessing systems, multiprocessor architecture, multiprocessor scheduling, operating systems (computers), PARALLEL PROCESSING, Processor scheduling, Schedules, SIMD core, Software Defined Radio, software defined radio system design, software radio, telecommunication computing, Throughput, vectorization, workflow}, author = {Zaki, G.F. and Plishker,W. and Bhattacharyya, Shuvra S. and Clancy, C. and Kuykendall, J.} } @article {13076, title = {Vehicle Detection Using Partial Least Squares}, journal = {Pattern Analysis and Machine Intelligence, IEEE Transactions on}, volume = {33}, year = {2011}, month = {2011/06//}, pages = {1250 - 1265}, abstract = {Detecting vehicles in aerial images has a wide range of applications, from urban planning to visual surveillance. We describe a vehicle detector that improves upon previous approaches by incorporating a very large and rich set of image descriptors. A new feature set called Color Probability Maps is used to capture the color statistics of vehicles and their surroundings, along with the Histograms of Oriented Gradients feature and a simple yet powerful image descriptor that captures the structural characteristics of objects named Pairs of Pixels. The combination of these features leads to an extremely high-dimensional feature set (approximately 70,000 elements). Partial Least Squares is first used to project the data onto a much lower dimensional subspace. Then, a powerful feature selection analysis is employed to improve the performance while vastly reducing the number of features that must be calculated. We compare our system to previous approaches on two challenging data sets and show superior performance.}, keywords = {aerial images;color probability maps;oriented gradients feature;partial least squares;powerful feature selection analysis;urban planning;vehicle detection;visual surveillance;gradient methods;image colour analysis;least squares approximations;road vehicle, Automated;}, isbn = {0162-8828}, doi = {10.1109/TPAMI.2010.182}, author = {Kembhavi,A. and Harwood,D. and Davis, Larry S.} } @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} } @conference {18614, title = {Wide-area routing dynamics of malicious networks}, booktitle = {Proceedings of the ACM SIGCOMM 2011 conference}, series = {SIGCOMM {\textquoteright}11}, year = {2011}, month = {2011///}, pages = {432 - 433}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {This paper studies the routing dynamics of malicious networks. We characterize the routing behavior of malicious networks on both short and long timescales. We find that malicious networks more consistently advertise prefixes with short durations and long inter- arrival times; over longer timescales, we find that malicious ASes connect with more upstream providers than legitimate ASes, and they also change upstream providers more frequently.}, keywords = {BGP, Security, spam}, isbn = {978-1-4503-0797-0}, doi = {10.1145/2018436.2018505}, url = {http://doi.acm.org/10.1145/2018436.2018505}, author = {Konte,Maria and Feamster, Nick} } @article {15262, title = {Achieving anonymity via clustering}, journal = {ACM Trans. Algorithms}, volume = {6}, year = {2010}, month = {2010/07//}, pages = {49:1{\textendash}49:19 - 49:1{\textendash}49:19}, abstract = {Publishing data for analysis from a table containing personal records, while maintaining individual privacy, is a problem of increasing importance today. The traditional approach of deidentifying records is to remove identifying fields such as social security number, name, etc. However, recent research has shown that a large fraction of the U.S. population can be identified using nonkey attributes (called quasi-identifiers) such as date of birth, gender, and zip code. The k-anonymity model protects privacy via requiring that nonkey attributes that leak information are suppressed or generalized so that, for every record in the modified table, there are at least k-1 other records having exactly the same values for quasi-identifiers. We propose a new method for anonymizing data records, where quasi-identifiers of data records are first clustered and then cluster centers are published. To ensure privacy of the data records, we impose the constraint that each cluster must contain no fewer than a prespecified number of data records. This technique is more general since we have a much larger choice for cluster centers than k-anonymity. In many cases, it lets us release a lot more information without compromising privacy. We also provide constant factor approximation algorithms to come up with such a clustering. This is the first set of algorithms for the anonymization problem where the performance is independent of the anonymity parameter k. We further observe that a few outlier points can significantly increase the cost of anonymization. Hence, we extend our algorithms to allow an ε fraction of points to remain unclustered, that is, deleted from the anonymized publication. Thus, by not releasing a small fraction of the database records, we can ensure that the data published for analysis has less distortion and hence is more useful. Our approximation algorithms for new clustering objectives are of independent interest and could be applicable in other clustering scenarios as well.}, keywords = {anonymity, Approximation algorithms, clustering, privacy}, isbn = {1549-6325}, doi = {10.1145/1798596.1798602}, url = {http://doi.acm.org/10.1145/1798596.1798602}, author = {Aggarwal,Gagan and Panigrahy,Rina and Feder,Tom{\'a}s and Thomas,Dilys and Kenthapadi,Krishnaram and Khuller, Samir and Zhu,An} } @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} } @article {16242, title = {Alignment and clustering of phylogenetic markers - implications for microbial diversity studies}, journal = {BMC Bioinformatics}, volume = {11}, year = {2010}, month = {2010/03/24/}, pages = {152 - 152}, abstract = {Molecular studies of microbial diversity have provided many insights into the bacterial communities inhabiting the human body and the environment. A common first step in such studies is a survey of conserved marker genes (primarily 16S rRNA) to characterize the taxonomic composition and diversity of these communities. To date, however, there exists significant variability in analysis methods employed in these studies.}, isbn = {1471-2105}, doi = {10.1186/1471-2105-11-152}, url = {http://www.biomedcentral.com/1471-2105/11/152}, author = {White,James R and Navlakha,Saket and Nagarajan,Niranjan and Ghodsi,Mohammad-Reza and Kingsford, Carl and Pop, Mihai} } @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} } @article {15164, title = {Authenticated broadcast with a partially compromised public-key infrastructure}, journal = {Stabilization, Safety, and Security of Distributed Systems}, year = {2010}, month = {2010///}, pages = {144 - 158}, abstract = {Given a public-key infrastructure (PKI) and digital signatures, it is possible to construct broadcast protocols tolerating any number of corrupted parties. Almost all existing protocols, however, do not distinguish between corrupted parties (who do not follow the protocol), and honest parties whose secret (signing) keys have been compromised (but who continue to behave honestly). We explore conditions under which it is possible to construct broadcast protocols that still provide the usual guarantees (i.e., validity/agreement) to the latter.Consider a network of n parties, where an adversary has compromised the secret keys of up to t c honest parties and, in addition, fully controls the behavior of up to t a other parties. We show that for any fixed t c > 0, and any fixed t a , there exists an efficient protocol for broadcast if and only if 2t a + min (t a , t c ) < n. (When t c = 0, standard results imply feasibility.) We also show that if t c , t a are not fixed, but are only guaranteed to satisfy the bound above, then broadcast is impossible to achieve except for a few specific values of n; for these {\textquotedblleft}exceptional{\textquotedblright} values of n, we demonstrate a broadcast protocol. Taken together, our results give a complete characterization of this problem. }, doi = {10.1007/978-3-642-16023-3_14}, author = {Gordon,S. and Katz, Jonathan and Kumaresan,R. and Yerukhimovich,A.} } @article {15165, title = {Bounds on the efficiency of black-box commitment schemes}, journal = {Theoretical Computer Science}, volume = {411}, year = {2010}, month = {2010/03/04/}, pages = {1251 - 1260}, abstract = {Constructions of cryptographic primitives based on general assumptions (e.g., one-way functions) tend to be less efficient than constructions based on specific (e.g., number-theoretic) assumptions. This has prompted a recent line of research aimed at investigating the best possible efficiency of (black-box) cryptographic constructions based on general assumptions. Here, we present bounds on the efficiency of statistically-binding commitment schemes constructed using black-box access to one-way permutations; our bounds are tight for the case of perfectly-binding schemes. Our bounds hold in an extension of the Impagliazzo{\textendash}Rudich model: we show that any construction beating our bounds would imply the unconditional existence of a one-way function (from which a statistically-binding commitment scheme could be constructed {\textquotedblleft}from scratch{\textquotedblright}).}, keywords = {Commitment schemes, cryptography}, isbn = {0304-3975}, doi = {10.1016/j.tcs.2009.10.021}, url = {http://www.sciencedirect.com/science/article/pii/S0304397509007737}, author = {Horvitz,Omer and Katz, Jonathan} } @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} } @article {15259, title = {Broadcasting on networks of workstations}, journal = {Algorithmica}, volume = {57}, year = {2010}, month = {2010///}, pages = {848 - 868}, abstract = {Broadcasting and multicasting are fundamental operations. In this work we develop algorithms for performing broadcast and multicast in clusters of workstations. In this model, sending a message to a machine in the same cluster takes 1 time unit, and sending a message to a machine in a different cluster takes C(>=1) time units. The clusters may have arbitrary sizes. Lowekamp and Beguelin proposed heuristics for this model, but their algorithms may produce broadcast times that are arbitrarily worse than optimal. We develop the first constant factor approximation algorithms for this model. Algorithm LCF (Largest Cluster First) for the basic model is simple, efficient and has a worst case approximation guarantee of 2. We then extend these models to more complex models where we remove the assumption that an unbounded amount of communication may happen using the global network. The algorithms for these models build on the LCF method developed for the basic problem. Finally, we develop broadcasting algorithms for the postal model where the sending node does not block for C time units when the message is in transit.}, doi = {10.1007/s00453-008-9249-0}, author = {Khuller, Samir and Kim,Y. A and Wan,Y. C.J} } @conference {19295, title = {Buffer management for multi-application image processing on multi-core platforms: Analysis and case study}, booktitle = {2010 IEEE International Conference on Acoustics Speech and Signal Processing (ICASSP)}, year = {2010}, month = {2010}, pages = {1662 - 1665}, abstract = {Due to the limited amounts of on-chip memory, large volumes of data, and performance and power consumption overhead associated with interprocessor communication, efficient management of buffer memory is critical to multi-core image processing. To address this problem, this paper develops new modeling and analysis techniques based on dataflow representations, and demonstrates these techniques on a multi-core implementation case study involving multiple, concurrently-executing image processing applications. Our techniques are based on careful representation and exploitation of frame- or block-based operations, which involve repeated invocations of the same computations across regularly- arranged subsets of data. Using these new approaches to manage block-based image data, this paper demonstrates methods to analyze synchronization overhead and FIFO buffer sizes when mapping image processing applications onto heterogeneous, multi core architectures.}, keywords = {block-based image data, buffer memory management, buffer storage, concurrently-executing image processing application, data flow computing, data flow representation, data subset, Dataflow, Digital signal processing, Energy consumption, Energy management, Engineering management, FIFO buffer sizes, Hardware, Image analysis, IMAGE PROCESSING, image processing application, image representation, interprocessor communication, memory architecture, Memory management, multiapplication image processing, multicore image processing, multiprocessing, on-chip memory, power consumption, power consumption overhead, Runtime, scheduling, set theory, shared memory, storage management chips, synchronization overhead}, author = {Ko,Dong-Ik and Won, N. and Bhattacharyya, Shuvra S.} } @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} } @article {15326, title = {Coherent turbulent motions in a Mach 3 boundary layer}, journal = {Bulletin of the American Physical Society}, volume = {55}, year = {2010}, month = {2010///}, author = {Beekman,I. and Kan,Y. C and Priebe,S. and Martin, M.P} } @article {15366, title = {Common Mode Analysis of Ethernet Transformers}, journal = {Magnetics Letters, IEEE}, volume = {1}, year = {2010}, month = {2010///}, abstract = {In this letter, a distributed model for Ethernet transformers subject to common mode signals is developed.Explicit formulas for transfer functions are derived and illustrated by numerical examples. }, author = {Bowen,D. and Mayergoyz, Issak D and Krafft,C. and Kroop,D.} } @article {16254, title = {Computational Approaches for Genome Assembly Validation}, journal = {Biological Data Mining}, year = {2010}, month = {2010///}, pages = {163 - 163}, author = {Choi,J.H. and Tang,H. and Kim,S. and Pop, Mihai} } @conference {13391, title = {On Computing Compression Trees for Data Collection in Wireless Sensor Networks}, booktitle = {2010 Proceedings IEEE INFOCOM}, year = {2010}, month = {2010/03/14/19}, pages = {1 - 9}, publisher = {IEEE}, organization = {IEEE}, abstract = {We address the problem of efficiently gathering correlated data from a wireless sensor network, with the aim of designing algorithms with provable optimality guarantees, and understanding how close we can get to the known theoretical lower bounds. Our proposed approach is based on finding an optimal or a near-optimal compression tree for a given sensor network: a compression tree is a directed tree over the sensor network nodes such that the value of a node is compressed using the value of its parent. We focus on broadcast communication model in this paper, but our results are more generally applicable to a unicast communication model as well. We draw connections between the data collection problem and a previously studied graph concept called weakly connected dominating sets, and we use this to develop novel approximation algorithms for the problem. We present comparative results on several synthetic and real-world datasets showing that our algorithms construct near-optimal compression trees that yield a significant reduction in the data collection cost.}, keywords = {Approximation algorithms, Base stations, Communications Society, Computer networks, Computer science, computing compression trees, Costs, data collection, Data communication, data compression, designing algorithms, Educational institutions, Entropy, graph concept, Monitoring, Protocols, trees (mathematics), weakly connected dominating sets, Wireless sensor networks}, isbn = {978-1-4244-5836-3}, doi = {10.1109/INFCOM.2010.5462035}, author = {Li,Jian and Deshpande, Amol and Khuller, Samir} } @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} } @conference {17843, title = {Decentralized dynamic scheduling across heterogeneous multi-core desktop grids}, booktitle = {2010 IEEE International Symposium on Parallel \& Distributed Processing, Workshops and Phd Forum (IPDPSW)}, year = {2010}, month = {2010/04/19/23}, pages = {1 - 9}, publisher = {IEEE}, organization = {IEEE}, abstract = {The recent advent of multi-core computing environments increases both the heterogeneity and complexity of managing desktop grid resources, making efficient load balancing challenging even for a centralized manager. Even with good initial job assignments, dynamic scheduling is still needed to adapt to dynamic environments, as well as for applications whose running times are not known a priori. In this paper, we propose new decentralized scheduling schemes that backfill jobs locally and dynamically migrate waiting jobs across nodes to leverage residual resources, while guaranteeing bounded waiting times for all jobs. The methods attempt to maximize total throughput while balancing load across available grid resources. Experimental results via simulation show that our scheduling scheme has performance competitive with an online centralized scheduler.}, keywords = {backfill jobs, bounded waiting time, Computer science, decentralized dynamic scheduling, desktop grid resource management, Dynamic scheduling, Educational institutions, Environmental management, grid computing, heterogeneous multicore desktop grid, job assignment, job migration, load balancing, Load management, multicore computing environment, Peer to peer computing, Processor scheduling, residual resources, resource allocation, Resource management, scheduling, Scheduling algorithm, Throughput}, isbn = {978-1-4244-6533-0}, doi = {10.1109/IPDPSW.2010.5470877}, author = {Jaehwan Lee and Keleher,P. and Sussman, Alan} } @conference {18559, title = {Decoupling policy from configuration in campus and enterprise networks}, booktitle = {Local and Metropolitan Area Networks (LANMAN), 2010 17th IEEE Workshop on}, year = {2010}, month = {2010/05//}, pages = {1 - 6}, abstract = {This paper surveys our ongoing work on the use of software-defined networking to simplify two acute policy problems in campus and enterprise network operations: access control and information flow control. We describe how the current coupling of high-level policy with low-level configuration makes these problems challenging today. We describe the specific policy problems faced by campus and enterprise network operators; illustrate our approach, which leverages recent trends in separating the network{\textquoteright}s $\#$x201C;control plane $\#$x201D; from the data plane; and show how this approach can be applied to simplify these two enterprise network management tasks. We also describe our ongoing deployment efforts to build a campus network testbed where trial designs can be deployed and evaluated. We close with a summary of current and future research challenges for solving challenges within enterprise networks within the context of this new paradigm.}, keywords = {Access control, Business communication, campus network, decoupling policy, enterprise network management tasks, enterprise network operator, information flow control, software defined network, software radio, telecommunication network management, telecommunication security}, doi = {10.1109/LANMAN.2010.5507162}, author = {Feamster, Nick and Nayak,A. and Kim,Hyojoon and Clark,R. and Mundada,Y. and Ramachandran,A. and bin Tariq,M.} } @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 {18791, title = {Developing Autonomy for Unmanned Surface Vehicles by Using Virtual Environments}, year = {2010}, month = {2010///}, institution = {ENERGETICS TECHNOLOGY CENTER INC LA PLATA MD}, abstract = {We address the problem of automated synthesis of an action selection policy for an unmanned vehicle operating in an environment with a deceptive adversary. We introduce a new synthesis approach using which an initial version of the policy is automatically generated and then gradually refined by detecting and fixing its shortcomings. Our focus is specifically on automated synthesis of a policy used for blocking the advancement of an intruder boat toward a valuable target. The USV must generate specific maneuvers for blocking. The intruder is human competitive and exhibits a deceptive behavior so that the USV cannot exploit regularity in its attacking behavior. We compared the performance of a hand coded USVs blocking policy to the performance of a policy that was automatically synthesized. Our results show that the performance of the automatically generated USVs policy exceed the performance of the hand coded policy and thus demonstrates the feasibility of the proposed approach.}, url = {http://oai.dtic.mil/oai/oai?verb=getRecord\&metadataPrefix=html\&identifier=ADA535105}, author = {Kavetsky,R. and Gupta,S.K.} } @book {19351, title = {Digital Signatures}, year = {2010}, month = {2010}, pages = {192}, publisher = {Springer}, organization = {Springer}, abstract = {Digital Signatures is the first comprehensive account of the theoretical principles and techniques used in the design of provably secure signature schemes. In addition to providing the reader with a better understanding of the security guarantees provided by digital signatures, the book also contains full descriptions and detailed proofs for essentially all known secure signature schemes in the cryptographic literature. A valuable reference for students, professors, and researchers, Digital Signature Schemes can be used for self-study, as a supplement to a course on theoretical cryptography, or as a textbook in a graduate-level seminar.}, keywords = {Computers / Computer Science, Computers / Hardware / General, Computers / Information Theory, Computers / Networking / Hardware, Computers / Security / General, Technology \& Engineering / Telecommunications}, isbn = {9780387277110}, author = {Yung,Moti and Katz, Jonathan} } @inbook {19300, title = {Dynamic and Multidimensional Dataflow Graphs}, booktitle = {Handbook of Signal Processing Systems}, year = {2010}, month = {2010}, pages = {899 - 930}, publisher = {Springer US}, organization = {Springer US}, abstract = {Much of the work to date on dataflow models for signal processing system design has focused decidable dataflow models that are best suited for onedimensional signal processing. In this chapter, we review more general dataflow modeling techniques that are targeted to applications that include multidimensional signal processing and dynamic dataflow behavior. As dataflow techniques are applied to signal processing systems that are more complex, and demand increasing degrees of agility and flexibility, these classes of more general dataflow models are of correspondingly increasing interest. We begin with a discussion of two dataflow modeling techniques - multi-dimensional synchronous dataflow and windowed dataflow - that are targeted towards multidimensional signal processing applications. We then provide a motivation for dynamic dataflow models of computation, and review a number of specific methods that have emerged in this class of models. Our coverage of dynamic dataflowmodels in this chapter includes Boolean dataflow, the stream-based function model, CAL, parameterized dataflow, and enable-invoke dataflow.}, keywords = {Communications Engineering, Networks, Computer Systems Organization and Communication Networks, Processor Architectures, Signal, Image and Speech Processing}, isbn = {978-1-4419-6344-4, 978-1-4419-6345-1}, url = {http://link.springer.com/chapter/10.1007/978-1-4419-6345-1_32}, author = {Bhattacharyya, Shuvra S. and Deprettere, Ed F. and Keinert, Joachim}, editor = {Bhattacharyya, Shuvra S. and Deprettere, Ed F. and Leupers, Rainer and Takala, Jarmo} } @article {12872, title = {Effect on Human Cells of Environmental Vibrio Parahaemolyticus Strains Carrying Type III Secretion System 2}, journal = {Infection and ImmunityInfect. Immun.}, volume = {78}, year = {2010}, month = {2010/07/01/}, pages = {3280 - 3287}, abstract = {Vibrio parahaemolyticus is an inhabitant of estuarine and marine environments that causes seafood-borne gastroenteritis worldwide. Recently, a type 3 secretion system (T3SS2) able to secrete and translocate virulence factors into the eukaryotic cell has been identified in a pathogenicity island (VP-PAI) located on the smaller chromosome. These virulence-related genes have previously been detected only in clinical strains. Classical virulence genes for this species (tdh, trh) are rarely detected in environmental strains, which are usually considered to lack virulence potential. However, during screening of a collection of environmental V. parahaemolyticus isolates obtained in the North Adriatic Sea in Italy, a number of marine strains carrying virulence-related genes, including genes involved in the T3SS2, were detected. In this study, we investigated the pathogenic potential of these marine V. parahaemolyticus strains by studying their adherence ability, their cytotoxicity, their effect on zonula occludin protein 1 (ZO-1) of the tight junctions, and their effect on transepithelial resistance (TER) in infected Caco-2 cells. By performing a reverse transcription-PCR, we also tested the expression of the T3SS2 genes vopT and vopB2, encoding an effector and a translocon protein, respectively. Our results indicate that, similarly to clinical strains, marine V. parahaemolyticus strains carrying vopT and vopB2 and that other genes included in the VP-PAI are capable of adhering to human cells and of causing cytoskeletal disruption and loss of membrane integrity in infected cells. On the basis of data presented here, environmental V. parahaemolyticus strains should be included in coastal water surveillance plans, as they may represent a risk for human health.}, isbn = {0019-9567, 1098-5522}, doi = {10.1128/IAI.00050-10}, url = {http://iai.asm.org/content/78/7/3280}, author = {Caburlotto,Greta and Lle{\`o},Maria M. and Hilton,Tamara and Huq,Anwar and Rita R Colwell and Kaper,James B.} } @article {15171, title = {Efficient rational secret sharing in standard communication networks}, journal = {Theory of Cryptography}, year = {2010}, month = {2010///}, pages = {419 - 436}, abstract = {We propose a new methodology for rational secret sharing leading to various instantiations (in both the two-party and multi-party settings) that are simple and efficient in terms of computation, share size, and round complexity. Our protocols do not require physical assumptions or simultaneous channels, and can even be run over asynchronous, point-to-point networks.We also propose new equilibrium notions (namely, computational versions of strict Nash equilibrium and stability with respect to trembles) and prove that our protocols satisfy them. These notions guarantee, roughly speaking, that at each point in the protocol there is a unique legal message a party can send. This, in turn, ensures that protocol messages cannot be used as subliminal channels, something achieved in prior work only by making strong assumptions on the communication network. }, doi = {10.1007/978-3-642-11799-2_25}, author = {Fuchsbauer,G. and Katz, Jonathan and Naccache,D.} } @conference {19289, title = {Efficient static buffering to guarantee throughput-optimal FPGA implementation of synchronous dataflow graphs}, booktitle = {2010 International Conference on Embedded Computer Systems (SAMOS)}, year = {2010}, month = {2010}, pages = {136 - 143}, abstract = {When designing DSP applications for implementation on field programmable gate arrays (FPGAs), it is often important to minimize consumption of limited FPGA resources while satisfying real-time performance constraints. In this paper, we develop efficient techniques to determine dataflow graph buffer sizes that guarantee throughput-optimal execution when mapping synchronous dataflow (SDF) representations of DSP applications onto FPGAs. Our techniques are based on a novel two-actor SDF graph Model (TASM), which efficiently captures the behavior and costs associated with SDF graph edges (flow-graph connections). With our proposed techniques, designers can automatically generate upper bounds on SDF graph buffer distributions that realize maximum achievable throughput performance for the corresponding applications. Furthermore, our proposed technique is characterized by low polynomial time complexity, which is useful for rapid prototyping in DSP system design.}, keywords = {buffer memory, circuit complexity, Complexity theory, Computational modeling, data flow graphs, Digital signal processing, digital signal processing chips, DSP system design, efficient static buffering, Field programmable gate arrays, FPGA, graph buffer distributions, integrated circuit design, low polynomial time complexity, Random access memory, Schedules, SDF graph edges, Signal processing systems, Synchronous dataflow, synchronous dataflow graph mapping, Throughput, throughput-optimal execution, throughput-optimal FPGA implementation, two-actor SDF graph model, upper bounds}, author = {Kee, Hojin and Bhattacharyya, Shuvra S. and Kornerup, J.} } @article {15383, title = {Electromagnetic Modeling of Ethernet Transformers}, journal = {Magnetics, IEEE Transactions on}, volume = {46}, year = {2010}, month = {2010/02//}, pages = {563 - 569}, abstract = {The unique features of Ethernet transformers are reviewed, and novel testing techniques for identification of lumped parameters of equivalent circuits are presented. To account for the distributed nature of the cross-winding and intrawinding capacitances, novel distributed models for electromagnetic analysis of Ethernet transformers are presented.}, keywords = {analysis;electromagnetic, area, capacitances;lumped, circuits;ethernet, circuits;local, cross-winding;distributed, modeling;equivalent, models;electromagnetic, networks;lumped, networks;transformer, parameter, parameters;novel, techniques;capacitance;equivalent, Testing, transformers;intrawinding, windings;transformers;}, isbn = {0018-9464}, doi = {10.1109/TMAG.2009.2033203}, author = {Bowen,D. and Mayergoyz, Issak D and Krafft,C.} } @conference {18902, title = {Emergence of cooperative societies in evolutionary games}, series = {GECCO {\textquoteright}10}, year = {2010}, month = {2010///}, pages = {1793 - 1800}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {We utilize evolutionary game theory to study the evolution of cooperative societies and the behaviors of individual agents (i.e., players) in it. We present a novel player model based upon empirical evidence from the social and behavioral sciences, stating that: (1) an individual{\textquoteright}s behavior may often be motivated not only by self-interest but also by the consequences for the others, and (2) individuals vary in their interpersonal social tendencies, which reflect stable personal orientations that influence their choices. Alongside the formal player model we provide an analysis that considers possible interactions between different types of individuals. We present series of evolutionary simulations that ratify previous findings on evolution of cooperation, and provide new insights on the evolutionary process of cooperative behavior in a society as well as on the emergence of cooperative societies. Our main experimental result demonstrate that in contrast to previous common knowledge, increasing the value of mutual Reward or increasing mutual Punishment in the Prisoner{\textquoteright}s dilemma game do not result in the same type of cooperative society: while increasing R does result in a more cooperative society, increasing P does not.}, keywords = {evolutionary game theory, social orientations}, isbn = {978-1-4503-0073-5}, doi = {10.1145/1830761.1830805}, url = {http://doi.acm.org/10.1145/1830761.1830805}, author = {Cheng,Kan-Leung and Zuckerman,Inon and Kuter,Ugur and Nau, Dana S.} } @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} } @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 {15267, title = {Exploring Biological Network Dynamics with Ensembles of Graph Partitions}, booktitle = {Proceedings of the PSB Pacific Symposium on Biocomputing}, volume = {15}, year = {2010}, month = {2010///}, pages = {166 - 177}, author = {Navlakha,S. and Kingsford, Carl} } @article {16264, title = {Finding Biologically Accurate Clusterings in Hierarchical Tree Decompositions Using the Variation of Information}, journal = {Journal of Computational Biology}, volume = {17}, year = {2010}, month = {2010/03//}, pages = {503 - 516}, abstract = {Hierarchical clustering is a popular method for grouping together similar elements based on a distance measure between them. In many cases, annotations for some elements are known beforehand, which can aid the clustering process. We present a novel approach for decomposing a hierarchical clustering into the clusters that optimally match a set of known annotations, as measured by the variation of information metric. Our approach is general and does not require the user to enter the number of clusters desired. We apply it to two biological domains: finding protein complexes within protein interaction networks and identifying species within metagenomic DNA samples. For these two applications, we test the quality of our clusters by using them to predict complex and species membership, respectively. We find that our approach generally outperforms the commonly used heuristic methods.}, isbn = {1066-5277, 1557-8666}, doi = {10.1089/cmb.2009.0173}, url = {http://www.liebertonline.com/doi/abs/10.1089/cmb.2009.0173}, author = {Navlakha,Saket and White,James and Nagarajan,Niranjan and Pop, Mihai and Kingsford, Carl} } @conference {19297, title = {FPGA-based design and implementation of the 3GPP-LTE physical layer using parameterized synchronous dataflow techniques}, booktitle = {2010 IEEE International Conference on Acoustics Speech and Signal Processing (ICASSP)}, year = {2010}, month = {2010}, pages = {1510 - 1513}, abstract = {Synchronous dataflow (SDF) is an ubiquitous dataflow model of computation that has been studied extensively for efficient simulation and software synthesis of DSP applications. In recent years, parameterized SDF (PSDF) has evolved as a useful framework for modeling SDF graphs in which arbitrary parameters can be changed dynamically. However, the potential to enable efficient hardware synthesis has been treated relatively sparsely in the literature for SDF and even more so for the newer, more general PSDF model. This paper investigates efficient FPGA-based design and implementation of the physical layer for 3GPP-Long Term Evolution (LTE), a next generation cellular standard. To capture the SDF behavior of the functional core of LTE along with higher level dynamics in the standard, we use a novel PSDF-based FPGA architecture framework. We implement our PSDF-based, LTE design framework using National Instrument{\textquoteright}s LabVIEW FPGA, a recently-introduced commercial platform for reconfigurable hardware implementation. We show that our framework can effectively model the dynamics of the LTE protocol, while also providing a synthesis framework for efficient FPGA implementation.}, keywords = {3G mobile communication, 3GPP-long term evolution, 3GPP-LTE physical layer, 4G communication systems, Computational modeling, data flow analysis, data flow graphs, Dataflow modeling, Digital signal processing, DSP applications, Field programmable gate arrays, FPGA architecture framework, FPGA implementation, FPGA-based design, Hardware, hardware synthesis, Instruments, LabVIEW FPGA, Logic Design, LTE, next generation cellular standard, parameterized synchronous data flow technique, Pervasive computing, Physical layer, Physics computing, Production, PSDF graph, reconfigurable hardware implementation, Runtime, software synthesis, Ubiquitous Computing, ubiquitous data flow model}, author = {Kee, Hojin and Bhattacharyya, Shuvra S. and Wong, I. and Yong Rao} } @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} } @conference {17988, title = {General-purpose vs. gpu: Comparison of many-cores on irregular workloads}, booktitle = {Proceedings of the Second Usenix Workshop on Hot Topics in Parallelism}, year = {2010}, month = {2010///}, pages = {14 - 15}, abstract = {XMT1 is a general-purpose many-core parallel architec-ture. The foremost design objective for XMT was to meet the highest standards for ease of parallel programming. GPUs, on the other hand, have acquired a strong reputa- tion on performance, sometimes at the expense of ease- of-programming. The current paper presents a perfor- mance comparison on diverse workloads between XMT and an NVIDIA CUDA-enabled GPU. Configured with roughly the same amount of chip resources as the GPU, XMT achieves an average speedup of 6.05x on irregu- lar applications, while incurring an average slowdown of 2.07x on regular ones. Namely, XMT comes ahead for significant applications without having to pay a (possibly worthwhile) price for easier programming. This surpris- ing result suggests a yet untapped opportunity: A high- performance easy-to-program general-purpose 1000-core computer. }, author = {Caragea,G.C. and Keceli,F. and Tzannes,A. and Vishkin, Uzi} } @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 {15073, title = {A group signature scheme from lattice assumptions}, journal = {Advances in Cryptology-ASIACRYPT 2010}, year = {2010}, month = {2010///}, pages = {395 - 412}, abstract = {Group signature schemes allow users to sign messages on behalf of a group while (1) maintaining anonymity (within that group) with respect to an outside observer, yet (2) ensuring traceability of a signer (by the group manager) when needed. In this work we give the first construction of a group signature scheme based on lattices (more precisely, the learning with errors assumption), in the random oracle model. Towards our goal, we construct a new algorithm for sampling a basis for an orthogonal lattice, together with a trapdoor, that may be of independent interest.}, doi = {10.1007/978-3-642-17373-8_23}, author = {Gordon,S. and Katz, Jonathan and Vaikuntanathan,V.} } @conference {13564, title = {Handwritten Arabic text line segmentation using affinity propagation}, booktitle = {Proceedings of the 9th IAPR International Workshop on Document Analysis Systems}, series = {DAS {\textquoteright}10}, year = {2010}, month = {2010///}, pages = {135 - 142}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {In this paper, we present a novel graph-based method for extracting handwritten text lines in monochromatic Arabic document images. Our approach consists of two steps - Coarse text line estimation using primary components which define the line and assignment of diacritic components which are more difficult to associate with a given line. We first estimate local orientation at each primary component to build a sparse similarity graph. We then, use a shortest path algorithm to compute similarities between non-neighboring components. From this graph, we obtain coarse text lines using two estimates obtained from Affinity propagation and Breadth-first search. In the second step, we assign secondary components to each text line. The proposed method is very fast and robust to non-uniform skew and character size variations, normally present in handwritten text lines. We evaluate our method using a pixel-matching criteria, and report 96\% accuracy on a dataset of 125 Arabic document images. We also present a proximity analysis on datasets generated by artificially decreasing the spacings between text lines to demonstrate the robustness of our approach.}, keywords = {affinity propagation, arabic, arabic documents, breadth-first search, clustering, dijkstra{\textquoteright}s shortest path algorithm, handwritten documents, line detection, text line segmentation}, isbn = {978-1-60558-773-8}, doi = {10.1145/1815330.1815348}, url = {http://doi.acm.org/10.1145/1815330.1815348}, author = {Kumar,Jayant and Abd-Almageed, Wael and Kang,Le and David Doermann} } @article {14622, title = {Hopx and Hdac2 Interact to Modulate Gata4 Acetylation and Embryonic Cardiac Myocyte Proliferation}, journal = {Developmental Cell}, volume = {19}, year = {2010}, month = {2010/09/14/}, pages = {450 - 459}, abstract = {SummaryRegulation of chromatin structure via histone modification has recently received intense attention. Here,~we demonstrate that the chromatin-modifying enzyme histone deacetylase 2 (Hdac2) functions with a small homeodomain factor, Hopx, to mediate deacetylation of Gata4, which is expressed by cardiac progenitor cells and plays critical roles in the regulation of cardiogenesis. In the absence of Hopx and Hdac2 in mouse embryos, Gata4 hyperacetylation is associated with a marked increase in~cardiac myocyte proliferation, upregulation of Gata4 target genes, and perinatal lethality. Hdac2 physically interacts with Gata4, and this interaction is stabilized by Hopx. The ability of Gata4 to transactivate cell cycle genes is impaired by Hopx/Hdac2-mediated deacetylation, and this effect is abrogated by loss of Hdac2-Gata4 interaction. These results suggest that Gata4 is a nonhistone target of Hdac2-mediated deacetylation and that Hdac2, Hopx, and Gata4 coordinately regulate cardiac myocyte proliferation during embryonic development. }, isbn = {1534-5807}, doi = {10.1016/j.devcel.2010.08.012}, url = {http://www.sciencedirect.com/science/article/pii/S1534580710003874}, author = {Trivedi,Chinmay M. and Zhu,Wenting and Wang,Qiaohong and Jia,Cheng and Kee,Hae Jin and Li,Li and Hannenhalli, Sridhar and Epstein,Jonathan A.} } @article {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} } @article {14173, title = {Illusory motion due to causal time filtering}, journal = {Vision research}, volume = {50}, year = {2010}, month = {2010///}, pages = {315 - 329}, author = {Ferm{\"u}ller, Cornelia and Ji,H. and Kitaoka,A.} } @conference {16692, title = {Improving translation via targeted paraphrasing}, booktitle = {Proceedings of the 2010 Conference on Empirical Methods in Natural Language Processing}, year = {2010}, month = {2010///}, pages = {127 - 137}, author = {Resnik, Philip and Buzek,O. and Hu,C. and Kronrod,Y. and Quinn,A. and Bederson, Benjamin B.} } @article {13957, title = {Insights into head-related transfer function: Spatial dimensionality and continuous representation}, journal = {The Journal of the Acoustical Society of America}, volume = {127}, year = {2010}, month = {2010///}, pages = {2347 - 2357}, abstract = {This paper studies head-related transfer function (HRTF) sampling and synthesis in a three-dimensional auditory scene based on a general modal decomposition of the HRTF in all frequency-range-angle domains. The main finding is that the HRTF decomposition with the derived spatial basis function modes can be well approximated by a finite number, which is defined as the spatial dimensionality of the HRTF. The dimensionality determines the minimum number of parameters to represent the HRTF corresponding to all directions and also the required spatial resolution in HRTF measurement. The general model is further developed to a continuous HRTF representation, in which the normalized spatial modes can achieve HRTF near-field and far-field representations in one formulation. The remaining HRTF spectral components are compactly represented using a Fourier spherical Bessel series, where the aim is to generate the HRTF with much higher spectral resolution in fewer parameters from typical measurements, which usually have limited spectral resolution constrained by sampling conditions. A low-computation algorithm is developed to obtain the model coefficients from the existing measurements. The HRTF synthesis using the proposed model is validated by three sets of data: (i) synthetic HRTFs from the spherical head model, (ii) the MIT KEMAR (Knowles Electronics Mannequin for Acoustics Research) data, and (iii) 45-subject CIPIC HRTF measurements.}, keywords = {acoustic signal processing, Bessel functions, Fourier series, hearing, Transfer functions}, doi = {10.1121/1.3336399}, url = {http://link.aip.org/link/?JAS/127/2347/1}, author = {Zhang,Wen and Abhayapala,Thushara D. and Kennedy,Rodney A. and Duraiswami, Ramani} } @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.} } @conference {13381, title = {Lineage processing over correlated probabilistic databases}, booktitle = {Proceedings of the 2010 international conference on Management of data}, series = {SIGMOD {\textquoteright}10}, year = {2010}, month = {2010///}, pages = {675 - 686}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {In this paper, we address the problem of scalably evaluating conjunctive queries over correlated probabilistic databases containing tuple or attribute uncertainties. Like previous work, we adopt a two-phase approach where we first compute lineages of the output tuples, and then compute the probabilities of the lineage formulas. However unlike previous work, we allow for arbitrary and complex correlations to be present in the data, captured via a forest of junction trees. We observe that evaluating even read-once (tree structured) lineages (e.g., those generated by hierarchical conjunctive queries), polynomially computable over tuple independent probabilistic databases, is $\#$P-complete for lightly correlated probabilistic databases like Markov sequences. We characterize the complexity of exact computation of the probability of the lineage formula on a correlated database using a parameter called lwidth (analogous to the notion of treewidth). For lineages that result in low lwidth, we compute exact probabilities using a novel message passing algorithm, and for lineages that induce large lwidths, we develop approximate Monte Carlo algorithms to estimate the result probabilities. We scale our algorithms to very large correlated probabilistic databases using the previously proposed INDSEP data structure. To mitigate the complexity of lineage evaluation, we develop optimization techniques to process a batch of lineages by sharing computation across formulas, and to exploit any independence relationships that may exist in the data. Our experimental study illustrates the benefits of using our algorithms for processing lineage formulas over correlated probabilistic databases.}, keywords = {conjunctive queries, Indexing, junction trees, lineage, Probabilistic databases}, isbn = {978-1-4503-0032-2}, doi = {10.1145/1807167.1807241}, url = {http://doi.acm.org/10.1145/1807167.1807241}, author = {Kanagal,Bhargav and Deshpande, Amol} } @article {16050, title = {Making sense of archived e-mail: Exploring the Enron collection with NetLens}, journal = {Journal of the American Society for Information Science and Technology}, volume = {61}, year = {2010}, month = {2010/04/01/}, pages = {723 - 744}, abstract = {Informal communications media pose new challenges for information-systems design, but the nature of informal interaction offers new opportunities as well. This paper describes NetLens-E-mail, a system designed to support exploration of the content-actor network in large e-mail collections. Unique features of NetLens-E-mail include close coupling of orientation, specification, restriction, and expansion, and introduction and incorporation of a novel capability for iterative projection between content and actor networks within the same collection. Scenarios are presented to illustrate the intended employment of NetLens-E-mail, and design walkthroughs with two domain experts provide an initial basis for assessment of the suitability of the design by scholars and analysts.}, isbn = {1532-2890}, doi = {10.1002/asi.21275}, url = {http://onlinelibrary.wiley.com/doi/10.1002/asi.21275/full}, author = {Kang,Hyunmo and Plaisant, Catherine and Elsayed,Tamer and Oard, Douglas} } @article {14820, title = {Mesh saliency and human eye fixations}, journal = {ACM Transactions on Applied Perception (TAP)}, volume = {7}, year = {2010}, month = {2010/02//}, pages = {12:1{\textendash}12:13 - 12:1{\textendash}12:13}, abstract = {Mesh saliency has been proposed as a computational model of perceptual importance for meshes, and it has been used in graphics for abstraction, simplification, segmentation, illumination, rendering, and illustration. Even though this technique is inspired by models of low-level human vision, it has not yet been validated with respect to human performance. Here, we present a user study that compares the previous mesh saliency approaches with human eye movements. To quantify the correlation between mesh saliency and fixation locations for 3D rendered images, we introduce the normalized chance-adjusted saliency by improving the previous chance-adjusted saliency measure. Our results show that the current computational model of mesh saliency can model human eye movements significantly better than a purely random model or a curvature-based model.}, keywords = {eye-tracker, mesh saliency, Visual perception}, isbn = {1544-3558}, doi = {10.1145/1670671.1670676}, url = {http://doi.acm.org/10.1145/1670671.1670676}, author = {Kim,Youngmin and Varshney, Amitabh and Jacobs, David W. and Guimbreti{\`e}re,Fran{\c c}ois} } @conference {14279, title = {Mixing type checking and symbolic execution}, booktitle = {ACM SIGPLAN Notices}, volume = {45}, year = {2010}, month = {2010///}, pages = {436 - 447}, author = {Khoo,Y.P. and Chang,B.Y.E. and Foster, Jeffrey S.} } @article {15300, title = {Natural language annotations for the Semantic Web}, journal = {On the Move to Meaningful Internet Systems 2002: CoopIS, DOA, and ODBASE}, year = {2010}, month = {2010///}, pages = {1317 - 1331}, author = {Katz,B. and Jimmy Lin and Quan,D.} } @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 {15137, title = {A new framework for efficient password-based authenticated key exchange}, booktitle = {Proceedings of the 17th ACM conference on Computer and communications security}, series = {CCS {\textquoteright}10}, year = {2010}, month = {2010///}, pages = {516 - 525}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Protocols for password-based authenticated key exchange (PAKE) allow two users who share only a short, low-entropy password to agree on a cryptographically strong session key. The challenge in designing such protocols is that they must be immune to off-line dictionary attacks in which an eavesdropping adversary exhaustively enumerates the dictionary of likely passwords in an attempt to match a password to the set of observed transcripts. To date, few general frameworks for constructing PAKE protocols in the standard model are known. Here, we abstract and generalize a protocol by Jiang and Gong to give a new methodology for realizing PAKE without random oracles, in the common reference string model. In addition to giving a new approach to the problem, the resulting construction off ers several advantages over prior work. We also describe an extension of our protocol that is secure within the universal composability (UC) framework and, when instantiated using El Gamal encryption, is more efficient than a previous protocol of Canetti et al.}, keywords = {exchange, key, password-based}, isbn = {978-1-4503-0245-6}, doi = {10.1145/1866307.1866365}, url = {http://doi.acm.org/10.1145/1866307.1866365}, author = {Groce,Adam and Katz, Jonathan} } @article {15070, title = {A New Framework for Password-Based Authenticated Key Exchange}, journal = {ACM CCCS 2010}, year = {2010}, month = {2010///}, abstract = {Protocols for password-based authenticated key exchange (PAKE) allowtwo users who share only a short, low-entropy password to agree on a cryptographically strong session key. The challenge in designing such protocols is that they must be immune to off-line dictionary attacks in which an eavesdropping adversary exhaustively enumerates the dictionary of likely passwords in an attempt to match a password to the set of observed transcripts. To date, few general frameworks for constructing PAKE protocols in the standard model are known. Here, we abstract and generalize a protocol by Jiang and Gong to give a new methodology for realizing PAKE without random oracles, in the common reference string model. In addition to giving a new approach to the problem, the resulting construction offers several advantages over prior work. We also describe an extension of our protocol that is secure within the universal composability~(UC) framework and, when instantiated using El Gamal encryption, is more efficient than a previous protocol of Canetti et al. }, keywords = {Cryptographic protocols, password-based key exchange}, url = {http://eprint.iacr.org/2010/147}, author = {Groce,Adam and Katz, Jonathan} } @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 {15104, title = {Overcoming the Hole in the Bucket: Public-Key Cryptography Resilient to Continual Memory Leakage}, booktitle = {Foundations of Computer Science (FOCS), 2010 51st Annual IEEE Symposium on}, year = {2010}, month = {2010/10//}, pages = {501 - 510}, abstract = {In recent years, there has been a major effort to design cryptographic schemes that remain secure even when arbitrary information about the secret key is leaked (e.g., via side-channel attacks). We explore the possibility of achieving security under emphcontinual leakage from the emphentire secret key by designing schemes in which the secret key is updated over time. In this model, we construct public-key encryption schemes, digital signatures, and identity-based encryption schemes that remain secure even if an attacker can leak a constant fraction of the secret memory (including the secret key) in each time period between key updates. We also consider attackers who may probe the secret memory during the updates themselves. We stress that we allow unrestricted leakage, without the assumption that {\textquotedblleft}only computation leaks information{\textquotedblright}. Prior to this work, constructions of public-key encryption schemes secure under continual leakage were not known even under this assumption.}, keywords = {continual, cryptography;, cryptography;public-key, encryption, key, key;digital, leakage;cryptographic, memory, schemes;digital, schemes;public-key, schemes;secret, signatures;identity-based, signatures;public}, doi = {10.1109/FOCS.2010.55}, author = {Brakerski,Z. and Kalai,Y.T. and Katz, Jonathan and Vaikuntanathan,V.} } @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 {15090, title = {Partial fairness in secure two-party computation}, journal = {Advances in Cryptology{\textendash}EUROCRYPT 2010}, year = {2010}, month = {2010///}, pages = {157 - 176}, abstract = {A seminal result of Cleve (STOC {\textquoteright}86) is that complete fairness is impossible to achieve in two-party computation. In light of this, various techniques for obtaining partial fairness have been suggested in the literature. We propose a definition of partial fairness within the standard real-/ideal-world paradigm that addresses deficiencies of prior definitions. We also show broad feasibility results with respect to our definition: partial fairness is possible for any (randomized) functionality f:X {\texttimes}Y {\textrightarrow}Z 1 {\texttimes}Z 2 at least one of whose domains or ranges is polynomial in size. Our protocols are always private, and when one of the domains has polynomial size our protocols also simultaneously achieve the usual notion of security with abort. In contrast to some prior work, we rely on standard assumptions only.We also show that, as far as general feasibility is concerned, our results are optimal (with respect to our definition). }, doi = {10.1007/978-3-642-13190-5_8}, author = {Gordon,S. and Katz, Jonathan} } @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 {15270, title = {The power of protein interaction networks for associating genes with diseases}, journal = {Bioinformatics}, volume = {26}, year = {2010}, month = {2010///}, pages = {1057 - 1057}, author = {Navlakha,S. and Kingsford, Carl} } @article {15106, title = {Public-Key Cryptography}, journal = {Handbook of Information and Communication Security}, year = {2010}, month = {2010///}, pages = {21 - 34}, abstract = {Public-key cryptography ensures both secrecy and authenticity of communication using public-key encryption schemes and digital signatures, respectively. Following a brief introduction to the public-key setting (and a comparison with the classical symmetric-key setting), we present rigorous definitions of security for public-key encryption and digital signature schemes, introduce some number-theoretic primitives used in their construction, and describe various practical instantiations.}, doi = {10.1007/978-3-642-04117-4_2}, author = {Katz, Jonathan} } @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 {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 {17984, title = {Resource-Aware Compiler Prefetching for Many-Cores}, booktitle = {Parallel and Distributed Computing (ISPDC), 2010 Ninth International Symposium on}, year = {2010}, month = {2010/07//}, pages = {133 - 140}, abstract = {Super-scalar, out-of-order processors that can have tens of read and write requests in the execution window place significant demands on Memory Level Parallelism (MLP). Multi-and many-cores with shared parallel caches further increase MLP demand. Current cache hierarchies however have been unable to keep up with this trend, with modern designs allowing only 4-16 concurrent cache misses. This disconnect is exacerbated by recent highly parallel architectures (e.g. GPUs) where power and area per-core budget favor lighter cores with less resources. Support for hardware and software prefetch increase MLP pressure since these techniques overlap multiple memory requests with existing computation. In this paper, we propose and evaluate a novel Resource-Aware Prefetching (RAP) compiler algorithm that is aware of the number of simultaneous prefetches supported, and optimized for the same. We show that in situations where not enough resources are available to issue prefetch instructions for all references in a loop, it is more beneficial to decrease the prefetch distance and prefetch for as many references as possible, rather than use a fixed prefetched distance and skip prefetching for some references, as in current approaches. We implemented our algorithm in a GCC-derived compiler and evaluated its performance using an emerging fine-grained many-core architecture. Our results show that the RAP algorithm outperforms a well-known loop prefetching algorithm by up to 40.15\% and the state-of-the art GCC implementation by up to 34.79\%. Moreover, we compare the RAP algorithm with a simple hardware prefetching mechanism, and show improvements of up to 24.61\%.}, keywords = {algorithm;memory, architecture;hardware-software, architectures;parallel, architectures;resource, aware, caches;super-scalar, compiler, compiler;Multicore, compilers;parallel, GCC-derived, level, management;, many-core, memories;storage, out-of-order, Parallel, parallelism;parallel, prefetch;loop, prefetching, prefetching;shared, processor;fine-grained, processors;multiprocessing, systems;optimising}, doi = {10.1109/ISPDC.2010.16}, author = {Caragea,G.C. and Tzannes,A. and Keceli,F. and Barua,R. and Vishkin, Uzi} } @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.} } @article {15152, title = {Secure network coding over the integers}, journal = {Public Key Cryptography{\textendash}PKC 2010}, year = {2010}, month = {2010///}, pages = {142 - 160}, abstract = {Network coding offers the potential to increase throughput and improve robustness without any centralized control. Unfortunately, network coding is highly susceptible to {\textquotedblleft}pollution attacks{\textquotedblright} in which malicious nodes modify packets improperly so as to prevent message recovery at the recipient(s); such attacks cannot be prevented using standard end-to-end cryptographic authentication because network coding mandates that intermediate nodes modify data packets in transit.Specialized {\textquotedblleft}network coding signatures{\textquotedblright} addressing this problem have been developed in recent years using homomorphic hashing and homomorphic signatures. We contribute to this area in several ways: {\textbullet} We show the first homomorphic signature scheme based on the RSA assumption (in the random oracle model). {\textbullet} We give a homomorphic hashing scheme that is more efficient than existing schemes, and which leads to network coding signatures based on the hardness of factoring (in the standard model). {\textbullet} We describe variants of existing schemes that reduce the communication overhead for moderate-size networks, and improve computational efficiency (in some cases quite dramatically {\textendash} e.g., we achieve a 20-fold speedup in signature generation at intermediate nodes). Underlying our techniques is a modified approach to random linear network coding where instead of working in a vector space over a field, we work in a module over the integers (with small coefficients). }, doi = {10.1007/978-3-642-13013-7_9}, author = {Gennaro,R. and Katz, Jonathan and Krawczyk,H. and Rabin,T.} } @conference {15138, title = {Secure text processing with applications to private DNA matching}, booktitle = {Proceedings of the 17th ACM conference on Computer and communications security}, series = {CCS {\textquoteright}10}, year = {2010}, month = {2010///}, pages = {485 - 492}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Motivated by the problem of private DNA matching, we consider the design of efficient protocols for secure text processing. Here, informally, a party P1 holds a text T and a party P2 holds a pattern p and some additional information y, and P2 wants to learn {f(T,j,y)} for all locations j where p is found as a substring in T. (In particular, this generalizes the basic pattern matching problem.) We aim for protocols with full security against a malicious P2 that also preserve privacy against a malicious P1 (i.e., one-sided security). We show how to modify Yao{\textquoteright}s garbled circuit approach to obtain a protocol where the size of the garbled circuit is linear in the number of occurrences of p in T (rather than linear in $|T|$). Along the way we show a new keyword search protocol that may be of independent interest.}, keywords = {COMPUTATION, secure}, isbn = {978-1-4503-0245-6}, doi = {10.1145/1866307.1866361}, url = {http://doi.acm.org/10.1145/1866307.1866361}, author = {Katz, Jonathan and Malka,Lior} } @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.} } @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.} } @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 {14362, title = {Summary of the first ACM SIGKDD workshop on knowledge discovery from uncertain data (U{\textquoteright}09)}, journal = {ACM SIGKDD Explorations Newsletter}, volume = {11}, year = {2010}, month = {2010/05//}, pages = {90 - 91}, isbn = {1931-0145}, doi = {10.1145/1809400.1809419}, url = {http://doi.acm.org/10.1145/1809400.1809419}, author = {Pei,Jian and Getoor, Lise and de Keijzer,Ander} } @article {18607, title = {Transit portal: BGP connectivity as a service}, journal = {ACM SIGCOMM Computer Communication Review}, volume = {40}, year = {2010}, month = {2010/08//}, pages = {463 - 464}, keywords = {bgp-mux, transit portal}, isbn = {0146-4833}, doi = {10.1145/1851275.1851265}, url = {http://doi.acm.org/10.1145/1851275.1851265}, author = {Valancius,Vytautas and Kim,Hyojoon and Feamster, Nick} } @conference {18890, title = {Using a Social Orientation Model for the Evolution of Cooperative Societies}, year = {2010}, month = {2010///}, pages = {431 - 438}, abstract = {We utilize evolutionary game theory to studythe evolution of cooperative societies and the behaviors of individual agents (i.e., players) in such societies. We present a novel player model based upon empirical evidence from the social and behavioral sciences stating that: (1) an individual{\textquoteright}s behavior may often be motivated not only by self-interest but also by the consequences for others, and (2) individuals vary in their interpersonal social tendencies, which reflect stable personal orientations that influence their choices. Alongside the formal player model we provide an analysis that considers possible interactions between different types of individuals and identifies five general steady-state behavioral patterns. We present evolutionary simulations that ratify previous findings on evolution of cooperation, and provide new insights on the evolutionary process of cooperative behavior in a society as well as on the emergence of cooperative societies. Our main experimental result demonstrates that in contrast to previous common knowledge, increasing mutual reward or mutual punishment in the Prisoner{\textquoteright}s dilemma game does not result in the same type of cooperative society: while increasing reward does increase the society{\textquoteright}s cooperativeness level, increasing mutual punishment does not. }, url = {http://www.ariel.ac.il/sites/inon/papers/iat10Kan.pdf}, author = {Cheng,K. L. and Zuckerman,I. and Kuter,U. and Nau, Dana S.} } @article {14372, title = {Using friendship ties and family circles for link prediction}, journal = {Advances in Social Network Mining and Analysis}, year = {2010}, month = {2010///}, pages = {97 - 113}, abstract = {Social networks can capture a variety of relationships among the participants. Both friendship and family ties are commonly studied, but most existing work studies them in isolation. Here, we investigate how these networks can be overlaid, and propose a feature taxonomy for link prediction. We show that when there are tightly-knit family circles in a social network, we can improve the accuracy of link prediction models. This is done by making use of the family circle features based on the likely structural equivalence of family members. We investigated the predictive power of overlaying friendship and family ties on three real-world social networks. Our experiments demonstrate significantly higher prediction accuracy (between 15\% and 30\% more accurate) compared to using more traditional features such as descriptive node attributes and structural features. The experiments also show that a combination of all three types of attributes results in the best precision-recall trade-off.}, doi = {10.1007/978-3-642-14929-0_6}, author = {Zheleva,E. and Getoor, Lise and Golbeck,J. and Kuter,U.} } @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} } @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} } @inbook {18357, title = {Why Did the Person Cross the Road (There)? Scene Understanding Using Probabilistic Logic Models and Common Sense Reasoning}, booktitle = {Computer Vision {\textendash} ECCV 2010}, series = {Lecture Notes in Computer Science}, volume = {6312}, year = {2010}, month = {2010///}, pages = {693 - 706}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {We develop a video understanding system for scene elements, such as bus stops, crosswalks, and intersections, that are characterized more by qualitative activities and geometry than by intrinsic appearance. The domain models for scene elements are not learned from a corpus of video, but instead, naturally elicited by humans, and represented as probabilistic logic rules within a Markov Logic Network framework. Human elicited models, however, represent object interactions as they occur in the 3D world rather than describing their appearance projection in some specific 2D image plane. We bridge this gap by recovering qualitative scene geometry to analyze object interactions in the 3D world and then reasoning about scene geometry, occlusions and common sense domain knowledge using a set of meta-rules. The effectiveness of this approach is demonstrated on a set of videos of public spaces.}, isbn = {978-3-642-15551-2}, url = {http://dx.doi.org/10.1007/978-3-642-15552-9_50}, author = {Kembhavi,Aniruddha and Tom Yeh and Davis, Larry S.}, editor = {Daniilidis,Kostas and Maragos,Petros and Paragios,Nikos} } @article {14650, title = {Young Proteins Experience More Variable Selection Pressures Than Old Proteins}, journal = {Genome ResearchGenome Res.}, volume = {20}, year = {2010}, month = {2010/11/01/}, pages = {1574 - 1581}, abstract = {It is well known that young proteins tend to experience weaker purifying selection and evolve more quickly than old proteins. Here, we show that, in addition, young proteins tend to experience more variable selection pressures over time than old proteins. We demonstrate this pattern in three independent taxonomic groups: yeast, Drosophila, and mammals. The increased variability of selection pressures on young proteins is highly significant even after controlling for the fact that young proteins are typically shorter and experience weaker purifying selection than old proteins. The majority of our results are consistent with the hypothesis that the function of a young gene tends to change over time more readily than that of an old gene. At the same time, our results may be caused in part by young genes that serve constant functions over time, but nevertheless appear to evolve under changing selection pressures due to depletion of adaptive mutations. In either case, our results imply that the evolution of a protein-coding sequence is partly determined by its age and origin, and not only by the phenotypic properties of the encoded protein. We discuss, via specific examples, the consequences of these findings for understanding of the sources of evolutionary novelty.}, isbn = {1088-9051, 1549-5469}, doi = {10.1101/gr.109595.110}, url = {http://genome.cshlp.org/content/20/11/1574}, author = {Vishnoi,Anchal and Kryazhimskiy,Sergey and Bazykin,Georgii A and Hannenhalli, Sridhar and Plotkin,Joshua B.} } @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 {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.} } @conference {15136, title = {Attacking cryptographic schemes based on "perturbation polynomials"}, booktitle = {Proceedings of the 16th ACM conference on Computer and communications security}, series = {CCS {\textquoteright}09}, year = {2009}, month = {2009///}, pages = {1 - 10}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {We show attacks on several cryptographic schemes that have recently been proposed for achieving various security goals in sensor networks. Roughly speaking, these schemes all use "perturbation polynomials" to add "noise" to polynomialbased systems that offer information-theoretic security, in an attempt to increase the resilience threshold while maintaining efficiency. We show that the heuristic security arguments given for these modified schemes do not hold, and that they can be completely broken once we allow even a slight extension of the parameters beyond those achieved by the underlying information-theoretic schemes. Our attacks apply to the key predistribution scheme of Zhang et al. (MobiHoc 2007), the access-control schemes of Subramanian et al. (PerCom 2007), and the authentication schemes of Zhang et al. (INFOCOM 2008). Our results cast doubt on the viability of using "perturbation polynomials" for designing secure cryptographic schemes.}, keywords = {pairwise key establishment, random perturbation polynomial, sensor network security}, isbn = {978-1-60558-894-0}, doi = {10.1145/1653662.1653664}, url = {http://doi.acm.org/10.1145/1653662.1653664}, author = {Albrecht,Martin and Gentry,Craig and Halevi,Shai and Katz, Jonathan} } @article {15084, title = {On black-box constructions of predicate encryption from trapdoor permutations}, journal = {Advances in Cryptology{\textendash}ASIACRYPT 2009}, year = {2009}, month = {2009///}, pages = {197 - 213}, abstract = {Predicate encryption is a recent generalization of identity-based encryption (IBE), broadcast encryption, attribute-based encryption, and more. A natural question is whether there exist black-box constructions of predicate encryption based on generic building blocks, e.g., trapdoor permutations. Boneh et al. (FOCS 2008) recently gave a negative answer for the specific case of IBE.We show both negative and positive results. First, we identify a combinatorial property on the sets of predicates/attributes and show that, for any sets having this property, no black-box construction of predicate encryption from trapdoor permutations (or even CCA-secure encryption) is possible. Our framework implies the result of Boneh et al. as a special case, and also rules out, e.g., black-box constructions of forward-secure encryption and broadcast encryption (with many excluded users). On the positive side, we identify conditions under which predicate encryption schemes can be constructed based on any CPA-secure (standard) encryption scheme. }, doi = {10.1007/978-3-642-10366-7_12}, author = {Katz, Jonathan and Yerukhimovich,A.} } @article {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.} } @article {12895, title = {Comparative genomics reveals mechanism for short-term and long-term clonal transitions in pandemic Vibrio cholerae}, journal = {Proceedings of the National Academy of Sciences}, volume = {106}, year = {2009}, month = {2009///}, pages = {15442 - 15447}, 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 sixth and the current seventh pandemics, respectively. Cholera researchers continually face newly emerging and reemerging pathogenic clones carrying diverse combinations of phenotypic and genotypic properties, which significantly hampered control of the disease. To elucidate evolutionary mechanisms governing genetic diversity of pandemic V. cholerae, we compared the genome sequences of 23 V. cholerae strains isolated from a variety of sources over the past 98 years. The genome-based phylogeny revealed 12 distinct V. cholerae lineages, of which one comprises both O1 classical and El Tor biotypes. All seventh pandemic clones share nearly identical gene content. Using analogy to influenza virology, we define the transition from sixth to seventh pandemic strains as a {\textquotedblleft}shift{\textquotedblright} between pathogenic clones belonging to the same O1 serogroup, but from significantly different phyletic lineages. In contrast, transition among clones during the present pandemic period is characterized as a {\textquotedblleft}drift{\textquotedblright} between clones, differentiated mainly by varying composition of laterally transferred genomic islands, resulting in emergence of variants, exemplified by V. cholerae O139 and V. cholerae O1 El Tor hybrid clones. Based on the comparative genomics 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.}, isbn = {0027-8424, 1091-6490}, doi = {10.1073/pnas.0907787106}, url = {http://www.pnas.org/content/106/36/15442}, author = {Chun,J. and Grim,C. J. and Hasan,N. A. and Lee,J. H. and Choi,S. Y. and Haley,B. J. and Taviani,E. and Jeon,Y. S. and Kim,D.W. and Lee,J. H. and Rita R Colwell} } @article {15172, title = {Complete fairness in multi-party computation without an honest majority}, journal = {Theory of Cryptography}, year = {2009}, month = {2009///}, pages = {19 - 35}, abstract = {Gordon et al. recently showed that certain (non-trivial) functions can be computed with complete fairness in the two-party setting. Motivated by their results, we initiate a study of complete fairness in the multi-party case and demonstrate the first completely-fair protocols for non-trivial functions in this setting. We also provide evidence that achieving fairness is {\textquotedblleft}harder{\textquotedblright} in the multi-party setting, at least with regard to round complexity.}, doi = {10.1007/978-3-642-00457-5_2}, author = {Gordon,S. and Katz, Jonathan} } @article {16253, title = {Complete Genome Sequence of Aggregatibacter (Haemophilus) Aphrophilus NJ8700}, journal = {Journal of BacteriologyJ. Bacteriol.}, volume = {191}, year = {2009}, month = {2009/07/15/}, pages = {4693 - 4694}, abstract = {We report the finished and annotated genome sequence of Aggregatibacter aphrophilus strain NJ8700, a strain isolated from the oral flora of a healthy individual, and discuss characteristics that may affect its dual roles in human health and disease. This strain has a rough appearance, and its genome contains genes encoding a type VI secretion system and several factors that may participate in host colonization.}, isbn = {0021-9193, 1098-5530}, doi = {10.1128/JB.00447-09}, url = {http://jb.asm.org/content/191/14/4693}, author = {Di Bonaventura,Maria Pia and DeSalle,Rob and Pop, Mihai and Nagarajan,Niranjan and Figurski,David H and Fine,Daniel H and Kaplan,Jeffrey B and Planet,Paul J} } @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 {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.} } @article {13390, title = {On Computing Compression Trees for Data Collection in Sensor Networks}, journal = {arXiv:0907.5442}, year = {2009}, month = {2009/07/30/}, abstract = {We address the problem of efficiently gathering correlated data from a wired or a wireless sensor network, with the aim of designing algorithms with provable optimality guarantees, and understanding how close we can get to the known theoretical lower bounds. Our proposed approach is based on finding an optimal or a near-optimal {\em compression tree} for a given sensor network: a compression tree is a directed tree over the sensor network nodes such that the value of a node is compressed using the value of its parent. We consider this problem under different communication models, including the {\em broadcast communication} model that enables many new opportunities for energy-efficient data collection. We draw connections between the data collection problem and a previously studied graph concept, called {\em weakly connected dominating sets}, and we use this to develop novel approximation algorithms for the problem. We present comparative results on several synthetic and real-world datasets showing that our algorithms construct near-optimal compression trees that yield a significant reduction in the data collection cost.}, keywords = {Computer Science - Information Theory, Computer Science - Networking and Internet Architecture}, url = {http://arxiv.org/abs/0907.5442}, author = {Li,Jian and Deshpande, Amol and Khuller, Samir} } @article {16739, title = {Conceptual modeling: past, present and the continuum of the future}, journal = {Conceptual Modeling: Foundations and Applications}, year = {2009}, month = {2009///}, pages = {139 - 152}, author = {Roussopoulos, Nick and Karagiannis,D.} } @conference {15269, title = {A cooperative combinatorial Particle Swarm Optimization algorithm for side-chain packing}, booktitle = {IEEE Swarm Intelligence Symposium, 2009. SIS {\textquoteright}09}, year = {2009}, month = {2009/04/30/March}, pages = {22 - 29}, publisher = {IEEE}, organization = {IEEE}, abstract = {Particle Swarm Optimization (PSO) is a well-known, competitive technique for numerical optimization with real-parameter representation. This paper introduces CCPSO, a new Cooperative Particle Swarm Optimization algorithm for combinatorial problems. The cooperative strategy is achieved by splitting the candidate solution vector into components, where each component is optimized by a particle. Particles move throughout a continuous space, their movements based on the influences exerted by static particles that then get feedback based on the fitness of the candidate solution. Here, the application of this technique to side-chain packing (a proteomics optimization problem) is investigated. To verify the efficiency of the proposed CCPSO algorithm, we test our algorithm on three side-chain packing problems and compare our results with the provably optimal result. Computational results show that the proposed algorithm is very competitive, obtaining a conformation with an energy value within 1\% of the provably optimal solution in many proteins.}, keywords = {Algorithm design and analysis, Amino acids, combinatorial mathematics, cooperative combinatorial particle swarm optimization algorithm, Design optimization, Encoding, Feedback, numerical optimization, Optimization methods, particle swarm optimisation, Particle swarm optimization, Partitioning algorithms, Proteins, proteomics, proteomics optimization, Robustness, side-chain packing}, isbn = {978-1-4244-2762-8}, doi = {10.1109/SIS.2009.4937840}, author = {Lapizco-Encinas,G. and Kingsford, Carl and Reggia, James A.} } @article {16401, title = {Design guidelines for agent based model visualization}, journal = {Journal of Artificial Societies and Social Simulation}, volume = {12}, year = {2009}, month = {2009///}, pages = {1 - 1}, abstract = {In the field of agent-based modeling (ABM), visualizations play an important role in identifying, communicating and understanding important behavior of the modeled phenomenon. However, many modelers tend to create ineffective visualizations of Agent Based Models (ABM) due to lack of experience with visual design. This paper provides ABM visualization design guidelines in order to improve visual design with ABM toolkits. These guidelines will assist the modeler in creating clear and understandable ABM visualizations. We begin by introducing a non-hierarchical categorization of ABM visualizations. This categorization serves as a starting point in the creation of an ABM visualization. We go on to present well-known design techniques in the context of ABM visualization. These techniques are based on Gestalt psychology, semiology of graphics, and scientific visualization. They improve the visualization design by facilitating specific tasks, and providing a common language to critique visualizations through the use of visual variables. Subsequently, we discuss the application of these design techniques to simplify, emphasize and explain an ABM visualization. Finally, we illustrate these guidelines using a simple redesign of a NetLogo ABM visualization. These guidelines can be used to inform the development of design tools that assist users in the creation of ABM visualizations.}, author = {Kornhauser,D. and Wilensky,U. and Rand, William} } @conference {18563, title = {Detecting spammers with SNARE: spatio-temporal network-level automatic reputation engine}, booktitle = {Proceedings of the 18th conference on USENIX security symposium}, series = {SSYM{\textquoteright}09}, year = {2009}, month = {2009///}, pages = {101 - 118}, publisher = {USENIX Association}, organization = {USENIX Association}, address = {Berkeley, CA, USA}, abstract = {Users and network administrators need ways to filter email messages based primarily on the reputation of the sender. Unfortunately, conventional mechanisms for sender reputation--notably, IP blacklists--are cumbersome to maintain and evadable. This paper investigates ways to infer the reputation of an email sender based solely on network-level features, without looking at the contents of a message. First, we study first-order properties of network-level features that may help distinguish spammers from legitimate senders. We examine features that can be ascertained without ever looking at a packet{\textquoteright}s contents, such as the distance in IP space to other email senders or the geographic distance between sender and receiver. We derive features that are lightweight, since they do not require seeing a large amount of email from a single IP address and can be gleaned without looking at an email{\textquoteright}s contents--many such features are apparent from even a single packet. Second, we incorporate these features into a classification algorithm and evaluate the classifier{\textquoteright}s ability to automatically classify email senders as spammers or legitimate senders. We build an automated reputation engine, SNARE, based on these features using labeled data from a deployed commercial spam-filtering system. We demonstrate that SNARE can achieve comparable accuracy to existing static IP blacklists: about a 70\%detection rate for less than a 0.3\%false positive rate. Third, we show how SNARE can be integrated into existing blacklists, essentially as a first-pass filter.}, url = {http://dl.acm.org/citation.cfm?id=1855768.1855775}, author = {Hao,Shuang and Syed,Nadeem Ahmed and Feamster, Nick and Gray,Alexander G. and Krasser,Sven} } @article {12883, title = {Detection of toxigenic Vibrio cholerae O1 in freshwater lakes of the former Soviet Republic of Georgia}, journal = {Environmental Microbiology Reports}, volume = {2}, year = {2009}, month = {2009/09/03/}, pages = {2 - 6}, abstract = {Three freshwater lakes, Lisi Lake, Kumisi Lake and Tbilisi Sea, near Tbilisi, Georgia, were studied from January 2006 to December 2007 to determine the presence of Vibrio cholerae employing both bacteriological culture method and direct detection methods, namely PCR and direct fluorescent antibody (DFA). For PCR, DNA extracted from water samples was tested for presence of V. cholerae and genes coding for selected virulence factors. Vibrio cholerae non-O1/non-O139 was routinely isolated by culture from all three lakes; whereas V. cholerae O1 and O139 were not. Water samples collected during the summer months from Lisi Lake and Kumisi Lake were positive for both V. cholerae and V. cholerae ctxA, tcpA, zot, ompU and toxR by PCR. Water samples collected during the same period from both Lisi and Kumisi Lake were also positive for V. cholerae serogroup O1 by DFA. All of the samples were negative for V. cholerae serotype O139. The results of this study provide evidence for an environmental presence of toxigenic V. cholerae O1, which may represent a potential source of illness as these lakes serve as recreational water in Tbilisi, Georgia.}, isbn = {1758-2229}, doi = {10.1111/j.1758-2229.2009.00073.x}, url = {http://onlinelibrary.wiley.com/doi/10.1111/j.1758-2229.2009.00073.x/abstract?userIsAuthenticated=false\&deniedAccessCustomisedMessage=}, author = {Grim,Christopher J. and Jaiani,Ekaterina and Whitehouse,Chris A. and Janelidze,Nino and Kokashvili,Tamuna and Tediashvili,Marina and Rita R Colwell and Huq,Anwar} } @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 {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} } @conference {19597, title = {Dynamic Provable Data Possession}, booktitle = {CCS {\textquoteright}09 Proceedings of the 16th ACM Conference on Computer and Communications Security }, series = {CCS {\textquoteright}09}, year = {2009}, month = {2009///}, pages = {213 - 222}, publisher = {ACM}, organization = {ACM}, abstract = {We consider the problem of efficiently proving the integrity of data stored at untrusted servers. In the provable data possession (PDP) model, the client preprocesses the data and then sends it to an untrusted server for storage, while keeping a small amount of meta-data. The client later asks the server to prove that the stored data has not been tampered with or deleted (without downloading the actual data). However, the original PDP scheme applies only to static (or append-only) files. We present a definitional framework and efficient constructions for dynamic provable data possession (DPDP), which extends the PDP model to support provable updates to stored data. We use a new version of authenticated dictionaries based on rank information. The price of dynamic updates is a performance change from O(1) to O(logn) (or O(nεlog n), for a file consisting of n blocks, while maintaining the same (or better, respectively) probability of misbehavior detection. Our experiments show that this slowdown is very low in practice (e.g. 415KB proof size and 30ms computational overhead for a 1GB file). We also show how to apply our DPDP scheme to outsourced file systems and version control systems (e.g. CVS).}, keywords = {authenticated data structures, Authentication, integrity checking, outsourced storage, proof of retrievability, provable data possession, skip list}, isbn = {978-1-60558-894-0}, url = {http://doi.acm.org/10.1145/1653662.1653688}, author = {Erway, Chris and K{\"u}p\cc{\"u}, Alptekin and Charalampos Papamanthou and Tamassia, Roberto} } @article {18494, title = {Dynamics of online scam hosting infrastructure}, journal = {Passive and Active Network Measurement}, year = {2009}, month = {2009///}, pages = {219 - 228}, abstract = {This paper studies the dynamics of scam hosting infrastructure, with an emphasis on the role of fast-flux service networks. By monitoring changes in DNS records of over 350 distinct spam-advertised domains collected from URLs in 115,000 spam emails received at a large spam sinkhole, we measure the rates and locations of remapping DNS records, and the rates at which {\textquotedblleft}fresh{\textquotedblright} IP addresses are used. We find that, unlike the short-lived nature of the scams themselves, the infrastructure that hosts these scams has relatively persistent features that may ultimately assist detection.}, doi = {10.1007/978-3-642-00975-4_22}, author = {Konte,M. and Feamster, Nick and Jung,J.} } @conference {13364, title = {Ef?cient Query Evaluation over Temporally Correlated Probabilistic Streams}, booktitle = {IEEE 25th International Conference on Data Engineering, 2009. ICDE {\textquoteright}09}, year = {2009}, month = {2009/04/29/March}, pages = {1315 - 1318}, publisher = {IEEE}, organization = {IEEE}, abstract = {In this paper, we address the problem of efficient query evaluation over highly correlated probabilistic streams. We observe that although probabilistic streams tend to be strongly correlated in space and time, the correlations are usually quite structured (i.e., the same set of dependencies and independences repeat across time) and Markovian (i.e., the state at time "t+1" is independent of the states at previous times given the state at time "t"). We exploit this observation to compactly encode probabilistic streams by decoupling the correlation structure (the set of dependencies) from the actual probability values. We develop novel stream processing operators that can efficiently and incrementally process new data items; our operators are based on the previously proposed framework of viewing probabilistic query evaluation as inference over probabilistic graphical models (PGMs) [P. Sen and A. Deshpande, 2007]. We develop a query planning algorithm that constructs efficient query plans that are executable in polynomial-time whenever possible, and we characterize queries for which such plans are not possible. Finally we conduct an extensive experimental evaluation that illustrates the advantages of exploiting the structured nature of correlations in probabilistic streams.}, keywords = {Birds, Computerized monitoring, correlated probabilistic streams, correlation structure, Data engineering, data mining, Databases, Event detection, Graphical models, inference mechanisms, Markov processes, polynomial time, probabilistic database, probabilistic graphical model, probabilistic query evaluation, query evaluation, query planning algorithm, query plans, Query processing, Random variables, stream processing operator, Streaming media}, isbn = {978-1-4244-3422-0}, doi = {10.1109/ICDE.2009.229}, author = {Kanagal,B. and Deshpande, Amol} } @article {15127, title = {Efficient and secure authenticated key exchange using weak passwords}, journal = {Journal of the ACM (JACM)}, volume = {57}, year = {2009}, month = {2009/11//}, pages = {3:1{\textendash}3:39 - 3:1{\textendash}3:39}, abstract = {Mutual authentication and authenticated key exchange are fundamental techniques for enabling secure communication over public, insecure networks. It is well known how to design secure protocols for achieving these goals when parties share high-entropy cryptographic keys in advance of the authentication stage. Unfortunately, it is much more common for users to share weak, low-entropy passwords which furthermore may be chosen from a known space of possibilities (say, a dictionary of English words). In this case, the problem becomes much more difficult as one must ensure that protocols are immune to off-line dictionary attacks in which an adversary exhaustively enumerates all possible passwords in an attempt to determine the correct one. We propose a 3-round protocol for password-only authenticated key exchange, and provide a rigorous proof of security for our protocol based on the decisional Diffie-Hellman assumption. The protocol assumes only public parameters{\textemdash}specifically, a {\textquotedblleft}common reference string{\textquotedblright}{\textemdash}which can be {\textquotedblleft}hard-coded{\textquotedblright} into an implementation of the protocol; in particular, and in contrast to some previous work, our protocol does not require either party to pre-share a public key. The protocol is also remarkably efficient, requiring computation only (roughly) 4 times greater than {\textquotedblleft}classical{\textquotedblright} Diffie-Hellman key exchange that provides no authentication at all. Ours is the first protocol for password-only authentication that is both practical and provably-secure using standard cryptographic assumptions.}, keywords = {Authentication, cryptography, passwords}, isbn = {0004-5411}, doi = {10.1145/1613676.1613679}, url = {http://doi.acm.org/10.1145/1613676.1613679}, author = {Katz, Jonathan and Ostrovsky,Rafail and Yung,Moti} } @article {15382, title = {Electromagnetic Analysis of Plasmon-Resonance Based All-Optical Magnetic Recording}, journal = {Magnetics, IEEE Transactions on}, volume = {45}, year = {2009}, month = {2009/03//}, pages = {1634 - 1637}, abstract = {The electromagnetic analysis of plasmon-resonance-based all-optical magnetic recording is performed. This analysis is based on the treatment of plasmon resonances as an eigenvalue problem for specific boundary integral equations. The plasmon modes which can be excited in circular nanoholes and cylindrical nanoshells by circularly polarized light are theoretically and numerically studied. Dramatic enhancement of circularly polarized light intensity on the nanoscale through the excitation of specific plasmon modes in uniaxial nanostructures is demonstrated.}, keywords = {Ag;boundary, all-optical, analysis;magnetization, and, based, effects;nanoparticles;silver;surface, eigenfunctions;magnetic, equations;circular, equations;eigenvalues, integral, intensity;cylindrical, light, magnetic, modes;plasmon-resonance, nanoholes;circularly, nanoshells;eigenvalue, nanostructures;boundary, plasmon, polarized, problem;electromagnetic, recording;magnetisation, recording;silver;uniaxial, resonance;, reversal;magneto-optical, reversals;nanoparticle;plasmon}, isbn = {0018-9464}, doi = {10.1109/TMAG.2009.2012762}, author = {Mayergoyz, Issak D and Zhang,Zhenyu and McAvoy,P. and Bowen,D. and Krafft,C.} } @conference {18941, title = {Energy loss in MEMS resonators and the impact on inertial and RF devices}, year = {2009}, month = {2009/06//}, pages = {688 - 695}, abstract = {In this paper, we review the current understanding of energy loss mechanisms in micromachined (MEMS and NEMS) devices. We describe the importance of high quality factor (Q) to the performance of MEMS gyros and MEMS resonators used in radio-frequency applications.}, keywords = {energy loss, gyroscopes, inertial devices, MEMS gyros, MEMS resonators, micromachined devices, micromechanical resonators, NEMS devices, Q-factor, quality factor, radiofrequency applications, RF devices}, doi = {10.1109/SENSOR.2009.5285418}, author = {Weinberg,M. and Candler,R. and Chandorkar,S. and Varsanik,J. and Kenny,T. and Duwel,A.} } @inbook {15436, title = {Enhancing Testing Technologies for Globalization of Software Engineering and Productivity}, booktitle = {Handbook of Research on Software Engineering and Productivity Technologies: Implications of GlobalizationHandbook of Research on Software Engineering and Productivity Technologies: Implications of Globalization}, year = {2009}, month = {2009///}, pages = {49 - 49}, publisher = {Idea Group Inc (IGI)}, organization = {Idea Group Inc (IGI)}, isbn = {1605667315, 9781605667317}, author = {Khan,A.H. and Memon, Atif M.} } @article {14577, title = {The evolution of Fox genes and their role in development and disease}, journal = {Nature reviews. GeneticsNat Rev Genet}, volume = {10}, year = {2009}, month = {2009/04//}, pages = {233 - 240}, abstract = {The forkhead box (Fox) family of transcription factors, which originated in unicellular eukaryotes, has expanded over time through multiple duplication events, and sometimes through gene loss, to over 40 members in mammals. Fox genes have evolved to acquire a specialized function in many key biological processes. Mutations in Fox genes have a profound effect on human disease, causing phenotypes as varied as cancer, glaucoma and language disorders. We summarize the salient features of the evolution of the Fox gene family and highlight the diverse contribution of various Fox subfamilies to developmental processes, from organogenesis to speech acquisition.}, isbn = {1471-0056}, doi = {10.1038/nrg2523}, author = {Hannenhalli, Sridhar and Kaestner,Klaus H.} } @article {15114, title = {On expected constant-round protocols for Byzantine agreement}, journal = {Journal of Computer and System Sciences}, volume = {75}, year = {2009}, month = {2009/02//}, pages = {91 - 112}, abstract = {In a seminal paper, Feldman and Micali show an n-party Byzantine agreement protocol in the plain model that tolerates t \< n / 3 malicious parties and runs in expected constant rounds. Here, resolving a question that had been open since their work, we show an expected constant-round protocol for authenticated Byzantine agreement assuming honest majority (i.e., t \< n / 2 ), and relying only on the existence of signature schemes and a public-key infrastructure. Combined with existing results, this gives the first expected constant-round protocol for secure computation with honest majority in a point-to-point network under the same assumptions. Our key technical tool {\textemdash} a new primitive we introduce called moderated VSS {\textemdash} also yields a simpler proof of the Feldman{\textendash}Micali result.In addition, we show a simple technique for sequential composition of Byzantine agreement protocols that do not achieve simultaneous termination, something that is inherent for protocols using o ( t ) rounds. }, keywords = {broadcast, cryptography, Distributed computing, secure computation}, isbn = {0022-0000}, doi = {10.1016/j.jcss.2008.08.001}, url = {http://www.sciencedirect.com/science/article/pii/S0022000008000718}, author = {Katz, Jonathan and Koo,Chiu-Yuen} } @article {15276, title = {Finding Biologically Accurate Clusterings in Hierarchical Decompositions Using the Variation of Information}, journal = {Lecture Notes in Computer Science: Research in Computational Molecular Biology}, volume = {5541}, year = {2009}, month = {2009///}, pages = {400 - 417}, author = {Navlakha,S. and White,J. R. and Nagarajan,N. and Pop, Mihai and Kingsford, Carl} } @inbook {16263, title = {Finding Biologically Accurate Clusterings in Hierarchical Tree Decompositions Using the Variation of Information}, booktitle = {Research in Computational Molecular Biology}, series = {Lecture Notes in Computer Science}, volume = {5541}, year = {2009}, month = {2009///}, pages = {400 - 417}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {Hierarchical clustering is a popular method for grouping together similar elements based on a distance measure between them. In many cases, annotations for some elements are known beforehand, which can aid the clustering process. We present a novel approach for decomposing a hierarchical clustering into the clusters that optimally match a set of known annotations, as measured by the variation of information metric. Our approach is general and does not require the user to enter the number of clusters desired. We apply it to two biological domains: finding protein complexes within protein interaction networks and identifying species within metagenomic DNA samples. For these two applications, we test the quality of our clusters by using them to predict complex and species membership, respectively. We find that our approach generally outperforms the commonly used heuristic methods.}, isbn = {978-3-642-02007-0}, url = {http://dx.doi.org/10.1007/978-3-642-02008-7_29}, author = {Navlakha,Saket and White,James and Nagarajan,Niranjan and Pop, Mihai and Kingsford, Carl}, editor = {Batzoglou,Serafim} } @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 {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 {14553, title = {Hat guessing games}, journal = {SIAM review}, volume = {51}, year = {2009}, month = {2009///}, pages = {399 - 413}, author = {Butler,S. and Hajiaghayi, Mohammad T. and Kleinberg,R. D and Leighton,T.} } @article {18222, title = {High-Fidelity Data Embedding for Image Annotation}, journal = {Image Processing, IEEE Transactions on}, volume = {18}, year = {2009}, month = {2009/02//}, pages = {429 - 435}, abstract = {High fidelity is a demanding requirement for data hiding, especially for images with artistic or medical value. This correspondence proposes a high-fidelity image watermarking for annotation with robustness to moderate distortion. To achieve the high fidelity of the embedded image, we introduce a visual perception model that aims at quantifying the local tolerance to noise for arbitrary imagery. Based on this model, we embed two kinds of watermarks: a pilot watermark that indicates the existence of the watermark and an information watermark that conveys a payload of several dozen bits. The objective is to embed 32 bits of metadata into a single image in such a way that it is robust to JPEG compression and cropping. We demonstrate the effectiveness of the visual model and the application of the proposed annotation technology using a database of challenging photographic and medical images that contain a large amount of smooth regions.}, keywords = {Automated;Product Labeling;Reproducibility of Results;Sensitivity and Specificity;Signal Processing, Computer-Assisted;, Computer-Assisted;Information Storage and Retrieval;Pattern Recognition, JPEG compression;JPEG cropping;arbitrary imagery;data hiding;high-fidelity data embedding;image annotation;image watermarking;medical images;photographic images;data compression;image coding;watermarking;Algorithms;Computer Graphics;Documentation;Image En}, isbn = {1057-7149}, doi = {10.1109/TIP.2008.2008733}, author = {He,Shan and Kirovski,D. and M. Wu} } @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 {14560, title = {Improved approximation algorithms for prize-collecting Steiner tree and TSP}, booktitle = {2009 50th Annual IEEE Symposium on Foundations of Computer Science}, year = {2009}, month = {2009///}, pages = {427 - 436}, author = {Archer,A. and Bateni,M. H and Hajiaghayi, Mohammad T. and Karloff,H.} } @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} } @article {15110, title = {Improving the round complexity of VSS in point-to-point networks}, journal = {Information and Computation}, volume = {207}, year = {2009}, month = {2009/08//}, pages = {889 - 899}, abstract = {We revisit the following question: what is the optimal round complexity of verifiable secret sharing (VSS)? We focus here on the case of perfect VSS where the number of corrupted parties t satisfies t \< n / 3 , with n the total number of parties. Work of Gennaro et al.\&$\#$xa0;(STOC 2001) and Fitzi et al. (TCC 2006) shows that, assuming a broadcast channel, three rounds are necessary and sufficient for efficient VSS. Existing protocols, however, treat the broadcast channel as being available {\textquotedblleft}for free{\textquotedblright} and do not attempt to minimize its usage. This approach leads to relatively poor round complexity when such protocols are compiled to run over a point-to-point network.We show here a VSS protocol that is simultaneously optimal in terms of both the number of rounds and the number of invocations of broadcast. Our protocol also satisfies a certain {\textquotedblleft}2-level sharing{\textquotedblright} property that makes it useful for constructing protocols for general secure computation. }, isbn = {0890-5401}, doi = {10.1016/j.ic.2009.03.007}, url = {http://www.sciencedirect.com/science/article/pii/S0890540109000935}, author = {Katz, Jonathan and Koo,Chiu-Yuen and Kumaresan,Ranjit} } @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.} } @conference {13375, title = {Indexing correlated probabilistic databases}, booktitle = {Proceedings of the 35th SIGMOD international conference on Management of data}, series = {SIGMOD {\textquoteright}09}, year = {2009}, month = {2009///}, pages = {455 - 468}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {With large amounts of correlated probabilistic data being generated in a wide range of application domains including sensor networks, information extraction, event detection etc., effectively managing and querying them has become an important research direction. While there is an exhaustive body of literature on querying independent probabilistic data, supporting efficient queries over large-scale, correlated databases remains a challenge. In this paper, we develop efficient data structures and indexes for supporting inference and decision support queries over such databases. Our proposed hierarchical data structure is suitable both for in-memory and disk-resident databases. We represent the correlations in the probabilistic database using a junction tree over the tuple-existence or attribute-value random variables, and use tree partitioning techniques to build an index structure over it. We show how to efficiently answer inference and aggregation queries using such an index, resulting in orders of magnitude performance benefits in most cases. In addition, we develop novel algorithms for efficiently keeping the index structure up-to-date as changes (inserts, updates) are made to the probabilistic database. We present a comprehensive experimental study illustrating the benefits of our approach to query processing in probabilistic databases.}, keywords = {caching, Indexing, inference queries, junction trees, Probabilistic databases}, isbn = {978-1-60558-551-2}, doi = {10.1145/1559845.1559894}, url = {http://doi.acm.org/10.1145/1559845.1559894}, author = {Kanagal,Bhargav and Deshpande, Amol} } @conference {17242, title = {Interacting with eHealth: towards grand challenges for HCI}, booktitle = {Proceedings of the 27th international conference extended abstracts on Human factors in computing systems}, year = {2009}, month = {2009///}, pages = {3309 - 3312}, abstract = {While health records are increasingly stored electronically, we, as citizens, have little access to this data about ourselves. We are not used to thinking of these official records either as ours or as useful to us. We increasingly turn to the Web, however, to query any ache, pain or health goal we may have before consulting with health care professionals. Likewise, for proactive health care such as nutrition or fitness, or to find fellow-sufferers for post diagnosis support, we turn to online resources. There is a potential disconnect between points at which professional and lay eHealth data and resources intersect for preventative or proactive health care. Such gaps in information sharing may have direct impact on practices we decide to take up, the care we seek, or the support professionals offer. In this panel, we consider several places within proactive, preventative health care in particular HCI has a role towards enhancing health knowledge discovery and health support interaction. Our goal is to demonstrate how now is the time for eHealth to come to the forefront of the HCI research agenda.}, author = {Andr{\'e},P. and White,R. and Tan,D. and Berners-Lee,T. and Consolvo,S. and Jacobs,R. and Kohane,I. and Le Dantec,C.A. and Mamykina,L. and Marsden,G.} } @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 {12888, title = {Microbial oceanography in a sea of opportunity}, journal = {Nature}, volume = {459}, year = {2009}, month = {2009/05/13/}, pages = {180 - 184}, abstract = {Plankton use solar energy to drive the nutrient cycles that make the planet habitable for larger organisms. We can now explore the diversity and functions of plankton using genomics, revealing the gene repertoires associated with survival in the oceans. Such studies will help us to appreciate the sensitivity of ocean systems and of the ocean{\textquoteright}s response to climate change, improving the predictive power of climate models.}, 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/nature08056}, url = {http://www.nature.com/nature/journal/v459/n7244/abs/nature08056.html}, author = {Bowler,Chris and Karl,David M. and Rita R Colwell} } @conference {13385, title = {Minimizing Communication Cost in Distributed Multi-query Processing}, booktitle = {IEEE 25th International Conference on Data Engineering, 2009. ICDE {\textquoteright}09}, year = {2009}, month = {2009/04/29/March}, pages = {772 - 783}, publisher = {IEEE}, organization = {IEEE}, abstract = {Increasing prevalence of large-scale distributed monitoring and computing environments such as sensor networks, scientific federations, Grids etc., has led to a renewed interest in the area of distributed query processing and optimization. In this paper we address a general, distributed multi-query processing problem motivated by the need to minimize the communication cost in these environments. Specifically we address the problem of optimally sharing data movement across the communication edges in a distributed communication network given a set of overlapping queries and query plans for them (specifying the operations to be executed). Most of the problem variations of our general problem can be shown to be NP-Hard by a reduction from the Steiner tree problem. However, we show that the problem can be solved optimally if the communication network is a tree, and present a novel algorithm for finding an optimal data movement plan. For general communication networks, we present efficient approximation algorithms for several variations of the problem. Finally, we present an experimental study over synthetic datasets showing both the need for exploiting the sharing of data movement and the effectiveness of our algorithms at finding such plans.}, keywords = {Approximation algorithms, Communication networks, Computer science, Cost function, Data engineering, distributed communication network, distributed databases, distributed multi-query processing, grid computing, Large-scale systems, NP-hard, optimisation, Polynomials, Publish-subscribe, publish-subscribe systems, Query optimization, Query processing, sensor networks, Steiner tree problem, Tree graphs, trees (mathematics)}, isbn = {978-1-4244-3422-0}, doi = {10.1109/ICDE.2009.85}, author = {Li,Jian and Deshpande, Amol and Khuller, Samir} } @conference {13970, title = {Modal expansion of HRTFs: Continuous representation in frequency-range-angle}, booktitle = {Acoustics, Speech and Signal Processing, 2009. ICASSP 2009. IEEE International Conference on}, year = {2009}, month = {2009/04//}, pages = {285 - 288}, abstract = {This paper proposes a continuous HRTF representation in both 3D spatial and frequency domains. The method is based on the acoustic reciprocity principle and a modal expansion of the wave equation solution to represent the HRTF variations with different variables in separate basis functions. The derived spatial basis modes can achieve HRTF near-field and far-field representation in one formulation. The HRTF frequency components are expanded using Fourier Spherical Bessel series for compact representation. The proposed model can be used to reconstruct HRTFs at any arbitrary position in space and at any frequency point from a finite number of measurements. Analytical simulated and measured HRTFs from a KEMAR are used to validate the model.}, keywords = {analysis;signal, bessel, domains;frequency-range-angle;head, expansion;modal, Fourier, function;modal, functions;, reconstruction;signal, related, representation;transfer, series;HRTF;frequency, spherical, transfer}, doi = {10.1109/ICASSP.2009.4959576}, author = {Zhang,Wen and Abhayapala,T.D. and Kennedy,R.A. and Duraiswami, Ramani} } @article {15390, title = {Modeling and Testing of Ethernet Transformers}, journal = {Magnetics, IEEE Transactions on}, volume = {45}, year = {2009}, month = {2009/10//}, pages = {4793 - 4796}, abstract = {In this paper, novel techniques for the testing and identification of lumped parameters of equivalent circuits for Ethernet transformers are presented. It is demonstrated experimentally and theoretically that resonance phenomena may occur in the loop formed by leakage inductances and cross-winding capacitance. This resonance may corrupt the pass band of the transformers transfer characteristic for differential-mode signals.}, keywords = {area, capacitance;differential-mode, characteristic;local, Ethernet, identification;lumped, inductances;lumped, networks;transformers;, PARAMETERS, phenomena;transformers, signals;leakage, testing;resonance, transfer, transformers;cross-winding}, isbn = {0018-9464}, doi = {10.1109/TMAG.2009.2023918}, author = {Bowen,D. and Mayergoyz, Issak D and Zhang,Zhenyu and McAvoy,P. and Krafft,C. and Kroop,D.} } @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 {13103, title = {Observing Human-Object Interactions: Using Spatial and Functional Compatibility for Recognition}, journal = {Pattern Analysis and Machine Intelligence, IEEE Transactions on}, volume = {31}, year = {2009}, month = {2009/10//}, pages = {1775 - 1789}, abstract = {Interpretation of images and videos containing humans interacting with different objects is a daunting task. It involves understanding scene or event, analyzing human movements, recognizing manipulable objects, and observing the effect of the human movement on those objects. While each of these perceptual tasks can be conducted independently, recognition rate improves when interactions between them are considered. Motivated by psychological studies of human perception, we present a Bayesian approach which integrates various perceptual tasks involved in understanding human-object interactions. Previous approaches to object and action recognition rely on static shape or appearance feature matching and motion analysis, respectively. Our approach goes beyond these traditional approaches and applies spatial and functional constraints on each of the perceptual elements for coherent semantic interpretation. Such constraints allow us to recognize objects and actions when the appearances are not discriminative enough. We also demonstrate the use of such constraints in recognition of actions from static images without using any motion information.}, keywords = {Automated;Recognition (Psychology);Video Recording;, Bayesian approach;functional compatibility;human perception;human-object interactions;objects recognition;psychological studies;spatial compatibility;Bayes methods;behavioural sciences;human factors;image recognition;motion estimation;object recognition;A, Biological;Movement;Pattern Recognition, Computer-Assisted;Models}, isbn = {0162-8828}, doi = {10.1109/TPAMI.2009.83}, author = {Gupta,A. and Kembhavi,A. and Davis, Larry S.} } @conference {15258, title = {Online allocation of display advertisements subject to advanced sales contracts}, booktitle = {Proceedings of the Third International Workshop on Data Mining and Audience Intelligence for Advertising}, series = {ADKDD {\textquoteright}09}, year = {2009}, month = {2009///}, pages = {69 - 77}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {In this paper we propose a utility model that accounts for both sales and branding advertisers. We first study the computational complexity of optimization problems related to both online and offline allocation of display advertisements. Next, we focus on a particular instance of the online allocation problem, and design a simple online algorithm with provable approximation guarantees. Our algorithm is near optimal as is shown by a matching lower bound. Finally, we report on experiments to establish actual case behavior on some real datasets, with encouraging results.}, keywords = {display advertising, modeling, online algorithms, OPTIMIZATION, simulation}, isbn = {978-1-60558-671-7}, doi = {10.1145/1592748.1592758}, url = {http://doi.acm.org/10.1145/1592748.1592758}, author = {Alaei,Saeed and Arcaute,Esteban and Khuller, Samir and Ma,Wenjing and Malekian,Azarakhsh and Tomlin,John} } @conference {13619, title = {Page Rule-Line Removal using Linear Subspaces in Monochromatic Handwritten Arabic Documents}, booktitle = {Intl. Conf. on Document Analysis and Recognition (ICDAR 09)}, year = {2009}, month = {2009///}, pages = {768 - 772}, abstract = {In this paper we present a novel method for removing page rule lines in monochromatic handwritten Arabic documents using subspace methods with minimal effect on the quality of the foreground text. We use moment and histogram properties to extract features that represent the characteristics of the underlying rule lines. A linear subspace is incrementally built to obtain a line model that can be used to identify rule line pixels. We also introduce a novel scheme for evaluating noise removal algorithms in general and we use it to assess the quality of our rule line removal algorithm. Experimental results presented on a data set of 50 Arabic documents, handwritten by different writers, demonstrate the effectiveness of the proposed method.}, author = {Abd-Almageed, Wael and Kumar,Jayant and David Doermann} } @article {12972, title = {A phylogenetic mixture model for the evolution of gene expression}, journal = {Molecular biology and evolution}, volume = {26}, year = {2009}, month = {2009///}, pages = {2363 - 2363}, author = {Eng,K. H and Corrada Bravo, Hector and Kele{\c s},S.} } @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 {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 {13116, title = {Probabilistic graphical models}, journal = {IEEE transactions on pattern analysis and machine intelligence}, volume = {31}, year = {2009}, month = {2009///}, pages = {1775 - 1789}, author = {Gupta,A. and Kembhavi,A. and Davis, Larry S.} } @book {14511, title = {Proceedings of the 1st ACM SIGKDD Workshop on Knowledge Discovery from Uncertain Data}, year = {2009}, month = {2009///}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {The importance of uncertain data is growing quickly in many essential applications such as environmental surveillance, mobile object tracking and data integration. Recently, storing, collecting, processing, and analyzing uncertain data has attracted increasing attention from both academia and industry. Analyzing and mining uncertain data needs collaboration and joint effort from multiple research communities including reasoning under uncertainty, uncertain databases and mining uncertain data. For example, statistics and probabilistic reasoning can provide support with models for representing uncertainty. The uncertain database community can provide methods for storing and managing uncertain data, while research in mining uncertain data can provide data analysis tasks and methods. It is important to build connections among those communities to tackle the overall problem of analyzing and mining uncertain data. There are many common challenges among the communities. One is to understand the different modeling assumptions made, and how they impact the methods, both in terms of accuracy and efficiency. Different researchers hold different assumptions and this is one of the major obstacles in the research of mining uncertain data. Another is the scalability of proposed management and analysis methods. Finally, to make analysis and mining useful and practical, we need real data sets for testing. Unfortunately, uncertain data sets are often hard to get. The goal of the First ACM SIGKDD Workshop on Knowledge Discovery from Uncertain Data (U{\textquoteright}09) is to discuss in depth the challenges, opportunities and techniques on the topic of analyzing and mining uncertain data. The theme of this workshop is to make connections among the research areas of uncertain databases, probabilistic reasoning, and data mining, as well as to build bridges among the aspects of models, data, applications, novel mining tasks and effective solutions. By making connections among different communities, we aim at understanding each other in terms of scientific foundation as well as commonality and differences in research methodology. The workshop program is very stimulating and exciting. We are pleased to feature two invited talks by pioneers in mining uncertain data. Christopher Jermaine will give an invited talk titled "Managing and Mining Uncertain Data: What Might We Do Better?" Matthias Renz will address the topic "Querying and Mining Uncertain Data: Methods, Applications, and Challenges". Moreover, 8 accepted papers in 4 full presentations and 4 concise presentations will cover a bunch of interesting topics and on-going research projects about uncertain data mining.}, isbn = {978-1-60558-675-5}, editor = {Pei,Jian and Getoor, Lise and de Keijzer,Ander} } @article {15081, title = {Proofs of storage from homomorphic identification protocols}, journal = {Advances in Cryptology{\textendash}ASIACRYPT 2009}, year = {2009}, month = {2009///}, pages = {319 - 333}, abstract = {Proofs of storage (PoS) are interactive protocols allowing a client to verify that a server faithfully stores a file. Previous work has shown that proofs of storage can be constructed from any homomorphic linear authenticator (HLA). The latter, roughly speaking, are signature/message authentication schemes where {\textquoteleft}tags{\textquoteright} on multiple messages can be homomorphically combined to yield a {\textquoteleft}tag{\textquoteright} on any linear combination of these messages.We provide a framework for building public-key HLAs from any identification protocol satisfying certain homomorphic properties. We then show how to turn any public-key HLA into a publicly-verifiable PoS with communication complexity independent of the file length and supporting an unbounded number of verifications. We illustrate the use of our transformations by applying them to a variant of an identification protocol by Shoup, thus obtaining the first unbounded-use PoS based on factoring (in the random oracle model). }, doi = {10.1007/978-3-642-10366-7_19}, author = {Ateniese,G. and Kamara,S. and Katz, Jonathan} } @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 {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 {15119, title = {Ring signatures: Stronger definitions, and constructions without random oracles}, journal = {Journal of Cryptology}, volume = {22}, year = {2009}, month = {2009///}, pages = {114 - 138}, abstract = {Ring signatures, first introduced by Rivest, Shamir, and Tauman, enable a user to sign a message so that a ring of possible signers (of which the user is a member) is identified, without revealing exactly which member of that ring actually generated the signature. In contrast to group signatures, ring signatures are completely {\textquotedblleft}ad-hoc{\textquotedblright} and do not require any central authority or coordination among the various users (indeed, users do not even need to be aware of each other); furthermore, ring signature schemes grant users fine-grained control over the level of anonymity associated with any particular signature.This paper has two main areas of focus. First, we examine previous definitions of security for ring signature schemes and suggest that most of these prior definitions are too weak, in the sense that they do not take into account certain realistic attacks. We propose new definitions of anonymity and unforgeability which address these threats, and give separation results proving that our new notions are strictly stronger than previous ones. Second, we show the first constructions of ring signature schemes in the standard model. One scheme is based on generic assumptions and satisfies our strongest definitions of security. Two additional schemes are more efficient, but achieve weaker security guarantees and more limited functionality. }, doi = {10.1007/s00145-007-9011-9}, author = {Bender,A. and Katz, Jonathan and Morselli,R.} } @article {17926, title = {Saliency-guided lighting}, journal = {IEICE TRANSACTIONS on Information and Systems}, volume = {2}, year = {2009}, month = {2009///}, pages = {369 - 73}, author = {Lee,C. H and Kim,Y. and Varshney, Amitabh} } @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} } @conference {14562, title = {Scheduling to minimize staleness and stretch in real-time data warehouses}, booktitle = {Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures}, year = {2009}, month = {2009///}, pages = {29 - 38}, author = {Bateni,M. H and Golab,L. and Hajiaghayi, Mohammad T. and Karloff,H.} } @conference {18352, title = {Searching documentation using text, OCR, and image}, booktitle = {Proceedings of the 32nd international ACM SIGIR conference on Research and development in information retrieval}, series = {SIGIR {\textquoteright}09}, year = {2009}, month = {2009///}, pages = {776 - 777}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {We describe a mixed-modality method to index and search software documentation in three ways: plain text, OCR text of embedded figures, and visual features of these figures. Using a corpus of 102 computer books with a total of 62,943 pages and 75,800 figures, we empirically demonstrate that our method achieves better precision/recall than do alternatives based on single modalities.}, keywords = {Computer vision, content-based image retrieval, multimodal search}, isbn = {978-1-60558-483-6}, doi = {10.1145/1571941.1572123}, url = {http://doi.acm.org/10.1145/1571941.1572123}, author = {Tom Yeh and Katz,Boris} } @article {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} } @article {15082, title = {Signature schemes with bounded leakage resilience}, journal = {Advances in Cryptology{\textendash}ASIACRYPT 2009}, year = {2009}, month = {2009///}, pages = {703 - 720}, abstract = {A leakage-resilient cryptosystem remains secure even if arbitrary, but bounded, information about the secret key (and possibly other internal state information) is leaked to an adversary. Denote the length of the secret key by n. We show:{\textbullet} A full-fledged signature scheme tolerating leakage of n - n ε bits of information about the secret key (for any constant ε> 0), based on general assumptions. {\textbullet} A one-time signature scheme, based on the minimal assumption of one-way functions, tolerating leakage of (41-)n bits of information about the signer{\textquoteright}s entire state. {\textbullet} A more efficient one-time signature scheme, that can be based on several specific assumptions, tolerating leakage of (21-)n bits of information about the signer{\textquoteright}s entire state. The latter two constructions extend to give leakage-resilient t-time signature schemes. All the above constructions are in the standard model. }, doi = {10.1007/978-3-642-10366-7_41}, author = {Katz, Jonathan and Vaikuntanathan,V.} } @article {15151, title = {Signing a linear subspace: Signature schemes for network coding}, journal = {Public Key Cryptography{\textendash}PKC 2009}, year = {2009}, month = {2009///}, pages = {68 - 87}, abstract = {Network coding offers increased throughput and improved robustness to random faults in completely decentralized networks. In contrast to traditional routing schemes, however, network coding requires intermediate nodes to modify data packets en route; for this reason, standard signature schemes are inapplicable and it is a challenge to provide resilience to tampering by malicious nodes.We propose two signature schemes that can be used in conjunction with network coding to prevent malicious modification of data. Our schemes can be viewed as signing linear subspaces in the sense that a signature σ on a subspace V authenticates exactly those vectors in V. Our first scheme is (suitably) homomorphic and has constant public-key size and per-packet overhead. Our second scheme does not rely on random oracles and is based on weaker assumptions. We also prove a lower bound on the length of signatures for linear subspaces showing that our schemes are essentially optimal in this regard. }, doi = {10.1007/978-3-642-00468-1_5}, author = {Boneh,D. and Freeman,D. and Katz, Jonathan and Waters,B.} } @article {15083, title = {Smooth projective hashing and password-based authenticated key exchange from lattices}, journal = {Advances in Cryptology{\textendash}ASIACRYPT 2009}, year = {2009}, month = {2009///}, pages = {636 - 652}, abstract = {We describe a public-key encryption scheme based on lattices {\textemdash} specifically, based on the hardness of the learning with error (LWE) problem {\textemdash} that is secure against chosen-ciphertext attacks while admitting (a variant of) smooth projective hashing. This encryption scheme suffices to construct a protocol for password-based authenticated key exchange (PAKE) that can be proven secure based on the LWE assumption in the standard model. We thus obtain the first PAKE protocol whose security relies on a lattice-based assumption.}, doi = {10.1007/978-3-642-10366-7_37}, author = {Katz, Jonathan and Vaikuntanathan,V.} } @article {15030, title = {Streaming model based volume ray casting implementation for Cell Broadband Engine}, journal = {Scientific Programming}, volume = {17}, year = {2009}, month = {2009/01/01/}, pages = {173 - 184}, abstract = {Interactive high quality volume rendering is becoming increasingly more important as the amount of more complex volumetric data steadily grows. While a number of volumetric rendering techniques have been widely used, ray casting has been recognized as an effective approach for generating high quality visualization. However, for most users, the use of ray casting has been limited to datasets that are very small because of its high demands on computational power and memory bandwidth. However the recent introduction of the Cell Broadband Engine (Cell B.E.) processor, which consists of 9 heterogeneous cores designed to handle extremely demanding computations with large streams of data, provides an opportunity to put the ray casting into practical use. In this paper, we introduce an efficient parallel implementation of volume ray casting on the Cell B.E. The implementation is designed to take full advantage of the computational power and memory bandwidth of the Cell B.E. using an intricate orchestration of the ray casting computation on the available heterogeneous resources. Specifically, we introduce streaming model based schemes and techniques to efficiently implement acceleration techniques for ray casting on Cell B.E. In addition to ensuring effective SIMD utilization, our method provides two key benefits: there is no cost for empty space skipping and there is no memory bottleneck on moving volumetric data for processing. Our experimental results show that we can interactively render practical datasets on a single Cell B.E. processor.}, doi = {10.3233/SPR-2009-0267}, url = {http://dx.doi.org/10.3233/SPR-2009-0267}, author = {Kim,Jusub and JaJa, Joseph F.} } @article {18721, title = {Structure of the S5a:K48-Linked Diubiquitin Complex and Its Interactions with Rpn13}, journal = {Molecular Cell}, volume = {35}, year = {2009}, month = {2009/08/14/}, pages = {280 - 290}, abstract = {SummaryDegradation by the proteasome typically requires substrate ubiquitination. Two ubiquitin receptors exist in the proteasome, S5a/Rpn10 and Rpn13. Whereas Rpn13 has only one ubiquitin-binding surface, S5a binds ubiquitin with two independent ubiquitin-interacting motifs (UIMs). Here, we use nuclear magnetic resonance (NMR) and analytical ultracentrifugation to define at atomic level resolution how S5a binds K48-linked diubiquitin, in which K48 of~one ubiquitin subunit (the {\textquotedblleft}proximal{\textquotedblright} one) is covalently bonded to G76 of the other (the {\textquotedblleft}distal{\textquotedblright} subunit). We demonstrate that S5a{\textquoteright}s UIMs bind the two subunits simultaneously with a preference for UIM2 binding to the proximal subunit while UIM1 binds to the distal one. In addition, NMR experiments reveal that Rpn13 and S5a bind K48-linked diubiquitin simultaneously with subunit specificity, and a model structure of S5a and Rpn13 bound to K48-linked polyubiquitin is provided. Altogether, our data demonstrate that S5a is highly adaptive and cooperative toward binding ubiquitin chains. }, keywords = {Proteins}, isbn = {1097-2765}, doi = {10.1016/j.molcel.2009.06.010}, url = {http://www.sciencedirect.com/science/article/pii/S1097276509004018}, author = {Zhang,Naixia and Wang,Qinghua and Ehlinger,Aaron and Randles,Leah and Lary,Jeffrey W. and Kang,Yang and Haririnia,Aydin and Storaska,Andrew J. and Cole,James L. and Fushman, David and Walters,Kylie J.} } @article {15275, title = {A synthesis for exactly 3-edge-connected graphs}, journal = {Arxiv preprint arXiv:0905.1053}, year = {2009}, month = {2009///}, author = {Kingsford, Carl and Mar{\c c}ais,G.} } @article {18921, title = {Task decomposition on abstract states, for planning under nondeterminism}, journal = {Artificial Intelligence}, volume = {173}, year = {2009}, month = {2009/04//}, pages = {669 - 695}, abstract = {Although several approaches have been developed for planning in nondeterministic domains, solving large planning problems is still quite difficult. In this work, we present a new planning algorithm, called Yoyo, for solving planning problems in fully observable nondeterministic domains. Yoyo combines an HTN-based mechanism for constraining its search and a Binary Decision Diagram (BDD) representation for reasoning about sets of states and state transitions.We provide correctness theorems for Yoyo, and an experimental comparison of it with MBP and ND-SHOP2, the two previously-best algorithms for planning in nondeterministic domains. In our experiments, Yoyo could easily deal with problem sizes that neither MBP nor ND-SHOP2 could scale up to, and could solve problems about 100 to 1000 times faster than MBP and ND-SHOP2. }, keywords = {Binary decision diagrams, Hierarchical task-network (HTN) planning, Planning in nondeterministic domains}, isbn = {0004-3702}, doi = {10.1016/j.artint.2008.11.012}, url = {http://www.sciencedirect.com/science/article/pii/S0004370208001987}, author = {Kuter,Ugur and Nau, Dana S. and Pistore,Marco and Traverso,Paolo} } @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 {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} } @conference {18884, title = {Translating HTNs to PDDL: A small amount of domain knowledge can go a long way}, year = {2009}, month = {2009///}, pages = {1629 - 1634}, abstract = {We show how to translate HTN domain descrip- tions (if they satisfy certain restrictions) into PDDL so that they can be used by classical planners. We provide correctness results for our translation al- gorithm, and show that it runs in linear time and space. We also show that even small and incom- plete amounts of HTN knowledge, when translated into PDDL using our algorithm, can greatly im- prove a classical planner{\textquoteright}s performance. In ex- periments on several thousand randomly gener- ated problems in three different planning domains, such knowledge speeded up the well-known Fast- Forward planner by several orders of magnitude, and enabled it to solve much larger problems than it could otherwise solve.}, url = {https://www.aaai.org/ocs/index.php/IJCAI/IJCAI-09/paper/download/573/853}, author = {Alford,R. and Kuter,U. and Nau, Dana S.} } @conference {14346, title = {UbiGreen: investigating a mobile tool for tracking and supporting green transportation habits}, booktitle = {Proceedings of the 27th international conference on Human factors in computing systems}, series = {CHI {\textquoteright}09}, year = {2009}, month = {2009///}, pages = {1043 - 1052}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, keywords = {ambient displays, mobile phones, sensing, Sustainability, transportation, ubicomp}, isbn = {978-1-60558-246-7}, doi = {10.1145/1518701.1518861}, url = {http://doi.acm.org/10.1145/1518701.1518861}, author = {Jon Froehlich and Dillahunt,Tawanna and Klasnja,Predrag and Mankoff,Jennifer and Consolvo,Sunny and Harrison,Beverly and Landay,James A.} } @article {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} } @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} } @conference {14849, title = {Visibility constraints on features of 3D objects}, booktitle = {Computer Vision and Pattern Recognition, 2009. CVPR 2009. IEEE Conference on}, year = {2009}, month = {2009/06//}, pages = {1231 - 1238}, abstract = {To recognize three-dimensional objects it is important to model how their appearances can change due to changes in viewpoint. A key aspect of this involves understanding which object features can be simultaneously visible under different viewpoints. We address this problem in an image-based framework, in which we use a limited number of images of an object taken from unknown viewpoints to determine which subsets of features might be simultaneously visible in other views. This leads to the problem of determining whether a set of images, each containing a set of features, is consistent with a single 3D object. We assume that each feature is visible from a disk of viewpoints on the viewing sphere. In this case we show the problem is NP-hard in general, but can be solved efficiently when all views come from a circle on the viewing sphere. We also give iterative algorithms that can handle noisy data and converge to locally optimal solutions in the general case. Our techniques can also be used to recover viewpoint information from the set of features that are visible in different images. We show that these algorithms perform well both on synthetic data and images from the COIL dataset.}, keywords = {3D, algorithms;synthetic, complexity;iterative, constraints;computational, data;synthetic, dataset;NP-hard;image-based, features;COIL, framework;iterative, images;three-dimensional, methods;object, object, recognition;, recognition;viewing, sphere;visibility}, doi = {10.1109/CVPR.2009.5206726}, author = {Basri,R. and Felzenszwalb,P. F and Girshick,R. B and Jacobs, David W. and Klivans,C. J} } @article {13105, title = {Visual Tag}, volume = {12/533,231}, year = {2009}, month = {2009/07//}, abstract = {An improved animal tag for application to an animal{\textquoteright}s ear which comprises a male portion that includes a flat segment and a projection segment, a female portion that includes a generally square or generally oval shaped flat segment and a raised segment with an aperture; wherein the projection segment of the male portion is adapted to be inserted through the animal{\textquoteright}s ear and into the aperture when pressure is applied thereto.}, url = {http://www.google.com/patents?id=ZXTTAAAAEBAJ}, author = {BRETEY,STEVE and Kuhnly,Keith and Davis, Larry S.} } @conference {16057, title = {What{\textquoteright}s being said near "Martha"? Exploring name entities in literary text collections}, booktitle = {Visual Analytics Science and Technology, 2009. VAST 2009. IEEE Symposium on}, year = {2009}, month = {2009/10//}, pages = {107 - 114}, abstract = {A common task in literary analysis is to study characters in a novel or collection. Automatic entity extraction, text analysis and effective user interfaces facilitate character analysis. Using our interface, called POSvis, the scholar uses word clouds and self-organizing graphs to review vocabulary, to filter by part of speech, and to explore the network of characters located near characters under review. Further, visualizations show word usages within an analysis window (i.e. a book chapter), which can be compared with a reference window (i.e. the whole book). We describe the interface and report on an early case study with a humanities scholar.}, keywords = {analysis;humanities, analysis;literary, analysis;user, clouds;word, collection;name, entity, entity;part-of-speech, extraction;character, filtering;linguistics;text, filtering;self-organizing, graph;text, interface;vocabulary;word, interfaces;vocabulary;, POSvis;automatic, scholar;literary, text, usage;data, visualisation;information}, doi = {10.1109/VAST.2009.5333248}, author = {Vuillemot,R. and Clement,T. and Plaisant, Catherine and Kumar,A.} } @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} } @article {13874, title = {The acl anthology reference corpus: A reference dataset for bibliographic research in computational linguistics}, journal = {Proc. of the 6th International Conference on Language Resources and Evaluation Conference (LREC{\textquoteright}08)}, year = {2008}, month = {2008///}, pages = {1755 - 1759}, abstract = {The ACL Anthology is a digital archive of conference and journal papers in natural language processing and computational linguistics.Its primary purpose is to serve as a reference repository of research results, but we believe that it can also be an object of study and a platform for research in its own right. We describe an enriched and standardized reference corpus derived from the ACL Anthology that can be used for research in scholarly document processing. This corpus, which we call the ACL Anthology Reference Corpus (ACL ARC), brings together the recent activities of a number of research groups around the world. Our goal is to make the corpus widely available, and to encourage other researchers to use it as a standard testbed for experiments in both bibliographic and bibliometric research. }, author = {Bird,S. and Dale,R. and Dorr, Bonnie J and Gibson,B. and Joseph,M.T. and Kan,M.Y. and Lee,D. and Powley,B. and Radev,D.R. and Tan,Y.F.} } @conference {13121, title = {Action recognition using ballistic dynamics}, booktitle = {Computer Vision and Pattern Recognition, 2008. CVPR 2008. IEEE Conference on}, year = {2008}, month = {2008/06//}, pages = {1 - 8}, abstract = {We present a Bayesian framework for action recognition through ballistic dynamics. Psycho-kinesiological studies indicate that ballistic movements form the natural units for human movement planning. The framework leads to an efficient and robust algorithm for temporally segmenting videos into atomic movements. Individual movements are annotated with person-centric morphological labels called ballistic verbs. This is tested on a dataset of interactive movements, achieving high recognition rates. The approach is also applied on a gesture recognition task, improving a previously reported recognition rate from 84\% to 92\%. Consideration of ballistic dynamics enhances the performance of the popular Motion History Image feature. We also illustrate the approachpsilas general utility on real-world videos. Experiments indicate that the method is robust to view, style and appearance variations.}, keywords = {analysis;image, Bayesian, dynamics;gesture, feature;person-centric, framework;action, History, image, labels;psycho-kinesiological, morphological, MOTION, Movement, movements;motion, planning;interactive, processing;, recognition, recognition;ballistic, recognition;image, segmentation;video, signal, studies;image, task;human}, doi = {10.1109/CVPR.2008.4587806}, author = {Vitaladevuni,S.N. and Kellokumpu,V. and Davis, Larry S.} } @conference {14323, title = {Activity sensing in the wild: a field trial of ubifit garden}, booktitle = {Proceeding of the twenty-sixth annual SIGCHI conference on Human factors in computing systems}, year = {2008}, month = {2008///}, pages = {1797 - 1806}, author = {Consolvo,S. and McDonald,D.W. and Toscos,T. and Chen,M.Y. and Jon Froehlich and Harrison,B. and Klasnja,P. and LaMarca,A. and LeGrand,L. and Libby,R. and others} } @article {15181, title = {Aggregate message authentication codes}, journal = {Topics in Cryptology{\textendash}CT-RSA 2008}, year = {2008}, month = {2008///}, pages = {155 - 169}, abstract = {We propose and investigate the notion of aggregate message authentication codes (MACs) which have the property that multiple MAC tags, computed by (possibly) different senders on multiple (possibly different) messages, can be aggregated into a shorter tag that can still be verified by a recipient who shares a distinct key with each sender. We suggest aggregate MACs as an appropriate tool for authenticated communication in mobile ad-hoc networks or other settings where resource-constrained devices share distinct keys with a single entity (such as a base station), and communication is an expensive resource.}, doi = {10.1007/978-3-540-79263-5_10}, author = {Katz, Jonathan and Lindell,A.} } @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} } @article {16790, title = {Bandwidth-constrained queries in sensor networks}, journal = {The VLDB Journal}, volume = {17}, year = {2008}, month = {2008///}, pages = {443 - 467}, author = {Deligiannakis,A. and Kotidis,Y. and Roussopoulos, Nick} } @conference {15144, title = {Bridging game theory and cryptography: recent results and future directions}, booktitle = {Proceedings of the 5th conference on Theory of cryptography}, series = {TCC{\textquoteright}08}, year = {2008}, month = {2008///}, pages = {251 - 272}, publisher = {Springer-Verlag}, organization = {Springer-Verlag}, address = {Berlin, Heidelberg}, abstract = {Motivated by the desire to develop more realistic models of, and protocols for, interactions between mutually distrusting parties, there has recently been significant interest in combining the approaches and techniques of game theory with those of cryptographic protocol design. Broadly speaking, two directions are currently being pursued: Applying cryptography to game theory: Certain game-theoretic equilibria are achievable if a trusted mediator is available. The question here is: to what extent can this mediator be replaced by a distributed cryptographic protocol run by the parties themselves? Applying game-theory to cryptography: Traditional cryptographic models assume some honest parties who faithfully follow the protocol, and some arbitrarily malicious players against whom the honest players must be protected. Game-theoretic models propose instead that all players are simply self-interested (i.e., rational), and the question then is: how can we model and design meaningful protocols for such a setting? In addition to surveying known results in each of the above areas, I suggest some new definitions along with avenues for future research.}, isbn = {3-540-78523-X, 978-3-540-78523-1}, url = {http://dl.acm.org/citation.cfm?id=1802614.1802635}, author = {Katz, Jonathan} } @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} } @book {14504, title = {On classification, ranking, and probability estimation}, year = {2008}, month = {2008///}, publisher = {Internationales Begegnungs- und Forschungszentrum fur Informatik (IBFI), Schloss Dagstuhl, Germany}, organization = {Internationales Begegnungs- und Forschungszentrum fur Informatik (IBFI), Schloss Dagstuhl, Germany}, abstract = {Given a binary classification task, a ranker is an algorithm that can sort a set of instances from highest to lowest expectation that the instance is positive. In contrast to a classifier, a ranker does not output class predictions {\~A}{\textcent}{\^a}{\quotesinglbase}{\textlnot}{\^a}{\texteuro}{\oe} although it can be turned into a classifier with help of an additional procedure to split the ranked list into two. A straightforward way to compute rankings is to train a scoring classifier to assign numerical scores to instances, for example the predicted odds that an instance is positive. However, rankings can be computed without scores, as we demonstrate in this paper. We propose a lexicographic ranker, LexRank , whose rankings are derived not from scores, but from a simple ranking of attribute values obtained from the training data. Although various metrics can be used, we show that by using the odds ratio to rank the attribute values we obtain a ranker that is conceptually close to the naive Bayes classifier, in the sense that for every instance of LexRank there exists an instance of naive Bayes that achieves the same ranking. However, the reverse is not true, which means that LexRank is more biased than naive Bayes. We systematically develop the relationships and differences between classification, ranking, and probability estimation, which leads to a novel connection between the Brier score and ROC curves. Combining LexRank with isotonic regression, which derives probability estimates from the ROC convex hull, results in the lexicographic probability estimator LexProb.}, author = {Flach,P. and Matsubara,E.T. and De Raedt,L. and Dietterich,T. and Getoor, Lise and Kersting,K. and Muggleton,S. H} } @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} } @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.} } @article {12898, title = {The Complete Genome Sequence of Thermococcus Onnurineus NA1 Reveals a Mixed Heterotrophic and Carboxydotrophic Metabolism}, journal = {Journal of BacteriologyJ. Bacteriol.}, volume = {190}, year = {2008}, month = {2008/11/15/}, pages = {7491 - 7499}, abstract = {Members of the genus Thermococcus, sulfur-reducing hyperthermophilic archaea, are ubiquitously present in various deep-sea hydrothermal vent systems and are considered to play a significant role in the microbial consortia. We present the complete genome sequence and feature analysis of Thermococcus onnurineus NA1 isolated from a deep-sea hydrothermal vent area, which reveal clues to its physiology. Based on results of genomic analysis, T. onnurineus NA1 possesses the metabolic pathways for organotrophic growth on peptides, amino acids, or sugars. More interesting was the discovery that the genome encoded unique proteins that are involved in carboxydotrophy to generate energy by oxidation of CO to CO2, thereby providing a mechanistic basis for growth with CO as a substrate. This lithotrophic feature in combination with carbon fixation via RuBisCO (ribulose 1,5-bisphosphate carboxylase/oxygenase) introduces a new strategy with a complementing energy supply for T. onnurineus NA1 potentially allowing it to cope with nutrient stress in the surrounding of hydrothermal vents, providing the first genomic evidence for the carboxydotrophy in Thermococcus.}, isbn = {0021-9193, 1098-5530}, doi = {10.1128/JB.00746-08}, url = {http://jb.asm.org/content/190/22/7491}, author = {Lee,Hyun Sook and Kang,Sung Gyun and Bae,Seung Seob and Lim,Jae Kyu and Cho,Yona and Kim,Yun Jae and Jeon,Jeong Ho and Cha,Sun-Shin and Kwon,Kae Kyoung and Kim,Hyung-Tae and Park,Cheol-Joo and Lee,Hee-Wook and Kim,Seung Il and Jongsik Chun and Rita R Colwell and Kim,Sang-Jin and Lee,Jung-Hyun} } @conference {13123, title = {Context and observation driven latent variable model for human pose estimation}, booktitle = {Computer Vision and Pattern Recognition, 2008. CVPR 2008. IEEE Conference on}, year = {2008}, month = {2008/06//}, pages = {1 - 8}, abstract = {Current approaches to pose estimation and tracking can be classified into two categories: generative and discriminative. While generative approaches can accurately determine human pose from image observations, they are computationally expensive due to search in the high dimensional human pose space. On the other hand, discriminative approaches do not generalize well, but are computationally efficient. We present a hybrid model that combines the strengths of the two in an integrated learning and inference framework. We extend the Gaussian process latent variable model (GPLVM) to include an embedding from observation space (the space of image features) to the latent space. GPLVM is a generative model, but the inclusion of this mapping provides a discriminative component, making the model observation driven. Observation Driven GPLVM (OD-GPLVM) not only provides a faster inference approach, but also more accurate estimates (compared to GPLVM) in cases where dynamics are not sufficient for the initialization of search in the latent space. We also extend OD-GPLVM to learn and estimate poses from parameterized actions/gestures. Parameterized gestures are actions which exhibit large systematic variation in joint angle space for different instances due to difference in contextual variables. For example, the joint angles in a forehand tennis shot are function of the height of the ball (Figure 2). We learn these systematic variations as a function of the contextual variables. We then present an approach to use information from scene/objects to provide context for human pose estimation for such parameterized actions.}, keywords = {estimation;, estimation;image, Gaussian, gestures;pose, latent, learning;parameterized, model;human, observations;integrated, pose, process, processes;gesture, processing;pose, recognition;image, tracking;Gaussian, variable}, doi = {10.1109/CVPR.2008.4587511}, author = {Gupta,A. and Chen,T. and Chen,F. and Kimber,D. and Davis, Larry S.} } @book {15197, title = {Digital Signatures}, year = {2008}, month = {2008///}, publisher = {Springer Verlag}, organization = {Springer Verlag}, author = {Yung,M. and Katz, Jonathan} } @article {14678, title = {Directing javascript with arrows (functional pearl)}, year = {2008}, month = {2008///}, abstract = {JavaScript, being a single-threaded language, makes extensive use of event-driven programming to enable responsive web applications. However, standard approaches to sequencing events are messy, and often lead to code that is difficult to understand and maintain. We have found that arrows, a generalization of monads, are an elegant solution to this problem. Arrows allow us to easily write asynchronous programs in small, modular units of code, and flexibly compose them in many different ways, while nicely abstracting the details of asynchronous program composition. In particular, we show how to use arrows to construct a variety of state machines, such as autoscrollers and drag-and-drop handlers.}, author = {Khoo,Y.P. and Hicks, Michael W. and Foster, Jeffrey S. and Sazawal,V.} } @article {18518, title = {A Dynamic Reputation Service for Spotting Spammers}, volume = {GT-CS-08-09}, year = {2008}, month = {2008///}, institution = {School of Computer Science, Georgia Tech}, abstract = {This paper presents the design, implementation, evalu-ation, and initial deployment of SpamSpotter, the first open, large-scale, real-time reputation system for filtering spam. Existing blacklists (e.g., SpamHaus) have trouble keeping pace with spammers{\textquoteright} increasing ability to send spam from {\textquotedblleft}fresh{\textquotedblright} IP addresses, and filters based purely on content are easily evadable. In contrast, SpamSpotter dynamically classifies email senders in real time based on their global sending behavior, rather than based on ephemeral features such as an IP address or the content of the message. In implementing SpamSpotter, we address significant challenges involving both dynamism (i.e., de- termining when to {\textquotedblleft}retrain{\textquotedblright} our dynamic classification algorithms) and scale (i.e., maintaining fast, accurate per- formance in the face of tremendous email message vol- ume). We have evaluated the performance and accuracy of SpamSpotter using traces from a large email-hosting provider and a spam appliance vendor that receives 300 million messages a day. Our evaluation shows that SpamSpotter is scalable, fast, and accurate. SpamSpotter is also operational today: it will currently answer queries from existing spam filtering software (e.g., SpamAssas- sin) with only minor configuration changes. }, author = {Ramachandran,A. and Hao,S. and Khandelwal,H. and Feamster, Nick and Vempala,S.} } @article {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} } @inbook {13365, title = {Energy Efficient Monitoring in Sensor Networks}, booktitle = {LATIN 2008: Theoretical InformaticsLATIN 2008: Theoretical Informatics}, series = {Lecture Notes in Computer Science}, volume = {4957}, year = {2008}, month = {2008///}, pages = {436 - 448}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {In this paper we study a set of problems related to efficient energy management for monitoring applications in wireless sensor networks. We study several generalizations of a basic problem called Set k -Cover, which can be described as follows: we are given a set of sensors, and a set of regions to be monitored. Each region can be monitored by a subset of the sensors. To increase the lifetime of the sensor network, we would like to partition the sensors into k sets (or time-slots) and activate each partition in a different time-slot. The goal is to find the partitioning that maximizes the coverage of the regions. This problem is known to be NP -hard. We first develop improved approximation algorithms for this problem based on its similarities to the max k -cut problem. We then consider a variation, called Set ( k , α )-cover, where each sensor is allowed to be active in α different time-slots. We develop a randomized routing algorithm for this problem. We then consider extensions where each sensor can monitor only a bounded number of regions in any time-slot. We develop the first approximation algorithms for this problem. An experimental evaluation of the algorithms we propose can be found in the full version of the paper.}, isbn = {978-3-540-78772-3}, url = {http://dx.doi.org/10.1007/978-3-540-78773-0_38}, author = {Deshpande, Amol and Khuller, Samir and Malekian,Azarakhsh and Toossi,Mohammed}, editor = {Laber,Eduardo and Bornstein,Claudson and Nogueira,Loana and Faria,Luerbio} } @article {12971, title = {Estimating Tree-Structured Covariance Matrices via Mixed-Integer Programming with an Application to Phylogenetic Analysis of Gene Expression}, volume = {1142}, year = {2008}, month = {2008///}, institution = {Department of Statistics, University of Wisconsin}, abstract = {We present a novel method for estimating tree-structured covariance matrices directly fromobserved continuous data. A representation of these classes of matrices as linear combinations of rank-one matrices indicating object partitions is used to formulate estimation as instances of well-studied numerical optimization problems. In particular, we present estimation based on projection where the covariance estimate is the nearest tree-structured covariance matrix to an observed sample covariance matrix. The problem is posed as a linear or quadratic mixed-integer program (MIP) where a setting of the integer variables in the MIP specifies a set of tree topologies of the structured covariance matrix. We solve these problems to optimality using efficient and robust existing MIP solvers. We also show that the least squares distance method of Fitch and Margoliash (1967) can be formulated as a quadratic MIP and thus solved exactly using existing, robust branch-and-bound MIP solvers. Our motivation for this method is the discovery of phylogenetic structure directly from gene expression data. Recent studies have adapted traditional phylogenetic comparative anal- ysis methods to expression data. Typically, these methods first estimate a phylogenetic tree from genomic sequence data and subsequently analyze expression data. A covariance matrix constructed from the sequence-derived tree is used to correct for the lack of independence in phy- logenetically related taxa. However, recent results have shown that the hierarchical structure of sequence-derived tree estimates are highly sensitive to the genomic region chosen to build them. To circumvent this difficulty, we propose a stable method for deriving tree-structured covariance matrices directly from gene expression as an exploratory step that can guide investigators in their modelling choices for these types of comparative analysis. We present a case study in phylogenetic analysis of expression in yeast gene families. Our method is able to corroborate the presence of phylogenetic structure in the response of expression in a subset of the gene families under particular experimental conditions. Additionally, when used in conjunction with transcription factor occupancy data, our methods show that alternative modelling choices should be considered when creating sequence-derived trees for this comparative analysis. }, author = {Corrada Bravo, Hector and Eng,K. H and Keles,S. and Wahba,G. and Wright,S.} } @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} } @article {14432, title = {Exploiting Prior Knowledge in Intelligent Assistants: Combining Relational Models with Hierarchies}, journal = {Probabilistic, Logical and Relational Learning - A Further Synthesis}, year = {2008}, month = {2008///}, abstract = {Statitsical relational models have been successfully used to model static probabilistic relationships between the entities of the domain. In this talk, we illustrate their use in a dynamic decison-theoretic setting where the task is to assist a user by inferring his intentional structure and taking appropriate assistive actions. We show that the statistical relational models can be used to succintly express the system{\textquoteright}s prior knowledge about the user{\textquoteright}s goal-subgoal structure and tune it with experience. As the system is better able to predict the user{\textquoteright}s goals, it improves the effectiveness of its assistance. We show through experiments that both the hierarchical structure of the goals and the parameter sharing facilitated by relational models significantly improve the learning speed.}, author = {Natarajan,S. and Tadepalli,P. and Fern,A. and De Raedt,L. and Dietterich,T. and Getoor, Lise and Kersting,K. and Muggleton,S. H} } @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 {13977, title = {A Fast Algorithm for Learning a Ranking Function from Large-Scale Data Sets}, journal = {Pattern Analysis and Machine Intelligence, IEEE Transactions on}, volume = {30}, year = {2008}, month = {2008/07//}, pages = {1158 - 1170}, abstract = {We consider the problem of learning a ranking function that maximizes a generalization of the Wilcoxon-Mann-Whitney statistic on the training data. Relying on an e-accurate approximation for the error function, we reduce the computational complexity of each iteration of a conjugate gradient algorithm for learning ranking functions from O(m2) to O(m), where m is the number of training samples. Experiments on public benchmarks for ordinal regression and collaborative filtering indicate that the proposed algorithm is as accurate as the best available methods in terms of ranking accuracy, when the algorithms are trained on the same data. However, since it is several orders of magnitude faster than the current state-of-the-art approaches, it is able to leverage much larger training data sets.}, keywords = {Automated;, Factual;Information Storage and Retrieval;Likelihood Functions;Models, Statistical;Pattern Recognition, Wilcoxon-Mann-Whitney statistics;collaborative filtering;error function;gradient algorithm;large-scale data sets;learning ranking functions;ranking function;training data;computational complexity;error analysis;learning (artificial intelligence);regressio}, isbn = {0162-8828}, doi = {10.1109/TPAMI.2007.70776}, author = {Raykar,V.C. and Duraiswami, Ramani and Krishnapuram,B.} } @article {18508, title = {Fast flux service networks: Dynamics and roles in hosting online scams}, volume = {GT-CS-08-07}, year = {2008}, month = {2008///}, institution = {School of Computer Science, Georgia Tech}, abstract = {This paper studies the dynamics of fast flux service networks and their role in online scam hosting infrastructures. By monitoring changes in DNS records of over 350 distinct fast flux domains collected from URLs in 115,000 spam emails at a large spam sinkhole, we measure the rate of change of DNS records, accumulation of new distinct IPs in the hosting infrastructure, and location of change both for individual domains and across 21 different scam campaigns. We find that fast flux networks redirect clients at much different rates{\textemdash}and at different locations in the DNS hierarchy{\textemdash}than conventional load-balanced Web sites. We also find that the IP addresses in the fast flux infrastructure itself change rapidly, and that this infrastructure is shared extensively across scam campaigns, and some of these IP addresses are also used to send spam. Finally, we compared IP addresses in fast-flux infrastructure and flux domains with various blacklists (i.e., SBL, XBL/PBL, and URIBL) and found that nearly one-third of scam sites were not listed in the URL blacklist at the time they were hosting scams. We also observed many hosting sites and nameservers that were listed in both the SBL and XBL both before and after we observed fast-flux activity; these observations lend insight into both the responsiveness of existing blacklists and the life cycles of fast-flux nodes.}, url = {http://hdl.handle.net/1853/30451}, author = {Konte,M. and Feamster, Nick and Jung,J.} } @article {19484, title = {A Fault Model for Upgrades in Distributed Systems (CMU-PDL-08-115)}, journal = {Parallel Data Laboratory}, year = {2008}, month = {2008/12/01/}, url = {http://repository.cmu.edu/pdl/10}, author = {Tudor Dumitras and Kavulya, Soila and Narasimhan, Priya} } @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 {14331, title = {Flowers or a robot army?: encouraging awareness \& activity with personal, mobile displays}, booktitle = {Proceedings of the 10th international conference on Ubiquitous computing}, series = {UbiComp {\textquoteright}08}, year = {2008}, month = {2008///}, pages = {54 - 63}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Personal, mobile displays, such as those on mobile phones, are ubiquitous, yet for the most part, underutilized. We present results from a field experiment that investigated the effectiveness of these displays as a means for improving awareness of daily life (in our case, self-monitoring of physical activity). Twenty-eight participants in three experimental conditions used our UbiFit system for a period of three months in their day-to-day lives over the winter holiday season. Our results show, for example, that participants who had an awareness display were able to maintain their physical activity level (even during the holidays), while the level of physical activity for participants who did not have an awareness display dropped significantly. We discuss our results and their general implications for the use of everyday mobile devices as awareness displays.}, keywords = {ambient display, awareness, calm technology, field experiment, fitness, glanceable display, mobile phone, personal mobile display, persuasive technology, physical activity}, isbn = {978-1-60558-136-1}, doi = {10.1145/1409635.1409644}, url = {http://doi.acm.org/10.1145/1409635.1409644}, author = {Consolvo,Sunny and Klasnja,Predrag and McDonald,David W. and Avrahami,Daniel and Jon Froehlich and LeGrand,Louis and Libby,Ryan and Mosher,Keith and Landay,James A.} } @conference {12245, title = {Growth of the flickr social network}, booktitle = {Proceedings of the first workshop on Online social networks}, series = {WOSN {\textquoteright}08}, year = {2008}, month = {2008///}, pages = {25 - 30}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Online social networking sites like MySpace, Orkut, and Flickr are among the most popular sites on the Web and continue to experience dramatic growth in their user population. The popularity of these sites offers a unique opportunity to study the dynamics of social networks at scale. Having a proper understanding of how online social networks grow can provide insights into the network structure, allow predictions of future growth, and enable simulation of systems on networks of arbitrary size. However, to date, most empirical studies have focused on static network snapshots rather than growth dynamics. In this paper, we collect and examine detailed growth data from the Flickr online social network, focusing on the ways in which new links are formed. Our study makes two contributions. First, we collect detailed data covering three months of growth, encompassing 950,143 new users and over 9.7 million new links, and we make this data available to the research community. Second, we use a first-principles approach to investigate the link formation process. In short, we find that links tend to be created by users who already have many links, that users tend to respond to incoming links by creating links back to the source, and that users link to other users who are already close in the network.}, keywords = {growth, measurement, social networks}, isbn = {978-1-60558-182-8}, doi = {10.1145/1397735.1397742}, url = {http://doi.acm.org/10.1145/1397735.1397742}, author = {Mislove,Alan and Koppula,Hema Swetha and Gummadi,Krishna P. and Druschel,Peter and Bhattacharjee, Bobby} } @article {15123, title = {Handling expected polynomial-time strategies in simulation-based security proofs}, journal = {Journal of Cryptology}, volume = {21}, year = {2008}, month = {2008///}, pages = {303 - 349}, abstract = {The standard class of adversaries considered in cryptography is that of strict polynomial-time probabilistic machines. However, expected polynomial-time machines are often also considered. For example, there are many zero-knowledge protocols for which the only known simulation techniques run in expected (and not strict) polynomial time. In addition, it has been shown that expected polynomial-time simulation is essential for achieving constant-round black-box zero-knowledge protocols. This reliance on expected polynomial-time simulation introduces a number of conceptual and technical difficulties. In this paper, we develop techniques for dealing with expected polynomial-time adversaries in simulation-based security proofs.}, doi = {10.1007/s00145-007-9004-8}, author = {Katz, Jonathan and Lindell,Y.} } @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 {14970, title = {High Performance Computing Algorithms for Land Cover}, year = {2008}, month = {2008///}, institution = {CiteSeerX}, abstract = {Global and regional land cover studies require the ability to apply complex models on selected subsets of large amounts of multi-sensor and multi-temporal data sets that have been derived from raw instrument measurements using widely accepted pre-processing algorithms. The computational and storage requirements of most such studies far exceed what is possible on a single workstation environment. We have been pursuing a new approach that couples scalable and open distributed heterogeneous hardware with the development of high performance software for processing, indexing, and organizing remotely sensed data. Hierarchical data management tools are used to ingest raw data, create metadata, and organize the archived data so as to automatically achieve computational load balancing among the available nodes and minimize I/O overheads. We illustrate our approach with four specific examples. The first is the development of the first fast operational scheme for the atmospheric correction of Landsat TM scenes, while the second example focuses on image segmentation using a novel hierarchical connected components algorithm. Retrieval of global BRDF (Bidirectional Reflectance Distribution Function) in the red and near infrared wavelengths using four years (1983 to 1986) of Pathfinder AVHRR Land (PAL) data set is the focus of our third example. The fourth example is the development of a hierarchical data organization scheme that allows on-demand processing and retrieval of regional and global AVHRR data sets. Our results show that substantial improvements in computational times can be achieved by using the high performance computing technology.}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.58.4213}, author = {Dynamics Using Remote and Satya Kalluri and Bader,David A. and John Townshend and JaJa, Joseph F. and Zengyan Zhang and Fallah-adl,Hassan} } @article {15102, title = {How to encrypt with a malicious random number generator}, journal = {Fast Software Encryption}, year = {2008}, month = {2008///}, pages = {303 - 315}, abstract = {Chosen-plaintext attacks on private-key encryption schemes are currently modeled by giving an adversary access to an oracle that encrypts a given message m using random coins that are generated uniformly at random and independently of anything else. This leaves open the possibility of attacks in case the random coins are poorly generated (e.g., using a faulty random number generator), or are under partial adversarial control (e.g., when encryption is done by lightweight devices that may be captured and tampered with).We introduce new notions of security modeling such attacks, propose two concrete schemes meeting our definitions, and show generic transformations for achieving security in this context. }, doi = {10.1007/978-3-540-71039-4_19}, author = {Kamara,S. and Katz, Jonathan} } @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} } @article {15100, title = {Improving the round complexity of vss in point-to-point networks}, journal = {Automata, Languages and Programming}, year = {2008}, month = {2008///}, pages = {499 - 510}, abstract = {We revisit the following question: what is the optimal round complexity of verifiable secret sharing (VSS)? We focus here on the case of perfectly-secure VSS where the number of corrupted parties t satisfies t < n/3, with n being the total number of parties. Work of Gennaro et al. (STOC 2001) and Fitzi et al. (TCC 2006) shows that, assuming a broadcast channel, 3 rounds are necessary and sufficient for efficient VSS. The efficient 3-round protocol of Fitzi et al., however, treats the broadcast channel as being available {\textquotedblleft}for free{\textquotedblright} and does not attempt to minimize its usage. This approach leads to relatively poor round complexity when protocols are compiled for a point-to-point network.We show here a VSS protocol that is simultaneously optimal in terms of both the number of rounds and the number of invocations of broadcast. Our protocol also has a certain {\textquotedblleft}2-level sharing{\textquotedblright} property that makes it useful for constructing protocols for general secure computation. }, doi = {10.1007/978-3-540-70583-3_41}, author = {Katz, Jonathan and Koo,C. Y and Kumaresan,R.} } @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} } @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.} } @book {15195, title = {Introduction to Modern Cryptography}, year = {2008}, month = {2008///}, publisher = {CRC Press}, organization = {CRC Press}, abstract = {Cryptography plays a key role in ensuring the privacy and integrity of data and the security of computer networks. Introduction to Modern Cryptography provides a rigorous yet accessible treatment of modern cryptography, with a focus on formal definitions, precise assumptions, and rigorous proofs. The authors introduce the core principles of modern cryptography, including the modern, computational approach to security that overcomes the limitations of perfect secrecy. An extensive treatment of private-key encryption and message authentication follows. The authors also illustrate design principles for block ciphers, such as the Data Encryption Standard (DES) and the Advanced Encryption Standard (AES), and present provably secure constructions of block ciphers from lower-level primitives. The second half of the book focuses on public-key cryptography, beginning with a self-contained introduction to the number theory needed to understand the RSA, Diffie-Hellman, El Gamal, and other cryptosystems. After exploring public-key encryption and digital signatures, the book concludes with a discussion of the random oracle model and its applications. Serving as a textbook, a reference, or for self-study, Introduction to Modern Cryptography presents the necessary tools to fully understand this fascinating subject.}, keywords = {Computer networks, computer security, Computers / Operating Systems / General, Computers / Security / General, cryptography, Language Arts \& Disciplines / Communication Studies, Mathematics / Combinatorics}, isbn = {9781584885511}, author = {Katz, Jonathan and Lindell,Yehuda} } @conference {12244, title = {Matchmaking and implementation issues for a P2P desktop grid}, booktitle = {Parallel and Distributed Processing, 2008. IPDPS 2008. IEEE International Symposium on}, year = {2008}, month = {2008/04//}, pages = {1 - 5}, abstract = {We present some recent and ongoing work in our decentralized desktop computing grid project. Specifically, we discuss matching jobs with compute nodes in a peer-to-peer grid of heterogeneous platforms, and the implementation of our algorithms in a concrete system.}, keywords = {computing, computing;, computing;peer-to-peer, desktop, grid;decentralized, grid;grid, grid;peer-to-peer, P2P}, doi = {10.1109/IPDPS.2008.4536388}, author = {Marsh,M. and Kim,Jik-Soo and Nam,Beomseok and Jaehwan Lee and Ratanasanya,S. and Bhattacharjee, Bobby and Keleher,P. and Richardson,D. and Wellnitz,D.} } @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 {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} } @article {13045, title = {Name translation in statistical machine translation: Learning when to transliterate}, journal = {Proceedings of ACL-08: HLT}, year = {2008}, month = {2008///}, pages = {389 - 397}, author = {Hermjakob,U. and Knight,K. and Daum{\'e}, Hal} } @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 {12195, title = {One-handed touchscreen input for legacy applications}, booktitle = {Proceeding of the twenty-sixth annual SIGCHI conference on Human factors in computing systems}, year = {2008}, month = {2008///}, pages = {1399 - 1408}, author = {Karlson,A.K. and Bederson, Benjamin B.} } @conference {13393, title = {Online Filtering, Smoothing and Probabilistic Modeling of Streaming data}, booktitle = {IEEE 24th International Conference on Data Engineering, 2008. ICDE 2008}, year = {2008}, month = {2008/04/07/12}, pages = {1160 - 1169}, publisher = {IEEE}, organization = {IEEE}, abstract = {In this paper, we address the problem of extending a relational database system to facilitate efficient real-time application of dynamic probabilistic models to streaming data. We use the recently proposed abstraction of model-based views for this purpose, by allowing users to declaratively specify the model to be applied, and by presenting the output of the models to the user as a probabilistic database view. We support declarative querying over such views using an extended version of SQL that allows for querying probabilistic data. Underneath we use particle filters, a class of sequential Monte Carlo algorithms, to represent the present and historical states of the model as sets of weighted samples (particles) that are kept up-to-date as new data arrives. We develop novel techniques to convert the queries on the model-based view directly into queries over particle tables, enabling highly efficient query processing. Finally, we present experimental evaluation of our prototype implementation over several synthetic and real datasets, that demonstrates the feasibility of online modeling of streaming data using our system and establishes the advantages of tight integration between dynamic probabilistic models and databases.}, keywords = {Data analysis, data streaming, declarative query, dynamic probabilistic model, Filtering, Global Positioning System, hidden Markov models, Monitoring, Monte Carlo methods, Noise generators, Noise measurement, online filtering, particle filter, particle filtering (numerical methods), probabilistic database view, probability, Real time systems, real-time application, relational database system, Relational databases, sequential Monte Carlo algorithm, Smoothing methods, SQL}, isbn = {978-1-4244-1836-7}, doi = {10.1109/ICDE.2008.4497525}, author = {Kanagal,B. and Deshpande, Amol} } @article {15256, title = {An Optimal Incremental Algorithm for Minimizing Lateness with Rejection}, journal = {Algorithms-ESA 2008}, year = {2008}, month = {2008///}, pages = {601 - 610}, abstract = {This paper re-examines the classical problem of minimizing maximum lateness which is defined as follows: given a collection of n jobs with processing times and due dates, in what order should they be processed on a single machine to minimize maximum lateness? The lateness of a job is defined as its completion time minus its due date. This problem can be solved easily by ordering the jobs in non-decreasing due date order. We now consider the following question: which subset of k jobs should we reject to reduce the maximum lateness by the largest amount? While this problem can be solved optimally in polynomial time, we show the following surprising result: there is a fixed permutation of the jobs, such that for all k, if we reject the first k jobs from this permutation, we derive an optimal solution for the problem in which we are allowed to reject k jobs. This allows for an incremental solution in which we can keep incrementally rejecting jobs if we need a solution with lower maximum lateness value. Moreover, we also develop an optimal O(n logn) time algorithm to find this permutation.}, doi = {10.1007/978-3-540-87744-8_50}, author = {Khuller, Samir and Mestre,J.} } @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} } @article {17967, title = {Persuading Visual Attention through Geometry}, journal = {Visualization and Computer Graphics, IEEE Transactions on}, volume = {14}, year = {2008}, month = {2008/08//july}, pages = {772 - 782}, abstract = {Artists, illustrators, photographers, and cinematographers have long used the principles of contrast and composition to guide visual attention. In this paper, we introduce geometry modification as a tool to persuasively direct visual attention. We build upon recent advances in mesh saliency to develop techniques to alter geometry to elicit greater visual attention. Eye-tracking-based user studies show that our approach successfully guides user attention in a statistically significant manner. Our approach operates directly on geometry and, therefore, produces view-independent results that can be used with existing view-dependent techniques of visual persuasion.}, keywords = {attention;visual, generation;Attention;Awareness;Computer, Geometry, Graphics;Cues;Humans;Photic, Interface;Visual, modification;mesh, perception;, persuasion;art;mesh, saliency;visual, Stimulation;User-Computer}, isbn = {1077-2626}, doi = {10.1109/TVCG.2007.70624}, author = {Kim,Youngmin and Varshney, Amitabh} } @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} } @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} } @article {12180, title = {A review of overview+ detail, zooming, and focus+ context interfaces}, journal = {ACM Computing Surveys (CSUR)}, volume = {41}, year = {2008}, month = {2008///}, pages = {1 - 31}, author = {Cockburn,A. and Karlson,A. and Bederson, Benjamin B.} } @article {19202, title = {Route prediction from trip observations}, journal = {SAE SP}, volume = {2193}, year = {2008}, month = {2008}, author = {Jon Froehlich and Krumm,J.} } @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 {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.} } @article {15257, title = {Streaming algorithms for k-center clustering with outliers and with anonymity}, journal = {Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques}, year = {2008}, month = {2008///}, pages = {165 - 178}, abstract = {Clustering is a common problem in the analysis of large data sets. Streaming algorithms, which make a single pass over the data set using small working memory and produce a clustering comparable in cost to the optimal offline solution, are especially useful. We develop the first streaming algorithms achieving a constant-factor approximation to the cluster radius for two variations of the k-center clustering problem. We give a streaming (4 + ε)-approximation algorithm using O(ε - 1 kz) memory for the problem with outliers, in which the clustering is allowed to drop up to z of the input points; previous work used a random sampling approach which yields only a bicriteria approximation. We also give a streaming (6 + ε)-approximation algorithm using O(ε - 1 ln (ε - 1) k + k 2) memory for a variation motivated by anonymity considerations in which each cluster must contain at least a certain number of input points.}, doi = {10.1007/978-3-540-85363-3_14}, author = {Matthew McCutchen,R. and Khuller, Samir} } @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 {18920, title = {Synthesis of strategies from interaction traces}, series = {AAMAS {\textquoteright}08}, year = {2008}, month = {2008///}, pages = {855 - 862}, publisher = {International Foundation for Autonomous Agents and Multiagent Systems}, organization = {International Foundation for Autonomous Agents and Multiagent Systems}, address = {Richland, SC}, abstract = {We describe how to take a set of interaction traces produced by different pairs of players in a two-player repeated game, and combine them into a composite strategy. We provide an algorithm that, in polynomial time, can generate the best such composite strategy. We describe how to incorporate the composite strategy into an existing agent, as an enhancement of the agent{\textquoteright}s original strategy. We provide experimental results using interaction traces from 126 agents (most of them written by students as class projects) for the Iterated Prisoner{\textquoteright}s Dilemma, Iterated Chicken Game, and Iterated Battle of the Sexes. We compared each agent with the enhanced version of that agent produced by our algorithm. The enhancements improved the agents{\textquoteright} scores by about 5\% in the IPD, 11\% in the ICG, and 26\% in the IBS, and improved their rank by about 12\% in the IPD, 38\% in the ICG, and 33\% in the IBS.}, keywords = {agents, interaction, learning, multi-agent systems, prisoner{\textquoteright}s dilemma, repeated games}, isbn = {978-0-9817381-1-6}, url = {http://dl.acm.org/citation.cfm?id=1402298.1402343}, author = {Au,Tsz-Chiu and Kraus,Sarit and Nau, Dana S.} } @conference {13126, title = {Tracking Down Under: Following the Satin Bowerbird}, booktitle = {Applications of Computer Vision, 2008. WACV 2008. IEEE Workshop on}, year = {2008}, month = {2008/01//}, pages = {1 - 7}, abstract = {Socio biologists collect huge volumes of video to study animal behavior (our collaborators work with 30,000 hours of video). The scale of these datasets demands the development of automated video analysis tools. Detecting and tracking animals is a critical first step in this process. However, off-the-shelf methods prove incapable of handling videos characterized by poor quality, drastic illumination changes, non-stationary scenery and foreground objects that become motionless for long stretches of time. We improve on existing approaches by taking advantage of specific aspects of this problem: by using information from the entire video we are able to find animals that become motionless for long intervals of time; we make robust decisions based on regional features; for different parts of the image, we tailor the selection of model features, choosing the features most helpful in differentiating the target animal from the background in that part of the image. We evaluate our method, achieving almost 83\% tracking accuracy on a more than 200,000 frame dataset of Satin Bowerbird courtship videos.}, keywords = {analysis, behavior;animal, Bowerbird;animal, computing;feature, detection;animal, extraction;tracking;video, processing;zoology;, Satin, sciences, selection;behavioural, signal, tool;feature, tracking;automated, video}, doi = {10.1109/WACV.2008.4544004}, author = {Kembhavi,A. and Farrell,R. and Luo,Yuancheng and Jacobs, David W. and Duraiswami, Ramani and Davis, Larry S.} } @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 {14367, title = {Trusting spam reporters: A reporter-based reputation system for email filtering}, journal = {ACM Transactions on Information Systems (TOIS)}, volume = {27}, year = {2008}, month = {2008/12//}, pages = {3:1{\textendash}3:27 - 3:1{\textendash}3:27}, abstract = {Spam is a growing problem; it interferes with valid email and burdens both email users and service providers. In this work, we propose a reactive spam-filtering system based on reporter reputation for use in conjunction with existing spam-filtering techniques. The system has a trust-maintenance component for users, based on their spam-reporting behavior. The challenge that we consider is that of maintaining a reliable system, not vulnerable to malicious users, that will provide early spam-campaign detection to reduce the costs incurred by users and systems. We report on the utility of a reputation system for spam filtering that makes use of the feedback of trustworthy users. We evaluate our proposed framework, using actual complaint feedback from a large population of users, and validate its spam-filtering performance on a collection of real email traffic over several weeks. To test the broader implication of the system, we create a model of the behavior of malicious reporters, and we simulate the system under various assumptions using a synthetic dataset.}, keywords = {reputation systems, Spam filtering, trust}, isbn = {1046-8188}, doi = {10.1145/1416950.1416953}, url = {http://doi.acm.org/10.1145/1416950.1416953}, author = {Zheleva,Elena and Kolcz,Aleksander and Getoor, Lise} } @conference {15271, title = {Uncovering Genomic Reassortments among Influenza Strains by Enumerating Maximal Bicliques}, booktitle = {IEEE International Conference on Bioinformatics and Biomedicine, 2008. BIBM {\textquoteright}08}, year = {2008}, month = {2008/11/03/5}, pages = {223 - 230}, publisher = {IEEE}, organization = {IEEE}, abstract = {The evolutionary histories of viral genomes have received significant recent attention due to their importance in understanding virulence and the corresponding ramifications to public health. We present a novel framework to detect reassortment events in influenza based on the comparison of two distributions of phylogenetic trees, rather than a pair of, possibly unreliable, consensus trees. We show how to detect all high-probability inconsistencies between two distributions of trees by enumerating maximal bicliques within a defined incompatibility graph. In the process, we give the first quadratic delay algorithm for enumerating maximal bicliques within general bipartite graphs. We demonstrate the utility of our approach by applying it to several sets of influenza genomes (both human- and avian-hosted) and successfully identify all known reassortment events and a few novel candidate reassortments. In addition, on simulated datasets, our approach correctly finds implanted reassortments and rarely detects reassortments where none were introduced.}, keywords = {avian hosted influenza genome, Bioinformatics, Capacitive sensors, Delay, diseases, Event detection, general bipartite graphs, genomic reassortments, Genomics, graph theory, high probability inconsistencies, History, human hosted influenza genome, incompatibility graph, Influenza, influenza strain, maximal biclique, maximal biclique enumeration, microorganisms, phylogenetic trees, Phylogeny, Public healthcare, quadratic delay algorithm, reassortment, reassortment event detection, Tree graphs, viral genome evolutionary history, virulence}, isbn = {978-0-7695-3452-7}, doi = {10.1109/BIBM.2008.78}, author = {Nagarajan,N. and Kingsford, Carl} } @article {15173, title = {Universally composable multi-party computation with an unreliable common reference string}, journal = {Theory of Cryptography}, year = {2008}, month = {2008///}, pages = {142 - 154}, abstract = {Universally composable (UC) multi-party computation has been studied in two settings. When a majority of parties are honest, UC multi-party computation is possible without any assumptions. Without a majority of honest parties, UC multi-party computation is impossible in the plain model, but feasibility results have been obtained in various augmented models. The most popular such model posits a common reference string (CRS) available to parties executing the protocol.In either of the above settings, some assumption regarding the protocol execution is made: i.e., that many parties are honest in the first case, or that a legitimately-chosen string is available in the second. If this assumption is incorrect then all security is lost. A natural question is whether it is possible to design protocols secure if either one of these assumptions holds, i.e., a protocol which is secure if either at most s players are dishonest or if up to t > s players are dishonest but the CRS is chosen in the prescribed manner. We show that such protocols exist if and only if s + t < n. This work was done in part while the authors were visiting IPAM. }, doi = {10.1007/978-3-540-78524-8_9}, author = {Goyal,V. and Katz, Jonathan} } @article {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} } @conference {14348, title = {Using wearable sensors and real time inference to understand human recall of routine activities}, booktitle = {Proceedings of the 10th international conference on Ubiquitous computing}, series = {UbiComp {\textquoteright}08}, year = {2008}, month = {2008///}, pages = {154 - 163}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, keywords = {empirical evaluation, ESM, experience sampling method, recall accuracy, self-reports, survey frequency, user study}, isbn = {978-1-60558-136-1}, doi = {10.1145/1409635.1409656}, url = {http://doi.acm.org/10.1145/1409635.1409656}, author = {Klasnja,Predrag and Harrison,Beverly L. and LeGrand,Louis and LaMarca,Anthony and Jon Froehlich and Hudson,Scott E.} } @article {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} } @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 {15176, title = {Which languages have 4-round zero-knowledge proofs?}, journal = {Theory of Cryptography}, year = {2008}, month = {2008///}, pages = {73 - 88}, abstract = {We show that if a language L has a 4-round, black-box, computational zero-knowledge proof system with negligible soundness error, then . Assuming the polynomial hierarchy does not collapse, this means in particular that NP-complete languages do not have 4-round zero-knowledge proofs (at least with respect to black-box simulation).}, doi = {10.1007/978-3-540-78524-8_5}, author = {Katz, Jonathan} } @conference {12038, title = {Who killed the directed model?}, booktitle = {Computer Vision and Pattern Recognition, IEEE Computer Society Conference on}, year = {2008}, month = {2008///}, pages = {1 - 8}, publisher = {IEEE Computer Society}, organization = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, abstract = {Prior distributions are useful for robust low-level vision, and undirected models (e.g. Markov Random Fields) have become a central tool for this purpose. Though sometimes these priors can be specified by hand, this becomes difficult in large models, which has motivated learning these models from data. However, maximum likelihood learning of undirected models is extremely difficult- essentially all known methods require approximations and/or high computational cost. Conversely, directed models are essentially trivial to learn from data, but have not received much attention for low-level vision. We compare the two formalisms of directed and undirected models, and conclude that there is no a priori reason to believe one better represents low-level vision quantities. We formulate two simple directed priors, for natural images and stereo disparity, to empirically test if the undirected formalism is superior. We find in both cases that a simple directed model can achieve results similar to the best learnt undirected models with significant speedups in training time, suggesting that directed models are an attractive choice for tractable learning.}, isbn = {978-1-4244-2242-5}, doi = {http://doi.ieeecomputersociety.org/10.1109/CVPR.2008.4587817}, author = {Domke, Justin and Karapurkar, Alap and Aloimonos, J.} } @conference {15147, title = {On achieving the "best of both worlds" in secure multiparty computation}, booktitle = {Proceedings of the thirty-ninth annual ACM symposium on Theory of computing}, series = {STOC {\textquoteright}07}, year = {2007}, month = {2007///}, pages = {11 - 20}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Two settings are typically considered for secure multipartycomputation, depending on whether or not a majority of the partiesare assumed to be honest. Protocols designed under this assumptionprovide "full security" (and, in particular, guarantee outputdelivery and fairness) when this assumption is correct; however, if half or more of the parties are dishonest then security iscompletely compromised. On the other hand, protocols toleratingarbitrarily-many faults do not provide fairness or guaranteed output delivery even if only a single party is dishonest. It isnatural to wonder whether it is possible to achieve the "best ofboth worlds" : namely, a single protocol that simultaneouslyachieves the best possible security in both the above settings. Ishai, et al. (Crypto 2006) recently addressed this question, andruled out constant-round protocols of this type. As our main result, we completely settle the question by ruling outprotocols using any (expected) polynomial number of rounds. Given this stark negative result, we then ask what can be achieved if we are willing to assume simultaneous message transmission (or, equivalently, a non-rushing adversary). In this setting, we show that impossibility still holdsfor logarithmic-round protocols. We also show, for any polynomialp, a protocol (whose round complexity depends on p) that can be simulated to within closeness O(1/p).}, keywords = {COMPUTATION, secure}, isbn = {978-1-59593-631-8}, doi = {10.1145/1250790.1250793}, url = {http://doi.acm.org/10.1145/1250790.1250793}, author = {Katz, Jonathan} } @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} } @book {15194, title = {Applied cryptography and network security: 5th international conference, ACNS 2007, Zhuhai, China, June 5-8, 2007: proceedings}, volume = {4521}, year = {2007}, month = {2007///}, publisher = {Springer-Verlag New York Inc}, organization = {Springer-Verlag New York Inc}, author = {Katz, Jonathan and Yung,M.} } @conference {14318, title = {Barrier pointing: using physical edges to assist target acquisition on mobile device touch screens}, booktitle = {Proceedings of the 9th international ACM SIGACCESS conference on Computers and accessibility, October}, year = {2007}, month = {2007///}, pages = {15 - 17}, author = {Jon Froehlich and Wobbrock,J.O. and Kane,S.K.} } @article {12345, title = {Beyond single-appearance schedules: Efficient DSP software synthesis using nested procedure calls}, journal = {ACM Transactions on Embedded Computing Systems (TECS)}, volume = {6}, year = {2007}, month = {2007///}, pages = {14{\textendash}es - 14{\textendash}es}, author = {Ko,M. Y and Murthy,P. K and Bhattacharyya, Shuvra S.} } @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 {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} } @article {15156, title = {Chosen-ciphertext security from identity-based encryption}, journal = {SIAM Journal on Computing}, volume = {36}, year = {2007}, month = {2007///}, pages = {1301 - 1328}, abstract = {We propose simple and efficient CCA-secure public-key encryption schemes (i.e., schemessecure against adaptive chosen-ciphertext attacks) based on any identity-based encryption (IBE) scheme. Our constructions have ramifications of both theoretical and practical interest. First, our schemes give a new paradigm for achieving CCA-security; this paradigm avoids {\textquotedblleft}proofs of well-formedness{\textquotedblright} that have been shown to underlie previous constructions. Second, instantiating our construction using known IBE constructions we obtain CCA-secure encryption schemes whose performance is competitive with the most efficient CCA-secure schemes to date. Our techniques extend naturally to give an efficient method for securing IBE schemes (even hierarchical ones) against adaptive chosen-ciphertext attacks. Coupled with previous work, this gives the first efficient constructions of CCA-secure IBE schemes. }, author = {Boneh,D. and Canetti,R. and Halevi,S. and Katz, Jonathan} } @conference {18174, title = {Colluding Fingerprinted Video using the Gradient Attack}, booktitle = {Acoustics, Speech and Signal Processing, 2007. ICASSP 2007. IEEE International Conference on}, volume = {2}, year = {2007}, month = {2007/04//}, pages = {II-161 -II-164 - II-161 -II-164}, abstract = {Digital fingerprinting is an emerging tool to protect multimedia content from unauthorized distribution by embedding a unique fingerprint into each user{\textquoteright}s copy. Although several fingerprinting schemes have been proposed in related work, disproportional effort has been targeted towards identifying effective collusion attacks on fingerprinting schemes. Recent introduction of the gradient attack has refined the definition of an optimal attack and demonstrated strong effect on direct-sequence, uniformly distributed, and Gaussian spread spectrum fingerprints when applied to synthetic signals. In this paper, we apply the gradient attack on an existing well-engineered video fingerprinting scheme, refine the attack procedure, and demonstrate that the gradient attack is effective on Laplace fingerprints. Finally, we explore an improvement on fingerprint design to thwart the gradient attack. Results suggest that Laplace fingerprint should be avoided. However, we show that a signal mixed of Laplace and Gaussian fingerprints may serve as a design strategy to disable the gradient attack and force pirates into averaging as a form of adversary collusion.}, keywords = {attack;multimedia, attacks;digital, content, data;video, distribution;fingerprint, effort;gradient, fingerprinted, fingerprinting;disproportional, fingerprints;colluding, fingerprints;Laplace, Gaussian, identification;multimedia, of, processing;, protection;unauthorized, signal, spectrum, spread, systems;security, video;collusion}, doi = {10.1109/ICASSP.2007.366197}, author = {He,Shan and Kirovski,D. and M. Wu} } @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 {14951, title = {Component-based Data Layout for Efficient Slicing of Very Large Multidimensional Volumetric Data}, booktitle = {Scientific and Statistical Database Management, 2007. SSBDM {\textquoteright}07. 19th International Conference on}, year = {2007}, month = {2007/07//}, pages = {8 - 8}, abstract = {In this paper, we introduce a new efficient data layout scheme to efficiently handle out-of-core axis-aligned slicing queries of very large multidimensional volumetric data. Slicing is a very useful dimension reduction tool that removes or reduces occlusion problems in visualizing 3D/4D volumetric data sets and that enables fast visual exploration of such data sets. We show that the data layouts based on typical space-filling curves are not optimal for the out-of-core slicing queries and present a novel component-based data layout scheme for a specialized problem domain, in which it is only required to provide fast slicing at every k-th value, for any k gt; 1. Our component-based data layout scheme provides much faster processing time for any axis-aligned slicing direction at every k-th value, k gt; 1, requiring less cache memory size and without any replication of data. In addition, the data layout can be generalized to any high dimension.}, keywords = {axis-aligned, cache, curves;very, data, data;data, databases;, handling;query, large, layout;data, memory, multidimensional, processing;very, queries;space-filling, size;component-based, slicing, slicing;out-of-core, volumetric}, doi = {10.1109/SSDBM.2007.7}, author = {Kim,Jusub and JaJa, Joseph F.} } @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 {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 {15175, title = {Concurrently-secure blind signatures without random oracles or setup assumptions}, journal = {Theory of Cryptography}, year = {2007}, month = {2007///}, pages = {323 - 341}, abstract = {We show a new protocol for blind signatures in which security is preserved even under arbitrarily-many concurrent executions. The protocol can be based on standard cryptographic assumptions and is the first to be proven secure in a concurrent setting (under any assumptions) without random oracles or a trusted setup assumption such as a common reference string. Along the way, we also introduce new definitions of security for blind signature schemes.This research was supported by US-Israel Binational Science Foundation grant $\#$2004240. Work of the first author was also supported by an Eshkol fellowship from the Israel Ministry of Science and Technology. Work of the second author was also supported by NSF CAREER award $\#$0447075. }, doi = {10.1007/978-3-540-70936-7_18}, author = {Hazay,C. and Katz, Jonathan and Koo,C. Y and Lindell,Y.} } @conference {18879, title = {Conditionalization: Adapting forward-chaining planners to partially observable environments}, year = {2007}, month = {2007///}, abstract = {We provide a general way to take forward-chainingplanners for classical planning domains and condition- alize them, i.e., adapt them to generate policies for partially observable planning domains. For domain-configurable planners such as SHOP2, TLPlan, and TALplanner, our generalization tech- nique preserves the ability to use domain knowledge to achieve highly efficient planning. We demonstrate this experimentally in two problem domains. The experi- ments compare PKS and MBP (two existing planners for partially observable planning) and CondSHOP2, a version of the HTN planner SHOP2 created by apply- ing our conditionalization method. To our surprise, PKS and MBP could solve only the simplest problems in our test domains. In contrast, CondSHOP2 solved all of the test problems quite eas- ily. This suggests that the ability to use domain knowl- edge may be not just desirable but indeed essential for solving large problems in partially observable domains. }, url = {http://www.cs.umd.edu/~nau/papers/kuter2007conditionalization.pdf}, author = {Kuter,U. and Nau, Dana S. and Reisner,E. and Goldman,R.} } @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} } @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} } @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} } @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 {15134, title = {Efficient cryptographic protocols based on the hardness of learning parity with noise}, booktitle = {Proceedings of the 11th IMA international conference on Cryptography and coding}, series = {Cryptography and Coding{\textquoteright}07}, year = {2007}, month = {2007///}, pages = {1 - 15}, publisher = {Springer-Verlag}, organization = {Springer-Verlag}, address = {Berlin, Heidelberg}, abstract = {The problem of learning parity with noise (The LPN problem), which can be re-cast as the problem of decoding a random linear code, has attracted attention recently as a possible tool for developing highly-efficient cryptographic primitives suitable for resource-constrained devices such as RFID tags. This article surveys recent work aimed at designing efficient authentication protocols based on the conjectured hardness of this problem.}, isbn = {3-540-77271-5, 978-3-540-77271-2}, url = {http://dl.acm.org/citation.cfm?id=1782574.1782576}, author = {Katz, Jonathan} } @article {15121, title = {Efficient signature schemes with tight reductions to the Diffie-Hellman problems}, journal = {Journal of Cryptology}, volume = {20}, year = {2007}, month = {2007///}, pages = {493 - 514}, abstract = {We propose and analyze two efficient signature schemes whose security is tightly related to the Diffie-Hellman problems in the random oracle model. The security of our first scheme relies on the hardness of the computational Diffie-Hellman problem; the security of our second scheme - which is more efficient than the first-is based on the hardness of the decisional Diffie-Hellman problem, a stronger assumption. Given the current state of the art, it is as difficult to solve the Diffie-Hellman problems as it is to solve the discrete logarithm problem in many groups of cryptographic interest. Thus, the signature schemes shown here can currently offer substantially better efficiency (for a given level of provable security) than existing schemes based on the discrete logarithm assumption. The techniques we introduce can also be applied in a wide variety of settings to yield more efficient cryptographic schemes (based on various number-theoretic assumptions) with tight security reductions.}, doi = {10.1007/s00145-007-0549-3}, author = {Goh,E. J and Jarecki,S. and Katz, Jonathan and Wang,N.} } @article {12357, title = {Efficient simulation of critical synchronous dataflow graphs}, journal = {ACM Transactions on Design Automation of Electronic Systems (TODAES)}, volume = {12}, year = {2007}, month = {2007///}, pages = {1 - 28}, author = {Hsu,C. J and Ko,M. Y and Bhattacharyya, Shuvra S. and Ramasubbu,S. and Pino,J. L} } @article {16670, title = {Evaluating a cross-cultural children{\textquoteright}s online book community: Lessons learned for sociability, usability, and cultural exchange}, journal = {Interacting with Computers}, volume = {19}, year = {2007}, month = {2007/07//}, pages = {494 - 511}, abstract = {The use of computers for human-to-human communication among adults has been studied for many years, but using computer technology to enable children from all over the world to talk to each other has rarely been discussed by researchers. The goal of our research is to fill this gap and explore the design and evaluation of children{\textquoteright}s cross-language online communities via a case study of the International Children{\textquoteright}s Digital Library Communities (ICDLCommunities). This project supports the development of communities for children (ages 7{\textendash}11) that form around the International Digital Children{\textquoteright}s Library (ICDL) book collection. In this community the children can learn about each others{\textquoteright} cultures and make friends even if they do not speak the same language. They can also read and create stories and ask and answer questions about these. From this evaluation study we learned that: (i) children are very interested in their counterparts in other countries and a remarkable amount of communication takes place even when they do not share a common language; (ii) representing their identity online in many different forms is particularly important to children when communicating in an online community; (iii) children enjoy drawing but representing stories in a sequence of diagrams is challenging and needs support; and (iv) asking and answering questions without language is possible using graphical templates. In this paper we present our findings and make recommendations for designing children{\textquoteright}s cross-cultural online communities.}, keywords = {children, Cross-cultural, Evaluation and design, International Children{\textquoteright}s Digital Library, Online communities}, isbn = {0953-5438}, doi = {10.1016/j.intcom.2007.03.001}, url = {http://www.sciencedirect.com/science/article/pii/S0953543807000240}, author = {Komlodi,Anita and Hou,Weimin and Preece,Jenny and Druin, Allison and Golub,Evan and Alburo,Jade and Liao,Sabrina and Elkiss,Aaron and Resnik, Philip} } @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 {12249, title = {Exploiting approximate transitivity of trust}, booktitle = {Broadband Communications, Networks and Systems, 2007. BROADNETS 2007. Fourth International Conference on}, year = {2007}, month = {2007/09//}, pages = {515 - 524}, abstract = {Social networks, of which webs of trust are a particular type, have been shown to be effective ways of moving information with minimal external configuration, setup, or management. For applications requiring information assurance, a web of trust is an appealing system architecture, since trust is an inherent component of both the network design and assurance. The trust in a typical web of trust is not transitive, however, making the construction of an application with strong assurance difficult or impossible. Instead, in this paper we examine a notion of weak assurance that can be provided by a web of trust, and might be $\#$x201C;good enough $\#$x201D; for many applications. As a motivating example, and to provide a more concrete basis for exposition, we present KeyChains, a peer-to-peer system that operates over a distributed web of trust to provide fully decentralized public key publishing and retrieval. In addition to weak assurance guarantees, KeyChains also provides an audit trail for public keys retrieved. Our analysis and simulations show that the resulting system is both efficient and secure.}, doi = {10.1109/BROADNETS.2007.4550477}, author = {Morselli,Ruggero and Bhattacharjee, Bobby and Katz, Jonathan and Marsh,Michael} } @article {13998, title = {A fast algorithm for learning large scale preference relations}, journal = {Proceedings of the Eleventh International Conference on Artificial Intelligence and Statistics (AISTATS 2007)}, volume = {2}, year = {2007}, month = {2007///}, pages = {388 - 395}, abstract = {We consider the problem of learning the rank-ing function that maximizes a generalization of the Wilcoxon-Mann-Whitney statistic on training data. Relying on an ϵ-exact approx- imation for the error-function, we reduce the computational complexity of each iteration of a conjugate gradient algorithm for learn- ing ranking functions from O(m2), to O(m), where m is the size of the training data. Experiments on public benchmarks for ordi- nal regression and collaborative filtering show that the proposed algorithm is as accurate as the best available methods in terms of rank- ing accuracy, when trained on the same data, and is several orders of magnitude faster. }, author = {Raykar,V.C. and Duraiswami, Ramani and Krishnapuram,B.} } @article {13997, title = {Fast weighted summation of erfc functions}, journal = {Technical Reports from UMIACS UMIACS-TR-2007-03}, year = {2007}, month = {2007/01/08/}, abstract = {Abstract: Direct computation of the weighted sum of N complementaryerror functions at M points scales as O(MN). We present a O(M + N) $\epsilon$-exact approximation algorithm to compute the same. }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/7535}, author = {Raykar,Vikas C. and Duraiswami, Ramani and Krishnapuram,B.} } @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.} } @article {15120, title = {A forward-secure public-key encryption scheme}, journal = {Journal of Cryptology}, volume = {20}, year = {2007}, month = {2007///}, pages = {265 - 294}, abstract = {Cryptographic computations are often carried out on insecure devices for which the threat of key exposure represents a serious concern. Forward security allows one to mitigate the damage caused by exposure of secret keys. In a forward-secure scheme, secret keys are updated at regular periods of time; exposure of the secret key corresponding to a given time period does not enable an adversary to "break" the scheme (in the appropriate sense) for any prior time period. We present the first constructions of (non-interactive) forward-secure public-key encryption schemes. Our main construction achieves security against chosen-plaintext attacks in the standard model, and all parameters of the scheme are poly-logarithmic in the total number of time periods. Some variants and extensions of this scheme are also given. We also introduce the notion of binary tree encryption and construct a binary tree encryption scheme in the standard model. Our construction implies the first hierarchical identity-based encryption scheme in the standard model. (The notion of security we achieve, however, is slightly weaker than that achieved by some previous constructions in the random oracle model.)}, doi = {10.1007/s00145-006-0442-5}, author = {Canetti,R. and Halevi,S. and Katz, Jonathan} } @article {14581, title = {GATA and Nkx factors synergistically regulate tissue-specific gene expression and development in vivo}, journal = {Development}, volume = {134}, year = {2007}, month = {2007/01/01/}, pages = {189 - 198}, abstract = {In vitro studies have suggested that members of the GATA and Nkx transcription factor families physically interact, and synergistically activate pulmonary epithelial- and cardiac-gene promoters. However, the relevance of this synergy has not been demonstrated in vivo. We show that Gata6-Titf1 (Gata6-Nkx2.1) double heterozygous (G6-Nkx DH) embryos and mice have severe defects in pulmonary epithelial differentiation and distal airway development, as well as reduced phospholipid production. The defects in G6-Nkx DH embryos and mice are similar to those observed in human neonates with respiratory distress syndromes, including bronchopulmonary dysplasia, and differential gene expression analysis reveals essential developmental pathways requiring synergistic regulation by both Gata6 and Titf1 (Nkx2.1). These studies indicate that Gata6 and Nkx2.1 act in a synergistic manner to direct pulmonary epithelial differentiation and development in vivo, providing direct evidence that interactions between these two transcription factor families are crucial for the development of the tissues in which they are co-expressed.}, doi = {10.1242/dev.02720}, url = {http://dev.biologists.org/content/134/1/189.abstract}, author = {Zhang,Yuzhen and Rath,Nibedita and Hannenhalli, Sridhar and Wang,Zhishan and Cappola,Thomas and Kimura,Shioko and Atochina-Vasserman,Elena and Lu,Min Min and Beers,Michael F. and Morrisey,Edward E.} } @article {15279, title = {Genome Analysis Linking Recent European and African Influenza (H5N1) Viruses}, journal = {Emerging Infectious DiseasesEmerg Infect Dis}, volume = {13}, year = {2007}, month = {2007/05//}, pages = {713 - 718}, abstract = {Although linked, these viruses are distinct from earlier outbreak strains., To better understand the ecology and epidemiology of the highly pathogenic avian influenza virus in its transcontinental spread, we sequenced and analyzed the complete genomes of 36 recent influenza A (H5N1) viruses collected from birds in Europe, northern Africa, and southeastern Asia. These sequences, among the first complete genomes of influenza (H5N1) viruses outside Asia, clearly depict the lineages now infecting wild and domestic birds in Europe and Africa and show the relationships among these isolates and other strains affecting both birds and humans. The isolates fall into 3 distinct lineages, 1 of which contains all known non-Asian isolates. This new Euro-African lineage, which was the cause of several recent (2006) fatal human infections in Egypt and Iraq, has been introduced at least 3 times into the European-African region and has split into 3 distinct, independently evolving sublineages. One isolate provides evidence that 2 of these sublineages have recently reassorted.}, isbn = {1080-6040}, doi = {10.3201/eid1305.070013}, author = {Salzberg,Steven L. and Kingsford, Carl and Cattoli,Giovanni and Spiro,David J. and Janies,Daniel A. and Aly,Mona Mehrez and Brown,Ian H. and Couacy-Hymann,Emmanuel and De Mia,Gian Mario and Dung,Do Huu and Guercio,Annalisa and Joannis,Tony and Ali,Ali Safar Maken and Osmani,Azizullah and Padalino,Iolanda and Saad,Magdi D. and Savi{\'c},Vladimir and Sengamalay,Naomi A. and Yingst,Samuel and Zaborsky,Jennifer and Zorman-Rojs,Olga and Ghedin,Elodie and Capua,Ilaria} } @conference {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} } @inbook {14411, title = {Graphical Models in a Nutshell}, booktitle = {Introduction to Statistical Relational LearningIntroduction to Statistical Relational Learning}, year = {2007}, month = {2007///}, pages = {13 - 13}, author = {Koller,D. and Friedman,N. and Getoor, Lise and Taskar,B.} } @conference {19449, title = {Grow and Know: Understanding Record-keeping Needs for Tracking the Development of Young Children}, booktitle = {SIGCHI {\textquoteright}07}, series = {CHI {\textquoteright}07}, year = {2007}, month = {2007///}, pages = {1351 - 1360}, publisher = {ACM}, organization = {ACM}, abstract = {From birth through age five, children undergo rapid development and learn skills that will influence them their entire lives. Regular visits to the pediatrician and detailed record-keeping can ensure that children are progressing and can identify early warning signs of developmental delay or disability. However, new parents are often overwhelmed with new responsibilities, and we believe there is an opportunity for computing technology to assist in this process. In this paper, we present a qualitative study aimed at uncovering some specific needs for record-keeping and analysis for new parents and their network of caregivers. Through interviews and focus groups, we have confirmed assumptions about the rationales parents have and the functions required for using technology for record-keeping. We also identify new themes, potential prototypes, and design guidelines for this domain.}, keywords = {children, design requirements, developmental delay, healthcare, qualitative study}, isbn = {978-1-59593-593-9}, url = {http://doi.acm.org/10.1145/1240624.1240830}, author = {Kientz, Julie A. and Arriaga, Rosa I. and Marshini Chetty and Hayes, Gillian R. and Richardson, Jahmeilah and Patel, Shwetak N. and Abowd, Gregory D.} } @article {12579, title = {Guest Editorial: Special Issue on Human Detection and Recognition}, journal = {Information Forensics and Security, IEEE Transactions on}, volume = {2}, year = {2007}, month = {2007/09//}, pages = {489 - 490}, abstract = {The 12 regular papers and three correspondences in this special issue focus on human detection and recognition. The papers represent gait, face (3-D, 2-D, video), iris, palmprint, cardiac sounds, and vulnerability of biometrics and protection against the spoof attacks.}, isbn = {1556-6013}, doi = {10.1109/TIFS.2007.905740}, author = {Bhanu, B. and Ratha,N. K and Kumar, V. and Chellapa, Rama and Bigun, J.} } @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} } @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} } @conference {12585, title = {Human Identification using Gait and Face}, booktitle = {Computer Vision and Pattern Recognition, 2007. CVPR {\textquoteright}07. IEEE Conference on}, year = {2007}, month = {2007/06//}, pages = {1 - 2}, abstract = {In general the visual-hull approach for performing integrated face and gait recognition requires at least two cameras. In this paper we present experimental results for fusion of face and gait for the single camera case. We considered the NIST database which contains outdoor face and gait data for 30 subjects. In the NIST database, subjects walk along an inverted Sigma pattern. In (A. Kale, et al., 2003), we presented a view-invariant gait recognition algorithm for the single camera case along with some experimental evaluations. In this chapter we present the results of our view-invariant gait recognition algorithm in (A. Kale, et al., 2003) on the NIST database. The algorithm is based on the planar approximation of the person which is valid when the person walks far away from the camera. In (S. Zhou et al., 2003), an algorithm for probabilistic recognition of human faces from video was proposed and the results were demonstrated on the NIST database. Details of these methods can be found in the respective papers. We give an outline of the fusion strategy here.}, keywords = {algorithm;visual-hull, analysis;image, approach;cameras;face, approximation;probabilistic, database;camera;face, databases;, fusion;face, fusion;human, fusion;probability;video, Gait, identification;planar, NIST, processing;visual, recognition, recognition;gait, recognition;view-invariant, signal}, doi = {10.1109/CVPR.2007.383523}, author = {Chellapa, Rama and Roy-Chowdhury, A.K. and Kale, A.} } @conference {14973, title = {Information-Aware 2^ n-Tree for Efficient Out-of-Core Indexing of Very Large Multidimensional Volumetric Data}, booktitle = {Scientific and Statistical Database Management, 2007. SSBDM{\textquoteright}07. 19th International Conference on}, year = {2007}, month = {2007///}, pages = {9 - 9}, author = {Kim,J. and JaJa, Joseph F.} } @conference {12254, title = {Large-scale byzantine fault tolerance: safe but not always live}, booktitle = {Proceedings of the 3rd workshop on on Hot Topics in System Dependability}, series = {HotDep{\textquoteright}07}, year = {2007}, month = {2007///}, publisher = {USENIX Association}, organization = {USENIX Association}, address = {Berkeley, CA, USA}, abstract = {The overall correctness of large-scale systems composed of many groups of replicas executing BFT protocols scales poorly with the number of groups. This is because the probability of at least one group being compromised (more than 1/3 faulty replicas) increases rapidly as the number of groups increases. In this paper we address this problem with a simple modification to Castro and Liskov{\textquoteright}s BFT replication that allows for arbitrary choice of n (number of replicas) and f (failure threshold). The price to pay is a more restrictive liveness requirement, and we present the design of a large-scale BFT replicated system that obviates this problem.}, url = {http://dl.acm.org/citation.cfm?id=1323140.1323157}, author = {Rodrigues,Rodrigo and Kouznetsov,Petr and Bhattacharjee, Bobby} } @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 {16077, title = {NetLens: Iterative Exploration of Content-Actor Network Data}, journal = {Information VisualizationInformation Visualization}, volume = {6}, year = {2007}, month = {2007/03/20/}, pages = {18 - 31}, abstract = {Networks have remained a challenge for information retrieval and visualization because of the rich set of tasks that users want to accomplish. This paper offers an abstract Content-Actor network data model, a classification of tasks, and a tool to support them. The NetLens interface was designed around the abstract Content-Actor network data model to allow users to pose a series of elementary queries and iteratively refine visual overviews and sorted lists. This enables the support of complex queries that are traditionally hard to specify. NetLens is general and scalable in that it applies to any data set that can be represented with our abstract data model. This paper describes the use of NetLens with a subset of the ACM Digital Library consisting of about 4000 papers from the CHI conference written by about 6000 authors, and reports on a usability study with nine participants.}, keywords = {content-actor network data, digital library, incremental data exploration, iterative query refinement, User interfaces}, isbn = {1473-8716, 1473-8724}, doi = {10.1057/palgrave.ivs.9500143}, url = {http://ivi.sagepub.com/content/6/1/18}, author = {Kang,Hyunmo and Plaisant, Catherine and Lee,Bongshin and Bederson, Benjamin B.} } @article {12214, title = {NetLens: iterative exploration of content-actor network data}, journal = {Information Visualization}, volume = {6}, year = {2007}, month = {2007///}, pages = {18 - 31}, author = {Kang,H. and Plaisant, Catherine and Lee,B. and Bederson, Benjamin B.} } @article {12918, title = {New records of phytoplankton for Bangladesh. 3. Volvocales}, journal = {Bangladesh Journal of Plant Taxonomy}, volume = {14}, year = {2007}, month = {2007/12/01/}, abstract = {This study presents 21 species of Chlamydomonas, four species of Carteria, two species of each of Nephroselmis, Pyramidomonas and Scherffelia, and Collodictyon triciliatum, Polytoma minus, Tetrachloridium ? allorgei and Tetraselmis cordiformis. These species have been reported from some ponds of Mathbaria of Pirojpur and Bakerganj of Barisal districts in Bangladesh.}, isbn = {1028-2092}, doi = {10.3329/bjpt.v14i1.518}, url = {http://www.banglajol.info/bd/index.php/BJPT/article/viewArticle/518}, author = {Khondker,Moniruzzaman and Bhuiyan,Rauf Ahmed and Yeasmin,Jenat and Alam,Munirul and Sack,R. Bradley and Huq,Anwar and Rita R Colwell} } @article {12917, title = {New records of phytoplankton for Bangladesh. 4. Chlorococcales}, journal = {Bangladesh Journal of Plant Taxonomy}, volume = {14}, year = {2007}, month = {2007/12/02/}, abstract = {This study presents three species from each of Schroederia, Monoraphidium and Ankistrodesmus, two species and one variety of Dictyosphaerium, two varieties of Pediastrum, and Tetraedron arthrodesmiforme var. contorta, Chlorotetraedron polymorphum, Myrmecia aquatica, Oocystis tainoensis, Nephrocytium spirale, Kirchneriella irregularis, Coelastrum indicum and Scenedesmus similagineus. These taxa have been reported from some ponds of Mathbaria of Pirojpur and Bakerganj of Barisal Districts in Bangladesh.}, isbn = {1028-2092}, doi = {10.3329/bjpt.v14i2.528}, url = {http://www.banglajol.info/bd/index.php/BJPT/article/viewArticle/528}, author = {Khondker,Moniruzzaman and Bhuiyan,Rauf Ahmed and Yeasim,Jenat and Alam,Munirul and Sack,R. Bradley and Huq,Anwar and Rita R Colwell} } @article {14555, title = {Oblivious routing on node-capacitated and directed graphs}, journal = {ACM Transactions on Algorithms (TALG)}, volume = {3}, year = {2007}, month = {2007///}, pages = {51{\textendash}es - 51{\textendash}es}, author = {Hajiaghayi, Mohammad T. and Kleinberg,R. D and R\{\"a}cke,H. and Leighton,T.} } @article {12352, title = {Parameterized Looped Schedules for Compact Representation of Execution Sequences in DSP Hardware and Software Implementation}, journal = {IEEE Transactions on Signal Processing}, volume = {55}, year = {2007}, month = {2007/06//}, pages = {3126 - 3138}, abstract = {In this paper, we present a technique for compact representation of execution sequences in terms of efficient looping constructs. Here, by a looping construct, we mean a compact way of specifying a finite repetition of a set of execution primitives. Such compaction, which can be viewed as a form of hierarchical run-length encoding (RLE), has application in many very large scale integration (VLSI) signal processing contexts, including efficient control generation for Kahn processes on field-programmable gate arrays (FPGAs), and software synthesis for static dataflow models of computation. In this paper, we significantly generalize previous models for loop-based code compaction of digital signal processing (DSP) programs to yield a configurable code compression methodology that exhibits a broad range of achievable tradeoffs. Specifically, we formally develop and apply to DSP hardware and software synthesis a parameterizable loop scheduling approach with compact format, dynamic reconfigurability, and low-overhead decompression}, keywords = {Application software, array signal processing, code compression methodology, compact representation, Compaction, data compression, Design automation, Digital signal processing, digital signal processing chips, DSP, DSP hardware, embedded systems, Encoding, Field programmable gate arrays, field-programmable gate arrays (FPGAs), FPGA, Hardware, hierarchical runlength encoding, high-level synthesis, Kahn process, loop-based code compaction, looping construct, parameterized loop schedules, program compilers, reconfigurable design, runlength codes, scheduling, Signal generators, Signal processing, Signal synthesis, software engineering, software implementation, static dataflow models, Very large scale integration, VLSI}, isbn = {1053-587X}, doi = {10.1109/TSP.2007.893964}, author = {Ming-Yung Ko and Zissulescu,C. and Puthenpurayil,S. and Bhattacharyya, Shuvra S. and Kienhuis,B. and Deprettere,E. F} } @inbook {19623, title = {Parameterized st-Orientations of Graphs: Algorithms and Experiments}, booktitle = {Graph Drawing}, series = {Lecture Notes in Computer Science}, year = {2007}, month = {2007/01/01/}, pages = {220 - 233}, publisher = {Springer Berlin Heidelberg}, organization = {Springer Berlin Heidelberg}, abstract = {st-orientations (st-numberings) or bipolar orientations of undirected graphs are central to many graph algorithms and applications. Several algorithms have been proposed in the past to compute an st-orientation of a biconnected graph. However, as indicated in [1], the computation of more than one st-orientation is very important for many applications in multiple research areas, such as this of Graph Drawing. In this paper we show how to compute such orientations with certain (parameterized) characteristics in the final st-oriented graph, such as the length of the longest path. Apart from Graph Drawing, this work applies in other areas such as Network Routing and in tackling difficult problems such as Graph Coloring and Longest Path. We present primary approaches to the problem of computing longest path parameterized st-orientations of graphs, an analytical presentation (together with proof of correctness) of a new O(mlog5 n) (O(mlogn) for planar graphs) time algorithm that computes such orientations (and which was used in [1]) and extensive computational results that reveal the robustness of the algorithm.}, keywords = {Algorithm Analysis and Problem Complexity, Computer Graphics, Data structures, Discrete Mathematics in Computer Science}, isbn = {978-3-540-70903-9, 978-3-540-70904-6}, url = {http://link.springer.com/chapter/10.1007/978-3-540-70904-6_22}, author = {Charalampos Papamanthou and Tollis, Ioannis G.}, editor = {Kaufmann, Michael and Wagner, Dorothea} } @article {14871, title = {Photometric stereo with general, unknown lighting}, journal = {International Journal of Computer Vision}, volume = {72}, year = {2007}, month = {2007///}, pages = {239 - 257}, abstract = {Work on photometric stereo has shown how to recover the shape and reflectance properties of an object using multiple images taken with a fixed viewpoint and variable lighting conditions. This work has primarily relied on known lighting conditions or the presence of a single point source of light in each image. In this paper we show how to perform photometric stereo assuming that all lights in a scene are distant from the object but otherwise unconstrained. Lighting in each image may be an unknown and may include arbitrary combination of diffuse, point and extended sources. Our work is based on recent results showing that for Lambertian objects, general lighting conditions can be represented using low order spherical harmonics. Using this representation we can recover shape by performing a simple optimization in a low-dimensional space. We also analyze the shape ambiguities that arise in such a representation. We demonstrate our method by reconstructing the shape of objects from images obtained under a variety of lightings. We further compare the reconstructed shapes against shapes obtained with a laser scanner.}, doi = {10.1007/s11263-006-8815-7}, author = {Basri,R. and Jacobs, David W. and Kemelmacher,I.} } @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} } @inbook {14410, title = {Probabilistic Relational Models}, booktitle = {Introduction to Statistical Relational LearningIntroduction to Statistical Relational Learning}, year = {2007}, month = {2007///}, pages = {129 - 129}, author = {Getoor, Lise and Friedman,N. and Koller,D. and Pfeffer,A. and Taskar,B.} } @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} } @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.} } @article {15162, title = {Review of "Probability and Computing: Randomized Algorithms and Probabilitic Analysis by Michael Mitzenmacher and Eli Upfal", Cambridge University Press, 2005}, journal = {SIGACT News}, volume = {38}, year = {2007}, month = {2007/09//}, pages = {20 - 22}, isbn = {0163-5700}, doi = {10.1145/1324215.1324220}, url = {http://doi.acm.org/10.1145/1324215.1324220}, author = {Katz, Jonathan} } @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.} } @conference {15105, title = {Round Complexity of Authenticated Broadcast with a Dishonest Majority}, booktitle = {Foundations of Computer Science, 2007. FOCS {\textquoteright}07. 48th Annual IEEE Symposium on}, year = {2007}, month = {2007/10//}, pages = {658 - 668}, abstract = {Broadcast among n parties in the presence of t ges n/3 malicious parties is possible only with some additional setup. The most common setup considered is the existence of a PKI and secure, digital signatures, where so-called authenticated broadcast is achievable for any t lt; n. It is known that t + 1 rounds are necessary and sufficient for deterministic protocols achieving authenticated broadcast. Recently, however, randomized protocols running in expected constant rounds have been shown for the case of t lt; n/2. It has remained open whether randomization can improve the round complexity when an honest majority is not present. We address this question and show upper/lower bounds on how much randomization can help: ldr For t les n/2 + k, we. show a randomized broadcast protocol that runs in expected O(k2) rounds. In particular, we obtain expected constant-round pivtocols for t = n/2 + O(1). ldr On the negative side, we show that even randomized protocols require Omega(2n/(n-t)) rounds. This in particular rules out expected constant-round protocols when the fraction of honest parties is sub-constant.}, keywords = {broadcast, complexity;cryptographic, complexity;deterministic, cryptography;, key, majority;randomized, PKI;authenticated, protocols;broadcasting;computational, protocols;digital, round, signatures;dishonest, signatures;public}, doi = {10.1109/FOCS.2007.44}, author = {Garay,J. A and Katz, Jonathan and Koo,Chiu-Yuen and Ostrovsky,R.} } @article {15080, title = {Round-efficient secure computation in point-to-point networks}, journal = {Advances in Cryptology-EUROCRYPT 2007}, year = {2007}, month = {2007///}, pages = {311 - 328}, abstract = {Essentially all work studying the round complexity of secure computation assume broadcast as an atomic primitive. Protocols constructed under this assumption tend to have very poor round complexity when compiled for a point-to-point network due to the high overhead of emulating each invocation of broadcast. This problem is compounded when broadcast is used in more than one round of the original protocol due to the complexity of handling sequential composition (when using round-efficient emulation of broadcast).We argue that if the goal is to optimize round complexity in point-to-point networks, then it is preferable to design protocols {\textemdash} assuming a broadcast channel {\textemdash} minimizing the number of rounds in which broadcast is used rather than minimizing the total number of rounds. With this in mind, we present protocols for secure computation in a number of settings that use only a single round of broadcast. In all cases, we achieve optimal security threshold for adaptive adversaries, and obtain protocols whose round complexity (in a point-to-point network) improves on prior work. }, doi = {10.1007/978-3-540-72540-4_18}, author = {Katz, Jonathan and Koo,C. Y} } @article {15125, title = {Scalable protocols for authenticated group key exchange}, journal = {Journal of Cryptology}, volume = {20}, year = {2007}, month = {2007///}, pages = {85 - 113}, abstract = {We consider the problem of authenticated group key exchange among n parties communicating over an insecure public network. A number of solutions to this problem have been proposed; however, all prior provably secure solutions do not scale well and, in particular, require O(n) rounds. Our main contribution is the first scalable protocol for this problem along with a rigorous proof of security in the standard model under the DDH assumption; our protocol uses a constant number of rounds and requires only O(1) "full" modular exponentiations per user. Toward this goal (and adapting work of Bellare, Canetti, and Krawczyk), we first present an efficient compiler that transforms any group key-exchange protocol secure against a passive eavesdropper to an authenticated protocol which is secure against an active adversary who controls all communication in the network. This compiler adds only one round and O(1) communication (per user) to the original scheme. We then prove secure{\textemdash}against a passive adversary{\textemdash}a variant of the two-round group key-exchange protocol of Burmester and Desmedt. Applying our compiler to this protocol results in a provably secure three-round protocol for authenticated group key exchange which also achieves forward secrecy.}, doi = {10.1007/s00145-006-0361-5}, author = {Katz, Jonathan and Yung,M.} } @article {12262, title = {Secure lookup without (constrained) flooding}, journal = {WRAITS 2007}, year = {2007}, month = {2007///}, author = {Bhattacharjee, Bobby and Rodrigues,R. and Kouznetsov,P.} } @article {16807, title = {System for 802.11 connectivity at high speed}, volume = {UMIACS-TR-2007-27}, year = {2007}, month = {2007/05/13/}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {Measurements and ongoing research have shown that WLANconnection for moving vehicles is feasible. However none of the previous work suggests a solution addressing a complete array of the challenges in vehicular WLAN communications. To amend this we designed a system that provides wireless connection roaming at high velocities transparent to user level applications, and does not impose additional requirements to existing infrastructures. It offers simple deployment, security, and scalability. It remains efficient under - intermittent connectivity conditions and supports heterogeneous network mediums for increased robustness. }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu//handle/1903/4374}, author = {Frangiadakis,Nikolaos and Kuklov,Danila and Roussopoulos, Nick} } @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} } @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 {12212, title = {Thumbspace: Generalized one-handed input for touchscreen-based mobile devices}, booktitle = {Proceedings of the 11th IFIP TC 13 international conference on Human-computer interaction}, year = {2007}, month = {2007///}, pages = {324 - 338}, author = {Karlson,A.K. and Bederson, Benjamin B.} } @article {15254, title = {To fill or not to fill: the gas station problem}, journal = {Algorithms{\textendash}ESA 2007}, year = {2007}, month = {2007///}, pages = {534 - 545}, abstract = {In this paper we study several routing problems that generalize shortest paths and the Traveling Salesman Problem. We consider a more general model that incorporates the actual cost in terms of gas prices. We have a vehicle with a given tank capacity. We assume that at each vertex gas may be purchased at a certain price. The objective is to find the cheapest route to go from s to t, or the cheapest tour visiting a given set of locations. Surprisingly, the problem of find the cheapest way to go from s to t can be solved in polynomial time and is not NP-complete. For most other versions however, the problem is NP-complete and we develop polynomial time approximation algorithms for these versions.}, doi = {10.1007/978-3-540-75520-3_48}, author = {Khuller, Samir and Malekian,A. and Mestre,J.} } @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 {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 {15079, title = {Universally composable multi-party computation using tamper-proof hardware}, journal = {Advances in Cryptology-EUROCRYPT 2007}, year = {2007}, month = {2007///}, pages = {115 - 128}, abstract = {Protocols proven secure within the universal composability (UC) framework satisfy strong and desirable security properties. Unfortunately, it is known that within the {\textquotedblleft}plain{\textquotedblright} model, secure computation of general functionalities without an honest majority is impossible. This has prompted researchers to propose various {\textquotedblleft}setup assumptions{\textquotedblright} with which to augment the bare UC framework in order to bypass this severe negative result. Existing setup assumptions seem to inherently require some trusted party (or parties) to initialize the setup in the real world.We propose a new setup assumption {\textemdash} more along the lines of a physical assumption regarding the existence of tamper-proof hardware {\textemdash} which also suffices to circumvent the impossibility result mentioned above. We suggest this assumption as potentially leading to an approach that might alleviate the need for trusted parties, and compare our assumption to those proposed previously. }, doi = {10.1007/978-3-540-72540-4_7}, author = {Katz, Jonathan} } @conference {15141, title = {Universally-composable two-party computation in two rounds}, booktitle = {Proceedings of the 27th annual international cryptology conference on Advances in cryptology}, series = {CRYPTO{\textquoteright}07}, year = {2007}, month = {2007///}, pages = {111 - 129}, publisher = {Springer-Verlag}, organization = {Springer-Verlag}, address = {Berlin, Heidelberg}, abstract = {Round complexity is a central measure of efficiency, and characterizing the round complexity of various cryptographic tasks is of both theoretical and practical importance. We show here a universally-composable (UC) protocol (in the common reference string model) for two-party computation of any functionality, where both parties receive output, using only two rounds. (This assumes honest parties are allowed to transmit messages simultaneously in any given round; we obtain a three-round protocol when parties are required to alternate messages.) Our results match the obvious lower bounds for the round complexity of secure two-party computation under any reasonable definition of security, regardless of what setup is used. Thus, our results establish that secure two-party computation can be obtained under a commonly-used setup assumption with maximal security (i.e., security under general composition) in a minimal number of rounds. To give but one example of the power of our general result, we observe that as an almost immediate corollary we obtain a two-round UC blind signature scheme, matching a result by Fischlin at Crypto 2006 (though, in contrast to Fischlin, we use specific number-theoretic assumptions).}, isbn = {3-540-74142-9, 978-3-540-74142-8}, url = {http://dl.acm.org/citation.cfm?id=1777777.1777788}, author = {Horvitz,Omer and Katz, Jonathan} } @conference {18611, title = {Usage-based dhcp lease time optimization}, booktitle = {Proceedings of the 7th ACM SIGCOMM conference on Internet measurement}, series = {IMC {\textquoteright}07}, year = {2007}, month = {2007///}, pages = {71 - 76}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {The Dynamic Host Configuration Protocol (DHCP) is used to dynamically allocate address space to hosts on a local area network. Despite its widespread usage, few studies exist on DHCP usage patterns, and even less is known about the importance of setting the lease time (the time that a client retains ownership over some IP address) to an appropriate value. Lease time can greatly affect the tradeoff between address space utilization and the number of both renewal messages and client session expirations. In this paper, using a DHCP trace for 5 weekdays from the Georgia Tech campus network, we present the largest known study of DHCP utilization. We also explore how various strategies for setting lease times can dramatically reduce the number of renewals and expirations without prohibitively increasing address space utilization.}, keywords = {dhcp, network management, OPTIMIZATION, usage}, isbn = {978-1-59593-908-1}, doi = {10.1145/1298306.1298315}, url = {http://doi.acm.org/10.1145/1298306.1298315}, author = {Khadilkar,Manas and Feamster, Nick and Sanders,Matt and Clark,Russ} } @article {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 {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.} } @article {11970, title = {View-invariant modeling and recognition of human actions using grammars}, journal = {Dynamical Vision}, year = {2007}, month = {2007///}, pages = {115 - 126}, author = {Ogale, A. and Karapurkar, A. and Aloimonos, J.} } @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 {15244, title = {Achieving anonymity via clustering}, booktitle = {Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems}, series = {PODS {\textquoteright}06}, year = {2006}, month = {2006///}, pages = {153 - 162}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Publishing data for analysis from a table containing personal records, while maintaining individual privacy, is a problem of increasing importance today. The traditional approach of de-identifying records is to remove identifying fields such as social security number, name etc. However, recent research has shown that a large fraction of the US population can be identified using non-key attributes (called quasi-identifiers) such as date of birth, gender, and zip code [15]. Sweeney [16] proposed the k-anonymity model for privacy where non-key attributes that leak information are suppressed or generalized so that, for every record in the modified table, there are at least k-1 other records having exactly the same values for quasi-identifiers. We propose a new method for anonymizing data records, where quasi-identifiers of data records are first clustered and then cluster centers are published. To ensure privacy of the data records, we impose the constraint that each cluster must contain no fewer than a pre-specified number of data records. This technique is more general since we have a much larger choice for cluster centers than k-Anonymity. In many cases, it lets us release a lot more information without compromising privacy. We also provide constant-factor approximation algorithms to come up with such a clustering. This is the first set of algorithms for the anonymization problem where the performance is independent of the anonymity parameter k. We further observe that a few outlier points can significantly increase the cost of anonymization. Hence, we extend our algorithms to allow an ε fraction of points to remain unclustered, i.e., deleted from the anonymized publication. Thus, by not releasing a small fraction of the database records, we can ensure that the data published for analysis has less distortion and hence is more useful. Our approximation algorithms for new clustering objectives are of independent interest and could be applicable in other clustering scenarios as well.}, keywords = {anonymity, Approximation algorithms, clustering, privacy}, isbn = {1-59593-318-2}, doi = {10.1145/1142351.1142374}, url = {http://doi.acm.org/10.1145/1142351.1142374}, author = {Aggarwal,Gagan and Feder,Tom{\'a}s and Kenthapadi,Krishnaram and Khuller, Samir and Panigrahy,Rina and Thomas,Dilys and Zhu,An} } @conference {13491, title = {Adaptive Transformation-based Learning for Improving Dictionary Tagging}, booktitle = {Proceedings of the 11th Conference on European Chapter of the Association for Computational Linguistics}, year = {2006}, month = {2006/04//}, pages = {257 - 264}, address = {Trento, Italy}, abstract = {We present an adaptive technique that enables users to produce a high quality dictionary parsed into its lexicographic components (headwords, parts of speech, translations, etc.) using an extremely small amount of user provided training data. We use transformation-based learning (TBL) as a postprocessor at two points in the system to improve performance. The results show that the tagging accuracy is increased from 83\% and 91\% to 93\% and 94\% for individual words or tokens , and from 64\% and 83\% to 90\% and 93\% for contiguous phrases such as definitions or examples of usage.}, author = {Karagol-Ayan,Burcu and Doermann, David and Weinberg, Amy} } @article {15253, title = {Algorithms for non-uniform size data placement on parallel disks}, journal = {Journal of Algorithms}, volume = {60}, year = {2006}, month = {2006/08//}, pages = {144 - 167}, abstract = {We study an optimization problem that arises in the context of data placement in a multimedia storage system. We are given a collection of M multimedia objects (data items) that need to be assigned to a storage system consisting of N disks d 1 , d 2 , {\textellipsis} , d N . We are also given sets U 1 , U 2 , {\textellipsis} , U M such that U i is the set of clients seeking the ith data item. Data item i has size s i . Each disk d j is characterized by two parameters, namely, its storage capacity C j which indicates the maximum total size of data items that may be assigned to it, and a load capacity L j which indicates the maximum number of clients that it can serve. The goal is to find a placement of data items to disks and an assignment of clients to disks so as to maximize the total number of clients served, subject to the capacity constraints of the storage system.We study this data placement problem for homogeneous storage systems where all the disks are identical. We assume that all disks have a storage capacity of k and a load capacity of L. Previous work on this problem has assumed that all data items have unit size, in other words s i = 1 for all i. Even for this case, the problem is NP-hard. For the case where s i ∈ { 1 , {\textellipsis} , Δ } for some constant Δ, we develop a polynomial time approximation scheme (PTAS). This result is obtained by developing two algorithms, one that works for constant k and one that works for arbitrary k. The algorithm for arbitrary k guarantees that a solution where at least ( ( k - Δ ) ( k + Δ ) ) ( 1 - 1 ( 1 + k ( 2 Δ ) ) 2 ) -fraction of all clients are assigned to a disk (under certain assumptions). In addition we develop an algorithm for which we can prove tight bounds when s i ∈ { 1 , 2 } . In fact, we can show that a ( 1 - 1 ( 1 + ⌊ k / 2 ⌋ ) 2 ) -fraction of all clients can be assigned (under certain natural assumptions), regardless of the input distribution. }, isbn = {0196-6774}, doi = {10.1016/j.jalgor.2004.06.007}, url = {http://www.sciencedirect.com/science/article/pii/S0196677404001063}, author = {Kashyap,Srinivas and Khuller, Samir} } @article {15712, title = {Algorithms for Structured Total Least Squares Problems with Applications to Blind Image Deblurring}, journal = {Journal of Research of the National Institute of Standards and Technology}, volume = {111}, year = {2006}, month = {2006///}, pages = {113 - 119}, abstract = {Mastronardi, Lemmerling, and van Huel presented an algorithm for solving a total least squares problem when the matrix and its perturbations are Toeplitz. A Toeplitz matrix is a special kind of matrix with small displacement rank. Here we generalize the fast algorithm to any matrix with small displacement rank. In particular, we show how to efficiently construct the generators whenever M has small displacement rank and show that in many important cases the Cholesky factorization of the matrix M M can also be determined fast. We further extend this problem to Tikhonov regularization of ill-posed problems and illustrate the use of the algorithm on an image deblurring problem.}, url = {http://nvl.nist.gov/pub/nistpubs/jres/111/2/V111.N02.A06.pdfhttp://nvl.nist.gov/pub/nistpubs/jres/111/2/V111.N02.A06.pdf}, author = {Kalsi,Anoop and O{\textquoteright}Leary, Dianne P.} } @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.} } @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 {15248, title = {Approximating the minimal sensor selection for supervisory control}, journal = {Discrete Event Dynamic Systems}, volume = {16}, year = {2006}, month = {2006///}, pages = {143 - 170}, abstract = {This paper discusses the problem of selecting a set of sensors of minimum cost that can be used for the synthesis of a supervisory controller. It is shown how this sensor selection problem is related to a type of directed graph st-cut problem that has not been previously discussed in the literature. Approximation algorithms to solve the sensor selection problem can be used to solve the graph cutting problem and vice-versa. Polynomial time algorithms to find good approximate solutions to either problem most likely do not exist (under certain complexity assumptions), but a time efficient approximation algorithm is shown that solves a special case of these problems. It is also shown how to convert the sensor selection problem into an integer programming problem.}, doi = {10.1007/s10626-006-6187-3}, author = {Rohloff,K. R and Khuller, Samir and Kortsarz,G.} } @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} } @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 {13728, title = {Automatic identification of confusable drug names}, journal = {Artificial Intelligence in Medicine}, volume = {36}, year = {2006}, month = {2006/01//}, pages = {29 - 42}, abstract = {SummaryObjectiveMany hundreds of drugs have names that either look or sound so much alike that doctors, nurses and pharmacists can get them confused, dispensing the wrong one in errors that can injure or even kill patients. Methods and material We propose to address the problem through the application of two new methods{\textemdash}one based on orthographic similarity ({\textquotedblleft}look-alike{\textquotedblright}), and the other based on phonetic similarity ({\textquotedblleft}sound-alike{\textquotedblright}). In order to compare the effectiveness of the new methods for identifying confusable drug names with other known similarity measures, we developed a novel evaluation methodology. Results We show that the new orthographic measure (BI-SIM) outperforms other commonly used measures of similarity on a set containing both look-alike and sound-alike pairs, and that a new feature-based phonetic approach (ALINE) outperforms orthographic approaches on a test set containing solely sound-alike pairs. However, an approach that combines several different measures achieves the best results on two test sets. Conclusion Our system is currently used as the basis of a system developed for the U.S. Food and Drug Administration for detection of confusable drug names. }, keywords = {Drug names, Evaluation methodology, Lexical similarity, Medical errors}, isbn = {0933-3657}, doi = {10.1016/j.artmed.2005.07.005}, url = {http://www.sciencedirect.com/science/article/pii/S0933365705001004}, author = {Kondrak,Grzegorz and Dorr, Bonnie J} } @article {13175, title = {Ballistic hand movements}, journal = {Articulated Motion and Deformable Objects}, year = {2006}, month = {2006///}, pages = {153 - 164}, abstract = {Common movements like reaching, striking, etc. observed during surveillance have highly variable target locations. This puts appearance-based techniques at a disadvantage for modelling and recognizing them. Psychological studies indicate that these actions are ballistic in nature. Their trajectories have simple structures and are determined to a great degree by the starting and ending positions. We present an approach for movement recognition that explicitly considers their ballistic nature. This enables the decoupling of recognition from the movement{\textquoteright}s trajectory, allowing generalization over a range of target-positions. A given movement is first analyzed to determine if it is ballistic. Ballistic movements are further classified into reaching, striking, etc. The proposed approach was tested with motion capture data obtained from the CMU MoCap database.}, author = {Prasad,V. and Kellokumpu,V. and Davis, Larry S.} } @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 {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 {15124, title = {Characterization of security notions for probabilistic private-key encryption}, journal = {Journal of Cryptology}, volume = {19}, year = {2006}, month = {2006///}, pages = {67 - 95}, abstract = {The development of precise definitions of security for encryption, as well as a detailed understanding of their relationships, has been a major area of research in modern cryptography. Here, we focus on the case of private-key encryption. Extending security notions from the public-key setting, we define security in the sense of both indistinguishability and non-malleability against chosen-plaintext and chosen-ciphertext attacks, considering both non-adaptive (i.e., {\textquoteleft}{\textquoteleft}lunchtime{\textquoteright}{\textquoteright}) and adaptive oracle access (adaptive here refers to an adversary{\textquoteright}s ability to interact with a given oracle even after viewing the challenge ciphertext). We then characterize the 18 resulting security notions in two ways. First, we construct a complete hierarchy of security notions; that is, for every pair of definitions we show whether one definition is stronger than the other, whether the definitions are equivalent, or whether they are incomparable. Second, we partition these notions of security into two classes (computational or information-theoretic) depending on whether one-way functions are necessary in order for encryption schemes satisfying the definition to exist. Perhaps our most surprising result is that security against adaptive chosen-plaintext attack is (polynomially) equivalent to security against non-adaptive chosen-plaintext attack. On the other hand, the ability of an adversary to mount a (non-adaptive) chosen-plaintext attack is the key feature distinguishing computational and information-theoretic notions of security. These results hold for all security notions considered here.}, doi = {10.1007/s00145-005-0310-8}, author = {Katz, Jonathan and Yung,M.} } @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.} } @article {12378, title = {Contention-conscious transaction ordering in multiprocessor DSP systems}, journal = {IEEE Transactions on Signal Processing}, volume = {54}, year = {2006}, month = {2006/02//}, pages = {556 - 569}, abstract = {This paper explores the problem of efficiently ordering interprocessor communication (IPC) operations in statically scheduled multiprocessors for iterative dataflow graphs. In most digital signal processing (DSP) applications, the throughput of the system is significantly affected by communication costs. By explicitly modeling these costs within an effective graph-theoretic analysis framework, we show that ordered transaction schedules can significantly outperform self-timed schedules even when synchronization costs are low. However, we also show that when communication latencies are nonnegligible, finding an optimal transaction order given a static schedule is an NP-complete problem, and that this intractability holds both under iterative and noniterative execution. We develop new heuristics for finding efficient transaction orders, and perform an extensive experimental comparison to gauge the performance of these heuristics.}, keywords = {contention-conscious transaction ordering, Costs, data flow graphs, Dataflow, Delay, Digital signal processing, digital signal processing chips, Embedded system, graph-theoretic analysis, Instruments, Internet telephony, interprocessor communication, iterative dataflow graphs, iterative methods, Message passing, multiprocessor, multiprocessor DSP systems, NP-complete problem, Processor scheduling, scheduling, Signal processing, synchronization, Throughput}, isbn = {1053-587X}, doi = {10.1109/TSP.2005.861074}, author = {Khandelia,M. and Bambha,N. K and Bhattacharyya, Shuvra S.} } @conference {18888, title = {Controlled search over compact state representations, in nondeterministic planning domains and beyond}, volume = {21}, year = {2006}, month = {2006///}, pages = {1638 - 1638}, abstract = {Two of the most efficient planners for planning in nondeter- ministic domains are MBP and ND-SHOP2. MBP achieves its efficiency by using Binary Decision Diagrams (BDDs) to represent sets of states that share some common properties, so it can plan for all of these states simultaneously. ND-SHOP2 achieves its efficiency by using HTN task decomposition to focus the search. In some environments, ND-SHOP2 runs exponentially faster than MBP, and in others the reverse is true. In this paper, we discuss the following:{\textbullet} We describe how to combine ND-SHOP2{\textquoteright}s HTNs with MBP{\textquoteright}s BDDs. Our new planning algorithm, YoYo, per- forms task decompositions over classes of states that are represented as BDDs. In our experiments, YoYo easily outperformed both MBP and ND-SHOP2, often by sev- eral orders of magnitude. {\textbullet} HTNsarejustoneofseveraltechniquesthatareoriginally developed for classical planning domains and that can be adapted to work in nondeterministic domains. By combin- ing those techniques with a BDD representation, it should be possible to get great speedups just as we did here. {\textbullet} We discuss how these same ideas can be generalized for use in several other research areas, such as planning with Markov Decision Processes, synthesizing controllers for hybrid systems, and composing Semantic Web Services. }, url = {https://www.aaai.org/Papers/AAAI/2006/AAAI06-269.pdf}, author = {Kuter,U. and Nau, Dana S.} } @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} } @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.} } @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 {16792, title = {Dissemination of compressed historical information in sensor networks}, journal = {The VLDB JournalThe VLDB Journal}, volume = {16}, year = {2006}, month = {2006/07//}, pages = {439 - 461}, isbn = {1066-8888}, doi = {10.1007/s00778-005-0173-5}, url = {http://dl.acm.org/citation.cfm?id=1285903}, author = {Deligiannakis,Antonios and Kotidis,Yannis and Roussopoulos, Nick} } @conference {12277, title = {Distributing Google}, booktitle = {Data Engineering Workshops, 2006. Proceedings. 22nd International Conference on}, year = {2006}, month = {2006///}, pages = {33 - 33}, abstract = {We consider the problem of wide-area large-scale text search over a peer-to-peer infrastructure. A wide-area search infrastructure with billions of documents and millions of search terms presents unique challenges in terms of the amount of state that must be maintained and updated. Distributing such a system would require tens of thousands of hosts leading to the usual problems associated with node failures, churn and data migration. Localities inherent in query patterns will cause load imbalances and hot spots that can severely impair performance. In this paper, we describe an architecture for constructing a scalable search infrastructure that is designed to cope with the challenges of scale described above. Our architecture consists of a data store layer which is used to reliably store and recompute indexes over a slow timescale and a caching layer that is used to respond to most queries. Our primary insight is that the problem of efficiently retrieving a small number of relevant results must be decoupled from the problem of reliably storing potentially huge indexes. Relevant results can be quickly retrieved from caches of ranked results, which can be replicated based upon query load. An entirely different set of mechanisms, such as encoded storage and/or data partitioning, should be used to store large indexes reliably. These indexes should only be used to compute results when there is a miss in the cache.}, doi = {10.1109/ICDEW.2006.49}, author = {Gopalakrishnan,V. and Bhattacharjee, Bobby and Keleher,P.} } @conference {12348, title = {Efficient simulation of critical synchronous dataflow graphs}, booktitle = {Proceedings of the 43rd annual Design Automation Conference}, year = {2006}, month = {2006///}, pages = {893 - 898}, author = {Hsu,C. J and Ramasubbu,S. and Ko,M. Y and Pino,J. L and Bhattacharyya, Shuvra S.} } @article {12373, title = {Efficient techniques for clustering and scheduling onto embedded multiprocessors}, journal = {IEEE Transactions on Parallel and Distributed Systems}, year = {2006}, month = {2006///}, pages = {667 - 680}, author = {Kianzad,V. and Bhattacharyya, Shuvra S.} } @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 {15076, title = {On expected constant-round protocols for Byzantine agreement}, journal = {Advances in Cryptology-CRYPTO 2006}, year = {2006}, month = {2006///}, pages = {445 - 462}, abstract = {In a seminal paper, Feldman and Micali (STOC {\textquoteright}88) show an n-party Byzantine agreement protocol tolerating t < n/3 malicious parties that runs in expected constant rounds. Here, we show an expected constant-round protocol for authenticated Byzantine agreement assuming honest majority (i.e., t < n/2), and relying only on the existence of a secure signature scheme and a public-key infrastructure (PKI). Combined with existing results, this gives the first expected constant-round protocol for secure computation with honest majority in a point-to-point network assuming only one-way functions and a PKI. Our key technical tool {\textemdash} a new primitive we introduce called moderated VSS {\textemdash} also yields a simpler proof of the Feldman-Micali result.We also show a simple technique for sequential composition of protocols without simultaneous termination (something that is inherent for Byzantine agreement protocols using o(n) rounds) for the case of t=3. Contrary to their claim, we show a protocol for rational secret sharing among n=2 players; our protocol extends to the case n>=3, where it is simpler than the Halpern-Teague solution and also offers a number of other advantages. We also show how to avoid the continual involvement of the dealer, in either our own protocol or that of Halpern and Teague.Our techniques extend to the case of rational players trying to securely compute an arbitrary function, under certain assumptions on the utilities of the players. }, doi = {10.1007/11832072_16}, author = {Gordon,S. and Katz, Jonathan} } @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 {15150, title = {Reliable broadcast in radio networks: the bounded collision case}, booktitle = {Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing}, series = {PODC {\textquoteright}06}, year = {2006}, month = {2006///}, pages = {258 - 264}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {We study the problem of achieving global broadcast in a radio network where a node can multicast messages to all of its neighbors (that is, nodes within some given distance r), and up to t nodes in any single neighborhood may be corrupted. Previous work assumes that corrupted nodes can neither cause collisions nor spoof addresses of honest nodes. In this work, we eliminate these assumptions and allow each faulty node to cause a (known) bounded number of collisions and spoof the addresses of arbitrary other nodes. We show that the maximum tolerable t in this case is identical to the maximum tolerable t when collisions and address spoofing are not allowed. Thus, by causing collisions and spoofing addresses an adversary may be able to degrade the efficiency of achieving broadcast, but it cannot affect the feasibility of this task.}, keywords = {broadcast, byzantine failure, Fault tolerance, radio networks}, isbn = {1-59593-384-0}, doi = {10.1145/1146381.1146420}, url = {http://doi.acm.org/10.1145/1146381.1146420}, author = {Koo,Chiu-Yuen and Bhandari,Vartika and Katz, Jonathan and Vaidya,Nitin H.} } @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.} } @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 {15160, title = {Review of "A Computational Introduction to Number Theory and Algebra by Victor Shoup", Cambridge University Press, 2005}, journal = {SIGACT News}, volume = {37}, year = {2006}, month = {2006/03//}, pages = {12 - 13}, isbn = {0163-5700}, doi = {10.1145/1122480.1122483}, url = {http://doi.acm.org/10.1145/1122480.1122483}, author = {Katz, Jonathan} } @article {15161, title = {Review of "Primality Testing in Polynomial Time by Martin Dietzfelbinger", Springer-Verlag, 2004}, journal = {SIGACT News}, volume = {37}, year = {2006}, month = {2006/03//}, pages = {14 - 15}, isbn = {0163-5700}, doi = {10.1145/1122480.1122484}, url = {http://doi.acm.org/10.1145/1122480.1122484}, author = {Katz, Jonathan} } @article {15166, title = {Ring signatures: Stronger definitions, and constructions without random oracles}, journal = {Theory of Cryptography}, year = {2006}, month = {2006///}, pages = {60 - 79}, abstract = {Ring signatures, first introduced by Rivest, Shamir, and Tauman, enable a user to sign a message so that a ring of possible signers (of which the user is a member) is identified, without revealing exactly which member of that ring actually generated the signature. In contrast to group signatures, ring signatures are completely {\textquotedblleft}ad-hoc{\textquotedblright} and do not require any central authority or coordination among the various users (indeed, users do not even need to be aware of each other); furthermore, ring signature schemes grant users fine-grained control over the level of anonymity associated with any particular signature.This paper has two main areas of focus. First, we examine previous definitions of security for ring signature schemes and suggest that most of these prior definitions are too weak, in the sense that they do not take into account certain realistic attacks. We propose new definitions of anonymity and unforgeability which address these threats, and then give separation results proving that our new notions are strictly stronger than previous ones. Next, we show two constructions of ring signature schemes in the standard model: one based on generic assumptions which satisfies our strongest definitions of security, and a second, more efficient scheme achieving weaker security guarantees and more limited functionality. These are the first constructions of ring signature schemes that do not rely on random oracles or ideal ciphers. }, doi = {10.1007/11681878_4}, author = {Bender,A. and Katz, Jonathan and Morselli,R.} } @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 {15246, title = {A robust maximum completion time measure for scheduling}, booktitle = {Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm}, series = {SODA {\textquoteright}06}, year = {2006}, month = {2006///}, pages = {324 - 333}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {One popular measure for evaluating the performance of scheduling algorithms, is the maximum response time of any job (makespan). Typically the objective is to find a schedule that minimizes the maximum response time over all jobs. One drawback of this measure is that a relatively small number of jobs in the request set could cause the maximum response time to be very high. Thus, this measure reflects local rather than global properties of the request set. In this paper we consider a robust generalization of this measure. Our goal is to minimize T, such that a given fraction of jobs can be scheduled with a response time of at most T. We demonstrate the applicability of this measure in the context of broadcast scheduling. We show that in the online setting no constant factor online approximation is possible for the problem of minimizing the maximum response time for a given fraction of jobs in the context of broadcast scheduling. We give a factor 5, polynomial time offline approximation algorithm for the problem of minimizing the maximum response time for a given fraction of jobs in the context of broadcast scheduling.}, isbn = {0-89871-605-5}, doi = {10.1145/1109557.1109594}, url = {http://doi.acm.org/10.1145/1109557.1109594}, author = {Charikar,Moses and Khuller, Samir} } @article {17966, title = {Saliency-guided Enhancement for Volume Visualization}, journal = {Visualization and Computer Graphics, IEEE Transactions on}, volume = {12}, year = {2006}, month = {2006/10//sept}, pages = {925 - 932}, abstract = {Recent research in visual saliency has established a computational measure of perceptual importance. In this paper we present a visual-saliency-based operator to enhance selected regions of a volume. We show how we use such an operator on a user-specified saliency field to compute an emphasis field. We further discuss how the emphasis field can be integrated into the visualization pipeline through its modifications of regional luminance and chrominance. Finally, we validate our work using an eye-tracking-based user study and show that our new saliency enhancement operator is more effective at eliciting viewer attention than the traditional Gaussian enhancement operator}, keywords = {Computer-Assisted;Imaging, Ocular;Humans;Image Enhancement;Image Interpretation, saliency-guided enhancement;visual-saliency-based operator;volume rendering;volume visualization;data visualisation;rendering (computer graphics);Algorithms;Attention;Computer Graphics;Eye Movements;Fixation, Three-Dimensional;User-Computer Interface;}, isbn = {1077-2626}, doi = {10.1109/TVCG.2006.174}, author = {Kim,Y. and Varshney, Amitabh} } @article {13864, title = {SParseval: Evaluation metrics for parsing speech}, journal = {Proc. LREC}, year = {2006}, month = {2006///}, abstract = {While both spoken and written language processing stand to benefit from parsing, the standard Parseval metrics (Black et al., 1991) andtheir canonical implementation (Sekine and Collins, 1997) are only useful for text. The Parseval metrics are undefined when the words input to the parser do not match the words in the gold standard parse tree exactly, and word errors are unavoidable with automatic speech recognition (ASR) systems. To fill this gap, we have developed a publicly available tool for scoring parses that implements a variety of metrics which can handle mismatches in words and segmentations, including: alignment-based bracket evaluation, alignment-based dependency evaluation, and a dependency evaluation that does not require alignment. We describe the different metrics, how to use the tool, and the outcome of an extensive set of experiments on the sensitivity of the metrics. }, author = {Roark,B. and Harper,M. and Charniak,E. and Dorr, Bonnie J and Johnson,M. and Kahn,J. and Liu,Y. and Ostendorf,M. and Hale,J. and Krasnyanskaya,A. and others} } @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 {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 {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} } @conference {12181, title = {Target size study for one-handed thumb use on small touchscreen devices}, booktitle = {Proceedings of the 8th conference on Human-computer interaction with mobile devices and services}, year = {2006}, month = {2006///}, pages = {203 - 210}, author = {Parhi,P. and Karlson,A.K. and Bederson, Benjamin B.} } @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 {16082, title = {TreePlus: Interactive Exploration of Networks with Enhanced Tree Layouts}, journal = {Visualization and Computer Graphics, IEEE Transactions on}, volume = {12}, year = {2006}, month = {2006/12//nov}, pages = {1414 - 1426}, abstract = {Despite extensive research, it is still difficult to produce effective interactive layouts for large graphs. Dense layout and occlusion make food Webs, ontologies and social networks difficult to understand and interact with. We propose a new interactive visual analytics component called TreePlus that is based on a tree-style layout. TreePlus reveals the missing graph structure with visualization and interaction while maintaining good readability. To support exploration of the local structure of the graph and gathering of information from the extensive reading of labels, we use a guiding metaphor of "plant a seed and watch it grow." It allows users to start with a node and expand the graph as needed, which complements the classic overview techniques that can be effective at (but often limited to) revealing clusters. We describe our design goals, describe the interface and report on a controlled user study with 28 participants comparing TreePlus with a traditional graph interface for six tasks. In general, the advantage of TreePlus over the traditional interface increased as the density of the displayed data increased. Participants also reported higher levels of confidence in their answers with TreePlus and most of them preferred TreePlus}, keywords = {Automated;Software;User-Computer Interface;, Biological;Pattern Recognition, data visualization;graph structure;graphical user interface;interactive visual analytics;occlusion;tree-style layout;data visualisation;graphical user interfaces;hidden feature removal;interactive systems;trees (mathematics);Algorithms;Computer Graphics;C}, isbn = {1077-2626}, doi = {10.1109/TVCG.2006.106}, author = {Lee,B. and Parr,C.S. and Plaisant, Catherine and Bederson, Benjamin B. and Veksler,V.D. and Gray,W.D. and Kotfila,C.} } @conference {14750, title = {Trusted declassification:: high-level policy for a security-typed language}, booktitle = {Proceedings of the 2006 workshop on Programming languages and analysis for security}, series = {PLAS {\textquoteright}06}, year = {2006}, month = {2006///}, pages = {65 - 74}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Security-typed languages promise to be a powerful tool with which provably secure software applications may be developed. Programs written in these languages enforce a strong, global policy of noninterferencewhich ensures that high-security data will not be observable on low-security channels. Because noninterference is typically too strong a property, most programs use some form of declassification to selectively leak high security information, e.g. when performing a password check or data encryption. Unfortunately, such a declassification is often expressed as an operation within a given program, rather than as part of a global policy, making reasoning about the security implications of a policy more difficult.In this paper, we propose a simple idea we call trusted declassification in which special declassifier functions are specified as part of the global policy. In particular, individual principals declaratively specify which declassifiers they trust so that all information flows implied by the policy can be reasoned about in absence of a particular program. We formalize our approach for a Java-like language and prove a modified form of noninterference which we call noninterference modulo trusted methods. We have implemented our approach as an extension to Jif and provide some of our experience using it to build a secure e-mail client.}, keywords = {noninterference modolo trusted methods, declassification, FJifP, information-flow control, Jif, security policy, security-typed languages, trusted declassification}, isbn = {1-59593-374-3}, doi = {10.1145/1134744.1134757}, url = {http://doi.acm.org/10.1145/1134744.1134757}, author = {Hicks,Boniface and King,Dave and McDaniel,Patrick and Hicks, Michael W.} } @article {17919, title = {Vertex{\textendash}transformation streams}, journal = {Graphical Models}, volume = {68}, year = {2006}, month = {2006/07//}, pages = {371 - 383}, abstract = {Recent trends in parallel computer architecture strongly suggest the need to improve the arithmetic intensity (the compute to bandwidth ratio) for greater performance in time-critical applications, such as interactive 3D graphics. At the same time, advances in stream programming abstraction for graphics processors (GPUs) have enabled us to use parallel algorithm design methods for GPU programming. Inspired by these developments, this paper explores the interactions between multiple data streams to improve arithmetic intensity and address the input geometry bandwidth bottleneck for interactive 3D graphics applications. We introduce the idea of creating vertex and transformation streams that represent large point datasets via their interaction. We discuss how to factor such point datasets into a set of source vertices and transformation streams by identifying the most common translations amongst vertices. We accomplish this by identifying peaks in the cross-power spectrum of the dataset in the Fourier domain. We validate our approach by integrating it with a view-dependent point rendering system and show significant improvements in input geometry bandwidth requirements as well as rendering frame rates.}, keywords = {Arithmetic intensity, Geometry instancing, Stream programming, Streaming algorithms, Transformation encoding}, isbn = {1524-0703}, doi = {10.1016/j.gmod.2006.03.005}, url = {http://www.sciencedirect.com/science/article/pii/S1524070306000373}, author = {Kim,Youngmin and Lee,Chang Ha and Varshney, Amitabh} } @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} } @article {15168, title = {Adaptively-secure, non-interactive public-key encryption}, journal = {Theory of Cryptography}, year = {2005}, month = {2005///}, pages = {150 - 168}, abstract = {Adaptively-secure encryption schemes ensure secrecy even in the presence of an adversary who can corrupt parties in an adaptive manner based on public keys, ciphertexts, and secret data of already-corrupted parties. Ideally, an adaptively-secure encryption scheme should, like standard public-key encryption, allow arbitrarily-many parties to use a single encryption key to securely encrypt arbitrarily-many messages to a given receiver who maintains only a single short decryption key. However, it is known that these requirements are impossible to achieve: no non-interactive encryption scheme that supports encryption of an unbounded number of messages and uses a single, unchanging decryption key can be adaptively secure. Impossibility holds even if secure data erasure is possible.We show that this limitation can be overcome by updating the decryption key over time and making some mild assumptions about the frequency of communication between parties. Using this approach, we construct adaptively-secure, completely non-interactive encryption schemes supporting secure encryption of arbitrarily-many messages from arbitrarily-many senders. Our schemes additionally provide forward security and security against chosen-ciphertext attacks. }, doi = {10.1007/978-3-540-30576-7_9}, author = {Canetti,R. and Halevi,S. and Katz, Jonathan} } @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 {14563, title = {Algorithmic graph minor theory: Decomposition, approximation, and coloring}, booktitle = {Foundations of Computer Science, 2005. FOCS 2005. 46th Annual IEEE Symposium on}, year = {2005}, month = {2005///}, pages = {637 - 646}, abstract = {At the core of the seminal graph minor theory of Robertson and Seymour is a powerful structural theorem capturing the structure of graphs excluding a fixed minor. This result is used throughout graph theory and graph algorithms, but is existential. We develop a polynomial-time algorithm using topological graph theory to decompose a graph into the structure guaranteed by the theorem: a clique-sum of pieces almost-embeddable into bounded-genus surfaces. This result has many applications. In particular we show applications to developing many approximation algorithms, including a 2-approximation to graph coloring, constant-factor approximations to treewidth and the largest grid minor, combinatorial polylogarithmic approximation to half-integral multicommodity flow, subexponential fixed-parameter algorithms, and PTASs for many minimization and maximization problems, on graphs excluding a fixed minor.}, keywords = {algorithmic graph minor theory, approximation algorithm, combinatorial polylogarithmic approximation, computational complexity, constant-factor approximation, graph algorithm, graph coloring, graph colouring, half-integral multicommodity flow, largest grid minor, maximization problem, minimization problem, polynomial-time algorithm, subexponential fixed-parameter algorithm, topological graph theory, treewidth}, doi = {10.1109/SFCS.2005.14}, author = {Demaine,E. D and Hajiaghayi, Mohammad T. and Kawarabayashi,K.} } @article {18893, title = {Applications of SHOP and SHOP2}, journal = {Intelligent Systems, IEEE}, volume = {20}, year = {2005}, month = {2005/04//march}, pages = {34 - 41}, abstract = {We design the simple hierarchical ordered planner (SHOP) and its successor, SHOP2, with two goals in mind: to investigate research issues in automated planning and to provide some simple, practical planning tools. SHOP and SHOP2 are based on a planning formalism called hierarchical task network planning. SHOP and SHOP2 use a search-control strategy called ordered task decomposition, which breaks tasks into subtasks and generates the plan{\textquoteright}s actions in the same order that the plan executor executes them. So, throughout the planning process, the planner can tell what the state of the world at each step of the plan.}, keywords = {automated planning, hierarchical task network planning, ordered task decomposition, planning (artificial intelligence), problem solving, search-control strategy, simple hierarchical ordered planner, trees (mathematics), uncertainty handling}, isbn = {1541-1672}, doi = {10.1109/MIS.2005.20}, author = {Nau, Dana S. and Au,T.-C. and Ilghami,O. and Kuter,U. and Wu,D. and Yaman,F. and Munoz-Avila,H. and Murdock,J. W.} } @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} } @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} } @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 {12656, title = {Background learning for robust face recognition with PCA in the presence of clutter}, journal = {Image Processing, IEEE Transactions on}, volume = {14}, year = {2005}, month = {2005/06//}, pages = {832 - 843}, abstract = {We propose a new method within the framework of principal component analysis (PCA) to robustly recognize faces in the presence of clutter. The traditional eigenface recognition (EFR) method, which is based on PCA, works quite well when the input test patterns are faces. However, when confronted with the more general task of recognizing faces appearing against a background, the performance of the EFR method can be quite poor. It may miss faces completely or may wrongly associate many of the background image patterns to faces in the training set. In order to improve performance in the presence of background, we argue in favor of learning the distribution of background patterns and show how this can be done for a given test image. An eigenbackground space is constructed corresponding to the given test image and this space in conjunction with the eigenface space is used to impart robustness. A suitable classifier is derived to distinguish nonface patterns from faces. When tested on images depicting face recognition in real situations against cluttered background, the performance of the proposed method is quite good with fewer false alarms.}, keywords = {Automated;Principal Component Analysis;Reproducibility of Results;Sensitivity and Specificity;Signal Processing, Biological;Models, Computer-Assisted;Information Storage and Retrieval;Models, Computer-Assisted;Subtraction Technique;, PCA;background learning;clutter;eigenface recognition method;face recognition;linear discriminant;principal component analysis;clutter;eigenvalues and eigenfunctions;face recognition;learning (artificial intelligence);principal component analysis;Algorith, Statistical;Pattern Recognition}, isbn = {1057-7149}, doi = {10.1109/TIP.2005.847288}, author = {Rajagopalan, AN and Chellapa, Rama and Koterba, N.T.} } @article {13205, title = {Background updating for visual surveillance}, journal = {Advances in Visual Computing}, year = {2005}, month = {2005///}, pages = {337 - 346}, abstract = {Scene changes such as moved objects, parked vehicles, or opened/closed doors need to be carefully handled so that interesting foreground targets can be detected along with the short-term background layers created by those changes. A simple layered modeling technique is embedded into a codebook-based background subtraction algorithm to update a background model. In addition, important issues related to background updating for visual surveillance are discussed. Experimental results on surveillance examples, such as unloaded packages and unattended objects, are presented by showing those objects as short-term background layers.}, author = {Kim,K. and Harwood,D. and Davis, Larry S.} } @article {16696, title = {The Bible and multilingual optical character recognition}, journal = {Communications of the ACM}, volume = {48}, year = {2005}, month = {2005///}, pages = {124 - 130}, author = {Kanungo,T. and Resnik, Philip and Mao,S. and Kim,D.W. and Zheng,Q.} } @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} } @article {18939, title = {Bootstrapping parsers via syntactic projection across parallel texts}, journal = {Nat. Lang. Eng.}, volume = {11}, year = {2005}, month = {2005/09//}, pages = {311 - 325}, abstract = {Broad coverage, high quality parsers are available for only a handful of languages. A prerequisite for developing broad coverage parsers for more languages is the annotation of text with the desired linguistic representations (also known as {\textquotedblleft}treebanking{\textquotedblright}). However, syntactic annotation is a labor intensive and time-consuming process, and it is difficult to find linguistically annotated text in sufficient quantities. In this article, we explore using parallel text to help solving the problem of creating syntactic annotation in more languages. The central idea is to annotate the English side of a parallel corpus, project the analysis to the second language, and then train a stochastic analyzer on the resulting noisy annotations. We discuss our background assumptions, describe an initial study on the {\textquotedblleft}projectability{\textquotedblright} of syntactic relations, and then present two experiments in which stochastic parsers are developed with minimal human intervention via projection from English.}, isbn = {1351-3249}, doi = {10.1017/S1351324905003840}, url = {http://dx.doi.org/10.1017/S1351324905003840}, author = {Hwa,Rebecca and Resnik, Philip and Weinberg, Amy and Cabezas,Clara and Kolak,Okan} } @article {15099, title = {Bounds on the efficiency of black-box commitment schemes}, journal = {Automata, Languages and Programming}, year = {2005}, month = {2005///}, pages = {62 - 62}, abstract = {Constructions of cryptographic primitives based on general assumptions (e.g., the existence of one-way functions) tend to be less efficient than constructions based on specific (e.g., number-theoretic) assumptions. This has prompted a recent line of research aimed at investigating the best possible efficiency of (black-box) constructions based on general assumptions. Here, we present bounds on the efficiency of statistically-binding commitment schemes constructed using black-box access to one-way permutations; our bounds are tight for the case of perfectly-binding schemes. We present the bounds in an extension of the Impagliazzo-Rudich model; that is, we show that any construction beating our bounds would imply the unconditional existence of a one-way function (from which a commitment scheme could be constructed {\textquotedblleft}from scratch{\textquotedblright}). Our analysis is the first in the area to pertain directly to an information-theoretic component of the security notion.}, doi = {10.1007/11523468_11}, author = {Horvitz,O. and Katz, Jonathan} } @article {15157, title = {Bounds on the efficiency of generic cryptographic constructions}, journal = {SIAM Journal on Computing}, volume = {35}, year = {2005}, month = {2005///}, pages = {217 - 217}, abstract = {A central focus of modern cryptography is the construction of efficient, {\textquotedblleft}high-level{\textquotedblright}cryptographic tools (e.g., encryption schemes) from weaker, {\textquotedblleft}low-level{\textquotedblright} cryptographic primitives (e.g., one-way functions). Of interest are both the existence of such construc- tions, and their efficiency. Here, we show essentially-tight lower bounds on the best possible efficiency of any black-box construction of some fundamental cryptographic tools from the most basic and widely-used cryptographic primitives. Our results hold in an extension of the model introduced by Impagliazzo and Rudich, and improve and extend earlier results of Kim, Simon, and Tetali. We focus on constructions of pseudorandom generators, universal one-way hash functions, and digital signatures based on one-way permutations, as well as constructions of public- and private-key encryption schemes based on trapdoor permutations. In each case, we show that any black-box construction beating our efficiency bound would yield the unconditional existence of a one-way function and thus, in particular, prove P \= NP }, author = {Gennaro,R. and Gertner,Y. and Katz, Jonathan and Trevisan,L.} } @conference {15243, title = {Broadcasting on networks of workstations}, booktitle = {Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures}, series = {SPAA {\textquoteright}05}, year = {2005}, month = {2005///}, pages = {279 - 288}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Broadcasting and multicasting are fundamental operations. In this work we develop algorithms for performing broadcast and multicast in clusters of workstations. In this model, sending a message from one machine to another machine in the same cluster takes 1 time unit, and sending a message to a machine in a different cluster takes C time units. Lowekamp and Beguelin proposed heuristics for this model, but their algorithms may produce broadcast times that are arbitrarily worse than optimal. We develop the first constant factor approximation algorithms for this model. Algorithm LCF (Largest Cluster First) for the basic model is simple, efficient and has a worst case approximation guarantee of 2. We then extend these models to more complex models where we remove the assumption that an unbounded amount of simultaneous communication may happen using the global network. The algorithms for these models build on the LCF method developed for the basic problem. Finally, we develop broadcasting algorithms for the postal model where the sending processor does not block for C time units when the message is in transit. Moreover, we assume that the messages are small and so the bottleneck is the latency.}, keywords = {Approximation algorithms, Broadcasting, multicasting}, isbn = {1-58113-986-1}, doi = {10.1145/1073970.1074017}, url = {http://doi.acm.org/10.1145/1073970.1074017}, author = {Khuller, Samir and Kim,Yoo-Ah and Wan,Yung-Chun Justin} } @conference {12388, title = {CASPER: an integrated energy-driven approach for task graph scheduling on distributed embedded systems}, booktitle = {Application-Specific Systems, Architecture Processors, 2005. ASAP 2005. 16th IEEE International Conference on}, year = {2005}, month = {2005/07//}, pages = {191 - 197}, abstract = {For multiprocessor embedded systems, the dynamic voltage scaling (DVS) technique can be applied to scheduled applications for energy reduction. DVS utilizes slack in the schedule to slow down processes and save energy. Therefore, it is generally believed that the maximal energy saving is achieved on a schedule with the minimum makespan (maximal slack). Most current approaches treat task assignment, scheduling, and DVS separately. In this paper, we present a framework called CASPER (combined assignment, scheduling, and power-management) that challenges this common belief by integrating task scheduling and DVS under a single iterative optimization loop via genetic algorithm. We have conducted extensive experiments to validate the energy efficiency of CASPER. For homogeneous multiprocessor systems (in which all processors are of the same type), we consider a recently proposed slack distribution algorithm (PDP-SPM) by S. Hua and G. Qu (2005): applying PDP-SPM on the schedule with the minimal makespan gives an average of 53.8\% energy saving; CASPER finds schedules with slightly larger makespan but a 57.3\% energy saving, a 7.8\% improvement. For heterogeneous systems, we consider the power variation DVS (PV-DVS) algorithm by Schmitz et al. (2004), CASPER improves its energy efficiency by 8.2\%. Finally, our results also show that the proposed single loop CASPER framework saves 23.3\% more energy over GMA+EE-GLSA by Schmitz et al. (2002), the only other known integrated approach with a nested loop that combines scheduling and power management in the inner loop but leaves assignment in the outer loop.}, keywords = {CASPER, combined-assignment-scheduling-and-power-management, computational complexity, distributed system, dynamic voltage scaling, embedded systems, energy reduction, genetic algorithm, Genetic algorithms, graph theory, homogeneous multiprocessor system, maximal energy saving, Multiprocessing systems, multiprocessor embedded system, optimization loop, power management, power variation, Processor scheduling, slack distribution algorithm, task assignment, task graph scheduling}, doi = {10.1109/ASAP.2005.23}, author = {Kianzad,V. and Bhattacharyya, Shuvra S. and Gang Qu} } @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} } @article {15169, title = {Chosen-ciphertext security of multiple encryption}, journal = {Theory of Cryptography}, year = {2005}, month = {2005///}, pages = {188 - 209}, abstract = {Encryption of data using multiple, independent encryption schemes ({\textquotedblleft}multiple encryption{\textquotedblright}) has been suggested in a variety of contexts, and can be used, for example, to protect against partial key exposure or cryptanalysis, or to enforce threshold access to data. Most prior work on this subject has focused on the security of multiple encryption against chosen-plaintext attacks, and has shown constructions secure in this sense based on the chosen-plaintext security of the component schemes. Subsequent work has sometimes assumed that these solutions are also secure against chosen-ciphertext attacks when component schemes with stronger security properties are used. Unfortunately, this intuition is false for all existing multiple encryption schemes.Here, in addition to formalizing the problem of chosen-ciphertext security for multiple encryption, we give simple, efficient, and generic constructions of multiple encryption schemes secure against chosen-ciphertext attacks (based on any component schemes secure against such attacks) in the standard model. We also give a more efficient construction from any (hierarchical) identity-based encryption scheme secure against selective-identity chosen plaintext attacks. Finally, we discuss a wide range of applications for our proposed schemes. }, doi = {10.1007/978-3-540-30576-7_11}, author = {Dodis,Y. and Katz, Jonathan} } @article {15159, title = {Comparative book review: Cryptography: An Introduction by V. V. Yaschenko (American Mathematical Society, 2002); Cryptanalysis of Number Theoretic Ciphers by S.S. Wagstaff, Jr. (Chapman \& Hall/CRC Press, 2003); RSA and Public-Key Cryptography by R. A.}, journal = {SIGACT News}, volume = {36}, year = {2005}, month = {2005/06//}, pages = {14 - 19}, abstract = {With the growing interest in cryptography --- from students andresearchers as well as from the general public --- there has been a corresponding increase in the number of cryptography textbooks available. Many of these, however, remain somewhat mired in the past, and present cryptography from a pre-1980s point of view. Indeed, there are very few published books which even make an attempt (let alone a successful one) at covering modern cryptography. This unfortunate state of affairs results in a serious lack of books describing the fundamental advances in the field that have taken place since the mid-1980{\textquoteright}s; this is especially true at the undergraduate and beginning graduate levels, where there is a severe need for suitable texts in this area. The central contributions of modern (i.e., post-1980) cryptography include an emphasis on precise definitions, formalizations of cryptographic goals, and provably-secure constructions of higherlevel tasks (e.g., signatures) from lower-level primitives (e.g., one-way functions). Without precise definitions and rigorous proofs of security, cryptography is reduced to a "game" in which the goal is merely to design a scheme that one{\textquoteright}s friend or colleague cannot "break". Any exposition of cryptography failing to recognize and emphasize the diffierence between the former and the latter approaches misses a substantial fraction of what current cryptographic research is about, and is a disservice to the field. Sadly, however, almost all cryptography textbooks of which I am aware fall into this category. A classic example of the problems with an "ad-hoc" approach to cryptography is the following simple test I often use to discriminate "good" cryptography books from "poor" ones: flip to the section on digital signatures and see whether it is stated anywhere that "textbook RSA" signatures are completely insecure. It is a simple exercise to show that this is the case (the same holds for "textbook RSA" encryption, but it is somewhat more difficult to demonstrate), yet most books make no mention of this (central!) fact, and instead leave the reader with the impression that secure signature schemes based on the RSA problem are easy to design. Some might argue that there is no place for rigorous definitions and proofs in a book directed toward undergraduates, but I take this misconception as a thinly-guised insult to undergraduate computer science majors. Undergraduates in other majors are taught quantum mechanics, thermodynamics, analysis, and abstract algebra, to name a few, all difficult subjects that are taught rigorously (to varying degrees, perhaps). Why should an undergraduate course on cryptography be expected to be any less rigorous than these? Continuing the disappointing trend discussed above, neither of the first three books reviewed here qualify as (what I would consider) appropriate for introducing the interested reader to the field of cryptography. Cryptography: An Introduction gets a number of things right, but overall is a muddled, poorly written, and disorganized text whose intended audience is unclear. Cryptanalysis. . . is a useful book which I am glad to have on my shelf, but it fails at its stated goal of serving as a suitable text for an introductory cryptography course. It would serve better as a book on elementary number theory (with applications to cryptography, perhaps), and I wish it had been advertised and organized as such. A somewhat similar book, RSA and Public-Key Cryptography suffers from the same criticisms; furthermore, I found its treatment of number theory to be not quite on par with that in Wagstaff{\textquoteright}s book. In contrast to these, Foundations of Cryptography presents a clear and accurate picture of the foundations underlying modern cryptography; in fact, it is currently the only published book I am aware of which does so. Its primary drawback is that it is likely to be inaccessible to the beginning student; it is more appropriate for a researcher or an advanced graduate student who has previously been exposed to the basics of cryptography, either of whom would benefit from a careful reading of this book cover-to-cover. }, isbn = {0163-5700}, doi = {10.1145/1067309.1067316}, url = {http://doi.acm.org/10.1145/1067309.1067316}, author = {Katz, Jonathan} } @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} } @article {15122, title = {On constructing universal one-way hash functions from arbitrary one-way functions}, journal = {Journal of Cryptology}, year = {2005}, month = {2005///}, abstract = {A fundamental result in cryptography is that a digital signature scheme can be constructedfrom an arbitrary one-way function. A proof of this somewhat surprising statement follows from two results: first, Naor and Yung defined the notion of universal one-way hash functions and showed that the existence of such hash functions implies the existence of secure digital signature schemes. Subsequently, Rompel showed that universal one-way hash functions could be constructed from arbitrary one-way functions. Unfortunately, despite the importance of the result, a complete proof of the latter claim has never been published. In fact, a careful reading of Rompel{\textquoteright}s original conference publication reveals a number of errors in many of his arguments which have (seemingly) never been addressed. We provide here what is {\textemdash} as far as we know {\textemdash} the first complete write-up of Rompel{\textquoteright}s proof that universal one-way hash functions can be constructed from arbitrary one-way functions. }, author = {Katz, Jonathan and Koo,C. Y} } @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 {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.} } @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 {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 {16309, title = {Distributed performance testing using statistical modeling}, booktitle = {Proceedings of the 1st international workshop on Advances in model-based testing}, year = {2005}, month = {2005///}, pages = {1 - 7}, author = {Karr,A. F and Porter, Adam} } @conference {12334, title = {Dynamic configuration of dataflow graph topology for DSP system design}, booktitle = {Proc. of the Int. Conf. on Acoustics, Speech, and Signal Processing}, year = {2005}, month = {2005///}, pages = {69 - 72}, author = {Ko,D. I and Bhattacharyya, Shuvra S.} } @article {17099, title = {Dynamic Layout Management in a Multimedia Bulletin Board (2002)}, year = {2005}, month = {2005///}, abstract = {This paper proposes a novel user interface to manage the dynamic layout of multimedia objects in the Multimedia Bulletin Board (MBB) system. The MBB has been designed and implemented as a prototype of an asynchronous communication system that enables rich communication and collaboration among users of multimedia objects such as text, image, moving picture, sound, voice, web, office document, and other files. The layout properties of the multimedia objects on a board (e.g. x-y position, size, z-order, partial occlusion, explicit and implicit links, etc.) show important and useful information on the user dynamics occurring within a board. However, a fixed layout created and edited by multiple users may prevent users from recognizing and identifying useful information. This paper resolves this problem with a novel user-controlled layout strategy made visible with dynamic layout templates (DLT). Users can reorganize the objects to extract meaningful information related to time, source, geographic location, or topic.}, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/6489}, author = {Kang,Hyunmo and Shneiderman, Ben and Wolff,Gregory J} } @article {18203, title = {Dynamic network resource allocation using multimedia content features and ...}, volume = {09/795,952}, year = {2005}, month = {2005/09/20/}, abstract = {A method for dynamically allocating network resources while transferring multimedia at variable bit-rates in a network extracts first content features from the multimedia to determine renegotiation points and observation periods. Second content features and traffic features are extracted from the multimedia bit stream during the observation periods. The second content features and the traffic features are combined in a neural network to predict the network resources to be allocated at the renegotiation points.}, url = {http://www.google.com/patents?id=dToWAAAAEBAJ}, author = {M. Wu and Joyce,Robert A. and Vetro,Anthony and Wong,Hau-San and Guan,Ling and Kung,Sun-Yuan}, editor = {Mitsubishi Electric Research Labs, Inc.} } @article {16295, title = {An empirical study of regression test application frequency}, journal = {Software Testing, Verification and Reliability}, volume = {15}, year = {2005}, month = {2005///}, pages = {257 - 279}, author = {Kim,J. M and Porter, Adam and Rothermel,G.} } @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 {13772, title = {Finite-State Language resources and Language Processing}, journal = {Machine Translation}, volume = {18}, year = {2005}, month = {2005///}, pages = {381 - 382}, author = {Hale,K. and Keyser,S.J. and Hutchins,W.J. and Habash,N. and Dorr, Bonnie J and Traum,D.} } @article {15385, title = {Forensic recovery of hard disk data by using the spin-stand imaging technique}, journal = {Proceedings of SPIE}, volume = {5778}, year = {2005}, month = {2005/05/20/}, pages = {595 - 606}, abstract = {An ex-situ technique for the drive-independent forensic recovery of data from failed hard drives has been developed.For drives which have suffered damage from a head crash or other mechanical problems and cannot be resuscitatedusing standard software, firmware, or part-replacement techniques, there is currently no commercially available meansto recover the data, even though the files are still stored on the magnetic disks. Here, we report on the results of a spinstandimaging based technology, where the failed disk is removed from its native drive, placed on a spin-stand, andscanned with a giant magnetoresistive head. After track centering, track following, signal detection, data decoding, errorcorrection, and sector mapping, the otherwise unrecoverable data can be retrieved to the computer operating system.Spin-stand based data imaging has the potential to provide recovery at data rates approaching those in the native driveand is a truly drive-independent method to recover hard disk data in a time-efficient manner.}, isbn = {0277786X}, doi = {doi:10.1117/12.602572}, url = {http://spiedigitallibrary.org/proceedings/resource/2/psisdg/5778/1/595_1?isAuthorized=no}, author = {Tse,Chun and Krafft,Charles and Mayergoyz, Issak D and McAvoy,Patrick and Tseng,Chun-Yang} } @article {15982, title = {Formal approaches to teamwork}, journal = {We Will Show Them: Essays in Honour of Dov Gabbay}, volume = {1}, year = {2005}, month = {2005///}, pages = {39 - 68}, author = {Grant,J. and Kraus,S. and Perlis, Don} } @article {12674, title = {Gait-based human identification using appearance matching}, journal = {Optical and Digital Techniques for Information Security}, year = {2005}, month = {2005///}, pages = {271 - 295}, abstract = {In this chapter, we present an appearance-based approach for recognizing human gait. Given the gait video of an individual, the images are binarized and the width of the outer contour of the silhouette of that individual is obtained for each image frame. Several gait features are derived from this basic width vector. Temporally ordered sequences of the feature vectors are then used to represent the gait of a person. While matching the feature templates for recognition, dynamic time-warping (DTW), which is a nonlinear time-normalization technique, is used to deal with naturally occurring changes in the walking speeds of individuals. The performance of the proposed method is tested on indoor as well as outdoor gait databases, and the efficacy of different gait features and their noise resilience is studied. The experiments also demonstrate the effect of change in the viewing angle and frame rate of data capture on the accuracy of gait recognition.}, author = {Kale, A. and Cuntoor, N. and Yegnanarayana,B. and Rajagopalan, A. and Chellapa, Rama} } @article {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 {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 {18846, title = {Geometric algorithms for containment analysis of rotational parts}, journal = {Computer-Aided Design}, volume = {37}, year = {2005}, month = {2005/02//}, pages = {213 - 230}, abstract = {This paper describes a system and underlying algorithms to perform geometric containment analysis to determine if a newly designed rotational part can be manufactured from a part in an existing database of rotational parts. Only material removal of the database part is considered in order to obtain the newly designed part from the database part. The system uses a three-step algorithm to test for containment. The first step analyzes feasibility of containment using bounding cylinders. If the bounding cylinder of the query part is bigger than the part in the database, then the database part cannot contain the query part and it is eliminated from consideration. The second step analyzes feasibility of containment by ignoring off-axis features. Any part that fails to satisfy containment at this stage is eliminated from consideration. The third step analyzes the remaining parts from the database for feasibility of containment by including the off-axis features. Finally, the system rank-orders all the database parts that can contain the query part based on their volume differences with the query part. The system described in this paper can be used by designers and process planners to find an existing part that can be used as a stock to manufacture a newly designed part. This capability is expected to significantly reduce proliferation of parts, to improve manufacturing responsiveness, and to reduce the cost of new products.}, keywords = {COMPUTER AIDED DESIGN, geometric reasoning, Part containment, Shape signatures, Shape similarity}, isbn = {0010-4485}, doi = {10.1016/j.cad.2004.06.007}, url = {http://www.sciencedirect.com/science/article/pii/S0010448504001186}, author = {Karnik,Mukul and Gupta, Satyandra K. and Magrab,Edward B.} } @conference {18872, title = {A hierarchical task-network planner based on symbolic model checking}, year = {2005}, month = {2005///}, pages = {300 - 309}, abstract = {Although several approaches have been developed for planning in nondeterministic domains, solving large planning problems is still quite difficult. In this work, we present a novel algorithm, called YoYo, for planning in nondeterministic domains under the assumption of full observability. This algorithm enables us to combine the power of search-control strategies as in Planning with Hierarchical Task Networks (HTNs) with tech- niques from the Planning via Symbolic Model-Checking (SMC). Our experimental evaluation confirms the po- tentialities of our approach, demonstrating that it com- bines the advantages of these paradigms.}, url = {https://www.aaai.org/Papers/ICAPS/2005/ICAPS05-031.pdf}, author = {Kuter,U. and Nau, Dana S. and Pistore,M. and Traverso,P.} } @article {15757, title = {HOPE: A Homotopy Optimization Method for Protein Structure Prediction}, journal = {Journal of Computational Biology}, volume = {12}, year = {2005}, month = {2005/12//}, pages = {1275 - 1288}, abstract = {We use a homotopy optimization method, HOPE, to minimize the potential energy associated with a protein model. The method uses the minimum energy conformation of one protein as a template to predict the lowest energy structure of a query sequence. This objective is achieved by following a path of conformations determined by a homotopy between the potential energy functions for the two proteins. Ensembles of solutions are produced by perturbing conformations along the path, increasing the likelihood of predicting correct structures. Successful results are presented for pairs of homologous proteins, where HOPE is compared to a variant of Newton{\textquoteright}s method and to simulated annealing.}, isbn = {1066-5277, 1557-8666}, doi = {10.1089/cmb.2005.12.1275}, url = {http://www.liebertonline.com/doi/abs/10.1089/cmb.2005.12.1275}, author = {Dunlavy,Daniel M. and O{\textquoteright}Leary, Dianne P. and Klimov,Dmitri and Thirumalai,D.} } @article {15155, title = {Identity-based zero-knowledge}, journal = {Security in Communication Networks}, year = {2005}, month = {2005///}, pages = {180 - 192}, abstract = {We introduce and define the notion of identity-based zero-knowledge, concentrating on the non-interactive setting. In this setting, our notion allows any prover to widely disseminate a proof of a statement while protecting the prover from plagiarism in the following sense: although proofs are transferable (i.e., publicly verifiable), they are also bound to the identity of the prover in a way which is recognizable to any verifier. Furthermore, an adversary is unable to change this identity (i.e., to claim the proof as his own, or to otherwise change the authorship), unless he could have proved the statement on his own.While we view the primary contribution of this work as a formal definition of the above notion, we also explore the relation of this notion to that of non-malleable (non-interactive) zero-knowledge. On the one hand, we show that these two notions are incomparable: that is, there are proof systems which are non-malleable but not identity-based, and vice versa. On the other hand, we show that a proof system of either type essentially implies a proof system of the other type. }, doi = {10.1007/978-3-540-30598-9_13}, author = {Katz, Jonathan and Ostrovsky,R. and Rabin,M.} } @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 {15180, title = {Improved efficiency for CCA-secure cryptosystems built using identity-based encryption}, journal = {Topics in Cryptology{\textendash}CT-RSA 2005}, year = {2005}, month = {2005///}, pages = {87 - 103}, abstract = {Recently, Canetti, Halevi, and Katz showed a general method for constructing CCA-secure encryption schemes from identity-based encryption schemes in the standard model. We improve the efficiency of their construction, and show two specific instantiations of our resulting scheme which offer the most efficient encryption (and, in one case, key generation) of any CCA-secure encryption scheme to date.}, doi = {10.1007/978-3-540-30574-3_8}, author = {Boneh,D. and Katz, Jonathan} } @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} } @inbook {16103, title = {Information Visualization and the Challenge of Universal Usability}, booktitle = {Exploring GeovisualizationExploring Geovisualization}, year = {2005}, month = {2005///}, pages = {53 - 82}, publisher = {Elsevier}, organization = {Elsevier}, address = {Oxford}, abstract = {Information Visualization aims to provide compact graphical presentations and user interfaces for interactively manipulating large numbers of items. We present a simple {\textquotedblleft}data by tasks taxonomy{\textquotedblright} then discuss the challenges of providing universal usability, with example applications using geo-referenced data. Information Visualization has been shown to be a powerful visual thinking or decision tool but it is becoming important for services to reach and empower every citizen. Technological advances are needed to deal with user diversity (age, language, disabilities, etc.) but also with the variety of technology used (screen size, network speed, etc.) and the gaps in user{\textquoteright}s knowledge (general knowledge, knowledge of the application domain, of the interface syntax or semantic). We present examples that illustrate how those challenges can be addressed.}, isbn = {978-0-08-044531-1}, url = {http://www.sciencedirect.com/science/article/pii/B9780080445311504218}, author = {Plaisant, Catherine}, editor = {Jason Dykes and Alan M. MacEachren and Menno-Jan KraakA2 - Jason Dykes,Alan M. MacEachren and Menno-Jan Kraak} } @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 {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.} } @article {15956, title = {A logic-based model of intention formation and action for multi-agent subcontracting}, journal = {Artificial Intelligence}, volume = {163}, year = {2005}, month = {2005/04//}, pages = {163 - 201}, abstract = {We present a formalism for representing the formation of intentions by agents engaged in cooperative activity. We use a syntactic approach presenting a formal logical calculus that can be regarded as a meta-logic that describes the reasoning and activities of the agents. Our central focus is on the evolving intentions of agents over time, and the conditions under which an agent can adopt and maintain an intention. In particular, the reasoning time and the time taken to subcontract are modeled explicitly in the logic. We axiomatize the concept of agent interactions in the meta-language, show that the meta-theory is consistent and describe the unique intended model of the meta-theory. In this context we deal both with subcontracting between agents and the presence of multiple recipes, that is, multiple ways of accomplishing tasks. We show that under various initial conditions and known facts about agent beliefs and abilities, the meta-theory representation yields good results.}, keywords = {Cooperative agents, intentions, Minimal model semantics, Subcontracting, Syntactic logic}, isbn = {0004-3702}, doi = {16/j.artint.2004.11.003}, url = {http://www.sciencedirect.com/science/article/pii/S0004370204001924}, author = {Grant,John and Kraus,Sarit and Perlis, Don} } @conference {16298, title = {Main effects screening}, booktitle = {Proceedings of the 27th international conference on Software engineering - ICSE {\textquoteright}05}, year = {2005}, month = {2005///}, pages = {293 - 293}, address = {St. Louis, MO, USA}, doi = {10.1145/1062455.1062515}, url = {http://dl.acm.org/citation.cfm?id=1062515}, author = {Yilmaz,Cemal and Krishna,Arvind S. and Memon, Atif M. and Porter, Adam and Schmidt,Douglas C. and Gokhale,Aniruddha and Natarajan,Balachandran} } @conference {15453, title = {Main effects screening: a distributed continuous quality assurance process for monitoring performance degradation in evolving software systems}, booktitle = {Proceedings of the 27th international conference on Software engineering}, series = {ICSE {\textquoteright}05}, year = {2005}, month = {2005///}, pages = {293 - 302}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Developers of highly configurable performance-intensive software systems often use a type of in-house performance-oriented "regression testing" to ensure that their modifications have not adversely affected their software{\textquoteright}s performance across its large configuration space. Unfortunately, time and resource constraints often limit developers to in-house testing of a small number of configurations and unreliable extrapolation from these results to the entire configuration space, which allows many performance bottlenecks and sources of QoS degradation to escape detection until systems are fielded. To improve performance assessment of evolving systems across large configuration spaces, we have developed a distributed continuous quality assurance (DCQA) process called main effects screening that uses in-the-field resources to execute formally designed experiments to help reduce the configuration space, thereby allowing developers to perform more targeted in-house QA. We have evaluated this process via several feasibility studies on several large, widely-used performance-intensive software systems. Our results indicate that main effects screening can detect key sources of performance degradation in large-scale systems with significantly less effort than conventional techniques.}, keywords = {design of experiment theory, distributed continuous quality assurance, performance-oriented regression testing}, isbn = {1-58113-963-2}, doi = {10.1145/1062455.1062515}, url = {http://doi.acm.org/10.1145/1062455.1062515}, author = {Yilmaz,Cemal and Krishna,Arvind S. and Memon, Atif M. and Porter, Adam and Schmidt,Douglas C. and Gokhale,Aniruddha and Natarajan,Balachandran} } @article {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} } @article {19663, title = {MCMC-based particle filtering for tracking a variable number of interacting targets}, journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {27}, year = {2005}, month = {2005/11//}, pages = {1805 - 1819}, abstract = {We describe a particle filter that effectively deals with interacting targets, targets that are influenced by the proximity and/or behavior of other targets. The particle filter includes a Markov random field (MRF) motion prior that helps maintain the identity of targets throughout an interaction, significantly reducing tracker failures. We show that this MRF prior can be easily implemented by including an additional interaction factor in the importance weights of the particle filter. However, the computational requirements of the resulting multitarget filter render it unusable for large numbers of targets. Consequently, we replace the traditional importance sampling step in the particle filter with a novel Markov chain Monte Carlo (MCMC) sampling step to obtain a more efficient MCMC-based multitarget filter. We also show how to extend this MCMC-based filter to address a variable number of interacting targets. Finally, we present both qualitative and quantitative experimental results, demonstrating that the resulting particle filters deal efficiently and effectively with complicated target interactions.}, keywords = {algorithms, Animals, Artificial intelligence, Computer simulation, Computer vision, Filtering, filtering theory, HUMANS, Image Enhancement, Image Interpretation, Computer-Assisted, Index Terms- Particle filters, Information Storage and Retrieval, Insects, interacting targets, Markov chain Monte Carlo sampling step, Markov chain Monte Carlo., Markov chains, Markov processes, Markov random field motion, Markov random fields, Models, Biological, Models, Statistical, Monte Carlo Method, Monte Carlo methods, MOTION, Movement, multitarget filter, multitarget tracking, particle filtering, Particle filters, Particle tracking, Pattern Recognition, Automated, Sampling methods, Subtraction Technique, target tracking, Video Recording}, isbn = {0162-8828}, author = {Zia Khan and Balch, T. and Dellaert, F.} } @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} } @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} } @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} } @article {12350, title = {Modeling of block-based DSP systems}, journal = {The Journal of VLSI Signal Processing}, volume = {40}, year = {2005}, month = {2005///}, pages = {289 - 299}, author = {Ko,D. I and Bhattacharyya, Shuvra S.} } @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} } @book {18251, title = {Multimedia fingerprinting forensics for traitor tracing}, year = {2005}, month = {2005///}, publisher = {Hindawi Pub Corp}, organization = {Hindawi Pub Corp}, author = {KJR Liu, W. Trappe, Z.J. Wang, M. Wu,H Zhao} } @conference {19665, title = {Multitarget tracking with split and merged measurements}, booktitle = {IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2005. CVPR 2005}, volume = {1}, year = {2005}, month = {2005/06//}, pages = {605 - 610 vol. 1}, abstract = {In many multitarget tracking applications in computer vision, a detection algorithm provides locations of potential targets. Subsequently, the measurements are associated with previously estimated target trajectories in a data association step. The output of the detector is often imperfect and the detection data may include multiple, split measurements from a single target or a single merged measurement from several targets. To address this problem, we introduce a multiple hypothesis tracker for interacting targets that generate split and merged measurements. The tracker is based on an efficient Markov chain Monte Carlo (MCMC) based auxiliary variable particle filter. The particle filter is Rao-Blackwellized such that the continuous target state parameters are estimated analytically, and an MCMC sampler generates samples from the large discrete space of data associations. In addition, we include experimental results in a scenario where we track several interacting targets that generate these split and merged measurements.}, keywords = {Application software, Computer vision, Detection algorithms, Detectors, filtering theory, Markov chain Monte Carlo based auxiliary variable particle filter, Markov processes, merged measurements, Monte Carlo methods, multiple hypothesis tracker, multitarget tracking, parameter estimation, Particle filters, Particle tracking, Rao-Blackwellized filter, split measurements, target tracking, Trajectory}, author = {Zia Khan and Balch, T. and Dellaert, F.} } @conference {16675, title = {OCR post-processing for low density languages}, booktitle = {Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing}, year = {2005}, month = {2005///}, pages = {867 - 874}, author = {Kolak,O. and Resnik, Philip} } @article {19652, title = {An outdoor 3-D visual tracking system for the study of spatial navigation and memory in rhesus monkeys}, journal = {Behavior Research Methods}, volume = {37}, year = {2005}, month = {2005/08/01/}, pages = {453 - 463}, abstract = {Previous studies of the navigational abilities of nonhuman primates have largely been limited to what could be described by a human observer with a pen and paper. Consequently, we have developed a system that uses a pair of cameras to automatically obtain the three-dimensional trajectory of rhesus monkeys performing an outdoor spatial navigation and memory task. The system provides trajectories, path length, speed, and other variables that would be impossible for an unaided observer to note. From trajectory data, we computed and validated a path-length measurement. We use this measurement to compare the navigation abilities of several animals. In addition, we provide quantitative data on the accuracy of a method for automatic behavior detection. Currently, the system is being used to examine the sex differences in spatial navigation of rhesus monkeys. We expect that measures derived from the trajectory data will reveal strategies used by animals to solve spatial problems.}, keywords = {cognitive psychology}, isbn = {1554-351X, 1554-3528}, url = {http://link.springer.com/article/10.3758/BF03192714}, author = {Zia Khan and Herman, Rebecca A. and Wallen, Kim and Balch, Tucker} } @article {15071, title = {A pairwise key predistribution scheme for wireless sensor networks}, journal = {ACM Trans. Inf. Syst. Secur.}, volume = {8}, year = {2005}, month = {2005/05//}, pages = {228 - 258}, abstract = {To achieve security in wireless sensor networks, it is important to be able to encrypt and authenticate messages sent between sensor nodes. Before doing so, keys for performing encryption and authentication must be agreed upon by the communicating parties. Due to resource constraints, however, achieving key agreement in wireless sensor networks is nontrivial. Many key agreement schemes used in general networks, such as Diffie-Hellman and other public-key based schemes, are not suitable for wireless sensor networks due to the limited computational abilities of the sensor nodes. Predistribution of secret keys for all pairs of nodes is not viable due to the large amount of memory this requires when the network size is large.In this paper, we provide a framework in which to study the security of key predistribution schemes, propose a new key predistribution scheme which substantially improves the resilience of the network compared to previous schemes, and give an in-depth analysis of our scheme in terms of network resilience and associated overhead. Our scheme exhibits a nice threshold property: when the number of compromised nodes is less than the threshold, the probability that communications between any additional nodes are compromised is close to zero. This desirable property lowers the initial payoff of smaller-scale network breaches to an adversary, and makes it necessary for the adversary to attack a large fraction of the network before it can achieve any significant gain.}, keywords = {key predistribution, Security, Wireless sensor networks}, isbn = {1094-9224}, doi = {10.1145/1065545.1065548}, url = {http://doi.acm.org/10.1145/1065545.1065548}, author = {Du,Wenliang and Deng,Jing and Han,Yunghsiang S. and Varshney,Pramod K. and Katz, Jonathan and Khalili,Aram} } @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} } @article {13206, title = {Real-time foreground-background segmentation using codebook model}, journal = {Real-time imaging}, volume = {11}, year = {2005}, month = {2005///}, pages = {172 - 185}, author = {Kim,K. and Chalidabhongse,T.H. and Harwood,D. and Davis, Larry S.} } @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 {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 {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 {15128, title = {Simulation and Secure Computation-Handling Expected Polynomial-Time Strategies in Simulation-Based Security Proofs}, journal = {Lecture Notes in Computer Science}, volume = {3378}, year = {2005}, month = {2005///}, pages = {128 - 149}, author = {Katz, Jonathan and Lindell,Y.} } @conference {12375, title = {Software synthesis from the dataflow interchange format}, booktitle = {Proceedings of the 2005 workshop on Software and compilers for embedded systems}, year = {2005}, month = {2005///}, pages = {37 - 49}, author = {Hsu,C. J and Ko,M. Y and Bhattacharyya, Shuvra S.} } @article {17902, title = {Statistical geometry representation for efficient transmission and rendering}, journal = {ACM Transactions on Graphics}, volume = {24}, year = {2005}, month = {2005/04//}, pages = {348 - 373}, abstract = {Traditional geometry representations have focused on representing the details of the geometry in a deterministic fashion. In this article we propose a statistical representation of the geometry that leverages local coherence for very large datasets. We show how the statistical analysis of a densely sampled point model can be used to improve the geometry bandwidth bottleneck, both on the system bus and over the network as well as for randomized rendering, without sacrificing visual realism. Our statistical representation is built using a clustering-based hierarchical principal component analysis (PCA) of the point geometry. It gives us a hierarchical partitioning of the geometry into compact local nodes representing attributes such as spatial coordinates, normal, and color. We pack this information into a few bytes using classification and quantization. This allows our representation to directly render from compressed format for efficient remote as well as local rendering. Our representation supports both view-dependent and on-demand rendering. Our approach renders each node using quasi-random sampling utilizing the probability distribution derived from the PCA analysis. We show many benefits of our approach: (1) several-fold improvement in the storage and transmission complexity of point geometry; (2) direct rendering from compressed data; and (3) support for local and remote rendering on a variety of rendering platforms such as CPUs, GPUs, and PDAs.}, keywords = {network graphics, Point-based rendering, Principal component analysis, programmable GPU, progressive transmission, quasi-random numbers, view-dependent rendering}, isbn = {0730-0301}, doi = {10.1145/1061347.1061356}, url = {http://doi.acm.org/10.1145/1061347.1061356}, author = {Kalaiah,Aravind and Varshney, Amitabh} } @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 {15098, title = {Two-server password-only authenticated key exchange}, journal = {Applied Cryptography and Network Security}, year = {2005}, month = {2005///}, pages = {175 - 206}, abstract = {Typical protocols for password-based authentication assume a single server which stores all the information (e.g.), the password necessary to authenticate a user. Unfortunately, an inherent limitation of this approach (assuming low-entropy passwords are used) is that the user{\textquoteright}s password is exposed if this server is ever compromised. To address this issue, a number of schemes have been proposed in which a user{\textquoteright}s password information is shared among multiple servers, and these servers cooperate in a threshold manner when the user wants to authenticate.We show here a two-server protocol for this task assuming public parameters available to everyone in the system (as well as the adversary). Ours is the first provably-secure two-server protocol for the important password-only setting (in which the user need remember only a password, and not the servers{\textquoteright} public keys), and is the first two-server protocol (in any setting) with a proof of security in the standard model. }, doi = {10.1007/11496137_1}, author = {Katz, Jonathan and MacKenzie,P. and Taban,G. and Gligor,V.} } @article {15087, title = {Universally composable password-based key exchange}, journal = {Advances in Cryptology{\textendash}Eurocrypt 2005}, year = {2005}, month = {2005///}, pages = {557 - 557}, abstract = {We propose and realize a definition of security for password-based key exchange within the framework of universally composable (UC) security, thus providing security guarantees under arbitrary composition with other protocols. In addition, our definition captures some aspects of the problem that were not adequately addressed by most prior notions. For instance, it does not assume any underlying probability distribution on passwords, nor does it assume independence between passwords chosen by different parties. We also formulate a definition of password-based secure channels, and show that such a definition is achievable given password-based key exchange.Our protocol realizing the new definition of password-based key exchange is in the common reference string model and relies on standard number-theoretic assumptions. The components of our protocol can be instantiated to give a relatively efficient solution which is conceivably usable in practice. We also show that it is impossible to satisfy our definition in the {\textquotedblleft}plain{\textquotedblright} model (e.g., without a common reference string). }, doi = {10.1007/11426639_24}, author = {Canetti,R. and Halevi,S. and Katz, Jonathan and Lindell,Y. and MacKenzie,P.} } @article {17913, title = {Unsupervised learning applied to progressive compression of time-dependent geometry}, journal = {Computers \& Graphics}, volume = {29}, year = {2005}, month = {2005/06//}, pages = {451 - 461}, abstract = {We propose a new approach to progressively compress time-dependent geometry. Our approach exploits correlations in motion vectors to achieve better compression. We use unsupervised learning techniques to detect good clusters of motion vectors. For each detected cluster, we build a hierarchy of motion vectors using pairwise agglomerative clustering, and succinctly encode the hierarchy using entropy encoding. We demonstrate our approach on a client{\textendash}server system that we have built for downloading time-dependent geometry.}, keywords = {Clustering algorithms, Distributed/network graphics, pattern recognition}, isbn = {0097-8493}, doi = {10.1016/j.cag.2005.03.021}, url = {http://www.sciencedirect.com/science/article/pii/S009784930500052X}, author = {Baby,Thomas and Kim,Youngmin and Varshney, Amitabh} } @conference {18878, title = {Using domain-configurable search control for probabilistic planning}, volume = {20}, year = {2005}, month = {2005///}, pages = {1169 - 1169}, abstract = {We describe how to improve the performance of MDP planning algorithms by modifying them to use the search-control mechanisms of planners such as TLPlan, SHOP2, and TALplanner. In our experiments, modified versions of RTDP, LRTDP, and Value Iteration were ex- ponentially faster than the original algorithms. On the largest problems the original algorithms could solve, the modified ones were about 10,000 times faster. On another set of problems whose state spaces were more than 14,000 times larger than the original algorithms could solve, the modified algorithms took only about 1/3 second.}, url = {http://www.aaai.org/Papers/AAAI/2005/AAAI05-185.pdf}, author = {Kuter,U. and Nau, Dana S.} } @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} } @inbook {18924, title = {Web Service Composition with Volatile Information}, booktitle = {The Semantic Web {\textendash} ISWC 2005}, series = {Lecture Notes in Computer Science}, volume = {3729}, year = {2005}, month = {2005///}, pages = {52 - 66}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {In many Web service composition problems, information may be needed from Web services during the composition process. Existing research on Web service composition (WSC) procedures has generally assumed that this information will not change. We describe two ways to take such WSC procedures and systematically modify them to deal with volatile information. The black-box approach requires no knowledge of the WSC procedure{\textquoteright}s internals: it places a wrapper around the WSC procedure to deal with volatile information. The gray-box approach requires partial information of those internals, in order to insert coding to perform certain bookkeeping operations. We show theoretically that both approaches work correctly. We present experimental results showing that the WSC procedures produced by the gray-box approach can run much faster than the ones produced by the black-box approach.}, keywords = {Computer science}, isbn = {978-3-540-29754-3}, url = {http://www.springerlink.com/content/y105x8464k54l760/abstract/}, author = {Au,Tsz-Chiu and Kuter,Ugur and Nau, Dana S.}, editor = {Gil,Yolanda and Motta,Enrico and Benjamins,V. and Musen,Mark} } @conference {19670, title = {What Are the Ants Doing? Vision-Based Tracking and Reconstruction of Control Programs}, booktitle = {Proceedings of the 2005 IEEE International Conference on Robotics and Automation, 2005. ICRA 2005}, year = {2005}, month = {2005/04//}, pages = {4182 - 4187}, abstract = {In this paper, we study the problem of going from a real-world, multi-agent system to the generation of control programs in an automatic fashion. In particular, a computer vision system is presented, capable of simultaneously tracking multiple agents, such as social insects. Moreover, the data obtained from this system is fed into a mode-reconstruction module that generates low-complexity control programs, i.e. strings of symbolic descriptions of control-interrupt pairs, consistent with the empirical data. The result is a mechanism for going from the real system to an executable implementation that can be used for controlling multiple mobile robots.}, keywords = {Animals, Automatic generation control, Biological information theory, Computer vision, Control systems, Mobile robots, Probability distribution, Robot control, target tracking, Trajectory}, author = {Egerstedt, M. and Balch, T. and Dellaert, F. and Delmotte, F. and Zia Khan} } @conference {14559, title = {Adaptive limited-supply online auctions}, booktitle = {Proceedings of the 5th ACM Conference on Electronic Commerce}, year = {2004}, month = {2004///}, pages = {71 - 80}, author = {Hajiaghayi, Mohammad T. and Kleinberg,R. and Parkes,D. C} } @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.} } @inbook {15129, title = {Adaptively-Secure, Non-Interactive Public-Key Encryption}, booktitle = {Model reduction methods for vector autoregressive processes}, year = {2004}, month = {2004///}, pages = {150 - 150}, author = {Canetti,R. and Halevi,S. and Katz, Jonathan} } @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} } @conference {13213, title = {Background modeling and subtraction by codebook construction}, booktitle = {Image Processing, 2004. ICIP {\textquoteright}04. 2004 International Conference on}, volume = {5}, year = {2004}, month = {2004/10//}, pages = {3061 - 3064 Vol. 5 - 3061 - 3064 Vol. 5}, abstract = {We present a new fast algorithm for background modeling and subtraction. Sample background values at each pixel are quantized into codebooks which represent a compressed form of background model for a long image sequence. This allows us to capture structural background variation due to periodic-like motion over a long period of time under limited memory. Our method can handle scenes containing moving backgrounds or illumination variations (shadows and highlights), and it achieves robust detection for compressed videos. We compared our method with other multimode modeling techniques.}, keywords = {(signal);, analysis;, background, codebook, coding;, colour, compression;, construction;, data, image, modeling, modeling;, MOTION, multimode, quantisation, representation;, sequence;, sequences;, subtraction;, technique;, video}, doi = {10.1109/ICIP.2004.1421759}, author = {Kim,Kyungnam and Chalidabhongse,T.H. and Harwood,D. and Davis, Larry S.} } @article {15112, title = {Binary tree encryption: Constructions and applications}, journal = {Information Security and Cryptology-ICISC 2003}, year = {2004}, month = {2004///}, pages = {1 - 11}, doi = {10.1007/978-3-540-24691-6_1}, author = {Katz, Jonathan} } @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 {12358, title = {CHARMED: A multi-objective co-synthesis framework for multi-mode embedded systems}, booktitle = {Application-Specific Systems, Architectures and Processors, 2004. Proceedings. 15th IEEE International Conference on}, year = {2004}, month = {2004///}, pages = {28 - 40}, author = {Kianzad,V. and Bhattacharyya, Shuvra S.} } @article {15078, title = {Chosen-ciphertext security from identity-based encryption}, journal = {Advances in Cryptology-Eurocrypt 2004}, year = {2004}, month = {2004///}, pages = {207 - 222}, abstract = {We propose a simple and efficient construction of a CCA-secure public-key encryption scheme from any CPA-secure identity-based encryption (IBE) scheme. Our construction requires the underlying IBE scheme to satisfy only a relatively {\textquotedblleft}weak{\textquotedblright} notion of security which is known to be achievable without random oracles; thus, our results provide a new approach for constructing CCA-secure encryption schemes in the standard model. Our approach is quite different from existing ones; in particular, it avoids non-interactive proofs of {\textquotedblleft}well-formedness{\textquotedblright} which were shown to underlie most previous constructions. Furthermore, applying our conversion to some recently-proposed IBE schemes results in CCA-secure schemes whose efficiency makes them quite practical.Our technique extends to give a simple and reasonably efficient method for securing any binary tree encryption (BTE) scheme against adaptive chosen-ciphertext attacks. This, in turn, yields more efficient CCA-secure hierarchical identity-based and forward-secure encryption schemes in the standard model. }, doi = {10.1007/978-3-540-24676-3_13}, author = {Canetti,R. and Halevi,S. and Katz, Jonathan} } @conference {12341, title = {Compact procedural implementation in DSP software synthesis through recursive graph decomposition}, booktitle = {Software and compilers for embedded systems: 8th international workshop, SCOPES 2004, Amsterdam, The Netherlands, September 2-3, 2004: proceedings}, volume = {3199}, year = {2004}, month = {2004///}, pages = {47 - 47}, author = {Ko,M. Y and Murthy,P. K and Bhattacharyya, Shuvra S.} } @conference {16785, title = {Compressing historical information in sensor networks}, booktitle = {Proceedings of the 2004 ACM SIGMOD international conference on Management of data - SIGMOD {\textquoteright}04}, year = {2004}, month = {2004///}, pages = {527 - 527}, address = {Paris, France}, doi = {10.1145/1007568.1007628}, url = {http://dl.acm.org/citation.cfm?id=1007628}, author = {Deligiannakis,Antonios and Kotidis,Yannis and Roussopoulos, Nick} } @article {15240, title = {Data migration on parallel disks}, journal = {Algorithms{\textendash}ESA 2004}, year = {2004}, month = {2004///}, pages = {689 - 701}, abstract = {Our work is motivated by the problem of managing data on storage devices, typically a set of disks. Such storage servers are used as web servers or multimedia servers, for handling high demand for data. As the system is running, it needs to dynamically respond to changes in demand for different data items. There are known algorithms for mapping demand to a layout. When the demand changes, a new layout is computed. In this work we study the data migration problem, which arises when we need to quickly change one layout to another. This problem has been studied earlier when for each disk the new layout has been prescribed. However, to apply these algorithms effectively, we identify another problem that we refer to as the correspondence problem, whose solution has a significant impact on the solution for the data migration problem. We study algorithms for the data migration problem in more detail and identify variations of the basic algorithm that seem to improve performance in practice, even though some of the variations have poor worst case behavior.}, doi = {10.1007/978-3-540-30140-0_61}, author = {Golubchik,L. and Khuller, Samir and Kim,Y. A and Shargorodskaya,S. and Wan,Y. C} } @article {14481, title = {Data sciences technology for homeland security information management and knowledge discovery}, journal = {Report of the DHS Workshop Data Sciences, Jointly Released by Sandia National Laboratories and Lawrence Livermore National Laboratory, Alexandria, Va}, year = {2004}, month = {2004///}, author = {Kolda,T. and Brown,D and Corones,J. and Critchlow,T. and Eliassi-Rad,T. and Getoor, Lise and Hendrickson,B. and Kumar, V. and Lambert,D. and Matarazzo,C.} } @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 {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 {12285, title = {Efficient peer location on the Internet}, journal = {Computer Networks}, volume = {45}, year = {2004}, month = {2004/05/15/}, pages = {5 - 17}, abstract = {We consider the problem of locating nearby application peers over the Internet. We define a new peer-location scheme (called Tiers), that scales to large application peer groups. Tiers creates a hierarchy of peers, and provides an efficient and scalable solution to the peer-location problem. Tiers can be implemented entirely in the application-layer and does not require the deployment of either any additional measurement services, or well-known reference points in the network.We have evaluated the performance of Tiers through detailed experiments. Our results show that Tiers is able to locate the nearest peers quickly (<<1 s) and accurately on wide-area Internet-like topologies. We have also compared the performance of Tiers with two other schemes, Beaconing and Distributed Binning, both of which are known to have good performance. Both these techniques are reference-points based schemes and are efficient for overlays with a small number of peers (e.g. ⩽32). Our results show that Tiers significantly outperforms both these schemes. Tiers is particularly efficient for large overlay networks, has an order of magnitude lower control overhead for overlays with 512 peers and still achieves greater accuracy in locating the nearest peers. }, keywords = {Group communication, hierarchy, overlays, Peer location, triangle inequality}, isbn = {1389-1286}, doi = {10.1016/j.comnet.2004.02.005}, url = {http://www.sciencedirect.com/science/article/pii/S1389128604000271}, author = {Banerjee,Suman and Kommareddy,Chris and Bhattacharjee, Bobby} } @article {12297, title = {Efficient peer-to-peer namespace searches}, journal = {University of Maryland, College Park, MD, Tech. Rep. CSTR-4568}, year = {2004}, month = {2004///}, abstract = {In this paper we describe new methods for efficient and exact search (keyword and full-text) in distributed namespaces. Our methods can be used in conjunction with existing distributed lookup schemes, such as Distributed Hash Tables, and distributed directories. We describe how indexes for implementing distributed searches can be efficiently created, located, and stored. We describe techniques for creating approximate indexes that can be used to bound the space requirement at individual hosts; such techniques are particularly useful for full-text searches that may require a very large number of individual indexes to be created and maintained. Our methods use a new distributed data structure called the view tree. View trees can be used to efficiently cache and locate results from prior queries. We describe how view trees are created, and maintained. We present experimental results, using large namespaces and realistic data, showing that the techniques introduced in this paper can reduce search overheads (both network and processing costs) by more than an order of magnitude.}, author = {Gopalakrishnan,V. and Bhattacharjee, Bobby and Chawathe,S. and Keleher,P.} } @article {14960, title = {Efficient Serial and Parallel Algorithms for Querying Large Scale Multidimensional Time Series Data}, volume = {UMIACS-TR-2004-50}, year = {2004}, month = {2004///}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {We consider the problem of querying large scale multidimensional time series data to discover events of interest,test and validate hypotheses, or to associate temporal patterns with specific events. Multidimensional time series data is growing at an extremely fast rate due to a number of trends including a recent strong interest in collecting and analyzing time series of business, scientific, demographic, and simulation data. The ability to explore such collections interactively, even at a coarse level, will be critical to the process of extracting some of the information and knowledge embedded in such collections. We develop indexing techniques and search algorithms to efficiently handle temporal range value querying of multidimensional time series data. Our indexing uses linear space data structures that enable the handling of queries very efficiently, invoking in the worst case a logarithmic number of queries to single time steps. We also show that our algorithm is ideally suited for parallel implementation on clusters of processors achieving a linear speedup in the number of available processors. A particularly simple data structure with provably good bounds is also presented for the case when the number of multidimensional objects is relatively small. These techniques improve significantly over previous techniques for either the serial or the parallel case, and are evaluated by extensive experimental results that confirm their superior performance. In particular, we achieve query times in the order of hundreds of milliseconds on a (relatively outdated) cluster of 16 processors for 140GB of data consisting of 160, 000 distinct time series of 16-dimensional points, each time series being of length 10, 000. }, author = {JaJa, Joseph F. and Kim,J. and Wang,Q.} } @conference {19492, title = {Enabling On-chip Diversity Through Architectural Communication Design}, booktitle = {ASP-DAC {\textquoteright}04 Proceedings of the 2004 Asia and South Pacific Design Automation Conference}, series = {ASP-DAC {\textquoteright}04}, year = {2004}, month = {2004///}, pages = {799 - 805}, publisher = {IEEE Press}, organization = {IEEE Press}, abstract = {In this paper, we explore a new concept, called on-chip diversity, and introduce a design methodology for such emerging systems. Simply speaking, on-chip diversity means mixing different architectures and/or technologies in a multiple voltage/frequency island setup in order to achieve the highest levels of performance, fault-tolerance and the needed flexibility in SoC design. As the main contribution, we present the challenges in implementing an efficient communication architecture for on-chip diversity and outline a unified framework which addresses some of these issues. We then provide comparative experimental results and make a qualitative analysis of different architectural choices in the design of the on-chip communication. Having the acoustic beamforming as driver application, we show that an efficient communication infrastructure can be constructed by carefully analyzing the characteristics of the application and the required levels of power, performance and fault-tolerance.}, isbn = {0-7803-8175-0}, url = {http://dl.acm.org/citation.cfm?id=1015090.1015306}, author = {Tudor Dumitras and Kerner, Sam and Marculescu, Radu} } @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 {15241, title = {Equivalence of two linear programming relaxations for broadcast scheduling}, journal = {Operations Research Letters}, volume = {32}, year = {2004}, month = {2004/09//}, pages = {473 - 478}, abstract = {A server needs to compute a broadcast schedule for n pages whose request times are known in advance. Outputting a page satisfies all outstanding requests for the page. The goal is to minimize the average waiting time of a client. In this paper, we show the equivalence of two apparently different relaxations that have been considered for this problem.}, keywords = {Approximation algorithms, Broadcasting, Linear programming, scheduling}, isbn = {0167-6377}, doi = {10.1016/j.orl.2003.11.012}, url = {http://www.sciencedirect.com/science/article/pii/S016763770300169X}, author = {Khuller, Samir and Kim,Yoo-Ah} } @conference {13212, title = {A fine-structure image/video quality measure using local statistics}, booktitle = {Image Processing, 2004. ICIP {\textquoteright}04. 2004 International Conference on}, volume = {5}, year = {2004}, month = {2004/10//}, pages = {3535 - 3538 Vol. 5 - 3535 - 3538 Vol. 5}, abstract = {An objective no-reference measure is presented to assess line-structure image/video quality. It was designed to measure image/video quality for video surveillance applications, especially for background modeling and foreground object detection. The proposed measure using local statistics reflects image degradation well in terms of noise and blur. The experimental results on a background subtraction algorithm validate the usefulness of the proposed measure, by showing its correlation with the algorithm{\textquoteright}s performance.}, keywords = {algorithm;, background, degradation;, detection;, foreground, image, line-structure, local, measure;, modeling;, no-reference, object, objective, processing;, QUALITY, signal, statistics;, subtraction, surveillance;, video}, doi = {10.1109/ICIP.2004.1421879}, author = {Kim,Kyungnam and Davis, Larry S.} } @conference {18871, title = {Forward-chaining planning in nondeterministic domains}, year = {2004}, month = {2004///}, pages = {513 - 518}, abstract = {In this paper, we present a general technique for tak- ing forward-chaining planners for deterministic do- mains (e.g., HSP, TLPlan, TALplanner, and SHOP2) and adapting them to work in nondeterministic do- mains. Our results suggest that our technique pre- serves many of the desirable properties of these plan- ners, such as the ability to use heuristic techniques to achieve highly efficient planning.In our experimental studies on two problem domains, the well-known MBP algorithm took exponential time, confirming prior results by others. A nondeterminized version of SHOP2 took only polynomial time. The polynomial-time figures are confirmed by a complex- ity analysis, and a similar complexity analysis shows that a nondeterminized version of TLPlan would per- form similarly. }, url = {https://www.aaai.org/Papers/AAAI/2004/AAAI04-082.pdf}, author = {Kuter,U. and Nau, Dana S.} } @conference {12704, title = {Fusion of gait and face for human identification}, booktitle = {Acoustics, Speech, and Signal Processing, 2004. Proceedings. (ICASSP {\textquoteright}04). IEEE International Conference on}, volume = {5}, year = {2004}, month = {2004/05//}, pages = {V - 901-4 vol.5 - V - 901-4 vol.5}, abstract = {Identification of humans from arbitrary view points is an important requirement for different tasks including perceptual interfaces for intelligent environments, covert security and access control etc. For optimal performance, the system must use as many cues as possible and combine them in meaningful ways. In this paper, we discuss fusion of face and gait cues for the single camera case. We present a view invariant gait recognition algorithm for gait recognition. We employ decision fusion to combine the results of our gait recognition algorithm and a face recognition algorithm based on sequential importance sampling. We consider two fusion scenarios: hierarchical and holistic. The first involves using the gait recognition algorithm as a filter to pass on a smaller set of candidates to the face recognition algorithm. The second involves combining the similarity scores obtained individually from the face and gait recognition algorithms. Simple rules like the SUM, MIN and PRODUCT are used for combining the scores. The results of fusion experiments are demonstrated on the NIST database which has outdoor gait and face data of 30 subjects.}, keywords = {access, algorithm;, analysis;, combining, control;, covert, cues;, data, decision, Environment, Face, fusion;, Gait, hierarchical, holistic, human, identification;, importance, intelligent, interfaces;, invariant, perceptual, recognition, recognition;, rules;, sampling;, score, scores;, security;, sensor, sequential, similarity, view}, doi = {10.1109/ICASSP.2004.1327257}, author = {Kale, A. and Roy Chowdhury, A.K. and Chellapa, Rama} } @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} } @conference {12293, title = {A game-theoretic framework for analyzing trust-inference protocols}, booktitle = {Workshop on Economics of Peer-to-Peer Systems}, year = {2004}, month = {2004///}, abstract = {We propose a novel game-theoretic framework foranalyzing the robustness of trust-inference protocols in the presence of adversarial (but rational) users. To the best of our knowledge, this is the first such framework which simultaneously (1) admits a rigor- ous and precise definition, thereby enabling formal proofs of security (in various adversarial settings) for specific trust-inference protocols; (2) is flexible enough to accommodate a full range of (realistic) ad- versarial behavior and network models; and (3) is ap- propriate for decentralized networks, and in particu- lar does not posit a trusted, centralized party with complete knowledge of the system history. We also show some preliminary results regarding the design of trust-inference protocols which can be rigorously proven secure within our model. In addition to establishing a solid foundation for future work, our framework also enables a rigorous and objective comparison among existing trust inference protocols. }, author = {Morselli,R. and Katz, Jonathan and Bhattacharjee, Bobby} } @article {15179, title = {A generic construction for intrusion-resilient public-key encryption}, journal = {Topics in Cryptology{\textendash}CT-RSA 2004}, year = {2004}, month = {2004///}, pages = {1997 - 1997}, abstract = {In an intrusion-resilient cryptosystem [10], two entities (a user and a base) jointly evolve a secret decryption key; this provides very strong protection against an active attacker who can break into the user and base repeatedly and even simultaneously. Recently, a construction of an intrusion-resilient public-key encryption scheme based on specific algebraic assumptions has been shown [6]. We generalize this previous work and present a more generic construction for intrusion-resilient public-key encryption from any forward-secure public-key encryption scheme satisfying a certain homomorphic property.}, doi = {10.1007/978-3-540-24660-2_7}, author = {Dodis,Y. and Franklin,M. and Katz, Jonathan and Miyaji,A. and Yung,M.} } @conference {18788, title = {Geometric Containment Analysis for Rotational Parts}, year = {2004}, month = {2004///}, abstract = {This paper describes a system and underlying algorithms toperform geometric containment analysis to determine if a newly designed rotational part can be manufactured from a part in an existing database of rotational parts. Only material removal of the database part is considered in order to obtain the newly designed part from the database part. The system uses a three-step algorithm to test for containment. The first step analyzes feasibility of containment using bounding cylinders. If the bounding cylinder of the query part is bigger than the part in the database, then the database part cannot contain the query part and it is eliminated from consideration. The second step analyzes feasibility of containment by ignoring off-axis features. Any part that fails to satisfy containment at this stage is eliminated from consideration. The third step analyzes the remaining parts from the database for feasibility of containment by including the off-axis features. Finally, the system rank- orders all the database parts that can contain the query part based on their volume differences with the query part. The system described in this paper can be used to find an existing part from which to manufacture a newly designed part. This capability is expected to significantly reduce proliferation of parts, to improve manufacturing responsiveness, and to reduce the cost of new products. }, url = {ftp://ftp.eng.umd.edu/:/home/glue/s/k/skgupta/pub/Publication/DETC04_Karnik.pdf}, author = {Karnik,M. and Gupta,S.K. and Magrab,E. B.} } @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 {16753, title = {Hierarchical in-network data aggregation with quality guarantees}, journal = {Advances in Database Technology-EDBT 2004}, year = {2004}, month = {2004///}, pages = {577 - 578}, author = {Deligiannakis,A. and Kotidis,Y. and Roussopoulos, Nick} } @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.} } @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} } @conference {13788, title = {Identification of confusable drug names: a new approach and evaluation methodology}, booktitle = {Proceedings of the 20th international conference on Computational Linguistics}, series = {COLING {\textquoteright}04}, year = {2004}, month = {2004///}, publisher = {Association for Computational Linguistics}, organization = {Association for Computational Linguistics}, address = {Stroudsburg, PA, USA}, abstract = {This paper addresses the mitigation of medical errors due to the confusion of sound-alike and look-alike drug names. Our approach involves application of two new methods---one based on orthographic similarity ("look-alike") and the other based on phonetic similarity ("sound-alike"). We present a new recall-based evaluation methodology for determining the effectiveness of different similarity measures on drug names. We show that the new orthographic measure (BI-SIM) outperforms other commonly used measures of similarity on a set containing both look-alike and sound-alike pairs, and that the feature-based phonetic approach (ALINE) outperforms orthographic approaches on a test set containing solely sound-alike confusion pairs. However, an approach that combines several different measures achieves the best results on both test sets.}, doi = {10.3115/1220355.1220492}, url = {http://dx.doi.org/10.3115/1220355.1220492}, author = {Kondrak,Grzegorz and Dorr, Bonnie J} } @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 {12428, title = {Identifying similar parts for assisting cost estimation of prismatic machined parts}, booktitle = {ASME Design for Manufacturing Conference, Salt Lake City, Utah}, year = {2004}, month = {2004///}, author = {Cardone, Antonio and Gupta,S.K. and Karnik,M.} } @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} } @article {15760, title = {Implementation of the regularized structured total least squares algorithms for blind image deblurring}, journal = {Linear Algebra and its Applications}, volume = {391}, year = {2004}, month = {2004/11/01/}, pages = {203 - 221}, abstract = {The structured total least squares (STLS) problem has been introduced to handle problems involving structured matrices corrupted by noise. Often the problem is ill-posed. Recently, regularization has been proposed in the STLS framework to solve ill-posed blind deconvolution problems encountered in image deblurring when both the image and the blurring function have uncertainty. The kernel of the regularized STLS (RSTLS) problem is a least squares problem involving Block{\textendash}Toeplitz{\textendash}Toeplitz{\textendash}Block matrices.In this paper an algorithm is described to solve this problem, based on a particular implementation of the generalized Schur Algorithm (GSA). It is shown that this new implementation improves the computational efficiency of the straightforward implementation of GSA from O(N2.5) to O(N2), where N is the number of pixels in the image. }, keywords = {Block Toeplitz matrix, Displacement rank, Generalized Schur algorithm, Image deblurring, Structured total least squares, Tikhonov regularization}, isbn = {0024-3795}, doi = {10.1016/j.laa.2004.07.006}, url = {http://www.sciencedirect.com/science/article/pii/S0024379504003362}, author = {Mastronardi,N. and Lemmerling,P. and Kalsi,A. and O{\textquoteright}Leary,D. P and Huffel,S. Van} } @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.} } @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 {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} } @inbook {19651, title = {An MCMC-Based Particle Filter for Tracking Multiple Interacting Targets}, booktitle = {Computer Vision - ECCV 2004}, series = {Lecture Notes in Computer Science}, year = {2004}, month = {2004/01/01/}, pages = {279 - 290}, publisher = {Springer Berlin Heidelberg}, organization = {Springer Berlin Heidelberg}, abstract = {We describe a Markov chain Monte Carlo based particle filter that effectively deals with interacting targets, i.e., targets that are influenced by the proximity and/or behavior of other targets. Such interactions cause problems for traditional approaches to the data association problem. In response, we developed a joint tracker that includes a more sophisticated motion model to maintain the identity of targets throughout an interaction, drastically reducing tracker failures. The paper presents two main contributions: (1) we show how a Markov random field (MRF) motion prior, built on the fly at each time step, can substantially improve tracking when targets interact, and (2) we show how this can be done efficiently using Markov chain Monte Carlo (MCMC) sampling. We prove that incorporating an MRF to model interactions is equivalent to adding an additional interaction factor to the importance weights in a joint particle filter. Since a joint particle filter suffers from exponential complexity in the number of tracked targets, we replace the traditional importance sampling step in the particle filter with an MCMC sampling step. The resulting filter deals efficiently and effectively with complicated interactions when targets approach each other. We present both qualitative and quantitative results to substantiate the claims made in the paper, including a large scale experiment on a video-sequence of over 10,000 frames in length.}, keywords = {Artificial Intelligence (incl. Robotics), Computer Graphics, Image Processing and Computer Vision, pattern recognition}, isbn = {978-3-540-21981-1, 978-3-540-24673-2}, url = {http://link.springer.com/chapter/10.1007/978-3-540-24673-2_23}, author = {Zia Khan and Balch, Tucker and Dellaert, Frank}, editor = {Pajdla, Tom{\'a}s and Matas, Ji{\v r}{\'\i}} } @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.} } @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} } @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 {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.} } @article {15372, title = {A novel approach to removing intersymbol interference from spin-stand images}, journal = {Magnetics, IEEE Transactions on}, volume = {40}, year = {2004}, month = {2004/07//}, pages = {2197 - 2199}, abstract = {A novel intersymbol interference (ISI) removal technique based on the "response function" characterization of giant-magnetoresistive heads is presented. It is demonstrated that the ISI-free readback image that corresponds to the actual underlying magnetization patterns can be extracted from the ISI-distorted readback signal through deconvolution. A new image deconvolution algorithm has been implemented, and it has been shown that it effectively removes the ISI distortions.}, keywords = {algorithm;, characterization;, Deconvolution, function, function;, giant, giant-magnetoresistive, Head, heads;, image, image;, imaging;, Interference, interference;, intersymbol, ISI-distorted, ISI-free, magnetic, magnetization, magnetoresistance;, patterns;, readback, removal;, response, signal;, spin-stand, suppression;}, isbn = {0018-9464}, doi = {10.1109/TMAG.2004.830153}, author = {Mayergoyz, Issak D and Tse,C. and Krafft,C. and McAvoy,P.} } @article {15097, title = {One-round protocols for two-party authenticated key exchange}, journal = {Applied Cryptography and Network Security}, year = {2004}, month = {2004///}, pages = {220 - 232}, author = {Jeong,I. R and Katz, Jonathan and Lee,D. H} } @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.} } @conference {12170, title = {Pocket PhotoMesa: a Zoomable image browser for PDAs}, booktitle = {Proceedings of the 3rd international conference on Mobile and ubiquitous multimedia}, year = {2004}, month = {2004///}, pages = {19 - 24}, author = {Khella,A. and Bederson, Benjamin B.} } @inbook {18019, title = {PRAM-On-Chip: A Quest for Not-So-Obvious Non-obviousness}, booktitle = {Mathematical Foundations of Computer Science 2004Mathematical Foundations of Computer Science 2004}, series = {Lecture Notes in Computer Science}, volume = {3153}, year = {2004}, month = {2004///}, pages = {104 - 105}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {Consider situations where once you were told about a new technical idea you reacted by saying: {\textquotedblleft}but this is so obvious, I wonder how I missed it{\textquotedblright}. I found out recently that the US patent law has a nice formal way of characterizing such a situation. The US patent law protects inventions that meet three requirements: utility, novelty and non-obviousness. Non-obviousness is considered the most challenging of the three to establish. The talk will try to argue that a possible virtue for a technical contribution is when, in restrospect, its non-obviousness is not too obvious; and since hindsight is always 20/20, one may often need to resort to various types of circumstantial evidence in order to establish non-obviousness. There are two reasons for bringing this issue up in my talk: (i) seeking such a virtue has been an objective of my work over the years, and (ii) issues of taste in research are more legitimate for invited talks; there might be merit in reminding younger researchers that not every {\textquotedblleft}result{\textquotedblright} is necessarily also a {\textquotedblleft}contribution{\textquotedblright}; perhaps the criterion of not-so-obvious non-obviousness could be helpful in some cases to help recognize a contribution. The focus of the second focal point for my talk, the PRAM-On-Chip approach, meets at least one of the standard legal ways to support non-obviousness: {\textquotedblleft}Expressions of disbelief by experts constitute strong evidence of non-obviousness{\textquotedblright}. It is well documented that the whole PRAM algorithmic theory was considered {\textquotedblleft}unrealistic{\textquotedblright} by numerous experts in the field, prior to the PRAM-On-Chip project. In fact, I needed recently to use this documentation in a reply to the U.S. patent office. An introduction of the PRAM-On-Chip approach follows. Many parallel computer systems architectures have been proposed and built over the last several decades. The outreach of the few that survived has been severely limited due to their programmability problems. The question of how to think algorithmically in parallel has been the fundamental problem for which these architectures did not have an adequate answer. A computational model, the Parallel Random Access Model (PRAM), has been developed by numerous (theoretical computer science) algorithm researchers to address this question during the 1980s and 1990s and is considered by many as the easiest known approach to parallel programming. Despite the broad interest the PRAM generated, it had not been possible to build parallel machines that adequately support it using multi-chip multiprocessors, the only multiprocessors that were buildable in the 1990s since low-overhead coordination was not possible. Our main insight is that this is becoming possible with the increasing amounts of hardware that can be placed on a single chip. From the PRAM, as a starting point, a highly parallel explicit multi-threaded (XMT) on-chip processor architecture that relies on new low-overhead coordination mechanisms and whose performance objective is reducing single task completion time has been conceived and developed. Simulated program executions have shown dramatic performance gains over conventional processor architectures. Namely, in addition to the unique parallel programmability features, which set XMT apart from any other current approach, XMT also provides very competitive performance. If XMT will meet expectations, its introduction would greatly enhance the normal rate of improvement of conventional processor architectures leading to new applications.}, keywords = {Computer, Science}, isbn = {978-3-540-22823-3}, url = {http://dx.doi.org/10.1007/978-3-540-28629-5_5}, author = {Vishkin, Uzi}, editor = {Fiala,Jir{\'\i} and Koubek,V{\'a}clav and Kratochv{\'\i}l,Jan} } @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 {13625, title = {Product approximation by minimizing the upper bound of Bayes error rate for Bayesian combination of classifiers}, booktitle = {Pattern Recognition, 2004. ICPR 2004. Proceedings of the 17th International Conference on}, volume = {1}, year = {2004}, month = {2004/08//}, pages = {252 - 255 Vol.1 - 252 - 255 Vol.1}, abstract = {In combining multiple classifiers using a Bayesian formalism, a high dimensional probability distribution is composed of a class and decisions of classifiers. In order to do product approximation of the probability distribution, the upper bound of Bayes error rate, bounded by the conditional entropy of a class and decisions, should be minimized. A second-order dependency-based product approximation is proposed in this paper by considering the second-order dependency between the class and decisions. The proposed method is evaluated by combining the classifiers recognizing unconstrained handwritten numerals.}, keywords = {approximation;, Bayes, Bayesian, bound, character, classification;, classifiers;, conditional, distribution;, entropy;, error, formalism;, handwritten, methods;, minimisation;, multiple, numerals;, pattern, probability, probability;, Product, rate;, recognition;, statistics;, unconstrained, upper}, doi = {10.1109/ICPR.2004.1334071}, author = {Kang,Hee-Joong and David Doermann} } @conference {16774, title = {Querying structured data in an unstructured P2P system}, booktitle = {Proceedings of the 6th annual ACM international workshop on Web information and data management - WIDM {\textquoteright}04}, year = {2004}, month = {2004///}, pages = {64 - 64}, address = {Washington DC, USA}, doi = {10.1145/1031453.1031466}, url = {http://dl.acm.org/citation.cfm?id=1031466}, author = {Kantere,Verena and Tsoumakos,Dimitrios and Roussopoulos, Nick} } @conference {19649, title = {A Rao-Blackwellized particle filter for EigenTracking}, booktitle = {Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2004. CVPR 2004}, volume = {2}, year = {2004}, month = {2004/06//}, pages = {II - 980-II-986 Vol.2}, abstract = {Subspace representations have been a popular way to model appearance in computer vision. In Jepson and Black{\textquoteright}s influential paper on EigenTracking, they were successfully applied in tracking. For noisy targets, optimization-based algorithms (including EigenTracking) often fail catastrophically after losing track. Particle filters have recently emerged as a robust method for tracking in the presence of multi-modal distributions. To use subspace representations in a particle filter, the number of samples increases exponentially as the state vector includes the subspace coefficients. We introduce an efficient method for using subspace representations in a particle filter by applying Rao-Blackwellization to integrate out the subspace coefficients in the state vector. Fewer samples are needed since part of the posterior over the state vector is analytically calculated. We use probabilistic principal component analysis to obtain analytically tractable integrals. We show experimental results in a scenario in which we track a target in clutter.}, keywords = {analytically tractable integrals, Computer vision, EigenTracking, Filters, Gaussian processes, modal analysis, multi-modal distributions, NOISE, noisy targets, optimisation, optimization-based algorithms, Particle filters, Particle measurements, Particle tracking, Principal component analysis, probabilistic principal component analysis, Rao-Blackwellized particle filter, Robustness, SHAPE, State estimation, state vector, subspace coefficients, Subspace representations, target tracking, vectors}, author = {Zia Khan and Balch, T. and Dellaert, F.} } @conference {15109, title = {Reducing complexity assumptions for statistically-hiding commitment}, booktitle = {In EUROCRYPT}, year = {2004}, month = {2004///}, abstract = {Determining the minimal assumptions needed to construct various cryptographic buildingblocks has been a focal point of research in theoretical cryptography. For most {\textemdash} but not all! {\textemdash} cryptographic primitives, complexity assumptions both necessary and sufficient for their existence are known. Here, we revisit the following, decade-old question: what are the minimal assumptions needed to construct a statistically-hiding bit commitment scheme? Previously, it was known how to construct such schemes based on any one-way permutation. In this work, we show that regular one-way functions suffice. We show two constructions of statistically-hiding commitment schemes from regular one-way functions. Our first construction is more direct, and serves as a {\textquotedblleft}stepping-stone{\textquotedblright} for our second construction which has improved round complexity. Of independent interest, as part of our work we show a compiler transforming any commitment scheme which is statistically-hiding against an honest-but-curious receiver to one which is statistically-hiding against a malicious receiver. This demonstrates the equivalence of these two formulations of the problem. }, author = {Horvitz,O. and Katz, Jonathan and Koo,C. Y and Morselli,R.} } @article {15086, title = {Round-optimal secure two-party computation}, journal = {Advances in Cryptology{\textendash}CRYPTO 2004}, year = {2004}, month = {2004///}, pages = {3 - 34}, abstract = {We consider the central cryptographic task of secure two-party computation: two parties wish to compute some function of their private inputs (each receiving possibly different outputs) where security should hold with respect to arbitrarily-malicious behavior of either of the participants. Despite extensive research in this area, the exact round-complexity of this fundamental problem (i.e., the number of rounds required to compute an arbitrary poly-time functionality) was not previously known.Here, we establish the exact round complexity of secure two-party computation with respect to black-box proofs of security. We first show a lower bound establishing (unconditionally) that four rounds are not sufficient to securely compute the coin-tossing functionality for any super-logarithmic number of coins; this rules out 4-round protocols for other natural functionalities as well. Next, we construct protocols for securely computing any (randomized) functionality using only five rounds. Our protocols may be based either on certified trapdoor permutations or homomorphic encryption schemes satisfying certain additional properties. The former assumption is implied by, e.g., the RSA assumption for large public exponents, while the latter is implied by, e.g., the DDH assumption. Finally, we show how our protocols may be modified {\textendash} without increasing their round complexity and without requiring erasures {\textendash} to tolerate an adaptive malicious adversary. }, doi = {10.1007/978-3-540-28628-8_21}, author = {Katz, Jonathan and Ostrovsky,R.} } @article {15186, title = {Secure routing in ad hoc networks}, journal = {Workshop on Security of ad hoc and Sensor Networks: Proceedings of the 2 nd ACM workshop on Security of ad hoc and sensor networks}, year = {2004}, month = {2004///}, author = {Katz, Jonathan} } @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.} } @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 {15036, title = {Temporal range exploration of large scale multidimensional time series data}, booktitle = {Proceedings of SSDBM}, year = {2004}, month = {2004///}, pages = {95 - 106}, abstract = {We consider the problem of querying largescale multidimensional time series data to discover events of interest, test and validate hypotheses, or to associate temporal patterns with specific events. This type of data currently dominate most other types of available data, and will very likely become even more prevalent in the future given the current trends in collecting time series of business, scientific, demographic, and simulation data. The ability to explore such collections interactively, even at a coarse level, will be critical in discovering the information and knowledge embedded in such collections. We develop indexing techniques and search algorithms to efficiently handle temporal range value querying of multidimensional time series data. Our indexing uses linear space data structures that enable the handling of queries in I/O time that is essentially the same as that of handling a single time slice, assuming the availability of a logarithmic number of processors as a function of size of the temporal window. A data structure with provably good bounds is also presented for the case when the number of multidimensional objects is relatively small. These techniques improve significantly over standard techniques for either serial or parallel processing, and are evaluated by extensive experimental results that confirm their superior performance. }, author = {JaJa, Joseph F. and Kim,J. and Wang,Q.} } @conference {12289, title = {Trust-preserving set operations}, booktitle = {INFOCOM 2004. Twenty-third AnnualJoint Conference of the IEEE Computer and Communications Societies}, volume = {4}, year = {2004}, month = {2004/03//}, pages = {2231 - 2241 vol.4 - 2231 - 2241 vol.4}, abstract = {We describe a method for performing trust-preserving set operations by untrusted parties. Our motivation for this is the problem of securely reusing content-based search results in peer-to-peer networks. We model search results and indexes as data sets. Such sets have value for answering a new query only if they are trusted. In the absence of any system-wide security mechanism, a data set is trusted by a node a only if it was generated by some node which is trusted by a. Our main contributions are a formal definition of the problem as well as an efficient scheme that solves this problem by allowing untrusted peers to perform set operations on trusted data sets while also producing unforgeable proofs of correctness. This is accomplished by requiring trusted nodes to sign appropriately-defined digests of generated sets; each such digest consists of an RSA accumulator and a Bloom filter. The scheme is general, and has other applications as well. We give an analysis demonstrating the low overhead of the scheme, and we include experimental data which confirm the analysis.}, keywords = {accumulator;, Bloom, computing;, filter;, mechanism;, network;, operation;, peer-to-peer, RSA, Security, security;, set, system-wide, Telecommunication, theory;, trust-preserving}, doi = {10.1109/INFCOM.2004.1354646}, author = {Morselli,R. and Bhattacharjee, Bobby and Katz, Jonathan and Keleher,P.} } @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} } @conference {14452, title = {Using the structure of Web sites for automatic segmentation of tables}, booktitle = {Proceedings of the 2004 ACM SIGMOD international conference on Management of data}, series = {SIGMOD {\textquoteright}04}, year = {2004}, month = {2004///}, pages = {119 - 130}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Many Web sites, especially those that dynamically generate HTML pages to display the results of a user{\textquoteright}s query, present information in the form of list or tables. Current tools that allow applications to programmatically extract this information rely heavily on user input, often in the form of labeled extracted records. The sheer size and rate of growth of the Web make any solution that relies primarily on user input is infeasible in the long term. Fortunately, many Web sites contain much explicit and implicit structure, both in layout and content, that we can exploit for the purpose of information extraction. This paper describes an approach to automatic extraction and segmentation of records from Web tables. Automatic methods do not require any user input, but rely solely on the layout and content of the Web source. Our approach relies on the common structure of many Web sites, which present information as a list or a table, with a link in each entry leading to a detail page containing additional information about that item. We describe two algorithms that use redundancies in the content of table and detail pages to aid in information extraction. The first algorithm encodes additional information provided by detail pages as constraints and finds the segmentation by solving a constraint satisfaction problem. The second algorithm uses probabilistic inference to find the record segmentation. We show how each approach can exploit the web site structure in a general, domain-independent manner, and we demonstrate the effectiveness of each algorithm on a set of twelve Web sites.}, isbn = {1-58113-859-8}, doi = {10.1145/1007568.1007584}, url = {http://doi.acm.org/10.1145/1007568.1007584}, author = {Lerman,Kristina and Getoor, Lise and Minton,Steven and Knoblock,Craig} } @inbook {16293, title = {Using the TIGR Assembler in Shotgun Sequencing Projects}, booktitle = {Bacterial Artificial Chromosomes}, series = {Methods in Molecular Biology}, volume = {255}, year = {2004}, month = {2004///}, pages = {279 - 294}, publisher = {Humana Press}, organization = {Humana Press}, abstract = {The TIGR Assembler (TA) ( 1 ) is the sequence assembly program used in sequencing projects at The Institute for Genomic Research (TIGR). Development of the TA was based on the experience obtained in more than 20 sequencing projects completed at TIGR ( see http://www.tigr.org ). This extensive experience led to a sequence assembler that produces few misassemblies ( 2 , 3 ) and has been used successfully in whole-genome shotgun sequencing of prokaryotic and eukaryotic organisms, bacterial artificial chromosome-based sequencing of eukaryotic organisms, and expressed sequence tag assembly.}, isbn = {978-1-59259-752-9}, url = {http://dx.doi.org/10.1385/1-59259-752-1:279}, author = {Pop, Mihai and Kosack,Dan}, editor = {Zhao,Shaying and Stodolsky,Marvin} } @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} } @conference {15314, title = {What works better for question answering: Stemming or morphological query expansion}, booktitle = {Proceedings of the Information Retrieval for Question Answering (IR4QA) Workshop at SIGIR 2004}, year = {2004}, month = {2004///}, abstract = {How do different information retrieval techniques affect theperformance of document retrieval in the context of question answering? An exploration of this question is our overall re- search goal. In this paper, we specifically examine strategies for coping with morphological variation. This work quanti- tatively compares two different approaches to handling term variation: applying a stemming algorithm at indexing time, and performing morphological query expansion at retrieval time. We discovered that, compared to the no-stemming baseline, stemming results in lower recall, and morphologi- cal expansion yields higher recall. By separately weighting different term variants, we were able to achieve even higher recall, which opens the door to interesting question analy- sis algorithms for sophisticated query generation. Another significant contribution of our work is the development of a reusable question answering test collection to support our experiments. }, author = {Bilotti,M. W and Katz,B. and Jimmy Lin} } @article {12699, title = {Wide baseline image registration with application to 3-D face modeling}, journal = {Multimedia, IEEE Transactions on}, volume = {6}, year = {2004}, month = {2004/06//}, pages = {423 - 434}, abstract = {Establishing correspondence between features in two images of the same scene taken from different viewing angles is a challenging problem in image processing and computer vision. However, its solution is an important step in many applications like wide baseline stereo, three-dimensional (3-D) model alignment, creation of panoramic views, etc. In this paper, we propose a technique for registration of two images of a face obtained from different viewing angles. We show that prior information about the general characteristics of a face obtained from video sequences of different faces can be used to design a robust correspondence algorithm. The method works by matching two-dimensional (2-D) shapes of the different features of the face (e.g., eyes, nose etc.). A doubly stochastic matrix, representing the probability of match between the features, is derived using the Sinkhorn normalization procedure. The final correspondence is obtained by minimizing the probability of error of a match between the entire constellation of features in the two sets, thus taking into account the global spatial configuration of the features. The method is applied for creating holistic 3-D models of a face from partial representations. Although this paper focuses primarily on faces, the algorithm can also be used for other objects with small modifications.}, keywords = {2D, 3D, algorithm;, baseline, biometrics;, Computer, configuration;, correspondence, doubly, error, extraction;, Face, feature, holistic, image, matching;, matrix;, minimization;, modeling;, models;, normalization, probability, probability;, procedure;, processes;, processing;, recognition;, registration;, representation;, sequences;, shapes;, Sinkhorn, spatial, statistics;, Stochastic, video, vision;, wide}, isbn = {1520-9210}, doi = {10.1109/TMM.2004.827511}, author = {Roy-Chowdhury, A.K. and Chellapa, Rama and Keaton, T.} } @article {13720, title = {Acquisition of bilingual MT lexicons from OCRed dictionaries}, journal = {Proceedings of the 9th MT Summit}, year = {2003}, month = {2003///}, pages = {208 - 215}, abstract = {This paper describes an approach to analyzing the lexical structure of OCRed bilingual dictionaries to construct re-sources suited for machine translation of low-density languages, where online resources are limited. A rule-based, an HMM-based, and a post-processed HMM-based method are used for rapid construction of MT lexicons based on sys- tematic structural clues provided in the original dictionary. We evaluate the effectiveness of our techniques, concluding that: (1) the rule-based method performs better with dictionaries where the font is not an important distinguishing fea- ture for determining information types; (2) the post-processed stochastic method improves the results of the stochastic method for phrasal entries; and (3) Our resulting bilingual lexicons are comprehensive enough to provide the basis for reasonable translation results when compared to human translations. }, author = {Karagol-Ayan,B. and David Doermann and Dorr, Bonnie J} } @conference {13486, title = {Acquisition of Bilingual MTLexicons from OCRed Dictionaries}, booktitle = {Proceedings of the Ninth Machine Translation Summit}, year = {2003}, month = {2003///}, pages = {208 - 215}, address = {New Orleans, LA}, author = {Karagol-Ayan,B. and David Doermann and Dorr, Bonnie J} } @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 {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 {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} } @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} } @article {12951, title = {Characterization of a Vibrio cholerae phage isolated from the coastal water of Peru}, journal = {Environmental Microbiology}, volume = {5}, year = {2003}, month = {2003/04/25/}, pages = {350 - 354}, abstract = {A Vibrio cholerae bacteriophage, family Myoviridae, was isolated from seawater collected from the coastal water of Lima, Peru. Genome size was estimated to be 29~kbp. The temperate phage was specific to V. cholerae and infected 12/13 V. cholerae O1 strains and half of the four non-O1/non-O139 strains tested in this study. Vibrio cholerae O139 strains were resistant to infection and highest infection rates were obtained in low nutrient media amended with NaCl or prepared using seawater as diluent.}, isbn = {1462-2920}, doi = {10.1046/j.1462-2920.2003.00411.x}, url = {http://onlinelibrary.wiley.com/doi/10.1046/j.1462-2920.2003.00411.x/abstract?userIsAuthenticated=false\&deniedAccessCustomisedMessage=}, author = {Talledo,Miguel and Rivera,Irma N. G. and Lipp,Erin K. and Neale,Angela and Karaolis,David and Huq,Anwar and Rita R Colwell} } @conference {14290, title = {Checking and inferring local non-aliasing}, booktitle = {ACM SIGPLAN Notices}, volume = {38}, year = {2003}, month = {2003///}, pages = {129 - 140}, author = {Aiken,A. and Foster, Jeffrey S. and Kodumal,J. and Terauchi,T.} } @conference {12734, title = {Combining multiple evidences for gait recognition}, booktitle = {Acoustics, Speech, and Signal Processing, 2003. Proceedings. (ICASSP {\textquoteright}03). 2003 IEEE International Conference on}, volume = {3}, year = {2003}, month = {2003/04//}, pages = {III - 33-6 vol.3 - III - 33-6 vol.3}, abstract = {In this paper, we systematically analyze different components of human gait, for the purpose of human identification. We investigate dynamic features such as the swing of the hands/legs, the sway of the upper body and static features like height, in both frontal and side views. Both probabilistic and non-probabilistic techniques are used for matching the features. Various combination strategies may be used depending upon the gait features being combined. We discuss three simple rules: the Sum, Product and MIN rules that are relevant to our feature sets. Experiments using four different datasets demonstrate that fusion can be used as an effective strategy in recognition.}, keywords = {analysis;, dynamic, evidences;, extraction;, feature, features;, frontal, Gait, height;, human, identification;, image, MIN, multiple, nonprobabilistic, probabilistic, Product, recognition;, rules;, sets;, side, static, Sum, sway;, swing;, techniques;, views;}, doi = {10.1109/ICASSP.2003.1199100}, author = {Cuntoor, N. and Kale, A. and Chellapa, Rama} } @conference {12303, title = {Construction of an efficient overlay multicast infrastructure for real-time applications}, booktitle = {INFOCOM 2003. Twenty-Second Annual Joint Conference of the IEEE Computer and Communications. IEEE Societies}, volume = {2}, year = {2003}, month = {2003/04/03/march}, pages = {1521 - 1531 vol.2 - 1521 - 1531 vol.2}, abstract = {This paper presents an overlay architecture where service providers deploy a set of service nodes (called MSNs) in the network to efficiently implement media-streaming applications. These MSNs are organized into an overlay and act as application-layer multicast forwarding entities for a set of clients. We present a decentralized scheme that organizes the MSNs into an appropriate overlay structure that is particularly beneficial for real-time applications. We formulate our optimization criterion as a "degree-constrained minimum average-latency problem" which is known to be NP-hard. A key feature of this formulation is that it gives a dynamic priority to different MSNs based on the size of its service set. Our proposed approach iteratively modifies the overlay tree using localized transformations to adapt with changing distribution of MSNs, clients, as well as network conditions. We show that a centralized greedy approach to this problem does not perform quite as well, while our distributed iterative scheme efficiently converges to near-optimal solutions.}, keywords = {application-layer;, applications;, communication;, criterion;, decentralized, distributed, entities;, forwarding, infrastructure;, Internet;, iterative, media-streaming, methods;, MSN;, Multicast, nodes;, NP-hard;, OPTIMIZATION, overlay, real, real-time, scheme;, service, systems;, TIME}, doi = {10.1109/INFCOM.2003.1208987}, author = {Banerjee,S. and Kommareddy,C. and Kar,K. and Bhattacharjee, Bobby and Khuller, Samir} } @conference {16136, title = {Data exploration with paired hierarchical visualizations: initial designs of PairTrees}, booktitle = {Proceedings of the 2003 annual national conference on Digital government research}, series = {dg.o {\textquoteright}03}, year = {2003}, month = {2003///}, pages = {1 - 6}, publisher = {Digital Government Society of North America}, organization = {Digital Government Society of North America}, abstract = {Paired hierarchical visualizations (PairTrees) integrate treemaps, node-link diagrams, choropleth maps and other information visualization techniques to support exploration of hierarchical data sets at multiple levels of abstraction. This paper describes several novel applications of PairTrees in the econometric and health statistics domains, as well as some challenges and trade-offs inherent in the technique.}, url = {http://dl.acm.org/citation.cfm?id=1123196.1123233}, author = {Kules,Bill and Shneiderman, Ben and Plaisant, Catherine} } @article {12339, title = {Data partitioning for DSP software synthesis}, journal = {Lecture Notes in Computer Science}, year = {2003}, month = {2003///}, pages = {344 - 358}, author = {Ko,M. Y and Bhattacharyya, Shuvra S.} } @article {18537, title = {Defeating Web censorship with untrusted messenger discovery}, journal = {Workshop on Privacy Enhancing Technologies}, year = {2003}, month = {2003///}, author = {Feamster, Nick and Balazinska,M. and Wang,W. and Balakrishnan,H. and Karger,D.} } @article {12301, title = {Deno: a decentralized, peer-to-peer object-replication system for weakly connected environments}, journal = {Computers, IEEE Transactions on}, volume = {52}, year = {2003}, month = {2003/07//}, pages = {943 - 959}, abstract = {This paper presents the design, implementation, and evaluation of the replication framework of Deno, a decentralized, peer-to-peer object-replication system targeted for weakly connected environments. Deno uses weighted voting for availability and pair-wise, epidemic information flow for flexibility. This combination allows the protocols to operate with less than full connectivity, to easily adapt to changes in group membership, and to make few assumptions about the underlying network topology. We present two versions of Deno{\textquoteright}s protocol that differ in the consistency levels they support. We also propose security extensions to handle a class of malicious actions that involve misrepresentation of protocol information. Deno has been implemented and runs on top of Linux and Win32 platforms. We use the Deno prototype to characterize the performance of the Deno protocols and extensions. Our study reveals several interesting results that provide fundamental insight into the benefits of decentralization and the mechanics of epidemic protocols.}, keywords = {actions;, connected, consistency, data, data;, databases;, decentralized, Deno;, distributed, environments;, epidemic, group, levels;, Linux;, malicious, management;, membership;, network, object, object-replication, of, operating, peer-to-peer, protocols;, replicated, replication;, Security, security;, synchronisation;, system;, systems;, topology;, Unix;, voting;, weakly, weighted, Win32;}, isbn = {0018-9340}, doi = {10.1109/TC.2003.1214342}, author = {Cetintemel,U. and Keleher,P. J and Bhattacharjee, Bobby and Franklin,M.J.} } @conference {17061, title = {Designing a metadata-driven visual information browser for federal statistics}, booktitle = {Proceedings of the 2003 annual national conference on Digital government research}, series = {dg.o {\textquoteright}03}, year = {2003}, month = {2003///}, pages = {1 - 6}, publisher = {Digital Government Society of North America}, organization = {Digital Government Society of North America}, abstract = {When looking for federal statistics, finding the right table, chart or report can be a daunting task for anyone not thoroughly familiar with the federal statistical system. Search tools help, but differing terminologies within the statistical agencies and a lack of familiarity of terms by information seekers limit their effectiveness. The FedStats Browser is a design for visually browsing federal agency statistical products and publications, using techniques that allow users to reformulate queries and iteratively refine results via simple, reversible actions with immediate feedback. This paper also discusses the characteristics of metadata needed for such a browser and the challenges inherent in acquiring that metadata.}, url = {http://dl.acm.org/citation.cfm?id=1123196.1123235}, author = {Kules,Bill and Shneiderman, Ben} } @article {13754, title = {Desparately seeking cebuano}, journal = {Third Conference on Human Language Technologies}, year = {2003}, month = {2003///}, abstract = {This paper describes an effort to rapidly de-velop language resources and component tech- nology to support searching Cebuano news sto- ries using English queries. Results from the first 60 hours of the exercise are presented. }, author = {Oard, Douglas and David Doermann and Dorr, Bonnie J and He,D. and Resnik, Philip and Weinberg, Amy and Byrne,W. and Khudanpur,S. and Yarowsky,D. and Leuski,A. and others} } @article {18023, title = {Deterministic Resource Discovery in Distributed Networks}, journal = {Theory of Computing Systems}, volume = {36}, year = {2003}, month = {2003///}, pages = {479 - 495}, abstract = {The resource discovery problem was introduced by Harchol-Balter, Leighton, and Lewin. They developed a number of algorithms for the problem in the weakly connected directed graph model. This model is a directed logical graph that represents the vertices{\textquoteright} knowledge about the topology of the underlying communication network. The current paper proposes a deterministic algorithm for the problem in the same model, with improved time, message, and communication complexities. Each previous algorithm had a complexity that was higher at least in one of the measures. Specifically, previous deterministic solutions required either time linear in the diameter of the initial network, or communication complexity $O(n^3)$ (with message complexity $O(n^2)$), or message complexity $O(|E_0| {\l}og n)$ (where $E_0$ is the arc set of the initial graph $G_0$). Compared with the main randomized algorithm of Harchol-Balter, Leighton, and Lewin, the time complexity is reduced from $O({\l}og^2n)$ to\pagebreak[4] $O({\l}og n )$, the message complexity from $O(n {\l}og^2 n)$ to $O(n {\l}og n )$, and the communication complexity from $O(n^2 {\l}og^3 n)$ to $O(|E_0|{\l}og ^2 n )$. \par Our work significantly extends the connectivity algorithm of Shiloach and Vishkin which was originally given for a parallel model of computation. Our result also confirms a conjecture of Harchol-Balter, Leighton, and Lewin, and addresses an open question due to Lipton.}, keywords = {Computer, Science}, isbn = {1432-4350}, url = {http://dx.doi.org/10.1007/s00224-003-1084-8}, author = {Kutten,Shay and Peleg,David and Vishkin, Uzi} } @article {16905, title = {Digital Government-Bistro: A Scalable and Secure Data Transfer Service for Digital Government Applications}, journal = {Communications of the ACM-Association for Computing Machinery-CACM}, volume = {46}, year = {2003}, month = {2003///}, pages = {50 - 51}, author = {Golubchik,L. and Cheng,W. C and Chou,C. F and Khuller, Samir and Samet, Hanan and Wan,Y. C.J} } @article {16289, title = {The Dog Genome: Survey Sequencing and Comparative Analysis}, journal = {ScienceScience}, volume = {301}, year = {2003}, month = {2003/09/26/}, pages = {1898 - 1903}, abstract = {A survey of the dog genome sequence (6.22 million sequence reads; 1.5{\texttimes} coverage) demonstrates the power of sample sequencing for comparative analysis of mammalian genomes and the generation of species-specific resources. More than 650 million base pairs (>25\%) of dog sequence align uniquely to the human genome, including fragments of putative orthologs for 18,473 of 24,567 annotated human genes. Mutation rates, conserved synteny, repeat content, and phylogeny can be compared among human, mouse, and dog. A variety of polymorphic elements are identified that will be valuable for mapping the genetic basis of diseases and traits in the dog.}, isbn = {0036-8075, 1095-9203}, doi = {10.1126/science.1086432}, url = {http://www.sciencemag.org/content/301/5641/1898}, author = {Kirkness,Ewen F. and Bafna,Vineet and Halpern,Aaron L. and Levy,Samuel and Remington,Karin and Rusch,Douglas B and Delcher,Arthur L. and Pop, Mihai and Wang,Wei and Fraser,Claire M. and Venter,J. Craig} } @article {19078, title = {The dog genome: survey sequencing and comparative analysis}, journal = {Science}, volume = {301}, year = {2003}, month = {2003}, author = {Kirkness,E. F and Bafna,V. and Halpern,A. L and Levy,S. and Remington,K. and Rusch,D. B and Delcher,A. L and Pop, Mihai and Wang,W. and Fraser,C. M and others} } @article {13758, title = {Domain Tuning of Bilingual Lexicons for MT}, year = {2003}, month = {2003/02//}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {Our overall objective is to translate a domain-specific document in a foreign language (in this case, Chinese) to English. Using automatically induced domain-specific, comparable documents and language-independent clustering, we apply domain-tuning techniques to a bilingual lexicon for downstream translation of the input document to English. We will describe our domain-tuning technique and demonstrate its effectiveness by comparing our results to manually constructed domain-specific vocabulary. Our coverage/accuracy experiments indicate that domain-tuned lexicons achieve 88/\% precision and 66/\% recall. We also ran a Bleu experiment to compare our domain-tuned version to its un-tuned counterpart in an IR Ni-style NIT system. Our domain-tuned lexicons brought about an improvement in the Blen scores: 9.4/\% higher than a system trained on a uniformly- weighted dictionary and 275/\% higher than a system trained on no dictionary at all.}, keywords = {*DICTIONARIES, *FOREIGN LANGUAGES, accuracy, BILINGUAL LEXICONS, DOCUMENTS, linguistics, Vocabulary}, url = {http://stinet.dtic.mil/oai/oai?\&verb=getRecord\&metadataPrefix=html\&identifier=ADA455197}, author = {Ayan,Necip F and Dorr, Bonnie J and Kolak,Okan} } @article {17844, title = {Driving scientific applications by data in distributed environments}, journal = {Computational Science{\textemdash}ICCS 2003}, year = {2003}, month = {2003///}, pages = {713 - 713}, author = {Saltz, J. and Catalyurek,U. and Kurc, T. and Gray,M. and Hastings,S. and Langella,S. and Narayanan,S. and Martino,R. and Bryant,S. and Peszynska,M. and others} } @conference {15133, title = {Efficiency improvements for signature schemes with tight security reductions}, booktitle = {Proceedings of the 10th ACM conference on Computer and communications security}, series = {CCS {\textquoteright}03}, year = {2003}, month = {2003///}, pages = {155 - 164}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Much recent work has focused on constructing efficient digital signature schemes whose security is tightly related to the hardness of some underlying cryptographic assumption. With this motivation in mind, we show here two approaches which improve both the computational efficiency and signature length of some recently-proposed schemes:Diffie-Hellman signatures. Goh and Jarecki [18] recently analyzed a signature scheme which has a tight security reduction to the computational Diffie-Hellman problem. Unfortunately, their scheme is less efficient in both computation and bandwidth than previous schemes relying on the (related) discrete logarithm assumption. We present a modification of their scheme in which signing is 33\% more efficient and signatures are 75\% shorter; the security of this scheme is tightly related to the decisional Diffie-Hellman problem.PSS. The probabilistic signature scheme (PSS) designed by Bellare and Rogaway [3] uses a random salt to enable a tight security reduction to, e.g., the RSA problem. Coron [12] subsequently showed that a shorter random salt can be used without impacting the security of the scheme. We show a variant of PSS which avoids the random salt altogether yet has an equally-tight security reduction. This furthermore yields a version of PSS-R (PSS with message recovery) with optimal message length. Our technique may also be used to improve the efficiency of a number of other schemes.}, keywords = {digital, SIGNATURES}, isbn = {1-58113-738-9}, doi = {10.1145/948109.948132}, url = {http://doi.acm.org/10.1145/948109.948132}, author = {Katz, Jonathan and Wang,Nan} } @conference {15139, title = {Efficient and non-malleable proofs of plaintext knowledge and applications}, booktitle = {Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques}, series = {EUROCRYPT{\textquoteright}03}, year = {2003}, month = {2003///}, pages = {211 - 228}, publisher = {Springer-Verlag}, organization = {Springer-Verlag}, address = {Berlin, Heidelberg}, abstract = {We describe efficient protocols for non-malleable (interactive) proofs of plaintext knowledge for the RSA, Rabin, Paillier, and El Gamal encryption schemes. We also highlight some important applications of these protocols: - Chosen-ciphertext-secure, interactive encryption. In settings where both parties are on-line, an interactive encryption protocol may be used. We construct chosen-ciphertext-secure interactive encryption schemes based on any of the schemes above. In each case, the improved scheme requires only a small overhead beyond the original, semantically-secure scheme. - Password-based authenticated key exchange. We derive efficient protocols for password-based key exchange in the public-key model [28, 5] whose security may be based on any of the cryptosystems mentioned above. - Deniable authentication. Our techniques give the first efficient constructions of deniable authentication protocols based on, e.g., the RSA or computational Diffie-Hellman assumption. Of independent interest, we consider the concurrent composition of proofs of knowledge; this is essential to prove security of our protocols when run in an asynchronous, concurrent environment.}, isbn = {3-540-14039-5}, url = {http://dl.acm.org/citation.cfm?id=1766171.1766189}, author = {Katz, Jonathan} } @conference {19659, title = {Efficient particle filter-based tracking of multiple interacting targets using an MRF-based motion model}, booktitle = {2003 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2003. (IROS 2003). Proceedings}, volume = {1}, year = {2003}, month = {2003/10//}, pages = {254 - 259 vol.1}, abstract = {We describe a multiple hypothesis particle filter for tracking targets that are influenced by the proximity and/or behavior of other targets. Our contribution is to show how a Markov random field motion prior, built on the fly at each time step, can model these interactions to enable more accurate tracking. We present results for a social insect tracking application, where we model the domain knowledge that two targets cannot occupy the same space, and targets actively avoid collisions. We show that using this model improves track quality and efficiency. Unfortunately, the joint particle tracker we propose suffers from exponential complexity in the number of tracked targets. An approximation to the joint filter, however, consisting of multiple nearly independent particle filters can provide similar track quality at substantially lower computational cost.}, keywords = {collision avoidance, computational cost, Computational efficiency, Educational institutions, exponential complexity, Filtering, filtering theory, Insects, joint particle tracker, Markov processes, Markov random field motion, Markov random fields, multiple interacting targets, particle filter-based tracking, Particle filters, Particle tracking, Radar tracking, social insect tracking application, target tracking, Trajectory}, author = {Zia Khan and Balch, T. and Dellaert, F.} } @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.} } @article {18938, title = {Evaluating Translational Correspondence using Annotation Projection}, volume = {UMIACS-TR-2003-25}, year = {2003}, month = {2003///}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {Recently, statistical machine translation models have begun to take advantage of higherlevel linguistic structures such as syntactic dependencies. Underlying these models is an assumption about the directness of translational correspondence between sentences in the two languages; however, the extent to which this assumption is valid and useful is not well understood. In this paper, we present an empirical study that quantifies the degree to which syntactic dependencies are preserved when parses are projected directly from En- glish to Chinese. Our results show that although the direct correspondence assumption is often too restrictive, a small set of principled, elementary linguistic transformations can boost the quality of the projected Chinese parses by 76\% relative to the unimproved baseline. }, url = {http://lampsrv02.umiacs.umd.edu/pubs/TechReports/LAMP_100/LAMP_100.pdf}, author = {Hwa,R. and Resnik, Philip and Weinberg, Amy and Kolak,O.} } @article {13768, title = {Evaluation Techniques Applied to Domain Tuning of MT Lexicons}, journal = {Proceedings of the Workshop {\textquotedblleft}Towards Systematizing MT Evaluation}, volume = {27}, year = {2003}, month = {2003///}, pages = {3 - 11}, abstract = {We describe a set of evaluation techniques applied to domain tuning of bilingual lexicons for machine translation.Our overall objective is to translate a domain-specific document in a foreign language (in this case, Chinese) to En- glish. First, we perform an intrinsic evaluation of the effectiveness of our domain-tuning techniques by comparing our domain-tuned lexicon to a manually constructed domain-specific bilingual termlist. Our results indicate that we achieve 66\% recall and 95\% precision with respect to a human-derived gold standard. Next, an extrinsic evaluation demonstrates that our domain-tuned lexicon improves the Bleu scores 50\% over a statistical system{\textemdash}with a smaller improvement when the system is trained on a uniformly-weighted dictionary. }, author = {Ayan,N.F. and Dorr, Bonnie J and Kolak,O.} } @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} } @conference {15316, title = {Extracting structural paraphrases from aligned monolingual corpora}, booktitle = {Proceedings of the second international workshop on Paraphrasing - Volume 16}, series = {PARAPHRASE {\textquoteright}03}, year = {2003}, month = {2003///}, pages = {57 - 64}, publisher = {Association for Computational Linguistics}, organization = {Association for Computational Linguistics}, address = {Stroudsburg, PA, USA}, abstract = {We present an approach for automatically learning paraphrases from aligned monolingual corpora. Our algorithm works by generalizing the syntactic paths between corresponding anchors in aligned sentence pairs. Compared to previous work, structural paraphrases generated by our algorithm tend to be much longer on average, and are capable of capturing long-distance dependencies. In addition to a standalone evaluation of our paraphrases, we also describe a question answering application currently under development that could immensely benefit from automatically-learned structural paraphrases.}, doi = {10.3115/1118984.1118992}, url = {http://dx.doi.org/10.3115/1118984.1118992}, author = {Ibrahim,Ali and Katz,Boris and Jimmy Lin} } @conference {15143, title = {Forward secrecy in password-only key exchange protocols}, booktitle = {Proceedings of the 3rd international conference on Security in communication networks}, series = {SCN{\textquoteright}02}, year = {2003}, month = {2003///}, pages = {29 - 44}, publisher = {Springer-Verlag}, organization = {Springer-Verlag}, address = {Berlin, Heidelberg}, abstract = {Password-only authenticated key exchange (PAKE) protocols are designed to be secure even when users choose short, easily-guessed passwords. Security requires, in particular, that the protocol cannot be broken by an off-line dictionary attack in which an adversary enumerates all possible passwords in an attempt to determine the correct one based on previously-viewed transcripts. Recently, provably-secure protocols for PAKE were given in the idealized random oracle/ideal cipher models [2,8,19] and in the standard model based on general assumptions [11] or the DDH assumption [14]. The latter protocol (the KOY protocol) is currently the only known practical solution based on standard assumptions. However, only a proof of basic security for this protocol has appeared. In the basic setting the adversary is assumed not to corrupt clients (thereby learning their passwords) or servers (thereby modifying the value of stored passwords). Simplifying and unifying previous work, we present a natural definition of security which incorporates the more challenging requirement of forward secrecy. We then demonstrate via an explicit attack that the KOY protocol as originally presented is not secure under this definition. This provides the first natural example showing that forward secrecy is a strictly stronger requirement for PAKE protocols. Finally, we present a slight modification of the KOY protocol which prevents the attack and - as the main technical contribution of this paper - rigorously prove that the modified protocol achieves forward secrecy.}, isbn = {3-540-00420-3}, url = {http://dl.acm.org/citation.cfm?id=1766811.1766816}, author = {Katz, Jonathan and Ostrovsky,Rafail and Yung,Moti} } @article {15095, title = {A forward-secure public-key encryption scheme}, journal = {Advances in Cryptology{\textemdash}Eurocrypt 2003}, year = {2003}, month = {2003///}, pages = {646 - 646}, abstract = {Cryptographic computations are often carried out on insecure devices for which the threat of key exposure represents a serious and realistic concern. In an effort to mitigate the damage caused by exposure of secret data (e.g., keys) stored on such devices, the paradigm of forward security was introduced. In a forward-secure scheme, secret keys are updated at regular periods of time; furthermore, exposure of a secret key corresponding to a given time period does not enable an adversary to {\textquotedblleft}break{\textquotedblright} the scheme (in the appropriate sense) for any prior time period. A number of constructions of forward-secure digital signature schemes, key-exchange protocols, and symmetric-key schemes are known.We present the first constructions of a (non-interactive) forward-secure public-key encryption scheme. Our main construction achieves security against chosen plaintext attacks under the decisional bilinear Diffie-Hellman assumption in the standard model. It is practical, and all complexity parameters grow at most logarithmically with the total number of time periods. The scheme can also be extended to achieve security against chosen ciphertext attacks. }, doi = {10.1007/3-540-39200-9_16}, author = {Canetti,R. and Halevi,S. and Katz, Jonathan} } @inbook {12741, title = {Gait Analysis for Human Identification}, booktitle = {Audio- and Video-Based Biometric Person AuthenticationAudio- and Video-Based Biometric Person Authentication}, series = {Lecture Notes in Computer Science}, volume = {2688}, year = {2003}, month = {2003///}, pages = {1058 - 1058}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {Human gait is an attractive modality for recognizing people at a distance. In this paper we adopt an appearance-based approach to the problem of gait recognition. The width of the outer contour of the binarized silhouette of a walking person is chosen as the basic image feature. Different gait features are extracted from the width vector such as the dowsampled, smoothed width vectors, the velocity profile etc. and sequences of such temporally ordered feature vectors are used for representing a person{\textquoteright}s gait. We use the dynamic time-warping (DTW) approach for matching so that non-linear time normalization may be used to deal with the naturally-occuring changes in walking speed. The performance of the proposed method is tested using different gait databases.}, isbn = {978-3-540-40302-9}, url = {http://dx.doi.org/10.1007/3-540-44887-X_82}, author = {Kale, A. and Cuntoor, N. and Yegnanarayana,B. and Rajagopalan, AN and Chellapa, Rama}, editor = {Kittler,Josef and Nixon,Mark} } @conference {16703, title = {A generative probabilistic OCR model for NLP applications}, booktitle = {Proceedings of the 2003 Conference of the North American Chapter of the Association for Computational Linguistics on Human Language Technology-Volume 1}, year = {2003}, month = {2003///}, pages = {55 - 62}, author = {Kolak,O. and Byrne,W. and Resnik, Philip} } @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 {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 {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 {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} } @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} } @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} } @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 {15183, title = {Intrusion-resilient public-key encryption}, journal = {Topics in Cryptology{\textemdash}CT-RSA 2003}, year = {2003}, month = {2003///}, pages = {19 - 32}, abstract = {Exposure of secret keys seems to be inevitable, and may in practice represent the most likely point of failure in a cryptographic system. Recently, the notion of intrusion-resilience [17] (which extends both the notions of forward security [3], [5] and key insulation [11]) was proposed as a means of mitigating the harmful effects that key exposure can have. In this model, time is divided into distinct periods; the public key remains fixed throughout the lifetime of the protocol but the secret key is periodically updated. Secret information is stored by both a user and a base; the user performs all cryptographic operations during a given time period, while the base helps the user periodically update his key. Intrusion-resilient schemes remain secure in the face of multiple compromises of both the user and the base, as long as they are not both compromised simultaneously. Furthermore, in case the user and base are compromised simultaneously, prior time periods remain secure (as in forward-secure schemes). Intrusion-resilient signature schemes have been previously constructed [17], [15]. Here, we give the first construction of an intrusion-resilient publickey encryption scheme, based on the recently-constructed forwardsecure encryption scheme of [8]. We also consider generic transformations for securing intrusion-resilient encryption schemes against chosenciphertext attacks.}, doi = {10.1007/3-540-36563-X_2}, author = {Dodis,Y. and Franklin,M. and Katz, Jonathan and Miyaji,A. and Yung,M.} } @conference {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} } @conference {15146, title = {Lower bounds on the efficiency of encryption and digital signature schemes}, booktitle = {Proceedings of the thirty-fifth annual ACM symposium on Theory of computing}, series = {STOC {\textquoteright}03}, year = {2003}, month = {2003///}, pages = {417 - 425}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {A central focus of modern cryptography is to investigate the weakest possible assumptions under which various cryptographic algorithms exist. Typically, a proof that a "weak" primitive (e.g., a one-way function) implies the existence of a "strong" algorithm (e.g., a private-key encryption scheme) proceeds by giving an explicit construction of the latter from the former. In addition to showing the existence of such a construction, an equally important research direction is to explore the efficiency of such constructions.Among the most fundamental cryptographic algorithms are digital signature schemes and schemes for public- or private-key encryption. Here, we show the first lower bounds on the efficiency of any encryption or signature construction based on black-box access to one-way or trapdoor one-way permutations. If S is the assumed security of the permutation π (i.e., no adversary of size S can invert π on a fraction larger than 1/S of its inputs), our results show that:Any public-key encryption scheme for m-bit messages must query π at least Ω(m log S) times.Any private-key encryption scheme for m-bit messages (with k-bit keys) must query π at least Ω(m-k/log S) times.Any signature verification algorithm for m-bit messages must query π at least Ω(m log S) times.Our bounds match known upper bounds for the case of encryption.We prove our results in an extension of the Impagliazzo-Rudich model. That is, we show that any black-box construction beating our lower bounds would imply the unconditional existence of a one-way function.}, keywords = {black-box, digital signatures, encryption, lower bounds}, isbn = {1-58113-674-9}, doi = {10.1145/780542.780604}, url = {http://doi.acm.org/10.1145/780542.780604}, author = {Gennaro,Rosario and Gertner,Yael and Katz, Jonathan} } @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 {18583, title = {Measuring the effects of internet path faults on reactive routing}, journal = {SIGMETRICS Perform. Eval. Rev.}, volume = {31}, year = {2003}, month = {2003/06//}, pages = {126 - 137}, abstract = {Empirical evidence suggests that reactive routing systems improve resilience to Internet path failures. They detect and route around faulty paths based on measurements of path performance. This paper seeks to understand why and under what circumstances these techniques are effective.To do so, this paper correlates end-to-end active probing experiments, loss-triggered traceroutes of Internet paths, and BGP routing messages. These correlations shed light on three questions about Internet path failures: (1) Where do failures appear? (2) How long do they last? (3) How do they correlate with BGP routing instability?Data collected over 13 months from an Internet testbed of 31 topologically diverse hosts suggests that most path failures last less than fifteen minutes. Failures that appear in the network core correlate better with BGP instability than failures that appear close to end hosts. On average, most failures precede BGP messages by about four minutes, but there is often increased BGP traffic both before and after failures. Our findings suggest that reactive routing is most effective between hosts that have multiple connections to the Internet. The data set also suggests that passive observations of BGP routing messages could be used to predict about 20\% of impending failures, allowing re-routing systems to react more quickly to failures.}, isbn = {0163-5999}, doi = {10.1145/885651.781043}, url = {http://doi.acm.org/10.1145/885651.781043}, author = {Feamster, Nick and Andersen,David G. and Balakrishnan,Hari and Kaashoek,M. Frans} } @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 {17923, title = {Modeling and Rendering of Points with Local Geometry}, journal = {IEEE Transactions on Visualization and Computer Graphics}, volume = {9}, year = {2003}, month = {2003///}, pages = {30 - 42}, abstract = {We present a novel rendering primitive that combines the modeling brevity of points with the rasterization efficiency of polygons. The surface is represented by a sampled collection of Differential Points (DP), each with embedded curvature information that captures the local differential geometry in the vicinity of that point. This is a more general point representation that, for the cost of a few additional bytes, packs much more information per point than the traditional point-based models. This information is used to efficiently render the surface as a collection of local geometries. To use the hardware acceleration, the DPs are quantized into $\big. 256\bigr.$ different types and each sampled point is approximated by the closest quantized DP and is rendered as a normal-mapped rectangle. The advantages to this representation are: 1) The surface can be represented more sparsely compared to other point primitives, 2) it achieves a robust hardware accelerated per-pixel shading{\textemdash}even with no connectivity information, and 3) it offers a novel point-based simplification technique that factors in the complexity of the local geometry. The number of primitives being equal, DPs produce a much better quality of rendering than a pure splat-based approach. Visual appearances being similar, DPs are about two times faster and require about 75 percent less disk space in comparison to splatting primitives.}, keywords = {differential geometry, per-pixel shading., point sample rendering, simplification}, isbn = {1077-2626}, doi = {http://doi.ieeecomputersociety.org/10.1109/TVCG.2003.1175095}, author = {Kalaiah,Aravind and Varshney, Amitabh} } @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} } @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 {13622, title = {Parsing and Tagging of Bilingual Dictionaries}, journal = {TALTraitement Automatique Des Langues}, volume = {44}, year = {2003}, month = {2003///}, pages = {125 - 150}, abstract = {Bilingual dictionaries hold great potential as a source of lexical resources for training and testing automated systems for optical character recognition, machine translation, and cross-language information retrieval. In this paper, we describe a system for extracting term lexicons from printed bilingual dictionaries. Our work was divided into three phases - dictionary segmentation, entry tagging, and generation. In segmentation, pages are divided into logical entries based on structural features learned from selected examples. The extracted entries are associated with functional labels and passed to a tagging module which associates linguistic labels with each word or phrase in the entry. The output of the system is a structure that represents the entries from the dictionary. We have used this approach to parse a variety of dictionaries with both Latin and non-Latin alphabets, and demonstrate the results of term lexicon generation for retrieval from a collection of French news stories using English queries.}, author = {Ma,Huanfeng and Karagol-Ayan,Burcu and David Doermann and Oard, Douglas and Wang,Jianqiang} } @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 {16134, title = {The people in digital libraries: Multifaceted approaches to assessing needs and impact}, booktitle = {Digital library use: Social practice in design and evaluationDigital library use: Social practice in design and evaluation}, year = {2003}, month = {2003///}, pages = {119 - 160}, publisher = {MIT Press}, organization = {MIT Press}, isbn = {9780262025447}, author = {Marchionini,G. and Plaisant, Catherine and Komlodi,A.} } @article {13254, title = {A perturbation method for evaluating background subtraction algorithms}, journal = {Joint IEEE International Workshop on Visual Surveillance and Performance Evaluation of Tracking and Surveillance (VS-PETS)}, year = {2003}, month = {2003///}, abstract = {We introduce a performance evaluation methodology calledPerturbation Detection Rate (PDR) analysis, for measuring performance of background subtraction (BGS) algorithms. It has some advantages over the commonly used Receiver Operation Characteristics (ROC) analysis. Specifically, it does not require foreground targets or knowledge of fore- ground distributions. It measures the sensitivity of a BGS algorithm in detecting low contrast targets against back- ground as a function of contrast, also depending on how well the model captures mixed (moving) background events. We compare four algorithms having similarities and differ- ences. Three are in [2, 3, 5] while the fourth is recently de- veloped, called Codebook BGS. The latter algorithm quan- tizes sample background values at each pixel into code- books which represent a compressed form of background model for a long image sequence. }, author = {Chalidabhongse,T.H. and Kim,K. and Harwood,D. and Davis, Larry S.} } @inbook {18918, title = {Planning in Answer Set Programming Using Ordered Task Decomposition}, booktitle = {KI 2003: Advances in Artificial Intelligence}, series = {Lecture Notes in Computer Science}, volume = {2821}, year = {2003}, month = {2003///}, pages = {490 - 504}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {In this paper we introduce a formalism for solving Hierarchical Task Network ( HTN ) Planning using Answer Set Programming ( ASP ). We consider the formulation of HTN planning as described in the SHOP planning system and define a systematic translation method from SHOP {\textquoteright}s representation of the planning problem into logic programs with negation. We show that our translation is sound and complete : answer sets of the logic program obtained by our translation correspond exactly to the solutions of the planning problem. We compare our method to (1) similar approaches based on non- HTN planning and (2) SHOP , a dedicated planning system. We show that our approach outperforms non- HTN methods and that its performance is better with ASP systems that allow for nonground programs than with ASP systems that require ground programs.}, keywords = {Computer science}, isbn = {978-3-540-20059-8}, url = {http://www.springerlink.com/content/ekt1kye92lh12lpj/abstract/}, author = {Dix,J{\"u}rgen and Kuter,Ugur and Nau, Dana S.}, editor = {G{\"u}nter,Andreas and Kruse,Rudolf and Neumann,Bernd} } @article {12722, title = {Probabilistic recognition of human faces from video}, journal = {Computer Vision and Image Understanding}, volume = {91}, year = {2003}, month = {2003/07//}, pages = {214 - 245}, abstract = {Recognition of human faces using a gallery of still or video images and a probe set of videos is systematically investigated using a probabilistic framework. In still-to-video recognition, where the gallery consists of still images, a time series state space model is proposed to fuse temporal information in a probe video, which simultaneously characterizes the kinematics and identity using a motion vector and an identity variable, respectively. The joint posterior distribution of the motion vector and the identity variable is estimated at each time instant and then propagated to the next time instant. Marginalization over the motion vector yields a robust estimate of the posterior distribution of the identity variable. A computationally efficient sequential importance sampling (SIS) algorithm is developed to estimate the posterior distribution. Empirical results demonstrate that, due to the propagation of the identity variable over time, a degeneracy in posterior probability of the identity variable is achieved to give improved recognition. The gallery is generalized to videos in order to realize video-to-video recognition. An exemplar-based learning strategy is adopted to automatically select video representatives from the gallery, serving as mixture centers in an updated likelihood measure. The SIS algorithm is applied to approximate the posterior distribution of the motion vector, the identity variable, and the exemplar index, whose marginal distribution of the identity variable produces the recognition result. The model formulation is very general and it allows a variety of image representations and transformations. Experimental results using images/videos collected at UMD, NIST/USF, and CMU with pose/illumination variations illustrate the effectiveness of this approach for both still-to-video and video-to-video scenarios with appropriate model choices.}, keywords = {Exemplar-based learning, face recognition, sequential importance sampling, Still-to-video, Time series state space model, Video-to-video}, isbn = {1077-3142}, doi = {10.1016/S1077-3142(03)00080-8}, url = {http://www.sciencedirect.com/science/article/pii/S1077314203000808}, author = {Zhou,Shaohua and Krueger,Volker and Chellapa, Rama} } @conference {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} } @conference {15318, title = {Question answering from the web using knowledge annotation and knowledge mining techniques}, booktitle = {Proceedings of the twelfth international conference on Information and knowledge management}, series = {CIKM {\textquoteright}03}, year = {2003}, month = {2003///}, pages = {116 - 123}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {We present a strategy for answering fact-based natural language questions that is guided by a characterization of real-world user queries. Our approach, implemented in a system called Aranea, extracts answers from the Web using two different techniques: knowledge annotation and knowledge mining. Knowledge annotation is an approach to answering large classes of frequently occurring questions by utilizing semi\-structured and structured Web sources. Knowledge mining is a statistical approach that leverages massive amounts of Web data to overcome many natural language processing challenges. We have integrated these two different paradigms into a question answering system capable of providing users with concise answers that directly address their information needs.}, keywords = {data-redundancy, semistructured data}, isbn = {1-58113-723-0}, doi = {10.1145/956863.956886}, url = {http://doi.acm.org/10.1145/956863.956886}, author = {Jimmy Lin and Katz,Boris} } @article {15322, title = {Question answering techniques for the World Wide Web}, journal = {Tutorial presentation at The 11th Conference of the European Chapter of the Association of Computational Linguistics (EACL-2003)}, year = {2003}, month = {2003///}, abstract = {Question answering systems have become increasingly popular because they deliverusers short, succinct answers instead of overloading them with a large number of irrelevant documents. The vast amount of information readily available on the World Wide Web presents new opportunities and challenges for question answering. In order for question answering systems to benefit from this vast store of useful knowledge, they must cope with large volumes of useless data. Many characteristics of the World Wide Web distinguish Web-based question answering from question answering on closed corpora such as newspaper texts. The Web is vastly larger in size and boasts incredible {\textquotedblleft}data redundancy,{\textquotedblright} which renders it amenable to statistical techniques for answer extraction. A data-driven approach can yield high levels of performance and nicely complements traditional question answering techniques driven by information extraction. In addition to enormous amounts of unstructured text, the Web also contains pockets of structured and semistructured knowledge that can serve as a valuable resource for question answering. By organizing these resources and annotating them with natural language, we can successfully incorporate Web knowledge into question answering systems. This tutorial surveys recent Web-based question answering technology, focusing on two separate paradigms: knowledge mining using statistical tools and knowledge annotation using database concepts. Both approaches can employ a wide spectrum of techniques ranging in linguistic sophistication from simple {\textquotedblleft}bag-of-words{\textquotedblright} treatments to full syntactic parsing. }, author = {Jimmy Lin and Katz,B.} } @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} } @inbook {12739, title = {Robust Face Recognition in the Presence of Clutter}, booktitle = {Audio- and Video-Based Biometric Person AuthenticationAudio- and Video-Based Biometric Person Authentication}, series = {Lecture Notes in Computer Science}, volume = {2688}, year = {2003}, month = {2003///}, pages = {1062 - 1062}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {We propose a new method within the framework of principal component analysis to robustly recognize faces in the presence of clutter. The traditional eigenface recognition method performs poorly when confronted with the more general task of recognizing faces appearing against a background. It misses faces completely or throws up many false alarms. We argue in favor of learning the distribution of background patterns and show how this can be done for a given test image. An eigenbackground space is constructed and this space in conjunction with the eigenface space is used to impart robustness in the presence of background. A suitable classifier is derived to distinguish non-face patterns from faces. When tested on real images, the performance of the proposed method is found to be quite good.}, isbn = {978-3-540-40302-9}, url = {http://dx.doi.org/10.1007/3-540-44887-X_1}, author = {Rajagopalan, AN and Chellapa, Rama and Koterba,Nathan}, editor = {Kittler,Josef and Nixon,Mark} } @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} } @article {15074, title = {Scalable protocols for authenticated group key exchange}, journal = {Advances in Cryptology-CRYPTO 2003}, year = {2003}, month = {2003///}, pages = {110 - 125}, abstract = {We consider the fundamental problem of authenticated group key exchange among n parties within a larger and insecure public network. A number of solutions to this problem have been proposed; however, all provably-secure solutions thus far are not scalable and, in particular, require n rounds. Our main contribution is the first scalable protocol for this problem along with a rigorous proof of security in the standard model under the DDH assumption; our protocol uses a constant number of rounds and requires only O(1) modular exponentiations per user (for key derivation). Toward this goal and of independent interest, we first present a scalable compiler that transforms any group key-exchange protocol secure against a passive eavesdropper to an authenticated protocol which is secure against an active adversary who controls all communication in the network. This compiler adds only one round and O(1) communication (per user) to the original scheme. We then prove secure {\textemdash} against a passive adversary {\textemdash} a variant of the two-round group key-exchange protocol of Burmester and Desmedt. Applying our compiler to this protocol results in a provably-secure three-round protocol for authenticated group key exchange which also achieves forward secrecy.}, doi = {10.1007/978-3-540-45146-4_7}, author = {Katz, Jonathan and Yung,M.} } @article {14819, title = {A search engine for 3D models}, journal = {ACM Trans. Graph.}, volume = {22}, year = {2003}, month = {2003/01//}, pages = {83 - 105}, abstract = {As the number of 3D models available on the Web grows, there is an increasing need for a search engine to help people find them. Unfortunately, traditional text-based search techniques are not always effective for 3D data. In this article, we investigate new shape-based search methods. The key challenges are to develop query methods simple enough for novice users and matching algorithms robust enough to work for arbitrary polygonal models. We present a Web-based search engine system that supports queries based on 3D sketches, 2D sketches, 3D models, and/or text keywords. For the shape-based queries, we have developed a new matching algorithm that uses spherical harmonics to compute discriminating similarity measures without requiring repair of model degeneracies or alignment of orientations. It provides 46 to 245\% better performance than related shape-matching methods during precision--recall experiments, and it is fast enough to return query results from a repository of 20,000 models in under a second. The net result is a growing interactive index of 3D models available on the Web (i.e., a Google for 3D models).}, keywords = {Search engine, shape matching, shape representation, shape retrieval}, isbn = {0730-0301}, doi = {10.1145/588272.588279}, url = {http://doi.acm.org/10.1145/588272.588279}, author = {Funkhouser,Thomas and Min,Patrick and Kazhdan,Michael and Chen,Joyce and Halderman,Alex and Dobkin,David and Jacobs, David W.} } @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.} } @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 {18870, title = {SHOP2: An HTN planning system}, journal = {J. Artif. Intell. Res. (JAIR)}, volume = {20}, year = {2003}, month = {2003///}, pages = {379 - 404}, abstract = {The SHOP2 planning system received one of the awards for distinguished performance in the 2002 International Planning Competition. This paper describes the features of SHOP2 which enabled it to excel in the competition, especially those aspects of SHOP2 that deal with temporal and metric planning domains.}, url = {https://www.aaai.org/Papers/JAIR/Vol20/JAIR-2013.pdf}, author = {Nau, Dana S. and Au,T. C and Ilghami,O. and Kuter,U. and Murdock,J. W. and Wu,D. and Yaman,F.} } @conference {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.} } @conference {17938, title = {Statistical point geometry}, booktitle = {Proceedings of the 2003 Eurographics/ACM SIGGRAPH symposium on Geometry processing}, series = {SGP {\textquoteright}03}, year = {2003}, month = {2003///}, pages = {107 - 115}, publisher = {Eurographics Association}, organization = {Eurographics Association}, address = {Aire-la-Ville, Switzerland, Switzerland}, abstract = {We propose a scheme for modeling point sample geometry with statistical analysis. In our scheme we depart from the current schemes that deterministically represent the attributes of each point sample. We show how the statistical analysis of a densely sampled point model can be used to improve the geometry bandwidth bottleneck and to do randomized rendering without sacrificing visual realism. We first carry out a hierarchical principal component analysis (PCA) of the model. This stage partitions the model into compact local geometries by exploiting local coherence. Our scheme handles vertex coordinates, normals, and color. The input model is reconstructed and rendered using a probability distribution derived from the PCA analysis. We demonstrate the benefits of this approach in all stages of the graphics pipeline: (1) orders of magnitude improvement in the storage and transmission complexity of point geometry, (2) direct rendering from compressed data, and (3) view-dependent randomized rendering.}, isbn = {1-58113-687-0}, url = {http://dl.acm.org/citation.cfm?id=882370.882385}, author = {Kalaiah,Aravind and Varshney, Amitabh} } @article {12430, title = {A Survey of Shape Similarity Assessment Algorithms for Product Design and Manufacturing Applications}, journal = {Journal of Computing and Information Science in EngineeringJ. Comput. Inf. Sci. Eng.}, volume = {3}, year = {2003}, month = {2003/06/00/}, pages = {109 - 118}, keywords = {CAD, computational geometry, production engineering computing, spatial reasoning}, doi = {10.1115/1.1577356}, url = {http://link.aip.org/link/?CIS/3/109/1}, author = {Cardone, Antonio and Gupta, Satyandra K. and Karnik,Mukul} } @article {13657, title = {Tagging and Parsing of Bilingual Dictionary}, volume = {LAMP-TR-106,CFAR-TR-991,CS-TR-4529,UMIACS-TR-2003-97}, year = {2003}, month = {2003/09//}, institution = {University of Maryland, College Park}, abstract = {Bilingual dictionaries hold great potential as a source of lexical resources for training and testing automated systems for optical character recognition, machine translation, and cross-language information retrieval. In this paper, we describe a system for extracting term lexicons from printed bilingual dictionaries. Our work was divided into three phases - dictionary segmentation, entry tagging, and generation. In segmentation, pages are divided into logical entries based on structural features learned from selected examples. The extracted entries are associated with functional labels and passed to a tagging module which associates linguistic labels with each word or phrase in the entry. The output of the system is a structure that represents the entries from the dictionary. We have used this approach to parse a variety of dictionaries with both Latin and non-Latin alphabets, and demonstrate the results of term lexicon generation for retrieval from a collection of French news stories using English queries.}, author = {Ma,Huanfeng and Karagol-Ayan,Burcu and David Doermann and Oard, Douglas and Wang,Jianqiang} } @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.} } @inbook {18603, title = {Thwarting Web Censorship with Untrusted Messenger Discovery}, booktitle = {Privacy Enhancing TechnologiesPrivacy Enhancing Technologies}, series = {Lecture Notes in Computer Science}, volume = {2760}, year = {2003}, month = {2003///}, pages = {125 - 140}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {All existing anti-censorship systems for the Web rely on proxies to grant clients access to censored information. Therefore, they face the proxy discovery problem : how can clients discover the proxies without having the censor discover and block these proxies? To avoid widespread discovery and blocking, proxies must not be widely published and should be discovered in-band. In this paper, we present a proxy discovery mechanism called keyspace hopping that meets this goal. Similar in spirit to frequency hopping in wireless networks, keyspace hopping ensures that each client discovers only a small fraction of the total number of proxies. However, requiring clients to independently discover proxies from a large set makes it practically impossible to verify the trustworthiness of every proxy and creates the possibility of having untrusted proxies. To address this, we propose separating the proxy into two distinct components{\textemdash}the messenger , which the client discovers using keyspace hopping and which simply acts as a gateway to the Internet; and the portal , whose identity is widely-published and whose responsibility it is to interpret and serve the client{\textquoteright}s requests for censored content. We show how this separation, as well as in-band proxy discovery, can be applied to a variety of anti-censorship systems.}, keywords = {Computer science}, isbn = {978-3-540-20610-1}, url = {http://www.springerlink.com/content/1gg8p94deqek968t/abstract/}, author = {Feamster, Nick and Balazinska,Magdalena and Wang,Winston and Balakrishnan,Hari and Karger,David}, editor = {Dingledine,Roger} } @conference {15096, title = {Toward secure key distribution in truly ad-hoc networks}, booktitle = {Applications and the Internet Workshops, 2003. Proceedings. 2003 Symposium on}, year = {2003}, month = {2003/01//}, pages = {342 - 346}, abstract = {Ad-hoc networks - and in particular wireless mobile ad-hoc networks $have unique characteristics and constraints that make traditional cryptographic mechanisms and assumptions inappropriate. In particular it may not be warranted to assume pre-existing shared secrets between members of the network or the presence of a common PKI. Thus, the issue of key distribution in ad-hoc networks represents an important problem. Unfortunately, this issue has been largely ignored; as an example, most protocols for secure ad-hoc routing assume that key distribution has already taken place. Traditional key distribution schemes either do not apply in an ad-hoc scenario or are not efficient enough for small, resource-constrained devices. We propose to combine efficient techniques from identity-based (ID-based) and threshold cryptography to provide a mechanism that enables flexible and efficient key distribution while respecting the constraints of ad-hoc networks. We also discuss the available mechanisms and their suitability for the proposed task.}, keywords = {ad, ad-hoc, cryptography;, distribution;, hoc, identity-based, key, mobile, network, networks;, routing;, secure, security;, Telecommunication, threshold, wireless}, doi = {10.1109/SAINTW.2003.1210183}, author = {Khalili,A. and Katz, Jonathan and Arbaugh, William A.} } @conference {12728, title = {Towards a view invariant gait recognition algorithm}, booktitle = {Proceedings. IEEE Conference on Advanced Video and Signal Based Surveillance, 2003.}, year = {2003}, month = {2003/07//}, pages = {143 - 150}, abstract = {Human gait is a spatio-temporal phenomenon and typifies the motion characteristics of an individual. The gait of a person is easily recognizable when extracted from a side-view of the person. Accordingly, gait-recognition algorithms work best when presented with images where the person walks parallel to the camera image plane. However, it is not realistic to expect this assumption to be valid in most real-life scenarios. Hence, it is important to develop methods whereby the side-view can be generated from any other arbitrary view in a simple, yet accurate, manner. This is the main theme of the paper. We show that if the person is far enough from the camera, it is possible to synthesize a side view (referred to as canonical view) from any other arbitrary view using a single camera. Two methods are proposed for doing this: (i) using the perspective projection model; (ii) using the optical flow based structure from motion equations. A simple camera calibration scheme for this method is also proposed. Examples of synthesized views are presented. Preliminary testing with gait recognition algorithms gives encouraging results. A by-product of this method is a simple algorithm for synthesizing novel views of a planar scene.}, keywords = {(access, algorithm;, analysis;, Biometrics, biometrics;, Calibration, calibration;, camera, canonical, control);, equations;, flow;, Gait, gait;, human, image, invariant, model;, MOTION, optical, perspective, phenomenon;, projection, recognition, scheme;, sequences;, spatio-temporal, view, view;}, doi = {10.1109/AVSS.2003.1217914}, author = {Kale, A. and Chowdhury, A.K.R. and Chellapa, Rama} } @conference {19509, title = {Towards On-chip Fault-tolerant Communication}, booktitle = {ASP-DAC {\textquoteright}03 Proceedings of the 2003 Asia and South Pacific Design Automation Conference}, series = {ASP-DAC {\textquoteright}03}, year = {2003}, month = {2003///}, pages = {225 - 232}, publisher = {ACM}, organization = {ACM}, abstract = {As CMOS technology scales down into the deep-submicron (DSM) domain, devices and interconnects are subject to new types of malfunctions and failures that are harder to predict and avoid with the current system-on-chip (SoC) design methodologies. Relaxing the requirement of 100\% correctness in operation drastically reduces the costs of design but, at the same time, requires SoCs be designed with some degree of system-level fault-tolerance. In this paper, we introduce a high-level model of DSM failure patterns and propose a new communication paradigm for SoCs, namely stochastic communication. Specifically, for a generic tile-based architecture, we propose a randomized algorithm which not only separates computation from communication, but also provides the required fault-tolerance to on-chip failures. This new technique is easy and cheap to implement in SoCs that integrate a large number of communicating IP cores.}, isbn = {0-7803-7660-9}, url = {http://doi.acm.org/10.1145/1119772.1119817}, author = {Tudor Dumitras and Kerner, Sam and M\uarculescu, Radu} } @conference {12299, title = {On the use of flow migration for handling short-term overloads}, booktitle = {Global Telecommunications Conference, 2003. GLOBECOM {\textquoteright}03. IEEE}, volume = {6}, year = {2003}, month = {2003/12//}, pages = {3108 - 3112 vol.6 - 3108 - 3112 vol.6}, abstract = {In this work, we investigate flow migration as a mechanism to sustain QoS to network users during short-term overloads in the context of an MPLS IP network. We experiment with three different control techniques: static long-term optimal mapping of flows to LSPs; on-line locally optimal mapping of flows to LSPs at flow set-up time; and dynamic flow migration in response to transient congestion. These techniques are applicable over different timescales, have different run-time overheads, and require different levels of monitoring and control software inside the network. We present results both from detailed simulations and a complete implementation using software IP routers. We use voice-over-IP as our test application, and show that if end-to-end quality is to be maintained during short unpredictable bursts of high load, then a fast-timescale control such as migration is required.}, keywords = {computing;, CONGESTION, congestion;, CONTROL, control;, dynamic, end-to-end, engineering, fast-timescale, flow, Internet, IP, label, long-term, mapping;, migration;, MPLS, multiprotocol, network, network;, networks;, of, optimal, overloads;, protocol;, QoS;, QUALITY, quality;, routers;, routing;, service;, set-up, short-term, software, software;, static, switching;, Telecommunication, telephony;, time;, transient, voice-over-IP;}, doi = {10.1109/GLOCOM.2003.1258807}, author = {Kuo,Kuo-Tung and Phuvoravan,S. and Bhattacharjee, Bobby and Jun La,R. and Shayman,M. and Chang,Hyeong Soo} } @article {13686, title = {Use of OCR for Rapid Construction of Bilingual Lexicons}, volume = {LAMP-TR-104,CFAR-TR-986,CS-TR-4510,UMIACS-TR-2003-78}, year = {2003}, month = {2003/07//}, institution = {University of Maryland, College Park}, abstract = {This paper describes an approach to analyzing the lexical structure of OCRed bilingual dictionaries to construct resources suited for machine translation of low-density languages, where online resources are limited. A rule-based and an HMM-based method are used for rapid construction of MT lexicons based on systematic structural clues provided in the original dictionary. We evaluate the effectiveness of our techniques, concluding that: (1) the rule-based method performs better on dictionaries with a simple structure; (2) the stochastic method performs better on dictionaries with an enriched structure; (3) regardless of the degree of dictionary richness, the rule-based method gives better results for phrasal entries than for single-word entries; and (4) Our resulting bilingual lexicons are comprehensive enough to provide reasonable MT results when compared to human-constructed lexicons.}, author = {Karagol-Ayan,Burcu and David Doermann and Dorr, Bonnie J} } @article {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 {13690, title = {Video Analysis for Pervasive Environments}, booktitle = {ICME}, volume = {2}, year = {2003}, month = {2003///}, pages = {161 - 164}, author = {David Doermann and Karunanidhi,A.} } @conference {12727, title = {Video based rendering of planar dynamic scenes}, booktitle = {Multimedia and Expo, 2003. ICME {\textquoteright}03. Proceedings. 2003 International Conference on}, volume = {1}, year = {2003}, month = {2003/07//}, pages = {I - 477-80 vol.1 - I - 477-80 vol.1}, abstract = {In this paper, we propose a method to synthesize arbitrary views of a planar scene from a monocular video sequence of it. The 3-D direction of motion of the object is robustly estimated from the video sequence. Given this direction any other view of the object can be synthesized through a perspective projection approach, under assumptions of planarity. If the distance of the object from the camera is large, a planar approximation is reasonable even for non-planar scenes. Such a method has many important applications, one of them being gait recognition where a side view of the person is required. Our method can be used to synthesize the side-view of the person in case he/she does not present a side view to the camera. Since the planarity assumption is often an approximation, the effects of non-planarity can lead to inaccuracies in rendering and needs to be corrected for. Regions where this happens are examined and a simple technique based on weak perspective approximation is proposed to offset rendering inaccuracies. Examples of synthesized views using our method and performance evaluation are presented.}, keywords = {(computer, 3D, analysis;, approximation;, based, camera;, cameras;, direction;, dynamic, graphics);, image, monocular, MOTION, perspective, planar, processing;, rendering, rendering;, scenes;, sequence;, sequences;, signal, video, weak}, doi = {10.1109/ICME.2003.1220958}, author = {Kale, A. and Chowdhury, A.K.R. and Chellapa, Rama} } @article {12742, title = {VIDEO SYNTHESIS OF ARBITRARY VIEWS FOR APPROXIMATELY PLANAR SCENES}, journal = {IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS SPEECH AND SIGNAL PROCESSING}, volume = {3}, year = {2003}, month = {2003///}, author = {Chowdhury, A.R. and Kale, A. and Chellapa, Rama} } @conference {12735, title = {Video synthesis of arbitrary views for approximately planar scenes}, booktitle = {Acoustics, Speech, and Signal Processing, 2003. Proceedings. (ICASSP {\textquoteright}03). 2003 IEEE International Conference on}, volume = {3}, year = {2003}, month = {2003/04//}, pages = {III - 497-500 vol.3 - III - 497-500 vol.3}, abstract = {In this paper, we propose a method to synthesize arbitrary views of a planar scene, given a monocular video sequence. The method is based on the availability of knowledge of the angle between the original and synthesized views. Such a method has many important applications, one of them being gait recognition. Gait recognition algorithms rely on the availability of an approximate side-view of the person. From a realistic viewpoint, such an assumption is impractical in surveillance applications and it is of interest to develop methods to synthesize a side view of the person, given an arbitrary view. For large distances from the camera, a planar approximation for the individual can be assumed. In this paper, we propose a perspective projection approach for recovering the direction of motion of the person purely from the video data, followed by synthesis of a new video sequence at a different angle. The algorithm works purely in the image and video domain, though 3D structure plays an implicit role in its theoretical justification. Examples of synthesized views using our method and performance evaluation are presented.}, keywords = {(access, 3D, applications;, approach;, approximately, approximation;, arbitrary, Biometrics, control);, data;, direction, estimation;, evaluation;, Gait, image, monocular, MOTION, performance, perspective, planar, processing;, projection, recognition;, recovery;, scenes;, sequence;, sequences;, side, signal, structure;, Surveillance, surveillance;, synthesis;, synthesized, video, view, views;}, doi = {10.1109/ICASSP.2003.1199520}, author = {Chowdhury, A.K.R. and Kale, A. and Chellapa, Rama} } @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} } @inbook {16130, title = {Visualizing websites using a hierarchical table of contents browser: WebTOC}, booktitle = {The craft of information visualization: readings and reflectionsThe craft of information visualization: readings and reflections}, year = {2003}, month = {2003///}, pages = {438 - 438}, publisher = {Morgan Kaufmann Publishers Inc.}, organization = {Morgan Kaufmann Publishers Inc.}, isbn = {9781558609150}, author = {Plaisant, Catherine and Marchionini,G. and Komlodi,A.} } @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} } @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} } @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} } @inbook {14589, title = {1.375-Approximation Algorithm for Sorting by Reversals}, booktitle = {Algorithms {\textemdash} ESA 2002Algorithms {\textemdash} ESA 2002}, series = {Lecture Notes in Computer Science}, volume = {2461}, year = {2002}, month = {2002///}, pages = {401 - 408}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {Analysis of genomes evolving by inversions leads to a general combinatorial problem of Sorting by Reversals , MIN-SBR, the problem of sorting a permutation by a minimum number of reversals. Following a series of preliminary results, Hannenhalli and Pevzner developed the first exact polynomial time algorithm for the problem of sorting signed permutations by reversals, and a polynomial time algorithm for a special case of unsigned permutations. The best known approximation algorithm for MIN-SBR, due to Christie, gives a performance ratio of 1.5. In this paper, by exploiting the polynomial time algorithm for sorting signed permutations and by developing a new approximation algorithm for maximum cycle decomposition of breakpoint graphs, we design a new 1.375-algorithm for the MIN-SBR problem.}, isbn = {978-3-540-44180-9}, url = {http://dx.doi.org/10.1007/3-540-45749-6_21}, author = {Berman,Piotr and Hannenhalli, Sridhar and Karpinski,Marek}, editor = {M{\"o}hring,Rolf and Raman,Rajeev} } @conference {12765, title = {3D face reconstruction from video using a generic model}, booktitle = {Multimedia and Expo, 2002. ICME {\textquoteright}02. Proceedings. 2002 IEEE International Conference on}, volume = {1}, year = {2002}, month = {2002///}, pages = {449 - 452 vol.1 - 449 - 452 vol.1}, abstract = {Reconstructing a 3D model of a human face from a video sequence is an important problem in computer vision, with applications to recognition, surveillance, multimedia etc. However, the quality of 3D reconstructions using structure from motion (SfM) algorithms is often not satisfactory. One common method of overcoming this problem is to use a generic model of a face. Existing work using this approach initializes the reconstruction algorithm with this generic model. The problem with this approach is that the algorithm can converge to a solution very close to this initial value, resulting in a reconstruction which resembles the generic model rather than the particular face in the video which needs to be modeled. We propose a method of 3D reconstruction of a human face from video in which the 3D reconstruction algorithm and the generic model are handled separately. A 3D estimate is obtained purely from the video sequence using SfM algorithms without use of the generic model. The final 3D model is obtained after combining the SfM estimate and the generic model using an energy function that corrects for the errors in the estimate by comparing local regions in the two models. The optimization is done using a Markov chain Monte Carlo (MCMC) sampling strategy. The main advantage of our algorithm over others is that it is able to retain the specific features of the face in the video sequence even when these features are different from those of the generic model. The evolution of the 3D model through the various stages of the algorithm is presented.}, keywords = {3D, algorithm;, algorithms;, analysis;, Carlo, chain, Computer, Face, from, function;, generic, human, image, Markov, MCMC, methods;, model;, Monte, MOTION, optimisation;, OPTIMIZATION, processes;, processing;, recognition;, reconstruction, reconstruction;, sampling;, sequence;, sequences;, SfM, signal, structure, surveillance;, video, vision;}, doi = {10.1109/ICME.2002.1035815}, author = {Chowdhury, A.R. and Chellapa, Rama and Krishnamurthy, S. and Vo, T.} } @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} } @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} } @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} } @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} } @conference {15307, title = {Annotating the semantic web using natural language}, booktitle = {Proceedings of the 2nd workshop on NLP and XML - Volume 17}, series = {NLPXML {\textquoteright}02}, year = {2002}, month = {2002///}, pages = {1 - 8}, publisher = {Association for Computational Linguistics}, organization = {Association for Computational Linguistics}, address = {Stroudsburg, PA, USA}, abstract = {Because the ultimate purpose of the Semantic Web is to help users better locate, organize, and process content, we believe that it should be grounded in the information access method humans are most comfortable with---natural language. However, the Resource Description Framework (RDF), the foundation of the Semantic Web, was designed to be easily processed by computers, not humans. To render RDF more friendly to humans, we propose to augment it with natural language annotations, or metadata written in everyday language. We argue that natural language annotations, parsed into computer-readable representations, are not only intuitive and effective, but can also accelerate the pace with which the Semantic Web is being adopted. We believe that our technology can facilitate a happy marriage between natural language technology and the Semantic Web vision.}, doi = {10.3115/1118808.1118816}, url = {http://dx.doi.org/10.3115/1118808.1118816}, author = {Katz,Boris and Jimmy Lin} } @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 {18737, title = {Automated design of multi-stage molds for manufacturing multi-material objects}, journal = {Journal of Mechanical Design}, volume = {124}, year = {2002}, month = {2002///}, pages = {399 - 399}, author = {Kumar,M. and Gupta,S.K.} } @article {15189, title = {Bounds on the efficiency of encryption and digital signatures}, volume = {2002-22}, year = {2002}, month = {2002///}, institution = {Rutgers University}, abstract = {A central focus of modern cryptography is to investigate the weakest possible assumptionsunder which various cryptographic algorithms exist. Typically, a proof that a {\textquotedblleft}weak{\textquotedblright} prim- itive (e.g., a one-way function) implies the existence of some {\textquotedblleft}strong{\textquotedblright} algorithm (e.g., a private-key encryption scheme) proceeds by giving an explicit construction of the latter from the former. Beyond merely showing such a construction, an equally important research direction is to explore the efficiency of the construction. One might argue that this line of research has become even more important now that minimal assumptions are known for many (but not all) algorithms of interest. Protocols for encryption (in both the public- and private-key setting) and for digital signatures are fundamental to cryptography. In this work, we show the first lower bounds on the efficiency of constructions of these protocols based on black-box access to one-way or trapdoor one-way permutations. If S is the assumed security of the permutation π (i.e., no adversary of size S can {\textquotedblleft}break{\textquotedblright} π in the appropriate sense on a fraction larger than 1/S of its inputs), our results show that: {\textbullet} Any public-key encryption algorithm for m-bit messages must query π at least {\textohm}(m/log S) times. This matches the known upper bound. {\textbullet} Any private-key encryption algorithm for m-bit messages which uses a k-bit key must query π at least {\textohm}(m-k logS ) times. This matches the known upper bound. {\textbullet} Any signature verification algorithm for m-bit messages must query π at least {\textohm}(m/log S) times. We prove our results in an extension of the Impagliazzo-Rudich model. That is, we show that any black-box construction beating our lower bounds would imply the unconditional existence of a one-way function. }, author = {Gennaro,R. and Gertner,Y. and Katz, Jonathan} } @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.} } @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 {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.} } @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} } @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} } @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} } @mastersthesis {15192, title = {Efficient Cryptographic Protocols Preventing {\textquotedblleft}Man-in-the-Middle{\textquotedblright} Attacks}, year = {2002}, month = {2002///}, school = {Columbia University}, abstract = {In the analysis of many cryptographic protocols, it is useful to distinguish two classes of attacks:passive attacks in which an adversary eavesdrops on messages sent between honest users and active attacks (i.e., {\textquotedblleft}man-in-the-middle{\textquotedblright} attacks) in which {\textemdash} in addition to eavesdropping {\textemdash} the adversary inserts, deletes, or arbitrarily modifies messages sent from one user to another. Passive attacks are well characterized (the adversary{\textquoteright}s choices are inherently limited) and techniques for achieving security against passive attacks are relatively well understood. Indeed, cryptographers have long focused on methods for countering passive eavesdropping attacks, and much work in the 1970{\textquoteright}s and 1980{\textquoteright}s has dealt with formalizing notions of security and providing provably-secure solutions for this setting. On the other hand, active attacks are not well characterized and precise modeling has been difficult. Few techniques exist for dealing with active attacks, and designing practical protocols secure against such attacks remains a challenge. This dissertation considers active attacks in a variety of settings and provides new, provably- secure protocols preventing such attacks. Proofs of security are in the standard cryptographic model and rely on well-known cryptographic assumptions. The protocols presented here are efficient and practical, and may find application in real-world systems. }, author = {Katz, Jonathan} } @article {11912, title = {Efficient Data Processing using Cross Layer Hints}, journal = {Technical Reports from UMIACS, UMIACS-TR-2002-59}, year = {2002}, month = {2002/12/19/}, abstract = {Conventional network stacks define a layered architecture, whereeach layer implements a set of services and exports a well-defined interface to be used by its immediate upper layer. A key design choice of the layered architecture has been to provide isolation between the functional modules of distinct layers. While such an architecture provides an useful abstraction for system development, the strict isolation of this layered architecture limits the flexibility of tailoring the behavior of the lower layers of the stack to the needs of the application. In this paper we define a new architecture, called X-Tags, which allows flexible interaction between layers for cooperative data processing without impacting the isolation property. In this architecture, applications use special tags to provide semantic hints for data processing to lower layers. We motivate the usefulness of this architecture by describing ts applicability to some emerging applications. UMIACS-TR-2002-59 }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/1211}, author = {Banerjee,Suman and Agrawala, Ashok K. and Kramer,Michael J} } @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} } @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} } @conference {18942, title = {Evaluating translational correspondence using annotation projection}, series = {ACL {\textquoteright}02}, year = {2002}, month = {2002///}, pages = {392 - 399}, publisher = {Association for Computational Linguistics}, organization = {Association for Computational Linguistics}, address = {Stroudsburg, PA, USA}, abstract = {Recently, statistical machine translation models have begun to take advantage of higher level linguistic structures such as syntactic dependencies. Underlying these models is an assumption about the directness of translational correspondence between sentences in the two languages; however, the extent to which this assumption is valid and useful is not well understood. In this paper, we present an empirical study that quantifies the degree to which syntactic dependencies are preserved when parses are projected directly from English to Chinese. Our results show that although the direct correspondence assumption is often too restrictive, a small set of principled, elementary linguistic transformations can boost the quality of the projected Chinese parses by 76\% relative to the unimproved baseline.}, doi = {10.3115/1073083.1073149}, url = {http://dx.doi.org/10.3115/1073083.1073149}, author = {Hwa,Rebecca and Resnik, Philip and Weinberg, Amy and Kolak,Okan} } @conference {16669, title = {Evaluating translational correspondence using annotation projection}, booktitle = {Proceedings of the 40th Annual Meeting on Association for Computational Linguistics}, year = {2002}, month = {2002///}, pages = {392 - 399}, author = {Hwa,R. and Resnik, Philip and Weinberg, Amy and Kolak,O.} } @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} } @conference {15268, title = {Experimental Construction of Very Large Scale DNA Databases with Associative Search}, booktitle = {DNA computing: 7th International Workshop on DNA-Based Computers, DNA 7, Tampa, FL, USA, June 10-13, 2001: revised papers}, volume = {7}, year = {2002}, month = {2002///}, pages = {231 - 231}, author = {Reif,J. H and LaBean,T. H and Pirrung,M. and Rana,V. S and Guo,B. and Kingsford, Carl and Wickham,G. S} } @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 {12749, title = {Face recognition from video: a CONDENSATION approach}, booktitle = {Automatic Face and Gesture Recognition, 2002. Proceedings. Fifth IEEE International Conference on}, year = {2002}, month = {2002/05//}, pages = {221 - 226}, abstract = {The aim of this work is to investigate how to exploit the temporal information in a video sequence for the task of face recognition. Following the approach in (Li and Chellappa, 2000), we propose a probabilistic model parameterized by a tracking state vector and a recognizing identity variable, simultaneously characterizing the kinematics and identity of humans. We then invoke a CONDENSATION (Isard and Blake, 1996) approach to provide a numerical solution to the model. Once the joint posterior distribution of the state vector and the identity variable is estimated, we marginalize it over the state vector to yield a robust estimate of the posterior distribution of the identity variable. Due to the propagation of identity and dynamics, a degeneracy in the posterior distribution of the identity variable is achieved to give improved recognition. This evolving behavior is characterized using changes in entropy. The effectiveness of this approach is illustrated using experimental results on low-resolution video data.}, keywords = {algorithm;experimental, approach;Sequential, CONDENSATION, data;probabilistic, distribution;kinematics;low-resolution, importance, information;tracking, model;state, posterior, recognition;image, recognition;joint, resolution;image, results;face, sampling, sampling;probability;, sequence;face, sequences;importance, state, vector;temporal, vector;video, video}, doi = {10.1109/AFGR.2002.1004158}, author = {Zhou,Shaohua and Krueger, V. and Chellapa, Rama} } @article {15191, title = {A forward-secure public-key encryption scheme}, year = {2002}, month = {2002///}, institution = {Technical Report 2002/060, Cryptology ePrint Archive, 2002}, author = {Katz, Jonathan} } @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.} } @conference {16331, title = {A history-based test prioritization technique for regression testing in resource constrained environments}, booktitle = {Proceedings of the 24th international conference on Software engineering - ICSE {\textquoteright}02}, year = {2002}, month = {2002///}, pages = {119 - 119}, address = {Orlando, Florida}, doi = {10.1145/581339.581357}, url = {http://dl.acm.org/citation.cfm?id=581357}, author = {Kim,Jung-Min and Porter, Adam} } @article {18906, title = {HTN Planning in Answer Set Programming}, volume = {UMIACS-TR-2002-18}, year = {2002}, month = {2002/05/22/}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {In this paper we introduce a formalism for solving Hierarchical Task NEtwork(HTN) Planning using Answer Set Programming (ASP). The ASP paradigm evolved out of the stable semantics for logic programs in recent years and is strongly related to nonmonotonic logics. We consider the formulation of HTM planning as described in the SHOP planning system and define a systematic translation method from SHOP{\textquoteright}s representation of the planning problems into logic programs with negation. We show that our translation is sound and complete: answer sets of the logic programs obtained by our translation correspond exactly to the solutions of the planning problems. Our approach does not rly on a particular system for computing answer sets. It can therefore serve as a means to evaluate ASP systems by using well-established benchmarks from the planning community. We tested our method on various such benchmarks and used smodels and DLV for computing answer sets. We compared our method to (1) similar approaches based on non-HTN planning and (2) SHOP, a dedicated planning system. We show that our approach outperforms non-HTN methods and that its performance is closer to that of SHOP, when we are using ASP systems which allow for nonground programs. (Also UMIACS-TR-2002-18) }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu//handle/1903/1182}, author = {Dix,Jurgen and Kuter,Ugur and Nau, Dana S.} } @conference {12762, title = {Identification of humans using gait}, booktitle = {IEEE Transactions on Image Processing}, year = {2002}, month = {2002///}, abstract = {We propose a view-based approach to recognize humans from their gait. Two different imagefeatures 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. }, author = {Kale, A. and Rajagopalan, AN and Cuntoor, N. and Krueger, V. and Chellapa, Rama} } @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.} } @conference {13053, title = {The importance of lexicalized syntax models for natural language generation tasks}, booktitle = {Proc. of INLG}, year = {2002}, month = {2002///}, pages = {9 - 16}, author = {Daum{\'e}, Hal and Knight,K. and Langkilde-Geary,I. and Marcu,D. and Yamada,K.} } @article {15101, title = {Incremental unforgeable encryption}, journal = {Fast Software Encryption}, year = {2002}, month = {2002///}, pages = {317 - 325}, abstract = {The recent selection of the AES block cipher to replace DES has generated interest in developing new modes of operation to supplement the modes defined as part of the DES standard [1,16,23]. We initiate the study of modes of encryption which are both incremental and unforgeable, and point out a number of applications for modes meeting these requirements. We also propose three specific modes achieving these goals, and discuss the strengths and weaknesses of each.}, doi = {10.1007/3-540-45473-X_9}, author = {Buonanno,E. and Katz, Jonathan and Yung,M.} } @article {18489, title = {Infranet: Circumventing web censorship and surveillance}, journal = {Proceedings of the 11th USENIX Security Symposium}, year = {2002}, month = {2002///}, pages = {247 - 262}, abstract = {An increasing number of countries and companies routinely block or monitor access to parts of the Internet. To counteract these measures, we propose Infranet, a system that enables clients to surreptitiously retrieve sensitive content via cooperating Web servers distributed across the global Internet. These Infranet servers provide clients access to censored sites while continuing to host normal uncensored content. Infranet uses a tunnel protocol that provides a covert communication channel between its clients and servers, modulated over standard HTTP transactions that resemble innocuous Web browsing. In the upstream direction, Infranet clients send covert messages to Infranet servers by associating meaning to the sequence of HTTP requests being made. In the downstream direction, Infranet servers return content by hiding censored data in uncensored images using steganographic techniques. We describe the design, a prototype implementation, security properties, and performance of Infranet. Our security analysis shows that Infranet can successfully circumvent several sophisticated censoring techniques.}, author = {Feamster, Nick and Balazinska,M. and Harfst,G. and Balakrishnan,H. and Karger,D.} } @article {12320, title = {Intermediate representations for design automation of multiprocessor DSP systems}, journal = {Design Automation for Embedded Systems}, volume = {7}, year = {2002}, month = {2002///}, pages = {307 - 323}, author = {Bambha,N. and Kianzad,V. and Khandelia,M. and Bhattacharyya, Shuvra S.} } @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.} } @article {15094, title = {Key-insulated public key cryptosystems}, journal = {Advances in Cryptology{\textemdash}Eurocrypt 2002}, year = {2002}, month = {2002///}, pages = {65 - 82}, abstract = {Cryptographic computations (decryption, signature generation, etc.) are often performed on a relatively insecure device (e.g., a mobile device or an Internet-connected host) which cannot be trusted to maintain secrecy of the private key. We propose and investigate the notion of key-insulated security whose goal is to minimize the damage caused by secret-key exposures. In our model, the secret key(s) stored on the insecure device are refreshed at discrete time periods via inter-action with a physically-secure - but computationally-limited - device which stores a {\textquotedblleft}master key{\textquotedblright}. All cryptographic computations are still done on the insecure device, and the public key remains unchanged. In a (t, N)-key-insulated scheme, an adversary who compromises the insecure device and obtains secret keys for up to t periods of his choice is unable to violate the security of the cryptosystem for any of the remaining N - t periods. Furthermore, the scheme remains secure (for all time periods) against an adversary who compromises only the physically-secure device. We focus primarily on key-insulated public-key encryption. We construct a (t, N)-key-insulated encryption scheme based on any (standard) public-key encryption scheme, and give a more efficient construction based on the DDH assumption. The latter construction is then extended to achieve chosen-ciphertext security.}, doi = {10.1007/3-540-46035-7_5}, author = {Dodis,Y. and Katz, Jonathan and Xu,S. and Yung,M.} } @article {14418, title = {Learning structured statistical models from relational data}, journal = {Link{\"o}ping Electronic Articles in Computer and Information Science}, volume = {7}, year = {2002}, month = {2002///}, pages = {13 - 13}, abstract = {Here we describe tools for constructing statistical models from relational data. Our goal is to learn structured probabilistic models that represent statistical correlations both between the properties of an entity and between the properties of related entities. These statistical models can then be used for a variety of tasks including knowledge discovery, exploratory data analysis, data summarization and anomaly detection. Unfortunately, most statistical learning methods work only with "flat" data representations. Thus, to apply these methods, we are forced to convert the data into a flat form, thereby not only losing its compact representation and structure but also potentially introducing statistical skew. These drawbacks severely limit the ability of current statistical methods to model relational databases. Here we describe two complementary approaches: one approach suited to making probabilistic statements about individuals and the second approach suited to making statements about frequencies in relational data. We describe algorithms for both learning and making inferences in these models, and give experimental results.}, author = {Getoor, Lise and Friedman,N. and Koller,D.} } @conference {13582, title = {Lexicon Acquisition from Bilingual Dictionaries}, booktitle = {SPIEPhotonic West Electronic Imaging Conference}, year = {2002}, month = {2002///}, pages = {37 - 48}, author = {David Doermann and Ma,H. and Karagol-Ayan,B. and Oard, Douglas} } @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.} } @article {14507, title = {Method and apparatus for learning probabilistic relational models having attribute and link uncertainty and for performing selectivity estimation using probabilistic relational models}, volume = {09/922,324}, year = {2002}, month = {2002/08/01/}, abstract = {The invention comprises a method and apparatus for learning probabilistic models (PRM{\textquoteright}s) with attribute uncertainty. A PRM with attribute uncertainty defines a probability distribution over instantiations of a database. A learned PRM is useful for discovering interesting patterns and dependencies in the data. Unlike many existing techniques, the process is data-driven rather than hypothesis driven. This makes the technique particularly well-suited for exploratory data analysis. In addition, the invention comprises a method and apparatus for handling link uncertainty in PRM{\textquoteright}s. Link uncertainty is uncertainty over which entities are related in our domain. The invention comprises of two mechanisms for modeling link uncertainty: reference uncertainty and existence uncertainty. The invention includes learning algorithms for each form of link uncertainty. The third component of the invention is a technique for performing database selectivity estimation using probabilistic relational...}, url = {http://www.google.com/patents?id=FVqDAAAAEBAJ}, author = {Koller,Daphne and Getoor, Lise and Pfeffer,Avi and Friedman,Nir and Taskar,Ben} } @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 {16693, title = {OCR error correction using a noisy channel model}, booktitle = {Proceedings of the second international conference on Human Language Technology Research}, year = {2002}, month = {2002///}, pages = {257 - 262}, author = {Kolak,O. and Resnik, Philip} } @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 {15299, title = {Omnibase: Uniform access to heterogeneous data for question answering}, journal = {Natural Language Processing and Information Systems}, year = {2002}, month = {2002///}, pages = {230 - 234}, abstract = {Although the World Wide Web contains a tremendous amount of information, the lack of uniform structure makes finding the right knowledge difficult. A solution is to turn the Web into a {\textquotedblleft}virtual database{\textquotedblright} and to access it through natural language.We built Omnibase, a system that integrates heterogeneous data sources using an object- property-value model. With the help of Omnibase, our Start natural language system can now access numerous heterogeneous data sources on the Web in a uniform manner, and answers millions of user questions with high precision.}, doi = {10.1007/3-540-36271-1_23}, author = {Katz,B. and Felshin,S. and Yuret,D. and Ibrahim,A. and Jimmy Lin and Marton,G. and Jerome McFarland,A. and Temelkuran,B.} } @article {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} } @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 {13623, title = {Performance evaluation of object detection algorithms}, booktitle = {Pattern Recognition, 2002. Proceedings. 16th International Conference on}, volume = {3}, year = {2002}, month = {2002///}, pages = {965 - 969 vol.3 - 965 - 969 vol.3}, abstract = {The continuous development of object detection algorithms is ushering in the need for evaluation tools to quantify algorithm performance. In this paper a set of seven metrics are proposed for quantifying different aspects of a detection algorithm{\textquoteright}s performance. The strengths and weaknesses of these metrics are described. They are implemented in the Video Performance Evaluation Resource (ViPER) system and will be used to evaluate algorithms for detecting text, faces, moving people and vehicles. Results for running two previous text-detection algorithms on a common data set are presented.}, keywords = {algorithms;, common, data, DETECTION, detection;, Evaluation, evaluation;, image, object, performance, recognition;, resource, set;, system;, text-detection, video}, doi = {10.1109/ICPR.2002.1048198}, author = {Mariano,V.Y. and Min,Junghye and Park,Jin-Hyeong and Kasturi,R. and Mihalcik,D. and Huiping Li and David Doermann and Drayer,T.} } @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 {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 {12766, title = {Probabilistic recognition of human faces from video}, booktitle = {Image Processing. 2002. Proceedings. 2002 International Conference on}, volume = {1}, year = {2002}, month = {2002///}, pages = {I-41 - I-44 vol.1 - I-41 - I-44 vol.1}, abstract = {Most present face recognition approaches recognize faces based on still images. We present a novel approach to recognize faces in video. In that scenario, the face gallery may consist of still images or may be derived from a videos. For evidence integration we use classical Bayesian propagation over time and compute the posterior distribution using sequential importance sampling. The probabilistic approach allows us to handle uncertainties in a systematic manner. Experimental results using videos collected by NIST/USF and CMU illustrate the effectiveness of this approach in both still-to-video and video-to-video scenarios with appropriate model choices.}, keywords = {Bayes, Bayesian, CMU;, distribution;, Face, faces;, gallery;, handling;, human, image, images;, importance, likelihood;, methods;, NIST/USF;, observation, posterior, probabilistic, probability;, processing;, propagation;, recognition;, sampling;, sequential, signal, still, Still-to-video, Uncertainty, video, Video-to-video}, doi = {10.1109/ICIP.2002.1037954}, author = {Chellapa, Rama and Kruger, V. and Zhou,Shaohua} } @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} } @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.} } @article {11913, title = {Rover: scalable location-aware computing}, journal = {Computer}, volume = {35}, year = {2002}, month = {2002/10//}, pages = {46 - 53}, abstract = {All the components necessary for realizing location-aware computing are available in the marketplace today. What has hindered the widespread deployment of location-based systems is the lack of an integration architecture that scales with user populations. The authors have completed the initial implementation of Rover, a system designed to achieve this sort of integration and to automatically tailor information and services to a mobile user{\textquoteright}s location. Their studies have validated Rover{\textquoteright}s underlying software architecture, which achieves system scalability through high-resolution, application-specific resource scheduling at the servers and network. The authors believe that this technology will greatly enhance the user experience in many places, including museums, amusement and theme parks, shopping malls, game fields, offices, and business centers. They designed the system specifically to scale to large user populations and expect its benefits to increase with them.}, keywords = {amusement, application-specific, architecture;, automation;, business, business;, computing;, data, entertainment;, handheld, humanities;, integration, LAN;, location-aware, malls;, mobile, museums;, office, parks;, processing;, resource, Rover;, scalability;, scalable, scheduling;, shopping, software, system, theme, units;, user;, wireless}, isbn = {0018-9162}, doi = {10.1109/MC.2002.1039517}, author = {Banerjee,S. and Agarwal,S. and Kamel,K. and Kochut, A. and Kommareddy,C. and Nadeem,T. and Thakkar,P. and Trinh,Bao and Youssef,A. and Youssef, M. and Larsen,R.L. and Udaya Shankar,A. and Agrawala, Ashok K.} } @article {12309, title = {Scalable application layer multicast}, journal = {SIGCOMM Comput. Commun. Rev.}, volume = {32}, year = {2002}, month = {2002/08//}, pages = {205 - 217}, abstract = {We describe a new scalable application-layer multicast protocol, specifically designed for low-bandwidth, data streaming applications with large receiver sets. Our scheme is based upon a hierarchical clustering of the application-layer multicast peers and can support a number of different data delivery trees with desirable properties.We present extensive simulations of both our protocol and the Narada application-layer multicast protocol over Internet-like topologies. Our results show that for groups of size 32 or more, our protocol has lower link stress (by about 25\%), improved or similar end-to-end latencies and similar failure recovery properties. More importantly, it is able to achieve these results by using orders of magnitude lower control traffic.Finally, we present results from our wide-area testbed in which we experimented with 32-100 member groups distributed over 8 different sites. In our experiments, average group members established and maintained low-latency paths and incurred a maximum packet loss rate of less than 1\% as members randomly joined and left the multicast group. The average control overhead during our experiments was less than 1 Kbps for groups of size 100.}, keywords = {application layer multicast, hierarchy, overlay networks, peer-to-peer systems, scalability}, isbn = {0146-4833}, doi = {10.1145/964725.633045}, url = {http://doi.acm.org/10.1145/964725.633045}, author = {Banerjee,Suman and Bhattacharjee, Bobby and Kommareddy,Christopher} } @conference {12306, title = {Scalable peer finding on the Internet}, booktitle = {Global Telecommunications Conference, 2002. GLOBECOM {\textquoteright}02. IEEE}, volume = {3}, year = {2002}, month = {2002/11//}, pages = {2205 - 2209 vol.3 - 2205 - 2209 vol.3}, abstract = {We consider the problem of finding nearby application peers over the Internet. We define a new peer-finding scheme (called Tiers) that scales to large application peer groups. Tiers creates a hierarchy of the peers, which allows an efficient and scalable solution to this problem. The scheme can be implemented entirely in the application-layer and does not require the deployment of either any additional measurement services, or well-known reference landmarks in the network. We present detailed evaluation of Tiers and compare it to one previously proposed scheme called Beaconing. Through analysis and detailed simulations on 10,000 node Internet-like topologies we show that Tiers achieves comparable or better performance with a significant reduction in control overheads for groups of size 32 or more.}, keywords = {application, application-layer;, Beaconing;, CONTROL, finding;, Internet-like, Internet;, measurement, network, overhead, peer, peer-finding, peers;, protocol;, protocols;, reduction;, scalable, scheme;, services;, simulations;, solution;, Tiers;, topologies;, topology;}, doi = {10.1109/GLOCOM.2002.1189023}, author = {Banerjee,S. and Kommareddy,C. and Bhattacharjee, Bobby} } @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 {15288, title = {The START multimedia information system: Current technology and future directions}, booktitle = {In Proceedings of the International Workshop on Multimedia Information Systems (MIS 2002)}, year = {2002}, month = {2002///}, abstract = {To address the problem of information overload intoday{\textquoteright}s world, we have developed Start, a natural language question answering system that provides users with high-precision multimedia information ac- cess through the use of natural language annota- tions. To address the difficulty of accessing large amounts of heterogeneous data, we have developed Omnibase, which assists Start by integrating struc- tured and semistructured Web databases into a sin- gle, uniformly structured {\textquotedblleft}virtual database.{\textquotedblright} Our ultimate goal is to develop a computer system that acts like a {\textquotedblleft}smart reference librarian,{\textquotedblright} and we be- lieve we have laid a firm foundation for achieving our goal. This paper describes our current implemented system and discusses future research directions. }, author = {Katz,B. and Jimmy Lin and Felshin,S.} } @article {17925, title = {State of the art in data representation for visualization}, journal = {IEEE Visualization Tutorial}, year = {2002}, month = {2002///}, author = {Chen,B. and Kaufman,A. and Mueller,K. and Varshney, Amitabh} } @conference {18804, title = {A Step Towards Automated Design of Multi-Piece Sacrificial Molds}, volume = {3}, year = {2002}, month = {2002///}, pages = {337 - 347}, publisher = {ASME}, organization = {ASME}, address = {Montreal, Quebec, Canada}, abstract = {This paper describes a feature-based approach for design of multi-piece sacrificial molds. Our mold design algorithm consists of the following three steps. First, the desired gross mold shape is formed based on the feature-based description of the part geometry. Second, if the desired gross mold shape is not machinable as a single piece, the gross mold shape is decomposed into simpler geometric components to make sure that each component is manufacturable using 3-axis CNC machining. The decomposition is performed to ensure that each component is accessible to end-milling tools, and decomposed components can be assembled together to form the gross mold shape. Finally, assembly features are added to mold components to facilitate assembly of mold components and eliminate unnecessary degree of freedoms from the final mold assembly. We expect that our decomposition algorithm will provide a step towards the necessary foundations for automating the design of multi-piece mold and therefore will help in significantly reducing the mold design and manufacturing lead-time.}, isbn = {0-7918-3623-1}, doi = {10.1115/DETC2002/DFM-34188}, url = {http://link.aip.org/link/ASMECP/v2002/i36231/p337/s1\&Agg=doi}, author = {Dhaliwal,Savinder and Gupta, Satyandra K. and Huang,Jun and Kumar,Malay} } @article {15153, title = {Strong key-insulated signature schemes}, journal = {Public Key Cryptography{\textemdash}PKC 2003}, year = {2002}, month = {2002///}, pages = {130 - 144}, abstract = {Signature computation is frequently performed on insecure devices{\textemdash}e.g., mobile phones {\textemdash} operating in an environment where the private (signing)k ey is likely to be exposed. Strong key-insulated signature schemes are one way to mitigate the damage done when this occurs. In the key-insulated model [6], the secret key stored on an insecure device is refreshed at discrete time periods via interaction with a physically-secure device which stores a {\textquotedblleft}master key{\textquotedblright}. All signing is still done by the insecure device, and the public key remains fixed throughout the lifetime of the protocol. In a strong (t,N)-key-insulated scheme, an adversary who compromises the insecure device and obtains secret keys for up to t periods is unable to forge signatures for any of the remaining N-t periods. Furthermore, the physically-secure device (or an adversary who compromises only this device)is unable to forge signatures for any time period.We present here constructions of strong key-insulated signature schemes based on a variety of assumptions. First, we demonstrate a generic construction of a strong (N{\textemdash} 1,N)-key-insulated signature scheme using any standard signature scheme. We then give a construction of a strong (t,N)-signature scheme whose security may be based on the discrete logarithm assumption in the random oracle model. This construction offers faster signing and verification than the generic construction, at the expense of O(t)k ey update time and key length. Finally, we construct strong (N {\textemdash}1,N)-key-insulated schemes based on any {\textquotedblleft}trapdoor signature scheme{\textquotedblright} (a notion we introduce here); our resulting construction in fact serves as an identity-based signature scheme as well. This leads to very efficient solutions based on, e.g., the RSA assumption in the random oracle model. Work done in part while at DIMACS. }, doi = {10.1007/3-540-36288-6_10}, author = {Dodis,Y. and Katz, Jonathan and Xu,S. and Yung,M.} } @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 {15091, title = {Threshold cryptosystems based on factoring}, journal = {Advances in Cryptology{\textemdash}ASIACRYPT 2002}, year = {2002}, month = {2002///}, pages = {139 - 147}, abstract = {We consider threshold cryptosystems over a composite modulus N where the factors of N are shared among the participants as the secret key. This is a new paradigm for threshold cryptosystems based on a composite modulus, differing from the typical treatment of RSA-based systems where a {\textquotedblleft}decryption exponent{\textquotedblright} is shared among the participants. Our approach yields solutions to some open problems in threshold cryptography; in particular, we obtain the following:1 Threshold Homomorphic Encryption. A number of applications (e.g., electronic voting or efficient multi-party computation) require threshold homomorphic encryption schemes. We present a protocol for threshold decryption of the homomorphic Goldwasser-Micali encryption scheme [34], answering an open question of [21]. 2 Threshold Cryptosystems as Secure as Factoring. We describe a threshold version of a variant of the signature standards ISO 9796-2 and PKCS$\#$1 v1.5 (cf. [39, Section 11.3.4]), thus giving the first threshold signature scheme whose security (in the random oracle model) is equivalent to the hardness of factoring [12]. Our techniques may be adapted to distribute the Rabin encryption scheme [44] whose semantic security may be reduced to the hardness of factoring. 3 Efficient Threshold Schemes without a Trusted Dealer. Because our schemes only require sharing of N - which furthermore need not be a product of strong primes - our schemes are very efficient (compared to previous schemes) when a trusted dealer is not assumed and key generation is done in a distributed manner. Extensions to achieve robustness and proactivation are also possible with our schemes. Work done while at Columbia University and Telcordia Technologies }, doi = {10.1007/3-540-36178-2_12}, author = {Katz, Jonathan and Yung,M.} } @article {15892, title = {The use of speech retrieval systems: a study design}, journal = {Information retrieval techniques for speech applications}, year = {2002}, month = {2002///}, pages = {86 - 93}, author = {Kim,J. and Oard, Douglas} } @conference {13689, title = {Video analysis applications for pervasive environments}, booktitle = {1st International Conference on Mobile and Ubiquitous Multimedia}, year = {2002}, month = {2002///}, pages = {48 - 55}, abstract = {Network capabilities are expanding at arate that will soon allow a much wider range of image and video content to be delivered to and transmitted from mobile wireless devices. Current pervasive applications provide image and video content primarily in high performance networks or by streaming video over low-bandwidth networks. For video to be truly integrated into ubiquitous applications, we must carefully consider the role of automated video analysis to move beyond simple content delivery. Compression and content adaptation have been significant areas of research for some time and deal with the problem of moving media to devices with limited network, software and hardware capabilities. In the near future, mobile wireless devices that have been primarily consumers of image and video will be able to produce such content as well. In this paper, we will review some of the significant issues associated with providing video capabilities in pervasive environments. We consider not only streaming video applications, but point-to- point video and video messaging capabilities as well. We will show how our previous work on content adaptation is being applied to these types of environments, show what role more general video analysis can play and describe a general architecture for video capture, storage, analysis and transmission. }, author = {Karunanidhi,A. and David Doermann and Parekh,N. and Rautio,V.} } @article {13479, title = {Virtual Telescopes in Education}, journal = {Journal of Digital Information}, volume = {2}, year = {2002}, month = {2002///}, abstract = {Virtual Telescopes in Education is providing the services required to operate a virtual observatory comprising distributed telescopes, including an interactive, constraint-based scheduling service, data and resource archive, proposal preparation and review environment, and a VTIE Journal. A major goal of VTIE is to elicit from learners questions about the nature of celestial objects and the physical processes that give rise to the spectacular imagery that catches their imaginations. Generation of constrained science questions will assist learners in the science process. To achieve interoperability with other NSDL resources, our approach follows the Open Archives Initiative and the W3C Semantic Web activity.}, author = {Hoban,S. and desJardins, Marie and Farrell,N. and Rathod,P. and Sachs,J. and Sansare,S. and Yesha,Y. and Keating,J. and Busschots,B. and Means,J. and others} } @conference {12747, title = {Wide baseline image registration using prior information}, booktitle = {Multimedia Signal Processing, 2002 IEEE Workshop on}, year = {2002}, month = {2002/12//}, pages = {37 - 40}, abstract = {Establishing correspondence between features in two images of the same scene taken from different viewing angles in a challenging problem in image processing and computer vision. However, its solution is an important step in many applications like wide baseline stereo, 3D model alignment, creation of panoramic views etc. In this paper, we propose a technique for registration of two images of a face obtained from different viewing angles. We show that prior information about the general characteristics of a face obtained from video sequences of different faces can be used to design a robust correspondence algorithm. The method works by matching 2D shapes of the different features of the face. A doubly stochastic matrix, representing the probability of match between the features, is derived using the Sinkhorn normalization procedure. The final correspondence is obtained by minimizing the probability of error of a match between the entire constellations of features in the two sets, thus taking into account the global spatial configuration of the features. The method is applied for creating holistic 3D models of a face from partial representations. Although this paper focuses primarily on faces, the algorithm can also be used for other objects with small modifications.}, keywords = {2D, 3D, algorithm;, alignment;, angles;, baseline, Computer, configuration;, constellation;, correspondence, creation;, doubly, error, extraction;, Face, feature, global, holistic, image, images;, matching;, matrix;, model, models;, normalization, panoramic, probability;, procedure;, processes;, processing;, registration;, robust, sequences;, SHAPE, signal, Sinkhorn, spatial, statistics;, stereo;, Stochastic, video, view, viewing, vision;, wide}, doi = {10.1109/MMSP.2002.1203242}, author = {Chowdhury, AM and Chellapa, Rama and Keaton, T.} } @conference {15646, title = {Algorithms for facility location problems with outliers}, booktitle = {Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms}, series = {SODA {\textquoteright}01}, year = {2001}, month = {2001///}, pages = {642 - 651}, publisher = {Society for Industrial and Applied Mathematics}, organization = {Society for Industrial and Applied Mathematics}, address = {Philadelphia, PA, USA}, abstract = {Facility location problems are traditionally investigated with the assumption that all the clients are to be provided service. A significant shortcoming of this formulation is that a few very distant clients, called outliers, can exert a disproportionately strong influence over the final solution. In this paper we explore a generalization of various facility location problems (K-center, K-median, uncapacitated facility location etc) to the case when only a specified fraction of the customers are to be served. What makes the problems harder is that we have to also select the subset that should get service. We provide generalizations of various approximation algorithms to deal with this added constraint.}, isbn = {0-89871-490-7}, url = {http://dl.acm.org/citation.cfm?id=365411.365555}, author = {Charikar,Moses and Khuller, Samir and Mount, Dave and Narasimhan,Giri} } @article {14067, title = {Analysis of a donor gene region for a variant surface glycoprotein and its expression site in African trypanosomes}, journal = {Nucleic acids research}, volume = {29}, year = {2001}, month = {2001///}, pages = {2012 - 2012}, author = {LaCount,D. J and El-Sayed, Najib M. and Kaul,S. and Wanless,D. and Turner,C. M.R and Donelson,J. E} } @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 {18318, title = {Attentive toys}, booktitle = {International Conference on Multimedia and Expo}, volume = {22}, year = {2001}, month = {2001///}, pages = {25 - 25}, author = {Haritaoglu,I. and Cozzi,A. and Koons,D. and Flickner,M. and Zotkin,Dmitry N and Yacoob,Yaser} } @conference {19653, title = {Automatically Tracking and Analyzing the Behavior of Live Insect Colonies}, booktitle = {AGENTS {\textquoteright}01 Proceedings of the Fifth International Conference on Autonomous Agents }, series = {AGENTS {\textquoteright}01}, year = {2001}, month = {2001///}, pages = {521 - 528}, publisher = {ACM}, organization = {ACM}, abstract = {We introduce the study of {\it live} social insect colonies as a relevant and exciting domain for the development and application of multi-agent systems modeling tools. Social insects provide a rich source of {\it traceable} social behavior for testing multi-agent tracking, prediction and modeling algorithms. An additional benefit of this research is the potential for contributions to experimental biology --- the principled techniques developed for analyzing artificial multi-agent systems can be applied to advance the state of knowledge of insect behavior. We contribute a novel machine vision system that addresses the challenge of tracking hundreds of small animals simultaneously. Fast color-based tracking is combined with movement-based tracking to locate ants in a real-time video stream. We also introduce new methods for analyzing the spatial activity of ant colonies. The system was validated in experiments with laboratory colonies of {\it Camponotus festinatus} and several example analyses of the colonies{\textquoteright} spatial behavior are provided.}, isbn = {1-58113-326-X}, url = {http://doi.acm.org/10.1145/375735.376434}, author = {Balch, Tucker and Zia Khan and Veloso, Manuela} } @article {16766, title = {A case for dynamic view management}, journal = {ACM Transactions on Database SystemsACM Trans. Database Syst.}, volume = {26}, year = {2001}, month = {2001/12//}, pages = {388 - 423}, isbn = {03625915}, doi = {10.1145/503099.503100}, url = {http://dl.acm.org/citation.cfm?id=503100}, author = {Kotidis,Yannis and Roussopoulos, Nick} } @article {15092, title = {Cryptographic counters and applications to electronic voting}, journal = {Advances in Cryptology{\textemdash}Eurocrypt 2001}, year = {2001}, month = {2001///}, pages = {78 - 92}, abstract = {We formalize the notion of a cryptographic counter, which allows a group of participants to increment and decrement a cryptographic representation of a (hidden) numerical value privately and robustly. The value of the counter can only be determined by a trusted authority (or group of authorities, which may include participants themselves), and participants cannot determine any information about the increment/decrement operations performed by other parties.Previous efficient implementations of such counters have relied on fully-homomorphic encryption schemes; this is a relatively strong requirement which not all encryption schemes satisfy. We provide an alternate approach, starting with any encryption scheme homomorphic over the additive group ℤ2 (i.e., 1-bit XOR). As our main result, we show a general and efficient reduction from any such encryption scheme to a general cryptographic counter. Our main reduction does not use additional assumptions, is efficient, and gives a novel implementation of a general counter. The result can also be viewed as an efficient construction of a general n-bit cryptographic counter from any 1-bit counter which has the additional property that counters can be added securely. As an example of the applicability of our construction, we present a cryptographic counter based on the quadratic residuosity assumption and use it to construct an efficient voting scheme which satisfies universal verifiability, privacy, and robustness. Work done while the author was at Telcordia Technologies. }, doi = {10.1007/3-540-44987-6_6}, author = {Katz, Jonathan and Myers,S. and Ostrovsky,R.} } @article {12314, title = {The Design of TerraDir}, journal = {Technical Reports from UMIACS, UMIACS-TR-2001-4299}, year = {2001}, month = {2001/12/17/}, abstract = {We present the design and initial evaluation of TerraDir: an approach forimplementing customizable, distributed, peer-to-peer directories over which a broad range of wide-area resource discovery applications can be implemented. TerraDir{\textquoteright}s structure is two-tiered, consisting of a base protocol for providing arbitrary application-layer connectivity, and dynamic view materializations that efficiently realize different user-specified views of application-layer resources. TerraDir is specifically designed for data that can be arranged in a rooted hierarchy, and provides very efficient and robust lookups over such data while still being able to allow efficient searching. (Also referenced as UMIACS-TR-2001-4299) }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/1161}, author = {Bhattacharjee, Bobby and Keleher,Pete and Silaghi,Bujor} } @article {17933, title = {Differential point rendering}, journal = {Proceedings of 12th Eurographics Workshop on Rendering}, year = {2001}, month = {2001///}, pages = {139 - 50}, author = {Varshney, Amitabh and Kalaiah,A.} } @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 {18647, title = {A dynamic replica selection algorithm for tolerating timing faults}, year = {2001}, month = {2001/07//}, pages = {107 - 116}, abstract = {Server replication is commonly used to improve the fault tolerance and response time of distributed services. An important problem when executing time-critical applications in a replicated environment is that of preventing timing failures by dynamically selecting the replicas that can satisfy a client{\textquoteright}s timing requirement, even when the quality of service is degraded due to replica failures and excess load on the server. We describe the approach we have used to solve this problem in AQuA, a CORBA-based middleware that transparently replicates objects across a local area network. The approach we use estimates a replica{\textquoteright}s response time distribution based on performance measurements regularly broadcast by the replica. An online model uses these measurements to predict the probability with which a replica can prevent a timing failure for a client. A selection algorithm then uses this prediction to choose a subset of replicas that can together meet the client{\textquoteright}s timing constraints with at least the probability requested by the client. We conclude with experimental results based on our implementation.}, keywords = {AQuA, client, client-server systems, CORBA-based middleware, distributed object management, distributed services, dynamic replica selection algorithm, fault tolerant computing, local area network, Local area networks, quality of service, replica failures, response time, server replication, time-critical applications, timing failures, timing fault tolerance}, doi = {10.1109/DSN.2001.941397}, author = {Krishnamurthy, S. and Sanders,W. H. and Michel Cukier} } @article {18206, title = {Dynamic resource allocation via video content and short-term traffic statistics}, journal = {Multimedia, IEEE Transactions on}, volume = {3}, year = {2001}, month = {2001/06//}, pages = {186 - 199}, abstract = {The reliable and efficient transmission of high-quality variable bit rate (VBR) video through the Internet generally requires network resources be allocated in a dynamic fashion. This includes the determination of when to renegotiate for network resources, as well as how much to request at a given time. The accuracy of any resource request method depends critically on its prediction of future traffic patterns. Such a prediction can be performed using the content and traffic information of short video segments. This paper presents a systematic approach to select the best features for prediction, indicating that while content is important in predicting the bandwidth of a video hit stream, the use of both content and available short-term bandwidth statistics can yield significant improvements. A new framework for traffic prediction is proposed in this paper; experimental results show a smaller mean-square resource prediction error and higher overall link utilization}, keywords = {allocation;link, allocation;multimedia, allocation;variable, bit, codes;, content;bandwidth, error;short, Internet;dynamic, patterns;variable, prediction, rate, resource, segments;short-term, statistics;traffic, systems;resource, traffic, utilization;mean-square, video, video;video}, isbn = {1520-9210}, doi = {10.1109/6046.923818}, author = {M. Wu and Joyce,R.A. and Wong,Hau-San and Guan,Long and Kung,Sun-Yuan} } @conference {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 {14766, title = {Efficient network and I/O throttling for fine-grain cycle stealing}, booktitle = {Proceedings of the 2001 ACM/IEEE conference on Supercomputing (CDROM) - Supercomputing {\textquoteright}01}, year = {2001}, month = {2001///}, pages = {3 - 3}, address = {Denver, Colorado}, doi = {10.1145/582034.582037}, url = {http://dl.acm.org/citation.cfm?id=582037}, author = {Ryu, Kyung D. and Hollingsworth, Jeffrey K and Keleher, Peter J.} } @article {15093, title = {Efficient password-authenticated key exchange using human-memorable passwords}, journal = {Advances in Cryptology{\textemdash}EUROCRYPT 2001}, year = {2001}, month = {2001///}, pages = {475 - 494}, abstract = {There has been much interest in password-authenticated keyexchange protocols which remain secure even when users choose passwords from a very small space of possible passwords (say, a dictionary of English words). Under this assumption, one must be careful to design protocols which cannot be broken using off-line dictionary attacks in which an adversary enumerates all possible passwords in an attempt to determine the correct one. Many heuristic protocols have been proposed to solve this important problem. Only recently have formal validations of security (namely, proofs in the idealized random oracle and ideal cipher models) been given for specific constructions [3,10,22].Very recently, a construction based on general assumptions, secure in the standard model with human-memorable passwords, has been proposed by Goldreich and Lindell [17]. Their protocol requires no public parameters; unfortunately, it requires techniques from general multi-party computation which make it impractical. Thus, [17] only proves that solutions are possible {\textquotedblleft}in principal{\textquotedblright}. The main question left open by their work was finding an efficient solution to this fundamental problem. We showan efficient, 3-round, password-authenticated key exchange protocol with human-memorable passwords which is provably secure under the Decisional Diffie-Hellman assumption, yet requires only (roughly) 8 times more computation than {\textquotedblleft}standard{\textquotedblright} Diffie-Hellman key exchange [14] (which provides no authentication at all). We assume public parameters available to all parties. We stress that we work in the standard model only, and do not require a {\textquotedblleft}random oracle{\textquotedblright} assumption. }, doi = {10.1007/3-540-44987-6_29}, author = {Katz, Jonathan and Ostrovsky,R. and Yung,M.} } @conference {16260, title = {Efficient perspective-accurate silhouette computation and applications}, booktitle = {Proceedings of the seventeenth annual symposium on Computational geometry}, series = {SCG {\textquoteright}01}, year = {2001}, month = {2001///}, pages = {60 - 68}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Silhouettes are perceptually and geometrically salient features of geo metric models. Hence a number of graphics and visualization applications need to find them to aid further processing. The efficient computation of silhouettes, especially in the context of perspective projection, is known to be difficult. This paper presents a novel efficient and practical algorithm to compute silhouettes from a sequence of viewpoints under perspective projection. Parallel projection is a special case of this algorithm. Our approach is based on a point-plane duality in three dimensions, which allows an efficient computation of the \emph{changes} in the silhouette of a polygonal model between consecutive frames. In addition, we present several applications of our technique to problems from computer graphics and medical visualization. We also provide experimental data that show the efficiency of our approach. million vertices on an SGI Onyx workstation.}, keywords = {rendering, silhouette, simplification}, isbn = {1-58113-357-X}, doi = {10.1145/378583.378618}, url = {http://doi.acm.org/10.1145/378583.378618}, author = {Pop, Mihai and Duncan,Christian and Barequet,Gill and Goodrich,Michael and Huang,Wenjing and Kumar,Subodh} } @article {16324, title = {An empirical study of regression test selection techniques}, journal = {ACM Transactions on Software Engineering and MethodologyACM Trans. Softw. Eng. Methodol.}, volume = {10}, year = {2001}, month = {2001/04//}, pages = {184 - 208}, isbn = {1049331X}, doi = {10.1145/367008.367020}, url = {http://dl.acm.org/citation.cfm?id=367020}, author = {Graves,Todd L. and Harrold,Mary Jean and Kim,Jung-Min and Porter, Adam and Rothermel,Gregg} } @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 {18732, title = {A feature-based approach to automated design of multi-piece sacrificial molds}, journal = {Journal of Computing and Information Science in Engineering}, volume = {1}, year = {2001}, month = {2001///}, pages = {225 - 225}, author = {Dhaliwal,S. and Gupta,S.K. and Huang,J. and Kumar,M.} } @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 {15319, title = {Gathering knowledge for a question answering system from heterogeneous information sources}, booktitle = {Proceedings of the workshop on Human Language Technology and Knowledge Management - Volume 2001}, series = {HLTKM {\textquoteright}01}, year = {2001}, month = {2001///}, pages = {9:1{\textendash}9:8 - 9:1{\textendash}9:8}, publisher = {Association for Computational Linguistics}, organization = {Association for Computational Linguistics}, address = {Stroudsburg, PA, USA}, abstract = {Although vast amounts of information are available electronically today, no effective information access mechanism exists to provide humans with convenient information access. A general, open-domain question answering system is a solution to this problem. We propose an architecture for a collaborative question answering system that contains four primary components: an annotations system for storing knowledge, a ternary expression representation of language, a transformational rule system for handling some complexities of language, and a collaborative mechanism by which ordinary users can contribute new knowledge by teaching the system new information. We have developed a initial prototype, called Webnotator, with which to test these ideas.}, doi = {10.3115/1118220.1118229}, url = {http://dx.doi.org/10.3115/1118220.1118229}, author = {Katz,Boris and Jimmy Lin and Felshin,Sue} } @conference {18799, title = {A geometric algorithm for automated design of multi-stage molds for manufacturing multi-material objects}, series = {SMA {\textquoteright}01}, year = {2001}, month = {2001///}, pages = {278 - 288}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {This paper describes a geometric algorithm for automated design of multi-stage molds for manufacturing multi-material objects. In multi-stage molding process, the desired multi-material object is produced by carrying out multiple molding operations in a sequence, adding one material in the target object in each mold-stage. We model multi-material objects as an assembly of single-material components. Each mold-stage can only add one type of material. Therefore, we need a sequence of mold-stages such that (1) each mold-stage only adds one single-material component either fully or partially, and (2) the molding sequence completely produces the desired object. In other to find a feasible mold-stage sequence, our algorithm decomposes the multi-material object into a number of homogeneous components to find a feasible sequence of homogeneous components that can be added in sequence to produce the desired multi-material object. Our algorithm starts with the final object assembly and considers removing components either completely or partially from the object one-at-a-time such that it results in the previous state of the object assembly. If the component can be removed from the target object leaving the previous state of the object assembly a connected solid then we consider such decomposition a valid step in the stage sequence. This step is recursively repeated on new states of the object assembly, until the object assembly reaches a state where it only consists of one component. When an object-decomposition has been found that leads to a feasible stage sequence, the gross mold for each stage is computed and decomposed into two or more pieces to facilitate the molding operation. We expect that our algorithm will provide a step towards automating the design of multi-stage molds and therefore will help in reducing the mold design lead-time for multi-stage molds.}, keywords = {geometric reasoning, mold design, spatial partitioning}, isbn = {1-58113-366-9}, doi = {10.1145/376957.376989}, url = {http://doi.acm.org/10.1145/376957.376989}, author = {Kumar,Malay and Gupta, Satyandra K.} } @inbook {14221, title = {Geometry of Eye Design: Biology and Technology}, booktitle = {Multi-Image Analysis}, series = {Lecture Notes in Computer Science}, volume = {2032}, year = {2001}, month = {2001///}, pages = {22 - 38}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {Natural or artificial vision systems process the images that they collect with their eyes or cameras in order to derive information for performing tasks related to navigation and recognition. Since the way images are acquired determines how dificult it is to perform a visual task, and since systems have to cope with limited resources, the eyes used by a specific system should be designed to optimize subsequent image processing as it relates to particular tasks. Different ways of sampling light, i.e., different eyes, may be less or more powerful with respect to particular competences. This seems intuitively evident in view of the variety of eye designs in the biological world. It is shown here that a spherical eye (an eye or system of eyes providing panoramic vision) is superior to a camera-type eye (an eye with restricted field of view) as regards the competence of three-dimensional motion estimation. This result is derived from a statistical analysis of all the possible computational models that can be used for estimating 3D motion from an image sequence. The findings explain biological design in a mathematical manner, by showing that systems that fly and thus need good estimates of 3D motion gain advantages from panoramic vision. Also, insights obtained from this study point to new ways of constructing powerful imaging devices that suit particular tasks in robotics, visualization and virtual reality better than conventional cameras, thus leading to a new camera technology.}, isbn = {978-3-540-42122-1}, url = {http://dx.doi.org/10.1007/3-540-45134-X_2}, author = {Ferm{\"u}ller, Cornelia and Aloimonos, J.}, editor = {Klette,Reinhard and Gimel{\textquoteright}farb,Georgy and Huang,Thomas} } @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 {18852, title = {Integrated Microelectromechanical System (MEMS) Inertial Measurement Unit (IMIMU)}, year = {2001}, month = {2001/12//}, institution = {CARNEGIE-MELLON UNIVERSITY}, abstract = {Processes, designs and design tools are developed to enable the monolithic integration of arrays of inertial microsensors with electronics. Accelerometers and gyroscopes, fabricated in a single CMOS process, are functional and demonstrate a single chip IMU. Two integrated post CMOS micro-machining processes are demonstrated. Thin-film microstructures are defined from the metal-dielectric stack of a conventional process. In the second process, a back-side silicon etch, followed by front-side DRIE produces bulk silicon microstructures. Accelerometer and gyroscope designs are developed with accompanying low noise electronic circuitry. Noise performance was limited to 1/f circuit noise. The chip output sensibility is set by the interface circuit design. A thermally stabilized accelerometer and circuit design is demonstrated using embedded polysilicon resistors as temperature sensors and heaters in a closed loop. Nested gyroscope topologies are demonstrated with a lateral MEMS accelerometer used as a coriolis acceleration sensor. Modeling and simulation tools that simultaneously consider the electromechanical transducer and the electronic circuit to predict system performance are developed. Electrical, electromechanical and mechanical parasitics required to enable predictive lumped parameter simulation are identified and can be extracted, enabling a designer to confidently estimate design performance prior to fabrication. Generic physics-based fault models for surface-micromachined actuators and sensors are developed that enable effective testing, diagnosis and design for manufacturability.}, keywords = {*ELECTROMECHANICAL DEVICES, *GYROSCOPES, *INERTIAL MEASUREMENT UNITS, *INERTIAL NAVIGATION, *MICROELECTROMECHANICAL SYSTEMS, ACCELEROMETERS, BULK MATERIALS, CHIPS(ELECTRONICS), CIRCUITS, CLOSED LOOP SYSTEMS, CORIOLIS EFFECT, Detectors, DIELECTRICS, ELECTRICAL AND ELECTRONIC EQUIPMENT, EMBEDDING, METALS, MICROSENSORS., MICROSTRUCTURE, MONOLITHIC STRUCTURES(ELECTRONICS), NAVIGATION AND GUIDANCE, PARASITES, PE63739E, PERFORMANCE(ENGINEERING), POLYSILICONS, RESISTORS, SILICON, TEMPERATURE SENSITIVE ELEMENTS, THERMAL STABILITY, THIN FILMS, tools, Topology, WUAFRLE1170030}, url = {http://stinet.dtic.mil/oai/oai?\&verb=getRecord\&metadataPrefix=html\&identifier=ADA399565}, author = {Fedder,Gary K. and Blanton,Shawn and Carley,L. R. and Gupta, Satyandra K. and Koester,David} } @conference {16779, title = {Integrating distributed scientific data sources with MOCHA and XRoaster}, booktitle = {Thirteenth International Conference on Scientific and Statistical Database Management, 2001. SSDBM 2001. Proceedings}, year = {2001}, month = {2001///}, pages = {263 - 266}, publisher = {IEEE}, organization = {IEEE}, abstract = {MOCHA is a novel middleware system for integrating distributed data sources that we have developed at the University of Maryland. MOCHA is based on the idea that the code that implements user-defined types and functions should be automatically deployed to remote sites by the middleware system itself. To this end, we have developed an XML-based framework to specify metadata about data sites, data sets, and user-defined types and functions. XRoaster is a graphical tool that we have developed to help the user create all the XML metadata elements to be used in MOCHA}, keywords = {client-server systems, data sets, data sites, Databases, Distributed computing, distributed databases, distributed scientific data source integration, Educational institutions, graphical tool, hypermedia markup languages, IP networks, java, Large-scale systems, Maintenance engineering, meta data, metadata, Middleware, middleware system, MOCHA, Query processing, remote sites, scientific information systems, user-defined types, visual programming, XML, XML metadata elements, XML-based framework, XRoaster}, isbn = {0-7695-1218-6}, doi = {10.1109/SSDM.2001.938560}, author = {Rodriguez-Martinez,M. and Roussopoulos, Nick and McGann,J. M and Kelley,S. and Mokwa,J. and White,B. and Jala,J.} } @article {13897, title = {KidStory: A technology design partnership with children}, journal = {Behaviour \& Information Technology}, volume = {20}, year = {2001}, month = {2001///}, pages = {119 - 125}, author = {Tax{\'e}n,G. and Druin, Allison and Fast,C. and Kjellin,M.} } @article {14422, title = {Learning probabilistic models of relational structure}, journal = {MACHINE LEARNING-INTERNATIONAL WORKSHOP}, year = {2001}, month = {2001///}, pages = {170 - 177}, abstract = {Most real-world data is stored in relational form. Incontrast, most statistical learning methods work with {\textquotedblleft}flat{\textquotedblright} data representations, forcing us to convert our data into a form that loses much of the relational struc- ture. The recently introduced framework of proba- bilistic relational models (PRMs) allows us to repre- sent probabilistic models over multiple entities that utilize the relations between them. In this paper, we propose the use of probabilistic models not only for the attributes in a relational model, but for the rela- tional structure itself. We propose two mechanisms for modeling structural uncertainty: reference uncertainty and existence uncertainty. We describe the appropriate conditions for using each model and present learning algorithms for each. We present experimental results showing that the learned models can be used to pre- dict relational structure and, moreover, the observed relational structure can be used to provide better pre- dictions for the attributes in the model. }, author = {Getoor, Lise and Friedman,N. and Koller,D. and Taskar,B.} } @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} } @conference {15859, title = {Modeling information content using observable behavior}, booktitle = {PROCEEDINGS OF THE ANNUAL MEETING-AMERICAN SOCIETY FOR INFORMATION SCIENCE}, volume = {38}, year = {2001}, month = {2001///}, pages = {481 - 488}, author = {Oard, Douglas and Kim,J.} } @article {12327, title = {Multiprocessor clustering for embedded systems}, journal = {Euro-Par 2001 Parallel Processing}, year = {2001}, month = {2001///}, pages = {697 - 701}, author = {Kianzad,V. and Bhattacharyya, Shuvra S.} } @article {15237, title = {Optimal collective dichotomous choice under partial order constraints}, journal = {Mathematical Social Sciences}, volume = {41}, year = {2001}, month = {2001/05//}, pages = {349 - 364}, abstract = {This paper generalizes optimal collective dichotomous choices by including constraints which limit combinations of acceptance and rejection decisions for m projects under consideration. Two types of constraints are examined. The first type occurs when acceptance of some projects requires acceptance of others. This type reduces the choice problem to the tractable (solvable in polynomial time) problem of finding a maximum weight closed subset of a directed acyclic graph. The second type occurs when some projects must be accepted when certain others are rejected. We show that this type renders the choice problem to be NP-complete by reduction from the problem of Vertex Cover. Applicability of the generalization to information filtering is discussed.}, keywords = {constraints, Information filtering, Optimal collective dichotomous choice}, isbn = {0165-4896}, doi = {10.1016/S0165-4896(00)00069-X}, url = {http://www.sciencedirect.com/science/article/pii/S016548960000069X}, author = {Ben-Yashar,Ruth and Khuller, Samir and Kraus,Sarit} } @inbook {14864, title = {Perceptual organization as generic object recognition}, booktitle = {From Fragments to Objects Segmentation and Grouping in VisionFrom Fragments to Objects Segmentation and Grouping in Vision}, volume = {Volume 130}, year = {2001}, month = {2001///}, pages = {295 - 329}, publisher = {North-Holland}, organization = {North-Holland}, abstract = {We approach some aspects of perceptual organization as the process of fitting generic models of objects to image data. A generic model of shape encodes prior knowledge of what shapes are likely to come from real objects. For such a model to be useful, it must also lead to efficient computations. We show that models of shape based on local properties of objects can be effectively used by simple, neurally plausible networks, and that they can still encode many perceptually important properties. We also discuss the relationship between perceptual salience and viewpoint invariance. Many gestalt properties are the subset of viewpoint invariant properties that can be encoded using the smallest possible sets of features, making them the ecologically valid properties that can also be used with computational efficiency. These results suggest that implicit models of shape used in perceptual organization arise from a combination of ecological and computational constraints. Finally, we discuss experiments demonstrating the role of convexity in amodal completion. These experiments point out some of the limitations of simple local shape models, and indicate the potential role that the part structure of objects also plays in perceptual organization.}, isbn = {0166-4115}, url = {http://www.sciencedirect.com/science/article/pii/S0166411501800303}, author = {Jacobs, David W.}, editor = {Thomas F. Shipley and Philip J. Kellman} } @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.} } @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 {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 {14364, title = {Selectivity estimation using probabilistic models}, journal = {ACM SIGMOD Record}, volume = {30}, year = {2001}, month = {2001/05//}, pages = {461 - 472}, abstract = {Estimating the result size of complex queries that involve selection on multiple attributes and the join of several relations is a difficult but fundamental task in database query processing. It arises in cost-based query optimization, query profiling, and approximate query answering. In this paper, we show how probabilistic graphical models can be effectively used for this task as an accurate and compact approximation of the joint frequency distribution of multiple attributes across multiple relations. Probabilistic Relational Models (PRMs) are a recent development that extends graphical statistical models such as Bayesian Networks to relational domains. They represent the statistical dependencies between attributes within a table, and between attributes across foreign-key joins. We provide an efficient algorithm for constructing a PRM front a database, and show how a PRM can be used to compute selectivity estimates for a broad class of queries. One of the major contributions of this work is a unified framework for the estimation of queries involving both select and foreign-key join operations. Furthermore, our approach is not limited to answering a small set of predetermined queries; a single model can be used to effectively estimate the sizes of a wide collection of potential queries across multiple tables. We present results for our approach on several real-world databases. For both single-table multi-attribute queries and a general class of select-join queries, our approach produces more accurate estimates than standard approaches to selectivity estimation, using comparable space and time.}, isbn = {0163-5808}, doi = {10.1145/376284.375727}, url = {http://doi.acm.org/10.1145/376284.375727}, author = {Getoor, Lise and Taskar,Benjamin and Koller,Daphne} } @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 {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 {15836, title = {Translation lexicon acquisition from bilingual dictionaries}, booktitle = {Proceedings of SPIE}, volume = {4670}, year = {2001}, month = {2001///}, pages = {37 - 37}, author = {David Doermann and Ma,H. and Karagol-Ayan,B. and Oard, Douglas} } @article {15103, title = {Unforgeable encryption and chosen ciphertext secure modes of operation}, journal = {Fast Software Encryption}, year = {2001}, month = {2001///}, pages = {25 - 36}, abstract = {We find certain neglected issues in the study of private-key encryption schemes. For one, private-key encryption is generally held to the same standard of security as public-key encryption (i.e., indistinguishability) even though usage of the two is very different. Secondly, though the importance of secure encryption of single blocks is well known, the security of modes of encryption (used to encrypt multiple blocks) is often ignored. With this in mind, we present definitions of a new notion of security for private-key encryption called encryption unforgeability which captures an adversary{\textquoteright}s inability to generate valid ciphertexts. We show applications of this definition to authentication protocols and adaptive chosen ciphertext security.Additionally, we present and analyze a new mode of encryption, RPC (for Related Plaintext Chaining), which is unforgeable in the strongest sense of the above definition. This gives the first mode provably secure against chosen ciphertext attacks. Although RPC is slightly less efficient than, say, CBC mode (requiring about 33\% more block cipher applications and having ciphertext expansion of the same amount when using a block cipher with 128-bit blocksize), it has highly parallelizable encryption and decryption operations. }, doi = {10.1007/3-540-44706-7_20}, author = {Katz, Jonathan and Yung,M.} } @conference {15885, title = {User modeling for information access based on implicit feedback}, booktitle = {3rd Symposium of ISKO-France, Information Filtering and Automatic Summarisation in networds}, year = {2001}, month = {2001///}, author = {Kim,J. and Oard, Douglas and Romanik,K.} } @article {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 {15238, title = {z-Approximations}, journal = {Journal of Algorithms}, volume = {41}, year = {2001}, month = {2001/11//}, pages = {429 - 442}, abstract = {Approximation algorithms for NP-hard optimization problems have been widely studied for over three decades. Most of these measure the quality of the solution produced by taking the ratio of the cost of the solution produced by the algorithm to the cost of an optimal solution. In certain cases, this ratio may not be very meaningful{\textemdash}for example, if the ratio of the worst solution to the best solution is at most some constant α, then an approximation algorithm with factor α may in fact yield the worst solution! To overcome this hurdle (among others), several authors have independently suggested the use of a different measure which we call z-approximation. An algorithm is an α z-approximation if it runs in polynomial time and produces a solution whose distance from the optimal one is at most α times the distance between the optimal solution and the worst possible solution. The results known so far about z-approximations are either of the inapproximability type or rather straightforward observations. We design polynomial time algorithms for several fundamental discrete optimization problems; in particular we obtain a z-approximation factor of 12 for the directed traveling salesman problem (TSP) (with no triangle inequality assumption). For the undirected TSP this improves to 13. We also show that if there is a polynomial time algorithm that for any fixed ϵ\&$\#$xa0;\>\&$\#$xa0;0 yields an ϵ z-approximation then P\&$\#$xa0;=\&$\#$xa0;NP. We also present z-approximations for severa1 other problems such as max cut, stacker crane, maximum acyclic subgraph, and minimum disjoint cycle cover.}, isbn = {0196-6774}, doi = {10.1006/jagm.2001.1187}, url = {http://www.sciencedirect.com/science/article/pii/S0196677401911873}, author = {Hassin,Refael and Khuller, Samir} } @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} } @article {15711, title = {Algorithm 805: computation and uses of the semidiscrete matrix decomposition}, journal = {ACM Trans. Math. Softw.}, volume = {26}, year = {2000}, month = {2000/09//}, pages = {415 - 435}, abstract = {We present algorithms for computing a semidiscrete approximation to a matrix in a weighted norm, with the Frobenius norm as a special case. The approximation is formed as a weighted sum of outer products of vectors whose elements are {\textpm}1 or 0, so the storage required by the approximation is quite small. We also present a related algorithm for approximation of a tensor. Applications of the algorithms are presented to data compression, filtering, and information retrieval; software is provided in C and in Matlab.}, keywords = {compression, latent semantic indexing, Matrix decomposition, semidiscrete decompositin, singular value decomposition}, isbn = {0098-3500}, doi = {10.1145/358407.358424}, url = {http://doi.acm.org/10.1145/358407.358424}, author = {Kolda,Tamara G. and O{\textquoteright}Leary, Dianne P.} } @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.} } @article {15230, title = {Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem}, journal = {Algorithmica}, volume = {28}, year = {2000}, month = {2000///}, pages = {422 - 437}, abstract = {Let G=(V,E) be a complete undirected graph with vertex set V , edge set E , and edge weights l(e) satisfying triangle inequality. The vertex set V is partitioned into clusters V 1 , . . ., V k . The clustered traveling salesman problem is to compute a shortest Hamiltonian cycle (tour) that visits all the vertices, and in which the vertices of each cluster are visited consecutively. Since this problem is a generalization of the traveling salesman problem, it is NP-hard. In this paper we consider several variants of this basic problem and provide polynomial time approximation algorithms for them.}, doi = {10.1007/s004530010045}, author = {Guttmann-Beck,N. and Hassin,R. and Khuller, Samir and Raghavachari,B.} } @conference {18479, title = {Attacking the bottlenecks of backfilling schedulers}, booktitle = {Cluster Computing}, year = {2000}, month = {2000///}, author = {Zotkin,Dmitry N and Keleher,P. J and Perkovic,D.} } @article {13510, title = {Automatic Text Detection and Tracking in Digital Video}, journal = {IEEE Transactions on Image Processing - Special Issue on Image and Video Processing for Digital Libraries}, volume = {9}, year = {2000}, month = {2000/01//}, pages = {147 - 156}, abstract = {Text that appears in a scene or is graphically added to video can provide an important supplemental source of index information as well as clues for decoding the video{\textquoteright}s structure and for classification. In this work, we present algorithms for detecting and tracking text in digital video. Our system implements a scale-space feature extractor that feeds an artificial neural processor to detect text blocks. Our text tracking scheme consists of two modules: a sum of squared difference (SSD) based module to find the initial position and a contour-based module to refine the position. Experiments conducted with a variety of video sources show that our scheme can detect and track text robustly.}, author = {Li,H. and David Doermann and Kia,O.} } @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 {15235, title = {Centers of sets of pixels}, journal = {Discrete Applied Mathematics}, volume = {103}, year = {2000}, month = {2000/07/15/}, pages = {297 - 306}, abstract = {The center of a connected graph G is the set of nodes of G for which the maximum distance to any other node of G is as small as possible. If G is a simply connected set of lattice points ({\textquotedblleft}pixels{\textquotedblright}) with graph structure defined by 4-neighbor adjacency, we show that the center of G is either a 2{\texttimes}2 square block, a diagonal staircase, or a (dotted) diagonal line with no gaps.}, keywords = {Center, Chessboard distance, City block distance, Intrinsic distance, Simply connected set}, isbn = {0166-218X}, doi = {10.1016/S0166-218X(99)00248-6}, url = {http://www.sciencedirect.com/science/article/pii/S0166218X99002486}, author = {Khuller, Samir and Rosenfeld,Azriel and Wu,Angela} } @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 {15724, title = {Chromosome Identification Using Hidden Markov Models: Comparison with Neural Networks, Singular Value Decomposition, Principal Components Analysis, and Fisher Discriminant Analysis}, journal = {Laboratory Investigation}, volume = {80}, year = {2000}, month = {2000/11/01/}, pages = {1629 - 1641}, abstract = {The analysis of G-banded chromosomes remains the most important tool available to the clinical cytogeneticist. The analysis is laborious when performed manually, and the utility of automated chromosome identification algorithms has been limited by the fact that classification accuracy of these methods seldom exceeds about 80\% in routine practice. In this study, we use four new approaches to automated chromosome identification {\textemdash} singular value decomposition (SVD), principal components analysis (PCA), Fisher discriminant analysis (FDA), and hidden Markov models (HMM) {\textemdash} to classify three well-known chromosome data sets (Philadelphia, Edinburgh, and Copenhagen), comparing these approaches with the use of neural networks (NN). We show that the HMM is a particularly robust approach to identification that attains classification accuracies of up to 97\% for normal chromosomes and retains classification accuracies of up to 95\% when chromosome telomeres are truncated or small portions of the chromosome are inverted. This represents a substantial improvement of the classification accuracy for normal chromosomes, and a doubling in classification accuracy for truncated chromosomes and those with inversions, as compared with NN-based methods. HMMs thus appear to be a promising approach for the automated identification of both normal and abnormal G-banded chromosomes.}, keywords = {addiction disorders, anxiety, depression, psychopharmacology, schizophrenia}, isbn = {0023-6837}, doi = {10.1038/labinvest.3780173}, url = {http://www.nature.com/labinvest/journal/v80/n11/full/3780173a.html}, author = {Conroy,John M. and Kolda,Tamara G. and O{\textquoteright}Leary, Dianne P. and O{\textquoteright}Leary,Timothy J} } @conference {15287, title = {Comparative Evaluation of a Natural Language Dialog Based System and a Menu-Driven System for Information Access: A Case Study}, booktitle = {In Proceedings of the International Conference on Multimedia Information Retrieval (RIAO 2000)}, year = {2000}, month = {2000///}, abstract = {This paper describes the evaluation of a natural language dialog based navigation system (HappyAssistant) thathelps users access e-commerce sites to find relevant information about products and services. The prototype system leverages technologies in natural language processing and human computer interaction to create a faster and more intuitive way of interacting with websites, especially for the less experienced users. The result of a comparative study shows that users prefer the natural language enabled navigation two to one over the menu driven navigation. In addition, the study confirmed the efficiency of using natural language dialog in terms of the number of clicks and the amount of time required to obtain the relevant information. In the case study, comparing to the menu driven system, the average number of clicks used in the natural language system was reduced by 63.2\% and the average time was reduced by 33.3\%. }, author = {Chai,J. and Jimmy Lin and Zadrozny,W. and Ye,Y. and Budzikowska,M. and Horvath,V. and Kambhatla,N. and Wolf,C.} } @conference {16919, title = {A comparison of voice controlled and mouse controlled web browsing}, booktitle = {Proceedings of the fourth international ACM conference on Assistive technologies}, series = {Assets {\textquoteright}00}, year = {2000}, month = {2000///}, pages = {72 - 79}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, keywords = {human-computer, interaction, User interfaces, voice browsers, voice recognition, web browsing}, isbn = {1-58113-313-8}, doi = {10.1145/354324.354345}, url = {http://doi.acm.org/10.1145/354324.354345}, author = {Christian,Kevin and Kules,Bill and Shneiderman, Ben and Youssef,Adel} } @conference {15149, title = {Complete characterization of security notions for probabilistic private-key encryption}, booktitle = {Proceedings of the thirty-second annual ACM symposium on Theory of computing}, series = {STOC {\textquoteright}00}, year = {2000}, month = {2000///}, pages = {245 - 254}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, isbn = {1-58113-184-4}, doi = {10.1145/335305.335335}, url = {http://doi.acm.org/10.1145/335305.335335}, author = {Katz, Jonathan and Yung,Moti} } @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.} } @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 {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 {15148, title = {On the efficiency of local decoding procedures for error-correcting codes}, booktitle = {Proceedings of the thirty-second annual ACM symposium on Theory of computing}, series = {STOC {\textquoteright}00}, year = {2000}, month = {2000///}, pages = {80 - 86}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, isbn = {1-58113-184-4}, doi = {10.1145/335305.335315}, url = {http://doi.acm.org/10.1145/335305.335315}, author = {Katz, Jonathan and Trevisan,Luca} } @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.} } @conference {16341, title = {An empirical study of regression test application frequency}, booktitle = {Proceedings of the 22nd international conference on Software engineering - ICSE {\textquoteright}00}, year = {2000}, month = {2000///}, pages = {126 - 135}, address = {Limerick, Ireland}, doi = {10.1145/337180.337196}, url = {http://dl.acm.org/citation.cfm?id=337196}, author = {Kim,Jung-Min and Porter, Adam and Rothermel,Gregg} } @conference {16164, title = {Evaluation challenges for a Federation of heterogeneous information providers: the case of NASA{\textquoteright}s Earth Science Information Partnerships}, booktitle = {Enabling Technologies: Infrastructure for Collaborative Enterprises, 2000. (WET ICE 2000). Proeedings. IEEE 9th International Workshops on}, year = {2000}, month = {2000///}, pages = {130 - 135}, abstract = {NASA{\textquoteright}s Earth Science Information Partnership Federation is an experiment funded to assess the ability of a group of widely heterogeneous earth science data or service providers to self organize and provide improved and affordable access to an expanding earth science user community. As it is self-organizing, the Federation is mandated to set in place an evaluation methodology and collect metrics reflecting the outcomes and benefits of the Federation. This paper describes the challenges of organizing such a federated partnership self-evaluation and discusses the issues encountered during the metrics definition phase of the early data collection. Our experience indicates that a large number of metrics will be needed to fully represent the activities and strengths of all partners, but because of the heterogeneity of the ESIPs the qualitative data (comments accompanying the metric data and success stories) becomes the most useful information. Other lessons learned included the absolute need for online browsing tools to accompany data collection tools. Finally, our experience confirms the effect of evaluation as an agent of change, the best example being the high level of collaboration among the ESIPs which can be in part attributed to the initial identification of collaboration as one of the important evaluation factors of the Federation}, keywords = {Browsing, collection;heterogeneous, computing;groupware;, data;online, Earth, Federation;data, information, NASA{\textquoteright}s, Partnership, Science, systems;geophysics, tools;geographic}, doi = {10.1109/ENABL.2000.883717}, author = {Plaisant, Catherine and Komlodi,A. and Lindsay,F.} } @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 {14438, title = {From instances to classes in probabilistic relational models}, journal = {Proc. ICML 2000 Workshop on Attribute-Value and Relational Learning}, year = {2000}, month = {2000///}, abstract = {Probabilistic graphical models, in particular Bayesian net-works, are useful models for representing statistical pat- terns in propositional domains. Recent work develops ef- fective techniques for learning these models directly from data. However these techniques apply only to attribute-value (i.e., flat) representations of the data. Probabilistic relational models (PRMs) allow us to represent much richer depen- dency structures, involving multiple entities and the rela- tions between them; they allow the properties of an entity to depend probabilistically on properties of related entities. PRMs represent a generic dependence, which is then instan- tiated for specific circumstances, i.e., for a particular set of entities and relations between them. Friedman et al. showed how to learn PRMs from relational data, and presented tech- niques for learning both parameters and probabilistic depen- dency structure for the attributes in a relational model. Here we examine the benefit that class hierarchies can provide PRMs. We show how the introduction of subclasses allows us to use inheritance and specialization to refine our models. We show how to learn PRMs with class hierarchies (PRM- CH) in two settings. In the first, the class hierarchy is pro- vided, as part of the input, in the relational schema for the domain. In the second setting, in addition to learning the PRM, we must learn the class hierarchy. Finally we dis- cuss how PRM-CHs allow us to build models that can repre- sent models for both particular instances in our domain, and classes of objects in our domain, bridging the gap between a class-based model and an attribute-value-based model. }, author = {Getoor, Lise and Koller,D. and Friedman,N.} } @article {14971, title = {High performance computing algorithms for land cover dynamics using remote sensing data}, journal = {International Journal of Remote Sensing}, volume = {21}, year = {2000}, month = {2000///}, pages = {1513 - 1536}, abstract = {Global and regional land cover studies need to apply complex models on selected subsets of large volumes of multi-sensor and multi-temporal data sets that have been derived from raw instrument measurements using widely accepted pre-processing algorithms. The computational and storage requirements of most of these studies far exceed what is possible on a single workstation environment. We have been pursuing a new approach that couples scalable and open distributed heterogeneous hardware with the development of high performance software for processing, indexing and organizing remotely sensed data. Hierarchical data management tools are used to ingest raw data, create metadata and organize the archived data so as to automatically achieve computational load balancing among the available nodes and minimize input/output overheads. We illustrate our approach with four specific examples. The first is the development of the first fast operational scheme for the atmospheric correction of Landsat Thematic Mapper scenes, while the second example focuses on image segmentation using a novel hierarchical connected components algorithm. Retrieval of the global Bidirectional Reflectance Distribution Function in the red and near-infrared wavelengths using four years (1983 to 1986) of Pathfinder Advanced Very High Resolution Radiometer (AVHRR) Land data is the focus of our third example. The fourth example is the development of a hierarchical data organization scheme that allows on-demand processing and retrieval of regional and global AVHRR data sets. Our results show that substantial reductions in computational times can be achieved by the high performance computing technology.}, isbn = {0143-1161}, doi = {10.1080/014311600210290}, url = {http://www.tandfonline.com/doi/abs/10.1080/014311600210290}, author = {Kalluri, SNV and JaJa, Joseph F. and Bader, D.A. and Zhang,Z. and Townshend,J.R.G. and Fallah-Adl,H.} } @conference {13570, title = {Identifying Sports Videos using Replay, Text and Camera Motion Features}, booktitle = {SPIE Conference on Storage and Retrieval for Image and Video Databases}, year = {2000}, month = {2000/01//}, pages = {332 - 343}, abstract = {Automated classification of digital video is emerging as an important piece of the puzzle in the design of contentmanagement systems for digital libraries. The ability to classify videos into various classes such as sports, news, movies, or documentaries, increases the efficiency of indexing, browsing, and retrieval of video in large databases. In this paper, we discuss the extraction of features that enable identification of sports videos directly from the compressed domain of MPEG video. These features include detecting the presence of action replays, determining the amount of scene text in video, and calculating various statistics on camera and/or object motion. The features are derived from the macroblock, motion, and bit-rate information that is readily accessible from MPEG video with very minimal decoding, leading to substantial gains in processing speeds. Full-decoding of selective frames is required only for text analysis. A decision tree classifier built using these features is able to identify sports clips with an accuracy of about 93\%. }, author = {Kobla,V. and DeMenthon,D. and David Doermann} } @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.} } @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} } @article {15233, title = {The Loading Time Scheduling Problem}, journal = {Journal of Algorithms}, volume = {36}, year = {2000}, month = {2000/07//}, pages = {1 - 33}, abstract = {In this paper we study precedence constrained scheduling problems, where the tasks can only be executed on a specified subset of the set of machines. Each machine has a loading time that is incurred only for the first task that is scheduled on the machine in a particular run. This basic scheduling problem arises in the context of machining on numerically controlled machines and query optimization in databases and in other artificial intelligence applications. We give the first nontrivial approximation algorithm for this problem. We also prove nontrivial lower bounds on best possible approximation ratios for these problems. These improve on the nonapproximability results that are implied by the nonapproximability results for the shortest common supersequence problem. We use the same algorithm technique to obtain approximation algorithms for a problem arising in the context of code generation for parallel machines and for the weighted shortest common supersequence problem.}, isbn = {0196-6774}, doi = {10.1006/jagm.2000.1076}, url = {http://www.sciencedirect.com/science/article/pii/S0196677400910769}, author = {Bhatia,Randeep and Khuller, Samir and Naor,Joseph (Seffi)} } @conference {15232, title = {On local search and placement of meters in networks}, booktitle = {Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms}, series = {SODA {\textquoteright}00}, year = {2000}, month = {2000///}, pages = {319 - 328}, 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.338268}, author = {Khuller, Samir and Bhatia,Randeep and Pless,Robert} } @article {16000, title = {A logic for characterizing multiple bounded agents}, journal = {Autonomous Agents and Multi-Agent Systems}, volume = {3}, year = {2000}, month = {2000///}, pages = {351 - 387}, author = {Grant,J. and Kraus,S. and Perlis, Don} } @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.} } @article {15370, title = {A model for magnetic aftereffect in the presence of time varying demagnetizing fields}, journal = {Magnetics, IEEE Transactions on}, volume = {36}, year = {2000}, month = {2000/09//}, pages = {3182 - 3184}, abstract = {Preisach models driven by stochastic inputs are employed to model magnetic aftereffect in the presence of demagnetizing fields. As a result of thermal relaxation, the magnetization and, consequently, the demagnetizing field vary in time. The new model generalizes earlier work and self-consistently accounts for the effect of time varying demagnetizing fields on the relaxation process. Three practical numerical techniques are proposed to compute the time variation in the magnetic field and the state of the Preisach plane}, keywords = {aftereffect;, aftereffect;magnetization;numerical, demagnetizing, field;demagnetisation;magnetic, model;magnetic, Preisach, relaxation;time, simulation;thermal, varying}, isbn = {0018-9464}, doi = {10.1109/20.908729}, author = {Korman,C.E. and Adly,A.A. and Mayergoyz, Issak D and Rugkwamsook,P.} } @article {18154, title = {A Neural Network Approach for Predicting Network Resource Requirements in Video Transmission Systems}, journal = {Proc. IEEE Pacific RIM Conference on Multimedia, Sydney, Australia}, year = {2000}, month = {2000///}, abstract = {Dynamic resource allocation is important for ensuring ef-ficient network utilization in Internet-based multimedia content delivery system. To allow accurate network traf- fic prediction in the case of video delivery, relevant infor- mation based on video contents and the short term traffic pattern has to be taken into account, while the inclusion of non-relevant features will deterioriate the prediction per- formance due to the "curse of dimensionality" problem. In this work, we propose a neural network-based predic- tion system and specifically address the determination of relevant input features for the system. Experiments have shown that the current system is capable of identifying a highly relevant subset of features for traffic prediction given a large number of video content and short-term net- work traffic descriptors. }, author = {Wong,H.S. and Wu,M. and Joyce,R.A. and Guan,L. and Kung, S.Y.} } @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 {13633, title = {Residual coding in document image compression}, journal = {Image Processing, IEEE Transactions on}, volume = {9}, year = {2000}, month = {2000/06//}, pages = {961 - 969}, abstract = {Symbolic document image compression relies on the detection of similar patterns in a document image and construction of a prototype library. Compression is achieved by referencing multiple pattern instances ( ldquo;components rdquo;) through a single representative prototype. To provide a lossless compression, however, the residual difference between each component and its assigned prototype must be coded. Since the size of the residual can significantly affect the compression ratio, efficient coding is essential. We describe a set of residual coding models for use with symbolic document image compression that exhibit desirable characteristics for compression and rate-distortion and facilitate compressed-domain processing. The first model orders the residual pixels by their distance to the prototype edge. Grouping pixels based on this distance value allows for a more compact coding and lower entropy. This distance model is then extended to a model that defines the structure of the residue and uses it as a basis for continuous and packet reconstruction which provides desired functionality for use in lossy compression and progressive transmission}, keywords = {coding, coding;compressed-domain, coding;entropy;lossless, coding;image, communication;, compact, compression;data, compression;document, compression;multiple, construction;rate-distortion;representative, detection;symbolic, difference;residual, distortion, document, edge;prototype, image, library, model;efficient, models;residual, pattern, patterns, pixels;similar, processing;compression, processing;entropy;image, prototype;residual, ratio;continuous, reconstruction;distance, reconstruction;progressive, reconstruction;rate, referencing;packet, theory;visual, transmission;prototype}, isbn = {1057-7149}, doi = {10.1109/83.846239}, author = {Kia,O. E and David Doermann} } @inbook {14801, title = {Resource-aware meta-computing}, booktitle = {Emphasizing Distributed SystemsEmphasizing Distributed Systems}, volume = {Volume 53}, year = {2000}, month = {2000///}, pages = {109 - 169}, publisher = {Elsevier}, organization = {Elsevier}, abstract = {Meta-computing, is an increasingly popular and useful method of obtaining resources to solve large computational problems. However, meta-computer environments pose a number of unique challenges, many of which have yet to be addressed effectively. Among these are dynamicism in both applications and environments, and heterogeneity at several different levels. This chapter discusses current approaches to these problems, and uses them in the Active Harmony system as a running example. Harmony supports an interface that allows applications to export tuning alternatives to the higher-level system. By exposing different parameters that can be changed at runtime, applications can be automatically adapted to changes in their execution environment caused by other programs, the addition or deletion of nodes, or changes in the availability of resources like communication links. Applications expose not only options, but also expected resource utilization with each option and the effect that the option will have on the application{\textquoteright}s performance. We discuss how this flexibility can be used to tune the overall performance of a collection of applications in a system.}, isbn = {0065-2458}, url = {http://www.sciencedirect.com/science/article/pii/S0065245800800054}, author = {Hollingsworth, Jeffrey K and Keleher, Peter J. and Ryu, Kyung D.}, editor = {Marvin V. Zelkowits} } @article {14652, title = {A Review of Current Routing Protocols for Ad Hoc}, journal = {IEEE Personal Communications}, volume = {29}, year = {2000}, month = {2000///}, pages = {156 - 71}, author = {Royer,E.M. and Toh,C.K. and Hicks, Michael W. and Kakkar,P. and Moore,J. T and Hicks, Michael W. and Moore,J. T and Alexander,D. S and Gunter,C. A and Nettles,S. and others} } @conference {15311, title = {REXTOR: a system for generating relations from natural language}, booktitle = {Proceedings of the ACL-2000 workshop on Recent advances in natural language processing and information retrieval: held in conjunction with the 38th Annual Meeting of the Association for Computational Linguistics - Volume 11}, series = {RANLPIR {\textquoteright}00}, year = {2000}, month = {2000///}, pages = {67 - 77}, publisher = {Association for Computational Linguistics}, organization = {Association for Computational Linguistics}, address = {Stroudsburg, PA, USA}, abstract = {This paper argues that a finite-state language model with a ternary expression representation is currently the most practical and suitable bridge between natural language processing and information retrieval. Despite the theoretical computational inadequacies of finite-state grammars, they are very cost effective (in time and space requirements) and adequate for practical purposes. The ternary expressions that we use are not only linguistically-motivated, but also amenable to rapid large-scale indexing. REXTOR (Relations EXtracTOR) is an implementation of this model; in one uniform framework, the system provides two separate grammars for extracting arbitrary patterns of text and building ternary expressions from them. These content representational structures serve as the input to our ternary expressions indexer. This approach to natural language information retrieval promises to significantly raise the performance of current systems.}, doi = {10.3115/1117755.1117764}, url = {http://dx.doi.org/10.3115/1117755.1117764}, author = {Katz,Boris and Jimmy Lin} } @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 {15858, title = {Textual data mining to support science and technology management}, journal = {Journal of Intelligent Information Systems}, volume = {15}, year = {2000}, month = {2000///}, pages = {99 - 119}, author = {Losiewicz,P. and Oard, Douglas and Kostoff,R.N.} } @inbook {13477, title = {Using Feature Hierarchies in Bayesian Network Learning}, booktitle = {Abstraction, Reformulation, and Approximation}, series = {Lecture Notes in Computer Science}, volume = {1864}, year = {2000}, month = {2000///}, pages = {260 - 270}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {In recent years, researchers in statistics and the UAI community have developed an impressive body of theory and algorithmic machinery for learning Bayesian networks from data. Learned Bayesian networks can be used for pattern discovery, prediction, diagnosis, and density estimation tasks. Early pioneering work in this area includes [ 5 , 9 , 10 , 13 ]. The algorithm that has emerged as the current most popular approach is a simple greedy hill-climbing algorithm that searches the space of candidate structures, guided by a network scoring function (either Bayesian or Minimum Description Length (MDL)-based). The search begins with an initial candidate network (typically the empty network, which has no edges), and then considers making small local changes such as adding, deleting, or reversing an edge in the network.}, isbn = {978-3-540-67839-7}, url = {http://dx.doi.org/10.1007/3-540-44914-0_16}, author = {desJardins, Marie and Getoor,Lise and Koller,Daphne}, editor = {Choueiry,Berthe and Walsh,Toby} } @article {15605, title = {Visibility stabs and depth-first spiralling on line segments in output sensitive time}, journal = {International Journal of Computational Geometry and Applications}, volume = {10}, year = {2000}, month = {2000///}, pages = {535 - 552}, abstract = {Given a set S of n non-intersecting line segments in the plane, we present a newtechnique for e ciently traversing the endpoint visibility graph of S to solve a variety of visibility problems in output sensitive time. In particular, we develop two techniques to compute the 2n visibility polygons of the endpoints of S, in output sensitive time. Depth- rst spiralling is a technique that relies on the ordered endpoint visibility graph information to traverse the endpoints of S in a spiral-like manner using a combination of Jarvis{\textquoteright} March and depth- rst search. It is a practical method and has been implemented in C++ using LEDA. }, author = {Keil,M. and Mount, Dave and Wismath,S.K.} } @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} } @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} } @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} } @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} } @article {15228, title = {The budgeted maximum coverage problem}, journal = {Information Processing Letters}, volume = {70}, year = {1999}, month = {1999///}, pages = {39 - 45}, author = {Khuller, Samir and Moss,A. and Naor,J. S} } @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 {18639, title = {Building dependable distributed objects with the AQuA architecture}, year = {1999}, month = {1999///}, pages = {17 - 18}, url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.16.2819\&rep=rep1\&type=pdf}, author = {Michel Cukier and Ren,J. and Rubel,P. and Bakken,D. E. and Karr,D. A.} } @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.} } @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.} } @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 {13537, title = {Detection of slow-motion replay sequences for identifying sports videos}, booktitle = {Proceedings of IEEE 1999 Workshop on Multimedia Signal Processing}, year = {1999}, month = {1999///}, pages = {135 - 140}, abstract = {Automated classication of digital video is emerging as an important piece of the puzzle in the design of content management systems for digital libraries. The ability to classify videos into various genres such as sports, news, movies, or documentaries increases the efficiency of indexing, browsing, and retrieval of video in large databases. In this paper we present an automated technique for identifying slow motion replays directly from the compressed domain of MPEG video, It uses the macroblock motion and bit-rate information that is readily accessible from MPEG video with very minimal decoding, leading to enormous gains in processing speeds.}, author = {Kobla,V. and DeMenthon,D. and David Doermann} } @conference {16732, title = {DynaMat: a dynamic view management system for data warehouses}, booktitle = {Proceedings of the 1999 ACM SIGMOD international conference on Management of data}, year = {1999}, month = {1999///}, pages = {371 - 382}, author = {Kotidis,Y. and Roussopoulos, Nick} } @conference {16259, title = {Efficient perspective-accurate silhouette computation}, booktitle = {Proceedings of the fifteenth annual symposium on Computational geometry}, series = {SCG {\textquoteright}99}, year = {1999}, month = {1999///}, pages = {417 - 418}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, isbn = {1-58113-068-6}, doi = {10.1145/304893.304999}, url = {http://doi.acm.org/10.1145/304893.304999}, author = {Barequet,G. and Duncan,C. A and Goodrich,M. T and Kumar,S. and Pop, Mihai} } @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.} } @conference {14778, title = {Exposing Application Alternatives}, booktitle = {Distributed Computing Systems, International Conference on}, year = {1999}, month = {1999///}, pages = {0384 - 0384}, publisher = {IEEE Computer Society}, organization = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, abstract = {We present the design of an interface to allow applications to export tuning alternatives to a higher-level system. By exposing different parameters that can be changed at runtime, applications can be made to adapt to changes in their execution environment due to other programs, or the addition or deletion of nodes, communication links etc. An integral part of this interface is that an application not only expose its options, but also the resource utilization of each option and the effect that the option will have on the application{\textquoteright}s performance. We discuss how these options can be evaluated to tune the overall performance of a collection of applications in the system. Finally, we show preliminary results from a database application that is automatically reconfigured by the system from query shipping to data shipping based on the number of active clients.}, keywords = {computational grids, metacomputing, scheduling}, isbn = {0-7695-0222-9}, doi = {http://doi.ieeecomputersociety.org/10.1109/ICDCS.1999.776540}, author = {Keleher, Peter J. and Hollingsworth, Jeffrey K and Perkovic, Dejan} } @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 {15229, title = {Improved Methods for Approximating Node Weighted Steiner Trees and Connected Dominating Sets}, journal = {Information and Computation}, volume = {150}, year = {1999}, month = {1999/04/10/}, pages = {57 - 74}, abstract = {In this paper we study the Steiner tree problem in graphs for the case when vertices as well as edges have weights associated with them. A greedy approximation algorithm based on {\textquotedblleft}spider decompositions{\textquotedblright} was developed by Klein and Ravi for this problem. This algorithm provides a worst case approximation ratio of 2\&$\#$xa0;ln\&$\#$xa0;k, wherekis the number of terminals. However, the best known lower bound on the approximation ratio is (1-o(1))\&$\#$xa0;ln\&$\#$xa0;k, assuming thatNP⊈DTIME[nO(log\&$\#$xa0;log\&$\#$xa0;n)], by a reduction from set cover. We show that for the unweighted case we can obtain an approximation factor of ln\&$\#$xa0;k. For the weighted case we develop a new decomposition theorem and generalize the notion of {\textquotedblleft}spiders{\textquotedblright} to {\textquotedblleft}branch-spiders{\textquotedblright} that are used to design a new algorithm with a worst case approximation factor of 1.5\&$\#$xa0;ln\&$\#$xa0;k. We then generalize the method to yield an approximation factor of (1.35+ε)\&$\#$xa0;ln\&$\#$xa0;k, for any constantε\>0. These algorithms, although polynomial, are not very practical due to their high running time, since we need to repeatedly find many minimum weight matchings in each iteration. We also develop a simple greedy algorithm that is practical and has a worst case approximation factor of 1.6103\&$\#$xa0;ln\&$\#$xa0;k. The techniques developed for this algorithm imply a method of approximating node weighted network design problems defined by 0{\textendash}1 proper functions as well. These new ideas also lead to improved approximation guarantees for the problem of finding a minimum node weighted connected dominating set. The previous best approximation guarantee for this problem was 3\&$\#$xa0;ln\&$\#$xa0;nby Guha and Khuller. By a direct application of the methods developed in this paper we are able to develop an algorithm with an approximation factor of (1.35+ε)\&$\#$xa0;ln\&$\#$xa0;nfor any fixedε\>0.}, isbn = {0890-5401}, doi = {10.1006/inco.1998.2754}, url = {http://www.sciencedirect.com/science/article/pii/S0890540198927547}, author = {Guha,Sudipto and Khuller, Samir} } @inbook {15765, title = {Latent Semantic Indexing via a Semi-Discrete Matrix Decomposition}, booktitle = {The Mathematics of Information Coding, Extraction and DistributionThe Mathematics of Information Coding, Extraction and Distribution}, year = {1999}, month = {1999///}, pages = {73 - 80}, publisher = {Springer-Verlag IMA Volumes in Math. and Its Applics.}, organization = {Springer-Verlag IMA Volumes in Math. and Its Applics.}, address = {New York}, abstract = {With the electronic storage of documents comes the possibility of building search engines that can automatically choose documents relevant to a given set of topics. In information retrieval, we wish to match queries with relevant documents. Documents can be represented by the terms that appear within them, but literal matching of terms does not necessarily retrieve all relevant documents. There are a number of information retrieval systems based on inexact matches. Latent Semantic Indexing represents documents by approximations and tends to cluster documents on similar topics even if their term profiles are somewhat different. This approximate representation is usually accomplished using a low-rank singular value decomposition (SVD) approximation. In this paper, we use an alternate decomposition, the semi-discrete decomposition (SDD). For equal query times, the SDD does as well as the SVD and uses less than one-tenth the storage for the MEDLINE test set.}, author = {Kolda,Tamara G. and O{\textquoteright}Leary, Dianne P.}, editor = {Cybenko,George and O{\textquoteright}Leary, Dianne P. and Rissanen,Jorma} } @article {14408, title = {Learning probabilistic relational models}, journal = {International Joint Conference on Artificial Intelligence}, volume = {16}, year = {1999}, month = {1999///}, pages = {1300 - 1309}, abstract = {A large portion of real-world data is stored in com-mercial relational database systems. In contrast, most statistical learning methods work only with {\textquotedblleft}flat{\textquotedblright} data representations. Thus, to apply these methods, we are forced to convert our data into a flat form, thereby losing much of the relational structure present in our database. This paper builds on the recent work on probabilistic relational mod- els (PRMs), and describes how to learn them from databases. PRMs allow the properties of an object to depend probabilistically both on other proper- ties of that object and on properties of related ob- jects. Although PRMs are significantly more ex- pressive than standard models, such as Bayesian networks, we show how to extend well-known sta- tistical methods for learning Bayesian networks to learn these models. We describe both parameter estimation and structure learning {\textemdash} the automatic induction of the dependency structure in a model. Moreover, we show how the learning procedure can exploit standard database retrieval techniques for efficient learning from large datasets. We present experimental results on both real and synthetic re- lational databases. }, author = {Friedman,N. and Getoor, Lise and Koller,D. and Pfeffer,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 {13820, title = {Machine Translation}, journal = {Multilingual Information Management: Current Levels and Future Abilities}, year = {1999}, month = {1999///}, pages = {18 - 18}, author = {Bel,N. and Dorr, Bonnie J and Hovy,E. and Knight,K. and Iida,H. and Boitet,C. and Maegaard,B. and Wilks,Y.} } @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} } @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.} } @inbook {14712, title = {Network Programming Using PLAN}, booktitle = {Internet Programming LanguagesInternet Programming Languages}, series = {Lecture Notes in Computer Science}, volume = {1686}, year = {1999}, month = {1999///}, pages = {127 - 143}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {We present here a methodology for programming active networks in the environment defined by our new language PLAN (Packet Language for Active Networks). This environment presumes a two-level architecture consisting of: 1. active packets carrying PLAN code; and 2. downloadable, node-resident services written in more general-purpose languages. We present several examples which illustrate how these two features can be combined to implement various network functions.}, isbn = {978-3-540-66673-8}, url = {http://dx.doi.org/10.1007/3-540-47959-7_7}, author = {Hicks, Michael W. and Kakkar,Pankaj and Moore,Jonathan and Gunter,Carl and Nettles,Scott}, editor = {Bal,Henri and Belkhouche,Boumediene and Cardelli,Luca} } @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} } @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.} } @article {15787, title = {Pivoted Cauchy-Like Preconditioners for Regularized Solution of Ill-Posed Problems}, journal = {SIAM Journal on Scientific Computing}, volume = {21}, year = {1999}, month = {1999///}, pages = {88 - 110}, url = {http://epubs.siam.org/sam-bin/dbq/article/30897http://epubs.siam.org/sam-bin/dbq/article/30897}, author = {Kilmer,Misha E. and O{\textquoteright}Leary, Dianne P.} } @article {14722, title = {PLAN: A programming language for active networks}, journal = {ACM SIGPLAN NOTICES}, volume = {34}, year = {1999}, month = {1999///}, pages = {86 - 93}, abstract = {PLAN (Programming Language for Active Networks) is anew language for programs that are carried in the packets of a programmable network. PLAN programs replace the packet headers (which can be viewed as {\textquoteleft}dumb{\textquoteright} programs) used in current networks. As a header replacement, PLAN programs must be lightweight and of limited functionality. These limitations are mitigated by allowing PLAN code to call service routines written in other, more powerful lan- guages. These service routines may also be loaded into the routers dynamically. This two-level architecture, in which PLAN serves as a scripting or {\textquoteleft}glue{\textquoteright} language for more gen- eral services, is the primary contribution of the paper. PLAN is a strict functional language providing a limited set of primitives and datatypes. PLAN de nes primitives for remotely executing PLAN programs on other nodes, and these primitives are used to provide basic data transport in the network. Because remote execution makes debugging di cult, PLAN provides strong static guarantees to the pro- grammer, such as type safety. A more novel property aimed at protecting network availability is a guarantee that PLAN programs use a bounded amount of space and time on active routers and bandwidth in the network. }, author = {Hicks, Michael W. and Kakkar,P. and Moore,J. T and Gunter,C. A and Nettles,S.} } @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.} } @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.} } @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.} } @article {18715, title = {Solution Structure of the Proapoptotic Molecule BID: A Structural Basis for Apoptotic Agonists and Antagonists}, journal = {Cell}, volume = {96}, year = {1999}, month = {1999/03/05/}, pages = {625 - 634}, abstract = {Members of the BCL2 family of proteins are key regulators of programmed cell death, acting either as apoptotic agonists or antagonists. Here we describe the solution structure of BID, presenting the structure of a proapoptotic BCL2 family member. An analysis of sequence/structure of BCL2 family members allows us to define a structural superfamily, which has implications for general mechanisms for regulating proapoptotic activity. It appears two criteria must be met for proapoptotic function within the BCL2 family: targeting of molecules to intracellular membranes, and exposure of the BH3 death domain. BID{\textquoteright}s activity is regulated by a Caspase 8{\textendash}mediated cleavage event, exposing the BH3 domain and significantly changing the surface charge and hydrophobicity, resulting in a change of cellular localization.}, isbn = {0092-8674}, doi = {10.1016/S0092-8674(00)80573-5}, url = {http://www.sciencedirect.com/science/article/pii/S0092867400805735}, author = {McDonnell,James M and Fushman, David and Milliman,Curt L. and Korsmeyer,Stanley J. and Cowburn,David} } @conference {13649, title = {Special effect edit detection using VideoTrails: a comparison with existing techniques}, booktitle = {Proceedings of SPIE - Conference on Storage and Retrieval for Image and Video Databases VII}, year = {1999}, month = {1999///}, pages = {302 - 313}, abstract = {Video Segmentation plays an integral role in many multimedia applications such as digital libraries, content management systems, and various other video browsing, indexing, and retrieval systems. Many algorithms for segmentation of video have appeared in the past few years, Most of these algorithms perform well on cuts, but yield poor performance on gradual transitions or special effect edits. A complete video segmentation system must achieve good performance on special effect edit detection also. In this paper, we discuss the performance of our VideoTrails based algorithms with other existing special effect edit detection algorithms in literature. Results from experiments testing for the ability to detect edits from TV programs ranging from commercials to news magazine programs, and also diverse special effect edits introduced by us have been shown.}, author = {Kobla,V. and DeMenthon,D. and David Doermann} } @article {14735, title = {Specifying the PLAN Network Programming Langauge}, journal = {Electronic Notes in Theoretical Computer Science}, volume = {26}, year = {1999}, month = {1999///}, pages = {87 - 104}, abstract = {We discuss how the specification of the PLAN programming language supports the design objectives of the language. The specification aims to provide a mathematically precise operational semantics that can serve as a standard for implementing interpreters and portable programs. The semantics should also support proofs of key properties of PLAN that would hold of all conformant implementations. This paper discusses two such properties. (1) Type checking is required, but interpreters are given significant flexibility about when types are checked; the specification must support a clear description of the possible behaviors of a network of conformant implementations. (2) It is essential to have guarantees about how PLAN programs use global resources, but the specification must be flexible about extensions in the network service layer. We illustrate on of kind of issue that will arise in using to specification to prove properties of the network based on the choice of services.}, isbn = {1571-0661}, doi = {10.1016/S1571-0661(05)80285-3}, url = {http://www.sciencedirect.com/science/article/pii/S1571066105802853}, author = {Kakkar,Pankaj and Hicks, Michael W. and Moore,Jon and Gunter,Carl A.} } @conference {13662, title = {Text Enhancement in Digital Video}, booktitle = {Proceedings of SPIE - Conference on Document Recognition and Retrieval VI}, year = {1999}, month = {1999/01//}, pages = {2 - 9}, author = {Li,H. and Kia,O. and David Doermann} } @conference {14747, title = {Transparent communication for distributed objects in Java}, booktitle = {Proceedings of the ACM 1999 conference on Java Grande}, series = {JAVA {\textquoteright}99}, year = {1999}, month = {1999///}, pages = {160 - 170}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, isbn = {1-58113-161-5}, doi = {10.1145/304065.304119}, url = {http://doi.acm.org/10.1145/304065.304119}, author = {Hicks, Michael W. and Jagannathan,Suresh and Kelsey,Richard and Moore,Jonathan T. and Ungureanu,Cristian} } @article {15359, title = {3-D Device Simulation Using Intelligent Solution Method Control}, journal = {VLSI DESIGN}, volume = {6}, year = {1998}, month = {1998///}, pages = {267 - 272}, abstract = {In this paper, a hybrid solution method is implemented for solving the semiconductor trans-port equations. The hybrid "local Newton" method consists of a combination of the fixed- point iteration (FPI) and Newton{\textquoteright}s methods. The FPI technique is nearly ideally suitedto solving large, 3-D systems of semiconductor equations on machines of limited computer memory however,it has certain limitations. This motivates the local Newton method, which coordinates the use of both the FPI and Newton{\textquoteright}s methods, for convergence faster than either method alone. }, author = {Kerr,D. C. and Mayergoyz, Issak D} } @conference {16803, title = {An alternative storage organization for ROLAP aggregate views based on cubetrees}, booktitle = {ACM Sigmod Record}, volume = {27}, year = {1998}, month = {1998///}, pages = {249 - 258}, author = {Kotidis,Y. and Roussopoulos, Nick} } @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} } @article {15224, title = {Approximation algorithms for connected dominating sets}, journal = {Algorithmica}, volume = {20}, year = {1998}, month = {1998///}, pages = {374 - 387}, abstract = {The dominating set problem in graphs asks for a minimum size subset of vertices with the following property: each vertex is required to be either in the dominating set, or adjacent to some vertex in the dominating set. We focus on the related question of finding a connected dominating set of minimum size, where the graph induced by vertices in the dominating set is required to be connected as well. This problem arises in network testing, as well as in wireless communication.Two polynomial time algorithms that achieve approximation factors of 2H(Δ)+2 and H(Δ)+2 are presented, where Δ is the maximum degree and H is the harmonic function. This question also arises in relation to the traveling tourist problem, where one is looking for the shortest tour such that each vertex is either visited or has at least one of its neighbors visited. We also consider a generalization of the problem to the weighted case, and give an algorithm with an approximation factor of (c n +1) \ln n where c n ln k is the approximation factor for the node weighted Steiner tree problem (currently c n = 1.6103 ). We also consider the more general problem of finding a connected dominating set of a specified subset of vertices and provide a polynomial time algorithm with a (c+1) H(Δ) +c-1 approximation factor, where c is the Steiner approximation ratio for graphs (currently c = 1.644 ). }, doi = {10.1007/PL00009201}, author = {Guha,S. and Khuller, Samir} } @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.} } @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} } @article {13509, title = {Automatic Text Detection and Tracking in Digital Video}, volume = {LAMP-TR-028,CFAR-TR-900,CS-TR-3962}, year = {1998}, month = {1998/12//}, institution = {University of Maryland, College Park}, abstract = {Text which either appears in a scene or is graphically added to video can provide an important supplemental source of index information as well as clues for decoding the video{\textquoteright}s structure and for classification. In this paper we present algorithms for detecting and tracking text components that appear within digital video frames. Our system implements a scale-space feature extractor that feeds an artificial neural processor to extract textual regions and track their movement over time. The extracted regions can then be used as input to an appropriate Optical Character Recognition system which produces indexible keywords.}, author = {Li,H. and David Doermann and Kia,O.} } @inbook {14202, title = {Beyond the Epipolar Constraint: Integrating 3D Motion and Structure Estimation}, booktitle = {3D Structure from Multiple Images of Large-Scale Environments3D Structure from Multiple Images of Large-Scale Environments}, series = {Lecture Notes in Computer Science}, volume = {1506}, year = {1998}, month = {1998///}, pages = {109 - 123}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {This paper develops a novel solution to the problem of recovering the structure of a scene given an uncalibrated video sequence depicting the scene. The essence of the technique lies in a method for recovering the rigid transformation between the different views in the image sequence. Knowledge of this 3D motion allows for self-calibration and for subsequent recovery of 3D structure. The introduced method breaks away from applying only the traditionally used epipolar constraint and introduces a new constraint based on the interaction between 3D motion and shape. Up to now, structure from motion algorithms proceeded in two well defined steps, where the first and most important step is recovering the rigid transformation between two views, and the subsequent step is using this transformation to compute the structure of the scene in view. Here both aforementioned steps are accomplished in a synergistic manner. Existing approaches to 3D motion estimation are mostly based on the use of optic flow which however poses a problem at the locations of depth discontinuities. If we knew where depth discontinuities were, we could (using a multitude of approaches based on smoothness constraints) estimate accurately flow values for image patches corresponding to smooth scene patches; but to know the discontinuities requires solving the structure from motion problem first. In the past this dilemma has been addressed by improving the estimation of flow through sophisticated optimization techniques, whose performance often depends on the scene in view. In this paper the main idea is based on the interaction between 3D motion and shape which allows us to estimate the 3D motion while at the same time segmenting the scene. If we use a wrong 3D motion estimate to compute depth, then we obtain a distorted version of the depth function. The distortion, however, is such that the worse the motion estimate, the more likely we are to obtain depth estimates that are locally unsmooth, i.e., they vary more than the correct ones. Since local variability of depth is due either to the existence of a discontinuity or to a wrong 3D motion estimate, being able to differentiate between these two cases provides the correct motion, which yields the {\textquotedblleft}smoothest{\textquotedblright} estimated depth as well as the image locations of scene discontinuities. Although no optic flow values are computed, we show that our algorithm is very much related to minimizing the epipolar constraint when the scene in view is smooth. When however the imaged scene is not smooth, the introduced constraint has in general different properties from the epipolar constraint and we present experimental results with real sequences where it performs better.}, isbn = {978-3-540-65310-3}, url = {http://dx.doi.org/10.1007/3-540-49437-5_8}, author = {Brodsk{\'y},Tom{\'a}{\v s} and Ferm{\"u}ller, Cornelia and Aloimonos, J.}, editor = {Koch,Reinhard and Van Gool,Luc} } @article {15720, title = {BFGS with Update Skipping and Varying Memory}, journal = {SIAM Journal on Optimization}, volume = {8}, year = {1998}, month = {1998///}, pages = {1060 - 1083}, abstract = {We give conditions under which limited-memory quasi-Newton methods with exact line searches will terminate in n steps when minimizing n-dimensional quadratic functions. We show that although all Broyden family methods terminate in n steps in their full-memory versions, only BFGS does so with limited-memory. Additionally, we show that full-memory Broyden family methods with exact line searches terminate in at most n + p steps when p matrix updates are skipped. We introduce new limited-memory BFGS variants and test them on nonquadratic minimization problems.}, keywords = {bfgs, Broyden family, limited-memory, minimization, quasi-Newton, update skipping}, doi = {10.1137/S1052623496306450}, url = {http://link.aip.org/link/?SJE/8/1060/1}, author = {Kolda,Tamara G. and O{\textquoteright}Leary, Dianne P. and Nazareth,Larry} } @article {16718, title = {The Bible, Truth, and Multilingual OCR Evaluation}, year = {1998}, month = {1998/12//}, institution = {University of Maryland, College Park}, abstract = {Multilingual OCR has emerged as an important information technology, thanks to the increasing need for cross-language information access. While many research groups and companies have developed OCR algorithms for various languages, it is difficult to compare the performance of these OCR algorithms across languages. This difficulty arises because most evaluation methodologies rely on the use of a document image dataset in each of the languages and it is difficult to find document datasets in different languages that are similar in content and layout. In this paper we propose to use the Bible as a dataset for comparing OCR accuracy across languages. Besides being available in a wide range of languages, Bible translation are closely parallel in content, carefully translated, surprisingly relevant with respect to modern-day language, and quite inexpensive. A project at the University of Maryland is currently implementing this idea. We have created a scanned image dataset with groundtruth from an Arabic Bible. We have also used image degradation models to create synthetically degraded images of a French Bible. We hope to generate similar Bible datasets for other languages, and we are exploring alternative corpora such as the Koran and the Bhagavad Gita that have similar properties. Quantitative OCR evaluation based on the Arabic Bible dataset is currently in progress.}, keywords = {*BIBLE, *CORPUS, *DATASETS, *GROUNDTRUTH, *OPTICAL CHARACTER RECOGNITION, *TEST SETS, *TRANSLATIONS, accuracy, algorithms, CYBERNETICS, DOCUMENT IMAGES, DOCUMENTS, IMAGES, INFORMATION SCIENCE, LANGUAGE, linguistics, MULTILINGUAL OCR(OPTICAL CHARACTER RECOGNITION), SYMPOSIA, TEST AND EVALUATION}, url = {http://stinet.dtic.mil/oai/oai?\&verb=getRecord\&metadataPrefix=html\&identifier=ADA458666}, author = {Kanungo,Tapas and Resnik, Philip} } @conference {16188, title = {Bringing treasures to the surface: previews and overviews in a prototype for the Library of Congress National Digital Library}, booktitle = {CHI 98 conference summary on Human factors in computing systems}, series = {CHI {\textquoteright}98}, year = {1998}, month = {1998///}, pages = {187 - 188}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, keywords = {Browsing, digital libraries, metadata, multimedia, overviews, previews, World Wide Web}, isbn = {1-58113-028-7}, doi = {10.1145/286498.286665}, url = {http://doi.acm.org/10.1145/286498.286665}, author = {Plaisant, Catherine and Marchionini,Gary and Komlodi,Anita} } @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 {13700, title = {A Comparative Study of Knowledge-Based Approaches for Cross-Language}, year = {1998}, month = {1998///}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {Cross-language retrieval systems seek to use queries in one natural language to guide theretrieval of documents that might be written in another. Acquisition and representation of translation knowledge plays a central role in this process. This paper explores the util- ity of two sources of manually encoded translation knowledge, bilingual dictionaries and translation lexicons, for cross-language retrieval. We have implemented six query trans- lation techniques that use bilingual dictionaries, one based on lexical-semantic analysis, and one based on direct use of the translation output from an existing machine transla- tion system; these are compared with a document translation technique that uses output from the same existing translation system. Average precision measures on portions of the TREC collection suggest that arbitrarily selecting a single translation from a bilingual dictionary is typically no less effective than using every translation in the dictionary, that query translation using an existing machine translation system can achieve some- what better effectiveness than simple dictionary-based techniques, and that performing document translation rather than query translation may result in further improvements in retrieval effectiveness under some conditions. }, author = {Oard, Douglas and Dorr, Bonnie J and Hackett,P. and Katsova,M.} } @conference {16763, title = {The Cubetree Storage Organization}, booktitle = {VLDB}, year = {1998}, month = {1998///}, pages = {700 - 700}, author = {Roussopoulos, Nick and Kotidis,Y.} } @inbook {16255, title = {De-amortization of Algorithms}, booktitle = {Computing and CombinatoricsComputing and Combinatorics}, series = {Lecture Notes in Computer Science}, volume = {1449}, year = {1998}, month = {1998///}, pages = {4 - 14}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {De-amortization aims to convert algorithms with excellent overall speed, f ( n ) for performing n operations, into algorithms that take no more than O ( f ( n )/ n ) steps for each operation. The paper reviews several existing techniques for de-amortization of algorithms.}, isbn = {978-3-540-64824-6}, url = {http://dx.doi.org/10.1007/3-540-68535-9_4}, author = {Rao Kosaraju,S. and Pop, Mihai}, editor = {Hsu,Wen-Lian and Kao,Ming-Yang} } @article {13668, title = {The detection of duplicates in document image databases}, journal = {Image and Vision Computing}, volume = {16}, year = {1998}, month = {1998/08/24/}, pages = {907 - 920}, abstract = {Document imaging technology has developed to the point where it is not uncommon for organizations to scan large numbers of documents into databases with little or no index information. This may be done for archival purposes with an index as simple as a case number, or with the ultimate goal of automatically extracting index information for content-based queries. Maintaining the integrity of such a database is difficult, however, especially in a distributed environment where copies of the same documents may be scanned at different times.In this paper we present a novel approach to detecting duplicate documents in very large databases using only features extracted from the image. The method is based on a robust {\textquoteleft}signature{\textquoteright} extracted from each document image which is used to index into a table of previously processed documents. The system is able to deal with differences between scanned document instances such resolution, skew and image quality. The approach has a number of advantages over OCR or other recognition-based methods including speed and robustness to imaging distortions. To justify the approach and demonstrate its scalability, we have developed a simulator which allows us to change parameters of the system and examine performance while processing millions of document signatures. A complete system has been implemented and tested on a collection of technical articles and memos. }, keywords = {Document image databases, Document indexing, Duplicate detection, Shape coding}, isbn = {0262-8856}, doi = {10.1016/S0262-8856(98)00054-7}, url = {http://www.sciencedirect.com/science/article/pii/S0262885698000547}, author = {David Doermann and Huiping Li and Kia,Omid} } @conference {13538, title = {Developing High-Level Representations of Video Clips using VideoTrails}, booktitle = {Proceedings of the SPIEConference on Storage and Retrieval for Image and Video Databases VI}, volume = {3312}, year = {1998}, month = {1998///}, pages = {81 - 92}, abstract = {A high-level representation of a video clip comprising information about its physical and semantic structure isnecessary for providing appropriate processing, indexing and retrieval capabilities for video databases. We describe a novel technique which reduces a sequence of MPEG encoded video frames to a trail of points in a low dimensional space. In our earlier work, we presented techniques applicable in 3-D, but in this paper, we describe techniques that can be extended to higher dimensions where improved performance is expected. In the low-dimensional space, we can cluster frames, analyze transitions between clusters and compute properties of the resulting trail. Portions of the trail can be classi ed as either stationary or transitional, leading to high-level descriptions of the video. Tracking the interaction of clusters over time, we lay the groundwork for the complete analysis and representation of the video{\textquoteright}s physical and semantic structure. }, author = {Kobla,V. and David Doermann and Faloutsos,C.} } @article {12090, title = {DHCP++: Applying an efficient implementation method for fail-stop cryptographic protocols}, journal = {Proceedings of Global Internet (GlobeCom){\textquoteright}98}, year = {1998}, month = {1998///}, pages = {59 - 65}, author = {Arbaugh, William A. and Keromytis,A. D and Smith,J. M} } @article {13542, title = {Document Image Coding for Processing and Retrieval}, journal = {Journal of VLSI Signal Processing}, volume = {20}, year = {1998}, month = {1998///}, pages = {121 - 135}, abstract = {Document images belong to a unique class of images where the information is embedded in the language represented by a series of symbols on the page rather than in the visual objects themselves. Since these symbols tend to appear repeatedly, a domain-specific image coding strategy can be designed to facilitate enhanced compression and retrieval. In this paper we describe a coding methodology that not only exploits component-level redundancy to reduce code length but also supports efficient data access. The approach identifies and organizes symbol patterns which appear repeatedly. Similar components are represented by a single prototype stored in a library and the location of each component instance is coded along with the residual between it and its prototype. A representation is built which provides a natural information index allowing access to individual components. Compression results are competitive and compressed-domain access is superior to competing methods. Applications to network-related problems have been considered, and show promising results.}, author = {Kia,O. and David Doermann} } @article {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 {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 {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 {20053, title = {Genetic nomenclature for Trypanosoma and Leishmania.}, journal = {Mol Biochem Parasitol}, volume = {97}, year = {1998}, month = {1998 Nov 30}, pages = {221-4}, keywords = {Animals, Leishmania, Terminology as Topic, Trypanosoma}, issn = {0166-6851}, author = {Clayton, C and Adams, M and Almeida, R and Baltz, T and Barrett, M and Bastien, P and Belli, S and Beverley, S and Biteau, N and Blackwell, J and Blaineau, C and Boshart, M and Bringaud, F and Cross, G and Cruz, A and Degrave, W and Donelson, J and El-Sayed, N and Fu, G and Ersfeld, K and Gibson, W and Gull, K and Ivens, A and Kelly, J and Vanhamme, L} } @conference {15225, title = {Greedy strikes back: improved facility location algorithms}, booktitle = {Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms}, series = {SODA {\textquoteright}98}, year = {1998}, month = {1998///}, pages = {649 - 657}, publisher = {Society for Industrial and Applied Mathematics}, organization = {Society for Industrial and Applied Mathematics}, address = {Philadelphia, PA, USA}, isbn = {0-89871-410-9}, url = {http://dl.acm.org/citation.cfm?id=314613.315037}, author = {Guha,Sudipto and Khuller, Samir} } @article {15362, title = {Hydrodynamic Device Simulation with New State Variables Specially Chosen a Block Gummel Iterative Approach}, journal = {VLSI DESIGN}, volume = {6}, year = {1998}, month = {1998///}, pages = {191 - 195}, abstract = {A new numerical formulation for solving the hydrodynamic model of semiconductor devicesis presented. Themethod is based on using new variables to transform the conventional hydrodynamic equations into forms which facilitatenumerical evaluation with a block Gum- mel approach. To demonstrate the new method, we apply it to model a 0.35 wn 2-D LDD MOSFET, where robust convergence properties are observed. }, author = {Liang,W. and Kerr,D. C. and Goldsman,N. and Mayergoyz, Issak D} } @article {13575, title = {Indexing and Retrieval of MPEG-compressed video}, journal = {The Journal of Electronic Imaging}, year = {1998}, month = {1998///}, pages = {294 - 307}, abstract = {To keep pace with the increased popularity of digital video as an archival medium, thedevelopment of techniques for fast and e cient analysis of video streams is essential. In particular, solutions to the problems of storing, indexing, browsing, and retrieving video data from large multimedia databases are necessary to allow access to these collections. Given that video is often stored e ciently in a compressed format, the costly overhead of decompression can be reduced by analyzing the compressed representation directly. In earlier work, we presented compressed domain parsing techniques which identi ed shots, subshots, and scenes. In this paper, we present e cient key frame selection, feature extraction, indexing, and retrieval techniques that are directly applicable to MPEG compressed video. We develop a frame type independent representation which normalizes spatial and temporal features including frame type, frame size, macroblock encoding, and motion compensation vectors. Features for indexing are derived directly from this representation and mapped to a low- dimensional space where they can be accessed using standard database techniques. Spatial information is used as primary index into the database and temporal information is used to rank retrieved clips and enhance the robustness of the system. The techniques presented enable e cient indexing, querying, and retrieval of compressed video as demonstrated by our system which typically takes a fraction of a second to retrieve similar video scenes from a database, with over 95\% recall. }, author = {Kobla,V. and David Doermann} } @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 {16185, title = {Interfaces and tools for the library of congress national digital library program}, journal = {Information Processing \& Management}, volume = {34}, year = {1998}, month = {1998/09//}, pages = {535 - 555}, abstract = {This paper describes a collaborative effort to explore user needs in a digital library, develop interface prototypes for a digital library and suggest and prototype tools for digital librarians and users at the Library of Congress (LC). Interfaces were guided by an assessment of user needs and aimed to maximize interaction with primary resources and support both browsing and analytical search strategies. Tools to aid users and librarians in overviewing collections, previewing objects and gathering results were created and serve as the beginnings of a digital librarian toolkit. The design process and results are described and suggestions for future work are offered.}, isbn = {0306-4573}, doi = {10.1016/S0306-4573(98)00020-X}, url = {http://www.sciencedirect.com/science/article/pii/S030645739800020X}, author = {Marchionini,Gary and Plaisant, Catherine and Komlodi,Anita} } @inbook {13817, title = {Lexical Selection for Cross-Language Applications: Combining LCS with WordNet}, booktitle = {Machine Translation and the Information SoupMachine Translation and the Information Soup}, series = {Lecture Notes in Computer Science}, volume = {1529}, year = {1998}, month = {1998///}, pages = {438 - 447}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {This paper describes experiments for testing the power of large-scale resources for lexical selection in machine translation (MT) and cross-language information retrieval (CLIR). We adopt the view that verbs with similar argument structure share certain meaning components, but that those meaning components are more relevant to argument realization than to idiosyncratic verb meaning. We verify this by demonstrating that verbs with similar argument structure as encoded in Lexical Conceptual Structure (LCS) are rarely synonymous in WordNet. We then use the results of this work to guide our implementation of an algorithm for cross-language selection of lexical items, exploiting the strengths of each resource: LCS for semantic structure and WordNet for semantic content. We use the Parka Knowledge-Based System to encode LCS representations and WordNet synonym sets and we implement our lexical-selection algorithm as Parka-based queries into a knowledge base containing both information types.}, isbn = {978-3-540-65259-5}, url = {http://dx.doi.org/10.1007/3-540-49478-2_39}, author = {Dorr, Bonnie J and Katsova,Maria}, editor = {Farwell,David and Gerber,Laurie and Hovy,Eduard} } @article {15227, title = {Low Degree Spanning Trees of Small Weight}, volume = {UMIACS-TR-94-1}, year = {1998}, month = {1998/10/15/}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {Given n points in the plane, the degree-K spanning tree problemasks for a spanning tree of minimum weight in which the degree of each vertex is at most K. This paper addresses the problem of computing low-weight degree-K spanning trees for K>2. It is shown that for an arbitrary collection of n points in the plane, there exists a spanning tree of degree three whose weight is at most 1.5 times the weight of a minimum spanning tree. It is shown that there exists a spanning tree of degree four whose weight is at most 1.25 times the weight of a minimum spanning tree. These results solve open problems posed by Papadimitriou and Vazirani. Moreover, if a minimum spanning tree is given as part of the input, the trees can be computed in O(n) time. The results are generalized to points in higher dimensions. It is shown that for any d [greater than or equal to] 3, an arbitrary collection of points in DimD contains a spanning tree of degree three, whose weight is at most 5/3 times the weight of a minimum spanning tree. This is the first paper that achieves factors better than two for these problems. (Also cross-referenced as UMIACS-TR-94-1) }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu//handle/1903/611}, author = {Khuller, Samir and Raghavachari,Balaji and Young,Neal} } @article {14988, title = {Models and high-performance algorithms for global BRDF retrieval}, journal = {Computational Science Engineering, IEEE}, volume = {5}, year = {1998}, month = {1998/12//oct}, pages = {16 - 29}, abstract = {The authors describe three models for retrieving information related to the scattering of light on the Earth{\textquoteright}s surface. Using these models, they{\textquoteright}ve developed algorithms for the IBM SP2 that efficiently retrieve this information}, keywords = {algorithms;, BRDF, Earth, geomorphology;, geophysical, global, high-performance, IBM, information, light, machines;, models;, Parallel, processing;, reflectivity;, retrieval, retrieval;, scattering;, signal, SP2;, surface;}, isbn = {1070-9924}, doi = {10.1109/99.735892}, author = {Zengyan Zhang and Kalluri, SNV and JaJa, Joseph F. and Liang,Shunlin and Townshend,J.R.G.} } @article {15368, title = {A New Method to Recover Vectorial Electric Fields and Current Densities from Unstructured Meshes}, journal = {VLSI DESIGN}, volume = {6}, year = {1998}, month = {1998///}, pages = {117 - 122}, abstract = {In the context of 2-D and 3-D unstructured mixed-element meshes, a new method of recover-ing vectorial fields and currents in multidimensional simulation is introduced. The new method, called the method of edge elements, directly interpolates the projections of the vec- tors on the edges of an element into its interior. The new method is compared to two other recovery methods on the basis of resolution, consistency, and implementation ease. }, author = {Kerr,D. C. and Mayergoyz, Issak D} } @article {14721, title = {PLAN: a packet language for active networks}, journal = {SIGPLAN Not.}, volume = {34}, year = {1998}, month = {1998/09//}, pages = {86 - 93}, abstract = {PLAN (Packet Language for Active Networks) is a new language for programs that form the packets of a programmable network. These programs replace the packet headers (which can be viewed as very rudimentary programs) used in current networks. As such, PLAN programs are lightweight and of restricted functionality. These limitations are mitigated by allowing PLAN code to call node-resident service routines written in other, more powerful languages. This two-level architecture, in which PLAN serves as a scripting or {\textquoteright}glue{\textquoteright} language for more general services, is the primary contribution of this paper. We have successfully applied the PLAN programming environment to implement an IP-free internetwork.PLAN is based on the simply typed lambda calculus and provides a restricted set of primitives and datatypes. PLAN defines a special construct called a chunk used to describe the remote execution of PLAN programs on other nodes. Primitive operations on chunks are used to provide basic data transport in the network and to support layering of protocols. Remote execution can make debugging difficult, so PLAN provides strong static guarantees to the programmer, such as type safety. A more novel property aimed at protecting network availability is a guarantee that PLAN programs use a bounded amount of network resources.}, isbn = {0362-1340}, doi = {10.1145/291251.289431}, url = {http://doi.acm.org/10.1145/291251.289431}, author = {Hicks, Michael W. and Kakkar,Pankaj and Moore,Jonathan T. and Gunter,Carl A. and Nettles,Scott} } @article {14742, title = {The PLAN system for building Active Networks}, journal = {University of Pennsylvania (February 27, 1998)}, year = {1998}, month = {1998///}, author = {Hicks, Michael W. and Kakkar,P. and Moore,J. T and Gunter,C. A and Alexander,D. S and Nettles,S.} } @conference {14767, title = {Prediction and Adaptation in Active Harmony}, booktitle = {High-Performance Distributed Computing, International Symposium on}, year = {1998}, month = {1998///}, pages = {180 - 180}, publisher = {IEEE Computer Society}, organization = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, abstract = {We describe the design and early functionality of the Active Harmony global resource management system. Harmony is an infrastructure designed to efficiently execute parallel applications in large-scale, dynamic environments.Harmony differs from other projects with similar goals in that the system automatically adapts ongoing computations to changing conditions through online reconfiguration. This reconfiguration can consist of system-directed migration of work at several different levels, or automatic application adaptation through the use of tuning options exported by Harmony-aware applications.We describe early experience with work migration at the level of procedures, processes and lightweight threads.}, keywords = {adaptation, resource management., scheduling}, doi = {http://doi.ieeecomputersociety.org/10.1109/HPDC.1998.709971}, author = {Hollingsworth, Jeffrey K and Keleher, Peter J.} } @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 {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 {15705, title = {A semidiscrete matrix decomposition for latent semantic indexing information retrieval}, journal = {ACM Trans. Inf. Syst.}, volume = {16}, year = {1998}, month = {1998/10//}, pages = {322 - 346}, abstract = {The vast amount of textual information available today is useless unless it can be effectively and efficiently searched. The goal in information retrieval is to find documents that are relevant to a given user query. We can represent and document collection by a matrix whose (i, j) entry is nonzero only if the ith term appears in the jth document; thus each document corresponds to a columm vector. The query is also represented as a column vector whose ith term is nonzero only if the ith term appears in the query. We score each document for relevancy by taking its inner product with the query. The highest-scoring documents are considered the most relevant. Unfortunately, this method does not necessarily retrieve all relevant documents because it is based on literal term matching. Latent semantic indexing (LSI) replaces the document matrix with an approximation generated by the truncated singular-value decomposition (SVD). This method has been shown to overcome many difficulties associated with literal term matching. In this article we propose replacing the SVD with the semidiscrete decomposition (SDD). We will describe the SDD approximation, show how to compute it, and compare the SDD-based LSI method to the SVD-based LSI methods. We will show that SDD-based LSI does as well as SVD-based LSI in terms of document retrieval while requiring only one-twentieth the storage and one-half the time to compute each query. We will also show how to update the SDD approximation when documents are added or deleted from the document collection.}, keywords = {data mining, latent semantic indexing, semidiscrete decomposition, singular-value decomposition, text retrieval}, isbn = {1046-8188}, doi = {10.1145/291128.291131}, url = {http://doi.acm.org/10.1145/291128.291131}, author = {Kolda,Tamara G. and O{\textquoteright}Leary, Dianne P.} } @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} } @conference {13665, title = {Text Extraction and Recognition in Digital Video}, booktitle = {Proceedings of Third IAPRWorkshop on Document Analysis Systems}, year = {1998}, month = {1998///}, pages = {119 - 128}, author = {Li,H. and David Doermann and Kia,O.} } @article {15408, title = {Three-Dimensional Hydrodynamic Modeling of MOSFET Devices}, journal = {VLSI Design}, volume = {6}, year = {1998}, month = {1998///}, pages = {261 - 265}, abstract = {The hydrodynamic (HD) model of semiconductor devices is solved numerically inthree-dimensions (3-D) for the MOSFET device. The numerical instabilities of the HD model are analyzed to develop a stable discretization. The formulation is stabilized by using a new, higher-order discretization for the relaxation-time approximation (RTA) term of the energy-balance (EB) equation. The developed formulation is used to model the MOSFET. }, isbn = {1065-514X, 1563-5171}, doi = {10.1155/1998/60859}, url = {http://www.hindawi.com/journals/vlsi/1998/060859/abs/}, author = {Kerr,Daniel C. and Goldsman,Neil and Mayergoyz, Issak D} } @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} } @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 {13694, title = {Video Summarization by Curve Simplification}, booktitle = {Proceedings of ACM - Multimedia 98, Bristol, England}, year = {1998}, month = {1998///}, pages = {211 - 218}, abstract = {A video sequence can be represented as a trajectory curve in a high dimensional feature space. This emphvideo curve can be analyzed by tools similar to those developed for planar curves. In particular, the classic binary curve splitting algorithm has been found to be a useful tool for video analysis. With a splitting condition that checks the dimensionality of the curve segment being split, the video curve can be recursively simplified and represented as a tree structure, and the frames that are found to be junctions between curve segments at different levels of the tree can be used as keyframes to summarize the video sequences at different levels of detail. These keyframes can be combined in various spatial and temporal configurations for browsing purposes. We describe a simple video player that displays the keyframes sequentially and lets the user change the summarization level on the fly with a slider. We also describe an approach to automatically selecting a summarization level that provides a concise and representative set of keyframes.}, author = {DeMenthon,D. and David Doermann and Kobla,V.} } @article {13695, title = {Video Summarization by Curve Simplification}, volume = {LAMP-TR-018,CFAR-TR-889,CS-TR-3916}, year = {1998}, month = {1998/07//}, institution = {University of Maryland, College Park}, abstract = {A video sequence can be represented as a trajectory curve in a high dimensional feature space. This emphvideo curve can be analyzed by tools similar to those developed for planar curves. In particular, the classic binary curve splitting algorithm has been found to be a useful tool for video analysis. With a splitting condition that checks the dimensionality of the curve segment being split, the video curve can be recursively simplified and represented as a tree structure, and the frames that are found to be junctions between curve segments at different levels of the tree can be used as keyframes to summarize the video sequences at different levels of detail. These keyframes can be combined in various spatial and temporal configurations for browsing purposes. We describe a simple video player that displays the keyframes sequentially and lets the user change the summarization level on the fly with a slider. We also describe an approach to automatically selecting a summarization level that provides a concise and representative set of keyframes.}, author = {DeMenthon,Daniel and Kobla,Vikrant and David Doermann} } @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} } @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.} } @conference {16195, title = {Bringing treasures to the surface: iterative design for the Library of Congress National Digital Library Program}, booktitle = {Proceedings of the SIGCHI conference on Human factors in computing systems}, series = {CHI {\textquoteright}97}, year = {1997}, month = {1997///}, pages = {518 - 525}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, keywords = {browse, design process, digital libraries, dynamic query, java, preview, search, web design}, isbn = {0-89791-802-9}, doi = {10.1145/258549.259009}, url = {http://doi.acm.org/10.1145/258549.259009}, author = {Plaisant, Catherine and Marchionini,Gary and Bruns,Tom and Komlodi,Anita and Campbell,Laura} } @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 {17949, title = {Collabcad: A toolkit for integrated synchronous and asynchronous sharing of cad applications}, journal = {Proceedings TeamCAD: GVU/NIST Workshop on Collaborative Design, Atlanta, GA, USA}, year = {1997}, month = {1997///}, pages = {131 - 137}, abstract = {We are developing CollabCAD, a novel software architecture and toolkit, that supports shar-ing of arbitrary user-defined objects or applications over intranets and the internet. Developers can use CollabCAD to rapidly re-engineer existing CAD applications to be collaboration-capable or build new collaboration-capable CAD applications. CollabCAD provides the following functionalities: 1. Support for fiexible forms of sharing in which users can interact with multiple presentations of CAD applications or objects. 2. asynchronous and synchronous sharing, as well as a mixture of both, 3. effective communication between users by supporting direct manipulation of user-defined objects, and a new form of sharing called para-synchronous sharing, 4. support for asymmetric collaborations between users with 1 different roles, or, 2 systems with different input-output, hardware and network capabilities. We plan to test and evaluate CollabCAD by building collaboration systems in several CAD- oriented application areas: these include virtual reality for mechanical, architectural and molec- ular CAD, and volume visualization and volume graphics for CAD applications. }, author = {Mishra,P. and Varshney, Amitabh and Kaufman,A.} } @article {18377, title = {Comments on "Towards a framework for software measurement validation"}, journal = {Software Engineering, IEEE Transactions on}, volume = {23}, year = {1997}, month = {1997/03//}, pages = {187 - 189}, abstract = {A view of software measurement that disagrees with the model presented by Kitchenham, Pfleeger, and Fenton (1995), is given. Whereas Kitchenham et al. argue that properties used to define measures should not constrain the scale type of measures, the authors contend that that is an inappropriate restriction. In addition, a misinterpretation of Weyuker{\textquoteright}s (1988) properties is noted.}, keywords = {measurement, metrics;, software, testing;program, validation;program, verification;software}, isbn = {0098-5589}, doi = {10.1109/32.585506}, author = {Morasca,S. and Briand,L.C. and Basili, Victor R. and Weyuker,E.J. and Zelkowitz, Marvin V and Kitchenham,B. and Lawrence Pfleeger,S. and Fenton,N.} } @conference {13523, title = {Compressed Domain video indexing techniques using DCT and motion vector information in MPEG video}, booktitle = {Proceedings of SPIE - conference on Storage and Retrieval for Image and Video Databases V}, year = {1997}, month = {1997///}, pages = {200 - 211}, abstract = {Development of various multimedia applications hinges on the availability of fast and e cient storage, brows-ing, indexing, and retrieval techniques. Given that video is typically stored e ciently in a compressed format, if we can analyze the compressed representation directly, we can avoid the costly overhead of decompressing and operating at the pixel level. Compressed domain parsing of video has been presented in earlier work where a video clip is divided into shots, subshots, and scenes. In this paper, we describe key frame selection, feature extraction, and indexing and retrieval techniques that are directly applicable to MPEG compressed video. We develop a frame-type independent representation of the various types of frames present in an MPEG video in which all frames can be considered equivalent. Features are derived from the available DCT, macroblock, and motion vector information and mapped to a low-dimensional space where they can be accessed with standard database techniques. The spatial information is used as primary index while the temporal information is used to enhance the robustness of the system during the retrieval process. The techniques presented enable fast archiv- ing, indexing, and retrieval of video. Our operational prototype typically takes a fraction of a second to retrieve similar video scenes from our database, with over 95\% success. }, author = {Kobla,V. and David Doermann and Lin,K-I. and Faloutsos,C.} } @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 {13669, title = {The Detection of Duplicates in Document Image Databases}, booktitle = {ICDAR}, year = {1997}, month = {1997///}, pages = {314 - 318}, abstract = {The problem of off-line handwritten character recognition has eluded a satisfactory solution for several decades. Researchers working in the area of on-line recognition have had greater success, but the possibility of extracting on-line information from static images has not been fully explored. The experience of forensic document examiners assures us that in many cases, such information can be successfully recovered.We outline the design of a system for the recovery of temporal information from static handwritten images. We provide a taxonomy of local, regional and global temporal clues which are often found in hand-written samples, and describe methods for recovering these clues from the image. We show how this system can benefit from obtaining a comprehensive understanding of the handwriting signal and a detailed analysis of stroke and sub-stroke properties. We suggest that the recovery task requires that we break away from traditional thresholding and thinning techniques, and we provide a framework for such analysis. We demonstrate how isolated temporal clues can reliably be extracted from this framework and propose a control structure for integrating the partial information. We show how many seemingly ambiguous situations can be resolved by the derived clues and our knowledge of the writing process, and provide several examples to illustrate our approach. The support of this research by the Ricoh Corporation is gratefully acknowledged. }, author = {David Doermann and Li,H. and Kia,O.} } @conference {16461, title = {The distributed information search component (disco) and the world wide web}, booktitle = {Proc. of ACM SIGMOD Conf. on Management of Data}, year = {1997}, month = {1997///}, author = {Naacke,H. and Kapitskaia,O. and Tomasic,A. and Bonnet,P. and Raschid, Louiqa and Amouroux,R.} } @article {18382, title = {Editorial: Evaluation and assessment in software engineering}, journal = {Information and Software Technology}, volume = {39}, year = {1997}, month = {1997///}, author = {Kitchenham,B. and Brereton,P. and Budgen,D. and Linkman,S. and Almstrum,V. L and Pfleeger,S. L and Zelkowitz, Marvin V and Wallace,D.} } @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} } @conference {13552, title = {Extracting Features for Indexing MPEG-Compressed Video}, booktitle = {Proceedings of the IEEEFirst Workshop on Multimedia Signal Processing}, year = {1997}, month = {1997///}, pages = {337 - 342}, author = {Kobla,V. and David Doermann} } @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} } @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.} } @article {15952, title = {How to (plan to) meet a deadline between now and then}, journal = {Journal of Logic and Computation}, volume = {7}, year = {1997}, month = {1997///}, pages = {109 - 109}, author = {Nirkhe,M. and Kraus,S. and Miller,M. and Perlis, Don} } @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 {13578, title = {Integrated Segmentation and Clustering for Enhanced Compression of Document Images}, booktitle = {ICDAR}, year = {1997}, month = {1997///}, pages = {406 - 406}, author = {Kia,Omid E and David Doermann} } @article {15223, title = {A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees}, journal = {Journal of Algorithms}, volume = {24}, year = {1997}, month = {1997/08//}, pages = {310 - 324}, abstract = {Given a graph with edge weights satisfying the triangle inequality, and a degree bound for each vertex, the problem of computing a low-weight spanning tree such that the degree of each vertex is at most its specified bound is considered. In particular, modifying a given spanning treeTusingadoptionsto meet the degree constraints is considered. A novel network-flow-based algorithm for finding a good sequence of adoptions is introduced. The method yields a better performance guarantee than any previous algorithm. If the degree constraintd(v) for eachvis at least 2, the algorithm is guaranteed to find a tree whose weight is at most the weight of the given tree times 2\&$\#$xa0;-\&$\#$xa0;min{(d(v)\&$\#$xa0;-\&$\#$xa0;2)/(degT(v)\&$\#$xa0;-\&$\#$xa0;2)\&$\#$xa0;:\&$\#$xa0;degT(v)\&$\#$xa0;\>\&$\#$xa0;2}, where degT(v) is the initial degree ofv. Equally importantly, it takes this approach to the limit in the following sense: if any performance guarantee that is solely a function of the topology and edge weights of a given tree holds foranyalgorithm at all, then it also holds for the given algorithm. Examples are provided in which no lighter tree meeting the degree constraint exists. Linear-time algorithms are provided with the same worst-case performance guarantee. ChoosingTto be a minimum spanning tree yields approximation algorithms with factors less than 2 for the general problem on geometric graphs with distances induced by variousLpnorms. Finally, examples of Euclidean graphs are provided in which the ratio of the lengths of an optimal Traveling Salesman path and a minimum spanning tree can be arbitrarily close to 2.}, isbn = {0196-6774}, doi = {10.1006/jagm.1997.0862}, url = {http://www.sciencedirect.com/science/article/pii/S0196677497908622}, author = {Fekete,S{\'a}ndor P and Khuller, Samir and Klemmstein,Monika and Raghavachari,Balaji and Young,Neal} } @conference {13612, title = {OCR-based rate-distortion analysis of residual coding}, booktitle = {Image Processing, 1997. Proceedings., International Conference on}, volume = {3}, year = {1997}, month = {1997/10//}, pages = {690 -693 vol.3 - 690 -693 vol.3}, abstract = {Symbolic compression of document images provides access to symbols found in document images and exploits the redundancy found within them. Document images are highly structured and contain large numbers of repetitive symbols. We have shown that while symbolically compressing a document image we are able to perform compressed-domain processing. Symbolic compression forms representative prototypes for symbols and encode the image by the location of these prototypes and a residual (the difference between symbol and prototype). We analyze the rate-distortion tradeoff by varying the amount of residual used in compression for both distance- and row-order coding. A measure of distortion is based on the performance of an OCR system on the resulting image. The University of Washington document database images, ground truth, and OCR evaluation software are used for experiments}, keywords = {analysis;redundancy;representative, character, coding;distortion, coding;image, coding;lossy, coding;row-order, coding;symbolic, compression;data, compression;document, compression;lossy, database, distortion, Evaluation, image, images;document, images;experiments;ground, measure;document, OCR, of, performance;University, processing;distance-order, processing;image, prototypes;residual, recognition;rate, representation;optical, representation;progressive, software;OCR, system, theory;, transmission;rate-distortion, truth;image, Washington;compressed-domain}, doi = {10.1109/ICIP.1997.632215}, author = {Kia,O. E and David Doermann} } @conference {13681, title = {The role of compressed document images in transmission and retrieval}, booktitle = {Multimedia Signal Processing, 1997., IEEE First Workshop on}, year = {1997}, month = {1997/06//}, pages = {331 - 336}, abstract = {Document images belong to a unique class of images where the information content is contained in the language represented by a series of symbols on the page, rather than in the visual objects themselves. For this reason, it is essential to preserve the fidelity of individual components when considering methods of compression. Likewise the component level structure should be a prime consideration when ordering information for lossy or progressive transmission. We refine our work on document image compression as it applies to transmission and retrieval. We first overview the basic compression scheme, then describe a structural hierarchy which provides desirable properties for transmission. We present the results of a rate distortion experiment and discuss the implications for network applications}, keywords = {applications;progressive, coding;multimedia, component, compression;document, compression;image, computing;query, content;lossy, databases;, distortion, experiment;structural, hierarchy;symbols;visual, image, level, objects;data, processing;image, processing;visual, retrieval;image, structure;document, transmission;information, transmission;multimedia;network, transmission;rate}, doi = {10.1109/MMSP.1997.602657}, author = {Kia,O. and David Doermann} } @article {13019, title = {Satellite DNA repeat sequence variation is low in three species of burying beetles in the genus {\i}t Nicrophorus (Coleoptera: Silphidae)}, journal = {Mol Biol Evol}, volume = {14}, year = {1997}, month = {1997/11//}, pages = {1088 - 1095}, abstract = {Three satellite DNA families were identified in three species of burying beetles, Nicrophorus orbicollis, N. marginatus, and N. americanus. Southern hybridization and nucleotide sequence analysis of individual randomly cloned repeats shows that these satellite DNA families are highly abundant in the genome, are composed of unique repeats, and are species-specific. The repeats do not have identifiable core elements or substructures that are similar in all three families, and most interspecific sequence similarity is confined to homopolymeric runs of A and T. Satellite DNA from N. marginatus and N. americanus show single-base-pair indels among repeats, but single-nucleotide substitutions characterize most of the repeat variability. Although the repeat units are of similar lengths (342, 350, and 354 bp) and A + T composition (65\%, 71\%, and 71\%, respectively), the average nucleotide divergence among sequenced repeats is very low (0.18\%, 1.22\%, and 0.71\%, respectively). Transition/transversion ratios from the consensus sequence are 0.20, 0.69, and 0.70, respectively.}, author = {King,L. M and Cummings, Michael P.} } @article {13655, title = {Symbolic Compression and Processing of Document Images}, volume = {LAMP-TR-004,CFAR-TR-849,CS-TR-3734}, year = {1997}, month = {1997/01//}, institution = {University of Maryland, College Park}, abstract = {In this paper we describe a compression and representation scheme which exploits the component-level redundancy found within a document image. The approach identifies patterns which appear repeatedly, represents similar patterns with a single prototype, stores the location of pattern instances and codes the residuals between the prototypes and the pattern instances. Using a novel encoding scheme, we provide a representation which facilitates scalable lossy compression and progressive transmission, and supports document image analysis in the compressed domain. We motivate the approach, provide details of the encoding procedures, report compression results and describe a class of document image understanding tasks which operate on the compressed representation.}, author = {Kia,Omid and David Doermann and Rosenfeld,Azriel and Chellapa, Rama} } @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 {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 {15040, title = {The vegetation canopy lidar mission}, booktitle = {Proceedings of Land Satellite Information in the Next Decade, II: Sources and Applications. Bethesda (MD): American Society of Photogrammetry and Remote Sensing}, year = {1997}, month = {1997///}, pages = {100 - 112}, abstract = {The Vegetation Canopy Lidar (VCL) is the first selected mission of NASA{\textquoteright}s new EarthSystem Science Pathfinder program. The principal goal of VCL is the characterization of the three-dimensional structure of the earth; in particular, canopy vertical and horizontal structure and land surface topography. Its primary science objectives are: landcover characterization for terrestrial ecosystem modeling, monitoring and prediction; landcover characterization for climate modeling and prediction; and, production of a global reference data set of topographic spot heights and transects. VCL will provide unique data sets for understanding important environ- mental issues including climatic change and variability, biotic erosion and sustainable landuse, and will dramatically improve our estimation of global biomass and carbon stocks, fractional forest cover, forest extent and condition. It will also provide canopy data critical for biodiversity, natural hazard, and climate studies. Scheduled for launch in early 2000, VCL is an active lidar remote sensing system consisting of a five-beam instrument with 25 m contiguous along track resolution. The five beams are in a circular configuration 8 km across and each beam traces a separate ground track spaced 2 km apart, eventually producing 2 km coverage between 65{\textdegree} N and S. VCL{\textquoteright}s core measurement objectives are: (1) canopy top heights; (2) vertical distribution of intercepted surfaces (e.g. leaves and branches); and, (3) ground surface topographic elevations. These measurements are used to derive a variety of science data products including canopy heights, canopy vertical distribution, and ground elevations gridded monthly at 1{\textdegree} resolution and every 6 months at 2 km resolution, as well as a 2 km fractional forest cover product. }, author = {Dubayah, R. and Blair,J. B. and Bufton,J. L. and Clark,D. B. and JaJa, Joseph F. and Knox,R. and Luthcke,S. B. and Prince,S. and Weishampel,J.} } @conference {13696, title = {VideoTrails: Representing and Visualizing Structure in Video Sequences}, booktitle = {Proceedings of the ACMInternational Multimedia Conference}, year = {1997}, month = {1997///}, pages = {335 - 346}, author = {Kobla,V. and David Doermann and Faloutsos,C.} } @conference {13500, title = {Archiving, indexing, and retrieval of video in compressed domain}, booktitle = {SPIEConference on Multimedia Storage and Archiving Systems}, volume = {2916}, year = {1996}, month = {1996///}, pages = {78 - 89}, author = {Kobla,V. and David Doermann and Lin,K-I.} } @book {16719, title = {The Balancing Act: Combining Symbolic and Statistical Approaches to Language}, year = {1996}, month = {1996/12/06/}, publisher = {MIT Press}, organization = {MIT Press}, abstract = {Symbolic and statistical approaches to language have historically been at odds{\textemdash}the former viewed as difficult to test and therefore perhaps impossible to define, and the latter as descriptive but possibly inadequate. At the heart of the debate are fundamental questions concerning the nature of language, the role of data in building a model or theory, and the impact of the competence-performance distinction on the field of computational linguistics. Currently, there is an increasing realization in both camps that the two approaches have something to offer in achieving common goals.The eight contributions in this book explore the inevitable "balancing act" that must take place when symbolic and statistical approaches are brought together{\textemdash}including basic choices about what knowledge will be represented symbolically and how it will be obtained, what assumptions underlie the statistical model, what principles motivate the symbolic model, and what the researcher gains by combining approaches.The topics covered include an examination of the relationship between traditional linguistics and statistical methods, qualitative and quantitative methods of speech translation, study and implementation of combined techniques for automatic extraction of terminology, comparative analysis of the contributions of linguistic cues to a statistical word grouping system, automatic construction of a symbolic parser via statistical techniques, combining linguistic with statistical methods in automatic speech understanding, exploring the nature of transformation-based learning, and a hybrid symbolic/statistical approach to recovering from parser failures.}, keywords = {computational linguistics, Computational linguistics - Congresses, Computational linguistics/ Congresses, Computers / Intelligence (AI) \& Semantics, Foreign Language Study / General, Language Arts \& Disciplines / Linguistics / General, linguistics, Linguistics - Statistical methods - Congresses, Linguistics/ Statistical methods/ Congresses, Social Science / General}, isbn = {9780262611220}, author = {Klavans,Judith L. and Resnik, Philip} } @article {13524, title = {Compressed Video Segmentation}, volume = {LAMP-TR-001,CFAR-TR-839,CS-TR-3688}, year = {1996}, month = {1996/09//}, institution = {University of Maryland, College Park}, abstract = {Segmentation of video into shots and scenes in the compressed domain allows rapid, real-time analysis of video content using standard hardware. This paper presents robust techniques for parsing MPEG-compressed video sequences into shots based on their physical structure and further into scenes based on their semantic structure by identifying changes in content and camera motion. The analysis is performed in the compressed domain using available macroblock and motion vector information, and if necessary, DCT information. Motion vector analysis yields a qualitative description of the camera motion and is used to subdivide shots into subshots. Key frames for the shots and scenes can be used for browsing, indexing, and retrieval.}, author = {Kobla,Vikrant and David Doermann and Rosenfeld,Azriel} } @article {13525, title = {Compressed-domain document retrieval and analysis}, journal = {SPIE Conference of Multimedia Storage and Archiving Systems}, volume = {2916}, year = {1996}, month = {1996/11/01/}, pages = {176 - 187}, abstract = {In this paper, we first describe a structural compression technique which has been designed to facilitate document text image storage, retrieval, and processing. This technique provides an efficient representation of textural images and lends itself to lossy compression, progressive transmission, direct access to sub-regions of the document and document processing in the compressed domain. We describe a data structure which can be used to efficiently store the compressed information, provide algorithms for creating and manipulating it, and present results of document processing on images compressed form the University of Washington database.}, isbn = {0277786X}, doi = {doi:10.1117/12.257287}, url = {http://spiedigitallibrary.org/proceedings/resource/2/psisdg/2916/1/176_1?isAuthorized=no}, author = {Kia,Omid E and David Doermann and Chellapa, Rama} } @conference {13671, title = {The Development of a General Framework for Intelligent Document Image Retrieval}, booktitle = {Proceedings in the International Workshop on Document Analysis Systems}, year = {1996}, month = {1996///}, pages = {605 - 632}, author = {David Doermann and Sauvola,J. and Kauniskangas,H. and Shin,C. and Pietikainen,M. and Rosenfeld, A.} } @article {14105, title = {Differential expression of the expression site-associated gene I family in African trypanosomes}, journal = {Journal of Biological Chemistry}, volume = {271}, year = {1996}, month = {1996///}, pages = {9771 - 9771}, author = {Morgan,R. W and El-Sayed, Najib M. and Kepa,J. K and Pedram,M. and Donelson,J. E} } @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} } @conference {16319, title = {An empirical exploration of code evolution}, booktitle = {International Workshop on Empirical Studies of Software Maintenance}, year = {1996}, month = {1996///}, author = {Karr,A. and Porter, Adam and Votta,L.} } @article {14967, title = {Fast algorithms for removing atmospheric effects from satellite images}, journal = {Computational Science Engineering, IEEE}, volume = {3}, year = {1996}, month = {1996///summer}, pages = {66 - 77}, abstract = {The varied features of the earth{\textquoteright}s surface each reflect sunlight and other wavelengths of solar radiation in a highly specific way. This principle provides the foundation for the science of satellite based remote sensing. A vexing problem confronting remote sensing researchers, however, is that the reflected radiation observed from remote locations is significantly contaminated by atmospheric particles. These aerosols and molecules scatter and absorb the solar photons reflected by the surface in such a way that only part of the surface radiation can be detected by a sensor. The article discusses the removal of atmospheric effects due to scattering and absorption, ie., atmospheric correction. Atmospheric correction algorithms basically consist of two major steps. First, the optical characteristics of the atmosphere are estimated. Various quantities related to the atmospheric correction can then be computed by radiative transfer algorithms, given the atmospheric optical properties. Second, the remotely sensed imagery is corrected by inversion procedures that derive the surface reflectance. We focus on the second step, describing our work on improving the computational efficiency of the existing atmospheric correction algorithms. We discuss a known atmospheric correction algorithm and then introduce a substantially more efficient version which we have devised. We have also developed a parallel implementation of our algorithm}, keywords = {algorithms;reflectivity;remote, Atmospheric, based, computing;image, correction;atmospheric, effects;atmospheric, efficiency;inversion, enhancement;parallel, imagery;satellite, images;solar, implementation;reflected, particles;computational, photons;surface, procedures;parallel, radiation;atmospheric, radiation;remote, reflectance;atmospheric, remote, research;remotely, sensed, sensing, sensing;, sensing;satellite, techniques;geophysics}, isbn = {1070-9924}, doi = {10.1109/99.503316}, author = {Fallah-Adl,H. and JaJa, Joseph F. and Liang, S. and Townshend,J. and Kaufman,Y.J.} } @article {13555, title = {Feature Normalization for Video Indexing and Retrieval}, volume = {LAMP-TR-003,CFAR-TR-847,CS-TR-3732}, year = {1996}, month = {1996/11//}, institution = {University of Maryland, College Park}, abstract = {Fast and efficient storage, browsing, indexing, and retrieval of video is necessary for the development of various multimedia database applications. Given that video is typically stored efficiently in a compressed format, if we can analyze the compressed representation directly, we can avoid the costly overhead of decompressing and operating at the pixel level. Compressed domain parsing of video has been presented in earlier work where key frames are identified for shots, subshots, and scenes. In this paper, we describe key frame selection, feature extraction, indexing, and retrieval techniques that are directly applicable to MPEG-compressed video. We develop a frame-type independent representation of the various types of frames present in an MPEG video in which all frames can be considered equivalent. Features are derived from the available DCT, macroblock, and motion vector information and mapped to a low-dimensional space where they can be accessed using standard database techniques. The spatial information is used as primary index while the temporal information is used to enhance the robustness of the system during the retrieval process. The techniques presented enable fast archiving, indexing, and retrieval of video. Our operational prototype typically takes a fraction of a second to retrieve similar video scenes from our database, with over 95\&$\#$x0025; success.}, author = {Kobla,Vikrant and David Doermann and Lin,King-Ip (David) and Faloutsos,Christos} } @conference {17928, title = {FINESSE: a financial information spreadsheet}, booktitle = {Information Visualization {\textquoteright}96, Proceedings IEEE Symposium on}, year = {1996}, month = {1996/10//}, pages = {70 -71, 125 - 70 -71, 125}, abstract = {We outline a spreadsheet-based system for visualization of real-time financial information. Our system permits the user to define arithmetic and presentation relationships amongst the various cells of the spreadsheet. The cells contain primitives that can be numbers, text, images, functions and graphics. Presenting financial information in this format allows its intended clients, the financial analysts, to work in the familiar environment of a spreadsheet and allows them the flexibility afforded by the powerful interface of the spreadsheet paradigm. In addition, our system permits real-time visualization of the financial data stream allowing its user to visually trade the changing market trends in two and three dimensions}, keywords = {cells;text;three, data, dimensions;two, dimensions;user, financial, FINESSE;arithmetic;data, information, information;spreadsheet, interface;data, interfaces;, presentation;market, processing;real-time, programs;user, spreadsheet;functions;graphics;images;information, systems;spreadsheet, trends;numbers;presentation;real-time, visualisation;financial, visualization;financial}, doi = {10.1109/INFVIS.1996.559222}, author = {Varshney, Amitabh and Kaufman,A.} } @article {15220, title = {Graph and network algorithms}, journal = {ACM Computing Surveys}, volume = {28}, year = {1996}, month = {1996/03//}, pages = {43 - 45}, isbn = {0360-0300}, doi = {10.1145/234313.234334}, url = {http://doi.acm.org/10.1145/234313.234334}, author = {Khuller, Samir and Raghavachari,Balaji} } @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 {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} } @article {15222, title = {Landmarks in graphs}, journal = {Discrete Applied Mathematics}, volume = {70}, year = {1996}, month = {1996/10/08/}, pages = {217 - 229}, abstract = {Navigation can be studied in a graph-structured framework in which the navigating agent (which we shall assume to be a point robot) moves from node to node of a {\textquotedblleft}graph space{\textquotedblright}. The robot can locate itself by the presence of distinctively labeled {\textquotedblleft}landmark{\textquotedblright} nodes in the graph space. For a robot navigating in Euclidean space, visual detection of a distinctive landmark provides information about the direction to the landmark, and allows the robot to determine its position by triangulation. On a graph, however, there is neither the concept of direction nor that of visibility. Instead, we shall assume that a robot navigating on a graph can sense the distances to a set of landmarks.Evidently, if the robot knows its distances to a sufficiently large set of landmarks, its position on the graph is uniquely determined. This suggests the following problem: given a graph, what are the fewest number of landmarks needed, and where should they be located, so that the distances to the landmarks uniquely determine the robot{\textquoteright}s position on the graph? This is actually a classical problem about metric spaces. A minimum set of landmarks which uniquely determine the robot{\textquoteright}s position is called a {\textquotedblleft}metric basis{\textquotedblright}, and the minimum number of landmarks is called the {\textquotedblleft}metric dimension{\textquotedblright} of the graph. In this paper we present some results about this problem. Our main new results are that the metric dimension of a graph with n nodes can be approximated in polynomial time within a factor of O(log n), and some properties of graphs with metric dimension two. }, isbn = {0166-218X}, doi = {10.1016/0166-218X(95)00106-2}, url = {http://www.sciencedirect.com/science/article/pii/0166218X95001062}, author = {Khuller, Samir and Raghavachari,Balaji and Rosenfeld,Azriel} } @article {15404, title = {Simulation of the logic switching characteristics of hot-carrier-degraded ultra-thin SOI CMOS inverters}, journal = {Solid-State Electronics}, volume = {39}, year = {1996}, month = {1996/11//}, pages = {1669 - 1674}, abstract = {The switching characteristics of ultra-thin SOI CMOS inverters with hot-carrier-induced degradations are examined by using device simulations. The simulator employs a robust fixed-point iteration method to avoid conventional matrix solutions. Potential-dependent interface traps and oxide trapped charges are used to model the degradations. The effects of front and back channel degradations in an nMOS device of a CMOS inverter are investigated in steady-state and transient regimes. The nonlinear variation of interface charges cannot be simulated by using a single nMOS device alone since the transition of the inverter is also determined by the pMOS transistor. It is found that the stagnant holes generated by impact ionization have a much greater effect on the rate of the pull-down transient than that of interface charges.}, isbn = {0038-1101}, doi = {10.1016/0038-1101(96)00073-1}, url = {http://www.sciencedirect.com/science/article/pii/0038110196000731}, author = {Tai,Gwo-Chung and Korman,Can E. and Mayergoyz, Issak D} } @article {15221, title = {On strongly connected digraphs with bounded cycle length}, journal = {Discrete Applied Mathematics}, volume = {69}, year = {1996}, month = {1996/08/27/}, pages = {281 - 289}, abstract = {Given a directed graph G = (V, E), a natural problem is to choose a minimum number of the edges in E such that, for any two vertices u and v, if there is a path from u to v in E, then there is a path from u to v among the chosen edges. We show that in graphs having no directed cycle with more than three edges, this problem is equivalent to Maximum Bipartite Matching. This leads to a small improvement in the performance guarantee of the previous best approximation algorithm for the general problem.}, isbn = {0166-218X}, doi = {10.1016/0166-218X(95)00105-Z}, url = {http://www.sciencedirect.com/science/article/pii/0166218X9500105Z}, author = {Khuller, Samir and Raghavachari,Balaji and Young,Neal} } @conference {13652, title = {Structural compression for document analysis}, booktitle = {Pattern Recognition, 1996., Proceedings of the 13th International Conference on}, volume = {3}, year = {1996}, month = {1996/08//}, pages = {664 -668 vol.3 - 664 -668 vol.3}, abstract = {In this paper we describe a structural compression technique to be used for document text image storage and retrieval. The primary objective is to provide an efficient representation, storage, transmission and display. A secondary objective is to provide an encoding which allows access to specified regions within the image and facilitates traditional document processing operations without requiring complete decoding. We describe an algorithm which symbolically decomposes a document image and structurally orders the error bitmap based on a probabilistic model. The resultant symbol and error representations lend themselves to reasonably high compression ratios and are structured so as to allow operations directly on the compressed image. The compression scheme is implemented and compared to traditional compression methods}, keywords = {analysis;document, bitmap;error, coding;image, compression, compression;document, compression;symbol, decomposition;data, image, manipulation;, processing;image, ratios;document, recognition;probability;symbol, representations;structural, representations;symbolic, retrieval;document, storage;error, text}, doi = {10.1109/ICPR.1996.547029}, author = {Kia,O. E and David Doermann} } @conference {13653, title = {Structure Preserving Document Image Compression and Transmission}, booktitle = {ICIP}, year = {1996}, month = {1996///}, pages = {193 - 196}, author = {Kia,O. and David Doermann} } @article {15375, title = {A three-dimensional MOSFET solver implementing the fixed point iteration technique}, journal = {Solid-State Electronics}, volume = {39}, year = {1996}, month = {1996/01//}, pages = {147 - 157}, abstract = {Our implementation of a fixed-point iteration technique for the three-dimensional (3D) steady-state simulation of MOSFET devices is presented. The simulation program is employed to investigate narrow channel effects on the device current-voltage characteristics. Particularly, the effects of impact ionization and the effects of variations in channel width and the field oxide bird{\textquoteright}s beak angle are evaluated. The degree to which various field oxide configurations isolate the device from the gate contact over the oxide transition region is determined by comparing the current-voltage characteristics with those of an idealized device with perfect isolation. Perfect isolation is simulated by setting the normal component of the electric field to zero at the semiconductor-field oxide interface. Simulation results show that the 3D computations are essential to account for rapidly varying charge densities and generation rates near the channel edge. Moreover, it is observed that the isolation effects of field oxides increase for larger bird{\textquoteright}s beak angles.}, isbn = {0038-1101}, doi = {10.1016/0038-1101(95)00103-Z}, url = {http://www.sciencedirect.com/science/article/pii/003811019500103Z}, author = {Madabhushi,Rajiv and Korman,Can E. and Mayergoyz, Issak D} } @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 {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 {16205, title = {Where is information visualization technology going?}, booktitle = {Proceedings of the 9th annual ACM symposium on User interface software and technology}, series = {UIST {\textquoteright}96}, year = {1996}, month = {1996///}, pages = {75 - 77}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, isbn = {0-89791-798-7}, doi = {10.1145/237091.237101}, url = {http://doi.acm.org/10.1145/237091.237101}, author = {Hasco{\"e}t-Zizi,Mountaz and Ahlberg,Chris and Korfhage,Robert and Plaisant, Catherine and Chalmers,Matthew and Rao,Ramana} } @article {15216, title = {Approximating the minimum equivalent digraph}, journal = {SIAM Journal on Computing (SICOMP)}, volume = {24}, year = {1995}, month = {1995///}, pages = {859 - 872}, author = {Khuller, Samir and Raghavachari,B. and Young,N.} } @article {15217, title = {Balancing minimum spanning trees and shortest-path trees}, journal = {Algorithmica}, volume = {14}, year = {1995}, month = {1995///}, pages = {305 - 321}, abstract = {We give a simple algorithm to find a spanning tree that simultaneously approximates a shortest-path tree and a minimum spanning tree. The algorithm provides a continuous tradeoff: given the two trees and agamma>0, the algorithm returns a spanning tree in which the distance between any vertex and the root of the shortest-path tree is at most 1+radic2gamma times the shortest-path distance, and yet the total weight of the tree is at most 1+radic2/gamma times the weight of a minimum spanning tree. Our algorithm runs in linear time and obtains the best-possible tradeoff. It can be implemented on a CREW PRAM to run a logarithmic time using one processor per vertex.}, doi = {10.1007/BF01294129}, author = {Khuller, Samir and Raghavachari,B. and Young,N.} } @conference {16363, title = {Code generation for multiple mappings}, booktitle = {Frontiers of Massively Parallel Computation, 1995. Proceedings. Frontiers {\textquoteright}95., Fifth Symposium on the}, year = {1995}, month = {1995/02/06/9}, pages = {332 - 341}, publisher = {IEEE}, organization = {IEEE}, abstract = {There has been a great amount of recent work toward unifying iteration reordering transformations. Many of these approaches represent transformations as affine mappings from the original iteration space to a new iteration space. These approaches show a great deal of promise, but they all rely on the ability to generate code that iterates over the points in these new iteration spaces in the appropriate order. This problem has been fairly well-studied in the case where all statements use the same mapping. We have developed an algorithm for the less well-studied case where each statement uses a potentially different mapping. Unlike many other approaches, our algorithm can also generate code from mappings corresponding to loop blocking. We address the important trade-off between reducing control overhead and duplicating code}, keywords = {code generation, Computer science, Concurrent computing, control overhead, Educational institutions, iteration reordering transformations, Law, Legal factors, loop blocking, multiple mappings, optimisation, optimising compilers, Optimizing compilers, PARALLEL PROCESSING, Performance analysis, program compilers}, isbn = {0-8186-6965-9}, doi = {10.1109/FMPC.1995.380437}, author = {Kelly,W. and Pugh, William and Rosser,E.} } @conference {14955, title = {Efficient Algorithms for Atmospheric Correction of Remotely Sensed Data}, booktitle = {Supercomputing, 1995. Proceedings of the IEEE/ACM SC95 Conference}, year = {1995}, month = {1995///}, pages = {12 - 12}, abstract = {Remotely sensed imagery has been used for developing and validating various studies regarding land cover dynamics. However, the large amounts of imagery collected by the satellites are largely contaminated by the effects of atmospheric particles. The objective of atmospheric correction is to retrieve the surface reflectance from remotely sensed imagery by removing the atmospheric effects. We introduce a number of computational techniques that lead to a substantial speedup of an atmospheric correction algorithm based on using look-up tables. Excluding I/O time, the previous known implementation processes one pixel at a time and requires about 2.63 seconds per pixel on a SPARC-10 machine, while our implementation is based on processing the whole image and takes about 4-20 microseconds per pixel on the same machine. We also develop a parallel version of our algorithm that is scalable in terms of both computation and I/O. Experimental results obtained show that a Thematic Mapper (TM) image (36 MB per band, 5 bands need to be corrected) can be handled in less than 4.3 minutes on a 32-node CM-5 machine, including I/O time.}, keywords = {Atmospheric, AVHRR;, computing;, correction;, high, I/O;, Parallel, performance, processing;, remote, scalable, sensing;, TM;}, doi = {10.1109/SUPERC.1995.242453}, author = {Fallah-Adl,H. and JaJa, Joseph F. and Liang,Shunlin and Kaufman,Y.J. and Townshend,J.} } @conference {16375, title = {Finding Legal Reordering Transformations using Mappings}, booktitle = {Languages and compilers for parallel computing: 7th International Workshop, Ithaca, NY, USA, August 8-10, 1994: proceedings}, volume = {7}, year = {1995}, month = {1995///}, pages = {107 - 107}, abstract = {We present a unified framework for applying iteration reordering transformations. This framework is able to represent traditional transformations such as loop interchange, loop skewing and loop distribution as well as compositions of these transformations. Using a unified framework rather than a sequence of adhoc transformations makes it easier to analyze and predict the effects of these transformations. Our framework is based on the idea that all reordering transformations can be represented as a mapping from the original iteration space to a new iteration space. An optimizing compiler would use our framework by finding a mapping that both corresponds to a legal transformation and produces efficient code. We present the mapping selection problem as a search problem by decomposing it into a sequence of smaller choices. We then characterize the set of all legal mappings by defining a search tree.}, doi = {10.1007/BFb0025874}, author = {Pugh, William and Kelly, Wayne} } @article {14615, title = {Genome Sequence Comparison and Scenarios for Gene Rearrangements: A Test Case}, journal = {Genomics}, volume = {30}, year = {1995}, month = {1995/11//}, pages = {299 - 311}, abstract = {As large portions of related genomes are being sequenced, methods for comparing complete or nearly complete genomes, as opposed to comparing individual genes, are becoming progressively more important. A major, widespread phenomenon in genome evolution is the rearrangement of genes and gene blocks. There is, however, no consistent method for genome sequence comparison combined with the reconstruction of the evolutionary history of highly rearranged genomes. We developed a schema for genome sequence comparison that includes three successive steps: (i) comparison of all proteins encoded in different genomes and generation of genomic similarity plots; (ii) construction of an alphabet of conserved genes and gene blocks; and (iii) generation of most parsimonious genome rearrangement scenarios. The approach is illustrated by a comparison of the herpesvirus genomes that constitute the largest set of relatively long, complete genome sequences available to date. Herpesviruses have from 70 to about 200 genes; comparison of the amino acid sequences encoded in these genes results in an alphabet of about 30 conserved genes comprising 7 conserved blocks that are rearranged in the genomes of different herpesviruses. Algorithms to analyze rearrangements of multiple genomes were developed and applied to the derivation of most parsimonious scenarios of herpesvirus evolution under different evolutionary models. The developed approaches to genome comparison will be applicable to the comparative analysis of bacterial and eukaryotic genomes as soon as their sequences become available.}, isbn = {0888-7543}, doi = {10.1006/geno.1995.9873}, url = {http://www.sciencedirect.com/science/article/pii/S0888754385798734}, author = {Hannenhalli, Sridhar and Chappey,Colombe and Koonin,Eugene V. and Pevzner,Pavel A.} } @article {15218, title = {Graphbots: Mobility in discrete spaces}, journal = {Automata, Languages and Programming}, year = {1995}, month = {1995///}, pages = {593 - 604}, abstract = {Most previous theoretical work on motion planning has addressed the problem of path planning for geometrically simple robots in geometrically simple regions of Euclidean space (e.g., a planar region containing polygonal obstacles). In this paper we define a natural version of the motion planning problem in a graph theoretic setting. We establish conditions under which a ldquorobotrdquo or team of robots having a particular graph structure can move from any start location to any goal destination in a graph-structured space.}, doi = {10.1007/3-540-60084-1_108}, author = {Khuller, Samir and Rivlin,E. and Rosenfeld, A.} } @conference {13568, title = {Hybrid thinning through reconstruction}, booktitle = {Document Analysis and Recognition, 1995., Proceedings of the Third International Conference on}, volume = {2}, year = {1995}, month = {1995/08//}, pages = {632 -635 vol.2 - 632 -635 vol.2}, abstract = {One difficulty with many pixel-wise thinning algorithms is that they produce unacceptable results at junction points, or in the presence of contour noise. The authors present a novel approach to detecting ambiguous regions in a thinned image. The method uses the reconstructability properties of appropriate thinning algorithms to reverse the thinning process and automatically detect those pixels which may have resulted from more then one stroke in the image. The ambiguous regions are then interpreted and reconstructed using domain specific or derived contextual information. The approach has the advantage of using local methods to rapidly identify strokes (or regions) which have been thinned correctly and allowing more detailed analysis based on non-local methods in the remaining regions}, keywords = {algorithms;edge, ambiguous, detection;automatic, detection;contextual, detection;image, information;contour, methods;nonlocal, methods;pixel-wise, noise;hybrid, Pixel, points;local, reconstruction;image, region, segmentation;noise;, stroke;junction, thinning, thinning;image}, doi = {10.1109/ICDAR.1995.601975}, author = {David Doermann and Kia,O.} } @conference {15219, title = {Improved approximation algorithms for uniform connectivity problems}, booktitle = {Proceedings of the twenty-seventh annual ACM symposium on Theory of computing}, series = {STOC {\textquoteright}95}, year = {1995}, month = {1995///}, pages = {1 - 10}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, isbn = {0-89791-718-9}, doi = {10.1145/225058.225066}, url = {http://doi.acm.org/10.1145/225058.225066}, author = {Khuller, Samir and Raghavachari,Balaji} } @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 {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} } @article {14816, title = {The Paradyn parallel performance measurement tool}, journal = {Computer}, volume = {28}, year = {1995}, month = {1995/11//}, pages = {37 - 46}, abstract = {Paradyn is a tool for measuring the performance of large-scale parallel programs. Our goal in designing a new performance tool was to provide detailed, flexible performance information without incurring the space (and time) overhead typically associated with trace-based tools. Paradyn achieves this goal by dynamically instrumenting the application and automatically controlling this instrumentation in search of performance problems. Dynamic instrumentation lets us defer insertion until the moment it is needed (and remove it when it is no longer needed); Paradyn{\textquoteright}s Performance Consultant decides when and where to insert instrumentation}, keywords = {Aerodynamics, Automatic control, automatic instrumentation control, Debugging, dynamic instrumentation, flexible performance information, high level languages, insertion, Instruments, large-scale parallel program, Large-scale systems, measurement, Paradyn parallel performance measurement tool, Parallel machines, parallel programming, Performance Consultant, Programming profession, scalability, software performance evaluation, software tools}, isbn = {0018-9162}, doi = {10.1109/2.471178}, author = {Miller, B. P and Callaghan, M. D and Cargille, J. M and Hollingsworth, Jeffrey K and Irvin, R. B and Karavanic, K. L and Kunchithapadam, K. and Newhall, T.} } @article {15215, title = {A simple randomized sieve algorithm for the closest-pair problem}, journal = {Information and Computation}, volume = {118}, year = {1995}, month = {1995///}, pages = {34 - 37}, abstract = {We present a linear time randomized sieve algorithm for the closest-pair problem. Thealgorithm as well as its analysis are simple. The algorithm is extended to obtain a randomized linear time approximation algorithm for the closest bichromatic pair problem. }, author = {Khuller, Samir and Matias,Y.} } @article {15406, title = {Switching as an exit problem}, journal = {Magnetics, IEEE Transactions on}, volume = {31}, year = {1995}, month = {1995/11//}, pages = {3545 - 3547}, abstract = {Previously, it has been shown that Preisach type models driven by stochastic inputs can be employed to model aftereffect. In this model, the machinery of the ldquo;exit problem rdquo; is instrumental in computing the time evolutions of the expected value and the distributions of switching times. Here, for the first time, we present numerical simulation results of the aforementioned viscosity models and demonstrate that these models can be employed to compute switching times and time evolutions of the expected value of magnetization}, keywords = {aftereffect;magnetic, aftereffect;stochastic, analysis;, distribution;viscosity, force;fluctuations;magnetic, hysteresis;magnetic, inputs;switching, models;coercive, models;exit, Preisach, problem;expected, switching;numerical, times, type, value;magnetization;model}, isbn = {0018-9464}, doi = {10.1109/20.489564}, author = {Korman,C.E. and Mayergoyz, Issak D} } @article {15985, title = {Thinking takes time: a modal active-logic for reasoning in time}, journal = {Proc. of BISFAI-95}, year = {1995}, month = {1995///}, author = {Nirkhe,M. and Kraus,S. and Perlis, Don} } @conference {16376, title = {A unifying framework for iteration reordering transformations}, booktitle = {Algorithms and Architectures for Parallel Processing, 1995. ICAPP 95. IEEE First ICA/sup 3/PP., IEEE First International Conference on}, volume = {1}, year = {1995}, month = {1995///}, pages = {153 - 162}, author = {Kelly,W. and Pugh, William} } @article {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.} } @conference {17943, title = {Voxel based object simplification}, booktitle = {Proceedings of the 6th conference on Visualization {\textquoteright}95}, series = {VIS {\textquoteright}95}, year = {1995}, month = {1995///}, pages = {296{\textendash} - 296{\textendash}}, publisher = {IEEE Computer Society}, organization = {IEEE Computer Society}, address = {Washington, DC, USA}, abstract = {Presents a simple, robust and practical method for object simplification for applications where gradual elimination of high-frequency details is desired. This is accomplished by sampling and low-pass filtering the object into multi-resolution volume buffers and applying the marching cubes algorithm to generate a multi-resolution triangle-mesh hierarchy. Our method simplifies the genus of objects and can also help existing object simplification algorithms achieve better results. At each level of detail, a multi-layered mesh can be used for an optional and efficient antialiased rendering.}, keywords = {antialiased rendering, antialiasing, buffer storage, data visualisation, high-frequency detail elimination, low-pass filtering, low-pass filters, marching cubes algorithm, mesh generation, multi-layered mesh, multi-resolution triangle-mesh hierarchy, multi-resolution volume buffers, object genus, Rendering (computer graphics), sampling, Smoothing methods, voxel based object simplification}, isbn = {0-8186-7187-4}, url = {http://dl.acm.org/citation.cfm?id=832271.833850}, author = {He,Taosong and Hong,Lichan and Kaufman,A. and Varshney, Amitabh and Wang,S.} } @article {13413, title = {AAAI 1994 Spring Symposium Series Reports}, journal = {AI Magazine}, volume = {15}, year = {1994}, month = {1994/09/15/}, pages = {22 - 22}, isbn = {0738-4602}, doi = {10.1609/aimag.v15i3.1101}, url = {http://www.aaai.org/ojs/index.php/aimagazine/article/viewArticle/1101}, author = {Woods,William and Uckun,Sendar and Kohane,Isaac and Bates,Joseph and Hulthage,Ingemar and Gasser,Les and Hanks,Steve and Gini,Maria and Ram,Ashwin and desJardins, Marie and Johnson,Peter and Etzioni,Oren and Coombs,David and Whitehead,Steven} } @article {15213, title = {Biconnectivity approximations and graph carvings}, journal = {Journal of the ACM (JACM)}, volume = {41}, year = {1994}, month = {1994/03//}, pages = {214 - 235}, abstract = {A spanning tree in a graph is the smallest connected spanning subgraph. Given a graph, how does one find the smallest (i.e., least number of edges) 2-connected spanning subgraph (connectivity refers to both edge and vertex connectivity, if not specified)? Unfortunately, the problem is known to be NP-hard.We consider the problem of finding a better approximation to the smallest 2-connected subgraph, by an efficient algorithm. For 2-edge connectivity, our algorithm guarantees a solution that is no more than 3/2 times the optimal. For 2-vertex connectivity, our algorithm guarantees a solution that is no more than 5/3 times the optimal. The previous best approximation factor is 2 for each of these problems. The new algorithms (and their analyses) depend upon a structure called a carving of a graph, which is of independent interest. We show that approximating the optimal solution to within an additive constant is NP-hard as well. We also consider the case where the graph has edge weights. For this case, we show that an approximation factor of 2 is possible in polynomial time for finding a k-edge connected spanning subgraph. This improves an approximation factor of 3 for k = 2, due to Frederickson and Ja{\textasciiacute}Ja{\textasciiacute} [1981], and extends it for any k (with an increased running time though). }, keywords = {biconnectivity, connectivity, sparse subgraphs}, isbn = {0004-5411}, doi = {10.1145/174652.174654}, url = {http://doi.acm.org/10.1145/174652.174654}, author = {Khuller, Samir and Vishkin, Uzi} } @article {18821, title = {Building MRSEV models for CAM applications}, journal = {Advances in Engineering Software}, volume = {20}, year = {1994}, month = {1994///}, pages = {121 - 139}, abstract = {In integrating CAD and CAM applications, one major problem is how to interpret CAD information in a manner that makes sense for CAM. The goal is to develop a general approach that can be used with a variety of CAD and CAM applications for the manufacture of machined parts.In particular, a methodology is presented for taking a CAD model, extracting alternative interpretations of the model as collections of MRSEVs (material removal shape element volumes, a STEP-based library of machining features), and evaluating these interpretations to determine which one is optimal. The evaluation criteria may be defined by the user, in order to select the best interpretation for the particular application at hand. }, keywords = {CAD/CAM integration, design critiquing, feature recognition}, isbn = {0965-9978}, doi = {10.1016/0965-9978(94)90054-X}, url = {http://www.sciencedirect.com/science/article/pii/096599789490054X}, author = {Gupta, Satyandra K. and Kramer,Thomas R. and Nau, Dana S. and Regli,William C. and Zhang,Guangming} } @article {15992, title = {Calibrating, Counting, Grounding, Grouping}, volume = {FS-94-03}, year = {1994}, month = {1994///}, institution = {Association for the Advancement of Artificial Intelligence}, author = {Elgot-drapkin,J. and Gordon,D. and Kraus,S. and Miller,M. and Nirkhe,M. and Perlis, Don} } @article {13742, title = {Concept-based lexical selection}, journal = {Proceedings of the AAAI-94 Fall Symposium on Knowledge Representation for Natural Language Processing in Implemented Systems}, year = {1994}, month = {1994///}, author = {Dorr, Bonnie J and Voss,C. and Peterson,E. and Kiker,M.} } @article {15211, title = {Flow in planar graphs with vertex capacities}, journal = {Algorithmica}, volume = {11}, year = {1994}, month = {1994///}, pages = {200 - 225}, abstract = {Max-flow in planar graphs has always been studied with the assumption that there are capacities only on the edges. Here we consider a more general version of the problem when the vertices as well as edges have capacity constraints. In the context of general graphs considering only edge capacities is not restrictive, since the vertex-capacity problem can be reduced to the edge-capacity problem. However, in the case of planar graphs this reduction does not maintainplanarity and cannot be used. We study different versions of the planar flow problem (all of which have been extensively investigated in the context of edge capacities).}, doi = {10.1007/BF01240733}, author = {Khuller, Samir and Naor,J.} } @article {15407, title = {The input dependent Preisach model with stochastic input as a model for aftereffect}, journal = {Magnetics, IEEE Transactions on}, volume = {30}, year = {1994}, month = {1994/11//}, pages = {4368 - 4370}, abstract = {In a previous work, it has been suggested to use the Preisach model driven by stochastic inputs as a model for aftereffect. Here, we further extend this approach by employing the more accurate nonlinear input dependent Preisach model. The time evolution of the expected value of the output (magnetization) is derived in terms of the stochastic description of the input. It is shown that the mathematical machinery of the ldquo;exit problem rdquo; is instrumental for calculations of time evolutions of the expected value of the output of the nonlinear input dependent Preisach model}, keywords = {aftereffect;input, aftereffect;magnetic, dependent, evolutions;magnetic, hysteresis;, input;time, model;stochastic, Preisach}, isbn = {0018-9464}, doi = {10.1109/20.334090}, author = {Korman,C.E. and Mayergoyz, Issak D} } @conference {11924, title = {Integrated approaches for improving the effectiveness of Plan Reuse (A Progress Report)}, booktitle = {ARPA/Rome Laboratory knowledge-based planning and scheduling initiative: workshop proceedings: Tuscon, Arizona, February 21-24, 1994}, year = {1994}, month = {1994///}, pages = {325 - 325}, author = {Kambhampati,S. and Ihrig,L. and Katukam,S. and Chen,J. and Hendler,J. A and Agrawala, Ashok K.} } @article {13802, title = {Introduction: Special issue on building lexicons for machine translation}, journal = {Machine Translation}, volume = {9}, year = {1994}, month = {1994///}, pages = {151 - 153}, isbn = {0922-6567}, url = {http://dx.doi.org/10.1007/BF00980576}, author = {Dorr, Bonnie J and Klavans,Judith} } @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 {18984, title = {P element-mediated in vivo deletion analysis of white-apricot: deletions between direct repeats are strongly favored.}, journal = {GeneticsGenetics}, volume = {136}, year = {1994}, month = {1994/03/01/}, pages = {1001 - 1011}, abstract = {We have isolated and characterized deletions arising within a P transposon, P[hswa], in the presence of P transposase. P[hswa] carries white-apricot (wa) sequences, including a complete copia element, under the control of an hsp70 promoter, and resembles the original wa allele in eye color phenotype. In the presence of P transposase, P[hswa] shows a high overall rate (approximately 3\%) of germline mutations that result in increased eye pigmentation. Of 234 derivatives of P[hswa] with greatly increased eye pigmentation, at least 205 carried deletions within copia. Of these, 201 were precise deletions between the directly repeated 276-nucleotide copia long terminal repeats (LTRs), and four were unique deletions. High rates of transposase-induced precise deletion were observed within another P transposon carrying unrelated 599 nucleotide repeats (yeast 2 mu FLP; recombinase target sites) separated by 5.7 kb. Our observation that P element-mediated deletion formation occurs preferentially between direct repeats suggests general methods for controlling deletion formation.}, isbn = {0016-6731, 1943-2631}, url = {http://www.genetics.org/content/136/3/1001}, author = {Kurkulos,M. and Weinberg,J. M. and Roy,D. and Mount, Stephen M.} } @article {15214, title = {On the parallel complexity of digraph reachability}, journal = {Information Processing Letters}, volume = {52}, year = {1994}, month = {1994/12/09/}, pages = {239 - 241}, abstract = {We formally show that the directed graph reachability problem can be reduced to several problems using a linear number of processors; hence an efficient parallel algorithm to solve any of these problems would imply an efficient parallel algorithm for the directed graph reachability problem. This formally establishes that all these problems are at least as hard as the s-t reachability problem.}, keywords = {combinatorial problems, Parallel algorithms}, isbn = {0020-0190}, doi = {10.1016/0020-0190(94)00153-7}, url = {http://www.sciencedirect.com/science/article/pii/0020019094001537}, author = {Khuller, Samir and Vishkin, Uzi} } @article {15374, title = {A parallel-in-time method for the transient simulation of SOI devices with drain current overshoots}, journal = {Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on}, volume = {13}, year = {1994}, month = {1994/08//}, pages = {1035 - 1044}, abstract = {This paper presents a new parallel-in-time algorithm for the two dimensional transient simulation of SOI devices. With this approach, simulation in both space and time domains is performed in parallel As a result, the CPU time is reduced significantly from the conventional serial-in-time method. This new approach fully exploits the inherent parallelism of the finite difference formulation of the basic semiconductor device equations and the massively parallel architecture of SIMD computers. The space domain computations are inherently parallel due to the nature of our technique of solving the finite-difference equations. Time domain parallelism is achieved by shifting the potentials from previous time points to subsequent points one-step forward along the time axis with each Gummel iteration. This algorithm employs a fixed-point iteration technique, therefore a direct solution of matrix equations is avoided. The algorithm is especially suitable for the transient simulation of SOI devices that exhibit transient drain current overshoot. Numerical experiments show that the new parallel-in-time method is up to eight times faster than the conventional serial-in-time method in SOI transient simulations. The program is coded in CM Fortran for the Connection Machine}, keywords = {2D, algorithms;semiconductor, analysis;transient, architecture;parallel-in-time, boundaries;silicon;time-domain, computations;time, computers;SOI, computing;finite, current, device, devices;drain, devices;parallel, difference, dimensional, domain, effect, engineering, equations;fixed-point, equations;space, field, Fortran;CPU, gate, iteration, iteration;SIMD, Machine;Gummel, method;semiconductor, methods;insulated, methods;metal-insulator-semiconductor, models;semiconductor-insulator, overshoots;finite-difference, Parallel, parallelism;transient, response;, simulation;CM, simulation;digital, simulation;electronic, simulation;two, technique;massively, time;Connection, transistors;iterative}, isbn = {0278-0070}, doi = {10.1109/43.298039}, author = {Tai,G.-C. and Korman,C.E. and Mayergoyz, Issak D} } @article {15212, title = {A primal-dual parallel approximation technique applied to weighted set and vertex covers}, journal = {Journal Algorithms}, volume = {17}, year = {1994}, month = {1994///}, pages = {280 - 289}, author = {Khuller, Samir and Vishkin, Uzi and Young,N.} } @article {15405, title = {Simulation of the transient characteristics of partially- and fully-depleted SOI MOSFETs}, journal = {Solid-State Electronics}, volume = {37}, year = {1994}, month = {1994/07//}, pages = {1387 - 1394}, abstract = {We present a numerical technique which employs a local-in-time initial guess for the transient simulation of SOI MOSFETs. Specifically, the goal of this work is to compute the transient drain current which exhibits overshoot. A critical factor in such computations is the choice of the initial guess at each time point after the gate ramp. Our numerical simulations have shown that the use of the previous time point solution as an initial guess in the Gummel iterations fails to predict the decay in the drain current from its maximum overshoot value. This difficulty is circumvented when the steady-state solution is used as a local-in-time initial guess. We use the diagonally implicit Runge-Kutta method for the time domain discretization. A fixed-point iteration technique is employed for the space domain iterations. To demonstrate the usefulness of the local-in-time method, numerical results of the transient drain current for various device parameters, such as the silicon film doping, silicon film thickness and back-gate bias are presented.}, isbn = {0038-1101}, doi = {10.1016/0038-1101(94)90197-X}, url = {http://www.sciencedirect.com/science/article/pii/003811019490197X}, author = {Tai,Gwo-Chung and Korman,Can E. and Mayergoyz, Issak D} } @article {13022, title = {Slipped-strand mispairing in a plastid gene: {\i}t rpoC2 in grasses (Poaceae)}, journal = {Mol Biol Evol}, volume = {11}, year = {1994}, month = {1994/01//}, pages = {1 - 8}, abstract = {An exception to the generally conservative nature of plastid gene evolution is the gene coding for the beta" subunit of RNA polymerase, rpoC2. Previous work by others has shown that maize and rice have an insertion in the coding region of rpoC2, relative to spinach and tobacco. To assess the distribution of this extra coding sequence, we surveyed a broad phylogenetic sample comprising 55 species from 17 angiosperm families by using Southern hybridization. The extra coding sequence is restricted to the grasses (Poaceae). DNA sequence analysis of 11 species from all five subfamilies within the grass family demonstrates that the extra sequence in the coding region of rpoC2 is a repetitive array that exhibits more than a twofold increase in nucleotide substitution, as well as a large number of insertion/deletion events, relative to the adjacent flanking sequences. The structure of the array suggests that slipped-strand mispairing causes the repeated motifs and adds to the mechanisms through which the coding sequence of plastid genes are known to evolve. Phylogenetic analyses based on the sequence data from grass species support several relationships previously suggested by morphological work, but they are ambiguous about broad relationships within the family.}, author = {Cummings, Michael P. and King,L. M and Kellogg,E. A} } @inbook {18691, title = {Software reliability analysis of three successive generations of a Switching System}, booktitle = {Dependable Computing {\textemdash} EDCC-1}, series = {Lecture Notes in Computer Science}, volume = {852}, year = {1994}, month = {1994///}, pages = {471 - 490}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {Most current approaches to software reliability evaluation are based on data collected on a single generation of products. However, many applications are developed through improvements of the existing software: to the families of products are added various generations as the need for new functionalities arises. Experimental studies dealing with the analysis of data collected on families of products are seldom reported. In this paper, we analyze the data (failure and correction reports) collected on the software of three successive generations of the Brazilian Switching System {\textemdash} TROPICO-R, during validation and operation. A comparative analysis of the three products is done and the main results are outlined. Emphasis is placed on the evolution of the software and the corresponding failures and corrected faults. The analysis addresses: i) the modifications introduced on system components, ii) the distribution of failures and corrected faults in the components and the functions fulfilled by the system, and iii) the evolution of the failure intensity functions.}, keywords = {Computer science}, isbn = {978-3-540-58426-1}, url = {http://www.springerlink.com/content/f71g30v177521471/abstract/}, author = {Ka{\^a}niche,M. and Kanoun,K. and Michel Cukier and Martini,M.}, editor = {Echtle,Klaus and Hammer,Dieter and Powell,David} } @article {14189, title = {A syntactic approach to scale-space-based corner description}, journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {16}, year = {1994}, month = {1994/07//}, pages = {748 - 751}, abstract = {Planar curves are described by information about corners integrated over various levels of resolution. The detection of corners takes place on a digital representation. To compensate for ambiguities arising from sampling problems due to the discreteness, results about the local behavior of curvature extrema in continuous scale-space are employed}, keywords = {Computer vision, corner detection, curvature extrema, edge detection, IMAGE PROCESSING, image resolution, Image segmentation, Laboratories, Large-scale systems, PARALLEL PROCESSING, pattern recognition, planar curves, resolution, Sampling methods, sampling problems, scale space based corner description, SHAPE, Smoothing methods, syntactic approach}, isbn = {0162-8828}, doi = {10.1109/34.297957}, author = {Ferm{\"u}ller, Cornelia and Kropatsch,W.} } @article {15042, title = {Top-Bottom Routing around a Rectangle is as Easy as Computing Prefix Minima}, journal = {SIAM Journal on Computing}, volume = {23}, year = {1994}, month = {1994///}, pages = {449 - 465}, abstract = {A new parallel algorithm for the prefix minima problem is presented for inputs drawn from the range of integers $[1..s]$. For an input of size $n$, it runs in $O(\log \log \log s)$ time and $O(n)$ work (which is optimal). A faster algorithm is presented for the special case $s = n$; it runs in $O(\log ^ * n)$ time with optimal work. Both algorithms are for the Priority concurrent-read concurrent-write parallel random access machine (CROW PRAM). A possibly surprising outcome of this work is that, whenever the range of the input is restricted, the prefix minima problem can be solved significantly faster than the $\Omega (\log \log n)$ time lower bound in a decision model of parallel computation, as described by Valiant [SIAM J. Comput., 4 (1975), pp. 348{\textendash}355].The top-bottom routing problem, which is an important subproblem of routing wires around a rectangle in two layers, is also considered. It is established that, for parallel (and hence for serial) computation, the problem of top-bottom routing is no harder than the prefix minima problem with $s = n$, thus giving an $O(\log ^ * n)$ time optimal parallel algorithm for the top-bottom routing problem. This is one of the first nontrivial problems to be given an optimal parallel algorithm that runs in sublogarithmic time. }, keywords = {Parallel algorithms, pram algorithms, prefix minima, VLSI routing}, doi = {10.1137/S0097539791218275}, url = {http://link.aip.org/link/?SMJ/23/449/1}, author = {Berkman,Omer and JaJa, Joseph F. and Krishnamurthy,Sridhar and Thurimella,Ramakrishna and Vishkin, Uzi} } @article {15210, title = {Approximation Algorithms for Graph Augmentation}, journal = {Journal of Algorithms}, volume = {14}, year = {1993}, month = {1993/03//}, pages = {214 - 225}, abstract = {The problem of increasing both edge and vertex connectivity of a graph at an optimal cost is studied. Since the general problem is NP-hard, we focus on efficient approximation schemes that come within a constant factor from the optima]. Previous algorithms either do not take edge costs into consideration, or they run slower than our algorithm. Our algorithm takes as input an undirected graph G0 = (V, E0) on n vertices, that is not necessarily connected, and a set Feasible of m weighted edges on V, and outputs a subset Aug of edges which when added to G0 make it two-connected. The weight of Aug, when G0 is initially connected, is no more than twice the weight of the least weight subset of edges of Feasible that increases the connectivity to two. The running time of our algorithm is O(m + n log n). As a consequence of our results, we can find an approximation to the least-weight two-connected spanning subgraph of a two-connected weighted graph.}, isbn = {0196-6774}, doi = {10.1006/jagm.1993.1010}, url = {http://www.sciencedirect.com/science/article/pii/S0196677483710102}, author = {Khuller, Samir and Thurimella,R.} } @article {18743, title = {Development of machining alternatives, based on MRSEVs}, journal = {Computers in Engineering}, year = {1993}, month = {1993///}, pages = {47 - 47}, abstract = {One missing link between CAD and CAM is the lack ofa systematic methodology for generating and evaluating al- ternative ways to manufacture a proposed design. To ad- dress this problem, we are developing a systematic approach for generating and evaluating alternative ways to manufac- ture machined parts, in order to provide information to the designer about the manufacturability of the proposed de- sign, and information to the process engineer about how best to machine the part. This paper describes our overall approach, and how MRSEVs (Material Removal Shape El- ement Volumes, a STEP library of machining features) can be used to support it. }, url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.37.6348\&rep=rep1\&type=pdf}, author = {Nau, Dana S. and Gupta,S.K. and Kramer,T. R. and Regli,W. C. and Zhang, G.} } @article {18744, title = {Evaluating product machinability for concurrent engineering}, journal = {Concurrent Engineering: Contemporary Issues and Modern Design Tools}, year = {1993}, month = {1993///}, pages = {264 - 279}, url = {http://books.google.com/books?hl=en\&lr=\&id=S5rjzPSsM5EC\&oi=fnd\&pg=PA264\&dq=Satyandra+Gupta\&ots=Ldu80IZ66F\&sig=xZN6yo6NsLi2y3CZskweXchossg}, author = {Nau, Dana S. and Zhang, G. and Gupta,S.K. and Karinthi,R. R.} } @article {15208, title = {Geometric knapsack problems}, journal = {Algorithmica}, volume = {10}, year = {1993}, month = {1993///}, pages = {399 - 427}, abstract = {We study a variety of geometric versions of the classical knapsack problem. In particular, we consider the following ldquofence enclosurerdquo problem: given a setS ofn points in the plane with valuesv i ge 0, we wish to enclose a subset of the points with a fence (a simple closed curve) in order to maximize the ldquovaluerdquo of the enclosure. The value of the enclosure is defined to be the sum of the values of the enclosed points minus the cost of the fence. We consider various versions of the problem, such as allowingS to consist of points and/or simple polygons. Other versions of the problems are obtained by restricting the total amount of fence available and also allowing the enclosure to consist of at mostM connected components. When there is an upper bound on the length of fence available, we show that the problem is NP-complete. We also provide polynomial-time algorithms for many versions of the fence problem when an unrestricted amount of fence is available.}, doi = {10.1007/BF01769706}, author = {Arkin,E. M and Khuller, Samir and Mitchell,J. S.B} } @article {15209, title = {The lattice structure of flow in planar graphs}, journal = {SIAM Journal on Discrete Mathematics}, volume = {6}, year = {1993}, month = {1993///}, pages = {477 - 477}, author = {Khuller, Samir and Naor,J. S and Klein,P.} } @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} } @conference {16020, title = {Situated reasoning within tight deadlines and realistic space and computation bounds}, booktitle = {Proc. Common Sense}, volume = {93}, year = {1993}, month = {1993///}, author = {Nirkhe,M. and Kraus,S. and Perlis, Don} } @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 {15032, title = {Systolic architectures for finite-state vector quantization}, journal = {The Journal of VLSI Signal Processing}, volume = {5}, year = {1993}, month = {1993///}, pages = {249 - 259}, abstract = {We present a new systolic architecture for implementing Finite State Vector Quantization in real-time for both speech and image data. This architecture is modular and has a very simple control flow. Only one processor is needed for speech compression. A linear array of processors is used for image compression; the number of processors needed is independent of the size of the image. We also present a simple architecture for converting line-scanned image data into the format required by this systolic architecture. Image data is processed at a rate of 1 pixel per clock cycle. An implementation at 31.5 MHz can quantize 1024{\texttimes}1024 pixel images at 30 frames/sec in real-time. We describe a VLSI implementation of these processors.}, doi = {10.1007/BF01581299}, author = {Kolagotla,R. K. and Yu,S. S. and JaJa, Joseph F.} } @conference {18779, title = {Using MRSEVs to develop machining alternatives}, year = {1993}, month = {1993///}, url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.47.4870\&rep=rep1\&type=pdf}, author = {Nau, Dana S. and Gupta,S.K. and Kramer,T. R. and Regli,W. C. and Zhang, G.} } @conference {15044, title = {Using Synthetic-Perturbation Techniques for Tuning Shared Memory Programs}, booktitle = {Parallel Processing, 1993. ICPP 1993. International Conference on}, volume = {2}, year = {1993}, month = {1993/08//}, pages = {2 - 10}, abstract = {The Synthetic-Perturbation Tuning (SPT) methodology is base d on compirical approach that introduces artificial delays into the MIMD program and captures the effects of such delays by using the modrn branch statistics called design of experiments.}, doi = {10.1109/ICPP.1993.184}, author = {Snelick,Robert and JaJa, Joseph F. and Kacker,Raghu and Lyon,Gordon} } @conference {15977, title = {Vacuum-logic}, booktitle = {Proceedings of AAAI 1993 Fall Symposium Series: Instantiating Real-World Agents}, year = {1993}, month = {1993///}, pages = {51 - 54}, author = {Elgot-drapkin,J. and Kraus,S. and Miller,M. and Nirkhe,M. and Perlis, Don} } @article {15049, title = {VLSI implementation of a tree searched vector quantizer}, journal = {Signal Processing, IEEE Transactions on}, volume = {41}, year = {1993}, month = {1993/02//}, pages = {901 - 905}, abstract = {The VLSI design and implementation of a tree-searched vector quantizer is presented. The number of processors needed is equal to the depth of the tree. All processors are identical, and data flow between processors is regular. No global control signals are needed. The processors have been fabricated using 2 mu;m N-well process on a 7.9 times;9.2 mm die. Each processor chip contains 25000 transistors and has 84 pins. The processors have been thoroughly tested at a clock frequency of 20 MHz}, keywords = {(mathematics);, 2, 20, chips;, coding;, compression;, data, design;, digital, image, implementation;, MHz;, micron;, PROCESSING, quantisation;, quantizer;, searched, signal, tree, TREES, vector, VLSI, VLSI;}, isbn = {1053-587X}, doi = {10.1109/78.193225}, author = {Kolagotla,R. K. and Yu,S.-S. and JaJa, Joseph F.} } @article {12987, title = {copia-like retrotransposons are ubiquitous among plants}, journal = {Proc Natl Acad Sci USA}, volume = {89}, year = {1992}, month = {1992/08//}, pages = {7124 - 7128}, abstract = {Transposable genetic elements are assumed to be a feature of all eukaryotic genomes. Their identification, however, has largely been haphazard, limited principally to organisms subjected to molecular or genetic scrutiny. We assessed the phylogenetic distribution of copia-like retrotransposons, a class of transposable element that proliferates by reverse transcription, using a polymerase chain reaction assay designed to detect copia-like element reverse transcriptase sequences. copia-like retrotransposons were identified in 64 plant species as well as the photosynthetic protist Volvox carteri. The plant species included representatives from 9 of 10 plant divisions, including bryophytes, lycopods, ferns, gymnosperms, and angiosperms. DNA sequence analysis of 29 cloned PCR products and of a maize retrotransposon cDNA confirmed the identity of these sequences as copia-like reverse transcriptase sequences, thereby demonstrating that this class of retrotransposons is a ubiquitous component of plant genomes.}, author = {Voytas,D. F and Cummings, Michael P. and Koniczny,A. and Ausubel,F. M and Rodermel,S. R} } @article {14997, title = {On the difficulty of Manhattan channel routing}, journal = {Information Processing Letters}, volume = {44}, year = {1992}, month = {1992/12/21/}, pages = {281 - 284}, abstract = {We show that channel routing in the Manhattan model remains difficult even when all nets are single-sided. Given a set of n single-sided nets, we consider the problem of determining the minimum number of tracks required to obtain a dogleg-free routing. In addition to showing that the decision version of the problem isNP-complete, we show that there are problems requiring at least d+Ω(n) tracks, where d is the density. This existential lower bound does not follow from any of the known lower bounds in the literature.}, keywords = {combinatorial problems, computational complexity, lower bounds, VLSI channel routing}, isbn = {0020-0190}, doi = {10.1016/0020-0190(92)90214-G}, url = {http://www.sciencedirect.com/science/article/pii/002001909290214G}, author = {Greenberg,Ronald and JaJa, Joseph F. and Krishnamurthy,Sridhar} } @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 {14169, title = {Hierarchical curve representation}, booktitle = {, 11th IAPR International Conference on Pattern Recognition, 1992. Vol.III. Conference C: Image, Speech and Signal Analysis, Proceedings}, year = {1992}, month = {1992/09/30/Aug-3}, pages = {143 - 146}, publisher = {IEEE}, organization = {IEEE}, abstract = {Presents a robust method for describing planar curves in multiple resolution using curvature information. The method is developed by taking into account the discrete nature of digital images as well as the discrete aspect of a multiresolution structure (pyramid). The authors deal with the robustness of the technique, which is due to the additional information that is extracted from observing the behavior of corners in the pyramid. Furthermore the resulting algorithm is conceptually simple and easily parallelizable. They develop theoretical results, analyzing the curvature of continuous curves in scale-space, which show the behavior of curvature extrema under varying scale. These results are used to eliminate any ambiguities that might arise from sampling problems due to the discreteness of the representation. Finally, experimental results demonstrate the potential of the method}, keywords = {Automation, continuous curves, curvature, data mining, digital images, Educational institutions, Feature extraction, hierarchical curve representation, IMAGE PROCESSING, image recognition, image resolution, Image segmentation, multiresolution structure, Object recognition, planar curves, pyramid, Robustness, Sampling methods, Smoothing methods}, isbn = {0-8186-2920-7}, doi = {10.1109/ICPR.1992.201947}, author = {Ferm{\"u}ller, Cornelia and Kropatsch,W.} } @article {15622, title = {Incremental construction and dynamic maintenance of constrained Delaunay triangulations}, journal = {Proceedings of the 4th Canadian Conference on Computational Geometry}, year = {1992}, month = {1992///}, pages = {170 - 175}, author = {Kao,T.C. and Mount, Dave} } @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 {14233, title = {Multi-resolution shape description by corners}, booktitle = {, 1992 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 1992. Proceedings CVPR {\textquoteright}92}, year = {1992}, month = {1992/06/15/18}, pages = {271 - 276}, publisher = {IEEE}, organization = {IEEE}, abstract = {A robust method for describing planar curves in multiple resolution using curvature information is presented. The method is developed by taking into account the discrete nature of digital images as well as the discrete aspect of a multiresolution structure (pyramid). The main contribution lies in the robustness of the technique, which is due to the additional information that is extracted from observing the behavior of corners in the whole pyramid. Furthermore, the resulting algorithm is conceptually simple and easily parallelizable. Theoretical results are developed analyzing the curvature of continuous curves in scale-space and showing the behavior of curvature extrema under varying scale. The results are used to eliminate any ambiguities that might arise from sampling problems due to the discreteness of the representation. Experimental results demonstrate the potential of the method}, keywords = {ambiguities, Automation, computational geometry, Computer vision, continuous curves, corners, curvature extrema, curvature information, curve fitting, digital images, Feature extraction, IMAGE PROCESSING, image resolution, Image segmentation, Laboratories, multiple resolution, multiresolution structure, parallelizable, planar curves, Robustness, Sampling methods, scale-space, SHAPE, Smoothing methods, varying scale}, isbn = {0-8186-2855-3}, doi = {10.1109/CVPR.1992.223264}, author = {Ferm{\"u}ller, Cornelia and Kropatsch,W.} } @article {15549, title = {Parallel computational geometry of rectangles}, journal = {Algorithmica}, volume = {7}, year = {1992}, month = {1992///}, pages = {25 - 49}, abstract = {Rectangles in a plane provide a very useful abstraction for a number of problems in diverse fields. In this paper we consider the problem of computing geometric properties of a set of rectangles in the plane. We give parallel algorithms for a number of problems usingn processors wheren is the number of upright rectangles. Specifically, we present algorithms for computing the area, perimeter, eccentricity, and moment of inertia of the region covered by the rectangles inO(logn) time. We also present algorithms for computing the maximum clique and connected components of the rectangles inO(logn) time. Finally, we give algorithms for finding the entire contour of the rectangles and the medial axis representation of a givenn {\texttimes} n binary image inO(n) time. Our results are faster than previous results and optimal (to within a constant factor).}, doi = {10.1007/BF01758750}, author = {Chandran,S. and Kim,S. K and Mount, Dave} } @article {15205, title = {Processor efficient parallel algorithms for the two disjoint paths problem and for finding a Kuratowski homeomorph}, journal = {SIAM Journal on Computing}, volume = {21}, year = {1992}, month = {1992///}, pages = {486 - 486}, author = {Khuller, Samir and Mitchell,S. G and Vazirani,V. V} } @article {15045, title = {VLSI Architectures and Implementation of Predictive Tree- Searched Vector Quantizers for Real-Time Video Compression}, volume = {ISR-TR-1992-48}, year = {1992}, month = {1992///}, institution = {Institute for Systems Research, University of Maryland, College Park}, abstract = {We describe a pipelined systolic architecture for implementing predictive Tree-Searched Vector Quantization (PTSVQ) for real- time image and speech coding applications. This architecture uses identical processors for both the encoding and decoding processes. the overall design is regular and the control is simple. Input data is processed at a rate of 1 pixel per clock cycle, which allows real-time processing of images at video rates. We implemented these processors using 1.2um CMOS technology. Spice simulations indicate correct operation at 40 MHz. Prototype version of these chips fabricated using 2um CMOS technology work at 20 MHz.}, keywords = {data compression, IMAGE PROCESSING, Signal processing, Speech processing, Systems Integration, systolic architecture, Vector quantization, VLSI architectures}, url = {http://drum.lib.umd.edu/handle/1903/5230}, author = {Yu,S.-S. and Kolagotla,Ravi K. and JaJa, Joseph F.} } @article {15050, title = {VLSI Implementation of Real-Time Parallel DCT/DST Lattice Structures for Video}, volume = {ISR-TR-1992-34}, year = {1992}, month = {1992///}, institution = {Institute for Systems Research, University of Maryland, College Park}, abstract = {The alternate use [1] of the discrete cosine transform (DCT) and the discrete sine transform (DST) can achieve a higher data compression rate and less block effect in image processing. A parallel lattice structure that can dually generate the 1-D DCT and DST is proposed. We also develop a fully-pipelined 2-D DCT lattice architecture that consists of two 1-D DCT/DST arrays without transposition. Both architectures are ideally suited for VLSI implementation because they are modular, regular, and have only local interconnections. the VLSI implementation of the lattice module using the distributed arithmetic approach is described. This realization of the lattice module using 2 um CMOS technology can achieve an 80Mb/s data rate.}, keywords = {Parallel architectures, Signal processing, Systems Integration, VLSI architectures}, url = {http://drum.lib.umd.edu/handle/1903/5216}, author = {Chiu,Ching-Te and Kolagotla,Ravi K. and Liu,K. J. Ray and JaJa, Joseph F.} } @article {15669, title = {Computing generalized Voronoi diagrams in improved time and space bounds}, year = {1991}, month = {1991///}, institution = {University of Maryland at College Park}, address = {College Park, MD, USA}, author = {Kao,Thomas C. and Mount, Dave} } @conference {15979, title = {Deadline-coupled real-time planning}, booktitle = {Innovative approaches to planning, scheduling and control: proceedings of a Workshop [on Innovative Approaches to Planning, Scheduling, and Control], held at San Diego, California, November 5-8, 1991}, year = {1991}, month = {1991///}, pages = {100 - 100}, author = {Kraus,S. and Nirkhe,M. and Perlis, Don} } @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 {15950, title = {Fully deadline-coupled planning: One step at a time}, journal = {Methodologies for Intelligent Systems}, year = {1991}, month = {1991///}, pages = {589 - 599}, author = {Nirkhe,M. and Kraus,S. and Perlis, Don} } @article {15925, title = {Nonmonotonicity and the scope of reasoning}, journal = {Artificial Intelligence}, volume = {52}, year = {1991}, month = {1991///}, pages = {221 - 261}, author = {Etherington,D. W and Kraus,S. and Perlis, Don} } @article {16768, title = {A pipeline N-way join algorithm based on the 2-way semijoin program}, journal = {IEEE Transactions on Knowledge and Data Engineering}, volume = {3}, year = {1991}, month = {1991/12//}, pages = {486 - 495}, abstract = {The semijoin has been used as an effective operator in reducing data transmission and processing over a network that allows forward size reduction of relations and intermediate results generated during the processing of a distributed query. The authors propose a relational operator, two-way semijoin, which enhanced the semijoin with backward size reduction capability for more cost-effective query processing. A pipeline N-way join algorithm for joining the reduced relations residing on N sites is introduced. The main advantage of this algorithm is that it eliminates the need for transferring and storing intermediate results among the sites. A set of experiments showing that the proposed algorithm outperforms all known conventional join algorithms that generate intermediate results is included}, keywords = {2-way semijoin program, backward size reduction, Bandwidth, Computer networks, Costs, Data communication, data transmission, Database systems, database theory, Delay, distributed databases, distributed query, forward size reduction, intermediate results, Local area networks, network, Parallel algorithms, pipeline N-way join algorithm, pipeline processing, Pipelines, programming theory, Query processing, Relational databases, relational operator, SITES, Workstations}, isbn = {1041-4347}, doi = {10.1109/69.109109}, author = {Roussopoulos, Nick and Kang,H.} } @article {15204, title = {Planar graph coloring is not self-reducible, assuming P /= NP}, journal = {Theoretical Computer Science}, volume = {88}, year = {1991}, month = {1991/09/30/}, pages = {183 - 189}, abstract = {We show that obtaining the lexicographically first four coloring of a planar graph is NP-hard. This shows that planar graph four-coloring is not self-reducible, assuming P/= NP. One consequence of our result is that the schema of Jerrum et al. (1986) cannot be used for approximately counting the number of four colorings of a planar graph. These results extend to planar graph k-coloring, for k⩾4.}, isbn = {0304-3975}, doi = {10.1016/0304-3975(91)90081-C}, url = {http://www.sciencedirect.com/science/article/pii/030439759190081C}, author = {Khuller, Samir and Vazirani,Vijay V.} } @article {18986, title = {Polyadenylylation in copia requires unusually distant upstream sequences}, journal = {Proceedings of the National Academy of SciencesPNAS}, volume = {88}, year = {1991}, month = {1991/04/15/}, pages = {3038 - 3042}, abstract = {Retroviruses and related genetic elements generate terminally redundant RNA products by differential polyadenylylation within a long terminal repeat. Expression of the white-apricot (wa) allele of Drosophila melanogaster, which carries an insertion of the 5.1-kilobase retrovirus-like transposable element copia in a small intron, is influenced by signals within copia. By using this indicator, we have isolated a 518-base-pair deletion, 312 base pairs upstream of the copia polyadenylylation site, that is phenotypically like much larger deletions and eliminates RNA species polyadenylylated in copia. This requirement of distant upstream sequences for copia polyadenylylation has implications for the expression of many genetic elements bearing long terminal repeats.}, isbn = {0027-8424, 1091-6490}, url = {http://www.pnas.org/content/88/8/3038}, author = {Kurkulos,M. and Weinberg,J. M. and Pepling,M. E. and Mount, Stephen M.} } @article {15944, title = {Reasoning about ignorance: A note on the Bush-Gorbachev problem}, journal = {Fundam. Inform.}, volume = {15}, year = {1991}, month = {1991///}, pages = {325 - 332}, author = {Kraus,S. and Perlis, Don and Horty,J. F} } @article {12977, title = {A superfamily of {\i}t Arabidopsis thaliana retrotransposons}, journal = {Genetics}, volume = {127}, year = {1991}, month = {1991/04//}, pages = {801 - 809}, abstract = {We describe a superfamily of Arabidopsis thaliana retrotransposable elements that consists of at least ten related families designated Ta1-Ta10. The Ta1 family has been described previously. Two genomic clones representing the Ta2 and Ta3 elements were isolated from an A. thaliana (race Landsberg erecta) lambda library using sequences derived from the reverse transcriptase region of Ta1 as hybridization probes. Nucleotide sequence analysis showed that the Ta1, Ta2 and Ta3 families share greater than 75\% amino acid identity in pairwise comparisons of their reverse transcriptase and RNase H genes. In addition to Ta1, Ta2 and Ta3, we identified seven other related retrotransposon families in Landsberg erecta, Ta4-Ta10, using degenerate primers and the polymerase chain reaction to amplify a highly conserved region of retrotransposon-encoded reverse transcriptase. One to two copies of elements Ta2-Ta10 are present in the genomes of the A. thaliana races Landsberg erecta and Columbia indicating that the superfamily comprises at least 0.1\% of the A. thaliana genome. The nucleotide sequences of the reverse transcriptase regions of the ten element families place them in the category of copia-like retrotransposons and phylogenetic analysis of the amino acid sequences suggests that horizontal transfer may have played a role in their evolution.}, author = {Konieczny,A and Voytas,D. F and Cummings, Michael P. and Ausubel,F. M} } @article {15203, title = {Coloring algorithms for K5-minor free graphs}, journal = {Information Processing Letters}, volume = {34}, year = {1990}, month = {1990/04/24/}, pages = {203 - 208}, abstract = {In this paper we give an NC algorithm to five color K5-minor free graphs. We also give a polynomial time algorithm to obtain a four coloring for a K5-minor free graph.}, keywords = {graph minor, Parallel algorithms, planar graph coloring}, isbn = {0020-0190}, doi = {10.1016/0020-0190(90)90161-P}, url = {http://www.sciencedirect.com/science/article/pii/002001909090161P}, author = {Khuller, Samir} } @conference {14939, title = {An efficient parallel algorithm for channel routing}, booktitle = {Computer Design: VLSI in Computers and Processors, 1990. ICCD {\textquoteright}90. Proceedings., 1990 IEEE International Conference on}, year = {1990}, month = {1990/09//}, pages = {400 - 403}, abstract = {The channel-routing of a set of multiterminal nets in the standard two-layer model is considered. The sequential algorithms based on the greedy strategy do not seem to be easily parallelizable. Proposed is an efficient parallel algorithm for routing channels with cyclic constraints. The algorithm runs in time O(n2/p+log2p), with p processors, on a shared memory parallel random access machine (PRAM) model where 1 les;p les;n2 radic; and n is the size of the input. An efficient adaptation of this algorithm on a Sequent Balance 21000 multiprocessor system is reported}, keywords = {21000;channel, access, algorithm;sequential, algorithms;, algorithms;shared, balance, CAD;computational, complexity;parallel, Layout, machine;standard, memory, model;circuit, nets;parallel, Parallel, PRAM;Sequent, random, routing;multiprocessor, system;multiterminal, two-layer}, doi = {10.1109/ICCD.1990.130261}, author = {Krishnamurthy, S. and JaJa, Joseph F.} } @article {15201, title = {Extending planar graph algorithms to K3,3-free graphs}, journal = {Information and Computation}, volume = {84}, year = {1990}, month = {1990/01//}, pages = {13 - 25}, abstract = {For several problems, restricting attention to special classes of graphs has yielded better algorithms. In particular, restricting to planar graphs yields efficient parallel algorithms for several graph problems. In this paper we extend these algorithms to K3,3-free graphs, showing that the restriction of planarity is not important. The three problems dealt with are: graph coloring, depth first search, and maximal independent sets. As a corollary we show that K3,3-free graphs are five colorable (this bound is tight).}, isbn = {0890-5401}, doi = {10.1016/0890-5401(90)90031-C}, url = {http://www.sciencedirect.com/science/article/pii/089054019090031C}, author = {Khuller, Samir} } @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 {15388, title = {Investigation of the threshold voltage of MOSFETs with position and potential-dependent interface trap distributions using a fixed-point iteration method}, journal = {Electron Devices, IEEE Transactions on}, volume = {37}, year = {1990}, month = {1990/04//}, pages = {1031 - 1038}, abstract = {Simulation results are presented for a MOSFET with position- and energy- (potential-) dependent interface trap distributions that may be typical for devices subjected to interface-trap-producing processes such as hot-electron degradation. The interface-trap distribution is modeled as a Gaussian peak at a given position along the channel, and the energy dependence is derived from C-V measurements from an MOS capacitor exposed to ionizing radiation. A novel fixed-point technique is used to solve the two-dimensional boundary-value problem. The technique is shown to be globally convergent for arbitrary distributions of interface traps. A comparison of the convergence properties of the Newton and fixed-point methods is presented, and it is shown that for some important cases the Newton technique fails to converge while the fixed-point technique converges with a geometric convergence rate}, keywords = {boundary-value, C-V, carriers;insulated, characteristics;Gaussian, Convergence, convergence;hot-electron, degradation;position, dependence;fixed-point, dependent, device, distribution;potential-dependent, distributions;simulation;threshold, effect, electron, field, gate, interface, iteration, method;fixed-point, methods;hot, methods;semiconductor, models;, numerical, of, peak;MOSFET;energy, problem;boundary-value, problems;convergence, rate;global, states;iterative, technique;geometric, transistors;interface, trap, voltage;two-dimensional}, isbn = {0018-9383}, doi = {10.1109/16.52438}, author = {Gaitan,M. and Mayergoyz, Issak D and Korman,C.E.} } @article {14791, title = {IPS-2: the second generation of a parallel program measurement system}, journal = {IEEE Transactions on Parallel and Distributed Systems}, volume = {1}, year = {1990}, month = {1990/04//}, pages = {206 - 217}, abstract = {IPS, a performance measurement system for parallel and distributed programs, is currently running on its second implementation. IPS{\textquoteright}s model of parallel programs uses knowledge about the semantics of a program{\textquoteright}s structure to provide two important features. First, IPS provides a large amount of performance data about the execution of a parallel program, and this information is organized so that access to it is easy and intuitive. Secondly, IPS provides performance analysis techniques that help to guide the programmer automatically to the location of program bottlenecks. The first implementation of IPS was a testbed for the basic design concepts, providing experience with a hierarchical program and measurement model, interactive program analysis, and automatic guidance techniques. It was built on the Charlotte distributed operating system. The second implementation, IPS-2, extends the basic system with new instrumentation techniques, an interactive and graphical user interface, and new automatic guidance analysis techniques. This implementation runs on 4.3BSD UNIX systems, on the VAX, DECstation, Sun 4, and Sequent Symmetry multiprocessor}, keywords = {4.3BSD UNIX systems, automatic guidance techniques, Automatic testing, Charlotte distributed operating system, CPA, DECstation, design concepts, distributed programs, graphical user interface, Graphical user interfaces, Instruments, interactive program analysis, IPS-2, measurement, message systems, network operating systems, Operating systems, parallel program measurement system, parallel programming, parallel programs, Performance analysis, performance analysis techniques, performance evaluation, performance measurement system, Power system modeling, program bottlenecks, program diagnostics, Programming profession, semantics, Sequent Symmetry multiprocessor, shared-memory systems, software tools, Springs, Sun, Sun 4, Unix, VAX}, isbn = {1045-9219}, doi = {10.1109/71.80132}, author = {Miller, B. P and Clark, M. and Hollingsworth, Jeffrey K and Kierstead, S. and Lim,S. -S and Torzewski, T.} } @article {15951, title = {Limited scope and circumscriptive reasoning}, journal = {International Journal of Expert Systems}, volume = {3}, year = {1990}, month = {1990///}, pages = {207 - 217}, author = {Etherington,D. W and Kraus,S. and Perlis, Don} } @article {15200, title = {On-line algorithms for weighted matching and stable marriages}, volume = {TR90-1143}, year = {1990}, month = {1990///}, institution = {Cornell University}, abstract = {We give an on-line deterministic algorithm for the bipartite weighted matching problem that achieves a competitive ratio of $O(n)$. In fact, this algorithm is almost optimal - the lower bound on the performance ratio of any deterministic online algorithm is $\Omega (n/ \sqrt{log n})$. We also study the stable marriage problem, where we are interested in the number of unstable pairs produced. We show that the simple "first come, first served" deterministic algorithm yields on the average $O(n$ log $n$) unstable pairs, but in the worst case no deterministic or randomized on-line algorithm can do better that $\Omega(n^{2})$ unstable pairs.}, author = {Khuller, Samir and Mitchell,S. G and Vazirani,V. V} } @article {13025, title = {The structure, distribution and evolution of the {\i}t Ta1 retrotransposable element family of {\i}t Arabidopsis thaliana}, journal = {Genetics}, volume = {126}, year = {1990}, month = {1990/11//}, pages = {713 - 721}, abstract = {The Ta1 elements are a low copy number, copia-like retrotransposable element family of Arabidopsis thaliana. Six Ta1 insertions comprise all of the Ta1 element copies found in three geographically diverse A. thaliana races. These six elements occupy three distinct target sites: Ta1-1 is located on chromosome 5 and is common to all three races (Col-0, Kas-1 and La-0). Ta1-2 is present in two races on chromosome 4 (Kas-1 and La-0), and Ta1-3, also located on chromosome 4, is present only in one race (La-0). The six Ta1 insertions share greater than 96\% nucleotide identity, yet are likely to be incapable of further transposition due to deletions or nucleotide changes that alter either the coding capacity of the elements or conserved protein domains required for retrotransposition. Nucleotide sequence comparisons of these elements and the distribution of Ta1 among 12 additional A. thaliana geographical races suggest that Ta1-1 predated the global dispersal of A. thaliana. As the species spread throughout the world, two additional transposition events occurred which gave rise first to Ta1-2 and finally to Ta1-3.}, author = {Voytas,D. F and Konieczny,A and Cummings, Michael P. and Ausubel,F. 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} } @article {15202, title = {On a triangle counting problem}, journal = {Information Processing Letters}, volume = {33}, year = {1990}, month = {1990/02/10/}, pages = {319 - 321}, abstract = {We consider the following problem: given a set S of n points in the plane, we would like to compute for each point pϵS, how many triangles with corners at points in set S contain p. We give an O(n2) algorithm to solve the problem.}, keywords = {combinatorics, computational geometry, Range query}, isbn = {0020-0190}, doi = {10.1016/0020-0190(90)90217-L}, url = {http://www.sciencedirect.com/science/article/pii/002001909090217L}, author = {Khuller, Samir and Mitchell,Joseph S.B.} } @conference {15957, title = {Assessing others{\textquoteright} knowledge and ignorance}, booktitle = {Proceedings of the 4th International Symposium on Methodologies for Intelligent Systems}, year = {1989}, month = {1989///}, author = {Kraus,S. and Perlis, Don} } @article {15198, title = {On computing graph closures}, journal = {Information Processing Letters}, volume = {31}, year = {1989}, month = {1989/06/12/}, pages = {249 - 255}, abstract = {The closure of a graph G of n vertices is obtained from G by recursively joining pairs of non-adjacent vertices whose degree sum is at least n until no such pair remains. We give an efficient algorithm to compute the closure using F-heaps. We also define the general closure of a graph and show that computing the general closure is P-complete with respect to log-space transformations.}, keywords = {closure, graphs, P-completeness}, isbn = {0020-0190}, doi = {10.1016/0020-0190(89)90082-3}, url = {http://www.sciencedirect.com/science/article/pii/0020019089900823}, author = {Khuller, Samir} } @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 {18389, title = {Experiences building a syntax-directed editor}, journal = {Software Engineering Journal}, volume = {4}, year = {1989}, month = {1989/11//}, pages = {294 - 294}, abstract = {The paper presents a set of techniques for building robust software using the development of a microprocessor SUPPORT programming environment as an example. It discusses some of the attributes built into the system to best handle the concerns of portability, functionality, and effectiveness that had to be dealt with for the system to be reliable on a small machine, and it describes some of the choices made to obtain the best use of available hardware}, keywords = {applications;, editing;, editor;, engineering;, environment;, environments;, microcomputer, microprocessor;, portability;, Programming, robust, software, software;, Support, syntax-directed, text}, isbn = {0268-6961}, author = {Zelkowitz, Marvin V and Kowalchack,B. and Itkin,D. and Herman,L.} } @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 {15132, title = {Rational Common Ground in the Sociology of Knowledge}, journal = {Philosophy of the social sciences}, volume = {19}, year = {1989}, month = {1989///}, pages = {257 - 271}, author = {Katz, Jonathan} } @inbook {18363, title = {A support tool for teaching computer programming}, booktitle = {Issues in software engineering educationIssues in software engineering education}, year = {1989}, month = {1989///}, pages = {139 - 167}, publisher = {Springer-Verlag New York, Inc.}, organization = {Springer-Verlag New York, Inc.}, address = {New York, NY, USA}, isbn = {0-387-96840-7}, url = {http://dl.acm.org/citation.cfm?id=73064.73074}, author = {Zelkowitz, Marvin V and Kowalchack,B. and Itkin,D. and Herman,L.}, editor = {Fairley,Richard and Freeman,Peter} } @article {15653, title = {The decomposition of a rectangle into rectangles of minimal perimeter}, journal = {SIAM Journal on Computing}, volume = {17}, year = {1988}, month = {1988///}, pages = {1215 - 1215}, abstract = {This paper solves the problem of subdividing a unit square into p rectangles of area 1/p in such a way that the maximal perimeter of a rectangle is as small as possible. The correctness of the solution is proved using the well-known theorems of Menger and Dilworth.}, author = {Kong,T.Y and Mount, Dave and Roscoe,AW} } @article {15011, title = {Parallel algorithms for planar graph isomorphism and related problems}, journal = {Circuits and Systems, IEEE Transactions on}, volume = {35}, year = {1988}, month = {1988/03//}, pages = {304 - 311}, abstract = {Parallel algorithms for planar graph isomorphism and several related problems are presented. Two models of parallel computation are considered: the CREW-PRAM model and the two-dimensional array of processors. The results include O( radic;n)-time mesh algorithms for finding a good separating cycle and the triconnected components of a planar graph, and for solving the single-function coarsest partitioning problem}, keywords = {2D, algorithms;, algorithms;parallel, array;computational, array;CREW-PRAM, coarsest, complexity;graph, components;two-dimensional, COMPUTATION, graph, graph;planar, isomorphism;single-function, model;mesh, models;planar, partitioning, problem;triconnected, processor, theory;parallel}, isbn = {0098-4094}, doi = {10.1109/31.1743}, author = {JaJa, Joseph F. and Kosaraju,S.R.} } @article {15970, title = {Uniform accountability for multiple modes of reasoning}, journal = {International Journal of Approximate Reasoning}, volume = {2}, year = {1988}, month = {1988/07//}, pages = {233 - 246}, abstract = {This article discusses various issues surrounding the general debate on knowledge representation methods and argues in favor of the idea that while many methods are necessary, there also must be a kind of unified nature to the enterprise if it is to serve the needs of intelligence. Specific points include the misleading distinction between probabilistic and logical reasoning regarding the notion of truth and also some matters of nonmonotonicity. An effort is made to sample the broad range of approaches in the literature, with an eye toward such a unification.}, keywords = {Artificial intelligence, commonsense reasoning, probabilistic logic, probability theory, uncertainty representation}, isbn = {0888-613X}, doi = {16/0888-613X(88)90119-3}, url = {http://www.sciencedirect.com/science/article/pii/0888613X88901193}, author = {Kanal,Laveen and Perlis, Don} } @article {16370, title = {ALEX-an Alexical Programming Language}, volume = {TR87-835}, year = {1987}, month = {1987///}, institution = {Cornell University}, abstract = {ALEX is an experimental language for high-level parallel programming. It is a testbed for exploring various non-traditional ways of expressing algorithmic ideas, making extensive use of high-resolution color graphics. The language itself is not a programming language in the traditional sense, since there is no lexical syntax. This paper discusses the basic design of the ALEX user interface.}, url = {http://hdl.handle.net/1813/6675}, author = {Kozen,D. and Teitelbaum,T. and Chen,W. Z and Field,J. H and Pugh, William and Vander Zanden,B. T} } @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} } @article {16809, title = {On Cost-effectiveness of a Semijoin in Distributed Query Processing.}, volume = {ISR-TR-1987-38}, year = {1987}, month = {1987///}, institution = {Institute for Systems Research, University of Maryland, College Park}, abstract = {The cost-effective reduction of relations by semijoins is the basis of the heuristic approach to distributed query processing. The cost-effectiveness of a semijoin was simply determined in the literature assuming that the local processing cost is negligible compared to the data transmission cost in distributed query processing. However, recently questions have been raised about the validity of the assumption, and some experimental works revealed that the local processing cost is also significant in distributed query processing. In this paper, we are concerned with the cost-effectiveness of a semijoin considering the local processing cost as well as the data transmission cost. To measure the effectiveness of a semijoin in terms of the local processing cost, we introduce the join sequence in which the relations are joined at the result site to answer the query. A dynamic programming algorithm is developed to generate the optimal join sequence for a given query. A simple heuristic algorithm is also developed to generate a join sequence for a given query.}, keywords = {Technical Report}, url = {http://drum.lib.umd.edu//handle/1903/4547}, author = {Kang,Hyunmo and Roussopoulos, Nick} } @article {15584, title = {The decomposition of a square into rectangles of minimal perimeter}, journal = {Discrete Applied Mathematics}, volume = {16}, year = {1987}, month = {1987/03//}, pages = {239 - 243}, abstract = {This paper solves the problem of subdividing a unit square into p rectangles of area 1/p in such a way that the maximal perimeter of a rectangle is as small as possible. The correctness of the solution is proved using the well-known theorems of Menger and Dilworth.}, isbn = {0166-218X}, doi = {10.1016/0166-218X(87)90061-8}, url = {http://www.sciencedirect.com/science/article/pii/0166218X87900618}, author = {Kong,T.Y and Mount, Dave and Werman,Michael} } @article {16808, title = {Using 2-way Semijoins in Distributed Query Processing.}, volume = {ISR-TR-1987-35}, year = {1987}, month = {1987///}, institution = {Institute for Systems Research, University of Maryland, College Park}, abstract = {In distributed query processing, the semijoin has been used as an effective operator in reducing relations referenced in the query to reduce the total amount of data transmission. In this paper, we propose a new relational algebra operator, 2-way semijoin, which is an extended version of the semijoin, for more cost- effective distributed query processing. The 2-way semijoin is compared to the semijoin in terms of the reduction power and the propagation of reduction effects. We show that the 2-way semijoin has more reduction power than the semijoin and that the propagation of reduction effects by the 2-way semijoin is further than by the semijoin.}, keywords = {Technical Report}, url = {http://drum.lib.umd.edu//handle/1903/4544}, author = {Kang,Hyunmo and Roussopoulos, Nick} } @article {16744, title = {Principles and techniques in the design of ADMS+((advanced data-base management system))}, journal = {Computer}, volume = {19}, year = {1986}, month = {1986///}, pages = {19 - 23}, author = {Roussopoulos, Nick and Kang,H.} } @conference {18439, title = {The Engineering of an Environment on Small Machines}, booktitle = {Proceedings of the IEEE 1st International Conference on Computer Workstations}, year = {1985}, month = {1985///}, pages = {61 - 69}, author = {Zelkowitz, Marvin V and Elgot,J. and Itkin,D. and Kowalchack,B. and Maggio,M.} } @article {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} } @article {16750, title = {GDDT--A graphical design and documentation tool for software development}, journal = {Computers \& Graphics}, volume = {8}, year = {1984}, month = {1984///}, pages = {309 - 323}, abstract = {This paper describes "The Graphical Design and Documentation Tool" (GDDT), a general purpose support system for design and documentation. Self documentation and ease of use are presented as important criteria for such tools. Interactive graphics is introduced as a methodology for creating and maintaining hierarchical representations. The graphical representations of various requirements specification techniques and design tools are supported by an extended network model which supports hierarchical decomposition of structures. GDDT is proposed as a general purpose design tool which supports the most common logical constructions of both requirements specification and design methodologies and yet has a high level human interface which makes it easy to learn and use.}, isbn = {0097-8493}, doi = {16/0097-8493(84)90013-X}, url = {http://www.sciencedirect.com/science/article/pii/009784938490013X}, author = {Roussopoulos, Nick and Kelley,Stephen} } @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} } @conference {16771, title = {A Relational Database to Support Graphical Design and Documentation}, booktitle = {Databases for Business and Office Applications, Database Week}, year = {1983}, month = {1983///}, pages = {135 - 149}, author = {Roussopoulos, Nick and Kelley,S.} } @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 {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.} } @article {11945, title = {Correspondence from Correspondence}, journal = {Optical Society of America, Topical Meeting on Machine Vision}, year = {1980}, month = {1980///}, pages = {46 - 51}, abstract = {Image matching (or registration), is in general terms, aligning two identical or similar images or parts of images, and it is basic to a number of vision problems. These include optical nagivation (also known as motion analysis), stereo image interpretation, object analysis, change detection and others. The difficult part of all these problems, is the matching problem, i.e., the computation of the correspondence of elements in the different views. The computation of correspondence, in both the stereo and the motion problem is impossible without the use of some assumptions about the visual world and various researchers have proposed several theories for the computation of visual correspondence that worked well for the domains that fitted their assumptions. Studied here is the problem of the computation of visual correspondence, under the assumption that some values of the correspondence function are already known. The mathematical constraints that are needed for growing a solution for the correspondence function from points where its value is known are developed.}, keywords = {ALIGNMENT, COMPUTATION, Error analysis, IMAGE PROCESSING, IMAGES, STEREOSCOPIC VISION, VECTORS (MATHEMATICS)}, url = {http://adsabs.harvard.edu/abs/1980osa..meet...46A}, author = {Aloimonos, J. and Kamgar-Parsi,Behrooz} } @book {11942, title = {Pattern Recognition}, year = {1973}, month = {1973///}, publisher = {Computer Science Center, University of Maryland}, organization = {Computer Science Center, University of Maryland}, author = {Kanal,L. N and Agrawala, Ashok K.} } @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} }