@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 {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 {20305, title = {Characterization of Two Cryptic Plasmids Isolated in Haiti from Clinical Vibrio cholerae Non-O1/Non-O139}, journal = {Frontiers in Microbiology}, year = {2017}, month = {Nov-11-2018}, doi = {10.3389/fmicb.2017.02283}, url = {http://journal.frontiersin.org/article/10.3389/fmicb.2017.02283}, author = {Ceccarelli, Daniela and Garriss, Genevieve and Choi, Seon Y. and Hasan, Nur A. and Stepanauskas, Ramunas and Pop, Mihai and Huq, Anwar and Rita R Colwell} } @article {20308, title = {Comprehensive benchmarking and ensemble approaches for metagenomic classifiers}, journal = {Genome Biology}, year = {2017}, month = {Jan-12-2017}, doi = {10.1186/s13059-017-1299-7}, url = {http://genomebiology.biomedcentral.com/articles/10.1186/s13059-017-1299-7}, author = {McIntyre, Alexa B. R. and Ounit, Rachid and Afshinnekoo, Ebrahim and Prill, Robert J. and H{\'e}naff, Elizabeth and Alexander, Noah and Minot, Samuel S. and Danko, David and Foox, Jonathan and Ahsanuddin, Sofia and Tighe, Scott and Hasan, Nur A. and Subramanian, Poorani and Moffat, Kelly and Levy, Shawn and Lonardi, Stefano and Greenfield, Nick and Rita R Colwell and Rosen, Gail L. and Mason, Christopher E.} } @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 {20309, title = {The microbiomes of blowflies and houseflies as bacterial transmission reservoirs}, journal = {Scientific Reports}, year = {2017}, month = {Jan-12-2017}, abstract = {Blowflies and houseflies are mechanical vectors inhabiting synanthropic environments around the world. They feed and breed in fecal and decaying organic matter, but the microbiome they harbour and transport is largely uncharacterized. We sampled 116 individual houseflies and blowflies from varying habitats on three continents and subjected them to high-coverage, whole-genome shotgun sequencing. This allowed for genomic and metagenomic analyses of the host-associated microbiome at the species level. Both fly host species segregate based on principal coordinate analysis of their microbial communities, but they also show an overlapping core microbiome. Legs and wings displayed the largest microbial diversity and were shown to be an important route for microbial dispersion. The environmental sequencing approach presented here detected a stochastic distribution of human pathogens, such as Helicobacter pylori, thereby demonstrating the potential of flies as proxies for environmental and public health surveillance.}, doi = {10.1038/s41598-017-16353-x}, url = {http://www.nature.com/articles/s41598-017-16353-x}, author = {Junqueira, AC and Ratan, Aakrosh and Acerbi, Enzo and Drautz-Moses, Daniela I. and Premkrishnan, BNV and Costea, PI and Linz, Bodo and Purbojati, Rikky W. and Paulo, Daniel F. and Gaultier, Nicolas E. and Subramanian, Poorani and Hasan, Nur A. and Rita R Colwell and Bork, Peer and Azeredo-Espin, Ana Maria L. and Bryant, Donald A. and Schuster, Stephan C.} } @article {20324, title = {Chitin promotes Mycobacterium ulcerans growth}, journal = {FEMS Microbiology Ecology}, volume = {928565871}, year = {2016}, month = {Jun-06-2017}, pages = {fiw067}, abstract = {Mycobacterium ulcerans (MU) is the causative agent of Buruli ulcer, an emerging human infectious disease. However, both the ecology and life cycle of MU are poorly understood. The occurrence of MU has been linked to the aquatic environment, notably water bodies affected by human activities. It has been hypothesized that one or a combination of environmental factor(s) connected to human activities could favour growth of MU in aquatic systems. Here, we tested in vitro the growth effect of two ubiquitous polysaccharides and five chemical components on MU at concentration ranges shown to occur in endemic regions. Real-time PCR showed that chitin increased MU growth significantly providing a nutrient source or environmental support for the bacillus, thereby, providing a focus on the association between MU and aquatic arthropods. Aquatic environments with elevated population of arthropods provide increased chitin availability and, thereby, enhanced multiplication of MU. If calcium very slightly enhanced MU growth, iron, zinc, sulphate and phosphate did not stimulate MU growth, and at the concentration ranges of this study would limit MU population in natural ecosystems.}, doi = {10.1093/femsec/fiw067}, url = {https://academic.oup.com/femsec/article-lookup/doi/10.1093/femsec/fiw067}, author = {Sanhueza, Daniel and Chevillon, Christine and Rita R Colwell and Babonneau, J{\'e}r{\'e}mie and Marion, Estelle and Marsollier, Laurent and {\'e}gan, {\c c}ois}, editor = {Sobecky, Patricia} } @article {20329, title = {Climate influence on Vibrio and associated human diseases during the past half-century in the coastal North Atlantic}, journal = {Proceedings of the National Academy of Sciences}, year = {2016}, month = {Nov-08-2017}, pages = {E5062 - E5071}, abstract = {Climate change is having a dramatic impact on marine animal and plant communities but little is known of its influence on marine prokaryotes, which represent the largest living biomass in the world oceans and play a fundamental role in maintaining life on our planet. In this study, for the first time to our knowledge, experimental evidence is provided on the link between multidecadal climatic variability in the temperate North Atlantic and the presence and spread of an important group of marine prokaryotes, the vibrios, which are responsible for several infections in both humans and animals. Using archived formalin-preserved plankton samples collected by the Continuous Plankton Recorder survey over the past half-century (1958{\textendash}2011), we assessed retrospectively the relative abundance of vibrios, including human pathogens, in nine areas of the North Atlantic and North Sea and showed correlation with climate and plankton changes. Generalized additive models revealed that long-term increase in Vibrio abundance is promoted by increasing sea surface temperatures (up to \~{}1.5 {\textdegree}C over the past 54 y) and is positively correlated with the Northern Hemisphere Temperature (NHT) and Atlantic Multidecadal Oscillation (AMO) climatic indices (P < 0.001). Such increases are associated with an unprecedented occurrence of environmentally acquired Vibrio infections in the human population of Northern Europe and the Atlantic coast of the United States in recent years.}, issn = {0027-8424}, doi = {10.1073/pnas.1609157113}, url = {http://www.pnas.org/lookup/doi/10.1073/pnas.1609157113}, author = {Vezzulli, Luigi and Grande, Chiara and Reid, Philip C. and {\'e}laou{\"e}t, Pierre and Edwards, Martin and {\"o}fle, Manfred G. and Brettar, Ingrid and Rita R Colwell and Pruzzo, Carla} } @article {20336, title = {Cross-talk among flesh-eating Aeromonas hydrophila strains in mixed infection leading to necrotizing fasciitis}, journal = {Proceedings of the National Academy of Sciences}, volume = {11312161268}, year = {2016}, month = {Jul-01-2017}, pages = {722 - 727}, abstract = {Necrotizing fasciitis (NF) caused by flesh-eating bacteria is associated with high case fatality. In an earlier study, we reported infection of an immunocompetent individual with multiple strains of Aeromonas hydrophila (NF1{\textendash}NF4), the latter three constituted a clonal group whereas NF1 was phylogenetically distinct. To understand the complex interactions of these strains in NF pathophysiology, a mouse model was used, whereby either single or mixed A. hydrophila strains were injected intramuscularly. NF2, which harbors exotoxin A (exoA) gene, was highly virulent when injected alone, but its virulence was attenuated in the presence of NF1 (exoA-minus). NF1 alone, although not lethal to animals, became highly virulent when combined with NF2, its virulence augmented by cis-exoA expression when injected alone in mice. Based on metagenomics and microbiological analyses, it was found that, in mixed infection, NF1 selectively disseminated to mouse peripheral organs, whereas the other strains (NF2, NF3, and NF4) were confined to the injection site and eventually cleared. In vitro studies showed NF2 to be more effectively phagocytized and killed by macrophages than NF1. NF1 inhibited growth of NF2 on solid media, but ExoA of NF2 augmented virulence of NF1 and the presence of NF1 facilitated clearance of NF2 from animals either by enhanced priming of host immune system or direct killing via a contact-dependent mechanism.}, issn = {0027-8424}, doi = {10.1073/pnas.1523817113}, url = {http://www.pnas.org/lookup/doi/10.1073/pnas.1523817113}, author = {Ponnusamy, Duraisamy and Kozlova, Elena V. and Sha, Jian and Erova, Tatiana E. and Azar, Sasha R. and Fitts, Eric C. and Kirtley, Michelle L. and Tiner, Bethany L. and Andersson, Jourdan A. and Grim, Christopher J. and Isom, Richard P. and Hasan, Nur A. and Rita R Colwell and Chopra, Ashok K.} } @article {20325, title = {Enrichment dynamics of Listeria monocytogenes and the associated microbiome from naturally contaminated ice cream linked to a listeriosis outbreak}, journal = {BMC Microbiology}, year = {2016}, month = {Jan-12-2016}, doi = {10.1186/s12866-016-0894-1}, url = {http://bmcmicrobiol.biomedcentral.com/articles/10.1186/s12866-016-0894-1}, author = {Ottesen, Andrea and Ramachandran, Padmini and Reed, Elizabeth and White, James R. and Hasan, Nur and Subramanian, Poorani and Ryan, Gina and Jarvis, Karen and Grim, Christopher and Daquiqan, Ninalynn and Hanes, Darcy and Allard, Marc and Rita R Colwell and Brown, Eric and Chen, Yi} } @article {20348, title = {Deep-sea hydrothermal vent bacteria related to human pathogenic Vibrio species}, journal = {Proceedings of the National Academy of Sciences}, year = {2015}, month = {Feb-05-2017}, pages = {E2813 - E2819}, abstract = {Vibrio species are both ubiquitous and abundant in marine coastal waters, estuaries, ocean sediment, and aquaculture settings worldwide. We report here the isolation, characterization, and genome sequence of a novel Vibrio species, Vibrio antiquarius, isolated from a mesophilic bacterial community associated with hydrothermal vents located along the East Pacific Rise, near the southwest coast of Mexico. Genomic and phenotypic analysis revealed V. antiquarius is closely related to pathogenic Vibrio species, namely Vibrio alginolyticus, Vibrio parahaemolyticus, Vibrio harveyi, and Vibrio vulnificus, but sufficiently divergent to warrant a separate species status. The V. antiquarius genome encodes genes and operons with ecological functions relevant to the environment conditions of the deep sea and also harbors factors known to be involved in human disease caused by freshwater, coastal, and brackish water vibrios. The presence of virulence factors in this deep-sea Vibrio species suggests a far more fundamental role of these factors for their bacterial host. Comparative genomics revealed a variety of genomic events that may have provided an important driving force in V. antiquarius evolution, facilitating response to environmental conditions of the deep sea.}, issn = {0027-8424}, doi = {10.1073/pnas.1503928112}, url = {http://www.pnas.org/lookup/doi/10.1073/pnas.1503928112}, author = {Hasan, Nur A. and Grim, Christopher J. and Lipp, Erin K. and Rivera, Irma N. G. and Chun, Jongsik and Haley, Bradd J. and Taviani, Elisa and Choi, Seon Young and Hoq, Mozammel and Munk, A. Christine and Brettin, Thomas S. and Bruce, David and Challacombe, Jean F. and Detter, J. Chris and Han, Cliff S. and Eisen, Jonathan A. and Huq, Anwar and Rita R Colwell} } @article {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 {20338, title = {Nontoxigenic Vibrio cholerae Non-O1/O139 Isolate from a Case of Human Gastroenteritis in the U.S. Gulf Coast}, journal = {Journal of Clinical Microbiology}, year = {2015}, month = {Jun-01-2016}, pages = {9 - 14}, abstract = {An occurrence of Vibrio cholerae non-O1/O139 gastroenteritis in the U.S. Gulf Coast is reported here. Genomic analysis revealed that the isolate lacked known virulence factors associated with the clinical outcome of a V. cholerae infection but did contain putative genomic islands and other accessory virulence factors. Many of these factors are widespread among environmental strains of V. cholerae, suggesting that there might be additional virulence factors in non-O1/O139 V. cholerae yet to be determined. Phylogenetic analysis revealed that the isolate belonged to a phyletic lineage of environmental V. cholerae isolates associated with sporadic cases of gastroenteritis in the Western Hemisphere, suggesting a need to monitor non-O1/O139 V. cholerae in the interest of public health.}, issn = {0095-1137}, doi = {10.1128/JCM.02187-14}, url = {http://jcm.asm.org/lookup/doi/10.1128/JCM.02187-14}, author = {Hasan, Nur A. and Rezayat, Talayeh and Blatz, Peter J. and Choi, Seon Young and Griffitt, Kimberly J. and Rashed, Shah M. and Huq, Anwar and Conger, Nicholas G. and Rita R Colwell and Grimes, D. Jay}, editor = {Munson, E.} } @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} } @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 {20346, title = {Use of Environmental Parameters to Model Pathogenic Vibrios in Chesapeake Bay}, journal = {Journal of Environmental Informatics}, year = {2015}, month = {Jan-01-2015}, abstract = {Although the transportation sector is a major contributor to urban air pollution and global climate change due to its substantial energy consumptions, previous studies for evacuation practices in this sector seldom took environmental consequences into account. As an attempt in event-related evacuation planning under uncertainty, this study proposed an emission-mitigation-oriented fuzzy evacuation management (emoFEM) model. Comprehensive considerations over system efficiency, environmental protection, economic cost and resource availability were incorporated within a general modeling formulation to facilitate evacuation management in a systematic and compromise manner. Vague and ambiguous information embedded within evacuation problems could be quantified and directly communicated into the optimization process, greatly improving conventional tools for evacuation management under uncertainty. The proposed emoFEM model was then applied to a hypothetic but representative case. Useful solutions were generated, which could help identify timely, safe and cost-effective evacuation schemes without significant disturbances over normal municipal traffic and environmental quality. The advantages of emoFEM were further revealed through comparing its solutions with those from its deterministic counterpart. }, issn = {17262135}, doi = {10.3808/jei.201500307}, url = {http://www.iseis.org/jei/abstract.asp?no=201500307}, author = {Zaitchik, B. F. and Guikema, S. D. and Haley, B. J. and Taviani, E. and Chen, A. and Brown, M.E. and Huq, A. and Rita R Colwell} } @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 {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 {20366, title = {Viewing Marine Bacteria, Their Activity and Response to Environmental Drivers from Orbit}, journal = {Microbial Ecology}, year = {2014}, month = {Jan-04-2014}, pages = {489 - 500}, abstract = {Satellite-based remote sensing of marine microorganisms has become a useful tool in predicting human health risks associated with these microscopic targets. Early applications were focused on harmful algal blooms, but more recently methods have been developed to interrogate the ocean for bacteria. As satellite-based sensors have become more sophisticated and our ability to interpret information derived from these sensors has advanced, we have progressed from merely making fascinating pictures from space to developing process models with predictive capability. Our understanding of the role of marine microorganisms in primary production and global elemental cycles has been vastly improved as has our ability to use the combination of remote sensing data and models to provide early warning systems for disease outbreaks. This manuscript will discuss current approaches to monitoring cyanobacteria and vibrios, their activity and response to environmental drivers, and will also suggest future directions.}, issn = {0095-3628}, doi = {10.1007/s00248-013-0363-4}, url = {http://link.springer.com/10.1007/s00248-013-0363-4}, author = {Grimes, D. Jay and Ford, Tim E. and Rita R Colwell and Baker-Austin, Craig and Martinez-Urtaza, Jaime and Subramaniam, Ajit and Capone, Douglas G.} } @article {20378, title = {Detection of Vibrio cholerae in environmental waters including drinking water reservoirs of Azerbaijan}, journal = {Environmental Microbiology Reports}, year = {2013}, month = {Jan-02-2013}, pages = {30 - 38}, doi = {10.1111/j.1758-2229.2012.00369.x }, url = {https://onlinelibrary.wiley.com/doi/10.1111/j.1758-2229.2012.00369.x}, author = {Rashid, Ahmadov and Haley, Bradd J. and Rajabov, Mukhtar and Ahmadova, Sevinj and Gurbanov, Shair and Rita R Colwell and Huq, Anwar} } @article {20370, title = {Distribution of Virulence Genes in Clinical and Environmental Vibrio cholerae Strains in Bangladesh}, journal = {Applied and Environmental Microbiology}, year = {2013}, month = {Mar-09-2014}, pages = {5782 - 5785}, abstract = {Vibrio cholerae, an environmental organism, is a facultative human pathogen. Here, we report the virulence profiles, comprising 18 genetic markers, of 102 clinical and 692 environmental V. cholerae strains isolated in Bangladesh between March 2004 and January 2006, showing the variability of virulence determinants within the context of public health. }, issn = {0099-2240}, doi = {10.1128/AEM.01113-13}, url = {http://aem.asm.org/lookup/doi/10.1128/AEM.01113-13}, author = {Hasan, Nur A. and Ceccarelli, Daniela and Grim, Christopher J. and Taviani, Elisa and Choi, Jinna and Sadique, Abdus and Alam, Munirul and Siddique, Abul K. and Sack, R. Bradley and Huq, Anwar and Rita R Colwell} } @article {20364, title = {Identification of bacteria in enrichment cultures of sulfate reducers in the Cariaco Basin water column employing Denaturing Gradient Gel Electrophoresis of 16S ribosomal RNA gene fragments}, journal = {Aquatic Biosystems}, volume = {9}, year = {2013}, month = {Jan-01-2013}, pages = {17}, abstract = {Background The Cariaco Basin is characterized by pronounced and predictable vertical layering of microbial communities dominated by reduced sulfur species at and below the redox transition zone. Marine water samples were collected in May, 2005 and 2006, at the sampling stations A (10{\textdegree}30' N, 64{\textdegree}40' W), B (10{\textdegree}40' N, 64{\textdegree}45' W) and D (10{\textdegree}43{\textquoteright}N, 64{\textdegree}32{\textquoteright}W) from different depths, including surface, redox interface, and anoxic zones. In order to enrich for sulfate reducing bacteria (SRB), water samples were inoculated into anaerobic media amended with lactate or acetate as carbon source. To analyze the composition of enrichment cultures, we performed DNA extraction, PCR-DGGE, and sequencing of selected bands. Results DGGE results indicate that many bacterial genera were present that are associated with the sulfur cycle, including Desulfovibrio spp., as well as heterotrophs belonging to Vibrio, Enterobacter, Shewanella, Fusobacterium, Marinifilum, Mariniliabilia, and Spirochaeta. These bacterial populations are related to sulfur coupling and carbon cycles in an environment of variable redox conditions and oxygen availability. Conclusions In our studies, we found an association of SRB-like Desulfovibrio with Vibrio species and other genera that have a previously defined relevant role in sulfur transformation and coupling of carbon and sulfur cycles in an environment where there are variable redox conditions and oxygen availability. This study provides new information about microbial species that were culturable on media for SRB at anaerobic conditions at several locations and water depths in the Cariaco Basin.}, issn = {2046-9063}, doi = {10.1186/2046-9063-9-17}, url = {http://aquaticbiosystems.biomedcentral.com/articles/10.1186/2046-9063-9-17}, author = {Bozo-Hurtado, Lorelei and Garc{\'\i}a-Amado, M and Chistoserdov, Andrei and Varela, Ramon and Narvaez, J and Rita R Colwell and Su{\'a}rez, Paula} } @article {19702, title = {Personal informatics in the wild: hacking habits for health \& happiness}, journal = {CHI {\textquoteright}13 Extended Abstracts on Human Factors in Computing Systems}, year = {2013}, month = {2013/00/27}, pages = {3179 - 3182}, publisher = {SIGCHI, ACM Special Interest Group on Computer-Human InteractionACM}, address = {New York, New York, USA}, abstract = {Abstract Personal informatics is a class of systems that help people collect personal information to improve self-knowledge. Improving self-knowledge can foster self-insight and promote positive behaviors, such as healthy living and energy conservation. The ...}, isbn = {9781450319522}, doi = {10.1145/2468356.2479641}, url = {http://dl.acm.org/citation.cfm?doid=2468356.2479641}, author = {Li, Ian and Jon Froehlich and Larsen, Jakob E and Grevet, Catherine and Ramirez, Ernesto} } @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} } @article {19688, title = {Spoiler Alert: Machine Learning Approaches to Detect Social Media Posts with Revelatory Information}, year = {2013}, month = {2013/00/01}, abstract = {ABSTRACT Spoilers{\textemdash}critical plot information about works of fiction that {\textquotedblleft}spoil{\textquotedblright} a viewer{\textquoteright}s enjoyment{\textemdash}have prompted elaborate conventions on social media to allow readers to insulate themselves from spoilers. However, these solutions depend on the ...}, url = {http://www.umiacs.umd.edu/~jbg/docs/2013_spoiler.pdf}, author = {Jordan Boyd-Graber and Glasgow, K and Zajac, J S} } @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 {19130, title = {AGORA: Assembly Guided by Optical Restriction Alignment}, journal = {BMC bioinformatics}, volume = {13}, year = {2012}, month = {2012}, abstract = {Genome assembly is difficult due to repeated sequences within the genome, which create ambiguities and cause the final assembly to be broken up into many separate sequences (contigs). Long range linking information, such as mate-pairs or mapping data, is necessary to help assembly software resolve repeats, thereby leading to a more complete reconstruction of genomes. Prior work has used optical maps for validating assemblies and scaffolding contigs, after an initial assembly has been produced. However, optical maps have not previously been used within the genome assembly process. Here, we use optical map information within the popular de Bruijn graph assembly paradigm to eliminate paths in the de Bruijn graph which are not consistent with the optical map and help determine the correct reconstruction of the genome.We developed a new algorithm called AGORA: Assembly Guided by Optical Restriction Alignment. AGORA is the first algorithm to use optical map information directly within the de Bruijn graph framework to help produce an accurate assembly of a genome that is consistent with the optical map information provided. Our simulations on bacterial genomes show that AGORA is effective at producing assemblies closely matching the reference sequences. Additionally, we show that noise in the optical map can have a strong impact on the final assembly quality for some complex genomes, and we also measure how various characteristics of the starting de Bruijn graph may impact the quality of the final assembly. Lastly, we show that a proper choice of restriction enzyme for the optical map may substantially improve the quality of the final assembly. Our work shows that optical maps can be used effectively to assemble genomes within the de Bruijn graph assembly framework. Our experiments also provide insights into the characteristics of the mapping data that most affect the performance of our algorithm, indicating the potential benefit of more accurate optical mapping technologies, such as nano-coding. }, author = {Lin, H.C. and Goldstein, S. and Mendelowitz, L. and Zhou, S. and Wetzel, J. and Schwartz, D.C. and Pop, Mihai} } @article {18820, title = {Automated synthesis of action selection policies for unmanned vehicles operating in adverse environments}, journal = {Autonomous Robots}, volume = {32}, year = {2012}, month = {2012///}, pages = {149 - 164}, abstract = {We address the problem of automated action selection policy synthesis for unmanned vehicles operating in adverse environments. We introduce a new evolutionary computation-based approach using which an initial version of the policy is automatically generated and then gradually refined by detecting and fixing its shortcomings. The synthesis technique consists of the automated extraction of the vehicle{\textquoteright}s exception states and Genetic Programming (GP) for automated composition and optimization of corrective sequences of commands in the form of macro-actions to be applied locally. The focus is specifically on automated synthesis of a policy for Unmanned Surface Vehicle (USV) to efficiently block the advancement of an intruder boat toward a valuable target. This task requires the USV to utilize reactive planning complemented by short-term forward planning to generate specific maneuvers for blocking. The intruder is human-competitive and exhibits a deceptive behavior so that the USV cannot exploit regularity in its attacking behavior. We compared the performance of a hand-coded blocking policy to the performance of a policy that was automatically synthesized. Our results show that the performance of the automatically generated policy exceeds the performance of the hand-coded policy and thus demonstrates the feasibility of the proposed approach.}, keywords = {Computer science}, isbn = {0929-5593}, doi = {10.1007/s10514-011-9268-6}, url = {http://www.springerlink.com/content/664k84x080868141/abstract/}, author = {Svec,Petr and Gupta, Satyandra K.} } @article {13505, title = {Automatic Authentication of Banknotes}, journal = {IEEE Transactions on Information Forensics \& Security}, year = {2012}, month = {2012///}, abstract = {In this paper, we address the problem of the automatic authentication of paper currency. Indian banknotes are used to show how a system can be developed for discriminating counterfeit notes from genuine notes. Image processing and pattern recognition techniques are designed to carefully analyze embedded security features. Experiments conducted on forensic samples show that a high precision low cost machine can be developed to address this problem. The analysis of current security features{\textquoteright} ability to protect against counterfeiting also suggest topics that should be considered in designing future currency notes.}, author = {Roy,Ankush and Halder,Biswaiit and Garain,Utpal and David Doermann} } @article {19654, title = {BclAF1 restriction factor is neutralized by proteasomal degradation and microRNA repression during human cytomegalovirus infection}, journal = {Proceedings of the National Academy of Sciences}, volume = {109}, year = {2012}, month = {2012/06/12/}, pages = {9575 - 9580}, abstract = {Cell proteins can restrict the replication of viruses. Here, we identify the cellular BclAF1 protein as a human cytomegalovirus restriction factor and describe two independent mechanisms the virus uses to decrease its steady-state levels. Immediately following infection, the viral pp71 and UL35 proteins, which are delivered to cells within virions, direct the proteasomal degradation of BclAF1. Although BclAF1 reaccumulates through the middle stages of infection, it is subsequently down-regulated at late times by miR-UL112-1, a virus-encoded microRNA. In the absence of BclAF1 neutralization, viral gene expression and replication are inhibited. These data identify two temporally and mechanistically distinct functions used by human cytomegalovirus to down-regulate a cellular antiviral protein.}, keywords = {innate immunity, intrinsic immunity, miRNA, Proteasome, UL82}, isbn = {0027-8424, 1091-6490}, url = {http://www.pnas.org/content/109/24/9575}, author = {Lee, Song Hee and Kalejta, Robert F. and Kerry, Julie and Semmes, Oliver John and O{\textquoteright}Connor, Christine M. and Zia Khan and Garcia, Benjamin A. and Shenk, Thomas and Murphy, Eain} } @article {19135, title = {Bioinformatics for the Human Microbiome Project}, journal = {PLoS Computational Biology}, volume = {8}, year = {2012}, month = {11/2012}, pages = {e1002779}, doi = {10.1371/journal.pcbi.1002779}, author = {Gevers, Dirk and Pop, Mihai and Schloss, Patrick D. and Huttenhower, Curtis} } @article {12433, title = {A Blur-robust Descriptor with Applications to Face Recognition}, journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {PP}, year = {2012}, month = {2012/01/10/}, pages = {1 - 1}, abstract = {Understanding the effect of blur is an important problem in unconstrained visual analysis. We address this problem in the context of image-based recognition, by a fusion of image-formation models, and differential geometric tools. First, we discuss the space spanned by blurred versions of an image and then under certain assumptions, provide a differential geometric analysis of that space. More specifically, we create a subspace resulting from convolution of an image with a complete set of orthonormal basis functions of a pre-specified maximum size (that can represent an arbitrary blur kernel within that size), and show that the corresponding subspaces created from a clean image and its blurred versions are equal under the ideal case of zero noise, and some assumptions on the properties of blur kernels. We then study the practical utility of this subspace representation for the problem of direct recognition of blurred faces, by viewing the subspaces as points on the Grassmann manifold and present methods to perform recognition for cases where the blur is both homogenous and spatially varying. We empirically analyze the effect of noise, as well as the presence of other facial variations between the gallery and probe images, and provide comparisons with existing approaches on standard datasets.}, keywords = {Blur, convolution, Face, face recognition, Grassmann manifold, Kernel, Manifolds, NOISE, PROBES}, isbn = {0162-8828}, doi = {10.1109/TPAMI.2012.15}, author = {Gopalan,R. and Taheri, S. and Turaga,P. and Chellapa, Rama} } @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 {12853, title = {Conversion of viable but nonculturable enteric bacteria to culturable by co-culture with eukaryotic cells}, journal = {Microbiology and Immunology}, volume = {56}, year = {2012}, month = {2012/04/27/}, pages = {342 - 345}, abstract = {Viable but nonculturable (VBNC) Vibrio cholerae non-O1/non-O139, V. parahaemolyticus, enterohemorrhagic Escherichia coli, enterotoxigenic E. coli, enteropathogenic E. coli, Shigella flexneri, and Salmonella enterica were converted to the culturable state by co-culture with selected eukaryotic cells, e.g., HT-29, Caco-2, T84, HeLa, Intestine 407, and CHO cells.}, keywords = {conversion to culturability, enteric bacteria, viable but nonculturable}, isbn = {1348-0421}, doi = {10.1111/j.1348-0421.2012.00440.x}, url = {http://onlinelibrary.wiley.com/doi/10.1111/j.1348-0421.2012.00440.x/abstract?userIsAuthenticated=false\&deniedAccessCustomisedMessage=}, author = {Senoh,Mitsutoshi and Ghosh-Banerjee,Jayeeta and Ramamurthy,Thandavarayan and Rita R Colwell and Miyoshi,Shin-ichi and Nair,G. Balakrish and Takeda,Yoshifumi} } @article {19128, title = {Deep Sequencing of the Oral Microbiome Reveals Signatures of Periodontal Disease}, journal = {PloS one}, volume = {7}, year = {2012}, month = {2012}, abstract = {The oral microbiome, the complex ecosystem of microbes inhabiting the human mouth, harbors several thousands of bacterial types. The proliferation of pathogenic bacteria within the mouth gives rise to periodontitis, an inflammatory disease known to also constitute a risk factor for cardiovascular disease. While much is known about individual species associated with pathogenesis, the system-level mechanisms underlying the transition from health to disease are still poorly understood. Through the sequencing of the 16S rRNA gene and of whole community DNA we provide a glimpse at the global genetic, metabolic, and ecological changes associated with periodontitis in 15 subgingival plaque samples, four from each of two periodontitis patients, and the remaining samples from three healthy individuals. We also demonstrate the power of whole-metagenome sequencing approaches in characterizing the genomes of key players in the oral microbiome, including an unculturable TM7 organism. We reveal the disease microbiome to be enriched in virulence factors, and adapted to a parasitic lifestyle that takes advantage of the disrupted host homeostasis. Furthermore, diseased samples share a common structure that was not found in completely healthy samples, suggesting that the disease state may occupy a narrow region within the space of possible configurations of the oral microbiome. Our pilot study demonstrates the power of high-throughput sequencing as a tool for understanding the role of the oral microbiome in periodontal disease. Despite a modest level of sequencing (~2 lanes Illumina 76 bp PE) and high human DNA contamination (up to ~90\%) we were able to partially reconstruct several oral microbes and to preliminarily characterize some systems-level differences between the healthy and diseased oral microbiomes.}, author = {Liu,B. and Faller, L.L. and Klitgord, N. and Mazumdar, V. and Ghodsi,M. and Sommer, D.D. and Gibbons, T.R. and Treangen, T.J. and Chang, Y.C. and Li,S.} } @article {20387, title = {Ecology of Vibrio parahaemolyticus and Vibrio vulnificus in the Coastal and Estuarine Waters of Louisiana, Maryland, Mississippi, and Washington (United States)}, journal = {Applied and Environmental Microbiology}, year = {2012}, month = {Mar-10-2013}, pages = {7249 - 7257}, abstract = {Vibrio parahaemolyticus and Vibrio vulnificus, which are native to estuaries globally, are agents of seafood-borne or wound infections, both potentially fatal. Like all vibrios autochthonous to coastal regions, their abundance varies with changes in environmental parameters. Sea surface temperature (SST), sea surface height (SSH), and chlorophyll have been shown to be predictors of zooplankton and thus factors linked to vibrio populations. The contribution of salinity, conductivity, turbidity, and dissolved organic carbon to the incidence and distribution of Vibrio spp. has also been reported. Here, a multicoastal, 21-month study was conducted to determine relationships between environmental parameters and V. parahaemolyticus and V. vulnificus populations in water, oysters, and sediment in three coastal areas of the United States. Because ecologically unique sites were included in the study, it was possible to analyze individual parameters over wide ranges. Molecular methods were used to detect genes for thermolabile hemolysin (tlh), thermostable direct hemolysin (tdh), and tdh-related hemolysin (trh) as indicators of V. parahaemolyticus and the hemolysin gene vvhA for V. vulnificus. SST and suspended particulate matter were found to be strong predictors of total and potentially pathogenic V. parahaemolyticus and V. vulnificus. Other predictors included chlorophyll a, salinity, and dissolved organic carbon. For the ecologically unique sites included in the study, SST was confirmed as an effective predictor of annual variation in vibrio abundance, with other parameters explaining a portion of the variation not attributable to SST.}, issn = {0099-2240}, doi = {10.1128/AEM.01296-12}, url = {http://aem.asm.org/lookup/doi/10.1128/AEM.01296-12}, author = {Johnson, Crystal N. and Bowers, John C. and Griffitt, Kimberly J. and Molina, Vanessa and Clostio, Rachel W. and Pei, Shaofeng and Laws, Edward and Paranjpye, Rohinee N. and Strom, Mark S. and Chen, Arlene and Hasan, Nur A. and Huq, Anwar and Noriea, Nicholas F. and Grimes, D. Jay and Rita R Colwell} } @article {13939, title = {Efficient FMM accelerated vortex methods in three dimensions via the Lamb-Helmholtz decomposition}, journal = {arXiv:1201.5430}, year = {2012}, month = {2012/01/25/}, abstract = {Vortex element methods are often used to efficiently simulate incompressible flows using Lagrangian techniques. Use of the FMM (Fast Multipole Method) allows considerable speed up of both velocity evaluation and vorticity evolution terms in these methods. Both equations require field evaluation of constrained (divergence free) vector valued quantities (velocity, vorticity) and cross terms from these. These are usually evaluated by performing several FMM accelerated sums of scalar harmonic functions. We present a formulation of the vortex methods based on the Lamb-Helmholtz decomposition of the velocity in terms of two scalar potentials. In its original form, this decomposition is not invariant with respect to translation, violating a key requirement for the FMM. One of the key contributions of this paper is a theory for translation for this representation. The translation theory is developed by introducing "conversion" operators, which enable the representation to be restored in an arbitrary reference frame. Using this form, extremely efficient vortex element computations can be made, which need evaluation of just two scalar harmonic FMM sums for evaluating the velocity and vorticity evolution terms. Details of the decomposition, translation and conversion formulae, and sample numerical results are presented.}, keywords = {Computer Science - Numerical Analysis, Mathematical Physics, Physics - Computational Physics, Physics - Fluid Dynamics}, url = {http://arxiv.org/abs/1201.5430}, author = {Gumerov, Nail A. and Duraiswami, Ramani} } @article {19612, title = {Efficient Verification of Web-content Searching Through Authenticated Web Crawlers}, journal = {Proc. VLDB Endow.}, volume = {5}, year = {2012}, month = {2012/06//}, pages = {920 - 931}, abstract = {We consider the problem of verifying the correctness and completeness of the result of a keyword search. We introduce the concept of an authenticated web crawler and present its design and prototype implementation. An authenticated web crawler is a trusted program that computes a specially-crafted signature over the web contents it visits. This signature enables (i) the verification of common Internet queries on web pages, such as conjunctive keyword searches---this guarantees that the output of a conjunctive keyword search is correct and complete; (ii) the verification of the content returned by such Internet queries---this guarantees that web data is authentic and has not been maliciously altered since the computation of the signature by the crawler. In our solution, the search engine returns a cryptographic proof of the query result. Both the proof size and the verification time are proportional only to the sizes of the query description and the query result, but do not depend on the number or sizes of the web pages over which the search is performed. As we experimentally demonstrate, the prototype implementation of our system provides a low communication overhead between the search engine and the user, and fast verification of the returned results by the user.}, isbn = {2150-8097}, url = {http://dl.acm.org/citation.cfm?id=2336664.2336666}, author = {Goodrich, Michael T. and Charalampos Papamanthou and Nguyen, Duy and Tamassia, Roberto and Lopes, Cristina Videira and Ohrimenko, Olga and Triandopoulos, Nikos} } @article {13066, title = {Face Identification Using Large Feature Sets}, journal = {Image Processing, IEEE Transactions on}, volume = {21}, year = {2012}, month = {2012/04//}, pages = {2245 - 2255}, abstract = {With the goal of matching unknown faces against a gallery of known people, the face identification task has been studied for several decades. There are very accurate techniques to perform face identification in controlled environments, particularly when large numbers of samples are available for each face. However, face identification under uncontrolled environments or with a lack of training data is still an unsolved problem. We employ a large and rich set of feature descriptors (with more than 70 000 descriptors) for face identification using partial least squares to perform multichannel feature weighting. Then, we extend the method to a tree-based discriminative structure to reduce the time required to evaluate probe samples. The method is evaluated on Facial Recognition Technology (FERET) and Face Recognition Grand Challenge (FRGC) data sets. Experiments show that our identification method outperforms current state-of-the-art results, particularly for identifying faces acquired across varying conditions.}, keywords = {(mathematics);, approximations;trees, challenge, data, data;tree-based, discriminative, environments;face, feature, FERET;FRGC, grand, identification, least, recognition, recognition;least, sets;face, sets;facial, squares, squares;training, structure;uncontrolled, task;face, technology;multichannel, weighting;partial}, isbn = {1057-7149}, doi = {10.1109/TIP.2011.2176951}, author = {Schwartz, W.R. and Guo,Huimin and Choi,Jonghyun and Davis, Larry S.} } @article {19131, title = {A framework for human microbiome research}, journal = {Nature}, volume = {486}, year = {2012}, month = {2012}, pages = {215 - 221}, abstract = {A variety of microbial communities and their genes (the microbiome) exist throughout the human body, with fundamental roles in human health and disease. The National Institutes of Health (NIH)-funded Human Microbiome Project Consortium has established a population-scale framework to develop metagenomic protocols, resulting in a broad range of quality-controlled resources and data including standardized methods for creating, processing and interpreting distinct types of high-throughput metagenomic data available to the scientific community. Here we present resources from a population of 242 healthy adults sampled at 15 or 18 body sites up to three times, which have generated 5,177 microbial taxonomic profiles from 16S ribosomal RNA genes and over 3.5 terabases of metagenomic sequence so far. In parallel, approximately 800 reference strains isolated from the human body have been sequenced. Collectively, these data represent the largest resource describing the abundance and variety of the human microbiome, while providing a framework for current and future studies.}, author = {Meth{\'e}, B.A. and Nelson,K. E and Pop, Mihai and Creasy, H.H. and Giglio, M.G. and Huttenhower, C. and Gevers, D. and Petrosino, J.F. and Abubucker, S. and Badger, J.H.} } @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 {15917, title = {Gradient-based Image Recovery Methods from Incomplete Fourier Measurements}, journal = {IEEE Transactions on Image Processing}, volume = {PP}, year = {2012}, month = {2012///}, pages = {1 - 1}, abstract = {A major problem in imaging applications such as Magnetic Resonance Imaging (MRI) and Synthetic Aperture Radar (SAR) is the task of trying to reconstruct an image with the smallest possible set of Fourier samples, every single one of which has a potential time and/or power cost. The theory of Compressive Sensing (CS) points to ways of exploiting inherent sparsity in such images in order to achieve accurate recovery using sub- Nyquist sampling schemes. Traditional CS approaches to this problem consist of solving total-variation minimization programs with Fourier measurement constraints or other variations thereof. This paper takes a different approach: Since the horizontal and vertical differences of a medical image are each more sparse or compressible than the corresponding total-variational image, CS methods will be more successful in recovering these differences individually. We develop an algorithm called GradientRec that uses a CS algorithm to recover the horizontal and vertical gradients and then estimates the original image from these gradients. We present two methods of solving the latter inverse problem: one based on least squares optimization and the other based on a generalized Poisson solver. After a thorough derivation of our complete algorithm, we present the results of various experiments that compare the effectiveness of the proposed method against other leading methods.}, keywords = {Compressed sensing, Fourier transforms, Image coding, Image edge detection, Image reconstruction, L1{\textendash}minimization, minimization, Noise measurement, OPTIMIZATION, Poisson solver, Sparse recovery, Total variation, TV}, isbn = {1057-7149}, doi = {10.1109/TIP.2011.2159803}, author = {Patel, Vishal M. and Maleh,R. and Gilbert,A. C and Chellapa, Rama} } @conference {18848, title = {Gripper synthesis for indirect manipulation of cells using Holographic Optical Tweezers}, year = {2012}, month = {2012/05//}, pages = {2749 - 2754}, abstract = {Optical Tweezers (OT) are used for highly accurate manipulations of biological cells. However, the direct exposure of cells to focused laser beam may negatively influence their biological functions. In order to overcome this problem, we generate multiple optical traps to grab and move a 3D ensemble of inert particles such as silica microspheres to act as a reconfigurable gripper for a manipulated cell. The relative positions of the microspheres are important in order for the gripper to be robust against external environmental forces and the exposure of high intensity laser on the cell to be minimized. In this paper, we present results of different gripper configurations, experimentally tested using our OT setup, that provide robust gripping as well as minimize laser intensity experienced by the cell. We developed a computational approach that allowed us to perform preliminary modeling and synthesis of the gripper configurations. The gripper synthesis is cast as a multi-objective optimization problem.}, doi = {10.1109/ICRA.2012.6225153}, author = {Chowdhury,Sagar and Svec,Petr and Wang,Chenlu and Losert,Wolfgang and Gupta, Satyandra K.} } @article {19721, title = {InterPro in 2011: new developments in the family and domain prediction database.}, journal = {Nucleic Acids Res}, volume = {40}, year = {2012}, month = {2012 Jan}, pages = {D306-12}, abstract = {

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

}, keywords = {Databases, Protein, Protein Structure, Tertiary, Proteins, Sequence Analysis, Protein, software, Terminology as Topic, User-Computer Interface}, issn = {1362-4962}, doi = {10.1093/nar/gkr948}, author = {Hunter, Sarah and Jones, Philip and Mitchell, Alex and Apweiler, Rolf and Attwood, Teresa K and Bateman, Alex and Bernard, Thomas and Binns, David and Bork, Peer and Burge, Sarah and de Castro, Edouard and Coggill, Penny and Corbett, Matthew and Das, Ujjwal and Daugherty, Louise and Duquenne, Lauranne and Finn, Robert D and Fraser, Matthew and Gough, Julian and Haft, Daniel and Hulo, Nicolas and Kahn, Daniel and Kelly, Elizabeth and Letunic, Ivica and Lonsdale, David and Lopez, Rodrigo and Madera, Martin and Maslen, John and McAnulla, Craig and McDowall, Jennifer and McMenamin, Conor and Mi, Huaiyu and Mutowo-Muellenet, Prudence and Mulder, Nicola and Natale, Darren and Orengo, Christine and Pesseat, Sebastien and Punta, Marco and Quinn, Antony F and Rivoire, Catherine and Sangrador-Vegas, Amaia and Jeremy D Selengut and Sigrist, Christian J A and Scheremetjew, Maxim and Tate, John and Thimmajanarthanan, Manjulapramila and Thomas, Paul D and Wu, Cathy H and Yeats, Corin and Yong, Siew-Yit} } @article {20382, title = {Vibrio cholerae in a historically cholera-free country}, journal = {Environmental Microbiology Reports}, year = {2012}, month = {Jan-08-2012}, pages = {381 - 389}, abstract = {We report the autochthonous existence of Vibrio cholerae in coastal waters of Iceland, a geothermally active country where cholera is absent and has never been reported. Seawater, mussel and macroalgae samples were collected close to, and distant from, sites where geothermal activity causes a significant increase in water temperature during low tides. Vibrio cholerae was detected only at geothermal-influenced sites during low-tides. None of the V. cholerae isolates encoded cholera toxin (ctxAB) and all were non-O1/non-O139 serogroups. However, all isolates encoded other virulence factors that are associated with cholera as well as extra-intestinal V. cholerae infections. The virulence factors were functional at temperatures of coastal waters of Iceland, suggesting an ecological role. It is noteworthy that V. cholerae was isolated from samples collected at sites distant from anthropogenic influence, supporting the conclusion that V. cholerae is autochthonous to the aquatic environment of Iceland.}, doi = {10.1111/j.1758-2229.2012.00332.x}, url = {http://doi.wiley.com/10.1111/j.1758-2229.2012.00332.x}, author = {Haley, Bradd J. and Chen, Arlene and Grim, Christopher J. and Clark, Philip and Diaz, Celia M and Taviani, Elisa and Hasan, Nur A. and Sancomb, Elizabeth and Elnemr, Wessam M and Islam, Muhammad A. and Huq, Anwar and Rita R Colwell and Benediktsd{\'o}ttir, Eva} } @conference {19317, title = {Linguistic Resources for Handwriting Recognition and Translation Evaluation}, booktitle = {Eight International Conference on Language Resources and Evaluation (LREC{\textquoteright}12)}, year = {2012}, author = {Song, Zhiyi and Ismael, Safa and Grimes, Stephen and David Doermann and Strassel,Stephanie} } @conference {19170, title = {Making Recommendations in a Microblog to Improve the Impact of a Focal User}, booktitle = {6th ACM Conference on Recommender Systems (RecSys)}, year = {2012}, abstract = {We present a microblog recommendation system that can help monitor users, track conversations, and potentially improve diffusion impact. Given a Twitter network of active users and their followers, and historical activity of tweets, retweets and mentions, we build upon a prediction tool to predict the Top K users who will retweet or mention a focal user, in the future [10]. We develop personalized recommendations for each focal user. We identify characteristics of focal users such as the size of the follower network, or the level of sentiment averaged over all tweets; both have an impact on the quality of personalized recommendations. We use (high) betweenness centrality as a proxy of attractive users to target when making recommendations. Our recommendations successfully identify a greater fraction of users with higher betweenness centrality, in comparison to the overall distribution of betweenness centrality of the ground truth users for some focal user. }, author = {Wu,Shanchan and Gong, Leanna and Rand, William and Raschid, Louiqa} } @article {14415, title = {Organizing User Search Histories}, journal = {Knowledge and Data Engineering, IEEE Transactions on}, volume = {24}, year = {2012}, month = {2012/05//}, pages = {912 - 925}, abstract = {Users are increasingly pursuing complex task-oriented goals on the web, such as making travel arrangements, managing finances, or planning purchases. To this end, they usually break down the tasks into a few codependent steps and issue multiple queries around these steps repeatedly over long periods of time. To better support users in their long-term information quests on the web, search engines keep track of their queries and clicks while searching online. In this paper, we study the problem of organizing a user{\textquoteright}s historical queries into groups in a dynamic and automated fashion. Automatically identifying query groups is helpful for a number of different search engine components and applications, such as query suggestions, result ranking, query alterations, sessionization, and collaborative search. In our approach, we go beyond approaches that rely on textual similarity or time thresholds, and we propose a more robust approach that leverages search query logs. We experimentally study the performance of different techniques, and showcase their potential, especially when combined together.}, keywords = {alteration;query, analysis;user, engines;search, engines;text, goal;textual, group, historical, History, identification;query, information, interfaces;, log;sessionization;task-oriented, organization;query, processing;search, query, query;user, quest;query, ranking;search, search, search;long-term, similarity;time, suggestion;result, threshold;user, Web;collaborative}, isbn = {1041-4347}, doi = {10.1109/TKDE.2010.251}, author = {Hwang,Heasoo and Lauw,H. W and Getoor, Lise and Ntoulas,A.} } @article {14492, title = {Privacy in Social Networks}, journal = {Synthesis Lectures on Data Mining and Knowledge Discovery}, volume = {3}, year = {2012}, month = {2012///}, pages = {1 - 85}, author = {Zheleva,E. and Terzi,E. and Getoor, Lise} } @article {20385, title = {Role of GbpA protein, an important virulence-related colonization factor, for Vibrio cholerae{\textquoteright}s survival in the aquatic environment}, journal = {Environmental Microbiology Reports}, year = {2012}, month = {Jan-08-2012}, pages = {439 - 445}, abstract = {Vibrio cholerae N-acetyl glucosamine-binding protein A (GbpA) is a chitin binding protein and a virulence factor involved in the colonization of human intestine. We investigated the distribution and genetic variations of gbpA in 488 V. cholerae strains of environmental and clinical origin, belonging to different serogroups and biotypes. We found that the gene is consistently present and highly conserved including an environmental V. cholerae-related strain of ancestral origin. The gene was also consistently expressed in a number of representative V. cholerae strains cultured in laboratory aquatic microcosms under conditions simulating those found in temperate marine environments. Functional analysis carried out on V. cholerae O1 El Tor N16961 showed that GbpA is not involved in adhesion to inorganic surfaces but promotes interaction with environmental biotic substrates (plankton and bivalve hepatopancreas cells) representing known marine reservoir or host for the bacterium. It is suggested that the ability of GbpA to colonize human intestinal cells most probably originated from its primary function in the aquatic environment.}, doi = {10.1111/j.1758-2229.2012.00356.x}, url = {http://doi.wiley.com/10.1111/j.1758-2229.2012.00356.x}, author = {Stauder, Monica and Huq, Anwar and Pezzati, Elisabetta and Grim, Christopher J. and Ramoino, Paola and Pane, Luigi and Rita R Colwell and Pruzzo, Carla and Vezzulli, Luigi} } @article {18712, title = {Rpn1 and Rpn2 coordinate ubiquitin processing factors at the proteasome}, journal = {Journal of Biological ChemistryJ. Biol. Chem.}, year = {2012}, month = {2012/02/08/}, abstract = {Substrates tagged with (poly)ubiquitin for degradation can be targeted directly to the 26S proteasome where they are proteolysed. Independently, ubiquitin-conjugates may also be delivered by bivalent shuttles. The majority of shuttles attach to the proteasome through a ubiquitin-like domain (UBL) while anchoring cargo at a C-terminal polyubiquitin-binding domain(s). We found that two shuttles of this class, Rad23 and Dsk2, dock at two different receptors embedded within a single subunit of the 19S proteasome regulatory particle (RP), Rpn1. Their association/dissociation constants and affinities for Rpn1 are similar. In contrast, another UBL-containing protein, the deubiquitinase Ubp6, is also anchored by Rpn1, yet dissociates slower, thus behaving as a sometimes proteasome subunit distinct from transiently-associated shuttles. Two neighboring subunits, Rpn10 and Rpn13, show a marked preference for polyubiquitin over UBLs. Rpn10 attaches to the central solenoid portion of Rpn1 although this association is stabilized by the presence of a third subunit, Rpn2. Rpn13 binds directly to the C-terminal portion of Rpn2. These intrinsic polyubiquitin receptors may compete with substrate shuttles for their polyubiquitin-conjugates, thereby aiding release of the emptied shuttles. By binding multiple ubiquitin-processing factors simultaneously, Rpn1 is uniquely suited to coordinate substrate recruitment, deubiquitination, and movement towards the catalytic core. The broad range of affinities for ubiquitin, ubiquitin-like, and non-ubiquitin signals by adjacent yet non-overlapping sites all within the Base illustrates a hub of activity that coordinates the intricate relay of substrates within the proteasome, and consequently influences substrate residency time and commitment to degradation.}, keywords = {deubiquitination, Proteasome, solenoid, Surface plasmon resonance (SPR), ubiquitin, Ubiquitin-dependent protease}, isbn = {0021-9258, 1083-351X}, doi = {10.1074/jbc.M111.316323}, url = {http://www.jbc.org/content/early/2012/02/08/jbc.M111.316323}, author = {Rosenzweig,Rina and Bronner,Vered and Zhang,Daoning and Fushman, David and Glickman,Michael H.} } @article {17929, title = {Speeding Up Particle Trajectory Simulations under Moving Force Fields using GPUs}, journal = {Journal of Computing and Information Science in Engineering}, year = {2012}, month = {2012///}, abstract = {In this paper, we introduce a GPU-based framework forsimulating particle trajectories under both static and dynamic force fields. By exploiting the highly parallel nature of the problem and making efficient use of the available hardware, our simulator exhibits a significant speedup over its CPU- based analog. We apply our framework to a specific experi- mental simulation: the computation of trapping probabilities associated with micron-sized silica beads in optical trapping workbenches. When evaluating large numbers of trajectories (4096), we see approximately a 356 times speedup of the GPU-based simulator over its CPU-based counterpart. }, author = {Patro,R. and Dickerson,J. P. and Bista,S. and Gupta,S.K. and Varshney, Amitabh} } @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} } @conference {19374, title = {Sub-cellular feature detection and automated extraction of collocalized actin and myosin regions}, booktitle = {the 2nd ACM SIGHIT symposiumProceedings of the 2nd ACM SIGHIT symposium on International health informatics - IHI {\textquoteright}12}, year = {2012}, pages = {399}, publisher = {ACM Press}, organization = {ACM Press}, address = {Miami, Florida, USANew York, New York, USA}, isbn = {9781450307819}, doi = {10.1145/211036310.1145/2110363.2110409}, author = {Martineau, Justin and Mokashi,Ronil and Chapman, David and Grasso, Michael and Brady,Mary and Yesha,Yelena and Yesha,Yaacov and Cardone, Antonio and Dima, Alden} } @article {14398, title = {TACI: Taxonomy-Aware Catalog Integration}, journal = {IEEE Transactions on Knowledge and Data Engineering (TKDE)}, year = {2012}, month = {2012///}, abstract = {A fundamental data integration task faced by online commercial portals and commerce search engines is the integration of products coming from multiple providers to their product catalogs. In this scenario, the commercial portal has its own taxonomy (the {\textquotedblleft}master taxonomy{\textquotedblright}), while each data provider organizes its products into a different taxonomy (the {\textquotedblleft}provider taxonomy{\textquotedblright}). In this paper, we consider the problem of categorizing products from the data providers into the master taxonomy, while making use of the provider taxonomy information. Our approach is based on a taxonomy-aware processing step that adjusts the results of a text-based classifier to ensure that products that are close together in the provider taxonomy remain close in the master taxonomy. We formulate this intuition as a structured prediction optimization problem. To the best of our knowledge, this is the first approach that leverages the structure of taxonomies in order to enhance catalog integration. We propose algorithms that are scalable and thus applicable to the large datasets that are typical on the Web. We evaluate our algorithms on real-world data and we show that taxonomy-aware classification provides a significant improvement over existing approaches.}, author = {Papadimitriou,P. and Tsaparas,P. and Fuxman,A. and Getoor, Lise} } @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} } @article {19618, title = {Verifying Search Results Over Web Collections}, journal = {arXiv:1204.5446 [cs]}, year = {2012}, month = {2012/04/24/}, abstract = {Searching accounts for one of the most frequently performed computations over the Internet as well as one of the most important applications of outsourced computing, producing results that critically affect users{\textquoteright} decision-making behaviors. As such, verifying the integrity of Internet-based searches over vast amounts of web contents is essential. We provide the first solution to this general security problem. We introduce the concept of an authenticated web crawler and present the design and prototype implementation of this new concept. An authenticated web crawler is a trusted program that computes a special "signature" $s$ of a collection of web contents it visits. Subject to this signature, web searches can be verified to be correct with respect to the integrity of their produced results. This signature also allows the verification of complicated queries on web pages, such as conjunctive keyword searches. In our solution, along with the web pages that satisfy any given search query, the search engine also returns a cryptographic proof. This proof, together with the signature $s$, enables any user to efficiently verify that no legitimate web pages are omitted from the result computed by the search engine, and that no pages that are non-conforming with the query are included in the result. An important property of our solution is that the proof size and the verification time both depend solely on the sizes of the query description and the query result, but not on the number or sizes of the web pages over which the search is performed. Our authentication protocols are based on standard Merkle trees and the more involved bilinear-map accumulators. As we experimentally demonstrate, the prototype implementation of our system gives a low communication overhead between the search engine and the user, and allows for fast verification of the returned results on the user side.}, keywords = {Computer Science - Cryptography and Security}, url = {http://arxiv.org/abs/1204.5446}, author = {Goodrich, Michael T. and Nguyen, Duy and Ohrimenko, Olga and Charalampos Papamanthou and Tamassia, Roberto and Triandopoulos, Nikos and Lopes, Cristina Videira} } @conference {19465, title = {You{\textquoteright}Re Capped: Understanding the Effects of Bandwidth Caps on Broadband Use in the Home}, booktitle = {SIGCHI {\textquoteright}12}, series = {CHI {\textquoteright}12}, year = {2012}, month = {2012///}, pages = {3021 - 3030}, publisher = {ACM}, organization = {ACM}, abstract = {Bandwidth caps, a limit on the amount of data users can upload and download in a month, are common globally for both home and mobile Internet access. With caps, each bit of data consumed comes at a cost against a monthly quota or a running tab. Yet, relatively little work has considered the implications of this usage-based pricing model on the user experience. In this paper, we present results from a qualitative study of households living with bandwidth caps. Our findings suggest home users grapple with three uncertainties regarding their bandwidth usage: invisible balances, mysterious processes, and multiple users. We discuss how these uncertainties impact their usage and describe the potential for better tools to help monitor and manage data caps. We conclude that as a community we need to cater for users under Internet cost constraints.}, keywords = {Bandwidth, bandwidth cap, data cap, Internet, metered use, pricing, usage-based billing, usage-based pricing}, isbn = {978-1-4503-1015-4}, url = {http://doi.acm.org/10.1145/2207676.2208714}, author = {Marshini Chetty and Banks, Richard and Brush, A.J. and Donner, Jonathan and Grinter, Rebecca} } @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 {16241, title = {Accurate and fast estimation of taxonomic profiles from metagenomic shotgun sequences}, journal = {BMC Genomics}, volume = {12}, year = {2011}, month = {2011/07/27/}, pages = {S4 - S4}, abstract = {A major goal of metagenomics is to characterize the microbial composition of an environment. The most popular approach relies on 16S rRNA sequencing, however this approach can generate biased estimates due to differences in the copy number of the gene between even closely related organisms, and due to PCR artifacts. The taxonomic composition can also be determined from metagenomic shotgun sequencing data by matching individual reads against a database of reference sequences. One major limitation of prior computational methods used for this purpose is the use of a universal classification threshold for all genes at all taxonomic levels.}, isbn = {1471-2164}, doi = {10.1186/1471-2164-12-S2-S4}, url = {http://www.biomedcentral.com/1471-2164/12/S2/S4}, author = {Liu,Bo and Gibbons,Theodore and Ghodsi,Mohammad and Treangen,Todd and Pop, Mihai} } @conference {14431, title = {Active inference for retrieval in camera networks}, booktitle = {Person-Oriented Vision (POV), 2011 IEEE Workshop on}, year = {2011}, month = {2011/01//}, pages = {13 - 20}, abstract = {We address the problem of searching camera network videos to retrieve frames containing specified individuals. We show the benefit of utilizing a learned probabilistic model that captures dependencies among the cameras. In addition, we develop an active inference framework that can request human input at inference time, directing human attention to the portions of the videos whose correct annotation would provide the biggest performance improvements. Our primary contribution is to show that by mapping video frames in a camera network onto a graphical model, we can apply collective classification and active inference algorithms to significantly increase the performance of the retrieval system, while minimizing the number of human annotations required.}, keywords = {active, annotation;probabilistic, frame;cameras;inference, inference;camera, mechanisms;probability;search, model;human, model;retrieval, network;graphical, problem;video, problems;video, processing;, retrieval;video, signal, system;searching}, doi = {10.1109/POV.2011.5712363}, author = {Daozheng Chen and Bilgic,M. and Getoor, Lise and Jacobs, David W. and Mihalkova,L. and Tom Yeh} } @conference {18330, title = {Active inference for retrieval in camera networks}, booktitle = {Person-Oriented Vision (POV), 2011 IEEE Workshop on}, year = {2011}, month = {2011/01//}, pages = {13 - 20}, publisher = {IEEE}, organization = {IEEE}, abstract = {We address the problem of searching camera network videos to retrieve frames containing specified individuals. We show the benefit of utilizing a learned probabilistic model that captures dependencies among the cameras. In addition, we develop an active inference framework that can request human input at inference time, directing human attention to the portions of the videos whose correct annotation would provide the biggest performance improvements. Our primary contribution is to show that by mapping video frames in a camera network onto a graphical model, we can apply collective classification and active inference algorithms to significantly increase the performance of the retrieval system, while minimizing the number of human annotations required.}, isbn = {978-1-61284-036-9}, doi = {10.1109/POV.2011.5712363}, url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=5712363\&tag=1}, author = {Daozheng Chen and Bilgic,Mustafa and Getoor, Lise and Jacobs, David W. and Mihalkova,Lilyana and Tom Yeh} } @conference {16042, title = {Active progress bars: facilitating the switch to temporary activities}, booktitle = {Proceedings of the 2011 annual conference extended abstracts on Human factors in computing systems}, series = {CHI EA {\textquoteright}11}, year = {2011}, month = {2011///}, pages = {1963 - 1968}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {In this paper, we seek to find a better way of effective task management when a progress bar interrupts user{\textquoteright}s primary activity. We propose to augment progress bars with user controlled functionalities facilitating the switch to temporary activities. We detail a taxonomy of waiting period contexts and possible temporary tasks, then report on 5 participatory design, and a follow-up survey of 96 respondents. Finally we describe an early prototype of active progress bars, and report on initial use.}, keywords = {Frustration, participatory design, progress bars, task switching}, isbn = {978-1-4503-0268-5}, doi = {10.1145/1979742.1979883}, url = {http://doi.acm.org/10.1145/1979742.1979883}, author = {Hurter,Christophe and Girouard,Audrey and Riche,Nathalie and Plaisant, Catherine} } @conference {14496, title = {Active Surveying: A Probabilistic Approach for Identifying Key Opinion Leaders}, booktitle = {Twenty-Second International Joint Conference on Artificial Intelligence}, year = {2011}, month = {2011///}, abstract = {Opinion leaders play an important role in influenc- ing people{\textquoteright}s beliefs, actions and behaviors. Al- though a number of methods have been proposed for identifying influentials using secondary sources of information, the use of primary sources, such as surveys, is still favored in many domains. In this work we present a new surveying method which combines secondary data with partial knowl- edge from primary sources to guide the information gathering process. We apply our proposed active surveying method to the problem of identifying key opinion leaders in the medical field, and show how we are able to accurately identify the opinion lead- ers while minimizing the amount of primary data required, which results in significant cost reduction in data acquisition without sacrificing its integrity.}, author = {Sharara,H. and Getoor, Lise and Norton,M.} } @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 {16044, title = {Analyzing Incident Management Event Sequences with Interactive Visualization}, journal = {Transportation Research Board 90th Annual Meeting Compendium of Papers}, year = {2011}, month = {2011///}, abstract = {While traditional safety and incident analysis has mostly focused on incident attributesdata, such as the location and time of the incident, there are other aspects in incident response that are temporal in nature and are more difficult to analyze. We describe a visual analytics tool for temporal data exploration, called LifeFlow, used for the analysis of incident response data. LifeFlow provides user-controlled overviews of event sequences (e.g. notification, arrival, clearance etc). It allows analysts to interactively explore temporal patterns, find anomalies in sequences and compare management practices. This type of analysis can potentially lead to process improvements and save human lives. We used NCHRP traffic incident data with more than 200,000 incidents are reported by 8 different agencies in a period of about 28 months. Our experience suggest that even non expert analysts can spot many anomalies in the data using the LifeFlow overviews, and are able to rapidly ask many questions and find differences between agencies. }, author = {Guerra G{\'o}mez,J. and Wongsuphasawat,K. and Wang,T. D and Pack,M. and Plaisant, Catherine} } @article {12868, title = {Aquatic Realm and Cholera}, journal = {Epidemiological and Molecular Aspects on Cholera}, year = {2011}, month = {2011///}, pages = {311 - 339}, abstract = {Cholera is an ancient disease that can be severe and life threatening. It occurs predominantly in areas of the world where populations lack safe drinking water. Epidemics of cholera are linked with malnutrition, poor sanitation, and conditions resulting from natural disasters such as severe flooding. According to a report published by WHO in 2000 [1], cholera remains a major public health problem and is becoming increasingly important since the number of countries in which cholera is endemic continues to increase. Unfortunately, outbreaks of the disease continue into the twenty-first century with ominous portent in the wake of global climate change [1]. Yet cholera is a preventable disease if people have access to safe drinking water and are properly educated how to protect themselves from the risk of infection with vibrios. Cholera also is an easily treatable disease. Oral rehydration therapy, a solution containing glucose and appropriate salts, has proven to be effective for treatment of most cholera victims [2]. Nevertheless, each year, tens of thousands of people are victims of the disease, bringing this {\textquotedblleft}curse of humankind{\textquotedblright} to modern civilization. Present understanding of cholera is based on studies conducted over the past three decades and significant new information has been gained concerning environmental factors associated with this disease, especially how to detect the bacterium and where it lives in the natural environment, outside the human gut, and what triggers the annual outbreaks that occur with remarkable regularity. Environmental research on Vibrio cholerae and cholera has provided insights for prediction and prevention of the disease it causes, while the race for effective vaccines against cholera continues.}, doi = {10.1007/978-1-60327-265-0_18}, author = {Huq,A. and Grim,C. J. and Rita R Colwell} } @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 {12114, title = {An assessment of systems and software engineering scholars and institutions (2003{\textendash}2007 and 2004{\textendash}2008)}, journal = {Journal of Systems and Software}, volume = {84}, year = {2011}, month = {2011/01//}, pages = {162 - 168}, abstract = {An ongoing, annual survey of publications in systems and software engineering identifies the top 15 scholars and institutions in the field over a 5-year period. Each ranking is based on the weighted scores of the number of papers published in TSE, TOSEM, JSS, SPE, EMSE, IST, and Software of the corresponding period. This report summarizes the results for 2003{\textendash}2007 and 2004{\textendash}2008. The top-ranked institution is Korea Advanced Institute of Science and Technology, Korea for 2003{\textendash}2007, and Simula Research Laboratory, Norway for 2004{\textendash}2008, while Magne J{\o}rgensen is the top-ranked scholar for both periods.}, keywords = {Research publications, Systems and software engineering, Top institutions, Top scholars}, isbn = {0164-1212}, doi = {10.1016/j.jss.2010.09.036}, url = {http://www.sciencedirect.com/science/article/pii/S0164121210002682}, author = {Wong,W. Eric and Tse,T.H. and Glass,Robert L. and Basili, Victor R. and Chen,T.Y.} } @inbook {18819, title = {Automated Planning Logic Synthesis for Autonomous Unmanned Vehicles in Competitive Environments with Deceptive Adversaries}, booktitle = {New Horizons in Evolutionary Robotics}, series = {Studies in Computational Intelligence}, volume = {341}, year = {2011}, month = {2011///}, pages = {171 - 193}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {We developed a new approach for automated synthesis of a planning logic for autonomous unmanned vehicles. This new approach can be viewed as an automated iterative process during which an initial version of a logic is synthesized and then gradually improved by detecting and fixing its shortcomings. This is achieved by combining data mining for extraction of vehicle{\textquoteright}s states of failure and Genetic Programming (GP) technique for synthesis of corresponding navigation code. We verified the feasibility of the approach using unmanned surface vehicles (USVs) simulation. Our focus was specifically on the generation of a planning logic used for blocking the advancement of an intruder boat towards a valuable target. Developing autonomy logic for this behavior is challenging as the intruder{\textquoteright}s attacking logic is human-competitive with deceptive behavior so the USV is required to learn specific maneuvers for specific situations to do successful blocking. We compared the performance of the generated blocking logic to the performance of logic that was manually implemented. Our results show that the new approach was able to synthesize a blocking logic with performance closely approaching the performance of the logic coded by hand.}, keywords = {engineering}, isbn = {978-3-642-18271-6}, url = {http://www.springerlink.com/content/f454477212518671/abstract/}, author = {Svec,Petr and Gupta, Satyandra K.}, editor = {Doncieux,St{\'e}phane and Bred{\`e}che,Nicolas and Mouret,Jean-Baptiste} } @conference {18551, title = {Boosting the scalability of botnet detection using adaptive traffic sampling}, booktitle = {Proceedings of the 6th ACM Symposium on Information, Computer and Communications Security}, series = {ASIACCS {\textquoteright}11}, year = {2011}, month = {2011///}, pages = {124 - 134}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Botnets pose a serious threat to the health of the Internet. Most current network-based botnet detection systems require deep packet inspection (DPI) to detect bots. Because DPI is a computational costly process, such detection systems cannot handle large volumes of traffic typical of large enterprise and ISP networks. In this paper we propose a system that aims to efficiently and effectively identify a small number of suspicious hosts that are likely bots. Their traffic can then be forwarded to DPI-based botnet detection systems for fine-grained inspection and accurate botnet detection. By using a novel adaptive packet sampling algorithm and a scalable spatial-temporal flow correlation approach, our system is able to substantially reduce the volume of network traffic that goes through DPI, thereby boosting the scalability of existing botnet detection systems. We implemented a proof-of-concept version of our system, and evaluated it using real-world legitimate and botnet-related network traces. Our experimental results are very promising and suggest that our approach can enable the deployment of botnet-detection systems in large, high-speed networks.}, keywords = {adaptive sampling, botnet, intrusion detection, NETWORK SECURITY}, isbn = {978-1-4503-0564-8}, doi = {10.1145/1966913.1966930}, url = {http://doi.acm.org/10.1145/1966913.1966930}, author = {Zhang,Junjie and Luo,Xiapu and Perdisci,Roberto and Gu,Guofei and Lee,Wenke and Feamster, Nick} } @inbook {19628, title = {A Canonical Form for Testing Boolean Function Properties}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques}, series = {Lecture Notes in Computer Science}, year = {2011}, month = {2011/01/01/}, pages = {460 - 471}, publisher = {Springer Berlin Heidelberg}, organization = {Springer Berlin Heidelberg}, abstract = {In a well-known result Goldreich and Trevisan (2003) showed that every testable graph property has a {\textquotedblleft}canonical{\textquotedblright} tester in which a set of vertices is selected at random and the edges queried are the complete graph over the selected vertices. We define a similar-in-spirit canonical form for Boolean function testing algorithms, and show that under some mild conditions property testers for Boolean functions can be transformed into this canonical form. Our first main result shows, roughly speaking, that every {\textquotedblleft}nice{\textquotedblright} family of Boolean functions that has low noise sensitivity and is testable by an {\textquotedblleft}independent tester,{\textquotedblright} has a canonical testing algorithm. Our second main result is similar but holds instead for families of Boolean functions that are closed under ID-negative minors. Taken together, these two results cover almost all of the constant-query Boolean function testing algorithms that we know of in the literature, and show that all of these testing algorithms can be automatically converted into a canonical form.}, keywords = {Algorithm Analysis and Problem Complexity, Boolean functions, Computation by Abstract Devices, Computer Communication Networks, Computer Graphics, Data structures, Discrete Mathematics in Computer Science, property testing}, isbn = {978-3-642-22934-3, 978-3-642-22935-0}, url = {http://link.springer.com/chapter/10.1007/978-3-642-22935-0_39}, author = {Dana Dachman-Soled and Servedio, Rocco A.}, editor = {Goldberg, Leslie Ann and Jansen, Klaus and Ravi, R. and Rolim, Jos{\'e} D. P.} } @article {18795, title = {A Case Study in Optimization of Gait and Physical Parameters for a Snake-Inspired Robot Based on a Rectilinear Gait}, journal = {Journal of mechanisms and robotics}, volume = {3}, year = {2011}, month = {2011///}, abstract = {Physical parameters of the constituent modules and gait parameters affect the overall performance of snake-inspired robots. Hence, a system-level optimization model needs to concurrently optimize the module parameters and the gait. Incorporating a physics-based model of rectilinear gaits in the system-level optimization model is a computationally challenging problem. This paper presents a case study to illustrate how metamodels of the precomputed optimal rectilinear gaits can be utilized to reduce the complexity of the system-level optimization model. An example is presented to illustrate the importance of concurrently optimizing the module parameters and the gait to obtain the optimal performance for a given mission.}, isbn = {1942-4302}, url = {http://cat.inist.fr/?aModele=afficheN\&cpsidt=23978760}, author = {Hopkins,James K. and Spranklin,Brent W. and Gupta, Satyandra K.} } @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 {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 {18796, title = {A computational framework for authoring and searching product design specifications}, journal = {Advanced Engineering Informatics}, volume = {25}, year = {2011}, month = {2011/08//}, pages = {516 - 534}, abstract = {The development of product design specifications (PDS) is an important part of the product development process. Incompleteness, ambiguity, or inconsistency in the PDS can lead to problems during the design process and may require unnecessary design iterations. This generally results in increased design time and cost. Currently, in many organizations, PDS are written using word processors. Since documents written by different authors can be inconsistent in style and word choice, it is difficult to automatically search for specific requirements. Moreover, this approach does not allow the possibility of automated design verification and validation against the design requirements and specifications.In this paper, we present a computational framework and a software tool based on this framework for writing, annotating, and searching computer-interpretable PDS. Our approach allows authors to write requirement statements in natural language to be consistent with the existing authoring practice. However, using mathematical expressions, keywords from predefined taxonomies, and other metadata the author of PDS can then annotate different parts of the requirement statements. This approach provides unambiguous meaning to the information contained in PDS, and helps to eliminate mistakes later in the process when designers must interpret requirements. Our approach also enables users to construct a new PDS document from the results of the search for requirements of similar devices and in similar contexts. This capability speeds up the process of creating PDS and helps authors write more detailed documents by utilizing previous, well written PDS documents. Our approach also enables checking for internal inconsistencies in the requirement statements. }, keywords = {Engineering design, Product design specifications, Requirements engineering}, isbn = {1474-0346}, doi = {10.1016/j.aei.2011.02.001}, url = {http://www.sciencedirect.com/science/article/pii/S1474034611000061}, author = {Weissman,Alexander and Petrov,Martin and Gupta, Satyandra K.} } @article {18558, title = {Countering Botnets: Anomaly-Based Detection, Comprehensive Analysis, and Efficient Mitigation}, year = {2011}, month = {2011/05//}, institution = {GEORGIA TECH RESEARCH CORP ATLANTA}, abstract = {We cover five general areas: (1) botnet detection, (2) botnet analysis, (3) botnet mitigation, (4) add-on tasks to the original contract, including the Conficker Working Group Lessons Learned, Layer-8 Exploration of Botnet Organization, and DREN research, and (5) commercialization in this paper. We have successfully developed new botnet detection and analysis capabilities in this project. These algorithms have been evaluated using real-world data, and have been put into actual, deployed systems. The most significant technical developments include a new dynamic reputation systems for DNS domains, a scalable anomaly detection system for botnet detection in very large network, and a transparent malware analysis system. In addition, on several occasions we have used our botnet data and analysis to help law enforcement agencies arrest botmasters. We also have had great success transitioning technologies to commercial products that are now used by government agencies, ISPs, and major corporations.}, keywords = {*ELECTRONIC SECURITY, *INFORMATION SECURITY, *INTERNET, *INTRUSION DETECTION(COMPUTERS), algorithms, BGP ROUTE INJECTION, BGP(BORDER GATEWAY PROTOCOLS), BOTNET DETECTION, BOTNET TRACEBACK AND ATTRIBUTION, BOTNETS(MALWARE), CLIENT SERVER SYSTEMS, COMMUNICATIONS PROTOCOLS, COMPUTER PROGRAMMING AND SOFTWARE, COMPUTER SYSTEMS MANAGEMENT AND STANDARDS, CYBER ATTACKS, CYBER SECURITY, CYBERNETICS, CYBERTERRORISM, CYBERWARFARE, DATA PROCESSING SECURITY, DNS BASED MONITORING, DNS BASED REDIRECTION, DNS(DOMAIN NAME SYSTEMS), INFORMATION SCIENCE, INTERNET BROWSERS, ISP(INTERNET SERVICE PROVIDERS), MALWARE, MALWARE ANALYSIS, Online Systems, WUAFRLDHS1BOTN}, url = {http://stinet.dtic.mil/oai/oai?\&verb=getRecord\&metadataPrefix=html\&identifier=ADA543919}, author = {Lee,Wenke and Dagon,David and Giffin,Jon and Feamster, Nick and Ollman,Gunter and Westby,Jody and Wesson,Rick and Vixie,Paul} } @article {19273, title = {Dataflow-Based Implementation of Layered Sensing Applications}, year = {2011}, month = {2011}, abstract = {This report describes a new dataflow-based technology and associated design tools for high-productivity design, analysis, and optimization of layered sensing software for signal processing systems. Our approach provides novel capabilities, based on the principles of task-level dataflow analysis, for exploring and optimizing interactions across application behavior; operational context; high performance embedded processing platforms, and implementation constraints. Particularly, we introduce and deliver novel software tools, called the targeted dataflow interchange format (TDIF) and Dataflow Interchange Format Markup Language (DIFML), for design and implementation of layered sensing and signal processing systems. The TDIF-CUDA (Compute Unified Device Architecture) environment is a graphics processing unit targeted software synthesis tool that provides a unique integration of dynamic dataflow modeling; retargetable actor construction; software synthesis; and instrumentation-based schedule evaluation and tuning. The DIFML package is a software package for the DIFML format, which is an Extensible Markup Language (XML)-based format for exchanging information between DIF and other tools.}, keywords = {*COMPUTER AIDED DESIGN, *DATA FUSION, *DATAFLOW, *LAYERS, *SOFTWARE TOOLS, COMPUTER PROGRAMMING AND SOFTWARE, DETECTION, High performance computing, LAYERED SENSING, OPTIMIZATION, Signal processing, synthesis, T2KA}, author = {Bhattacharyya, Shuvra S. and Chung-Ching Shen and Plishker,William and Sane, Nimish and Wu, Hsiang-Huang and Gu, Ruirui} } @conference {13362, title = {Declarative analysis of noisy information networks}, booktitle = {2011 IEEE 27th International Conference on Data Engineering Workshops (ICDEW)}, year = {2011}, month = {2011/04/11/16}, pages = {106 - 111}, publisher = {IEEE}, organization = {IEEE}, abstract = {There is a growing interest in methods for analyzing data describing networks of all types, including information, biological, physical, and social networks. Typically the data describing these networks is observational, and thus noisy and incomplete; it is often at the wrong level of fidelity and abstraction for meaningful data analysis. This has resulted in a growing body of work on extracting, cleaning, and annotating network data. Unfortunately, much of this work is ad hoc and domain-specific. In this paper, we present the architecture of a data management system that enables efficient, declarative analysis of large-scale information networks. We identify a set of primitives to support the extraction and inference of a network from observational data, and describe a framework that enables a network analyst to easily implement and combine new extraction and analysis techniques, and efficiently apply them to large observation networks. The key insight behind our approach is to decouple, to the extent possible, (a) the operations that require traversing the graph structure (typically the computationally expensive step), from (b) the operations that do the modification and update of the extracted network. We present an analysis language based on Datalog, and show how to use it to cleanly achieve such decoupling. We briefly describe our prototype system that supports these abstractions. We include a preliminary performance evaluation of the system and show that our approach scales well and can efficiently handle a wide spectrum of data cleaning operations on network data.}, keywords = {Cleaning, Data analysis, data cleaning operations, data management system, data mining, Databases, Datalog, declarative analysis, graph structure, information networks, Noise measurement, noisy information networks, Prediction algorithms, semantics, Syntactics}, isbn = {978-1-4244-9195-7}, doi = {10.1109/ICDEW.2011.5767619}, author = {Moustafa,W. E and Namata,G. and Deshpande, Amol and Getoor, Lise} } @article {18827, title = {Design and fabrication of miniature compliant hinges for multi-material compliant mechanisms}, journal = {The International Journal of Advanced Manufacturing Technology}, volume = {57}, year = {2011}, month = {2011///}, pages = {437 - 452}, abstract = {Multi-material molding (MMM) enables the creation of multi-material mechanisms that combine compliant hinges, serving as revolute joints, and rigid links in a single part. There are three important challenges in creating these structures: (1) bonding between the materials used, (2) the ability of the hinge to transfer the required loads in the mechanism while allowing for the prescribed degree(s) of freedom, and (3) incorporating the process-specific requirements in the design stage. This paper presents the approach for design and fabrication of miniature compliant hinges in multi-material compliant mechanisms. The methodology described in this paper allows for the concurrent design of the part and the manufacturing process. For the first challenge, mechanical interlocking strategies are presented. For the second challenge, the development of a simulation-based optimization model of the hinge is presented, involving functional and manufacturing constrains. For the third challenge, the development of hinge positioning features and gate positioning constraints is presented. The developed MMM process is described, along with the main constraints and performance measures. This includes the process sequence, the mold cavity design, gate selection, and runner system development. A case study is presented to demonstrate the feasibility of creating multi-material mechanisms with miniature hinges serving as joints through MMM process. The approach described in this paper was utilized to design a drive mechanism for a flapping wing micro air vehicle. The methods described in this paper are applicable to any lightweight, load-bearing compliant mechanism manufactured using multi-material injection molding.}, keywords = {engineering}, isbn = {0268-3768}, doi = {10.1007/s00170-011-3301-y}, url = {http://www.springerlink.com/content/ul641k1v50360607/abstract/}, author = {Bejgerowski,Wojciech and Gerdes,John and Gupta, Satyandra K. and Bruck,Hugh} } @conference {19260, title = {Design methods for Wireless Sensor Network Building Energy Monitoring Systems}, booktitle = {2011 IEEE 36th Conference on Local Computer Networks (LCN)}, year = {2011}, month = {2011}, pages = {974 - 981}, abstract = {In this paper, we present a new energy analysis method for evaluating energy consumption of embedded sensor nodes at the application level and the network level. Then we apply the proposed energy analysis method to develop new energy management schemes in order to maximize lifetime for Wireless Sensor Network Building Energy Monitoring Systems (WSNBEMS). At the application level, we develop a new design approach that uses dataflow techniques to model the application-level interfacing behavior between the processor and sensors on an embedded sensor node. At the network level, we analyze the energy consumption of the IEEE 802.15.4 MAC functionality. Based on our techniques for modeling and energy analysis, we have implemented an optimized WSNBEMS for a real building, and validated our energy analysis techniques through measurements on this implementation. The performance of our implementation is also evaluated in terms of monitoring accuracy and energy consumption savings. We have demonstrated that by applying the proposed scheme, system lifetime can be improved significantly without affecting monitoring accuracy.}, keywords = {Analytical models, application-level interfacing behavior, building energy monitoring system, Buildings, dataflow technique, embedded sensor node, energy analysis method, Energy consumption, energy management systems, Energy resolution, IEEE 802.15.4 MAC functionality, Monitoring, OPTIMIZATION, wireless sensor network, Wireless sensor networks, WSNBEMS, Zigbee}, author = {Cho, Inkeun and Chung-Ching Shen and Potbhare, S. and Bhattacharyya, Shuvra S. and Goldsman,N.} } @article {18786, title = {Design of Revolute Joints for In-Mold Assembly Using Insert Molding}, journal = {Journal of Mechanical Design}, volume = {133}, year = {2011}, month = {2011///}, pages = {121010 - 121010}, author = {Ananthanarayanan,A. and Ehrlich,L. and Desai,J. P. and Gupta,S.K.} } @conference {14393, title = {Differential adaptive diffusion: Understanding diversity and learning whom to trust in viral marketing}, booktitle = {Fifth International AAAI Conference on Weblogs and Social Media}, year = {2011}, month = {2011///}, abstract = {Viral marketing mechanisms use the existing social network between customers to spread information about products and encourage product adoption. Existing viral marketing models focus on the dynamics of the diffusion process, however they typically: (a) only consider a single product campaign and (b) fail to model the evolution of the social network, as the trust between individuals changes over time, during the course of multiple campaigns. In this work, we propose an adaptive vi- ral marketing model which captures: (1) multiple different product campaigns, (2) the diversity in customer preferences among different product categories, and (3) changing con- fidence in peers{\textquoteright} recommendations over time. By applying our model to a real-world network extracted from the Digg social news website, we provide insights into the effects of network dynamics on the different products{\textquoteright} adoption. Our experiments show that our proposed model outperforms ear- lier non-adaptive diffusion models in predicting future prod- uct adoptions. We also show how this model can be used to explore new viral marketing strategies that are more success- ful than classic strategies which ignore the dynamic nature of social networks.}, author = {Sharara,H. and Rand, William and Getoor, Lise} } @article {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} } @article {14317, title = {Disaggregated End-Use Energy Sensing for the Smart Grid}, journal = {IEEE Pervasive Computing}, volume = {10}, year = {2011}, month = {2011/03//Jan}, pages = {28 - 39}, abstract = {This article surveys existing and emerging disaggregation techniques for energy-consumption data and highlights signal features that might be used to sense disaggregated data in an easily installed and cost-effective manner.}, keywords = {Calibration, disaggregated end-use energy sensing, Disaggregated energy sensing, disaggregation data techniques, Electricity, Energy consumption, Energy efficiency, energy-consumption data, Gas, Home appliances, Sensors, Smart grid, Smart grids, smart power grids, Sustainability, Water}, isbn = {1536-1268}, doi = {10.1109/MPRV.2010.74}, author = {Jon Froehlich and Larson,E. and Gupta,S. and Cohn,G. and Reynolds,M. and Patel,S.} } @article {16256, title = {DNACLUST: accurate and efficient clustering of phylogenetic marker genes}, journal = {BMC Bioinformatics}, volume = {12}, year = {2011}, month = {2011/06/30/}, pages = {271 - 271}, abstract = {Clustering is a fundamental operation in the analysis of biological sequence data. New DNA sequencing technologies have dramatically increased the rate at which we can generate data, resulting in datasets that cannot be efficiently analyzed by traditional clustering methods.}, isbn = {1471-2105}, doi = {10.1186/1471-2105-12-271}, url = {http://www.biomedcentral.com/1471-2105/12/271}, author = {Ghodsi,Mohammadreza and Liu,Bo and Pop, Mihai} } @conference {12437, title = {Domain adaptation for object recognition: An unsupervised approach}, booktitle = {2011 IEEE International Conference on Computer Vision (ICCV)}, year = {2011}, month = {2011/11/06/13}, pages = {999 - 1006}, publisher = {IEEE}, organization = {IEEE}, abstract = {Adapting the classifier trained on a source domain to recognize instances from a new target domain is an important problem that is receiving recent attention. In this paper, we present one of the first studies on unsupervised domain adaptation in the context of object recognition, where we have labeled data only from the source domain (and therefore do not have correspondences between object categories across domains). Motivated by incremental learning, we create intermediate representations of data between the two domains by viewing the generative subspaces (of same dimension) created from these domains as points on the Grassmann manifold, and sampling points along the geodesic between them to obtain subspaces that provide a meaningful description of the underlying domain shift. We then obtain the projections of labeled source domain data onto these subspaces, from which a discriminative classifier is learnt to classify projected data from the target domain. We discuss extensions of our approach for semi-supervised adaptation, and for cases with multiple source and target domains, and report competitive results on standard datasets.}, keywords = {Data models, data representations, discriminative classifier, Feature extraction, Grassmann manifold, image sampling, incremental learning, labeled source domain, Manifolds, measurement, object category, Object recognition, Principal component analysis, sampling points, semisupervised adaptation, target domain, underlying domain shift, unsupervised approach, unsupervised domain adaptation, Unsupervised learning, vectors}, isbn = {978-1-4577-1101-5}, doi = {10.1109/ICCV.2011.6126344}, author = {Gopalan,R. and Ruonan Li and Chellapa, Rama} } @article {16495, title = {A Dual Framework and Algorithms for Targeted Online Data Delivery}, journal = {IEEE Transactions on Knowledge and Data Engineering}, volume = {23}, year = {2011}, month = {2011///}, pages = {5 - 21}, abstract = {A variety of emerging online data delivery applications challenge existing techniques for data delivery to human users, applications, or middleware that are accessing data from multiple autonomous servers. In this paper, we develop a framework for formalizing and comparing pull-based solutions and present dual optimization approaches. The first approach, most commonly used nowadays, maximizes user utility under the strict setting of meeting a priori constraints on the usage of system resources. We present an alternative and more flexible approach that maximizes user utility by satisfying all users. It does this while minimizing the usage of system resources. We discuss the benefits of this latter approach and develop an adaptive monitoring solution Satisfy User Profiles (SUPs). Through formal analysis, we identify sufficient optimality conditions for SUP. Using real (RSS feeds) and synthetic traces, we empirically analyze the behavior of SUP under varying conditions. Our experiments show that we can achieve a high degree of satisfaction of user utility when the estimations of SUP closely estimate the real event stream, and has the potential to save a significant amount of system resources. We further show that SUP can exploit feedback to improve user utility with only a moderate increase in resource utilization.}, keywords = {client/server multitier systems, distributed databases, online data delivery., online information services}, isbn = {1041-4347}, doi = {http://doi.ieeecomputersociety.org/10.1109/TKDE.2010.15}, author = {Roitman,Haggai and Gal,Avigdor and Raschid, Louiqa} } @article {14430, title = {Dynamic Processing Allocation in Video}, journal = {Pattern Analysis and Machine Intelligence, IEEE Transactions on}, volume = {33}, year = {2011}, month = {2011/11//}, pages = {2174 - 2187}, abstract = {Large stores of digital video pose severe computational challenges to existing video analysis algorithms. In applying these algorithms, users must often trade off processing speed for accuracy, as many sophisticated and effective algorithms require large computational resources that make it impractical to apply them throughout long videos. One can save considerable effort by applying these expensive algorithms sparingly, directing their application using the results of more limited processing. We show how to do this for retrospective video analysis by modeling a video using a chain graphical model and performing inference both to analyze the video and to direct processing. We apply our method to problems in background subtraction and face detection, and show in experiments that this leads to significant improvements over baseline algorithms.}, keywords = {algorithms;digital, allocation;video, analysis;computer, background, detection;graphical, detection;resource, graphics;face, model;resource, processing;, processing;face, recognition;object, signal, subtraction;baseline, video}, isbn = {0162-8828}, doi = {10.1109/TPAMI.2011.55}, author = {Daozheng Chen and Bilgic,M. and Getoor, Lise and Jacobs, David W.} } @article {14485, title = {Eighth workshop on mining and learning with graphs}, journal = {SIGKDD Explor. Newsl.}, volume = {12}, year = {2011}, month = {2011/03//}, pages = {63 - 65}, abstract = {The Eighth Workshop on Mining and Learning with Graphs (MLG)1was held at KDD 2010 in Washington DC. It brought together a variete of researchers interested in analyzing data that is best represented as a graph. Examples include the WWW, social networks, biological networks, communication networks, and many others. The importance of being able to effectively mine and learn from such data is growing, as more and more structured and semi-structured data is becoming available. This is a problem across widely different fields such as economics, statistics, social science, physics and computer science, and is studied within a variety of sub-disciplines of machine learning and data mining including graph mining, graphical models, kernel theory, statistical relational learning, etc. The objective of this workshop was to bring together practitioners from these various fields and areas to foster a rich discussion of which problems we work on, how we frame them in the context of graphs, which tools and algorithms we apply and our general findings and lessons learned. This year{\textquoteright}s workshop was very successful with well over 100 attendees, excellent keynote speakers and papers. This is a rapidly growing area and we believe that this community is only in its infancy. We hope that the readers will join us next year for MLG 2011.}, keywords = {data mining, dynamic network analysis, graph mining, kernel methods, link mining, machine learning, network analysis, pattern recognition, relational learning, scalable graph mining, statistical relational learning}, isbn = {1931-0145}, doi = {10.1145/1964897.1964915}, url = {http://doi.acm.org/10.1145/1964897.1964915}, author = {Brefeld,Ulf and Getoor, Lise and Macskassy,Sofus A.} } @article {16431, title = {Estimating Functional Agent-Based Models: An Application to Bid Shading in Online Markets Format}, journal = {Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2011)}, year = {2011}, month = {2011///}, abstract = {Bid shading is a common strategy in online auctions to avoid the "winner{\textquoteright}s curse". While almost all bidders shade their bids, at least to some degree, it is impossible to infer the degree and volume of shaded bids directly from observed bidding data. In fact, most bidding data only allows us to observe the resulting price process, i.e. whether prices increase fast (due to little shading) or whether they slow down (when all bidders shade their bids). In this work, we propose an agent-based model that simulates bidders with different bidding strategies and their interaction with one another. We calibrate that model (and hence estimate properties about the propensity and degree of shaded bids) by matching the emerging simulated price process with that of the observed auction data using genetic algorithms. From a statistical point of view, this is challenging because we match functional draws from simulated and real price processes. We propose several competing fitness functions and explore how the choice alters the resulting ABM calibration. We apply our model to the context of eBay auctions for digital cameras and show that a balanced fitness function yields the best results.}, keywords = {Agent-based modeling, business, Calibration, Genetic algorithms, internet auctions, simulation}, url = {http://papers.ssrn.com/sol3/papers.cfm?abstract_id=1846639}, author = {Guo,Wei and Jank,Wolfgang and Rand, William} } @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 {19272, title = {Exploiting Statically Schedulable Regions in Dataflow Programs}, journal = {Journal of Signal Processing Systems}, volume = {63}, year = {2011}, month = {2011}, pages = {129 - 142}, abstract = {Dataflow descriptions have been used in a wide range of Digital Signal Processing (DSP) applications, such as multi-media processing, and wireless communications. Among various forms of dataflow modeling, Synchronous Dataflow (SDF) is geared towards static scheduling of computational modules, which improves system performance and predictability. However, many DSP applications do not fully conform to the restrictions of SDF modeling. More general dataflow models, such as CAL (Eker and Janneck 2003), have been developed to describe dynamically-structured DSP applications. Such generalized models can express dynamically changing functionality, but lose the powerful static scheduling capabilities provided by SDF. This paper focuses on the detection of SDF-like regions in dynamic dataflow descriptions{\textemdash}in particular, in the generalized specification framework of CAL. This is an important step for applying static scheduling techniques within a dynamic dataflow framework. Our techniques combine the advantages of different dataflow languages and tools, including CAL (Eker and Janneck 2003), DIF (Hsu et al. 2005) and CAL2C (Roquier et al. 2008). In addition to detecting SDF-like regions, we apply existing SDF scheduling techniques to exploit the static properties of these regions within enclosing dynamic dataflow models. Furthermore, we propose an optimized approach for mapping SDF-like regions onto parallel processing platforms such as multi-core processors.}, keywords = {Cal, Circuits and Systems, Computer Imaging, Vision, Pattern Recognition and Graphics, Dataflow, DIF, Electrical Engineering, Image Processing and Computer Vision, multicore processors, pattern recognition, Quasi-static scheduling, Signal, Image and Speech Processing}, isbn = {1939-8018, 1939-8115}, url = {http://link.springer.com/article/10.1007/s11265-009-0445-1}, author = {Gu, Ruirui and Janneck, J{\"o}rn W. and Raulet, Micka{\"e}l and Bhattacharyya, Shuvra S.} } @conference {14469, title = {Exploiting statistical and relational information on the web and in social media}, booktitle = {Proceedings of the fourth ACM international conference on Web search and data mining}, series = {WSDM {\textquoteright}11}, year = {2011}, month = {2011///}, pages = {9 - 10}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {The popularity of Web 2.0, characterized by a proliferation of social media sites, and Web 3.0, with more richly semantically annotated objects and relationships, brings to light a variety of important prediction, ranking, and extraction tasks. The input to these tasks is often best seen as a (noisy) multi-relational graph, such as the click graph, defined by user interactions with Web sites; and the social graph, defined by friendships and affiliations on social media sites. This tutorial will provide an overview of statistical relational learning and inference techniques, motivating and illustrating them using web and social media applications. We will start by briefly surveying some of the sources of statistical and relational information on the web and in social media and will then dedicate most of the tutorial time to an introduction to representations and techniques for learning and reasoning with multi-relational information, viewing them through the lens of web and social media domains. We will end with a discussion of current trends and related fields, such as privacy in social networks.}, keywords = {graph analysis, probabilistic inference, query log data, social media, statistical relational learning}, isbn = {978-1-4503-0493-1}, doi = {10.1145/1935826.1935834}, url = {http://doi.acm.org/10.1145/1935826.1935834}, author = {Getoor, Lise and Mihalkova,Lilyana} } @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} } @inbook {12462, title = {Face Tracking and Recognition in a Camera Network}, booktitle = {Multibiometrics for Human IdentificationMultibiometrics for Human Identification}, year = {2011}, month = {2011///}, publisher = {Cambridge University Press}, organization = {Cambridge University Press}, isbn = {9780511921056}, url = {http://dx.doi.org/10.1017/CBO9780511921056}, author = {Bhanu,Bir and Govindaraju,Venu} } @conference {13068, title = {Face verification using large feature sets and one shot similarity}, booktitle = {Biometrics (IJCB), 2011 International Joint Conference on}, year = {2011}, month = {2011/10//}, pages = {1 - 8}, abstract = {We present a method for face verification that combines Partial Least Squares (PLS) and the One-Shot similarity model[28]. First, a large feature set combining shape, texture and color information is used to describe a face. Then PLS is applied to reduce the dimensionality of the feature set with multi-channel feature weighting. This provides a discriminative facial descriptor. PLS regression is used to compute the similarity score of an image pair by One-Shot learning. Given two feature vector representing face images, the One-Shot algorithm learns discriminative models exclusively for the vectors being compared. A small set of unlabeled images, not containing images belonging to the people being compared, is used as a reference (negative) set. The approach is evaluated on the Labeled Face in the Wild (LFW) benchmark and shows very comparable results to the state-of-the-art methods (achieving 86.12\% classification accuracy) while maintaining simplicity and good generalization ability.}, keywords = {analysis;set, approximations;regression, descriptor;labeled, Face, feature, in, information;face, information;texture, least, LFW;PLS;PLS, recognition;least, regression;color, sets;one, shot, similarity;partial, squares, squares;shape, the, theory;, verification;facial, wild;large}, doi = {10.1109/IJCB.2011.6117498}, author = {Guo,Huimin and Robson Schwartz,W. and Davis, Larry S.} } @conference {17175, title = {From slacktivism to activism: participatory culture in the age of social media}, booktitle = {Proceedings of the 2011 annual conference extended abstracts on Human factors in computing systems}, series = {CHI EA {\textquoteright}11}, year = {2011}, month = {2011///}, pages = {819 - 822}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Social networking sites (e.g. Facebook), microblogging services (e.g. Twitter), and content-sharing sites (e.g. YouTube and Flickr) have introduced the opportunity for wide-scale, online social participation. Visibility of national and international priorities such as public health, political unrest, disaster relief, and climate change has increased, yet we know little about the benefits - and possible costs - of engaging in social activism via social media. These powerful social issues introduce a need for scientific research into technology mediated social participation. What are the actual, tangible benefits of "greening" Twitter profile pictures in support of the Iranian elections? Does cartooning a Facebook profile picture really raise awareness of child abuse? Are there unintended negative effects through low-risk, low-cost technology-mediated participation? And, is there a difference - in both outcome and engagement level - between different types of online social activism? This SIG will investigate technology mediated social participation through a critical lens, discussing both the potential positive and negative outcomes of such participation. Approaches to designing for increased participation, evaluating effects of participation, and next steps in scientific research directions will be discussed.}, keywords = {activism, change, design, participation, slacktivism, social media}, isbn = {978-1-4503-0268-5}, doi = {10.1145/1979742.1979543}, url = {http://doi.acm.org/10.1145/1979742.1979543}, author = {Rotman,Dana and Vieweg,Sarah and Yardi,Sarita and Chi,Ed and Preece,Jenny and Shneiderman, Ben and Pirolli,Peter and Glaisyer,Tom} } @conference {14497, title = {G-PARE: A visual analytic tool for comparative analysis of uncertain graphs}, booktitle = {Visual Analytics Science and Technology (VAST), 2011 IEEE Conference on}, year = {2011}, month = {2011///}, pages = {61 - 70}, author = {Sharara,H. and Sopan,A. and Namata,G. and Getoor, Lise and Singh,L.} } @article {17180, title = {Graph Analytics-Lessons Learned and Challenges Ahead}, volume = {31}, year = {2011}, month = {2011///}, pages = {18 - 29}, abstract = {Graph analytics is one of the most influential and important R\&D topics in the visual analytics community. Researchers with diverse backgrounds from information visualization, human-computer interaction, computer graphics, graph drawing, and data mining have pursued graph analytics from scientific, technical, and social approaches. These studies have addressed both distinct and common challenges. Past successes and mistakes can provide valuable lessons for revising the research agenda. In this article, six researchers from four academic and research institutes identify graph analytics{\textquoteright} fundamental challenges and present both insightful lessons learned from their experience and good practices in graph analytics research. The goal is to critically assess those lessons and shed light on how they can stimulate research and draw attention to grand challenges for graph analytics. The article also establishes principles that could lead to measurable standards and criteria for research.}, keywords = {citation analysis, citespace, Computer Graphics, document analysis, graphics and multimedia, greengrid, jigsaw system, modeling, power grid analysis, semantic substrates, simulation, social networks, text analysis, Visualization}, isbn = {0272-1716}, author = {Wong,Pak Chung and Chen,Chaomei and Gorg,Carsten and Shneiderman, Ben and Stasko,John and Thomas,Jim} } @conference {19452, title = {Helping Users Shop for ISPs with Internet Nutrition Labels}, booktitle = {ACM SIGCOMM Workshop on Home Networks {\textquoteright}11}, series = {HomeNets {\textquoteright}11}, year = {2011}, month = {2011///}, pages = {13 - 18}, publisher = {ACM}, organization = {ACM}, abstract = {When purchasing home broadband access from Internet service providers (ISPs), users must decide which service plans are most appropriate for their needs. Today, ISPs advertise their available service plans using only generic upload and download speeds. Unfortunately, these metrics do not always accurately reflect the varying performance that home users will experience for a wide range of applications. In this paper, we propose that each ISP service plan carry a "nutrition label" that conveys more comprehensive information about network metrics along many dimensions, including various aspects of throughput, latency, loss rate, and jitter. We first justify why these metrics should form the basis of a network nutrition label. Then, we demonstrate that current plans that are superficially similar with respect to advertised download rates may have different performance according to the label metrics. We close with a discussion of the challenges involved in presenting a nutrition label to users in a way that is both accurate and easy to understand.}, keywords = {access networks, benchmarking, bismark, broadband networks, gateway measurements}, isbn = {978-1-4503-0798-7}, url = {http://doi.acm.org/10.1145/2018567.2018571}, author = {Sundaresan, Srikanth and Feamster, Nick and Teixeira, Renata and Tang, Anthony and Edwards, W. Keith and Grinter, Rebecca E. and Marshini Chetty and de Donato, Walter} } @article {13942, title = {A Hierarchical Algorithm for Fast Debye Summation with Applications to Small Angle Scattering}, journal = {Technical Reports from UMIACS}, year = {2011}, month = {2011/09/01/}, abstract = {Debye summation, which involves the summation of sinc functions of distances between all pair of atoms in three dimensional space, arises in computations performed in crystallography, small/wide angle X-ray scattering (SAXS/WAXS) and small angle neutron scattering (SANS). Direct evaluation of Debye summation has quadratic complexity, which results in computational bottleneck when determining crystal properties, or running structure refinement protocols that involve SAXS or SANS, even for moderately sized molecules. We present a fast approximation algorithm that efficiently computes the summation to any prescribed accuracy epsilon in linear time. The algorithm is similar to the fast multipole method (FMM), and is based on a hierarchical spatial decomposition of the molecule coupled with local harmonic expansions and translation of these expansions. An even more efficient implementation is possible when the scattering profile is all that is required, as in small angle scattering reconstruction (SAS) of macromolecules. We examine the relationship of the proposed algorithm to existing approximate methods for profile computations, and provide detailed description of the algorithm, including error bounds and algorithms for stable computation of the translation operators. Our theoretical and computational results show orders of magnitude improvement in computation complexity over existing methods, while maintaining prescribed accuracy.}, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/11857}, author = {Gumerov, Nail A. and Berlin,Konstantin and Fushman, David and Duraiswami, Ramani} } @article {14353, title = {Improving Classifier Performance by Autonomously Collecting Background Knowledge from the Web}, journal = {2011 10th International Conference on Machine Learning and Applications Workshops}, year = {2011}, month = {2011///}, pages = {1 - 6}, abstract = {Many websites allow users to tag data items to makethem easier to find. In this paper we consider the problem of classifying tagged data according to user-specified interests. We present an approach for aggregating background knowledge from the Web to improve the performance of a classier. In previous work, researchers have developed technology for extracting knowledge, in the form of relational tables, from semi- structured websites. In this paper we integrate this extraction technology with generic machine learning algorithms, showing that knowledge extracted from the Web can significantly benefit the learning process. Specifically, the knowledge can lead to better generalizations, reduce the number of samples required for supervised learning, and eliminate the need to retrain the system when the environment changes. We validate the approach with an application that classifies tagged Fickr data. }, author = {Minton,S.N. and Michelson,M. and See,K. and Macskassy,S. and Gazen,B.C. and Getoor, Lise} } @article {18579, title = {Instrumenting home networks}, journal = {SIGCOMM Comput. Commun. Rev.}, volume = {41}, year = {2011}, month = {2011///}, pages = {84 - 89}, abstract = {In managing and troubleshooting home networks, one of the challenges is in knowing what is actually happening. Availability of a record of events that occurred on the home network before trouble appeared would go a long way toward addressing that challenge. In this position/work-in-progress paper, we consider requirements for a general-purpose logging facility for home networks. Such a facility, if properly designed, would potentially have other uses. We describe several such uses and discuss requirements to be considered in the design of a logging platform that would be widely supported and accepted. We also report on our initial deployment of such a facility.}, keywords = {home network management, home network troubleshooting}, isbn = {0146-4833}, doi = {10.1145/1925861.1925875}, url = {http://doi.acm.org/10.1145/1925861.1925875}, author = {Calvert,Kenneth L. and Edwards,W. Keith and Feamster, Nick and Grinter,Rebecca E. and Deng,Ye and Zhou,Xuzi} } @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 {13947, title = {Kernel partial least squares for speaker recognition}, booktitle = {Twelfth Annual Conference of the International Speech Communication Association}, year = {2011}, month = {2011///}, abstract = {I-vectors are a concise representation of speaker characteristics. Recent advances in speaker recognition have utilized their ability to capture speaker and channel variability to develop efficient recognition engines. Inter-speaker relationships in the i-vector space are non-linear. Accomplishing effective speaker recognition requires a good modeling of these non-linearities and can be cast as a machine learning problem. In this paper, we propose a kernel partial least squares (kernel PLS, or KPLS) framework for modeling speakers in the i-vectors space. The resulting recognition system is tested across several conditions of the NIST SRE 2010 extended core data set and compared against state-of-the-art systems: Joint Factor Analysis (JFA), Probabilistic Linear Discriminant Analysis (PLDA), and Cosine Distance Scoring (CDS) classifiers. Improvements are shown.}, author = {Srinivasan,B.V. and Garcia-Romero,D. and Zotkin,Dmitry N and Duraiswami, Ramani} } @conference {14457, title = {Learning statistical models from relational data}, booktitle = {Proceedings of the 2011 international conference on Management of data}, series = {SIGMOD {\textquoteright}11}, year = {2011}, month = {2011///}, pages = {1195 - 1198}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Statistical Relational Learning (SRL) is a subarea of machine learning which combines elements from statistical and probabilistic modeling with languages which support structured data representations. In this survey, we will: 1) provide an introduction to SRL, 2) describe some of the distinguishing characteristics of SRL systems, including relational feature construction and collective classification, 3) describe three SRL systems in detail, 4) discuss applications of SRL techniques to important data management problems such as entity resolution, selectivity estimation, and information integration, and 5) discuss connections between SRL methods and existing database research such as probabilistic databases.}, keywords = {machine learning, probabilistic graphical models, statistical relational learning}, isbn = {978-1-4503-0661-4}, doi = {10.1145/1989323.1989451}, url = {http://doi.acm.org/10.1145/1989323.1989451}, author = {Getoor, Lise and Mihalkova,Lilyana} } @article {14501, title = {Learning to predict web collaborations}, journal = {Workshop on User Modeling for Web Applications (UMWA-11)}, year = {2011}, month = {2011///}, abstract = {Much of the knowledge available on the web today comes asa result of fruitful collaborations among large groups of peo- ple. One of the most striking examples of successful web col- laboration is the online encyclopedia Wikipedia. The web is used as a collaboration platform by highly specialized blog- ging communities and by the scientific community. An im- portant reason for the richness of content generated through web collaborations is that the participants in such collabo- rations are not constrained by geographic location. Thus, like-minded individuals from across the world can join their efforts. This also means, however, that web collaborators of- ten do not know each other, and, thus, finding collaborators on the web is more difficult than it is with more traditional forms of collaboration that are initiated based on acquain- tance. This difficulty is further exacerbated by the fact that web collaborations tend to be more dynamic as participants join and abandon communities. We consider the task of rec- ommending project-specific potential collaborators to web users and propose an approach that is based on statistical relational learning. Our proposed model thus has the ad- vantages that it can include complex features composed of multiple properties and relationships of the entities, it can handle the high levels of noise and uncertainty inherent in user actions, and it allows for joint decision-making, which leads to more accurate predictions. To ensure scalability, our model is trained in an online fashion. We demonstrate the effectiveness of our approach on a data set collected from Wikipedia. }, author = {Mihalkova,L. and Moustafa,W. and Getoor, Lise} } @conference {18922, title = {The Life Game: Cognitive Strategies for Repeated Stochastic Games}, year = {2011}, month = {2011/10//}, pages = {95 - 102}, abstract = {Standard models in bio-evolutionary game theory involve repetitions of a single stage game (e.g., the Prisoner{\textquoteright}s Dilemma or the Stag Hunt); but it is clear that repeatedly playing the same stage game is not an accurate model of most individuals{\textquoteright} lives. Rather, individuals{\textquoteright} interactions with others correspond to many different kinds of stage games. In this work, we concentrate on discovering behavioral strategies that are successful for the life game, in which the stage game is chosen stochastically at each iteration. We present a cognitive agent model based on Social Value Orientation (SVO) theory. We provide extensive evaluations of our model{\textquoteright}s performance, both against standard agents from the game theory literature and against a large set of life-game agents written by students in two different countries. Our empirical results suggest that for life-game strategies to be successful in environments with such agents, it is important (i) to be unforgiving with respect to trust behavior and (ii) to use adaptive, fine-grained opponent models of the other agents.}, keywords = {adaptive model, behavioral strategy, bioevolutionary game theory, cognitive agent model, fine-grained opponent model, game theory, iteration, iterative methods, life game, prisoner{\textquoteright}s dilemma, repeated stochastic games, social value orientation theory, stag hunt, stage game, Stochastic processes, trust behavior}, doi = {10.1109/PASSAT/SocialCom.2011.62}, author = {Cheng,Kan-Leung and Zuckerman,I. and Nau, Dana S. and Golbeck,J.} } @conference {16036, title = {LifeFlow: visualizing an overview of event sequences}, booktitle = {Proceedings of the 2011 annual conference on Human factors in computing systems}, series = {CHI {\textquoteright}11}, year = {2011}, month = {2011///}, pages = {1747 - 1756}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Event sequence analysis is an important task in many domains: medical researchers may study the patterns of transfers within the hospital for quality control; transportation experts may study accident response logs to identify best practices. In many cases they deal with thousands of records. While previous research has focused on searching and browsing, overview tasks are often overlooked. We introduce a novel interactive visual overview of event sequences called \emph{LifeFlow}. LifeFlow is scalable, can summarize all possible sequences, and represents the temporal spacing of the events within sequences. Two case studies with healthcare and transportation domain experts are presented to illustrate the usefulness of LifeFlow. A user study with ten participants confirmed that after 15 minutes of training novice users were able to rapidly answer questions about the prevalence and temporal characteristics of sequences, find anomalies, and gain significant insight from the data.}, keywords = {Information Visualization, overview visualization, temporal categorical data, timestamped event sequences}, isbn = {978-1-4503-0228-9}, doi = {10.1145/1978942.1979196}, url = {http://doi.acm.org/10.1145/1978942.1979196}, author = {Wongsuphasawat,Krist and Guerra G{\'o}mez,John Alexis and Plaisant, Catherine and Wang,Taowei David and Taieb-Maimon,Meirav and Shneiderman, Ben} } @conference {17280, title = {LifeFlow: visualizing an overview of event sequences (video preview)}, booktitle = {Proceedings of the 2011 annual conference extended abstracts on Human factors in computing systems}, series = {CHI EA {\textquoteright}11}, year = {2011}, month = {2011///}, pages = {507 - 510}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Event sequence analysis is an important task in many domains: medical researchers may study the patterns of transfers within the hospital for quality control; transportation experts may study accident response logs to identify best practices. In many cases they deal with thousands of records. While previous research has focused on searching and browsing, overview tasks are often overlooked. We introduce a novel interactive visual overview of event sequences called LifeFlow. LifeFlow is scalable, can summarize all possible sequences, and represents the temporal spacing of the events within sequences. In this video, we show an example of patient transfer data and briefly demonstrate how to analyze them with LifeFlow. Please see [11] or visit http:www.cs.umd.eduhcillifeflow for more detail.}, keywords = {emergency room, healthcare, Information Visualization, overview visualization, temporal categorical data, timestamped event sequences}, isbn = {978-1-4503-0268-5}, doi = {10.1145/1979742.1979557}, url = {http://doi.acm.org/10.1145/1979742.1979557}, author = {Wongsuphasawat,Krist and Guerra G{\'o}mez,John Alexis and Plaisant, Catherine and Wang,Taowei and Taieb-Maimon,Meirav and Shneiderman, Ben} } @conference {14702, title = {Lightweight monadic programming in ML}, booktitle = {Proceedings of the 16th ACM SIGPLAN international conference on Functional programming}, series = {ICFP {\textquoteright}11}, year = {2011}, month = {2011///}, pages = {15 - 27}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Many useful programming constructions can be expressed as monads. Examples include probabilistic modeling, functional reactive programming, parsing, and information flow tracking, not to mention effectful functionality like state and I/O. In this paper, we present a type-based rewriting algorithm to make programming with arbitrary monads as easy as using ML{\textquoteright}s built-in support for state and I/O. Developers write programs using monadic values of type m τ as if they were of type τ, and our algorithm inserts the necessary binds, units, and monad-to-monad morphisms so that the program type checks. Our algorithm, based on Jones{\textquoteright} qualified types, produces principal types. But principal types are sometimes problematic: the program{\textquoteright}s semantics could depend on the choice of instantiation when more than one instantiation is valid. In such situations we are able to simplify the types to remove any ambiguity but without adversely affecting typability; thus we can accept strictly more programs. Moreover, we have proved that this simplification is efficient (linear in the number of constraints) and coherent: while our algorithm induces a particular rewriting, all related rewritings will have the same semantics. We have implemented our approach for a core functional language and applied it successfully to simple examples from the domains listed above, which are used as illustrations throughout the paper.}, keywords = {coercion, coherence, monad, rewriting, type}, isbn = {978-1-4503-0865-6}, doi = {10.1145/2034773.2034778}, url = {http://doi.acm.org/10.1145/2034773.2034778}, author = {Swamy,Nikhil and Guts,Nataliya and Leijen,Daan and Hicks, Michael W.} } @article {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 {13945, title = {Linear versus Mel Frequency Cepstral Coefficients for Speaker Recognition}, journal = {IEEE Automatic Speech Recognition and Understanding Workshop}, year = {2011}, month = {2011///}, abstract = {Mel-frequency cepstral coefficients (MFCC) havebeen dominantly used in speaker recognition as well as in speech recognition. However, based on theories in speech production, some speaker characteristics associated with the structure of the vocal tract, particularly the vocal tract length, are reflected more in the high frequency range of speech. This insight suggests that a linear scale in frequency may provide some advantages in speaker recognition over the mel scale. Based on two state-of-the- art speaker recognition back-end systems (one Joint Factor Analysis system and one Probabilistic Linear Discriminant Analysis system), this study compares the performances between MFCC and LFCC (Linear frequency cepstral coefficients) in the NIST SRE (Speaker Recognition Evaluation) 2010 extended-core task. Our results in SRE10 show that, while they are complementary to each other, LFCC consistently outperforms MFCC, mainly due to its better performance in the female trials. This can be explained by the relatively shorter vocal tract in females and the resulting higher formant frequencies in speech. LFCC benefits more in female speech by better capturing the spectral characteristics in the high frequency region. In addition, our results show some advantage of LFCC over MFCC in reverberant speech. LFCC is as robust as MFCC in the babble noise, but not in the white noise. It is concluded that LFCC should be more widely used, at least for the female trials, by the mainstream of the speaker recognition community. }, author = {Zhou,X. and Garcia-Romero,D. and Duraiswami, Ramani and Espy-Wilson,C. and Shamma,S.} } @conference {13595, title = {Maryland at FIRE 2011: Retrieval of OCRed Bengali}, booktitle = {FIRE}, year = {2011}, month = {2011///}, abstract = {In this year{\textquoteright}s Forum for Information Retrieval Evaluation (FIRE), the University of Maryland participated in the Retrieval of Indic Script OCRed Text (RISOT) task to experiment with the retrieval of Bengali script OCR{\textquoteright}d documents. The experiments focused on evaluating a retrieval strategy motivated by recent work on Cross-Language Information Retrieval (CLIR), but which makes use of OCR error modeling rather than parallel text alignment. The approach obtains a probability distribution over substitutions for the actual query terms that possibly correspond to terms in the document representation. The results reported indicate that this is a promising way of using OCR error modeling to improve CLIR.}, author = {Garain,Utpal and David Doermann and Oard,Douglas D.} } @conference {14470, title = {Materializing multi-relational databases from the web using taxonomic queries}, booktitle = {Proceedings of the fourth ACM international conference on Web search and data mining}, series = {WSDM {\textquoteright}11}, year = {2011}, month = {2011///}, pages = {355 - 364}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Recently, much attention has been given to extracting tables from Web data. In this problem, the column definitions and tuples (such as what "company" is headquartered in what "city,") are extracted from Web text, structured Web data such as lists, or results of querying the deep Web, creating the table of interest. In this paper, we examine the problem of extracting and discovering multiple tables in a given domain, generating a truly multi-relational database as output. Beyond discovering the relations that define single tables, our approach discovers and leverages "within column" set membership relations, and discovers relations across the extracted tables (e.g., joins). By leveraging within-column relations our method can extract table instances that are ambiguous or rare, and by discovering joins, our method generates truly multi-relational output. Further, our approach uses taxonomic queries to bootstrap the extraction, rather than the more traditional "seed instances." Creating seeds often requires more domain knowledge than taxonomic queries, and previous work has shown that extraction methods may be sensitive to which input seeds they are given. We test our approach on two real world domains: NBA basketball and cancer information. Our results demonstrate that our approach generates databases of relevant tables from disparate Web information, and discovers the relations between them. Further, we show that by leveraging the "within column" relation our approach can identify a significant number of relevant tuples that would be difficult to do so otherwise.}, keywords = {discovering multi-relational data, multirelational data}, isbn = {978-1-4503-0493-1}, doi = {10.1145/1935826.1935885}, url = {http://doi.acm.org/10.1145/1935826.1935885}, author = {Michelson,Matthew and Macskassy,Sofus A. and Minton,Steven N. and Getoor, Lise} } @article {14413, title = {A method for the detection of meaningful and reproducible group signatures from gene expression profiles}, journal = {Journal of Bioinformatics and Computational Biology}, volume = {9}, year = {2011}, month = {2011///}, pages = {431 - 451}, abstract = {Gene expression microarrays are commonly used to detect the biological signature of a disease or to gain a better understanding of the underlying mechanism of how a group of drugs treat a specific disease. The outcome of such experiments, e.g. the signature, is a list of differentially expressed genes. Reproducibility across independent experiments remains a challenge. We are interested in creating a method that can detect the shared signature of a group of expression profiles, e.g. a group of samples from individuals with the same disease or a group of drugs that treat the same therapeutic indication. We have developed a novel Weighted Influence {\textemdash} Rank of Ranks (WIMRR) method, and we demonstrate its ability to produce both meaningful and reproducible group signatures.}, author = {Licamele,L. and Getoor, Lise} } @conference {18861, title = {Multi-material compliant mechanisms for mobile millirobots}, year = {2011}, month = {2011/05//}, pages = {3169 - 3174}, abstract = {This paper describes a new process for fabricating planar, multi-material, compliant mechanisms, intended for use in small scale robotics. The process involves laser cutting the mechanism geometry from a rigid material, and refilling the joint areas with a second, elastomeric material. This method allows for a large set of potential materials, with a wide range of material properties, to be used in combination to create mechanisms with highly tailored mechanical properties. These multi-material compliant mechanisms have minimum feature sizes of approximately 100 $\#$x00B5;m and have demonstrated long lifetimes, easily surviving 100,000 bending cycles. We also present the first use of these compliant mechanisms in a 2.5cm $\#$x00D7; 2.5cm $\#$x00D7; 7.5cm, 6g hexapod. This hexapod has been demonstrated moving at speeds up to 6 cm/s, with a predicted maximum speed of up to 17 cm/s.}, doi = {10.1109/ICRA.2011.5980543}, author = {Vogtmann,Dana E. and Gupta, Satyandra K. and Bergbreiter,Sarah} } @conference {17306, title = {NetVisia: Heat Map \& Matrix Visualization of Dynamic Social Network Statistics \& Content}, booktitle = {Privacy, Security, Risk and Trust (PASSAT), 2011 IEEE Third International Conference on and 2011 IEEE Third International Confernece on Social Computing (SocialCom)}, year = {2011}, month = {2011/10/09/11}, pages = {19 - 26}, publisher = {IEEE}, organization = {IEEE}, abstract = {Visualizations of static networks in the form of node-link diagrams have evolved rapidly, though researchers are still grappling with how best to show evolution of nodes over time in these diagrams. This paper introduces NetVisia, a social network visualization system designed to support users in exploring temporal evolution in networks by using heat maps to display node attribute changes over time. NetVisia{\textquoteright}s novel contributions to network visualizations are to (1) cluster nodes in the heat map by similar metric values instead of by topological similarity, and (2) align nodes in the heat map by events. We compare NetVisia to existing systems and describe a formative user evaluation of a NetVisia prototype with four participants that emphasized the need for tool tips and coordinated views. Despite the presence of some usability issues, in 30-40 minutes the user evaluation participants discovered new insights about the data set which had not been discovered using other systems. We discuss implemented improvements to NetVisia, and analyze a co-occurrence network of 228 business intelligence concepts and entities. This analysis confirms the utility of a clustered heat map to discover outlier nodes and time periods.}, keywords = {business intelligence concept, business intelligence entity, competitive intelligence, data visualisation, dynamic networks, dynamic social network, heat map, Heating, Image color analysis, Information Visualization, Layout, matrix visualization, measurement, NetVisia system, network evolution, network visualization, node-link diagrams, outlier node, social network content, Social network services, social network statistics, social networking (online), social networks, static network visualization, time period, topological similarity, Training, usability, user evaluation, User interfaces}, isbn = {978-1-4577-1931-8}, doi = {10.1109/PASSAT/SocialCom.2011.216}, author = {Gove,R. and Gramsky,N. and Kirby,R. and Sefer,E. and Sopan,A. and Dunne,C. and Shneiderman, Ben and Taieb-Maimon,M.} } @article {17629, title = {Network Clustering Approximation Algorithm Using One Pass Black Box Sampling}, journal = {arXiv:1110.3563}, year = {2011}, month = {2011/10/16/}, abstract = {Finding a good clustering of vertices in a network, where vertices in the same cluster are more tightly connected than those in different clusters, is a useful, important, and well-studied task. Many clustering algorithms scale well, however they are not designed to operate upon internet-scale networks with billions of nodes or more. We study one of the fastest and most memory efficient algorithms possible - clustering based on the connected components in a random edge-induced subgraph. When defining the cost of a clustering to be its distance from such a random clustering, we show that this surprisingly simple algorithm gives a solution that is within an expected factor of two or three of optimal with either of two natural distance functions. In fact, this approximation guarantee works for any problem where there is a probability distribution on clusterings. We then examine the behavior of this algorithm in the context of social network trust inference.}, keywords = {Computer Science - Social and Information Networks, Physics - Physics and Society}, url = {http://arxiv.org/abs/1110.3563}, author = {DuBois,Thomas and Golbeck,Jennifer and Srinivasan, Aravind} } @article {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} } @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 {20383, title = {Occurrence of Vibrio cholerae in Municipal and Natural Waters and Incidence of Cholera in Azerbaijan}, journal = {EcoHealth}, year = {2011}, month = {Jan-12-2011}, pages = {468 - 477}, abstract = {Cholera, a waterborne disease caused by Vibrio cholerae, is an autochthonous member of the aquatic environment and predominantly reported from developing countries. Technical reports and proceedings were reviewed to determine the relationship between occurrence of V. cholerae in natural waters, including sources of municipal water, and cases of cholera in Azerbaijan. Water samples collected from different environmental sources from 1970 to 1998 were tested for V. cholerae and 0.73\% (864/117,893) were positive. The results showed that in April of each year, when the air temperature rose by approximately 5{\textdegree}C, V. cholerae could be isolated. With each increase in air temperature, 6{\textendash}8 weeks after, impact on cases of cholera was recorded. The incidence of cholera peaked when the air temperature reached >25{\textdegree}C during the month of September. It is concluded that a distinct seasonality in cholera incidence exists in Azerbaijan, with increased occurrence during warmer months.}, issn = {1612-9202}, doi = {10.1007/s10393-012-0756-8}, url = {http://link.springer.com/10.1007/s10393-012-0756-8}, author = {Gurbanov, Shair and Akhmadov, Rashid and Shamkhalova, Gulnara and Akhmadova, Sevinj and Haley, Bradd J. and Rita R Colwell and Huq, Anwar} } @conference {13617, title = {Overview of the FIRE 2011 RISOTTask}, booktitle = {FIRE}, year = {2011}, month = {2011///}, abstract = {RISOT was a pilot task in FIRE 2011 which focused on the retrieval of automatically recognized text from machine printed sources. The collection used for search was a subset of the FIRE 2008 and 2010 Bengali test collections that contained 92 topics and 62,825 documents. Two teams participated, submitting a total of 11 monolingual runs.}, author = {Garain,Utpal and Paik,Jiaul and Pal,Tamaltaru and Majumder,Prasenjit and David Doermann and Oard, Douglas} } @conference {13079, title = {Piecing together the segmentation jigsaw using context}, booktitle = {Computer Vision and Pattern Recognition (CVPR), 2011 IEEE Conference on}, year = {2011}, month = {2011/06//}, pages = {2001 - 2008}, abstract = {We present an approach to jointly solve the segmentation and recognition problem using a multiple segmentation framework. We formulate the problem as segment selection from a pool of segments, assigning each selected segment a class label. Previous multiple segmentation approaches used local appearance matching to select segments in a greedy manner. In contrast, our approach formulates a cost function based on contextual information in conjunction with appearance matching. This relaxed cost function formulation is minimized using an efficient quadratic programming solver and an approximate solution is obtained by discretizing the relaxed solution. Our approach improves labeling performance compared to other segmentation based recognition approaches.}, keywords = {algorithms;image, approximation, formulation;greedy, function, information;cost, manner;image, programming;approximation, recognition;image, segmentation;, segmentation;jigsaw, segmentation;quadratic, solution;contextual, theory;greedy}, doi = {10.1109/CVPR.2011.5995367}, author = {Chen,Xi and Jain, A. and Gupta,A. and Davis, Larry S.} } @conference {17643, title = {Predicting Trust and Distrust in Social Networks}, booktitle = {Privacy, Security, Risk and Trust (PASSAT), 2011 IEEE Third International Conference on and 2011 IEEE Third International Confernece on Social Computing (SocialCom)}, year = {2011}, month = {2011/10/09/11}, pages = {418 - 424}, publisher = {IEEE}, organization = {IEEE}, abstract = {As user-generated content and interactions have overtaken the web as the default mode of use, questions of whom and what to trust have become increasingly important. Fortunately, online social networks and social media have made it easy for users to indicate whom they trust and whom they do not. However, this does not solve the problem since each user is only likely to know a tiny fraction of other users, we must have methods for inferring trust - and distrust - between users who do not know one another. In this paper, we present a new method for computing both trust and distrust (i.e., positive and negative trust). We do this by combining an inference algorithm that relies on a probabilistic interpretation of trust based on random graphs with a modified spring-embedding algorithm. Our algorithm correctly classifies hidden trust edges as positive or negative with high accuracy. These results are useful in a wide range of social web applications where trust is important to user behavior and satisfaction.}, keywords = {distrust prediction, Electronic publishing, Encyclopedias, graph theory, inference algorithm, Inference algorithms, inference mechanisms, Internet, negative trust, online social networks, positive trust, Prediction algorithms, probability, random graphs, security of data, social media, social networking (online), spring-embedding algorithm, Training, trust inference, trust probabilistic interpretation, user behavior, user satisfaction, user-generated content, user-generated interactions}, isbn = {978-1-4577-1931-8}, doi = {10.1109/PASSAT/SocialCom.2011.56}, author = {DuBois,T. and Golbeck,J. and Srinivasan, Aravind} } @article {14490, title = {Privacy in social networks: A survey}, journal = {Social Network Data Analytics}, year = {2011}, month = {2011///}, pages = {277 - 306}, abstract = {In this chapter, we survey the literature on privacy in social networks. We focus both on online social networks and online affiliation networks. We formally define the possible privacy breaches and describe the privacy attacks that have been studied. We present definitions of privacy in the context of anonymization together with existing anonymization techniques.}, doi = {10.1007/978-1-4419-8462-3_10}, author = {Zheleva,E. and Getoor, Lise} } @conference {14471, title = {A probabilistic approach for learning folksonomies from structured data}, booktitle = {Proceedings of the fourth ACM international conference on Web search and data mining}, series = {WSDM {\textquoteright}11}, year = {2011}, month = {2011///}, pages = {555 - 564}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Learning structured representations has emerged as an important problem in many domains, including document and Web data mining, bioinformatics, and image analysis. One approach to learning complex structures is to integrate many smaller, incomplete and noisy structure fragments. In this work, we present an unsupervised probabilistic approach that extends affinity propagation [7] to combine the small ontological fragments into a collection of integrated, consistent, and larger folksonomies. This is a challenging task because the method must aggregate similar structures while avoiding structural inconsistencies and handling noise. We validate the approach on a real-world social media dataset, comprised of shallow personal hierarchies specified by many individual users, collected from the photosharing website Flickr. Our empirical results show that our proposed approach is able to construct deeper and denser structures, compared to an approach using only the standard affinity propagation algorithm. Additionally, the approach yields better overall integration quality than a state-of-the-art approach based on incremental relational clustering.}, keywords = {collective knowledge, data mining, folksonomies, social information processing, social metadata, taxonomies}, isbn = {978-1-4503-0493-1}, doi = {10.1145/1935826.1935905}, url = {http://doi.acm.org/10.1145/1935826.1935905}, author = {Plangprasopchok,Anon and Lerman,Kristina and Getoor, Lise} } @article {13847, title = {Rapid understanding of scientific paper collections: integrating statistics, text analysis, and visualization}, journal = {University of Maryland, Human-Computer Interaction Lab Tech Report HCIL-2011}, year = {2011}, month = {2011///}, abstract = {Keeping up with rapidly growing research fields, especially when there aremultiple interdisciplinary sources, requires substantial effort for researchers, program managers, or venture capital investors. Current theories and tools are directed at finding a paper or website, not gaining an understanding of the key papers, authors, controversies, and hypotheses. This report presents an effort to integrate statistics, text analytics, and visualization in a multiple coordinated window environment that supports exploration. Our prototype system, Action Science Explorer (ASE), provides an environment for demon- strating principles of coordination and conducting iterative usability tests of them with interested and knowledgeable users. We developed an under- standing of the value of reference management, statistics, citation context extraction, natural language summarization for single and multiple docu- ments, filters to interactively select key papers, and network visualization to see citation patterns and identify clusters. The three-phase usability study guided our revisions to ASE and led us to improve the testing methods. }, author = {Dunne,C. and Shneiderman, Ben and Gove,R. and Klavans,J. and Dorr, Bonnie J} } @article {18783, title = {Real-time dynamics simulation of unmanned sea surface vehicle for virtual environments}, journal = {Journal of Computing and Information Science in Engineering}, volume = {11}, year = {2011}, month = {2011///}, pages = {031005 - 031005}, author = {Thakur,A. and Gupta,S.K.} } @article {18793, title = {Recent advances and future challenges in automated manufacturing planning}, journal = {Journal of Computing and Information Science in Engineering}, volume = {11}, year = {2011}, month = {2011///}, pages = {021006 - 021006}, author = {Bourne,D. and Corney,J. and Gupta,S.K.} } @article {12861, title = {Role of Zooplankton Diversity in Vibrio Cholerae Population Dynamics and in the Incidence of Cholera in the Bangladesh Sundarbans}, journal = {Applied and Environmental Microbiology}, volume = {77}, year = {2011}, month = {09/2011}, pages = {6125 - 6132}, abstract = {Vibrio cholerae, a bacterium autochthonous to the aquatic environment, is the causative agent of cholera, a severe watery, life-threatening diarrheal disease occurring predominantly in developing countries. V. cholerae, including both serogroups O1 and O139, is found in association with crustacean zooplankton, mainly copepods, and notably in ponds, rivers, and estuarine systems globally. The incidence of cholera and occurrence of pathogenic V. cholerae strains with zooplankton were studied in two areas of Bangladesh: Bakerganj and Mathbaria. Chitinous zooplankton communities of several bodies of water were analyzed in order to understand the interaction of the zooplankton population composition with the population dynamics of pathogenic V. cholerae and incidence of cholera. Two dominant zooplankton groups were found to be consistently associated with detection of V. cholerae and/or occurrence of cholera cases, namely, rotifers and cladocerans, in addition to copepods. Local differences indicate there are subtle ecological factors that can influence interactions between V. cholerae, its plankton hosts, and the incidence of cholera.}, isbn = {0099-2240, 1098-5336}, doi = {10.1128/AEM.01472-10}, url = {http://aem.asm.org/content/77/17/6125}, author = {De Magny,Guillaume Constantin and Mozumder,Pronob K. and Grim,Christopher J. and Hasan,Nur A. and Naser,M. Niamul and Alam,Munirul and Sack,R. Bradley and Huq,Anwar and Rita R Colwell} } @conference {13940, title = {Scalable fast multipole methods on distributed heterogeneous architectures}, booktitle = {High Performance Computing, Networking, Storage and Analysis (SC), 2011 International Conference for}, year = {2011}, month = {2011/11//}, pages = {1 - 12}, abstract = {We fundamentally reconsider implementation of the Fast Multipole Method (FMM) on a computing node with a heterogeneous CPU-GPU architecture with multicore CPU(s) and one or more GPU accelerators, as well as on an interconnected cluster of such nodes. The FMM is a divide- and-conquer algorithm that performs a fast N-body sum using a spatial decomposition and is often used in a time- stepping or iterative loop. Using the observation that the local summation and the analysis-based translation parts of the FMM are independent, we map these respectively to the GPUs and CPUs. Careful analysis of the FMM is performed to distribute work optimally between the multicore CPUs and the GPU accelerators. We first develop a single node version where the CPU part is parallelized using OpenMP and the GPU version via CUDA. New parallel algorithms for creating FMM data structures are presented together with load balancing strategies for the single node and distributed multiple-node versions. Our implementation can perform the N-body sum for 128M particles on 16 nodes in 4.23 seconds, a performance not achieved by others in the literature on such clusters.}, keywords = {accelerators;OpenMP;analysis, algorithm;iterative, and, architecture;CUDA;FMM, architectures;, architectures;divide-and-conquer, based, conquer, CPU-GPU, CPU;scalable, data, fast, heterogeneous, loop;data, loop;multicore, methods;graphics, methods;multiprocessing, methods;time, multipole, parts;distributed, PROCESSING, stepping, structures;divide, structures;GPU, systems;parallel, translation, units;iterative}, author = {Hu,Qi and Gumerov, Nail A. and Duraiswami, Ramani} } @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 {18281, title = {"Seeing" ENF: natural time stamp for digital video via optical sensing and signal processing}, booktitle = {Proceedings of the 19th ACM international conference on Multimedia}, series = {MM {\textquoteright}11}, year = {2011}, month = {2011///}, pages = {23 - 32}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Electric Network Frequency (ENF) fluctuates slightly over time from its nominal value of 50 Hz/60 Hz. The fluctuations in the ENF remain consistent across the entire power grid even when measured at physically distant locations. The near-invisible flickering of fluorescent lights connected to the power mains reflect these fluctuations present in the ENF. In this paper, mechanisms using optical sensors and video cameras to record and validate the presence of the ENF fluctuations in fluorescent lighting are presented. Signal processing techniques are applied to demonstrate a high correlation between the fluctuations in the ENF signal captured from fluorescent lighting and the ENF signal captured directly from power mains supply. The proposed technique is then used to demonstrate the presence of the ENF signal in video recordings taken in various geographical areas. Experimental results show that the ENF signal can be used as a natural timestamp for optical sensor recordings and video surveillance recordings from indoor environments under fluorescent lighting. Application of the ENF signal analysis to tampering detection of surveillance video recordings is also demonstrated.}, keywords = {electric network frequency, information forensics, timestamp, video authentication}, isbn = {978-1-4503-0616-4}, doi = {10.1145/2072298.2072303}, url = {http://doi.acm.org/10.1145/2072298.2072303}, author = {Garg,Ravi and Varna,Avinash L. and M. Wu} } @conference {19258, title = {Teaching cross-platform design and testing methods for embedded systems using DICE}, series = {WESE {\textquoteright}11}, year = {2011}, month = {2011}, pages = {38 - 45}, publisher = {ACM}, organization = {ACM}, abstract = {DICE (the DSPCAD Integrative Command Line Environment) is a package of utilities that facilitates efficient management of software projects. Key areas of emphasis in DICE are cross-platform operation, support for projects that integrate heterogeneous programming languages, and support for applying and integrating different kinds of design and testing methodologies. The package is being developed at the University of Maryland to facilitate the research and teaching of methods for implementation, testing, evolution, and revision of engineering software. The platform- and language-independent focus of DICE makes it an effective vehicle for teaching high-productivity, high-reliability methods for design and implementation of embedded systems for a variety of courses. In this paper, we provide an overview of features of DICE --- particularly as they relate to testing driven design practices --- that are useful in embedded systems education, and discuss examples and experiences of applying the tool in courses at the University of Maryland aimed at diverse groups of students --- undergraduate programming concepts for engineers, graduate VLSI architectures (aimed at research-oriented students), and graduate FPGA system design (aimed at professional Master{\textquoteright}s students).}, isbn = {978-1-4503-1046-8}, url = {http://doi.acm.org/10.1145/2077370.2077376}, author = {Bhattacharyya, Shuvra S. and Plishker,William and Gupta, Ayush and Chung-Ching Shen} } @article {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.} } @article {13949, title = {Toward improved aeromechanics simulations using recent advancements in scientific computing}, journal = {Proceedings 67th Annual Forum of the American Helicopter Society}, year = {2011}, month = {2011///}, pages = {3 - 5}, author = {Hu,Q. and Syal,M. and Gumerov, Nail A. and Duraiswami, Ramani and Leishman,J.G.} } @conference {18794, title = {Trajectory planning with look-ahead for Unmanned Sea Surface Vehicles to handle environmental disturbances}, year = {2011}, month = {2011///}, pages = {1154 - 1159}, url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=6048670}, author = {Svec,P. and Schwartz,M. and Thakur,A. and Gupta,S.K.} } @conference {17442, title = {TreeVersity: Comparing tree structures by topology and node{\textquoteright}s attributes differences}, booktitle = {2011 IEEE Conference on Visual Analytics Science and Technology (VAST)}, year = {2011}, month = {2011/10/23/28}, pages = {275 - 276}, publisher = {IEEE}, organization = {IEEE}, abstract = {It is common to classify data in hierarchies, they provide a comprehensible way of understanding big amounts of data. From budgets to organizational charts or even the stock market, trees are everywhere and people find them easy to use. However when analysts need to compare two versions of the same tree structure, or two related taxonomies, the task is not so easy. Much work has been done on this topic, but almost all of it has been restricted to either compare the trees by topology, or by the node attribute values. With this project we are proposing TreeVersity, a framework for comparing tree structures, both by structural changes and by differences in the node attributes. This paper is based on our previous work on comparing traffic agencies using LifeFlow [1, 2] and on a first prototype of TreeVersity.}, keywords = {Computer science, data classification, Data visualization, Educational institutions, hierarchy, Image color analysis, LifeFlow, node attributes differences, Pattern classification, structural changes, Topology, topology attributes differences, traffic agencies, tree structures comparison, trees (mathematics), TreeVersity, Vegetation, Visualization}, isbn = {978-1-4673-0015-5}, doi = {10.1109/VAST.2011.6102471}, author = {Gomez,J.A.G. and Buck-Coleman,A. and Plaisant, Catherine and Shneiderman, Ben} } @conference {16034, title = {TreeVersity: Comparing tree structures by topology and node{\textquoteright}s attributes differences}, booktitle = {Visual Analytics Science and Technology (VAST), 2011 IEEE Conference on}, year = {2011}, month = {2011/10//}, pages = {275 - 276}, abstract = {It is common to classify data in hierarchies, they provide a comprehensible way of understanding big amounts of data. From budgets to organizational charts or even the stock market, trees are everywhere and people find them easy to use. However when analysts need to compare two versions of the same tree structure, or two related taxonomies, the task is not so easy. Much work has been done on this topic, but almost all of it has been restricted to either compare the trees by topology, or by the node attribute values. With this project we are proposing TreeVersity, a framework for comparing tree structures, both by structural changes and by differences in the node attributes. This paper is based on our previous work on comparing traffic agencies using LifeFlow [1, 2] and on a first prototype of TreeVersity.}, keywords = {(mathematics);, agencies;tree, attributes, changes;topology, classification;hierarchy;node, classification;trees, comparison;pattern, differences;structural, differences;traffic, LifeFlow;TreeVersity;data, STRUCTURES}, doi = {10.1109/VAST.2011.6102471}, author = {Gomez,J.A.G. and Buck-Coleman,A. and Plaisant, Catherine and Shneiderman, Ben} } @article {17445, title = {Tutorial-Graph Analytics {\textemdash} Lessons Learned and Challenges Ahead}, journal = {IEEE Computer Graphics and Applications}, volume = {31}, year = {2011}, month = {2011///}, pages = {18 - 18}, author = {Wong,P.C. and Chen,C. and G{\"o}rg,C. and Shneiderman, Ben and Stasko,J. and Thomas,J.} } @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 {14488, title = {Understanding actor loyalty to event-based groups in affiliation networks}, journal = {Social Network Analysis and Mining}, volume = {1}, year = {2011}, month = {2011///}, pages = {115 - 126}, abstract = {In this paper, we introduce a method for analyzing the temporal dynamics of affiliation networks. We define affiliation groups which describe temporally related subsets of actors and describe an approach for exploring changing memberships in these affiliation groups over time. To model the dynamic behavior in these networks, we consider the concept of loyalty and introduce a measure that captures an actor{\textquoteright}s loyalty to an affiliation group as the degree of {\textquoteleft}commitment{\textquoteright} an actor shows to the group over time. We evaluate our measure using three real world affiliation networks: a publication network, a senate bill cosponsorship network, and a dolphin network. The results show the utility of our measure for analyzing the dynamic behavior of actors and quantifying their loyalty to different time-varying affiliation groups.}, doi = {10.1007/s13278-010-0005-5}, author = {Sharara,H. and Singh,L. and Getoor, Lise and Mann,J.} } @article {13882, title = {Understanding Scientific Literature Networks: An Evaluation of Action Science Explorer}, year = {2011}, month = {2011///}, institution = {University of Maryland at College Park}, abstract = {Action Science Explorer (ASE) is a tool designed to supportusers in rapidly generating readily consumable summaries of academic literature. The authors describe ASE and report on how early formative evaluations led to a mature system evaluation, consisting of an in-depth empirical evaluation with 4 domain expert participants. The user study tasks were of two types: predefined tasks to test system perfor- mance in common scenarios, and user-defined tasks to test the system{\textquoteright}s usefulness for custom exploration goals. This paper concludes by describing ASE{\textquoteright}s attribute ranking ca- pability which is a novel contribution for exploring scientific literature networks. It makes design recommendations to: give the users control over which documents to explore, easy- to-understand metrics for ranking documents, and overviews of the document set in coordinated views along with details- on-demand of specific papers. }, author = {Gove,R. and Dunne,C. and Shneiderman, Ben and Klavans,J. and Dorr, Bonnie J} } @article {17462, title = {Usability and Accessibility in Consumer Health Informatics: Current Trends and Future Challenges}, journal = {American Journal of Preventive Medicine}, volume = {40}, year = {2011}, month = {2011/05//}, pages = {S187-S197 - S187-S197}, abstract = {It is a truism that, for innovative eHealth systems to have true value and impact, they must first and foremost be usable and accessible by clinicians, consumers, and other stakeholders. In this paper, current trends and future challenges in the usability and accessibility of consumer health informatics will be described. Consumer expectations of their healthcare providers and healthcare records in this new era of consumer-directed care will be explored, and innovative visualizations, assistive technologies, and other ways that healthcare information is currently being provided and/or shared will be described. Challenges for ensuring the usability of current and future systems will also be discussed. An innovative model for conducting systematic, timely, user-centered research on consumer-facing websites at the National Cancer Institute (NCI) and the ongoing efforts at the National Institute of Standards and Technology (NIST) to promote health information technology (HIT) usability standards and evaluation criteria will also be presented.}, isbn = {0749-3797}, doi = {10.1016/j.amepre.2011.01.009}, url = {http://www.sciencedirect.com/science/article/pii/S0749379711000869}, author = {Goldberg,Larry and Lide,Bettijoyce and Lowry,Svetlana and Massett,Holly A. and O{\textquoteright}Connell,Trisha and Preece,Jennifer and Quesenbery,Whitney and Shneiderman, Ben} } @article {14379, title = {Using classifier cascades for scalable e-mail classification}, journal = {Collaboration, Electronic Messaging, Anti-Abuse and Spam Conference, ACM International Conference Proceedings Series}, year = {2011}, month = {2011///}, abstract = {In many real-world scenarios, we must make judgments in the presence of computational constraints. One common computational constraint arises when the features used to make a judgment each have differing acquisition costs, but there is a fixed total budget for a set of judgments. Par- ticularly when there are a large number of classifications that must be made in a real-time, an intelligent strategy for optimizing accuracy versus computational costs is essential. E-mail classification is an area where accurate and timely results require such a trade-off. We identify two scenarios where intelligent feature acquisition can improve classifier performance. In granular classification we seek to clas- sify e-mails with increasingly specific labels structured in a hierarchy, where each level of the hierarchy requires a differ- ent trade-off between cost and accuracy. In load-sensitive classification, we classify a set of instances within an ar- bitrary total budget for acquiring features. Our method, Adaptive Classifier Cascades (ACC), designs a policy to combine a series of base classifiers with increasing compu- tational costs given a desired trade-off between cost and ac- curacy. Using this method, we learn a relationship between feature costs and label hierarchies, for granular classification and cost budgets, for load-sensitive classification. We eval- uate our method on real-world e-mail datasets with realistic estimates of feature acquisition cost, and we demonstrate su- perior results when compared to baseline classifiers that do not have a granular, cost-sensitive feature acquisition policy.}, author = {Pujara,J. and Daum{\'e}, Hal and Getoor, Lise} } @article {14412, title = {Value of information lattice: exploiting probabilistic independence for effective feature subset acquisition}, journal = {Journal of Artificial Intelligence Research}, volume = {41}, year = {2011}, month = {2011/05//}, pages = {69 - 95}, abstract = {We address the cost-sensitive feature acquisition problem, where misclassifying an instance is costly but the expected misclassification cost can be reduced by acquiring the values of the missing features. Because acquiring the features is costly as well, the objective is to acquire the right set of features so that the sum of the feature acquisition cost and misclassification cost is minimized. We describe the Value of Information Lattice (VOILA), an optimal and eficient feature subset acquisition framework. Unlike the common practice, which is to acquire features greedily, VOILA can reason with subsets of features. VOILA eficiently searches the space of possible feature subsets by discovering and exploiting conditional independence properties between the features and it reuses probabilistic inference computations to further speed up the process. Through empirical evaluation on five medical datasets, we show that the greedy strategy is often reluctant to acquire features, as it cannot forecast the benefit of acquiring multiple features in combination.}, isbn = {1076-9757}, url = {http://dl.acm.org/citation.cfm?id=2051237.2051240}, author = {Bilgic,Mustafa and Getoor, Lise} } @conference {12445, title = {Variable remapping of images from very different sources}, booktitle = {2011 18th IEEE International Conference on Image Processing (ICIP)}, year = {2011}, month = {2011/09/11/14}, pages = {1501 - 1504}, publisher = {IEEE}, organization = {IEEE}, abstract = {We present a system which registers image sequences acquired by very different sources, so that multiple views could be transformed to the same coordinates system. This enables the functionality of automatic object identification and confirmation across views and platforms. The capability of the system comes from three ingredients: 1) image context enlargement through temporal integration; 2) robust motion estimation using the G-RANSAC framework with a relaxed correspondence criteria; 3) constrained motion estimation within the G-RANSAC framework. The proposed system has worked successfully on thousands of frames from multiple collections with significant variations in scale and resolution.}, keywords = {automatic object identification, Buildings, CAMERAS, Conferences, constrained motion estimation, coordinates system, Estimation, G-RANSAC framework, image context enlargement, Image Enhancement, image registration, image sequence registration, Image sequences, Motion estimation, Robustness, temporal integration, variable image remapping}, isbn = {978-1-4577-1304-0}, doi = {10.1109/ICIP.2011.6115729}, author = {Wei Zhang and Yanlin Guo and Meth, R. and Sokoloff, H. and Pope, A. and Strat, T. and Chellapa, Rama} } @article {17487, title = {Visual Exploration across Biomedical Databases}, journal = {IEEE/ACM Transactions on Computational Biology and Bioinformatics}, volume = {8}, year = {2011}, month = {2011/04//March}, pages = {536 - 550}, abstract = {Though biomedical research often draws on knowledge from a wide variety of fields, few visualization methods for biomedical data incorporate meaningful cross-database exploration. A new approach is offered for visualizing and exploring a query-based subset of multiple heterogeneous biomedical databases. Databases are modeled as an entity-relation graph containing nodes (database records) and links (relationships between records). Users specify a keyword search string to retrieve an initial set of nodes, and then explore intra- and interdatabase links. Results are visualized with user-defined semantic substrates to take advantage of the rich set of attributes usually present in biomedical data. Comments from domain experts indicate that this visualization method is potentially advantageous for biomedical knowledge exploration.}, keywords = {Bioinformatics, Biomedical computing, biomedical databases, cross-database exploration, Data exploration and discovery, Data visualization, database management systems, Databases, Factual, DNA, graph theory, Information Storage and Retrieval, information visualization., Keyword search, medical computing, natural language processing, Proteins, semantic networks, semantics, sequences, text mining, User-Computer Interface, user-defined semantics, visual databases}, isbn = {1545-5963}, doi = {10.1109/TCBB.2010.1}, author = {Lieberman,M.D. and Taheri, S. and Guo,Huimin and Mirrashed,F. and Yahav,I. and Aris,A. and Shneiderman, Ben} } @article {12862, title = {Warming Oceans, Phytoplankton, and River Discharge: Implications for Cholera Outbreaks}, journal = {The American Journal of Tropical Medicine and Hygiene}, volume = {85}, year = {2011}, month = {08/2011}, pages = {303 - 308}, abstract = {Phytoplankton abundance is inversely related to sea surface temperature (SST). However, a positive relationship is observed between SST and phytoplankton abundance in coastal waters of Bay of Bengal. This has led to an assertion that in a warming climate, rise in SST may increase phytoplankton blooms and, therefore, cholera outbreaks. Here, we explain why a positive SST-phytoplankton relationship exists in the Bay of Bengal and the implications of such a relationship on cholera dynamics. We found clear evidence of two independent physical drivers for phytoplankton abundance. The first one is the widely accepted phytoplankton blooming produced by the upwelling of cold, nutrient-rich deep ocean waters. The second, which explains the Bay of Bengal findings, is coastal phytoplankton blooming during high river discharges with terrestrial nutrients. Causal mechanisms should be understood when associating SST with phytoplankton and subsequent cholera outbreaks in regions where freshwater discharge are a predominant mechanism for phytoplankton production.}, isbn = {0002-9637,}, doi = {10.4269/ajtmh.2011.11-0181}, url = {http://www.ajtmh.org/content/85/2/303}, author = {Jutla,Antarpreet S. and Akanda,Ali S. and Griffiths,Jeffrey K. and Rita R Colwell and Islam,Shafiqul} } @conference {19464, title = {Why is My Internet Slow?: Making Network Speeds Visible}, booktitle = {SIGCHI {\textquoteright}11}, series = {CHI {\textquoteright}11}, year = {2011}, month = {2011///}, pages = {1889 - 1898}, publisher = {ACM}, organization = {ACM}, abstract = {With widespread broadband adoption, more households report experiencing sub-optimal speeds. Not only are slow speeds frustrating, they may indicate consumers are not receiving the services they are paying for from their internet service providers. Yet, determining the speed and source of slow-downs is difficult because few tools exist for broadband management. We report on results of a field trial with 10 households using a visual network probe designed to address these problems. We describe the results of the study and provide design implications for future tools. More importantly, we argue that tools like this can educate and empower consumers by making broadband speeds and sources of slow-downs more visible.}, keywords = {broadband speed, broadband tools, home networks}, isbn = {978-1-4503-0228-9}, url = {http://doi.acm.org/10.1145/1978942.1979217}, author = {Marshini Chetty and Haslem, David and Baird, Andrew and Ofoha, Ugochi and Sumner, Bethany and Grinter, Rebecca} } @article {14355, title = {Active inference for collective classification}, journal = {AAAI{\textquoteright}10}, year = {2010}, month = {2010///}, abstract = {Labeling nodes in a network is an important problem that has seen a growing interest. A number of methods that exploit both local and relational information have been developed for this task. Acquiring the labels for a few nodes at inference time can greatly improve the ac- curacy, however the question of figuring out which node labels to acquire is challenging. Previous approaches have been based on simple structural properties. Here, we present a novel technique, which we refer to as re- flect and correct, that can learn and predict when the un- derlying classification system is likely to make mistakes and it suggests acquisitions to correct those mistakes.}, author = {Bilgic,M. and Getoor, Lise} } @article {14396, title = {Active learning for networked data}, journal = {ICML{\textquoteright}10}, year = {2010}, month = {2010///}, abstract = {We introduce a novel active learning algo-rithm for classification of network data. In this setting, training instances are connected by a set of links to form a network, the labels of linked nodes are correlated, and the goal is to exploit these dependencies and accu- rately label the nodes. This problem arises in many domains, including social and biologi- cal network analysis and document classifica- tion, and there has been much recent interest in methods that collectively classify the nodes in the network. While in many cases labeled examples are expensive, often network infor- mation is available. We show how an active learning algorithm can take advantage of net- work structure. Our algorithm effectively ex- ploits the links between instances and the in- teraction between the local and collective as- pects of a classifier to improve the accuracy of learning from fewer labeled examples. We ex- periment with two real-world benchmark col- lective classification domains, and show that we are able to achieve extremely accurate re- sults even when only a small fraction of the data is labeled. }, author = {Bilgic,M. and Mihalkova,L. and Getoor, Lise} } @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} } @inbook {12504, title = {Articulation-Invariant Representation of Non-planar Shapes}, booktitle = {Computer Vision {\textendash} ECCV 2010Computer Vision {\textendash} ECCV 2010}, series = {Lecture Notes in Computer Science}, volume = {6313}, year = {2010}, month = {2010///}, pages = {286 - 299}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {Given a set of points corresponding to a 2D projection of a non-planar shape, we would like to obtain a representation invariant to articulations (under no self-occlusions). It is a challenging problem since we need to account for the changes in 2D shape due to 3D articulations, viewpoint variations, as well as the varying effects of imaging process on different regions of the shape due to its non-planarity. By modeling an articulating shape as a combination of approximate convex parts connected by non-convex junctions, we propose to preserve distances between a pair of points by (i) estimating the parts of the shape through approximate convex decomposition, by introducing a robust measure of convexity and (ii) performing part-wise affine normalization by assuming a weak perspective camera model, and then relating the points using the inner distance which is insensitive to planar articulations. We demonstrate the effectiveness of our representation on a dataset with non-planar articulations, and on standard shape retrieval datasets like MPEG-7.}, isbn = {978-3-642-15557-4}, url = {http://dx.doi.org/10.1007/978-3-642-15558-1_21}, author = {Gopalan,Raghuraman and Turaga,Pavan and Chellapa, Rama}, editor = {Daniilidis,Kostas and Maragos,Petros and Paragios,Nikos} } @article {13962, title = {Audio visual scene analysis using spherical arrays and cameras.}, journal = {The Journal of the Acoustical Society of America}, volume = {127}, year = {2010}, month = {2010///}, pages = {1979 - 1979}, abstract = {While audition and vision are used together by living beings to make sense of the world, the observation of the world using machines in applications such as surveillance and robotics has proceeded largely separately. We describe the use of spherical microphone arrays as {\textquotedblleft}audio cameras{\textquotedblright} and spherical array of video cameras as a tool to perform multi-modal scene analysis that attempts to answer questions such as {\textquotedblleft}Who?,{\textquotedblright}, {\textquotedblleft}What?,{\textquotedblright} {\textquotedblleft}Where?,{\textquotedblright} and {\textquotedblleft}Why?.{\textquotedblright} Signal processing algorithms to identify the number of people and their identities and to isolate and dereverberate their speech using multi-modal processing will be described. The use of graphics processor based signal processing allows for real-time implementation of these algorithms. [Work supported by ONR.]}, doi = {10.1121/1.3385079}, url = {http://link.aip.org/link/?JAS/127/1979/3}, author = {O{\textquoteright}donovan,Adam and Duraiswami, Ramani and Zotkin,Dmitry N and Gumerov, Nail A.} } @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.} } @conference {19284, title = {Automated generation of an efficient MPEG-4 Reconfigurable Video Coding decoder implementation}, booktitle = {2010 Conference on Design and Architectures for Signal and Image Processing (DASIP)}, year = {2010}, month = {2010}, pages = {265 - 272}, abstract = {This paper proposes an automatic design flow from user-friendly design to efficient implementation of video processing systems. This design flow starts with the use of coarse-grain dataflow representations based on the CAL language, which is a complete language for dataflow programming of embedded systems. Our approach integrates previously developed techniques for detecting synchronous dataflow (SDF) regions within larger CAL networks, and exploiting the static structure of such regions using analysis tools in The Dataflow interchange format Package (TDP). Using a new XML format that we have developed to exchange dataflow information between different dataflow tools, we explore systematic implementation of signal processing systems using CAL, SDF-like region detection, TDP-based static scheduling, and CAL-to-C (CAL2C) translation. Our approach, which is a novel integration of three complementary dataflow tools - the CAL parser, TDP, and CAL2C - is demonstrated on an MPEG Reconfigurable Video Coding (RVC) decoder.}, keywords = {automated generation, automatic design flow, CAL language, CAL networks, CAL-to-C translation, CAL2C translation, coarse-grain dataflow representations, Computational modeling, data flow computing, dataflow information, Dataflow programming, decoding, Digital signal processing, Libraries, MPEG-4 reconfigurable video coding decoder implementation, parallel languages, SDF detection, synchronous dataflow detection, TDP, TDP-based static scheduling, The Dataflow interchange format Package, Transform coding, user-friendly design, video coding, video processing systems, XML, XML format}, author = {Gu, Ruirui and Piat, J. and Raulet, M. and Janneck, J.W. and Bhattacharyya, Shuvra S.} } @conference {16682, title = {cdec: A decoder, alignment, and learning framework for finite-state and context-free translation models}, booktitle = {Proceedings of the ACL 2010 System Demonstrations}, year = {2010}, month = {2010///}, pages = {7 - 12}, author = {Dyer,C. and Weese,J. and Setiawan,H. and Lopez,A. and Ture,F. and Eidelman,V. and Ganitkevitch,J. and Blunsom,P. and Resnik, Philip} } @article {13964, title = {Characterizing scattering coefficients numerically via the fast multipole accelerated boundary element method.}, journal = {The Journal of the Acoustical Society of America}, volume = {127}, year = {2010}, month = {2010///}, pages = {1751 - 1751}, abstract = {Various panels are used in acoustical installations to provide desired characteristics to spaces to be used for listening. These panels have complex shapes with geometrical features that have sizes corresponding to wavelengths of sounds of interest. The complex interaction of acoustical waves with these shapes is what gives these surfaces their desirable properties. Experimental characterization of the acoustical properties of these surfaces under random and specular incidence is relatively time consuming. An alternate procedure is to numerically simulate the scattering behavior, and then computing the coefficients of interest from the simulation. A significant obstacle to such computations is the time taken for simulation. Fast multipole acceleration of boundary element methods [Gumerov \& Duraiswami, J. Acoust. Soc. Am. 125 (2009)] is a promising approach to speeding up computations. We report on the application of this method to the computation of various scattering coefficients.}, doi = {10.1121/1.3383664}, url = {http://link.aip.org/link/?JAS/127/1751/3}, author = {Gumerov, Nail A. and Duraiswami, Ramani} } @conference {13905, title = {Children{\textquoteright}s roles using keyword search interfaces at home}, booktitle = {Proceedings of the 28th international conference on Human factors in computing systems}, year = {2010}, month = {2010///}, pages = {413 - 422}, author = {Druin, Allison and Foss,E. and Hutchinson,H. and Golub,E. and Hatley,L.} } @conference {13937, title = {Clear Panels: a technique to design mobile application interactivity}, booktitle = {Proceedings of the 8th ACM Conference on Designing Interactive Systems}, year = {2010}, month = {2010///}, pages = {360 - 363}, author = {Brown,Q. and Bonsignore,E. and Hatley,L. and Druin, Allison and Walsh,G. and Foss,E. and Brewer,R. and Hammer,J. and Golub,E.} } @article {12870, title = {Comparative Genomics of Clinical and Environmental Vibrio Mimicus}, journal = {Proceedings of the National Academy of SciencesPNAS}, volume = {107}, year = {2010}, month = {2010/12/07/}, pages = {21134 - 21139}, abstract = {Whether Vibrio mimicus is a variant of Vibrio cholerae or a separate species has been the subject of taxonomic controversy. A genomic analysis was undertaken to resolve the issue. The genomes of V. mimicus MB451, a clinical isolate, and VM223, an environmental isolate, comprise ca. 4,347,971 and 4,313,453 bp and encode 3,802 and 3,290 ORFs, respectively. As in other vibrios, chromosome I (C-I) predominantly contains genes necessary for growth and viability, whereas chromosome II (C-II) bears genes for adaptation to environmental change. C-I harbors many virulence genes, including some not previously reported in V. mimicus, such as mannose-sensitive hemagglutinin (MSHA), and enterotoxigenic hemolysin (HlyA); C-II encodes a variant of Vibrio pathogenicity island 2 (VPI-2), and Vibrio seventh pandemic island II (VSP-II) cluster of genes. Extensive genomic rearrangement in C-II indicates it is a hot spot for evolution and genesis of speciation for the genus Vibrio. The number of virulence regions discovered in this study (VSP-II, MSHA, HlyA, type IV pilin, PilE, and integron integrase, IntI4) with no notable difference in potential virulence genes between clinical and environmental strains suggests these genes also may play a role in the environment and that pathogenic strains may arise in the environment. Significant genome synteny with prototypic pre-seventh pandemic strains of V. cholerae was observed, and the results of phylogenetic analysis support the hypothesis that, in the course of evolution, V. mimicus and V. cholerae diverged from a common ancestor with a prototypic sixth pandemic genomic backbone.}, isbn = {0027-8424, 1091-6490}, doi = {10.1073/pnas.1013825107}, url = {http://www.pnas.org/content/107/49/21134}, author = {Hasan,Nur A. and Grim,Christopher J. and Haley,Bradd J. and Jongsik Chun and Alam,Munirul and Taviani,Elisa and Mozammel Hoq and Munk,A. Christine and Rita R Colwell} } @article {14827, title = {Comparing and combining lighting insensitive approaches for face recognition}, journal = {Computer Vision and Image Understanding}, volume = {114}, year = {2010}, month = {2010/01//}, pages = {135 - 145}, abstract = {Face recognition under changing lighting conditions is a challenging problem in computer vision. In this paper, we analyze the relative strengths of different lighting insensitive representations, and propose efficient classifier combination schemes that result in better recognition rates. We consider two experimental settings, wherein we study the performance of different algorithms with (and without) prior information on the different illumination conditions present in the scene. In both settings, we focus on the problem of having just one exemplar per person in the gallery. Based on these observations, we design algorithms for integrating the individual classifiers to capture the significant aspects of each representation. We then illustrate the performance improvement obtained through our classifier combination algorithms on the illumination subset of the PIE dataset, and on the extended Yale-B dataset. Throughout, we consider galleries with both homogenous and heterogeneous lighting conditions.}, keywords = {Classifier comparison and combination, face recognition, Gradient direction, lighting}, isbn = {1077-3142}, doi = {10.1016/j.cviu.2009.07.005}, url = {http://www.sciencedirect.com/science/article/pii/S1077314209001210}, author = {Gopalan,Raghuraman and Jacobs, David W.} } @article {12467, title = {COMPRESSIVE SENSING SYSTEM AND METHOD FOR BEARING ESTIMATION OF SPARSE SOURCES IN THE ANGLE DOMAIN}, volume = {12/740,947}, year = {2010}, month = {2010/10/21/}, abstract = {Compressive Sensing (CS) is an emerging area which uses a relatively small number of non-traditional samples in the form of randomized projections to reconstruct sparse or com-pressible signals. Direction-of-arrival (DOA) estimation is performed with an array of sensors using CS. Using random projections of the sensor data, along with a full waveform recording on one reference sensor, a sparse angle space scenario can be reconstructed, giving the number of sources and their DOA{\textquoteright}s. Signal processing algorithms are also developed and described herein for randomly deployable wireless sensor arrays that are severely constrained in communication bandwidth. There is a focus on the acoustic bearing estimation problem and it is shown that when the target bearings are modeled as a sparse vector in the angle space, functions of the low dimensional random projections of the microphone signals can be used to determine multiple source bearings as a solution of an 1]-norm minimization problem.}, url = {http://www.google.com/patents?id=xDLYAAAAEBAJ}, author = {Cevher,Volkan and Gurbuz,Ali Cafer and McClellan,James H. and Chellapa, Rama} } @article {13963, title = {Computation of the head-related transfer function via the fast multipole accelerated boundary element method and its spherical harmonic representation}, journal = {The Journal of the Acoustical Society of America}, volume = {127}, year = {2010}, month = {2010///}, pages = {370 - 386}, abstract = {The head-related transfer function (HRTF) is computed using the fast multipole accelerated boundary element method. For efficiency, the HRTF is computed using the reciprocity principle by placing a source at the ear and computing its field. Analysis is presented to modify the boundary value problem accordingly. To compute the HRTF corresponding to different ranges via a single computation, a compact and accurate representation of the HRTF, termed the spherical spectrum, is developed. Computations are reduced to a two stage process, the computation of the spherical spectrum and a subsequent evaluation of the HRTF. This representation allows easy interpolation and range extrapolation of HRTFs. HRTF computations are performed for the range of audible frequencies up to 20 kHz for several models including a sphere, human head models [the Neumann KU-100 ({\textquotedblleft}Fritz{\textquotedblright}) and the Knowles KEMAR ({\textquotedblleft}Kemar{\textquotedblright}) manikins], and head-and-torso model (the Kemar manikin). Comparisons between the different cases are provided. Comparisons with the computational data of other authors and available experimental data are conducted and show satisfactory agreement for the frequencies for which reliable experimental data are available. Results show that, given a good mesh, it is feasible to compute the HRTF over the full audible range on a regular personal computer.}, keywords = {auditory evoked potentials, bioacoustics, boundary-elements methods, Ear, Harmonic analysis}, doi = {10.1121/1.3257598}, url = {http://link.aip.org/link/?JAS/127/370/1}, author = {Gumerov, Nail A. and O{\textquoteright}Donovan,Adam E. and Duraiswami, Ramani and Zotkin,Dmitry N} } @conference {18797, title = {A Computational Framework for Real-Time Unmanned Sea Surface Vehicle Motion Simulation}, volume = {3}, year = {2010}, month = {2010///}, pages = {51 - 61}, publisher = {ASME}, organization = {ASME}, address = {Montreal, Quebec, Canada}, abstract = {Unmanned Sea Surface Vehicle (USSV) motion simulation in time domain is an important component of USSV design and operation. This capability is needed for hull design, operator training, controller synthesis and testing. Many applications such as simulators for operator training require real-time performance. Traditional approaches based on strip theory, although fast, abstract hulls into slender bodies, making the simulation results insensitive to changes in geometry. Computational fluid dynamics (CFD) based approaches are accurate but very slow. Potential flow based approaches are sensitive to hull geometry and take lesser amount of time than CFD based approaches. The motion simulation using potential flow theory involves following four main operations: (1) computation of dynamic pressure head due to fluid flow around the hull under the ocean wave, (2) computation of wet surface, (3) computing surface integral of dynamic pressure head over wet surface, and (4) solving the rigid body dynamics equation. First three operations depend upon the boat geometry complexity and need to be performed at each time step, making the simulation run very slow. In this paper, we investigate the problem of model simplification for real-time simulation of USSV model in time domain using potential flow theory, with arbitrary geometry under ocean waves with inviscid and irrotational flow. Using clustering based simplification scheme and parallel computing we obtained real time simulation performance.}, isbn = {978-0-7918-4411-3}, doi = {10.1115/DETC2010-28526}, url = {http://link.aip.org/link/ASMECP/v2010/i44113/p51/s1\&Agg=doi}, author = {Thakur,Atul and Gupta, Satyandra K.} } @article {14371, title = {Computing marginal distributions over continuous markov networks for statistical relational learning}, journal = {Advances in Neural Information Processing Systems (NIPS)}, year = {2010}, month = {2010///}, abstract = {Continuous Markov random fields are a general formalism to model joint proba-bility distributions over events with continuous outcomes. We prove that marginal computation for constrained continuous MRFs is $\#$P-hard in general and present a polynomial-time approximation scheme under mild assumptions on the struc- ture of the random field. Moreover, we introduce a sampling algorithm to com- pute marginal distributions and develop novel techniques to increase its effi- ciency. Continuous MRFs are a general purpose probabilistic modeling tool and we demonstrate how they can be applied to statistical relational learning. On the problem of collective classification, we evaluate our algorithm and show that the standard deviation of marginals serves as a useful measure of confidence. }, author = {Br{\"o}cheler,M. and Getoor, Lise} } @article {13914, title = {Connecting generations: developing co-design methods for older adults and children}, journal = {Behaviour \& Information Technology}, volume = {99999}, year = {2010}, month = {2010///}, pages = {1 - 11}, author = {Xie,B. and Druin, Allison and Fails,J. and Massey,S. and Golub,E. and Franckel,S. and Schneider,K.} } @conference {14449, title = {Constructing folksonomies by integrating structured metadata}, booktitle = {Proceedings of the 19th international conference on World wide web}, series = {WWW {\textquoteright}10}, year = {2010}, month = {2010///}, pages = {1165 - 1166}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Aggregating many personal hierarchies into a common taxonomy, also known as a folksonomy, presents several challenges due to its sparseness, ambiguity, noise, and inconsistency. We describe an approach to folksonomy learning based on relational clustering that addresses these challenges by exploiting structured metadata contained in personal hierarchies. Our approach clusters similar hierarchies using their structure and tag statistics, then incrementally weaves them into a deeper, bushier tree. We study folksonomy learning using social metadata extracted from the photo-sharing site Flickr. We evaluate the learned folksonomy quantitatively by automatically comparing it to a reference taxonomy created by the Open Directory Project. Our empirical results suggest that the proposed approach improves upon the state-of-the-art folksonomy learning method.}, keywords = {collective knowledge, data mining, folksonomies}, isbn = {978-1-60558-799-8}, doi = {10.1145/1772690.1772856}, url = {http://doi.acm.org/10.1145/1772690.1772856}, author = {Plangprasopchok,Anon and Lerman,Kristina and Getoor, Lise} } @conference {14502, title = {Constructing Folksonomies by Integrating Structured Metadata with Relational Clustering}, booktitle = {Workshops at the Twenty-Fourth AAAI Conference on Artificial Intelligence}, year = {2010}, month = {2010///}, abstract = {Many social Web sites allow users to annotate the content with descriptive metadata, such as tags, and more recently also to organize content hierarchically. These types of struc- tured metadata provide valuable evidence for learning how a community organizes knowledge. For instance, we can ag- gregate many personal hierarchies into a common taxonomy, also known as a folksonomy, that will aid users in visual- izing and browsing social content, and also to help them in organizing their own content. However, learning from so- cial metadata presents several challenges: sparseness, ambi- guity, noise, and inconsistency. We describe an approach to folksonomy learning based on relational clustering that ad- dresses these challenges by exploiting structured metadata contained in personal hierarchies. Our approach clusters sim- ilar hierarchies using their structure and tag statistics, then incrementally weaves them into a deeper, bushier tree. We study folksonomy learning using social metadata extracted from the photo-sharing site Flickr. We evaluate the learned folksonomy quantitatively by automatically comparing it to a reference taxonomy. Our empirical results suggest that the proposed framework, which addresses the challenges listed above, improves on existing folksonomy learning methods.}, author = {Plangprasopchok,A. and Lerman,K. and Getoor, Lise} } @article {14509, title = {Context-Aware Query Recommendations}, volume = {12/408,726}, year = {2010}, month = {2010/09/23/}, abstract = {Described is a search-related technology in which context information regarding a user{\textquoteright}s prior search actions is used in making query recommendations for a current user action, such as a query or click. To determine whether each set or subset of context information is relevant to the user action, data obtained from a query log is evaluated. More particularly, a query transition (query-query) graph and a query click (query-URL) graph are extracted from the query log; vectors are computed for the current action and each context/sub-context and evaluated against vectors in the graphs to determine current action-to-context similarity. Also described is using similar context to provide the query recommendations, using parameters to control the similarity strictness, and/or whether more recent context information is more relevant than less recent context information, and using context information to distinguish between user sessions.}, url = {http://www.google.com/patents?id=nubWAAAAEBAJ}, author = {Ntoulas,Alexandros and Hwang,Heasoo and Getoor, Lise and Paparizos,Stelios and Lauw,Hady Wirawan}, editor = {Microsoft Corporation} } @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 {19445, title = {Deliberate Interactions: Characterizing Technology Use in Nairobi, Kenya}, booktitle = {SIGCHI {\textquoteright}10}, series = {CHI {\textquoteright}10}, year = {2010}, month = {2010///}, pages = {2593 - 2602}, publisher = {ACM}, organization = {ACM}, abstract = {We present results from a qualitative study examining how professionals living and working in Nairobi, Kenya regularly use ICT in their everyday lives. There are two contributions of this work for the HCI community. First, we provide empirical evidence demonstrating constraints our participants encountered when using technology in an infrastructure-poor setting. These constraints are limited bandwidth, high costs, differing perceptions of responsiveness, and threats to physical and virtual security. Second, we use our findings to critically evaluate the "access, anytime and anywhere" construct shaping the design of future technologies. We present an alternative vision called deliberate interactions--a planned and purposeful interaction style that involves offline preparation and discuss ways ICT can support this online usage behavior.}, keywords = {everyday technology, hci4d, Kenya, urban computing}, isbn = {978-1-60558-929-9}, url = {http://doi.acm.org/10.1145/1753326.1753719}, author = {Wyche, Susan P. and Smyth, Thomas N. and Marshini Chetty and Aoki, Paul M. and Grinter, Rebecca E.} } @conference {18826, title = {Design and Fabrication of a Multi-Material Compliant Flapping Wing Drive Mechanism for Miniature Air Vehicles}, year = {2010}, month = {2010///}, pages = {69 - 80}, publisher = {ASME}, organization = {ASME}, abstract = {Successful realization of a flapping wing micro air vehicle (MAV) requires development of a light weight drive mechanism converting the rotary motion of the motor into flapping motion of the wings. Low weight of the drive mechanism is required to maximize the payload and battery capacity. In order to make flapping wing MAVs attractive in search, rescue, and recovery missions, they should be disposable from the cost point of view. Injection molded compliant drive mechanisms are an attractive design option to satisfy the weight, efficiency and cost requirements. In the past, we have successfully used multi-piece molding to create mechanisms utilizing distributed compliance for smaller MAVs. However, as the size of the MAV increases, mechanisms with distributed compliance exhibit excessive deformation. Therefore localizing rather than distributing the compliance in the mechanism becomes a more attractive option. Local compliance can be realized through multimaterial designs. A multi-material injection molded mechanism additionally offers reduction in the number of parts. This paper describes an approach for determining the drive mechanism shape and size that meets both the functional design and multi-material molding requirements. The design generated by the approach described in this paper was utilized to realize a flapping wing MAV with significant enhancements in the payload capabilities.}, isbn = {978-0-7918-4410-6}, doi = {10.1115/DETC2010-28519}, url = {http://link.aip.org/link/ASMECP/v2010/i44106/p69/s1\&Agg=doi}, author = {Bejgerowski,Wojciech and Gerdes,John W. and Gupta, Satyandra K. and Bruck,Hugh A. and Wilkerson,Stephen} } @article {18828, title = {Developing a Stochastic Dynamic Programming Framework for Optical Tweezer-Based Automated Particle Transport Operations}, journal = {Automation Science and Engineering, IEEE Transactions on}, volume = {7}, year = {2010}, month = {2010/04//}, pages = {218 - 227}, abstract = {Automated particle transport using optical tweezers requires the use of motion planning to move the particle while avoiding collisions with randomly moving obstacles. This paper describes a stochastic dynamic programming based motion planning framework developed by modifying the discrete version of an infinite-horizon partially observable Markov decision process algorithm. Sample trajectories generated by this algorithm are presented to highlight effectiveness in crowded scenes and flexibility. The algorithm is tested using silica beads in a holographic tweezer set-up and data obtained from the physical experiments are reported to validate various aspects of the planning simulation framework. This framework is then used to evaluate the performance of the algorithm under a variety of operating conditions.}, keywords = {holographic tweezer set-up, holography, infinite-horizon partially observable Markov decision process algorithm, Markov processes, motion planning framework, optical tweezer-based automated particle transport operations, optical tweezers, radiation pressure, silica beads, stochastic dynamic programming framework, stochastic programming}, isbn = {1545-5955}, doi = {10.1109/TASE.2009.2026056}, author = {Banerjee,A. G. and Pomerance,A. and Losert,W. and Gupta,S.K.} } @article {18791, title = {Developing Autonomy for Unmanned Surface Vehicles by Using Virtual Environments}, year = {2010}, month = {2010///}, institution = {ENERGETICS TECHNOLOGY CENTER INC LA PLATA MD}, abstract = {We address the problem of automated synthesis of an action selection policy for an unmanned vehicle operating in an environment with a deceptive adversary. We introduce a new synthesis approach using which an initial version of the policy is automatically generated and then gradually refined by detecting and fixing its shortcomings. Our focus is specifically on automated synthesis of a policy used for blocking the advancement of an intruder boat toward a valuable target. The USV must generate specific maneuvers for blocking. The intruder is human competitive and exhibits a deceptive behavior so that the USV cannot exploit regularity in its attacking behavior. We compared the performance of a hand coded USVs blocking policy to the performance of a policy that was automatically synthesized. Our results show that the performance of the automatically generated USVs policy exceed the performance of the hand coded policy and thus demonstrates the feasibility of the proposed approach.}, url = {http://oai.dtic.mil/oai/oai?verb=getRecord\&metadataPrefix=html\&identifier=ADA535105}, author = {Kavetsky,R. and Gupta,S.K.} } @article {12874, title = {Discovery of novel Vibrio cholerae VSP-II genomic islands using comparative genomic analysis}, journal = {FEMS Microbiology Letters}, volume = {308}, year = {2010}, month = {2010/05/06/}, pages = {130 - 137}, abstract = {This report describes Vibrio seventh pandemic island II (VSP-II) and three novel variants revealed by comparative genomics of 23 Vibrio cholerae strains and their presence among a large and diverse collection of V. cholerae isolates. Three VSP-II variants were reported previously and our results demonstrate the presence of three novel VSP-II in clinical and environmental V. cholerae marked by major deletions and genetic rearrangements. A new VSP-II cluster was found in the seventh pandemic V. cholerae O1 El Tor strain CIRS101, which is dominant (95\%) among the recent (2004{\textendash}2007) seven pandemic V. cholerae O1 El Tor isolates from two endemic sites, but was not found in older strains from the same region. Two other variants were found in V. cholerae TMA21 and RC385, two environmental strains from coastal Brazil and the Chesapeake Bay, respectively, the latter being prevalent among environmental V. cholerae non-O1/non-O139 and Vibrio mimicus. The results of this study indicate that the VSP-II island has undergone significant rearrangement through a complex evolutionary pathway in V. cholerae. Interestingly, one of the new VSP-II revealed the presence of {\textquoteleft}old{\textquoteright} and {\textquoteleft}new{\textquoteright}V. cholerae O1 El Tor pandemic clones circulating in some of the areas where cholera is endemic.}, keywords = {Vibrio cholerae, Vibrio mimicus, VPS-II}, isbn = {1574-6968}, doi = {10.1111/j.1574-6968.2010.02008.x}, url = {http://onlinelibrary.wiley.com/doi/10.1111/j.1574-6968.2010.02008.x/full}, author = {Taviani,Elisa and Grim,Christopher J. and Choi,Jinna and Jongsik Chun and Haley,Bradd and Hasan,Nur A. and Huq,Anwar and Rita R Colwell} } @conference {12222, title = {The effect of packet loss on redundancy elimination in cellular wireless networks}, booktitle = {Proceedings of the 10th annual conference on Internet measurement}, series = {IMC {\textquoteright}10}, year = {2010}, month = {2010///}, pages = {294 - 300}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Network-level redundancy elimination (RE) algorithms reduce traffic volume on bandwidth-constrained network paths by avoiding the transmission of repeated byte sequences. Previous work shows that RE can suppress the transmission of 20-50\% bytes when deployed at ISP access links or between routers. In this paper, we focus on the challenges of deploying RE in cellular networks. The potential benefifit is substantial, since cellular networks have a growing subscriber base and network links, including wired backhaul, are often oversubscribed. Using three large traces captured at two North American and one European wireless network providers, we show that RE can reduce the bandwidth consumption of the majority of mobile users by at least 10\%. However, cellular links have much higher packet loss rates than their wired counterparts, which makes applying RE much more difficult. Our experiments also show that the loss of only a few packets can disrupt RE and eliminate the bandwidth savings. We propose informed marking, a lightweight scheme that detects lost packets and prevents RE algorithms from using them for future encodings. We implement RE with informed marking and deploy it in a real-world cellular network. Our results show that with informed marking, more than 60\% of the bandwidth savings of RE are preserved, even when packet loss rates are high.}, keywords = {cellular networks, loss, redundancy elimination}, isbn = {978-1-4503-0483-2}, doi = {10.1145/1879141.1879179}, url = {http://doi.acm.org/10.1145/1879141.1879179}, author = {Lumezanu,Cristian and Guo,Katherine and Spring, Neil and Bhattacharjee, Bobby} } @article {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} } @article {17152, title = {Exploring distributions: design and evaluation}, journal = {University of Maryland, Human-Computer Interaction Lab Tech Report HCIL-2010-01}, year = {2010}, month = {2010///}, abstract = {Visual overviews of tables of numerical and categorical data have been proposed for tables with a single value per cell.In this paper we address the problem of exploring tables including columns consisting of distributions, e.g. the distributions of movie ratings or trust ratings in recommender systems, age distributions in demographic data, usage distributions in logs of telephone calls etc. We propose a novel way of displaying and interacting with distribution data, and present the results of a usability study that demonstrates the benefits of the interface in providing an overview of the data and facilitating the discovery of interesting clusters, patterns, outliers and relationships between columns. }, author = {Sopan,A. and Freire,M. and Taieb-Maimon,M. and Golbeck,J. and Shneiderman, Ben} } @article {13960, title = {Fast matrix-vector product based fgmres for kernel machines}, journal = {Copper Mountain Conference on Iterative Methods}, volume = {2}, year = {2010}, month = {2010///}, abstract = {Kernel based approaches for machine learning have gained huge interest in the past decades because of their robustness. In somealgorithms, the primary problem is the solution of a linear system involving the kernel matrix. Iterative Krylov approaches are often used to solve these efficiently [2, 3]. Fast matrix-vector products can be used to accelerate each Krylov iteration to further optimize the performance. In order to reduce the number of iterations of the Krylov approach, a preconditioner becomes necessary in many cases. Several researchers have proposed flexible preconditioning methods where the preconditioner changes with each iteration, and this class of preconditioners are shown to have good performance [6, 12]. In this paper, we use a Tikhonov regularized kernel matrix as a preconditioner for flexible GMRES [12] to solve kernel matrix based systems of equations. We use a truncated conjugate gradient (CG) method to solve the preconditioner system and further accelerate each CG iteration using fast matrix-vector products. The convergence of the proposed preconditioned GMRES is shown on synthetic data. The performance is further validated on problems in Gaussian process regression and radial basis function interpolation. Improvements are seen in each case. }, author = {Srinivasan,B.V. and Duraiswami, Ramani and Gumerov, Nail A.} } @article {13965, title = {Fast radial basis function interpolation via preconditioned Krylov iteration}, journal = {SIAM Journal on Scientific Computing}, volume = {29}, year = {2010}, month = {2010///}, pages = {1876 - 1876}, abstract = {We consider a preconditioned Krylov subspace iterative algorithm presented by Faul,Goodsell, and Powell (IMA J. Numer. Anal. 25 (2005), pp. 1{\textendash}24) for computing the coefficients of a radial basis function interpolant over N data points. This preconditioned Krylov iteration has been demonstrated to be extremely robust to the distribution of the points and the iteration rapidly convergent. However, the iterative method has several steps whose computational and memory costs scale as O(N2), both in preliminary computations that compute the preconditioner and in the matrix-vector product involved in each step of the iteration. We effectively accelerate the iterative method to achieve an overall cost of O(N log N). The matrix vector product is accelerated via the use of the fast multipole method. The preconditioner requires the computation of a set of closest points to each point. We develop an O(N log N) algorithm for this step as well. Results are presented for multiquadric interpolation in R2 and biharmonic interpolation in R3. A novel FMM algorithm for the evaluation of sums involving multiquadric functions in R2 is presented as well. }, author = {Gumerov, Nail A. and Duraiswami, Ramani} } @article {16265, title = {Finishing genomes with limited resources: lessons from an ensemble of microbial genomes}, journal = {BMC Genomics}, volume = {11}, year = {2010}, month = {2010/04/16/}, pages = {242 - 242}, abstract = {While new sequencing technologies have ushered in an era where microbial genomes can be easily sequenced, the goal of routinely producing high-quality draft and finished genomes in a cost-effective fashion has still remained elusive. Due to shorter read lengths and limitations in library construction protocols, shotgun sequencing and assembly based on these technologies often results in fragmented assemblies. Correspondingly, while draft assemblies can be obtained in days, finishing can take many months and hence the time and effort can only be justified for high-priority genomes and in large sequencing centers. In this work, we revisit this issue in light of our own experience in producing finished and nearly-finished genomes for a range of microbial species in a small-lab setting. These genomes were finished with surprisingly little investments in terms of time, computational effort and lab work, suggesting that the increased access to sequencing might also eventually lead to a greater proportion of finished genomes from small labs and genomics cores.}, isbn = {1471-2164}, doi = {10.1186/1471-2164-11-242}, url = {http://www.biomedcentral.com/1471-2164/11/242}, author = {Nagarajan,Niranjan and Cook,Christopher and Di Bonaventura,Maria Pia and Ge,Hong and Richards,Allen and Bishop-Lilly,Kimberly A and DeSalle,Robert and Read,Timothy D. and Pop, Mihai} } @conference {14280, title = {From program verification to program synthesis}, booktitle = {ACM SIGPLAN Notices}, volume = {45}, year = {2010}, month = {2010///}, pages = {313 - 326}, author = {Srivastava,S. and Gulwani,S. and Foster, Jeffrey S.} } @inbook {19194, title = {GasSense: Appliance-Level, Single-Point Sensing of Gas Activity in the Home}, booktitle = {Pervasive Computing}, series = {Lecture Notes in Computer Science}, volume = {6030}, year = {2010}, month = {2010}, pages = {265 - 282}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {This paper presents GasSense, a low-cost, single-point sensing solution for automatically identifying gas use down to its source (e.g., water heater, furnace, fireplace). This work adds a complementary sensing solution to the growing body of work in infrastructure-mediated sensing. GasSense analyzes the acoustic response of a home{\textquoteright}s government mandated gas regulator, which provides the unique capability of sensing both the individual appliance at which gas is currently being consumed as well as an estimate of the amount of gas flow. Our approach provides a number of appealing features including the ability to be easily and safely installed without the need of a professional. We deployed our solution in nine different homes and initial results show that GasSense has an average accuracy of 95.2\% in identifying individual appliance usage.}, isbn = {978-3-642-12653-6}, url = {http://dx.doi.org/10.1007/978-3-642-12654-3_16}, author = {Cohn,Gabe and Gupta,Sidhant and Jon Froehlich and Larson,Eric and Patel,Shwetak}, editor = {Flor{\'e}en,Patrik and Kr{\"u}ger,Antonio and Spasojevic,Mirjana} } @article {12871, title = {Genome Sequence of Hybrid Vibrio Cholerae O1 MJ-1236, B-33, and CIRS101 and Comparative Genomics with V. Cholerae}, journal = {Journal of BacteriologyJ. Bacteriol.}, volume = {192}, year = {2010}, month = {2010/07/01/}, pages = {3524 - 3533}, abstract = {The genomes of Vibrio cholerae O1 Matlab variant MJ-1236, Mozambique O1 El Tor variant B33, and altered O1 El Tor CIRS101 were sequenced. All three strains were found to belong to the phylocore group 1 clade of V. cholerae, which includes the 7th-pandemic O1 El Tor and serogroup O139 isolates, despite displaying certain characteristics of the classical biotype. All three strains were found to harbor a hybrid variant of CTXΦ and an integrative conjugative element (ICE), leading to their establishment as successful clinical clones and the displacement of prototypical O1 El Tor. The absence of strain- and group-specific genomic islands, some of which appear to be prophages and phage-like elements, seems to be the most likely factor in the recent establishment of dominance of V. cholerae CIRS101 over the other two hybrid strains.}, isbn = {0021-9193, 1098-5530}, doi = {10.1128/JB.00040-10}, url = {http://jb.asm.org/content/192/13/3524}, author = {Grim,Christopher J. and Hasan,Nur A. and Taviani,Elisa and Haley,Bradd and Jongsik Chun and Brettin,Thomas S. and Bruce,David C. and Detter,J. Chris and Han,Cliff S. and Chertkov,Olga and Challacombe,Jean and Huq,Anwar and Nair,G. Balakrish and Rita R Colwell} } @conference {18218, title = {Gradient descent approach for secure localization in resource constrained wireless sensor networks}, booktitle = {Acoustics Speech and Signal Processing (ICASSP), 2010 IEEE International Conference on}, year = {2010}, month = {2010/03//}, pages = {1854 - 1857}, abstract = {Many sensor network related applications require precise knowledge of the location of constituent nodes. In these applications, it is desirable for the wireless nodes to be able to autonomously determine their locations before they start sensing and transmitting data. Most localization algorithms rely on anchor nodes whose locations are known to determine the positions of the remaining nodes. In an adversarial scenario, some of these anchor nodes could be compromised and used to transmit misleading information aimed at preventing the accurate localization of the remaining sensors. In this paper, a computationally efficient algorithm to determine the location of sensors that can resist such attacks is described. The proposed algorithm combines gradient descent with a selective pruning of inconsistent measurements to achieve good localization accuracy. Simulation results show that the proposed algorithm has performance comparable to existing schemes while requiring less computational resources.}, keywords = {algorithms;resource, approach;localization, computational, constrained, descent, localization;gradient, methods;wireless, networks;, networks;secure, resources;gradient, sensor, wireless}, doi = {10.1109/ICASSP.2010.5495371}, author = {Garg,R. and Varna,A.L. and M. Wu} } @article {14370, title = {Graph Identification}, journal = {Advances in Intelligent Data Analysis IX: 9th International Symposium}, year = {2010}, month = {2010///}, pages = {6 - 6}, abstract = {There is a growing amount of observational data describing networks{\textendash} examples include social networks, communication networks, and biological networks. As the amount of available data increases, so has our interest in analyzing these networks in order to uncover (1) general laws that govern their structure and evolution, and (2) patterns and predictive models to develop better policies and practices. However, a fundamental challenge in dealing with this newly available observational data describing networks is that the data is often of dubious quality{\textendash}it is noisy and incomplete{\textendash}and before any analysis method can be applied, the data must be cleaned, missing information inferred and mistakes corrected. Skipping this cleaning step can lead to flawed conclusions for things as simple as degree distribution and centrality measures; for more complex analytic queries, the results are even more likely to be inaccurate and misleading.}, doi = {10.1007/978-3-642-13062-5_2}, author = {Getoor, Lise} } @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 {14446, title = {Growing a tree in the forest: constructing folksonomies by integrating structured metadata}, booktitle = {Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining}, series = {KDD {\textquoteright}10}, year = {2010}, month = {2010///}, pages = {949 - 958}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Many social Web sites allow users to annotate the content with descriptive metadata, such as tags, and more recently to organize content hierarchically. These types of structured metadata provide valuable evidence for learning how a community organizes knowledge. For instance, we can aggregate many personal hierarchies into a common taxonomy, also known as a folksonomy, that will aid users in visualizing and browsing social content, and also to help them in organizing their own content. However, learning from social metadata presents several challenges, since it is sparse, shallow, ambiguous, noisy, and inconsistent. We describe an approach to folksonomy learning based on relational clustering, which exploits structured metadata contained in personal hierarchies. Our approach clusters similar hierarchies using their structure and tag statistics, then incrementally weaves them into a deeper, bushier tree. We study folksonomy learning using social metadata extracted from the photo-sharing site Flickr, and demonstrate that the proposed approach addresses the challenges. Moreover, comparing to previous work, the approach produces larger, more accurate folksonomies, and in addition, scales better.}, keywords = {collective knowledge, data mining, folksonomies, relational clustering, social information processing, social metadata, taxonomies}, isbn = {978-1-4503-0055-1}, doi = {10.1145/1835804.1835924}, url = {http://doi.acm.org/10.1145/1835804.1835924}, author = {Plangprasopchok,Anon and Lerman,Kristina and Getoor, Lise} } @article {14426, title = {Higher-order graphical models for classification in social and affiliation networks}, journal = {NIPS 2010 Workshop on Networks Across Disciplines: Theory and Applications, Whistler BC, Canada}, year = {2010}, month = {2010///}, abstract = {In this work we explore the application of higher-order Markov Random Fields(MRF) to classification in social and affiliation networks. We consider both friend- ship links and group membership for inferring hidden attributes in a collective inference framework. We explore different ways of using the social groups as ei- ther node features or to construct the graphical model structure. The bottleneck in applying higher-order MRFs to a domain with many overlapping large cliques is the complexity of inference which is exponential in the size of the largest clique. To circumvent the slow inference problem, we borrow recent advancements in the computer vision community to achieve fast approximate inference results. We provide preliminary results using a dataset from facebook which suggest that our higher-order MRF models are capturing the structural dependencies in the net- works and they yield higher accuracy than linear classifiers. }, author = {Zheleva,E. and Getoor, Lise and Sarawagi,S.} } @article {12875, title = {Identification of Pathogenic Vibrio Species by Multilocus PCR-Electrospray Ionization Mass Spectrometry and Its Application to Aquatic Environments of the Former Soviet Republic of Georgia}, journal = {Applied and Environmental MicrobiologyAppl. Environ. Microbiol.}, volume = {76}, year = {2010}, month = {2010/03/15/}, pages = {1996 - 2001}, abstract = {The Ibis T5000 is a novel diagnostic platform that couples PCR and mass spectrometry. In this study, we developed an assay that can identify all known pathogenic Vibrio species and field-tested it using natural water samples from both freshwater lakes and the Georgian coastal zone of the Black Sea. Of the 278 total water samples screened, 9 different Vibrio species were detected, 114 (41\%) samples were positive for V. cholerae, and 5 (0.8\%) samples were positive for the cholera toxin A gene (ctxA). All ctxA-positive samples were from two freshwater lakes, and no ctxA-positive samples from any of the Black Sea sites were detected.}, isbn = {0099-2240, 1098-5336}, doi = {10.1128/AEM.01919-09}, url = {http://aem.asm.org/content/76/6/1996}, author = {Whitehouse,Chris A. and Baldwin,Carson and Sampath,Rangarajan and Blyn,Lawrence B. and Melton,Rachael and Li,Feng and Hall,Thomas A. and Harpin,Vanessa and Matthews,Heather and Tediashvili,Marina and Jaiani,Ekaterina and Kokashvili,Tamar and Janelidze,Nino and Grim,Christopher and Rita R Colwell and Huq,Anwar} } @inbook {16274, title = {Identifying Differentially Abundant Metabolic Pathways in Metagenomic Datasets}, booktitle = {Bioinformatics Research and Applications}, series = {Lecture Notes in Computer Science}, volume = {6053}, year = {2010}, month = {2010///}, pages = {101 - 112}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {Enabled by rapid advances in sequencing technology, metagenomic studies aim to characterize entire communities of microbes bypassing the need for culturing individual bacterial members. One major goal of such studies is to identify specific functional adaptations of microbial communities to their habitats. Here we describe a powerful analytical method (MetaPath) that can identify differentially abundant pathways in metagenomic data-sets, relying on a combination of metagenomic sequence data and prior metabolic pathway knowledge. We show that MetaPath outperforms other common approaches when evaluated on simulated datasets. We also demonstrate the power of our methods in analyzing two, publicly available, metagenomic datasets: a comparison of the gut microbiome of obese and lean twins; and a comparison of the gut microbiome of infant and adult subjects. We demonstrate that the subpathways identified by our method provide valuable insights into the biological activities of the microbiome.}, isbn = {978-3-642-13077-9}, url = {http://dx.doi.org/10.1007/978-3-642-13078-6_12}, author = {Liu,Bo and Pop, Mihai}, editor = {Borodovsky,Mark and Gogarten,Johann and Przytycka,Teresa and Rajasekaran,Sanguthevar} } @article {14510, title = {Identifying Modifiers in Web Queries Over Structured Data}, volume = {12/473,286}, year = {2010}, month = {2010/12/02/}, abstract = {Described is using modifiers in online search queries for queries that map to a database table. A modifier (e.g., an adjective or a preposition) specifies the intended meaning of a target, in which the target maps to a column in that table. The modifier thus corresponds to one or more functions that determine which rows of data in the column match the query, e.g., {\textquotedblleft}cameras under $400{\textquotedblright} maps to a camera (or product) table, and {\textquotedblleft}under{\textquotedblright} is the modifier that represents a function (less than) that is used to evaluate a {\textquotedblleft}price{\textquotedblright} target/data column. Also described are different classes of modifiers, and generating the dictionaries for a domain (corresponding to a table) via query log mining.}, url = {http://www.google.com/patents?id=gQTkAAAAEBAJ}, author = {Paparizos,Stelios and Joshi,Amrula Sadanand and Getoor, Lise and Ntoulas,Alexandros}, editor = {Microsoft Corporation} } @conference {12429, title = {Image classification of vascular smooth muscle cells}, booktitle = {Proceedings of the 1st ACM International Health Informatics Symposium}, series = {IHI {\textquoteright}10}, year = {2010}, month = {2010///}, pages = {484 - 486}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, keywords = {cell biology, digital image processing, machine learning}, isbn = {978-1-4503-0030-8}, doi = {10.1145/1882992.1883068}, url = {http://doi.acm.org/10.1145/1882992.1883068}, author = {Grasso,Michael A. and Mokashi,Ronil and Dalvi,Darshana and Cardone, Antonio and Dima,Alden A. and Bhadriraju,Kiran and Plant,Anne L. and Brady,Mary and Yesha,Yaacov and Yesha,Yelena} } @article {14487, title = {On the importance of sharing negative results}, journal = {SIGKDD explorations}, volume = {12}, year = {2010}, month = {2010///}, pages = {3 - 4}, author = {Giraud-Carrier,C. and Dunham,M.H. and Atreya,A. and Elkan,C. and Perlich,C. and Swirszcz,G. and Shi,X. and Philip,S.Y. and F{\"u}rnkranz,J. and Sima,J.F.} } @article {14377, title = {Indirect two-sided relative ranking: a robust similarity measure for gene expression data}, journal = {BMC bioinformatics}, volume = {11}, year = {2010}, month = {2010///}, pages = {137 - 137}, abstract = {There is a large amount of gene expression data that exists in the public domain. This data has been generated under a variety of experimental conditions. Unfortunately, these experimental variations have generally prevented researchers from accurately comparing and combining this wealth of data, which still hides many novel insights. Results In this paper we present a new method, which we refer to as indirect two-sided relative ranking, for comparing gene expression profiles that is robust to variations in experimental conditions. This method extends the current best approach, which is based on comparing the correlations of the up and down regulated genes, by introducing a comparison based on the correlations in rankings across the entire database. Because our method is robust to experimental variations, it allows a greater variety of gene expression data to be combined, which, as we show, leads to richer scientific discoveries. Conclusions We demonstrate the benefit of our proposed indirect method on several datasets. We first evaluate the ability of the indirect method to retrieve compounds with similar therapeutic effects across known experimental barriers, namely vehicle and batch effects, on two independent datasets (one private and one public). We show that our indirect method is able to significantly improve upon the previous state-of-the-art method with a substantial improvement in recall at rank 10 of 97.03\% and 49.44\%, on each dataset, respectively. Next, we demonstrate that our indirect method results in improved accuracy for classification in several additional datasets. These datasets demonstrate the use of our indirect method for classifying cancer subtypes, predicting drug sensitivity/resistance, and classifying (related) cell types. Even in the absence of a known (i.e., labeled) experimental barrier, the improvement of the indirect method in each of these datasets is statistically significant.}, author = {Licamele,L. and Getoor, Lise} } @article {14401, title = {Integrating structured metadata with relational affinity propagation}, journal = {In proceedings of AAAI Workshop on Statistical Relational AI}, year = {2010}, month = {2010///}, abstract = {Structured and semi-structured data describing entities, tax- onomies and ontologies appears in many domains. There is a huge interest in integrating structured information from multiple sources; however integrating structured data to in- fer complex common structures is a difficult task because the integration must aggregate similar structures while avoiding structural inconsistencies that may appear when the data is combined. In this work, we study the integration of struc- tured social metadata: shallow personal hierarchies specified by many individual users on the Social Web, and focus on in- ferring a collection of integrated, consistent taxonomies. We frame this task as an optimization problem with structural constraints. We propose a new inference algorithm, which we refer to as Relational Affinity Propagation (RAP) that ex- tends affinity propagation (Frey and Dueck 2007) by intro- ducing structural constraints. We validate the approach on a real-world social media dataset, collected from the photoshar- ing website Flickr. Our empirical results show that our pro- posed approach is able to construct deeper and denser struc- tures compared to an approach using only the standard affin- ity propagation algorithm.}, author = {Plangprasopchok,A. and Lerman,K. and Getoor, Lise} } @article {13798, title = {Interlingual Annotation of Parallel Text Corpora: A New Framework for Annotation and Evaluation}, journal = {Natural Language Engineering}, volume = {16}, year = {2010}, month = {2010///}, pages = {197 - 243}, abstract = {This paper focuses on an important step in the creation of a system of meaning representation and the development of semantically annotated parallel corpora, for use in applications such as machine translation, question answering, text summarization, and information retrieval. The work described below constitutes the first effort of any kind to annotate multiple translations of foreign-language texts with interlingual content. Three levels of representation are introduced: deep syntactic dependencies (IL0), intermediate semantic representations (IL1), and a normalized representation that unifies conversives, nonliteral language, and paraphrase (IL2). The resulting annotated, multilingually induced, parallel corpora will be useful as an empirical basis for a wide range of research, including the development and evaluation of interlingual NLP systems and paraphrase-extraction systems as well as a host of other research and development efforts in theoretical and applied linguistics, foreign language pedagogy, translation studies, and other related disciplines.}, doi = {10.1017/S1351324910000070}, author = {Dorr, Bonnie J and Passonneau,Rebecca J. and Farwell,David and Green,Rebecca and Habash,Nizar and Helmreich,Stephen and Hovy,Eduard and Levin,Lori and Miller,Keith J. and Mitamura,Teruko and Rambow,Owen and Siddharthan,Advaith} } @conference {13932, title = {Investigating the impact of design processes on children}, booktitle = {Proceedings of the 9th International Conference on Interaction Design and Children}, year = {2010}, month = {2010///}, pages = {198 - 201}, author = {Guha,M.L. and Druin, Allison and Fails,J. A} } @article {14421, title = {Learning algorithms for link prediction based on chance constraints}, journal = {Machine Learning and Knowledge Discovery in Databases}, year = {2010}, month = {2010///}, pages = {344 - 360}, abstract = {In this paper, we consider the link prediction problem, where we are given a partial snapshot of a network at some time and the goal is to predict the additional links formed at a later time. The accuracy of current prediction methods is quite low due to the extreme class skew and the large number of potential links. Here, we describe learning algorithms based on chance constrained programs and show that they exhibit all the properties needed for a good link predictor, namely, they allow preferential bias to positive or negative class; handle skewness in the data; and scale to large networks. Our experimental results on three real-world domains{\textemdash}co-authorship networks, biological networks and citation networks{\textemdash}show significant performance improvement over baseline algorithms. We conclude by briefly describing some promising future directions based on this work.}, doi = {10.1007/978-3-642-15880-3_28}, author = {Doppa,J. and Yu,J. and Tadepalli,P. and Getoor, Lise} } @article {12493, title = {A Learning Approach Towards Detection and Tracking of Lane Markings}, journal = {IEEE Transactions on Intelligent Transportation Systems}, volume = {PP}, year = {2010}, month = {2010/02/17/}, pages = {1 - 12}, abstract = {Road scene analysis is a challenging problem that has applications in autonomous navigation of vehicles. An integral component of this system is the robust detection and tracking of lane markings. It is a hard problem primarily due to large appearance variations in lane markings caused by factors such as occlusion (traffic on the road), shadows (from objects like trees), and changing lighting conditions of the scene (transition from day to night). In this paper, we address these issues through a learning-based approach using visual inputs from a camera mounted in front of a vehicle. We propose the following: 1) a pixel-hierarchy feature descriptor to model the contextual information shared by lane markings with the surrounding road region; 2) a robust boosting algorithm to select relevant contextual features for detecting lane markings; and 3) particle filters to track the lane markings, without knowledge of vehicle speed, by assuming the lane markings to be static through the video sequence and then learning the possible road scene variations from the statistics of tracked model parameters. We investigate the effectiveness of our algorithm on challenging daylight and night-time road video sequences.}, keywords = {Boosting, Context, Context modeling, Feature extraction, lane marking detection, outlier robustness, Roads, tracking and learning, Training, Vehicles}, isbn = {1524-9050}, doi = {10.1109/TITS.2012.2184756}, author = {Gopalan,R. and Hong, T. and Shneier, M. and Chellapa, Rama} } @article {13092, title = {Learning what and how of contextual models for scene labeling}, journal = {Computer Vision{\textendash}ECCV 2010}, year = {2010}, month = {2010///}, pages = {199 - 212}, abstract = {We present a data-driven approach to predict the importance of edges and construct a Markov network for image analysis based on statistical models of global and local image features. We also address the coupled problem of predicting the feature weights associated with each edge of a Markov network for evaluation of context. Experimental results indicate that this scene dependent structure construction model eliminates spurious edges and improves performance over fully-connected and neighborhood connected Markov network.}, author = {Jain, A. and Gupta,A. and Davis, Larry S.} } @article {13954, title = {Loudspeaker and Microphone Array Signal Processing-Plane-Wave Decomposition of Acoustical Scenes Via Spherical and Cylindrical Microphone Arrays}, journal = {IEEE transactions on audio, speech, and language processing}, volume = {20}, year = {2010}, month = {2010///}, pages = {2 - 2}, author = {Zotkin,Dmitry N and Duraiswami, Ramani and Gumerov, Nail A.} } @article {17621, title = {LP-rounding algorithms for facility-location problems}, journal = {arXiv:1007.3611}, year = {2010}, month = {2010/07/21/}, abstract = {We study LP-rounding approximation algorithms for metric uncapacitated facility-location problems. We first give a new analysis for the algorithm of Chudak and Shmoys, which differs from the analysis of Byrka and Aardal in that now we do not need any bound based on the solution to the dual LP program. Besides obtaining the optimal bifactor approximation as do Byrka and Aardal, we can now also show that the algorithm with scaling parameter equaling 1.58 is, in fact, an 1.58-approximation algorithm. More importantly, we suggest an approach based on additional randomization and analyses such as ours, which could achieve or approach the conjectured optimal 1.46...--approximation for this basic problem. Next, using essentially the same techniques, we obtain improved approximation algorithms in the 2-stage stochastic variant of the problem, where we must open a subset of facilities having only stochastic information about the future demand from the clients. For this problem we obtain a 2.2975-approximation algorithm in the standard setting, and a 2.4957-approximation in the more restricted, per-scenario setting. We then study robust fault-tolerant facility location, introduced by Chechik and Peleg: solutions here are designed to provide low connection cost in case of failure of up to $k$ facilities. Chechik and Peleg gave a 6.5-approximation algorithm for $k=1$ and a ($7.5k + 1.5$)-approximation algorithm for general $k$. We improve this to an LP-rounding $(k+5+4/k)$-approximation algorithm. We also observe that in case of oblivious failures the expected approximation ratio can be reduced to $k + 1.5$, and that the integrality gap of the natural LP-relaxation of the problem is at least $k + 1$.}, keywords = {Computer Science - Data Structures and Algorithms}, url = {http://arxiv.org/abs/1007.3611}, author = {Byrka,Jaroslaw and Ghodsi,Mohammadreza and Srinivasan, Aravind} } @conference {16055, title = {ManyNets: an interface for multiple network analysis and visualization}, booktitle = {Proceedings of the 28th international conference on Human factors in computing systems}, series = {CHI {\textquoteright}10}, year = {2010}, month = {2010///}, pages = {213 - 222}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Traditional network analysis tools support analysts in studying a single network. ManyNets offers these analysts a powerful new approach that enables them to work on multiple networks simultaneously. Several thousand networks can be presented as rows in a tabular visualization, and then inspected, sorted and filtered according to their attributes. The networks to be displayed can be obtained by subdivision of larger networks. Examples of meaningful subdivisions used by analysts include ego networks, community extraction, and time-based slices. Cell visualizations and interactive column overviews allow analysts to assess the distribution of attributes within particular sets of networks. Details, such as traditional node-link diagrams, are available on demand. We describe a case study analyzing a social network geared towards film recommendations by means of decomposition. A small usability study provides feedback on the use of the interface on a set of tasks issued from the case study.}, keywords = {exploratory analysis, graphical user interface, Information Visualization, interaction, network analysis, table interface}, isbn = {978-1-60558-929-9}, doi = {10.1145/1753326.1753358}, url = {http://doi.acm.org/10.1145/1753326.1753358}, author = {Freire,Manuel and Plaisant, Catherine and Shneiderman, Ben and Golbeck,Jen} } @conference {12223, title = {Maranello: practical partial packet recovery for 802.11}, booktitle = {Proceedings of the 7th USENIX conference on Networked systems design and implementation}, series = {NSDI{\textquoteright}10}, year = {2010}, month = {2010///}, pages = {14 - 14}, publisher = {USENIX Association}, organization = {USENIX Association}, address = {Berkeley, CA, USA}, abstract = {Partial packet recovery protocols attempt to repair corrupted packets instead of retransmitting them in their entirety. Recent approaches have used physical layer confidence estimates or additional error detection codes embedded in each transmission to identify corrupt bits, or have applied forward error correction to repair without such explicit knowledge. In contrast to these approaches, our goal is a practical design that simultaneously: (a) requires no extra bits in correct packets, (b) reduces recovery latency, except in rare instances, (c) remains compatible with existing 802.11 devices by obeying timing and backoff standards, and (d) can be incrementally deployed on widely available access points and wireless cards. In this paper, we design, implement, and evaluate Maranello, a novel partial packet recovery mechanism for 802.11. In Maranello, the receiver computes checksums over blocks in corrupt packets and bundles these checksums into a negative acknowledgment sent when the sender expects to receive an acknowledgment. The sender then retransmits only those blocks for which the checksum is incorrect, and repeats this partial retransmission until it receives an acknowledgment. Successful transmissions are not burdened by additional bits and the receiver needs not infer which bits were corrupted. We implemented Maranello using OpenFWWF (open source firmware for Broadcom wireless cards) and deployed it in a small testbed. We compare Maranello to alternative recovery protocols using a trace-driven simulation and to 802.11 using a live implementation under various channel conditions. To our knowledge, Maranello is the first partial packet recovery design to be implemented in commonly available firmware.}, url = {http://dl.acm.org/citation.cfm?id=1855711.1855725}, author = {Han,Bo and Schulman,Aaron and Gringoli,Francesco and Spring, Neil and Bhattacharjee, Bobby and Nava,Lorenzo and Ji,Lusheng and Lee,Seungjoon and Miller,Robert} } @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 {16278, title = {MetaPhyler: Taxonomic profiling for metagenomic sequences}, booktitle = {2010 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)}, year = {2010}, month = {2010/12/18/21}, pages = {95 - 100}, publisher = {IEEE}, organization = {IEEE}, abstract = {A major goal of metagenomics is to characterize the microbial diversity of an environment. The most popular approach relies on 16S rRNA sequencing, however this approach can generate biased estimates due to differences in the copy number of the 16S rRNA gene between even closely related organisms, and due to PCR artifacts. The taxonomic composition can also be determined from whole-metagenome sequencing data by matching individual sequences against a database of reference genes. One major limitation of prior methods used for this purpose is the use of a universal classification threshold for all genes at all taxonomic levels. We propose that better classification results can be obtained by tuning the taxonomic classifier to each matching length, reference gene, and taxonomic level. We present a novel taxonomic profiler MetaPhyler, which uses marker genes as a taxonomic reference. Results on simulated datasets demonstrate that MetaPhyler outperforms other tools commonly used in this context (CARMA, Megan and PhymmBL). We also present interesting results obtained by applying MetaPhyler to a real metagenomic dataset.}, keywords = {Bioinformatics, CARMA comparison, Databases, Genomics, Linear regression, marker genes, matching length, Megan comparison, metagenomic sequences, metagenomics, MetaPhyler, microbial diversity, microorganisms, molecular biophysics, molecular configurations, Pattern classification, pattern matching, phylogenetic classification, Phylogeny, PhymmBL comparison, reference gene database, Sensitivity, sequence matching, taxonomic classifier, taxonomic level, taxonomic profiling, whole metagenome sequencing data}, isbn = {978-1-4244-8306-8}, doi = {10.1109/BIBM.2010.5706544}, author = {Liu,Bo and Gibbons,T. and Ghodsi,M. and Pop, Mihai} } @article {18238, title = {Method for concealing data in curves of an image}, volume = {:~11/221,727}, year = {2010}, month = {2010/10/19/}, abstract = {A method of concealing data in images imperceptibly alters curves therein, such as through adding a value representing the data to be hidden to each of a number of B-spline control points representing the original curve. The altered control points characterize the imperceptibly altered curve, which replaces the original curve in the image. The altered control points may be later extracted from the image and compared with the original control points to determine the hidden value. Prudent selection of the values altering the control points as well as an iterative alignment-minimization algorithm in the detection process provides protection against numerous techniques for preventing the hidden values from being recovered.}, url = {http://www.google.com/patents?id=USnYAAAAEBAJ}, author = {M. Wu and Gou,Hongmei}, editor = {University of Maryland} } @article {13951, title = {Method for measurement of head related transfer functions}, volume = {10/702,465}, year = {2010}, month = {2010/05/18/}, abstract = {Head Related Transfer Functions (HRTFs) of an individual are measured in rapid fashion in an arrangement where a sound source is positioned in the individual{\textquoteright}s ear channel, while microphones are arranged in the microphone array enveloping the individual{\textquoteright}s head. The pressure waves generated by the sounds emanating from the sound source reach the microphones and are converted into corresponding electrical signals which are further processed in a processing system to extract HRTFs, which may then be used to synthesize a spatial audio scene. The acoustic field generated by the sounds from the sound source can be evaluated at any desired point inside or outside the microphone array.}, url = {http://www.google.com/patents?id=JHrQAAAAEBAJ}, author = {Duraiswami, Ramani and Gumerov, Nail A.}, editor = {University of Maryland} } @conference {19286, title = {Methods for efficient implementation of Model Predictive Control on multiprocessor systems}, booktitle = {2010 IEEE International Conference on Control Applications (CCA)}, year = {2010}, month = {2010}, pages = {1357 - 1362}, abstract = {Model Predictive Control (MPC) has been used in a wide range of application areas including chemical engineering, food processing, automotive engineering, aerospace, and metallurgy. An important limitation on the application of MPC is the difficulty in completing the necessary computations within the sampling interval. Recent trends in computing hardware towards greatly increased parallelism offer a solution to this problem. This paper describes modeling and analysis tools to facilitate implementing the MPC algorithms on parallel computers, thereby greatly reducing the time needed to complete the calculations. The use of these tools is illustrated by an application to a class of MPC problems.}, keywords = {Computational modeling, COMPUTERS, Equations, Hardware, Linear systems, Mathematical model, model predictive control, MPC algorithms, Multiprocessing systems, Multiprocessor systems, parallel computers, predictive control, Program processors}, author = {Gu, Ruirui and Bhattacharyya, Shuvra S. and Levine,W. S} } @conference {13896, title = {Mobile collaboration: collaboratively reading and creating children{\textquoteright}s stories on mobile devices}, booktitle = {Proceedings of the 9th International Conference on Interaction Design and Children}, year = {2010}, month = {2010///}, pages = {20 - 29}, author = {Fails,J. A and Druin, Allison and Guha,M.L.} } @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} } @article {14513, title = {Object Classification Using Taxonomies}, volume = {12/414,065}, year = {2010}, month = {2010/07/22/}, abstract = {As provided herein objects from a source catalog, such as a provider{\textquoteright}s catalog, can be added to a target catalog, such as an enterprise master catalog, in a scalable manner utilizing catalog taxonomies. A baseline classifier determines probabilities for source objects to target catalog classes. Source objects can be assigned to those classes with probabilities that meet a desired threshold and meet a desired rate. A classification cost for target classes can be determined for respective unassigned source objects, which can comprise determining an assignment cost and separation cost for the source objects for respective desired target classes. The separation and assignment costs can be combined to determine the classification cost, and the unassigned source objects can be assigned to those classes having a desired classification cost.}, url = {http://www.google.com/patents?id=oXDSAAAAEBAJ}, author = {Tsaparas,Panayiotis and Papadimitriou,Panagiotis and Fuxman,Ariel D. and Getoor, Lise and Agrawal,Rakesh}, editor = {Microsoft Corporation} } @article {12879, title = {Occurrence of the Vibrio cholerae seventh pandemic VSP-I island and a new variant}, journal = {OMICS: A Journal of Integrative Biology}, volume = {14}, year = {2010}, month = {2010/02//}, pages = {1 - 7}, isbn = {1536-2310, 1557-8100}, doi = {10.1089/omi.2009.0087}, url = {http://online.liebertpub.com/doi/abs/10.1089/omi.2009.0087}, author = {Grim,Christopher J. and Choi,Jinna and Jongsik Chun and Jeon,Yoon-Seong and Taviani,Elisa and Hasan,Nur A. and Haley,Bradd and Huq,Anwar and Rita R Colwell} } @conference {19023, title = {One experience collecting sensitive mobile data}, year = {2010}, month = {2010}, abstract = {We report on our efforts to collect behavioral data basedon activities recorded by phones. We recruited Android de- vice owners and offered entry into a raffle for participants. Our application was distributed from the Android Market, and its placement there unexpectedly helped us find par- ticipants from casual users browsing for free applications. We collected data from 267 total participants who gave us varying amounts of data. }, url = {http://www2.parc.com/csl/members/eshi/docs/users.pdf}, author = {Niu, Y. and Elaine Shi and Chow, R. and Golle, P. and Jakobsson, M.} } @article {16600, title = {Parsimonious rule generation for a nature-inspired approach to self-assembly}, journal = {ACM Transactions on Autonomous and Adaptive Systems (TAAS)}, volume = {5}, year = {2010}, month = {2010///}, pages = {1 - 24}, author = {Grushin,A. and Reggia, James 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 {18457, title = {Plane-Wave Decomposition of Acoustical Scenes Via Spherical and Cylindrical Microphone Arrays}, journal = {IEEE Transactions on Audio, Speech, and Language Processing}, volume = {18}, year = {2010}, month = {2010/01//}, pages = {2 - 16}, abstract = {Spherical and cylindrical microphone arrays offer a number of attractive properties such as direction-independent acoustic behavior and ability to reconstruct the sound field in the vicinity of the array. Beamforming and scene analysis for such arrays is typically done using sound field representation in terms of orthogonal basis functions (spherical/cylindrical harmonics). In this paper, an alternative sound field representation in terms of plane waves is described, and a method for estimating it directly from measurements at microphones is proposed. It is shown that representing a field as a collection of plane waves arriving from various directions simplifies source localization, beamforming, and spatial audio playback. A comparison of the new method with the well-known spherical harmonics based beamforming algorithm is done, and it is shown that both algorithms can be expressed in the same framework but with weights computed differently. It is also shown that the proposed method can be extended to cylindrical arrays. A number of features important for the design and operation of spherical microphone arrays in real applications are revealed. Results indicate that it is possible to reconstruct the sound scene up to order p with p2 microphones spherical array.}, keywords = {Acoustic fields, acoustic position measurement, acoustic signal processing, acoustic waves, acoustical scene analysis, array signal processing, circular arrays, cylindrical microphone arrays, direction-independent acoustic behavior, microphone arrays, orthogonal basis functions, plane-wave decomposition, Position measurement, signal reconstruction, sound field reconstruction, sound field representation, source localization, spatial audio playback, spherical harmonics based beamforming algorithm, spherical microphone arrays}, isbn = {1558-7916}, doi = {10.1109/TASL.2009.2022000}, author = {Zotkin,Dmitry N and Duraiswami, Ramani and Gumerov, Nail A.} } @article {12877, title = {The pre-seventh pandemic Vibrio cholerae BX 330286 El Tor genome: evidence for the environment as a genome reservoir}, journal = {Environmental Microbiology Reports}, volume = {2}, year = {2010}, month = {2010/02/01/}, pages = {208 - 216}, abstract = {Vibrio cholerae O1 El Tor BX 330286 was isolated from a water sample in Australia in 1986, 9 years after an indigenous outbreak of cholera occurred in that region. This environmental strain encodes virulence factors highly similar to those of clinical strains, suggesting an ability to cause disease in humans. We demonstrate its high similarity in gene content and genome-wide nucleotide sequence to clinical V. cholerae strains, notably to pre-seventh pandemic O1 El Tor strains isolated in 1910 (V. cholerae NCTC 8457) and 1937 (V. cholerae MAK 757), as well as seventh pandemic strains isolated after 1960 globally. Here we demonstrate that this strain represents a transitory clone with shared characteristics between pre-seventh and seventh pandemic strains of V. cholerae. Interestingly, this strain was isolated 25 years after the beginning of the seventh pandemic, suggesting the environment as a genome reservoir in areas where cholera does not occur in sporadic, endemic or epidemic form.}, isbn = {1758-2229}, doi = {10.1111/j.1758-2229.2010.00141.x}, url = {http://onlinelibrary.wiley.com/doi/10.1111/j.1758-2229.2010.00141.x/abstract?userIsAuthenticated=false\&deniedAccessCustomisedMessage=}, author = {Haley,Bradd J. and Grim,Christopher J. and Hasan,Nur A. and Taviani,Elisa and Jongsik Chun and Brettin,Thomas S. and Bruce,David C. and Challacombe,Jean F. and Detter,J. Chris and Han,Cliff S. and Huq,Anwar and Nair,G. Balakrish and Rita R Colwell} } @article {14466, title = {Probabilistic similarity logic}, journal = {Proceedings of the Conference on Uncertainty in Artificial Intelligence}, year = {2010}, month = {2010///}, abstract = {Many machine learning applications require theability to learn from and reason about noisy multi-relational data. To address this, several ef- fective representations have been developed that provide both a language for expressing the struc- tural regularities of a domain, and principled sup- port for probabilistic inference. In addition to these two aspects, however, many applications also involve a third aspect{\textendash}the need to reason about similarities{\textendash}which has not been directly supported in existing frameworks. This paper introduces probabilistic similarity logic (PSL), a general-purpose framework for joint reason- ing about similarity in relational domains that incorporates probabilistic reasoning about sim- ilarities and relational structure in a principled way. PSL can integrate any existing domain- specific similarity measures and also supports reasoning about similarities between sets of en- tities. We provide efficient inference and learn- ing techniques for PSL and demonstrate its ef- fectiveness both in common relational tasks and in settings that require reasoning about similarity. }, author = {Br{\"o}cheler,M. and Mihalkova,L. and Getoor, Lise} } @article {13399, title = {Read-once functions and query evaluation in probabilistic databases}, journal = {Proc. VLDB Endow.}, volume = {3}, year = {2010}, month = {2010/09//}, pages = {1068 - 1079}, abstract = {Probabilistic databases hold promise of being a viable means for large-scale uncertainty management, increasingly needed in a number of real world applications domains. However, query evaluation in probabilistic databases remains a computational challenge. Prior work on efficient exact query evaluation in probabilistic databases has largely concentrated on query-centric formulations (e.g., safe plans, hierarchical queries), in that, they only consider characteristics of the query and not the data in the database. It is easy to construct examples where a supposedly hard query run on an appropriate database gives rise to a tractable query evaluation problem. In this paper, we develop efficient query evaluation techniques that leverage characteristics of both the query and the data in the database. We focus on tuple-independent databases where the query evaluation problem is equivalent to computing marginal probabilities of Boolean formulas associated with the result tuples. This latter task is easy if the Boolean formulas can be factorized into a form that has every variable appearing at most once (called read-once). However, a naive approach that directly uses previously developed Boolean formula factorization algorithms is inefficient, because those algorithms require the input formulas to be in the disjunctive normal form (DNF). We instead develop novel, more efficient factorization algorithms that directly construct the read-once expression for a result tuple Boolean formula (if one exists), for a large subclass of queries (specifically, conjunctive queries without self-joins). We empirically demonstrate that (1) our proposed techniques are orders of magnitude faster than generic inference algorithms for queries where the result Boolean formulas can be factorized into read-once expressions, and (2) for the special case of hierarchical queries, they rival the efficiency of prior techniques specifically designed to handle such queries.}, isbn = {2150-8097}, url = {http://dl.acm.org/citation.cfm?id=1920841.1920975}, author = {Sen,Prithviraj and Deshpande, Amol and Getoor, Lise} } @article {14373, title = {REPORTS AI Theory and Practice: A Discussion on Hard Challenges and Opportunities Ahead}, journal = {AI Magazine}, volume = {31}, year = {2010}, month = {2010///}, pages = {87 - 87}, author = {Horvitz,E. and Getoor, Lise and Guestrin,C. and Hendler,J. and Kautz,H. and Konstan,J. and Subramanian,D. and Wellman,M.} } @conference {18803, title = {A Review of Bird-Inspired Flapping Wing Miniature Air Vehicle Designs}, volume = {2}, year = {2010}, month = {2010///}, pages = {57 - 67}, publisher = {ASME}, organization = {ASME}, address = {Montreal, Quebec, Canada}, abstract = {Physical and aerodynamic characteristics of the bird in flight may offer benefits over typical propeller or rotor driven miniature air vehicle (MAV) locomotion designs in certain types of scenarios. A number of research groups and companies have developed flapping wing vehicles that attempt to harness these benefits. The purpose of this paper is to report different types of flapping wing designs and compare their salient characteristics. For each category, advantages and disadvantages will be discussed. The discussion presented will be limited to miniature-sized flapping wing air vehicles, defined as 10{\textendash}100 grams total weight. The discussion will be focused primarily on ornithopters which have performed at least one successful test flight. Additionally, this paper is intended to provide a representation of the field of current technology, rather than providing a comprehensive listing of all possible designs. This paper will familiarize a newcomer to the field with existing designs and their distinguishing features. By studying existing designs, future designers will be able to adopt features from other successful designs. This paper also summarizes the design challenges associated with the further advancement of the field and deploying flapping wing vehicles in practice.}, isbn = {978-0-7918-4410-6}, doi = {10.1115/DETC2010-28513}, url = {http://link.aip.org/link/ASMECP/v2010/i44106/p57/s1\&Agg=doi}, author = {Gerdes,John W. and Gupta, Satyandra K. and Wilkerson,Stephen A.} } @article {13088, title = {A robust and scalable approach to face identification}, journal = {Computer Vision{\textendash}ECCV 2010}, year = {2010}, month = {2010///}, pages = {476 - 489}, abstract = {The problem of face identification has received significant attention over the years. For a given probe face, the goal of face identification is to match this unknown face against a gallery of known people. Due to the availability of large amounts of data acquired in a variety of conditions, techniques that are both robust to uncontrolled acquisition conditions and scalable to large gallery sizes, which may need to be incrementally built, are challenges. In this work we tackle both problems. Initially, we propose a novel approach to robust face identification based on Partial Least Squares (PLS) to perform multi-channel feature weighting. Then, we extend the method to a tree-based discriminative structure aiming at reducing the time required to evaluate novel probe samples. The method is evaluated through experiments on FERET and FRGC datasets. In most of the comparisons our method outperforms state-of-art face identification techniques. Furthermore, our method presents scalability to large datasets.}, author = {Schwartz,W. and Guo,H. and Davis, Larry S.} } @article {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.} } @article {18757, title = {Stochastic simulations with graphics hardware: Characterization of accuracy and performance}, journal = {Journal of Computing and Information Science in Engineering}, volume = {10}, year = {2010}, month = {2010///}, pages = {011010 - 011010}, author = {Balijepalli,A. and LeBrun,T. W. and Gupta,S.K.} } @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 {14417, title = {A survey of link mining tasks for analyzing noisy and incomplete networks}, journal = {Link Mining: Models, Algorithms, and Applications}, year = {2010}, month = {2010///}, pages = {107 - 133}, abstract = {Many data sets of interest today are best described as networks or graphs of interlinked entities. Examples include Web and text collections, social networks and social media sites, information, transaction and communication networks, and all manner of scientific networks, including biological networks. Unfortunately, often the data collection and extraction process for gathering these network data sets is imprecise, noisy, and/or incomplete. In this chapter, we review a collection of link mining algorithms that are well suited to analyzing and making inferences about networks, especially in the case where the data is noisy or missing.}, doi = {10.1007/978-1-4419-6515-8_4}, author = {Namata,G.M. and Sharara,H. and Getoor, Lise} } @article {18284, title = {System and Method for Confidentiality-Preserving Rank-Ordered Search}, volume = {12/608,724}, year = {2010}, month = {2010/06/10/}, abstract = {A confidentiality preserving system and method for performing a rank-ordered search and retrieval of contents of a data collection. The system includes at least one computer system including a search and retrieval algorithm using term frequency and/or similar features for rank-ordering selective contents of the data collection, and enabling secure retrieval of the selective contents based on the rank-order. The search and retrieval algorithm includes a baseline algorithm, a partially server oriented algorithm, and/or a fully server oriented algorithm. The partially and/or fully server oriented algorithms use homomorphic and/or order preserving encryption for enabling search capability from a user other than an owner of the contents of the data collection. The confidentiality preserving method includes using term frequency for rank-ordering selective contents of the data collection, and retrieving the selective contents based on the rank-order.}, url = {http://www.google.com/patents?id=kInVAAAAEBAJ}, author = {Swaminathan,Ashwin and Mao,Yinian and Su,Guan-Ming and Gou,Hongmei and Varna,Avinash L. and He,Shan and M. Wu and Oard, Douglas} } @conference {18785, title = {A Systematic Methodology for Accurate Design-Stage Estimation of Energy Consumption for Injection Molded Parts}, year = {2010}, month = {2010///}, abstract = {Today{\textquoteright}s ubiquitous use of plastics in product designand manufacturing presents significant environmental and human health challenges. Injection molding, one of the most commonly used processes for making plastic products, consumes a significant amount of energy. A methodology for accurately estimating the energy consumed to injection-mold a part would enable environmentally conscious decision making during the product design. Unfortunately, only limited information is available at the design stage. Therefore, accurately estimating energy consumption before the part has gone into production can be challenging. In this paper, we describe a methodology for energy estimation that works with the limited amount of data available during the design stage, namely the CAD model of the part, the material name, and the production requirements. This methodology uses this data to estimate the parameters of the runner system and an appropriately sized molding machine. It then uses these estimates to compute the machine setup time and the cycle time required for the injection molding operation. This is done by appropriately abstracting information available from the mold flow simulation tools and analytical models that are traditionally used during the manufacturing stage. These times are then multiplied by the power consumed by the appropriately sized machine during each stage of the molding cycle to compute the estimated energy consumption per part. }, url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.165.4139\&rep=rep1\&type=pdf}, author = {Weissman,A. and Ananthanarayanan,A. and Gupta,S.K. and Sriram,R.D.} } @conference {13925, title = {Toque: designing a cooking-based programming language for and with children}, booktitle = {Proceedings of the 28th international conference on Human factors in computing systems}, year = {2010}, month = {2010///}, pages = {2417 - 2426}, author = {Tarkan,S. and Sazawal,V. and Druin, Allison and Golub,E. and Bonsignore,E. M and Walsh,G. and Atrash,Z.} } @conference {16504, title = {On trade-offs in event delivery systems}, booktitle = {Proceedings of the Fourth ACM International Conference on Distributed Event-Based Systems}, year = {2010}, month = {2010///}, pages = {116 - 127}, author = {Roitman,H. and Gal,A. and Raschid, Louiqa} } @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.} } @article {13030, title = {Validating the systematic position of {\i}t Plationus Segers, Murugan \& Dumont, 1993 (Rotifera: Brachionidae) using sequences of the large subunit of the nuclear ribosomal DNA and of cytochrome C oxidase}, journal = {Hydrobiologia}, volume = {644}, year = {2010}, month = {2010/05//}, pages = {361 - 370}, abstract = {Members of the family Brachionidae are free-living organisms that range in size from 170 to 250 microns. They comprise part of the zooplankton in freshwater and marine systems worldwide. Morphologically, members of the family are characterized by a single piece loricated body without furrows, grooves, sulci or dorsal head shields, and a malleate trophi. Differences in these structures have been traditionally used to recognize 217 species that are classified into seven genera. However, the validity of the species, Plationus patulus, P. patulus macracanthus P. polyacanthus, and P. felicitas have been confused because they were alternatively assigned in Brachionus or Platyias, when considering only morphological and ecological characters. Based on scanning electron microscope (SEM) images of the trophi, these taxa were assigned in a new genus, Plationus. In this study, we examined the systematic position of P. patulus and P. patulus macracanthus using DNA sequences of two genes: the cytochrome oxidase subunit 1 (cox1) and domains D2 and D3 of the large subunit of the nuclear ribosomal RNA (LSU). In addition, the cox1 and LSU sequences representing five genera of Brachionidae (Anuraeopsis, Brachionus, Keratella, Plationus, and Platyias) plus four species of three families from the order Ploima were used as the outgroup. The maximum likelihood (ML) analyses were conducted for each individual gene as well as for the combined (cox1 + LSU) data set. The ML tree from the combined data set yielded the family Brachionidae as a monophyletic group with weak bootstrap support (< 50\%). Five main clades in this tree had high (> 85\%) bootstrap support. The first clade was composed of three populations of P. patulus + P. patulus macracanthus. The second clade was composed of a single species of Platyias. The third clade was composed of six species of Brachionus. The fourth clade included a single species of the genus Anuraeopsis, and the fifth clade was composed of three species of the genus Keratella. The genetic divergence between Plationus and Platyias ranged from 18.4 to 19.2\% for cox1, and from 4.5 to 4.9\% for LSU, and between Brachionus and Plationus, it ranged from 16.9 to 23.1\% (cox1), and from 7.3 to 9.1\% (LSU). Morphological evidence, the amount of genetic divergence, the systematic position of Plationus within the family Brachionidae, and the position of Plationus as a sister group of Brachionus and Platyias support the validity of Plationus patulus and P. patulus macracanthus into the genus Plationus.}, keywords = {Cox1;, likelihood;, LSU;, maximum, Phylogeny, Plationus;}, doi = {DOI 10.1007/s10750-010-0203-1}, author = {Reyna-Fabian,ME and Laclette,J. P and Cummings, Michael P. and Garc{\'\i}a-Varela,M} } @conference {16047, title = {VAST 2010 Challenge: Arms dealings and pandemics}, booktitle = {Visual Analytics Science and Technology (VAST), 2010 IEEE Symposium on}, year = {2010}, month = {2010/10//}, pages = {263 - 264}, abstract = {The 5th VAST Challenge consisted of three mini-challenges that involved both intelligence analysis and bioinformatics. Teams could solve one, two or all three mini-challenges and assess the overall situation to enter the Grand Challenge. Mini-challenge one involved text reports about people and events giving information about arms dealers, situations in various countries and linkages between different countries. Mini-challenge two involved hospital admission and death records from various countries providing information about the spread of a world wide pandemic. Mini-challenge three involved genetic data to be used to identify the origin of the pandemic and the most dangerous viral mutations. The Grand Challenge was to determine how these various mini-challenges were connected. As always the goal was to analyze the data and provide novel interactive visualizations useful in the analytic process. We received 58 submissions in total and gave 15 awards.}, keywords = {2010, administrative, admission;intelligence, analysis;interactive, analysis;medical, challenge;arms, challenge;hospital, data, data;grand, dealings;bioinformatics;dangerous, mutations;death, processing;weapons;, records;genetic, reports;bioinformatics;data, VAST, viral, visualizations;minichallenge;pandemics;text}, doi = {10.1109/VAST.2010.5649054}, author = {Grinstein,G. and Konecni,S. and Scholtz,J. and Whiting,M. and Plaisant, Catherine} } @article {12478, title = {Video Metrology Using a Single Camera}, journal = {Pattern Analysis and Machine Intelligence, IEEE Transactions on}, volume = {32}, year = {2010}, month = {2010/07//}, pages = {1329 - 1335}, abstract = {This paper presents a video metrology approach using an uncalibrated single camera that is either stationary or in planar motion. Although theoretically simple, measuring the length of even a line segment in a given video is often a difficult problem. Most existing techniques for this task are extensions of single image-based techniques and do not achieve the desired accuracy especially in noisy environments. In contrast, the proposed algorithm moves line segments on the reference plane to share a common endpoint using the vanishing line information followed by fitting multiple concentric circles on the image plane. A fully automated real-time system based on this algorithm has been developed to measure vehicle wheelbases using an uncalibrated stationary camera. The system estimates the vanishing line using invariant lengths on the reference plane from multiple frames rather than the given parallel lines, which may not exist in videos. It is further extended to a camera undergoing a planar motion by automatically selecting frames with similar vanishing lines from the video. Experimental results show that the measurement results are accurate enough to classify moving vehicles based on their size.}, keywords = {camera;vanishing, circles;uncalibrated, concentric, image-based, information;vehicle, line, measurement;video, metrology;cameras;image, processing;, segment;multiple, segmentation;video, signal, single, techniques;line, wheelbase}, isbn = {0162-8828}, doi = {10.1109/TPAMI.2010.26}, author = {Guo,Feng and Chellapa, Rama} } @article {18925, title = {When is it better not to look ahead?}, journal = {Artificial Intelligence}, volume = {174}, year = {2010}, month = {2010/11//}, pages = {1323 - 1338}, abstract = {In situations where one needs to make a sequence of decisions, it is often believed that looking ahead will help produce better decisions. However, it was shown 30 years ago that there are {\textquotedblleft}pathological{\textquotedblright} situations in which looking ahead is counterproductive. Two long-standing open questions are (a) what combinations of factors have the biggest influence on whether lookahead pathology occurs, and (b) whether it occurs in real-world decision-making.This paper includes simulation results for several synthetic game-tree models, and experimental results for three well-known board games: two chess endgames, kalah (with some modifications to facilitate experimentation), and the 8-puzzle. The simulations show the interplay between lookahead pathology and several factors that affect it; and the experiments confirm the trends predicted by the simulation models. The experiments also show that lookahead pathology is more common than has been thought: all three games contain situations where it occurs. }, keywords = {Game-tree search, Lookahead pathology, minimax}, isbn = {0004-3702}, doi = {10.1016/j.artint.2010.08.002}, url = {http://www.sciencedirect.com/science/article/pii/S0004370210001402}, author = {Nau, Dana S. and Lu{\v s}trek,Mitja and Parker,Austin and Bratko,Ivan and Gams,Matja{\v z}} } @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} } @article {16059, title = {Advancing User-Centered Evaluation of Visual Analytic Environments Through Contests}, journal = {Information VisualizationInformation Visualization}, volume = {8}, year = {2009}, month = {2009/09/21/}, pages = {230 - 238}, abstract = {In this paper, the authors describe the Visual Analytics Science and Technology (VAST) Symposium contests run in 2006 and 2007 and the VAST 2008 and 2009 challenges. These contests were designed to provide researchers with a better understanding of the tasks and data that face potential end users. Access to these end users is limited because of time constraints and the classified nature of the tasks and data. In that respect, the contests serve as an intermediary, with the metrics and feedback serving as measures of utility to the end users. The authors summarize the lessons learned and the future directions for VAST Challenges.}, keywords = {metrics, synthetic data, user-centered evaluation, visual analytics}, isbn = {1473-8716, 1473-8724}, doi = {10.1057/ivs.2009.16}, url = {http://ivi.sagepub.com/content/8/3/230}, author = {Costello,Loura and Grinstein,Georges and Plaisant, Catherine and Scholtz,Jean} } @conference {17752, title = {Aggregate Query Answering under Uncertain Schema Mappings}, booktitle = {Data Engineering, 2009. ICDE {\textquoteright}09. IEEE 25th International Conference on}, year = {2009}, month = {2009/04/29/2}, pages = {940 - 951}, abstract = {Recent interest in managing uncertainty in data integration has led to the introduction of probabilistic schema mappings and the use of probabilistic methods to answer queries across multiple databases using two semantics: by-table and by-tuple. In this paper, we develop three possible semantics for aggregate queries: the range, distribution, and expected value semantics, and show that these three semantics combine with the by-table and by-tuple semantics in six ways. We present algorithms to process COUNT, AVG, SUM, MIN, and MAX queries under all six semantics and develop results on the complexity of processing such queries under all six semantics. We show that computing COUNT is in PTIME for all six semantics and computing SUM is in PTIME for all but the by-tuple/distribution semantics. Finally, we show that AVG, MIN, and MAX are PTIME computable for all by-table semantics and for the by-tuple/range semantics.We developed a prototype implementation and experimented with both real-world traces and simulated data. We show that, as expected, naive processing of aggregates does not scale beyond small databases with a small number of mappings. The results also show that the polynomial time algorithms are scalable up to several million tuples as well as with a large number of mappings.}, keywords = {aggregate, algorithm;probabilistic, answering;by-table, complexity;data, complexity;distributed, database;polynomial, databases;, databases;probability;query, integration;distribution, mapping;computational, mapping;query, processing;range, processing;statistical, query, schema, semantics;by-tuple, semantics;computational, semantics;expected, semantics;multiple, semantics;uncertain, TIME, value}, doi = {10.1109/ICDE.2009.55}, author = {Gal,A. and Martinez,M. V and Simari,G. I and V.S. Subrahmanian} } @article {18784, title = {Algorithms for extraction of nanowire lengths and positions from optical section microscopy image sequence}, journal = {Journal of Computing and Information Science in Engineering}, volume = {9}, year = {2009}, month = {2009///}, pages = {041007 - 041007}, author = {Peng,T. and Balijepalli,A. and Gupta,S.K. and LeBrun,T. W.} } @article {18811, title = {Algorithms for generating multi-stage molding plans for articulated assemblies}, journal = {Robotics and Computer-Integrated Manufacturing}, volume = {25}, year = {2009}, month = {2009/02//}, pages = {91 - 106}, abstract = {Multi-stage molding is capable of producing better-quality articulated products at a lower cost. During the multi-stage molding process, assembly operations are performed along with the molding operations. Hence, it gives rise to a new type of planning problem. It is difficult to perform the planning manually because it involves evaluating large number of combinations and solving complex geometric reasoning problems. This paper investigates the problem of generating multi-stage molding plans for articulated assemblies. We present a planning framework that allows us to utilize constraints from experimentally proven molding plans. As a part of the planning problem, we determine the molding sequence and intermediate assembly configurations. We present algorithms for all the steps in the planning problem and characterize their computational complexities. Finally, we illustrate our approach with representative examples.}, keywords = {In-mold assembly, mold design, Process planning}, isbn = {0736-5845}, doi = {10.1016/j.rcim.2007.10.002}, url = {http://www.sciencedirect.com/science/article/pii/S0736584507001044}, author = {Priyadarshi,Alok K. and Gupta, Satyandra K.} } @conference {16974, title = {Analyzing (social media) networks with NodeXL}, booktitle = {Proceedings of the fourth international conference on Communities and technologies}, series = {C\&$\#$38;T {\textquoteright}09}, year = {2009}, month = {2009///}, pages = {255 - 264}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {We present NodeXL, an extendible toolkit for network overview, discovery and exploration implemented as an add-in to the Microsoft Excel 2007 spreadsheet software. We demonstrate NodeXL data analysis and visualization features with a social media data sample drawn from an enterprise intranet social network. A sequence of NodeXL operations from data import to computation of network statistics and refinement of network visualization through sorting, filtering, and clustering functions is described. These operations reveal sociologically relevant differences in the patterns of interconnection among employee participants in the social media space. The tool and method can be broadly applied.}, keywords = {excel, network analysis, social media, social network, spreadsheet, Visualization}, isbn = {978-1-60558-713-4}, doi = {10.1145/1556460.1556497}, url = {http://doi.acm.org/10.1145/1556460.1556497}, author = {Smith,Marc A. and Shneiderman, Ben and Milic-Frayling,Natasa and Mendes Rodrigues,Eduarda and Barash,Vladimir and Dunne,Cody and Capone,Tony and Perer,Adam and Gleave,Eric} } @conference {15855, title = {Arabic Cross-Document Coreference Resolution}, booktitle = {Proceedings of the ACL-IJCNLP 2009 Conference Short Papers$}$}, year = {2009}, month = {2009///}, pages = {357 - 360}, author = {Sayeed,A. and Elsayed,T. and Garera,N. and Alexander,D. and Xu,T. and Oard, Douglas and Yarowsky,D. and Piatko,C.} } @article {12113, title = {An assessment of systems and software engineering scholars and institutions (2002{\textendash}2006)}, journal = {Journal of Systems and Software}, volume = {82}, year = {2009}, month = {2009/08//}, pages = {1370 - 1373}, abstract = {This paper summarizes a survey of publications in the field of systems and software engineering from 2002 to 2006. The survey is an ongoing, annual event that identifies the top 15 scholars and institutions over a 5-year period. The rankings are calculated based on the number of papers published in TSE, TOSEM, JSS, SPE, EMSE, IST, and Software. The top-ranked institution is Korea Advanced Institute of Science and Technology, Korea, and the top-ranked scholar is Magne J{\o}rgensen of Simula Research Laboratory, Norway.}, keywords = {Research publications, Systems and software engineering, Top institutions, Top scholars}, isbn = {0164-1212}, doi = {10.1016/j.jss.2009.06.018}, url = {http://www.sciencedirect.com/science/article/pii/S0164121209001265}, author = {Wong,W. Eric and Tse,T.H. and Glass,Robert L. and Basili, Victor R. and Chen,T.Y.} } @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} } @conference {13358, title = {Bisimulation-based approximate lifted inference}, booktitle = {Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence}, series = {UAI {\textquoteright}09}, year = {2009}, month = {2009///}, pages = {496 - 505}, publisher = {AUAI Press}, organization = {AUAI Press}, address = {Arlington, Virginia, United States}, abstract = {There has been a great deal of recent interest in methods for performing lifted inference; however, most of this work assumes that the first-order model is given as input to the system. Here, we describe lifted inference algorithms that determine symmetries and automatically lift the probabilistic model to speedup inference. In particular, we describe approximate lifted inference techniques that allow the user to trade off inference accuracy for computational efficiency by using a handful of tunable parameters, while keeping the error bounded. Our algorithms are closely related to the graph-theoretic concept of bisimulation. We report experiments on both synthetic and real data to show that in the presence of symmetries, run-times for inference can be improved significantly, with approximate lifted inference providing orders of magnitude speedup over ground inference.}, isbn = {978-0-9749039-5-8}, url = {http://dl.acm.org/citation.cfm?id=1795114.1795172}, author = {Sen,Prithviraj and Deshpande, Amol and Getoor, Lise} } @article {13975, title = {A broadband fast multipole accelerated boundary element method for the three dimensional Helmholtz equation}, journal = {The Journal of the Acoustical Society of America}, volume = {125}, year = {2009}, month = {2009///}, pages = {191 - 205}, abstract = {The development of a fast multipole method (FMM) accelerated iterative solution of the boundary element method (BEM) for the Helmholtz equations in three dimensions is described. The FMM for the Helmholtz equation is significantly different for problems with low and high kD (where k is the wavenumber and D the domain size), and for large problems the method must be switched between levels of the hierarchy. The BEM requires several approximate computations (numerical quadrature, approximations of the boundary shapes using elements), and these errors must be balanced against approximations introduced by the FMM and the convergence criterion for iterative solution. These different errors must all be chosen in a way that, on the one hand, excess work is not done and, on the other, that the error achieved by the overall computation is acceptable. Details of translation operators for low and high kD, choice of representations, and BEM quadrature schemes, all consistent with these approximations, are described. A novel preconditioner using a low accuracy FMM accelerated solver as a right preconditioner is also described. Results of the developed solvers for large boundary value problems with 0.0001≲kD≲500 are presented and shown to perform close to theoretical expectations.}, keywords = {acoustic wave scattering, boundary-elements methods, boundary-value problems, Helmholtz equations, iterative methods}, doi = {10.1121/1.3021297}, url = {http://link.aip.org/link/?JAS/125/191/1}, author = {Gumerov, Nail A. and Duraiswami, Ramani} } @article {14480, title = {Chance-constrained programs for link prediction}, journal = {Proceedings of Workshop on Analyzing Networks and Learning with Graphs at NIPS Conference}, year = {2009}, month = {2009///}, abstract = {In this paper, we consider the link prediction problem, where we are given a par-tial snapshot of a network at some time and the goal is to predict additional links at a later time. The accuracy of the current prediction methods is quite low due to the extreme class skew and the large number of potential links. In this paper, we describe learning algorithms based on chance constrained programs and show that they exhibit all the properties needed for a good link predictor, namely, al- low preferential bias to positive or negative class; handle skewness in the data; and scale to large networks. Our experimental results on three real-world co- authorship networks show significant improvement in prediction accuracy over baseline algorithms. }, author = {Doppa,J.R. and Yu,J. and Tadepalli,P. and Getoor, Lise} } @article {18772, title = {Characterization and control of pin diameter during in-mold assembly of mesoscale revolute joints}, journal = {North American Manufacturing Research Institute}, volume = {37}, year = {2009}, month = {2009///}, abstract = {Macro-scale revolute joints can be formed byfirst molding the hole and then molding the pin inside the hole. As the pin shrinks during the solidification process, it moves away from the hole and provides the clearance for the joint to function. The value of clearance in the macro- scale joint can be controlled by carefully selecting the process parameters and the material for the pin. However, in order for this strategy to work at the mesoscale, it requires the use of very thin cores to form sub-millimeter holes. Such thin cores are very difficult to make, are easily damaged during the molding process, and very difficult to retract from the hole. Our previous work has shown that making the pins first and then creating holes on the top of pins leads to successful mesoscale joints. This strategy is counter intuitive based on our experiences at the macro-scale. At the macroscale, as the hole shrinks on top of the pin, the joint is jammed. So a fundamental question is why this counter-intuitive strategy works at the mesoscale. In this paper we show that at the mesoscale, the joint jamming is prevented because of the deformation of the pin under the compressive loading during the second stage molding. We also describe features in the mold that can control the pin deformation and hence control the joint parameters. We present experimental data and computational models to show how mesoscale revolute joints can be formed. }, url = {http://web.mit.edu/arvinda/www/NAMRI_2009_draft.pdf}, author = {Ananthanarayanan,A. and Gupta,S.K. and Bruck,H. A.} } @conference {14445, title = {Co-evolution of social and affiliation networks}, booktitle = {Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining}, series = {KDD {\textquoteright}09}, year = {2009}, month = {2009///}, pages = {1007 - 1016}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {In our work, we address the problem of modeling social network generation which explains both link and group formation. Recent studies on social network evolution propose generative models which capture the statistical properties of real-world networks related only to node-to-node link formation. We propose a novel model which captures the co-evolution of social and affiliation networks. We provide surprising insights into group formation based on observations in several real-world networks, showing that users often join groups for reasons other than their friends. Our experiments show that the model is able to capture both the newly observed and previously studied network properties. This work is the first to propose a generative model which captures the statistical properties of these complex networks. The proposed model facilitates controlled experiments which study the effect of actors{\textquoteright} behavior on the evolution of affiliation networks, and it allows the generation of realistic synthetic datasets.}, keywords = {affiliation network, Evolution, graph generator, groups, social network}, isbn = {978-1-60558-495-9}, doi = {10.1145/1557019.1557128}, url = {http://doi.acm.org/10.1145/1557019.1557128}, author = {Zheleva,Elena and Sharara,Hossam and Getoor, Lise} } @inbook {14493, title = {Collective classification for text classification}, booktitle = {Text Mining: Classification, Clustering, and ApplicationsText Mining: Classification, Clustering, and Applications}, year = {2009}, month = {2009///}, pages = {51 - 69}, author = {Namata,G. and Sen,P. and Bilgic,M. and Getoor, Lise} } @inbook {14382, title = {Collective relational clustering}, booktitle = {Constrained Clustering: Advances in Algorithms, Theory, and ApplicationsConstrained Clustering: Advances in Algorithms, Theory, and Applications}, year = {2009}, month = {2009///}, pages = {221 - 244}, author = {Bhattacharya,I. and Getoor, Lise} } @article {14482, title = {Common effect of antipsychotics on the biosynthesis and regulation of fatty acids and cholesterol supports a key role of lipid homeostasis in schizophrenia}, journal = {Schizophrenia Research}, volume = {108}, year = {2009}, month = {2009/03//}, pages = {134 - 142}, abstract = {For decades, the dopamine hypothesis has gained the most attention in an attempt to explain the origin and the symptoms of schizophrenia. While this hypothesis offers an explanation for the relationship between psychotic symptoms and dopamine kinetics, it does not provide a direct explanation of the etiology of schizophrenia which remains poorly understood. Consequently, current antipsychotics that target neurotransmitter receptors, have limited and inconsistent efficacy. To gain insights into the mechanism of action of these drugs, we studied the expression profile of 12,490 human genes in a cell line treated with 18 antipsychotics, and compared it to that of a library of 448 other compounds used in a variety of disorders. Analysis reveals a common effect of antipsychotics on the biosynthesis and regulation of fatty acids and cholesterol, which is discussed in the context of a lipid hypothesis where alterations in lipid homeostasis might underlie the pathogenesis of schizophrenia. This finding may help research aimed at the development of novel treatments for this devastating disease.}, keywords = {Antipsychotic action, Gene expression, Lipid homeostasis, Pathogenesis}, isbn = {0920-9964}, doi = {10.1016/j.schres.2008.11.025}, url = {http://www.sciencedirect.com/science/article/pii/S0920996408005306}, author = {Polymeropoulos,Mihael H. and Licamele,Louis and Volpi,Simona and Mack,Kendra and Mitkus,Shruti N. and Carstea,Eugene D. and Getoor, Lise and Thompson,Andrew and Lavedan,Christian} } @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 {13967, title = {Computation of singular and hypersingular boundary integrals by Green identity and application to boundary value problems}, journal = {Engineering Analysis with Boundary Elements}, volume = {33}, year = {2009}, month = {2009/08//}, pages = {1124 - 1131}, abstract = {The problem of computing singular and hypersingular integrals involved in a large class of boundary value problems is considered. The method is based on Green{\textquoteright}s theorem for calculating the diagonal elements of the resulting discretized matrix using the Nystr{\"o}m discretization method. The method is successfully applied to classical boundary value problems. Convergence of the method is also discussed.}, keywords = {Bounday integral method, Green identity, Hypersingular integrals, Nystr{\"o}m method, Singular integrals}, isbn = {0955-7997}, doi = {10.1016/j.enganabound.2009.02.004}, url = {http://www.sciencedirect.com/science/article/pii/S0955799709000447}, author = {Seydou,F. and Duraiswami, Ramani and Sepp{\"a}nen,T. and Gumerov, Nail A.} } @article {13968, title = {Computation of the head-related transfer function via the boundary element method and representation via the spherical harmonic spectrum}, journal = {Technical Reports from UMIACS UMIACS-TR-2009-06}, year = {2009}, month = {2009/05/15/}, abstract = {The head-related transfer function (HRTF) is computed using the fast multipole accelerated boundary element method. For efficiency, the HRTF is computed using the reciprocity principle, by placing a source at the ear and computing its field. Analysis is presented to modify the boundary value problem accordingly. To compute the HRTF corresponding to different ranges via a single computation, a compact and accurate representation of the HRTF, termed the spherical spectrum, is developed. Computations are reduced to a two stage process, the computation of the spherical spectrum and a subsequent evaluation of the HRTF. This representation allows easy interpolation and range extrapolation of HRTFs.HRTF computations are performed for the range of audible frequencies up to 20 kHz for several models including a sphere, human head models (for the {\textquotedblleft}Fritz{\textquotedblright} and {\textquotedblleft}Kemar{\textquotedblright}), and head and torso model (the Kemar manikin). Comparisons between the different cases and analysis of limiting cases is provided. Comparisons with the computational data of other authors and available experimental data are conducted and show satisfactory agreement for the frequencies for which reliable experimental data is available. Our results show that, given a good mesh it is feasible to compute the HRTF over the full audible range on a regular personal computer. }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/9085}, author = {Gumerov, Nail A. and O{\textquoteright}donovan,Adam and Duraiswami, Ramani and Zotkin,Dmitry N} } @conference {19443, title = {Computer Help at Home: Methods and Motivations for Informal Technical Support}, booktitle = {SIGCHI {\textquoteright}09}, series = {CHI {\textquoteright}09}, year = {2009}, month = {2009///}, pages = {739 - 748}, publisher = {ACM}, organization = {ACM}, abstract = {Prior research suggests that people may ask their family and friends for computer help. But what influences whether and how a "helper" will provide help? To answer this question, we conducted a qualitative investigation of people who participated in computer support activities with family and friends in the past year. We describe how factors including maintenance of one{\textquoteright}s personal identity as a computer expert and accountability to one{\textquoteright}s social network determine who receives help and the quality of help provided. We also discuss the complex, fractured relationship between the numerous stakeholders involved in the upkeep of home computing infrastructures. Based on our findings, we provide implications for the design of systems to support informal help-giving in residential settings.}, keywords = {help-giving, help-seeking, Home computing, identity management, social networks}, isbn = {978-1-60558-246-7}, url = {http://doi.acm.org/10.1145/1518701.1518816}, author = {Poole, Erika Shehan and Marshini Chetty and Morgan, Tom and Grinter, Rebecca E. and Edwards, W. Keith} } @conference {19029, title = {Controlling data in the cloud: outsourcing computation without outsourcing control}, series = {CCSW {\textquoteright}09}, year = {2009}, month = {2009}, pages = {85 - 90}, publisher = {ACM}, organization = {ACM}, abstract = {Cloud computing is clearly one of today{\textquoteright}s most enticing technology areas due, at least in part, to its cost-efficiency and flexibility. However, despite the surge in activity and interest, there are significant, persistent concerns about cloud computing that are impeding momentum and will eventually compromise the vision of cloud computing as a new IT procurement model. In this paper, we characterize the problems and their impact on adoption. In addition, and equally importantly, we describe how the combination of existing research thrusts has the potential to alleviate many of the concerns impeding adoption. In particular, we argue that with continued research advances in trusted computing and computation-supporting encryption, life in the cloud can be advantageous from a business intelligence standpoint over the isolated alternative that is more common today.}, keywords = {Cloud computing, privacy, Security}, isbn = {978-1-60558-784-4}, url = {http://doi.acm.org/10.1145/1655008.1655020}, author = {Chow, Richard and Golle, Philippe and Jakobsson, Markus and Elaine Shi and Staddon, Jessica and Masuoka, Ryusuke and Molina,Jesus} } @conference {12230, title = {CPM: Adaptive Video-on-Demand with Cooperative Peer Assists and Multicast}, booktitle = {INFOCOM 2009, IEEE}, year = {2009}, month = {2009/04//}, pages = {91 - 99}, abstract = {We present CPM, a unified approach that exploits server multicast, assisted by peer downloads, to provide efficient video-on-demand (VoD) in a service provider environment. We describe our architecture and show how CPM is designed to dynamically adapt to a wide range of situations including highly different peer-upload bandwidths, content popularity, user request arrival patterns, video library size, and subscriber population. We demonstrate the effectiveness of CPM using simulations (based on an actual implementation codebase) across the range of situations described above and show that CPM does significantly better than traditional unicast, different forms of multicast, as well as peer-to-peer schemes. Along with synthetic parameters, we augment our experiments using data from a deployed VoD service to evaluate the performance of CPM.}, keywords = {assists;multicast;peer-to-peer, communication;peer-to-peer, computing;video, CPM;cooperative, demand;, on, parameters;video-on-demand;multicast, peer, schemes;synthetic}, doi = {10.1109/INFCOM.2009.5061910}, author = {Gopalakrishnan,V. and Bhattacharjee, Bobby and Ramakrishnan,K.K. and Jana,R. and Srivastava,D.} } @conference {15891, title = {Cross-document coreference resolution: A key technology for learning by reading}, booktitle = {AAAI Spring Symposium on Learning by Reading and Learning to Read}, year = {2009}, month = {2009///}, author = {Mayfield,J. and Alexander,D. and Dorr, Bonnie J and Eisner,J. and Elsayed,T. and Finin,T. and Fink,C. and Freedman,M. and Garera,N. and McNamee,P. and others} } @conference {18798, title = {A Decoupled and Prioritized Stochastic Dynamic Programming Approach for Automated Transport of Multiple Particles Using Optical Tweezers}, volume = {6}, year = {2009}, month = {2009///}, pages = {785 - 796}, publisher = {ASME}, organization = {ASME}, address = {San Diego, California, USA}, abstract = {Automated transport of multiple particles using optical tweezers requires the use of motion planning to move them simultaneously while avoiding collisions amongst themselves and with randomly moving obstacles. This paper develops a decoupled and prioritized stochastic dynamic programming based motion planning framework by sequentially applying a partially observable Markov decision process algorithm on every particle that needs to be transported. An iterative version of a maximum bipartite graph matching algorithm is used to assign given goal locations to such particles. The algorithm for individual particle transport is validated using silica beads in a holographic tweezer set-up. Once the individual plans are computed, a three-step method consisting of clustering, classification, and branch and bound optimization is employed to determine the final collision-free paths. Simulation results in the form of sample trajectories and performance characterization plots are presented to illustrate the usefulness of the developed approach.}, isbn = {978-0-7918-4903-3}, doi = {10.1115/DETC2009-87113}, url = {http://link.aip.org/link/ASMECP/v2009/i49033/p785/s1\&Agg=doi}, author = {Banerjee,Ashis Gopal and Losert,Wolfgang and Gupta, Satyandra K.} } @conference {18563, title = {Detecting spammers with SNARE: spatio-temporal network-level automatic reputation engine}, booktitle = {Proceedings of the 18th conference on USENIX security symposium}, series = {SSYM{\textquoteright}09}, year = {2009}, month = {2009///}, pages = {101 - 118}, publisher = {USENIX Association}, organization = {USENIX Association}, address = {Berkeley, CA, USA}, abstract = {Users and network administrators need ways to filter email messages based primarily on the reputation of the sender. Unfortunately, conventional mechanisms for sender reputation--notably, IP blacklists--are cumbersome to maintain and evadable. This paper investigates ways to infer the reputation of an email sender based solely on network-level features, without looking at the contents of a message. First, we study first-order properties of network-level features that may help distinguish spammers from legitimate senders. We examine features that can be ascertained without ever looking at a packet{\textquoteright}s contents, such as the distance in IP space to other email senders or the geographic distance between sender and receiver. We derive features that are lightweight, since they do not require seeing a large amount of email from a single IP address and can be gleaned without looking at an email{\textquoteright}s contents--many such features are apparent from even a single packet. Second, we incorporate these features into a classification algorithm and evaluate the classifier{\textquoteright}s ability to automatically classify email senders as spammers or legitimate senders. We build an automated reputation engine, SNARE, based on these features using labeled data from a deployed commercial spam-filtering system. We demonstrate that SNARE can achieve comparable accuracy to existing static IP blacklists: about a 70\%detection rate for less than a 0.3\%false positive rate. Third, we show how SNARE can be integrated into existing blacklists, essentially as a first-pass filter.}, url = {http://dl.acm.org/citation.cfm?id=1855768.1855775}, author = {Hao,Shuang and Syed,Nadeem Ahmed and Feamster, Nick and Gray,Alexander G. and Krasser,Sven} } @article {12883, title = {Detection of toxigenic Vibrio cholerae O1 in freshwater lakes of the former Soviet Republic of Georgia}, journal = {Environmental Microbiology Reports}, volume = {2}, year = {2009}, month = {2009/09/03/}, pages = {2 - 6}, abstract = {Three freshwater lakes, Lisi Lake, Kumisi Lake and Tbilisi Sea, near Tbilisi, Georgia, were studied from January 2006 to December 2007 to determine the presence of Vibrio cholerae employing both bacteriological culture method and direct detection methods, namely PCR and direct fluorescent antibody (DFA). For PCR, DNA extracted from water samples was tested for presence of V. cholerae and genes coding for selected virulence factors. Vibrio cholerae non-O1/non-O139 was routinely isolated by culture from all three lakes; whereas V. cholerae O1 and O139 were not. Water samples collected during the summer months from Lisi Lake and Kumisi Lake were positive for both V. cholerae and V. cholerae ctxA, tcpA, zot, ompU and toxR by PCR. Water samples collected during the same period from both Lisi and Kumisi Lake were also positive for V. cholerae serogroup O1 by DFA. All of the samples were negative for V. cholerae serotype O139. The results of this study provide evidence for an environmental presence of toxigenic V. cholerae O1, which may represent a potential source of illness as these lakes serve as recreational water in Tbilisi, Georgia.}, isbn = {1758-2229}, doi = {10.1111/j.1758-2229.2009.00073.x}, url = {http://onlinelibrary.wiley.com/doi/10.1111/j.1758-2229.2009.00073.x/abstract?userIsAuthenticated=false\&deniedAccessCustomisedMessage=}, author = {Grim,Christopher J. and Jaiani,Ekaterina and Whitehouse,Chris A. and Janelidze,Nino and Kokashvili,Tamuna and Tediashvili,Marina and Rita R Colwell and Huq,Anwar} } @article {14472, title = {Distinguishing knowledge vs social capital in social media with roles and context}, journal = {Proceedings of the ICWSM}, volume = {9}, year = {2009}, month = {2009///}, abstract = {Social media communities (e.g. Wikipedia, Flickr, Live Q\&A) give rise to distinct types of content, foremost among which are relational content (discussion, chat) and factual content (answering questions, problem-solving). Both users and researchers are increasingly interested in developing strategies that can rapidly distinguish these types of content. While many text-based and structural strategies are possible, we extend two bodies of research that show how social context, and the social roles of answerers can predict content type. We test our framework on a dataset of manually labeled contributions to Microsoft{\textquoteright}s Live Q\&A and find that it reliably extracts factual and relational messages from the data.}, author = {Barash,V. and Smith,M. and Getoor, Lise and Welser,H. T} } @article {12890, title = {Diversity and Seasonality of Bioluminescent Vibrio Cholerae Populations in Chesapeake Bay}, journal = {Applied and Environmental MicrobiologyAppl. Environ. Microbiol.}, volume = {75}, year = {2009}, month = {2009/01/01/}, pages = {135 - 146}, abstract = {Association of luminescence with phenotypic and genotypic traits and with environmental parameters was determined for 278 strains of Vibrio cholerae isolated from the Chesapeake Bay during 1998 to 2000. Three clusters of luminescent strains (A, B, and C) and two nonluminescent clusters (X and Y) were identified among 180 clonal types. V. cholerae O1 strains isolated during pandemics and endemic cholera in the Ganges Delta were related to cluster Y. Heat-stable enterotoxin (encoded by stn) and the membrane protein associated with bile resistance (encoded by ompU) were found to be linked to luminescence in strains of cluster A. Succession from nonluminescent to luminescent populations of V. cholerae occurred during spring to midsummer. Occurrence of cluster A strains in water with neutral pH was contrasted with that of cluster Y strains in water with a pH of >8. Cluster A was found to be associated with a specific calanoid population cooccurring with cyclopoids. Cluster B was related to cluster Y, with its maximal prevalence at pH 8. Occurrence of cluster B strains was more frequent with warmer water temperatures and negatively correlated with maturity of the copepod community. It is concluded that each cluster of luminescent V. cholerae strains occupies a distinct ecological niche. Since the dynamics of these niche-specific subpopulations are associated with zooplankton community composition, the ecology of luminescent V. cholerae is concluded to be related to its interaction with copepods and related crustacean species.}, isbn = {0099-2240, 1098-5336}, doi = {10.1128/AEM.02894-07}, url = {http://aem.asm.org/content/75/1/135}, author = {Zo,Young-Gun and Chokesajjawatee,Nipa and Grim,Christopher and Arakawa,Eiji and Watanabe,Haruo and Rita R Colwell} } @conference {14489, title = {The Dynamics of Actor Loyalty to Groups in Affiliation Networks}, booktitle = {Social Network Analysis and Mining, 2009. ASONAM {\textquoteright}09. International Conference on Advances in}, year = {2009}, month = {2009/07//}, pages = {101 - 106}, abstract = {In this paper, we introduce a method for analyzing the temporal dynamics of affiliation networks. We define affiliation groups which describe temporally related subsets of actors and describe an approach for exploring changing memberships in these affiliation groups over time. To model the dynamic behavior in these networks, we consider the concept of loyalty and introduce a measure that captures an actorpsilas loyalty to an affiliation group as the degree of dasiacommitmentpsila an actor shows to the group over time. We evaluate our measure using two real world affiliation networks: a senate bill co-sponsorship network and a dolphin network. The results show how the behavior of actors in different affiliation groups change dynamically over time, reinforcing the utility of our measure for understanding the loyalty of actors to time-varying affiliation groups.}, keywords = {actor, bill, co-sponsorship, dynamics;social, groups;affiliation, loyalty;affiliation, network;senate, network;temporal, networks;dolphin, sciences;}, doi = {10.1109/ASONAM.2009.27}, author = {Sharara,H. and Singh,L. and Getoor, Lise and Mann,J.} } @article {15057, title = {Encryption Algorithm Based on Circle Property}, journal = {Jisuanji Gongcheng/ Computer Engineering}, volume = {35}, year = {2009}, month = {2009///}, pages = {180 - 182}, author = {Ge,L.N. and He,Z.H. and Zhuolin Jiang} } @conference {18829, title = {Enhanced force measurement techniques to extend optical trapping towards nanoscale manipulation}, year = {2009}, month = {2009/07//}, pages = {13 - 16}, abstract = {We have developed a new force measurement technique based on the random thermal motion of a nanoparticle in an optical trap. We demonstrate this method, in one-dimension, through numerical simulations and laboratory experiments. We show that computer simulations successfully recover the profile of the optical trapping force, beyond the inflection point of the trapping potential for a range of particle sizes. We show, through laboratory experiments, that this technique is effective in recovering higher order terms, in a power series expansion of the trapping force, beyond the widely reported linear trap stiffness. We also show that the first order (stiffness) term in our series expansion is consistent with values reported in the literature.}, keywords = {Brownian motion, extend optical trapping, Fokker-Planck equation, force measurement, inflection point, linear trap stiffness, nanoparticle, nanoparticles, nanoscale manipulation, nanotechnology, optical trapping force, power series expansion, radiation pressure, random thermal motion}, author = {Balijepalli,A. and LeBrun,T. W. and Gorman,J. J. and Gupta,S.K.} } @conference {17531, title = {Fighting Spam with the NeighborhoodWatch DHT}, booktitle = {IEEE INFOCOM 2009}, year = {2009}, month = {2009/04/19/25}, pages = {1755 - 1763}, publisher = {IEEE}, organization = {IEEE}, abstract = {In this paper, we present DHTBL, an anti-spam blacklist built upon a novel secure distributed hash table (DHT). We show how DHTBL can be used to replace existing DNS-based blacklists (DNSBLs) of IP addresses of mail relays that forward spam. Implementing a blacklist on a DHT improves resilience to DoS attacks and secures message delivery, when compared to DNSBLs. However, due to the sensitive nature of the blacklist, storing the data in a peer-to-peer DHT would invite attackers to infiltrate the system. Typical DHTs can withstand fail-stop failures, but malicious nodes may provide incorrect routing information, refuse to return published items, or simply ignore certain queries. The neighborhoodwatch DHT is resilient to malicious nodes and maintains the O(logiV) bounds on routing table size and expected lookup time. NeighborhoodWatch depends on two assumptions in order to make these guarantees: (1) the existence of an on-line trusted authority that periodically contacts and issues signed certificates to each node, and (2) for every sequence of k + 1 consecutive nodes in the ID space, at least one is alive and non-malicious. We show how NeighborhoodWatch maintains many of its security properties even when the second assumption is violated. Honest nodes in NeighborhoodWatch can detect malicious behavior and expel the responsible nodes from the DHT.}, keywords = {Communications Society, computer crime, cryptography, Databases, IP addresses, IP networks, on-line trusted authority, Peer to peer computing, peer-to-peer computing, peer-to-peer distributed hash table, Postal services, Relays, Resilience, Routing, Security, table size routing, Unsolicited electronic mail}, isbn = {978-1-4244-3512-8}, doi = {10.1109/INFCOM.2009.5062095}, author = {Bender,A. and Sherwood,R. and Monner,D. and Goergen,N. and Spring, Neil and Bhattacharjee, Bobby} } @conference {18835, title = {Formal Representation of Product Design Specifications for Validating Product Design}, year = {2009}, month = {2009///}, pages = {1411 - 1422}, publisher = {ASME}, organization = {ASME}, abstract = {As collaborative efforts in electro-mechanical design have scaled to large, distributed groups working for years on a single product, an increasingly large gulf has developed between the original stated goals of the project and the final design solution. It has thus become necessary to validate the final design solution against a set of requirements to ensure that these goals have, in fact, been met. This process has become tedious for complex products with hundreds of design aspects and requirements. By formalizing the representation of requirements and the design solution, tools can be developed to a large extent automatically perform this validation. In this paper, we propose a formal approach for relating product requirements to the design solution. First, we present a formal model for representing product requirements. Then, we introduce the Core Product Model (CPM) and the Open Assembly Model (OAM) for representing the design solution. Finally, we link these models formally and provide an example with an actual consumer device.}, isbn = {978-0-7918-4899-9}, doi = {10.1115/DETC2009-87307}, url = {http://link.aip.org/link/ASMECP/v2009/i48999/p1411/s1\&Agg=doi}, author = {Weissman,Alexander and Gupta, Satyandra K. and Fiorentini,Xenia and Sudarsan,Rachuri and Sriram,Ram} } @article {14465, title = {FutureRank: Ranking scientific articles by predicting their future PageRank}, journal = {Proceedings of the 9th SIAM International Conference on Data Mining}, year = {2009}, month = {2009///}, pages = {533 - 544}, abstract = {The dynamic nature of citation networks makes the taskof ranking scientific articles hard. Citation networks are continually evolving because articles obtain new citations every day. For ranking scientific articles, we can define the popularity or prestige of a paper based on the number of past citations at the user query time; however, we argue that what is most useful is the expected future references. We define a new measure, FutureRank, which is the expected future PageRank score based on citations that will be obtained in the future. In addition to making use of the citation network, FutureRank uses the authorship network and the publication time of the article in order to predict future citations. Our experiments compare FutureRank with existing approaches, and show that FutureRank is accurate and useful for finding and ranking publications. }, author = {Sayyadi,H. and Getoor, Lise} } @article {18764, title = {Generating simplified trapping probability models from simulation of optical tweezers system}, journal = {Journal of Computing and Information Science in Engineering}, volume = {9}, year = {2009}, month = {2009///}, pages = {021003 - 021003}, author = {Banerjee,A. G. and Balijepalli,A. and Gupta,S.K. and LeBrun,T. W.} } @inbook {12893, title = {The Genus Vibrio and Related Genera}, booktitle = {Practical handbook of microbiologyPractical handbook of microbiology}, year = {2009}, month = {2009///}, pages = {267 - 267}, publisher = {CRC Press}, organization = {CRC Press}, isbn = {9780849393655}, author = {Rita R Colwell and Chun,J.}, editor = {Goldman,Emanuel and Green,Lorrence H.} } @article {13371, title = {Graphical models for uncertain data}, journal = {Managing and Mining Uncertain Data}, year = {2009}, month = {2009///}, pages = {77 - 77}, author = {Deshpande, Amol and Getoor, Lise and Sen,P.} } @article {17186, title = {HEALTH AND WELLBEING}, journal = {The fourth paradigm: data-intensive scientific discovery}, year = {2009}, month = {2009///}, pages = {57 - 57}, author = {Gillam,M. and Feied,C. and MOODY,E. and Shneiderman, Ben and Smith,M. and DICKASON,J.} } @conference {13892, title = {How children search the internet with keyword interfaces}, booktitle = {Proceedings of the 8th International Conference on Interaction Design and Children}, year = {2009}, month = {2009///}, pages = {89 - 96}, author = {Druin, Allison and Foss,E. and Hatley,L. and Golub,E. and Guha,M.L. and Fails,J. and Hutchinson,H.} } @conference {14451, title = {Identifying graphs from noisy and incomplete data}, booktitle = {Proceedings of the 1st ACM SIGKDD Workshop on Knowledge Discovery from Uncertain Data}, series = {U {\textquoteright}09}, year = {2009}, month = {2009///}, pages = {23 - 29}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {There is a growing wealth of data describing networks of various types, including social networks, physical networks such as transportation or communication networks, and biological networks. At the same time, there is a growing interest in analyzing these networks, in order to uncover general laws that govern their structure and evolution, and patterns and predictive models to develop better policies and practices. However, a fundamental challenge in dealing with this newly available observational data describing networks is that the data is often of dubious quality -- it is noisy and incomplete -- and before any analysis method can be applied, the data must be cleaned, and missing information inferred. In this paper, we introduce the notion of graph identification, which explicitly models the inference of a "cleaned" output network from a noisy input graph. It is this output network that is appropriate for further analysis. We present an illustrative example and use the example to explore the types of inferences involved in graph identification, as well as the challenges and issues involved in combining those inferences. We then present a simple, general approach to combining the inferences in graph identification and experimentally show the utility of our combined approach and how the performance of graph identification is sensitive to the inter-dependencies among these inferences.}, keywords = {classification, data mining, entity resolution, link prediction, social networks, statistical relational learning}, isbn = {978-1-60558-675-5}, doi = {10.1145/1610555.1610559}, url = {http://doi.acm.org/10.1145/1610555.1610559}, author = {Namata,Jr.,Galileo Mark S. and Getoor, Lise} } @article {13973, title = {Imaging room acoustics with the audio camera.}, journal = {The Journal of the Acoustical Society of America}, volume = {125}, year = {2009}, month = {2009///}, pages = {2544 - 2544}, abstract = {Using a spherical microphone array and real time signal processing using a graphical processing unit (GPU), an audio camera has been developed. This device provides images of the intensity of the sound field arriving at a point from a specified direction to the spherical array. Real-time performance is achieved via use of GPUs. The intensity can be displayed integrated over the whole frequency band of the array, or in false color, with different frequency bands mapped to different color bands. The resulting audio camera may be combined with video cameras to achieve multimodal scene capture and analysis. A theory of registration of audio camera images with video camera images is developed, and joint analysis of audio and video images performed. An interesting application of the audio camera is the imaging of concert hall acoustics. The individual reflections that constitute the impulse response measured at a particular seat may be imaged, and their spatial origin determined. Other applications of the audio camera to people tracking, noise suppression, and camera pointing are also presented. [Work partially supported by NVIDIA and the VA.]}, url = {http://link.aip.org/link/?JAS/125/2544/2}, author = {O{\textquoteright}donovan,Adam and Duraiswami, Ramani and Gumerov, Nail A. and Zotkin,Dmitry N} } @conference {19033, title = {Implicit authentication for mobile devices}, series = {HotSec{\textquoteright}09}, year = {2009}, month = {2009}, pages = {9 - 9}, publisher = {USENIX Association}, organization = {USENIX Association}, abstract = {We introduce the notion of implicit authentication - the ability to authenticate mobile users based on actions they would carry out anyway. We develop a model for how to perform implicit authentication, and describe experiments aimed at assessing the benefits of our techniques. Our preliminary findings support that this is a meaningful approach, whether used to increase usability or increase security.}, url = {http://dl.acm.org/citation.cfm?id=1855628.1855637}, author = {Jakobsson, Markus and Elaine Shi and Golle, Philippe and Chow, Richard} } @article {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} } @inbook {18850, title = {In Situ Characterization and Modeling of Strains near Embedded Electronic Components During Processing and Break-in for Multifunctional Polymer Structures}, booktitle = {Advances in Mathematical Modeling and Experimental Methods for Materials and Structures}, series = {Solid Mechanics and Its Applications}, volume = {168}, year = {2009}, month = {2009///}, pages = {145 - 159}, publisher = {Springer Netherlands}, organization = {Springer Netherlands}, abstract = {Emerging molding concepts, such as in-mold assembly, are enabling electronic structures to be directly embedded in thermoplastic polymers to provide integrated packaging for better protection and a more multifunctional structure in {\textquotedblleft}in-mold assembly processes{\textquotedblright}. During the molding process, stress can develop at the interface of the polymer and embedded electronic component due to shrinkage of the polymer that precipitates fracture or fatigue during the life cycle of the product. Additionally, the interaction between a mold and the polymer melt is altered in a multi-stage molding process where a polymer for superior impact protection can be molded over another polymer that is more compatible with the embedded electronic component. Currently, we do not fully understand the impact of various parameters governing the in-mold assembly process on the residual strains that develop in polymers around embedded electronic components in order to develop process models. Therefore, in this chapter experiments are presented that are designed and executed to measure the strains involved and the manner in which they develop. An in situ open mold experiment is employed using the full-field deformation technique of Digital Image Correlation (DIC) to characterize the displacement and corresponding strain fields that evolve near embedded electronic elements as the polymer shrinks from the molten to the solid state during processes and during break-in of the electronic component. It was determined that the use of multi-stage molding may reduce the residual stresses in addition to providing superior impact protection. However, there was a higher concentration of strain near the polymer-component interface during break-due to lower thermal conductivity. Experimental data was consistent with a thermomechanical model up until the point of failure.}, keywords = {engineering}, isbn = {978-90-481-3467-0}, url = {http://www.springerlink.com/content/lh52x2475g7x00k7/abstract/}, author = {Gershon,Alan L. and Gyger,Lawrence S. and Bruck,Hugh A. and Gupta, Satyandra K.}, editor = {Gilat,Rivka and Banks-Sills,Leslie and Gladwell,G. M. L.} } @article {14478, title = {Index interactions in physical design tuning: modeling, analysis, and applications}, journal = {Proceedings of the VLDB Endowment}, volume = {2}, year = {2009}, month = {2009/08//}, pages = {1234 - 1245}, abstract = {One of the key tasks of a database administrator is to optimize the set of materialized indices with respect to the current workload. To aid administrators in this challenging task, commercial DBMSs provide advisors that recommend a set of indices based on a sample workload. It is left for the administrator to decide which of the recommended indices to materialize and when. This decision requires some knowledge of how the indices benefit the workload, which may be difficult to understand if there are any dependencies or interactions among indices. Unfortunately, advisors do not provide this crucial information as part of the recommendation. Motivated by this shortcoming, we propose a framework and associated tools that can help an administrator understand the interactions within the recommended set of indices. We formalize the notion of index interactions and develop a novel algorithm to identify the interaction relationships that exist within a set of indices. We present experimental results with a prototype implementation over IBM DB2 that demonstrate the efficiency of our approach. We also describe two new database tuning tools that utilize information about index interactions. The first tool visualizes interactions based on a partitioning of the index-set into non-interacting subsets, and the second tool computes a schedule that materializes the indices over several maintenance windows with maximal overall benefit. In both cases, we provide strong analytical results showing that index interactions can enable enhanced functionality.}, isbn = {2150-8097}, url = {http://dl.acm.org/citation.cfm?id=1687627.1687766}, author = {Schnaitter,Karl and Polyzotis,Neoklis and Getoor, Lise} } @conference {16275, title = {Inexact Local Alignment Search over Suffix Arrays}, booktitle = {IEEE International Conference on Bioinformatics and Biomedicine, 2009. BIBM {\textquoteright}09}, year = {2009}, month = {2009/11/01/4}, pages = {83 - 87}, publisher = {IEEE}, organization = {IEEE}, abstract = {We describe an algorithm for finding approximate seeds for DNA homology searches. In contrast to previous algorithms that use exact or spaced seeds, our approximate seeds may contain insertions and deletions. We present a generalized heuristic for finding such seeds efficiently and prove that the heuristic does not affect sensitivity. We show how to adapt this algorithm to work over the memory efficient suffix array with provably minimal overhead in running time. We demonstrate the effectiveness of our algorithm on two tasks: whole genome alignment of bacteria and alignment of the DNA sequences of 177 genes that are orthologous in human and mouse. We show our algorithm achieves better sensitivity and uses less memory than other commonly used local alignment tools.}, keywords = {bacteria, Bioinformatics, biology computing, Computational Biology, Costs, DNA, DNA homology searches, DNA sequences, Educational institutions, generalized heuristic, genes, Genetics, genome alignment, Genomics, human, inexact local alignment search, inexact seeds, local alignment, local alignment tools, memory efficient suffix array, microorganisms, molecular biophysics, mouse, Organisms, Sensitivity and Specificity, sequences, suffix array, USA Councils}, isbn = {978-0-7695-3885-3}, doi = {10.1109/BIBM.2009.25}, author = {Ghodsi,M. and Pop, Mihai} } @conference {19110, title = {Inexact Local Alignment Search over Suffix Arrays}, year = {2009}, month = {2009}, pages = {83 - 87}, author = {Ghodsi,M. and Pop, Mihai} } @article {19460, title = {The Ins and Outs of Home Networking: The Case for Useful and Usable Domestic Networking}, journal = {ACM Trans. Comput.-Hum. Interact.}, volume = {16}, year = {2009}, month = {2009/06//}, pages = {8:1 - 8:28}, abstract = {Householders are increasingly adopting home networking as a solution to the demands created by the presence of multiple computers, devices, and the desire to access the Internet. However, current network solutions are derived from the world of work (and initially the military) and provide poor support for the needs of the home. We present the key findings to emerge from empirical studies of home networks in the UK and US. The studies reveal two key kinds of work that effective home networking relies upon: one, the technical work of setting up and maintaining the home network, and the other, the collaborative and socially organized work of the home which the network is embedded in and supports. The two are thoroughly intertwined and rely upon one another for their realization, yet neither is adequately supported by current networking technologies and applications. Explication of the {\textquotedblleft}work to make the home network work{\textquotedblright} opens up the design space for the continued integration of the home network in domestic life and elaboration of future support. Key issues for development include the development of networking facilities that do not require advanced networking knowledge, that are flexible and support the local social order of the home and the evolution of its routines, and which ultimately make the home network visible and accountable to household members.}, keywords = {home networking, Human computer interaction}, isbn = {1073-0516}, url = {http://doi.acm.org/10.1145/1534903.1534905}, author = {Grinter, Rebecca E. and Edwards, W. Keith and Marshini Chetty and Poole, Erika S. and Sung, Ja-Young and Yang, Jeonghwa and Crabtree, Andy and Tolmie, Peter and Rodden, Tom and Greenhalgh, Chris and Benford, Steve} } @article {18751, title = {Integrated product and process design for a flapping wing drive mechanism}, journal = {Journal of Mechanical Design}, volume = {131}, year = {2009}, month = {2009///}, pages = {061006 - 061006}, author = {Bejgerowski,W. and Ananthanarayanan,A. and Mueller,D. and Gupta,S.K.} } @inbook {13797, title = {Interlingual annotation of multilingual text corpora and FrameNet}, booktitle = {Multilingual FrameNets in Computational LexicographyMultilingual FrameNets in Computational Lexicography}, volume = {200}, year = {2009}, month = {2009/07/14/}, pages = {287 - 318}, publisher = {Mouton de Gruyter}, organization = {Mouton de Gruyter}, address = {Berlin, New York}, isbn = {978-3-11-021296-9, 978-3-11-021297-6}, url = {http://www.degruyter.com/view/books/9783110212976/9783110212976.4.287/9783110212976.4.287.xml}, author = {Farwell,David and Dorr, Bonnie J and Habash,Nizar and Helmreich,Stephen and Hovy,Eduard and Green,Rebecca and Levin,Lori and Miller,Keith and Mitamura,Teruko and Rambow,Owen and Reeder,Flo and Siddharthan,Advaith}, editor = {Bisang,Walter and Hock,Hans Henrich and Winter,Werner and Boas,Hans C.} } @article {18230, title = {Intrinsic Sensor Noise Features for Forensic Analysis on Scanners and Scanned Images}, journal = {Information Forensics and Security, IEEE Transactions on}, volume = {4}, year = {2009}, month = {2009/09//}, pages = {476 - 491}, abstract = {A large portion of digital images available today are acquired using digital cameras or scanners. While cameras provide digital reproduction of natural scenes, scanners are often used to capture hard-copy art in a more controlled environment. In this paper, new techniques for nonintrusive scanner forensics that utilize intrinsic sensor noise features are proposed to verify the source and integrity of digital scanned images. Scanning noise is analyzed from several aspects using only scanned image samples, including through image denoising, wavelet analysis, and neighborhood prediction, and then obtain statistical features from each characterization. Based on the proposed statistical features of scanning noise, a robust scanner identifier is constructed to determine the model/brand of the scanner used to capture a scanned image. Utilizing these noise features, we extend the scope of acquisition forensics to differentiating scanned images from camera-taken photographs and computer-generated graphics. The proposed noise features also enable tampering forensics to detect postprocessing operations on scanned images. Experimental results are presented to demonstrate the effectiveness of employing the proposed noise features for performing various forensic analysis on scanners and scanned images.}, keywords = {analysis;image, camera-taken, cameras;digital, denoising;intrinsic, denoising;wavelet, features;natural, forensics;scanned, graphics;digital, identifier;wavelet, images;digital, images;scanner, NOISE, photographs;computer-generated, prediction;nonintrusive, reproduction;forensic, scanner, scenes;neighborhood, sensor, transforms;}, isbn = {1556-6013}, doi = {10.1109/TIFS.2009.2026458}, author = {Gou,Hongmei and Swaminathan,A. and M. Wu} } @article {14427, title = {Link-based active learning}, journal = {NIPS Workshop on Analyzing Networks and Learning with Graphs}, year = {2009}, month = {2009///}, abstract = {Supervised and semi-supervised data mining techniques require labeled data.However, labeling examples is costly for many real-world applications. To ad- dress this problem, active learning techniques have been developed to guide the labeling process in an effort to minimize the amount of labeled data without sac- rificing much from the quality of the learned models. Yet, most of the active learning methods to date have remained relatively agnostic to the rich structure offered by network data, often ignoring the relationships between the nodes of a network. On the other hand, the relational learning community has shown that the relationships can be very informative for various prediction tasks. In this paper, we propose different ways of adapting existing active learning work to network data while utilizing links to select better examples to label. }, author = {Bilgic,M. and Getoor, Lise} } @article {13895, title = {The Maryland Modular Method: An Approach to Doctoral Education in Information Studies}, journal = {Journal of education for library and information science}, volume = {50}, year = {2009}, month = {2009///}, pages = {293 - 301}, author = {Druin, Allison and Jaeger,P. T and Golbeck,J. and Fleischmann,K.R. and Jimmy Lin and Qu,Y. and Wang,P. and Xie,B.} } @conference {15896, title = {Matching person names through name transformation}, booktitle = {Proceedings of the 18th ACM conference on Information and knowledge management}, series = {CIKM {\textquoteright}09}, year = {2009}, month = {2009///}, pages = {1875 - 1878}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Matching person names plays an important role in many applications, including bibliographic databases and indexing systems. Name variations and spelling errors make exact string matching problematic; therefore, it is useful to develop methodologies that can handle variant forms for the same named entity. In this paper, a novel person name matching model is presented. Common name variations in the English speaking world are formalized, and the concept of name transformation paths is introduced; name similarity is measured after the best transformation path has been selected. Supervised techniques are used to learn a similarity function and a decision rule. Experiments with three datasets show the method to be effective.}, keywords = {name matching, string distance metrics, string similarity}, isbn = {978-1-60558-512-3}, doi = {10.1145/1645953.1646253}, url = {http://doi.acm.org/10.1145/1645953.1646253}, author = {Gong,Jun and Wang,Lidan and Oard, Douglas} } @article {14352, title = {On maximum coverage in the streaming model \& application to multi-topic blog-watch}, journal = {2009 SIAM International Conference on Data Mining (SDM09)}, year = {2009}, month = {2009///}, abstract = {We generalize the graph streaming model to hypergraphs.In this streaming model, hyperedges are arriving online and any computation has to be done on-the-fly using a small amount of space. Each hyperedge can be viewed as a set of elements (nodes), so we refer to our proposed model as the {\textquotedblleft}set-streaming{\textquotedblright} model of computation. We consider the problem of {\textquotedblleft}maximum coverage{\textquotedblright}, in which k sets have to be selected that maximize the total weight of the covered elements. In the set-streaming model of computation, we show that our algorithm for maximum- coverage achieves an approximation factor of 1 . When multiple passes are allowed, we also provide a Θ(log n) approximation algorithm for the set-cover. We next consider a multi-topic blog-watch application, an extension of blog- alert like applications for handling simultaneous multiple- topic requests. We show how the problems of maximum- coverage and set-cover in the set-streaming model can be utilized to give efficient online solutions to this problem. We verify the effectiveness of our methods both on synthetic and real weblog data. }, author = {Saha,B. and Getoor, Lise} } @conference {16683, title = {More than words: Syntactic packaging and implicit sentiment}, booktitle = {Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics}, year = {2009}, month = {2009///}, pages = {503 - 511}, author = {Greene,S. and Resnik, Philip} } @article {12524, title = {Moving Object Verification in Airborne Video Sequences}, journal = {Circuits and Systems for Video Technology, IEEE Transactions on}, volume = {19}, year = {2009}, month = {2009/01//}, pages = {77 - 89}, abstract = {This paper presents an end-to-end system for moving object verification in airborne video sequences. Using a sample selection module, the system first selects frames from a short sequence and stores them in an exemplar database. To handle appearance change due to potentially large aspect angle variations, a homography-based view synthesis method is then used to generate a novel view of each image in the exemplar database at the same pose as the testing object in each frame of a testing video segment. A rotationally invariant color matcher and a spatial-feature matcher based on distance transforms are combined using a weighted average rule to compare the novel view and the testing object. After looping over all testing frames, the set of match scores is passed to a temporal analysis module to examine the behavior of the testing object, and calculate a final likelihood. Very good verification performance is achieved over thousands of trials for both color and infrared video sequences using the proposed system.}, keywords = {airborne, database;homography-based, databases;, matcher;color, matcher;image, matching;image, method;infrared, object, sequences;color, sequences;distance, sequences;moving, sequences;video, synthesis, system;exemplar, transforms;end-to-end, verification;spatial-feature, video, view}, isbn = {1051-8215}, doi = {10.1109/TCSVT.2008.2009243}, author = {Yue,Zhanfeng and Guarino, D. and Chellapa, Rama} } @conference {14564, title = {Network-aware forward caching}, booktitle = {Proceedings of the 18th international conference on World wide web}, series = {WWW {\textquoteright}09}, year = {2009}, month = {2009///}, pages = {291 - 300}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {This paper proposes and evaluates a Network Aware Forward Caching approach for determining the optimal deployment strategy of forward caches to a network. A key advantage of this approach is that we can reduce the network costs associated with forward caching to maximize the benefit obtained from their deployment. We show in our simulation that a 37\% increase to net benefits could be achieved over the standard method of full cache deployment to cache all POPs traffic. In addition, we show that this maximal point occurs when only 68\% of the total traffic is cached. Another contribution of this paper is the analysis we use to motivate and evaluate this problem. We characterize the Internet traffic of 100K subscribers of a US residential broadband provider. We use both layer 4 and layer 7 analysis to investigate the traffic volumes of the flows as well as study the general characteristics of the applications used. We show that HTTP is a dominant protocol and account for 68\% of the total downstream traffic and that 34\% of that traffic is multimedia. In addition, we show that multimedia content using HTTP exhibits a 83\% annualized growth rate and other HTTP traffic has a 53\% growth rate versus the 26\% over all annual growth rate of broadband traffic. This shows that HTTP traffic will become ever more dominent and increase the potential caching opportunities. Furthermore, we characterize the core backbone traffic of this broadband provider to measure the distance travelled by content and traffic. We find that CDN traffic is much more efficient than P2P content and that there is large skew in the Air Miles between POP in a typical network. Our findings show that there are many opportunties in broadband provider networks to optimize how traffic is delivered and cached.}, keywords = {caching, Web}, isbn = {978-1-60558-487-4}, doi = {10.1145/1526709.1526749}, url = {http://doi.acm.org/10.1145/1526709.1526749}, author = {Erman,Jeffrey and Gerber,Alexandre and Hajiaghayi, Mohammad T. and Pei,Dan and Spatscheck,Oliver} } @article {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 {14456, title = {Opinion graphs for polarity and discourse classification}, booktitle = {Proceedings of the 2009 Workshop on Graph-based Methods for Natural Language Processing}, series = {TextGraphs-4}, year = {2009}, month = {2009///}, pages = {66 - 74}, publisher = {Association for Computational Linguistics}, organization = {Association for Computational Linguistics}, address = {Stroudsburg, PA, USA}, abstract = {This work shows how to construct discourse-level opinion graphs to perform a joint interpretation of opinions and discourse relations. Specifically, our opinion graphs enable us to factor in discourse information for polarity classification, and polarity information for discourse-link classification. This inter-dependent framework can be used to augment and improve the performance of local polarity and discourse-link classifiers.}, isbn = {978-1-932432-54-1}, url = {http://dl.acm.org/citation.cfm?id=1708124.1708138}, author = {Somasundaran,Swapna and Namata,Galileo and Getoor, Lise and Wiebe,Janyce} } @article {14495, title = {P r DB: managing and exploiting rich correlations in probabilistic databases}, journal = {The VLDB Journal}, volume = {18}, year = {2009}, month = {2009///}, pages = {1065 - 1090}, abstract = {Due to numerous applications producing noisy data, e.g., sensor data, experimental data, data from uncurated sources, information extraction, etc., there has been a surge of interest in the development of probabilistic databases. Most probabilistic database models proposed to date, however, fail to meet the challenges of real-world applications on two counts: (1) they often restrict the kinds of uncertainty that the user can represent; and (2) the query processing algorithms often cannot scale up to the needs of the application. In this work, we define a probabilistic database model, PrDB, that uses graphical models, a state-of-the-art probabilistic modeling technique developed within the statistics and machine learning community, to model uncertain data. We show how this results in a rich, complex yet compact probabilistic database model, which can capture the commonly occurring uncertainty models (tuple uncertainty, attribute uncertainty), more complex models (correlated tuples and attributes) and allows compact representation (shared and schema-level correlations). In addition, we show how query evaluation in PrDB translates into inference in an appropriately augmented graphical model. This allows us to easily use any of a myriad of exact and approximate inference algorithms developed within the graphical modeling community. While probabilistic inference provides a generic approach to solving queries, we show how the use of shared correlations, together with a novel inference algorithm that we developed based on bisimulation, can speed query processing significantly. We present a comprehensive experimental evaluation of the proposed techniques and show that even with a few shared correlations, significant speedups are possible.}, doi = {10.1007/s00778-009-0153-2}, author = {Sen,P. and Deshpande, Amol and Getoor, Lise} } @article {13394, title = {PrDB: managing and exploiting rich correlations in probabilistic databases}, journal = {The VLDB Journal}, volume = {18}, year = {2009}, month = {2009///}, pages = {1065 - 1090}, abstract = {Due to numerous applications producing noisy data, e.g., sensor data, experimental data, data from uncurated sources, information extraction, etc., there has been a surge of interest in the development of probabilistic databases. Most probabilistic database models proposed to date, however, fail to meet the challenges of real-world applications on two counts: (1) they often restrict the kinds of uncertainty that the user can represent; and (2) the query processing algorithms often cannot scale up to the needs of the application. In this work, we define a probabilistic database model, P r DB, that uses graphical models, a state-of-the-art probabilistic modeling technique developed within the statistics and machine learning community, to model uncertain data. We show how this results in a rich, complex yet compact probabilistic database model, which can capture the commonly occurring uncertainty models (tuple uncertainty, attribute uncertainty), more complex models (correlated tuples and attributes) and allows compact representation (shared and schema-level correlations). In addition, we show how query evaluation in P r DB translates into inference in an appropriately augmented graphical model. This allows us to easily use any of a myriad of exact and approximate inference algorithms developed within the graphical modeling community. While probabilistic inference provides a generic approach to solving queries, we show how the use of shared correlations, together with a novel inference algorithm that we developed based on bisimulation, can speed query processing significantly. We present a comprehensive experimental evaluation of the proposed techniques and show that even with a few shared correlations, significant speedups are possible.}, isbn = {1066-8888}, url = {http://dx.doi.org/10.1007/s00778-009-0153-2}, author = {Sen,Prithviraj and Deshpande, Amol and Getoor, Lise} } @inbook {13395, title = {PrDB: Managing Large-Scale Correlated Probabilistic Databases (Abstract)}, booktitle = {Scalable Uncertainty ManagementScalable Uncertainty Management}, series = {Lecture Notes in Computer Science}, volume = {5785}, year = {2009}, month = {2009///}, pages = {1 - 1}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {Increasing numbers of real-world application domains are generating data that is inherently noisy, incomplete, and probabilistic in nature. Statistical inference and probabilistic modeling often introduce another layer of uncertainty on top of that. Examples of such data include measurement data collected by sensor networks, observation data in the context of social networks, scientific and biomedical data, and data collected by various online cyber-sources. Over the last few years, numerous approaches have been proposed, and several systems built, to integrate uncertainty into databases. However, these approaches typically make simplistic and restrictive assumptions concerning the types of uncertainties that can be represented. Most importantly, they often make highly restrictive independence assumptions, and cannot easily model rich correlations among the tuples or attribute values. Furthermore, they typically lack support for specifying uncertainties at different levels of abstractions, needed to handle large-scale uncertain datasets.}, isbn = {978-3-642-04387-1}, url = {http://dx.doi.org/10.1007/978-3-642-04388-8_1}, author = {Deshpande, Amol}, editor = {Godo,Llu{\'\i}s and Pugliese,Andrea} } @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} } @conference {17329, title = {Promoting social creativity: a component of a national initiative for social participation}, booktitle = {Proceedings of the seventh ACM conference on Creativity and cognition}, series = {C\&$\#$38;C {\textquoteright}09}, year = {2009}, month = {2009///}, pages = {7 - 8}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {This panel will discuss group processes that promote social creativity in science, engineering, arts, and humanities. We will offer positive and negative examples of social creativity projects, while suggesting research directions for dramatically increased social participation. The goal is to develop strategies that would expand resources and opportunities for research and education in social creativity. This requires our community to develop a unified position, then reach out to national science funding agencies, while building the case for the importance of this topic beyond our own community. How can social creativity, collaborative discovery, distributed innovation, and collective intelligence be framed as an international priority to cope with the problems of the 21st century and how can we identify a clear set of research challenges? The theme of technology-mediated social participation is outlined in the white paper for a National Initiative for Social Participation (http://iparticipate.wikispaces.com). The white paper suggests that successful research challenges should have three key elements: (1) compelling national need (healthcare, national security, community safety, education, innovation, cultural heritage, energy sustainability, environmental protection, etc.), (2) scientific foundation based on established theories and well-defined research questions (privacy, reciprocity, trust, motivation, recognition, etc.), and (3) computer science research challenges (security, privacy protection, scalability, visualization, end-user development, distributed data handling for massive user-generated content, network analysis of community evolution, cross network comparison, etc.). We seek recommendations for ways to increase the resources and attention for this field. We hope to inspire: universities to change course content, add courses, and offer new degree programs industry to help researchers on social creativity government to support these ideas and try them out in government applications scientists and artists to open themselves to more social/collaborative approaches}, keywords = {research agenda, social creativity, social participation}, isbn = {978-1-60558-865-0}, doi = {10.1145/1640233.1640237}, url = {http://doi.acm.org/10.1145/1640233.1640237}, author = {Shneiderman, Ben and Churchill,Elizabeth and Fischer,Gerhard and Goldberg,Ken} } @article {19667, title = {Protein quantification across hundreds of experimental conditions}, journal = {Proceedings of the National Academy of Sciences}, volume = {106}, year = {2009}, month = {2009/09/15/}, pages = {15544 - 15548}, abstract = {Quantitative studies of protein abundance rarely span more than a small number of experimental conditions and replicates. In contrast, quantitative studies of transcript abundance often span hundreds of experimental conditions and replicates. This situation exists, in part, because extracting quantitative data from large proteomics datasets is significantly more difficult than reading quantitative data from a gene expression microarray. To address this problem, we introduce two algorithmic advances in the processing of quantitative proteomics data. First, we use space-partitioning data structures to handle the large size of these datasets. Second, we introduce techniques that combine graph-theoretic algorithms with space-partitioning data structures to collect relative protein abundance data across hundreds of experimental conditions and replicates. We validate these algorithmic techniques by analyzing several datasets and computing both internal and external measures of quantification accuracy. We demonstrate the scalability of these techniques by applying them to a large dataset that comprises a total of 472 experimental conditions and replicates.}, keywords = {kd-tree, orthogonal range query, quantitative proteomics, space partitioning data structures, tandem mass spectrometry}, isbn = {0027-8424, 1091-6490}, url = {http://www.pnas.org/content/106/37/15544}, author = {Zia Khan and Bloom, Joshua S. and Garcia, Benjamin A. and Singh, Mona and Kruglyak, Leonid} } @conference {12412, title = {Reading tea leaves: How humans interpret topic models}, booktitle = {Proceedings of the 23rd Annual Conference on Neural Information Processing Systems}, volume = {31}, year = {2009}, month = {2009///}, abstract = {Probabilistic topic models are a popular tool for the unsupervised analysis of text, providing both a predictive model of future text and a latent topic representation of the corpus. Practitioners typically assume that the latent space is semantically meaningful. It is used to check models, summarize the corpus, and guide explo- ration of its contents. However, whether the latent space is interpretable is in need of quantitative evaluation. In this paper, we present new quantitative methods for measuring semantic meaning in inferred topics. We back these measures with large-scale user studies, showing that they capture aspects of the model that are undetected by previous measures of model quality based on held-out likelihood. Surprisingly, topic models which perform better on held-out likelihood may infer less semantically meaningful topics.}, author = {Chang,J. and Jordan Boyd-Graber and Gerrish,S. and Wang,C. and Blei,D.M.} } @article {14368, title = {Reflect and correct: A misclassification prediction approach to active inference}, journal = {ACM Transactions on Knowledge Discovery from Data (TKDD)}, volume = {3}, year = {2009}, month = {2009/12//}, pages = {20:1{\textendash}20:32 - 20:1{\textendash}20:32}, abstract = {Information diffusion, viral marketing, graph-based semi-supervised learning, and collective classification all attempt to model and exploit the relationships among nodes in a network to improve the performance of node labeling algorithms. However, sometimes the advantage of exploiting the relationships can become a disadvantage. Simple models like label propagation and iterative classification can aggravate a misclassification by propagating mistakes in the network, while more complex models that define and optimize a global objective function, such as Markov random fields and graph mincuts, can misclassify a set of nodes jointly. This problem can be mitigated if the classification system is allowed to ask for the correct labels for a few of the nodes during inference. However, determining the optimal set of labels to acquire is intractable under relatively general assumptions, which forces us to resort to approximate and heuristic techniques. We describe three such techniques in this article. The first one is based on directly approximating the value of the objective function of label acquisition and greedily acquiring the label that provides the most improvement. The second technique is a simple technique based on the analogy we draw between viral marketing and label acquisition. Finally, we propose a method, which we refer to as reflect and correct, that can learn and predict when the classification system is likely to make mistakes and suggests acquisitions to correct those mistakes. We empirically show on a variety of synthetic and real-world datasets that the reflect and correct method significantly outperforms the other two techniques, as well as other approaches based on network structural measures such as node degree and network clustering.}, keywords = {active inference, collective classification, information diffusion, label acquisition, viral marketing}, isbn = {1556-4681}, doi = {10.1145/1631162.1631168}, url = {http://doi.acm.org/10.1145/1631162.1631168}, author = {Bilgic,Mustafa and Getoor, Lise} } @conference {18467, title = {Regularized HRTF fitting using spherical harmonics}, booktitle = {IEEE Workshop on Applications of Signal Processing to Audio and Acoustics, 2009. WASPAA {\textquoteright}09}, year = {2009}, month = {2009/10//}, pages = {257 - 260}, publisher = {IEEE}, organization = {IEEE}, abstract = {By the Helmholtz reciprocity principle, the head-related transfer function (HRTF) is equivalent to an acoustic field created by a transmitter placed at the ear location. Therefore, it can be represented as a spherical harmonics spectrum - a weighted sum of spherical harmonics. Such representations are useful in theoretical and computational analysis. Many different (often severely undersampled) grids are used for HRTF measurement, making the spectral reconstruction difficult. In this paper, two methods of obtaining the spectrum are presented and analyzed both on synthetic (ground-truth data available) and real HRTF measurements.}, keywords = {Acoustic applications, acoustic field, Acoustic fields, acoustic intensity measurement, Acoustic measurements, acoustic signal processing, Acoustic testing, acoustic waves, array signal processing, audio acoustics, circular arrays, computational analysis, Ear, ear location, head-related transfer function, Helmholtz reciprocity principle, HRTF, HRTF fitting, Loudspeakers, Microphones, Position measurement, signal reconstruction, spatial audio, spectral reconstruction, spherical harmonics, Transfer functions}, isbn = {978-1-4244-3678-1}, doi = {10.1109/ASPAA.2009.5346521}, author = {Zotkin,Dmitry N and Duraiswami, Ramani and Gumerov, Nail A.} } @conference {17653, title = {Rigorous Probabilistic Trust-Inference with Applications to Clustering}, booktitle = {IEEE/WIC/ACM International Joint Conferences on Web Intelligence and Intelligent Agent Technologies, 2009. WI-IAT {\textquoteright}09}, volume = {1}, year = {2009}, month = {2009/09/15/18}, pages = {655 - 658}, publisher = {IEEE}, organization = {IEEE}, abstract = {The World Wide Web has transformed into an environment where users both produce and consume information. In order to judge the validity of information, it is important to know how trustworthy its creator is. Since no individual can have direct knowledge of more than a small fraction of information authors, methods for inferring trust are needed. We propose a new trust inference scheme based on the idea that a trust network can be viewed as a random graph, and a chain of trust as a path in that graph. In addition to having an intuitive interpretation, our algorithm has several advantages, noteworthy among which is the creation of an inferred trust-metric space where the shorter the distance between two people, the higher their trust. Metric spaces have rigorous algorithms for clustering, visualization, and related problems, any of which is directly applicable to our results.}, keywords = {Clustering algorithms, Conferences, Educational institutions, Extraterrestrial measurements, Inference algorithms, Intelligent agent, random graphs, Social network services, trust inferrence, Visualization, Voting, Web sites}, isbn = {978-0-7695-3801-3}, doi = {10.1109/WI-IAT.2009.109}, author = {DuBois,Thomas and Golbeck,Jennifer and Srinivasan, Aravind} } @article {12884, title = {RNA Colony Blot Hybridization Method for Enumeration of Culturable Vibrio Cholerae and Vibrio Mimicus Bacteria}, journal = {Applied and Environmental MicrobiologyAppl. Environ. Microbiol.}, volume = {75}, year = {2009}, month = {2009/09/01/}, pages = {5439 - 5444}, abstract = {A species-specific RNA colony blot hybridization protocol was developed for enumeration of culturable Vibrio cholerae and Vibrio mimicus bacteria in environmental water samples. Bacterial colonies on selective or nonselective plates were lysed by sodium dodecyl sulfate, and the lysates were immobilized on nylon membranes. A fluorescently labeled oligonucleotide probe targeting a phylogenetic signature sequence of 16S rRNA of V. cholerae and V. mimicus was hybridized to rRNA molecules immobilized on the nylon colony lift blots. The protocol produced strong positive signals for all colonies of the 15 diverse V. cholerae-V. mimicus strains tested, indicating 100\% sensitivity of the probe for the targeted species. For visible colonies of 10 nontarget species, the specificity of the probe was calculated to be 90\% because of a weak positive signal produced by Grimontia (Vibrio) hollisae, a marine bacterium. When both the sensitivity and specificity of the assay were evaluated using lake water samples amended with a bioluminescent V. cholerae strain, no false-negative or false-positive results were found, indicating 100\% sensitivity and specificity for culturable bacterial populations in freshwater samples when G. hollisae was not present. When the protocol was applied to laboratory microcosms containing V. cholerae attached to live copepods, copepods were found to carry approximately 10,000 to 50,000 CFU of V. cholerae per copepod. The protocol was also used to analyze pond water samples collected in an area of cholera endemicity in Bangladesh over a 9-month period. Water samples collected from six ponds demonstrated a peak in abundance of total culturable V. cholerae bacteria 1 to 2 months prior to observed increases in pathogenic V. cholerae and in clinical cases recorded by the area health clinic. The method provides a highly specific and sensitive tool for monitoring the dynamics of V. cholerae in the environment. The RNA blot hybridization protocol can also be applied to detection of other gram-negative bacteria for taxon-specific enumeration.}, isbn = {0099-2240, 1098-5336}, doi = {10.1128/AEM.02007-08}, url = {http://aem.asm.org/content/75/17/5439}, author = {Grim,Christopher J. and Zo,Young-Gun and Hasan,Nur A. and Ali,Afsar and Chowdhury,Wasimul B. and Islam,Atiqul and Rashid,Mohammed H. and Alam,Munirul and Morris,J. Glenn and Huq,Anwar and Rita R Colwell} } @article {12529, title = {Robust human detection under occlusion by integrating face and person detectors}, journal = {Proceedings of the Third International Conference on Advances in Biometrics}, year = {2009}, month = {2009///}, pages = {970 - 979}, abstract = {Human detection under occlusion is a challenging problemin computer vision. We address this problem through a framework which integrates face detection and person detection. We first investigate how the response of a face detector is correlated with the response of a person detector. From these observations, we formulate hypotheses that capture the intuitive feedback between the responses of face and person detectors and use it to verify if the individual detectors{\textquoteright} outputs are true or false. We illustrate the performance of our integration framework on challeng- ing images that have considerable amount of occlusion, and demonstrate its advantages over individual face and person detectors. }, author = {Schwartz, W.R. and Gopalan,R. and Chellapa, Rama and Davis, Larry S.} } @article {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 {15895, title = {Selecting hierarchical clustering cut points for web person-name disambiguation}, 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 = {778 - 779}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Hierarchical clustering is often used to cluster person-names referring to the same entities. Since the correct number of clusters for a given person-name is not known a priori, some way of deciding where to cut the resulting dendrogram to balance risks of over- or under-clustering is needed. This paper reports on experiments in which outcome-specific and result-set measures are used to learn a global similarity threshold. Results on the Web People Search (WePS)-2 task indicate that approximately 85\% of the optimal F1 measure can be achieved on held-out data.}, keywords = {clustering, person-name disambiguation}, isbn = {978-1-60558-483-6}, doi = {10.1145/1571941.1572124}, url = {http://doi.acm.org/10.1145/1571941.1572124}, author = {Gong,Jun and Oard, Douglas} } @article {13856, title = {Semantically informed machine translation (SIMT)}, journal = {SCALE summer workshop final report, Human Language Technology Center Of Excellence}, year = {2009}, month = {2009///}, author = {Baker,K. and Bethard,S. and Bloodgood,M. and Brown,R. and Callison-Burch,C. and Coppersmith,G. and Dorr, Bonnie J and Filardo,W. and Giles,K. and Irvine,A. and others} } @article {12882, title = {Serogroup, Virulence, and Genetic Traits of Vibrio Parahaemolyticus in the Estuarine Ecosystem of Bangladesh}, journal = {Applied and Environmental MicrobiologyAppl. Environ. Microbiol.}, volume = {75}, year = {2009}, month = {2009/10/01/}, pages = {6268 - 6274}, abstract = {Forty-two strains of Vibrio parahaemolyticus were isolated from Bay of Bengal estuaries and, with two clinical strains, analyzed for virulence, phenotypic, and molecular traits. Serological analysis indicated O8, O3, O1, and K21 to be the major O and K serogroups, respectively, and O8:K21, O1:KUT, and O3:KUT to be predominant. The K antigen(s) was untypeable, and pandemic serogroup O3:K6 was not detected. The presence of genes toxR and tlh were confirmed by PCR in all but two strains, which also lacked toxR. A total of 18 (41\%) strains possessed the virulence gene encoding thermostable direct hemolysin (TDH), and one had the TDH-related hemolysin (trh) gene, but not tdh. Ten (23\%) strains exhibited Kanagawa phenomenon that surrogates virulence, of which six, including the two clinical strains, possessed tdh. Of the 18 tdh-positive strains, 17 (94\%), including the two clinical strains, had the seromarker O8:K21, one was O9:KUT, and the single trh-positive strain was O1:KUT. None had the group-specific or ORF8 pandemic marker gene. DNA fingerprinting employing pulsed-field gel electrophoresis (PFGE) of SfiI-digested DNA and cluster analysis showed divergence among the strains. Dendrograms constructed using PFGE (SfiI) images from a soft database, including those of pandemic and nonpandemic strains of diverse geographic origin, however, showed that local strains formed a cluster, i.e., {\textquotedblleft}clonal cluster,{\textquotedblright} as did pandemic strains of diverse origin. The demonstrated prevalence of tdh-positive and diarrheagenic serogroup O8:K21 strains in coastal villages of Bangladesh indicates a significant human health risk for inhabitants.}, isbn = {0099-2240, 1098-5336}, doi = {10.1128/AEM.00266-09}, url = {http://aem.asm.org/content/75/19/6268}, author = {Alam,Munirul and Chowdhury,Wasimul B. and Bhuiyan,N. A. and Islam,Atiqul and Hasan,Nur A. and Nair,G. Balakrish and Watanabe,H. and Siddique,A. K. and Huq,Anwar and Sack,R. Bradley and Akhter,M. Z. and Grim,Christopher J. and Kam,K.-M. and Luey,C. K. Y. and Endtz,Hubert P. and Cravioto,Alejandro and Rita R Colwell} } @mastersthesis {17358, title = {Shape Identification in Temporal Data Sets}, year = {2009}, month = {2009///}, school = {Master{\textquoteright}s thesis, University of Maryland}, abstract = {Shapes are a concise way to describe temporal variable behaviors.Some commonly used shapes are spikes, sinks, rises, and drops. A spike describes a set of variable values that rapidly increase, then immediately rapidly decrease. The variable may be the value of a stock or a person{\textquoteright}s blood sugar levels. Shapes are abstract. Details such as the height of spike or its rate increase, are lost in the ab- straction. These hidden details make it difficult to define shapes and compare one to another. For example, what attributes of a spike determine its {\textquotedblleft}spikiness{\textquotedblright}? The ability to define and com- pare shapes is important because it allows shapes to be identified and ranked, according to an attribute of interest. Work has been done in the area of shape identification through pattern matching and other data mining techniques, but ideas combining the identifi- cation and comparison of shapes have received less attention. This paper fills the gap by presenting a set of shapes and the attributes by which they can identified, compared, and ranked. Neither the set of shapes, nor their attributes presented in this paper are exhaustive, but it provides an example of how a shape{\textquoteright}s attributes can be used for identification and comparison. The intention of this paper is not to replace any particular mathematical method of identifying a par- ticular behavior, but to provide a toolset for knowledge discovery and an intuitive method of data mining for novices. Spikes, sinks, rises, drops, lines, plateaus, valleys, and gaps are the shapes pre- sented in this paper. Several attributes for each shape are defined. These attributes will be the basis for constructing definitions that allow the shapes to be identified and ranked. The second contri- bution is an information visualization tool, TimeSearcher: Shape Search Edition (SSE), which allows users to explore data sets using the identification and ranking ideas in this paper. }, author = {Gregory,M.B. and Shneiderman, Ben} } @article {17754, title = {SPOT Databases: Efficient Consistency Checking and Optimistic Selection in Probabilistic Spatial Databases}, journal = {Knowledge and Data Engineering, IEEE Transactions on}, volume = {21}, year = {2009}, month = {2009/01//}, pages = {92 - 107}, abstract = {Spatial probabilistic temporal (SPOT) databases are a paradigm for reasoning with probabilistic statements about where a vehicle may be now or in the future. They express statements of the form "Object O is in spatial region R at some time t with some probability in the interval [L,U]." Past work on SPOT databases has developed selection operators based on selecting SPOT atoms that are entailed by the SPOT database-we call this "cautious" selection. In this paper, we study several problems. First, we note that the runtime of consistency checking and cautious selection algorithms in past work is influenced greatly by the granularity of the underlying Cartesian space. In this paper, we first introduce the notion of "optimistic" selection, where we are interested in returning all SPOT atoms in a database that are consistent with respect to a query, rather than having an entailment relationship. We then develop an approach to scaling SPOT databases that has three main contributions: 1) We develop methods to eliminate variables from the linear programs used in past work, thus greatly reducing the size of the linear programs used-the resulting advances apply to consistency checking, optimistic selection, and cautious selection. 2) We develop a host of theorems to show how we can prune the search space when we are interested in optimistic selection. 3) We use the above contributions to build an efficient index to execute optimistic selection queries over SPOT databases. Our approach is superior to past work in two major respects: First, it makes fewer assumptions than all past works on this topic except that in. Second, our experiments, which are based on real-world data about ship movements, show that our algorithms are much more efficient than those in.}, keywords = {Cartesian, checking;database, database;data, databases;, databases;visual, indexing;inference, indexing;linear, integrity;database, mechanisms;linear, probabilistic, problem;spatial, problems;temporal, processing;search, program;optimistic, programming;probability;query, query;probabilistic, reasoning;search, selection, selection;consistency, space;cautious, temporal}, isbn = {1041-4347}, doi = {10.1109/TKDE.2008.93}, author = {Parker,A. and Infantes,G. and Grant,J. and V.S. Subrahmanian} } @conference {13038, title = {Streaming for large scale NLP: Language modeling}, booktitle = {Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics}, year = {2009}, month = {2009///}, pages = {512 - 520}, author = {Goyal,A. and Daum{\'e}, Hal and Venkatasubramanian,S.} } @conference {14455, title = {Supervised and unsupervised methods in employing discourse relations for improving opinion polarity classification}, booktitle = {Proceedings of the 2009 Conference on Empirical Methods in Natural Language Processing: Volume 1 - Volume 1}, series = {EMNLP {\textquoteright}09}, year = {2009}, month = {2009///}, pages = {170 - 179}, publisher = {Association for Computational Linguistics}, organization = {Association for Computational Linguistics}, address = {Stroudsburg, PA, USA}, abstract = {This work investigates design choices in modeling a discourse scheme for improving opinion polarity classification. For this, two diverse global inference paradigms are used: a supervised collective classification framework and an unsupervised optimization framework. Both approaches perform substantially better than baseline approaches, establishing the efficacy of the methods and the underlying discourse scheme. We also present quantitative and qualitative analyses showing how the improvements are achieved.}, isbn = {978-1-932432-59-6}, url = {http://dl.acm.org/citation.cfm?id=1699510.1699533}, author = {Somasundaran,Swapna and Namata,Galileo and Wiebe,Janyce and Getoor, Lise} } @article {18807, title = {A survey of CAD model simplification techniques for physics-based simulation applications}, journal = {Computer-Aided Design}, volume = {41}, year = {2009}, month = {2009/02//}, pages = {65 - 80}, abstract = {Automated CAD model simplification plays an important role in effectively utilizing physics-based simulation during the product realization process. Currently a rich body of literature exists that describe many successful techniques for fully-automatic or semi-automatic simplification of CAD models for a wide variety of applications. The purpose of this paper is to compile a list of the techniques that are relevant for physics-based simulations problems and to characterize them based on their attributes. We have classified them into the following four categories: techniques based on surface entity based operators, volume entity based operators, explicit feature based operators, and dimension reduction operators. This paper also presents the necessary background information in the CAD model representation to assist the new readers. We conclude the paper by outlining open research directions in this field.}, keywords = {CAD model simplification, Physics-based simulation}, isbn = {0010-4485}, doi = {10.1016/j.cad.2008.11.009}, url = {http://www.sciencedirect.com/science/article/pii/S0010448508002285}, author = {Thakur,Atul and Banerjee,Ashis Gopal and Gupta, Satyandra K.} } @article {18808, title = {A survey of snake-inspired robot designs}, journal = {Bioinspiration \& Biomimetics}, volume = {4}, year = {2009}, month = {2009/06/01/}, pages = {021001 - 021001}, abstract = {Body undulation used by snakes and the physical architecture of a snake body may offer significant benefits over typical legged or wheeled locomotion designs in certain types of scenarios. A large number of research groups have developed snake-inspired robots to exploit these benefits. The purpose of this review is to report different types of snake-inspired robot designs and categorize them based on their main characteristics. For each category, we discuss their relative advantages and disadvantages. This review will assist in familiarizing a newcomer to the field with the existing designs and their distinguishing features. We hope that by studying existing robots, future designers will be able to create new designs by adopting features from successful robots. The review also summarizes the design challenges associated with the further advancement of the field and deploying snake-inspired robots in practice.}, isbn = {1748-3182, 1748-3190}, doi = {10.1088/1748-3182/4/2/021001}, url = {http://iopscience.iop.org/1748-3182/4/2/021001}, author = {Hopkins,James K. and Spranklin,Brent W. and Gupta, Satyandra K.} } @article {18771, title = {A systematic approach for designing multifunctional thermally conducting polymer structures with embedded actuators}, journal = {Journal of Mechanical Design}, volume = {131}, year = {2009}, month = {2009///}, pages = {111009 - 111009}, author = {Bejgerowski,W. and Gupta,S.K. and Bruck,H. A.} } @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 {14448, title = {To join or not to join: the illusion of privacy in social networks with mixed public and private user profiles}, booktitle = {Proceedings of the 18th international conference on World wide web}, series = {WWW {\textquoteright}09}, year = {2009}, month = {2009///}, pages = {531 - 540}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {In order to address privacy concerns, many social media websites allow users to hide their personal profiles from the public. In this work, we show how an adversary can exploit an online social network with a mixture of public and private user profiles to predict the private attributes of users. We map this problem to a relational classification problem and we propose practical models that use friendship and group membership information (which is often not hidden) to infer sensitive attributes. The key novel idea is that in addition to friendship links, groups can be carriers of significant information. We show that on several well-known social media sites, we can easily and accurately recover the information of private-profile users. To the best of our knowledge, this is the first work that uses link-based and group-based classification to study privacy implications in social networks with mixed public and private user profiles.}, keywords = {attribute inference, groups, privacy, social networks}, isbn = {978-1-60558-487-4}, doi = {10.1145/1526709.1526781}, url = {http://doi.acm.org/10.1145/1526709.1526781}, author = {Zheleva,Elena and Getoor, Lise} } @article {18724, title = {Together, Rpn10 and Dsk2 Can Serve as a Polyubiquitin Chain-Length Sensor}, journal = {Molecular Cell}, volume = {36}, year = {2009}, month = {2009/12/24/}, pages = {1018 - 1033}, abstract = {SummaryAs a signal for substrate targeting, polyubiquitin meets various layers of receptors upstream to the 26S proteasome. We obtained structural information on two receptors, Rpn10 and Dsk2, alone and in complex with (poly)ubiquitin or with each other. A~hierarchy of affinities emerges with Dsk2 binding monoubiquitin tighter than Rpn10 does, whereas Rpn10 prefers the ubiquitin-like domain of Dsk2 to monoubiquitin, with increasing affinities for longer polyubiquitin chains. We demonstrated the formation of ternary complexes of both receptors simultaneously with (poly)ubiquitin and found that, depending on the ubiquitin chain length, the orientation of the resulting complex is entirely different, providing for alternate signals. Dynamic rearrangement provides a chain-length sensor, possibly explaining how accessibility of Dsk2 to the proteasome is limited unless it carries a properly tagged cargo. We propose a mechanism for a malleable ubiquitin signal that depends both on chain length and combination of receptors to produce tetraubiquitin as an efficient signal threshold. }, keywords = {Proteins, signaling}, isbn = {1097-2765}, doi = {10.1016/j.molcel.2009.11.012}, url = {http://www.sciencedirect.com/science/article/pii/S1097276509008260}, author = {Zhang,Daoning and Chen,Tony and Ziv,Inbal and Rosenzweig,Rina and Matiuhin,Yulia and Bronner,Vered and Glickman,Michael H. and Fushman, David} } @conference {13106, title = {Understanding videos, constructing plots learning a visually grounded storyline model from annotated videos}, booktitle = {Computer Vision and Pattern Recognition, 2009. CVPR 2009. IEEE Conference on}, year = {2009}, month = {2009/06//}, pages = {2012 - 2019}, abstract = {Analyzing videos of human activities involves not only recognizing actions (typically based on their appearances), but also determining the story/plot of the video. The storyline of a video describes causal relationships between actions. Beyond recognition of individual actions, discovering causal relationships helps to better understand the semantic meaning of the activities. We present an approach to learn a visually grounded storyline model of videos directly from weakly labeled data. The storyline model is represented as an AND-OR graph, a structure that can compactly encode storyline variation across videos. The edges in the AND-OR graph correspond to causal relationships which are represented in terms of spatio-temporal constraints. We formulate an Integer Programming framework for action recognition and storyline extraction using the storyline model and visual groundings learned from training data.}, keywords = {(artificial, action, activity, analysis;integer, AND-OR, annotation;video, coding;, constraint;video, construction;semantic, extraction;graph, framework;plots, graph;encoding;human, grounded, intelligence);spatiotemporal, learning, meaning;spatio-temporal, model, phenomena;video, Programming, programming;learning, recognition;human, representation;integer, storyline, theory;image, understanding;visually}, doi = {10.1109/CVPR.2009.5206492}, author = {Gupta,A. and Srinivasan,P. and Shi,Jianbo and Davis, Larry S.} } @article {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 {16058, title = {VAST 2009 challenge: An insider threat}, booktitle = {Visual Analytics Science and Technology, 2009. VAST 2009. IEEE Symposium on}, year = {2009}, month = {2009/10//}, pages = {243 - 244}, abstract = {The 4th VAST Challenge centered on a cyber analytics scenario and offered three mini-challenges with datasets of badge and network traffic data, a social network including geospatial information, and security video. Teams could also enter the Grand challenge which combined all three datasets. In this paper, we summarize the dataset, the overall scenario and the questions asked in the challenges. We describe the judging process and new infrastructure developed to manage the submissions and compute accuracy measures in the social network mini challenge. We received 49 entries from 30 teams, and gave 23 different awards to a total of 16 teams.}, keywords = {2009, analytics;data, analytics;geospatial, challenge;cyber, data;security, information, information;human, interaction;network, interfaces;, network;visual, traffic, user, VAST, video;social, visualisation;graphical}, doi = {10.1109/VAST.2009.5334454}, author = {Grinstein,G. and Scholtz,J. and Whiting,M. and Plaisant, Catherine} } @book {12535, title = {Video-based Lane Detection using Boosting Principles}, year = {2009}, month = {2009///}, publisher = {Snowbird}, organization = {Snowbird}, abstract = {Autonomous navigation of road vehicles is a challenging problem that has widespread applications in intelligent systems, and robotics. An integral componentof such a system is to understand how the road is structured. Detection of road lane markings assumes importance in this regard, and this problem has been approached with different visual input- based inference algorithms ([1], [2]), besides other sensing modalities such as the GPS sensor and the internal vehicle- state sensors. But the challenge still remains when there is considerable amount of shadows on the road, variations in outdoor lighting conditions of the scene (transition from day to night), among others. To address such issues, we propose a machine learning approach based on Real Adaboost [3], and train linear classifiers for both the appearance and edge cues of the training examplars. Additionally, we incorporate prior knowledge about the relative importance of the training samples by computing their weights using kernel discriminant analysis [4], before learning the classification function through boosting. The regions identified as lane markings are then analyzed for gradient direction consistency before making the final detection decision. We illustrate the effectiveness of our algorithm on challenging daylight and night- time road scenarios. }, author = {Gopalan,R. and Hong, T. and Shneier, M. and Chellapa, Rama} } @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 {16060, title = {Visual-Analytics Evaluation}, journal = {Computer Graphics and Applications, IEEE}, volume = {29}, year = {2009}, month = {2009/06//may}, pages = {16 - 17}, abstract = {Visual analytics (VA) is the science of analytical reasoning facilitated by interactive visual interfaces. Assessing VA technology{\textquoteright}s effectiveness is challenging because VA tools combine several disparate components, both low and high level, integrated in complex interactive systems used by analysts, emergency responders, and others. These components include analytical reasoning, visual representations, computer-human interaction techniques, data representations and transformations, collaboration tools, and especially tools for communicating the results of their use. VA tool users{\textquoteright} activities can be exploratory and can take place over days, weeks, or months. Users might not follow a predefined or even linear work flow. They might work alone or in groups. To understand these complex behaviors, an evaluation can target the component level, the system level, or the work environment level, and requires realistic data and tasks. Traditional evaluation metrics such as task completion time, number of errors, or recall and precision are insufficient to quantify the utility of VA tools, and new research is needed to improve our VA evaluation methodology.}, keywords = {analytic, analytics, evaluation;cognition;data, generation;user, interactive, interfaces;synthetic-data-set, reasoning;visual, systems;, tools;visual, visual, visualisation;interactive}, isbn = {0272-1716}, doi = {10.1109/MCG.2009.56}, author = {Plaisant, Catherine and Grinstein,G. and Scholtz,J.} } @conference {16503, title = {Web Monitoring 2.0: Crossing Streams to Satisfy Complex Data Needs}, booktitle = {IEEE 25th International Conference on Data Engineering, 2009. ICDE {\textquoteright}09}, year = {2009}, month = {2009/04/29/March}, pages = {1215 - 1218}, publisher = {IEEE}, organization = {IEEE}, abstract = {Web monitoring 2.0 supports the complex information needs of clients who probe multiple information sources and generate mashups by integrating across these volatile streams. A proxy that aims at satisfying multiple customized client profiles will face a scalability challenge in trying to maximize the number of clients served while at the same time fully satisfying complex client needs. In this paper, we introduce an abstraction of complex execution intervals, a combination of time intervals and information streams, to capture complex client needs. Given some budgetary constraints (e.g., bandwidth), we present offline algorithmic solutions for the problem of maximizing completeness of capturing complex profiles.}, keywords = {Bandwidth, complex client information need, Data Delivery, Data engineering, database management systems, Educational institutions, Internet, Mashups, mashups generation, Monitoring, multiple information source, offline algorithmic solution, Portals, PROBES, Profiles, Query processing, scalability, scheduling, volatile information stream, Web 2.0, Web Monitoring}, isbn = {978-1-4244-3422-0}, doi = {10.1109/ICDE.2009.204}, author = {Roitman,H. and Gal,A. and Raschid, Louiqa} } @article {13974, title = {Wideband fast multipole accelerated boundary element methods for the three-dimensional Helmholtz equation.}, journal = {The Journal of the Acoustical Society of America}, volume = {125}, year = {2009}, month = {2009///}, pages = {2566 - 2566}, abstract = {The development of a fast multipole method (FMM) accelerated iterative solution of the boundary element method (BEM) for the Helmholtz equations in three dimensions is described. The FMM for the Helmholtz equation is significantly different for problems with low and high kD, where k is the wave number and D the domain size, and for large problems, the method must be switched between levels of the hierarchy. The BEM requires several approximate computations: numerical quadrature and approximations of the boundary shapes using elements. These errors must be balanced against approximations introduced by the FMM and the convergence criterion for an iterative solution. These different errors must all be chosen in a way that, on the one hand, excess work is not done and, on the other, that the error achieved by the overall computation is acceptable. Details of translation operators for low and high kD choice of representations and BEM quadrature schemes, all consistent with these approximations, are described. A novel preconditioner using a low accuracy FMM accelerated solver as a right preconditioner is also described. Results of the developed solvers for large boundary value problems with 0.0001⩽kD⩽500 are presented and shown to perform close to theoretical expectations.}, url = {http://link.aip.org/link/?JAS/125/2566/4}, author = {Gumerov, Nail A. and Duraiswami, Ramani} } @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.} } @article {15954, title = {Active logic semantics for a single agent in a static world}, journal = {Artificial Intelligence}, volume = {172}, year = {2008}, month = {2008/05//}, pages = {1045 - 1063}, abstract = {For some time we have been developing, and have had significant practical success with, a time-sensitive, contradiction-tolerant logical reasoning engine called the active logic machine (ALMA). The current paper details a semantics for a general version of the underlying logical formalism, active logic. Central to active logic are special rules controlling the inheritance of beliefs in general (and of beliefs about the current time in particular), very tight controls on what can be derived from direct contradictions (P\&{\textlnot}P), and mechanisms allowing an agent to represent and reason about its own beliefs and past reasoning. Furthermore, inspired by the notion that until an agent notices that a set of beliefs is contradictory, that set seems consistent (and the agent therefore reasons with it as if it were consistent), we introduce an "apperception function" that represents an agent{\textquoteright}s limited awareness of its own beliefs, and serves to modify inconsistent belief sets so as to yield consistent sets. Using these ideas, we introduce a new definition of logical consequence in the context of active logic, as well as a new definition of soundness such that, when reasoning with consistent premises, all classically sound rules remain sound in our new sense. However, not everything that is classically sound remains sound in our sense, for by classical definitions, all rules with contradictory premises are vacuously sound, whereas in active logic not everything follows from a contradiction.}, keywords = {Active logic, Autonomous agents, Brittleness, Logic, Nonmonotonic logic, Paraconsistent logic, semantics, Soundness, TIME}, isbn = {0004-3702}, doi = {16/j.artint.2007.11.005}, url = {http://www.sciencedirect.com/science/article/pii/S0004370207001993}, author = {Anderson,Michael L. and Gomaa,Walid and Grant,John and Perlis, Don} } @conference {17763, title = {An AGM-based belief revision mechanism for probabilistic spatio-temporal logics}, booktitle = {Proceedings of the 23rd national conference on Artificial intelligence}, year = {2008}, month = {2008///}, pages = {511 - 516}, author = {Parker,A. and Infantes,G. and V.S. Subrahmanian and Grant,J.} } @article {18782, title = {Algorithms for Generating Adaptive Projection Patterns for 3D Shape Measurement}, journal = {Journal of Computing and Information Science in Engineering}, volume = {8}, year = {2008}, month = {2008///}, pages = {031009 - 031009}, author = {Peng,T. and Gupta,S.K.} } @article {12112, title = {An assessment of systems and software engineering scholars and institutions (2001{\textendash}2005)}, journal = {Journal of Systems and Software}, volume = {81}, year = {2008}, month = {2008/06//}, pages = {1059 - 1062}, abstract = {This paper presents the findings of a five-year study of the top scholars and institutions in the systems and software engineering field, as measured by the quantity of papers published in the journals of the field in 2001{\textendash}2005. The top scholar is Magne J{\o}rgensen of Simula Research Laboratory, Norway, and the top institution is Korea Advanced Institute of Science and Technology, Korea.This paper is part of an ongoing study, conducted annually, that identifies the top 15 scholars and institutions in the most recent five-year period. }, keywords = {Research publications, Systems and software engineering, Top institutions, Top scholars}, isbn = {0164-1212}, doi = {10.1016/j.jss.2007.09.018}, url = {http://www.sciencedirect.com/science/article/pii/S0164121207002300}, author = {Wong,W. Eric and Tse,T.H. and Glass,Robert L. and Basili, Victor R. and Chen,T.Y.} } @article {19619, title = {Athos: Efficient Authentication of Outsourced File Systems: Information Security}, journal = {Lecture Notes in Computer Science}, year = {2008}, month = {2008///}, pages = {80 - 96}, isbn = {03029743}, author = {Triandopoulos, Nikolaos and Goodrich, Michael T. and Charalampos Papamanthou and Tamassia, Roberto} } @article {13979, title = {Audio Camera Using Microphone Arrays for Real Time Capture of Audio Images ...}, volume = {12/127,451}, year = {2008}, month = {2008/05//}, abstract = {Spherical microphone arrays provide an ability to compute the acoustical intensity corresponding to different spatial directions in a given frame of audio data. These intensities may be exhibited as an image and these images are generated at a high frame rate to achieve a video image if the data capture and intensity computations can be performed sufficiently quickly, thereby creating a frame-rate audio camera. A description is provided herein regarding how such a camera is built and the processing done sufficiently quickly using graphics processors. The joint processing of and captured frame-rate audio and video images enables applications such as visual identification of noise sources, beamforming and noise-suppression in video conferenceing and others, by accounting for the spatial differences in the location of the audio and the video cameras. Based on the recognition that the spherical array can be viewed as a central projection camera, such joint analysis can be performed.}, url = {http://www.google.com/patents?id=gWKzAAAAEBAJ}, author = {Duraiswami, Ramani and O{\textquoteright}donovan,Adam and Neumann, Jan and Gumerov, Nail A.} } @article {16543, title = {Automated design of distributed control rules for the self-assembly of prespecified artificial structures}, journal = {Robotics and Autonomous Systems}, volume = {56}, year = {2008}, month = {2008/04/30/}, pages = {334 - 359}, abstract = {The self-assembly problem involves the design of agent-level control rules that will cause the agents to form some desired, target structure, subject to environmental constraints. This paper describes a fully automated rule generation procedure that allows structures to successfully self-assemble in a simulated environment with constrained, continuous motion. This environment implicitly imposes ordering constraints on the self-assembly process, where certain parts of the target structure must be assembled before others, and where it may be necessary to assemble (and subsequently disassemble) temporary structures such as staircases. A provably correct methodology is presented for computing a partial order on the self-assembly process, and for generating rules that enforce this order at runtime. The assembly and disassembly of structures is achieved by generating another set of rules, which are inspired by construction behavior among certain species of social insects. Computational experiments verify the effectiveness of the approach on a diverse set of target structures.}, keywords = {Collective problem solving, Coordination, Self-assembly, Stigmergy, Swarm intelligence}, isbn = {0921-8890}, doi = {10.1016/j.robot.2007.08.006}, url = {http://www.sciencedirect.com/science/article/pii/S092188900700111X}, author = {Grushin,Alexander and Reggia, James A.} } @article {13135, title = {Beyond nouns: Exploiting prepositions and comparative adjectives for learning visual classifiers}, journal = {Computer Vision{\textendash}ECCV 2008}, year = {2008}, month = {2008///}, pages = {16 - 29}, abstract = {Learning visual classifiers for object recognition from weakly labeled data requires determining correspondence between image regions and semantic object classes. Most approaches use co-occurrence of {\textquotedblleft}nouns{\textquotedblright} and image features over large datasets to determine the correspondence, but many correspondence ambiguities remain. We further constrain the correspondence problem by exploiting additional language constructs to improve the learning process from weakly labeled data. We consider both {\textquotedblleft}prepositions{\textquotedblright} and {\textquotedblleft}comparative adjectives{\textquotedblright} which are used to express relationships between objects. If the models of such relationships can be determined, they help resolve correspondence ambiguities. However, learning models of these relationships requires solving the correspondence problem. We simultaneously learn the visual features defining {\textquotedblleft}nouns{\textquotedblright} and the differential visual features defining such {\textquotedblleft}binary-relationships{\textquotedblright} using an EM-based approach.}, author = {Gupta,A. and Davis, Larry S.} } @article {12905, title = {Biofilms in water, its role and impact in human disease transmission}, journal = {Current Opinion in Biotechnology}, volume = {19}, year = {2008}, month = {2008/06//}, pages = {244 - 247}, abstract = {Understanding the mechanism of biofilm formation is the first step in determining its function and, thereby, its impact and role in the environment. Extensive studies accomplished during the past few years have elucidated the genetics and biochemistry of biofilm formation. Cell-to-cell communication, that is, quorum sensing, is a key factor in the initiation of biofilm. Occurrence of viable but nonculturable bacteria, including Vibrio cholerae in biofilms has been reported and most likely such cells were overlooked previously because appropriate methods of detection were not employed. For this reason discovery and investigation of this important bacterial ecological niche in the environment were impeded.}, isbn = {0958-1669}, doi = {10.1016/j.copbio.2008.04.005}, url = {http://www.sciencedirect.com/science/article/pii/S0958166908000505}, author = {Huq,Anwar and Whitehouse,Chris A. and Grim,Christopher J. and Alam,Munirul and Rita R Colwell} } @inbook {17569, title = {Budgeted Allocations in the Full-Information Setting}, booktitle = {Approximation, Randomization and Combinatorial Optimization. Algorithms and TechniquesApproximation, Randomization and Combinatorial Optimization. Algorithms and Techniques}, series = {Lecture Notes in Computer Science}, volume = {5171}, year = {2008}, month = {2008///}, pages = {247 - 253}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {We build on the work of Andelman \& Mansour and Azar, Birnbaum, Karlin, Mathieu \& Thach Nguyen to show that the full-information (i.e., offline) budgeted-allocation problem can be approximated to within 4/3: we conduct a rounding of the natural LP relaxation, for which our algorithm matches the known lower-bound on the integrality gap.}, isbn = {978-3-540-85362-6}, url = {http://dx.doi.org/10.1007/978-3-540-85363-3_20}, author = {Srinivasan, Aravind}, editor = {Goel,Ashish and Jansen,Klaus and Rolim,Jos{\'e} and Rubinfeld,Ronitt} } @conference {18554, title = {Can great research be taught?: independent research with cross-disciplinary thinking and broader impact}, booktitle = {Proceedings of the 39th SIGCSE technical symposium on Computer science education}, series = {SIGCSE {\textquoteright}08}, year = {2008}, month = {2008///}, pages = {471 - 475}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {This paper describes a course we have developed for preparing new Ph.D. students in computer science for a career in research. The course is intended to teach the skills needed for research and independent work, prepare students psychologically and socially for years lying before them, and help them find a good Ph.D. topic by providing principles and examples. In this course, we emphasize and encourage impact through cross-disciplinary research and broader societal outreach. To our knowledge, the course represents a first-of-its-kind systematic introduction to a graduate research career. This paper describes our high-level goals for this curricular initiative, the structure of the course (including lecture components and assignments), and the challenges we faced in developing this course. As we continue to develop this course, which is now in its second year, we hope it will serve as a model "introduction of Ph.D. research" course for other computer science departments.}, keywords = {graduate education, ph.d., research}, isbn = {978-1-59593-799-5}, doi = {10.1145/1352135.1352294}, url = {http://doi.acm.org/10.1145/1352135.1352294}, author = {Feamster, Nick and Gray,Alexander} } @conference {16506, title = {Capturing Approximated Data Delivery Tradeoffs}, booktitle = {Data Engineering, 2008. ICDE 2008. IEEE 24th International Conference on}, year = {2008}, month = {2008/04//}, pages = {1471 - 1473}, abstract = {This paper presents a middleware data delivery setting with a proxy that is required to maximize the completeness of captured updates, specified in its clients{\textquoteright} profiles, while minimizing at the same time the delay in delivering the updates to clients. The two objectives may conflict when the monitoring budget is limited. Therefore, any solution should consider this tradeoff in satisfying both objectives. We term this problem the "proxy dilemma" and formalize it as a biobjective optimization problem. Such problem occurs in many contemporary applications, such as mobile and sensor networks, and poses scalability challenges in delivering up-to-date data from remote resources to meet client specifications. We present a Pareto set as a formal solution to the proxy dilemma. We discuss the complexity of generating a Pareto set for the proxy dilemma and suggest an approximation scheme to this problem.}, keywords = {approximation scheme, approximation theory, biobjective optimization problem, Middleware, middleware data delivery tradeoffs, mobile networks, Pareto optimisation, Pareto set, proxy dilemma problem, sensor networks}, doi = {10.1109/ICDE.2008.4497593}, author = {Roitman,H. and Gal,A. and Raschid, Louiqa} } @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} } @article {14375, title = {Collective Classification in Network Data}, journal = {AI Magazine}, volume = {29}, year = {2008}, month = {2008/09/06/}, pages = {93 - 93}, abstract = {Collective Classification in Network Data}, isbn = {0738-4602}, doi = {10.1609/aimag.v29i3.2157}, url = {http://www.aaai.org/ojs/index.php/aimagazine/article/viewArticle/2157}, author = {Sen,Prithviraj and Namata,Galileo and Bilgic,Mustafa and Getoor, Lise and Galligher,Brian and Eliassi-Rad,Tina} } @conference {18898, title = {Combining Domain-Independent Planning and HTN Planning: The Duet Planner}, year = {2008}, month = {2008///}, pages = {573 - 577}, publisher = {IOS Press}, organization = {IOS Press}, address = {Amsterdam, The Netherlands, The Netherlands}, abstract = {Despite the recent advances in planning for classical domains, the question of how to use domain knowledge in planning is yet to be completely and clearly answered. Some of the existing planners use domain-independent search heuristics, and some others depend on intensively-engineered domain-specific knowledge to guide the planning process. In this paper, we describe an approach to combine ideas from both of the above schools of thought. We present Duet, our planning system that incorporates the ability of using hierarchical domain knowledge in the form of Hierarchical Task Networks (HTNs) as in SHOP2 [14] and using domain-independent local search techniques as in LPG [8]. In our experiments, Duet was able to solve much larger problems than LPG could solve, with only minimal domain knowledge encoded in HTNs (much less domain knowledge than SHOP2 needed to solve those problems by itself).}, isbn = {978-1-58603-891-5}, url = {http://dl.acm.org/citation.cfm?id=1567281.1567406}, author = {Gerevini,Alfonso and Kuter,Ugur and Nau, Dana S. and Saetti,Alessandro and Waisbrot,Nathaniel} } @article {17021, title = {Community response grid (CRG) for a university campus: Design requirements and implications}, journal = {Proceedings of the 5th International ISCRAM Conference}, year = {2008}, month = {2008///}, pages = {34 - 43}, abstract = {This paper describes the initial stages of the participatory design of a community-oriented emergency responsesystem for a university campus. After reviewing related work and the current University emergency response system, this paper describes our participatory design process, discusses initial findings from a design requirement survey and from our interactions with different stakeholders, and proposes a Web interface design for a community response grid system. The prototyping of the system demonstrates the possibility of fostering a social-network-based community participation in emergency response, and also identifies concerns raised by potential users and by the professional responder community. }, author = {Wu,P.F. and Qu,Y. and Preece,J. and Fleischmann,K. and Golbeck,J. and Jaeger,P. and Shneiderman, Ben} } @conference {12555, title = {Compressive wireless arrays for bearing estimation}, booktitle = {Acoustics, Speech and Signal Processing, 2008. ICASSP 2008. IEEE International Conference on}, year = {2008}, month = {2008/04/31/4}, pages = {2497 - 2500}, abstract = {Joint processing of sensor array outputs improves the performance of parameter estimation and hypothesis testing problems beyond the sum of the individual sensor processing results. When the sensors have high data sampling rates, arrays are tethered, creating a disadvantage for their deployment and also limiting their aperture size. In this paper, we develop the signal processing algorithms for randomly deployable wireless sensor arrays that are severely constrained in communication bandwidth. We focus on the acoustic bearing estimation problem and show that when the target bearings are modeled as a sparse vector in the angle space, low dimensional random projections of the microphone signals can be used to determine multiple source bearings by solving an l 1-norm minimization problem. Field data results are shown where only 10 bits of information is passed from each microphone to estimate multiple target bearings.}, keywords = {acoustic, algorithms;sparse, arrays;acoustic, arrays;hypothesis, bandwidth;compressive, bearing, Estimation, estimation;signal, estimation;sparse, matrices;vectors;wireless, minimization, networks;, problem;communication, problem;microphone, problems;joint, PROCESSING, processing;array, processing;direction-of-arrival, processing;l1-norm, sensor, signal, signals;parameter, Testing, vector;wireless, wireless}, doi = {10.1109/ICASSP.2008.4518155}, author = {Cevher, V. and Gurbuz, A.C. and McClellan, J.H. and Chellapa, Rama} } @article {13125, title = {Constraint Integration for Efficient Multiview Pose Estimation with Self-Occlusions}, journal = {Pattern Analysis and Machine Intelligence, IEEE Transactions on}, volume = {30}, year = {2008}, month = {2008/03//}, pages = {493 - 506}, abstract = {Automatic initialization and tracking of human pose is an important task in visual surveillance. We present a part-based approach that incorporates a variety of constraints in a unified framework. These constraints include the kinematic constraints between parts that are physically connected to each other, the occlusion of one part by another, and the high correlation between the appearance of certain parts, such as the arms. The location probability distribution of each part is determined by evaluating appropriate likelihood measures. The graphical (nontree) structure representing the interdependencies between parts is utilized to "connect" such part distributions via nonparametric belief propagation. Methods are also developed to perform this optimization efficiently in the large space of pose configurations.}, keywords = {Automated;Posture;Reproducibility of Results;Sensitivity and Specificity;Video Recording;Whole Body Imaging;, automatic initialization;constraint integration;graphical structure;human pose tracking;kinematic constraint;likelihood measure;location probability distribution;multiview pose estimation;nonparametric belief propagation;optimization;pose configuration;se, Computer-Assisted;Imaging, Three-Dimensional;Pattern Recognition}, isbn = {0162-8828}, doi = {10.1109/TPAMI.2007.1173}, author = {Gupta,A. and Mittal,A. and Davis, Larry S.} } @article {18823, title = {Content-based assembly search: A step towards assembly reuse}, journal = {Computer-Aided Design}, volume = {40}, year = {2008}, month = {2008/02//}, pages = {244 - 261}, abstract = {The increased use of CAD systems by product development organizations has resulted in the creation of large databases of assemblies. This explosion of assembly data is likely to continue in the future. In many situations, a text-based search alone may not be sufficient to search for assemblies and it may be desirable to search for assemblies based on the content of the assembly models. The ability to perform content-based searches on these databases is expected to help the designers in the following two ways. First, it can facilitate the reuse of existing assembly designs, thereby reducing the design time. Second, a lot of useful designs for manufacturing, and assembly knowledge are implicitly embedded in existing assemblies. Therefore a capability to locate existing assemblies and examine them can be used as a learning tool by designers to learn from the existing assembly designs. This paper describes a system for performing content-based searches on assembly databases. We identify templates for comprehensive search definitions and describe algorithms to perform content-based searches for mechanical assemblies. We also illustrate the capabilities of our system through several examples.}, keywords = {Assembly characteristics, Assembly mating conditions, Content-based assembly search, Graph compatibility}, isbn = {0010-4485}, doi = {10.1016/j.cad.2007.10.012}, url = {http://www.sciencedirect.com/science/article/pii/S0010448507002424}, author = {Deshmukh,Abhijit S. and Banerjee,Ashis Gopal and Gupta, Satyandra K. and Sriram,Ram D.} } @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.} } @article {17581, title = {Cost-Sharing Mechanisms for Network Design}, journal = {Algorithmica}, volume = {50}, year = {2008}, month = {2008///}, pages = {98 - 119}, abstract = {We consider a single-source network design problem from a game-theoretic perspective. Gupta, Kumar and Roughgarden (Proc. 35th Annual ACM STOC, pp. 365{\textendash}372, 2003 ) developed a simple method for a single-source rent-or-buy problem that also yields the best-known approximation ratio for the problem. We show how to use a variant of this method to develop an approximately budget-balanced and group strategyproof cost-sharing method for the problem. The novelty of our approach stems from our obtaining the cost-sharing methods for the rent-or-buy problem by carefully combining cost-shares for the simpler Steiner tree problem. Our algorithm is conceptually simpler than the previous such cost-sharing method due to P{\'a}l and Tardos (Proc. 44th Annual FOCS, pp. 584{\textendash}593, 2003 ), and improves the previously-known approximation factor of 15 to 4.6.}, isbn = {0178-4617}, url = {http://dx.doi.org/10.1007/s00453-007-9065-y}, author = {Gupta,Anupam and Srinivasan, Aravind and Tardos,{\'E}va} } @inbook {19030, title = {Delegating Capabilities in Predicate Encryption Systems}, booktitle = {Automata, Languages and Programming}, series = {Lecture Notes in Computer Science}, volume = {5126}, year = {2008}, month = {2008}, pages = {560 - 578}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {In predicate encryption systems, given a capability, one can evaluate one or more predicates on the plaintext encrypted, while all other information about the plaintext remains hidden. We consider the role of delegation in such predicate encryption systems. Suppose Alice has a capability, and she wishes to delegate to Bob a more restrictive capability allowing the decryption of a subset of the information Alice can learn about the plaintext encrypted. We formally define delegation in predicate encryption systems, propose a new security definition for delegation, and give an efficient construction supporting conjunctive queries. The security of our construction can be reduced to the general 3-party Bilinear Diffie-Hellman assumption, and the Bilinear Decisional Diffie-Hellman assumption in composite order bilinear groups.}, keywords = {Computer science}, isbn = {978-3-540-70582-6}, url = {http://www.springerlink.com/content/w320422h15050004/abstract/}, author = {Elaine Shi and Waters,Brent}, editor = {Aceto,Luca and Damg{\r a}rd,Ivan and Goldberg,Leslie and Halld{\'o}rsson,Magn{\'u}s and Ing{\'o}lfsd{\'o}ttir,Anna and Walukiewicz,Igor} } @article {15056, title = {Design and implementation of blackboard-based system for human detection}, journal = {Jisuanji Gongcheng/ Computer Engineering}, volume = {34}, year = {2008}, month = {2008///}, author = {Zhuolin Jiang and Li,S.F. and Gao,D.F.} } @article {17063, title = {Designing community-based emergency communication system: A preliminary study}, journal = {Proceedings of the American Society for Information Science and Technology}, volume = {45}, year = {2008}, month = {2008///}, pages = {1 - 3}, author = {Fei Wu,P. and Qu,Y. and Fleischmann,K. and Golbeck,J. and Jaeger,P. and Preece,J. and Shneiderman, Ben} } @article {18768, title = {Development of a multi-piece multi-gate mold for manufacturing a flapping wing drive-mechanism}, journal = {Transactions of North American Manufacturing Research Institution of SME}, volume = {36}, year = {2008}, month = {2008///}, abstract = {Successful realization a flapping wing microair vehicle (MAV) requires development of a light weight drive-mechanism that can convert the continuous rotary motion to oscillatory flapping motion. Molded compliant drive-mechanisms are an attractive design option because of manufacturing scalability and reduction in the number of parts. The unique characteristics of this mechanism require development of a complex multi-piece multi-gate mold design. This paper describes a systematic approach for determining the part shape and size, optimizing the mold pieces, and placing the gates on the multi-piece mold. The novel aspects of this work include (1) selecting non-critical shape features to optimize the mold design and (2) the use of sacrificial structural elements to reduce the impact of the weld lines on the structural performance. The mold developed using our approach was utilized to realize a working flapping wing MAV. }, url = {http://web.mit.edu/arvinda/www/NAMRI_2008_Draft.pdf}, author = {Ananthanarayanan,A. and Bejgerowski,W. and Mueller,D. and Gupta,S.K.} } @article {12904, title = {Dual role colonization factors connecting Vibrio cholerae{\textquoteright}s lifestyles in human and aquatic environments open new perspectives for combating infectious diseases}, journal = {Current Opinion in Biotechnology}, volume = {19}, year = {2008}, month = {2008/06//}, pages = {254 - 259}, abstract = {Vibrio cholerae exhibits two distinctive lifestyles, one inside the milieu of the human intestine and the other in the aquatic environment. Recently, the existence of V. cholerae ligands involved in colonization of both human intestine and environmental chitin surfaces via the same binding specificity has been shown. Such molecules, here named {\textquoteleft}dual role colonization factors (DRCFs){\textquoteright}, are example of a tight connection between the two V. cholerae{\textquoteright}s lifestyles. It is suggested that DRCFs and, more generally, bacterial factors and pathways having roles in pathogenesis and in the out of the human body life may be promising targets for development of novel prophylactic or therapeutic interventions that may also affect V. cholerae fitness in its environmental reservoirs.}, isbn = {0958-1669}, doi = {10.1016/j.copbio.2008.04.002}, url = {http://www.sciencedirect.com/science/article/pii/S0958166908000426}, author = {Vezzulli,Luigi and Guzm{\'a}n,Carlos A and Rita R Colwell and Pruzzo,Carla} } @article {13472, title = {THE EFFECT OF NETWORK STRUCTURE ON DYNAMIC TEAM FORMATION IN MULTI-AGENT SYSTEMS}, journal = {Computational Intelligence}, volume = {24}, year = {2008}, month = {2008/05/01/}, pages = {122 - 157}, abstract = {Previous studies of team formation in multi-agent systems have typically assumed that the agent social network underlying the agent organization is either not explicitly described or the social network is assumed to take on some regular structure such as a fully connected network or a hierarchy. However, recent studies have shown that real-world networks have a rich and purposeful structure, with common properties being observed in many different types of networks. As multi-agent systems continue to grow in size and complexity, the network structure of such systems will become increasing important for designing efficient, effective agent communities.We present a simple agent-based computational model of team formation, and analyze the theoretical performance of team formation in two simple classes of networks (ring and star topologies). We then give empirical results for team formation in more complex networks under a variety of conditions. From these experiments, we conclude that a key factor in effective team formation is the underlying agent interaction topology that determines the direct interconnections among agents. Specifically, we identify the property of diversity support as a key factor in the effectiveness of network structures for team formation. Scale-free networks, which were developed as a way to model real-world networks, exhibit short average path lengths and hub-like structures. We show that these properties, in turn, result in higher diversity support; as a result, scale-free networks yield higher organizational efficiency than the other classes of networks we have studied. }, keywords = {dynamics of networked systems, multi-agent systems, network structure, team formation}, isbn = {1467-8640}, doi = {10.1111/j.1467-8640.2008.00325.x}, url = {http://onlinelibrary.wiley.com/doi/10.1111/j.1467-8640.2008.00325.x/abstract}, author = {Gaston,Matthew E. and desJardins, Marie} } @conference {14443, title = {Effective label acquisition for collective classification}, booktitle = {Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining}, series = {KDD {\textquoteright}08}, year = {2008}, month = {2008///}, pages = {43 - 51}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Information diffusion, viral marketing, and collective classification all attempt to model and exploit the relationships in a network to make inferences about the labels of nodes. A variety of techniques have been introduced and methods that combine attribute information and neighboring label information have been shown to be effective for collective labeling of the nodes in a network. However, in part because of the correlation between node labels that the techniques exploit, it is easy to find cases in which, once a misclassification is made, incorrect information propagates throughout the network. This problem can be mitigated if the system is allowed to judiciously acquire the labels for a small number of nodes. Unfortunately, under relatively general assumptions, determining the optimal set of labels to acquire is intractable. Here we propose an acquisition method that learns the cases when a given collective classification algorithm makes mistakes, and suggests acquisitions to correct those mistakes. We empirically show on both real and synthetic datasets that this method significantly outperforms a greedy approximate inference approach, a viral marketing approach, and approaches based on network structural measures such as node degree and network clustering. In addition to significantly improving accuracy with just a small amount of labeled data, our method is tractable on large networks.}, keywords = {active inference, collective classification, label acquisition}, isbn = {978-1-60558-193-4}, doi = {10.1145/1401890.1401901}, url = {http://doi.acm.org/10.1145/1401890.1401901}, author = {Bilgic,Mustafa and Getoor, Lise} } @inbook {19607, title = {Effective Visualization of File System Access-Control}, booktitle = {Visualization for Computer Security}, series = {Lecture Notes in Computer Science}, year = {2008}, month = {2008/01/01/}, pages = {18 - 25}, publisher = {Springer Berlin Heidelberg}, organization = {Springer Berlin Heidelberg}, abstract = {In this paper, we present a visual representation of access control permissions in a standard hierarchical file system. Our visualization of file permissions leverages treemaps, a popular graphical representation of hierarchical data. In particular, we present a visualization of access control for the NTFS file system that can help a non-expert user understand and manipulate file system permissions in a simple and effective way. While our examples are based on NTFS, our approach can be used for many other hierarchical file systems as well.}, keywords = {Computer Communication Networks, Computer Imaging, Vision, Pattern Recognition and Graphics, data mining and knowledge discovery, Data Structures, Cryptology and Information Theory, Visualization}, isbn = {978-3-540-85931-4, 978-3-540-85933-8}, url = {http://link.springer.com/chapter/10.1007/978-3-540-85933-8_2}, author = {Heitzmann, Alexander and Palazzi, Bernardo and Charalampos Papamanthou and Tamassia, Roberto}, editor = {Goodall, John R. and Conti, Gregory and Ma, Kwan-Liu} } @article {12913, title = {Environmental signatures associated with cholera epidemics}, journal = {Proceedings of the National Academy of Sciences}, volume = {105}, year = {2008}, month = {2008///}, pages = {17676 - 17676}, abstract = {The causative agent of cholera, Vibrio cholerae, has been shown to be autochthonous to riverine, estuarine, and coastal waters along with its host, the copepod, a significant member of the zooplankton community. Temperature, salinity, rainfall and plankton have proven to be important factors in the ecology of V. cholerae, influencing the transmission of the disease in those regions of the world where the human population relies on untreated water as a source of drinking water. In this study, the pattern of cholera outbreaks during 1998{\textendash}2006 in Kolkata, India, and Matlab, Bangladesh, and the earth observation data were analyzed with the objective of developing a prediction model for cholera. Satellite sensors were used to measure chlorophyll a concentration (CHL) and sea surface temperature (SST). In addition, rainfall data were obtained from both satellite and in situ gauge measurements. From the analyses, a statistically significant relationship between the time series for cholera in Kolkata, India, and CHL and rainfall anomalies was determined. A statistically significant one month lag was observed between CHL anomaly and number of cholera cases in Matlab, Bangladesh. From the results of the study, it is concluded that ocean and climate patterns are useful predictors of cholera epidemics, with the dynamics of endemic cholera being related to climate and/or changes in the aquatic ecosystem. When the ecology of V. cholerae is considered in predictive models, a robust early warning system for cholera in endemic regions of the world can be developed for public health planning and decision making.ecology epidemiology microbiology remote sensing }, isbn = {0027-8424, 1091-6490}, doi = {10.1073/pnas.0809654105}, url = {http://www.pnas.org/content/105/46/17676}, author = {Constantin de Magny,G. and Murtugudde,R. and Sapiano,M. R. P. and Nizam,A. and Brown,C. W. and Busalacchi,A. J. and Yunus,M. and Nair,G. B. and Gil,A. I. and Lanata,C. F. and Rita R Colwell} } @article {16066, title = {Evaluating Visual Analytics at the 2007 VAST Symposium Contest}, journal = {Computer Graphics and Applications, IEEE}, volume = {28}, year = {2008}, month = {2008/04//march}, pages = {12 - 21}, abstract = {In this article, we report on the contest{\textquoteright}s data set and tasks, the judging criteria, the winning tools, and the overall lessons learned in the competition. We believe that by organizing these contests, we{\textquoteright}re creating useful resources for researchers and are beginning to understand how to better evaluate VA tools. Competitions encourage the community to work on difficult problems, improve their tools, and develop baselines for others to build or improve upon. We continue to evolve a collection of data sets, scenarios, and evaluation methodologies that reflect the richness of the many VA tasks and applications.}, keywords = {2007, analytics, analytics;data, and, Contest;Visual, Science, Symposium, Technology;data, VAST, visualisation;, visualization;visual}, isbn = {0272-1716}, doi = {10.1109/MCG.2008.27}, author = {Plaisant, Catherine and Grinstein,G. and Scholtz,J. and Whiting,M. and O{\textquoteright}Connell,T. and Laskowski,S. and Chien,L. and Tat,A. and Wright,W. and Gorg,C. and Zhicheng Liu and Parekh,N. and Singhal,K. and Stasko,J.} } @article {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 {13368, title = {Exploiting shared correlations in probabilistic databases}, journal = {Proceedings of the VLDB Endowment}, volume = {1}, year = {2008}, month = {2008/08//}, pages = {809 - 820}, abstract = {There has been a recent surge in work in probabilistic databases, propelled in large part by the huge increase in noisy data sources --- from sensor data, experimental data, data from uncurated sources, and many others. There is a growing need for database management systems that can efficiently represent and query such data. In this work, we show how data characteristics can be leveraged to make the query evaluation process more efficient. In particular, we exploit what we refer to as shared correlations where the same uncertainties and correlations occur repeatedly in the data. Shared correlations occur mainly due to two reasons: (1) Uncertainty and correlations usually come from general statistics and rarely vary on a tuple-to-tuple basis; (2) The query evaluation procedure itself tends to re-introduce the same correlations. Prior work has shown that the query evaluation problem on probabilistic databases is equivalent to a probabilistic inference problem on an appropriately constructed probabilistic graphical model (PGM). We leverage this by introducing a new data structure, called the random variable elimination graph (rv-elim graph) that can be built from the PGM obtained from query evaluation. We develop techniques based on bisimulation that can be used to compress the rv-elim graph exploiting the presence of shared correlations in the PGM, the compressed rv-elim graph can then be used to run inference. We validate our methods by evaluating them empirically and show that even with a few shared correlations significant speed-ups are possible.}, isbn = {2150-8097}, doi = {10.1145/1453856.1453944}, url = {http://dx.doi.org/10.1145/1453856.1453944}, author = {Sen,Prithviraj and Deshpande, Amol and Getoor, Lise} } @article {13987, title = {Fast multipole accelerated boundary element method (FMBEM) for solution of 3D scattering problems}, journal = {The Journal of the Acoustical Society of America}, volume = {123}, year = {2008}, month = {2008///}, pages = {3419 - 3419}, abstract = {Wideband FMBEM codes are challenging to implement since there are problems at both very low and high frequencies. Substantially different schemes for function representation and translation are efficient for low and high frequency ranges. We present a method which is suitable for solution both high and low frequency problems since it implements a switch between different representations and uses fast translation methods appropriate to each representation. For a high frequency problem the switch between representations may occur at some intermediate levels of hierarchical space subdivision of the FMM. We also present an FMM-based preconditioner used in the flexible GMRES iterative solver for scattering problems and discuss example problems computed in range 0.001140 genes were differentially expressed in the <55 years age group compared with the >55 years age group. These genes were highly represented in gene ontology pathways involved in DNA damage. In contrast, zero genes in the male cohort <55 years met statistical significance when compared with the >55 years age group.Conclusions{\textemdash} Gene expression in dilated cardiomyopathy displayed evidence of sexual dimorphism similar to other somatic tissues and age dimorphism within the female cohort.}, doi = {10.1161/CIRCGENETICS.108.802652}, url = {http://circgenetics.ahajournals.org/content/1/2/117.abstract}, author = {Fermin,David R. and Barac,Ana and Lee,Sangjin and Polster,Sean P. and Hannenhalli, Sridhar and Bergemann,Tracy L. and Grindle,Suzanne and Dyke,David B. and Pagani,Francis and Miller,Leslie W. and Tan,Sarah and dos Remedios,Cris and Cappola,Thomas P. and Margulies,Kenneth B. and Hall,Jennifer L.} } @article {13134, title = {A {\textquotedblleft}Shape Aware{\textquotedblright} Model for semi-supervised Learning of Objects and its Context}, journal = {Proc. of NIPS}, year = {2008}, month = {2008///}, abstract = {We present an approach that combines bag-of-words and spatial models to performsemantic and syntactic analysis for recognition of an object based on its internal appearance and its context. We argue that while object recognition requires mod- eling relative spatial locations of image features within the object, a bag-of-word is sufficient for representing context. Learning such a model from weakly labeled data involves labeling of features into two classes: foreground(object) or {\textquotedblleft}infor- mative{\textquotedblright} background(context). We present a {\textquotedblleft}shape-aware{\textquotedblright} model which utilizes contour information for efficient and accurate labeling of features in the image. Our approach iterates between an MCMC-based labeling and contour based la- beling of features to integrate co-occurrence of features and shape similarity. }, author = {Gupta,A. and Shi,J. and Davis, Larry S.} } @article {18533, title = {SNARE: Spatio-temporal Network-level Automatic Reputation Engine}, volume = {GT-CSE-08-02}, year = {2008}, month = {2008///}, institution = {Georgia Institute of Technology}, abstract = {Current spam filtering techniques classify email based oncontent and IP reputation blacklists or whitelists. Unfortu- nately, spammers can alter spam content to evade content- based filters, and spammers continually change the IP ad- dresses from which they send spam. Previous work has sug- gested that filters based on network-level behavior might be more efficient and robust, by making decisions based on how messages are sent, as opposed to what is being sent or who is sending them. This paper presents a technique to identify spammers based on features that exploit the network-level spatio- temporal behavior of email senders to differentiate the spam- ming IPs from legitimate senders. Our behavioral classifier has two benefits: (1) it is early (i.e., it can automatically detect spam without seeing a large amount of email from a sending IP address{\textemdash}sometimes even upon seeing only a single packet); (2) it is evasion-resistant (i.e., it is based on spatial and temporal features that are difficult for a sender to change). We build classifiers based on these features us- ing two different machine learning methods, support vec- tor machine and decision trees, and we study the efficacy of these classifiers using labeled data from a deployed com- mercial spam-filtering system. Surprisingly, using only fea- tures from a single IP packet header (i.e., without looking at packet contents), our classifier can identify spammers with about 93\% accuracy and a reasonably low false-positive rate (about 7\%). After looking at a single message spammer identification accuracy improves to more than 94\% with a false rate of just over 5\%. These suggest an effective sender reputation mechanism. }, url = {http://hdl.handle.net/1853/25135}, author = {Feamster, Nick and Gray,A.G. and Krasser,S. and Syed,N.A.} } @conference {18483, title = {Sound field decomposition using spherical microphone arrays}, booktitle = {IEEE International Conference on Acoustics, Speech and Signal Processing, 2008. ICASSP 2008}, year = {2008}, month = {2008///}, pages = {277 - 280}, publisher = {IEEE}, organization = {IEEE}, abstract = {Spherical microphone arrays offer a number of attractive properties such as direction-independent acoustic behavior and ability to reconstruct the sound field in the vicinity of the array. Such ability is necessary in applications such as ambisonics and recreating auditory environment over headphones. We compare the performance of two scene reconstruction algorithms - one based on least-squares fitting the observed potentials and another based on computing the far-field signature function directly from the microphone measurements. A number of features important for the design and operation of spherical microphone arrays in real applications are revealed. Results indicate that it is possible to reconstruct the sound scene up to order p with p2 microphones.}, keywords = {Acoustic applications, Acoustic arrays, Acoustic fields, acoustic position measurement, Acoustic propagation, acoustic signal processing, acoustic waves, array signal processing, Equations, far-field signature function, Layout, least-squares fitting, microphone arrays, scene reconstruction algorithms, Signal processing algorithms, sound field decomposition, spherical microphone arrays, Surface acoustic waves}, isbn = {978-1-4244-1483-3}, doi = {10.1109/ICASSP.2008.4517600}, author = {Zotkin,Dmitry N and Duraiswami, Ramani and Gumerov, Nail A.} } @conference {13980, title = {Spherical Arrays Near Boundaries}, booktitle = {Hands-Free Speech Communication and Microphone Arrays, 2008. HSCMA 2008}, year = {2008}, month = {2008/05//}, pages = {1 - 1}, abstract = {Summary form only given. Solid spherical microphone arrays are beginning to be used for purposes such as beamforming, sound field capture and as audio cameras. They rely on the scattering of sound off their surface to achieve their purpose. This behavior is significantly affected in the presence of boundaries (floors, walls, ceilings), and the edges and corners they form. Algorithms designed for array analysis in a free field will work erroneously in this situation. We describe adaptation of the spherical microphone analysis algorithms to constructively use the scattering off the boundaries to significantly improve array performance. We also assess the influence of walls on beamforming algorithms for regular spherical arrays. Both synthetic and experimental results are presented.}, keywords = {analysis;audio, analysis;microphone, array, arrays;, arrays;sound, arrays;spherical, cameras;beamforming;solid, capture;spherical, field, microphone, spherical}, doi = {10.1109/HSCMA.2008.4538675}, author = {Duraiswami, Ramani and Gumerov, Nail A. and O{\textquoteright}Donovan,A.} } @article {14506, title = {Statistical Relational Learning as an Enabling Technology for Data Acquisition and Data Fusion in Heterogeneous Sensor Networks}, year = {2008}, month = {2008/06/29/}, institution = {OFFICE OF RESEARCH ADMINISTRATION AND ADVANCEMENT, UNIVERSITY OF MARYLAND COLLEGE PARK}, abstract = {Our work has focused on developing new cost sensitive feature acquisition and classification algorithms, mapping these algorithms onto camera networks, and creating a test bed of video data and implemented vision algorithms that we can use to implement these. First, we will describe a new algorithm that we have developed for feature acquisition in Hidden Markov Models (HMMs). This is particularly useful for inference tasks involving video from a single camera, in which the relationship between frames of video can be modeled as a Markov chain. We describe this algorithm in the context of using background subtraction results to identify portions of video that contain a moving object. Next, we will describe new algorithms that apply to general graphical models. These can be tested using existing test sets that are drawn from a range of domains in addition to sensor networks.}, keywords = {*ALGORITHMS, *CLASSIFICATION, data acquisition, DATA FUSION, Detectors, Feature extraction, HMM(HIDDEN MARKOV MODELS), NETWORKS, NUMERICAL MATHEMATICS, PE611102, RANDOM FIELDS, STATISTICS AND PROBABILITY, TEST SETS, VIDEO SIGNALS}, url = {http://stinet.dtic.mil/oai/oai?\&verb=getRecord\&metadataPrefix=html\&identifier=ADA500520}, author = {Jacobs, David W. and Getoor, Lise} } @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} } @article {14419, title = {Structured machine learning: the next ten years}, journal = {Machine Learning}, volume = {73}, year = {2008}, month = {2008///}, pages = {3 - 23}, abstract = {The field of inductive logic programming (ILP) has made steady progress, since the first ILP workshop in 1991, based on a balance of developments in theory, implementations and applications. More recently there has been an increased emphasis on Probabilistic ILP and the related fields of Statistical Relational Learning (SRL) and Structured Prediction. The goal of the current paper is to consider these emerging trends and chart out the strategic directions and open problems for the broader area of structured machine learning for the next 10 years.}, doi = {10.1007/s10994-008-5079-1}, author = {Dietterich,T. G and Domingos,P. and Getoor, Lise and Muggleton,S. and Tadepalli,P.} } @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 {18865, title = {System-Level Optimization Model for a Snake-Inspired Robot Based on a Rectilinear Gait}, year = {2008}, month = {2008///}, pages = {913 - 924}, publisher = {ASME}, organization = {ASME}, abstract = {Physical parameters of modules and gait parameters affect the overall snake-inspired robot performance. Hence the system-level optimization model has to concurrently optimize the module parameters and the gait. The equations of motion associated with the rectilinear gait are quite complex due to the changing topology of the rectilinear gait. Embedding these equations in the system-level optimization model leads to a computationally challenging formulation. This paper presents a system-level optimization model that utilizes a hierarchical optimization approach and meta-models of the pre-computed optimal gaits to reduce the complexity of the optimization model. This approach enabled us to use an experimentally validated physics-based model of the rectilinear gait and yet at the same time enabled us to create a system-level optimization model with a manageable complexity. A detailed case study is presented to show the importance of concurrently optimizing the module parameters and the gait using our model to obtain the optimal performance for a given mission.}, isbn = {978-0-7918-4326-0}, doi = {10.1115/DETC2008-49972}, url = {http://link.aip.org/link/ASMECP/v2008/i43260/p913/s1\&Agg=doi}, author = {Hopkins,James K. and Spranklin,Brent W. and Gupta, Satyandra K.} } @conference {18867, title = {Towards Design and Fabrication of a Miniature MRI-Compatible Robot for Applications in Neurosurgery}, year = {2008}, month = {2008///}, pages = {747 - 754}, publisher = {ASME}, organization = {ASME}, abstract = {Brain tumors are among the most feared complications of cancer and they occur in 20{\textendash}40\% of adult cancer patients. Despite numerous advances in treatment, the prognosis for these patients is poor, with a median survival of 4{\textendash}8 months. The primary reasons for poor survival rate are the lack of good continuous imaging modality for intraoperative intracranial procedures and the inability to remove the complete tumor tissue due to its placement in the brain and the corresponding space constraints to reach it. Intraoperative magnetic resonance imaging (MRI) supplements the surgeon{\textquoteright}s visual and tactile senses in a way that no other imaging device can achieve resulting in less trauma to surrounding healthy brain tissue during surgery. To minimize the trauma to surrounding healthy brain tissue, it would be beneficial to operate through a narrow surgical corridor dissected by the neurosurgeon. Facilitating tumor removal by accessing regions outside the direct {\textquotedblleft}line-of-sight{\textquotedblright} of the neurosurgical corridor will require a highly dexterous, small cross section, and MRI-compatible robot. Developing such a robot is extremely challenging task. In this paper we report a preliminary design of 6-DOF robot for possible application in neurosurgery. The robot actuators and body parts are constructed from MRI compatible materials. The current prototype is 0.36{\textquotedblright} in diameter and weighs only 0.0289 N (2.95 grams). The device was actuated using Flexinol{\textregistered} which is a shape memory alloy manufactured by Dynalloy, Inc. The end-effector forces ranged from 12 mN to 50 mN depending on the robot configuration. The end-effector force to robot weight ratio varied from 0.41 to 1.73. During trials the robot motion was repeatable and the range of motion of the robot was about 90 degrees for the end-effector when one side shape memory alloy (SMA) channel was actuated. The actuation time from the start to finish was about 2.5 s.}, isbn = {978-0-7918-4326-0}, doi = {10.1115/DETC2008-49587}, url = {http://link.aip.org/link/ASMECP/v2008/i43260/p747/s1\&Agg=doi}, author = {Pappafotis,Nicholas and Bejgerowski,Wojciech and Gullapalli,Rao and Simard,J. Marc and Gupta, Satyandra K. and Desai,Jaydev P.} } @article {14367, title = {Trusting spam reporters: A reporter-based reputation system for email filtering}, journal = {ACM Transactions on Information Systems (TOIS)}, volume = {27}, year = {2008}, month = {2008/12//}, pages = {3:1{\textendash}3:27 - 3:1{\textendash}3:27}, abstract = {Spam is a growing problem; it interferes with valid email and burdens both email users and service providers. In this work, we propose a reactive spam-filtering system based on reporter reputation for use in conjunction with existing spam-filtering techniques. The system has a trust-maintenance component for users, based on their spam-reporting behavior. The challenge that we consider is that of maintaining a reliable system, not vulnerable to malicious users, that will provide early spam-campaign detection to reduce the costs incurred by users and systems. We report on the utility of a reputation system for spam filtering that makes use of the feedback of trustworthy users. We evaluate our proposed framework, using actual complaint feedback from a large population of users, and validate its spam-filtering performance on a collection of real email traffic over several weeks. To test the broader implication of the system, we create a model of the behavior of malicious reporters, and we simulate the system under various assumptions using a synthetic dataset.}, keywords = {reputation systems, Spam filtering, trust}, isbn = {1046-8188}, doi = {10.1145/1416950.1416953}, url = {http://doi.acm.org/10.1145/1416950.1416953}, author = {Zheleva,Elena and Kolcz,Aleksander and Getoor, Lise} } @article {12242, title = {A Unified Framework for Multipath Routing for Unicast and Multicast Traffic}, journal = {Networking, IEEE/ACM Transactions on}, volume = {16}, year = {2008}, month = {2008/10//}, pages = {1038 - 1051}, abstract = {We study the problem of load balancing the traffic from a set of unicast and multicast sessions. The problem is formulated as an optimization problem. However, we assume that the gradient of the network cost function is not available and needs to be estimated. Multiple paths are provided between a source and a destination using application-layer overlay. We propose a novel algorithm that is based on what is known as simultaneous perturbation stochastic approximation and utilizes only noisy measurements collected and reported to the sources, using an overlay architecture. We consider three network models that reflect different sets of assumptions regarding multicast capabilities of the network. Using an analytical model we first prove the almost sure convergence of the algorithm to a corresponding optimal solution under each network model considered in this paper with decreasing step sizes. Then, we establish the weak convergence (or convergence in distribution) with a fixed step size. In addition, we investigate the benefits acquired from implementing additional multicast capabilities by studying the relative performance of our algorithm under the three network models.}, keywords = {application-layer, approximation;unicast, balancing;multicast, channels;stochastic, communication;multipath, cost, function;optimization, network, overlay;load, perturbation, problem;simultaneous, processes;telecommunication, routing;network, routing;telecommunication, Stochastic, traffic;, traffic;multicast, traffic;multipath}, isbn = {1063-6692}, doi = {10.1109/TNET.2007.909686}, author = {Guven,T. and La,R.J. and Shayman,M.A. and Bhattacharjee, Bobby} } @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 {14434, title = {Variational Bayes via Propositionalization}, journal = {Probabilistic, Logical and Relational Learning-A Further Synthesis}, year = {2008}, month = {2008///}, author = {Sato,T. and Kameya,Y. and Kurihara,K. and De Raedt,L. and Dietterich,T. and Getoor, Lise and Kersting,K. and Muggleton,S. H} } @conference {16064, title = {VAST 2008 Challenge: Introducing mini-challenges}, booktitle = {Visual Analytics Science and Technology, 2008. VAST {\textquoteright}08. IEEE Symposium on}, year = {2008}, month = {2008/10//}, pages = {195 - 196}, abstract = {Visual analytics experts realize that one effective way to push the field forward and to develop metrics for measuring the performance of various visual analytics components is to hold an annual competition. The VAST 2008 Challenge is the third year that such a competition was held in conjunction with the IEEE Visual Analytics Science and Technology (VAST) symposium. The authors restructured the contest format used in 2006 and 2007 to reduce the barriers to participation and offered four mini-challenges and a Grand Challenge. Mini Challenge participants were to use visual analytic tools to explore one of four heterogeneous data collections to analyze specific activities of a fictitious, controversial movement. Questions asked in the Grand Challenge required the participants to synthesize data from all four data sets. In this paper we give a brief overview of the data sets, the tasks, the participation, the judging, and the results.}, keywords = {2008, analytics;data, Challenge;heterogeneous, collections;visual, data, VAST, visualisation;}, doi = {10.1109/VAST.2008.4677383}, author = {Grinstein,G. and Plaisant, Catherine and Laskowski,S. and O{\textquoteright}Connell,T. and Scholtz,J. and Whiting,M.} } @conference {15063, title = {An adaptive mean shift tracking method using multiscale images}, booktitle = {Wavelet Analysis and Pattern Recognition, 2007. ICWAPR {\textquoteright}07. International Conference on}, volume = {3}, year = {2007}, month = {2007/11//}, pages = {1060 - 1066}, abstract = {An adaptive mean shift tracking method for object tracking using multiscale images is presented in this paper. A bandwidth matrix and a Gaussian kernel are used to extend the definition of target model. The method can exactly estimate the position of the tracked object using multiscale images from Gaussian pyramid. The tracking method determines the parameters of kernel bandwidth by maximizing the lower bound of a log-likelihood function, which is derived from a kernel density estimate with the bandwidth matrix and the modified weight function. The experimental results show that it can averagely converge in 2.55 iterations per frame.}, keywords = {adaptive mean shift tracking method, bandwidth matrix, Gaussian kernel, Gaussian processes, Image sequences, log-likelihood function, matrix algebra, maximum likelihood estimation, multiscale image, Object detection, object tracking}, doi = {10.1109/ICWAPR.2007.4421589}, author = {Zhuolin Jiang and Li,Shao-Fa and Gao,Dong-Fa} } @article {18734, title = {Algorithms for on-line monitoring of micro spheres in an optical tweezers-based assembly cell}, journal = {Journal of Computing and Information Science in Engineering}, volume = {7}, year = {2007}, month = {2007///}, pages = {330 - 330}, abstract = {Optical tweezers have emerged as a powerful tool for microand nanomanipulation. Using optical tweezers to perform auto- mated assembly requires on-line monitoring of components in the assembly workspace. This paper presents algorithms for estimat- ing positions and orientations of microscale and nanoscale com- ponents in the 3-Dimensional assembly workspace. Algorithms presented in this paper use images obtained by optical section microscopy. The images are first segmented to locate areas of in- terest and then image gradient information from the areas of in- terest is used to generate probable locations and orientations of components in the XY-plane. Finally, signature curves are com- puted and utilized to obtain component locations and orienta- tions in 3-D space. We have tested these algorithms with silica micro-spheres as well as metallic nanowires. We believe that the algorithms described in this paper will provide the foundation for realizing automated assembly operations in optical tweezers- based assembly cells. }, author = {Peng,T. and Balijepalli,A. and Gupta,S.K. and LeBrun,T.} } @article {15350, title = {Assessment of WENO methods with shock-confining filtering for LES of compressible turbulence}, journal = {AIAA Paper 2007}, volume = {4198}, year = {2007}, month = {2007///}, author = {Grube,N. E and Taylor,E. M and Martin, M.P} } @conference {12258, title = {Backbone construction in selfish wireless networks}, booktitle = {Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems}, series = {SIGMETRICS {\textquoteright}07}, year = {2007}, month = {2007///}, pages = {121 - 132}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {We present a protocol to construct routing backbones in wireless networks composed of selfish participants. Backbones are inherently cooperative, so constructing them in selfish environments is particularly difficult; participants want a backbone to exist (soothers relay their packets) but do not want to join the backbone (so they do not have to relay packets for others). We model the wireless backbone as a public good and use impatience as an incentive for cooperation. To determine if and when to donate to this public good, each participant calculates how patient it should be in obtaining the public good. We quantify patience using the Volunteer{\textquoteright}s Timing Dilemma (VTD), which we extend to general multihop network settings. Using our generalized VTD analysis, each node individually computes as its dominant strategy the amount of time to wait before joining the backbone. We evaluate our protocol using both simulations and an implementation. Our results show that, even though participants in our system deliberately wait before volunteering, a backbone is formed quickly. Further, the quality of the backbone (such as the size and resulting network lifetime) is comparable to that of existing backbone protocols that assume altruistic behavior.}, keywords = {incentives, public good, selfish network, volunteer{\textquoteright}s dilemma, wireless backbone}, isbn = {978-1-59593-639-4}, doi = {10.1145/1254882.1254896}, url = {http://doi.acm.org/10.1145/1254882.1254896}, author = {Lee,Seungjoon and Levin,Dave and Gopalakrishnan,Vijay and Bhattacharjee, Bobby} } @article {12981, title = {Biased data reduce efficiency and effectiveness of conservation reserve networks}, journal = {Ecology Letters}, volume = {10}, year = {2007}, month = {2007/05/01/}, pages = {364 - 374}, abstract = {Complementarity-based reserve selection algorithms efficiently prioritize sites for biodiversity conservation, but they are data-intensive and most regions lack accurate distribution maps for the majority of species. We explored implications of basing conservation planning decisions on incomplete and biased data using occurrence records of the plant family Proteaceae in South Africa. Treating this high-quality database as {\textquoteleft}complete{\textquoteright}, we introduced three realistic sampling biases characteristic of biodiversity databases: a detectability sampling bias and two forms of roads sampling bias. We then compared reserve networks constructed using complete, biased, and randomly sampled data. All forms of biased sampling performed worse than both the complete data set and equal-effort random sampling. Biased sampling failed to detect a median of 1{\textendash}5\% of species, and resulted in reserve networks that were 9{\textendash}17\% larger than those designed with complete data. Spatial congruence and the correlation of irreplaceability scores between reserve networks selected with biased and complete data were low. Thus, reserve networks based on biased data require more area to protect fewer species and identify different locations than those selected with randomly sampled or complete data.}, keywords = {Bias, biodiversity conservation, complementarity, efficiency, marxan, rarity, reserve networks, reserve selection algorithms, species detection}, isbn = {1461-0248}, doi = {10.1111/j.1461-0248.2007.01025.x}, url = {http://onlinelibrary.wiley.com/doi/10.1111/j.1461-0248.2007.01025.x/abstract}, author = {Grand,Joanna and Cummings, Michael P. and Rebelo,Tony G and Ricketts,Taylor H and Neel,Maile C} } @conference {12921, title = {Bridging art and science with creativity support tools}, booktitle = {Proceedings of the 6th ACM SIGCHI conference on Creativity \& cognition}, series = {C\&C {\textquoteright}07}, year = {2007}, month = {2007///}, pages = {309 - 309}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, isbn = {978-1-59593-712-4}, doi = {10.1145/1254960.1255044}, url = {http://doi.acm.org/10.1145/1254960.1255044}, author = {Shneiderman, Ben and Rita R Colwell and Diamond,Sara and Greenhalgh,Paul and Wulf,William} } @article {16238, title = {Characterization of Ehp, a Secreted Complement Inhibitory Protein from Staphylococcus aureus}, journal = {Journal of Biological Chemistry}, volume = {282}, year = {2007}, month = {2007/10/12/}, pages = {30051 - 30061}, abstract = {We report here the discovery and characterization of Ehp, a new secreted Staphylococcus aureus protein that potently inhibits the alternative complement activation pathway. Ehp was identified through a genomic scan as an uncharacterized secreted protein from S. aureus, and immunoblotting of conditioned S. aureus culture medium revealed that the Ehp protein was secreted at the highest levels during log-phase bacterial growth. The mature Ehp polypeptide is composed of 80 residues and is 44\% identical to the complement inhibitory domain of S. aureus Efb (extracellular fibrinogen-binding protein). We observed preferential binding by Ehp to native and hydrolyzed C3 relative to fully active C3b and found that Ehp formed a subnanomolar affinity complex with these various forms of C3 by binding to its thioester-containing C3d domain. Site-directed mutagenesis demonstrated that Arg75 and Asn82 are important in forming the Ehp{\textperiodcentered}C3d complex, but loss of these side chains did not completely disrupt Ehp/C3d binding. This suggested the presence of a second C3d-binding site in Ehp, which was mapped to the proximity of Ehp Asn63. Further molecular level details of the Ehp/C3d interaction were revealed by solving the 2.7-{\r A} crystal structure of an Ehp{\textperiodcentered}C3d complex in which the low affinity site had been mutationally inactivated. Ehp potently inhibited C3b deposition onto sensitized surfaces by the alternative complement activation pathway. This inhibition was directly related to Ehp/C3d binding and was more potent than that seen for Efb-C. An altered conformation in Ehp-bound C3 was detected by monoclonal antibody C3-9, which is specific for a neoantigen exposed in activated forms of C3. Our results suggest that increased inhibitory potency of Ehp relative to Efb-C is derived from the second C3-binding site in this new protein.}, doi = {10.1074/jbc.M704247200}, url = {http://www.jbc.org/content/282/41/30051.abstract}, author = {Hammel,Michal and Sfyroera,Georgia and Pyrpassopoulos,Serapion and Ricklin,Daniel and Ramyar,Kasra X. and Pop, Mihai and Jin,Zhongmin and Lambris,John D. and Geisbrecht,Brian V.} } @conference {14389, title = {Characterizing RNA Secondary-Structure Features and Their Effects on Splice-Site Prediction}, booktitle = {Data Mining Workshops, 2007. ICDM Workshops 2007. Seventh IEEE International Conference on}, year = {2007}, month = {2007/10//}, pages = {89 - 94}, abstract = {RNA molecules are distinguished by their sequence composition and by their three-dimensional shape, called the secondary structure. The secondary structure of a pre-mRNA sequence may have a strong influence on gene splicing. In our previous work, we showed that a splice-site model employing sequence features built using our feature generation algorithm was very effective in predicting splice sites. The generated sequence features also contained biologically relevant features. In this paper, we extend the feature generation algorithm to construct secondary-structure features. These features capture the nucleotide pairing tendency in the splice-site neighborhood. We extend the splice-site model to include both pre-mRNA sequence and structure characteristics. The new model significantly outperforms the sequence-based features model. The identified secondary-structure features capture biologically relevant signals such as splicing silencers. We also found these signals to prefer specific regions around the splice-site neighborhood and we detail their preference.}, keywords = {algorithm;gene, biophysics;molecular, composition;splice-site, compounds;sequences;, computing;genetics;macromolecules;molecular, configurations;organic, features;feature, generation, model;splice-site, molecules;RNA, neighborhood;three-dimensional, pairing, RNA, secondary-structure, sequence, shape;biology, splicing;nucleotide, tendency;pre-mRNA}, doi = {10.1109/ICDMW.2007.119}, author = {Dogan,R. I and Getoor, Lise and Wilbur,W. J} } @conference {13147, title = {Classifying Computer Generated Charts}, booktitle = {Content-Based Multimedia Indexing, 2007. CBMI {\textquoteright}07. International Workshop on}, year = {2007}, month = {2007/06//}, pages = {85 - 92}, abstract = {We present an approach for classifying images of charts based on the shape and spatial relationships of their primitives. Five categories are considered: bar-charts, curve-plots, pie-charts, scatter-plots and surface-plots. We introduce two novel features to represent the structural information based on (a) region segmentation and (b) curve saliency. The local shape is characterized using the Histograms of Oriented Gradients (HOG) and the Scale Invariant Feature Transform (SIFT) descriptors. Each image is represented by sets of feature vectors of each modality. The similarity between two images is measured by the overlap in the distribution of the features -measured using the Pyramid Match algorithm. A test image is classified based on its similarity with training images from the categories. The approach is tested with a database of images collected from the Internet.}, keywords = {algorithm;scale, analysis;visual, classification;image, database;image, databases;, feature, Internet;bar-chart;curve-plot;image, invariant, match, matching;image, relationship;surface-plot;Internet;image, representation;image, segmentation;pie-chart;pyramid, segmentation;statistical, transform;scatter-plot;spatial}, doi = {10.1109/CBMI.2007.385396}, author = {Prasad,V. S.N and Siddiquie,B. and Golbeck,J. and Davis, Larry S.} } @article {14365, title = {Collective entity resolution in relational data}, journal = {ACM Trans. Knowl. Discov. Data}, volume = {1}, year = {2007}, month = {2007/03//}, abstract = {Many databases contain uncertain and imprecise references to real-world entities. The absence of identifiers for the underlying entities often results in a database which contains multiple references to the same entity. This can lead not only to data redundancy, but also inaccuracies in query processing and knowledge extraction. These problems can be alleviated through the use of entity resolution. Entity resolution involves discovering the underlying entities and mapping each database reference to these entities. Traditionally, entities are resolved using pairwise similarity over the attributes of references. However, there is often additional relational information in the data. Specifically, references to different entities may cooccur. In these cases, collective entity resolution, in which entities for cooccurring references are determined jointly rather than independently, can improve entity resolution accuracy. We propose a novel relational clustering algorithm that uses both attribute and relational information for determining the underlying domain entities, and we give an efficient implementation. We investigate the impact that different relational similarity measures have on entity resolution quality. We evaluate our collective entity resolution algorithm on multiple real-world databases. We show that it improves entity resolution performance over both attribute-based baselines and over algorithms that consider relational information but do not resolve entities collectively. In addition, we perform detailed experiments on synthetically generated data to identify data characteristics that favor collective relational resolution over purely attribute-based algorithms.}, keywords = {data cleaning, entity resolution, graph clustering, record linkage}, isbn = {1556-4681}, doi = {10.1145/1217299.1217304}, url = {http://doi.acm.org/10.1145/1217299.1217304}, author = {Bhattacharya,Indrajit and Getoor, Lise} } @conference {14388, title = {Combining Collective Classification and Link Prediction}, booktitle = {Data Mining Workshops, 2007. ICDM Workshops 2007. Seventh IEEE International Conference on}, year = {2007}, month = {2007/10//}, pages = {381 - 386}, abstract = {The problems of object classification (labeling the nodes of a graph) and link prediction (predicting the links in a graph) have been largely studied independently. Commonly, object classification is performed assuming a complete set of known links and link prediction is done assuming a fully observed set of node attributes. In most real world domains, however, attributes and links are often missing or incorrect. Object classification is not provided with all the links relevant to correct classification and link prediction is not provided all the labels needed for accurate link prediction. In this paper, we propose an approach that addresses these two problems by interleaving object classification and link prediction in a collective algorithm. We investigate empirically the conditions under which an integrated approach to object classification and link prediction improves performance, and find that performance improves over a wide range of network types, and algorithm settings.}, keywords = {algorithm;link, classification;, classification;graph, collective, prediction;object, theory;pattern}, doi = {10.1109/ICDMW.2007.35}, author = {Bilgic,M. and Namata,G.M. and Getoor, Lise} } @article {14500, title = {Combining statistical and logical inference for ontology alignment}, journal = {Workshop on Semantic Web for Collaborative Knowledge Acquisition at the International Joint Conference on Artificial Intelligence}, year = {2007}, month = {2007///}, abstract = {In recent years, ontologies have proved a veryattractive medium for storing domain knowl- edge in a variety of organizations; a few ex- ample domains are medicine1 and genetics2. The rapid evolution of representation stan- dards has led to the creation of distinct on- tology bases in overlapping domains, making it paramount for large systems to reconcile on- tological data from multiple sources. A large body of work on ontology integration[Euzenat, 2004] has produced algorithms and heuristics that have proven successful in alleviating the high computation costs of the process. How- ever, the effective use of ontology formalisms {\textendash} such as rules and axioms {\textendash} in the integra- tion process remains an open question. In this paper, we present a novel ontology integration method that takes advantage of the logical in- ference capabilities in OWL Lite to improve the recall of the merged ontologies. Our CPI (Clus- tering with Partial Inference) algorithm uses (i) graph clustering techniques to improve the process of selecting candidate matching enti- ties and (ii) a limited, adaptive reasoning pro- cess to account for the effects of introducing relationships between such entities. Our initial experiments, performed on a set of 30 pairs of publicly available ontologies, show that CPI of- fers a 30\% improvement in recall and a 25\% im- provement in answer quality compared to FCA- merge [Stumme and Maedche, 2001]. }, author = {Udrea,O. and Getoor, Lise} } @article {14494, title = {Combining Tuple and Attribute Uncertainty in Probabilistic Databases}, journal = {The first international VLDB workshop on Management of Uncertain Data}, year = {2007}, month = {2007///}, pages = {1 - 1}, abstract = {There has been a long history of work in the database communityon probabilistic databases. There is also a long tradition of work within the machine learning and reasoning under uncertainty communities on tractable factored representations of probability distributions, such as probabilistic graphical models. Recently, research from these two commu- nities are starting to share more and more commonalities, as the proba- bilistic database work incorporates richer probabilistic dependencies and the machine learning work incorporates richer relational models. In this talk, I will survey some of the recent work, including work on probabilistic relational models. I will show how these models can capture both tuple and attribute uncertainty, and discuss effective query methods. Joint work with Prithviraj Sen and Amol Deshpande. }, author = {Getoor, Lise} } @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 {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 {15904, title = {Confidentiality-preserving rank-ordered search}, booktitle = {Proceedings of the 2007 ACM workshop on Storage security and survivability}, series = {StorageSS {\textquoteright}07}, year = {2007}, month = {2007///}, pages = {7 - 12}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {This paper introduces a new framework for confidentiality preserving rank-ordered search and retrieval over large document collections. The proposed framework not only protects document/query confidentiality against an outside intruder, but also prevents an untrusted data center from learning information about the query and the document collection. We present practical techniques for proper integration of relevance scoring methods and cryptographic techniques, such as order preserving encryption, to protect data collections and indices and provide efficient and accurate search capabilities to securely rank-order documents in response to a query. Experimental results on the W3C collection show that these techniques have comparable performance to conventional search systems designed for non-encrypted data in terms of search accuracy. The proposed methods thus form the first steps to bring together advanced information retrieval and secure search capabilities for a wide range of applications including managing data in government and business operations, enabling scholarly study of sensitive data, and facilitating the document discovery process in litigation.}, keywords = {encrypted domain search, Ranked retrieval, secure index}, isbn = {978-1-59593-891-6}, doi = {10.1145/1314313.1314316}, url = {http://doi.acm.org/10.1145/1314313.1314316}, author = {Swaminathan,Ashwin and Mao,Yinian and Su,Guan-Ming and Gou,Hongmei and Varna,Avinash L. and He,Shan and M. Wu and Oard, Douglas} } @conference {13141, title = {COST: An Approach for Camera Selection and Multi-Object Inference Ordering in Dynamic Scenes}, booktitle = {Computer Vision, 2007. ICCV 2007. IEEE 11th International Conference on}, year = {2007}, month = {2007/10//}, pages = {1 - 8}, abstract = {Development of multiple camera based vision systems for analysis of dynamic objects such as humans is challenging due to occlusions and similarity in the appearance of a person with the background and other people- visual "confusion". Since occlusion and confusion depends on the presence of other people in the scene, it leads to a dependency structure where there are often loops in the resulting Bayesian network. While approaches such as loopy belief propagation can be used for inference, they are computationally expensive and convergence is not guaranteed in many situations. We present a unified approach, COST, that reasons about such dependencies and yields an order for the inference of each person in a group of people and a set of cameras to be used for inferences for a person. Using the probabilistic distribution of the positions and appearances of people, COST performs visibility and confusion analysis for each part of each person and computes the amount of information that can be computed with and without more accurate estimation of the positions of other people. We present an optimization problem to select set of cameras and inference dependencies for each person which attempts to minimize the computational cost under given performance constraints. Results show the efficiency of COST in improving the performance of such systems and reducing the computational resources required.}, doi = {10.1109/ICCV.2007.4408842}, author = {Gupta,Abhinav and Mittal,Anurag and Davis, Larry S.} } @inbook {19606, title = {On the Cost of Persistence and Authentication in Skip Lists}, booktitle = {Experimental Algorithms}, series = {Lecture Notes in Computer Science}, year = {2007}, month = {2007/01/01/}, pages = {94 - 107}, publisher = {Springer Berlin Heidelberg}, organization = {Springer Berlin Heidelberg}, abstract = {We present an extensive experimental study of authenticated data structures for dictionaries and maps implemented with skip lists. We consider realizations of these data structures that allow us to study the performance overhead of authentication and persistence. We explore various design decisions and analyze the impact of garbage collection and virtual memory paging, as well. Our empirical study confirms the efficiency of authenticated skip lists and offers guidelines for incorporating them in various applications.}, keywords = {Algorithm Analysis and Problem Complexity, algorithms, Computer Graphics, Data structures, Discrete Mathematics in Computer Science, Numeric Computing}, isbn = {978-3-540-72844-3, 978-3-540-72845-0}, url = {http://link.springer.com/chapter/10.1007/978-3-540-72845-0_8}, author = {Goodrich, Michael T. and Charalampos Papamanthou and Tamassia, Roberto}, editor = {Demetrescu, Camil} } @article {13361, title = {Data Management in the Worldwide Sensor Web}, journal = {IEEE Pervasive Computing}, volume = {6}, year = {2007}, month = {2007///}, pages = {30 - 40}, abstract = {Advances in hardware and miniaturization technologies have led to a rapid increase in the number of large-scale sensor network deployments around the world, bringing us closer to the vision of a worldwide sensor web. Exploiting the sensor web to its full potential, however, raises several hard data management challenges. Addressing these challenges requires a concerted multidisciplinary effort encompassing many computer science fields. This article outlines some of the key data management challenges of a worldwide sensor web. It also presents recent advances in data management research that aim to address these challenges. Hopefully, the scientific, ubiquitous computing, and sensor network communities will adopt some of these solutions for managing their data. The article also attempts to bring many of the remaining open issues to the attention of the database community. This article is part of a special issue on Building a Sensor-Rich World.}, keywords = {data modeling, data streams, data uncertainty, distributed systems, interoperability, sensor networks}, isbn = {1536-1268}, author = {Balazinska,Magdalena and Deshpande, Amol and Franklin,Michael J. and Gibbons,Phillip B. and Gray,Jim and Hansen,Mark and Liebhold,Michael and Nath,Suman and Szalay,Alexander and Tao,Vincent} } @inbook {15506, title = {Deductive Databases}, booktitle = {Wiley Encyclopedia of Computer Science and EngineeringWiley Encyclopedia of Computer Science and Engineering}, year = {2007}, month = {2007/12/14/}, publisher = {John Wiley \& Sons, Inc.}, organization = {John Wiley \& Sons, Inc.}, keywords = {answer set semantics, Datalog, deductive database, disjunctive database, extended database}, isbn = {9780470050118}, url = {http://onlinelibrary.wiley.com/doi/10.1002/9780470050118.ecse105/abstract}, author = {Grant,John and Minker, Jack} } @booklet {19446, title = {Description of Computer Science Higher Education in Sub-Saharan Africa: Initial Explorations}, year = {2007}, month = {2007///}, abstract = {Many countries in Sub-Saharan Africa (SSA) are in need oftechnology innovators who are equipped to leverage technologies in locally relevant domains such as health, government and education. To create skilled graduates who can build and shape locally relevant technologies, higher education institutes in Africa must have Computer Science (CS) education programs that meet local needs, for example, to satisfy the demand for entrepreneurs to build industry and strengthen an economy. This paper characterizes the current state of CS education in SSA in order to identify opportunities for addressing education challenges and to make suggestions that may improve the Information and Communication Technology (ICT) infrastructure in this region. We present the results of a survey of CS educators in SSA institutions of higher education, which was aimed at exploring the issues they face. In addition to the continued chronic under-funding of SSA education, we found that universities in SSA have smaller departments, less focus on Human Computer Interaction (HCI) and offer a variety of courses aside from undergraduate Bachelors degrees. We discuss directions to improve CS curricula through investing in locally tailored courses and changing perceptions of the value of SSA CS higher education programs, standards and educators. Further, we reflect on the challenges of conducting research on SSA. We conclude that further research in this area is needed to build on the ideas we offer here to continue to strengthen CS higher education in SSA. }, keywords = {Sub-Saharan Africa, Undergraduate computing education}, doi = {Technical Report}, url = {https://smartech.gatech.edu/handle/1853/20060}, author = {Marshini Chetty and Buckhalter, Celeste and Best, Michael L. and Grinter, Rebecca E. and Guzdial, Mark} } @article {18756, title = {Development of in-mold assembly process for realizing mesoscale revolute joints}, journal = {Transactions of North American Manufacturing Research Institution of SME}, volume = {35}, year = {2007}, month = {2007///}, abstract = {In-mold Assembly process at the mesoscalepresents several manufacturing challenges. Results reported in this paper demonstrate the technical feasibility of creating rigid body mesoscale revolute joints using In-Mold Assembly process. The following new results are reported in this paper. First, we describe a mold design with varying cavity shape to perform In-Mold Assembly. This mold design uses an accurate mold piece positioning method to avoid damage to delicate mesoscale parts during the cavity change step. Second, we describe a mold insert fabrication process for making mold inserts with the desired surface characteristics for mesoscale molding. Finally, we describe methods to limit the adhesion at the interfaces and hence create articulated revolute joint. Using the advances reported in this paper we have successfully molded a mesoscale revolute joint. To the best of our knowledge, this is the first demonstration of In-Mold Assembly process using a varying cavity shape mold to create a mesoscale revolute joint. }, url = {ftp://ftp.eng.umd.edu/:/home/glue/s/k/skgupta/pub/Publication/NAMRC07_Ananthanarayanan_draft.pdf}, author = {Ananthanarayanan,A. and Gupta,S.K. and Bruck,H. A. and Yu,Z. and Rajurkar,K. P.} } @conference {16079, title = {Discovering interesting usage patterns in text collections: integrating text mining with visualization}, booktitle = {Proceedings of the sixteenth ACM conference on Conference on information and knowledge management}, series = {CIKM {\textquoteright}07}, year = {2007}, month = {2007///}, pages = {213 - 222}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {This paper addresses the problem of making text mining results more comprehensible to humanities scholars, journalists, intelligence analysts, and other researchers, in order to support the analysis of text collections. Our system, FeatureLens1, visualizes a text collection at several levels of granularity and enables users to explore interesting text patterns. The current implementation focuses on frequent itemsets of n-grams, as they capture the repetition of exact or similar expressions in the collection. Users can find meaningful co-occurrences of text patterns by visualizing them within and across documents in the collection. This also permits users to identify the temporal evolution of usage such as increasing, decreasing or sudden appearance of text patterns. The interface could be used to explore other text features as well. Initial studies suggest that FeatureLens helped a literary scholar and 8 users generate new hypotheses and interesting insights using 2 text collections.}, keywords = {digital humanities, frequent closed itemsets, n-grams, text mining, user interface}, isbn = {978-1-59593-803-9}, doi = {10.1145/1321440.1321473}, url = {http://doi.acm.org/10.1145/1321440.1321473}, author = {Don,Anthony and Zheleva,Elena and Gregory,Machon and Tarkan,Sureyya and Auvil,Loretta and Clement,Tanya and Shneiderman, Ben and Plaisant, Catherine} } @article {12261, title = {Distributed ranked search}, journal = {High Performance Computing{\textendash}HiPC 2007}, year = {2007}, month = {2007///}, pages = {7 - 20}, abstract = {P2P deployments are a natural infrastructure for building distributed search networks. Proposed systems support locating and retrieving all results, but lack the information necessary to rank them. Users, however, are primarily interested in the most relevant results, not necessarily all possible results.Using random sampling, we extend a class of well-known information retrieval ranking algorithms such that they can be applied in this decentralized setting. We analyze the overhead of our approach, and quantify how our system scales with increasing number of documents, system size, document to node mapping (uniform versus non-uniform), and types of queries (rare versus popular terms). Our analysis and simulations show that a) these extensions are efficient, and scale with little overhead to large systems, and b) the accuracy of the results obtained using distributed ranking is comparable to that of a centralized implementation. }, author = {Gopalakrishnan,V. and Morselli,R. and Bhattacharjee, Bobby and Keleher,P. and Srinivasan, Aravind} } @inbook {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 {16257, title = {Draft Genome of the Filarial Nematode Parasite Brugia Malayi}, journal = {Science}, volume = {317}, year = {2007}, month = {2007/09/21/}, pages = {1756 - 1760}, abstract = {Parasitic nematodes that cause elephantiasis and river blindness threaten hundreds of millions of people in the developing world. We have sequenced the \~{}90 megabase (Mb) genome of the human filarial parasite Brugia malayi and predict \~{}11,500 protein coding genes in 71 Mb of robustly assembled sequence. Comparative analysis with the free-living, model nematode Caenorhabditis elegans revealed that, despite these genes having maintained little conservation of local synteny during \~{}350 million years of evolution, they largely remain in linkage on chromosomal units. More than 100 conserved operons were identified. Analysis of the predicted proteome provides evidence for adaptations of B. malayi to niches in its human and vector hosts and insights into the molecular basis of a mutualistic relationship with its Wolbachia endosymbiont. These findings offer a foundation for rational drug design.}, isbn = {0036-8075, 1095-9203}, doi = {10.1126/science.1145406}, url = {http://www.sciencemag.org/content/317/5845/1756}, author = {Ghedin,Elodie and Wang,Shiliang and Spiro,David and Caler,Elisabet and Zhao,Qi and Crabtree,Jonathan and Allen,Jonathan E and Delcher,Arthur L. and Guiliano,David B and Miranda-Saavedra,Diego and Angiuoli,Samuel V and Creasy,Todd and Amedeo,Paolo and Haas,Brian and El-Sayed, Najib M. and Wortman,Jennifer R. and Feldblyum,Tamara and Tallon,Luke and Schatz,Michael and Shumway,Martin and Koo,Hean and Salzberg,Steven L. and Schobel,Seth and Pertea,Mihaela and Pop, Mihai and White,Owen and Barton,Geoffrey J and Carlow,Clotilde K. S and Crawford,Michael J and Daub,Jennifer and Dimmic,Matthew W and Estes,Chris F and Foster,Jeremy M and Ganatra,Mehul and Gregory,William F and Johnson,Nicholas M and Jin,Jinming and Komuniecki,Richard and Korf,Ian and Kumar,Sanjay and Laney,Sandra and Li,Ben-Wen and Li,Wen and Lindblom,Tim H and Lustigman,Sara and Ma,Dong and Maina,Claude V and Martin,David M. A and McCarter,James P and McReynolds,Larry and Mitreva,Makedonka and Nutman,Thomas B and Parkinson,John and Peregr{\'\i}n-Alvarez,Jos{\'e} M and Poole,Catherine and Ren,Qinghu and Saunders,Lori and Sluder,Ann E and Smith,Katherine and Stanke,Mario and Unnasch,Thomas R and Ware,Jenna and Wei,Aguan D and Weil,Gary and Williams,Deryck J and Zhang,Yinhua and Williams,Steven A and Fraser-Liggett,Claire and Slatko,Barton and Blaxter,Mark L and Scott,Alan L} } @conference {14477, title = {A dual-view approach to interactive network visualization}, booktitle = {Proceedings of the sixteenth ACM conference on Conference on information and knowledge management}, series = {CIKM {\textquoteright}07}, year = {2007}, month = {2007///}, pages = {939 - 942}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Visualizing network data, from tree structures to arbitrarily connected graphs, is a difficult problem in information visualization. A large part of the problem is that in network data, users not only have to visualize the attributes specific to each data item, but also the links specifying how those items are connected to each other. Past approaches to resolving these difficulties focus on zooming, clustering, filtering and applying various methods of laying out nodes and edges. Such approaches, however, focus only on optimizing a network visualization in a single view, limiting the amount of information that can be shown and explored in parallel. Moreover, past approaches do not allow users to cross reference different subsets or aspects of large, complex networks. In this paper, we propose an approach to these limitations using multiple coordinated views of a given network. To illustrate our approach, we implement a tool called DualNet and evaluate the tool with a case study using an email communication network. We show how using multiple coordinated views improves navigation and provides insight into large networks with multiple node and link properties and types.}, keywords = {coordinated views, Information Visualization, interactive graph visualization, social networks}, isbn = {978-1-59593-803-9}, doi = {10.1145/1321440.1321580}, url = {http://doi.acm.org/10.1145/1321440.1321580}, author = {Namata,Galileo Mark and Staats,Brian and Getoor, Lise and Shneiderman, Ben} } @inbook {19491, title = {Ecotopia: An Ecological Framework for Change Management in Distributed Systems}, booktitle = {Architecting Dependable Systems IV}, series = {Lecture Notes in Computer Science}, year = {2007}, month = {2007/01/01/}, pages = {262 - 286}, publisher = {Springer Berlin Heidelberg}, organization = {Springer Berlin Heidelberg}, abstract = {Dynamic change management in an autonomic, service-oriented infrastructure is likely to disrupt the critical services delivered by the infrastructure. Furthermore, change management must accommodate complex real-world systems, where dependability and performance objectives are managed across multiple distributed service components and have specific criticality/value models. In this paper, we present Ecotopia, a framework for change management in complex service-oriented architectures (SOA) that is ecological in its intent: it schedules change operations with the goal of minimizing the service-delivery disruptions by accounting for their impact on the SOA environment. The change-planning functionality of Ecotopia is split between multiple objective-advisors and a system-level change-orchestrator component. The objective advisors assess the change-impact on service delivery by estimating the expected values of the Key Performance Indicators (KPIs), during and after change. The orchestrator uses the KPI estimations to assess the per-objective and overall business-value changes over a long time-horizon and to identify the scheduling plan that maximizes the overall business value. Ecotopia handles both external change requests, like software upgrades, and internal changes requests, like fault-recovery actions. We evaluate the Ecotopia framework using two realistic change-management scenarios in distributed enterprise systems.}, keywords = {Autonomic Computing, Dynamic Change Management, Fault-Tolerant Architecture, Operating systems, Performability, Service Orchestration, software engineering}, isbn = {978-3-540-74033-9, 978-3-540-74035-3}, url = {http://link.springer.com/chapter/10.1007/978-3-540-74035-3_12}, author = {Tudor Dumitras and Ro{\c s}u, Daniela and Dan, Asit and Narasimhan, Priya}, editor = {Lemos, Rog{\'e}rio de and Gacek, Cristina and Romanovsky, Alexander} } @conference {14516, title = {Efficient Conversion of X.Y Surround Sound Content to Binaural Head-Tracked Form for HRTF-Enabled Playback}, booktitle = {IEEE International Conference on Acoustics, Speech and Signal Processing, 2007. ICASSP 2007}, volume = {1}, year = {2007}, month = {2007/04//}, pages = {I-21-I-24 - I-21-I-24}, publisher = {IEEE}, organization = {IEEE}, abstract = {Binaural presentation of X.Y sound is usually performed using virtual audio principles - that is, by attempting to virtually reproduce the setup of the X+Y loudspeakers in the reference room configuration. The computational cost of such playback is linear in the number of channels in the X.Y setup. We present a novel scheme that computes, offline, a spatio-temporal representation of the sound field in the listening area and store it as a multipole expansion. During head-tracked playback, the binaural signal is obtained by evaluating the multipole expansion at the ear position corresponding to the current user pose, resulting in a fixed playback cost. The representation is further extended to incorporate individualized HRTFs at no additional cost. Simulation results are presented.}, keywords = {Acoustic fields, Acoustic scattering, acoustic signal processing, audio acoustics, Audio systems, binaural head-tracked, binaural presentation, Computational efficiency, Costs, Ear, head-related transfer function, Headphones, HRTF-enabled playback, Loudspeakers, Music, reverberation, sound field, spatio-temporal representation, surround sound, surround sound content, Transfer functions, virtual audio principles}, isbn = {1-4244-0727-3}, doi = {10.1109/ICASSP.2007.366606}, author = {Zotkin,Dmitry N and Duraiswami, Ramani and Gumerov, Nail A.} } @article {12346, title = {Efficient parallel memory organization for turbo decoders}, journal = {Red}, volume = {5}, year = {2007}, month = {2007///}, author = {Salmela,P. and Gu,R. and Bhattacharyya, Shuvra S. and Takala,J.} } @article {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.} } @conference {18654, title = {An empirical study of filesystem activity following a SSH compromise}, year = {2007}, month = {2007/12//}, pages = {1 - 5}, abstract = {Monitoring filesystem data is a common method used to detect attacks. Once a computer is compromised, attackers will likely alter files, add new files or delete existing files. The changes that attackers make may target any part of the filesystem, including metadata along with files (e.g., permissions, ownerships and inodes). In this paper, we describe an empirical study that focused on SSH compromised attacks. First statistical data on the number of files targeted and the associated activity (e.g., read, write, delete, ownership and rights) is reported. Then, we refine the analysis to identify and understand patterns in the attack activity.}, keywords = {attack activity, filesystem activity, filesystem data monitoring, intrusion detection systems evaluation, meta data, metadata, security of data, SSH compromised attacks}, doi = {10.1109/ICICS.2007.4449675}, author = {Molina,J. and Gordon,J. and Chorin,X. and Michel Cukier} } @conference {12330, title = {Energy-aware data compression for wireless sensor networks}, booktitle = {Acoustics, Speech and Signal Processing, 2007. ICASSP 2007. IEEE International Conference on}, volume = {2}, year = {2007}, month = {2007///}, pages = {II{\textendash}45 - II{\textendash}45}, author = {Puthenpurayil,S. and Gu,R. and Bhattacharyya, Shuvra S.} } @conference {12382, title = {An energy-driven design methodology for distributing DSP applications across wireless sensor networks}, booktitle = {Proceedings of RTSS}, year = {2007}, month = {2007///}, pages = {214 - 226}, author = {Shen,C. C and Plishker,W. and Bhattacharyya, Shuvra S. and Goldsman,N.} } @article {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} } @conference {15327, title = {Evaluation of Traditional and Shock-Confining LES Filters using DNS Data of Compressible Turbulence}, booktitle = {Proceedings of 18th AIAA Computational Fluid Dynamics Conference}, year = {2007}, month = {2007///}, abstract = {Uniformly high-order-accurate filtering of fluid flow properties in the presence of shocksand shocklets is theoretically susceptible to the same problem that afflicts uniformly high- order-accurate numerical methods for approximating the convective terms of the Navier- Stokes equations: the introduction of new, non-physical extrema near discontinuities. Ex- tensive investigations have been conducted into myriad types of shock-capturing methods, which adaptively decrease their order of accuracy within shock-containing regions in order to maintain accuracy and stability over time. Inspired by such work, Grube et al. (AIAA 2007-4198) have proposed the conceptually similar idea of {\textquotedblleft}shock-confining{\textquotedblright} filtering (SCF) for compressible large-eddy simulations (LES), in which a class of linear filters is subject to adaptive adjustments based on smoothness information provided by a weighted essen- tially non-oscillatory (WENO) method. In the current work, we utilize the turbulent flow fields produced by direct numerical simulations (DNS) of shock/isotropic-turbulence inter- action to perform preliminary a priori testing of these shock-confining filters against the corresponding linear filters. Although additional study, both a priori and a posteriori, is required to verify the necessity and suitability of SCF for LES, we conclude that linear filtering can indeed create serious qualitative discrepancies in global flow characteristics, discrepancies that are avoided by the use of SCF. }, author = {Taylor,E. M and Grube,N. E and Martin, M.P} } @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} } @article {13770, title = {Exploiting aspectual features and connecting words for summarization-inspired temporal-relation extraction}, journal = {Information Processing \& Management}, volume = {43}, year = {2007}, month = {2007/11//}, pages = {1681 - 1704}, abstract = {This paper presents a model that incorporates contemporary theories of tense and aspect and develops a new framework for extracting temporal relations between two sentence-internal events, given their tense, aspect, and a temporal connecting word relating the two events. A linguistic constraint on event combination has been implemented to detect incorrect parser analyses and potentially apply syntactic reanalysis or semantic reinterpretation{\textemdash}in preparation for subsequent processing for multi-document summarization. An important contribution of this work is the extension of two different existing theoretical frameworks{\textemdash}Hornstein{\textquoteright}s 1990 theory of tense analysis and Allen{\textquoteright}s 1984 theory on event ordering{\textemdash}and the combination of both into a unified system for representing and constraining combinations of different event types (points, closed intervals, and open-ended intervals). We show that our theoretical results have been verified in a large-scale corpus analysis. The framework is designed to inform a temporally motivated sentence-ordering module in an implemented multi-document summarization system.}, keywords = {Parsing and corpus analysis, Summarization, temporal ordering, Temporal-relation extraction, Tense, aspect and connecting words}, isbn = {0306-4573}, doi = {10.1016/j.ipm.2007.01.008}, url = {http://www.sciencedirect.com/science/article/pii/S0306457307000271}, author = {Dorr, Bonnie J and Gaasterland,Terry} } @article {16738, title = {Extended wavelets for multiple measures}, journal = {ACM Transactions on Database SystemsACM Trans. Database Syst.}, volume = {32}, year = {2007}, month = {2007/06//}, pages = {10-es - 10-es}, isbn = {03625915}, doi = {10.1145/1242524.1242527}, url = {http://dl.acm.org/citation.cfm?id=1242527}, author = {Deligiannakis,Antonios and Garofalakis,Minos and Roussopoulos, Nick} } @article {13999, title = {Fast computation of sums of Gaussians}, journal = {Journal of Machine Learning Research (submitted)}, volume = {4}, year = {2007}, month = {2007///}, abstract = {Evaluating sums of multivariate Gaussian kernels is a key computational task in manyproblems in computational statistics and machine learning. The computational cost of the direct evaluation of such sums scales as the product of the number of kernel functions and the evaluation points. The fast Gauss transform proposed by Greengard and Strain (1991) is a ǫ-exact approximation algorithm that reduces the computational complexity of the evaluation of the sum of N Gaussians at M points in d dimensions from O(MN) to O(M + N). However, the constant factor in O(M + N) grows exponentially with increasing dimensionality d, which makes the algorithm impractical for dimensions greater than three. In this paper we present a new algorithm where the constant factor is reduced to asymptotically polynomial order. The reduction is based on a new multivariate Taylor{\textquoteright}s series expansion (which can act both as a local as well as a far field expansion) scheme combined with the efficient space subdivision using the k-center algorithm. The proposed method differs from the original fast Gauss transform in terms of a different factorization, efficient space subdivision, and the use of different error bounds for each source point. Algorithm details, error bounds, a procedure to choose the parameters, and numerical experiments are presented. We also compare our algorithm with the dual-tree algorithm of Gray and Moore (2003). As an example we show how the proposed method can be used for very fast ǫ-exact multivariate kernel density estimation. }, author = {Raykar,V.C. and Duraiswami, Ramani and Gumerov, Nail A.} } @article {13996, title = {Fast Evaluation of the Room Transfer Function Using Multipole Expansion}, journal = {Audio, Speech, and Language Processing, IEEE Transactions on}, volume = {15}, year = {2007}, month = {2007/02//}, pages = {565 - 576}, abstract = {Reverberation in rooms is often simulated with the image method due to Allen and Berkley (1979). This method has an asymptotic complexity that is cubic in terms of the simulated reverberation length. When employed in the frequency domain, it is relatively computationally expensive if there are many receivers in the room or if the source or receiver positions are changing with time. The computational complexity of the image method is due to the repeated summation of the fields generated by a large number of image sources. In this paper, a fast method to perform such summations is presented. The method is based on multipole expansion of the monopole source potential. For offline computation of the room transfer function for N image sources and M receiver points, use of the Allen-Berkley algorithm requires O(NM) operations, whereas use of the proposed method requires only O(N+M) operations, resulting in significantly faster computation of reverberant sound fields. The proposed method also has a considerable speed advantage in situations where the room transfer function must be rapidly updated online in response to source/receiver location changes. Simulation results are presented, and algorithm accuracy, speed, and implementation details are discussed. For problems that require frequency-domain computations, the algorithm is found to generate sound fields identical to the ones obtained with the frequency-domain version of the Allen-Berkley algorithm at a fraction of computational cost}, keywords = {acoustics;computational, algorithm;frequency-domain, Alien-Berkley, analysis;reverberation;, complexity;frequency-domain, computations;image, expansion;receivers;reverberant, field;architectural, fields;reverberation;room, function;acoustic, method;image, potential;multipole, sound, source, sources;monopole, transfer}, isbn = {1558-7916}, doi = {10.1109/TASL.2006.876753}, author = {Duraiswami, Ramani and Zotkin,Dmitry N and Gumerov, Nail A.} } @conference {18458, title = {Fast Multipole Accelerated Boundary Elements for Numerical Computation of the Head Related Transfer Function}, booktitle = {IEEE International Conference on Acoustics, Speech and Signal Processing, 2007. ICASSP 2007}, volume = {1}, year = {2007}, month = {2007/04//}, pages = {I-165-I-168 - I-165-I-168}, publisher = {IEEE}, organization = {IEEE}, abstract = {The numerical computation of head related transfer functions has been attempted by a number of researchers. However, the cost of the computations has meant that usually only low frequencies can be computed and further the computations take inordinately long times. Because of this, comparisons of the computations with measurements are also difficult. We present a fast multipole based iterative preconditioned Krylov solution of a boundary element formulation of the problem and use a new formulation that enables the reciprocity technique to be accurately employed. This allows the calculation to proceed for higher frequencies and larger discretizations. Preliminary results of the computations and of comparisons with measured HRTFs are presented.}, keywords = {Acceleration, Acoustic measurements, Acoustic scattering, audio signal processing, boundary element formulation, Boundary element method, Boundary element methods, boundary-elements methods, Costs, Ear, Fast Multipole Method, Frequency, Head related transfer function, HUMANS, Irrigation, iterative methods, multipole accelerated boundary elements, multipole based iterative preconditioned Krylov solution, numerical computation, Reciprocity, Transfer functions}, isbn = {1-4244-0727-3}, doi = {10.1109/ICASSP.2007.366642}, author = {Gumerov, Nail A. and Duraiswami, Ramani and Zotkin,Dmitry N} } @article {18976, title = {Features generated for computational splice-site prediction correspond to functional elements}, journal = {BMC Bioinformatics}, volume = {8}, year = {2007}, month = {2007/10/24/}, pages = {410 - 410}, abstract = {Accurate selection of splice sites during the splicing of precursors to messenger RNA requires both relatively well-characterized signals at the splice sites and auxiliary signals in the adjacent exons and introns. We previously described a feature generation algorithm (FGA) that is capable of achieving high classification accuracy on human 3{\textquoteright} splice sites. In this paper, we extend the splice-site prediction to 5{\textquoteright} splice sites and explore the generated features for biologically meaningful splicing signals.}, isbn = {1471-2105}, doi = {10.1186/1471-2105-8-410}, url = {http://www.biomedcentral.com/1471-2105/8/410/abstract}, author = {Dogan,Rezarta I. and Getoor,Lise and Wilbur,W. John and Mount, Stephen M.} } @conference {18838, title = {Generating Multi-Stage Molding Plans for Articulated Assemblies}, year = {2007}, month = {2007/07//}, pages = {56 - 63}, abstract = {Multi-stage molding is capable of producing better-quality articulated products at a lower cost. During the multi-stage molding process, assembly operations are performed along with the molding operations. Hence, it adds new constraints to the assembly planning problem. This paper introduces the problem of generating multi-stage molding plans for articulated assemblies. We present detailed algorithms for determining the molding sequence and intermediate assembly configurations.}, keywords = {articulated assemblies, articulated products, assembly planning, assembly planning problem, intermediate assembly configuration, moulding, multistage molding}, doi = {10.1109/ISAM.2007.4288449}, author = {Priyadarshi,A. K. and Gupta,S.K.} } @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} } @article {18847, title = {Geometrical algorithms for automated design of side actions in injection moulding of complex parts}, journal = {Computer-Aided Design}, volume = {39}, year = {2007}, month = {2007/10//}, pages = {882 - 897}, abstract = {This paper describes algorithms for generating shapes of side actions to minimize a customizable injection moulding cost function. Given a set of undercut facets on a polyhedral part and the main mold opening directions, our approach works in the following manner: first, we compute candidate retraction space for every undercut facet. This space represents the set of candidate translation vectors that can be used by the side action to completely disengage from the undercut facet. As the next step, we generate a discrete set of feasible, nondominated retractions. Then we group the undercut facets into undercut regions by performing state space search over such retractions. This search step is performed by minimizing the given moulding cost function. After identifying the undercut regions, we generate the shapes of individual side actions. We believe that the results presented in this paper will provide the foundations for developing fully automated software for designing side actions.}, keywords = {Configuration spaces, Geometrical reasoning, Mould design}, isbn = {0010-4485}, doi = {10.1016/j.cad.2007.05.014}, url = {http://www.sciencedirect.com/science/article/pii/S0010448507001339}, author = {Banerjee,Ashis Gopal and Gupta, Satyandra K.} } @conference {19637, title = {Geometry and Charge State of Mixed-Ligand Au13 Nanoclusters}, booktitle = {X-RAY ABSORPTION FINE STRUCTURE - XAFS13: 13th International Conference}, volume = {882}, year = {2007}, month = {2007/02/02/}, pages = {749 - 751}, publisher = {AIP Publishing}, organization = {AIP Publishing}, abstract = {The integration of synthetic, experimental and theoretical tools into a self-consistent data analysis methodology allowed us to develop unique new levels of detail in nanoparticle characterization. We describe our methods using an example of Au 13 monolayer-protected clusters (MPCs), synthesized by ligand exchange methods. The combination of atom counting methods of scanning transmission electron microscopy and Au L3-edge EXAFS allowed us to characterize these clusters as icosahedral, with surface strain reduced from 5\% (as in ideal, regular icosahedra) to 3\%, due to the interaction with ligands. Charge transfer from Au to the thiol and phosphine ligands was evidenced by S and P K-edge XANES. A comparison of total energies of bare clusters of different geometries was performed by equivalent crystal theory calculations.}, keywords = {Atom surface interactions, Charge transfer, Data analysis, Extended X-ray absorption fine structure spectroscopy, Gold, nanoparticles, Scanning transmission electron microscopy, Surface strains, Total energy calculations, X-ray absorption near edge structure}, url = {http://scitation.aip.org/content/aip/proceeding/aipcp/10.1063/1.2644652}, author = {Frenkel, A. I. and Menard, L. D. and Northrup, P. and Rodriguez, J. A. and Zypman, F. and Dana Dachman-Soled and Gao, S.-P. and Xu, H. and Yang, J. C. and Nuzzo, R. G.} } @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 {19451, title = {HCI4D: hci challenges in the global south}, booktitle = {SIGCHI EA {\textquoteright}07}, series = {CHI EA {\textquoteright}07}, year = {2007}, month = {2007///}, pages = {2327 - 2332}, publisher = {ACM}, organization = {ACM}, abstract = {While researchers have designed user-centered systems for the Global South, fewer have discussed the unique challenges facing HCI projects. In this paper, we describe methodological and practical challenges for HCI research and practice in the Global South.}, keywords = {global south, hci, methodologies}, isbn = {978-1-59593-642-4}, url = {http://doi.acm.org/10.1145/1240866.1241002}, author = {Marshini Chetty and Grinter, Rebecca E.} } @article {14002, title = {High frequency acoustic simulations via FMM accelerated BEM}, journal = {19th Internal congress on acoustics}, volume = {159}, year = {2007}, month = {2007///}, abstract = {High frequency simulations of acoustics are among the most expensive problems to simulate. Inpractice 6 to 10 points per wavelength are required. Since the wavenumber k is inversely proportional to wavelength, if a numerical method is a surface based method (such as the BEM), then problem size scales as O(k2D2), where D is the size of the domain. Dense matrices appear and typical iter- ative solution can be achieved for O(k4D4) memory and O(k4D4) per iteration cost. We employ an algorithm based on the fast multipole method (FMM) using coaxial and diagonal translation operators based on the frequency of simulation to reduce the memory requirements and per iteration cost to O(k2D2 log kD) for larger kD (kD ~250). The number of iterations needed depend upon the condition of the matrix, and preconditioning chosen. Preconditioned Krylov methods such as the flexible gen- eralized minimum residual method (FGMRES), with preconditioning based upon a lower accuracy FMM, usually ensure a convergent iteration. Example calculations are presented. }, author = {Gumerov, Nail A. and Duraiswami, Ramani} } @article {15959, title = {HIV risk behaviors among female IDUs in developing and transitional countries}, journal = {BMC Public Health}, volume = {7}, year = {2007}, month = {2007///}, author = {Charles,C. and Des Jarlais Don,P. T and Gerry,S.} } @inbook {19453, title = {How Smart Homes Learn: The Evolution of the Networked Home and Household}, booktitle = {UbiComp 2007: Ubiquitous Computing}, series = {Lecture Notes in Computer Science}, year = {2007}, month = {2007/01/01/}, pages = {127 - 144}, publisher = {Springer Berlin Heidelberg}, organization = {Springer Berlin Heidelberg}, abstract = {Despite a growing desire to create smart homes, we know little about how networked technologies interact with a house{\textquoteright}s infrastructure. In this paper, we begin to close this gap by presenting findings from a study that examined the relationship between home networking and the house itself{\textemdash}and the work that results for householders as a consequence of this interaction. We discuss four themes that emerged: an ambiguity in understanding the virtual boundaries created by wireless networks, the home network control paradox, a new home network access paradox, and the relationship between increased responsibilities and the possibilities of wireless networking.}, keywords = {Computer Communication Networks, computers and society, home networking, Information Systems Applications (incl.Internet), infrastructure, smart home, software engineering, Systems and Data Security, User Interfaces and Human Computer Interaction}, isbn = {978-3-540-74852-6, 978-3-540-74853-3}, url = {http://link.springer.com/chapter/10.1007/978-3-540-74853-3_8}, author = {Marshini Chetty and Sung, Ja-Young and Grinter, Rebecca E.}, editor = {Krumm, John and Abowd, Gregory D. and Seneviratne, Aruna and Strang, Thomas} } @article {18574, title = {How to lease the internet in your spare time}, journal = {SIGCOMM Comput. Commun. Rev.}, volume = {37}, year = {2007}, month = {2007/01//}, pages = {61 - 64}, abstract = {Today{\textquoteright}s Internet Service Providers (ISPs) serve two roles: managing their network infrastructure and providing (arguably limited) services to end users. We argue that coupling these roles impedes the deployment of new protocols and architectures, and that the future Internet should support two separate entities: infrastructure providers (who manage the physical infrastructure) and service providers (who deploy network protocols and offer end-to-end services). We present a high-level design for Cabo, an architecture that enables this separation; we also describe challenges associated with realizing this architecture.}, isbn = {0146-4833}, doi = {10.1145/1198255.1198265}, url = {http://doi.acm.org/10.1145/1198255.1198265}, author = {Feamster, Nick and Gao,Lixin and Rexford,Jennifer} } @conference {13144, title = {Human Appearance Change Detection}, booktitle = {Image Analysis and Processing, 2007. ICIAP 2007. 14th International Conference on}, year = {2007}, month = {2007/09//}, pages = {536 - 541}, abstract = {We present a machine learning approach to detect changes in human appearance between instances of the same person that may be taken with different cameras, but over short periods of time. For each video sequence of the person, we approximately align each frame in the sequence and then generate a set of features that captures the differences between the two sequences. The features are the occupancy difference map, the codeword frequency difference map (based on a vector quantization of the set of colors and frequencies) at each aligned pixel and the histogram intersection map. A boosting technique is then applied to learn the most discriminative set of features, and these features are then used to train a support vector machine classifier to recognize significant appearance changes. We apply our approach to the problem of left package detection. We train the classifiers on a laboratory database of videos in which people are seen with and without common articles that people carry - backpacks and suitcases. We test the approach on some real airport video sequences. Moving to the real world videos requires addressing additional problems, including the view selection problem and the frame selection problem.}, keywords = {(artificial, appearance, approach;occupancy, change, changes, classification;support, classifier;vector, detection;image, detection;machine, difference, Frequency, intelligence);pattern, intersection, learning, machine, machines;vector, map;histogram, map;human, map;support, package, quantisation;video, quantization;video, recognition;boosting, recognition;image, sequence;left, sequences;image, sequences;learning, surveillance;, technique;codeword, vector}, doi = {10.1109/ICIAP.2007.4362833}, author = {Ghanem,N.M. and Davis, Larry S.} } @conference {18228, title = {Improving Embedding Payload in Binary Imageswith "Super-Pixels"}, booktitle = {Image Processing, 2007. ICIP 2007. IEEE International Conference on}, volume = {3}, year = {2007}, month = {2007/10/16/19}, pages = {III -277 -III -280 - III -277 -III -280}, abstract = {Hiding data in binary images can facilitate authentication of important documents in the digital domain, which generally requires a high embedding payload. Recently, a steganography framework known as the wet paper coding has been employed in binary image watermarking to achieve high embedding payload. In this paper, we introduce a new concept of super-pixels, and study how to incorporate them in the framework of wet paper coding to further improve the embedding payload in binary images. Using binary text documents as an example, we demonstrate the effectiveness of the proposed super-pixel technique.}, keywords = {analysis;watermarking;, analysis;wet, authentication;embedding, authentication;text, binary, coding;cryptography;data, coding;message, encapsulation;document, hiding;document, image, paper, payload;steganography;text, processing;image, watermarking;data}, doi = {10.1109/ICIP.2007.4379300}, author = {Gou,Hongmei and M. Wu} } @article {18851, title = {Incorporating manufacturability considerations during design of injection molded multi-material objects}, journal = {Research in Engineering Design}, volume = {17}, year = {2007}, month = {2007///}, pages = {207 - 231}, abstract = {The presence of an already molded component during the second and subsequent molding stages makes multi-material injection molding different from traditional injection molding process. Therefore, designing multi-material molded objects requires addressing many additional manufacturability considerations. In this paper, we first present an approach to systematically identifying potential manufacturability problems that are unique to the multi-material molding processes and design rules to avoid these problems. Then we present a comprehensive manufacturability analysis approach that incorporates both the traditional single material molding rules as well as the specific rules that have been identified for multi-material molding. Our analysis shows that sometimes the traditional rules need to be suppressed or modified. Lastly, for each of the new manufacturability problem, this paper describes algorithms for automatically detecting potential occurrences and generating redesign suggestions. These algorithms have been implemented in a computer-aided manufacturability analysis system. The approach presented in this paper is applicable to multi-shot and over molding processes. We expect that the manufacturability analysis techniques presented in this paper will help in decreasing the product development time for the injection molded multi-material objects.}, keywords = {engineering}, isbn = {0934-9839}, doi = {10.1007/s00163-007-0027-9}, url = {http://www.springerlink.com/content/c35337h3r5129525/abstract/}, author = {Banerjee,Ashis and Li,Xuejun and Fowler,Greg and Gupta, Satyandra K.} } @article {14491, title = {Inferring organizational titles in online communication}, journal = {Statistical Network Analysis: Models, Issues, and New Directions}, year = {2007}, month = {2007///}, pages = {179 - 181}, abstract = {There is increasing interest in the storage, retrieval, and analysis of email communications. One active area of research focuses on the inference of properties of the underlying social network giving rise to the email communications[1,2]. Email communication between individuals implies some type of relationship, whether it is formal, such as a manager-employee relationship, or informal, such as friendship relationships. Understanding the nature of these observed relationships can be problematic given there is a shared context among the individuals that isn{\textquoteright}t necessarily communicated. This provides a challenge for analysts that wish to explore and understand email archives for legal or historical research.}, doi = {10.1007/978-3-540-73133-7_15}, author = {Namata,G. and Getoor, Lise and Diehl,C.} } @book {19350, title = {Introduction to Statistical Relational Learning}, year = {2007}, month = {2007}, pages = {602}, publisher = {MIT Press}, organization = {MIT Press}, abstract = {Handling inherent uncertainty and exploiting compositional structure are fundamental to understanding and designing large-scale systems. Statistical relational learning builds on ideas from probability theory and statistics to address uncertainty while incorporating tools from logic, databases and programming languages to represent structure. In Introduction to Statistical Relational Learning, leading researchers in this emerging area of machine learning describe current formalisms, models, and algorithms that enable effective and robust reasoning about richly structured systems and data. The early chapters provide tutorials for material used in later chapters, offering introductions to representation, inference and learning in graphical models, and logic. The book then describes object-oriented approaches, including probabilistic relational models, relational Markov networks, and probabilistic entity-relationship models as well as logic-based formalisms including Bayesian logic programs, Markov logic, and stochastic logic programs. Later chapters discuss such topics as probabilistic models with unknown objects, relational dependency networks, reinforcement learning in relational domains, and information extraction. By presenting a variety of approaches, the book highlights commonalities and clarifies important differences among proposed approaches and, along the way, identifies important representational and algorithmic issues. Numerous applications are provided throughout.Lise Getoor is Assistant Professor in the Department of Computer Science at the University of Maryland. Ben Taskar is Assistant Professor in the Computer and Information Science Department at the University of Pennsylvania.}, keywords = {Computers / Logic Design, Computers / Machine Theory, Education / Statistics}, isbn = {9780262072885}, author = {Getoor,Lise and Taskar,Ben} } @book {14505, title = {Introduction to Statistical Relational Learning}, year = {2007}, month = {2007/11/30/}, publisher = {MIT Press}, organization = {MIT Press}, abstract = {Handling inherent uncertainty and exploiting compositional structure are fundamental to understanding and designing large-scale systems. Statistical relational learning builds on ideas from probability theory and statistics to address uncertainty while incorporating tools from logic, databases and programming languages to represent structure. In Introduction to Statistical Relational Learning, leading researchers in this emerging area of machine learning describe current formalisms, models, and algorithms that enable effective and robust reasoning about richly structured systems and data. The early chapters provide tutorials for material used in later chapters, offering introductions to representation, inference and learning in graphical models, and logic. The book then describes object-oriented approaches, including probabilistic relational models, relational Markov networks, and probabilistic entity-relationship models as well as logic-based formalisms including Bayesian logic programs, Markov logic, and stochastic logic programs. Later chapters discuss such topics as probabilistic models with unknown objects, relational dependency networks, reinforcement learning in relational domains, and information extraction. By presenting a variety of approaches, the book highlights commonalities and clarifies important differences among proposed approaches and, along the way, identifies important representational and algorithmic issues. Numerous applications are provided throughout.Lise Getoor is Assistant Professor in the Department of Computer Science at the University of Maryland. Ben Taskar is Assistant Professor in the Computer and Information Science Department at the University of Pennsylvania.}, keywords = {Business \& Economics / Statistics, Computer algorithms, Computers / Database Management / General, Computers / Logic Design, Computers / Machine Theory, Computers / Programming / Algorithms, Education / Statistics, machine learning, Machine learning - Statistical methods, Machine learning/ Statistical methods, Relational databases}, isbn = {9780262072885}, author = {Getoor, Lise} } @conference {18855, title = {Investigation of Revolute Joint Clearances Created by an In-Mold Assembly Process}, year = {2007}, month = {2007/07//}, pages = {112 - 117}, abstract = {Revolute joints are frequently used in articulated structures. Traditionally, such a joint is formed by assembling two components. As an alternative, revolute joints can be created inside the mold using an in-mold assembly process. This process eliminates the need for post-molding assembly, thus significantly reducing the cycle time and part count. The functional performance of a revolute joint depends on the clearance in the joint. The clearance in turn depends on the part shrinkage and the mold deformation during the molding process. The presence of a polymer part during the second molding stage makes an in-mold assembly process significantly different from the traditional molding process due to the difference in heat transfer and deformation characteristics. This paper presents experimental data and a preliminary model to explain the differences in clearance produced by an aluminum mold and an Aluminum mold with an Acrylonitrile butadiene styrene (ABS) insert. Our data indicates that there is a significant difference between the clearances observed from these two different types of molds. We believe that clearances produced depend strongly on the thermal history of the parts.}, keywords = {acrylonitrile butadiene styrene insert, aluminum mold, assembling, couplings, cycle time reduction, heat transfer, injection moulding, inmold assembly process, mold deformation, molding process, moulding equipment, part count reduction, plastics industry, revolute joint clearances}, doi = {10.1109/ISAM.2007.4288458}, author = {Ananthanarayanan,A. and Thamire,C. and Gupta,S.K.} } @conference {12594, title = {Joint Acoustic-Video Fingerprinting of Vehicles, Part II}, booktitle = {Acoustics, Speech and Signal Processing, 2007. ICASSP 2007. IEEE International Conference on}, volume = {2}, year = {2007}, month = {2007/04//}, pages = {II-749 -II-752 - II-749 -II-752}, abstract = {In this second paper, we first show how to estimate the wheelbase length of a vehicle using line metrology in video. We then address the vehicle fingerprinting problem using vehicle silhouettes and color invariants. We combine the acoustic metrology and classification results discussed in Part I with the video results to improve estimation performance and robustness. The acoustic video fusion is achieved in a Bayesian framework by assuming conditional independence of the observations of each modality. For the metrology density functions, Laplacian approximations are used for computational efficiency. Experimental results are given using field data}, keywords = {acoustic-video, analysis;video, approximations;acoustic, Bayesian, colour, density, efficiency;joint, estimation;Bayes, fingerprinting;metrology, framework;Laplacian, functions;performance, fusion;color, identification;image, invariants;computational, methods;acoustic, metrology;acoustic, processing;, processing;fingerprint, signal, video}, doi = {10.1109/ICASSP.2007.366344}, author = {Cevher, V. and Guo, F. and Sankaranarayanan,A. C and Chellapa, Rama} } @article {12036, title = {A Language for Human Action}, journal = {Computer}, volume = {40}, year = {2007}, month = {2007/05//}, pages = {42 - 51}, abstract = {Human-centered computing (HCC) involves conforming computer technology to humans while naturally achieving human-machine interaction. In a human-centered system, the interaction focuses on human requirements, capabilities, and limitations. These anthropocentric systems also focus on the consideration of human sensory-motor skills in a wide range of activities. This ensures that the interface between artificial agents and human users accounts for perception and action in a novel interaction paradigm. In turn, this leads to behavior understanding through cognitive models that allow content description and, ultimately, the integration of real and virtual worlds. Our work focuses on building a language that maps to the lower-level sensory and motor languages and to the higher-level natural language. An empirically demonstrated human activity language provides sensory-motor-grounded representations for understanding human actions. A linguistic framework allows the analysis and synthesis of these actions.}, keywords = {anthropocentric system, artificial agent, Artificial intelligence, cognitive model, Concrete, Databases, human action, human activity language, Human computer interaction, human factors, human sensory-motor skill, human-centered computing, human-machine interaction, HUMANS, Intelligent sensors, linguistic framework, linguistics, Mirrors, Morphology, natural language, natural languages, Neurons, Power system modeling, user interface, User interfaces}, isbn = {0018-9162}, doi = {10.1109/MC.2007.154}, author = {Guerra-Filho,G. and Aloimonos, J.} } @conference {14453, title = {Leveraging data and structure in ontology integration}, booktitle = {Proceedings of the 2007 ACM SIGMOD international conference on Management of data}, series = {SIGMOD {\textquoteright}07}, year = {2007}, month = {2007///}, pages = {449 - 460}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {There is a great deal of research on ontology integration which makes use of rich logical constraints to reason about the structural and logical alignment of ontologies. There is also considerable work on matching data instances from heterogeneous schema or ontologies. However, little work exploits the fact that ontologies include both data and structure. We aim to close this gap by presenting a new algorithm (ILIADS) that tightly integrates both data matching and logical reasoning to achieve better matching of ontologies. We evaluate our algorithm on a set of 30 pairs of OWL Lite ontologies with the schema and data matchings found by human reviewers. We compare against two systems - the ontology matching tool FCA-merge [28] and the schema matching tool COMA++ [1]. ILIADS shows an average improvement of 25\% in quality over FCA-merge and a 11\% improvement in recall over COMA++.}, keywords = {Data integration, logical inference, ontology alignment, schema mapping, statistical inference}, isbn = {978-1-59593-686-8}, doi = {10.1145/1247480.1247531}, url = {http://doi.acm.org/10.1145/1247480.1247531}, author = {Udrea,Octavian and Getoor, Lise and Miller,Ren{\'e}e J.} } @article {14512, title = {Link-based Classification}, volume = {UMIACS-TR-2007-11}, year = {2007}, month = {2007/02/19/}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {Over the past few years, a number of approximate inference algorithms fornetworked data have been put forth. We empirically compare the performance of three of the popular algorithms: loopy belief propagation, mean field relaxation labeling and iterative classification. We rate each algorithm in terms of its robustness to noise, both in attribute values and correlations across links. We also compare them across varying types of correlations across links. }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/4298}, author = {Sen,Prithviraj and Getoor, Lise} } @article {13452, title = {Local strategy learning in networked multi-agent team formation}, journal = {Autonomous Agents and Multi-Agent Systems}, volume = {15}, year = {2007}, month = {2007///}, pages = {29 - 45}, abstract = {Networked multi-agent systems are comprised of many autonomous yet interdependent agents situated in a virtual social network. Two examples of such systems are supply chain networks and sensor networks. A common challenge in many networked multi-agent systems is decentralized team formation among the spatially and logically extended agents. Even in cooperative multi-agent systems, efficient team formation is made difficult by the limited local information available to the individual agents. We present a model of distributed multi-agent team formation in networked multi-agent systems, describe a policy learning framework for joining teams based on local information, and give empirical results on improving team formation performance. In particular, we show that local policy learning from limited information leads to a significant increase in organizational team formation performance compared to a random policy.}, isbn = {1387-2532}, url = {http://dx.doi.org/10.1007/s10458-006-0007-x}, author = {Bulka,Blazej and Gaston,Matthew and desJardins, Marie} } @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 {12256, title = {Measurement and analysis of online social networks}, booktitle = {Proceedings of the 7th ACM SIGCOMM conference on Internet measurement}, series = {IMC {\textquoteright}07}, year = {2007}, month = {2007///}, pages = {29 - 42}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Online social networking sites like Orkut, YouTube, and Flickr are among the most popular sites on the Internet. Users of these sites form a social network, which provides a powerful means of sharing, organizing, and finding content and contacts. The popularity of these sites provides an opportunity to study the characteristics of online social network graphs at large scale. Understanding these graphs is important, both to improve current systems and to design new applications of online social networks. This paper presents a large-scale measurement study and analysis of the structure of multiple online social networks. We examine data gathered from four popular online social networks: Flickr, YouTube, LiveJournal, and Orkut. We crawled the publicly accessible user links on each site, obtaining a large portion of each social network{\textquoteright}s graph. Our data set contains over 11.3 million users and 328 million links. We believe that this is the first study to examine multiple online social networks at scale. Our results confirm the power-law, small-world, and scale-free properties of online social networks. We observe that the indegree of user nodes tends to match the outdegree; that the networks contain a densely connected core of high-degree nodes; and that this core links small groups of strongly clustered, low-degree nodes at the fringes of the network. Finally, we discuss the implications of these structural properties for the design of social network based systems.}, keywords = {analysis, measurement, social networks}, isbn = {978-1-59593-908-1}, doi = {10.1145/1298306.1298311}, url = {http://doi.acm.org/10.1145/1298306.1298311}, author = {Mislove,Alan and Marcon,Massimiliano and Gummadi,Krishna P. and Druschel,Peter and Bhattacharjee, Bobby} } @conference {18582, title = {Measuring the Contributions of Routing Dynamics to Prolonged End-to-End Internet Path Failures}, booktitle = {Global Telecommunications Conference, 2007. GLOBECOM {\textquoteright}07. IEEE}, year = {2007}, month = {2007/11//}, pages = {1855 - 1859}, abstract = {This paper studies the contributions of routing dynamics to the duration of long-lived end-to-end Internet path failures. Studies have shown that end-to-end Internet failures (periods of prolonged packet loss) are widespread. These failures are typically attributed to either congestion or routing dynamics. Unfortunately, the extent to which congestion and routing dynamics contribute to long-lasting path failures, and the effect of routing dynamics on end-to-end performance, are not well understood. This paper uses a joint analysis of active measurements and routing data to characterize end-to-end failures observed over one month on a topologically diverse Internet testbed. We find that routing dynamics coincide with most prolonged end-to-end failures, suggesting that routing dynamics contribute significantly to the duration of these failures. We also find that most long-lived end-to-end path failures that coincide with routing dynamics are caused by BGP convergence or instability. Our results provide new insights into the effects of routing instability on end-to-end Internet path performance.}, keywords = {diverse Internet topological testbed, Internet, prolonged end-to-end Internet path failure, routing dynamics, telecommunication network reliability, telecommunication network routing, telecommunication network topology}, doi = {10.1109/GLOCOM.2007.357}, author = {Wang,Feng and Feamster, Nick and Gao,Lixin} } @book {14003, title = {Middleware for programming NVIDIA GPUs from Fortran 9x}, volume = {7}, year = {2007}, month = {2007///}, publisher = {Supercomputing}, organization = {Supercomputing}, author = {Gumerov, Nail A. and Duraiswami, Ramani and Dorland,W.} } @article {18735, title = {Model and algorithms for point cloud construction using digital projection patterns}, journal = {Journal of Computing and Information Science in Engineering}, volume = {7}, year = {2007}, month = {2007///}, pages = {372 - 372}, author = {Peng,T. and Gupta,S.K.} } @conference {18255, title = {Noise Features for Image Tampering Detection and Steganalysis}, booktitle = {Image Processing, 2007. ICIP 2007. IEEE International Conference on}, volume = {6}, year = {2007}, month = {2007/10/16/19}, pages = {VI -97 -VI -100 - VI -97 -VI -100}, abstract = {With increasing availability of low-cost image editing softwares, the authenticity of digital images can no longer be taken for granted. Digital images have also been used as cover data for transmitting secret information in the field of steganography. In this paper, we introduce a new set of features for multimedia forensics to determine if a digital image is an authentic camera output or if it has been tampered or embedded with hidden data. We perform such image forensic analysis employing three sets of statistical noise features, including those from denoising operations, wavelet analysis, and neighborhood prediction. Our experimental results demonstrate that the proposed method can effectively distinguish digital images from their tampered or stego versions.}, keywords = {analysis;cryptography;data, analysis;image, analysis;wavelet, authenticity;hidden, computing;statistical, data;image, denoising, denoising;multimedia, detection;low-cost, editing, encapsulation;feature, extraction;image, features;steganalysis;wavelet, forensic, forensics;neighborhood, image, NOISE, operations;digital, prediction;statistical, softwares;multimedia, tampering, transforms;}, doi = {10.1109/ICIP.2007.4379530}, author = {Gou,Hongmei and Swaminathan,A. and M. Wu} } @article {13993, title = {Numerical Analysis of Plasmon Resonances in Nanoparticles Based on Fast Multipole Method}, journal = {Magnetics, IEEE Transactions on}, volume = {43}, year = {2007}, month = {2007/04//}, pages = {1465 - 1468}, abstract = {A novel technique for the numerical analysis of plasmon resonances by using the fast multipole method (FMM) is presented. This approach is based on the solution of the eigenvalue problem for boundary integral equations, which can be naturally implemented by using the FMM. Numerical examples that highlight the efficiency of the fast multipole implementation are reported}, keywords = {analysis;boundary, and, boundary, eigenfunctions;nanoparticles;plasmons;, equations;eigenvalue, equations;eigenvalues, integral, method;nanoparticle, multipole, plasmon, problems;fast, resonance;numerical}, isbn = {0018-9464}, doi = {10.1109/TMAG.2007.891413}, author = {Zhang,Zhenyu and Mayergoyz, Issak D and Gumerov, Nail A. and Duraiswami, Ramani} } @conference {13148, title = {Objects in Action: An Approach for Combining Action Understanding and Object Perception}, booktitle = {Computer Vision and Pattern Recognition, 2007. CVPR {\textquoteright}07. IEEE Conference on}, year = {2007}, month = {2007/06//}, pages = {1 - 8}, abstract = {Analysis of videos of human-object interactions involves understanding human movements, locating and recognizing objects and observing the effects of human movements on those objects. While each of these can be conducted independently, recognition improves when interactions between these elements are considered. Motivated by psychological studies of human perception, we present a Bayesian approach which unifies the inference processes involved in object classification and localization, action understanding and perception of object reaction. Traditional approaches for object classification and action understanding have relied on shape features and movement analysis respectively. By placing object classification and localization in a video interpretation framework, we can localize and classify objects which are either hard to localize due to clutter or hard to recognize due to lack of discriminative features. Similarly, by applying context on human movements from the objects on which these movements impinge and the effects of these movements, we can segment and recognize actions which are either too subtle to perceive or too hard to recognize using motion features alone.}, keywords = {analysis;image, approach;action, Bayesian, classification;image, classification;object, framework;Bayes, interactions;inference, interpretation, localization;object, methods;gesture, MOTION, movements;human, perception;, perception;human-object, perception;object, process;object, processing;visual, recognition;image, recognition;video, segmentation;action, segmentation;object, signal, understanding;human}, doi = {10.1109/CVPR.2007.383331}, author = {Gupta,A. and Davis, Larry S.} } @article {14474, title = {Online collective entity resolution}, journal = {PROCEEDINGS OF THE NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE}, volume = {22}, year = {2007}, month = {2007///}, pages = {1606 - 1606}, abstract = {Entity resolution is a critical component of data integration where the goal is to reconcile database references correspond- ing to the same real-world entities. Given the abundance of publicly available databases that have unresolved entities, we motivate the problem of quick and accurate resolution for an- swering queries over such {\textquoteleft}unclean{\textquoteright} databases. Since collec- tive entity resolution approaches {\textemdash} where related references are resolved jointly {\textemdash} have been shown to be more accu- rate than independent attribute-based resolution, we focus on adapting collective resolution for answering queries. We pro- pose a two-stage collective resolution strategy for processing queries. We then show how it can be performed on-the-fly by adaptively extracting and resolving those database references that are the most helpful for resolving the query. We validate our approach on two large real-world publication databases where we show the usefulness of collective resolution and at the same time demonstrate the need for adaptive strategies for query processing. We then show how the same queries can be answered in real time using our adaptive approach while pre- serving the gains of collective resolution. This work extends work presented in (Bhattacharya, Licamele, \& Getoor 2006).}, author = {Bhattacharya,I. and Getoor, Lise} } @article {14508, title = {Predicting Protein-Protein Interactions Using Relational Features}, volume = {CS-TR-4909}, year = {2007}, month = {2007/01/07/}, institution = {Department of Computer Science, University of Maryland, College Park}, abstract = {Proteins play a fundamental role in ever y process within the cell.Understanding how proteins interact, and the functional units they are par t of, is important to furthering our knowledge of the entire biological process. There has been a growing amount of work, both experimental and computational, on determining the protein-protein interaction network. Recently researchers have had success looking at this as a relational learning problem. In this work, we further this investigation, proposing several novel relational features for predicting protein-protein interaction. These features can be used in any classifier. Our approach allows large and complex networks to be analyzed and is an alternative to using more expensive relational methods. We show that we are able to get an accuracy of 81.7\% when predicting new links from noisy high throughput data. }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/7555}, author = {Licamele,Louis and Getoor, Lise} } @article {14366, title = {Probabilistic interval XML}, journal = {ACM Transactions on Computational Logic (TOCL)}, volume = {8}, year = {2007}, month = {2007/08//}, abstract = {Interest in XML databases has been expanding rapidly over the last few years. In this paper, we study the problem of incorporating probabilistic information into XML databases. We propose the Probabilistic Interval XML (PIXML for short) data model in this paper. Using this data model, users can express probabilistic information within XML markups. In addition, we provide two alternative formal model-theoretic semantics for PIXML data. The first semantics is a {\textquotedblleft}global{\textquotedblright} semantics which is relatively intuitive, but is not directly amenable to computation. The second semantics is a {\textquotedblleft}local{\textquotedblright} semantics which supports efficient computation. We prove several correspondence results between the two semantics. To our knowledge, this is the first formal model theoretic semantics for probabilistic interval XML. We then provide an operational semantics that may be used to compute answers to queries and that is correct for a large class of probabilistic instances.}, keywords = {Semistructured Databases, XML}, isbn = {1529-3785}, doi = {10.1145/1276920.1276926}, url = {http://doi.acm.org/10.1145/1276920.1276926}, author = {Hung,Edward and Getoor, Lise and V.S. Subrahmanian} } @inbook {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 {16806, title = {Probabilistic wavelet synopses for multiple measures}, volume = {11/225,539}, year = {2007}, month = {2007/03/15/}, abstract = {A technique for building probabilistic wavelet synopses for multi-measure data sets is provided. In the presence of multiple measures, it is demonstrated that the problem of exact probabilistic coefficient thresholding becomes significantly more complex. An algorithmic formulation for probabilistic multi-measure wavelet thresholding based on the idea of partial-order dynamic programming (PODP) is provided. A fast, greedy approximation algorithm for probabilistic multi-measure thresholding based on the idea of marginal error gains is provided. An empirical study with both synthetic and real-life data sets validated the approach, demonstrating that the algorithms outperform naive approaches based on optimizing individual measures independently and the greedy thresholding scheme provides near-optimal and, at the same time, fast and scalable solutions to the probabilistic wavelet synopsis construction problem.}, url = {http://www.google.com/patents?id=IHWbAAAAEBAJ}, author = {Deligiannakis,Antonios and Garofalakis,Minos N. and Roussopoulos, Nick} } @conference {13988, title = {Real Time Capture of Audio Images and their Use with Video}, booktitle = {Applications of Signal Processing to Audio and Acoustics, 2007 IEEE Workshop on}, year = {2007}, month = {2007/10//}, pages = {10 - 13}, abstract = {Spherical microphone arrays provide an ability to compute the acoustical intensity corresponding to different spatial directions in a given frame of audio-data. These intensities may be exhibited as an image and these images updated at a high frame rate to achieve a video stream if the data capture and intensity computations can be performed sufficiently quickly, there by creating a frame-rate audio camera. We describe how such a camera can be built and the processing done sufficiently quickly using graphics processors. The joint processing of captured frame-rate audio and video images enables applications such as visual identification of noise sources, beamforming and noise-suppression in video conferencing and others, provided it is possible to account for the spatial differences in the location of the audio and the video cameras. Based on the recognition that the spherical array can be viewed as a central projection camera it is possible to perform such joint analysis. We provide several examples of real-time applications.}, doi = {10.1109/ASPAA.2007.4393037}, author = {O{\textquoteright}donovan,Adam and Duraiswami, Ramani and Gumerov, Nail A.} } @article {12919, title = {Recovery in culture of viable but nonculturable Vibrio parahaemolyticus: regrowth or resuscitation?}, journal = {The ISME Journal}, volume = {1}, year = {2007}, month = {2007/05/10/}, pages = {111 - 120}, abstract = {The objective of this study was to explore the recovery of culturability of viable but nonculturable (VBNC) Vibrio parahaemolyticus after temperature upshift and to determine whether regrowth or resuscitation occurred. A clinical strain of V. parahaemolyticus Vp5 was rendered VBNC by exposure to artificial seawater (ASW) at 4{\textdegree}C. Aliquots of the ASW suspension of cells (0.1, 1 and 10 ml) were subjected to increased temperatures of 20{\textdegree}C and 37{\textdegree}C. Culturability of the cells in the aliquots was monitored for colony formation on a rich medium and changes in morphology were measured by scanning (SEM) and transmission (TEM) electron microscopy. Samples of VBNC cells were fixed and examined by SEM, revealing a heterogeneous population comprising small cells and larger, flattened cells. Forty-eight hours after temperature upshift to 20{\textdegree}C or 37{\textdegree}C, both elongation and division by binary fission of the cells were observed, employing SEM and TEM, but only in the 10-ml aliquots. The results suggest that a portion of VBNC cells is able to undergo cell division. It is concluded that a portion of VBNC cells of V. parahaemolyticus subjected to cold temperatures remain viable. After temperature upshift, regrowth of those cells, rather than resuscitation of all bacteria of the initial inoculum, appears to be responsible for recovery of culturability of VBNC cells of V. parahaemolyticus. Nutrient in filtrates of VBNC cells is hypothesized to allow growth of the temperature-responsive cells, with cell division occurring via binary fission, but also including an atypical, asymmetric cell division.}, 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.2007.1}, url = {http://www.nature.com/ismej/journal/v1/n2/full/ismej20071a.html}, author = {Coutard,Fran|[ccedil]|ois and Crassous,Philippe and Droguet,Micka|[euml]|l and Gobin,Eric and Rita R Colwell and Pommepuy,Monique and Hervio-Heath,Dominique} } @article {14476, title = {Relationship identification for social network discovery}, journal = {PROCEEDINGS OF THE NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE}, volume = {22}, year = {2007}, month = {2007///}, pages = {546 - 546}, abstract = {In recent years, informal, online communication has trans- formed the ways in which we connect and collaborate with friends and colleagues. With millions of individuals commu- nicating online each day, we have a unique opportunity to ob- serve the formation and evolution of roles and relationships in networked groups and organizations. Yet a number of chal- lenges arise when attempting to infer the underlying social network from data that is often ambiguous, incomplete and context-dependent. In this paper, we consider the problem of collaborative network discovery from domains such as intel- ligence analysis and litigation support where the analyst is at- tempting to construct a validated representation of the social network. We specifically address the challenge of relation- ship identification where the objective is to identify relevant communications that substantiate a given social relationship type. We propose a supervised ranking approach to the prob- lem and assess its performance on a manager-subordinate re- lationship identification task using the Enron email corpus. By exploiting message content, the ranker routinely cues the analyst to relevant communications relationships and mes- sage traffic that are indicative of the social relationship.}, author = {Diehl,C. P and Namata,G. and Getoor, Lise} } @article {15476, title = {Reliable Effects Screening: A Distributed Continuous Quality Assurance Process for Monitoring Performance Degradation in Evolving Software Systems}, journal = {Software Engineering, IEEE Transactions on}, volume = {33}, year = {2007}, month = {2007/02//}, pages = {124 - 141}, abstract = {Developers of highly configurable performance-intensive software systems often use in-house performance-oriented "regression testing" to ensure that their modifications do not adversely affect their software{\textquoteright}s performance across its large configuration space. Unfortunately, time and resource constraints can limit in-house testing to a relatively small number of possible configurations, followed by unreliable extrapolation from these results to the entire configuration space. As a result, many performance bottlenecks escape detection until systems are fielded. In our earlier work, we improved the situation outlined above by developing an initial quality assurance process called "main effects screening". This process 1) executes formally designed experiments to identify an appropriate subset of configurations on which to base the performance-oriented regression testing, 2) executes benchmarks on this subset whenever the software changes, and 3) provides tool support for executing these actions on in-the-field and in-house computing resources. Our initial process had several limitations, however, since it was manually configured (which was tedious and error-prone) and relied on strong and untested assumptions for its accuracy (which made its use unacceptably risky in practice). This paper presents a new quality assurance process called "reliable effects screening" that provides three significant improvements to our earlier work. First, it allows developers to economically verify key assumptions during process execution. Second, it integrates several model-driven engineering tools to make process configuration and execution much easier and less error prone. Third, we evaluate this process via several feasibility studies of three large, widely used performance-intensive software frameworks. Our results indicate that reliable effects screening can detect performance degradation in large-scale systems more reliably and with significantly less resources than conventional t- echniques}, keywords = {configuration subset, distributed continuous quality assurance process, evolving software systems, in house testing, main effects screening, performance bottlenecks, performance degradation monitoring, performance intensive software systems, process configuration, process execution, program testing, regression testing, reliable effects screening, software benchmarks, Software performance, software performance evaluation, Software quality, software reliability, tool support}, isbn = {0098-5589}, doi = {10.1109/TSE.2007.20}, author = {Yilmaz,C. and Porter, Adam and Krishna,A. S and Memon, Atif M. and Schmidt,D. C and Gokhale,A.S. and Natarajan,B.} } @conference {13402, title = {Representing Tuple and Attribute Uncertainty in Probabilistic Databases}, booktitle = {Seventh IEEE International Conference on Data Mining Workshops, 2007. ICDM Workshops 2007}, year = {2007}, month = {2007/10/28/31}, pages = {507 - 512}, publisher = {IEEE}, organization = {IEEE}, abstract = {There has been a recent surge in work in probabilistic databases, propelled in large part by the huge increase in noisy data sources-sensor data, experimental data, data from uncurated sources, and many others. There is a growing need to be able to flexibly represent the uncertainties in the data, and to efficiently query the data. Building on existing probabilistic database work, we present a unifying framework which allows a flexible representation of correlated tuple and attribute level uncertainties. An important capability of our representation is the ability to represent shared correlation structures in the data. We provide motivating examples to illustrate when such shared correlation structures are likely to exist. Representing shared correlations structures allows the use of sophisticated inference techniques based on lifted probabilistic inference that, in turn, allows us to achieve significant speedups while computing probabilities for results of user-submitted queries.}, keywords = {attribute uncertainty, Computer science, Conferences, correlation structures, data mining, Data models, database management systems, Educational institutions, inference mechanisms, noisy data sources, probabilistic database, probabilistic inference, Probability distribution, Query processing, Relational databases, Sensor phenomena and characterization, tuple representation, Uncertainty, uncertainty handling}, isbn = {978-0-7695-3019-2}, doi = {10.1109/ICDMW.2007.11}, author = {Sen,P. and Deshpande, Amol and Getoor, Lise} } @article {18748, title = {Retrieving matching CAD models by using partial 3D point clouds}, journal = {Computer-Aided Design \& Applications}, volume = {4}, year = {2007}, month = {2007///}, pages = {629 - 638}, abstract = {The ability to search for a CAD model that represents a specific physical part is a useful capabilitythat can be used in many different applications. This paper presents an approach to use partial 3D point cloud of an artifact for retrieving the CAD model of the artifact. We assume that the information about the physical parts will be captured by a single 3D scan that produces dense point clouds. CAD models in our approach are represented as polygonal meshes. Our approach involves segmenting the point cloud and CAD mesh models into surface patches. The next step is to identify corresponding surface patches in point clouds and CAD models that could potentially match. Finally, we compute transformations to align the point cloud to the CAD model and compute distance between them. We also present experimental results to show that our approach can be used to retrieve CAD models of mechanical parts. }, url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.92.8339\&rep=rep1\&type=pdf}, author = {Ip,C. Y and Gupta,S.K.} } @article {18269, title = {Robust scanner identification based on noise features}, journal = {Proc. SPIE, Electronic Imaging, Security, Steganography, and Watermarking of Multimedia Contents IX}, volume = {6505}, year = {2007}, month = {2007///}, pages = {0S{\textendash}0T - 0S{\textendash}0T}, abstract = {A large portion of digital image data available today is acquired using digital cameras or scanners. While camerasallow digital reproduction of natural scenes, scanners are often used to capture hardcopy art in more controlled scenarios. This paper proposes a new technique for non-intrusive scanner model identification, which can be further extended to perform tampering detection on scanned images. Using only scanned image samples that contain arbitrary content, we construct a robust scanner identifier to determine the brand/model of the scanner used to capture each scanned image. The proposed scanner identifier is based on statistical features of scanning noise. We first analyze scanning noise from several angles, including through image de-noising, wavelet analysis, and neighborhood prediction, and then obtain statistical features from each characterization. Experimental results demonstrate that the proposed method can effectively identify the correct scanner brands/models with high accuracy. }, author = {Gou,H. and Swaminathan,A. and Wu,M.} } @conference {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 {12255, title = {SAAR: A shared control plane for overlay multicast}, journal = {Proceedings of 4th USENIX Symposium on Networked Systems Design \& Implementation}, year = {2007}, month = {2007///}, pages = {57 - 72}, abstract = {Many cooperative overlay multicast systems of diverse designs have been implemented and deployed. In this paper, we explore a new architecture for overlay multicast: we factor out the control plane into a separate overlay that provides a single primitive: a configurable anycast for peer selection. This separation of control and data overlays has several advantages. Data overlays can be optimized for efficient content delivery, while the control overlay can be optimized for flexible and efficient peer selection. Several data channels can share a control plane for fast switching among content channels, which is particularly important for IPTV. And, the control overlay can be reused in multicast systems with different data plane organizations.We designed and evaluated a decentralized control overlay for endsystem multicast. The overlay proactively aggregates system state and implements a powerful anycast primitive for peer selection. We demonstrate that SAAR{\textquoteright}s efficiency in locating peers reduces channel switching time, improves the quality of content delivery, and reduces overhead, even under dynamic conditions and at scale. An experimental evaluation demonstrates that the system can efficiently support single-tree, multi-tree and block-based multicast systems. }, author = {Nandi,A. and Ganjam,A. and Druschel,P. and Ng,T. S.E and Stoica,I. and Zhang,H. and Bhattacharjee, Bobby} } @article {13990, title = {A scalar potential formulation and translation theory for the time-harmonic Maxwell equations}, journal = {Journal of Computational Physics}, volume = {225}, year = {2007}, month = {2007/07/01/}, pages = {206 - 236}, abstract = {We develop a computational method based on the Debye scalar potential representation, which efficiently reduces the solution of Maxwell{\textquoteright}s equations to the solution of two scalar Helmholtz equations. One of the key contributions of this paper is a theory for the translation of Maxwell solutions using such a representation, since the scalar potential form is not invariant with respect to translations. The translation theory is developed by introducing {\textquotedblleft}conversion{\textquotedblright} operators, which enable the representation of the electric and magnetic vector fields via scalar potentials in an arbitrary reference frame. Advantages of this representation include the fact that only two Helmholtz equations need be solved, and moreover, the divergence free constraints are satisfied automatically by construction. Truncation error bounds are also presented. The availability of a translation theory and error bounds for this representation can find application in methods such as the Fast Multipole Method.For illustration of the use of the representation and translation theory we implemented an algorithm for the simulation of Mie scattering off a system of spherical objects of different sizes and dielectric properties using a variant of the T-matrix method. The resulting system was solved using an iterative method based on GMRES. The results of the computations agree well with previous computational and experimental results. }, keywords = {Debye potentials, Electromagnetic scattering, Fast Multipole Method, Helmholtz equation, Maxwell equations, Mie scattering, T-matrix method, Translation operators}, isbn = {0021-9991}, doi = {10.1016/j.jcp.2006.11.025}, url = {http://www.sciencedirect.com/science/article/pii/S0021999106005845}, author = {Gumerov, Nail A. and Duraiswami, Ramani} } @conference {14544, title = {Scheduling to minimize gaps and power consumption}, booktitle = {Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures}, year = {2007}, month = {2007///}, pages = {46 - 54}, author = {Demaine,E. D and Ghodsi,M. and Hajiaghayi, Mohammad T. and Sayedi-Roshkhar,A. S and Zadimoghaddam,M.} } @article {16080, title = {Something that is interesting is interesting then: Using text minig and visualizations to aid interpreting repetition in Gertrude Stein{\textquoteright}s The Making of Americans}, journal = {Proceedings of the Digital Humanities Conference}, year = {2007}, month = {2007///}, pages = {40 - 44}, author = {Clement,T. and Don,A. and Plaisant, Catherine and Auvil,L. and Pape,G. and Goren,V.} } @article {18998, title = {Spliceosomal small nuclear RNA genes in 11 insect genomes}, journal = {RNARNA}, volume = {13}, year = {2007}, month = {2007/01/01/}, pages = {5 - 14}, abstract = {A monthly journal publishing high-quality, peer-reviewed research on all topics related to RNA and its metabolism in all organisms}, keywords = {honeybee, Insecta, secondary structure, snRNA, spliceosomal snRNA, U12 introns}, isbn = {1355-8382, 1469-9001}, doi = {10.1261/rna.259207}, url = {http://rnajournal.cshlp.org/content/13/1/5}, author = {Mount, Stephen M. and Gotea,Valer and Lin,Chiao-Feng and Hernandez,Kristina and Maka{\l}owski,Wojciech} } @article {14428, title = {SplicePort--An interactive splice-site analysis tool}, journal = {Nucleic Acids Research}, volume = {35}, year = {2007}, month = {2007/05/08/}, pages = {W285-W291 - W285-W291}, abstract = {SplicePort is a web-based tool for splice-site analysis that allows the user to make splice-site predictions for submitted sequences. In addition, the user can also browse the rich catalog of features that underlies these predictions, and which we have found capable of providing high classification accuracy on human splice sites. Feature selection is optimized for human splice sites, but the selected features are likely to be predictive for other mammals as well. With our interactive feature browsing and visualization tool, the user can view and explore subsets of features used in splice-site prediction (either the features that account for the classification of a specific input sequence or the complete collection of features). Selected feature sets can be searched, ranked or displayed easily. The user can group features into clusters and frequency plot WebLogos can be generated for each cluster. The user can browse the identified clusters and their contributing elements, looking for new interesting signals, or can validate previously observed signals. The SplicePort web server can be accessed at http://www.cs.umd.edu/projects/SplicePort and http://www.spliceport.org.}, isbn = {0305-1048, 1362-4962}, doi = {10.1093/nar/gkm407}, url = {http://nar.oxfordjournals.org/content/35/suppl_2/W285.short}, author = {Dogan,R. I and Getoor, Lise and Wilbur,W. J and Mount, Stephen M.} } @article {16523, title = {Swarm Intelligence Systems Using Guided Self-Organization for Collective Problem Solving}, journal = {Advances in Complex Systems}, volume = {10}, year = {2007}, month = {2007///}, pages = {5 - 34}, author = {RodrIGuez,A. and Grushin,A. and Reggia, James A. and HAUPTMAN,AMI and SIPPER,M. and PAN,Z. and Reggia, James A. and GAO,D. and DARABOS,C. and GIACOBINI,M. and others} } @article {13918, title = {A theoretical model of children{\textquoteright}s storytelling using physically-oriented technologies (SPOT)}, journal = {Journal of Educational Multimedia and Hypermedia}, volume = {16}, year = {2007}, month = {2007///}, pages = {389 - 389}, author = {Guha,M.L. and Druin, Allison and Montemayor,J. and Chipman,G. and Farber,A.} } @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} } @conference {14283, title = {Type qualifier inference for Java}, booktitle = {ACM SIGPLAN Notices}, volume = {42}, year = {2007}, month = {2007///}, pages = {321 - 336}, author = {Greenfieldboyce,D. and Foster, Jeffrey S.} } @article {12920, title = {Ultrastructure of coccoid viable but non-culturable Vibrio cholerae}, journal = {Environmental Microbiology}, volume = {9}, year = {2007}, month = {2007/02/01/}, pages = {393 - 402}, abstract = {Morphology of viable but non-culturable Vibrio cholerae was monitored for 2~years by scanning and transmission electron microscopy. Morphological changes included very small coccoid forms, after extended incubation at 4{\textdegree}C and room temperature, and sequential transformation from curved rods to irregular (\~{}1~μm) rods to \~{}0.8~μm coccoid cells and, ultimately, to tiny coccoid forms (0.07{\textendash}0.4~μm). Irregular rod-shaped and coccoid cells were equally distributed in microcosms during the first 30{\textendash}60~days of incubation at both temperatures, but only coccoid cells were observed after incubation for 60~days at 4{\textdegree}C. When V.~cholerae O1 and O139, maintained for 30{\textendash}60~days at both temperatures, were heated to 45{\textdegree}C for 60~s, after serial passage through 0.45~μm and 0.1~μm filters, and plating on Luria{\textendash}Bertania (LB) agar, only cells larger than 1~μm yielded colonies on LB agar. Approximately 0.1\% of heat-treated cultures were culturable. Cell division in the smallest coccoid cells was observed, yielding daughter cells of equal size, whereas other coccoid cells revealed bleb-like, cell wall evagination, followed by transfer of nuclear material. Coccoid cells of V.~cholerae O1 and O139 incubated at 4{\textdegree}C for more than 1~year remained substrate responsive and antigenic.}, isbn = {1462-2920}, doi = {10.1111/j.1462-2920.2006.01150.x}, url = {http://onlinelibrary.wiley.com/doi/10.1111/j.1462-2920.2006.01150.x/abstract?userIsAuthenticated=false\&deniedAccessCustomisedMessage=}, author = {Chaiyanan,Saipin and Chaiyanan,Sitthipan and Grim,Christopher and Maugel,Timothy and Huq,Anwar and Rita R Colwell} } @conference {18766, title = {Using virtual demonstrations for creating multi-media training instructions}, year = {2007}, month = {2007///}, abstract = {Often generating training instructions for virtual environments is a long and tedious process. In thispaper, we discuss the development of a virtual environment (VE) instruction generating tool called Virtual Author which is the main component of the Virtual Training Studio (VTS). VTS is a virtual environment-based training system that provides instructors with a tool to create training instructions and allows trainees to learn assembly operations in a personal virtual environment. The Virtual Author tool is designed to allow an instructor to perform virtual demonstrations using CAD models in the virtual environment in order to quickly generate VE-based training instructions for use in VTS. This paper describes the algorithms used to carry out motion smoothening of instructor{\textquoteright}s actions, automated text instruction generation based on part and assembly motions, and extraction of alignment constraints from 3D CAD models to support instruction generation. We also present examples to illustrate how the use of the Virtual Author tool leads to a significant reduction in the training instruction generation time. }, url = {http://www.cadanda.com/CAD_4_1-4__11.PDF}, author = {Schwartz,M. and Gupta,S.K. and Anand,D. K. and Brough,J. E. and Kavetsky,R.} } @conference {16074, title = {VAST 2007 Contest - Blue Iguanodon}, booktitle = {Visual Analytics Science and Technology, 2007. VAST 2007. IEEE Symposium on}, year = {2007}, month = {2007/11/30/1}, pages = {231 - 232}, abstract = {Visual analytics experts realize that one effective way to push the field forward and to develop metrics for measuring the performance of various visual analytics components is to hold an annual competition. The second visual analytics science and technology (VAST) contest was held in conjunction with the 2007 IEEE VAST symposium. In this contest participants were to use visual analytic tools to explore a large heterogeneous data collection to construct a scenario and find evidence buried in the data of illegal and terrorist activities that were occurring. A synthetic data set was made available as well as tasks. In this paper we describe some of the advances we have made from the first competition held in 2006.}, keywords = {activities;large, activities;visual, analytic, collection;terrorist, data, heterogeneous, illegal, interfaces;, tools;data, user, visualisation;graphical}, doi = {10.1109/VAST.2007.4389032}, author = {Grinstein,G. and Plaisant, Catherine and Laskowski,S. and O{\textquoteright}Connell,T. and Scholtz,J. and Whiting,M.} } @article {14361, title = {Visual analysis of dynamic group membership in temporal social networks}, journal = {ACM SIGKDD Explorations Newsletter}, volume = {9}, year = {2007}, month = {2007/12//}, pages = {13 - 21}, abstract = {C-Group is a tool for analyzing dynamic group membership in temporal social networks over time. Unlike most network visualization tools, which show the group structure within an entire network, or the group membership for a single actor, C-Group allows users to focus their analysis on a pair of individuals. While C-Group allows for viewing the addition and deletion of nodes (actors) and edges (relationships) over time, its major contribution is its focus on changing group memberships over time. By doing so, users can investigate the context of temporal group memberships for the pair. C-Group provides users with a flexible interface for defining (and redefining) groups interactively, and supports two novel visual representations of the evolving group memberships. This flexibility gives users alternate views that are appropriate for different network sizes and provides users with different insights into the grouping behavior. We demonstrate the utility of the tool on a scientific publication network.}, keywords = {dynamic group detection, group visualization, visual data mining}, isbn = {1931-0145}, doi = {10.1145/1345448.1345452}, url = {http://doi.acm.org/10.1145/1345448.1345452}, author = {Kang,Hyunmo and Getoor, Lise and Singh,Lisa} } @conference {14405, title = {Visual Mining of Multi-Modal Social Networks at Different Abstraction Levels}, booktitle = {Information Visualization, 2007. IV {\textquoteright}07. 11th International Conference}, year = {2007}, month = {2007/07//}, pages = {672 - 679}, abstract = {Social networks continue to become more and more feature rich. Using local and global structural properties and descriptive attributes are necessary for more sophisticated social network analysis and support for visual mining tasks. While a number of visualization tools for social network applications have been developed, most of them are limited to uni-modal graph representations. Some of the tools support a wide range of visualization options, including interactive views. Others have better support for calculating structural graph properties such as the density of the graph or deploying traditional statistical social network analysis. We present Invenio, a new tool for visual mining of socials. Invenio integrates a wide range of interactive visualization options from Prefuse, with graph mining algorithm support from JUNG. While the integration expands the breadth of functionality within the core engine of the tool, our goal is to interactively explore multi-modal, multi-relational social networks. Invenio also supports construction of views using both database operations and basic graph mining operations.}, keywords = {computing;, database;interactive, graph, management, mining;data, network;structural, property;visual, sciences, social, systems;graph, systems;social, theory;interactive, visualisation;database, visualization;multimodal}, doi = {10.1109/IV.2007.126}, author = {Singh,L. and Beard,M. and Getoor, Lise and Blake,M.B.} } @article {14475, title = {Voila: Efficient feature-value acquisition for classification}, journal = {PROCEEDINGS OF THE NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE}, volume = {22}, year = {2007}, month = {2007///}, pages = {1225 - 1225}, abstract = {We address the problem of efficient feature-value acquisi- tion for classification in domains in which there are varying costs associated with both feature acquisition and misclassi- fication. The objective is to minimize the sum of the infor- mation acquisition cost and misclassification cost. Any de- cision theoretic strategy tackling this problem needs to com- pute value of information for sets of features. Having cal- culated this information, different acquisition strategies are possible (acquiring one feature at time, acquiring features in sets, etc.). However, because the value of information cal- culation for arbitrary subsets of features is computationally intractable, most traditional approaches have been greedy, computing values of features one at a time. We make the problem of value of information calculation tractable in prac- tice by introducing a novel data structure called the Value of Information Lattice (VOILA). VOILA exploits dependencies between missing features and makes sharing of information value computations between different feature subsets possi- ble. To the best of our knowledge, performance differences between greedy acquisition, acquiring features in sets, and a mixed strategy have not been investigated empirically in the past, due to inherit intractability of the problem. With the help of VOILA, we are able to evaluate these strategies on five real world datasets under various cost assumptions. We show that VOILA reduces computation time dramatically. We also show that the mixed strategy outperforms both greedy acqui- sition and acquisition in sets.}, author = {Bilgic,M. and Getoor, Lise} } @article {13180, title = {3D structure recovery and unwarping of surfaces applicable to planes}, journal = {International journal of computer vision}, volume = {66}, year = {2006}, month = {2006///}, pages = {261 - 281}, abstract = {The deformation of applicable surfaces such as sheets of paper satisfies the differential geometric constraints of isometry (lengths and areas are conserved) and vanishing Gaussian curvature. We show that these constraints lead to a closed set of equations that allow recovery of the full geometric structure from a single image of the surface and knowledge of its undeformed shape. We show that these partial differential equations can be reduced to the Hopf equation that arises in non-linear wave propagation, and deformations of the paper can be interpreted in terms of the characteristics of this equation. A new exact integration of these equations is developed that relates the 3-D structure of the applicable surface to an image. The solution is tested by comparison with particular exact solutions. We present results for both the forward and the inverse 3D structure recovery problem.}, author = {Gumerov, Nail A. and Zandifar,A. and Duraiswami, Ramani and Davis, Larry S.} } @article {16492, title = {Adaptive pull-based policies for wide area data delivery}, journal = {ACM Transactions on Database Systems (TODS)}, volume = {31}, year = {2006}, month = {2006///}, pages = {631 - 671}, author = {Bright,L. and Gal,A. and Raschid, Louiqa} } @conference {18758, title = {Algorithms for on-line monitoring of components in an optical tweezers-based assembly cell}, year = {2006}, month = {2006///}, pages = {1 - 13}, abstract = {Optical tweezers have emerged as a powerful tool for microand nanomanipulation. Using optical tweezers to perform auto- mated assembly requires on-line monitoring of components in the assembly workspace. This paper presents algorithms for estimat- ing positions and orientations of microscale and nanoscale com- ponents in the 3-Dimensional assembly workspace. Algorithms presented in this paper use images obtained by optical section microscopy. The images are first segmented to locate areas of in- terest and then image gradient information from the areas of in- terest is used to generate probable locations and orientations of components in the XY-plane. Finally, signature curves are com- puted and utilized to obtain component locations and orienta- tions in 3-D space. We have tested these algorithms with silica micro-spheres as well as metallic nanowires. We believe that the algorithms described in this paper will provide the foundation for realizing automated assembly operations in optical tweezers- based assembly cells. }, url = {http://www.glue.umd.edu/~skgupta/Publication/CIE06_Peng1.pdf}, author = {Peng,T. and Balijepalli,A. and Gupta,S.K. and LeBrun,T. W.} } @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} } @inbook {15719, title = {Back to Basics: CLASSY 2006}, booktitle = {DUC 06 Conference ProceedingsDUC 06 Conference Proceedings}, year = {2006}, month = {2006///}, publisher = {U.S. National Inst. of Standards and Technology}, organization = {U.S. National Inst. of Standards and Technology}, abstract = {The IDA/CCS summarization system, CLASSY, underwent significant change for this year{\textquoteright}sDUC. Two changes made processing simpler and faster: 1) we eliminated the use of a POS (part of speech) tagger for sentence splitting and to assist sentence trimming, and 2) we simplified the scoring of sentences for inclusion in the summary by introducing a new {\textquotedblleft}approximate oracle{\textquotedblright} score. An additional change introduced a modest amount of extra computation: we ordered sentences in the summary using a new Traveling Salesperson (TSP) formulation. These changes improved ROUGE scores on the DUC 2005 data from last year and gave strong performance in the DUC 2006 competition. }, url = {\tt http://duc.nist.gov/}, author = {Conroy,John M. and Schlesinger,Judith D. and O{\textquoteright}Leary, Dianne P. and Goldstein,Jade} } @conference {18767, title = {Bio-inspired, Modular, and Multifunctional Thermal and Impact Protected (TIPed) Embedded Sensing Controls Actuation Power Element (ESCAPE) Structures}, year = {2006}, month = {2006///}, abstract = {There is a great deal of interest in creating new structural concepts, such as snake robots, from analogousbiological systems. These biological systems are typically composed of materials that serve multiple functions. For example, the skin of a snake is a system consisting of a soft, hyperelastic covering, with nerves providing thermal and pressure sensitivity, and a hard, scaly coating to resist wear and tear from hard particles such as sand. Therefore, bio-inspired structures can also be composed of multifunctional materials. There are currently many approaches to fabricating bio-inspired structures with conventional materials. These concepts typically utilize a system-of-systems design approach where the structure will be composed of a structural framework, an actuation system, a power source for the actuation system, controllers, and external sensors. The drawbacks to these structures include the need to assemble all of the components, interfaces between components that can compromise reliability, constraints on scaling down the structure, and very high power consumption and power generation requirements. These problems have been addressed by developing a new scalable approach to creating multifunctional materials for bio-inspired structures where the controllers, actuators, and sensors are integrated into a modular, multifunctional structure. This approach is facilitated by using multi-material multi-stage molding processes with fully embedded electronic systems, and has resulted in new Thermal and Impact Protected (TIPed) Embedded Sensing Controls Actuation Power Element (ESCAPE) Structures for compact and rugged robotic applications. }, url = {http://sem-proceedings.com/06s/sem.org-2006-SEM-Ann-Conf-s89p07-Bio-inspired-Modular-Multifunctional-Thermal-Impact-Protected-TIPed.pdf}, author = {Gyger Jr,L. S. and Spranklin,B. W. and Gupta,S.K. and Bruck,H. A.} } @article {18012, title = {Case study of gate-level logic simulation on an extremely fine-grained chip multiprocessor}, journal = {Journal of Embedded Computing}, volume = {2}, year = {2006}, month = {2006/01/01/}, pages = {181 - 190}, abstract = {Explicit-multi-threading (XMT) is a parallel programming approach for exploiting on-chip parallelism. Its fine-grained single program multiple data (SPMD) programming model is suitable for many computing intensive applications. In this paper, we present a parallel gate level logic simulator implemented on an XMT platform and study its performance. Test results show potential for achieving more than a hundred-fold speedup over a serial implementation. This indicates an interesting possibility for a certain type of a single chip multicore architecture: use an existing easy-to-program API, such as VHDL or Verilog, for reduced application-software development time and better performance over serial performance-driven languages, such as C.}, url = {http://iospress.metapress.com/content/1E5MJUMCQL6VCHJW}, author = {Gu,Pei and Vishkin, Uzi} } @conference {13894, title = {A case study of tangible flags: a collaborative technology to enhance field trips}, booktitle = {Proceedings of the 2006 conference on Interaction design and children}, year = {2006}, month = {2006///}, pages = {1 - 8}, author = {Chipman,G. and Druin, Allison and Beer,D. and Fails,J. A and Guha,M.L. and Simms,S.} } @conference {12316, title = {Compression techniques for minimum energy consumption}, booktitle = {25th Army Science Conference}, year = {2006}, month = {2006///}, author = {Puthenpurayil,S. and Gu,R. and Bhattacharyya, Shuvra S.} } @conference {18780, title = {A computational framework for point cloud construction using digital projection patterns}, year = {2006}, month = {2006///}, address = {Philadelphia, USA}, abstract = {Many reverse engineering and inspection applications re-quire generation of point clouds representing faces of physical objects. This paper describes a computational framework for constructing point clouds using digital projection patterns. The basic principle behind the approach is to project known patterns on the object using a digital projector. A digital camera is then used to take images of the object with the known projection pat- terns imposed on it. Due to the presence of 3-D faces of the ob- ject, the projection patterns appear distorted in the images. The images are analyzed to construct the 3-D point cloud that is ca- pable of introducing the observed distortions in the images. The approach described in this paper presents three advances over the previously developed approaches. First, it is capable of work- ing with the projection patterns that have variable fringe widths and curved fringes and hence can provide improved accuracy. Second, our algorithm minimizes the number of images needed for creating the 3-D point cloud. Finally, we use a hybrid ap- proach that uses a combination of reference plane images and es- timated system parameters to construct the point cloud. This ap- proach provides good run-time computational performance and simplifies the system calibration. }, url = {http://www.glue.umd.edu/~skgupta/Publication/CIE06_Peng2.pdf}, author = {Peng,T. and Gupta,S.K.} } @conference {13163, title = {Constraint Integration for Multiview Pose Estimation of Humans with Self-Occlusions}, booktitle = {3D Data Processing, Visualization, and Transmission, Third International Symposium on}, year = {2006}, month = {2006/06//}, pages = {900 - 907}, abstract = {Detection of articulated objects such as humans is an important task in computer vision. We present a system that incorporates a variety of constraints in a unified multi- view framework to automatically detect humans in possibly crowded scenes. These constraints include the kinematic constraints, the occlusion of one part by another and the high correlation between the appearance of parts such as the two arms. The graphical structure (non-tree) obtained is optimized in a nonparametric belief propagation framework using prior based search.}, keywords = {articulated, belief, constraint;multiview, detection;computer, detection;pose, estimation;, estimation;nonparametric, framework;self-occlusion;computer, graphics;computer, method;graphical, methods;object, object, pose, propagation, structure;kinematic, vision;correlation}, doi = {10.1109/3DPVT.2006.45}, author = {Gupta,A. and Mittal,A. and Davis, Larry S.} } @conference {12427, title = {Content-based search techniques for searching CAD databases}, booktitle = {CAD Conference}, year = {2006}, month = {2006///}, abstract = {The popularity of 3D CAD systems is resulting in large assembly and part databases being createdby product development organizations. Over the last few years several content-based techniques have emerged to search these databases. Ability to perform content-based searches on CAD databases is expected to help the designers and manufacturing engineers in many different ways. Representative examples include part-family formation, redesign suggestion generation, supplier selection, cost estimation, tooling design, machine selection, stock selection, and design reuse. This paper covers the following three topics. First, it presents an overview of different types of part search techniques. Second, it presents an overview of the different aspects of assembly search techniques. Finally, it identifies the open challenges in these areas and outlines future research directions. }, author = {Gupta, Satyandra K. and Cardone, Antonio and Deshmukh,A.} } @conference {14459, title = {Cost-sensitive learning with conditional Markov networks}, booktitle = {Proceedings of the 23rd international conference on Machine learning}, series = {ICML {\textquoteright}06}, year = {2006}, month = {2006///}, pages = {801 - 808}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {There has been a recent, growing interest in classification and link prediction in structured domains. Methods such as CRFs (Lafferty et al., 2001) and RMNs (Taskar et al., 2002) support flexible mechanisms for modeling correlations due to the link structure. In addition, in many structured domains, there is an interesting structure in the risk or cost function associated with different misclassifications. There is a rich tradition of cost-sensitive learning applied to unstructured (IID) data. Here we propose a general framework which can capture correlations in the link structure and handle structured cost functions. We present a novel cost-sensitive structured classifier based on Maximum Entropy principles that directly determines the cost-sensitive classification. We contrast this with an approach which employs a standard 0/1 loss structured classifier followed by minimization of the expected cost of misclassification. We demonstrate the utility of our proposed classifier with experiments on both synthetic and real-world data.}, isbn = {1-59593-383-2}, doi = {10.1145/1143844.1143945}, url = {http://doi.acm.org/10.1145/1143844.1143945}, author = {Sen,Prithviraj and Getoor, Lise} } @article {17042, title = {Creativity Support Tools: Report From a U.S. National Science Foundation Sponsored Workshop}, journal = {International Journal of Human-Computer Interaction}, volume = {20}, year = {2006}, month = {2006///}, pages = {61 - 77}, abstract = {Creativity support tools is a research topic with high risk but potentially very high payoff. The goal is to develop improved software and user interfaces that empower users to be not only more productive but also more innovative. Potential users include software and other engineers, diverse scientists, product and graphic designers, architects, educators, students, and many others. Enhanced interfaces could enable more effective searching of intellectual resources, improved collaboration among teams, and more rapid discovery processes. These advanced interfaces should also provide potent support in hypothesis formation, speedier evaluation of alternatives, improved understanding through visualization, and better dissemination of results. For creative endeavors that require composition of novel artifacts (e.g., computer programs, scientific papers, engineering diagrams, symphonies, artwork), enhanced interfaces could facilitate exploration of alternatives, prevent unproductive choices, and enable easy backtracking. This U.S. National Science Foundation sponsored workshop brought together 25 research leaders and graduate students to share experiences, identify opportunities, and formulate research challenges. Two key outcomes emerged: (a) encouragement to evaluate creativity support tools through multidimensional in-depth longitudinal case studies and (b) formulation of 12 principles for design of creativity support tools.Creativity support tools is a research topic with high risk but potentially very high payoff. The goal is to develop improved software and user interfaces that empower users to be not only more productive but also more innovative. Potential users include software and other engineers, diverse scientists, product and graphic designers, architects, educators, students, and many others. Enhanced interfaces could enable more effective searching of intellectual resources, improved collaboration among teams, and more rapid discovery processes. These advanced interfaces should also provide potent support in hypothesis formation, speedier evaluation of alternatives, improved understanding through visualization, and better dissemination of results. For creative endeavors that require composition of novel artifacts (e.g., computer programs, scientific papers, engineering diagrams, symphonies, artwork), enhanced interfaces could facilitate exploration of alternatives, prevent unproductive choices, and enable easy backtracking. This U.S. National Science Foundation sponsored workshop brought together 25 research leaders and graduate students to share experiences, identify opportunities, and formulate research challenges. Two key outcomes emerged: (a) encouragement to evaluate creativity support tools through multidimensional in-depth longitudinal case studies and (b) formulation of 12 principles for design of creativity support tools. }, isbn = {1044-7318}, doi = {10.1207/s15327590ijhc2002_1}, url = {http://www.tandfonline.com/doi/abs/10.1207/s15327590ijhc2002_1}, author = {Shneiderman, Ben and Fischer,Gerhard and Czerwinski,Mary and Resnick,Mitch and Myers,Brad and Candy,Linda and Edmonds,Ernest and Eisenberg,Mike and Giaccardi,Elisa and Hewett,Tom and Jennings,Pamela and Kules,Bill and Nakakoji,Kumiyo and Nunamaker,Jay and Pausch,Randy and Selker,Ted and Sylvan,Elisabeth and Terry,Michael} } @inbook {13751, title = {Cross-Language Access to Recorded Speech in the MALACH Project}, booktitle = {Text, Speech and DialogueText, Speech and Dialogue}, series = {Lecture Notes in Computer Science}, volume = {2448}, year = {2006}, month = {2006///}, pages = {197 - 212}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {The MALACH project seeks to help users find information in a vast multilingual collections of untranscribed oral history interviews. This paper introduces the goals of the project and focuses on supporting access by users who are unfamiliar with the interview language. It begins with a review of the state of the art in crosslanguage speech retrieval; approaches that will be investigated in the project are then described. Czech was selected as the first non-English language to be supported, so results of an initial experiment with Czech/English cross-language retrieval are reported.}, isbn = {978-3-540-44129-8}, url = {http://dx.doi.org/10.1007/3-540-46154-X_8}, author = {Oard, Douglas and Demner-Fushman,Dina and Haji{\v c},Jan and Ramabhadran,Bhuvana and Gustman,Samuel and Byrne,William and Soergel,Dagobert and Dorr, Bonnie J and Resnik, Philip and Picheny,Michael}, editor = {Sojka,Petr and Kopecek,Ivan and Pala,Karel} } @conference {14498, title = {D-Dupe: An Interactive Tool for Entity Resolution in Social Networks}, booktitle = {Visual Analytics Science And Technology, 2006 IEEE Symposium On}, year = {2006}, month = {2006/11/31/2}, pages = {43 - 50}, abstract = {Visualizing and analyzing social networks is a challenging problem that has been receiving growing attention. An important first step, before analysis can begin, is ensuring that the data is accurate. A common data quality problem is that the data may inadvertently contain several distinct references to the same underlying entity; the process of reconciling these references is called entity-resolution. D-Dupe is an interactive tool that combines data mining algorithms for entity resolution with a task-specific network visualization. Users cope with complexity of cleaning large networks by focusing on a small subnetwork containing a potential duplicate pair. The subnetwork highlights relationships in the social network, making the common relationships easy to visually identify. D-Dupe users resolve ambiguities either by merging nodes or by marking them distinct. The entity resolution process is iterative: as pairs of nodes are resolved, additional duplicates may be revealed; therefore, resolution decisions are often chained together. We give examples of how users can flexibly apply sequences of actions to produce a high quality entity resolution result. We illustrate and evaluate the benefits of D-Dupe on three bibliographic collections. Two of the datasets had already been cleaned, and therefore should not have contained duplicates; despite this fact, many duplicates were rapidly identified using D-Dupe{\textquoteright}s unique combination of entity resolution algorithms within a task-specific visual interface}, keywords = {algorithm;data, analysis;social, computing;user, D-Dupe, interactive, interface;data, interfaces;, mining, mining;interactive, network, problem;entity, QUALITY, resolution;entity-resolution;social, sciences, systems;social, tool;data, visual, visualization;task-specific}, doi = {10.1109/VAST.2006.261429}, author = {Bilgic,M. and Licamele,L. and Getoor, Lise and Shneiderman, Ben} } @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} } @inbook {12925, title = {Detection, Isolation, and Identification of Vibrio cholerae from the Environment}, booktitle = {Current Protocols in MicrobiologyCurrent Protocols in Microbiology}, year = {2006}, month = {2006/09/01/}, pages = {6A.5.1-6A.5.38 - 6A.5.1-6A.5.38}, publisher = {John Wiley \& Sons, Inc.}, organization = {John Wiley \& Sons, Inc.}, keywords = {culturable, DETECTION, Environment, identification, isolation, nonculturable, viable, Vibrio cholerae}, isbn = {9780471729259}, url = {http://onlinelibrary.wiley.com/doi/10.1002/9780471729259.mc06a05s02/abstract?userIsAuthenticated=false\&deniedAccessCustomisedMessage=}, author = {Huq,Anwar and Grim,Christopher and Rita R Colwell and Nair,G. Balakrish} } @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.} } @article {14013, title = {Efficient computation of 3-D acoustical scattering from multiple arbitrarily shaped objects using the boundary element method/fast multipole method (BEM/FMM)}, journal = {The Journal of the Acoustical Society of America}, volume = {120}, year = {2006}, month = {2006///}, pages = {3282 - 3282}, abstract = {Many applications require computation of acoustic fields in systems consisting of a large number of scatterers, which may have complex shape. Despite the boundary element method being a well-known technique for solution of the boundary value problems for the Helmholtz equation, its capabilities are usually limited by the memory and speed of computers, and conventional methods can be applicable to relatively small (up to order of 10000 boundary elements) problems. We developed and implemented an efficient computational technique, based on an iterative solver employing generalized minimal residual method in combination with matrix-vector multiplication speeded up with the fast multipole method. We demonstrate that this technique has O(N) memory and computational complexity and enables solution of problems with thousands of scatterers (millions of boundary elements) on a desktop PC. The test problems solved are of moderate frequency (up to kD<=150, where k is the wavenumber and D is the size of the computational domain). Solution of large scale scattering problems was tested by comparison with the FMM-based T-matrix method applicable for simple shape objects reported earlier [Gumerov and Duraiswami, J. Acoust. Soc. Am., 117(4), 1744{\textendash}1761 (2005)], visualization, and physical interpretation of the results.}, url = {http://link.aip.org/link/?JAS/120/3282/2}, author = {Gumerov, Nail A. and Duraiswami, Ramani} } @article {17931, title = {An Efficient Computational Method for Predicting Rotational Diffusion Tensors of Globular Proteins Using an Ellipsoid Representation}, journal = {Journal of the American Chemical Society}, volume = {128}, year = {2006}, month = {2006///}, pages = {15432 - 15444}, abstract = {We propose a new computational method for predicting rotational diffusion properties of proteins in solution. The method is based on the idea of representing protein surface as an ellipsoid shell. In contrast to other existing approaches this method uses principal component analysis of protein surface coordinates, which results in a substantial increase in the computational efficiency of the method. Direct comparison with the experimental data as well as with the recent computational approach (Garcia de la Torre; et al. J. Magn. Reson. 2000, B147, 138?146), based on representation of protein surface as a set of small spherical friction elements, shows that the method proposed here reproduces experimental data with at least the same level of accuracy and precision as the other approach, while being approximately 500 times faster. Using the new method we investigated the effect of hydration layer and protein surface topography on the rotational diffusion properties of a protein. We found that a hydration layer constructed of approximately one monolayer of water molecules smoothens the protein surface and effectively doubles the overall tumbling time. We also calculated the rotational diffusion tensors for a set of 841 protein structures representing the known protein folds. Our analysis suggests that an anisotropic rotational diffusion model is generally required for NMR relaxation data analysis in single-domain proteins, and that the axially symmetric model could be sufficient for these purposes in approximately half of the proteins.We propose a new computational method for predicting rotational diffusion properties of proteins in solution. The method is based on the idea of representing protein surface as an ellipsoid shell. In contrast to other existing approaches this method uses principal component analysis of protein surface coordinates, which results in a substantial increase in the computational efficiency of the method. Direct comparison with the experimental data as well as with the recent computational approach (Garcia de la Torre; et al. J. Magn. Reson. 2000, B147, 138?146), based on representation of protein surface as a set of small spherical friction elements, shows that the method proposed here reproduces experimental data with at least the same level of accuracy and precision as the other approach, while being approximately 500 times faster. Using the new method we investigated the effect of hydration layer and protein surface topography on the rotational diffusion properties of a protein. We found that a hydration layer constructed of approximately one monolayer of water molecules smoothens the protein surface and effectively doubles the overall tumbling time. We also calculated the rotational diffusion tensors for a set of 841 protein structures representing the known protein folds. Our analysis suggests that an anisotropic rotational diffusion model is generally required for NMR relaxation data analysis in single-domain proteins, and that the axially symmetric model could be sufficient for these purposes in approximately half of the proteins. }, isbn = {0002-7863}, doi = {10.1021/ja062715t}, url = {http://dx.doi.org/10.1021/ja062715t}, author = {Ryabov,Yaroslav E. and Geraghty,Charles and Varshney, Amitabh and Fushman, David} } @article {14429, title = {Empirical comparison of approximate inference algorithms for networked data}, journal = {Open Problems in Statistical Relational Learning: Papers from the ICML Workshop. Pittsburgh, PA: www. cs. umd. edu/projects/srl2006}, year = {2006}, month = {2006///}, abstract = {Over the past few years, a number of approx-imate inference algorithms for networked data have been put forth. We empirically compare the performance of three of the popular algorithms: loopy belief propagation, mean field relaxation labeling and iterative classification. We rate each algorithm in terms of its robustness to noise, both in attribute values and correlations across links. A novel observation from our experiments is that loopy belief propagation faces difficulty when in- ferring over data with homophily, a common type of link correlation observed in relational data. }, author = {Sen,P. and Getoor, Lise} } @article {14395, title = {Entity and relationship labeling in affiliation networks}, journal = {ICML Workshop on Statistical Network Analysis}, year = {2006}, month = {2006///}, abstract = {Many domains are best characterized as anaffiliation network describing a set of actors and a set of events interlinked together in a variety of relationships. Relational clas- sification in these domains requires the col- lective classification of both entities (actors and events) and relationships. We investigate the use of relational Markov networks (RMN) for relational classification in affiliation net- works. In this paper, we introduce a novel dataset, Profile in Terror (PIT) knowledge base, that provides a rich source of various af- filiation networks. We study two tasks, entity labeling and relationship labeling. We high- light several important issues concerning the effectiveness of relational classification. Our results show that the PIT dataset has a rich source of relational structure and therefore it is a useful dataset for statisical relational network learning community. }, author = {Zhao,B. and Sen,P. and Getoor, Lise} } @conference {14444, title = {Entity resolution in geospatial data integration}, booktitle = {Proceedings of the 14th annual ACM international symposium on Advances in geographic information systems}, series = {GIS {\textquoteright}06}, year = {2006}, month = {2006///}, pages = {83 - 90}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Due to the growing availability of geospatial data from a wide variety of sources, there is a pressing need for robust, accurate and automatic merging and matching techniques. Geospatial Entity Resolution is the process of determining, from a collection of database sources referring to geospatial locations, a single consolidated collection of {\textquoteright}true{\textquoteright} locations. At the heart of this process is the problem of determining when two locations references match---i.e., when they refer to the same underlying location. In this paper, we introduce a novel method for resolving location entities in geospatial data. A typical geospatial database contains heterogeneous features such as location name, spatial coordinates, location type and demographic information. We investigate the use of all of these features in algorithms for geospatial entity resolution. Entity resolution is further complicated by the fact that the different sources may use different vocabularies for describing the location types and a semantic mapping is required. We propose a novel approach which learns how to combine the different features to perform accurate resolutions. We present experimental results showing that methods combining spatial and non-spatial features (e.g., location-name, location-type, etc.) together outperform methods based on spatial or name information alone.}, isbn = {1-59593-529-0}, doi = {10.1145/1183471.1183486}, url = {http://doi.acm.org/10.1145/1183471.1183486}, author = {Sehgal,Vivek and Getoor, Lise and Viechnicki,Peter D} } @inbook {14424, title = {Entity Resolution in Graphs}, booktitle = {Mining Graph DataMining Graph Data}, year = {2006}, month = {2006/04/10/}, pages = {311 - 344}, publisher = {John Wiley \& Sons, Inc.}, organization = {John Wiley \& Sons, Inc.}, abstract = {This chapter contains sections titled:Introduction Related Work Motivating Example for Graph-Based Entity Resolution Graph-Based Entity Resolution: Problem Formulation Similarity Measures for Entity Resolution Graph-Based Clustering for Entity Resolution Experimental Evaluation Conclusion References }, keywords = {entity resolution in graphs, graph-based clustering for entity resolution, graph-based entity resolution problem}, isbn = {9780470073049}, url = {http://onlinelibrary.wiley.com/doi/10.1002/9780470073049.ch13/summary}, author = {Bhattacharya,Indrajit and Getoor, Lise}, editor = {Cook,Diane J. and Holder,Lawrence B.} } @conference {15852, title = {Evaluation of Multilingual and Multi-modal Information Retrieval-Seventh Workshop of the Cross-Language Evaluation Forum, CLEF 2006, Alicante, Spain, September 19-21, 2006, Revised Selected Papers}, booktitle = {Seventh Workshop of the Cross-Language Evaluation Forum, CLEF 2006}, year = {2006}, month = {2006///}, address = {Alicante, Spain}, author = {Peters,C. and Clough,P. and Gey,F. and Karlgren,J. and Magnini,B. and Oard, Douglas and De Rijke,M. and Stempfhuber,M.} } @article {14479, title = {Event classification and relationship labeling in affiliation networks}, journal = {Proceedings of the Workshop on Statistical Network Analysis (SNA) at the 23rd International Conference on Machine Learning (ICML)}, year = {2006}, month = {2006///}, abstract = {Many domains are best described as an affiliation network in which there are entities such as actors, events and organizations linked together in a variety of relationships. Relational classification in these domains requires the collective classification of both entities and relationships. In this paper, we investigate the use of relational Markov networks (RMN) for relational classification in affiliation networks. We study two tasks, event classification and relationship labeling, and discuss general issues in constructing an appropriate RMN from an affiliation network. We evaluate our methods on a novel dataset describing terrorist affiliation networks which includes data about actors (terrorists), events (terrorist attacks) and organizations (terrorist organizations). Our results highlight several important issues concerning the effectiveness of relational classification and our experiments show that the relational structure significantly helps relationship labeling.}, author = {Zhao,B. and Sen,P. and Getoor, Lise} } @article {14068, title = {Evolution of non-LTR retrotransposons in the trypanosomatid genomes: Leishmania major has lost the active elements}, journal = {Molecular and Biochemical Parasitology}, volume = {145}, year = {2006}, month = {2006/02//}, pages = {158 - 170}, abstract = {The ingi and L1Tc non-LTR retrotransposons - which constitute the ingi clade - are abundant in the genome of the trypanosomatid species Trypanosoma brucei and Trypanosoma cruzi, respectively. The corresponding retroelements, however, are not present in the genome of a closely related trypanosomatid, Leishmania major. To study the evolution of non-LTR retrotransposons in trypanosomatids, we have analyzed all ingi/L1Tc elements and highly degenerate ingi/L1Tc-related sequences identified in the recently completed T. brucei, T. cruzi and L. major genomes. The coding sequences of 242 degenerate ingi/L1Tc-related elements (DIREs) in all three genomes were reconstituted by removing the numerous frame shifts. Three independent phylogenetic analyses conducted on the conserved domains encoded by these elements show that all DIREs, including the 52 L. major DIREs, form a monophyletic group belonging to the ingi clade. This indicates that the trypanosomatid ancestor contained active mobile elements that have been retained in the Trypanosoma species, but were lost from L. major genome, where only remnants (DIRE) are detectable. All 242 DIREs analyzed group together according to their species origin with the exception of 11 T. cruzi DIREs which are close to the T. brucei ingi/DIRE families. Considering the absence of known horizontal transfer between the African T. brucei and the South-American T. cruzi, this suggests that this group of elements evolved at a lower rate when compared to the other trypanosomatid elements. Interestingly, the only nucleotide sequence conserved between ingi and L1Tc (the first 79 residues) is also present at the 5{\textquoteright}-extremity of all the full length DIREs and suggests a possible role for this conserved motif, as well as for DIREs.}, keywords = {Degenerate retroelement, Evolution, Ingi, L1Tc, Leishmania major, Non-LTR retrotransposon, Retroposon, Trypanosoma brucei, Trypanosoma cruzi}, isbn = {0166-6851}, doi = {16/j.molbiopara.2005.09.017}, url = {http://www.sciencedirect.com/science/article/pii/S0166685105002963}, author = {Bringaud,Fr{\'e}d{\'e}ric and Ghedin,Elodie and Blandin,Ga{\"e}lle and Bartholomeu,Daniella C. and Caler,Elisabet and Levin,Mariano J. and Baltz,Th{\'e}o and El-Sayed, Najib M.} } @article {14435, title = {Exploiting independence for branch operations in Bayesian learning of C\&RTs}, journal = {Probabilistic, Logical and Relational Learning-Towards a Synthesis}, year = {2006}, month = {2006///}, abstract = {In this paper we extend a methodology for Bayesian learning via MCMC, with the ability to grow arbitrarily long branches in C\&RT models. We are able to do so by exploiting independence in the model construction process. The ability to grow branches rather than single nodes has been noted as desirable in the literature. The most singular feature of the underline methodology used here in comparison to other approaches is the coupling of the prior and the proposal. The main contribution of this paper is to show how taking advantage of independence in the coupled process, can allow branch growing and swapping for proposal models.}, author = {Angelopoulos,N. and Cussens,J. and De Raedt,L. and Dietterich,T. and Getoor, Lise and Muggleton,S. H} } @article {14009, title = {Fast head-related transfer function measurement via reciprocity}, journal = {The Journal of the Acoustical Society of America}, volume = {120}, year = {2006}, month = {2006///}, pages = {2202 - 2215}, abstract = {An efficient method for head-related transfer function (HRTF) measurement is presented. By applying the acoustical principle of reciprocity, one can swap the speaker and the microphone positions in the traditional (direct) HRTF measurement setup, that is, insert a microspeaker into the subject{\textquoteright}s ear and position several microphones around the subject, enabling simultaneous HRTF acquisition at all microphone positions. The setup used for reciprocal HRTF measurement is described, and the obtained HRTFs are compared with the analytical solution for a sound-hard sphere and with KEMAR manikin HRTF obtained by the direct method. The reciprocally measured sphere HRTF agrees well with the analytical solution. The reciprocally measured and the directly measured KEMAR HRTFs are not exactly identical but agree well in spectrum shape and feature positions. To evaluate if the observed differences are significant, an auditory localization model based on work byJ. C. Middlebrooks [J. Acoust. Soc. Am. 92, 2607{\textendash}2624 (1992) ] was used to predict where a virtual sound source synthesized with the reciprocally measured HRTF would be localized if the directly measured HRTF were used for the localization. It was found that the predicted localization direction generally lies close to the measurement direction, indicating that the HRTFs obtained via the two methods are in good agreement. }, keywords = {hearing, Microphones, Transfer functions}, doi = {10.1121/1.2207578}, url = {http://link.aip.org/link/?JAS/120/2202/1}, author = {Zotkin,Dmitry N and Duraiswami, Ramani and Grassi,Elena and Gumerov, Nail A.} } @article {14005, title = {Fast multipole method for the biharmonic equation in three dimensions}, journal = {Journal of Computational Physics}, volume = {215}, year = {2006}, month = {2006/06/10/}, pages = {363 - 383}, abstract = {The evaluation of sums (matrix{\textendash}vector products) of the solutions of the three-dimensional biharmonic equation can be accelerated using the fast multipole method, while memory requirements can also be significantly reduced. We develop a complete translation theory for these equations. It is shown that translations of elementary solutions of the biharmonic equation can be achieved by considering the translation of a pair of elementary solutions of the Laplace equations. The extension of the theory to the case of polyharmonic equations in R 3 is also discussed. An efficient way of performing the FMM for biharmonic equations using the solution of a complex valued FMM for the Laplace equation is presented. Compared to previous methods presented for the biharmonic equation our method appears more efficient. The theory is implemented and numerical tests presented that demonstrate the performance of the method for varying problem sizes and accuracy requirements. In our implementation, the FMM for the biharmonic equation is faster than direct matrix{\textendash}vector product for a matrix size of 550 for a relative L2 accuracy ϵ2\&$\#$xa0;=\&$\#$xa0;10-4, and N\&$\#$xa0;=\&$\#$xa0;3550 for ϵ2\&$\#$xa0;=\&$\#$xa0;10-12.}, isbn = {0021-9991}, doi = {10.1016/j.jcp.2005.10.029}, url = {http://www.sciencedirect.com/science/article/pii/S0021999105004924}, author = {Gumerov, Nail A. and Duraiswami, Ramani} } @article {14416, title = {A feature generation algorithm for sequences with application to splice-site prediction}, journal = {Knowledge Discovery in Databases: PKDD 2006}, year = {2006}, month = {2006///}, pages = {553 - 560}, abstract = {In this paper we present a new approach to feature selection for sequence data. We identify general feature categories and give construction algorithms for each of them. We show how they can be integrated in a system that tightly couples feature construction and feature selection. This integrated process, which we refer to as feature generation, allows us to systematically search a large space of potential features. We demonstrate the effectiveness of our approach for an important component of the gene finding problem, splice-site prediction. We show that predictive models built using our feature generation algorithm achieve a significant improvement in accuracy over existing, state-of-the-art approaches.}, doi = {10.1007/11871637_55}, author = {Islamaj,R. and Getoor, Lise and Wilbur,W.} } @conference {12278, title = {File System Support for Collaboration in theWide Area}, booktitle = {Distributed Computing Systems, 2006. ICDCS 2006. 26th IEEE International Conference on}, year = {2006}, month = {2006///}, pages = {26 - 26}, abstract = {We describe the design, implementation, and performance of MFS, a new file system designed to support efficient widearea collaboration. MFS is structured around the twin abstractions of lightweight sessions and snapshots, along with a highly configurable capability-based security architecture. Sessions simplify and clarify collaborative semantics. Snapshots allow atomic access to arbitrary collections of files, and allow sharing to be defined in a simple and expressive fashion. MFS $\#$146;s security architecture is a layered system that allows diverse usage scenarios. Pure capability-based access allows clients to access data without needing expensive public key or authentication servers, or complicated administration. However, MFS $\#$146;s capabilities can also be watermarked, allowing a range of services to be added on a per-mount basis, up to and including traditional user authentication based on passwords or public keys. Basing the system around the use of immutable snapshots enables the underlying system to use several performance optimizations aggressively. Performance results from our MFS prototype show that, far from adding overhead, the use of snapshots allows the system to perform comparably to NFS in the local-area case and significantly outperform existing systems in wide-area environments.}, doi = {10.1109/ICDCS.2006.41}, author = {Gaburici,V. and Keleher,P. and Bhattacharjee, Bobby} } @inbook {18834, title = {Finding Mold-Piece Regions Using Computer Graphics Hardware}, booktitle = {Geometric Modeling and Processing - GMP 2006}, series = {Lecture Notes in Computer Science}, volume = {4077}, year = {2006}, month = {2006///}, pages = {655 - 662}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {An important step in the mold design process that ensures disassembly of mold pieces consists of identifying various regions on the part that will be formed by different mold pieces. This paper presents an efficient and robust algorithm to find and highlight the mold-piece regions on a part. The algorithm can be executed on current-generation computer graphics hardware. The complexity of the algorithm solely depends on the time to render the given part. By using a system that can quickly find various mold-piece regions on a part, designers can easily optimize the part and mold design and if needed make appropriate corrections upfront, streamlining the subsequent design steps.}, keywords = {Computer science}, isbn = {978-3-540-36711-6}, url = {http://www.springerlink.com/content/t8t3588924263p12/abstract/}, author = {Priyadarshi,Alok and Gupta, Satyandra K.}, editor = {Kim,Myung-Soo and Shimada,Kenji} } @article {18215, title = {Fingerprinting digital elevation maps}, journal = {Proceedings of SPIE}, volume = {6072}, year = {2006}, month = {2006///}, pages = {373 - 384}, abstract = {Digital elevation maps (DEMs) provide a digital representation of 3-D terrain information. In civilian appli-cations, high-precision DEMs carry a high commercial value owing to the large amount of effort in acquiring them; and in military applications, DEMs are often used to represent critical geospatial information in sensitive operations. These call for new technologies to prevent unauthorized distribution and to trace traitors in the event of information leak related to DEMs. In this paper, we propose a new digital fingerprinting technique to protect DEM data from illegal re-distribution. The proposed method enables reliable detection of fingerprints from both 3-D DEM data set and its 2-D rendering, whichever format that is available to a detector. Our method starts with extracting from a DEM a set of critical contours either corresponding to important topographic features of the terrain or having application-dependent importance. Fingerprints are then embedded into these critical contours by employing parametric curve modeling and spread spectrum embedding. Finally, a fingerprinted DEM is constructed to incorporate the marked 2-D contours. Through experimental results, we demonstrate the robustness of the proposed method against a number of challenging attacks applied to either DEMs or their contour representations. }, author = {Gou,H. and Wu,M.} } @conference {18755, title = {A flexible system framework for a nanoassembly cell using optical tweezers}, year = {2006}, month = {2006///}, address = {Philadelphia, Pennsylvania, USA}, abstract = {The optical tweezers instrument is a unique tool fordirected assembly of nanocomponents. In order to function as a viable nanomanufacturing tool, a software architecture is needed to run the optical tweezers hardware, provide an effective user interface, and allow automated operation. A flexible software system framework is described to utilize the optical tweezers hardware to its full potential. Initially we lay out the requirements for the system framework and define the broad architectural choices made while implementing the different modules. Implementation details of key system modules are then described. The flexible nature of the architecture is demonstrated by showing how a simulation module can be seamlessly included into the framework to replace the optical tweezers hardware as necessary. Finally, we show some representative assembly operations to demonstrate the capabilities of the system. }, url = {http://terpconnect.umd.edu/~skgupta/Publication/CIE06_Balijepalli.pdf}, author = {Balijepalli,A. and LeBrun,T. W. and Gupta,S.K.} } @conference {14519, title = {FMM accelerated BEM for 3D Laplace \& Helmholtz equations}, booktitle = {Proceedings Int. Conf. on Boundary Element Techniques}, year = {2006}, month = {2006///}, author = {Gumerov, Nail A. and Duraiswami, Ramani} } @conference {18480, title = {Frequency Independent Flexible Spherical Beamforming Via Rbf Fitting}, booktitle = {2006 IEEE International Conference on Acoustics, Speech and Signal Processing, 2006. ICASSP 2006 Proceedings}, volume = {5}, year = {2006}, month = {2006/05//}, pages = {V-V - V-V}, publisher = {IEEE}, organization = {IEEE}, abstract = {We describe a new method for sound analysis using a spherical microphone array without the use of quadrature over the sphere. Quadrature based solutions are very sensitive to the placement of microphones on the sphere, needing measurements to be made at exactly the quadrature positions. We propose to use fitting with band-limited radial basis functions (RBFs) rather than quadrature. Our approach results in frequency independent beamformer weights for flexibly placed microphone locations. Results are demonstrated using both synthetic and real spherical array data}, keywords = {acoustic signal processing, array signal processing, band-limited radial basis functions, Computer science, Educational institutions, Eigenvalues and eigenfunctions, Equations, Frequency, frequency independent beamformer weights, frequency independent flexible spherical beamforming, microphone arrays, Nails, Position measurement, RBF fitting, Robustness, sound analysis, spherical array data, spherical microphone array}, isbn = {1-4244-0469-X}, doi = {10.1109/ICASSP.2006.1661208}, author = {Yerukhimovich,A. and Duraiswami, Ramani and Gumerov, Nail A. and Zotkin,Dmitry N} } @article {14012, title = {Head-related transfer functions via the fast multipole accelerated boundary element method}, journal = {The Journal of the Acoustical Society of America}, volume = {120}, year = {2006}, month = {2006///}, pages = {3342 - 3343}, abstract = {Computation of head-related transfer functions (HRTF) via geometrical meshes and numerical methods has been suggested by a number of authors. An issue facing this approach is the large computational time needed for high frequencies, where the discretization must include hundreds of thousands of elements. Conventional computational methods are unable to achieve such computations without excessive time or memory. We use a newly developed fast multipole accelerated boundary element method (FMM/BEM) that scales linearly both in time and memory. The method is applied to the mesh of the widely used KEMAR manikin and its HRTF computed up to 20 kHz. The results are compared with available experimental measurements.}, url = {http://link.aip.org/link/?JAS/120/3342/6}, author = {Gumerov, Nail A. and Duraiswami, Ramani and Zotkin,Dmitry N} } @article {19661, title = {How Multirobot Systems Research will Accelerate our Understanding of Social Animal Behavior}, journal = {Proceedings of the IEEE}, volume = {94}, year = {2006}, month = {2006/07//}, pages = {1445 - 1463}, abstract = {Our understanding of social insect behavior has significantly influenced artificial intelligence (AI) and multirobot systems{\textquoteright} research (e.g., ant algorithms and swarm robotics). In this work, however, we focus on the opposite question: "How can multirobot systems research contribute to the understanding of social animal behavior?" As we show, we are able to contribute at several levels. First, using algorithms that originated in the robotics community, we can track animals under observation to provide essential quantitative data for animal behavior research. Second, by developing and applying algorithms originating in speech recognition and computer vision, we can automatically label the behavior of animals under observation. In some cases the automatic labeling is more accurate and consistent than manual behavior identification. Our ultimate goal, however, is to automatically create, from observation, executable models of behavior. An executable model is a control program for an agent that can run in simulation (or on a robot). The representation for these executable models is drawn from research in multirobot systems programming. In this paper we present the algorithms we have developed for tracking, recognizing, and learning models of social animal behavior, details of their implementation, and quantitative experimental results using them to study social insects}, keywords = {Acceleration, Animal behavior, ant movement tracking, Artificial intelligence, biology computing, Computer vision, control engineering computing, Insects, Intelligent robots, Labeling, monkey movement tracking, multi-robot systems, multirobot systems, robotics algorithms, Robotics and automation, social animal behavior, social animals, social insect behavior, Speech recognition, tracking}, isbn = {0018-9219}, author = {Balch, T. and Dellaert, F. and Feldman, A. and Guillory, A. and Isbell, C.L. and Zia Khan and Pratt, S.C. and Stein, A.N. and Wilde, H.} } @article {11976, title = {Human activity language: Grounding concepts with a linguistic framework}, journal = {Semantic Multimedia}, year = {2006}, month = {2006///}, pages = {86 - 100}, author = {Guerra-Filho,G. and Aloimonos, J.} } @conference {16451, title = {Implementing a bioinformatics pipeline (bip) on a mediator platform: Comparing cost and quality of alternate choices}, booktitle = {Data Engineering Workshops, 2006. Proceedings. 22nd International Conference on}, year = {2006}, month = {2006///}, pages = {67 - 67}, author = {Eckman,B. A and Gaasterland,T. and Lacroix,Z. and Raschid, Louiqa and Snyder,B. and Vidal,M. E} } @article {15249, title = {An improved approximation algorithm for vertex cover with hard capacities}, journal = {Journal of Computer and System Sciences}, volume = {72}, year = {2006}, month = {2006/02//}, pages = {16 - 33}, abstract = {We study the capacitated vertex cover problem, a generalization of the well-known vertex-cover problem. Given a graph G = ( V , E ) , the goal is to cover all the edges by picking a minimum cover using the vertices. When we pick a vertex, we can cover up to a pre-specified number of edges incident on this vertex (its capacity). The problem is clearly NP-hard as it generalizes the well-known vertex-cover problem. Previously, approximation algorithms with an approximation factor of 2 were developed with the assumption that an arbitrary number of copies of a vertex may be chosen in the cover. If we are allowed to pick at most a fixed number of copies of each vertex, the approximation algorithm becomes much more complex. Chuzhoy and Naor (FOCS, 2002) have shown that the weighted version of this problem is at least as hard as set cover; in addition, they developed a 3-approximation algorithm for the unweighted version. We give a 2-approximation algorithm for the unweighted version, improving the Chuzhoy{\textendash}Naor bound of three and matching (up to lower-order terms) the best approximation ratio known for the vertex-cover problem.}, keywords = {Approximation algorithms, Capacitated covering, Linear programming, Randomized rounding, Set cover, Vertex cover}, isbn = {0022-0000}, doi = {10.1016/j.jcss.2005.06.004}, url = {http://www.sciencedirect.com/science/article/pii/S0022000005000747}, author = {Gandhi,Rajiv and Halperin,Eran and Khuller, Samir and Kortsarz,Guy and Srinivasan, Aravind} } @article {14440, title = {Inferring formal titles in organizational email archives}, journal = {Proc. of the ICML Workshop on Statistical Network Analysis}, year = {2006}, month = {2006///}, abstract = {In the social network of large groups of people, such as companiesand organizations, formal hierarchies with titles and lines of authority are established to define the responsibilities and order of power within that group. Although this information may be readily available for individuals within that group, the context this hierarchy provides in communications is not available to those outside the group. In this paper, we define the problem of inferring this formal hierarchy in the context of organizational email archives. We present a new dataset for the widely used Enron email dataset, for use with analysis of the Enron social network hierarchy. We then provide some preliminary results on the problem of classifying individuals to their formal titles using standard classification algorithms. }, author = {Namata,G.M. and Getoor, Lise and Diehl,C.} } @article {14385, title = {An introduction to probabilistic graphical models for relational data}, journal = {Data Engineering Bulletin}, volume = {29}, year = {2006}, month = {2006///}, abstract = {We survey some of the recent work on probabilistic graphical models for relational data. The models thatwe describe are all based upon {\textquoteright}graphical models{\textquoteright} [12]. The models can capture statistical correlations among attributes within a single relational table, between attributes in different tables, and can capture certain structural properties, such as the expected size of a join between tables. These models can then be used for a variety of tasks including filling in missing values, data summarization and anomaly detection. Here we describe two complementary semantics for the models: one approach suited to making probabilistic statements about individuals and the second approach suited to making statements about frequencies in relational data. After describing the semantics, we briefly describe algorithms for automatically constructing the models from an existing (non-probabilistic) database. }, author = {Getoor, Lise} } @article {14354, title = {A latent dirichlet allocation model for entity resolution}, journal = {6th SIAM Conference on Data Mining (SDM), Bethesda, USA}, year = {2006}, month = {2006///}, abstract = {In this paper, we address the problem of entity resolution, where given many references to un-derlying objects, the task is to predict which references correspond to the same object. We propose a probabilistic model for collective entity resolution. Our approach differs from other recently pro- posed entity resolution approaches in that it is a) unsupervised, b) generative and c) introduces a hidden {\textquoteleft}group{\textquoteright} variable to capture collections of entities which are commonly observed together. The entity resolution decisions are not considered on an independent pairwise basis, but instead decisions are made collectively. We focus on how the use of relational links among the references can be exploited. We show how we can use Gibbs Sampling to infer the collaboration groups and the entities jointly from the observed co-author relationships among entity references and how this improves entity resolution performance. We demonstrate the utility of our approach on two real-world bibliographic datasets. In addition, we present preliminary results on characterizing conditions under which collaborative infor- mation is useful. }, author = {Bhattacharya,I. and Getoor, Lise} } @article {14436, title = {Learning through failure}, journal = {Probabilistic, Logical and Relational Learning-Towards a Synthesis}, year = {2006}, month = {2006///}, abstract = {PRISM, a symbolic-statistical modeling language we have been developing since {\textquoteright}97, recently incorporated a program transformation technique to handle failure in generative modeling. I{\textquoteright}ll show this feature opens a way to new breeds of symbolic models, including EM learning from negative observations, constrained HMMs and finite PCFGs.}, author = {Sato,T. and Kameya,Y. and De Raedt,L. and Dietterich,T. and Getoor, Lise and Muggleton,S. H} } @inbook {17620, title = {Lower Bounds on the Deterministic and Quantum Communication Complexities of Hamming-Distance Problems}, booktitle = {Algorithms and ComputationAlgorithms and Computation}, series = {Lecture Notes in Computer Science}, volume = {4288}, year = {2006}, month = {2006///}, pages = {628 - 637}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {A sub-area of discrepancy theory that has received much attention in computer science re-cently, is that of explicit constructions of low-discrepancy point sets for various types of rectangle families in high dimension. This research has led to interesting applications in error-control cod- ing, distributed protocols, Web document filtering, derandomization, and other areas. We give a short survey of this area here. }, isbn = {978-3-540-49694-6}, url = {http://dx.doi.org/10.1007/11940128_63}, author = {Ambainis,Andris and Gasarch,William and Srinivasan, Aravind and Utis,Andrey}, editor = {Asano,Tetsuo} } @article {18856, title = {Machining feature-based similarity assessment algorithms for prismatic machined parts}, journal = {Computer-Aided Design}, volume = {38}, year = {2006}, month = {2006/09//}, pages = {954 - 972}, abstract = {This paper presents algorithms for identifying machined parts in a database that are similar to a given query part based on machining features. In this paper we only consider parts that are machined on 3-axis machining centers. We utilize reduced feature vectors consisting of machining feature access directions, feature types, feature volumes, feature dimensional tolerances and feature group cardinality as a basis for assessing shape similarity. We have defined a distance function between two sets of reduced feature vectors to assess the similarity between them from the machining effort point of view. To assess the similarity between the two parts, one set of reduced feature vectors is transformed in space using rigid body transformations with respect to the other set such that the distance between them is minimized. The distance between the two sets of aligned reduced feature vectors is used as a measure of similarity between the two parts. The existing machined parts are rank ordered based on the value of the distance with respect to the query part. The cost of previously machined parts that have a very small distance from the query part can be used as a basis for estimating the cost of machining the new part.}, keywords = {Feature vector alignment, Machining features, Similarity assessment}, isbn = {0010-4485}, doi = {10.1016/j.cad.2006.08.001}, url = {http://www.sciencedirect.com/science/article/pii/S0010448506001369}, author = {Cardone, Antonio and Gupta, Satyandra K. and Deshmukh,Abhijit and Karnik,Mukul} } @article {18860, title = {Manufacturing of multi-material compliant mechanisms using multi-material molding}, journal = {The International Journal of Advanced Manufacturing Technology}, volume = {30}, year = {2006}, month = {2006///}, pages = {1049 - 1075}, abstract = {Multi-material compliant mechanisms enable many new design possibilities. Significant progress has been made in the area of design and analysis of multi-material compliant mechanisms. What is now needed is a method to mass-produce such mechanisms economically. A feasible and practical way of producing such mechanisms is through multi-material molding. Devices based on compliant mechanisms usually consist of compliant joints. Compliant joints in turn are created by carefully engineering interfaces between a compliant and a rigid material. This paper presents an overview of multi-material molding technology and describes feasible mold designs for creating different types of compliant joints found in multi-material compliant mechanisms. It also describes guidelines essential to successfully utilizing the multi-material molding process for creating compliant mechanisms. Finally, practical applications for the use of multi-material molding to create compliant mechanisms are demonstrated.}, keywords = {engineering}, isbn = {0268-3768}, doi = {10.1007/s00170-005-0152-4}, url = {http://www.springerlink.com/content/djk6wq2213447pqn/abstract/}, author = {Gouker,Regina and Gupta, Satyandra K. and Bruck,Hugh and Holzschuh,Tobias} } @article {16276, title = {Metagenomic Analysis of the Human Distal Gut Microbiome}, journal = {Science}, volume = {312}, year = {2006}, month = {2006/06/02/}, pages = {1355 - 1359}, abstract = {The human intestinal microbiota is composed of 1013 to 1014 microorganisms whose collective genome ({\textquotedblleft}microbiome{\textquotedblright}) contains at least 100 times as many genes as our own genome. We analyzed \~{}78 million base pairs of unique DNA sequence and 2062 polymerase chain reaction{\textendash}amplified 16S ribosomal DNA sequences obtained from the fecal DNAs of two healthy adults. Using metabolic function analyses of identified genes, we compared our human genome with the average content of previously sequenced microbial genomes. Our microbiome has significantly enriched metabolism of glycans, amino acids, and xenobiotics; methanogenesis; and 2-methyl-d-erythritol 4-phosphate pathway{\textendash}mediated biosynthesis of vitamins and isoprenoids. Thus, humans are superorganisms whose metabolism represents an amalgamation of microbial and human attributes.}, isbn = {0036-8075, 1095-9203}, doi = {10.1126/science.1124234}, url = {http://www.sciencemag.org/content/312/5778/1355}, author = {Gill,Steven R. and Pop, Mihai and DeBoy,Robert T. and Eckburg,Paul B and Turnbaugh,Peter J and Samuel,Buck S and Gordon,Jeffrey I and Relman,David A and Fraser-Liggett,Claire M and Nelson,Karen E.} } @conference {12619, title = {Moving Object Verification from Airborne Video}, booktitle = {Computer Vision Systems, 2006 ICVS {\textquoteright}06. IEEE International Conference on}, year = {2006}, month = {2006/01//}, pages = {29 - 29}, abstract = {This paper presents an end-to-end verification system for moving objects in airborne video. Lacking prior training data, the object information is collected on the fly from a short real-time learning sequence. Using a sample selection module, the system selects samples from the learning sequence and stores them in an exemplar database. To handle appearance change due to potentially large aspect angle variations, a homography-based view synthesis method is used to generate a novel view of each image in the exemplar database at the same pose as the query object in each frame of a query sequence. A spatial match score is obtained using a Distance Transform to compare the novel view and query object. After looping over all query frames, the set of match scores is passed to a temporal analysis module to examine the behavior of the query object, and calculate a final likelihood. Very good verification performance is achieved over thousands of trials for both color and infrared video sequences using the proposed system.}, doi = {10.1109/ICVS.2006.42}, author = {Yue,Zhanfeng and Chellapa, Rama and Guarino, D.} } @article {14437, title = {Multi-View Learning and Link Farm Discovery}, journal = {Probabilistic, Logical and Relational Learning-Towards a Synthesis}, year = {2006}, month = {2006///}, abstract = {The first part of this abstract focuses on estimation of mixture models for problems in which multiple views of the instances are available. Examples of this setting include clustering web pages or research papers that have intrinsic (text) and extrinsic (references) attributes. Mixture model estimation is a key problem for both semi-supervised and unsupervised learning. An appropriate optimization criterion quantifies the likelihood and the consensus among models in the individual views; maximizing this consensus minimizes a bound on the risk of assigning an instance to an incorrect mixture component. An EM algorithm maximizes this criterion. The second part of this abstract focuses on the problem of identifying link spam. Search engine optimizers inflate the page rank of a target site by spinning an artificial web for the sole purpose of providing inbound links to the target. Discriminating natural from artificial web sites is a difficult multi-view problem.}, author = {Scheffer,T. and De Raedt,L. and Dietterich,T. and Getoor, Lise and Muggleton,S. H} } @article {14483, title = {Name reference resolution in organizational email archives}, journal = {SIAM International Conference on Data Mining}, year = {2006}, month = {2006///}, pages = {20 - 22}, author = {Diehl,C. P and Getoor, Lise and Namata,G.} } @article {17309, title = {Nuclear Envelope Dystrophies Show a Transcriptional Fingerprint Suggesting Disruption of Rb{\textendash}MyoD Pathways in Muscle Regeneration}, journal = {BrainBrain}, volume = {129}, year = {2006}, month = {2006/04/01/}, pages = {996 - 1013}, abstract = {Mutations of lamin A/C (LMNA) cause a wide range of human disorders, including progeria, lipodystrophy, neuropathies and autosomal dominant Emery{\textendash}Dreifuss muscular dystrophy (EDMD). EDMD is also caused by X-linked recessive loss-of-function mutations of emerin, another component of the inner nuclear lamina that directly interacts with LMNA. One model for disease pathogenesis of LMNA and emerin mutations is cell-specific perturbations of the mRNA transcriptome in terminally differentiated cells. To test this model, we studied 125 human muscle biopsies from 13 diagnostic groups (125 U133A, 125 U133B microarrays), including EDMD patients with LMNA and emerin mutations. A Visual and Statistical Data Analyzer (VISDA) algorithm was used to statistically model cluster hierarchy, resulting in a tree of phenotypic classifications. Validations of the diagnostic tree included permutations of U133A and U133B arrays, and use of two probe set algorithms (MAS5.0 and MBEI). This showed that the two nuclear envelope defects (EDMD LMNA, EDMD emerin) were highly related disorders and were also related to fascioscapulohumeral muscular dystrophy (FSHD). FSHD has recently been hypothesized to involve abnormal interactions of chromatin with the nuclear envelope. To identify disease-specific transcripts for EDMD, we applied a leave-one-out (LOO) cross-validation approach using LMNA patient muscle as a test data set, with reverse transcription{\textendash}polymerase chain reaction (RT{\textendash}PCR) validations in both LMNA and emerin patient muscle. A high proportion of top-ranked and validated transcripts were components of the same transcriptional regulatory pathway involving Rb1 and MyoD during muscle regeneration (CRI-1, CREBBP, Nap1L1, ECREBBP/p300), where each was specifically upregulated in EDMD. Using a muscle regeneration time series (27 time points) we develop a transcriptional model for downstream consequences of LMNA and emerin mutations. We propose that key interactions between the nuclear envelope and Rb and MyoD fail in EDMD at the point of myoblast exit from the cell cycle, leading to poorly coordinated phosphorylation and acetylation steps. Our data is consistent with mutations of nuclear lamina components leading to destabilization of the transcriptome in differentiated cells.}, keywords = {EDMD = Emery{\textendash}Dreifuss muscular dystrophy, emerin, Emery-Dreifuss muscular dystrophy, FSHD = fascioscapulohumeral muscular dystrophy, IDG = individual discriminatory genes, JDG = jointly discriminatory genes, lamin A/C, LGMD = limb-girdle muscular dystrophy, LOO = leave-one-out, RT{\textendash}PCR = reverse transcription{\textendash}polymerase chain reaction; VISDA = Visual and Statistical Data Analyzer, Skeletal muscle, wFC = weighted Fisher criterion}, isbn = {0006-8950, 1460-2156}, doi = {10.1093/brain/awl023}, url = {http://brain.oxfordjournals.org/content/129/4/996}, author = {Bakay,Marina and Wang,Zuyi and Melcon,Gisela and Schiltz,Louis and Xuan,Jianhua and Zhao,Po and Sartorelli,Vittorio and Seo,Jinwook and Pegoraro,Elena and Angelini,Corrado and Shneiderman, Ben and Escolar,Diana and Chen,Yi-Wen and Winokur,Sara T and Pachman,Lauren M and Fan,Chenguang and Mandler,Raul and Nevo,Yoram and Gordon,Erynn and Zhu,Yitan and Dong,Yibin and Wang,Yue and Hoffman,Eric P} } @conference {14010, title = {Numerical Analysis of Plasmon Resonances Based on Fast Multipole Method}, booktitle = {Electromagnetic Field Computation, 2006 12th Biennial IEEE Conference on}, year = {2006}, month = {2006///}, pages = {459 - 459}, abstract = {A novel technique for the numerical analysis of plasmon resonances by using fast multipole method (FMM) is presented. This approach is based on the solution of eigenvalue problem for boundary integral equations, which can be naturally implemented by using the fast multipole method. Numerical examples that highlight the efficiency of the fast multipole implementation are reported}, keywords = {analysis;plasmon, and, boundary, eigenfunctions;plasmons;, equations;eigenvalue, equations;eigenvalues, integral, method;numerical, multipole, problem;fast, resonances;boundary}, doi = {10.1109/CEFC-06.2006.1633249}, author = {Zhang,Zhenyu and Mayergoyz, Issak D and Gumerov, Nail A. and Duraiswami, Ramani} } @conference {14554, title = {Oblivious network design}, booktitle = {Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm}, year = {2006}, month = {2006///}, pages = {970 - 979}, author = {Gupta,A. and Hajiaghayi, Mohammad T. and R\{\"a}cke,H.} } @article {16243, title = {An optimized system for expression and purification of secreted bacterial proteins}, journal = {Protein Expression and Purification}, volume = {46}, year = {2006}, month = {2006/03//}, pages = {23 - 32}, abstract = {In this report, we describe an optimized system for the efficient overexpression, purification, and refolding of secreted bacterial proteins. Candidate secreted proteins were produced recombinantly in Escherichia coli as Tobacco Etch Virus protease-cleavable hexahistidine-c-myc eptiope fusion proteins. Without regard to their initial solubility, recombinant fusion proteins were extracted from whole cells with guanidium chloride, purified under denaturing conditions by immobilized metal affinity chromatography, and refolded by rapid dilution into a solution containing only Tris buffer and sodium chloride. Following concentration on the same resin under native conditions, each protein was eluted for further purification and/or characterization. Preliminary studies on a test set of 12 secreted proteins ranging in size from 13 to 130\&$\#$xa0;kDa yielded between 10 and 50\&$\#$xa0;mg of fusion protein per liter of induced culture at greater than 90\% purity, as judged by Coomassie-stained SDS{\textendash}PAGE. Of the nine proteins further purified, analytical gel filtration chromatography indicated that each was a monomer in solution and circular dichroism spectroscopy revealed that each had adopted a well-defined secondary structure. While there are many potential applications for this system, the results presented here suggest that it will be particularly useful for investigators employing structural approaches to understand protein function, as attested to by the crystal structures of three proteins purified using this methodology (B.V. Geisbrecht, B.Y. Hamaoka, B. Perman, A. Zemla, D.J. Leahy, J. Biol. Chem. 280 (2005) 17243{\textendash}17250).}, keywords = {Pathogens, Secreted proteins, Toxins, Virulence factors}, isbn = {1046-5928}, doi = {10.1016/j.pep.2005.09.003}, url = {http://www.sciencedirect.com/science/article/pii/S1046592805003128}, author = {Geisbrecht,Brian V. and Bouyain,Samuel and Pop, Mihai} } @article {13839, title = {Parallel syntactic annotation of multiple languages}, journal = {Proceedings of the Fifth International Conference on Language Resources and Evaluation (LREC2006). Genoa, Italy}, year = {2006}, month = {2006///}, abstract = {This paper describes an effort to investigate the incrementally deepening development of an interlingua notation, validated by humanannotation of texts in English plus six languages. We begin with deep syntactic annotation, and in this paper present a series of annotation manuals for six different languages at the deep-syntactic level of representation. Many syntactic differences between languages are removed in the proposed syntactic annotation, making them useful resources for multilingual NLP projects with semantic components. }, author = {Rambow,O. and Dorr, Bonnie J and Farwell,D. and Green,R. and Habash,N. and Helmreich,S. and Hovy,E. and Levin,L. and Miller,K.J. and Mitamura,T. and others} } @article {12270, title = {Postmodern internetwork architecture}, journal = {ITTC-FY2006-TR-45030-01, Information and Telecommunication Center, The University of Kansas}, year = {2006}, month = {2006/02//}, abstract = {Network-layer innovation has proven surprisingly difficult, in part because internetworking protocols ignore com-peting economic interests and because a few protocols dominate, enabling layer violations that entrench technologies. Many shortcomings of today{\textquoteright}s internetwork layer result from its inflexibility with respect to the policies of the stake- holders: users and service providers. The consequences of these failings are well-known: various hacks, layering violations, and overloadings are introduced to enforce policies and attempt to get the upper hand in various {\textquotedblleft}tus- sles{\textquotedblright}. The result is a network that is increasingly brittle, hostile to innovation, vulnerable to attack, and insensitive to concerns about accountability and privacy. Our project aims to design, implement, and evaluate through daily use a minimalist internetwork layer and aux- iliary functionality that anticipates tussles and allows them to be played out in policy space, as opposed to in the packet-forwarding path. We call our approach postmodern internetwork architecture, because it is a reaction against many established network layer design concepts. The overall goal of the project is to make a larger portion of the network design space accessible without sacrificing the economy of scale offered by the unified Internet. We will use the postmodern architecture to explore basic architectural questions. These include: {\textbullet} What mechanisms should be supported by the network such that any foreseeable policy requirement can be explicitly addressed? {\textbullet} To what extent can routing and forwarding be isolated from each other while maintaining an efficient and usable network? {\textbullet} What forms of identity should be visible within the network, and what forms of accountability do different identities enable? {\textbullet} What mechanisms are needed to enable efficient access to cross-layer information and mechanisms such that lower layers can express their characteristics and upper layers can exert control downward? We plan to build and evaluate a complete end-to-end networking layer to help us understand feasible solutions to these questions. The Internet has fulfilled the potential of a complete generation of networking research by producing a global platform for innovation, commerce, and democracy. Unfortunately, the Internet also amply demonstrates the com- plexity and architectural ugliness that ensue when competing interests vie for benefits beyond those envisioned in the original design. This project is about redesigning the waist of the architectural hourglass to foster innovation, enhance security and accountability, and accomodate competing interests. }, author = {Bhattacharjee, Bobby and Calvert,K. and Griffioen,J. and Spring, Neil and Sterbenz,J. P.G} } @article {14420, title = {PRL: A probabilistic relational language}, journal = {Machine Learning}, volume = {62}, year = {2006}, month = {2006///}, pages = {7 - 31}, abstract = {In this paper, we describe the syntax and semantics for a probabilistic relational language (PRL). PRL is a recasting of recent work in Probabilistic Relational Models (PRMs) into a logic programming framework. We show how to represent varying degrees of complexity in the semantics including attribute uncertainty, structural uncertainty and identity uncertainty. Our approach is similar in spirit to the work in Bayesian Logic Programs (BLPs), and Logical Bayesian Networks (LBNs). However, surprisingly, there are still some important differences in the resulting formalism; for example, we introduce a general notion of aggregates based on the PRM approaches. One of our contributions is that we show how to support richer forms of structural uncertainty in a probabilistic logical language than have been previously described. Our goal in this work is to present a unifying framework that supports all of the types of relational uncertainty yet is based on logic programming formalisms. We also believe that it facilitates understanding the relationship between the frame-based approaches and alternate logic programming approaches, and allows greater transfer of ideas between them.}, doi = {10.1007/s10994-006-5831-3}, author = {Getoor, Lise and Grant,J.} } @article {14383, title = {Probabilistic, Logical and Relational Learning-Towards a Synthesis}, journal = {Dagstuhl Seminar Proceedings}, volume = {5051}, year = {2006}, month = {2006///}, author = {De Raedt,L. and Dietterich,T. and Getoor, Lise and Muggleton,S. H and Lloyd,J. W and Sears,T. D and Milch,B. and Marthi,B. and Russell,S. and Sontag,D.} } @article {16498, title = {ProMo-A Scalable and Efficient Framework for Online Data Delivery}, journal = {Lecture notes in computer science}, volume = {4032}, year = {2006}, month = {2006///}, pages = {359 - 359}, author = {Roitman,H. and Gal,A. and Raschid, Louiqa} } @article {18504, title = {Quantifying the effects of routing dynamics on end-to-end Internet path failures}, volume = {TR-05-CSE-03}, year = {2006}, month = {2006///}, institution = {University of Massachusetts}, author = {Wang,F. and Feamster, Nick and Gao,L.} } @conference {14407, title = {Query-time entity resolution}, booktitle = {International conference on knowledge discovery and data mining}, year = {2006}, month = {2006///}, pages = {529 - 534}, abstract = {The goal of entity resolution is to reconcile database references corresponding to the same real-world entities. Given the abundance of publicly available databases where entities are not resolved, we motivate the problem of quickly processing queries that require resolved entities from such {\textquoteright}unclean{\textquoteright} databases. We propose a two-stage collective resolution strategy for processing queries. We then show how it can be performed on-the-fly by adaptively extracting and resolving those database references that are the most helpful for resolving the query. We validate our approach on two large real-world publication databases where we show the usefulness of collective resolution and at the same time demonstrate the need for adaptive strategies for query processing. We then show how the same queries can be answered in real time using our adaptive approach while preserving the gains of collective resolution.}, author = {BHATTACHARVA,I. and Getoor, Lise and Licamele,L.} } @article {12276, title = {Ranking search results in P2P systems}, journal = {Technical Report, CR-TR-4779, Department of Computer Science, University of Maryland}, year = {2006}, month = {2006///}, abstract = {P2P deployments are a natural infrastructure for buildingdistributed search networks. Proposed systems support locating and retrieving all results, but lack the information necessary to rank them. Users, however, are primarily interested in the most relevant, and not all possible results. Using random sampling, we extend a class of well- known information retrieval ranking algorithms such that they can be applied in this distributed setting. We analyze the overhead of our approach, and quantify exactly how our system scales with increasing number of documents, system size, document to node mapping (uniform versus non-uniform), and types of queries (rare versus popular terms). Our analysis and simulations show that a) these extensions are efficient, and can scale with little overhead to large systems, and b) the accuracy of the results ob- tained using distributed ranking is comparable to a cen- tralized implementation. }, author = {Gopalakrishnan,V. and Morselli,R. and Bhattacharjee, Bobby and Keleher,P. and Srinivasan, Aravind} } @article {17649, title = {Ranking search results in peer-to-peer systems}, journal = {Technical Reports from UMIACS}, year = {2006}, month = {2006///}, abstract = {P2P deployments are a natural infrastructure for building distributed search networks. Proposed systems support locating and retrieving all results, but lack the information necessary to rank them. Users, however, are primarily interested in the most relevant, and not all possible results. Using random sampling, we extend a class of well-known information retrieval ranking algorithms such that they can be applied in this distributed setting. We analyze the overhead of our approach, and quantify exactly how our system scales with increasing number of documents, system size, document to node mapping (uniform versus non-uniform), and types of queries (rare versus popular terms). Our analysis and simulations show that a) these extensions are efficient, and can scale with little overhead to large systems, and b) the accuracy of the results obtained using distributed ranking is comparable to a centralized implementation.}, author = {Gopalakrishnan,V. and Morselli,R. and Bhattacharjee, Bobby and Keleher,P. and Srinivasan, Aravind} } @article {15154, title = {Rational secret sharing, revisited}, journal = {Security and Cryptography for Networks}, year = {2006}, month = {2006///}, pages = {229 - 241}, abstract = {We consider the problem of secret sharing among n rational players. This problem was introduced by Halpern and Teague (STOC 2004), who claim that a solution is impossible for n=2 but show a solution for the case n>=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 {19459, title = {Reflecting on Health: A System for Students to Monitor Diet and Exercise}, booktitle = {SIGCHI EA {\textquoteright}06}, series = {CHI EA {\textquoteright}06}, year = {2006}, month = {2006///}, pages = {1807 - 1812}, publisher = {ACM}, organization = {ACM}, abstract = {Using an iterative design process, we designed and evaluated a system for college students to encourage the development and maintenance of healthy diet and exercise habits. The system has three components: a camera phone application to support photographic diet and exercise journaling, an automatic workout tracking application for exercise machines in the gym, and a visualization application to support users as they reflect on their diet and exercise activities.}, keywords = {diet, exercise, journaling, mobile phone, Visualization}, isbn = {1-59593-298-4}, url = {http://doi.acm.org/10.1145/1125451.1125794}, author = {Brown, Brandon and Marshini Chetty and Grimes, Andrea and Harmon, Ellie} } @article {14394, title = {Relational clustering for entity resolution queries}, journal = {ICML 2006 Workshop on Statistical Relational Learning (SRL)}, year = {2006}, month = {2006///}, abstract = {The goal of entity resolution is to recon-cile database references corresponding to the same real-world entities. Given the abun- dance of publicly available databases where entities are not resolved, we motivate the problem of quickly processing queries that require resolved entities from such {\textquoteleft}unclean{\textquoteright} databases. We first propose a cut-based rela- tional clustering formulation for collective en- tity resolution. We then show how it can be performed on-the-fly by adaptively extract- ing and resolving those database references that are the most helpful for resolving the query. We validate our approach on two large real-world publication databases, where we show the usefulness of collective resolution and at the same time demonstrate the need for adaptive strategies for query processing. We then show how the same queries can be answered in real time using our adaptive ap- proach while preserving the gains of collective resolution. }, author = {Bhattacharya,I. and Licamele,L. and Getoor, Lise} } @article {14731, title = {Safe manual memory management in Cyclone}, journal = {Science of Computer Programming}, volume = {62}, year = {2006}, month = {2006/10/01/}, pages = {122 - 144}, abstract = {The goal of the Cyclone project is to investigate how to make a low-level C-like language safe. Our most difficult challenge has been providing programmers with control over memory management while retaining safety. This paper describes our experience trying to integrate and use effectively two previously-proposed, safe memory-management mechanisms: statically-scoped regions and tracked pointers. We found that these typing mechanisms can be combined to build alternative memory-management abstractions, such as reference counted objects and arenas with dynamic lifetimes, and thus provide a flexible basis. Our experience {\textemdash} porting C programs and device drivers, and building new applications for resource-constrained systems {\textemdash} confirms that experts can use these features to improve memory footprint and sometimes to improve throughput when used instead of, or in combination with, conservative garbage collection.}, keywords = {cyclone, Memory management, memory safety, Reaps, Reference counting, regions, unique pointers}, isbn = {0167-6423}, doi = {10.1016/j.scico.2006.02.003}, url = {http://www.sciencedirect.com/science/article/pii/S0167642306000785}, author = {Swamy,Nikhil and Hicks, Michael W. and Morrisett,Greg and Grossman,Dan and Jim,Trevor} } @conference {16873, title = {Scalable data collection and retrieval infrastructure for digital government applications}, booktitle = {Proceedings of the 2006 international conference on Digital government research}, series = {dg.o {\textquoteright}06}, year = {2006}, month = {2006///}, pages = {301 - 302}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {In this paper we describe highlights of the project titled "Scalable data collection infrastructure for digital government applications" under the auspices of the Digital Government Research Program of the National Science Foundation. Our research is focused on taking advantage of the distributed nature of data and the interaction with it. Our efforts have been directed at both the systems/theoretical and applications levels. On the systems and theoretical levels, we have continued our development of the BISTRO system (Section 2). On the applications level, work has commenced on the development of a mechanism for spatially tagging text documents for retrieval by search engines based on both content and spatial proximity (Section 3).}, doi = {10.1145/1146598.1146679}, url = {http://doi.acm.org/10.1145/1146598.1146679}, author = {Samet, Hanan and Golubchik,Leana} } @conference {12026, title = {A Sensory-Motor Language for Human Activity Understanding}, booktitle = {2006 6th IEEE-RAS International Conference on Humanoid Robots}, year = {2006}, month = {2006/12/04/6}, pages = {69 - 75}, publisher = {IEEE}, organization = {IEEE}, abstract = {We have empirically discovered that the space of human actions has a linguistic framework. This is a sensory-motor space consisting of the evolution of the joint angles of the human body in movement. The space of human activity has its own phonemes, morphemes, and sentences. We present a human activity language (HAL) for symbolic non-arbitrary representation of visual and motor information. In phonology, we define atomic segments (kinetemes) that are used to compose human activity. We introduce the concept of a kinetological system and propose five basic properties for such a system: compactness, view-invariance, reproducibility, selectivity, and reconstructivity. In morphology, we extend sequential language learning to incorporate associative learning with our parallel learning approach. Parallel learning is effective in identifying the kinetemes and active joints in a particular action. In syntax, we suggest four lexical categories for our human activity language (noun, verb, adjective, and adverb). These categories are combined into sentences through syntax for human movement}, keywords = {Actuators, associative learning, atomic segments, computational linguistics, Computer science, Computer vision, Educational institutions, grammars, human activity language, human activity understanding, human movement syntax, Humanoid robots, HUMANS, joint angles, kinetemes, kinetological system, Laboratories, learning (artificial intelligence), List key index terms here, Morphology, motor information, No mare than 5, parallel learning, Reproducibility of results, Robot kinematics, Robot programming, robot vision, sensory-motor language, sequential language learning, symbolic nonarbitrary representation, visual information}, isbn = {1-4244-0200-X}, doi = {10.1109/ICHR.2006.321365}, author = {Guerra-Filho,G. and Aloimonos, J.} } @article {12924, title = {Septaplex PCR assay for rapid identification of Vibrio cholerae including detection of virulence and int SXT genes}, journal = {FEMS Microbiology Letters}, volume = {265}, year = {2006}, month = {2006/12/01/}, pages = {208 - 214}, abstract = {In this study, we describe a septaplex PCR assay for rapid identification of Vibrio cholerae including detection of the virulence and intsxt genes. Conditions were optimized to amplify fragments of ISRrRNA (encoding for 16S{\textendash}23S rRNA gene, Intergenic spacer regions), O1rfb (O1 serogroup specific rfb), O139rfb (O139 serogroup specific rfb), ctxA (cholera toxin subunit A), tcpA (toxin coregulated pilus), and intsxt (sxt integron) simultaneously in a single PCR. The septaplex PCR was evaluated using 211 strains of V. cholerae and six water samples for in situ testing. PCR results were correlated with genotype data obtained by individual PCR and slot-blot assays. The one-step PCR described here can be used to identify V. cholerae accurately and rapidly. Also, the virulence and intsxt genes can be simultaneously detected, providing a useful method for monitoring pathogenic, intsxt-positive and nonpathogenic, intsxt-negative V. cholerae serogroups both in the environment and clinical settings.}, keywords = {DETECTION, intsxt, septaplex PCR, Vibrio cholerae, virulence}, isbn = {1574-6968}, doi = {10.1111/j.1574-6968.2006.00491.x}, url = {http://onlinelibrary.wiley.com/doi/10.1111/j.1574-6968.2006.00491.x/full}, author = {Mantri,Chinmay K. and Mohapatra,Saswat S. and Ramamurthy,Thandavarayan and Ghosh,Raikamal and Rita R Colwell and Singh,Durg V.} } @article {17658, title = {Session 8A-Combinatorial Optimization and Quantum Computing-Lower Bounds on the Deterministic and Quantum Communication Complexities of Hamming-Distance Problems}, journal = {Lecture Notes in Computer Science}, volume = {4288}, year = {2006}, month = {2006///}, pages = {628 - 637}, author = {Ambainis,A. and Gasarch,W. and Srinivasan, Aravind and Utis,A.} } @conference {19367, title = {Shape Similarity Assessment Based On Face Alignment Using Attributed Applied Vectors.}, booktitle = {CAD Conference}, year = {2006}, author = {Cardone, Antonio and Gupta, Satyandra K.} } @conference {14391, title = {Social Capital in Friendship-Event Networks}, booktitle = {Data Mining, 2006. ICDM {\textquoteright}06. Sixth International Conference on}, year = {2006}, month = {2006///}, pages = {959 - 964}, abstract = {In this paper, we examine a particular form of social network which we call a friendship-event network. A friendship-event network captures both the friendship relationship among a set of actors, and also the organizer and participation relationships of actors in a series of events. Within these networks, we formulate the notion of social capital based on the actor-organizer friendship relationship and the notion of benefit, based on event participation. We investigate appropriate definitions for the social capital of both a single actor and a collection of actors. We ground these definitions in a real-world example of academic collaboration networks, where the actors are researchers, the friendships are collaborations, the events are conferences, the organizers are program committee members and the participants are conference authors. We show that our definitions of capital and benefit capture interesting qualitative properties of event series. In addition, we show that social capital is a better publication predictor than publication history.}, keywords = {academic, based, capital;Internet;groupware;knowledge, Collaboration, friendship;friendship-event, network;actor-organizer, network;social, systems;}, doi = {10.1109/ICDM.2006.149}, author = {Licamele,L. and Getoor, Lise} } @article {14016, title = {Spherical and hemispherical microphone arrays for capture and analysis of sound fields}, journal = {The Journal of the Acoustical Society of America}, volume = {120}, year = {2006}, month = {2006///}, pages = {3225 - 3225}, abstract = {The capture of the spatial structure of a sound field and analysis is important in many fields including creating virtual environments, source localization and detection, noise suppression, and beamforming. Spherical microphone arrays are a promising development to help achieve such capture and analysis, and have been studied by several groups. We develop a practical spherical microphone array and demonstrate its utility in applications for sound capture, room measurement and for beamforming and tracking. To accommodate equipment failure and manufacturing imprecision we extend their theory to handle arbitrary microphone placement. To handle speech capture and surveillance we describe the development of a new sensor, the hemispherical microphone array. For each array the practical performance follows that predicted by theory. Future applications and improvements are also discussed. [Work supported by NSF.]}, url = {http://link.aip.org/link/?JAS/120/3225/3}, author = {Duraiswami, Ramani and Zhiyun Li and Zotkin,Dmitry N and Grassi,Elena} } @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} } @article {16522, title = {Stigmergic self-assembly of prespecified artificial structures in a constrained and continuous environment}, journal = {Integrated Computer-Aided Engineering}, volume = {13}, year = {2006}, month = {2006///}, pages = {289 - 312}, author = {Grushin,A. and Reggia, James A.} } @article {13866, title = {Summarization-Inspired Temporal-Relation Extraction: Tense-Pair Templates and Treebank-3 Analysis}, year = {2006}, month = {2006/12//}, institution = {Department of Computer Science, University of Maryland, College Park}, abstract = {This document describes the information used for summarization-inspired temporal-relation extraction [Dorr and Gaasterland, 2007]. We present a set of tense/aspect extraction templates that are applied to a Penn Treebank-style analysis of the input sentence. We also present an analysis of tense-pair combinations for different temporal connectives based on a corpus analysis of complex tense structures in Treebank-3. Finally, we include analysis charts and temporal relation tables for all combinations of intervals/points for each legal BTS combinations.}, keywords = {*COMPUTATIONAL LINGUISTICS, CYBERNETICS, linguistics, operations research, TEMPORALRELATION EXTRACTION, TENSE-PAIR COMBINATIONS, TEXT PROCESSING}, url = {http://stinet.dtic.mil/oai/oai?\&verb=getRecord\&metadataPrefix=html\&identifier=ADA460392}, author = {Dorr, Bonnie J and Gaasterland,Terry} } @article {15487, title = {Techniques and processes for improving the quality and performance of open-source software}, journal = {Software Process: Improvement and Practice}, volume = {11}, year = {2006}, month = {2006///}, pages = {163 - 176}, abstract = {Open-source development processes have emerged as an effective approach to reduce cycle-time and decrease design, implementation, and quality assurance (QA) costs for certain types of software, particularly systems infrastructure software, such as operating systems (OS), compilers and language processing tools, text and drawing editors, and middleware. This article presents two contributions to the study of open-source software processes. First, we describe key challenges of open-source software and illustrate how QA processes{\textemdash}specifically those tailored to open-source development{\textemdash}help mitigate these challenges better than traditional closed-source processes do. Second, we summarize results of empirical studies that evaluate how our Skoll distributed continuous quality assurance (DCQA) techniques and processes help to resolve key challenges in developing and validating open-source software. Our results show that: (a) using models to configure and guide the DCQA process improves developer understanding of open-source software, (b) improving the diversity of platform configurations helps QA engineers find defects missed during conventional testing, and (c) centralizing control of QA activities helps to eliminate redundant work. Copyright {\textcopyright} 2006 John Wiley \& Sons, Ltd.}, keywords = {distributed continuous quality assurance, open-source software development and testing}, isbn = {1099-1670}, doi = {10.1002/spip.260}, url = {http://onlinelibrary.wiley.com/doi/10.1002/spip.260/abstract}, author = {Porter, Adam and Yilmaz,Cemal and Memon, Atif M. and Krishna,Arvind S. and Schmidt,Douglas C. and Gokhale,Aniruddha} } @conference {14442, title = {Is there a grand challenge or X-prize for data mining?}, booktitle = {Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining}, series = {KDD {\textquoteright}06}, year = {2006}, month = {2006///}, pages = {954 - 956}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {This panel will discuss possible exciting and motivating Grand Challenge problems for Data Mining, focusing on bioinformatics, multimedia mining, link mining, text mining, and web mining.}, keywords = {Bioinformatics, data mining, grand challenge, image mining, link mining, multimedia mining, text mining, video mining, web mining, X-prize}, isbn = {1-59593-339-5}, doi = {10.1145/1150402.1150535}, url = {http://doi.acm.org/10.1145/1150402.1150535}, author = {Piatetsky-Shapiro,Gregory and Grossman,Robert and Djeraba,Chabane and Feldman,Ronen and Getoor, Lise and Zaki,Mohammed} } @conference {15061, title = {A Time Saving Method for Human Detection in Wide Angle Camera Images}, booktitle = {Machine Learning and Cybernetics, 2006 International Conference on}, year = {2006}, month = {2006/08//}, pages = {4029 - 4034}, abstract = {A time-saving method for human detection in an indoor environment in wide angle camera images is presented in this paper, without using time-consuming template operations such as edge detection and morphological operations. It excludes other objects in motion to detect humans including cases of the partial occlusion of humans, rotation of the head and variation of skin colors. This algorithm is applicable where the memory space is limited and the time requirements are strict, such as in an embedded system. The experimental results show that it took about 0.35 seconds to process the algorithm after the scene study time}, keywords = {CAMERAS, Embedded system, human detection, image recognition, Image segmentation, indoor environment, Motion estimation, time-saving method, wide angle camera images}, doi = {10.1109/ICMLC.2006.258804}, author = {Zhuolin Jiang and Li,Shao-Fa and Gao,Dong-Fa} } @conference {11996, title = {Towards a sensorimotor WordNet SM: Closing the semantic gap}, booktitle = {Proc. of the International WordNet Conference (GWC)}, year = {2006}, month = {2006///}, author = {Guerra-Filho,G. and Aloimonos, J.} } @conference {16327, title = {Towards Dependability in Everyday Software Using Software Telemetry}, booktitle = {Engineering of Autonomic and Autonomous Systems, IEEE International Workshop on}, year = {2006}, month = {2006///}, pages = {9 - 18}, publisher = {IEEE Computer Society}, organization = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, abstract = {Application-level software dependability is difficult to ensure. Thus it?s typically used only in custom systems and is achieved using one-of-a-kind, handcrafted solutions. We are interested in understanding whether and how these techniques can be applied to more common, lower-end systems. To this end, we have adapted a condition-based maintenance (CBM) approach called the Multivariate State Estimation Technique (MSET). This approach automatically creates sophisticated statistical models that predict system failure well before failures occur, leading to simpler and more successful recoveries. We have packaged this approach in the Software Dependability Framework (SDF). The SDF consists of instrumentation and data management libraries, a CBM module, performance visualization tools, and a software architecture that supports system designers. Finally, we evaluated our framework on a simple video game application. Our results suggest that we can cheaply and reliably predict impending runtime failures and respond to them in time to improve the system?s dependability.}, isbn = {0-7695-2544-X}, doi = {http://doi.ieeecomputersociety.org/10.1109/EASE.2006.21}, author = {Gross,Kenny C. and Urmanov,Aleksey and Votta,Lawrence G. and McMaster,Scott and Porter, Adam} } @article {14585, title = {Transcriptional Genomics Associates FOX Transcription Factors With Human Heart Failure}, journal = {Circulation}, volume = {114}, year = {2006}, month = {2006///}, pages = {1269 - 1276}, abstract = {Background{\textemdash} Specific transcription factors (TFs) modulate cardiac gene expression in murine models of heart failure, but their relevance in human subjects remains untested. We developed and applied a computational approach called transcriptional genomics to test the hypothesis that a discrete set of cardiac TFs is associated with human heart failure.Methods and Results{\textemdash} RNA isolates from failing (n=196) and nonfailing (n=16) human hearts were hybridized with Affymetrix HU133A arrays, and differentially expressed heart failure genes were determined. TF binding sites overrepresented in the -5-kb promoter sequences of these heart failure genes were then determined with the use of public genome sequence databases. Binding sites for TFs identified in murine heart failure models (MEF2, NKX, NF-AT, and GATA) were significantly overrepresented in promoters of human heart failure genes (P<0.002; false discovery rate 2\% to 4\%). In addition, binding sites for FOX TFs showed substantial overrepresentation in both advanced human and early murine heart failure (P<0.002 and false discovery rate <4\% for each). A role for FOX TFs was supported further by expression of FOXC1, C2, P1, P4, and O1A in failing human cardiac myocytes at levels similar to established hypertrophic TFs and by abundant FOXP1 protein in failing human cardiac myocyte nuclei.Conclusions{\textemdash} Our results provide the first evidence that specific TFs identified in murine models (MEF2, NKX, NFAT, and GATA) are associated with human heart failure. Moreover, these data implicate specific members of the FOX family of TFs (FOXC1, C2, P1, P4, and O1A) not previously suggested in heart failure pathogenesis. These findings provide a crucial link between animal models and human disease and suggest a specific role for FOX signaling in modulating the hypertrophic response of the heart to stress in humans.}, doi = {10.1161/CIRCULATIONAHA.106.632430}, url = {http://circ.ahajournals.org/content/114/12/1269.abstract}, author = {Hannenhalli, Sridhar and Putt,Mary E. and Gilmore,Joan M. and Wang,Junwen and Parmacek,Michael S. and Epstein,Jonathan A. and Morrisey,Edward E. and Margulies,Kenneth B. and Cappola,Thomas P.} } @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.} } @article {14079, title = {The Trypanosoma cruzi L1Tc and NARTc non-LTR retrotransposons show relative site specificity for insertion}, journal = {Molecular biology and evolution}, volume = {23}, year = {2006}, month = {2006///}, pages = {411 - 411}, author = {Bringaud,F. and Bartholomeu,D. C and Blandin,G. and Delcher,A. and Baltz,T. and El-Sayed, Najib M. and Ghedin,E.} } @article {11981, title = {Understanding visuo-motor primitives for motion synthesis and analysis}, journal = {Computer Animation and Virtual Worlds}, volume = {17}, year = {2006}, month = {2006/07/01/}, pages = {207 - 217}, abstract = {The problem addressed in this paper concerns the representation of human movement in terms of atomic visuo-motor primitives considering both generation and perception of movement. We introduce the concept of kinetology, the phonology of human movement, and five principles on which such a system should be based: compactness, view-invariance, reproducibility, selectivity, and reconstructivity. We propose visuo-motor primitives and demonstrate their kinetological properties. Further evaluation is accomplished with experiments on compression and decompression. Our long-term goal is to demonstrate that action has a space characterized by a visuo-motor language. Copyright {\textcopyright} 2006 John Wiley \& Sons, Ltd.}, keywords = {compression, motion synthesis, visuo-motor primitives}, isbn = {1546-427X}, doi = {10.1002/cav.124}, url = {http://onlinelibrary.wiley.com/doi/10.1002/cav.124/abstract}, author = {Guerra-Filho,Gutemberg and Aloimonos, J.} } @conference {16083, title = {VAST 2006 Contest - A Tale of Alderwood}, booktitle = {Visual Analytics Science And Technology, 2006 IEEE Symposium On}, year = {2006}, month = {2006/11/31/2}, pages = {215 - 216}, abstract = {Visual analytics experts realize that one effective way to push the field forward and to develop metrics for measuring the performance of various visual analytics components is to hold an annual competition. The first visual analytics science and technology (VAST) contest was held in conjunction with the 2006 IEEE VAST Symposium. The competition entailed the identification of possible political shenanigans in the fictitious town of Alderwood. A synthetic data set was made available as well as tasks. We summarize how we prepared and advertised the contest, developed some initial metrics for evaluation, and selected the winners. The winners were invited to participate at an additional live competition at the symposium to provide them with feedback from senior analysts}, keywords = {Alderwood;human, analysis;data, analytics, and, contest;data, information, interaction;sense, making;visual, Science, technology, visualisation;}, doi = {10.1109/VAST.2006.261420}, author = {Grinstein,G. and O{\textquoteright}Connell,T. and Laskowski,S. and Plaisant, Catherine and Scholtz,J. and Whiting,M.} } @article {12606, title = {Vehicle Fingerprinting Using Drive-By Sounds}, year = {2006}, month = {2006/11//}, institution = {CENTER FOR AUTOMATION RESEARCH, UNIVERSITY OF MARYLAND COLLEGE PARK}, abstract = {We estimate a vehicle{\textquoteright}s speed, width, and length by jointly estimating its acoustic wave-pattern using a single passive acoustic sensor that records the vehicle{\textquoteright}s drive-by noise. The acoustic wave-pattern is estimated using three envelope shape (ES) components, which approximate the shape of the received signal{\textquoteright}s power envelope. We incorporate the parameters of the ES components along with estimates of the vehicle engine RPM and number of cylinders to form a vehicle profile vector. This vector provides a compressed statistics that can be used for vehicle identification and classification. Vehicle speed estimation and classification results are provided using field data.}, keywords = {*ACOUSTIC DETECTORS, *GROUND VEHICLES, *SIGNAL PROCESSING, ACOUSTIC DETECTION AND DETECTORS, AMPLITUDE, Interference, PASSIVE SYSTEMS, spatial distribution, STATISTICAL PROCESSES, SURFACE TRANSPORTATION AND EQUIPMENT, SYMPOSIA, WAVE PROPAGATION}, url = {http://stinet.dtic.mil/oai/oai?\&verb=getRecord\&metadataPrefix=html\&identifier=ADA481471}, author = {Cevher, V. and Chellapa, Rama and Gurbuz, A.C. and Shah, F. and McClellan, J.H.} } @inbook {12638, title = {Video Mensuration Using a Stationary Camera}, booktitle = {Computer Vision {\textendash} ECCV 2006Computer Vision {\textendash} ECCV 2006}, series = {Lecture Notes in Computer Science}, volume = {3953}, year = {2006}, month = {2006///}, pages = {164 - 176}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {This paper presents a method for video mensuration using a single stationary camera. The problem we address is simple, i.e., the mensuration of any arbitrary line segment on the reference plane using multiple frames with minimal calibration. Unlike previous solutions that are based on planar rectification, our approach is based on fitting the image of multiple concentric circles on the plane. Further, the proposed method aims to minimize the error in mensuration. Hence we can calculate the mensuration of the line segments not lying on the reference plane. Using an algorithm for detecting and tracking wheels of an automobile, we have implemented a fully automatic system for wheel base mensuration. The mensuration results are accurate enough that they can be used to determine the vehicle classes. Furthermore, we measure the line segment between any two points on the vehicle and plot them in top and side views.}, isbn = {978-3-540-33836-9}, url = {http://dx.doi.org/10.1007/11744078_13}, author = {Guo,Feng and Chellapa, Rama}, editor = {Leonardis,Ale{\v s} and Bischof,Horst and Pinz,Axel} } @article {14363, title = {What are the grand challenges for data mining? - KDD-2006 panel report}, journal = {ACM SIGKDD Explorations Newsletter}, volume = {8}, year = {2006}, month = {2006///}, pages = {70 - 77}, abstract = {We discuss what makes exciting and motivating Grand Challenge problems for Data Mining, and propose criteria for a good Grand Challenge. We then consider possible GC problems from multimedia mining, link mining, large- scale modeling, text mining, and proteomics. This report is the result of a panel held at KDD-2006 conference.}, author = {Piatetsky-Shapiro,G. and Djeraba,C. and Getoor, Lise and Grossman,R. and Feldman,R. and Zaki,M.} } @conference {16353, title = {What do high-level memory models mean for transactions?}, booktitle = {Proceedings of the 2006 workshop on Memory system performance and correctness - MSPC {\textquoteright}06}, year = {2006}, month = {2006///}, pages = {62 - 62}, address = {San Jose, California}, doi = {10.1145/1178597.1178609}, url = {http://dl.acm.org/citation.cfm?id=1178609}, author = {Grossman,Dan and Manson,Jeremy and Pugh, William} } @article {12672, title = {3D face modeling from monocular video sequences}, journal = {Face Processing: Advanced Modeling and Methods}, year = {2005}, month = {2005///}, abstract = {In this chapter we present two algorithms for 3D face modeling from a monocular video sequence. The firstmethod is based on Structure from Motion (SfM), while the second one relies on contour adaptation over time. The SfM based method incorporates statistical measures of quality of the 3D estimate into the reconstruction algorithm. The initial multi-frame SfM estimate is smoothed using a generic face model in an energy function minimization framework. Such a strategy avoids excessively biasing the final 3D estimate towards the generic model. The second method relies on matching a generic 3D face model to the outer contours of a face in the input video sequence, and integrating this strategy over all the frames in the sequence. It consists of an edge-based head pose estimation step, followed by global and local deformations of the generic face model in order to adapt it to the actual 3D face. This contour adaptation approach is able to separate the geometric subtleties of the human head from the variations in shading and texture, and it does not rely on finding accurate point correspondences across frames. Detailed experimental evaluation of both the methods along with reconstructed 3D models is presented. }, author = {Roy-Chowdhury, A. and Chellapa, Rama and Gupta, R.} } @conference {13419, title = {Agent-organized networks for dynamic team formation}, booktitle = {Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems}, series = {AAMAS {\textquoteright}05}, year = {2005}, month = {2005///}, pages = {230 - 237}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Many multi-agent systems consist of a complex network of autonomous yet interdependent agents. Examples of such networked multi-agent systems include supply chains and sensor networks. In these systems, agents have a select set of other agents with whom they interact based on environmental knowledge, cognitive capabilities, resource limitations, and communications constraints. Previous findings have demonstrated that the structure of the artificial social network governing the agent interactions is strongly correlated with organizational performance. As multi-agent systems are typically embedded in dynamic environments, we wish to develop distributed, on-line network adaptation mechanisms for discovering effective network structures. Therefore, within the context of dynamic team formation, we propose several strategies for agent-organized networks (AONs) and evaluate their effectiveness for increasing organizational performance.}, keywords = {multi-agent systems, organizational learning, team formation}, isbn = {1-59593-093-0}, doi = {10.1145/1082473.1082508}, url = {http://doi.acm.org/10.1145/1082473.1082508}, author = {Gaston,Matthew E. and desJardins, Marie} } @conference {13420, title = {Agent-organized networks for multi-agent production and exchange}, booktitle = {Proceedings of the 20th national conference on Artificial intelligence - Volume 1}, series = {AAAI{\textquoteright}05}, year = {2005}, month = {2005///}, pages = {77 - 82}, publisher = {AAAI Press}, organization = {AAAI Press}, abstract = {As multi-agent systems grow in size and complexity, social networks that govern the interactions among the agents will directly impact system behavior at the individual and collective levels. Examples of such large-scale, networked multi-agent systems include peer-to-peer networks, distributed information retrieval, and agent-based supply chains. One way of dealing with the uncertain and dynamic nature of such environments is to endow agents with the ability to modify the agent social network by autonomously adapting their local connectivity structure. In this paper, we present a framework for agent-organized networks (AONs) in the context of multi-agent production and exchange, and experimentally evaluate the feasibility and efficiency of specific AON strategies. We find that decentralized network adaptation can significantly improve organizational performance. Additionally, we analyze several properties of the resulting network structures and consider their relationship to the observed increase in organizational performance.}, isbn = {1-57735-236-x}, url = {http://dl.acm.org/citation.cfm?id=1619332.1619347}, author = {Gaston,Matthew E. and desJardins, Marie} } @article {17791, title = {Aggregate operators in probabilistic databases}, journal = {J. ACM}, volume = {52}, year = {2005}, month = {2005/01//}, pages = {54 - 101}, abstract = {Though extensions to the relational data model have been proposed in order to handle probabilistic information, there has been very little work to date on handling aggregate operators in such databases. In this article, we present a very general notion of an aggregate operator and show how classical aggregation operators (such as COUNT, SUM, etc.) as well as statistical operators (such as percentiles, variance, etc.) are special cases of this general definition. We devise a formal linear programming based semantics for computing aggregates over probabilistic DBMSs, develop algorithms that satisfy this semantics, analyze their complexity, and introduce several families of approximation algorithms that run in polynomial time. We implemented all of these algorithms and tested them on a large set of data to help determine when each one is preferable.}, keywords = {Aggregates, probabilistic relational databases}, isbn = {0004-5411}, doi = {10.1145/1044731.1044734}, url = {http://doi.acm.org/10.1145/1044731.1044734}, author = {Ross,Robert and V.S. Subrahmanian and Grant,John} } @article {18752, title = {Algorithms for constructing 3-D point clouds using multiple digital fringe projection patterns}, journal = {Computer-Aided Design and Applications}, volume = {2}, year = {2005}, month = {2005///}, pages = {737 - 746}, abstract = {This paper describes algorithms for generating 3-D point clouds from a set of digital imagesobtained from projecting phase-shifted sinusoidal fringe patterns onto object. In this paper, a mathematical model is introduced for describing the geometric relationship between the fringe patterns being projected, the image captured and the shape of the object being measured. This model allows considerable flexibility in the spatial configuration of shape measurement system. The algorithms for point cloud construction described in this paper present an improvement over the existing algorithms in terms of accuracy, ease of system calibration, and sensitivity to parameter errors. These algorithms have been incorporated in a shape measurement system and shown to have a very good performance. }, url = {http://cadanda.homestead.com/V2No6_04.pdf}, author = {Peng,T. and Gupta,S.K. and Lau,K.} } @inbook {19486, title = {Architecting and Implementing Versatile Dependability}, booktitle = {Architecting Dependable Systems III}, series = {Lecture Notes in Computer Science}, year = {2005}, month = {2005/01/01/}, pages = {212 - 231}, publisher = {Springer Berlin Heidelberg}, organization = {Springer Berlin Heidelberg}, abstract = {Distributed applications must often consider and select the appropriate trade-offs among three important aspects {\textendash} fault-tolerance, performance and resources. We introduce a novel concept, called versatile dependability, that provides a framework for analyzing and reasoning about these trade-offs in dependable software architectures. We present the architecture of a middleware framework that implements versatile dependability by providing the appropriate {\textquotedblright}knobs{\textquotedblright} to tune and re-calibrate the trade-offs. Our framework can adjust the properties and the behavior of the system at development-time, at deployment-time, and throughout the application{\textquoteright}s life-cycle. This renders the versatile dependability approach useful both to applications that require static fault-tolerance configurations supporting the loss/addition of resources and changing workloads, as well as to applications that evolve in terms of their dependability requirements. Through a couple of specific examples, one on adapting the replication style at runtime and the other on tuning the system scalability under given constraints, we demonstrate concretely how versatile dependability can provide an extended coverage of the design space of dependable distributed systems.}, keywords = {Operating systems, software engineering}, isbn = {978-3-540-28968-5, 978-3-540-31648-0}, url = {http://link.springer.com/chapter/10.1007/11556169_10}, author = {Tudor Dumitras and Srivastava, Deepti and Narasimhan, Priya}, editor = {Lemos, Rog{\'e}rio de and Gacek, Cristina and Romanovsky, Alexander} } @article {14423, title = {Bayesian network learning with abstraction hierarchies and context-specific independence}, journal = {Machine Learning: ECML 2005}, year = {2005}, month = {2005///}, pages = {485 - 496}, abstract = {Context-specific independence representations, such as tree-structured conditional probability tables (TCPTs), reduce the number of parameters in Bayesian networks by capturing local independence relationships and improve the quality of learned Bayesian networks. We previously presented Abstraction-Based Search (ABS), a technique for using attribute value hierarchies during Bayesian network learning to remove unimportant distinctions within the CPTs. In this paper, we introduce TCPT ABS (TABS), which integrates ABS with TCPT learning. Since expert-provided hierarchies may not be available, we provide a clustering technique for deriving hierarchies from data. We present empirical results for three real-world domains, finding that (1) combining TCPTs and ABS provides a significant increase in the quality of learned Bayesian networks (2) combining TCPTs and ABS provides a dramatic reduction in the number of parameters in the learned networks, and (3) data-derived hierarchies perform as well or better than expert-provided hierarchies.}, doi = {10.1007/11564096_46}, author = {desJardins, Marie and Rathod,P. and Getoor, Lise} } @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 {14460, title = {Capital and benefit in social networks}, booktitle = {Proceedings of the 3rd international workshop on Link discovery}, series = {LinkKDD {\textquoteright}05}, year = {2005}, month = {2005///}, pages = {44 - 51}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Recently there has been a surge of interest in social networks. Email traffic, disease transmission, and criminal activity can all be modeled as social networks. In this paper, we introduce a particular form of social network which we call a friendship-event network. A friendship-event network describes two inter-related networks. One is a friendship network among a set of actors. The other is an event network that describes events, event organizers and event participants. Within these types of networks, we formulate the notion of capital based on the actor-organizer friendship relationship and the notion of benefit, based on event participation. We ground these definitions in a real-world example of academic collaboration networks, where the actors are researchers, the friendships are collaborations, the events are conferences, the organizers are program committee members and the participants are conference authors. We incorporate a temporal component by considering the notion of an event series. We explore the use of these measures on a data set describing three computer science conferences over the past ten years.}, isbn = {1-59593-215-1}, doi = {10.1145/1134271.1134278}, url = {http://doi.acm.org/10.1145/1134271.1134278}, author = {Licamele,Louis and Bilgic,Mustafa and Getoor, Lise and Roussopoulos, Nick} } @conference {13910, title = {Child{\textquoteright}s play: a comparison of desktop and physical interactive environments}, booktitle = {Proceedings of the 2005 conference on Interaction design and children}, year = {2005}, month = {2005///}, pages = {48 - 55}, author = {Fails,J. A and Druin, Allison and Guha,M.L. and Chipman,G. and Simms,S. and Churaman,W.} } @article {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} } @article {14017, title = {Comparison of the Efficiency of Translation Operators Used in the Fast Multipole Method for the 3D Laplace Equation}, journal = {Technical Reports from UMIACS UMIACS-TR{\textendash}2005-09}, year = {2005}, month = {2005/11/30/T16:2}, abstract = {We examine the practical implementation of a fast multipole method algorithm for the rapid summation of Laplace multipoles. Several translation operators with different asymptotic computational and memory complexities have been proposed for this problem. These algorithms include: Method 0 {\textemdash} the originally proposed matrix based translations due to Greengard andRokhlin (1987), Method 1 {\textemdash} the rotation, axial translation and rotation algorithm due to White and Martin Head-Gordon (1993), and Method 3 {\textemdash} the plane-wave version of the multipole-to local translation operator due to Greengard and Rokhlin (1997). We compare the algorithms on data sets of varying size and with varying imposed accuracy requirements. While from the literature it would have been expected that method 2 would always be the method of choice, at least as far as computational speed is concerned, we find that this is not always the case. We find that as far as speed is concerned the choice between methods 1 and 2 depends on problem size and error requirements. Method 2 is the algorithm of choice for large problems where high accuracy is required, though the advantage is not clear cut, especially if memory requirements are an issue. If memory is an issue, Method 1 is the method of choice for most problems. A new analysis of the computational complexities of the algorithms is provided, which explains the observed results. We provide guidelines for choosing parameters for FMM algorithms. }, keywords = {Fast Algorithms, Fast Multipole Method, Harmonic analysis, Laplace Equation in 3D, Translation operators}, url = {http://drum.lib.umd.edu/handle/1903/3023}, author = {Gumerov, Nail A. and Duraiswami, Ramani} } @article {14532, title = {Computation of scattering from clusters of spheres using the fast multipole method}, journal = {The Journal of the Acoustical Society of America}, volume = {117}, year = {2005}, month = {2005///}, pages = {1744 - 1744}, author = {Gumerov, Nail A. and Duraiswami, Ramani} } @article {14030, title = {Computation of scattering from clusters of spheres using the fast multipole method}, journal = {The Journal of the Acoustical Society of America}, volume = {117}, year = {2005}, month = {2005///}, pages = {1744 - 1761}, abstract = {A T-matrix based method of solution of the multiple scattering problem was presented by the authors [J. Acoust Soc. Am. 112, 2688{\textendash}2701 (2002)]. This method can be applied to the computation of relatively small problems, since the number of operations required grows with the number of spheres N as O(N3), and with the sixth power of the wave number. The use of iterative techniques accelerated using the fast multipole method (FMM) can accelerate this solution, as presented by Koc and Chew [J. Acoust. Soc. Am. 103, 721{\textendash}734 (1998)] originally. In this study we present a method that combines preconditioned Krylov subspace iterative techniques, FMM accelerated matrix vector products, a novel FMM-based preconditioner, and fast translation techniques that enable us to achieve an overall algorithm in which the cost of the matrix-vector multiplication grows with N as O(N log N) and with the third power of the wave number. We discuss the convergence of the iterative techniques, selection of the truncation number, errors in the solution, and other issues. The results of the solution of test problems obtained with the method for N \~{} 102{\textendash}104 for different wave numbers are presented. {\textcopyright} 2005 Acoustical Society of America.}, keywords = {acoustic wave scattering, convergence of numerical methods, iterative methods, matrix multiplication}, doi = {10.1121/1.1853017}, url = {http://link.aip.org/link/?JAS/117/1744/1}, author = {Gumerov, Nail A. and Duraiswami, Ramani} } @article {14673, title = {Cyclone: A type-safe dialect of C}, journal = {C/C++ Users Journal}, volume = {23}, year = {2005}, month = {2005///}, pages = {112 - 139}, abstract = {If any bug has achieved celebrity status, it is thebuffer overflow. It made front-page news as early as 1987, as the enabler of the Morris worm, the first worm to spread through the Internet. In recent years, attacks exploiting buffer overflows have become more frequent, and more virulent. This year, for exam- ple, the Witty worm was released to the wild less than 48 hours after a buffer overflow vulnerability was publicly announced; in 45 minutes, it infected the entire world-wide population of 12,000 machines running the vulnerable programs. Notably, buffer overflows are a problem only for the C and C++ languages{\textemdash}Java and other {\textquotedblleft}safe{\textquotedblright} lan- guages have built-in protection against them. More- over, buffer overflows appear in C programs written by expert programmers who are security concious{\textemdash} programs such as OpenSSH, Kerberos, and the com- mercial intrusion detection programs that were the target of Witty. This is bad news for C. If security experts have trouble producing overflow-free C programs, then there is not much hope for ordinary C program- mers. On the other hand, programming in Java is no panacea; for certain applications, C has no com- petition. From a programmer{\textquoteright}s point of view, all the safe languages are about the same, while C is a very different beast. }, author = {Grossman,D. and Hicks, Michael W. and Jim,T. and Morrisett,G.} } @article {18191, title = {Data hiding in curves with application to fingerprinting maps}, journal = {Signal Processing, IEEE Transactions on}, volume = {53}, year = {2005}, month = {2005/10//}, pages = {3988 - 4005}, abstract = {This paper presents a new data hiding method for curves. The proposed algorithm parameterizes a curve using the B-spline model and adds a spread spectrum sequence to the coordinates of the B-spline control points. In order to achieve robust fingerprint detection, an iterative alignment-minimization algorithm is proposed to perform curve registration and to deal with the nonuniqueness of B-spline control points. Through experiments, we demonstrate the robustness of the proposed data-hiding algorithm against various attacks, such as collusion, cropping, geometric transformations, vector/raster-raster/vector conversions, printing-and-scanning, and some of their combinations. We also show the feasibility of our method for fingerprinting topographic maps as well as writings and drawings.}, keywords = {(mathematics);, algorithm;, alignment-minimization, B-spline, CONTROL, curve, data, detection;, edge, embedding;, encapsulation;, fingerprint, geospatial, hiding, identification;, image, iterative, method;, methods;, minimisation;, point;, protection;, registration;, sequence;, spectrum, splines, spread, watermarking;}, isbn = {1053-587X}, doi = {10.1109/TSP.2005.855411}, author = {Gou,Hongmei and M. Wu} } @conference {14175, title = {Discovering a language for human activity}, booktitle = {Proceedings of the AAAI 2005 Fall Symposium on Anticipatory Cognitive Embodied Systems, Washington, DC}, year = {2005}, month = {2005///}, author = {Guerra-Filho,G. and Ferm{\"u}ller, Cornelia and Aloimonos, J.} } @conference {13547, title = {Document Ranking by Layout Relevance}, booktitle = {ICDAR}, year = {2005}, month = {2005/08//}, pages = {362 - 366}, abstract = {This paper describes the development of a new document ranking system based on layout similarity. The user has a need represented by a set of {\textquotedblright}wanted{\textquotedblright} documents, and the system ranks documents in the collection according to this need. Rather than performing complete document analysis, the system extracts text lines, and models layouts as relationships between pairs of these lines. This paper explores three novel feature sets to support scoring in large document collections. First, pairs of lines are used to form quadrilaterals, which are represented by their turning functions. A non- Euclidean distance is used to measure similarity. Second, the quadrilaterals are represented by 5DEuclidean vectors, and third, each line is represented by a 5DEuclidean vector. We compare the classification performance and computation speed of these three feature sets using a large database of diverse documents including forms, academic papers and handwritten pages in English and Arabic. The approach using quadrilaterals and turning functions produces slightly better results, but the approach using vectors to represent text lines is much faster for large document databases.}, author = {Huang,Mei and DeMenthon,Daniel and David Doermann and Golebiowski,Lynn} } @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 {17107, title = {Dynamic Query Chloropleth Maps for Information Seeking and Decision Making (2003)}, year = {2005}, month = {2005///}, abstract = {Information retrieval and visualization can be combined in dynamic query systems that allow users unparalleled access to information for decision making. In this paper, we report on the development and evaluation of a dynamic query system (YMap) that displays information on a chloropleth map using double thumb sliders to select ranges of query variables. The YMap prototype is a Java-Applet that supports panning and zooming. Several usability studies were conducted on early prototypes that resulted in the current version. Applications of YMap for decision making tasks are discussed.}, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/6505}, author = {Norman,Kent L and Zhao,Haixia and Shneiderman, Ben and Golub,Evan} } @article {17112, title = {Dynamic Query Visualizations on World Wide Web Clients: A DHTML Solution for Maps and Scattergrams (2002)}, year = {2005}, month = {2005///}, abstract = {Dynamic queries are gaining popularity as a method for interactive information visualization. Many implementations have been made on personal computers, and there is increasing interest in web-based designs. While Java and Flash strategies have been developed, we believe that a Dynamic HTML implementation could help promote more widespread use. We implemented double-box range sliders with choropleth maps and scattergrams, which are two popular visualizations, using HTML layers and tables. This paper describes our methods for slider control, visual presentation, and displaying/updating results for these visualizations. Visual design issues innovations and performance enhancements were necessary to create viable designs.}, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/6491}, author = {Golub,Evan and Shneiderman, Ben} } @article {14503, title = {Entity resolution in graph data}, year = {2005}, month = {2005///}, institution = {Technical report, University of Maryland, College Park}, abstract = {The goal of entity resolution is to reconcile data references corresponding to the same realworld entity. Here we introduce the problem of entity resolution in graphs, where the nodes are the references in the data and the hyper-edges represent the relations that are observed to hold between the references. The goal then is to reconstruct a {\textquoteright}cleaned{\textquoteright} entity graph that captures the relations among the true underlying entities from the reference graph. This is an important first step in any graph mining process; mining an unresolved graph will be inefficient and result in inaccurate conclusions. We also motivate collective entity resolution in graphs where references sharing hyper-edges are resolved jointly, as opposed to independent pair-wise resolution of the references. We illustrate the problem of graph-based entity resolution in bibliographic datasets. We discuss several interesting issues such as mul- tiple entity types, local and global resolution and different kinds of graph-based evidence. We formulate the graph-based entity resolution problem as an unsupervised clustering task, where each cluster represents references that map to the same entity, and the similarity measure between two clusters incorporates the similarity of the references attributes and, more interestingly, the similarity between their relations. We explore two different measures of relational similarity. One approach, which we call {\textquoteright}edge detail similarity{\textquoteright}, explicitly com- pares the individual edges that each cluster participates in, but is expensive to compute. A less computationally intensive alternative is measuring {\textquoteright}neighborhood similarity{\textquoteright}, which only compares the multi-set of neighboring clusters for each cluster. We perform an extensive empirical evaluation of the two relational similarity measures for author resolution using co- author relations in two real bibliographic datasets. We show that both similarity measures improve performance over unsupervised algorithms that consider only reference attributes. We also describe an efficient implementation and show that these algorithms scale gracefully with increasing size of the data. }, author = {Bhattacharya,I. and Getoor, Lise} } @article {16516, title = {Evolving processing speed asymmetries and hemispheric interactions in a neural network model}, journal = {Neurocomputing}, volume = {65}, year = {2005}, month = {2005///}, pages = {47 - 53}, author = {Grushin,A. and Reggia, James A.} } @conference {13367, title = {Exploiting Correlated Attributes in Acquisitional Query Processing}, booktitle = {21st International Conference on Data Engineering, 2005. ICDE 2005. Proceedings}, year = {2005}, month = {2005/04/05/08}, pages = {143 - 154}, publisher = {IEEE}, organization = {IEEE}, abstract = {Sensor networks and other distributed information systems (such as the Web) must frequently access data that has a high per-attribute acquisition cost, in terms of energy, latency, or computational resources. When executing queries that contain several predicates over such expensive attributes, we observe that it can be beneficial to use correlations to automatically introduce low-cost attributes whose observation will allow the query processor to better estimate the selectivity of these expensive predicates. In particular, we show how to build conditional plans that branch into one or more sub-plans, each with a different ordering for the expensive query predicates, based on the runtime observation of low-cost attributes. We frame the problem of constructing the optimal conditional plan for a given user query and set of candidate low-cost attributes as an optimization problem. We describe an exponential time algorithm for finding such optimal plans, and describe a polynomial-time heuristic for identifying conditional plans that perform well in practice. We also show how to compactly model conditional probability distributions needed to identify correlations and build these plans. We evaluate our algorithms against several real-world sensor-network data sets, showing several-times performance increases for a variety of queries versus traditional optimization techniques.}, keywords = {acquisitional query processing, Computer networks, Costs, data acquisition, Delay, Distributed computing, distributed information system, Distributed information systems, distributed processing, exponential time algorithm, optimization techniques, polynomial-time heuristic, Polynomials, probability, Query processing, real-time systems, real-world sensor-network, Runtime, Sensor phenomena and characterization, Sensor systems}, isbn = {0-7695-2285-8}, doi = {10.1109/ICDE.2005.63}, author = {Deshpande, Amol and Guestrin,C. and Wei Hong and Madden,S.} } @conference {13194, title = {Extracting regions of symmetry}, booktitle = {Image Processing, 2005. ICIP 2005. IEEE International Conference on}, volume = {3}, year = {2005}, month = {2005/09//}, pages = {III - 133-6 - III - 133-6}, abstract = {This paper presents an approach for extending the normalized-cut (n-cut) segmentation algorithm to find symmetric regions present in natural images. We use an existing algorithm to quickly detect possible symmetries present in an image. The detected symmetries are then individually verified using the modified n-cut algorithm to eliminate spurious detections. The weights of the n-cut algorithm are modified so as to include both symmetric and spatial affinities. A global parameter is defined to model the tradeoff between spatial coherence and symmetry. Experimental results indicate that symmetric quality measure for a region segmented by our algorithm is a good indicator for the significance of the principal axis of symmetry.}, keywords = {algorithm;, coherence;, DETECTION, detection;, elimination;, extraction;, feature, image, images;, natural, normalized-cut, object, region, segmentation, segmentation;, spatial, spurious, symmetry}, doi = {10.1109/ICIP.2005.1530346}, author = {Gupta,A. and Prasad,V. S.N and Davis, Larry S.} } @conference {16793, title = {A fast approximation scheme for probabilistic wavelet synopses}, booktitle = {Proceedings of the 17th International Conference on Scientific and Statistical Database Management (SSDBM)}, year = {2005}, month = {2005///}, author = {Deligiannakis,A. and Garofalakis,M. and Roussopoulos, Nick} } @article {14018, title = {Fast Computation of Sums of Gaussians in High Dimensions}, journal = {Technical Reports from UMIACS UMIACS-TR-2005-69}, year = {2005}, month = {2005/11/15/T19:2}, abstract = {Evaluating sums of multivariate Gaussian kernels is a key computational task in many problems in computational statistics andmachine learning. The computational cost of the direct evaluation of such sums scales as the product of the number of kernel functions and the evaluation points. The fast Gauss transform proposed by Greengard and Strain (1991) is a $\epsilon$-exact approximation algorithm that reduces the computational complexity of the evaluation of the sum of $N$ Gaussians at $M$ points in $d$ dimensions from $\mathcal{O}(MN)$ to $\mathcal{O}(M+N)$. However, the constant factor in $\mathcal{O}(M+N)$ grows exponentially with increasing dimensionality $d$, which makes the algorithm impractical for dimensions greater than three. In this paper we present a new algorithm where the constant factor is reduced to asymptotically polynomial order. The reduction is based on a new multivariate Taylor{\textquoteright}s series expansion (which can act both as a local as well as a far field expansion) scheme combined with the efficient space subdivision using the $k$-center algorithm. The proposed method differs from the original fast Gauss transform in terms of a different factorization, efficient space subdivision, and the use of point-wise error bounds. Algorithm details, error bounds, procedure to choose the parameters and numerical experiments are presented. As an example we shows how the proposed method can be used for very fast $\epsilon$-exact multivariate kernel density estimation. }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/3020}, author = {Raykar,Vikas Chandrakant and Yang,Changjaing and Duraiswami, Ramani and Gumerov, Nail A.} } @article {14540, title = {Fast Multipole Method for the Biharmonic Equation}, volume = {UMIACS-TR-2005-29}, year = {2005}, month = {2005/09/29/}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {The evaluation of sums (matrix-vector products) of the solutions ofthe three-dimensional biharmonic equation can be accelerated using the fast multipole method, while memory requirements can also be significantly reduced. We develop a complete translation theory for these equations. It is shown that translations of elementary solutions of the biharmonic equation can be achieved by considering the translation of a pair of elementary solutions of the Laplace equations. Compared to previous methods that required the translation of five Laplace elementary solutions for the biharmonic Green{\textquoteright}s function, and much larger numbers for higher order multipoles, our method is significantly more efficient. The theory is implemented and numerical tests presented that demonstrate the performance of the method for varying problem sizes and accuracy requirements. In our implementation the FMM\ is faster than direct solution for a matrix size of $550$ for an accuracy of $10^{-3},$ 950 for an accuracy of $10^{-6} and $N=3550$ for an accuracy of $10^{-9}$. }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu//handle/1903/2813}, author = {Gumerov, Nail A. and Duraiswami, Ramani} } @article {18214, title = {Fingerprinting curves}, journal = {Digital Watermarking}, year = {2005}, month = {2005///}, pages = {13 - 28}, abstract = {This paper presents a new method for robust data hiding in curves and highlights potential applications including digital fingerprinting of map document for trace and track purposes. We parameterize a curve using the B-spline model and add a spread spectrum sequence to the coordinates of the B-spline control points. In order to achieve robust fingerprint detection, we propose an iterative alignment-minimization algorithm to perform curve registration and deal with the non-uniqueness of B-spline control points. We show through experiments the robustness of our method against various attacks such as collusion, geometric transformations and perturbation, printing-and-scanning, and some of their combinations. We demonstrate the feasibility of our method for fingerprinting topographic maps as well as writings and drawings. The extension from hiding data in 2D topographic maps to 3D elevation data sets is also discussed.}, doi = {10.1007/978-3-540-31805-7_2}, author = {Gou,H. and Wu,M.} } @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} } @conference {13774, title = {Frame semantic enhancement of lexical-semantic resources}, booktitle = {Proceedings of the ACL-SIGLEX Workshop on Deep Lexical Acquisition}, series = {DeepLA {\textquoteright}05}, year = {2005}, month = {2005///}, pages = {57 - 66}, publisher = {Association for Computational Linguistics}, organization = {Association for Computational Linguistics}, address = {Stroudsburg, PA, USA}, abstract = {SemFrame generates FrameNet-like frames, complete with semantic roles and evoking lexical units. This output can enhance FrameNet by suggesting new frames, as well as additional lexical units that evoke existing frames. SemFrame output can also support the addition of frame semantic relationships to WordNet.}, url = {http://dl.acm.org/citation.cfm?id=1631850.1631857}, author = {Green,Rebecca and Dorr, Bonnie J} } @article {17177, title = {Generating and Querying Semantic Web Environments for Photo Libraries (2005)}, journal = {Institute for Systems Research Technical Reports}, year = {2005}, month = {2005///}, abstract = {Online photo libraries require a method to efficiently search a collection of photographs, and retrieve photos with similar attributes. Our motivation was to incorporate an existing collection of over 250 photographs of over 200 faculty members and events spanning 7 decades into a library called CS PhotoHistory that is available in hypertext and on the Semantic Web. In this paper, we identify challenges related to making this repository available on the Semantic Web, including issues of automation, modeling, and expressivity. Using CS PhotoHistory as a case study, we describe the process of creating an ontology and a querying interface for interacting with a digital photo library on the Semantic Web.}, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/6538}, author = {Axelrod,Adam and Golbeck,Jennifer and Shneiderman, Ben} } @article {14092, title = {The genome of the African trypanosome Trypanosoma brucei}, journal = {Science}, volume = {309}, year = {2005}, month = {2005///}, pages = {416 - 416}, author = {Berriman,M. and Ghedin,E. and Hertz-Fowler,C. and Blandin,G. and Renauld,H. and Bartholomeu,D. C and Lennard,N. J and Caler,E. and Hamlin,N. E and Haas,B. and others} } @article {14071, title = {The Genome Sequence of Trypanosoma cruzi, Etiologic Agent of Chagas Disease}, journal = {Science}, volume = {309}, year = {2005}, month = {2005/07/15/}, pages = {409 - 415}, abstract = {Whole-genome sequencing of the protozoan pathogen Trypanosoma cruzi revealed that the diploid genome contains a predicted 22,570 proteins encoded by genes, of which 12,570 represent allelic pairs. Over 50\% of the genome consists of repeated sequences, such as retrotransposons and genes for large families of surface molecules, which include trans-sialidases, mucins, gp63s, and a large novel family (>1300 copies) of mucin-associated surface protein (MASP) genes. Analyses of the T. cruzi, T. brucei, and Leishmania major (Tritryp) genomes imply differences from other eukaryotes in DNA repair and initiation of replication and reflect their unusual mitochondrial DNA. Although the Tritryp lack several classes of signaling molecules, their kinomes contain a large and diverse set of protein kinases and phosphatases; their size and diversity imply previously unknown interactions and regulatory processes, which may be targets for intervention.}, doi = {10.1126/science.1112631}, url = {http://www.sciencemag.org/content/309/5733/409.abstract}, author = {El-Sayed, Najib M. and Myler,Peter J. and Bartholomeu,Daniella C. and Nilsson,Daniel and Aggarwal,Gautam and Tran,Anh-Nhi and Ghedin,Elodie and Worthey,Elizabeth A. and Delcher,Arthur L. and Blandin,Ga{\"e}lle and Westenberger,Scott J. and Caler,Elisabet and Cerqueira,Gustavo C. and Branche,Carole and Haas,Brian and Anupama,Atashi and Arner,Erik and {\r A}slund,Lena and Attipoe,Philip and Bontempi,Esteban and Bringaud,Fr{\'e}d{\'e}ric and Burton,Peter and Cadag,Eithon and Campbell,David A. and Carrington,Mark and Crabtree,Jonathan and Darban,Hamid and da Silveira,Jose Franco and de Jong,Pieter and Edwards,Kimberly and Englund,Paul T. and Fazelina,Gholam and Feldblyum,Tamara and Ferella,Marcela and Frasch,Alberto Carlos and Gull,Keith and Horn,David and Hou,Lihua and Huang,Yiting and Kindlund,Ellen and Klingbeil,Michele and Kluge,Sindy and Koo,Hean and Lacerda,Daniela and Levin,Mariano J. and Lorenzi,Hernan and Louie,Tin and Machado,Carlos Renato and McCulloch,Richard and McKenna,Alan and Mizuno,Yumi and Mottram,Jeremy C. and Nelson,Siri and Ochaya,Stephen and Osoegawa,Kazutoyo and Pai,Grace and Parsons,Marilyn and Pentony,Martin and Pettersson,Ulf and Pop, Mihai and Ramirez,Jose Luis and Rinta,Joel and Robertson,Laura and Salzberg,Steven L. and Sanchez,Daniel O. and Seyler,Amber and Sharma,Reuben and Shetty,Jyoti and Simpson,Anjana J. and Sisk,Ellen and Tammi,Martti T. and Tarleton,Rick and Teixeira,Santuza and Van Aken,Susan and Vogt,Christy and Ward,Pauline N. and Wickstead,Bill and Wortman,Jennifer and White,Owen and Fraser,Claire M. and Stuart,Kenneth D. and Andersson,Bj{\"o}rn} } @article {19073, title = {The genome sequence of Trypanosoma cruzi, etiologic agent of Chagas disease}, journal = {Science}, volume = {309}, year = {2005}, month = {2005}, author = {El-Sayed, N.M. and Myler,P. J and Bartholomeu,D. C and Nilsson,D. and Aggarwal,G. and Tran,A. N and Ghedin,E. and Worthey,E. A and Delcher,A. L and Blandin,G. and others} } @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 {18845, title = {Geometric algorithms for computing cutter engagement functions in 2.5D milling operations}, journal = {Computer-Aided Design}, volume = {37}, year = {2005}, month = {2005/12//}, pages = {1469 - 1480}, abstract = {Cutter engagement is a measure that describes what portion of the cutter is involved in machining at a given instant of time. During profile milling of complex geometries, cutter engagement varies significantly along the cutter path. Cutter engagement information helps in determining the efficiency of the cutter path and also helps in improving it by adjusting the feed rate. This paper describes geometric algorithms for computing piece-wise continuous closed-form cutter engagement functions for 2.5D milling operations. The results produced by our algorithm are compared with the results obtained by discrete simulations of the cutting process and appear to match very well.}, keywords = {Cutter engagement, Cutter path planning, Feed rate adjustments}, isbn = {0010-4485}, doi = {10.1016/j.cad.2005.03.001}, url = {http://www.sciencedirect.com/science/article/pii/S0010448505000801}, author = {Gupta, Satyandra K. and Saini,Sunil K. and Spranklin,Brent W. and Yao,Zhiyang} } @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.} } @article {18221, title = {Handling uneven embedding capacity in binary images: a revisit}, journal = {Proceedings of SPIE}, volume = {5681}, year = {2005}, month = {2005/03/21/}, pages = {194 - 205}, abstract = {Hiding data in binary images can facilitate the authentication and annotation of important document images in digital domain. A representative approach is to first identify pixels whose binary color can be flipped without introducing noticeable artifacts, and then embed one bit in each non-overlapping block by adjusting the flippable pixel values to obtain the desired block parity. The distribution of these flippable pixels is highly uneven across the image, which is handled by random shuffling in the literature. In this paper, we revisit the problem of data embedding for binary images and investigate the incorporation of a most recent steganography framework known as the wet paper coding to improve the embedding capacity. The wet paper codes naturally handle the uneven embedding capacity through randomized projections. In contrast to the previous approach, where only a small portion of the flippable pixels are actually utilized in the embedding, the wet paper codes allow for a high utilization of pixels that have high flippability score for embedding, thus giving a significantly improved embedding capacity than the previous approach. The performance of the proposed technique is demonstrated on several representative images. We also analyze the perceptual impact and capacity-robustness relation of the new approach.}, isbn = {0277786X}, doi = {doi:10.1117/12.587379}, url = {http://spiedigitallibrary.org/proceedings/resource/2/psisdg/5681/1/194_1?isAuthorized=no}, author = {M. Wu and Fridrich,Jessica and Goljan,Miroslav and Gou,Hongmei} } @article {14031, title = {High Order Spatial Audio Capture and Binaural Head-Tracked Playback over Headphones with HRTF Cues}, journal = {Proceedings 119th convention of AES}, year = {2005}, month = {2005///}, abstract = {A theory and a system for capturing an audio scene and then rendering it remotely are developed andpresented. The sound capture is performed with a spherical microphone array. The sound field at the location of the array is deduced from the captured sound and is represented using either spherical wave-functions or plane-wave expansions. The sound field representation is then transmitted to a remote location for immediate rendering or stored for later use. The sound renderer, coupled with the head tracker, reconstructs the acoustic field using individualized head-related transfer functions to preserve the perceptual spatial structure of the audio scene. Rigorous error bounds and Nyquist-like sampling criterion for the representation of the sound field are presented and verified. }, author = {Duraiswami, Ramani and Zotkin,Dmitry N and Li,Z. and Grassi,E. and Gumerov, Nail A. and Davis, Larry S.} } @conference {13199, title = {High Order Spatial Audio Capture and Its Binaural Head-Tracked Playback Over Headphones with HRTF Cues}, booktitle = {Audio Engineering Society Convention 119}, year = {2005}, month = {2005///}, url = {http://www.aes.org/e-lib/browse.cfm?elib=13369}, author = {Zotkin,Dmitry N and Davis, Larry S. and Duraiswami, Ramani and Grassi,Elena and Gumerov, Nail A. and Zhiyun,Li} } @conference {18482, title = {High Order Spatial Audio Capture and Its Binaural Head-Tracked Playback Over Headphones with HRTF Cues}, booktitle = {Audio Engineering Society Convention 119}, year = {2005}, month = {2005///}, abstract = {A theory and a system for capturing an audio scene and then rendering it remotely are developed and presented. The sound capture is performed with a spherical microphone array. The sound field at the location, and in a region of space in the neighborhood, of the array is deduced from the captured sound and represented using either spherical wave-functions or plane-wave expansions. The representation is then transmitted to a remote location for immediate rendering or stored for later reproduction. The sound renderer, coupled with the head tracker, reconstructs the acoustic field using individualized head-related transfer functions to preserve the perceptual spatial structure of the audio scene. Rigorous error bounds and a Nyquist-like sampling criterion for the representation of the sound field are presented and verified.}, author = {Davis, Larry S. and Duraiswami, Ramani and Grassi,E. and Gumerov, Nail A. and Li,Z. and Zotkin,Dmitry N} } @conference {18774, title = {Information and Knowledge Modeling for Computer Supported Micro Electro-Mechanical Systems Design and Development}, year = {2005}, month = {2005///}, abstract = {In this paper, we present a preliminary research effort towardsan effective computer support environment for the design and development of micro-electro-mechanical systems (MEMS). We first identify the characteristics of MEMS product design and development processes and examine the state-of-the-art of MEMS Computer-aided Design (CAD) and simulation systems. We then propose a function-(environment-effect)-behavior- (principle-state)-form (FEEBPSF) framework based on the NIST core product model and its extensions for modeling MEMS products, and apply the OESM (open embedded system model) developed to model information and knowledge for embedded MEMS design and development. Moreover, in order to tackle the knowledge-intensive tasks of design and development for MEMS products, we develop a general and flexible knowledge repository, called KR-MEMS, based on the FEEBPSF framework and the Unified Modeling Language (UML)/ Extensible Markup Language (XML) model, and integrate KR-MEMS into a web-based MEMS design support system. Throughout the paper, a micro fluidic dispensing device (a biomedical device for drug-delivery) is used as an example to illustrate the concepts, models, and knowledge bases necessary to support the MEMS product design and development. }, url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.160.7822\&rep=rep1\&type=pdf}, author = {Zha,X. F. and Sriram,R.D. and Gupta,S.K.} } @article {14359, title = {Introduction to the special issue on link mining}, journal = {ACM SIGKDD Explorations Newsletter}, volume = {7}, year = {2005}, month = {2005/12//}, pages = {1 - 2}, abstract = {An emerging challenge for data mining is the problem of mining richly structured datasets, where the objects are linked in some way. Many real-world datasets describe a variety of entity types linked via multiple types of relations. These links provide additional context that can be helpful for many data mining tasks. Yet multi-relational data violates the traditional assumption of independent, identically distributed data instances that provides the basis for many statistical machine learning algorithms. Therefore, new approaches are needed that can exploit the dependencies across the attribute and link structure.}, isbn = {1931-0145}, doi = {10.1145/1117454.1117455}, url = {http://doi.acm.org/10.1145/1117454.1117455}, author = {Getoor, Lise and Diehl,Christopher P.} } @article {14360, title = {Link mining: a survey}, journal = {ACM SIGKDD Explorations Newsletter}, volume = {7}, year = {2005}, month = {2005/12//}, pages = {3 - 12}, abstract = {Many datasets of interest today are best described as a linked collection of interrelated objects. These may represent homogeneous networks, in which there is a single-object type and link type, or richer, heterogeneous networks, in which there may be multiple object and link types (and possibly other semantic information). Examples of homogeneous networks include single mode social networks, such as people connected by friendship links, or the WWW, a collection of linked web pages. Examples of heterogeneous networks include those in medical domains describing patients, diseases, treatments and contacts, or in bibliographic domains describing publications, authors, and venues. Link mining refers to data mining techniques that explicitly consider these links when building predictive or descriptive models of the linked data. Commonly addressed link mining tasks include object ranking, group detection, collective classification, link prediction and subgraph discovery. While network analysis has been studied in depth in particular areas such as social network analysis, hypertext mining, and web analysis, only recently has there been a cross-fertilization of ideas among these different communities. This is an exciting, rapidly expanding area. In this article, we review some of the common emerging themes.}, isbn = {1931-0145}, doi = {10.1145/1117454.1117456}, url = {http://doi.acm.org/10.1145/1117454.1117456}, author = {Getoor, Lise and Diehl,Christopher P.} } @article {14467, title = {Link Mining for the Semantic Web, Position Statement}, journal = {Proceedings of the Dagstuhl Seminar in Machine Learning for the Semantic Web}, year = {2005}, month = {2005///}, abstract = {A key challenge for data mining is tackling the problem of mining richly structured datasets, where the objectsare linked in some way and we have some ontological information describing the domain. Links among the objects demonstrate certain patterns, which can be helpful for many data mining tasks and are usually hard to capture with traditional statistical models. Our goals are to develop machine learning algorithms which can a) make use of the ontological theory during learning b) learn how to refine, or update the ontological theory, based on learned model and c) do a mix of both. }, author = {Getoor, Lise and Licamele,L.} } @article {14369, title = {Link-based classification}, journal = {Advanced methods for knowledge discovery from complex data}, year = {2005}, month = {2005///}, pages = {189 - 207}, abstract = {A key challenge for machine learning is the problem of mining richly structured data sets, where the objects are linked in some way due to either an explicit or implicit relationship that exists between the objects. Links among the objects demonstrate certain patterns, which can be helpful for many machine learning tasks and are usually hard to capture with traditional statistical models. Recently there has been a surge of interest in this area, fuelled largely by interest in web and hypertext mining, but also by interest in mining social networks, bibliographic citation data, epidemiological data and other domains best described using a linked or graph structure. In this chapter we propose a framework for modeling link distributions, a link-based model that supports discriminative models describing both the link distributions and the attributes of linked objects. We use a structured logistic regression model, capturing both content and links. We systematically evaluate several variants of our link-based model on a range of data sets including both web and citation collections. In all cases, the use of the link distribution improves classification performance.}, doi = {10.1007/1-84628-284-5_7}, author = {Getoor, Lise} } @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} } @conference {12280, title = {Measurement-based multipath multicast}, booktitle = {INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings IEEE}, volume = {4}, year = {2005}, month = {2005/03//}, pages = {2803 - 2808 vol. 4 - 2803 - 2808 vol. 4}, abstract = {We propose a measurement-based routing algorithm to load balance intradomain traffic along multiple paths for multiple multicast sources. Multiple paths are established using application-layer overlaying. The proposed algorithm is able to converge under different network models, where each model reflects a different set of assumptions about the multicasting capabilities of the network. The algorithm is derived from simultaneous perturbation stochastic approximation and relies only on noisy estimates from measurements. Simulation results are presented to demonstrate the additional benefits obtained by incrementally increasing the multicasting capabilities.}, keywords = {algorithm;, allocation;, application-layer, approximation, approximation;, balance, communication;, Convergence, convergence;, intradomain, load, measurement-based, methods;, Multicast, multipath, network, numerical, of, overlaying;, perturbation, processes;, resource, Routing, routing;, source;, Stochastic, techniques;, Telecommunication, theory;, traffic;}, doi = {10.1109/INFCOM.2005.1498566}, author = {Guven,T. and La,R.J. and Shayman,M.A. and Bhattacharjee, Bobby} } @article {13387, title = {Model-based approximate querying in sensor networks}, journal = {The VLDB Journal}, volume = {14}, year = {2005}, month = {2005///}, pages = {417 - 443}, abstract = {Declarative queries are proving to be an attractive paradigm for interacting with networks of wireless sensors. The metaphor that {\textquotedblleft}the sensornet is a database{\textquotedblright} is problematic, however, because sensors do not exhaustively represent the data in the real world. In order to map the raw sensor readings onto physical reality, a model of that reality is required to complement the readings. In this article, we enrich interactive sensor querying with statistical modeling techniques. We demonstrate that such models can help provide answers that are both more meaningful, and, by introducing approximations with probabilistic confidences, significantly more efficient to compute in both time and energy. Utilizing the combination of a model and live data acquisition raises the challenging optimization problem of selecting the best sensor readings to acquire, balancing the increase in the confidence of our answer against the communication and data acquisition costs in the network. We describe an exponential time algorithm for finding the optimal solution to this optimization problem, and a polynomial-time heuristic for identifying solutions that perform well in practice. We evaluate our approach on several real-world sensor-network datasets, taking into account the real measured data and communication quality, demonstrating that our model-based approach provides a high-fidelity representation of the real phenomena and leads to significant performance gains versus traditional data acquisition techniques.}, isbn = {1066-8888}, url = {http://dx.doi.org/10.1007/s00778-005-0159-3}, author = {Deshpande, Amol and Guestrin,Carlos and Madden,Samuel and Hellerstein,Joseph and Wei Hong} } @conference {18329, title = {A picture is worth a thousand keywords: image-based object search on a mobile platform}, booktitle = {CHI {\textquoteright}05 extended abstracts on Human factors in computing systems}, series = {CHI EA {\textquoteright}05}, year = {2005}, month = {2005///}, pages = {2025 - 2028}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Finding information based on an object{\textquoteright}s visual appearance is useful when specific keywords for the object are not known. We have developed a mobile image-based search system that takes images of objects as queries and finds relevant web pages by matching them to similar images on the web. Image-based search works well when matching full scenes, such as images of buildings or landmarks, and for matching objects when the boundary of the object in the image is available. We demonstrate the effectiveness of a simple interactive paradigm for obtaining a segmented object boundary, and show how a shape-based image matching algorithm can use the object outline to find similar images on the web.}, keywords = {content-based image retrieval, interactive segmentation, mobile interface, Object recognition}, isbn = {1-59593-002-7}, doi = {10.1145/1056808.1057083}, url = {http://doi.acm.org/10.1145/1056808.1057083}, author = {Tom Yeh and Grauman,Kristen and Tollmar,Konrad and Darrell,Trevor} } @conference {14522, title = {Plane-wave decomposition analysis for spherical microphone arrays}, booktitle = {IEEE Workshop on Applications of Signal Processing to Audio and Acoustics, 2005}, year = {2005}, month = {2005/10//}, pages = {150 - 153}, publisher = {IEEE}, organization = {IEEE}, abstract = {Spherical microphone arrays have attracted attention for analyzing the sound field in a region and beamforming. The analysis of the recorded sound has been performed in terms of spherical wave-functions, and recently the use of plane-wave expansions has been suggested. We show that the plane-wave basis is intimately related to the spherical wave-functions. Reproduction in terms of both representations satisfies certain band-limit criteria. We provide an error bound that shows that to reproduce the spatial characteristics of a sound of a certain frequency we need to be able to accurately represent sounds of up to a particular order, which establishes a Nyquist-like criterion. The order of the sound field in turn is related to the number of microphones in the array necessary to achieve accurate quadrature on the sphere. These results are illustrated with simulations.}, keywords = {Acoustic propagation, Acoustic scattering, acoustic signal processing, acoustic waves, array signal processing, band-limit criteria, beamforming, Educational institutions, Fourier transforms, Frequency, Laboratories, microphone arrays, Nails, Nyquist criterion, Nyquist-like criterion, Partial differential equations, plane-wave decomposition analysis, sound field analysis, spherical microphone arrays, spherical wave-functions}, isbn = {0-7803-9154-3}, doi = {10.1109/ASPAA.2005.1540191}, author = {Duraiswami, Ramani and Zhiyun Li and Zotkin,Dmitry N and Grassi,E. and Gumerov, Nail A.} } @inbook {12666, title = {Pose-Encoded Spherical Harmonics for Robust Face Recognition Using a Single Image}, booktitle = {Analysis and Modelling of Faces and GesturesAnalysis and Modelling of Faces and Gestures}, series = {Lecture Notes in Computer Science}, volume = {3723}, year = {2005}, month = {2005///}, pages = {229 - 243}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {Face recognition under varying pose is a challenging problem, especially when illumination variations are also present. Under Lambertian model, spherical harmonics representation has proved to be effective in modelling illumination variations for a given pose. In this paper, we extend the spherical harmonics representation to encode pose information. More specifically, we show that 2D harmonic basis images at different poses are related by close-form linear combinations. This enables an analytic method for generating new basis images at a different pose which are typically required to handle illumination variations at that particular pose. Furthermore, the orthonormality of the linear combinations is utilized to propose an efficient method for robust face recognition where only one set of front-view basis images per subject is stored. In the method, we directly project a rotated testing image onto the space of front-view basis images after establishing the image correspondence. Very good recognition results have been demonstrated using this method.}, isbn = {978-3-540-29229-6}, url = {http://dx.doi.org/10.1007/11564386_18}, author = {Yue,Zhanfeng and Zhao,Wenyi and Chellapa, Rama}, editor = {Zhao,Wenyi and Gong,Shaogang and Tang,Xiaoou} } @article {14100, title = {Promoter architecture and response to a positive regulator of archaeal transcription}, journal = {Molecular Microbiology}, volume = {56}, year = {2005}, month = {2005/05/01/}, pages = {625 - 637}, abstract = {The archaeal transcription apparatus is chimeric: its core components (RNA polymerase and basal factors) closely resemble those of eukaryotic RNA polymerase II, but the putative archaeal transcriptional regulators are overwhelmingly of bacterial type. Particular interest attaches to how these bacterial-type effectors, especially activators, regulate a eukaryote-like transcription system. The hyperthermophilic archaeon Methanocaldococcus jannaschii encodes a potent transcriptional activator, Ptr2, related to the Lrp/AsnC family of bacterial regulators. Ptr2 activates rubredoxin 2 (rb2) transcription through a bipartite upstream activating site (UAS), and conveys its stimulatory effects on its cognate transcription machinery through direct recruitment of the TATA binding protein (TBP). A functional dissection of the highly constrained architecture of the rb2 promoter shows that a {\textquoteleft}one-site{\textquoteright} minimal UAS suffices for activation by Ptr2, and specifies the required placement of this site. The presence of such a simplified UAS upstream of the natural rubrerythrin (rbr) promoter also suffices for positive regulation by Ptr2 in vitro, and TBP recruitment remains the primary means of transcriptional activation at this promoter.}, isbn = {1365-2958}, doi = {10.1111/j.1365-2958.2005.04563.x}, url = {http://onlinelibrary.wiley.com/doi/10.1111/j.1365-2958.2005.04563.x/abstract}, author = {Ouhammouch,Mohamed and Langham,Geoffrey E and Hausner,Winfried and Simpson,Anjana J. and El-Sayed, Najib M. and Geiduschek,E. Peter} } @mastersthesis {18014, title = {PROTOTYPING THE SIMULATION OF A GATE LEVEL LOGIC APPLICATION PROGRAM INTERFACE (API) ON AN EXPLICIT-MULTI-THREADED (XMT) COMPUTER}, year = {2005}, month = {2005/05/31/}, abstract = {Explicit-multi-threading (XMT) is a parallel programming approach for exploiting on-chip parallelism. Its fine-grained SPMD programming model is suitable for many computing intensive applications. In this paper, we present a parallel gate level logic simulation algorithm and study its implementation on an XMT processor. The test results show that hundreds-fold speedup can be achieved.}, keywords = {Computer Science (0984)}, url = {http://drum.lib.umd.edu/handle/1903/2626}, author = {Gu,Pei} } @conference {15994, title = {On the reasoning of real-world agents: Toward a semantics for active logic}, booktitle = {7-th Annual Symposium on the Logical Formalization of Commonsense Reasoning}, year = {2005}, month = {2005///}, author = {Anderson,M. L and Gomaa,W. and Grant,J. and Perlis, Don} } @conference {14462, title = {Relational clustering for multi-type entity resolution}, booktitle = {Proceedings of the 4th international workshop on Multi-relational mining}, series = {MRDM {\textquoteright}05}, year = {2005}, month = {2005///}, pages = {3 - 12}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {In many applications, there are a variety of ways of referring to the same underlying entity. Given a collection of references to entities, we would like to determine the set of true underlying entities and map the references to these entities. The references may be to entities of different types and more than one type of entity may need to be resolved at the same time. We propose similarity measures for clustering references taking into account the different relations that are observed among the typed references. We pose typed entity resolution in relational data as a clustering problem and present experimental results on real data showing improvements over attribute-based models when relations are leveraged.}, isbn = {1-59593-212-7}, doi = {10.1145/1090193.1090195}, url = {http://doi.acm.org/10.1145/1090193.1090195}, author = {Bhattacharya,Indrajit and Getoor, Lise} } @article {13346, title = {Resource-aware wireless sensor-actuator networks}, journal = {Data Engineering}, volume = {1001}, year = {2005}, month = {2005///}, pages = {40 - 40}, author = {Deshpande, Amol and Guestrin,C. and Madden,S. R} } @article {18268, title = {Robust digital fingerprinting for curves}, journal = {Proc. of IEEE Int. Conf. on Acoustics, Speech, and Signal Processing (ICASSP{\textquoteright}05)}, volume = {2}, year = {2005}, month = {2005///}, pages = {529 - 532}, abstract = {Hiding data in curves can be achieved by parameterizing acurve using the B-spline model and adding spread spectrum sequences in B-spline control points. In this paper, we pro- pose an iterative alignment-minimization algorithm to per- form curve registration and deal with the non-uniqueness of B-spline control points. We demonstrate through experi- ments the robustness of our method against various attacks such as collusion, geometric transformation, and printing- and-scanning. We also show the feasibility of our method for fingerprinting topographic maps and detecting finger- prints from printed copies. }, author = {Gou,H. and Wu,M.} } @conference {16880, title = {Scalable data collection infrastructure for digital government applications}, booktitle = {Proceedings of the 2005 national conference on Digital government research}, series = {dg.o {\textquoteright}05}, year = {2005}, month = {2005///}, pages = {305 - 306}, publisher = {Digital Government Society of North America}, organization = {Digital Government Society of North America}, abstract = {Highlights are presented of a project on the development of a scalable data collection infrastructure of digital government applications. The approach takes advantage of both the distributed nature of the data and the distributed ways of interacting with it. The approach is three-parted having theoretical, systems, and application components. On the theoretical and systems levels, work has continued on the development of the BISTRO system. On the applications level, work has continued on the investigation of the use of peer-to-peer networks in a number of domains in which the proper handling of spatial data is important.}, url = {http://dl.acm.org/citation.cfm?id=1065226.1065333}, author = {Samet, Hanan and Tanin,Egemen and Golubchik,Leana} } @conference {14531, title = {System for capturing of highorder spatial audio using spherical microphone array and binaural head-tracked playback over headphones with head related transfer function cues}, booktitle = {Proc. 119th convention AES}, year = {2005}, month = {2005///}, author = {Duraiswami, Ramani and Zotkin,Dmitry N and Li,Z. and Grassi,E. and Gumerov, Nail A. and Davis, Larry S.} } @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 {12932, title = {Temperature-Driven Campylobacter Seasonality in England and Wales}, journal = {Applied and Environmental MicrobiologyAppl. Environ. Microbiol.}, volume = {71}, year = {2005}, month = {2005/01/01/}, pages = {85 - 92}, abstract = {Campylobacter incidence in England and Wales between 1990 and 1999 was examined in conjunction with weather conditions. Over the 10-year interval, the average annual rate was determined to be 78.4 {\textpm} 15.0 cases per 100,000, with an upward trend. Rates were higher in males than in females, regardless of age, and highest in children less than 5 years old. Major regional differences were detected, with the highest rates in Wales and the southwest and the lowest in the southeast. The disease displayed a seasonal pattern, and increased campylobacter rates were found to be correlated with temperature. The most marked seasonal effect was observed for children under the age of 5. The seasonal pattern of campylobacter infections indicated a linkage with environmental factors rather than food sources. Therefore, public health interventions should not be restricted to food-borne approaches, and the epidemiology of the seasonal peak in human campylobacter infections may best be understood through studies in young children.}, isbn = {0099-2240, 1098-5336}, doi = {10.1128/AEM.71.1.85-92.2005}, url = {http://aem.asm.org/content/71/1/85}, author = {Louis,Val{\'e}rie R. and Gillespie,Iain A. and O{\textquoteright}Brien,Sarah J. and Russek-Cohen,Estelle and Pearson,Andrew D. and Rita R Colwell} } @article {14403, title = {Tutorial on statistical relational learning}, journal = {Inductive Logic Programming}, year = {2005}, month = {2005///}, pages = {415 - 415}, abstract = {Statistical machine learning is in the midst of a {\textquotedblleft}relational revolution{\textquotedblright}. After many decades of focusing on independent and identically-distributed (iid) examples, many researchers are now studying problems in which the examples are linked together into complex networks. These networks ca be a simple as sequences and 2-D meshes (such as those arising in part-of-speech tagging and remote sensing) or as complex as citation graphs, the world wide web, and relational data bases.Statistical relational learning raises many new challenges and opportunities. Because the statistical model depends on the domain{\textquoteright}s relational structure, parameters in the model are often tied. This has advantages for making parameter estimation feasible, but complicates the model search. Because the {\textquotedblleft}features{\textquotedblright} involve relationships among multiple objects, there is often a need to intelligently construct aggregates and other relational features. Problems that arise from linkage and autocorrelation among objects must be taken into account. Because instances are linked together, classification typically involves complex inference to arrive at {\textquotedblleft}collective classification{\textquotedblright} in which the labels predicted for the test instances are determined jointly rather than individually. Unlike iid problems, where the result of learning is a single classifier, relational learning often involves instances that are heterogeneous, where the result of learning is a set of multiple components (classifiers, probability distributions, etc.) that predict labels of objects and logical relationships between objects. }, doi = {10.1007/11536314_26}, author = {Getoor, Lise} } @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 {12431, title = {Using Iterative Strategies for Aligning Attributed Points in Space}, volume = {ISR-TR-2005-2}, year = {2005}, month = {2005///}, institution = {Institute for Systems Research, University of Maryland, College Park}, abstract = {Signatures based on shape features are expected to be useful for several similarity assessment applications. Such signatures can extract the relevant shape information needed for similarity assessment and ignore the shape information not needed for a particular application.

Since different feature-based models are created in different coordinate systems, in order to compute distance between two sets of features, one needs to include geometric transformations for aligning features. Optimal alignment is the alignment that results in the minimum distance between two sets of features. In general, features can be viewed as attributed points in space. Hence, we need to develop techniques for aligning attributed points in space.

This report introduces iterative strategies for optimally aligning attributed points in space. Iterative strategies presented in this report involve successively applying algorithms that perform alignment under restricted rigid body transformations (e.g., rotations only or translations only) to solve point alignment problems that require higher dimension transformations (e.g., combinations rotations and translations). Our preliminary experimental results show that the idea of using of iterative strategies to solve higher dimension attributed point alignment problems is promising and can be used to perform feature-based shape similarity assessment.}, keywords = {Technical Report}, url = {http://drum.lib.umd.edu//handle/1903/6467}, author = {Cardone, Antonio and Gupta, Satyandra K. and Mount, Dave} } @article {16475, title = {Using Non-random Associations for Predicting Latency in WANs}, journal = {Web Information Systems Engineering {\textendash} WISE 2005}, year = {2005}, month = {2005///}, abstract = {In this paper, we propose a scalable performance management tool for Wide Area Applications. Our objective is to scalably identify non-random associations between pairs of individual Latency Profiles (iLPs) (i.e., latency distributions experienced by clients when connecting to a server) and exploit them in latency prediction. Our approach utilizes Relevance Networks (RNs) to manage tens of thousands of iLPs. Non-random associations between iLPs can be identified by topology-independent measures such as correlation and mutual information. We demonstrate that these non-random associations do indeed have a significant impact in improving the error of latency prediction.}, doi = {10.1007/11581062_48}, author = {Raschid, Louiqa and Ye,Q. and Zadorozhny,V. and Gal,A. and Murthy,H.} } @conference {13345, title = {Using probabilistic models for data management in acquisitional environments}, booktitle = {Proc. CIDR}, year = {2005}, month = {2005///}, pages = {317 - 328}, author = {Deshpande, Amol and Guestrin,C. and Madden,S.} } @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 {12086, title = {Achieving packet-level quality of service through scheduling in multirate WLANs}, booktitle = {Vehicular Technology Conference, 2004. VTC2004-Fall. 2004 IEEE 60th}, volume = {4}, year = {2004}, month = {2004/09/26/29}, pages = {2730- 2734 Vol. 4 - 2730- 2734 Vol. 4}, publisher = {IEEE}, organization = {IEEE}, abstract = {Wireless packet scheduling has been a popular paradigm to achieve packet-level QoS in terms of fairness and throughput in the presence of channel errors. However, the current design does not anticipate the multi-rate capability offered by the IEEE 802.11a/b/g physical layer, thus suffering significant performance degradation in 802.11 WLANs. In this paper, we propose multirate wireless fair scheduling (WMFS). In MWFS, each flow is granted a temporal fair share of the channel, in contrast to the throughput fair share adopted by existing algorithms. Therefore, each flow receives services in proportion to its perceived transmission rate, and high-rate flows are able to opportunistically exploit their good channel conditions and receive more services. MWFS also renovates the compensation model in order to allow for error-prone flows to catch up, thus ensuring fairness for all flows over error-prone channels. We demonstrate the effectiveness of MWFS through both simulations and analysis. Especially, WMFS achieves system throughput 159\% of state-of-the-art scheduling algorithms in simulated scenarios.}, keywords = {Analytical models, channel conditions, channel errors, channel temporal fair share, compensation, Computer science, Delay, error-prone flow compensation, IEEE 802.11a/b/g physical layer, multirate wireless fair scheduling, multirate WLAN, packet radio networks, packet-level quality of service, Physical layer, Processor scheduling, QoS, quality of service, radio access networks, Scheduling algorithm, Throughput, throughput fairness, USA Councils, Wireless LAN, wireless packet scheduling, WMFS}, isbn = {0-7803-8521-7}, doi = {10.1109/VETECF.2004.1400554}, author = {Yuan Yuan and Daqing Gu and Arbaugh, William A. and Jinyun Zhang} } @article {13417, title = {Adapting network structure for efficient team formation}, journal = {Proceedings of the AAAI 2004 Fall Symposium on Artificial Multi-agent Learning}, year = {2004}, month = {2004///}, author = {Gaston,M. and Simmons,J. and desJardins, Marie} } @conference {12296, title = {Adaptive replication in peer-to-peer systems}, booktitle = {Distributed Computing Systems, 2004. Proceedings. 24th International Conference on}, year = {2004}, month = {2004///}, pages = {360 - 369}, abstract = {Peer-to-peer systems can be used to form a low-latency decentralized data delivery system. Structured peer-to-peer systems provide both low latency and excellent load balance with uniform query and data distributions. Under the more common skewed access distributions, however, individual nodes are easily overloaded, resulting in poor global performance and lost messages. This paper describes a lightweight, adaptive, and system-neutral replication protocol, called LAR, that maintains low access latencies and good load balance even under highly skewed demand. We apply LAR to Chord and show that it has lower overhead and better performance than existing replication strategies.}, keywords = {adaptive, allocation;, data, databases;, decentralized, delivery, distributed, LAR, low-latency, peer-to-peer, processing;, protocol;, replicated, replication, resource, strategies;, structured, system-neutral, system;, systems;}, doi = {10.1109/ICDCS.2004.1281601}, author = {Gopalakrishnan,V. and Silaghi,B. and Bhattacharjee, Bobby and Keleher,P.} } @conference {18792, title = {Algorithmic Foundations for Consistency-Checking of Interaction-States of Mechatronic Systems}, year = {2004}, month = {2004///}, address = {Salt Lake City, Utah, USA}, abstract = {In order to reduce product development time, we needsoftware tools that can perform automated validation of the proposed design concepts. These tools will ensure that only valid design concepts are transferred to the detailed design stage for further development. This paper provides a step towards the automated validation of proposed design concepts. We define the problem of consistency-checking of interaction- states as a key step in the design concept validation. We present a polynomial time algorithm for solving the interaction consistency-checking problem. We also present an algorithm for analyzing inconsistent interaction-states and identifying the inconsistent interactions. We believe that the framework described in this paper will provide the underlying foundations for constructing the next generation software tools for conceptual design of complex mechatronic systems. }, url = {ftp://ftp.eng.umd.edu/:/home/glue/s/k/skgupta/pub/Publication/DETC04_Xu.pdf}, author = {Xu,C. and Gupta,S.K.} } @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} } @book {18895, title = {Automated Planning: Theory and Practice}, year = {2004}, month = {2004/05/03/}, publisher = {Elsevier}, organization = {Elsevier}, abstract = {Automated planning technology now plays a significant role in a variety of demanding applications, ranging from controlling space vehicles and robots to playing the game of bridge. These real-world applications create new opportunities for synergy between theory and practice: observing what works well in practice leads to better theories of planning, and better theories lead to better performance of practical applications. Automated Planning mirrors this dialogue by offering a comprehensive, up-to-date resource on both the theory and practice of automated planning. The book goes well beyond classical planning, to include temporal planning, resource scheduling, planning under uncertainty, and modern techniques for plan generation, such as task decomposition, propositional satisfiability, constraint satisfaction, and model checking. The authors combine over 30 years experience in planning research and development to offer an invaluable text to researchers, professionals, and graduate students. *Comprehensively explains paradigms for automated planning. *Provides a thorough understanding of theory and planning practice, and how they relate to each other. *Presents case studies of applications in space, robotics, CAD/CAM, process control, emergency operations, and games.*Provides a thorough understanding of AI planning theory and practice, and how they relate to each other. *Covers all the contemporary topics of planning, as well as important practical applications of planning, such as model checking and game playing. *Presents case studies and applications in planning engineering, space, robotics, CAD/CAM, process control, emergency operations, and games.*Provides lecture notes, examples of programming assignments, pointers to downloadable planning systems and related information online.}, keywords = {Business \& Economics / Management, Computers / Intelligence (AI) \& Semantics, Production planning, Production planning/ Data processing, Technology \& Engineering / Robotics}, isbn = {9781558608566}, author = {Ghallab,Malik and Nau, Dana S. and Traverso,Paolo} } @article {13508, title = {Automatic recognition of spontaneous speech for access to multilingual oral history archives}, journal = {IEEE Transactions on Speech and Audio Processing, Special Issue on Spontaneous Speech Processing}, volume = {12}, year = {2004}, month = {2004/07//}, pages = {420 - 435}, abstract = {The MALACH project has the goal of developing the technologies needed to facilitate access to large collections of spontaneous speech. Its aim is to dramatically improve the state of the art in key Automatic Speech Recognition (ASR), Natural Language Processing (NLP) technologies for use in large-scale retrieval systems. The project leverages a unique collection of oral history interviews with survivors of the Holocaust that has been assembled and extensively annotated by the Survivors of the Shoah Visual History Foundation. This paper describes the collection, 116,000 hours of interviews in 32 languages, and the way in which system requirements have been discerned through user studies. It discusses ASR methods for very difficult speech (heavily accented, emotional, and elderly spontaneous speech), including transcription to create training data and methods for language modeling and speaker adaptation. Results are presented for for English and Czech. NLP results are presented for named entity tagging, topic segmentation, and supervised topic classification, and the architecture of an integrated search system that uses these results is described.}, author = {Byrne,W. and David Doermann and Franz,M. and Gustman,S. and Hajic,J. and Oard, Douglas and Picheny,M. and Psutka,J. and Ramabhadran,B.} } @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} } @article {14043, title = {Capture and recreation of higher order 3d sound fields via reciprocity}, journal = {International Conference on Audio Display}, year = {2004}, month = {2004///}, abstract = {We propose a unified and simple approach for capturing andrecreating 3D sound fields by exploring the reciprocity prin- ciple that is satisfied between the two processes. Our ap- proach makes the system easy to build, and practical. Us- ing this approach, we can capture the 3D sound field by a spherical microphone array and recreate it using a spheri- cal loudspeaker array, and ensure that the recreated sound field matches the recorded field up to a high order of spheri- cal harmonics. A design example and simulation results are presented. For some regular or semi-regular microphone layouts, we design an efficient parallel implementation of the multi-directional spherical beamformer by using the ro- tational symmetries of the beampattern and of the spherical microphone array. This can be implemented in either soft- ware or hardware. A simple design example is presented to demonstrate the idea. It can be easily adapted for other regular or semi-regular layouts of microphones. }, author = {Li,Z. and Duraiswami, Ramani and Gumerov, Nail A.} } @conference {12716, title = {Contour-based 3D Face Modeling from a Monocular Video}, booktitle = {Proceedings of the British Machine Vision Conference}, year = {2004}, month = {2004///}, pages = {39.1-39.10 - 39.1-39.10}, publisher = {British Machine Vision Association}, organization = {British Machine Vision Association}, abstract = {In this paper, we present a novel 3D face modeling approach from a monoc-ular video captured using a conventional camera. The proposed algorithm relies on matching a generic 3D face model to the outer contours of the face to be modeled and a few of its internal features. At the first stage of the method, we estimate the head pose by comparing the edges extracted from video frames, with the contours extracted from a generic face model. Next, the generic face model is adapted to the actual 3D face by global and local deformations. An affine model is used for global deformation. The 3D model is locally deformed by computing the optimal perturbations of a sparse set of control points using a stochastic search optimization method. The deforma- tions are integrated over a set of poses in the video sequence, leading to an accurate 3D model. }, isbn = {1-901725-25-1}, doi = {10.5244/C.18.39}, url = {http://www.bmva.org/bmvc/2004/papers/paper_136.html}, author = {Gupta, H. and Roy Chowdhury, A.K. and Chellapa, Rama} } @article {18825, title = {Cutter path generation for 2.5D milling by combining multiple different cutter path patterns}, journal = {International Journal of Production Research}, volume = {42}, year = {2004}, month = {2004///}, pages = {2141 - 2161}, abstract = {Different cutter path patterns have been shown to be efficient for different types of pocket geometries. However, for certain types of complex pockets, no single type of pattern produces efficient cutter paths throughout the pocket. In this paper, different cutter path patterns are systematically analysed, and several existing heuristics for selecting cutter path patterns are discussed. Based on observations, a new cutter path generation algorithm is described in this paper. This algorithm generates a cutter path by using different patterns in different regions of the geometry and seamlessly morphing them together. In case of complex pockets, it produces solutions superior to those generated by any single pattern.}, isbn = {0020-7543}, doi = {10.1080/00207540310001652879}, url = {http://www.tandfonline.com/doi/abs/10.1080/00207540310001652879}, author = {Yao,Zhiyang and Gupta, Satyandra K.} } @conference {18190, title = {Data hiding in curves for collusion-resistant digital fingerprinting}, booktitle = {Image Processing, 2004. ICIP {\textquoteright}04. 2004 International Conference on}, volume = {1}, year = {2004}, month = {2004/10//}, pages = {51 - 54 Vol. 1 - 51 - 54 Vol. 1}, abstract = {This paper presents a new data hiding method for curves. The proposed algorithm parameterizes a curve using the B-spline model and adds a spread spectrum sequence in the coordinates of the B-spline control points. We demonstrate through experiments the robustness of the proposed data hiding algorithm against printing-and-scanning and collusions, and show its feasibility for collusion-resistant fingerprinting of topographic maps as well as writings/drawings from pen-based input devices.}, keywords = {(mathematics);, B-spline, coding;, collusion-resistant, CONTROL, data, devices;, digital, document, encapsulation;, extraction;, feature, fingerprinting;, hiding;, image, INPUT, maps;, model;, pen-based, points;, printing-and-scanning, processing;, robustness;, sequence;, spectrum, splines, spread, topographic, watermarking;}, doi = {10.1109/ICIP.2004.1418687}, author = {Gou,Hongmei and M. Wu} } @article {15240, title = {Data migration on parallel disks}, journal = {Algorithms{\textendash}ESA 2004}, year = {2004}, month = {2004///}, pages = {689 - 701}, abstract = {Our work is motivated by the problem of managing data on storage devices, typically a set of disks. Such storage servers are used as web servers or multimedia servers, for handling high demand for data. As the system is running, it needs to dynamically respond to changes in demand for different data items. There are known algorithms for mapping demand to a layout. When the demand changes, a new layout is computed. In this work we study the data migration problem, which arises when we need to quickly change one layout to another. This problem has been studied earlier when for each disk the new layout has been prescribed. However, to apply these algorithms effectively, we identify another problem that we refer to as the correspondence problem, whose solution has a significant impact on the solution for the data migration problem. We study algorithms for the data migration problem in more detail and identify variations of the basic algorithm that seem to improve performance in practice, even though some of the variations have poor worst case behavior.}, doi = {10.1007/978-3-540-30140-0_61}, author = {Golubchik,L. and Khuller, Samir and Kim,Y. A and Shargorodskaya,S. and Wan,Y. C} } @article {14481, title = {Data sciences technology for homeland security information management and knowledge discovery}, journal = {Report of the DHS Workshop Data Sciences, Jointly Released by Sandia National Laboratories and Lawrence Livermore National Laboratory, Alexandria, Va}, year = {2004}, month = {2004///}, author = {Kolda,T. and Brown,D and Corones,J. and Critchlow,T. and Eliassi-Rad,T. and Getoor, Lise and Hendrickson,B. and Kumar, V. and Lambert,D. and Matarazzo,C.} } @conference {13256, title = {A data structure for non-manifold simplicial d-complexes}, booktitle = {Proceedings of the 2004 Eurographics/ACM SIGGRAPH symposium on Geometry processing}, series = {SGP {\textquoteright}04}, year = {2004}, month = {2004///}, pages = {83 - 92}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {We propose a data structure for d-dimensional simplicial complexes, that we call the Simplified Incidence Graph (SIG). The simplified incidence graph encodes all simplices of a simplicial complex together with a set of boundary and partial co-boundary topological relations. It is a dimension-independent data structure in the sense that it can represent objects of arbitrary dimensions. It scales well to the manifold case, i.e. it exhibits a small overhead when applied to simplicial complexes with a manifold domain, Here, we present efficient navigation algorithms for retrieving all topological relations from a SIG, and an algorithm for generating a SIG from a representation of the complex as an incidence graph. Finally, we compare the simplified incidence graph with the incidence graph, with a widely-used data structure for d-dimensional pseudo-manifold simplicial complexes, and with two data structures specific for two-and three-dimensional simplicial complexes.}, isbn = {3-905673-13-4}, doi = {10.1145/1057432.1057444}, url = {http://doi.acm.org/10.1145/1057432.1057444}, author = {De Floriani, Leila and Greenfieldboyce,David and Hui,Annie} } @book {15668, title = {Data Structures and Algorithms in C++}, year = {2004}, month = {2004///}, publisher = {John Wiley \& Sons Inc}, organization = {John Wiley \& Sons Inc}, author = {Goodrich,M. T and Tamassia,R. and Mount, Dave} } @article {14414, title = {Deduplication and group detection using links}, journal = {KDD workshop on link analysis and group detection}, year = {2004}, month = {2004///}, abstract = {Clustering is a fundamental problem in data mining. Tradi-tionally, clustering is done based on the similarity of the at- tribute values of the entities to be clustered. More recently, there has been greater interest in clustering relational and structured data. Often times this data is best described as a graph, in which there are both entities, described by a collec- tion of attributes, and links between entities, representing the relations between them. Clustering in these scenarios becomes more complex, as we should also take into account the similarity of the entity links when we are clustering. We propose novel distance measures for clustering linked data, and show how they can be used to solve two important data mining tasks, entity deduplication and group discovery. }, author = {Bhattacharya,I. and Getoor, Lise} } @book {16304, title = {Detecting and correcting a failure sequence in a computer system before a failure occurs}, year = {2004}, month = {2004/02//}, publisher = {Google Patents}, organization = {Google Patents}, author = {Gross,K. C and Votta,L. G. and Porter, Adam} } @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 {14044, title = {Efficient computation of acoustical scattering from N spheres via the fast multipole method accelerated flexible generalized minimal residual method}, journal = {The Journal of the Acoustical Society of America}, volume = {116}, year = {2004}, month = {2004///}, pages = {2528 - 2528}, abstract = {Many problems require computation of acoustic fields in systems consisting of a large number of scatterers, which can be modeled as spheres (or enclosed by them). These spheres can have different sizes, can be arbitrarily distributed in three dimensional space, and can have different surface impedance. Solution of this problem via direct T-matrix approach [Gumerov and Duraiswami, J. Acoust. Soc. Am., 112, 2688{\textendash}2701 (2002)] is practical only for relatively low number of scatterers, N, since its computational complexity grows as O(N3). We developed and implemented an efficient computational technique, based on an iterative solver employing a flexible generalized minimal residual method with a right preconditioner. Matrix-vector multiplications involving a large system matrix and the preconditioner are sped up with the aid of the multilevel fast multipole method. We tested the accuracy, convergence and complexity of the method on example problems with N\~{}104 (millions of unknowns). These tests showed that the method is accurate for a range of frequencies, and experimentally scales as O(N1.25). The method has substantial advantages in speed and convergence compared to the reflection method reported earlier [Gumerov and Duraiswami, J. Acoust. Soc. Am., 113, 2334 (2002)]. [Work supported NSF Awards 0086075 and 0219681, which are gratefully acknowledged.]}, url = {http://link.aip.org/link/?JAS/116/2528/4}, author = {Gumerov, Nail A. and Duraiswami, Ramani} } @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.} } @conference {18759, title = {Enhancement of mechanical engineering curriculum to introduce manufacturing techniques and principles for bio-inspired product development}, year = {2004}, month = {2004///}, pages = {1 - 6}, url = {ftp://ftp.eng.umd.edu/:/home/glue/s/k/skgupta/backup/pub/Publication/IMECE04_Bruck.pdf}, author = {Bruck,H. A. and Gershon,A. L. and Gupta,S.K.} } @conference {14694, title = {Experience with safe manual memory-management in cyclone}, booktitle = {Proceedings of the 4th international symposium on Memory management}, series = {ISMM {\textquoteright}04}, year = {2004}, month = {2004///}, pages = {73 - 84}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {The goal of the Cyclone project is to investigate type safety for low-level languages such as C. Our most difficult challenge has been providing programmers control over memory management while retaining type safety. This paper reports on our experience trying to integrate and effectively use two previously proposed, type-safe memory management mechanisms: statically-scoped regions and unique pointers. We found that these typing mechanisms can be combined to build alternative memory-management abstractions, such as reference counted objects and arenas with dynamic lifetimes, and thus provide a flexible basis. Our experience---porting C programs and building new applications for resource-constrained systems---confirms that experts can use these features to improve memory footprint and sometimes to improve throughput when used instead of, or in combination with, conservative garbage collection.}, keywords = {cyclone, Memory management, memory safety, regions, unique pointers}, isbn = {1-58113-945-4}, doi = {10.1145/1029873.1029883}, url = {http://doi.acm.org/10.1145/1029873.1029883}, author = {Hicks, Michael W. and Morrisett,Greg and Grossman,Dan and Jim,Trevor} } @article {14037, title = {FAST ALGORITHMS TO COMPUTE MATRIX-VECTOR PRODUCTS FOR PASCAL MATRICES}, journal = {Technical Reports from UMIACS UMIACS-TR-2004-08}, year = {2004}, month = {2004/03/25/}, abstract = {The Pascal matrix arises in a number of applications. We present a few waysto decompose the Pascal matrices of size $n \times n$ into products of matrices with structure. Based on these decompositions, we propose fast algorithms to compute the product of a Pascal matrix and a vector with omplexity $O(n\log n)$. We also present a strategy to stabilize the proposed algorithms. Finally, we also present some interesting properties of the Pascal matrices that help us to compute fast the product of the inverse of a Pascal matrix and a vector, and fast algorithms for generalized Pascal Matrices. UMIACS-TR-2004-08 }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/1338}, author = {Tang,Zhihui and Duraiswami, Ramani and Gumerov, Nail A.} } @book {14045, title = {Fast Multipole Methods For The Helmholtz Equation In Three Dimensions}, year = {2004}, month = {2004///}, publisher = {Elsevier}, organization = {Elsevier}, abstract = {This volume in the Elsevier Series in Electromagnetism presents a detailed, in-depth and self-contained treatment of the Fast Multipole Method and its applications to the solution of the Helmholtz equation in three dimensions. The Fast Multipole Method was pioneered by Rokhlin and Greengard in 1987 and has enjoyed a dramatic development and recognition during the past two decades. This method has been described as one of the best 10 algorithms of the 20th century. Thus, it is becoming increasingly important to give a detailed exposition of the Fast Multipole Method that will be accessible to a broad audience of researchers. This is exactly what the authors of this book have accomplished. For this reason, it will be a valuable reference for a broad audience of engineers, physicists and applied mathematicians.The Only book that provides comprehensive coverage of this topic in one location.Presents a review of the basic theory of expansions of the Helmholtz equation solutionsComprehensive description of both mathematical and practical aspects of the fast multipole method and it{\textquoteright}s applications to issues described by the Helmholtz equation}, keywords = {Electronic books, Helmholtz equation, Mathematics / Mathematical Analysis, Science / Physics / Electromagnetism, Science / Physics / Magnetism, Technology \& Engineering / Acoustics \& Sound, Technology \& Engineering / Electrical}, isbn = {9780080443713}, author = {Gumerov, Nail A. and Duraiswami, Ramani} } @conference {13220, title = {Flexible layout and optimal cancellation of the orthonormality error for spherical microphone arrays}, booktitle = {Acoustics, Speech, and Signal Processing, 2004. Proceedings. (ICASSP {\textquoteright}04). IEEE International Conference on}, volume = {4}, year = {2004}, month = {2004/05//}, pages = {iv-41 - iv-44 vol.4 - iv-41 - iv-44 vol.4}, abstract = {This paper describes an approach to achieving a flexible layout of microphones on the surface of a spherical microphone array for beamforming. Our approach achieves orthonormality of spherical harmonics to higher order for relatively distributed layouts. This gives great flexibility in microphone layout on the spherical surface. One direct advantage is that it makes it much easier to build a real world system, such as those with cable outlets and a mounting base, with minimal effects on the performance. Simulation results are presented.}, keywords = {array, audio, base;, beamforming;, cable, cancellation, correction;, error, flexible, harmonics;, higher, layout;, microphone, microphones;, mounting, optimization;, order, orthonormality, outlets;, processing;, signal, spherical, surface;}, doi = {10.1109/ICASSP.2004.1326758}, author = {Zhiyun Li and Duraiswami, Ramani and Grassi,E. and Davis, Larry S.} } @conference {18778, title = {A Framework for Conceptual Design of Multiple Interaction-State Mechatronic Systems}, year = {2004}, month = {2004///}, address = {Lausanne, Switzerland}, abstract = {Increasingly, complex mechatronic systems are beingdesigned to have higher levels of autonomy and intelligence. This requires them to operate in multiple interaction-states. To facilitate computer- aided conceptual design of complex mechatronic systems, this paper provides a framework for modeling design concepts behind mechatronic systems with multiple interaction-states. We introduce the primitives and operators used in the modeling framework, and illustrate the modeling process by an example. }, url = {http://www.glue.umd.edu/~skgupta/Publication/TMCE04_Xu.pdf}, author = {Gupta,S.K. and Xu,C. and Yao,Z.} } @article {18843, title = {Geometric algorithms for automated design of multi-piece permanent molds}, journal = {Computer-Aided Design}, volume = {36}, year = {2004}, month = {2004/03//}, pages = {241 - 260}, abstract = {Multi-piece molds, which consist of more than two mold pieces, are capable of producing very complex parts{\textemdash}parts that cannot be produced by the traditional molds. The tooling cost is also low for multi-piece molds, which makes it a candidate for pre-production prototyping and bridge tooling. However, designing multi-piece molds is a time-consuming task. This article describes geometric algorithms for automated design of multi-piece molds. A multi-piece mold design algorithm has been developed to automate several important mold-design steps: finding parting directions, locating parting lines, creating parting surfaces, and constructing mold pieces. This algorithm constructs mold pieces based on global accessibility analysis results of the part and therefore guarantees the disassembly of the mold pieces. A software system has been developed, which has been successfully tested on several complex industrial parts.}, keywords = {mold design, Multi-piece molds, spatial partitioning}, isbn = {0010-4485}, doi = {10.1016/S0010-4485(03)00107-6}, url = {http://www.sciencedirect.com/science/article/pii/S0010448503001076}, author = {Priyadarshi,Alok K. and Gupta, Satyandra K.} } @article {18844, title = {Geometric algorithms for automated design of rotary-platen multi-shot molds}, journal = {Computer-Aided Design}, volume = {36}, year = {2004}, month = {2004/10//}, pages = {1171 - 1187}, abstract = {This paper describes algorithms for automated design of rotary-platen type of multi-shot molds for manufacturing multi-material objects. The approach behind our algorithms works in the following manner. First, we classify the given multi-material object into several basic types based on the relationships among different components in the object. For every basic type, we find a molding sequence based on the precedence constraints resulting due to accessibility and disassembly requirements. Then, starting from the last mold stage, we generate the mold pieces for every mold stage. We expect that algorithms described in this paper will provide the necessary foundations for automating the design of rotary-platen molds.}, keywords = {geometric reasoning, mold design, Multi-shot molds}, isbn = {0010-4485}, doi = {10.1016/j.cad.2003.11.003}, url = {http://www.sciencedirect.com/science/article/pii/S0010448503002331}, author = {Li,Xuejun and Gupta, Satyandra K.} } @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.} } @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.} } @conference {12100, title = {High-performance MAC for high-capacity wireless LANs}, booktitle = {13th International Conference on Computer Communications and Networks, 2004. ICCCN 2004. Proceedings}, year = {2004}, month = {2004/10/11/13}, pages = {167 - 172}, publisher = {IEEE}, organization = {IEEE}, abstract = {The next-generation wireless technologies, e.g., 802.11n and 802.15.3a, offer a physical-layer speed at least an-order-of-magnitude higher than the current standards. However, direct application of current MACs leads to high protocol overhead and significant throughput degradation. In this paper, we propose ADCA, a high-performance MAC that works with high-capacity physical layer. ADCA exploits two ideas of adaptive batch transmission and opportunistic selection of high-rate hosts to simultaneously reduce the overhead and improve the aggregate throughput. It opportunistically favors high-rate hosts by providing higher access probability and more access time, while ensuring each low-rate host certain minimum amount of channel access time. Simulations show that the ADCA design increases the throughput by 112\% and reduces the average delay by 55\% compared with the legacy DCF. It delivers more than 100 Mbps MAC-layer throughput as compared with 35 Mbps offered by the legacy MAC}, keywords = {35 Mbit/s, access protocols, Aggregates, Bandwidth, batch transmission, Computer science, Educational institutions, high-capacity wireless LAN, high-performance MAC, Laboratories, Local area networks, Media Access Protocol, opportunistic selection, Physical layer, probability, Throughput, Wireless LAN}, isbn = {0-7803-8814-3}, doi = {10.1109/ICCCN.2004.1401615}, author = {Yuan Yuan and Daqing Gu and Arbaugh, William A. and Jinyun Zhang} } @inbook {13787, title = {iCLEF 2003 at Maryland: Translation Selection and Document Selection}, booktitle = {Comparative Evaluation of Multilingual Information Access SystemsComparative Evaluation of Multilingual Information Access Systems}, series = {Lecture Notes in Computer Science}, volume = {3237}, year = {2004}, month = {2004///}, pages = {231 - 265}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {Maryland performed two sets of experiments for the 2003 Cross-Language Evaluation Forum{\textquoteright}s interactive track, one focused on interactive selection of appropriate translations for query terms, the second focused on interactive selection of relevant documents. Translation selection was supported using possible synonyms discovered through back translation and two techniques for generating KeyWord In Context (KWIC) examples of usage. The results indicate that searchers typically achieved a similar search effectiveness using fewer query iterations when interactive translation selection was available. For document selection, a complete extract of the first 40 words of each news story was compared to a compressed extract generated using an automated parse-and-trim approach that approximates one way in which people can produce headlines. The results indicate that compressed {\textquotedblleft}headlines{\textquotedblright} result in faster assessment, but with a 20\% relative reduction in the F α = 0.8 search effectiveness measure.}, isbn = {978-3-540-24017-4}, url = {http://dx.doi.org/10.1007/978-3-540-30222-3_42}, author = {Dorr, Bonnie J and He,Daqing and Luo,Jun and Oard, Douglas and Schwartz,Richard and Wang,Jianqiang and Zajic, David}, editor = {Peters,Carol and Gonzalo,Julio and Braschler,Martin and Kluck,Michael} } @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 {13227, title = {Improved Multiuser Detectors Employing Genetic Algorithms in a Space-Time Block Coded System, Yinggang Du and Kam Tai Chan}, journal = {Signal}, volume = {2004}, year = {2004}, month = {2004///}, pages = {640 - 648}, author = {Self-Similarity,G.R.U.I. and BenAbdelkader,C. and Cutler,R.G. and Davis, Larry S. and Local,F.R.U. and Global Features,J.H. and Yuen, P.C. and Lai,JH and Li,C.} } @conference {13791, title = {Inducing a semantic frame lexicon from WordNet data}, booktitle = {Proceedings of the 2nd Workshop on Text Meaning and Interpretation}, series = {TextMean {\textquoteright}04}, year = {2004}, month = {2004///}, pages = {65 - 72}, publisher = {Association for Computational Linguistics}, organization = {Association for Computational Linguistics}, address = {Stroudsburg, PA, USA}, abstract = {This paper presents SemFrame, a system that automatically induces the names and internal structures of semantic frames. After SemFrame identifies sets of frame-evoking verb synsets, the conceptual density of nodes in the WordNet network for corresponding nouns and noun synsets is computed and analyzed. Conceptually dense nodes are candidates for frame names and frame slots. Ca. 76\% of the frame names and 87\% of the frame slots generated by SemFrame are rated adequate by human judges.}, url = {http://dl.acm.org/citation.cfm?id=1628275.1628284}, author = {Green,Rebecca and Dorr, Bonnie J} } @conference {13792, title = {Inducing frame semantic verb classes from WordNet and LDOCE}, booktitle = {Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics}, year = {2004}, month = {2004///}, pages = {375 - 375}, abstract = {This paper presents SemFrame, a systemthat induces frame semantic verb classes from WordNet and LDOCE. Semantic frames are thought to have significant potential in resolving the paraphrase problem challenging many language- based applications. When compared to the handcrafted FrameNet, SemFrame achieves its best recall-precision balance with 83.2\% recall (based on SemFrame{\textquoteright}s coverage of FrameNet frames) and 73.8\% precision (based on SemFrame verbs{\textquoteright} semantic relatedness to frame-evoking verbs). The next best performing semantic verb classes achieve 56.9\% recall and 55.0\% precision. }, author = {Green,R. and Dorr, Bonnie J and Resnik, Philip} } @article {14087, title = {The ingi and RIME non-LTR retrotransposons are not randomly distributed in the genome of Trypanosoma brucei}, journal = {Molecular biology and evolution}, volume = {21}, year = {2004}, month = {2004///}, pages = {520 - 520}, author = {Bringaud,F. and Biteau,N. and Zuiderwijk,E. and Berriman,M. and El-Sayed, Najib M. and Ghedin,E. and Melville,S. E. and Hall,N. and Baltz,T.} } @article {15850, title = {Interactive cross-language document selection}, journal = {information retrieval}, volume = {7}, year = {2004}, month = {2004///}, pages = {205 - 228}, author = {Oard, Douglas and Gonzalo,J. and Sanderson,M. and L{\'o}pez-Ostenero,F. and Wang,J.} } @article {14047, title = {INTERPOLATION AND RANGE EXTRAPOLATION OF HEAD RELATED TRANSFER FUNCTIONS}, journal = {IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS SPEECH AND SIGNAL PROCESSING}, volume = {4}, year = {2004}, month = {2004///}, author = {Duraiswami, Ramani and Zotkin,Dmitry N and Gumerov, Nail A.} } @conference {14464, title = {Iterative record linkage for cleaning and integration}, booktitle = {Proceedings of the 9th ACM SIGMOD workshop on Research issues in data mining and knowledge discovery}, series = {DMKD {\textquoteright}04}, year = {2004}, month = {2004///}, pages = {11 - 18}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Record linkage, the problem of determining when two records refer to the same entity, has applications for both data cleaning (deduplication) and for integrating data from multiple sources. Traditional approaches use a similarity measure that compares tuples{\textquoteright} attribute values; tuples with similarity scores above a certain threshold are declared to be matches. While this method can perform quite well in many domains, particularly domains where there is not a large amount of noise in the data, in some domains looking only at tuple values is not enough. By also examining the context of the tuple, i.e. the other tuples to which it is linked, we can come up with a more accurate linkage decision. But this additional accuracy comes at a price. In order to correctly find all duplicates, we may need to make multiple passes over the data; as linkages are discovered, they may in turn allow us to discover additional linkages. We present results that illustrate the power and feasibility of making use of join information when comparing records.}, keywords = {clustering, deduplication, distance measure, record linkage}, isbn = {1-58113-908-X}, doi = {10.1145/1008694.1008697}, url = {http://doi.acm.org/10.1145/1008694.1008697}, author = {Bhattacharya,Indrajit and Getoor, Lise} } @inbook {15766, title = {Left-Brain/Right-Brain Multi-Document Summarization}, booktitle = {DUC 04 Conference ProceedingsDUC 04 Conference Proceedings}, year = {2004}, month = {2004///}, publisher = {U.S. National Inst. of Standards and Technology}, organization = {U.S. National Inst. of Standards and Technology}, url = {\tt http://duc.nist.gov/}, author = {Conroy,John M. and Schlesinger,Judith D. and Goldstein,Jade and O{\textquoteright}Leary, Dianne P.} } @conference {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 {16334, title = {Measuring HPC productivity}, journal = {International Journal of High Performance Computing Applications}, volume = {18}, year = {2004}, month = {2004///}, pages = {459 - 473}, author = {Faulk,S. and Gustafson,J. and Johnson,P. and Porter, Adam and Tichy,W. and Votta,L.} } @article {13232, title = {Mining tool for surveillance video}, journal = {SPIE 16th International Symposium on Electronic Imaging, Storage and Retrieval Methods and Applications for Multimedia}, volume = {5307}, year = {2004}, month = {2004///}, pages = {259 - 270}, abstract = {This paper describes a system for the mining of surveillance video. Our main contributions are: providing ahigh level query language for submitting queries about spatial and temporal relations of background regions and moving entities, and about human activities; providing a compiler to map high level queries into a set of novel Petri net filters that utilize computer vision algorithms to answer components of the queries; and providing a powerful graphical interface where users have the ability to formulate the query visually. }, author = {Ghanem,N.M. and David Doermann and Davis, Larry S. and DeMenthon,D.} } @conference {13597, title = {Mining Tools for Surveillance Video}, booktitle = {Proceedings in SPIE 16th International Symposium on Electronic Imaging}, year = {2004}, month = {2004/01//}, pages = {5307 259-270 - 5307 259-270}, author = {Ghanem,N. and David Doermann and Davis, Larry S. and DeMenthon,D.} } @conference {13902, title = {Mixing ideas: a new technique for working with young children as design partners}, booktitle = {Proceedings of the 2004 conference on Interaction design and children: building a community}, year = {2004}, month = {2004///}, pages = {35 - 42}, author = {Guha,M.L. and Druin, Allison and Chipman,G. and Fails,J. A and Simms,S. and Farber,A.} } @article {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.} } @conference {13388, title = {Model-driven data acquisition in sensor networks}, booktitle = {Proceedings of the Thirtieth international conference on Very large data bases - Volume 30}, series = {VLDB {\textquoteright}04}, year = {2004}, month = {2004///}, pages = {588 - 599}, publisher = {VLDB Endowment}, organization = {VLDB Endowment}, abstract = {Declarative queries are proving to be an attractive paradigm for ineracting with networks of wireless sensors. The metaphor that "the sensornet is a database" is problematic, however, because sensors do not exhaustively represent the data in the real world. In order to map the raw sensor readings onto physical reality, a model of that reality is required to complement the readings. In this paper, we enrich interactive sensor querying with statistical modeling techniques. We demonstrate that such models can help provide answers that are both more meaningful, and, by introducing approximations with probabilistic confidences, significantly more efficient to compute in both time and energy. Utilizing the combination of a model and live data acquisition raises the challenging optimization problem of selecting the best sensor readings to acquire, balancing the increase in the confidence of our answer against the communication and data acquisition costs in the network. We describe an exponential time algorithm for finding the optimal solution to this optimization problem, and a polynomial-time heuristic for identifying solutions that perform well in practice. We evaluate our approach on several real-world sensor-network data sets, taking into account the real measured data and communication quality, demonstrating that our model-based approach provides a high-fidelity representation of the real phenomena and leads to significant performance gains versus traditional data acquisition techniques.}, isbn = {0-12-088469-0}, url = {http://dl.acm.org/citation.cfm?id=1316689.1316741}, author = {Deshpande, Amol and Guestrin,Carlos and Madden,Samuel R. and Hellerstein,Joseph M. and Wei Hong} } @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} } @conference {13209, title = {Multi-level fast multipole method for thin plate spline evaluation}, booktitle = {Image Processing, 2004. ICIP {\textquoteright}04. 2004 International Conference on}, volume = {3}, year = {2004}, month = {2004/10//}, pages = {1683 - 1686 Vol. 3 - 1683 - 1686 Vol. 3}, abstract = {Image registration is an important problem in image processing and computer vision. Much recent work in image registration is on matching non-rigid deformations. Thin plate splines are an effective image registration method when the deformation between two images can be modeled as the bending of a thin metal plate on point constraints such that the topology is preserved (non-rigid deformation). However, because evaluating the computed TPS model at all the image pixels is computationally expensive, we need to speed it up. We introduce the use of multi-level fast muitipole method (MLFMM) for this purpose. Our contribution lies in the presentation of a clear and concise MLFMM framework for TPS, which will be useful for future application developments. The achieved speedup using MLFMM is an improvement from O(N2) to O(N log N). We show that the fast evaluation outperforms the brute force method while maintaining acceptable error bound.}, keywords = {(mathematics);, Computer, deformation;, evaluation;, fast, image, MATCHING, matching;, metal, method;, multilevel, multipole, nonrigid, pixel;, plate, plate;, processing;, registration;, resolution;, spline, splines, thin, vision;}, doi = {10.1109/ICIP.2004.1421395}, author = {Zandifar,A. and Lim,S. and Duraiswami, Ramani and Gumerov, Nail A. and Davis, Larry S.} } @conference {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 {14590, title = {A Note on Efficient Computation of Haplotypes via Perfect Phylogeny}, journal = {Journal of Computational Biology}, volume = {11}, year = {2004}, month = {2004/10//}, pages = {858 - 866}, abstract = {The problem of inferring haplotype phase from a population of genotypes has received a lot of attention recently. This is partly due to the observation that there are many regions on human genomic DNA where genetic recombination is rare (Helmuth, 2001; Daly et al., 2001; Stephens et al., 2001; Friss et al., 2001). A Haplotype Map project has been announced by NIH to identify and characterize populations in terms of these haplotypes. Recently, Gusfield introduced the perfect phylogeny haplotyping problem, as an algorithmic implication of the no-recombination in long blocks observation, together with the standard population-genetic assumption of infinite sites. Gusfield{\textquoteright}s solution based on matroid theory was followed by direct θ(nm2 ) solutions that use simpler techniques (Bafna et al., 2003; Eskin et al., 2003), and also bound the number of solutions to the PPH problem. In this short note, we address two questions that were left open. First, can the algorithms of Bafna et al. (2003) and Eskin et al. (2003) be sped-up to O(nm + m2 ) time, which would imply an O(nm) time-bound for the PPH problem? Second, if there are multiple solutions, can we find one that is most parsimonious in terms of the number of distinct haplotypes.We give reductions that suggests that the answer to both questions is "no." For the first problem, we show that computing the output of the first step (in either method) is equivalent to Boolean matrix multiplication. Therefore, the best bound we can presently achieve is O(nmω{\textendash}1), where ω <= 2.52 is the exponent of matrix multiplication. Thus, any linear time solution to the PPH problem likely requires a different approach. For the second problem of computing a PPH solution that minimizes the number of distinct haplotypes, we show that the problem is NP-hard using a reduction from Vertex Cover (Garey and Johnson, 1979).}, isbn = {1066-5277, 1557-8666}, doi = {10.1089/cmb.2004.11.858}, url = {http://www.liebertonline.com/doi/abs/10.1089/cmb.2004.11.858}, author = {Bafna,Vineet and Gusfield,Dan and Hannenhalli, Sridhar and Yooseph,Shibu} } @article {12939, title = {Occurrence and distribution of Vibrio cholerae in the coastal environment of Peru}, journal = {Environmental Microbiology}, volume = {6}, year = {2004}, month = {2004/07/01/}, pages = {699 - 706}, abstract = {The occurrence and distribution of Vibrio cholerae in sea water and plankton along the coast of Peru were studied from October 1997 to June 2000, and included the 1997{\textendash}98 El Ni{\~n}o event. Samples were collected at four sites in coastal waters off Peru at monthly intervals. Of 178 samples collected and tested, V. cholerae O1 was cultured from 10 (5.6\%) samples, and V. cholerae O1 was detected by direct fluorescent antibody assay in 26 out of 159 samples tested (16.4\%). Based on the number of cholera cases reported in Peru from 1997 to 2000, a significant correlation was observed between cholera incidence and elevated sea surface temperature (SST) along the coast of Peru (P~<~0.001). From the results of this study, coastal sea water and zooplankton are concluded to be a reservoir for V. cholerae in Peru. The climate{\textendash}cholera relationship observed for the 1997{\textendash}98 El Ni{\~n}o year suggests that an early warning system for cholera risk can be established for Peru and neighbouring Latin American countries.}, isbn = {1462-2920}, doi = {10.1111/j.1462-2920.2004.00601.x}, url = {http://onlinelibrary.wiley.com/doi/10.1111/j.1462-2920.2004.00601.x/abstract?userIsAuthenticated=false\&deniedAccessCustomisedMessage=}, author = {Gil,Ana I. and Louis,Val{\'e}rie R. and Rivera,Irma N. G. and Lipp,Erin and Huq,Anwar and Lanata,Claudio F. and Taylor,David N. and Russek-Cohen,Estelle and Choopun,Nipa and Sack,R. Bradley and Rita R Colwell} } @article {15498, title = {Preserving distributed systems critical properties: a model-driven approach}, journal = {Software, IEEE}, volume = {21}, year = {2004}, month = {2004///}, pages = {32 - 40}, abstract = {The need for creating predictability in distributed systems is most often specified in terms of quality-of-service (QoS) requirements, which help define the acceptable levels of dependability with which capabilities such as processing capacity, data throughput, or service availability reach users. For longer-term properties such as scalability, maintainability, adaptability, and system security, we can similarly use persistent software attributes (PSAs) to specify how and to what degree such properties must remain intact as a network expands and evolves over time. The Skoll distributed continuous software quality assurance process helps to identify viable system and software configurations for meeting stringent QOS and PSA requirements by coordinating the use of distributed computing resources. The authors tested their process using the large, rapidly evolving ACE+TAO middleware suite.}, keywords = {configuration management, formal verification, Middleware, middleware suite, model-driven approach, persistent software attributes, QoS requirements, Quality assurance, quality of service, quality-of-service, Skoll distributed computing resources, software configuration, Software maintenance, Software quality, software quality assurance process, system dependability}, isbn = {0740-7459}, doi = {10.1109/MS.2004.50}, author = {Yilmaz,C. and Memon, Atif M. and Porter, Adam and Krishna,A. S and Schmidt,D. C and Gokhale,A. and Natarajan,B.} } @article {15794, title = {Reconstructing Images of Bar Codes for Construction Site Object Recognition}, journal = {Automation in Construction (Elsevier)}, volume = {13}, year = {2004}, month = {2004///}, pages = {21 - 35}, author = {Gilsinn,David E. and Cheok,Geraldine S. and O{\textquoteright}Leary, Dianne P.} } @article {14046, title = {Recursions for the computation of multipole translation and rotation coefficients for the 3-D Helmholtz equation}, journal = {SIAM Journal on Scientific Computing}, volume = {25}, year = {2004}, month = {2004///}, pages = {1344 - 1381}, abstract = {We develop exact expressions for the coefficients of series representations of trans-lations and rotations of local and multipole fundamental solutions of the Helmholtz equation in spherical coordinates. These expressions are based on the derivation of recurrence relations, some of which, to our knowledge, are presented here for the first time. The symmetry and other properties of the coefficients are also examined and, based on these, efficient procedures for calculating them are presented. Our expressions are direct and do not use the Clebsch{\textendash}Gordan coefficients or the Wigner 3-j symbols, although we compare our results with methods that use these to prove their accuracy. For evaluating an Nt term truncation of the translated series (involving O(N2t) multipoles), our expressions require O(N3t) evaluations, compared to previous exact expressions that require O(N5t) operations. }, author = {Gumerov, Nail A. and Duraiswami, Ramani} } @conference {13632, title = {Representation and Recognition of Events in Surveillance Video Using Petri Nets}, booktitle = {Second IEEEWorkshop on Event Mining 2004, CVPR2004}, year = {2004}, month = {2004///}, pages = {112 - 112}, abstract = {Detection of events is an essential task in surveillance applications. This task requires finding a general event representation method and developing efficient recognition algorithms dealing with this representation. In this paper, we describe an interactive system for querying surveillance video about events. The queries may not be known in advance and have to be composed from primitive events and previously defined queries. We propose using Petri nets as both representation and recognition methods. The Petri net representation for users{\textquoteright} queries is derived automatically from simpler event nets. Recognition is then performed by tokens moving through the Petri nets.}, author = {Ghanem,N. and DeMenthon,D. and David Doermann and Davis, Larry S.} } @article {13854, title = {Semantic annotation and lexico-syntactic paraphrase}, journal = {Proceedings of the 4th International Conference on Language Resources and Evaluation (LREC) Workshop on Building Lexical Resources from Semantically Annotated Corpora}, year = {2004}, month = {2004///}, pages = {47 - 52}, abstract = {The IAMTC project (Interlingual Annotation of Multilingual Translation Corpora) is developing an interlingual representation frameworkfor annotation of parallel corpora (English paired with Arabic, French, Hindi, Japanese, Korean, and Spanish) with deep-semantic representations. In particular, we are investigating meaning equivalent paraphrases involving conversives and non-literal language use, as well as extended paraphrases involving syntax, lexicon, and grammatical features. The interlingua representation has three levels of depth. Each level is characterized by the types of meaning equivalent paraphrases that receive identical representations at that level. }, author = {Dorr, Bonnie J and Green,R. and Levin,L. and Rambow,O. and Farwell,D. and Habash,N. and Helmreich,S. and Hovy,E. and Miller,K.J. and Mitamura,T. and others} } @article {12171, title = {SlideBar: Analysis of a linear input device}, journal = {Behaviour \& Information Technology}, volume = {23}, year = {2004}, month = {2004///}, pages = {1 - 9}, author = {Chipman,L.E. and Bederson, Benjamin B. and Golbeck,J.} } @conference {13211, title = {A spherical microphone array system for traffic scene analysis}, booktitle = {Intelligent Transportation Systems, 2004. Proceedings. The 7th International IEEE Conference on}, year = {2004}, month = {2004/10//}, pages = {338 - 342}, abstract = {This paper describes a practical spherical microphone array system for traffic auditory scene capture and analysis. Our system uses 60 microphones positioned on the rigid surface of a sphere. We then propose an optimal design of a robust spherical beamformer with minimum white noise gain (WNG) of -6 dB. We test this system in a real-world traffic environment. Some preliminary simulation and experimental results are presented to demonstrate its performance. This system may also find applications in broader areas such as 3D audio, virtual environment, etc.}, keywords = {-6, 3D, analysis;, array, arrays;, audio;, auditory, beamformer;, capture;, dB;, environment;, gain;, microphone, NOISE, noise;, processing;, real, robust, scene, signal, spherical, system;, traffic, traffic;, virtual, white, World}, doi = {10.1109/ITSC.2004.1398921}, author = {Zhiyun Li and Duraiswami, Ramani and Grassi,E. and Davis, Larry S.} } @conference {18787, title = {A STEP TOWARDS AUTOMATED DESIGN OF INDEX-PLATE MULTI-SHOT MOLDS}, year = {2004}, month = {2004/04//}, address = {Lausanne, Switzerland}, abstract = {This paper describes an algorithm for automateddesign of index-plate type of multi-shot molds for manufacturing multi-material objects. This new algorithm is a significant improvement over previous mold design algorithms and it accounts for constraints associated with the index-plate molding process. Our algorithm works in the following manner. First, based on the index-plate process constraints, we determine whether the given multi-material object is moldable by index- plate process by analyzing the geometry of the object. If the object can be molded, then the molding sequence is determined. Finally, the mold pieces. We expect that the algorithm described in this paper will provide the necessary foundations for automating the design of index-plate molds and therefore will help in significantly reducing the mold manufacturing lead-time associated with this type of molds. }, url = {http://www.glue.umd.edu/~skgupta/Publication/TMCE04_Li.pdf}, author = {Li,X. and Gupta,S.K.} } @article {18763, title = {A STEP TOWARDS INTEGRATED PRODUCT/PROCESS DEVELOPMENT OF MOLDED MULTI-MATERIAL STRUCTURES}, journal = {Tools And Methods Of Competitive Engineering}, year = {2004}, month = {2004///}, abstract = {Multi-material molding is emerging as a popularmethod for making multi-material structures. In multi-material molding processes, fabrication and assembly steps are performed concurrently inside the mold. Therefore using existing knowledge on how to design molded products often results in the selection of wrong design alternatives and correcting these mistakes unnecessarily delays the product development process. To overcome this difficulty we need to develop an integrated product/process development methodology for designing molded multi-material structures. This paper presents an overview of different multi-material molding technologies and the role of manufacturing considerations in shape synthesis of molded multi- material structures. }, url = {http://terpconnect.umd.edu/~skgupta/Publication/TMCE04_Gupta.pdf}, author = {Gupta,S.K. and Fowler,G.} } @article {13231, title = {Structure of applicable surfaces from single views}, journal = {Computer Vision-ECCV 2004}, year = {2004}, month = {2004///}, pages = {482 - 496}, abstract = {The deformation of applicable surfaces such as sheets of paper satisfies the differential geometric constraints of isometry (lengths and areas are conserved) and vanishing Gaussian curvature. We show that these constraints lead to a closed set of equations that allow recovery of the full geometric structure from a single image of the surface and knowledge of its undeformed shape. We show that these partial differential equations can be reduced to the Hopf equation that arises in non-linear wave propagation, and deformations of the paper can be interpreted in terms of the characteristics of this equation. A new exact integration of these equations is developed that relates the 3-D structure of the applicable surface to an image. The solution is tested by comparison with particular exact solutions. We present results for both the forward and the inverse 3D structure recovery problem.}, author = {Gumerov, Nail A. and Zandifar,A. and Duraiswami, Ramani and Davis, Larry S.} } @article {14048, title = {TM Electromagnetic Scattering from 2D Multilayered Dielectric Bodies-Numerical Solution}, journal = {Applied Computational Electromagnetics Society journal}, year = {2004}, month = {2004///}, pages = {100 - 107}, abstract = {An integral equation approach is derived for an electromagnetic scattering from an M arbitrary multilayereddielectric domain. The integral equation is valid for the 2D and 3D Helmholtz equation. Here we show the numerical solution for the 2D case by using the Nystr{\"o}m method. For validating the method we develop a mode matching method for the case when the domains are multilayered circular cylinders and give numerical results for illustrating the algorithm. }, author = {Duraiswami, Ramani and Seydou,F. and Gumerov, Nail A.} } @article {12169, title = {Toolkit design for interactive structured graphics}, journal = {Software Engineering, IEEE Transactions on}, volume = {30}, year = {2004}, month = {2004///}, pages = {535 - 546}, author = {Bederson, Benjamin B. and Grosjean,J. and Meyer,J.} } @article {13909, title = {Tools for children to create physical interactive storyrooms}, journal = {Computers in Entertainment (CIE)}, volume = {2}, year = {2004}, month = {2004///}, pages = {12 - 12}, author = {Montemayor,J. and Druin, Allison and Chipman,G. and Farber,A. and Guha,M.L.} } @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 {14461, title = {Unsupervised sense disambiguation using bilingual probabilistic models}, booktitle = {Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics}, series = {ACL {\textquoteright}04}, year = {2004}, month = {2004///}, publisher = {Association for Computational Linguistics}, organization = {Association for Computational Linguistics}, address = {Stroudsburg, PA, USA}, abstract = {We describe two probabilistic models for unsupervised word-sense disambiguation using parallel corpora. The first model, which we call the Sense model, builds on the work of Diab and Resnik (2002) that uses both parallel text and a sense inventory for the target language, and recasts their approach in a probabilistic framework. The second model, which we call the Concept model, is a hierarchical model that uses a concept latent variable to relate different language specific sense labels. We show that both models improve performance on the word sense disambiguation task over previous unsupervised approaches, with the Concept model showing the largest improvement. Furthermore, in learning the Concept model, as a by-product, we learn a sense inventory for the parallel language.}, doi = {10.3115/1218955.1218992}, url = {http://dx.doi.org/10.3115/1218955.1218992}, author = {Bhattacharya,Indrajit and Getoor, Lise and Bengio,Yoshua} } @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} } @conference {14307, title = {Visualizing type qualifier inference with Eclipse}, booktitle = {Proceedings of the 2004 OOPSLA workshop on eclipse technology eXchange}, year = {2004}, month = {2004///}, pages = {57 - 61}, author = {Greenfieldboyce,D. and Foster, Jeffrey S.} } @article {16497, title = {Wide area performance monitoring using aggregate latency profiles}, journal = {Web Engineering}, year = {2004}, month = {2004///}, pages = {771 - 775}, author = {Zadorozhny,V. and Gal,A. and Raschid, Louiqa and Ye,Q.} } @article {14486, title = {A workshop report: mining for and from the Semantic Web at KDD 2004}, journal = {SIGKDD Explor. Newsl.}, volume = {6}, year = {2004}, month = {2004/12//}, pages = {142 - 143}, abstract = {The international workshop on Mining for and from the Semantic Web (MSW) at the KDD 2004 successfully brought together people from the communities Semantic Web and Knowledge Discovery. The goal of the workshop was to strengthen the communication and interaction between these communities as there is currently an agreement that both can benefit largely from each other. Overall the contributions and discussions showed that today mining for the semantic web is the primarily targeted research area. However, with a growing amount of available semantic web data also mining from the semantic web will be more prominent.}, isbn = {1931-0145}, doi = {10.1145/1046456.1046482}, url = {http://doi.acm.org/10.1145/1046456.1046482}, author = {Hotho,Andreas and Sure,York and Getoor, Lise} } @book {18790, title = {19th Biennial Conference on Mechanical Vibration and Noise}, year = {2003}, month = {2003///}, publisher = {American Society of Mechanical Engineers}, organization = {American Society of Mechanical Engineers}, author = {Gupta,A. K. and Fadel,G. M. and Lewicki,D. G. and Shabana,A. A. and Royston,T. J. and Gupta,S.K. and Hayes,C. and Herrmann,J.W. and Dym,C. L. and Schmidt,L. C.} } @article {13923, title = {Accuracy, Target Reentry and Fitts{\textquoteright} Law Performance of Preschool Children Using Mice}, journal = {University of Maryland Technical Report, HCIL-2003}, volume = {16}, year = {2003}, month = {2003///}, author = {Hourcade,J. P and Bederson, Benjamin B. and Druin, Allison and Guimbretiere,F.} } @article {14062, title = {Acoustical scattering from N spheres using a multilevel fast multipole method}, journal = {The Journal of the Acoustical Society of America}, volume = {113}, year = {2003}, month = {2003///}, pages = {2334 - 2334}, abstract = {We develop an efficient computational method for wave scattering from a large number of spherical objects that are characterized by their radii, locations, and complex acoustical impedances of the surfaces. The direct T-matrix method for solution of the problem that was developed and tested in [Gumerov and Duraiswami, J. Acoust. Soc. Am. 112, 2688{\textendash}2701 (2002)] is inefficient for computations involving a large number of scatterers. Here, we implement and test a multilevel fast multipole method for speeding up the solution and achieving better memory complexity. The method is based on hierarchical space subdivision with oct-trees using optimal space-partitioning, on a theory for fast translation and re-expansion of multipole solutions of the Helmholtz equation, and employs an iterative technique for the solution of large dense systems of linear equations with reflection-based iterations. For N scatterers the method provides O(NlogN) asymptotic complexity opposed to O(N3) complexity of the direct T-matrix approach. The results of computations were tested against solutions obtained by other methods, such as the boundary element method and the direct T-matrix method tested in our early study, and show the computational efficiency and accuracy of the solution technique. [Work supported by NSF Awards 0086075 and 0219681 is gratefully acknowledged.]}, url = {http://link.aip.org/link/?JAS/113/2334/2}, author = {Gumerov, Nail A. and Duraiswami, Ramani} } @article {18730, title = {Algorithms for computing global accessibility cones}, journal = {Journal of Computing and Information Science in Engineering}, volume = {3}, year = {2003}, month = {2003///}, pages = {200 - 200}, author = {Dhaliwal,S. and Gupta,S.K. and Huang,J. and Priyadarshini,A.} } @article {18812, title = {Algorithms for selecting cutters in multi-part milling problems}, journal = {Computer-Aided Design}, volume = {35}, year = {2003}, month = {2003/08//}, pages = {825 - 839}, abstract = {This paper describes geometric algorithms for automatically selecting an optimal sequence of cutters for machining a set of 2.5-D parts. In milling operations, cutter size affects the machining time significantly. Meanwhile, if the batch size is small, it is also important to shorten the time spent on loading tools into the tool magazine and establishing z-length compensation values. Therefore, in small-batch manufacturing, if we can select a set of milling tools that will produce good machining time on more than one type of parts, then several unnecessary machine-tool reconfiguration operations can be eliminated. In selecting milling cutters we consider both the tool loading time and the machining time and generate solutions that allow us to minimize the total machining time. In this paper we first present algorithms for finding the area that can be cut by a given cutter. Then we describe a graph search formulation for the tool selection problem. Finally, the optimal sequence of cutters is selected by using Dijkstra{\textquoteright}s shortest path planning algorithm.}, keywords = {2.5-D Milling, cutter selection, Geometric Algorithms}, isbn = {0010-4485}, doi = {10.1016/S0010-4485(02)00110-0}, url = {http://www.sciencedirect.com/science/article/pii/S0010448502001100}, author = {Yao,Zhiyang and Gupta, Satyandra K. and Nau, Dana S.} } @article {14058, title = {Analysis of particular phononic structures using single integral equations}, journal = {The Journal of the Acoustical Society of America}, volume = {113}, year = {2003}, month = {2003///}, pages = {2284 - 2284}, abstract = {A fast method for determining phononic (and photonic) bandgaps in composite materials is developed. It is known that in the propagation of waves in a 3D medium containing N scatterers arranged periodically, there exist refractive indices for which such structures have bandgaps, i.e., frequencies for which no waves can propagate inside. Our task is to find the frequencies that generate these prohibited waves. This requires the solution of an eigenvalue problem for the Helmholtz operator. To solve this problem we choose an alternate route which uses boundary integral equations. We derive a single integral equation on each of the interfaces between the outer region and the scatterers, considering a general transmission boundary condition, by using a hybrid method using layer potentials and Green{\textquoteright}s formula. This approach reduces the number of unknowns considerably in comparison to other methods, but requires the treatment of large dense matrices and many matrix vector multiplications. To remedy this, we use the Fast Multipole Method. For solving the eigenvalue problem we discuss two methods: the Newton method and a method based on the Cauchy formula. Details of the numerical implementation, and results will be presented for different cases: sound hard, sound soft, impedance and transmission boundary conditions. [Work partially supported by NSF Award 0219681 is gratefully acknowledged.]}, url = {http://link.aip.org/link/?JAS/113/2284/1}, author = {Seydou,Fadoulourahmane and Duraiswami, Ramani and Gumerov, Nail A.} } @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 {14061, title = {Augmented intelligibility in simultaneous multi-talker environments}, journal = {Proc. International Conference on Auditory Display (ICAD{\textquoteright}03)}, year = {2003}, month = {2003///}, pages = {71 - 74}, abstract = {Speech intelligibility can be severely compromised inenvironments where there are several competing speakers. It may be possible, however, to improve speech intelligibility in such environments by manipulating certain acoustic parameters known to facilitate the segregation of competing signals. The first step in designing such a feature-rich audio display is to understand the significant elements of human auditory perception that affect information transmission capacity. We review a series of experiments to examine the impact of different audio-display design parameters on overall intelligibility of simultaneous speech messages and show how using these features may improve intelligibility. }, author = {Mesgarani,N. and Shamma,S. and Grant,K.W. and Duraiswami, Ramani} } @article {12397, title = {Automatic classification of multi-word expressions in print dictionaries}, journal = {Lingvisticae Investigationes}, volume = {26}, year = {2003}, month = {2003/01/01/}, pages = {187 - 202}, abstract = {SummaryThis work demonstrates the assignment of multi-word expressions in print dictionaries to POS classes with minimal linguistic resources. In this application, 32,000 entries from the W{\"o}rterbuch der deutschen Idiomatik (H. Schemann 1993) were classified using an inductive description of POS sequences in conjunction with a Brill Tagger trained on manually tagged idiomatic entries. This process assigned categories to 86\% of entries with 88\% accuracy. This classification supplies a meaningful preprocessing step for further applications: the resulting POS-sequences for all idiomatic entries might be used for the automatic recognition of multi-word lexemes in unrestricted text.}, isbn = {03784169}, doi = {10.1075/li.26.2.03gey}, url = {http://umd.library.ingentaconnect.com/content/jbp/li/2003/00000026/00000002/art00002}, author = {Geyken,Alexander and Jordan Boyd-Graber} } @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 {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} } @conference {12076, title = {Bootstrapping security associations for routing in mobile ad-hoc networks}, booktitle = {IEEE Global Telecommunications Conference, 2003. GLOBECOM {\textquoteright}03}, volume = {3}, year = {2003}, month = {2003/12/01/5}, pages = {1511- 1515 vol.3 - 1511- 1515 vol.3}, publisher = {IEEE}, organization = {IEEE}, abstract = {To date, most solutions proposed for secure routing in mobile ad-hoc networks (MANETs), assume that secure associations between pairs of nodes can be established on-line; e.g., by a trusted third party, by distributed trust establishment. However, establishing such security associations, with or without trusted third parties, requires reliance on routing layer security. In this paper, we eliminate this apparent cyclic dependency between security services and secure routing in MANETs and show how to bootstrap security for the routing layer. We use the notion of statistically unique and cryptographically verifiable (SUCV) identifiers to implement a secure binding between IP addresses and keys that is independent of any trusted security service. We illustrate our solution with the dynamic source routing (DSR) protocol and compare it with other solutions for secure routing.}, keywords = {ad hoc networks, bootstrapping security association, Cryptographic protocols, dynamic source routing protocol, Fabrics, Intelligent networks, IP address, IP key, IP networks, Message authentication, mobile ad-hoc network, mobile radio, Protection, Public key, public key cryptography, routing layer security reliability, routing protocols, secure routing, Security, security service, statistically unique cryptographically verification, telecommunication security}, isbn = {0-7803-7974-8}, doi = {10.1109/GLOCOM.2003.1258490}, author = {Bobba,R. B and Eschenauer,L. and Gligor,V. and Arbaugh, William A.} } @conference {13359, title = {Cache-and-query for wide area sensor databases}, booktitle = {Proceedings of the 2003 ACM SIGMOD international conference on Management of data}, series = {SIGMOD {\textquoteright}03}, year = {2003}, month = {2003///}, pages = {503 - 514}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Webcams, microphones, pressure gauges and other sensors provide exciting new opportunities for querying and monitoring the physical world. In this paper we focus on querying wide area sensor databases, containing (XML) data derived from sensors spread over tens to thousands of miles. We present the first scalable system for executing XPATH queries on such databases. The system maintains the logical view of the data as a single XML document, while physically the data is fragmented across any number of host nodes. For scalability, sensor data is stored close to the sensors, but can be cached elsewhere as dictated by the queries. Our design enables self starting distributed queries that jump directly to the lowest common ancestor of the query result, dramatically reducing query response times. We present a novel query-evaluate gather technique (using XSLT) for detecting (1) which data in a local database fragment is part of the query result, and (2) how to gather the missing parts. We define partitioning and cache invariants that ensure that even partial matches on cached data are exploited and that correct answers are returned, despite our dynamic query-driven caching. Experimental results demonstrate that our techniques dramatically increase query throughputs and decrease query response times in wide area sensor databases.}, isbn = {1-58113-634-X}, doi = {10.1145/872757.872818}, url = {http://doi.acm.org/10.1145/872757.872818}, author = {Deshpande, Amol and Nath,Suman and Gibbons,Phillip B. and Seshan,Srinivasan} } @inbook {17639, title = {On the Covering Steiner Problem}, booktitle = {FST TCS 2003: Foundations of Software Technology and Theoretical Computer ScienceFST TCS 2003: Foundations of Software Technology and Theoretical Computer Science}, series = {Lecture Notes in Computer Science}, volume = {2914}, year = {2003}, month = {2003///}, pages = {244 - 251}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {The Covering Steiner problem is a common generalization of the k -MST and Group Steiner problems. An instance of the Covering Steiner problem consists of an undirected graph with edge-costs, and some subsets of vertices called groups , with each group being equipped with a non-negative integer value (called its requirement ); the problem is to find a minimum-cost tree which spans at least the required number of vertices from every group. When all requirements are equal to 1, this is the Group Steiner problem. While many covering problems (e.g., the covering integer programs such as set cover) become easier to approximate as the requirements increase, the Covering Steiner problem remains at least as hard to approximate as the Group Steiner problem; in fact, the best guarantees previously known for the Covering Steiner problem were worse than those for Group Steiner as the requirements became large. In this work, we present an improved approximation algorithm whose guarantee equals the best known guarantee for the Group Steiner problem.}, isbn = {978-3-540-20680-4}, url = {http://dx.doi.org/10.1007/978-3-540-24597-1_21}, author = {Gupta,Anupam and Srinivasan, Aravind}, editor = {Pandya,Paritosh and Radhakrishnan,Jaikumar} } @book {19346, title = {Data Structures and Algorithms in C++}, year = {2003}, month = {2003}, pages = {714}, publisher = {John Wiley \& Sons}, organization = {John Wiley \& Sons}, abstract = {* Provides a comprehensive introduction to data structures and algorithms, including their design, analysis, and implementation * Each data structure is presented using ADTs and their respective implementations * Helps provide an understanding of the wide spectrum of skills ranging from sound algorithm and data structure design to efficient implementation and coding of these designs in C++}, keywords = {Computers / Databases / General, Computers / Programming / Algorithms, Computers / Programming / General, Computers / Programming Languages / C, Fiction / General}, isbn = {9780471202080}, author = {Goodrich, Michael T. and Tamassia, Roberto and Mount, Dave} } @article {14056, title = {Data Structures, Optimal Choice of Parameters, and Complexity Results for Generalized Multilevel Fast Multipole Methods in $d$ Dimensions}, journal = {Technical Reports from UMIACS UMIACS-TR-2003-28}, year = {2003}, month = {2003/04/04/}, abstract = {We present an overview of the Fast Multipole Method, explain the use ofoptimal data structures and present complexity results for the algorithm. We explain how octree structures and bit interleaving can be simply used to create efficient versions of the multipole algorithm in $d$ dimensions. We then present simulations that demonstrate various aspects of the algorithm, including optimal selection of the clustering parameter, the influence of the error bound on the complexity, and others. The use of these optimal parameters results in a many-fold speed-up of the FMM, and prove very useful in practice. UMIACS-TR-2003-28 }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/1270}, author = {Gumerov, Nail A. and Duraiswami, Ramani and Borovikov,Eugene A.} } @article {16905, title = {Digital Government-Bistro: A Scalable and Secure Data Transfer Service for Digital Government Applications}, journal = {Communications of the ACM-Association for Computing Machinery-CACM}, volume = {46}, year = {2003}, month = {2003///}, pages = {50 - 51}, author = {Golubchik,L. and Cheng,W. C and Chou,C. F and Khuller, Samir and Samet, Hanan and Wan,Y. C.J} } @article {12948, title = {Direct Detection of Vibrio Cholerae and ctxA in Peruvian Coastal Water and Plankton by PCR}, journal = {Applied and Environmental MicrobiologyAppl. Environ. Microbiol.}, volume = {69}, year = {2003}, month = {2003/06/01/}, pages = {3676 - 3680}, abstract = {Seawater and plankton samples were collected over a period of 17 months from November 1998 to March 2000 along the coast of Peru. Total DNA was extracted from water and from plankton grouped by size into two fractions (64 μm to 202 μm and >202 μm). All samples were assayed for Vibrio cholerae, V. cholerae O1, V. cholerae O139, and ctxA by PCR. Of 50 samples collected and tested, 33 (66.0\%) were positive for V. cholerae in at least one of the three fractions. Of these, 62.5\% (n = 32) contained V. cholerae O1; ctxA was detected in 25\% (n = 20) of the V. cholerae O1-positive samples. None were positive for V. cholerae O139. Thus, PCR was successfully employed in detecting toxigenic V. cholerae directly in seawater and plankton samples and provides evidence for an environmental reservoir for this pathogen in Peruvian coastal waters.}, isbn = {0099-2240, 1098-5336}, doi = {10.1128/AEM.69.6.3676-3680.2003}, url = {http://aem.asm.org/content/69/6/3676}, author = {Lipp,Erin K. and Rivera,Irma N. G. and Gil,Ana I. and Espeland,Eric M. and Choopun,Nipa and Louis,Val{\'e}rie R. and Russek-Cohen,Estelle and Huq,Anwar and Rita R Colwell} } @article {17844, title = {Driving scientific applications by data in distributed environments}, journal = {Computational Science{\textemdash}ICCS 2003}, year = {2003}, month = {2003///}, pages = {713 - 713}, author = {Saltz, J. and Catalyurek,U. and Kurc, T. and Gray,M. and Hastings,S. and Langella,S. and Narayanan,S. and Martino,R. and Bryant,S. and Peszynska,M. and others} } @article {17108, title = {Dynamic query choropleth maps for information seeking and decision making}, journal = {Proc. Human-Computer Interaction International}, year = {2003}, month = {2003///}, abstract = {Information retrieval and visualization can be combined in dynamic query systems that allow users unparalleled access to information for decision making. In this paper, we report on the development and evaluation of a dynamic query system (YMap) that displays information on a chloropleth map using double thumb sliders to select ranges of query variables. The YMap prototype is a Java-Applet that supports panning and zooming. Several usability studies were conducted on early prototypes that resulted in the current version. Applications of YMap for decision making tasks are discussed.}, author = {Norman,K. and Zhao,H. and Shneiderman, Ben and Golub,E.} } @article {17111, title = {Dynamic query visualisations on world wide web clients: A DHTML solution for maps and scattergrams}, journal = {International journal of Web engineering and technology}, volume = {1}, year = {2003}, month = {2003///}, pages = {63 - 78}, abstract = {Dynamic queries are gaining popularity as a method for interactive information visualisation. Many implementations have been made on personal computers, and there is increasing interest in Web-based designs. While Java and Flash strategies have been developed, we believe that a Dynamic HTML implementation could help promote more widespread use. We implemented double-box range sliders with choropleth maps and scattergrams, which are two popular visualisations, using HTML layers and tables. This paper describes our methods for slider control, visual presentation, and displaying/updating results for these visualisations. Visual design issues innovations and performance enhancements were necessary to create viable designs.}, author = {Golub,E. and Shneiderman, Ben} } @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 {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} } @mastersthesis {14699, title = {Implementing On-line Software Upgrades in Java}, year = {2003}, month = {2003/05//}, school = {University of Maryland, College Park}, abstract = {There are many systems that have to be available without interruption and so cannot bebrought down for modifications. Examples of such applications include financial transaction processors, telephone switches and air traffic control systems. On the other hand, hardly any software is deployed error-free or fully functional, thus requiring fixes and changes. Therefore, there is a need for runtime software upgrading capability for such systems. This paper discusses existing approaches of {\textquotedblleft}hotswapping{\textquotedblright} {\textendash} runtime updating of classes {\textendash} for the Java language. The different implementations of hotswapping are compared with respect to functionality, efficiency, ease of use and limitations. In addition, an improvement for one hotswapping mechanism is suggested and implemented. }, author = {Gebremichael,M. and Hicks, Michael W.} } @article {17552, title = {An Improved Approximation Ratio for the Covering Steiner Problem}, journal = {Theory of Computing}, volume = {2}, year = {2003}, month = {2003///}, pages = {53 - 64}, abstract = {In the Covering Steiner problem, we are given an undirected graph with edge-costs, and some subsets of vertices called groups, with each group being equipped with a non-negative integer value (called its requirement); the problem is to find a minimum-cost tree which spans at least the required number of vertices from every group. The Covering Steiner problem is a common generalization of the k-MST and the Group Steiner problems; indeed, when all the vertices of the graph lie in one group with a requirement of k, we get the k-MST problem, and when there are multiple groups with unit requirements, we obtain the Group Steiner problem. While many covering problems (e.g., the covering integer programs such as set cover) become easier to approximate as the requirements increase, the Covering Steiner problem remains at least as hard to approximate as the Group Steiner problem; in fact, the best guarantees previously known for the Covering Steiner problem were worse than those for Group Steiner as the requirements became large. In this work, we present an improved approximation algorithm whose guarantee equals the best known guarantee for the Group Steiner problem.}, url = {http://repository.cmu.edu/compsci/850}, author = {Gupta,Anupam and Srinivasan, Aravind} } @conference {13237, title = {Improved fast gauss transform and efficient kernel density estimation}, booktitle = {Computer Vision, 2003. Proceedings. Ninth IEEE International Conference on}, year = {2003}, month = {2003/10//}, pages = {664 -671 vol.1 - 664 -671 vol.1}, abstract = {Evaluating sums of multivariate Gaussians is a common computational task in computer vision and pattern recognition, including in the general and powerful kernel density estimation technique. The quadratic computational complexity of the summation is a significant barrier to the scalability of this algorithm to practical applications. The fast Gauss transform (FGT) has successfully accelerated the kernel density estimation to linear running time for low-dimensional problems. Unfortunately, the cost of a direct extension of the FGT to higher-dimensional problems grows exponentially with dimension, making it impractical for dimensions above 3. We develop an improved fast Gauss transform to efficiently estimate sums of Gaussians in higher dimensions, where a new multivariate expansion scheme and an adaptive space subdivision technique dramatically improve the performance. The improved FGT has been applied to the mean shift algorithm achieving linear computational complexity. Experimental results demonstrate the efficiency and effectiveness of our algorithm.}, keywords = {adaptive, algorithm;multivariate, complexity;computer, complexity;Gaussian, computational, density, estimation;mean, expansion, Gauss, processes;computational, recognition;quadratic, scheme;pattern, shift, space, subdivision, technique;computer, theory;, transform;kernel, vision;estimation, vision;fast}, doi = {10.1109/ICCV.2003.1238383}, author = {Yang,C. and Duraiswami, Ramani and Gumerov, Nail A. and Davis, Larry S.} } @article {13299, title = {Interactive Visualization of Large Tetrahedral Meshes through Selective Refinement}, journal = {IEEE Transactions on Visualization and Computer Graphics}, year = {2003}, month = {2003///}, abstract = {In this paper, we address the problem of the efficient visualization of very largeirregular volume datasets. To this aim, we exploit a multiresolution representation based on a domain decomposition into tetrahedral cells. A new compact data struc- ture is described which encodes the whole dataset at a virtually continuous range of different resolutions, with a storage cost six times lower than a standard data struc- ture for tetrahedral meshes. Such structure supports on-line selective refinement to focus resolution on areas that the user considers more critical, based on either field values, or domain location, or opacity of the transfer function. Selective refinement is used to trade-off between resolution and speed in visualization, according to user needs and hardware constraints. These features have been implemented in a new system, called TAn2 (Tetrahedra Analyzer), for the interactive visualization of three- dimensional scalar fields defined on very large tetrahedral meshes. Multiresolution representation and selective refinement make the system fully scalable with respect to the size of the dataset and to hardware requirements. }, author = {Cignoni,P. and De Floriani, Leila and Magillo,P. and Puppo,E. and Scopigno,R. and di Genova,U.} } @article {12190, title = {The International Children{\textquoteright}s Digital Library}, journal = {First Monday}, volume = {8}, year = {2003}, month = {2003///}, author = {Druin, Allison and Bederson, Benjamin B. and Weeks,A. and Farber,A. and Grosjean,J. and Guha,M.L. and Hourcade,J. P and Lee,J. and Liao,S. and Reuter,K. and others} } @article {13928, title = {The International Children{\textquoteright}s Digital Library: Description and analysis of first use}, journal = {First Monday}, volume = {8}, year = {2003}, month = {2003///}, pages = {315 - 315}, author = {Druin, Allison and Bederson, Benjamin B. and Weeks,A. and Farber,A. and Grosjean,J. and Guha,M.L. and Hourcade,J. P and Lee,J. and Liao,S. and Reuter,K. and others} } @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 {13376, title = {IRIS: Internet-scale Resource-Intensive Sensor Services}, journal = {Intel Research, UC Berkeley, Carnegie Mellon University}, year = {2003}, month = {2003///}, abstract = {The proliferation and affordability of smart sensors such aswebcams, microphones etc., has created opportunities for exciting new classes of distributed services. A key stum- bling block to mining these rich information sources is the lack of a common, scalable networked infrastructure for col- lecting, filtering, and combining the video feeds, extracting the useful information, and enabling distributed queries. In this demo, we demonstrate the design and an early prototype of such an infrastructure, called IRIS (Internet- scale Resource-Intensive Sensor services). IRIS is a poten- tially global network of smart sensor nodes, with webcams or other sensors, and organizing nodes that provide the means to query recent and historical sensor-based data. IRIS ex- ploits the fact that high-volume sensor feeds are typically attached to devices with significant computing power and storage, and running a standard operating system. Aggres- sive filtering, smart query routing, and semantic caching are used to dramatically reduce network bandwidth utilization and improve query response times, as we will demonstrate. The service that we demonstrate here is that of a park- ing space finder. This service utilizes webcams that monitor parking spaces to answer queries such as the availability of parking spaces near a user{\textquoteright}s destination. }, author = {Deshpande, Amol and Nath,S. and Gibbons,P.B. and Seshan,S.} } @conference {13378, title = {IrisNet: an architecture for internet-scale sensing services}, booktitle = {Proceedings of the 29th international conference on Very large data bases - Volume 29}, series = {VLDB {\textquoteright}03}, year = {2003}, month = {2003///}, pages = {1137 - 1140}, publisher = {VLDB Endowment}, organization = {VLDB Endowment}, abstract = {We demonstrate the design and an early prototype of IrisNet (Internet-scale Resource-Intensive Sensor Network services), a common, scalable networked infrastructure for deploying wide area sensing services. IrisNet is a potentially global network of smart sensing nodes, with webcams or other monitoring devices, and organizing nodes that provide the means to query recent and historical sensor-based data. IrisNet exploits the fact that high-volume sensor feeds are typically attached to devices with significant computing power and storage, and running a standard operating system. It uses aggressive filtering, smart query routing, and semantic caching to dramatically reduce network bandwidth utilization and improve query response times, as we demonstrate. Our demo will present two services built on Iris-Net, from two very different application domains. The first one, a parking space finder, utilizes webcams that monitor parking spaces to answer queries such as the availability of parking spaces near a user{\textquoteright}s destination. The second one, a distributed infrastructure monitor, uses measurement tools installed in individual nodes of a large distributed infrastructure to answer queries such as average network bandwidth usage of a set of nodes.}, isbn = {0-12-722442-4}, url = {http://dl.acm.org/citation.cfm?id=1315451.1315568}, author = {Nath,Suman and Deshpande, Amol and Ke,Yan and Gibbons,Phillip B. and Karp,Brad and Seshan,Srinivasan} } @conference {16473, title = {Latency Profiles: Performance Monitoring for Wide Area Applications}, booktitle = {Internet Applications, IEEE Workshop on}, year = {2003}, month = {2003///}, pages = {74 - 74}, publisher = {IEEE Computer Society}, organization = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, abstract = {Recent technological advances have enabled the deployment of wide area applications against Internet accessible sources. A performance challenge to applications in such a setting is the unpredictable end-to-end latency of accessing these sources. We use passive information gathering mechanisms to learn end-to-end latency distributions and construct Latency Profiles (LPs). We hypothesize that a group of clients, within an autonomous system (AS), that are accessing a content server, in another AS, may be represented by (one or more) LPs. Related networking research on IDMaps, points of congestion, and BGP routes support such hypothesis. We develop aggregate LPs to provide coverage of groups (clusters) of client-server pairs. Using data gathered from a (limited) experiment we demonstrate the feasibility of constructing LPs.}, doi = {http://doi.ieeecomputersociety.org/10.1109/WIAPP.2003.1210290}, author = {Raschid, Louiqa and Wen,Hui-Fang and Gal,Avigdor and Zadorozhny,Vladimir} } @article {14397, title = {Learning Structure From Statistical Models}, journal = {IEEE Data Engineering Bulletin}, volume = {26}, year = {2003}, month = {2003///}, pages = {11 - 18}, abstract = {Statistical relational learning is a newly emerging area of machine learning that combines statisticalmodeling with relational representations. Here we argue that it provides a unified framework for the discovery of structural information that can be exploited by a data management system. The categories of structure that can be discovered include: instance-level dependencies and correlations, for example intra-table column dependencies and inter-table join dependencies; record linkages and duplicates; and schema matching and schema discovery from unstructured and semi-structured data. }, author = {Getoor, Lise} } @article {14358, title = {Link mining: a new data mining challenge}, journal = {ACM SIGKDD Explorations Newsletter}, volume = {5}, year = {2003}, month = {2003/07//}, pages = {84 - 89}, abstract = {A key challenge for data mining is tackling the problem of mining richly structured datasets, where the objects are linked in some way. Links among the objects may demonstrate certain patterns, which can be helpful for many data mining tasks and are usually hard to capture with traditional statistical models. Recently there has been a surge of interest in this area, fueled largely by interest in web and hypertext mining, but also by interest in mining social networks, security and law enforcement data, bibliographic citations and epidemiological records.}, isbn = {1931-0145}, doi = {10.1145/959242.959253}, url = {http://doi.acm.org/10.1145/959242.959253}, author = {Getoor, Lise} } @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} } @conference {18857, title = {Manufacturability Analysis of Multi-Material Objects Molded by Rotary Platen Multi-Shot Molding Process}, volume = {2003}, year = {2003}, month = {2003///}, pages = {353 - 365}, publisher = {ASME}, organization = {ASME}, abstract = {This paper describes a systematic approach for manufacturability analysis of multi-material objects molded using rotary platen multi-shot injection molding process. In this paper we first identify potential manufacturability problems that are associated with objects molded by the rotary platen process. Identified problems include infeasibility of molding sequences, unnecessary mold complexity, undesired friction during mold opening and closing, and undesired material flash on finished faces. These problems are unique to multi-material molding and do not occur in traditional injection molding. For each of the above four potential manufacturability problems, this paper also describes geometric algorithms for detecting the potential occurrence of the problem based on the object and mold design, finding its causes, and offering appropriate redesign suggestions. We expect that these algorithms will help in decreasing the product development time and improving the product quality for molded multi-material objects}, isbn = {0-7918-3712-2}, doi = {10.1115/IMECE2003-42442}, url = {http://link.aip.org/link/ASMECP/v2003/i37122/p353/s1\&Agg=doi}, author = {Li,Xuejun and Gupta, Satyandra K.} } @article {12946, title = {Method of DNA extraction and application of multiplex polymerase chain reaction to detect toxigenic Vibrio cholerae O1 and O139 from aquatic ecosystems}, journal = {Environmental Microbiology}, volume = {5}, year = {2003}, month = {2003/07/01/}, pages = {599 - 606}, abstract = {Vibrio cholerae is a free-living bacterium found in water and in association with plankton. V. cholerae non-O1/non-O139 strains are frequently isolated from aquatic ecosystems worldwide. Less frequently isolated are V. cholerae O1 and V. cholerae O139, the aetiological agents of cholera. These strains have two main virulence-associated factors, cholera toxin (CT) and toxin co-regulated pilus (TCP). By extracting total DNA from aquatic samples, the presence of pathogenic strains can be determined quickly and used to improve a microbiological risk assessment for cholera in coastal areas. Some methods suggested for DNA extraction from water samples are not applicable to all water types. We describe here a method for DNA extraction from coastal water and a multiplex polymerase chain reaction (PCR) for O1 and O139 serogroups. DNA extraction was successfully accomplished from 117 sea water samples collected from coastal areas of Per{\'u}, Brazil and the USA. DNA concentration in all samples varied from 20~ng to 480~{\textmu}g~{\textmu}l-1. The sensitivity of the DNA extraction method was 100 V. cholerae cells in 250~ml of water. The specificity of multiplex O1/O139 PCR was investigated by analysing 120 strains of V. cholerae, Vibrio and other Bacteria species. All V. cholerae O1 and O139 tested were positive. For cholera surveillance of aquatic environments and ballast water, total DNA extraction, followed by V. cholerae PCR, and O1/O139 serogroup and tcpA/ctxA genes by multiplex PCR offers an efficient system, permitting risk analysis for cholera in coastal areas.}, isbn = {1462-2920}, doi = {10.1046/j.1462-2920.2003.00443.x}, url = {http://onlinelibrary.wiley.com/doi/10.1046/j.1462-2920.2003.00443.x/abstract?userIsAuthenticated=false\&deniedAccessCustomisedMessage=}, author = {Rivera,Irma N. G. and Lipp,Erin K. and Gil,Ana and Choopun,Nipa and Huq,Anwar and Rita R Colwell} } @article {13386, title = {MobiCom poster: mining a world of smart sensors}, journal = {SIGMOBILE Mob. Comput. Commun. Rev.}, volume = {7}, year = {2003}, month = {2003/01//}, pages = {34 - 36}, isbn = {1559-1662}, doi = {10.1145/881978.881987}, url = {http://doi.acm.org/10.1145/881978.881987}, author = {Nath,Suman and Deshpande, Amol and Gibbons,Phillip B. and Seshan,Srinivasan} } @inbook {15786, title = {Performance of a Three-Stage System for Multi-Document Summarization}, booktitle = {DUC 03 Conference ProceedingsDUC 03 Conference Proceedings}, year = {2003}, month = {2003///}, publisher = {U.S. National Inst. of Standards and Technology}, organization = {U.S. National Inst. of Standards and Technology}, url = {http://duc.nist.gov/http://duc.nist.gov/}, author = {Dunlavy,Daniel M. and Conroy,John M. and Schlesinger,Judith D. and Goodman,Sarah A. and Okurowski,Mary Ellen and O{\textquoteright}Leary, Dianne P. and Halteren,Hans van} } @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 {12949, title = {Predictability of Vibrio Cholerae in Chesapeake Bay}, journal = {Applied and Environmental MicrobiologyAppl. Environ. Microbiol.}, volume = {69}, year = {2003}, month = {2003/05/01/}, pages = {2773 - 2785}, abstract = {Vibrio cholerae is autochthonous to natural waters and can pose a health risk when it is consumed via untreated water or contaminated shellfish. The correlation between the occurrence of V. cholerae in Chesapeake Bay and environmental factors was investigated over a 3-year period. Water and plankton samples were collected monthly from five shore sampling sites in northern Chesapeake Bay (January 1998 to February 2000) and from research cruise stations on a north-south transect (summers of 1999 and 2000). Enrichment was used to detect culturable V. cholerae, and 21.1\% (n = 427) of the samples were positive. As determined by serology tests, the isolates, did not belong to serogroup O1 or O139 associated with cholera epidemics. A direct fluorescent-antibody assay was used to detect V. cholerae O1, and 23.8\% (n = 412) of the samples were positive. V. cholerae was more frequently detected during the warmer months and in northern Chesapeake Bay, where the salinity is lower. Statistical models successfully predicted the presence of V. cholerae as a function of water temperature and salinity. Temperatures above 19{\textdegree}C and salinities between 2 and 14 ppt yielded at least a fourfold increase in the number of detectable V. cholerae. The results suggest that salinity variation in Chesapeake Bay or other parameters associated with Susquehanna River inflow contribute to the variability in the occurrence of V. cholerae and that salinity is a useful indicator. Under scenarios of global climate change, increased climate variability, accompanied by higher stream flow rates and warmer temperatures, could favor conditions that increase the occurrence of V. cholerae in Chesapeake Bay.}, isbn = {0099-2240, 1098-5336}, doi = {10.1128/AEM.69.5.2773-2785.2003}, url = {http://aem.asm.org/content/69/5/2773}, author = {Louis,Val{\'e}rie R. and Russek-Cohen,Estelle and Choopun,Nipa and Rivera,Irma N. G. and Gangle,Brian and Jiang,Sunny C. and Rubin,Andrea and Patz,Jonathan A. and Huq,Anwar and Rita R Colwell} } @conference {14387, title = {PXML: a probabilistic semistructured data model and algebra}, booktitle = {Data Engineering, 2003. Proceedings. 19th International Conference on}, year = {2003}, month = {2003/03//}, pages = {467 - 478}, abstract = {Despite the recent proliferation of work on semistructured data models, there has been little work to date on supporting uncertainty in these models. We propose a model for probabilistic semistructured data (PSD). The advantage of our approach is that it supports a flexible representation that allows the specification of a wide class of distributions over semistructured instances. We provide two semantics for the model and show that the semantics are probabilistically coherent. Next, we develop an extension of the relational algebra to handle probabilistic semistructured data and describe efficient algorithms for answering queries that use this algebra. Finally, we present experimental results showing the efficiency of our algorithms.}, keywords = {algebra;, data, databases;, instances;, model;, models;, probabilistic, processing;, PXML;, query, relational, semistructured, structures;, tree, XML;}, doi = {10.1109/ICDE.2003.1260814}, author = {Hung,E. and Getoor, Lise and V.S. Subrahmanian} } @conference {14543, title = {Random MAX SAT, random MAX CUT, and their phase transitions}, booktitle = {Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms}, year = {2003}, month = {2003///}, pages = {364 - 373}, author = {Coppersmith,D. and Gamarnik,D. and Hajiaghayi, Mohammad T. and Sorkin,G. B} } @article {14729, title = {Safe and flexible memory management in Cyclone}, journal = {Technical Reports from UMIACS}, year = {2003}, month = {2003/08/01/undef}, abstract = {Cyclone is a type-safe programming language intended for applications requiring control over memory management. Our previous work on Cyclone included support for stack allocation, lexical region allocation, and a garbage-collected heap. We achieved safety (i.e., prevented dangling pointers) through a region-based type-and-effects system. This paper describes some new memory-management mechanisms that we have integrated into Cyclone: dynamic regions, unique pointers, and reference-counted objects. Our experience shows that these new mechanisms are well suited for the timely recovery of objects in situations where it is awkward to use lexical regions. Crucially, programmers can write reusable functions without unnecessarily restricting callers{\textquoteright} choices among the variety of memory-management options. To achieve this goal, Cyclone employs a combination of polymorphism and scoped constructs that temporarily let us treat objects as if they were allocated in a lexical region.}, author = {Hicks, Michael W. and Morrisett,G. and Grossman,D. and Jim,T.} } @article {14104, title = {The sequence and analysis of Trypanosoma brucei chromosome II}, journal = {Nucleic acids research}, volume = {31}, year = {2003}, month = {2003///}, pages = {4856 - 4856}, author = {El-Sayed, Najib M. and Ghedin,E. and Song,J. and MacLeod,A. and Bringaud,F. and Larkin,C. and Wanless,D. and Peterson,J. and Hou,L. and Taylor,S. and others} } @conference {13650, title = {Sports Video Classification Using HMM}, booktitle = {ICME}, volume = {2}, year = {2003}, month = {2003///}, pages = {345 - 348}, author = {Gilbert,X. and Li,H. and David Doermann} } @conference {18805, title = {A Step Towards Automated Design of Rotary-Platen Multi-Shot Molds}, volume = {2003}, year = {2003}, month = {2003///}, pages = {343 - 354}, publisher = {ASME}, organization = {ASME}, address = {Chicago, Illinois, USA}, abstract = {This paper describes an improved algorithm for automated design of rotary-platen type of multi-shot molds for manufacturing multi-material objects. The algorithm described in this paper accounts for geometric constraints resulting from the rotary-platen process and it can handle significantly more complex interfaces. Our algorithm works in the following manner. First, we classify the multi-material object into several basic types based on the relationships among different single material components in the object. For every basic type, we find a manufacturing sequence based on the precedence constraints resulting due to accessibility and disassembly requirements. Then, starting from the last mold stage, we generate the mold pieces for every mold stage based on the manufacturing sequence. We expect that the algorithm described in this paper will provide the necessary foundations for automating the design of rotary-platen molds and therefore will help in significantly reducing the mold manufacturing lead-time associated with these types of molds.}, isbn = {0-7918-3701-7}, doi = {10.1115/DETC2003/DFM-48168}, url = {http://link.aip.org/link/ASMECP/v2003/i37017a/p343/s1\&Agg=doi}, author = {Li,Xuejun and Gupta, Satyandra K.} } @article {14384, title = {Structure discovery using statistical relational learning}, journal = {Data Engineering}, volume = {51}, year = {2003}, month = {2003///}, pages = {10 - 10}, abstract = {Statistical relational learning is a newly emerging area of machine learning that combines statisticalmodeling with relational representations. Here we argue that it provides a unified framework for the discovery of structural information that can be exploited by a data management system. The categories of structure that can be discovered include: instance-level dependencies and correlations, for example intra-table column dependencies and inter-table join dependencies; record linkages and duplicates; and schema matching and schema discovery from unstructured and semi-structured data. }, author = {Getoor, Lise} } @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 {18749, title = {A system for generating process and material selection advice during embodiment design of mechanical components}, journal = {Journal of manufacturing systems}, volume = {22}, year = {2003}, month = {2003///}, pages = {28 - 45}, abstract = {This paper describes a systematic approach to material and process selection during theembodiment design of mechanical components and a system for generating process and material selection advice. Quite often during the embodiment design stage, design requirements are not precisely defined. Therefore, the system described in this paper accounts for imprecision in design requirements during generation and evaluation of alternative process sequences and material options. To reduce the computational effort, the system uses a depth-first branch-and- bound search algorithm. This aids in exploring promising process sequences and material options that can be used to meet the given set of design requirements. Various process sequences and material options are evaluated by using a commercial cost estimation tool. }, url = {ftp://ftp.eng.umd.edu/:/home/glue/s/k/skgupta/backup/pub/Publication/JMS03_Gupta.pdf}, author = {Gupta,S.K. and Chen,Y. and Feng,S. and Sriram,R.} } @article {13470, title = {Team formation in complex networks}, journal = {Proceedings of the 1st NAACSOS Conference}, year = {2003}, month = {2003///}, abstract = {The concept of team formation, or joint action, is central to a wide variety of disciplines includingorganizational design, computational organization theory, planning and learning in multi-agent systems, and distributed artificial intelligence. One key feature of team formation is the under- lying social network topology which determines the direct interactions among the individuals of the organization. Traditional models of social phenomena have been restricted to regular lattice, or fully-connected, network topologies, but recent results have shown that real-world networks have much different and much richer structure. Using a simple agent-based computational model of team formation, various virtual experiments are conducted to examine the impact of complex network structures on the dynamics of team formation. }, author = {Gaston,M. and desJardins, Marie} } @article {17809, title = {Temporal probabilistic object bases}, journal = {Knowledge and Data Engineering, IEEE Transactions on}, volume = {15}, year = {2003}, month = {2003/08//july}, pages = {921 - 939}, abstract = {There are numerous applications where we have to deal with temporal uncertainty associated with objects. The ability to automatically store and manipulate time, probabilities, and objects is important. We propose a data model and algebra for temporal probabilistic object bases (TPOBs), which allows us to specify the probability with which an event occurs at a given time point. In explicit TPOB-instances, the sets of time points along with their probability intervals are explicitly enumerated. In implicit TPOB-instances, sets of time points are expressed by constraints and their probability intervals by probability distribution functions. Thus, implicit object base instances are succinct representations of explicit ones; they allow for an efficient implementation of algebraic operations, while their explicit counterparts make defining algebraic operations easy. We extend the relational algebra to both explicit and implicit instances and prove that the operations on implicit instances correctly implement their counterpart on explicit instances.}, keywords = {algebra;, algebraic, bases;, constraints;, data, database, database;, databases;, distribution, explicit, functions;, handling;, implicit, instances;, integrity;, intervals;, management;, model;, models;, object, object-oriented, operations;, probabilistic, probability, probability;, relational, temporal, theory;, Uncertainty, uncertainty;}, isbn = {1041-4347}, doi = {10.1109/TKDE.2003.1209009}, author = {Biazzo,V. and Giugno,R. and Lukasiewicz,T. and V.S. Subrahmanian} } @article {14057, title = {Two methods for solving a 3D acoustic inverse scattering problem}, journal = {The Journal of the Acoustical Society of America}, volume = {113}, year = {2003}, month = {2003///}, pages = {2191 - 2191}, abstract = {We consider the problem of finding the refractive index of a buried object by using far-field measurements in an inhomogeneous medium. We describe two methods for solving the inverse problem. Both methods are implemented in two steps in order to better deal with the ill-posedness of the problem. In the first method an integral equation of the first kind is derived for the far-field operator which is solved via least-squares and Tikhonov regularization. We then use the solution of the integral equation to derive an over-posed boundary value problem, i.e., the Helmholtz equation in a bounded domain with Cauchy data on the boundary. The index that satisfies this over-posed problem most closely is obtained via the Levenberg{\textendash}Marquardt algorithm. The second method is an iterative method and is based on the Lippmann{\textendash}Schwinger equation. It is implemented via the Newton method. The first step consists, as for the other method. Here we use a Fourier integral approach and regularization via discretization. The second step is to obtain the index by iterating the Lippmann{\textendash}Schwinger equation starting with the Born approximation.}, url = {http://link.aip.org/link/?JAS/113/2191/5}, author = {Seydou,Fadoulourahmane and Gumerov, Nail A. and Duraiswami, Ramani} } @article {17672, title = {When does a random Robin Hood win?}, journal = {Theoretical Computer Science}, volume = {304}, year = {2003}, month = {2003/07/28/}, pages = {477 - 484}, abstract = {A certain two-person infinite game (between {\textquotedblleft}Robin Hood{\textquotedblright} and the {\textquotedblleft}Sheriff{\textquotedblright}) has been studied in the context of set theory. In certain cases, it is known that for any deterministic strategy of Robin Hood{\textquoteright}s, if the Sheriff knows Robin Hood{\textquoteright}s strategy, he can adapt a winning counter-strategy. We show that in these cases, Robin Hood wins with {\textquotedblleft}probability one{\textquotedblright} if he adopts a natural random strategy. We then characterize when this random strategy has the almost-surely winning property. We also explore the case of a random Sheriff versus a deterministic Robin Hood.}, keywords = {Games, Randomized strategy, STRATEGY}, isbn = {0304-3975}, doi = {10.1016/S0304-3975(03)00289-5}, url = {http://www.sciencedirect.com/science/article/pii/S0304397503002895}, author = {Gasarch,William and Golub,Evan and Srinivasan, Aravind} } @conference {16141, title = {Which comes first, usability or utility?}, booktitle = {Proceedings of the 14th IEEE Visualization 2003 (VIS{\textquoteright}03)}, series = {VIS {\textquoteright}03}, year = {2003}, month = {2003///}, pages = {112{\textendash} - 112{\textendash}}, publisher = {IEEE Computer Society}, organization = {IEEE Computer Society}, address = {Washington, DC, USA}, isbn = {0-7695-2030-8}, doi = {10.1109/VISUAL.2003.1250426}, url = {http://dx.doi.org/10.1109/VISUAL.2003.1250426}, author = {Grinstein,Georges and Kobsa,Alfred and Plaisant, Catherine and Shneiderman, Ben and Stasko,John T} } @article {13414, title = {AAAI 2002 Workshops}, journal = {AI Magazine}, volume = {23}, year = {2002}, month = {2002/12/15/}, pages = {113 - 113}, isbn = {0738-4602}, doi = {10.1609/aimag.v23i4.1678}, url = {http://www.aaai.org/ojs/index.php/aimagazine/article/viewArticle/1678}, author = {Blake,Brian and Haigh,Karen and Hexmoor,Henry and Falcone,Rino and Soh,Leen-Kiat and Baral,Chitta and McIlraith,Sheila and Gmytrasiewicz,Piotr and Parsons,Simon and Malaka,Rainer and Krueger,Antonio and Bouquet,Paolo and Smart,Bill and Kurumantani,Koichi and Pease,Adam and Brenner,Michael and desJardins, Marie and Junker,Ulrich and Delgrande,Jim and Doyle,Jon and Rossi,Francesca and Schaub,Torsten and Gomes,Carla and Walsh,Toby and Guo,Haipeng and Horvitz,Eric J and Ide,Nancy and Welty,Chris and Anger,Frank D and Guegen,Hans W and Ligozat,Gerald} } @article {15541, title = {Algorithmic issues in modeling motion}, journal = {ACM Comput. Surv.}, volume = {34}, year = {2002}, month = {2002/12//}, pages = {550 - 572}, abstract = {This article is a survey of research areas in which motion plays a pivotal role. The aim of the article is to review current approaches to modeling motion together with related data structures and algorithms, and to summarize the challenges that lie ahead in producing a more unified theory of motion representation that would be useful across several disciplines.}, keywords = {computational geometry, Computer vision, mobile networks, modeling, molecular biology, motion modeling, physical simulation, robotoics, spatio-temporal databases}, isbn = {0360-0300}, doi = {10.1145/592642.592647}, url = {http://doi.acm.org/10.1145/592642.592647}, author = {Agarwal,Pankaj K. and Guibas,Leonidas J. and Edelsbrunner,Herbert and Erickson,Jeff and Isard,Michael and Har-Peled,Sariel and Hershberger,John and Jensen,Christian and Kavraki,Lydia and Koehl,Patrice and Lin,Ming and Manocha,Dinesh and Metaxas,Dimitris and Mirtich,Brian and Mount, Dave and Muthukrishnan,S. and Pai,Dinesh and Sacks,Elisha and Snoeyink,Jack and Suri,Subhash and Wolefson,Ouri} } @article {14538, title = {Approximating the head-related transfer function using simple geometric models of the head and torso}, journal = {The Journal of the Acoustical Society of America}, volume = {112}, year = {2002}, month = {2002///}, pages = {2053 - 2053}, author = {Algazi,V. R and Duda,R. O and Duraiswami, Ramani and Gumerov, Nail A. and Tang,Z.} } @conference {18933, title = {Argument structure saturation in a constraint based model}, year = {2002}, month = {2002///}, url = {http://cognet.mit.edu/library/conferences/paper?paper_id=55048}, author = {Drury,J. and Resnik, Philip and Weinberg, Amy and Gennari,S. and Aoshima,S.} } @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.} } @conference {13729, title = {Automatic transcription of Czech language oral history in the MALACH project: resources and initial experiments}, booktitle = {Proceedings of the The 5th International Conference on Text, Speech and Dialogue}, year = {2002}, month = {2002///}, pages = {57 - 64}, author = {Oard, Douglas and Demner-Fushman,D. and Hajic,J. and Ramabhadran,B. and Gustman,S. and Byrne,WJ and Soergel,D. and Dorr, Bonnie J and Resnik, Philip and Picheny,M.} } @conference {13513, title = {Beam Search for Feature Selection in Automatic SVMDefect Classification}, booktitle = {International Conference on Pattern Recognition}, year = {2002}, month = {2002///}, pages = {212 - 215}, abstract = {Often in pattern classification problems, one tries to extract a large number of features and base the classifier decision on as much information as possible. This yields an array of features that are {\textquoteright}potentially{\textquoteright} useful. Most of the time however, large feature sets are sub-optimal in describing the samples since they tend to over-represent the data and model noise along with the useful information in the data. Selecting relevant features from the available set of features is, therefore, a challenging task. In this paper, we present an innovative feature selection algorithm called Smart Beam Search (SBS), which is used with a Support Vector Machine based classifier for automatic defect classification. This feature selection approach not only reduces the dimensionality of the feature space substantially, but also improves the classifier performance.}, author = {Gupta,P. and David Doermann and DeMenthon,D.} } @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} } @article {19075, title = {Complete genome sequence and comparative analysis of the metabolically versatile Pseudomonas putida KT2440}, journal = {Environmental microbiology}, volume = {4}, year = {2002}, month = {2002}, pages = {799 - 808}, abstract = {Pseudomonas putida is a metabolically versatile saprophytic soil bacterium that has been certified as a biosafety host for the cloning of foreign genes. The bacterium also has considerable potential for biotechnological applications. Sequence analysis of the 6.18 Mb genome of strain KT2440 reveals diverse transport and metabolic systems. Although there is a high level of genome conservation with the pathogenic Pseudomonad Pseudomonas aeruginosa (85\% of the predicted coding regions are shared), key virulence factors including exotoxin A and type III secretion systems are absent. Analysis of the genome gives insight into the non-pathogenic nature of P. putida and points to potential new applications in agriculture, biocatalysis, bioremediation and bioplastic production.}, author = {Nelson,K. E and Weinel,C. and Paulsen,IT and Dodson,RJ and Hilbert,H. and Martins dos Santos,VAP and Fouts,DE and Gill,S. R and Pop, Mihai and Holmes,M. and others} } @article {14525, title = {Computation of scattering from N spheres using multipole reexpansion}, journal = {The Journal of the Acoustical Society of America}, volume = {112}, year = {2002}, month = {2002///}, pages = {2688 - 2688}, author = {Gumerov, Nail A. and Duraiswami, Ramani} } @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 {13745, title = {Constraints on the Generation of Tense, Aspect, and Connecting Words from Temporal Expressions}, year = {2002}, month = {2002///}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {Generating language that reflects the temporal organization of represented knowledgerequires a language generation model that integrates contemporary theories of tense and aspect, temporal representations, and methods to plan text. This paper presents a model that produces event combinations and appropriate connecting words to relate them. We distinguish between inherent and non-inherent aspectual features of verbs and describe an algorithm that uses these features to select tense, aspect, and temporal connecting words for generating text based on time-stamped information. The main result of this work is the successful incorporation of constrained linguistic theories of tense and as- pect in a self-contained module called CONGEN that produces a ranked list of temporal connectives and tense/aspect possibilities from pairs of time-stamped literals. We show that the theoretical results described herein have been verified in a large-scale corpus analysis. The framework serves as the basis of a component designed to enhance the English output of a constrained generation system. }, author = {Dorr, Bonnie J and Gaasterland,T.} } @article {14672, title = {Cyclone: A safe dialect of C}, journal = {USENIX Annual Technical Conference}, year = {2002}, month = {2002///}, pages = {275 - 288}, abstract = {Cyclone is a safe dialect of C. It has been designed from the ground up to prevent the buffer overflows, format string attacks, and memory management errors that are common in C programs, while retaining C{\textquoteright}s syntax and semantics. This paper examines safety violations enabled by C{\textquoteright}s design, and shows how Cyclone avoids them, without giving up C{\textquoteright}s hallmark control over low-level details such as data representation and memory management.}, author = {Jim,T. and Morrisett,G. and Grossman,D. and Hicks, Michael W. and Cheney,J. and Wang, Y.} } @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 {18747, title = {Estimating the Optimal Number of Alternatives to Be Explored in Large Design Spaces: A Step Towards Incorporating Decision Making}, year = {2002}, month = {2002///}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.129.2905}, author = {Gupta,S.K.} } @article {13764, title = {Evaluating Arabic Retrieval from English or French Queries: The TREC-2001 Cross-Language Information Retrieval Track}, journal = {Proceedings of the Post Workshop of LREC}, year = {2002}, month = {2002///}, abstract = {The Cross-language information retrieval track at the 2001 Text Retrieval Conference (TREC-2001) produced the first large informationretrieval test collection for Arabic. The collection contains 383,872 Arabic news stories, 25 topic descriptions in Arabic, English and French from which queries can be formed, and manual (ground truth) relevance judgments for a useful subset of the topic-document combinations. This paper describes the way in which the collection was created, explains the evaluation measures that the collection is designed to support, and provides an overview of the results from the first set of experiments with the collection. The results make it possible to draw some inferences regarding the utility of the collection for post hoc evaluations. }, author = {Oard, Douglas and Gey,F.C. and Dorr, Bonnie J} } @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} } @conference {12763, title = {An experimental evaluation of linear and kernel-based methods for face recognition}, booktitle = {Applications of Computer Vision, 2002. (WACV 2002). Proceedings. Sixth IEEE Workshop on}, year = {2002}, month = {2002///}, pages = {13 - 18}, abstract = {In this paper we present the results of a comparative study of linear and kernel-based methods for face recognition. The methods used for dimensionality reduction are Principal Component Analysis (PCA), Kernel Principal Component Analysis (KPCA), Linear Discriminant Analysis (LDA) and Kernel Discriminant Analysis (KDA). The methods used for classification are Nearest Neighbor (NN) and Support Vector Machine (SVM). In addition, these classification methods are applied on raw images to gauge the performance of these dimensionality reduction techniques. All experiments have been performed on images from UMIST Face Database.}, keywords = {analysis;, classification;, component, discriminant, Face, image, Kernel, linear, Machine;, nearest, neighbor;, principal, recognition;, Support, vector}, doi = {10.1109/ACV.2002.1182137}, author = {Gupta, H. and Agrawala, Ashok K. and Pruthi, T. and Shekhar, C. and Chellapa, Rama} } @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.} } @article {18814, title = {An extraction-based verification methodology for MEMS}, journal = {Microelectromechanical Systems, Journal of}, volume = {11}, year = {2002}, month = {2002/02//}, pages = {2 - 11}, abstract = {Micromachining techniques are being increasingly used to develop miniaturized sensor and actuator systems. These system designs tend to be captured as layout, requiring extraction of the equivalent microelectromechanical circuit as a necessary step for design verification. This paper presents an extraction methodology to (re-)construct a circuit schematic representation from the layout, enabling the designer to use microelectromechanical circuit simulators to verify the functional behavior of the layout. This methodology uses a canonical representation of the given layout on which feature-based and graph-based recognition algorithms are applied to generate the equivalent extracted schematic. Extraction can be performed to either the atomic level or the functional level representation of the reconstructed circuit. The choice of level in hierarchy is governed by the trade off between simulation time and simulation accuracy of the extracted circuit. The combination of the MEMS layout extraction and lumped-parameter circuit simulation provides MEMS designers with VLSI-like tools enabling faster design cycles, and improved design productivity}, keywords = {atomic level, canonical representation, circuit schematic representation, circuit simulation, design cycles, design productivity, design verification, digital simulation, equivalent circuits, equivalent microelectromechanical circuit, extraction-based verification methodology, feature-based recognition algorithms, functional behavior, functional level, graph-based recognition algorithms, layout extraction, lumped parameter networks, lumped-parameter circuit simulation, MEMS, microelectromechanical circuit simulators, micromachining techniques, micromechanical devices, simulation accuracy, simulation time}, isbn = {1057-7157}, doi = {10.1109/84.982857}, author = {Baidya,B. and Gupta,S.K. and Mukherjee,T.} } @article {18837, title = {Generating 3D Models of MEMS Devices by Process Emulation}, volume = {ISR; TR 2002-57}, year = {2002}, month = {2002///}, institution = {Institute for Systems Research, University of Maryland, College Park}, abstract = {MEMS designers often use numerical simulation for detecting errors in the mask layout. Numerical simulation involves generating 3D models of MEMS device from the mask layout and process description. The generated models can be meshed and simulated over different domains. This report describes an efficient algorithm that can generate 3D geometric models of MEMS devices. Specifically, the algorithm emulates the manufacturing of a single functional polysilicon layer MEMS devices using the MUMPSprocess.}, keywords = {Next-Generation Product Realization Systems}, url = {http://drum.lib.umd.edu//handle/1903/6285}, author = {Bellam,S. and Gupta, Satyandra K. and Priyadarshi,A. K.} } @article {16270, title = {Genome sequence and comparative analysis of the model rodent malaria parasite Plasmodium yoelii yoelii}, journal = {Nature}, volume = {419}, year = {2002}, month = {2002/10/03/}, pages = {512 - 519}, abstract = {Species of malaria parasite that infect rodents have long been used as models for malaria disease research. Here we report the whole-genome shotgun sequence of one species, Plasmodium yoelii yoelii, and comparative studies with the genome of the human malaria parasite Plasmodium falciparum clone 3D7. A synteny map of 2,212 P. y. yoelii contiguous DNA sequences (contigs) aligned to 14 P. falciparum chromosomes reveals marked conservation of gene synteny within the body of each chromosome. Of about 5,300 P. falciparum genes, more than 3,300 P. y. yoelii orthologues of predominantly metabolic function were identified. Over 800 copies of a variant antigen gene located in subtelomeric regions were found. This is the first genome sequence of a model eukaryotic parasite, and it provides insight into the use of such systems in the modelling of Plasmodium biology and disease.}, isbn = {0028-0836}, doi = {10.1038/nature01099}, url = {http://www.nature.com/nature/journal/v419/n6906/full/nature01099.html}, author = {Carlton,Jane M. and Angiuoli,Samuel V and Suh,Bernard B. and Kooij,Taco W. and Pertea,Mihaela and Silva,Joana C. and Ermolaeva,Maria D. and Allen,Jonathan E and Jeremy D Selengut and Koo,Hean L. and Peterson,Jeremy D. and Pop, Mihai and Kosack,Daniel S. and Shumway,Martin F. and Bidwell,Shelby L. and Shallom,Shamira J. and Aken,Susan E. van and Riedmuller,Steven B. and Feldblyum,Tamara V. and Cho,Jennifer K. and Quackenbush,John and Sedegah,Martha and Shoaibi,Azadeh and Cummings,Leda M. and Florens,Laurence and Yates,John R. and Raine,J. Dale and Sinden,Robert E. and Harris,Michael A. and Cunningham,Deirdre A. and Preiser,Peter R. and Bergman,Lawrence W. and Vaidya,Akhil B. and Lin,Leo H. van and Janse,Chris J. and Waters,Andrew P. and Smith,Hamilton O. and White,Owen R. and Salzberg,Steven L. and Venter,J. Craig and Fraser,Claire M. and Hoffman,Stephen L. and Gardner,Malcolm J. and Carucci,Daniel J.} } @article {14091, title = {Identification of non-autonomous non-LTR retrotransposons in the genome of Trypanosoma cruzi}, journal = {Molecular and Biochemical Parasitology}, volume = {124}, year = {2002}, month = {2002/09/10/}, pages = {73 - 78}, abstract = {As observed for most eukaryotic cells, trypanosomatids contains non-LTR retrotransposons randomly inserted in the nuclear genome. Autonomous retroelements which, code for their own transposition, have been characterized in Trypanosoma brucei (ingi) and Trypanosoma cruzi (L1Tc), whereas non-autonomous retroelements have only been characterized in T. brucei (RIME). Here, we have characterized in the genome of Trypanosoma cruzi four complete copies of a non-autonomous non-LTR retrotransposon, called NARTc. This 0.26 kb NARTc element has the characteristics of non-LTR retrotransposons: the presence a poly(dA) tail and of a short flanking duplicated motif. Analysis of the Genome Survey Sequence databases indicated that the Trypanosoma cruzi haploid genome contains about 140 NARTc copies and about twice as many L1Tc copies. Interestingly, the NARTc and L1Tc retroelements share, with the Trypanosoma brucei ingi and RIME retrotransposons, a common sequence (the first 45 bp with 91\% identity), whereas the remaining sequences are very divergent. This suggests that these four trypanosome non-LTR retrotransposons were derived from the same common ancester and the sequence of their 5{\textquoteright}-extremity may have a functional role. In addition, the genome of Leishmania major contains the same conserved motif present in the trypanosome retroelements, whicle no transposable elements have been detected so far in Leishmania sp.}, keywords = {Ingi, L1Tc, Non-LTR retrotransposon, RIME, Trypanosoma brucei, Trypanosoma cruzi}, isbn = {0166-6851}, doi = {16/S0166-6851(02)00167-6}, url = {http://www.sciencedirect.com/science/article/pii/S0166685102001676}, author = {Bringaud,Fr{\'e}d{\'e}ric and Garc{\'\i}a-P{\'e}rez,Jos{\'e} Luis and Heras,Sara R. and Ghedin,Elodie and El-Sayed, Najib M. and Andersson,Bj{\"o}rn and Baltz,Th{\'e}o and Lopez,Manuel C.} } @conference {17243, title = {Interacting with identification technology: can it make us more secure?}, booktitle = {CHI {\textquoteright}02 extended abstracts on Human factors in computing systems}, series = {CHI EA {\textquoteright}02}, year = {2002}, month = {2002///}, pages = {564 - 565}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, keywords = {Biometrics, civil liberties, face recognition, national id card, privacy, Security}, isbn = {1-58113-454-1}, doi = {10.1145/506443.506484}, url = {http://doi.acm.org/10.1145/506443.506484}, author = {Scholtz,Jean and Johnson,Jeff and Shneiderman, Ben and Hope-Tindall,Peter and Gosling,Marcus and Phillips,Jonathon and Wexelblat,Alan} } @article {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 {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.} } @article {15511, title = {A logic-based approach to data integration}, journal = {Theory Pract. Log. Program.}, volume = {2}, year = {2002}, month = {2002/05//}, pages = {323 - 368}, abstract = {An important aspect of data integration involves answering queries using various resources rather than by accessing database relations. The process of transforming a query from the database relations to the resources is often referred to as query folding or answering queries using views, where the views are the resources. We present a uniform approach that includes as special cases much of the previous work on this subject. Our approach is logic-based using resolution. We deal with integrity constraints, negation, and recursion also within this framework.}, keywords = {Clark completion, Data integration, materialized views, query folding, resolution method, stratified databases}, isbn = {1471-0684}, doi = {10.1017/S1471068401001375}, url = {http://dx.doi.org/10.1017/S1471068401001375}, author = {Grant,John and Minker, Jack} } @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} } @article {18240, title = {Methods and apparatus for multi-layer data hiding}, volume = {:~09/427,321}, year = {2002}, month = {2002/09/24/}, abstract = {A data hiding system and method for providing a method of embedding multiple layers of hidden data into multimedia data. First, a media unit of the multimedia data is evaluated to determine an appropriate embedding procedure. Next during a first embedding pass, a ruling layer of primary hidden data is embedded into the media unit. In another embedding pass, a governing layer of secondary hidden data is embedded on top of the ruling layer. The secondary hidden data provides control information for controlling the primary hidden data and the host data. Control information such as error correction data, synchronization data, decoding data, and authentication data is embedded in the governing layer. Embedding schemes such as base domain and spectrum domain embedding are employed.}, url = {http://www.google.com/patents?id=1KYLAAAAEBAJ}, author = {Yu,Hong Heather and M. Wu and Li,Xin and Gelman,Alexander D.}, editor = {Matsushita Electric Industrial Co., Ltd.} } @conference {14524, title = {Multiple scattering from N spheres}, booktitle = {Antennas and Propagation Society International Symposium, 2002. IEEE}, volume = {2}, year = {2002}, month = {2002///}, pages = {90 - 93}, author = {Gumerov, Nail A. and Duraiswami, Ramani} } @conference {14536, title = {Numerical study of the influence of the torso on the HRTF}, booktitle = {Acoustics, Speech, and Signal Processing, 1993. ICASSP-93., 1993 IEEE International Conference on}, volume = {2}, year = {2002}, month = {2002///}, pages = {II{\textendash}II - II{\textendash}II}, author = {Gumerov, Nail A. and Duraiswami, Ramani and Tang,Z.} } @conference {13618, title = {Page classification through logical labelling}, booktitle = {Pattern Recognition, 2002. Proceedings. 16th International Conference on}, volume = {3}, year = {2002}, month = {2002///}, pages = {477 - 480 vol.3 - 477 - 480 vol.3}, abstract = {We propose an integrated approach to page classification and logical labelling. Layout is represented by a fully connected attributed relational graph that is matched to the graph of an unknown document, achieving classification and labelling simultaneously. By incorporating global constraints in an integrated fashion, ambiguity at the zone level can be reduced, providing robustness to noise and variation. Models are automatically trained from sample documents. Experimental results show promise for the classification and labelling of technical article title pages, and supports the idea of a hierarchical model base.}, keywords = {article, attributed, base;, character, classification;, constraints;, document, document;, experimental, global, graph, graph;, hierarchical, image, images;, labelling;, logical, model, noise;, OCR;, optical, page, pages;, processing;, recognition;, relational, results;, technical, theory;, title, unknown}, doi = {10.1109/ICPR.2002.1047980}, author = {Liang,Jian and David Doermann and Ma,M. and Guo,J. K} } @article {13009, title = {Phylogenetic analysis based on 18S ribosomal RNA gene sequences supports the existence of class Polyacanthocephala (Acanthocephala)}, journal = {Mol Phylogenet Evol}, volume = {23}, year = {2002}, month = {2002/05//}, pages = {288 - 292}, abstract = {Members of phylum Acanthocephala are parasites of vertebrates and arthropods and are distributed worldwide. The phylum has traditionally been divided into three classes, Archiacanthocephala, Palaeacanthocephala, and Eoacanthocephala; a fourth class, Polyacanthocephala, has been recently proposed. However, erection of this new class, based on morphological characters, has been controversial. We sequenced the near complete 18S rRNA gene of Polyacanthorhynchus caballeroi (Polyacanthocephala) and Rhadinorhynchus sp. (Palaeacanthocephala); these sequences were aligned with another 21 sequences of acanthocephalans representing the three widely recognized classes of the phylum and with 16 sequences from outgroup taxa. Phylogenetic relationships inferred by maximum-likelihood and maximum-parsimony analyses showed Archiacanthocephala as the most basal group within the phylum, whereas classes Polyacanthocephala + Eoacanthocephala formed a monophyletic clade, with Palaeacanthocephala as its sister group. These results are consistent with the view of Polyacanthocephala representing an independent class within Acanthocephala.}, doi = {10.1016/S1055-7903(02)00020-9}, author = {Garc{\'\i}a-Varela,M and Cummings, Michael P. and P{\'e}rez-Ponce de Le{\'o}n,G. and Gardner,S. L and Laclette,J. P} } @proceedings {15793, title = {Reconstructing Images of Bar Codes for Construction Site Object Recognition}, year = {2002}, month = {2002/09//}, author = {Gilsinn,David E. and Cheok,Geraldine S. and O{\textquoteright}Leary, Dianne P.} } @article {14726, title = {Region-based memory management in cyclone}, journal = {SIGPLAN Not.}, volume = {37}, year = {2002}, month = {2002/05//}, pages = {282 - 293}, abstract = {Cyclone is a type-safe programming language derived from C. The primary design goal of Cyclone is to let programmers control data representation and memory management without sacrificing type-safety. In this paper, we focus on the region-based memory management of Cyclone and its static typing discipline. The design incorporates several advancements, including support for region subtyping and a coherent integration with stack allocation and a garbage collector. To support separate compilation, Cyclone requires programmers to write some explicit region annotations, but a combination of default annotations, local type inference, and a novel treatment of region effects reduces this burden. As a result, we integrate C idioms in a region-based framework. In our experience, porting legacy C to Cyclone has required altering about 8\% of the code; of the changes, only 6\% (of the 8\%) were region annotations.}, isbn = {0362-1340}, doi = {10.1145/543552.512563}, url = {http://doi.acm.org/10.1145/543552.512563}, author = {Grossman,Dan and Morrisett,Greg and Jim,Trevor and Hicks, Michael W. and Wang,Yanling and Cheney,James} } @article {18760, title = {Sheet metal bending: forming part families for generating shared press-brake setups}, journal = {Journal of manufacturing systems}, volume = {21}, year = {2002}, month = {2002///}, pages = {329 - 349}, abstract = {Sheet metal bending press-brakes can be setup to produce more than one type of part withoutrequiring a setup change. To exploit this flexibility, we need setup planning techniques so that press-brake setups can be shared among many different parts. In this paper, we describe algorithms for partitioning a given set of parts into setup compatible part families that can be produced on the same setup. First, we present a greedy algorithm to form part family using a bottom-up approach that makes use of the mixed integer linear programming formulation for generating shared setups for each part family. Second, we present a mixed integer linear programming formulation to generate a shared setup for a given set of parts if such a setup exists. We expect that by producing many different types of parts on the same setup, we can significantly reduce the number of setup operations, improve machine tool utilization and enable cost-effective small-batch manufacturing. }, url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.138.8249\&rep=rep1\&type=pdf}, author = {Gupta,S.K. and Rajagopal,D.} } @conference {12209, title = {SpaceTree: Design evolution of a node link tree browser}, booktitle = {Proc. InfoVis}, year = {2002}, month = {2002///}, pages = {57 - 64}, author = {Plaisant, Catherine and Grosjean,J. and Bederson, Benjamin B.} } @conference {16150, title = {SpaceTree: supporting exploration in large node link tree, design evolution and empirical evaluation}, booktitle = {Information Visualization, 2002. INFOVIS 2002. IEEE Symposium on}, year = {2002}, month = {2002///}, pages = {57 - 64}, abstract = {We present a novel tree browser that builds on the conventional node link tree diagrams. It adds dynamic rescaling of branches of the tree to best fit the available screen space, optimized camera movement, and the use of preview icons summarizing the topology of the branches that cannot be expanded. In addition, it includes integrated search and filter functions. This paper reflects on the evolution of the design and highlights the principles that emerged from it. A controlled experiment showed benefits for navigation to already previously visited nodes and estimation of overall tree topology.}, keywords = {browser;, camera, data, design, diagrams;, dynamic, evolution;, experiment;, exploration;, filter, functions;, graphical, icons;, integrated, interfaces;, large, link, movement;, node, novel, optimized, rescaling;, search;, SpaceTree;, structures;, topology;, tree, user, visualisation;, visualization;}, doi = {10.1109/INFVIS.2002.1173148}, author = {Plaisant, Catherine and Grosjean,J. and Bederson, Benjamin B.} } @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} } @conference {15897, title = {Supporting access to large digital oral history archives}, booktitle = {Proceedings of the 2nd ACM/IEEE-CS joint conference on Digital libraries}, series = {JCDL {\textquoteright}02}, year = {2002}, month = {2002///}, pages = {18 - 27}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {This paper describes our experience with the creation, indexing, and provision of access to a very large archive of videotaped oral histories - 116,000 hours of digitized interviews in 32 languages from 52,000 survivors, liberators, rescuers, and witnesses of the Nazi Holocaust. It goes on to identify a set of critical research issues that must be addressed if we are to provide full and detailed access to collections of this size: issues in user requirement studies, automatic speech recognition, automatic classification, segmentation, summarization, retrieval, and user interfaces. The paper ends by inviting others to discuss use of these materials in their own research.}, keywords = {cataloging, oral history, research agenda}, isbn = {1-58113-513-0}, doi = {10.1145/544220.544224}, url = {http://doi.acm.org/10.1145/544220.544224}, author = {Gustman,Samuel and Soergel,Dagobert and Oard, Douglas and Byrne,William and Picheny,Michael and Ramabhadran,Bhuvana and Greenberg,Douglas} } @inbook {18923, title = {Theoretical and Empirical Aspects of a Planner in a Multi-agent Environment}, booktitle = {Logics in Artificial Intelligence}, series = {Lecture Notes in Computer Science}, volume = {2424}, year = {2002}, month = {2002///}, pages = {173 - 185}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {We give the theoretical foundations and empirical evaluation of a planning agent, ashop, performing HTN planning in a multi-agent environment. ashop is based on ASHOP , an agentised version of the original SHOP HTN planning algorithm, and is integrated in the IMPACT multi-agent environment. We ran several experiments involving accessing various distributed, heterogeneous information sources, based on simplified versions of noncombatant evacuation operations, NEO{\textquoteright}s. As a result, we noticed that in such realistic settings the time spent on communication (including network time) is orders of magnitude higher than the actual inference process. This has important consequences for optimisations of such planners. Our main results are: (1) using NEO{\textquoteright}s as new, more realistic benchmarks for planners acting in an agent environment, and (2) a memoization mechanism implemented on top of shop, which improves the overall performance considerably.}, keywords = {Computer science}, isbn = {978-3-540-44190-8}, url = {http://www.springerlink.com/content/10lxp56u3e9k0bdd/abstract/}, author = {Dix,J{\"u}rgen and Munoz-Avila,Hector and Nau, Dana S. and Zhang,Lingling}, editor = {Flesca,Sergio and Greco,Sergio and Ianni,Giovambattista and Leone,Nicola} } @article {14101, title = {Trypanosoma cruzi: RNA structure and post-transcriptional control of tubulin gene expression}, journal = {Experimental Parasitology}, volume = {102}, year = {2002}, month = {2002/11//}, pages = {123 - 133}, abstract = {Changes in tubulin expression are among the biochemical and morphological adaptations that occur during the life cycle of Trypanosomatids. To investigate the mechanism responsible for the differential accumulation of tubulin mRNAs in Trypanosoma cruzi, we determine the sequences of [alpha]- and [beta]-tubulin transcripts and analyzed their expression during the life cycle of the parasite. Two [beta]-tubulin mRNAs of 1.9 and 2.3~kb were found to differ mainly by an additional 369 nucleotides at the end of the 3{\textquoteright} untranslated region (UTR). Although their transcription rates are similar in epimastigotes and amastigotes, [alpha]- and [beta]-tubulin transcripts are 3- to 6-fold more abundant in epimastigotes than in trypomastigotes and amastigotes. Accordingly, the half-lives of [alpha]- and [beta]-tubulin mRNAs are significantly higher in epimastigotes than in amastigotes. Transient transfection experiments indicated that positive regulatory elements occur in the 3{\textquoteright} UTR plus downstream intergenic region of the [alpha]-tubulin gene and that both positive and negative elements occur in the equivalent regions of the [beta]-tubulin gene.Index Descriptions and Abbreviations: Kinetoplastida; Trypanosoma cruzi; tubulin; gene regulation; PCR, polymerase chain reaction; UTR, untranslated region; IR, intergenic region; SL, spliced leader; BAC, bacterial artificial chromosome.}, isbn = {0014-4894}, doi = {16/S0014-4894(03)00034-1}, url = {http://www.sciencedirect.com/science/article/pii/S0014489403000341}, author = {Bartholomeu,Daniella C. and Silva,Rosiane A. and Galv{\~a}o,Lucia M. C. and El-Sayed, Najib M. and Donelson,John E. and Teixeira,Santuza M.R.} } @conference {18765, title = {Web-based innovation alert services to support product design evolution}, year = {2002}, month = {2002///}, abstract = {Technological innovations provide an opportunity toimprove product performance and reduce cost. Therefore, design organizations are interested in monitoring technological innovations. A large number of innovations are announced every year. Monitoring them manually is very time consuming. We are developing web-based innovation-alert services that can be used to monitor and communicate information about innovations relevant to a particular product design. In this paper, we discuss the required infrastructure, relevant design issues, and our approach to developing web-based innovation alert services to support product design evolution. We also describe a prototype innovation monitoring service for computer components and an interactive tool to transform semi-structured web contents into semantic representations in XML. }, url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.198.1039\&rep=rep1\&type=pdf}, author = {Gupta,S.K. and Lin,E. and Lo,A. J. and Xu,C.} } @article {12204, title = {Zoomable user interfaces as a medium for slide show presentations}, journal = {Information Visualization}, volume = {1}, year = {2002}, month = {2002///}, pages = {35 - 35}, author = {Good,L. and Bederson, Benjamin B.} } @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} } @article {18815, title = {Automated design of sheet metal punches for bending multiple parts in a single setup}, journal = {Robotics and Computer-Integrated Manufacturing}, volume = {17}, year = {2001}, month = {2001/02//}, pages = {33 - 47}, abstract = {Sheet metal bending is a process in which bends are formed using a combination of a punch and a die. A very large number of mechanical products such as furniture panels, shelves, cabinets, housing for electro-mechanical devices, etc. are created by using the sheet metal bending process. Bending tools need to satisfy the following two criteria: (1) tools should be able to withstand bending forces, and (2) tool shapes should be such that there is no tool-part interference. In this paper, we describe a methodology for automatically designing shapes of bending punches for bending multiple parts in a single setup. We create parametric geometric models of punches. These parametric models describe the family of possible punch shapes. Using the part geometry and parametric punch shape models, we automatically generated constraints on tool parameters that eliminate the possibility of part-tool interference. We use mixed-integer techniques to identify parameters of punch shapes that result in the maximum punch strength. Finally, we perform strength analysis of the designed punch shape using finite element analysis methods, to verify that the designed punch shape is capable of withstanding the bending forces.}, keywords = {Praess planning, Punch design, Sheet metal bending}, isbn = {0736-5845}, doi = {10.1016/S0736-5845(00)00035-1}, url = {http://www.sciencedirect.com/science/article/pii/S0736584500000351}, author = {Alva,Ujval and Gupta, Satyandra K.} } @article {17568, title = {Better Approximation Guarantees for Job-Shop Scheduling}, journal = {SIAM Journal on Discrete Mathematics}, volume = {14}, year = {2001}, month = {2001///}, pages = {67 - 67}, abstract = {Job-shop scheduling is a classical NP-hard problem. Shmoys, Stein, and Wein presented the first polynomial-time approximation algorithm for this problem that has a good (polylogarithmic) approximation guarantee. We improve the approximation guarantee of their work and present further improvements for some important NP-hard special cases of this problem (e.g., in the preemptive case where machines can suspend work on operations and later resume). We also present NC algorithms with improved approximation guarantees for some NP-hard special cases.}, isbn = {08954801}, doi = {10.1137/S0895480199326104}, url = {http://link.aip.org/link/SJDMEC/v14/i1/p67/s1\&Agg=doi}, author = {Goldberg,Leslie Ann and Paterson,Mike and Srinivasan, Aravind and Sweedyk,Elizabeth} } @article {14671, title = {Cyclone User{\textquoteright}s Manual, Version 0.1. 3}, journal = {Computer Science Technical Reports}, year = {2001}, month = {2001/11/16/undef}, abstract = {The current version of this manual should be available at http://www.cs.cornell.edu/projects/cyclone/ and http://www.research.att.com/projects/cyclone/. The version here describes Cyclone Version 0.1.3, although minor changes may have occurred before the release.}, author = {Grossman,D. and Morrisett,G. and Jim,T. and Hicks, Michael W. and Wang, Y. and Cheney,J.} } @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 {18461, title = {Efficient evaluation of reverberant sound fields}, booktitle = {Applications of Signal Processing to Audio and Acoustics, 2001 IEEE Workshop on the}, year = {2001}, month = {2001///}, pages = {203 - 206}, publisher = {IEEE}, organization = {IEEE}, abstract = {An image method due to Allen and Berkley (1979) is often used to simulate the effect of reverberation in rooms. This method is relatively expensive computationally. We present a fast method for conducting such simulations using multipole expansions. For M real and image sources and N evaluation points, while the image method requires O(MN) operations, our method achieves the calculations in O(M + N) operations, resulting in a substantial speedup. Applications of our technique are also expected in simulation of virtual audio}, keywords = {AB algorithm, acoustic signal processing, architectural acoustics, audio signal processing, Computational modeling, Computer interfaces, Computer simulation, Educational institutions, image method, image sources, Impedance, Laboratories, microphone arrays, multipole expansions, Nails, performance evaluation, reverberant sound fields, reverberation, room reverberation, simulation, Simulations, speedup, virtual audio}, isbn = {0-7803-7126-7}, doi = {10.1109/ASPAA.2001.969578}, author = {Duraiswami, Ramani and Gumerov, Nail A. and Zotkin,Dmitry N and Davis, Larry S.} } @conference {12828, title = {Efficient Model Checking Via Buchi Tableau Automata*}, booktitle = {Computer aided verification: 13th International conference, CAV 2001, Paris, France, July 18-22, 2001: proceedings}, volume = {2102}, year = {2001}, month = {2001///}, pages = {38 - 38}, author = {Bhat,G. S and Cleaveland, Rance and Groce,A.} } @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} } @conference {13347, title = {Efficient stepwise selection in decomposable models}, booktitle = {Proc. UAI}, year = {2001}, month = {2001///}, pages = {128 - 135}, author = {Deshpande, Amol and Garofalakis,M. N and Jordan,M. I} } @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 {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 {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.} } @conference {18802, title = {A geometric algorithm for selecting optimal set of cutters for multi-part milling}, series = {SMA {\textquoteright}01}, year = {2001}, month = {2001///}, pages = {130 - 139}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {For the manufacture of milled parts, it is well known that the size of the cutter significantly affects the machining time. However, for small-batch manufacturing, the time spent on loading tools into the tool magazine and establishing z-length compensation values is just as important. If we can select a set of milling tools that will produce good machining time on more than one type of parts, then several unnecessary machine-tool reconfiguration operations can be eliminated. This paper describes a geometric algorithm for finding an optimal set of cutters for machining a set of 2{\textonehalf}D parts. In selecting milling cutters we consider both the tool loading time and the machining time and generate solutions that allow us to minimize the total machining time. Our problem formulation addresses the general problem of how to cover a target region to be milled with a cylindrical cutter without intersecting with the obstruction region; this definition allows us to handle both open and closed edges in the target region. Our algorithm improves upon previous work in the tool selection area in following ways: (1) in selecting cutters, it accounts for the tool loading time, and (2) it can simultaneously consider multiple different parts and select the optimal set of cutters to minimize the total manufacturing time.}, keywords = {computer-aided process planning, milling cutter selection}, isbn = {1-58113-366-9}, doi = {10.1145/376957.376973}, url = {http://doi.acm.org/10.1145/376957.376973}, author = {Yao,Zhiyang and Gupta, Satyandra K. and Nau, Dana S.} } @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} } @article {17903, title = {Haptic and aural rendering of a virtual milling process}, journal = {ASME 2001 Design Engineering Technical Conference and Computers and Information in Engineering Conference, Pittsburgh, PA}, year = {2001}, month = {2001///}, pages = {105 - 113}, author = {Chang,C. F and Varshney, Amitabh and Ge,Q. J} } @inbook {17921, title = {Hierarchical image-based and polygon-based rendering for large-scale visualizations}, booktitle = {Hierarchical and Geometrical Methods in Scientific VisualizationHierarchical and Geometrical Methods in Scientific Visualization}, year = {2001}, month = {2001///}, publisher = {Springer}, organization = {Springer}, isbn = {9783540433132}, author = {Chang,C. F and Varshney, Amitabh and Ge,Q. J} } @article {13374, title = {Independence is good: dependency-based histogram synopses for high-dimensional data}, journal = {SIGMOD Rec.}, volume = {30}, year = {2001}, month = {2001/05//}, pages = {199 - 210}, abstract = {Approximating the joint data distribution of a multi-dimensional data set through a compact and accurate histogram synopsis is a fundamental problem arising in numerous practical scenarios, including query optimization and approximate query answering. Existing solutions either rely on simplistic independence assumptions or try to directly approximate the full joint data distribution over the complete set of attributes. Unfortunately, both approaches are doomed to fail for high-dimensional data sets with complex correlation patterns between attributes. In this paper, we propose a novel approach to histogram-based synopses that employs the solid foundation of statistical interaction models to explicitly identify and exploit the statistical characteristics of the data. Abstractly, our key idea is to break the synopsis into (1) a statistical interaction model that accurately captures significant correlation and independence patterns in data, and (2) a collection of histograms on low-dimensional marginals that, based on the model, can provide accurate approximations of the overall joint data distribution. Extensive experimental results with several real-life data sets verify the effectiveness of our approach. An important aspect of our general, model-based methodology is that it can be used to enhance the performance of other synopsis techniques that are based on data-space partitioning (e.g., wavelets) by providing an effective tool to deal with the {\textquotedblleft}dimensionality curse{\textquotedblright}.}, isbn = {0163-5808}, doi = {10.1145/376284.375685}, url = {http://doi.acm.org/10.1145/376284.375685}, author = {Deshpande, Amol and Garofalakis,Minos and Rastogi,Rajeev} } @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} } @article {18731, title = {Intelligent assembly modeling and simulation}, journal = {Assembly Automation}, volume = {21}, year = {2001}, month = {2001///}, pages = {215 - 235}, abstract = {Because of the intense competition in the current global economy, a company must conceive, design, and manufacture new products quickly and inexpensively. The design cycle can be shortened through simulation. Rapid technical advances in many different areas of scientific computing provide the enabling technologies for creating a comprehensive simulation and visualization environment for assembly design and planning. An intelligent environment has been built in which simple simulation tools can be composed into complex simulations for detecting potential assembly problems. The goal in this research is to develop high fidelity assembly simulation and visualization tools that can detect assembly related problems without going through physical mock-ups. In addition, these tools can be used to create easy-to-visualize instructions for performing assembly and service operations.}, url = {http://www.ingentaconnect.com/content/mcb/033/2001/00000021/00000003/art00004}, author = {Gupta,S.K. and Paredis,C. J. J. and Sinha,R.} } @inbook {13801, title = {Interpretation of Compound Nominals Using WordNet}, booktitle = {Computational Linguistics and Intelligent Text ProcessingComputational Linguistics and Intelligent Text Processing}, series = {Lecture Notes in Computer Science}, volume = {2004}, year = {2001}, month = {2001///}, pages = {169 - 181}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {We describe an approach to interpreting noun-noun compounds within a question answering system. The system{\textquoteright}s lexicon, based on WordNet, provides the basis for heuristics that group noun-noun compounds with seman- tically similar words. The semantic relationship between the nouns in a com- pound is determined by the choice of heuristic for the compound. We discuss procedures for selecting one heuristic in cases where several can apply to a compound, the effects of lexical ambiguity, and some initial results of our methods.}, isbn = {978-3-540-41687-6}, url = {http://dx.doi.org/10.1007/3-540-44686-9_17}, author = {Barrett,Leslie and Davis,Anthony and Dorr, Bonnie J}, editor = {Gelbukh,Alexander} } @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 {13826, title = {Mapping lexical entries in a verbs database to WordNet senses}, booktitle = {Proceedings of the 39th Annual Meeting on Association for Computational Linguistics}, series = {ACL {\textquoteright}01}, year = {2001}, month = {2001///}, pages = {244 - 251}, publisher = {Association for Computational Linguistics}, organization = {Association for Computational Linguistics}, address = {Stroudsburg, PA, USA}, abstract = {This paper describes automatic techniques for mapping 9611 entries in a database of English verbs to WordNet senses. The verbs were initially grouped into 491 classes based on syntactic features. Mapping these verbs into WordNet senses provides a resource that supports disambiguation in multilingual applications such as machine translation and cross-language information retrieval. Our techniques make use of (1) a training set of 1791 disambiguated entries, representing 1442 verb entries from 167 classes; (2) word sense probabilities, from frequency counts in a tagged corpus; (3) semantic similarity of WordNet senses for verbs within the same class; (4) probabilistic correlations between WordNet data and attributes of the verb classes. The best results achieved 72\% precision and 58\% recall, versus a lower bound of 62\% precision and 38\% recall for assigning the most frequently occurring WordNet sense, and an upper bound of 87\% precision and 75\% recall for human judgment.}, doi = {10.3115/1073012.1073044}, url = {http://dx.doi.org/10.3115/1073012.1073044}, author = {Green,Rebecca and Pearl,Lisa and Dorr, Bonnie J and Resnik, Philip} } @article {13827, title = {Mapping WorldNet Senses to a Lexical Database of Verbs}, year = {2001}, month = {2001/01//}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {This paper describes automatic techniques for mapping 9611 semantically classified English verbs to WordNet senses. The verbs were initially grouped into 491 semantic classes based on syntactic categories; they were then mapped into WordNet senses according to three pieces of information: (1) prior probability of WordNet senses; (2) semantic similarity of WordNet senses for verbs within the same category; and (3) probabilistic correlations between WordNet relationship and verb frame data. Our techniques make use of a training set of 1791 disambiguated entries representing 1442 verbs occurring in 167 of the categories. The best results achieved .58 recall and .72 precision, versus a lower bound of .38 recall and .62 precision for assigning the most frequently occurring WordNet sense, and an upper bound of .75 recall and .87 precision for human judgment.}, keywords = {*DATA BASES, *ENGLISH LANGUAGE, *LEXICAL DATABASES, *LEXICOGRAPHY, *MAPPING, *VERBS, *WORD MAPPING, *WORDNET, AMBIGUITY, correlation, FRAMES, Frequency, INFORMATION SCIENCE, JUDGEMENT(PSYCHOLOGY), linguistics, PRECISION, probability, RECALL, semantics, syntax, WORDS(LANGUAGE), WSD(WORD SENSE DISAMBIGUATION)}, url = {http://stinet.dtic.mil/oai/oai?\&verb=getRecord\&metadataPrefix=html\&identifier=ADA458846}, author = {Green,Rebecca and Pearl,Lisa and Dorr, Bonnie J} } @conference {14529, title = {Modeling the effect of a nearby boundary on the HRTF}, booktitle = {2001 IEEE International Conference on Acoustics, Speech, and Signal Processing, 2001. Proceedings. (ICASSP {\textquoteright}01)}, volume = {5}, year = {2001}, month = {2001///}, pages = {3337-3340 vol.5 - 3337-3340 vol.5}, publisher = {IEEE}, organization = {IEEE}, abstract = {Understanding and simplified modeling of the head related transfer function (HRTF) holds the key to many applications in spatial audio. We develop an analytical solution to the problem of scattering of sound from a sphere in the vicinity of an infinite plane. Using this solution we study the influence of a nearby scattering rigid surface, on a spherical model for the HRTF}, keywords = {Acoustic scattering, acoustic signal processing, acoustic wave reflection, acoustic wave scattering, architectural acoustics, audio signal processing, Biological system modeling, boundary effect modeling, Computer interfaces, Ear, Educational institutions, Frequency, Head related transfer function, HRTF, HUMANS, infinite plane, Laboratories, Nails, Raman scattering, rigid surface, room environment, sound pressure level, sound scattering, spatial audio, sphere, spherical model, Transfer functions, wall influence}, isbn = {0-7803-7041-4}, doi = {10.1109/ICASSP.2001.940373}, author = {Gumerov, Nail A. and Duraiswami, Ramani} } @conference {18465, title = {Multimodal localization of a flying bat}, booktitle = {Acoustics, Speech, and Signal Processing, IEEE International Conference on}, volume = {5}, year = {2001}, month = {2001///}, pages = {3057 - 3060}, publisher = {IEEE Computer Society}, organization = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, abstract = {We present a new multimodal system that combines stereoscopic and audio-based source localization to track the position of a flying bat. Also presented are novel algorithms for audio source localization. The bat was allowed to fly in an anechoic room and monitored by two high-speed video cameras. The vocalizations of the bat were simultaneously recorded from six microphones. The data was then processed offline to localize the source and reconstruct the trajectory of the bat. We compare the performance of the localization algorithm with the position data obtained from stereoscopic pictures of the bat. The results confirm that the stereoscopic analysis and the audio localization are in good agreement. This system opens up new possibilities for performing multimodal research, and developing more tightly integrated algorithms.}, isbn = {0-7803-7041-4}, doi = {http://doi.ieeecomputersociety.org/10.1109/ICASSP.2001.940303}, author = {Ghose,K. and Zotkin,Dmitry N and Duraiswami, Ramani and Moss,C.F.} } @article {14439, title = {Multi-Relational Data Mining using Probabilistic Models Research Summary}, journal = {Proc. Of 1st workshop in MRDM}, year = {2001}, month = {2001///}, abstract = {We are often faced with the challenge of mining data represented inrelational form. Unfortunately, most statistical learning methods work only with {\textquotedblleft}flat{\textquotedblright} data representations. Thus, to apply these methods, we are forced to con- vert the data into a flat form, thereby not only losing its compact representa- tion and structure but also potentially introducing statistical skew. These draw- backs severely limit the ability of current statistical methods to mine relational databases. Probabilistic models, in particular probabilistic relational models, al- low us to represent a statistical model over a relational domain. These models can represent correlations between attributes within a single table, and between attributes in multiple tables, when these tables are related via foreign key joins. In previous work [4, 6, 8], we have developed algorithms for automatically con- structing a probabilistic relational model directly from a relational database. We survey the results here and describe how the methods can be used to discover interesting dependencies the data. We show how this class of models and our construction algorithm are ideally suited to mining multi-relational data. }, author = {Getoor, Lise} } @conference {14402, title = {Multi-relational data mining using probabilistic relational models: research summary}, booktitle = {In Proceedings of the First Workshop in Multi-relational Data Mining}, year = {2001}, month = {2001///}, abstract = {We are often faced with the challenge of mining data represented in relational form. Unfortunately, most statistical learning methods work only with {\textquotedblleft}flat {\textquotedblright} 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 mine relational databases. Probabilistic models, in particular probabilistic relational models, allow us to represent a statistical model over a relational domain. These models can represent correlations between attributes within a single table, and between attributes in multiple tables, when these tables are related via foreign key joins. In previous work [4, 6, 8], we have developed algorithms for automatically constructing a probabilistic relational model directly from a relational database. We survey the results here and describe how the methods can be used to discover interesting dependencies the data. We show how this class of models and our construction algorithm are ideally suited to mining multi-relational data.}, author = {Getoor, Lise} } @conference {17824, title = {Optimal Agent Selection}, booktitle = {KI 2001: advances in artificial intelligence: Joint German/Austrian Conference on AI, Vienna, Austria, September 19-21, 2001: proceedings}, year = {2001}, month = {2001///}, pages = {2 - 2}, abstract = {The Internet contains a vast array of sources that provide identical or similar services. When an agent needs to solve a problem, it may split the problem into {\textquotedblleft}subproblems{\textquotedblright} and find an agent to solve each of the subproblems. Later, it may combine the results of these subproblems to solve the original problem. In this case, the agent is faced with the task of determining to which agents to assign the subproblems.We call this the agent selection problem (ASP for short). Solving ASP is complex because it must take into account several different parameters. For instance, different agents might take different amounts of time to process a request. Different agents might provide varying {\textquotedblleft}qualities{\textquotedblright} of answers. Network latencies associated with different agents might vary. In this paper, we first formalize the agent selection problem and show that it is NP-hard. We then propose a generic cost function that is general enough to take into account the costs of (i) network and server loads, (ii) source computations, and (iii) internal mediator costs. We then develop exact and heuristic based algorithms to solve the agent selection problem.}, author = {Ozcan,F. and V.S. Subrahmanian and Golubchik,L.} } @article {15601, title = {A point-placement strategy for conforming Delaunay tetrahedralization}, journal = {International Journal of Computational Geometry \& Applications}, volume = {11}, year = {2001}, month = {2001///}, pages = {669 - 682}, abstract = {A strategy is presented to find a set of points that yields a Conforming Delaunay tetrahedralization of a three-dimensional Piecewise-Linear complex (PLC). This algorithm is novel because it imposes no angle restrictions on the input PLC. In the process, an algorithm is described that computes a planar conforming Delaunay triangulation of a Planar Straight-Line Graph (PSLG) such that each triangle has a bounded circumradius, which may be of independent interest.}, doi = {10.1142/S0218195901000699}, author = {Mount, Dave and Gable,C. W} } @conference {14400, title = {Probabilistic models of relational structure}, booktitle = {In Proc. ICML}, year = {2001}, month = {2001///}, abstract = {Most real-world data is stored in relational form. In contrast, 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 structure. The recently introduced framework of probabilistic relational models (PRMs) allows us to represent 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 relational 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 predict relational structure and, moreover, the observed relational structure can be used to provide better predictions for the attributes in the model.}, author = {Getoor, Lise and Friedman,N. and Taskar,B.} } @article {14399, title = {Probabilistic models of text and link structure for hypertext classification}, journal = {IJCAI workshop on text learning: beyond supervision}, year = {2001}, month = {2001///}, pages = {24 - 29}, abstract = {Most text classification methods treat each document as anindependent instance. However, in many text domains, doc- uments are linked and the topics of linked documents are cor- related. For example, web pages of related topics are often connected by hyperlinks and scientific papers from related fields are commonly linked by citations. We propose a unified probabilistic model for both the textual content and the link structure of a document collection. Our model is based on the recently introduced framework of Probabilistic Relational Models (PRMs), which allows us to capture cor- relations between linked documents. We show how to learn these models from data and use them efficiently for classifi- cation. Since exact methods for classification in these large models are intractable, we utilize belief propagation, an ap- proximate inference algorithm. Belief propagation automat- ically induces a very natural behavior, where our knowledge about one document helps us classify related ones, which in turn help us classify others. We present preliminary empiri- cal results on a dataset of university web pages. }, author = {Getoor, Lise and Segal,E. and Taskar,B. and Koller,D.} } @article {18710, title = {Rescuing a destabilized protein fold through backbone cyclization}, journal = {Journal of Molecular Biology}, volume = {308}, year = {2001}, month = {2001/05/18/}, pages = {1045 - 1062}, abstract = {We describe the physicochemical characterization of various circular and linear forms of the \~{}60 residue N-terminal Src homology 3 (SH3) domain from the murine c-Crk adapter protein. Structural, dynamic, thermodynamic, kinetic and biochemical studies reveal that backbone circularization does not prevent the adoption of the natural folded structure in any of the circular proteins. Both the folding and unfolding rate of the protein increased slightly upon circularization. Circularization did not lead to a significant thermodynamic stabilization of the full-length protein, suggesting that destabilizing enthalpic effects (e.g. strain) negate the expected favorable entropic contribution to overall stability. In contrast, we find circularization results in a dramatic stabilization of a truncated version of the SH3 domain lacking a key glutamate residue. The ability to rescue the destabilized mutant indicates that circularization may be a useful tool in protein engineering programs geared towards generating minimized proteins.}, keywords = {circular protein, ligation, SH3 domain}, isbn = {0022-2836}, doi = {10.1006/jmbi.2001.4631}, url = {http://www.sciencedirect.com/science/article/pii/S0022283601946315}, author = {Camarero,Julio A and Fushman, David and Sato,Satoshi and Giriat,Izabela and Cowburn,David and Raleigh,Daniel P and Muir,Tom W} } @conference {15592, title = {Robust matching of wavelet features for sub-pixel registration of Landsat data}, booktitle = {Geoscience and Remote Sensing Symposium, 2001. IGARSS {\textquoteright}01. IEEE 2001 International}, volume = {2}, year = {2001}, month = {2001///}, pages = {706 -708 vol.2 - 706 -708 vol.2}, abstract = {For many Earth and space science applications, automatic geo-registration at sub-pixel accuracy has become a necessity. In this work, we are focusing on building an operational system, which will provide a sub-pixel accuracy registration of Landsat-5 and Landsat-7 data. The input to our registration method consists of scenes that have been geometrically and radiometrically corrected. Such preprocessed scenes are then geo-registered relative to a database of Landsat chips. The method assumes a transformation composed of a rotation and a translation, and utilizes rotation- and translation-invariant wavelets to extract image features that are matched using statistically robust feature matching and a partial Hausdorff distance metric. The registration process is described and results on four Landsat input scenes of the Washington, D.C., area are presented}, keywords = {Feature extraction, geo-registration, geophysical measurement technique, geophysical signal processing, geophysical techniques, Hausdorff distance metric, image registration, infrared, IR, land surface, Landsat, Landsat-5, Landsat-7, multispectral remote sensing, robust feature matching, robust matching, sub pixel registration, subpixel accuracy, terrain mapping, visible, wavelet feature, wavelet method, Wavelet transforms}, doi = {10.1109/IGARSS.2001.976609}, author = {Le Moigne,J. and Netanyahu,N. S and Masek,J. G and Mount, Dave and Goward, S.N.} } @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 {16158, title = {Understanding Manufacturing Systems with a Learning Historian for User-Directed Experimentation}, volume = {CS-TR-4243}, year = {2001}, month = {2001///}, institution = {Department of Computer Science, University of Maryland, College Park}, abstract = {This paper describes a learning historian to improve user-directed experimentation withdiscrete event simulation models of manufacturing systems. In user-directed experimentation, an analyst conducts simulation runs to estimate system performance. Then the analyst modifies the simulation model to evaluate other possibilities. An important characteristic is the ad hoc nature of the experimentation, as the analyst forms and runs new trials based on the results from previous trials. Through user-directed experimentation designers compare alternatives and students learn the relationships between input parameters and performance measures. Recording and reviewing previous trials while using simulation models enhances their benefits, transforming trial-and-error into learning. The learning historian combines a graphical user interface, a discrete event simulation model, and dynamic data visualization. Usability studies indicate that the learning historian is a usable and useful tool because it allows users to concentrate more on understanding system behavior than on operating simulation software. }, author = {Chipman,G. and Plaisant, Catherine and Gahagan,S. and Herrmann,J.W. and Hewitt,S. and Reaves,L.} } @article {17945, title = {Web-based interactive design of freeform motions}, journal = {Proceedings of the ASME 2001 Design Engineering Technical Conferences and Computers and Information in Engineering Conference}, year = {2001}, month = {2001///}, author = {Li,ST and Ge,Q. J and Varshney, Amitabh} } @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 {18789, title = {Automated design of sheet metal bending tools}, year = {2000}, month = {2000///}, abstract = {Sheet metal bending is a process in which bends are formed using a combination of apunch and a die. Bending tools need to satisfy the following two criteria: (1) tools should be able to withstand bending forces, and (2) tool shapes should be such that there is no tool-part interference. In this paper, we describe a systematic methodology for automatically synthesizing a punch shape that can be used to produce more than one type of part. We create a parametric geometric model of possible punches. This parametric model describes a family of possible punch shapes. Using the geometric models of various given part types and a parametric punch model, we automatically generate constraints on punch parameters that eliminate the possibility of part-tool interference. We use mixed integer programming techniques to solve these constraints and identify parameters of a punch shape that can work for the given set of parts. Finally, we perform strength analysis of the designed punch to verify that the designed punch is capable of withstanding the bending forces. }, url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.34.5031\&rep=rep1\&type=pdf}, author = {Alva,U. and Gupta,S.K. and Gupta,R. K.} } @article {14866, title = {Class representation and image retrieval with non-metric distances}, journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence (TPAMI)}, volume = {22}, year = {2000}, month = {2000///}, pages = {1 - 1}, abstract = {One of the key problems in appearance-based vision is understanding how to use a set oflabeled images to classify new images. Classification systems that can model human perfor- mance, or that use robust image matching methods, often make use of similarity judgments that are non-metric; but when the triangle inequality is not obeyed, most existing pattern recogni- tion techniques are not applicable. We note that exemplar-based (or nearest-neighbor) methods can be applied naturally when using a wide class of non-metric similarity functions. The key issue, however, is to find methods for choosing good representatives of a class that accurately characterize it. We show that existing condensing techniques for finding class representatives are ill-suited to deal with non-metric dataspaces. We then focus on developing techniques for solving this problem, emphasizing two points: First, we show that the distance between two images is not a good measure of how well one image can represent another in non-metric spaces. Instead, we use the vector correlation between the distances from each image to other previously seen images. Second, we show that in non-metric spaces, boundary points are less significant for capturing the structure of a class than they are in Euclidean spaces. We suggest that atypical points may be more important in describing classes. We demonstrate the importance of these ideas to learning that generalizes from experience by improving performance using both synthetic and real images. }, author = {Jacobs, David W. and Weinshall,D. and Gdalyahu,Y.} } @article {14891, title = {Classification with nonmetric distances: image retrieval and class representation}, journal = {Pattern Analysis and Machine Intelligence, IEEE Transactions on}, volume = {22}, year = {2000}, month = {2000/06//}, pages = {583 - 600}, abstract = {A key problem in appearance-based vision is understanding how to use a set of labeled images to classify new images. Systems that model human performance, or that use robust image matching methods, often use nonmetric similarity judgments; but when the triangle inequality is not obeyed, most pattern recognition techniques are not applicable. Exemplar-based (nearest-neighbor) methods can be applied to a wide class of nonmetric similarity functions. The key issue, however, is to find methods for choosing good representatives of a class that accurately characterize it. We show that existing condensing techniques are ill-suited to deal with nonmetric dataspaces. We develop techniques for solving this problem, emphasizing two points: First, we show that the distance between images is not a good measure of how well one image can represent another in nonmetric spaces. Instead, we use the vector correlation between the distances from each image to other previously seen images. Second, we show that in nonmetric spaces, boundary points are less significant for capturing the structure of a class than in Euclidean spaces. We suggest that atypical points may be more important in describing classes. We demonstrate the importance of these ideas to learning that generalizes from experience by improving performance. We also suggest ways of applying parametric techniques to supervised learning problems that involve a specific nonmetric distance functions, showing how to generalize the idea of linear discriminant functions in a way that may be more useful in nonmetric spaces}, keywords = {appearance-based, by, classification;image, correlation;correlation, dataspaces;nonmetric, distances;nonmetric, example;, functions;nonmetric, image, inequality;vector, judgments;robust, MATCHING, methods;image, methods;nonmetric, methods;triangle, points;boundary, points;class, representation;exemplar-based, representation;image, retrieval;learning, retrieval;nearest-neighbor, similarity, vision;atypical}, isbn = {0162-8828}, doi = {10.1109/34.862197}, author = {Jacobs, David W. and Weinshall,D. and Gdalyahu,Y.} } @article {17579, title = {Contention resolution with constant expected delay}, journal = {J. ACM}, volume = {47}, year = {2000}, month = {2000/11//}, pages = {1048 - 1096}, abstract = {We study contention resolution in a multiple-access channel such as the Ethernet channel. In the model that we consider, n users generate messages for the channel according to a probability distribution. Raghavan and Upfal have given a protocol in which the expected delay (time to get serviced) of every message is O(log n) when messages are generated according to a Bernoulli distribution with generation rate up to about 1/10. Our main results are the following protocols: (a) one in which the expected average message delay is O(1) when messages are generated according to a Bernoulli distribution with a generation rate smaller than 1/e, and (b) one in which the expected delay of any message is O(1) for an analogous model in which users are synchronized (i.e., they agree about the time), there are potentially an infinite number of users, and messages are generated according to a Poisson distribution with generation rate up to 1/e. (Each message constitutes a new user.)To achieve (a), we first show how to simulate (b) using n synchronized users, and then show how to build the synchronization into the protocol.}, keywords = {contention resolution, Ethernet, Markov chains, multiple-access channel}, isbn = {0004-5411}, doi = {10.1145/355541.355567}, url = {http://doi.acm.org/10.1145/355541.355567}, author = {Goldberg,Leslie Ann and Mackenzie,Philip D. and Paterson,Mike and Srinivasan, Aravind} } @article {17043, title = {Credit for computer crashes?}, journal = {Ubiquity}, volume = {1}, year = {2000}, month = {2000///}, pages = {2 - 9}, author = {Gehl,J. and Shneiderman, Ben} } @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} } @article {14535, title = {Dynamics of vapor bubbles with nonequilibrium phase transitions in isotropic acoustic fields}, journal = {Physics of Fluids}, volume = {12}, year = {2000}, month = {2000///}, pages = {71 - 71}, author = {Gumerov, Nail A.} } @conference {18769, title = {Finding the maximal cutter for 2-D milling operations}, year = {2000}, month = {2000///}, pages = {10 - 13}, abstract = {In this paper, we describe a new geometricalgorithm to determine the biggest feasible cutter size for 2-D milling operations to be performed using a single cutter. In particular: {\textbullet} We give a general definition of the problem as the task of covering a target region without interfering with an obstruction region. This definition encompasses the task of milling a general 2-D profile that includes both open and closed edges. {\textbullet} We discuss three alternative definitions of what it means for a cutter to be feasible, and explain which of these definitions is most appropriate for the above problem. {\textbullet} We present a geometric algorithm for finding the maximal cutter for 2-D milling operations, and we give an outline of a proof that our algorithm is correct. }, url = {http://www.cs.umd.edu/~nau/papers/yao2000finding.pdf}, author = {Yao,Z. and Gupta,S.K. and Nau, Dana S.} } @article {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 {18960, title = {The genome sequence of Drosophila melanogaster}, journal = {Science}, volume = {287}, year = {2000}, month = {2000///}, pages = {2185 - 2185}, abstract = {The fly Drosophila melanogaster is one of the most intensively studied organisms in biology and serves as a model system for the investigation of many developmental and cellular processes common to higher eukaryotes, including humans. We have determined the nucleotide sequence of nearly all of the \~{}120-megabase euchromatic portion of theDrosophila genome using a whole-genome shotgun sequencing strategy supported by extensive clone-based sequence and a high-quality bacterial artificial chromosome physical map. Efforts are under way to close the remaining gaps; however, the sequence is of sufficient accuracy and contiguity to be declared substantially complete and to support an initial analysis of genome structure and preliminary gene annotation and interpretation. The genome encodes \~{}13,600 genes, somewhat fewer than the smaller Caenorhabditis elegansgenome, but with comparable functional diversity.}, isbn = {0036-8075, 1095-9203}, doi = {10.1126/science.287.5461.2185}, url = {http://www.sciencemag.org/content/287/5461/2185}, author = {Adams,M.D. and Celniker,S.E. and Holt,R.A. and Evans,C.A. and Gocayne,J.D. and Amanatides,P.G. and Scherer,S.E. and Li,P.W. and Hoskins,R.A. and Galle,R.F. and others} } @article {18800, title = {A Geometric Algorithm for Finding the Largest Milling Cutter}, volume = {ISR; TR 2000-40}, year = {2000}, month = {2000///}, institution = {Institute for Systems Research, University of Maryland, College Park}, abstract = {In this paper, we describe a new geometric algorithm to determine the largest feasible cutter size for2-D milling operations to be performed using a single cutter. In particular:

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

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

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

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

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

Our research illustrates the multiple parts process planning approach that is suitable for small batch manufacturing. At the same time, the algorithm given in this paper clarifies the 2-1/2D milling problem and can also help in cutter path planning problem.}, keywords = {algorithms, computer aided manufacturing CAM, cutter selection, Manufacturing, multi-part process planning, Next-Generation Product Realization Systems, OPTIMIZATION}, url = {http://drum.lib.umd.edu//handle/1903/6139}, author = {Yao,Zhiyang and Gupta, Satyandra K. and Nau, Dana S.} } @conference {15591, title = {Geo-registration of Landsat data by robust matching of wavelet features}, booktitle = {Geoscience and Remote Sensing Symposium, 2000. Proceedings. IGARSS 2000. IEEE 2000 International}, volume = {4}, year = {2000}, month = {2000///}, pages = {1610 -1612 vol.4 - 1610 -1612 vol.4}, abstract = {The goal of our project is to build an operational system, which will provide a sub-pixel accuracy registration of Landsat-5 and Landsat-7 data. Integrated within an automated mass processing/analysis system for Landsat data (REALM), the input to our registration method consists of scenes that have been geometrically and radiometrically corrected, as well as pre-processed for the detection of clouds and cloud shadows. Such pre-processed scenes are then geo-registered relative to a database of Landsat chips. This paper describes our registration process, including the use of a database of landmark chips, a feature extraction performed by an overcomplete wavelet representation, and feature matching using statistically robust techniques. Knowing the approximate longitudes and latitudes of the four corners of the scene, a subset of chips which represent landmarks included in the scene are extracted from the database. For each of these selected landmark chips, a corresponding window is extracted from the scene, and each chip-window pair is registered using our robust wavelet feature matching. First results and future directions are presented in the paper}, keywords = {atmospheric techniques, automated mass processing/analysis system, chip-window pair, cloud shadows, Clouds, Feature extraction, feature matching, geo-registration, geometrically corrected scene, geophysical signal processing, Image matching, image registration, landmark chips, Landsat chips, Landsat data, Landsat-5 data, Landsat-7 data, overcomplete wavelet representation, pre-processed scenes, radiometrically corrected scene, REALM, Remote sensing, robust matching, robust wavelet feature matching, scenes, statistically robust techniques, sub-pixel accuracy registration, wavelet features, Wavelet transforms, window}, doi = {10.1109/IGARSS.2000.857287}, author = {Le Moigne,J. and Netanyahu,N. S and Masek,J. G and Mount, Dave and Goward,S. and Honzak,M.} } @article {14523, title = {An inverse method for the acoustic detection, localization and determination of the shape evolution of a bubble}, journal = {Inverse Problems}, volume = {16}, year = {2000}, month = {2000///}, pages = {1741 - 1741}, author = {Gumerov, Nail A. and Chahine,G. L} } @conference {12168, title = {Jazz: an extensible zoomable user interface graphics toolkit in Java}, booktitle = {Proceedings of the 13th annual ACM symposium on User interface software and technology}, year = {2000}, month = {2000///}, pages = {171 - 180}, author = {Bederson, Benjamin B. and Meyer,J. and Good,L.} } @article {14357, title = {Learning probabilistic relational models}, journal = {Abstraction, Reformulation, and Approximation}, year = {2000}, month = {2000///}, pages = {322 - 323}, abstract = {My work is on learning Probabilistic Relational Models (PRMs) from structured data (e.g., data in a relational database, an object-oriented database or a frame-based system). This work has as a starting point the framework of Probabilistic Relational Models, introduced in [5, 7]. We adapt and extend the machinery that has been developed over the years for learning Bayesian networks from data [1, 4, 6] to the task of learning PRMs from structured data. At the heart of this work is a search algorithm that explores the space of legal models using search operators that abstract or refine the model.}, doi = {10.1007/3-540-44914-0_25}, author = {Getoor, Lise} } @article {16494, title = {Learning response time for websources using query feedback and application in query optimization}, journal = {The VLDB Journal{\textemdash}The International Journal on Very Large Data Bases}, volume = {9}, year = {2000}, month = {2000///}, pages = {18 - 37}, author = {Gruser,J. R and Raschid, Louiqa and Zadorozhny,V. and Zhan,T.} } @article {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 {16479, title = {Logic-based query optimization for object databases}, journal = {IEEE Transactions on Knowledge and Data Engineering}, volume = {12}, year = {2000}, month = {2000/08//Jul}, pages = {529 - 547}, abstract = {We present a technique for transferring query optimization techniques, developed for relational databases, into object databases. We demonstrate this technique for ODMG database schemas defined in ODL and object queries expressed in OQL. The object schema is represented using a logical representation (Datalog). Semantic knowledge about the object data model, e.g., class hierarchy information, relationship between objects, etc., as well as semantic knowledge about a particular schema and application domain are expressed as integrity constraints. An OQL object query is represented as a logic query and query optimization is performed in the Datalog representation. We obtain equivalent (optimized) logic queries, and subsequently obtain equivalent (optimized) OQL queries for each equivalent logic query. We present one optimization technique for semantic query optimization (SQO) based on the residue technique of U. Charavarthy et al. (1990; 1986; 1988). We show that our technique generalizes previous research on SQO for object databases. We handle a large class of OQL queries, including queries with constructors and methods. We demonstrate how SQO can be used to eliminate queries which contain contradictions and simplify queries, e.g., by eliminating joins, or by reducing the access scope for evaluating a query to some specific subclass(es). We also demonstrate how the definition of a method or integrity constraints describing the method, can be used in optimizing a query with a method}, keywords = {access scope, application domain, class hierarchy information, Constraint optimization, data integrity, Data models, Datalog, Datalog representation, deductive databases, equivalent logic query, integrity constraints, Lifting equipment, Logic, logic based query optimization, logic programming, logic queries, logic query, logical representation, object data model, object databases, object queries, object schema, object-oriented databases, ODL, ODMG database schemas, optimization technique, optimized OQL queries, OQL object query, query languages, Query optimization, query optimization techniques, Query processing, Relational databases, residue technique, semantic knowledge, semantic query optimization}, isbn = {1041-4347}, doi = {10.1109/69.868906}, author = {Grant,J. and Gryz,J. and Minker, Jack and Raschid, Louiqa} } @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.} } @article {15396, title = {Numerical simulation of small-signal microwave performance of 4H{\textendash}SiC MESFET}, journal = {Solid-State Electronics}, volume = {44}, year = {2000}, month = {2000/07/01/}, pages = {1281 - 1287}, abstract = {Small-signal high frequency characteristics of 4H{\textendash}SiC MESFET has been studied by using two-dimensional numerical drift-diffusion model in frequency domain. Non-ideal Schottky boundary conditions have been introduced that take into account a thin interfacial layer and interface energy states. It has been demonstrated that the 10 dB/dec small-signal current gain roll-off can be attributed to the existence of high density interface states at the metal{\textendash}semiconductor interface. It has been found that as the gate length is reduced to 0.1 μm, fT and fmax may reach as high as 30 and 62 GHz, respectively.}, isbn = {0038-1101}, doi = {10.1016/S0038-1101(00)00025-3}, url = {http://www.sciencedirect.com/science/article/pii/S0038110100000253}, author = {Huang,Mingwei and Mayergoyz, Issak D and Goldsman,Neil} } @conference {13614, title = {Off-line Skilled Forgery Detection using Stroke and Substroke Features}, booktitle = {ICPR}, volume = {2}, year = {2000}, month = {2000///}, pages = {355 - 359}, author = {Guo,K. and David Doermann and Rosenfeld, A.} } @article {13011, title = {Phylogenetic relationships of Acanthocephala based on analysis of 18S ribosomal RNA gene sequences}, journal = {J Mol Evol}, volume = {50}, year = {2000}, month = {2000/06//}, pages = {532 - 540}, abstract = {Acanthocephala (thorny-headed worms) is a phylum of endoparasites of vertebrates and arthropods, included among the most phylogenetically basal tripoblastic pseudocoelomates. The phylum is divided into three classes: Archiacanthocephala, Palaeacanthocephala, and Eoacanthocephala. These classes are distinguished by morphological characters such as location of lacunar canals, persistence of ligament sacs in females, number and type of cement glands in males, number and size of proboscis hooks, host taxonomy, and ecology. To understand better the phylogenetic relationships within Acanthocephala, and between Acanthocephala and Rotifera, we sequenced the nearly complete 18S rRNA genes of nine species from the three classes of Acanthocephala and four species of Rotifera from the classes Bdelloidea and Monogononta. Phylogenetic relationships were inferred by maximum-likelihood analyses of these new sequences and others previously determined. The analyses showed that Acanthocephala is the sister group to a clade including Eoacanthocephala and Palaeacanthocephala. Archiacanthocephala exhibited a slower rate of evolution at the nucleotide level, as evidenced by shorter branch lengths for the group. We found statistically significant support for the monophyly of Rotifera, represented in our analysis by species from the clade Eurotatoria, which includes the classes Bdelloidea and Monogononta. Eurotatoria also appears as the sister group to Acanthocephala.}, author = {Garc{\'\i}a-Varela,M and P{\'e}rez-Ponce de Le{\'o}n,G. and de la Torre,P and Cummings, Michael P. and Sarma,SS and Laclette,J. P} } @conference {15628, title = {A point-placement strategy for conforming Delaunay tetrahedralization}, booktitle = {Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms}, series = {SODA {\textquoteright}00}, year = {2000}, month = {2000///}, pages = {67 - 74}, 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.338236}, author = {Murphy,Michael and Mount, Dave and Gable,Carl W.} } @article {17327, title = {Previews and overviews in digital libraries: Designing surrogates to support visual information seeking}, journal = {Journal of the American Society for Information Science}, volume = {51}, year = {2000}, month = {2000/01/01/}, pages = {380 - 393}, abstract = {To aid designers of digital library interfaces, we present a framework for the design of information representations in terms of previews and overviews. Previews and overviews are graphic or textual representations of information abstracted from primary information objects. Previews act as surrogates for one or a few objects and overviews represent collections of objects. A design framework is elaborated in terms of the following three dimensions: (1) what information objects are available to users, (2) how information objects are related and displayed, and (3) how users can manipulate information objects. When utilized properly, previews and overviews allow users to rapidly discriminate objects of interest from those not of interest, and to more fully understand the scope and nature of digital libraries. This article presents a definition of previews and overviews in context, provides design guidelines, and describes four example applications.}, isbn = {1097-4571}, doi = {10.1002/(SICI)1097-4571(2000)51:4<380::AID-ASI7>3.0.CO;2-5}, url = {http://onlinelibrary.wiley.com/doi/10.1002/(SICI)1097-4571(2000)51:4\%3C380::AID-ASI7\%3E3.0.CO;2-5/abstract;jsessionid=E15C609DE95671E0E91A862B8AFD1CC6.d03t01}, author = {Greene,Stephan and Marchionini,Gary and Plaisant, Catherine and Shneiderman, Ben} } @conference {14528, title = {Rectified Heat Transfer to Vapor Bubbles in Standing Acoustic Waves}, booktitle = {Microgravity fluid physics and heat transfer: proceedings of the International Conference on Microgravity Fluid Physics and Heat Transfer held at the Tutle Bay Hilton, Oahu, Hawaii, September 19-24, 1999}, year = {2000}, month = {2000///}, pages = {96 - 96}, author = {Gumerov, Nail A.} } @article {15401, title = {Resolution enhancement by applying MFM under UHV conditions}, journal = {Magnetics, IEEE Transactions on}, volume = {36}, year = {2000}, month = {2000/09//}, pages = {2975 - 2977}, abstract = {The enhancement in signal-to-noise ratio and lateral resolution in MFM in going from ambient pressure to UHV is demonstrated. The performance of several cantilevers is evaluated using a patterned 50 nm thick permalloy film, with cross-tie as well as 90 deg; domain walls, and a 200 nm thick permalloy film with perpendicular magnetization. The increase in the quality factor of the cantilever oscillation in UHV improves the sensitivity, consequently allowing less magnetic material on the tip to achieve the same signal-to-noise ratio. This reduction in magnetic volume sharpens the lateral resolution. We also demonstrate that the magnetic interaction can be so weak that a magnetic contrast is visible only under UHV conditions}, keywords = {conditions;cantilevers;domain, contrast;magnetic, domain, enhancement;Permalloy;magnetic, enhancement;signal-to-noise, film;perpendicular, films;magnetisation;, force, magnetization;resolution, MFM;NiFe;UHV, microscopy;magnetic, ratio, resolution;magnetic, thin, volume;permalloy, walls;lateral, walls;magnetic}, isbn = {0018-9464}, doi = {10.1109/20.908645}, author = {Dreyer,M. and Gomez,R.D. and Mayergoyz, Issak D} } @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} } @article {18863, title = {Selecting Flat End Mills for 2-1/2D Milling Operations}, volume = {ISR; TR 2000-41}, year = {2000}, month = {2000///}, institution = {Institute for Systems Research, University of Maryland, College Park}, abstract = {The size of milling cutter significantly affects the machining time. Therefore, in order to perform milling operations efficiently, we need to select a set of milling cutters with optimal sizes. It is difficult for human process planners to select the optimal or near optimal set of milling cutters due to complex geometric interactions among tools size, part shapes, and tool trajectories.

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

We believe the selection of optimum cutter combination can not only save manufacturing time but also help automatic process planning.}, keywords = {algorithms, computer aided manufacturing CAM, cutter selection, Manufacturing, Next-Generation Product Realization Systems}, url = {http://drum.lib.umd.edu//handle/1903/6138}, author = {Yao,Zhiyang and Gupta, Satyandra K. and Nau, Dana S.} } @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} } @conference {17501, title = {Visualizing digital library search results with categorical and hierarchical axes}, booktitle = {Proceedings of the fifth ACM conference on Digital libraries}, series = {DL {\textquoteright}00}, year = {2000}, month = {2000///}, pages = {57 - 66}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Digital library search results are usually shown as a textual list, with 10-20 items per page. Viewing several thousand search results at once on a two-dimensional display with continuous variables is a promising alternative. Since these displays can overwhelm some users, we created a simplified two-dimensional display that uses categorical and hierarchical axes, called hieraxes. Users appreciate the meaningful and limited number of terms on each hieraxis. At each grid point of the display we show a cluster of color-coded dots or a bar chart. Users see the entire result set and can then click on labels to move down a level in the hierarchy. Handling broad hierarchies and arranging for imposed hierarchies led to additional design innovations. We applied hieraxes to a digital video library of science topics used by middle school teachers, a legal information system, and a technical library using the ACM Computing Classification System. Feedback from usability testing with 32 subjects revealed strengths and weaknesses.}, keywords = {categorical axes, digital libraries, Graphical user interfaces, hierarchy, hieraxes, Information Visualization}, isbn = {1-58113-231-X}, doi = {10.1145/336597.336637}, url = {http://doi.acm.org/10.1145/336597.336637}, author = {Shneiderman, Ben and Feldman,David and Rose,Anne and Grau,Xavier Ferr{\'e}} } @conference {18761, title = {A web-based process/material advisory system}, year = {2000}, month = {2000///}, abstract = {This paper describes a web-based process/material advisorysystem that can be used during conceptual design. Given a set of design requirements for a part during conceptual design stage, our system produces process sequences that can meet the design requirements. Quite often during conceptual design stage, design requirements are not precisely defined. Therefore, we allow users to describe design requirements in terms of parameter ranges. Parameter ranges are used to capture uncertainties in design requirements. Our system accounts for uncertainties in design requirements in generating and evaluating process/material combinations. Our system uses a two step algorithm. During the first step, we generate a material/process option tree. This tree represents various process/material options that can be used to meet the given set of design requirements. During the second step, we evaluate various alternative process/material options using a depth first branch and bound algorithm to identify and recommend the least expensive process/material combination to the designer. Our system can be accessed on the World Wide Web using a standard browser. Our system allows designs to consider a wide variety of process/material options during the conceptual design stage and allows them to find the most cost-effective combination. By selecting the process/material combination during the early design stages, designers can ensure that the detailed design is compatible with all of the process constraints for the selected process. }, url = {http://www.mel.nist.gov/msidlibrary/doc/imece_feng.pdf}, author = {Chen,Y. S. and Gupta,S.K. and Feng,S.} } @conference {15376, title = {Advances in spherical harmonic device modeling: calibration and nanoscale electron dynamics}, booktitle = {Simulation of Semiconductor Processes and Devices, 1999. SISPAD {\textquoteright}99. 1999 International Conference on}, year = {1999}, month = {1999///}, pages = {167 - 170}, abstract = {Improvements in the Spherical Harmonic (SH) method for solving Boltzmann Transport Equation (BTE) are presented. The simulation results provide the same physical detail as analytical band Monte Carlo (MC) calculations, and are obtained approximately a thousand times faster. A new physical model for surface scattering has also been developed. As a result, the SHBTE model achieves calibration for a complete process of I-V characteristics and substrate current consistently for the first time}, keywords = {Boltzmann, characteristics;SHBTE, current;surface, device, dynamics;spherical, electron, equation;calibration;semiconductor, equation;I-V, harmonic, model;substrate, models;surface, scattering;, scattering;Boltzmann, simulation;calibration;nanoscale, transport}, doi = {10.1109/SISPAD.1999.799287}, author = {Lin,Chung-Kai and Goldsman,N. and Mayergoyz, Issak D and Aronowitz,S. and Belova,N.} } @mastersthesis {15518, title = {An architecture and implementation for a cooperative database system}, year = {1999}, month = {1999///}, school = {University of Maryland at College Park}, author = {Godfrey,P. and Minker, Jack} } @conference {13501, title = {ARobust Method for Unknown Forms Analysis}, booktitle = {ICDAR}, year = {1999}, month = {1999///}, pages = {531 - 534}, author = {Xingyuan,L. and David Doermann and Oh,W. and Gao,W.} } @conference {18776, title = {Automated punch shape synthesis for sheet metal bending operations}, year = {1999}, month = {1999///}, author = {Alva,U. and Gupta,S.K.} } @conference {14905, title = {Classification in non-metric spaces}, booktitle = {Proceedings of the 1998 conference on Advances in neural information processing systems II}, year = {1999}, month = {1999///}, pages = {838 - 844}, publisher = {MIT Press}, organization = {MIT Press}, address = {Cambridge, MA, USA}, isbn = {0-262-11245-0}, url = {http://dl.acm.org/citation.cfm?id=340534.340816}, author = {Weinshall,Daphna and Jacobs, David W. and Gdalyahu,Yoram} } @article {14463, title = {Efficient learning using constrained sufficient statistics}, journal = {Proceedings of the 7th International Workshop on Artificial Intelligence and Statistics (AISTATS-99)}, year = {1999}, month = {1999///}, abstract = {Learning Bayesian networks is a central prob-lem for pattern recognition, density estima- tion and classification. In this paper, we propose a new method for speeding up the computational process of learning Bayesian network structure. This approach uses con- straints imposed by the statistics already col- lected from the data to guide the learning al- gorithm. This allows us to reduce the num- ber of statistics collected during learning and thus speed up the learning time. We show that our method is capable of learning struc- ture from data more efficiently than tradi- tional approaches. Our technique is of partic- ular importance when the size of the datasets is large or when learning from incomplete data. The basic technique that we introduce is general and can be used to improve learn- ing performance in many settings where suf- ficient statistics must be computed. In ad- dition, our technique may be useful for al- ternate search strategies such as branch and bound algorithms. }, author = {Friedman,N. and Getoor, Lise} } @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} } @article {16172, title = {The end of zero-hit queries: query previews for NASA{\textquoteright}s Global Change Master Directory}, journal = {International Journal on Digital Libraries}, volume = {2}, year = {1999}, month = {1999///}, pages = {79 - 90}, abstract = {The Human-Computer Interaction Laboratory (HCIL) of the University of Maryland and NASA have collaborated over three years to refine and apply user interface research concepts developed at HCIL in order to improve the usability of NASA data services. The research focused on dynamic query user interfaces, visualization, and overview + preview designs. An operational prototype, using query previews, was implemented with NASA{\textquoteright}s Global Change Master Directory (GCMD), a directory service for earth science datasets. Users can see the histogram of the data distribution over several attributes and choose among attribute values. A result bar shows the cardinality of the result set, thereby preventing users from submitting queries that would have zero hits. Our experience confirmed the importance of metadata accuracy and completeness. The query preview interfaces make visible the problems or gaps in the metadata that are undetectable with classic form fill-in interfaces. This could be seen as a problem, but we think that it will have a long-term beneficial effect on the quality of the metadata as data providers will be compelled to produce more complete and accurate metadata. The adaptation of the research prototype to the NASA data required revised data structures and algorithms.}, isbn = {1432-5012}, url = {http://dx.doi.org/10.1007/s007990050039}, author = {Greene,Stephan and Tanin,Egemen and Plaisant, Catherine and Shneiderman, Ben and Olsen,Lola and Major,Gene and Johns,Steve} } @conference {15386, title = {Gate leakage current simulation by Boltzmann transport equation and its dependence on the gate oxide thickness}, booktitle = {Simulation of Semiconductor Processes and Devices, 1999. SISPAD {\textquoteright}99. 1999 International Conference on}, year = {1999}, month = {1999///}, pages = {247 - 250}, abstract = {As device dimensions shrink toward 0.1 mu;m, gate oxides are becoming so thin that MOSFET gate leakage current and oxide degradation are becoming limiting issues. We provide a more rigorous way to calculate gate leakage current. To achieve this we build upon the Spherical Harmonic Method of modeling, which deterministically solves the Boltzmann equation for an entire device. The method gives the distribution function and is 1000 times faster than MC. Once the distribution function is calculated, the tunneling probability is derived from the first principle WKB method. The barrier lowering effect is accounted for by the method of image charges. We calculate gate leakage current as a function of DC bias. The thermionic and tunneling components are compared at different DC bias points. The dependence of gate leakage current on gate oxide thickness is simulated}, keywords = {30, angstrom;60, angstrom;Boltzmann, Bias, calculations;leakage, charges;spherical, component;tunneling, current, currents;semiconductor, dependence;method, dependence;MOSFET;barrier, device, effect;distribution, equation;DC, equation;MOSFET;WKB, function;first, harmonic, image, leakage, lowering, method, method;gate, model;thermionic, models;tunnelling;, of, oxide, principle, probability;Boltzmann, simulation;gate, thickness, transport, WKB}, doi = {10.1109/SISPAD.1999.799307}, author = {Han,Zhiyi and Lin,Chung-Kai and Goldsman,N. and Mayergoyz, Issak D and Yu,S. and Stettler,M.} } @article {17209, title = {Human-centered computing, online communities, and virtual environments}, journal = {IEEE Computer Graphics and Applications}, volume = {19}, year = {1999}, month = {1999/12//Nov}, pages = {70 - 74}, abstract = {This report summarizes results of the first EC/NSF joint Advanced Research Workshop, which identified key research challenges and opportunities in information technology. The group agreed that the first joint research workshop should concentrate on the themes of human-centered computing and VEs. Human-centered computing is perceived as an area of strategic importance because of the move towards greater decentralization and decomposition in the location and provision of computation. The area of VEs is one where increased collaboration should speed progress in solving some of the more intractable problems in building effective applications}, keywords = {Books, Collaboration, Collaborative work, Conferences, EC/NSF joint Advanced Research Workshop, Feeds, Human computer interaction, human-centered computing, Internet, Joining materials, Laboratories, Online communities, Research initiatives, USA Councils, User interfaces, Virtual environment, virtual environments, Virtual reality}, isbn = {0272-1716}, doi = {10.1109/38.799742}, author = {Brown,J. R and van Dam,A. and Earnshaw,R. and Encarnacao,J. and Guedj,R. and Preece,J. and Shneiderman, Ben and Vince,J.} } @article {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} } @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.} } @article {16354, title = {Model-checking concurrent systems with unbounded integer variables: symbolic representations, approximations, and experimental results}, journal = {ACM Transactions on Programming Languages and SystemsACM Trans. Program. Lang. Syst.}, volume = {21}, year = {1999}, month = {1999/07//}, pages = {747 - 789}, isbn = {01640925}, doi = {10.1145/325478.325480}, url = {http://dl.acm.org/citation.cfm?id=325480}, author = {Bultan,Tevfik and Gerber,Richard and Pugh, William} } @article {14093, title = {More surprises from Kinetoplastida}, journal = {Proceedings of the National Academy of Sciences of the United States of America}, volume = {96}, year = {1999}, month = {1999///}, pages = {2579 - 2579}, author = {Donelson,J. E and Gardner,M. J and El-Sayed, Najib M.} } @article {18248, title = {Multi-level data hiding for digital image and video}, journal = {SPIE Photonics East{\textquoteright}99}, year = {1999}, month = {1999///}, abstract = {Previous works on data hiding generally targeted on a specific tradeoff between capacity and robustness. This results inoverestimation of the processing noise under some situations and/or underestimation under some other situations, hence limits the overall performance. In this paper, we propose a multi-level data hiding scheme which is able to convey secondary data in high rate when noise is not severe and can also convey some data reliably under heavy distortion. The proposed scheme is motivated by a two-category classification of embedding schemes and by a study on detection performance of spread spectrum watermarking. The multi-level data hiding has been successfully applied to both digital image and video, and can be used for applications such as copy control. }, author = {Wu,M. and Yu,H. and Gelman,A.} } @article {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 {16526, title = {Penumbral tissue damage following acute stroke: a computational investigation}, journal = {Progress in brain research}, volume = {121}, year = {1999}, month = {1999///}, pages = {243 - 260}, author = {Ruppin,E. and Revett,K. and Ofer,E. and Goodall,S. and Reggia, James A.} } @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 {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 {14723, title = {PLANet: an active internetwork}, booktitle = {IEEE INFOCOM {\textquoteright}99. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings}, volume = {3}, year = {1999}, month = {1999/03/21/25}, pages = {1124-1133 vol.3 - 1124-1133 vol.3}, publisher = {IEEE}, organization = {IEEE}, abstract = {We present PLANet: an active network architecture and implementation. In addition to a standard suite of Internet-like services, PLANet has two key programmability features: (1) all packets contain programs; and (2) router functionality may be extended dynamically. Packet programs are written in our special purpose programming language PLAN, the Packet Language for Active Networks, while dynamic router extensions are written in OCaml, a dialect of ML. Currently, PLANet routers run as byte-code-interpreted Linux user-space applications, and support Ethernet and IP as link layers. PLANet achieves respectable performance on standard networking operations: on 300 MHz Pentium-II{\textquoteright}s attached to 100 Mbps Ethernet, PLANet can route 48 Mbps and switch over 5000 packets per second. We demonstrate the utility of PLANet{\textquoteright}s activeness by showing experimentally how it can nontrivially improve application and aggregate network performance in congested conditions}, keywords = {100 Mbit/s, 300 MHz, 48 Mbit/s, active internetwork, active network architecture, active network implementation, byte-code-interpreted applications, Computer architecture, Computer languages, Computer networks, congested conditions, dynamic programming, dynamic router extensions, Ethernet, Ethernet networks, INFORMATION SCIENCE, Internet, Internet-like services, internetworking, IP, IP networks, link layers, Linux user-space applications, Local area networks, ML dialect, Network performance, networking operations, OCaml, Packet Language for Active Networks, packet programs, packet switching, Pentium-II, performance, performance evaluation, PLAN, PLANet, Planets, programmability features, programming languages, router functionality, special purpose programming language, Switches, telecommunication network routing, Transport protocols, Web and internet services}, isbn = {0-7803-5417-6}, doi = {10.1109/INFCOM.1999.751668}, author = {Hicks, Michael W. and Moore,J. T and Alexander,D. S and Gunter,C. A and Nettles,S. M} } @book {19005, title = {The RNA World}, year = {1999}, month = {1999///}, publisher = {Cold Spring Harbor Laboratory Press}, organization = {Cold Spring Harbor Laboratory Press}, address = {Cold Spring Harbor, New York}, author = {Woodson,Sarah A. and Mount, Stephen M.}, editor = {Gesteland,Raymond F. and Cech,Thomas R. and Atkins,John F.} } @article {18738, title = {Sheet metal bending: generating shared setups}, journal = {TRANSACTIONS-AMERICAN SOCIETY OF MECHANICAL ENGINEERS JOURNAL OF MANUFACTURING SCIENCE AND ENGINEERING}, volume = {121}, year = {1999}, month = {1999///}, pages = {689 - 694}, abstract = {Contemporary process planners for sheet metal bending solve the process planning problemfor individual parts. Quite often, many different parts can be produced on shared setups. However, plans generated by current process planning systems fail to exploit this commonality between setups and try to generate optimal setups for individual parts. In this paper, we present an algorithm for multi-part setup planning for sheet metal bending. This algorithm takes a set of parts and operation sequences for these parts, and tries to find a shared setup plan that can work for every part in the set. Setup changes constitute a major portion of the production time in batch production environments. Therefore, multi-part setup planning techniques can be used to significantly cut down the total number of setups and increase the overall through-put. }, url = {http://terpconnect.umd.edu/~skgupta/Publication/JMSE99_Gupta_draft.pdf}, author = {Gupta,S.K. and Bourne,D. A.} } @article {18741, title = {Sheet metal bending operation planning: using virtual node generation to improve search efficiency}, journal = {Journal of manufacturing systems}, volume = {18}, year = {1999}, month = {1999///}, pages = {127 - 139}, abstract = {A large number of manufacturing operation planning problems can be formulatedas state-space search problems. In case of sheet-metal bending operation planning, processing a search node involves extensive geometric reasoning. Such computation- intensive node-processing limits the number of search nodes that can be expanded in a reasonable amount of time, making it difficult to solve real-life operation planning problems. In this paper, we describe a scheme to speed up operation planning by virtual gen- eration of state-space nodes. In this scheme, we eliminate unnecessary computation at the time of node generation by extracting the required information from already generated nodes. Although generation of two different search nodes rarely involves identical computation steps, there is considerable overlap in node generation steps. We have divided the node generation step into a number of computation subproblems. When we need to generate a new node, we first try to see if any of the node gener- ation subproblems have been solved for any of the already generated nodes. If any subproblem has already been solved for some other node, then we use the solution of that subproblem to save computation time. In such cases, we do not perform node generation computation steps, and therefore we call such node generation virtual. The scheme presented in this paper increases the node generation capability and allows us to consider many more search nodes. The ability to consider more search nodes helps us in solving more complex problems and finding better operation plans. }, url = {ftp://ftp.eng.umd.edu/:/home/glue/s/k/skgupta/pub/Publication/JMS99_Gupta_draft.pdf}, author = {Gupta,S.K.} } @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.} } @article {15823, title = {Tikhonov Regularization and Total Least Squares}, journal = {SIAM Journal on Matrix Analysis and Applications}, volume = {21}, year = {1999}, month = {1999///}, pages = {185 - 194}, abstract = {Discretizations of inverse problems lead to systems of linear equations with a highly ill-conditioned coefficient matrix, and in order to computestable solutions to these systems it is necessary to apply regularization methods. We show how Tikhonov{\textquoteright}s regularization method, which in its original formulation involves a least squares problem, can be recast in a total least squares formulation suited for problems in which both the coefficient matrix and the right-hand side are known only approximately. We analyze the regularizing properties of this method and demonstrate by a numerical example that, in certain cases with large perturbations, the new method is superior to standard regularization methods.}, keywords = {bidiagonalization, discrete ill-posed problems, regularization, total least squares}, doi = {10.1137/S0895479897326432}, url = {http://link.aip.org/link/?SML/21/185/1}, author = {Golub, Gene H. and Hansen,Per Christian and O{\textquoteright}Leary, Dianne P.} } @conference {17443, title = {Trust me, I{\textquoteright}m accountable: trust and accountability online}, booktitle = {CHI {\textquoteright}99 extended abstracts on Human factors in computing systems}, series = {CHI EA {\textquoteright}99}, year = {1999}, month = {1999///}, pages = {79 - 80}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {We live in an increasingly wired world. According to Robert Putnam, people are spending less time in persistent personal face to face interactions and more time in pursuits such as watching TV and using the Internet. At the same time, independently measured "social capital" -- the extent to which we trust and work for a common good -- is declining. In this panel, we explore: the impacts of electronic media on trust and accountability; whether and how electronic media can be designed and used to increase deserved trust and accountability; the relationship between protecting privacy and increasing the efficacy of communication; and how people{\textquoteright}s tendency to treat computers as social actors impacts these issues. In brief, how can modern technology enhance humanity{\textquoteright}s humanity?}, keywords = {accountability, anonymity, Communication, computers and society, ethics, Internet, media effects, privacy, Reciprocity, repute, social actors, social capital, social impacts, trust, value-sensitive design, wired world, WWW}, isbn = {1-58113-158-5}, doi = {10.1145/632716.632766}, url = {http://doi.acm.org/10.1145/632716.632766}, author = {Friedman,Batya and Thomas,John C. and Grudin,Jonathan and Nass,Clifford and Nissenbaum,Helen and Schlager,Mark and Shneiderman, Ben} } @article {14441, title = {Using probabilistic relational models for collaborative filtering}, journal = {Proc. Workshop Web Usage Analysis and User Profiling (WEBKDD{\textquoteright}99)}, year = {1999}, month = {1999///}, abstract = {Recent projects in collaborative filtering and information filtering address the task of inferring user prefer-ence relationships for products or information. The data on which these inferences are based typically con- sists of pairs of people and items. The items may be information sources (such as web pages or newspaper articles) or products (such as books, software, movies or CDs). We are interested in making recommen- dations or predictions. Traditional approaches to the problem derive from classical algorithms in statistical pattern recognition and machine learning. The majority of these approaches assume a {\textquotedblright}flat{\textquotedblright} data repre- sentation for each object, and focus on a single dyadic relationship between the objects. In this paper, we examine a richer model that allows us to reason about many different relations at the same time. We build on the recent work on probabilistic relational models (PRMs), and describe how PRMs can be applied to the task of collaborative filtering. PRMs allow us to represent uncertainty about the existence of relationships in the model and allow the properties of an object to depend probabilistically both on other properties of that object and on properties of related objects. }, author = {Getoor, Lise and Sahami,M.} } @article {17514, title = {Zoom-Only Vs Overview-Detail Pair: A Study in Browsing Techniques as Applied to Patient Histories}, journal = {University of Maryland Technical Report, CS-TR}, volume = {4028}, year = {1999}, month = {1999///}, pages = {12 - 12}, author = {Ghosh,P. and Shneiderman, Ben} } @conference {18754, title = {3D spatial layouts using a-teams}, year = {1998}, month = {1998///}, abstract = {Spatial layout is the problem of arranging a set of componentsin an enclosure such that a set of objectives and constraints is sat- isfied. The constraints may include non-interference of objects, accessibility requirements and connection cost limits. Spatial lay- out problems are found primarily in the domains of electrical en- gineering and mechanical engineering in the design of integrated circuits and mechanical or electromechanical artifacts. Traditional approaches include ad-hoc (or specialized) heuristics, Genetic Al- gorithms and Simulated Annealing. The A-Teams approach pro- vides a way of synergistically combining these approaches in a modular agent based fashion. A-Teams are also open to the addi- tion of new agents. Modifications in the task requirements trans- late to modifications in the agent mix. In this paper we describe how modular A-Team based optimization can be used to solve 3 dimensional spatial layout problems. }, url = {http://www-2.cs.cmu.edu/afs/cs.cmu.edu/user/cjp/www/pubs/DETC98.pdf}, author = {Sachdev,S. and Paredis,C. J. J. and Gupta,S.K. and Talukdar,S. N.} } @article {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 {14762, title = {Benchmarking a network of PCs running parallel applications}, booktitle = {Performance, Computing and Communications, 1998. IPCCC {\textquoteright}98., IEEE International}, year = {1998}, month = {1998/02/16/18}, pages = {1 - 7}, publisher = {IEEE}, organization = {IEEE}, abstract = {Presents a benchmarking study that compares the performance of a network of four PCs connected by a 100 Mbit/s fast Ethernet running three different system software configurations: TCP/IP on Windows NT, TCP/IP on Linux and a lightweight message-passing protocol (U-Net active messages) on Linux. For each configuration, we report results for communication micro-benchmarks and the NAS (Numerical Aerodynamics Simulation) parallel benchmarks. For the NAS benchmarks, the overall running time using Linux TCP/IP was 12-500\% less than the Windows NT TCP/IP configuration. Likewise, the Linux U-Net based message-passing protocol outperformed the Linux TCP/IP version by 5-200\%+. We also show that, by using Linux U-Net, we are able to achieve 125 μs latency between two processes using PVM. Finally, we report that the default mathematical libraries supplied with NT (for both gcc and Visual C++) are substantially slower than the one supplied with Linux}, keywords = {100 Mbit/s, 125 mus, Aerodynamics, Application software, communication micro-benchmarks, default mathematical libraries, Delay, Ethernet, Ethernet networks, gcc, latency, lightweight message-passing protocol, Linux, Local area networks, mathematics computing, Message passing, microcomputer applications, Microsoft Windows NT, NAS parallel benchmarks, network operating systems, Numerical simulation, parallel applications, PARALLEL PROCESSING, PC network benchmarking, performance comparison, performance evaluation, Personal communication networks, Protocols, PVM, running time, software libraries, System software, system software configurations, TCP/IP, TCPIP, Transport protocols, U-Net active messages, Visual C++}, isbn = {0-7803-4468-5}, doi = {10.1109/PCCC.1998.659876}, author = {Hollingsworth, Jeffrey K and Guven, E. and Akinlar, C.} } @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 {16544, title = {Computational studies of lateralization of phoneme sequence generation}, journal = {Neural Computation}, volume = {10}, year = {1998}, month = {1998///}, pages = {1277 - 1297}, author = {Reggia, James A. and Goodall,S. and Shkuro,Y.} } @conference {14856, title = {Condensing image databases when retrieval is based on non-metric distances}, booktitle = {Computer Vision, 1998. Sixth International Conference on}, year = {1998}, month = {1998/01//}, pages = {596 - 601}, abstract = {One of the key problems in appearance-based vision is understanding how to use a set of labeled images to classify new images. Classification systems that can model human performance, or that use robust image matching methods, often make use of similarity judgments that are non-metric but when the triangle inequality is not obeyed, most existing pattern recognition techniques are not applicable. We note that exemplar-based (or nearest-neighbor) methods can be applied naturally when using a wide class of non-metric similarity functions. The key issue, however, is to find methods for choosing good representatives of a class that accurately characterize it. We note that existing condensing techniques for finding class representatives are ill-suited to deal with non-metric dataspaces. We then focus on developing techniques for solving this problem, emphasizing two points: First, we show that the distance between two images is not a good measure of how well one image can represent another in non-metric spaces. Instead, we use the vector correlation between the distances from each image to other previously seen images. Second, we show that in non-metric spaces, boundary points are less significant for capturing the structure of a class than they are in Euclidean spaces. We suggest that atypical points may be more important in describing classes. We demonstrate the importance of these ideas to learning that generalizes from experience by improving performance using both synthetic and real images}, keywords = {appearance-based, databases;, databases;image, dataspaces;pattern, MATCHING, methods;non-metric, processing;visual, recognition;query, systems;image, vision;classification}, doi = {10.1109/ICCV.1998.710778}, author = {Jacobs, David W. and Weinshall,D. and Gdalyahu,Y.} } @article {14910, title = {Determining the similarity of deformable shapes}, journal = {Vision Research}, volume = {38}, year = {1998}, month = {1998/08//}, pages = {2365 - 2385}, abstract = {Determining the similarity of two shapes is a significant task in both machine and human vision systems that must recognize or classify objects. The exact properties of human shape similarity judgements are not well understood yet, and this task is particularly difficult in domains where the shapes are not related by rigid transformations. In this paper we identify a number of possibly desirable properties of a shape similarity method, and determine the extent to which these properties can be captured by approaches that compare local properties of the contours of the shapes, through elastic matching. Special attention is devoted to objects that possess articulations, i.e. articulated parts. Elastic matching evaluates the similarity of two shapes as the sum of local deformations needed to change one shape into another. We show that similarities of part structure can be captured by such an approach, without the explicit computation of part structure. This may be of importance, since although parts appear to play a significant role in visual recognition, it is difficult to stably determine part structure. We also show novel results about how one can evaluate smooth and polyhedral shapes with the same method. Finally, we describe shape similarity effects that cannot be handled by current approaches.}, isbn = {0042-6989}, doi = {10.1016/S0042-6989(98)00043-1}, url = {http://www.sciencedirect.com/science/article/pii/S0042698998000431}, author = {Basri,Ronen and Costa,Luiz and Geiger,Davi and Jacobs, David W.} } @article {17695, title = {Direction of Arrival and the Rank-Revealing URV Decomposition}, volume = {UMIACS-TR-91-166}, year = {1998}, month = {1998/10/15/}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {In many practical direction-of-arrival (DOA) problems the numberof sources and their directions from an antenna array do not remain stationary. Hence a practical DOA algorithm must be able to track changes with a minimal number of snapshots. In this paper we describe DOA algorithms, based on a new decomposition, that are not expensive to compute or difficult to update. The algorithms are compared with algorithms based on the singular value decomposition (SVD). (Also cross-referenced as UMIACS-TR-91-166) }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/561}, author = {Boman,E. C and Griffen,M. F and Stewart, G.W.} } @article {17946, title = {Double quaternions for motion interpolation}, journal = {Proceedings of the ASME Design Engineering Technical Conference}, year = {1998}, month = {1998///}, abstract = {This paper describes the concept of double quaternions, anextension of quaternions, and shows how they can be used for ef- fective three-dimensional motion interpolation. Motion interpo- lation using double quaternions has several advantages over the method of interpolating rotation and translation independently and then combining the results. First, double quaternions pro- vide a conceptual framework that allows one to handle rotational and translational components in a unified manner. Second, re- sults obtained by using double quaternions are coordinate frame invariant. Third, double quaternions allow a natural way to trade- off robustness against accuracy. Fourth, double quaternions, be- ing a straightforward extension of quaternions, can be integrated into several existing systems that currently use quaternions with translational components, with a only small coding effort. }, author = {Ge,Q. J and Varshney, Amitabh and Menon,J. P and Chang,C. F} } @conference {14521, title = {Dynamics of bubbles in conditions of gas hydrate formation}, booktitle = {8th International Offshore and Polar Engineering Conference, Montreal, Canada}, year = {1998}, month = {1998///}, author = {Gumerov, Nail A. and Chahine,G. L} } @article {14518, title = {Effect of acoustic radiation on the stability of spherical bubble oscillations}, journal = {Physics of Fluids}, volume = {10}, year = {1998}, month = {1998///}, pages = {1767 - 1767}, author = {Gumerov, Nail A.} } @article {14895, title = {EFFICIENT DETERMINATION OF SHAPE FROM MULTIPLE IMAGES CONTAINING PARTIAL INFORMATION}, journal = {Pattern Recognition}, volume = {31}, year = {1998}, month = {1998/11//}, pages = {1691 - 1703}, abstract = {We consider the problem of reconstructing the shape of a 2-D object from multiple partial images related by scaled translations, in the presence of occlusion. Lindenbaum and Bruckstein have considered this problem in the specific case of a translating object seen by small sensors, for application to the understanding of insect vision. Their solution is limited by the fact that its run time is exponential in the number of images and sensors. We generalize the problem to allow for arbitrary types of occlusion of objects that translate and change scale. We show that this more general version of the problem can be solved in time that is polynomial in the number of sensors, but that even the original problem posed by Lindenbaum and Bruckstein is, in fact, NP-hard when the number of images is unbounded. Finally, we consider the case where the object is known to be convex. We show that Lindenbaum and Bruckstein{\textquoteright}s version of the problem is then efficiently solvable even when many images are used, as is the general problem in certain more restricted cases.}, keywords = {2-D shape recovery from multiple images, NP-complete, Shape recovery with occlusion}, isbn = {0031-3203}, doi = {10.1016/S0031-3203(98)00050-8}, url = {http://www.sciencedirect.com/science/article/pii/S0031320398000508}, author = {Basri,Ronen and GROVE,ADAM J. and Jacobs, David W.} } @inbook {13763, title = {Enhancing Automatic Acquisition of Thematic Structure in a Large-Scale Lexicon for Mandarin Chinese}, 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 = {41 - 50}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {This paper describes a refinement to our procedure for porting lexical conceptual structure (LCS) into new languages. Specifically we describe a two-step process for creating candidate thematic grids for Mandarin Chinese verbs, using the English verb heading the VP in the subde_nitions to separate senses, and roughly parsing the verb complement structure to match thematic structure templates. We accomplished a substantial reduction in manual effort, without substantive loss. The procedure is part of a larger process of creating a usable lexicon for interlingual machine translation from a large on-line resource with both too much and too little information.}, isbn = {978-3-540-65259-5}, url = {http://dx.doi.org/10.1007/3-540-49478-2_4}, author = {Olsen,Mari and Dorr, Bonnie J and Thomas,Scott}, editor = {Farwell,David and Gerber,Laurie and Hovy,Eduard} } @article {15367, title = {Extension of Spherical Harmonic Method to RF Transient Regime}, journal = {Simulation of semiconductor processes and devices 1998: SISPAD 98}, year = {1998}, month = {1998///}, pages = {42 - 42}, abstract = {The space and time dependent electron Boltzmann transport equation (BTE)is solved sclf-consistently with the Poisson and transient hole current-continuity equation. A transient Spherical Harmonic expansion method is used to solve the BTE. By this method we can efficiently solve the BTE in the RF regime to observe how the complete distribution function responds to a rapid transient. Calculations on a BJT, which give the time dependent distribution function over a large energy range 0-3eV, throughout the device, as well as average quantities, require only 40 minutes CPU time on an Alpha workstation. }, author = {Lin,C. K. and Goldsman,N. and Chang,C. H. and Mayergoyz, Issak D and Aronowitz,S. and Dong,J. and Belova,N.} } @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 {18832, title = {Feature Recognition for Interactive Applications: Exploiting Distributed Resources}, volume = {UMIACS-TR-94-126.1}, year = {1998}, month = {1998/10/15/}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {The availability of low-cost computational power is a drivingforce behind the growing sophistication of CAD software. Tools designed to reduce time-consuming build-test-redesign iterations are essential for increasing engineering quality and productivity. However, automation of the design process poses many difficult computational problems. As more downstream engineering activities are being considered during the design phase, guaranteeing reasonable response times within design systems becomes problematic. Design is an interactive process and speed is a critical factor in systems that enable designers to explore and experiment with alternative ideas during the design phase. Achieving interactivity requires an increasingly sophisticated allocation of computational resources in order to perform realistic design analyses and generate feedback in real time. This paper presents our initial efforts to develop techniques to apply distributed algorithms to the problem of recognizing machining features from solid models. Existing work on recognition of features has focused exclusively on serial computer architectures. Our objective is to show that distributed algorithms can be employed on realistic parts with large numbers of features and many geometric and topological entities to obtain significant improvements in computation time using existing hardware and software tools. Migrating solid modeling applications toward a distributed computing framework enables interconnection of many of the autonomous and geographically diverse software tools used in the modern manufacturing enterprise. (Also cross-referenced as UMIACS-TR-94-126.1) }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu//handle/1903/675}, author = {Regli,William C. and Gupta, Satyandra K. and Nau, Dana S.} } @conference {18736, title = {Feature-recognition for MEMS extraction}, year = {1998}, month = {1998///}, pages = {13 - 16}, url = {http://www.ece.cmu.edu/~mems/pubs/pdfs/asme/detc/0029_baidya-1998.pdf}, author = {Baidya,B. and Gupta,S.K. and Mukherjee,T.} } @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 {18849, title = {IMACS: a case study in real-world planning}, journal = {Intelligent Systems and their Applications, IEEE}, volume = {13}, year = {1998}, month = {1998/06//may}, pages = {49 - 60}, abstract = {This article discusses the complexities of real-world planning and how to create planning systems to address them. IMACS (Interactive Manufacturability Analysis and Critiquing System), an automated designer{\textquoteright}s aid, evaluates machined parts and suggests design modifications to improve their manufacturability, offering advantages over the planning techniques used in classical planning systems}, keywords = {automated designer{\textquoteright}s aid, CAD/CAM, case study, computer aided analysis, computer aided production planning, design modifications, IMACS, intelligent design assistants, Interactive Manufacturability Analysis and Critiquing System, interactive systems, machined parts evaluation, machining, manufacturability, planning (artificial intelligence), planning systems}, isbn = {1094-7167}, doi = {10.1109/5254.683210}, author = {Gupta,S.K. and Nau, Dana S. and Regli,W. C.} } @conference {18728, title = {Integrated design and rapid manufacturing over the Internet}, year = {1998}, month = {1998///}, abstract = {An Internet-based infrastructure is being developed inorder to provide designers with access to multiple layered- manufacturing services. The design domain being addressed is that of small mechanisms or electro-mechanical assemblies that would be used in robots or other mechatronic devices. The approach presented relies on the formalization of the data exchange interface between designers and manufacturers. The primary operatives in this system are Design Clients, Manufacturing Services and Process Brokers. The Design Client allows designers to submit completed designs for algorithmic decomposition, or alternately, to compose a design from primitives and library components that have been primed with some process-related information. During this early phase, the Manufacturing Service consists of a highly automated machine that can be used to build ceramic parts, and the associated software components for design decomposition, process planning and machine control. In later phases, multiple service providers will be made accessible. The Process Broker implements a number of supporting services including process selection and optimal part orientation. Future broker services will include manufacturability analysis, directory services and accreditation etc. Currently, this interface is being built and evaluated internally at Stanford and CMU. It will be made available for use by other selected universities in the near future. }, url = {http://cdr.stanford.edu/interface/publications/DETC98CIE-5519.pdf}, author = {Rajagopalan,S. and Pinilla,J. M. and Losleben,P. and Tian,Q. and Gupta,S.K.} } @article {15522, title = {Integrity constraints: Semantics and applications}, journal = {Logics for databases and information systems}, year = {1998}, month = {1998///}, pages = {265 - 306}, abstract = {Integrity constraints axe introduced in a logical framework. Examples are given to illustrate the expressiveness of integrity constraints. Various definitions for the semantics of integrity constraints are defined and compared. Additional types of constraints are also mentioned. Techniques of reasoning with integrity constraints, including model elimination and the residue method, are explained. Applications of integrity constraints considered in detail, including semantic query optimization, cooperative answering, combining databases, and view updates. Additional applications to order optimization, query folding, object-oriented databases, and database security are sketched. The conclusion lists areas of integrity constraints that need to be investigated.}, doi = {10.1007/978-1-4615-5643-5_9}, author = {Godfrey,P. and Grant,J. and Gryz,J. and Minker, Jack} } @conference {18739, title = {An intelligent environment for simulating mechanical assembly operations}, year = {1998}, month = {1998///}, pages = {13 - 16}, abstract = {Rapid technical advances in many different areas of scientificcomputing provide the enabling technologies for creating a com- prehensive simulation and visualization environment for assembly design and planning. We have built an intelligent environment in which simple simulations can be composed together to create com- plex simulations for detecting potential assembly problems. Our goal in this project is to develop high fidelity assembly simulation and visualization tools that can detect assembly related problems without going through physical mock-ups. In addition, these tools can be used to create easy-to-visualize instructions for performing assembly and service operations. }, url = {http://www.cs.cmu.edu/afs/cs.cmu.edu/Web/People/paredis/pubs/DFM98.pdf}, author = {Gupta,S.K. and Paredis,C. J. J. and Sinha,R. and Wang,C. H. and Brown,P. F.} } @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 {16180, title = {Life cycle of user interface techniques: The DJJ information system design Process}, journal = {Technical Reports of the Computer Science Department}, year = {1998}, month = {1998/10/15/}, abstract = {To take advantage of todays technology, many organizations are migrating fromtheir legacy systems. With help from the Human-Computer Interaction Laboratory (HCIL) and Cognetics Corporation, the Maryland Department of Juvenile Justice (DJJ) is currently undergoing an effort to redesign their information system to take advantage of graphical user interfaces. As a research lab, HCIL identifies interesting research problems and then prototypes solutions. As a project matures, the exploratory prototypes are adapted to suit the end product requirements. This case study describes the life cycle of three DJJ prototypes: (1) LifeLines, which uses time lines to display an overview of a youth in one screen, (2) the DJJ Navigator, which helps manage individual workloads by displaying different user views, and (3) the ProgramFinder, a tool for selecting the best program for a youth. (Also cross-referenced as CAR-TR-826) }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/458}, author = {Rose,Anne and Ellis,Jason and Plaisant, Catherine and Greene,Stephan} } @conference {16478, title = {A Meta-Wrapper for Scaling up to Multiple Autonomous Distributed Information Sources}, booktitle = {Cooperative Information Systems, IFCIS International Conference on}, year = {1998}, month = {1998///}, pages = {148 - 148}, publisher = {IEEE Computer Society}, organization = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, abstract = {Abstract Current mediator and wrapper architectures do not have the flexibility to scale to multiple wrapped sources, where some sources may be redundant, and some sources may provide incomplete answers to a query. We propose a meta-wrapper component which is capable of handling multiple wrapped sources, in a particular domain, where the multiple sources provide related information. The meta-wrapper makes these sources transparent to the mediator, and provides a single meta-wrapper interface for all these sources. Source descriptions specify the content and query capability of the sources. These are used to determine the meta-wrapper interface and to decide which queries from a mediator can be accepted. Sources are partitioned into equivalence classes, based on their descriptions. These equivalence classes are partially ordered, and the lattices that correspond to these orderings are used to identify the relevant sources for a query submitted by the mediator. If there is redundancy of the sources, the meta-wrapper identifies alternate sources for the query. A meta-wrapper cost model is then used to select among alternate relevant sources and choose the best plan.}, keywords = {information resource discovery, integration and interoperability, metadata use and management, wrappers and mediators}, isbn = {0-8186-8380-5}, doi = {http://doi.ieeecomputersociety.org/10.1109/COOPIS.1998.706193}, author = {Vidal,Maria Esther and Raschid, Louiqa and Gruser,Jean Robert} } @conference {14534, title = {Modeling of particle motion in viscous swirl flow between two porous cylinders}, booktitle = {Proc. ASME Fluids Engineering Division Summer Meeting}, year = {1998}, month = {1998///}, pages = {21 - 25}, author = {Gumerov, Nail A. and Duraiswami, Ramani} } @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.} } @article {16572, title = {Spreading depression in focal ischemia: A computational study}, journal = {Journal of Cerebral Blood Flow \& Metabolism}, volume = {18}, year = {1998}, month = {1998///}, pages = {998 - 1007}, author = {Revett,K. and Ruppin,E. and Goodall,S. and Reggia, James A.} } @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} } @inbook {13718, title = {A Thematic Hierarchy for Efficient Generation from Lexical-Conceptual Structure}, 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 = {333 - 343}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {This paper describes an implemented algorithm for syntactic realization of a target-language sentence from an interlingual representation called Lexical Conceptual Structure (LCS). We provide a mapping between LCS thematic roles and Abstract Meaning Representation (AMR) relations; these relations serve as input to an off-the-shelf generator (Nitrogen). There are two contributions of this work: (1) the development of a thematic hierarchy that provides ordering information for realization of arguments in their surface positions; (2) the provision of a diagnostic tool for detecting inconsistencies in an existing online LCS-based lexicon that allows us to enhance principles for thematic-role assignment.}, isbn = {978-3-540-65259-5}, url = {http://dx.doi.org/10.1007/3-540-49478-2_30}, author = {Dorr, Bonnie J and Habash,Nizar and Traum,David}, editor = {Farwell,David and Gerber,Laurie and Hovy,Eduard} } @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} } @article {16024, title = {Updating Discourse Context with Active Logic}, volume = {UMIACS-TR-96-62}, year = {1998}, month = {1998/10/15/}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {In this paper we present our implementation of a system of active logicthat processes natural language discourses. We focus on problems that involve presupposition and the associated well-known problems of the projection of presupposition. We discuss Heim{\textquoteright}s largely successful theory of presupposition and point out certain limitations. We then use these observations to build our discourse processor based on active logic. Our main contributions are the handling of problems that go beyond the scope of Heim{\textquoteright}s theory , especially discourses the involve cancellation of presupposition. Ongoing work suggests that conversational implicature and the cancellation of implicature can also be treated by our methods. Key words: presupposition, discourse, con text, accommodation, active logic, implicature. (Also cross-referenced as UMIACS-TR-96-62) }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu//handle/1903/842}, author = {Gurney,John and Purang,Khemdut and Perlis, Don} } @conference {14468, title = {Utility elicitation as a classification problem}, booktitle = {Proceedings of the Fourteenth conference on Uncertainty in artificial intelligence}, series = {UAI{\textquoteright}98}, year = {1998}, month = {1998///}, pages = {79 - 88}, publisher = {Morgan Kaufmann Publishers Inc.}, organization = {Morgan Kaufmann Publishers Inc.}, address = {San Francisco, CA, USA}, abstract = {We investigate the application of classification techniques to utility elicitation. In a decision problem, two sets of parameters must generally be elicited: the probabilities and the utilities. While the prior and conditional probabilities in the model do not change from user to user, the utility models do. Thus it is necessary to elicit a utility model separately for each new user. Elicitation is long and tedious, particularly if the outcome space is large and not decomposable. There are two common approaches to utility function elicitation. The first is to base the determination of the user{\textquoteright}s utility function solely on elicitation of qualitative preferences. The second makes assumptions about the form and decomposability of the utility function. Here we take a different approach: we attempt to identify the new user{\textquoteright}s utility function based on classification relative to a database of previously collected utility functions. We do this by identifying clusters of utility functions that minimize an appropriate distance measure. Having identified the clusters, we develop a classification scheme that requires many fewer and simpler assessments than full utility elicitation and is more robust than utility elicitation based solely on preferences. We have tested our algorithm on a small database of utility functions in a prenatal diagnosis domain and the results are quite promising.}, isbn = {1-55860-555-X}, url = {http://dl.acm.org/citation.cfm?id=2074094.2074104}, author = {Chajewska,Urszula and Getoor, Lise and Norman,Joseph and Shahar,Yuval} } @conference {16499, title = {Wrapper generation for Web accessible data sources}, booktitle = {3rd IFCIS International Conference on Cooperative Information Systems, 1998. Proceedings}, year = {1998}, month = {1998/08/22/22}, pages = {14 - 23}, publisher = {IEEE}, organization = {IEEE}, abstract = {There is an increase in the number of data sources that can be queried across the WWW. Such sources typically support HTML forms-based interfaces and search engines query collections of suitably indexed data. The data is displayed via a browser: One drawback to these sources is that there is no standard programming interface suitable for applications to submit queries. Second, the output (answer to a query) is not well structured. Structured objects have to be extracted from the HTML documents which contain irrelevant data and which may be volatile. Third, domain knowledge about the data source is also embedded in HTML documents and must be extracted. To solve these problems, we present technology to define and (automatically) generate wrappers for Web accessible sources. Our contributions are as follows: (1) Defining a wrapper interface to specify the capability of Web accessible data sources. (2) Developing a wrapper generation toolkit of graphical interfaces and specification languages to specify the capability of sources and the functionality of the wrapper (3) Developing the technology to automatically generate a wrapper appropriate to the Web accessible source, from the specifications.}, keywords = {application program interfaces, data mining, Databases, Educational institutions, Electrical capacitance tomography, HTML, HTML documents, Internet, Query processing, Read only memory, Search engines, Specification languages, Uniform resource locators, World Wide Web, wrapper generation toolkit, WWW}, isbn = {0-8186-8380-5}, doi = {10.1109/COOPIS.1998.706180}, author = {Gruser,J. and Raschid, Louiqa and Vidal,M. E and Bright,L.} } @article {15369, title = {2-D MOSFET modeling including surface effects and impact ionization by self-consistent solution of the Boltzmann, Poisson, and hole-continuity equations}, journal = {Electron Devices, IEEE Transactions on}, volume = {44}, year = {1997}, month = {1997/02//}, pages = {257 - 267}, abstract = {We present a new two-dimensional (2-D) MOSFET simulation method achieved by directly solving the Boltzmann transport equation for electrons, the hole-current continuity equation, and the Poisson equation self-consistently. The spherical harmonic method is used for the solution of the Boltzmann equation. The solution directly gives the electron distribution function, electrostatic potential, and the hole concentration for the entire 2-D MOSFET. Average quantities such as electron concentration and electron temperature are obtained directly from the integration of the distribution function. The collision integral is formulated to arbitrarily high spherical harmonic order, and new collision terms are included that incorporate effects of surface scattering and electron-hole pair recombination/generation. I-V characteristics, which agree with experiment, are calculated directly from the distribution function for an LDD submicron MOSFET. Electron-hole pair generation due to impact ionization is also included by direct application of the collision integral. The calculations are efficient enough for day-to-day engineering design on workstation-type computers}, keywords = {2D, characteristics;LDD, concentration;electron, concentration;hole-continuity, density;electron-hole, density;impact, device, distribution, effects;surface, equation;collision, equation;I-V, equation;MOSFET;electron, equations;impact, equations;semiconductor, function;electron, generation;electron-hole, harmonic, integral;electron, ionisation;integral, ionization;self-consistent, method;Boltzmann, method;surface, modeling;Boltzmann, models;surface, MOSFET, MOSFET;Poisson, pair, potential;hole, recombination;electrostatic, recombination;hole, scattering;, scattering;two-dimensional, simulation, solution;spherical, submicron, temperature;electron-hole, transport}, isbn = {0018-9383}, doi = {10.1109/16.557713}, author = {Liang,Wenchao and Goldsman,N. and Mayergoyz, Issak D and Oldiges,P.J.} } @article {18817, title = {Automated manufacturability analysis: A survey}, journal = {Research in Engineering Design}, volume = {9}, year = {1997}, month = {1997///}, pages = {168 - 190}, abstract = {In the market-place of the 21st century, there is no place for traditional {\textquoteleft}over-the-wall{\textquoteright} communications between design and manufacturing. In order to {\textquoteleft}design it right the very first time{\textquoteright}, designers must ensure that their products are both functional and easy to manufacture. Software tools have had some successes in reducing the barriers between design and manufacturing. Manufacturability analysis systems are emerging as one such tool {\textemdash} enabling identification of potential manufacturing problems during the design phase and providing suggestions to designers on how to eliminate them.}, keywords = {engineering}, isbn = {0934-9839}, doi = {10.1007/BF01596601}, url = {http://www.springerlink.com/content/p8p5516251023777/abstract/}, author = {Gupta, Satyandra K. and Regli,William C. and Das,Diganta and Nau, Dana S.} } @conference {17567, title = {Better approximation guarantees for job-shop scheduling}, booktitle = {Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms}, series = {SODA {\textquoteright}97}, year = {1997}, month = {1997///}, pages = {599 - 608}, publisher = {Society for Industrial and Applied Mathematics}, organization = {Society for Industrial and Applied Mathematics}, address = {Philadelphia, PA, USA}, isbn = {0-89871-390-0}, url = {http://dl.acm.org/citation.cfm?id=314161.314395}, author = {Goldberg,Leslie Ann and Paterson,Mike and Srinivasan, Aravind and Sweedyk,Elizabeth} } @article {16549, title = {A computational model of acute focal cortical lesions}, journal = {Stroke}, volume = {28}, year = {1997}, month = {1997///}, pages = {101 - 101}, author = {Goodall,S. and Reggia, James A. and Chen,Y. and Ruppin,E. and Whitney,C.} } @article {14473, title = {Effective redundant constraints for online scheduling}, journal = {PROCEEDINGS OF THE NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE}, year = {1997}, month = {1997///}, pages = {302 - 307}, abstract = {The use of heuristics as a means to improve constraint solverperformance has been researched widely. However, most work has been on problem-independent heuristics (e.g., vari- able and value ordering), and has focused on offline prob- lems (e.g., one-shot constraint satisfaction). In this paper, we present an online scheduling problem for which we are developing a real-time scheduling algorithm. While we can and do use generic heuristics in the scheduler, here we fo- cus on the use of domain-specific redundant constraints to ef- fectively approximate optimal offline solutions. We present a taxonomy of redundant domain constraints, and examine their impact on the effectiveness of the scheduler. We also describe several techniques for generating redundant con- straints, which can be applied to a large class of job shop scheduling problems. }, author = {Getoor, Lise and Ottosson,G. and Fromherz,M. and Carlson,B.} } @article {15987, title = {Interpreting presuppositions using active logic: From contexts to utterances}, journal = {Computational Intelligence}, volume = {13}, year = {1997}, month = {1997///}, pages = {391 - 413}, author = {Gurney,J. and Perlis, Don and Purang,K.} } @conference {13584, title = {Local correspondence for detecting random forgeries}, booktitle = {Document Analysis and Recognition, 1997., Proceedings of the Fourth International Conference on}, volume = {1}, year = {1997}, month = {1997/08//}, pages = {319 -323 vol.1 - 319 -323 vol.1}, abstract = {Progress on the problem of signature verification has advanced more rapidly in online applications than offline applications, in part because information which can easily be recorded in online environments, such as pen position and velocity, is lost in static offline data. In offline applications, valuable information which can be used to discriminate between genuine and forged signatures is embedded at the stroke level. We present an approach to segmenting strokes into stylistically meaningful segments and establish a local correspondence between a questioned signature and a reference signature to enable the analysis and comparison of stroke features. Questioned signatures which do not conform to the reference signature are identified as random forgeries. Most simple forgeries can also be identified, as they do not conform to the reference signature{\textquoteright}s invariant properties such as connections between letters. Since we have access to both local and global information, our approach also shows promise for extension to the identification of skilled forgeries}, keywords = {applications;online, applications;questioned, correspondence;offline, detection;reference, extraction;handwriting, features;stroke, forged, forgeries;random, forgeries;stroke, Forgery, level;stroke, meaningful, processing;, properties;local, recognition;image, segmentation;stylistically, segmentation;word, segments;feature, signature;random, signature;signature, signatures;invariant, verification;skilled}, doi = {10.1109/ICDAR.1997.619864}, author = {Guo,J. K and David Doermann and Rosenfeld, A.} } @conference {14813, title = {MDL: a language and compiler for dynamic program instrumentation}, booktitle = {, 1997 International Conference on Parallel Architectures and Compilation Techniques., 1997. Proceedings}, year = {1997}, month = {1997/11/10/14}, pages = {201 - 212}, publisher = {IEEE}, organization = {IEEE}, abstract = {We use a form of dynamic code generation, called dynamic instrumentation, to collect data about the execution of an application program. Dynamic instrumentation allows us to instrument running programs to collect performance and other types of information. The instrumentation code is generated incrementally and can be inserted and removed at any time. Our instrumentation currently runs on the SPARC, PA-RISC, Power 2, Alpha, and x86 architectures. Specification of what data to collect are written in a specialized language called the Metric Description Language, that is part of the Paradyn Parallel Performance Tools. This language allows platform independent descriptions of how to collect performance data. It also provides a concise way to specify, how to constrain performance data to particular resources such as modules, procedures, nodes, files, or message channels (or combinations of these resources). We also describe the details of how we weave instrumentation into a running program}, keywords = {Alpha architecture, application program, application program interfaces, Application software, compiler generators, Computer science, dynamic code generation, Dynamic compiler, dynamic program instrumentation, Educational institutions, files, instrumentation code, Instruments, MDL, measurement, message channels, Message passing, Metric Description Language, modules, nodes, Operating systems, optimising compilers, PA-RISC, Paradyn Parallel Performance Tools, Parallel architectures, parallel programming, performance data, platform independent descriptions, Power 2 architecture, Power generation, procedures, program debugging, Program processors, running programs, Runtime, software metrics, SPARC, Specification languages, x86 architecture}, isbn = {0-8186-8090-3}, doi = {10.1109/PACT.1997.644016}, author = {Hollingsworth, Jeffrey K and Niam, O. and Miller, B. P and Zhichen Xu and Goncalves,M. J.R and Ling Zheng} } @conference {17623, title = {Mechanism design for intellectual property rights protection}, booktitle = {Proceedings of the eighteenth international conference on Information systems}, series = {ICIS {\textquoteright}97}, year = {1997}, month = {1997///}, pages = {448{\textendash} - 448{\textendash}}, publisher = {Association for Information Systems}, organization = {Association for Information Systems}, address = {Atlanta, GA, USA}, url = {http://dl.acm.org/citation.cfm?id=353071.353206}, author = {Giridharan,P. S. and Srinivasan, Aravind} } @article {15796, title = {Regularization by Truncated Total Least Squares}, journal = {SIAM Journal on Scientific Computing}, volume = {18}, year = {1997}, month = {1997///}, pages = {1223 - 1241}, abstract = {The total least squares (TLS) method is a successful method for noise reduction in linear least squares problems in a number of applications. The TLS method is suited to problems in which both the coefficient matrix and the right-hand side are not precisely known. This paper focuses on the use of TLS for solving problems with very ill-conditioned coefficient matrices whose singular values decay gradually (so-called discrete ill-posed problems), where some regularization is necessary to stabilize the computed solution. We filter the solution by truncating the small singular values of the TLS matrix. We express our results in terms of the singular value decomposition (SVD) of the coefficient matrix rather than the augmented matrix. This leads to insight into the filtering properties of the truncated TLS method as compared to regularized least squares solutions. In addition, we propose and test an iterative algorithm based on Lanczos bidiagonalization for computing truncated TLS solutions.}, keywords = {bidiagonalization, discrete ill-posed problems, regularization, total least squares}, doi = {10.1137/S1064827594263837}, url = {http://link.aip.org/link/?SCE/18/1223/1}, author = {Fierro,R. D. and Golub, G. H and Hansen,P. C. and O{\textquoteright}Leary, Dianne P.} } @conference {16464, title = {Semantic query optimization for object databases}, booktitle = {Data Engineering, 1997. Proceedings. 13th International Conference on}, year = {1997}, month = {1997///}, pages = {444 - 453}, author = {Grant,J. and Gryz,J. and Minker, Jack and Raschid, Louiqa} } @conference {15524, title = {Semantic query optimization for object databases}, booktitle = {Data Engineering, 1997. Proceedings. 13th International Conference on}, year = {1997}, month = {1997/04//}, pages = {444 - 453}, abstract = {Presents a technique for semantic query optimization (SQO) for object databases. We use the ODMG-93 (Object Data Management Group) standard ODL (Object Database Language) and OQL (Object Query Language) languages. The ODL object schema and the OQL object query are translated into a DATALOG representation. Semantic knowledge about the object model and the particular application is expressed as integrity constraints. This is an extension of the ODMG-93 standard. SQO is performed in the DATALOG representation, and an equivalent logic query and (subsequently) an equivalent OQL object query are obtained. SQO is based on the residue technique of Chakravarthy et al. (1990). We show that our technique generalizes previous research on SQO for object databases. It can be applied to queries with structure constructors and method application. It utilizes integrity constraints about keys, methods and knowledge of access support relations, to produce equivalent queries, which may have more efficient evaluation plans}, keywords = {application;object, constraints;keys;method, constructors;DATALOG;data, databases;object-oriented, databases;query, Datalog, Evaluation, integrity;data, languages;query, Logic, object, optimization;structure, plans;residue, processing;software, query, query;access, query;integrity, relations;equivalent, representation;ODL, schema;ODMG-93, standard;OQL, standards;, structures;object-oriented, Support, technique;semantic}, doi = {10.1109/ICDE.1997.581983}, author = {Grant,J. and Gryz,J. and Minker, Jack and Raschid, Louiqa} } @conference {16359, title = {Symbolic model checking of infinite state systems using Presburger arithmetic}, booktitle = {Computer Aided Verification}, year = {1997}, month = {1997///}, pages = {400 - 411}, author = {Bultan,T. and Gerber,R. and Pugh, William} } @article {18868, title = {Towards multiprocessor feature recognition}, journal = {Computer-Aided Design}, volume = {29}, year = {1997}, month = {1997/01//}, pages = {37 - 51}, abstract = {The availability of low-cost computational power is enabling the development of increasingly sophisticated cad software. Automation of design and manufacturing activities poses many difficult computational problems{\textemdash}significant among them is how to develop interactive systems that enable designers to explore and experiment with alternative ideas. As more downstream manufacturing activities are considered during the design phase, computational costs become problematic. Creating working software-based solutions requires a sophisticated allocation of computational resources in order to perform realistic design analyses and generate feedback. This paper presents our initial efforts to employ multiprocessor algorithms to recognize machining features from solid models of parts with large numbers of features and many geometric and topological entities. Our goal is to outline how improvements in computation time can be obtained by migrating existing software tools to multiprocessor architectures. An implementation of our approach is discussed.}, keywords = {Distributed computing, feature recognition, feature-based modelling, multiprocessor solid modelling}, isbn = {0010-4485}, doi = {10.1016/S0010-4485(96)00047-4}, url = {http://www.sciencedirect.com/science/article/pii/S0010448596000474}, author = {Regli,William C. and Gupta, Satyandra K. and Nau, Dana S.} } @article {18733, title = {Using manufacturing planning to generate manufacturability feedback}, journal = {Journal of Mechanical Design}, volume = {119}, year = {1997}, month = {1997///}, pages = {73 - 73}, author = {Gupta,S.K.} } @article {12177, title = {A zooming web browser}, journal = {Human Factors in Web Development}, year = {1997}, month = {1997///}, author = {Bederson, Benjamin B. and Hollan,J.D. and Stewart,J. and Rogers,D. and Druin, Allison and Vick,D. and Ring,L. and Grose,E. and Forsythe,C.} } @conference {15533, title = {Disjunctive deductive databases: Semantics, updates and architecture}, booktitle = {Proceedings of the 4th Bar-Ilan Symposium on Foundations of AI}, year = {1996}, month = {1996///}, pages = {256 - 274}, abstract = {The basic assumption in relational and deductive databases is that there are no gaps in our knowledge. That is, the database cannot store data that contain null values or data that is indefinite. In practical situations knowledge is not precise, and there are gaps in our knowledge. These gaps may be due to null values in the data, may arise when we combine several databases that lead to inconsistent theories, or may occur because information is indefinite in nature, such as in military or medical applications. In this paper we describe semantics for disjunctive deductive databases that extend the work in deductive databases, solve the view update problem, and permit indefinite data to be represented efficiently. Hierarchic, stratified, and normal stable models of disjunctive databases are described. An architecture is proposed for a disjunctive deductive database system and a class of theories for which the architecture will be effective is discussed.}, author = {Fernandez,J. A. and Gryz,J. and Minker, Jack} } @article {16379, title = {Efficient distribution analysis via graph contraction}, journal = {Languages and Compilers for Parallel Computing}, year = {1996}, month = {1996///}, pages = {377 - 391}, author = {Sheffler,T. and Schreiber,R. and Pugh, William and Gilbert,J. and Chatterjee,S.} } @article {18438, title = {The empirical investigation of Perspective-Based Reading}, journal = {Empirical Software Engineering}, volume = {1}, year = {1996}, month = {1996///}, pages = {133 - 164}, abstract = {We consider reading techniques a fundamental means of achieving high quality software. Due to the lack of research in this area, we are experimenting with the application and comparison of various reading techniques. This paper deals with our experiences with a family of reading techniques known as Perspective-Based Reading (PBR), and its application to requirements documents. The goal of PBR is to provide operational scenarios where members of a review team read a document from a particular perspective, e.g., tester, developer, user. Our assumption is that the combination of different perspectives provides better coverage of the document, i.e., uncovers a wider range of defects, than the same number of readers using their usual technique.}, keywords = {Computer, Science}, isbn = {1382-3256}, url = {http://dx.doi.org/10.1007/BF00368702}, author = {Basili, Victor R. and Green,Scott and Laitenberger,Oliver and Lanubile,Filippo and Shull, Forrest and S{\o}rumg{\r a}rd,Sivert and Zelkowitz, Marvin V} } @article {18839, title = {Generating redesign suggestions to reduce setup cost: a step towards automated redesign}, journal = {Computer-Aided Design}, volume = {28}, year = {1996}, month = {1996/10//}, pages = {763 - 782}, abstract = {All mechanical designs pass through a series of formal and informal redesign steps, involving the analysis of functionality, manufacturability, cost and other life-cycle factors. The speed and efficacy of these steps has a major influence on the lead time of the product from conceptualization to launching. In this paper we propose a methodology for automatically generating redesign suggestions for reducing setup costs for machined parts.Given an interpretation of the design as a collection of machinable features, our approach is to generate alternate machining features by making geometric changes to the original features, and add them to the feature set of the original part to create an extended feature set. The designer may provide restrictions on the design indicating the type and extent of modifications allowed on certain faces and volumes, in which case all redesign suggestions generated by our approach honour those restrictions. By taking combinations of features from the extended feature set generated above, we can generate modified versions of the original design that still satisfy the designer{\textquoteright}s intent. By considering precedence constraints, we can estimate the setup time that will be required for each design. Any modified design whose setup time is less than that of the original design can be presented to the designer as a possible way to modify the original design. }, isbn = {0010-4485}, doi = {10.1016/0010-4485(95)00034-8}, url = {http://www.sciencedirect.com/science/article/pii/0010448595000348}, author = {Das,Diganta and Gupta, Satyandra K. and Nau, Dana S.} } @conference {17860, title = {A high performance image database system for remotely sensed imagery}, booktitle = {Euro-Par{\textquoteright}96 Parallel Processing}, year = {1996}, month = {1996///}, pages = {109 - 122}, author = {Shock,C. and Chang,C. and Davis, Larry S. and Goward,S. and Saltz, J. and Sussman, Alan} } @conference {16551, title = {Learning activation rules for associative networks}, booktitle = {Neural Networks, 1996., IEEE International Conference on}, volume = {1}, year = {1996}, month = {1996///}, pages = {365 - 370}, author = {Reggia, James A. and Grundstrom,E. and Berndt,R. S} } @article {16625, title = {Learning Activation Rules Rather Than Connection Weights}, journal = {International journal of neural systems}, volume = {7}, year = {1996}, month = {1996///}, pages = {129 - 148}, author = {Grundstrom,E. L and Reggia, James A.} } @article {15534, title = {Model theoretic approach to view updates in deductive databases}, journal = {Journal of Automated Reasoning}, volume = {17}, year = {1996}, month = {1996///}, pages = {171 - 197}, abstract = {The view update problem for deductive databases has been defined as the problem of accomplishing the update of an intensional predicate by modifying appropriately the extensional database. A previous paper by Grant, Horty, Lobo, and Minker developed algorithms for the insertion and the deletion of an intensional predicate in certain important classes of stratified disjunctive deductive databases. This paper introduces a model theoretic approach which encompasses a wide class of Herbrand semantics, including the perfect model and stable model semantics, for disjunctive databases including negation. This generalizes the earlier results: now the intensional database may contain disjunctive and denial rules, and the database may be required to satisfy integrity constraints. As in the previous paper, the algorithms are proved to be correct and best according to the criterion of causing minimal change to the database, where the first priority is to minimize deletions.}, doi = {10.1007/BF00244495}, author = {Fernandez,J. A. and Grant,J. and Minker, Jack} } @article {15532, title = {Semantic query optimization for bottom-up evaluation}, journal = {Foundations of Intelligent Systems}, year = {1996}, month = {1996///}, pages = {561 - 571}, abstract = {Semantic query optimization uses semantic knowledge in databases (represented in the form of integrity constraints) to rewrite queries and logic programs to achieve efficient query evaluation. Much work has been done to develop various techniques for optimization. Most of it, however, is applicable to top-down query evaluation strategies. Moreover, little attention has been paid to the cost of the optimization. We address the issue of semantic query optimization for bottom-up query evaluation strategies with an emphasis on overall efficiency. We focus on a single optimization technique, join elimination. We discuss factors that influence the cost of semantic optimization, and present two different abstract algorithms for optimization. The first pre-processes a query statically before it is evaluated; the second combines query evaluation with semantic optimization using heuristics to achieve the largest possible savings.}, doi = {10.1007/3-540-61286-6_180}, author = {Godfrey,P. and Gryz,J. and Minker, Jack} } @article {15443, title = {SEROS {\textendash} A SELF-ROUTING OPTICAL ATM SWITCH}, journal = {International Journal of Communication Systems}, volume = {9}, year = {1996}, month = {1996///}, pages = {115 - 125}, abstract = {A fault-tolerant high-performance SElf-Routing 2 {\texttimes} 2 Optical ATM Switch (SEROS) is proposed. The switch is designed using all-optical components which allows the exploitation of spatial parallelism. SEROS can be used with any multistage interconnection network such as Omega, Banyan, Shuffle or Benes. For the purpose of this study, SEROS has been incorporated into a generic self-routing multistage interconnection network that uses 2 {\texttimes} 2 switches and is not fault tolerant. Reliability analysis is carried out and the results are compared with two major fault-tolerant networks. They show that without redundant switches, better network survivability is achieved. All the switches in the network are 2 {\texttimes} 2, making it easier to mass produce.}, keywords = {2 {\texttimes} 2 ATM switch, fault-tolerant, MINs, photonic switching network, reliability, self-routing}, isbn = {1099-1131}, doi = {10.1002/(SICI)1099-1131(199603)9:2<115::AID-DAC301>3.0.CO;2-B}, url = {http://onlinelibrary.wiley.com/doi/10.1002/(SICI)1099-1131(199603)9:2<115::AID-DAC301>3.0.CO;2-B/abstract}, author = {Guizani,Mohsen and Memon, Atif M.} } @conference {14897, title = {Space/time trade-offs for associative memory}, booktitle = {Pattern Recognition, 1996., Proceedings of the 13th International Conference on}, volume = {4}, year = {1996}, month = {1996/08//}, pages = {296 -302 vol.4 - 296 -302 vol.4}, abstract = {In any storage scheme, there is some trade-off between the space used (size of memory) and access time. However, the nature of this trade-off seems to depend on more than just what is being stored-it also depends the types of queries we consider. We justify this claim by considering a particular memory model and contrast recognition (membership queries) with associative recall. We show that the latter task can require exponentially larger memories even when identical information is stored}, keywords = {access, matching;set, memory;associative, nets;pattern, processing;content-addressable, query;memory, recall;membership, scheme;associative, space;set, storage;neural, theory;, theory;storage, time;associative}, doi = {10.1109/ICPR.1996.547434}, author = {GROVE,A. J and Jacobs, David W.} } @article {18818, title = {Automated Manufacturability Analysis: A Survey}, volume = {ISR; TR 1995-14}, year = {1995}, month = {1995///}, institution = {Institute for Systems Research, University of Maryland, College Park}, abstract = {In the marketplace of the 21st century, there is no place for traditional {\textquoteleft}{\textquoteleft}over-the-wall{\textquoteright}{\textquoteright} communications between design and manufacturing. In order to {\textquoteleft}{\textquoteleft}design it right the very first time,{\textquoteright}{\textquoteright} designers must ensure that their products are both functional and easy to manufacture. Software tools have had some successes in reducing the barriers between design and manufacturing. Manufacturability analysis systems are emerging as one such tool---enabling identification of potential manufacturing problems during the design phase and providing suggestions to designers on how to eliminate them.

In this paper, we provide a survey of current state of the art in automated manufacturability analysis. We present the historical context in which this area has emerged and outline characteristics to compare and classify various systems. We describe the two dominant approaches to automated manufacturability analysis and overview representative systems based on their application domain. We describe support tools that enhance the effectiveness of manufacturability analysis systems. Finally, we attempt to expose some of the existing research challenges and future directions.

}, keywords = {manufacturability, Manufacturing, Solid modeling, Systems Integration Methodology}, url = {http://drum.lib.umd.edu//handle/1903/5609}, author = {Das,Diganta and Gupta, Satyandra K. and Regli,W. C. and Nau, Dana S.} } @mastersthesis {18816, title = {Automated Manufacturability Analysis of Machined Parts}, year = {1995}, month = {1995///}, school = {UNIVERSITY OF MARYLAND, COLLEGE PARK}, abstract = {Because of pressing demands to reduce lead time and product cost, increasing research attention is being given to integration of engineering design and manufacturing. In this thesis, a systematic approach has been developed for computer-aided manufacturability analysis of machined parts. This approach can be used during design stages to improve the product quality from the manufacturing point of view.

Evaluating the manufacturability of a proposed design involves determining whether or not it is manufacturable with a given set of manufacturing operations - and if so, then finding the associated manufacturing efficiency. In this research, the design is represented as a solid model. The tolerance and surface finish information is represented as attributes of various faces of the solid model. Machining features are used to model the available machining operations Since there can be several different ways to manufacture a proposed design, this requires considering alternative ways to manufacture it, in order to determine which one best meets the design and manufacturing objectives.

The approach developed in this thesis is based on the systematic exploration of various machining plans. The first step is to identify all machining features which can potentially be used to machine the given design. Using these features, different machining plans are generated. Each time a new plan generated, it is examined to find whether it can produce the desired design tolerances. If a plan is found to be capable of meeting the tolerance specifications, then its rating is computed. If no machining plan can be found that is capable of producing the design, then the design cannot be machined using the given set of machining operations; otherwise, the manufacturability rating of the design is computed. Since various alternative ways of machining the part are considered in this approach, the conclusions about the manufacturability are more realistic compared to the approach where just one alternative is considered.

It is anticipated that this research will help in speeding up the evaluation of new product designs in order to decide how or whether to manufacture them. Such a capability will be useful in responding quickly to changing demands and opportunities in the marketplace.}, keywords = {Automation, computer aided manufacturing, computer integrated manufacturing, Feature extraction, flexible manufacturing, manufacturability, Manufacturing, Solid modeling}, url = {http://drum.lib.umd.edu//handle/1903/5693}, author = {Gupta, Satyandra K.} } @article {14406, title = {The COLLAGE/KHOROS link: Planning for image processing tasks}, journal = {Integrated Planning Applications}, year = {1995}, month = {1995///}, pages = {67 - 76}, author = {Lansky,A. and Friedman,M. and Getoor, Lise and Schmidler,S. and Short Jr,N.} } @article {18824, title = {Current Trends and Future Challenges in Automated Manufacturability Analysis}, volume = {ISR; TR 1995-16}, year = {1995}, month = {1995///}, institution = {Institute for Systems Research, University of Maryland, College Park}, abstract = {In the marketplace of the 21st century, there is no place for traditional communications between design and manufacturing. In order to {\textquoteleft}{\textquoteleft}design it right the first time,{\textquoteright}{\textquoteright} designers must ensure that their products are both functional and easy to manufacture. Software tools have had some successes in reducing the barriers between design and manufacturing. Manufacturability analysis systems are emerging as one such tool---enabling identification of potential manufacturing problems during the design phase and providing suggestions to designers on how to eliminate them.

In this paper, we survey of current state of the art in automated manufacturability analysis. We describe the two dominant approaches to automated manufacturability analysis and overview representative systems based on their application domain. Finally, we attempt to expose some of the existing research challenges and future directions.}, keywords = {computer integrated manufacturing, manufacturability, Manufacturing, Solid modeling, Systems Integration Methodology}, url = {http://drum.lib.umd.edu//handle/1903/5611}, author = {Gupta, Satyandra K. and Das,Diganta and Regli,W. C. and Nau, Dana S.} } @conference {12787, title = {Efficient on-the-fly model checking for CTL}, booktitle = {, Tenth Annual IEEE Symposium on Logic in Computer Science, 1995. LICS {\textquoteright}95. Proceedings}, year = {1995}, month = {1995/06/26/29}, pages = {388 - 397}, publisher = {IEEE}, organization = {IEEE}, abstract = {This paper gives an on-the-fly algorithm for determining whether a finite-state system satisfies a formula in the temporal logic CTL. The time complexity of our algorithm matches that of the best existing {\textquotedblleft}global algorithm{\textquotedblright} for model checking in this logic, and it performs as well as the best known global algorithms for the sublogics CTL and LTL. In contrast with these approaches, however, our routine constructs the state space of the system under consideration in a need-driven fashion and will therefore perform better in practice}, keywords = {Algorithm design and analysis, Automata, computational complexity, Computer science, CTL, Encoding, finite automata, finite-state system, global algorithm, Logic, LTL, on-the-fly model checking, Performance analysis, Safety, State-space methods, sublogic, temporal logic, time complexity}, isbn = {0-8186-7050-9}, doi = {10.1109/LICS.1995.523273}, author = {Bhat,G. and Cleaveland, Rance and Grumberg,O.} } @article {18745, title = {Estimation of setup time for machined parts: accounting for work-holding constraints using a vise}, journal = {COMPUTERS IN ENGINEERING}, year = {1995}, month = {1995///}, pages = {619 - 632}, abstract = {For machined parts, setup time is a major component ofthe total time required to manufacture a machined part from a stock. If the number of setups and hence setup time can be reduced, this will not only decrease the manufacturing time, but will also ensure better machining accuracy, require fewer work-holding devices and increase machine usage time. To achieve any improvement in setup time, rst we need to estimate the setup time accurately. In this paper we pro- pose a methodology to estimate the setup time for machin- ing prismatic parts in a three axis vertical machining center. We concurrently consider three major factors for estimating the number of setups, namely|the precedence constraints among machining operations, the feasibility of work holding using vise clamping, and the availability of datum faces for locating the workpiece on the machine table during machin- ing on a 3 axis vertical machining center. }, url = {http://www.cs.umd.edu/~nau/papers/das1995estimation.pdf}, author = {Das,D. and Gupta,S.K. and Nau, Dana S.} } @article {13434, title = {Evaluation and selection of biases in machine learning}, journal = {Machine Learning}, volume = {20}, year = {1995}, month = {1995///}, pages = {5 - 22}, abstract = {In this introduction, we define the term bias as it is used in machine learning systems. We motivate the importance of automated methods for evaluating and selecting biases using a framework of bias selection as search in bias and meta-bias spaces. Recent research in the field of machine learning bias is summarized.}, isbn = {0885-6125}, url = {http://dx.doi.org/10.1007/BF00993472}, author = {Gordon,Diana F. and desJardins, Marie} } @article {15926, title = {Explicitly Biased Generalization}, journal = {Goal-Driven Learning}, year = {1995}, month = {1995///}, pages = {321 - 354}, author = {Gordon,D. and Perlis, Don} } @article {18831, title = {Extracting alternative machining features: An algorithmic approach}, journal = {Research in Engineering Design}, volume = {7}, year = {1995}, month = {1995///}, pages = {173 - 192}, abstract = {Automated recognition of features from CAD models has been attempted for a wide range of application domains. In this article we address the problem of representing and recognizing a complete class of features in alternative interpretation for a given design.}, keywords = {engineering}, isbn = {0934-9839}, doi = {10.1007/BF01638098}, url = {http://www.springerlink.com/content/t271m7t670m36484/abstract/}, author = {Regli,William C. and Gupta, Satyandra K. and Nau, Dana S.} } @conference {18750, title = {Interactive feature recognition using multi-processor methods}, year = {1995}, month = {1995///}, author = {Regli,W. C. and Gupta,S.K. and Nau, Dana S.} } @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 {18982, title = {Localization of Sequences Required for Size-specific Splicing of a SmallDrosophilaIntronin Vitro}, journal = {Journal of Molecular Biology}, volume = {253}, year = {1995}, month = {1995/10/27/}, pages = {426 - 437}, abstract = {Many introns inDrosophilaand other invertebrates are less than 80 nucleotides in length, too small to be recognized by the vertebrate splicing machinery. Comparison of nuclear splicing extracts from human HeLa andDrosophilaKc cells has revealed species-specificity, consistent with the observed size differences. Here we present additional results with the 68 nucleotide fifth intron of theDrosophilamyosin heavy chain gene. As observed with the 74 nucleotide second intron of theDrosophilawhite gene, the wild-type myosin intron is accurately spliced in a homologous extract, and increasing the size by 16 nucleotides both eliminates splicing in theDrosophilaextract and allows accurate splicing in the human extract. In contrast to previous results, however, an upstream cryptic 5' splice site is activated when the wild-type myosin intron is tested in a human HeLa cell nuclear extract, resulting in the removal of 98 nucleotide intron.The size dependence of splicing inDrosophilaextracts is also intron-specific; we noted that a naturally larger (150 nucleotide) intron from theftzgene is efficiently spliced in Kc cell extracts that do not splice enlarged introns (of 84, 90, 150 or 350 nucleotides) derived from the 74 nucleotidewhiteintron. Here, we have exploited that observation, using a series of hybrid introns to show that a region of 46 nucleotides at the 3' end of thewhiteintron is sufficient to confer the species-specific size effect. At least two sequence elements within this region, yet distinct from previously described branchpoint and pyrimidine tract signals, are required for efficient splicing of small splicing of small hybrid intronsin vitro. }, keywords = {Drosophila; pre-mRNA splicing; intron size; species specificity; in vitrosplicing}, isbn = {0022-2836}, doi = {10.1006/jmbi.1995.0564}, url = {http://www.sciencedirect.com/science/article/pii/S0022283685705645}, author = {Guo,Ming and Mount, Stephen M.} } @conference {18858, title = {Manufacturing feature instances: which ones to recognize?}, series = {SMA {\textquoteright}95}, year = {1995}, month = {1995///}, pages = {141 - 152}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, isbn = {0-89791-672-7}, doi = {10.1145/218013.218052}, url = {http://doi.acm.org/10.1145/218013.218052}, author = {Gupta, Satyandra K. and Regli,William C. and Nau, Dana S.} } @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 {16377, title = {Parametric dispatching of hard real-time tasks}, journal = {IEEE Transactions on ComputersIEEE Trans. Comput.}, volume = {44}, year = {1995}, month = {1995/03//}, pages = {471 - 479}, isbn = {00189340}, doi = {10.1109/12.372041}, url = {http://dl.acm.org/citation.cfm?id=626999}, author = {Gerber,R. and Pugh, William and Saksena,M.} } @inbook {14632, title = {Polynomial-time algorithm for computing translocation distance between genomes}, booktitle = {Combinatorial Pattern MatchingCombinatorial Pattern Matching}, series = {Lecture Notes in Computer Science}, volume = {937}, year = {1995}, month = {1995///}, pages = {162 - 176}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {With the advent of large-scale DNA physical mapping and sequencing, studies of genome rearrangements are becoming increasingly important in evolutionary molecular biology. From a computational perspective, study of evolution based on rearrangements leads to rearrangement distance problem, i.e., computing the minimum number of rearrangement events required to transform one genome into another. Different types of rearrangement events give rise to a spectrum of interesting combinatorial problems. The complexity of most of these problems is unknown. Multichromosomal genomes frequently evolve by a rearrangement event called translocation which exchanges genetic material between different chromosomes. In this paper we study the translocation distance problem, modeling evolution of genomes evolving by translocations. Translocation distance problem was recently studied for the first time by Kececioglu and Ravi, who gave a 2-approximation algorithm for computing translocation distance. In this paper we prove a duality theorem leading to a polynomial algorithm for computing translocation distance for the case when the orientation of the genes are known. This leads to an algorithm generating a most parsimonious (shortest) scenario, transforming one genome into another by translocations.}, isbn = {978-3-540-60044-2}, url = {http://dx.doi.org/10.1007/3-540-60044-2_41}, author = {Hannenhalli, Sridhar}, editor = {Galil,Zvi and Ukkonen,Esko} } @article {13466, title = {Representing a student{\textquoteright}s learning states and transitions}, journal = {American Association of Artificial Intelligence Spring Symposium on Representing Mental States and Mechanisms}, year = {1995}, month = {1995///}, abstract = {We describe an ongoing project to develop an adaptive training system (ATS) that dynamically models a student{\textquoteright}s learning processes and can provide specialized tutoring adapted to a student{\textquoteright}s knowledge state and learning style. The student modeling component of the ATS, ML-Modeler, uses machine learning (ML) techniques to emulate the student{\textquoteright}s novice-toexpert transition. ML-Modeler infers which learning methods the student has used to reach the current knowledge state by comparing the student{\textquoteright}s solution trace to an expert solution and generating plausible hypotheses about what misconceptions and errors the student has made. A case-based approach is used to generate hypotheses through incorrectly applying analogy, overgeneralization, and overspecialization. The student and expert models use a network-based representation that includes abstract concepts and relationships as well as strategies for problem solving. Fuzzy methods are used to represent the uncertainty in the student model. This paper describes the design of the ATS and ML-Modeler, and gives a detailed example of how the system would model and tutor the student in a typical session. The domain we use for this example is high-school level chemistry.}, author = {Gurer,D. and desJardins, Marie and Schlager,M.} } @article {14409, title = {Scope and abstraction: Two criteria for localized planning}, journal = {INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE}, volume = {14}, year = {1995}, month = {1995///}, pages = {1612 - 1619}, abstract = {Localization is a general-purpose representational technique for partitioning a problem intosubproblems. A localized problem-solver searches several smaller search spaces, one for each subproblem. Unlike most methods of partitioning, however, localization allows for subprob- lems that overlap i.e. multiple search spaces may be involved in constructing shared pieces of the overall plan. In this paper we focus on two criteria for forming localizations: scope and abstraction. We describe a method for automatically generating such localizations and provide empirical results that contrast their use in an o ce-building construction domain. }, author = {Lansky,A. L and Getoor, Lise} } @conference {13853, title = {Selecting Tense, Aspect, and Connecting Words In Language Generation}, booktitle = {In Proceedings of IJCAI-95}, year = {1995}, month = {1995///}, pages = {1299 - 1305}, abstract = {Generating language that reflects the temporal organization of represented knowledge requires a language generation model that integrates contemporary theories of tense and aspect, temporal representations, and methods to plan text. This paper presents a model that produces complex sentences that reflect temporal relations present in underlying temporal concepts. The main result of this work is the successful application of constrained linguistic theories of tense and aspect to a generator which produces meaningful event combinations and selects appropriate connecting words that relate them. 1 Introduction Reasoning about temporal knowledge and formulating answers to questions that involve time necessitate the presentation of temporal information to users. One approach is to incorporate the temporal information directly into natural language paraphrases of the represented knowledge. This requires a method to plan language that contains not only tense selections, but aspect selections...}, author = {Dorr, Bonnie J and Gaasterland,Terry} } @article {18866, title = {Systematic approach to analysing the manufacturability of machined parts}, journal = {Computer-Aided Design}, volume = {27}, year = {1995}, month = {1995/05//}, pages = {323 - 342}, abstract = {The ability to quickly introduce new quality products is a decisive factor in capturing market share. Because of pressing demands to reduce leadtimes, analysing the manufacturability of the proposed design has become an important step in the design stage. The paper presents an approach to analysing the manufacturability of machined parts.Evaluating the manufacturability of a proposed design involves determining whether or not it is manufacturable with a given set of manufacturing operations, and, if it is, finding the associated manufacturing efficiency. Since there can be several different ways to manufacture a proposed design, this requires that different ways to manufacture it be considered, in order to determine which one best meets the design and manufacturing objectives. The first step in the approach is to identify all the machining operations which can potentially be used to create the given design. Using these operations, different operation plans are generated for machining the part. Each time a new operation plan is generated, the user examines whether it can produce the desired shape and tolerances, and calculates its manufacturability rating. If no operation plan can be found that is capable of producing the design, then the given design is considered unmachinable; otherwise, the manufacturability rating for the design is the rating of the best operation plan. The authors expect that, by providing feedback about possible problems with the design, the work described in the paper will help in speeding up the evaluation of new product designs so that it can be decided how or whether to manufacture them. Such a capability will be useful in responding quickly to changing demands and opportunities in the marketplace. }, keywords = {computer-aided manufacturability analysis, design for manufacturability, feature-based models}, isbn = {0010-4485}, doi = {10.1016/0010-4485(95)96797-P}, url = {http://www.sciencedirect.com/science/article/pii/001044859596797P}, author = {Gupta, Satyandra K. and Nau, Dana 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 {18813, title = {An Application of Distributed Solid Modeling: Feature Recognition}, volume = {ISR; TR 1994-82}, year = {1994}, month = {1994///}, institution = {Institute for Systems Research, University of Maryland, College Park}, abstract = {The availability of low-cost computational power is a driving force behind the growing sophistication of CAD software. Tools designed to reduce time-consuming build-test-redesign iterations are essential for increasing engineering quality and productivity. However, automation of the design process poses many difficult computational problems. As more downstream engineering activities are being considered during the design phase, guaranteeing reasonable response times within design systems becomes problematic. Design is an interactive process and speed is a critical factor in systems that enable designers to explore and experiment with alternative ideas during the design phase. Achieving interactivity requires an increasingly sophisticated allocation of computational resources in order to perform realistic design analyses and generate feedback in real time.

This paper presents our initial efforts to develop techniques to apply distributed algorithms to the problem of recognizing machining features from solid models. Existing work on recognition of features has focused exclusively on serial computer architectures. Our objective is to show that distributed algorithms can be employed on realistic parts with large numbers of features and many geometric and topological entities to obtain significant improvements in computation time using existing hardware and software tools. Migrating solid modeling applications toward a distributed computing frame-work enables interconnection of many of the autonomous and geographically diverse software tools used in the modern manufacturing enterprise.

This has been implemented on a network of SUN workstations using the ACIS solid modeler and the NIH C++ class library; inter-processor communication is handled with TCP/IP- based network communication tools.}, keywords = {Distributed computing, feature recognition, feature- based modeling, multiprocessor solid modeling, Systems Integration Methodology}, url = {http://drum.lib.umd.edu//handle/1903/5552}, author = {Regli,W. C. and Gupta, Satyandra K. and Nau, Dana S.} } @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 {15379, title = {Calculation of head sensitivity function from 3-D magnetic fields}, journal = {Magnetics, IEEE Transactions on}, volume = {30}, year = {1994}, month = {1994/11//}, pages = {4278 - 4280}, abstract = {A head sensitivity function is calculated using 3-D magnetic fields. The 3-D magnetic fields are calculated for recorded tracks with finite widths. The magnetization in the medium is expressed in 2-D Fourier series in the plane of the film and is assumed uniform through the thickness of the film. The reproduce head is idealized. These techniques are applied to data found in the literature for very narrow tracks ( 0.5 mu;m). A surprising amount of the experimental data can be explained by the finite width of the tracks. The fine structure of the measurements can then be isolated and attributed to the particular features of the individual heads}, keywords = {3-D, fields;finite, fields;magnetic, function;magnetization;recorded, head;very, heads;magnetisation;sensitivity;, magnetic, narrow, Sensitivity, series;magnetic, tracks;Fourier, tracks;reproduce, widths;head}, isbn = {0018-9464}, doi = {10.1109/20.334060}, author = {Burke,E.R. and Gomez,R.D. and Madabhushi,R. and Mayergoyz, Issak D} } @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 {14138, title = {On the convergence of line iterative methods for cyclically reduced non-symmetrizable linear systems}, journal = {Numerische Mathematik}, volume = {67}, year = {1994}, month = {1994///}, pages = {177 - 190}, author = {Elman, Howard and Golub, G. H and Starke, G.} } @conference {18746, title = {Design for manufacture in multi-enterprise partnerships: current status and future directions}, year = {1994}, month = {1994///}, pages = {117 - 125}, abstract = {To pursue market and technology opportunities effectively, US commercial and defense industries will be relying increasingly on multi-enterprise partnerships. Horizontal partnering combines the strengths of multiple firms in product design, manufacture, after sales support and customer service, in order to launch superior products in the global market. To support effective partnering, new approaches will be needed for integrating the activities of design, planning, and production. It is important to address both the fundamental modeling of design, process planning, and production planning in ways that account for the capabilities of potential manufacturing partners, and the development of optimization procedures to address the underlying decision problems. This paper elaborates on these issues and discusses approaches for addressing them.}, url = {http://www.csa.com/partners/viewrecord.php?requester=gs\&collection=TRD\&recid=0160471CI}, author = {Nau, Dana S. and Ball,M. O and Gupta,S.K. and Minis,I. E. and Zhang, G.} } @article {18833, title = {Feature Recognition for Manufacturability Analysis}, volume = {ISR; TR 1994-10}, year = {1994}, month = {1994///}, institution = {Institute for Systems Research, University of Maryland, College Park}, abstract = {While automated recognition of features has been attempted for a wide range of applications, no single existing approach possesses the functionality required to perform manufacturability analysis. In this paper, we present a methodology for taking a CAD model and extracting a set of machinable features suitable for generating all alternative interpretations of the model as collections of MRSEVs (Material Removal Shape Element Volumes, a STEP-based library of machining, features). This set of MRSEVs is to be employed for manufacturability analysis. The algorithm handles a variety of features including those describing holes, pockets, slots, and chamfering and filleting operations. In addition, it considers elementary accessibility constraints for these features and is provably complete over a, significant class of machinable parts the features describe. Further, the approach has low-order polynomial-time worst-case complexity.}, keywords = {algorithms, Automation, COMPUTER AIDED DESIGN, computer aided manufacturing, computer integrated manufacturing, Feature extraction, manufacturability, Manufacturing, Solid modeling, Systems Integration}, url = {http://drum.lib.umd.edu//handle/1903/5490}, author = {Regli,W. C. and Gupta, Satyandra K. and Nau, Dana S.} } @article {18944, title = {From syntactic encodings to thematic roles: Building lexical entries for interlingual MT}, journal = {Machine Translation}, volume = {9}, year = {1994}, month = {1994///}, pages = {221 - 250}, abstract = {Our goal is to construct large-scale lexicons for interlingual MT of English, Arabic, Korean, and Spanish. We describe techniques that predict salient linguistic features of a non-English word using the features of its English gloss (i.e., translation) in a bilingual dictionary. While not exact, owing to inexact glosses and language-to-language variations, these techniques can augment an existing dictionary with reasonable accuracy, thus saving significant time. We have conducted two experiments that demonstrate the value of these techniques. The first tested the feasibility of building a database of thematic grids for over 6500 Arabic verbs based on a mapping between English glosses and the syntactic codes in Longman{\textquoteright}s Dictionary of Contemporary English (LDOCE) (Procter, 1978). We show that it is more efficient and less error-prone to hand-verify the automatically constructed grids than it would be to build the thematic grids by hand from scratch. The second experiment tested the automatic classification of verbs into a richer semantic typology based on (Levin, 1993), from which we can derive a more refined set of thematic grids. In this second experiment, we show that a brute-force, non-robust technique provides 72\% accuracy for semantic classification of LDOCE verbs; we then show that it is possible to approach this yield with a more robust technique based on fine-tuned statistical correlations. We further suggest the possibility of raising this yield by taking into account linguistic factors such as polysemy and positive and negative constraints on the syntax-semantics relation. We conclude that, while human intervention will always be necessary for the construction of a semantic classification from LDOCE, such intervention is significantly minimized as more knowledge about the syntax-semantics relation is introduced.}, keywords = {humanities, Social Sciences and Law}, isbn = {0922-6567}, doi = {10.1007/BF00980579}, url = {http://www.springerlink.com/content/m793l5qj78214881/abstract/}, author = {Dorr, Bonnie J and Garman,Joseph and Weinberg, Amy} } @article {14120, title = {Inexact and Preconditioned Uzawa Algorithms for Saddle Point Problems}, journal = {SIAM Journal on Numerical Analysis}, volume = {31}, year = {1994}, month = {1994/12/01/}, pages = {1645 - 1661}, abstract = {Variants of the Uzawa algorithm for solving symmetric indefinite linear systems are developed and analyzed. Each step of this algorithm requires the solution of a symmetric positive-definite system of linear equations. It is shown that if this computation is replaced by an approximate solution produced by an arbitrary iterative method, then with relatively modest requirements on the accuracy of the approximate solution, the resulting inexact Uzawa algorithm is convergent, with a convergence rate close to that of the exact algorithm. In addition, it is shown that preconditioning can be used to improve performance. The analysis is illustrated and supplemented using several examples derived from mixed finite element discretization of the Stokes equations.}, isbn = {0036-1429}, url = {http://www.jstor.org/stable/2158371}, author = {Elman, Howard and Golub, Gene H.} } @article {18853, title = {Integrating DFM with CAD through Design Critiquing}, journal = {Concurrent EngineeringConcurrent Engineering}, volume = {2}, year = {1994}, month = {1994/06/01/}, pages = {85 - 95}, abstract = {The increasing focus on design for manufacturability (DFM) in research in concurrent engineering and engineering design is expanding the scope of traditional design activities in order to identify and eliminate manufacturing problems during the design stage. Manufacturing a product generally involves many different kinds of manufacturing activities, each having different characteristics. A design that is good for one kind of activity may not be good for another; for example, a design that is easy to assemble may not be easy to machine. One obstacle to DFM is the difficulty involved in building a single system that can handle the various manufacturing domains relevant to a design.}, keywords = {design critiquing, design for manufacturability, feature-based modeling, manufacturability analysis, multi-agent coordination.}, isbn = {1063-293X, 1531-2003}, doi = {10.1177/1063293X9400200202}, url = {http://cer.sagepub.com/content/2/2/85}, author = {Gupta, Satyandra K. and Regli,William C. and Nau, Dana S.} } @conference {16559, title = {Modeling brain adaptation to focal damage.}, booktitle = {Proceedings of the Annual Symposium on Computer Application in Medical Care}, year = {1994}, month = {1994///}, pages = {860 - 860}, author = {Goodall,S. and Reggia, James A. and Cho,S.} } @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} } @conference {18059, title = {Optimal parallel approximation for prefix sums and integer sorting}, booktitle = {Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms}, year = {1994}, month = {1994///}, pages = {241 - 250}, author = {Goodrich,M. T and Matias,Y. and Vishkin, Uzi} } @proceedings {15797, title = {Regularization by Truncated Total Least Squares}, year = {1994}, month = {1994///}, pages = {250 - 254}, publisher = {SIAM Press}, address = {Philadelphia}, author = {Fierro,Richardo and Golub, Gene H. and Hansen,Per Christian and O{\textquoteright}Leary, Dianne P.}, editor = {Lewis,J.G.} } @book {18433, title = {Software Specification: A Comparison of Formal Methods}, year = {1994}, month = {1994///}, publisher = {Intellect Books}, organization = {Intellect Books}, keywords = {Computer software, Computer software/ Specifications, Computers / General, Computers / Programming / General, Formal methods (Computer science), software engineering, specifications}, isbn = {9781567500332}, author = {Gannon,John D. and Purtilo,James and Zelkowitz, Marvin V} } @inbook {15809, title = {Some Themes in Gene H.Golub{\textquoteright}s Work on Iterative Methods}, booktitle = {Recent Advances in Iterative MethodsRecent Advances in Iterative Methods}, volume = {60}, year = {1994}, month = {1994///}, pages = {1 - 11}, publisher = {Springer-Verlag IMA Volumes in Mathematics and Its Applications}, organization = {Springer-Verlag IMA Volumes in Mathematics and Its Applications}, address = {New York}, author = {O{\textquoteright}Leary, Dianne P.}, editor = {Golub, Gene H. and Greenbaum,Anne and Luskin,Mitchell} } @article {14873, title = {A study of affine matching with bounded sensor error}, journal = {International Journal of Computer Vision}, volume = {13}, year = {1994}, month = {1994///}, pages = {7 - 32}, abstract = {Affine transformations of the plane have been used in a number of model-based recognition systems. Because the underlying mathematics are based on exact data, in practice various heuristics are used to adapt the methods to real data where there is positional uncertainty. This paper provides a precise analysis of affine point matching under uncertainty. We obtain an expression for the range of affine-invariant values that are consistent with a given set of four points, where each image point lies in an isin-disc of uncertainty. This range is shown to depend on the actualx-y-positions of the data points. In other words, given uncertainty in the data there are no representations that are invariant with respect to the Cartesian coordinate system of the data. This is problematic for methods, such as geometric hashing, that are based on affine-invariant representations. We also analyze the effect that uncertainty has on the probability that recognition methods using affine transformations will find false positive matches. We find that there is a significant probability of false positives with even moderate levels of sensor error, suggesting the importance of good verification techniques and good grouping techniques.}, doi = {10.1007/BF01420793}, author = {Grimson,W. E.L and Huttenlocher,D. P and Jacobs, David W.} } @conference {17497, title = {Visualization in the information highway}, booktitle = {Proceedings of the conference on Visualization {\textquoteright}94}, series = {VIS {\textquoteright}94}, year = {1994}, month = {1994///}, pages = {4 - 7}, publisher = {IEEE Computer Society Press}, organization = {IEEE Computer Society Press}, address = {Los Alamitos, CA, USA}, isbn = {0-7803-2521-4}, url = {http://dl.acm.org/citation.cfm?id=951087.951091}, author = {Gershon,Nahum and Card,Stuart K. and Roth,Steven F. and Shneiderman, Ben} } @conference {18066, title = {Approximate parallel prefix computation and its applications}, booktitle = {Parallel Processing Symposium, 1993., Proceedings of Seventh International}, year = {1993}, month = {1993///}, pages = {318 - 325}, author = {Goodrich,M. T and Matias,Y. and Vishkin, Uzi} } @article {18822, title = {Concurrent evaluation of machinability during product design}, journal = {Computer}, volume = {26}, year = {1993}, month = {1993/01//}, pages = {61 - 63}, abstract = {An approach to evaluating the machinability of a part during the design stage, which performs systematic generation and evaluation of machining alternatives, is discussed. The results of the analysis provide feedback to the designer about problems that might arise with the machining and information to the manufacturing engineer about which machining processes and process parameters are most desirable.<>}, keywords = {concurrent engineering, concurrent evaluation, machinability, machining, manufacturing engineer, product design}, isbn = {0018-9162}, doi = {10.1109/2.179158}, author = {Gupta,S.K. and Nau, Dana S. and Zhang, G.} } @article {18743, title = {Development of machining alternatives, based on MRSEVs}, journal = {Computers in Engineering}, year = {1993}, month = {1993///}, pages = {47 - 47}, abstract = {One missing link between CAD and CAM is the lack ofa systematic methodology for generating and evaluating al- ternative ways to manufacture a proposed design. To ad- dress this problem, we are developing a systematic approach for generating and evaluating alternative ways to manufac- ture machined parts, in order to provide information to the designer about the manufacturability of the proposed de- sign, and information to the process engineer about how best to machine the part. This paper describes our overall approach, and how MRSEVs (Material Removal Shape El- ement Volumes, a STEP library of machining features) can be used to support it. }, url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.37.6348\&rep=rep1\&type=pdf}, author = {Nau, Dana S. and Gupta,S.K. and Kramer,T. R. and Regli,W. C. and Zhang, G.} } @article {18830, title = {Estimation of Achievable Tolerances}, volume = {ISR; TR 1993-44}, year = {1993}, month = {1993///}, institution = {Institute for Systems Research, University of Maryland, College Park}, abstract = {This report presents a new and systematic approach to assist decision-making in selecting machining operation plans. We present a methodology to estimate achievable tolerances of operations plan. Given an operation plan, we use variety of empirical and mathematical models to evaluate process capabilities of various machining operations and compute achievable tolerances using tolerance charting techniques.}, keywords = {Automation, computer aided manufacturing, Manufacturing, Manufacturing Systems}, url = {http://drum.lib.umd.edu//handle/1903/5389}, author = {Gupta, Satyandra K. and Nau, Dana S. and Zhang,G. M.} } @article {18744, title = {Evaluating product machinability for concurrent engineering}, journal = {Concurrent Engineering: Contemporary Issues and Modern Design Tools}, year = {1993}, month = {1993///}, pages = {264 - 279}, url = {http://books.google.com/books?hl=en\&lr=\&id=S5rjzPSsM5EC\&oi=fnd\&pg=PA264\&dq=Satyandra+Gupta\&ots=Ldu80IZ66F\&sig=xZN6yo6NsLi2y3CZskweXchossg}, author = {Nau, Dana S. and Zhang, G. and Gupta,S.K. and Karinthi,R. R.} } @conference {18841, title = {Generation of alternative feature-based models and precedence orderings for machining applications}, series = {SMA {\textquoteright}93}, year = {1993}, month = {1993///}, pages = {465 - 466}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, isbn = {0-89791-584-4}, doi = {10.1145/164360.164520}, url = {http://doi.acm.org/10.1145/164360.164520}, author = {Gupta, Satyandra K. and Nau, Dana S.} } @article {18854, title = {Interpreting Product Designs for Manufacturability Evaluation}, volume = {ISR; TR 1993-45}, year = {1993}, month = {1993///}, institution = {Institute for Systems Research, University of Maryland, College Park}, abstract = {The ability to quickly introduce new quality products is a decisive factor in capturing market share. Because of pressing demands to reduce lead time, analyzing the manufacturability of the proposed design has become an important step in the design stage. In this paper we present an approach for evaluating the manufacturability of machined parts.

Evaluating manufacturability involves finding a way to manufacture the proposed design, and estimating the associated production cost and quality. However, there often can be several different ways to manufacture a proposed design - so to evaluate the manufacturability of the proposed design, we need to consider different ways to manufacture it, and determine which one best meets the manufacturing objectives.

In this paper we describe a methodology for systematically generating and evaluating alternative operation plans. As a first step, we identify all machining operations which can potentially be used to create the given design. Using these operations, we generate different operation plans for machining the part. Each time we generate a new operation plan, we assign it a manufacturability rating. The manufacturability rating for the design is the rating of the best operation plan.

We anticipate that by providing feedback about possible problems with the design, this work will be useful in providing a way to speed up the evaluation of new product designs in order to decide how or whether to manufacture them.}, keywords = {Automation, computer aided manufacturing, manufacturability, Manufacturing Systems}, url = {http://drum.lib.umd.edu//handle/1903/5390}, author = {Gupta, Satyandra K. and Nau, Dana S. and Zhang,G. M.} } @article {14113, title = {Performance Enhancements and Parallel Algorithms for Two Multilevel Preconditioners}, journal = {SIAM Journal on Scientific ComputingSIAM J. Sci. Comput.}, volume = {14}, year = {1993}, month = {1993///}, pages = {890 - 890}, isbn = {10648275}, doi = {10.1137/0914055}, url = {http://link.aip.org/link/SJOCE3/v14/i4/p890/s1\&Agg=doi}, author = {Elman, Howard and Guo,Xian-Zhong} } @article {15554, title = {Point probe decision trees for geometric concept classes}, journal = {Algorithms and Data Structures}, year = {1993}, month = {1993///}, pages = {95 - 106}, abstract = {A fundamental problem in model-based computer vision is that of identifying to which of a given set of concept classes of geometric models an observed model belongs. Considering a ldquoproberdquo to be an oracle that tells whether or not the observed model is present at a given point in an image, we study the problem of computing efficient strategies (ldquodecision treesrdquo) for probing an image, with the goal to minimize the number of probes necessary (in the worst case) to determine in which class the observed model belongs. We prove a hardness result and give strategies that obtain decision trees whose height is within a log factor of optimal.These results grew out of discussions that began in a series of workshops on Geometric Probing in Computer Vision, sponsored by the Center for Night Vision and Electro-Optics, Fort Belvoir, Virginia, and monitored by the U.S. Army Research Office. The views, opinions, and/or findings contained in this report are those of the authors and should not be construed as an official Department of the Army position, policy, or decision, unless so designated by other documentation. }, doi = {10.1007/3-540-57155-8_239}, author = {Arkin,E. and Goodrich,M. and Mitchell,J. and Mount, Dave and Piatko,C. and Skiena,S.} } @article {18997, title = {Species-specific signals for the splicing of a short Drosophila intron in vitro.}, journal = {Molecular and Cellular BiologyMol. Cell. Biol.}, volume = {13}, year = {1993}, month = {1993/02/01/}, pages = {1104 - 1118}, abstract = {The effects of branchpoint sequence, the pyrimidine stretch, and intron size on the splicing efficiency of the Drosophila white gene second intron were examined in nuclear extracts from Drosophila and human cells. This 74-nucleotide intron is typical of many Drosophila introns in that it lacks a significant pyrimidine stretch and is below the minimum size required for splicing in human nuclear extracts. Alteration of sequences of adjacent to the 3{\textquoteright} splice site to create a pyrimidine stretch was necessary for splicing in human, but not Drosophila, extracts. Increasing the size of this intron with insertions between the 5{\textquoteright} splice site and the branchpoint greatly reduced the efficiency of splicing of introns longer than 79 nucleotides in Drosophila extracts but had an opposite effect in human extracts, in which introns longer than 78 nucleotides were spliced with much greater efficiency. The white-apricot copia insertion is immediately adjacent to the branchpoint normally used in the splicing of this intron, and a copia long terminal repeat insertion prevents splicing in Drosophila, but not human, extracts. However, a consensus branchpoint does not restore the splicing of introns containing the copia long terminal repeat, and alteration of the wild-type branchpoint sequence alone does not eliminate splicing. These results demonstrate species specificity of splicing signals, particularly pyrimidine stretch and size requirements, and raise the possibility that variant mechanisms not found in mammals may operate in the splicing of small introns in Drosophila and possibly other species.}, isbn = {0270-7306, 1098-5549}, doi = {10.1128/MCB.13.2.1104}, url = {http://mcb.asm.org/content/13/2/1104}, author = {Guo,M. and Lo,P. C. and Mount, Stephen M.} } @article {18809, title = {A Systematic Approach for Analyzing the Manufacturability of Machined Parts}, volume = {ISR; TR 1993-76}, year = {1993}, month = {1993///}, institution = {Institute for Systems Research, University of Maryland, College Park}, abstract = {The ability to quickly introduce new quality products is a decisive factor in capturing market share. Because of pressing demands to reduce lead time, analyzing the manufacturability of the proposed design has become an important step in the design stage. This paper presents an approach for analyzing the manufacturability of machined parts.

Evaluating the manufacturability of a proposed design involves determining whether or not it is manufacturable with a given set of manufacturing operations - and if so, then finding the associated manufacturing efficiency. Since there can be several different ways to manufacture a proposed design, this requires us to consider different ways to manufacture it, in order to determine which one best meets the design and manufacturing objectives.

The first step in our approach is to identify all machining operations which can potentially be used to create the given design. Using these operations, we generate different operation plans for machining the part. Each time we generate a new operation plan, we examine whether it can produce the desired shape and tolerances, and calculate its manufacturability rating. If no operation plan can be found that is capable of producing the design, then the given design is considered unmachinable; otherwise, the manufacturability rating for the design is the rating of the best operation plan.

We anticipate that by providing feedback about possible problems with the design, this work will help in speeding up the evaluation of new product designs in order to decide how or whether to manufacture them. Such a capability will be useful in responding quickly to changing demands and opportunities in the marketplace.}, keywords = {Automation, computer aided manufacturing, Feature extraction, manufacturability, Systems Integration}, url = {http://drum.lib.umd.edu//handle/1903/5420}, author = {Gupta, Satyandra K. and Nau, Dana S.} } @conference {18779, title = {Using MRSEVs to develop machining alternatives}, year = {1993}, month = {1993///}, url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.47.4870\&rep=rep1\&type=pdf}, author = {Nau, Dana S. and Gupta,S.K. and Kramer,T. R. and Regli,W. C. and Zhang, G.} } @article {14997, title = {On the difficulty of Manhattan channel routing}, journal = {Information Processing Letters}, volume = {44}, year = {1992}, month = {1992/12/21/}, pages = {281 - 284}, abstract = {We show that channel routing in the Manhattan model remains difficult even when all nets are single-sided. Given a set of n single-sided nets, we consider the problem of determining the minimum number of tracks required to obtain a dogleg-free routing. In addition to showing that the decision version of the problem isNP-complete, we show that there are problems requiring at least d+Ω(n) tracks, where d is the density. This existential lower bound does not follow from any of the known lower bounds in the literature.}, keywords = {combinatorial problems, computational complexity, lower bounds, VLSI channel routing}, isbn = {0020-0190}, doi = {10.1016/0020-0190(92)90214-G}, url = {http://www.sciencedirect.com/science/article/pii/002001909290214G}, author = {Greenberg,Ronald and JaJa, Joseph F. and Krishnamurthy,Sridhar} } @article {18836, title = {General of Machining Alternatives for Machinability Evaluation}, volume = {ISR; TR 1992-106}, year = {1992}, month = {1992///}, institution = {Institute for Systems Research, University of Maryland, College Park}, abstract = {This paper presents a new methodology for evaluating the machinability of a machined part during the design stage of the product development cycle, so that problems related to machining can be recognized and corrected while the product is being designed. Our basic approach is to perform a systematic evaluation of machining alternatives throughout each step in the design stage. This involves three basic steps: (1) generate alternative interpretations of the design as different collections of machinable features, (2) generate the various possible sequences of machining operations capable of producing each interpretation, and (3) evaluate each operation sequence, to determine the relevant information on achievable quality and associated costs. The information provided by this analysis can be used not only to give feedback to the designer about problems that might arise with the machining, but also to provide information to the manufacturing engineer about alternative ways in which the part might be machined.}, keywords = {Automation, computer aided manufacturing, manufacturability, Manufacturing Systems}, url = {http://hdl.handle.net/1903/5287}, author = {Gupta, Satyandra K. and Nau, Dana S. and Zhang,G. M.} } @article {18840, title = {Generation and Evaluation of Alternative Operation}, volume = {ISR; TR 1992-20}, year = {1992}, month = {1992///}, institution = {Institute for Systems Research, University of Maryland, College Park}, abstract = {This paper presents a new and systematic approach to assist decision-making in selecting machining operation sequences. The approach is to produce alternative interpretations of design as different collections of machinable features, use these interpretations to generate alternative machining operation sequences, and evaluate the cost and achievable machining accuracy of each operations sequence. Given the operation sequences and their evaluations, it is then possible to calculate the performance measures of interest, and use these performance measures to select, from among the various alternatives, one or more of them that can best balance the need for a quality product against the need for efficient machining.}, keywords = {Automation, computer aided manufacturing, computer integrated manufacturing, Feature extraction, flexible manufacturing, Manufacturing, Manufacturing Systems, Solid modeling}, url = {http://drum.lib.umd.edu//handle/1903/5203}, author = {Nau, Dana S. and Zhang,G. M. and Gupta, Satyandra K.} } @article {18842, title = {Generation of Machining Alternatives for Machinability Evaluation}, volume = {ISR; TR 1992-106}, year = {1992}, month = {1992///}, institution = {Institute for Systems Research, University of Maryland, College Park}, abstract = {This paper presents a new methodology for evaluating the machinability of a machined part during the design stage of the product development cycle, so that problems related to machining can be recognized and corrected while the product is being designed. Our basic approach is to perform a systematic evaluation of machining alternatives throughout each step in the design stage. This involves three basic steps: (1) generate alternative interpretations of the design as different collections of machinable features, (2) generate the various possible sequences of machining operations capable of producing each interpretation, and (3) evaluate each operation sequence, to determine the relevant information on achievable quality and associated costs. The information provided by this analysis can be used not only to give feedback to the designer about problems that might arise with the machining, but also to provide information to the manufacturing engineer about alternative ways in which the part might be machined.}, keywords = {Automation, computer aided manufacturing, manufacturability, Manufacturing Systems}, url = {http://drum.lib.umd.edu//handle/1903/5287}, author = {Gupta, Satyandra K. and Nau, Dana S. and Zhang,G. M.} } @article {17830, title = {PARTI primitives for unstructured and block structured problems}, journal = {Computing Systems in Engineering}, volume = {3}, year = {1992}, month = {1992///}, pages = {73 - 86}, abstract = {This paper describes a set of primitives (PARTI) developed to efficiently execute unstructured and block structured problems on distributed memory parallel machines. We present experimental data from a three-dimensional unstructured Euler solver run on the Intel Touchstone Delta to demonstrate the usefulness of our methods.}, isbn = {0956-0521}, doi = {10.1016/0956-0521(92)90096-2}, url = {http://www.sciencedirect.com/science/article/pii/0956052192900962}, author = {Sussman, Alan and Saltz, J. and Das,R. and Gupta,S. and Mavriplis,D. and Ponnusamy,R. and Crowley,K.} } @article {13848, title = {Reflecting time in generated text: tense, aspect and temporal connecting words}, year = {1992}, month = {1992///}, institution = {University of Maryland at College Park}, address = {College Park, MD, USA}, author = {Dorr, Bonnie J and Gaasterland,Terry} } @article {14854, title = {A study of affine matching with bounded sensor error}, journal = {Computer Vision{\textemdash}ECCV{\textquoteright}92}, year = {1992}, month = {1992///}, pages = {291 - 306}, abstract = {Affine transformations of the plane have been used by modelbased recognition systems to approximate the effects of perspective projection. Because the underlying mathematics are based on exact data, in practice various heuristics are used to adapt the methods to real data where there is positional uncertainty. This paper provides a precise analysis of affine point matching under uncertainty. We obtain an expression for the range of affine-invariant values consistent with a given set of four points, where each data point lies in an exist-disc. This range is shown to depend on the actual x- y-positions of the data points. Thus given uncertainty in the data, the representation is no longer invariant with respect to the Cartesian coordinate system. This is problematic for methods, such as geometric hashing, that depend on the invariant properties of the representation. We also analyze the effect that uncertainty has on the probability that recognition methods using affine transformations will find false positive matches. We find that such methods will produce false positives with even moderate levels of sensor error.}, doi = {10.1007/3-540-55426-2_34}, author = {Grimson,W. and Huttenlocher,D. and Jacobs, David W.} } @conference {16781, title = {An algebra and calculus for relational multidatabase systems}, booktitle = {, First International Workshop on Interoperability in Multidatabase Systems, 1991. IMS {\textquoteright}91. Proceedings}, year = {1991}, month = {1991/04//}, pages = {118 - 124}, publisher = {IEEE}, organization = {IEEE}, abstract = {With the existence of many autonomous databases widely accessible through computer networks, users will require the capability to jointly manipulate data in different databases. A multidatabase system provides such a capability through a multidatabase manipulation language. The authors propose a theoretical foundation for such languages by presenting a multirelational algebra and calculus based on the relational algebra and calculus. The proposal is illustrated by various queries on an example multidatabase}, keywords = {Algebra, autonomous databases, Calculus, Computer networks, Computer science, Data models, Data structures, Database systems, database theory, distributed databases, Military computing, multidatabase manipulation language, multidatabase system, multirelational algebra, query languages, relational algebra, Relational databases, Spatial databases, theoretical foundation}, isbn = {0-8186-2205-9}, doi = {10.1109/IMS.1991.153694}, author = {Grant,J. and Litwin,W. and Roussopoulos, Nick and Sellis,T.} } @article {16534, title = {An experimental study of criteria for hypothesis plausibility}, journal = {Journal of Experimental \& Theoretical Artificial Intelligence}, volume = {3}, year = {1991}, month = {1991///}, pages = {129 - 144}, author = {Tuhrim,S. and Reggia, James A. and Goodall,S.} } @article {14141, title = {Iterative methods for cyclically reduced non-self-adjoint linear systems II}, journal = {Math. Comp}, volume = {56}, year = {1991}, month = {1991///}, pages = {215 - 242}, author = {Elman, Howard and Golub, G. H} } @conference {18145, title = {Towards a theory of nearly constant time parallel algorithms}, booktitle = {Foundations of Computer Science, 1991. Proceedings., 32nd Annual Symposium on}, year = {1991}, month = {1991/10//}, pages = {698 - 710}, abstract = {It is demonstrated that randomization is an extremely powerful tool for designing very fast and efficient parallel algorithms. Specifically, a running time of O(lg* n) (nearly-constant), with high probability, is achieved using n/lg* n (optimal speedup) processors for a wide range of fundamental problems. Also given is a constant time algorithm which, using n processors, approximates the sum of n positive numbers to within an error which is smaller than the sum by an order of magnitude. A variety of known and new techniques are used. New techniques, which are of independent interest, include estimation of the size of a set in constant time for several settings, and ways for deriving superfast optimal algorithms from superfast nonoptimal ones}, keywords = {computational complexity, Estimation, nearly constant time parallel algorithms, Parallel algorithms, positive numbers, randomization, running time, superfast optimal algorithms}, doi = {10.1109/SFCS.1991.185438}, author = {Gil,J. and Matias,Y. and Vishkin, Uzi} } @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 {14160, title = {Iterative methods for cyclically reduced non-self-adjoint linear systems}, journal = {Math. Comp}, volume = {54}, year = {1990}, month = {1990///}, pages = {671 - 700}, author = {Elman, Howard and Golub, G. H} } @book {14116, title = {Line iterative methods for cyclically reduced discrete convection-diffusion problems}, year = {1990}, month = {1990///}, publisher = {University of Maryland}, organization = {University of Maryland}, author = {Elman, Howard and Golub, G. H} } @conference {18307, title = {3D object recognition via simulated particles diffusion}, booktitle = {IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 1989. Proceedings CVPR {\textquoteright}89}, year = {1989}, month = {1989/06//}, pages = {442 - 449}, publisher = {IEEE}, organization = {IEEE}, abstract = {A novel approach for 3D object recognition is presented. This approach is model-based, and assumes either 3D or 21/2 D scene acquisition. Transformation detection is accomplished along with an object identification (six degrees of freedom, three rotational and three translational, are assumed). The diffusion-like simulation recently introduced as a means for characterization of shape is used in the extraction of point features. The point features represent regions on the object{\textquoteright}s surface that are extreme in curvature (i.e. concavities and convexities). Object matching is carried out by examining the correspondence between the object{\textquoteright}s set of point features and the model{\textquoteright}s set of point features, using an alignment strategy. Triangles are constructed between all possible triples of object{\textquoteright}s point features, and then are aligned to candidate corresponding triangles of the model{\textquoteright}s point features. 21/2 range images are transformed into a volumetric representation through a parallel projection onto the 3-D space. The resultant volume is suitable for processing by the diffusion-like simulation}, keywords = {3D object recognition, alignment strategy, Computational modeling, Computer science, data mining, Gold, Layout, Noise shaping, Object detection, Object recognition, parallel projection, pattern recognition, point features, radio access networks, scene acquisition, shape characterisation, Shape measurement, simulated particles diffusion, transformation detection}, isbn = {0-8186-1952-x}, doi = {10.1109/CVPR.1989.37886}, author = {Yacoob,Yaser and Gold,Y. I} } @article {16587, title = {A connectionist model for dynamic control}, journal = {Telematics and Informatics}, volume = {6}, year = {1989}, month = {1989///}, pages = {375 - 390}, author = {Whitfield,K. C and Goodall,S. M and Reggia, James A.} } @inbook {15743, title = {Domino: A Transportable System for Parallel Processing}, booktitle = {Parallel Processing and Medium-Scale Multiprocessors (Proceedings of a 1986 Conference)Parallel Processing and Medium-Scale Multiprocessors (Proceedings of a 1986 Conference)}, year = {1989}, month = {1989///}, pages = {25 - 34}, publisher = {SIAM Press}, organization = {SIAM Press}, address = {Philadelphia}, author = {O{\textquoteright}Leary, Dianne P. and Stewart, G.W. and Geijn,Robert van de}, editor = {Wouk,Arthur} } @article {11932, title = {Dynamic bin packing problem}, journal = {SIAM Journal on Computing}, volume = {12}, year = {1989}, month = {1989///}, pages = {227 - 258}, abstract = {In a previous work we have defined a general architecture model for autonomous systems, which can be mapped easily to describe the functions of any automated system (SDAG-86-01). In this note, we use the model to describe the problem of thermal management in space stations. First we briefly review the architecture, then we present the environment of our application, and finally we detail the specific function for each functional block of the architecture for that environment.}, author = {Dikshit,Piyush and Guimaraes,Katia and Ramamurthy,Maya and Agrawala, Ashok K. and Larsen,Ronald L} } @article {16016, title = {Explicitly biased generalization}, journal = {Computational Intelligence}, volume = {5}, year = {1989}, month = {1989///}, pages = {67 - 81}, author = {Gordon,D. and Perlis, Don} } @article {16648, title = {Functional and psychosocial effects of multimodality limb-sparing therapy in patients with soft tissue sarcomas}, journal = {Journal of Clinical Oncology}, volume = {7}, year = {1989}, month = {1989///}, pages = {1217 - 1217}, author = {Chang,A. E and Steinberg,S. M and Culnane,M. and Lampert,M. H and Reggia, James A. and Simpson,C. G and Hicks,J. E and White,D. E and Yang,J. J and Glatstein,E.} } @article {12344, title = {Gabriel: A design environment for DSP}, journal = {Acoustics, Speech and Signal Processing, IEEE Transactions on}, volume = {37}, year = {1989}, month = {1989///}, pages = {1751 - 1762}, author = {Lee,E. A and Ho,W. H and Goei,E. E and Bier,J. C and Bhattacharyya, Shuvra S.} } @conference {17215, title = {Hypertext and software engineering}, booktitle = {Proceedings of the second annual ACM conference on Hypertext}, series = {HYPERTEXT {\textquoteright}89}, year = {1989}, month = {1989///}, pages = {395 - 396}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {The purpose of this panel is to bring together researchers in software engineering and hypertext and help identify the major issues in the application of hypertext technology and concepts to software engineering and vice versa.}, isbn = {0-89791-339-6}, doi = {10.1145/74224.74259}, url = {http://doi.acm.org/10.1145/74224.74259}, author = {Balzer,R. and Begeman,M. and Garg,P. K. and Schwartz,M. and Shneiderman, Ben} } @article {15373, title = {A numerical analysis for the small-signal response of the MOS capacitor}, journal = {Solid-State Electronics}, volume = {32}, year = {1989}, month = {1989/03//}, pages = {207 - 213}, abstract = {Simulation results for the small-signal sinusoidal steady-state response of the MOS capacitor using time perturbation analysis of the basic semiconductor equations are presented. The effects of interface and bulk trap dynamics are included. The model uses Fermi-Dirac statistics and Shockley-Read-Hall recombination to describe the traps. This analysis is an improvement over previous techniques since it can simulate the effect of trap dynamics on the small-signal sinusoidal steady-state response of a semiconductor device with arbitrary geometry, doping and trap distributions.}, isbn = {0038-1101}, doi = {10.1016/0038-1101(89)90093-2}, url = {http://www.sciencedirect.com/science/article/pii/0038110189900932}, author = {Gaitan,Michael and Mayergoyz, Issak D} } @article {15808, title = {Some History of the Conjugate Gradient and Lanczos Algorithms: 1948{\textendash}1976}, journal = {SIAM Review}, volume = {31}, year = {1989}, month = {1989///}, pages = {50 - 102}, abstract = {This paper gives some of the history of the conjugate gradient and Lanczos algorithms and an annotated bibliography for the period 1948-1976}, keywords = {Conjugate gradient algorithm, Lanczos algorithm, variable metric algorithms}, doi = {10.1137/1031003}, url = {http://link.aip.org/link/?SIR/31/50/1}, author = {Golub, Gene H. and O{\textquoteright}Leary, Dianne P.} } @article {16640, title = {A general-purpose simulation environment for developing connectionist models}, journal = {Simulation}, volume = {51}, year = {1988}, month = {1988///}, pages = {5 - 5}, author = {D{\textquoteright}Autrechy,C. L and Reggia, James A. and Sutton,G. G and Goodall,S. M} } @article {18985, title = {Partial Revertants of the Transposable Element-Associated Suppressible Allele White-Apricot in Drosophila Melanogaster: Structures and Responsiveness to Genetic Modifiers}, journal = {GeneticsGenetics}, volume = {118}, year = {1988}, month = {1988/02//}, pages = {221 - 234}, abstract = {The eye color phenotype of white-apricot (w(a)), a mutant allele of the white locus caused by the insertion of the transposable element copia into a small intron, is suppressed by the extragenic suppressor suppressor-of-white-apricot (su(w(a))) and enhanced by the extragenic enhancers suppressor-of-forked su(f)) and Enhancer-of-white-apricot (E(w(a))). Derivatives of w(a) have been analyzed molecularly and genetically in order to correlate the structure of these derivatives with their response to modifiers. Derivatives in which the copia element is replaced precisely by a solo long terminal repeat (sLTR) were generated in vitro and returned to the germline by P-element mediated transformation; flies carrying this allele within a P transposon show a nearly wild-type phenotype and no response to either su(f) or su(w(a)). In addition, eleven partial phenotypic revertants of w(a) were analyzed. Of these, one appears to be a duplication of a large region which includes w(a), three are new alleles of su(w(a)), two are sLTR derivatives whose properties confirm results obtained using transformation, and five are secondary insertions into the copia element within w(a). One of these, w(aR84h), differs from w(a) by the insertion of the most 3{\textquoteright} 83 nucleotides of the I factor. The five insertion derivatives show a variety of phenotypes and modes of interaction with su((f) and su(w(a)). The eye pigmentation of w(aR84h) is affected by su(f) and E(w(a)), but not su(w(a)). These results demonstrate that copia (as opposed to the interruption of white sequences) is essential for the w(a) phenotype and its response to genetic modifiers, and that there are multiple mechanisms for the alteration of the w(a) phenotype by modifiers.}, isbn = {0016-6731}, url = {http://www.ncbi.nlm.nih.gov/pmc/articles/PMC1203276/}, author = {Mount, Stephen M. and Green,M. M. and Rubin,G. M.} } @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} } @inbook {17084, title = {Direct manipulation user interfaces for expert systems}, booktitle = {Expert systems: the user interfaceExpert systems: the user interface}, year = {1987}, month = {1987///}, pages = {99 - 125}, author = {Baroff,J. and Simon,R. and Gilman,F. and Shneiderman, Ben} } @conference {17829, title = {Mapping a single-assignment language onto the Warp systolic array}, booktitle = {Functional Programming Languages and Computer Architecture}, year = {1987}, month = {1987///}, pages = {347 - 363}, author = {Gross,T. and Sussman, Alan} } @conference {15587, title = {An output sensitive algorithm for computing visibility graphs}, booktitle = {Foundations of Computer Science, 1987., 28th Annual Symposium on}, year = {1987}, month = {1987/10//}, pages = {11 - 19}, abstract = {The visibility graph of a set of nonintersecting polygonal obstacles in the plane is an undirected graph whose vertices are the vertices of the obstacles and whose edges are pairs of vertices (u, v) such that the open line segment between u and v does not intersect any of the obstacles. The visibility graph is an important combinatorial structure in computational geometry and is used in applications such as solving visibility problems and computing shortest paths. An algorithm is presented that computes the visibility graph of s set of obstacles in time O(E + n log n), where E is the number of edges in the visibility graph and n is the total number of vertices in all the obstacles.}, doi = {10.1109/SFCS.1987.6}, author = {Ghosh,Subir Kumar and Mount, Dave} } @article {15409, title = {TIME PERTURBATION ANALYSIS FOR THE MOS SYSTEM}, journal = {COMPEL: The International Journal for Computation and Mathematics in Electrical and Electronic Engineering}, volume = {6}, year = {1987}, month = {1987/12/31/}, pages = {77 - 83}, abstract = {The development of a numerical implementation of the small signal response of the MOS (Metal-Oxide-Silicon) capacitor using time perturbation analysis is discussed. The effects of nonconstant doping profiles and interface and bulk traps are included. The model uses Fermi-Dirac statistics to describe the occupancy of the interface and bulk traps. The oxide region is considered to have no mobile carriers and any fixed oxide charge distribution is modeled as a charge sheet at the Si-SiO2 interface. This technique can be used to find the small signal response of the device from the static solution.}, isbn = {0332-1649}, doi = {10.1108/eb010305}, url = {http://www.emeraldinsight.com/journals.htm?issn=0332-1649\&volume=6\&issue=2\&articleid=1672728\&articletitle=TIME+PERTURBATION+ANALYSIS+FOR+THE+MOS+SYSTEM\&}, author = {Gaitan,Michael and Mayergoyz, Issak D} } @article {18446, title = {Two implementation models of abstract data types}, journal = {Computer Languages}, volume = {12}, year = {1987}, month = {1987///}, pages = {21 - 25}, abstract = {This paper compares two implementation models for abstract data types: direct and indirect implementations. Direct implementations offer relatively cheap execution and expensive compilation costs while indirect implementations result in relatively expensive implementations and cheap compilation costs. These two models are both accommodated by Ada, and a small experiment compares their costs for a particular data type.}, keywords = {abstract data type, ada, run-time implementation}, isbn = {0096-0551}, doi = {10.1016/0096-0551(87)90009-9}, url = {http://www.sciencedirect.com/science/article/pii/0096055187900099}, author = {Gannon,John D. and Zelkowitz, Marvin V} } @article {18420, title = {Research in Programming Languages and Software Engineering.}, year = {1985}, month = {1985/12/24/}, institution = {Department of Computer Science, University of Maryland, College Park}, abstract = {During the past year three research papers were written and two published conference presentations were given. Titles of the published research articles are: A Stochastic Analysis of a Modified Gain Extended Kalman Filter with Applications to Estimation with Bearings only Measurements; The Modified Gain Extended Kalman Kilter and Parameter Identification in Linear Systems and Maximum Information Guidance for Homing Missiles.}, keywords = {*BEARINGS, *COMPUTER PROGRAMS, *ESTIMATES, *GUIDANCE, *KALMAN FILTERING, *LINEAR SYSTEMS, *STOCHASTIC PROCESSES, COMPUTER PROGRAMMING AND SOFTWARE, GAIN, identification, measurement, programming languages, STATISTICS AND PROBABILITY, SYSTEMS ENGINEERING., TARGET DIRECTION, RANGE AND POSITION FINDING}, url = {http://stinet.dtic.mil/oai/oai?\&verb=getRecord\&metadataPrefix=html\&identifier=ADA186269}, author = {Gannon,John and Basili, Victor R. and Zelkowitz, Marvin V and Yeh,Raymond} } @article {18405, title = {Monitoring an Ada software development}, journal = {ACM SIG Ada Letters}, volume = {IV}, year = {1984}, month = {1984/07//}, pages = {32 - 39}, isbn = {1094-3641}, doi = {10.1145/998401.998402}, url = {http://doi.acm.org/10.1145/998401.998402}, author = {Basili, Victor R. and Chang,Shih and Gannon,John and Katz,Elizabeth and Panlilio-Yap,N. Monina and Ramsey,Connie Loggia and Zelkowitz, Marvin V and Bailey,John and Kruesi,Elizabeth and Sheppard,Sylvia} } @article {18429, title = {Software Engineering Practices in the US and Japan}, journal = {Computer}, volume = {17}, year = {1984}, month = {1984/06//}, pages = {57 - 66}, isbn = {0018-9162}, doi = {10.1109/MC.1984.1659162}, author = {Zelkowitz, Marvin V and Yeh,R. T and Hamlet,R.G. and Gannon,J. D and Basili, Victor R.} } @article {18130, title = {Solving NP-hard problems on graphs that are almost trees and an application to facility location problems}, journal = {Journal of the ACM (JACM)}, volume = {31}, year = {1984}, month = {1984///}, pages = {459 - 473}, author = {Gurevich,Y. and Stockmeyer,L. and Vishkin, Uzi} } @article {17141, title = {Evaluating multiple coordinated windows for programming workstations}, journal = {NASA. Goddard Space Flight Center Proc. of the Eighth Ann. Software Eng. Workshop 11 p(SEE N 84-23137 13-61)}, year = {1983}, month = {1983///}, abstract = {Programmers might benefit from larger screens with multiple windows or multiple screens, especially if convenient coordination among screens are arranged. Uses for multiple coordinated displays in a programmers workstation are explored. Initial efforts focus on the potential applications, a command language for coordinating the displays, and the psychological basis for effective utilization so as to avoid information overload. Subsequent efforts will be devoted to implementing the concepts and performing controlled psychologically oriented experiments to validate the hypotheses.}, author = {Shneiderman, Ben and GRANTHAM,C. and Norman,K. and ROGERS,J. and Roussopoulos, Nick} } @article {18996, title = {Small Ribonucleoproteins from Eukaryotes: Structures and Roles in RNA Biogenesis}, journal = {Cold Spring Harbor Symposia on Quantitative BiologyCold Spring Harb Symp Quant Biol}, volume = {47}, year = {1983}, month = {1983/01/01/}, pages = {893 - 900}, abstract = {Detailed reviews describing work presented at the annual Cold Spring Harbor Symposia on Quantitative Biology}, isbn = {0091-7451, 1943-4456}, doi = {10.1101/SQB.1983.047.01.103}, url = {http://symposium.cshlp.org/content/47/893}, author = {Steitz,J. A. and Wolin,S. L. and Rinke,J. and Pettersson,I. and Mount, Stephen M. and Lerner,E. A. and Hinterberger,M. and Gottlieb,E.} } @article {18444, title = {The Software Industry: A State of the Art Survey}, journal = {Foundations of Empirical Software Engineering: The Legacy of Victor R. Basili}, volume = {1}, year = {1983}, month = {1983///}, pages = {383 - 383}, author = {Zelkowitz, Marvin V and Yeh,R. and Hamlet,R.G. and Gannon,J. D and Basili, Victor R.} } @conference {15633, title = {Isomorphism of graphs with bounded eigenvalue multiplicity}, booktitle = {Proceedings of the fourteenth annual ACM symposium on Theory of computing}, series = {STOC {\textquoteright}82}, year = {1982}, month = {1982///}, pages = {310 - 324}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {We investigate the connection between the spectrum of a graph, i.e. the eigenvalues of the adjacency matrix, and the complexity of testing isomorphism. In particular we describe two polynomial time algorithms which test isomorphism of undirected graphs whose eigenvalues have bounded multiplicity. If X and Y are graphs of eigenvalue multiplicity m, then the isomorphism of X and Y can be tested by an O(n4m+c) deterministic and by an O(n2m+c) Las Vegas algorithm, where n is the number of vertices of X and Y.}, isbn = {0-89791-070-2}, doi = {10.1145/800070.802206}, url = {http://doi.acm.org/10.1145/800070.802206}, author = {Babai,L{\'a}szl{\'o} and Grigoryev,D. Yu. and Mount, Dave} } @article {19002, title = {Structure and function of small ribonucleoproteins from eukaryotic cells}, journal = {Princess Takamatsu symposiaInt. Symp. Princess Takamatsu Cancer Res. Fund}, volume = {12}, year = {1982}, month = {1982///}, pages = {101 - 107}, abstract = {Autoantibodies from patients with systemic lupus erythematosus and other related diseases have been used to identify and study small RNA-protein complexes from mammalian cells. Properties of three previously described and several new classes of small ribonucleoproteins (RNPs) are reviewed. The sequence of Drosophila U1 RNA reveals that the region proposed to pair with 5{\textquoteright} splice junctions is conserved, while that proposed to interact with 3{\textquoteright} junctions diverges; this forces some revision of the model for U1 small nuclear (sn)RNP participation in hnRNA splicing. Further characterization of the Ro and La small RNPs has shown that the Ro small cytoplasmic (sc)RNPs are a subclass of La RNPs. Both tRNA and 5S rRNA precursors are at least transiently associated with the La protein. This raises the possibility that the La protein may be an RNA polymerase III transcription factor.}, keywords = {Antigen-Antibody Complex, Autoantibodies, HUMANS, Lupus Erythematosus, Systemic, Nucleoproteins, Ribonucleoproteins, RNA Polymerase III, Transcription, Genetic}, url = {http://www.ncbi.nlm.nih.gov/pubmed/7166547}, author = {Steitz,J. A. and Berg,C and Gottlieb,E. and Hardin,J A and Hashimoto,C and Hendrick,J P and Hinterberger,M. and Krikeles,M and Lerner,M R and Mount, Stephen M.} } @book {18413, title = {Principles of software engineering and design}, year = {1979}, month = {1979///}, publisher = {Prentice Hall Professional Technical Reference}, organization = {Prentice Hall Professional Technical Reference}, isbn = {013710202X}, author = {Zelkowitz, Marvin V and Shaw,A. C and Gannon,J. D} } @article {15775, title = {Numerical Solution of Nonlinear Elliptic Partial Differential Equations by a Generalized Conjugate Gradient Method}, journal = {Computing}, volume = {19}, year = {1978}, month = {1978///}, pages = {321 - 339}, abstract = {We have studied previously a generalized conjugate gradient method for solving sparse positive-definite systems of linear equations arising from the discretization of elliptic partial-differential boundary-value problems. Here, extensions to the nonlinear case are considered. We split the original discretized operator into the sum of two operators, one of which corresponds to a more easily solvable system of equations, and accelerate the associated iteration based on this splitting by (nonlinear) conjugate gradients. The behavior of the method is illustrated for the minimal surface equation with splittings corresponding to nonlinear SSOR, to approximate factorization of the Jacobian matrix, and to elliptic operators suitable for use with fast direct methods. The results of numerical experiments are given as well for a mildy nonlinear example, for which, in the corresponding linear case, the finite termination property of the conjugate gradient algorithm is crucial.}, author = {Concus,Paul and Golub, Gene H. and O{\textquoteright}Leary, Dianne P.} } @inbook {15701, title = {A Generalized Conjugate Gradient Method for the Numerical Solution of Elliptic Partial Differential Equations}, booktitle = {Sparse Matrix ComputationsSparse Matrix Computations}, year = {1976}, month = {1976///}, pages = {309 - 332}, publisher = {Academic Press}, organization = {Academic Press}, address = {New York}, abstract = {We consider a generalized conjugate gradient method for solvingsparse, symmetric, positive-definite systems of linear equations, principally those arising from the discretization of boundary value problems for elliptic partial differential equations. The method is based on splitting off from the original coefficient matrix a symmetric, positive-definiteonethat corresponds to a more easily solvable system of equations, and then accelerating the associated iteration using conjugate gradients. Optimality and convergence properties are presented, and the relation to other methods is discussed. Several splittings for which the method seems particularly effective are also discussed, and for some, numerical examples are given }, author = {Concus,Paul and Golub, Gene H. and O{\textquoteright}Leary, Dianne P.}, editor = {Bunch,James R. and Rose,Donald J.} }