%0 Journal Article %J ics.uci.edu %D Submitted %T Combining preference and absolute judgements in a crowd-sourced setting %A Ye, P %A EDU, UMD %A David Doermann %X Abstract This paper addresses the problem of obtaining gold-standard labels of objects based on subjective judgements provided by humans. Assuming each object can be associated with an underlying score, the objective of this work is to predict the underlying ... %B ics.uci.edu %G eng %U https://www.ics.uci.edu/~qliu1/MLcrowd_ICML_workshop/Papers/ActivePaper5.pdf %0 Journal Article %J mimno.infosci.cornell.edu %D Submitted %T Topic Models for Translation Domain Adaptation %A Hu, Y %A Zhai, K %A Edelman, V %A Jordan Boyd-Graber %X Abstract Topic models have been successfully applied in domain adaptation for translation models. However, previous works applied topic models only on source side and ignored the relations between source and target languages in machine translation. This paper ... %B mimno.infosci.cornell.edu %G eng %U http://mimno.infosci.cornell.edu/nips2013ws/nips2013tm_submission_19.pdf %0 Journal Article %J Biological Reviews %D 2018 %T Spores and soil from six sides: interdisciplinarity and the environmental biology of anthrax (Bacillus anthracis) %A Carlson, Colin J. %A Getz, Wayne M. %A Kausrud, Kyrre L. %A Cizauskas, Carrie A. %A Blackburn, Jason K. %A Bustos Carrillo, Fausto A. %A Rita R Colwell %A Easterday, W. Ryan %A Ganz, Holly H. %A Kamath, Pauline L. %A Økstad, Ole A. %A Turner, Wendy C. %A Kolsto, Anne-Brit %A Stenseth, Nils C. %X 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' immune and behavioural responses to anthrax risk, interact to produce regular ‘anthrax seasons’ 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. %B Biological Reviews %P 1813 - 1831 %8 Jan-11-2018 %G eng %U https://onlinelibrary.wiley.com/doi/full/10.1111/brv.12420 %N 4 %! Biol Rev %R 10.1111/brv.12420 %0 Journal Article %J Genome Announcements %D 2018 %T Virulence-Related Genes Identified from the Genome Sequence of the Non-O1/Non-O139 Vibrio cholerae Strain VcN1, Isolated from Dhaka, Bangladesh %A Hossain, Maqsud %A Alam, Munirul %A Khaleque, Abdul %A Islam, Sohidul %A Sadique, Abdus %A Khan, Nayeim %A Halim, Zahra %A Sarker, Mrinmoy %A El-Sayed, Najib M. %A Huq, Anwar %A Ahsan, Gias Uddin %A Rita R Colwell %X We report here the first draft genome sequence of the non-O1/non-O139 Vibrio cholerae strain VcN1, isolated from Dhaka, Bangladesh. The data submitted to GenBank for this strain will contribute to advancing our understanding of this environmentally disseminated bacterium, including its virulence and its evolution as an important pathogen. %B Genome Announcements %8 Aug-03-2018 %G eng %U https://mra.asm.org/content/6/10/e01513-17 %N 10 %! Genome Announc %R 10.1128/genomeA.01513-17 %0 Journal Article %J Proceedings of the National Academy of Sciences %D 2016 %T Climate influence on Vibrio and associated human diseases during the past half-century in the coastal North Atlantic %A Vezzulli, Luigi %A Grande, Chiara %A Reid, Philip C. %A élaouët, Pierre %A Edwards, Martin %A öfle, Manfred G. %A Brettar, Ingrid %A Rita R Colwell %A Pruzzo, Carla %X 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–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 °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. %B Proceedings of the National Academy of Sciences %P E5062 - E5071 %8 Nov-08-2017 %G eng %U http://www.pnas.org/lookup/doi/10.1073/pnas.1609157113 %! Proc Natl Acad Sci USA %R 10.1073/pnas.1609157113 %0 Journal Article %J Proceedings of the National Academy of Sciences %D 2016 %T Cross-talk among flesh-eating Aeromonas hydrophila strains in mixed infection leading to necrotizing fasciitis %A Ponnusamy, Duraisamy %A Kozlova, Elena V. %A Sha, Jian %A Erova, Tatiana E. %A Azar, Sasha R. %A Fitts, Eric C. %A Kirtley, Michelle L. %A Tiner, Bethany L. %A Andersson, Jourdan A. %A Grim, Christopher J. %A Isom, Richard P. %A Hasan, Nur A. %A Rita R Colwell %A Chopra, Ashok K. %X 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–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. %B Proceedings of the National Academy of Sciences %V 11312161268 %P 722 - 727 %8 Jul-01-2017 %G eng %U http://www.pnas.org/lookup/doi/10.1073/pnas.1523817113 %N 3321029 %! Proc Natl Acad Sci USA %R 10.1073/pnas.1523817113 %0 Journal Article %J mBio %D 2016 %T Phylogenetic Diversity of Vibrio cholerae Associated with Endemic Cholera in Mexico from 1991 to 2008 %A Choi, Seon Y %A Rashed, Shah M. %A Hasan, Nur A. %A Alam, Munirul %A Islam, Tarequl %A Sadique, Abdus %A Johura, Fatema-Tuz %A Eppinger, Mark %A Ravel, Jacques %A Huq, Anwar %A Cravioto, Alejandro %A Rita R Colwell %X An outbreak of cholera occurred in 1991 in Mexico, where it had not been reported for more than a century and is now endemic. Vibrio cholerae O1 prototype El Tor and classical strains coexist with altered El Tor strains (1991 to 1997). Nontoxigenic (CTX−) V. cholerae El Tor dominated toxigenic (CTX+) strains (2001 to 2003), but V. cholerae CTX+ variant El Tor was isolated during 2004 to 2008, outcompeting CTX− V. cholerae. Genomes of six Mexican V. cholerae O1 strains isolated during 1991 to 2008 were sequenced and compared with both contemporary and archived strains of V. cholerae. Three were CTX+ El Tor, two were CTX− El Tor, and the remaining strain was a CTX+ classical isolate. Whole-genome sequence analysis showed the six isolates belonged to five distinct phylogenetic clades. One CTX− isolate is ancestral to the 6th and 7th pandemic CTX+ V. cholerae isolates. The other CTX− isolate joined with CTX− non-O1/O139 isolates from Haiti and seroconverted O1 isolates from Brazil and Amazonia. One CTX+ isolate was phylogenetically placed with the sixth pandemic classical clade and the V. cholerae O395 classical reference strain. Two CTX+ El Tor isolates possessing intact Vibrio seventh pandemic island II (VSP-II) are related to hybrid El Tor isolates from Mozambique and Bangladesh. The third CTX+ El Tor isolate contained West African-South American (WASA) recombination in VSP-II and showed relatedness to isolates from Peru and Brazil. Except for one isolate, all Mexican isolates lack SXT/R391 integrative conjugative elements (ICEs) and sensitivity to selected antibiotics, with one isolate resistant to streptomycin. No isolates were related to contemporary isolates from Asia, Africa, or Haiti, indicating phylogenetic diversity. %B mBio %V 7 %8 Apr-05-2016 %G eng %U http://mbio.asm.org/lookup/doi/10.1128/mBio.02160-15 %N 2 %! mBio %R 10.1128/mBio.02160-15 %0 Journal Article %J Proceedings of the National Academy of Sciences %D 2015 %T Deep-sea hydrothermal vent bacteria related to human pathogenic Vibrio species %A Hasan, Nur A. %A Grim, Christopher J. %A Lipp, Erin K. %A Rivera, Irma N. G. %A Chun, Jongsik %A Haley, Bradd J. %A Taviani, Elisa %A Choi, Seon Young %A Hoq, Mozammel %A Munk, A. Christine %A Brettin, Thomas S. %A Bruce, David %A Challacombe, Jean F. %A Detter, J. Chris %A Han, Cliff S. %A Eisen, Jonathan A. %A Huq, Anwar %A Rita R Colwell %X 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. %B Proceedings of the National Academy of Sciences %P E2813 - E2819 %8 Feb-05-2017 %G eng %U http://www.pnas.org/lookup/doi/10.1073/pnas.1503928112 %N 2144666966517 %! Proc Natl Acad Sci USA %R 10.1073/pnas.1503928112 %0 Journal Article %J Applied and Environmental Microbiology %D 2015 %T Non-O1/Non-O139 Vibrio cholerae Carrying Multiple Virulence Factors and V. cholerae O1 in the Chesapeake Bay, Maryland %A Ceccarelli, Daniela %A Chen, Arlene %A Hasan, Nur A. %A Rashed, Shah M. %A Huq, Anwar %A Rita R Colwell %E Elkins, C. A. %X Non-O1/non-O139 Vibrio cholerae inhabits estuarine and coastal waters globally, but its clinical significance has not been sufficiently investigated, despite the fact that it has been associated with septicemia and gastroenteritis. The emergence of virulent non-O1/non-O139 V. cholerae is consistent with the recognition of new pathogenic variants worldwide. Oyster, sediment, and water samples were collected during a vibrio surveillance program carried out from 2009 to 2012 in the Chesapeake Bay, Maryland. V. cholerae O1 was detected by a direct fluorescent-antibody (DFA) assay but was not successfully cultured, whereas 395 isolates of non-O1/non-O139 V. cholerae were confirmed by multiplex PCR and serology. Only a few of the non-O1/non-O139 V. cholerae isolates were resistant to ampicillin and/or penicillin. Most of the isolates were sensitive to all antibiotics tested, and 77 to 90% carried the El Tor variant hemolysin gene hlyA ET, the actin cross-linking repeats in toxin gene rtxA, the hemagglutinin protease gene hap, and the type 6 secretion system. About 19 to 21% of the isolates carried the neuraminidase-encoding gene nanH and/or the heat-stable toxin (NAG-ST), and only 5% contained a type 3 secretion system. None of the non-O1/non-O139 V. cholerae isolates contained Vibrio pathogenicity island-associated genes. However, ctxA, ace, or zot was present in nine isolates. Fifty-five different genotypes showed up to 12 virulence factors, independent of the source of isolation, and represent the first report of both antibiotic susceptibility and virulence associated with non-O1/non-O139 V. cholerae from the Chesapeake Bay. Since these results confirm the presence of potentially pathogenic non-O1/non-O139 V. cholerae, monitoring for total V. cholerae, regardless of serotype, should be done within the context of public health. %B Applied and Environmental Microbiology %P 1909 - 1918 %8 Mar-03-2016 %G eng %U http://aem.asm.org/lookup/doi/10.1128/AEM.03540-14 %N 631 %! Appl. Environ. Microbiol. %R 10.1128/AEM.03540-14 %0 Journal Article %J Frontiers in Public Health %D 2015 %T Occurrence and Diversity of Clinically Important Vibrio Species in the Aquatic Environment of Georgia %A Kokashvili, Tamar %A Whitehouse, Chris A. %A Tskhvediani, Ana %A Grim, Christopher J. %A Elbakidze, Tinatin %A Mitaishvili, Nino %A Janelidze, Nino %A Jaiani, Ekaterine %A Haley, Bradd J. %A Lashkhi, Nino %A Huq, Anwar %A Rita R Colwell %A Tediashvili, Marina %B Frontiers in Public Health %8 10/2015 %G eng %U http://journal.frontiersin.org/Article/10.3389/fpubh.2015.00232/ %! Front. Public Health %R 10.3389/fpubh.2015.00232 %0 Journal Article %J Applied and Environmental Microbiology %D 2015 %T Rapid Proliferation of Vibrio parahaemolyticus, Vibrio vulnificus, and Vibrio cholerae during Freshwater Flash Floods in French Mediterranean Coastal Lagoons %A Esteves, Kevin %A Hervio-Heath, Dominique %A Mosser, Thomas %A Rodier, Claire %A Tournoud, Marie-George %A Jumas-Bilak, Estelle %A Rita R Colwell %A Monfort, Patrick %E Wommack, K. E. %X Vibrio parahaemolyticus, Vibrio vulnificus, and Vibrio cholerae of the non-O1/non-O139 serotype are present in coastal lagoons of southern France. In these Mediterranean regions, the rivers have long low-flow periods followed by short-duration or flash floods during and after heavy intense rainstorms, particularly at the end of the summer and in autumn. These floods bring large volumes of freshwater into the lagoons, reducing their salinity. Water temperatures recorded during sampling (15 to 24°C) were favorable for the presence and multiplication of vibrios. In autumn 2011, before heavy rainfalls and flash floods, salinities ranged from 31.4 to 36.1‰ and concentrations of V. parahaemolyticus, V. vulnificus, and V. cholerae varied from 0 to 1.5 × 103 most probable number (MPN)/liter, 0.7 to 2.1 × 103 MPN/liter, and 0 to 93 MPN/liter, respectively. Following heavy rainstorms that generated severe flash flooding and heavy discharge of freshwater, salinity decreased, reaching 2.2 to 16.4‰ within 15 days, depending on the site, with a concomitant increase in Vibrio concentration to ca. 104 MPN/liter. The highest concentrations were reached with salinities between 10 and 20‰ for V. parahaemolyticus, 10 and 15‰ for V. vulnificus, and 5 and 12‰ for V. cholerae. Thus, an abrupt decrease in salinity caused by heavy rainfall and major flooding favored growth of human-pathogenic Vibrio spp. and their proliferation in the Languedocian lagoons. Based on these results, it is recommended that temperature and salinity monitoring be done to predict the presence of these Vibrio spp. in shellfish-harvesting areas of the lagoons. %B Applied and Environmental Microbiology %P 7600 - 7609 %8 Jan-11-2015 %G eng %U http://aem.asm.org/lookup/doi/10.1128/AEM.01848-15 %N 21 %! Appl. Environ. Microbiol. %R 10.1128/AEM.01848-15 %0 Journal Article %J Frontiers in Microbiology %D 2014 %T Molecular diversity and predictability of Vibrio parahaemolyticus along the Georgian coastal zone of the Black Sea %A Haley, Bradd J. %A Kokashvili, Tamar %A Tskshvediani, Ana %A Janelidze, Nino %A Mitaishvili, Nino %A Grim, Christopher J. %A Constantin_de_Magny, Guillaume %A Chen, Arlene J. %A Taviani, Elisa %A Eliashvili, Tamar %A Tediashvili, Marina %A Whitehouse, Chris A. %A Rita R Colwell %A Huq, Anwar %X 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. %B Frontiers in Microbiology %V 5 %8 Jan-01-2014 %G eng %U http://journal.frontiersin.org/article/10.3389/fmicb.2014.00045 %! Front. Microbiol. %R 10.3389/fmicb.2014.00045 %0 Journal Article %J CBE—Life Sciences Education %D 2013 %T Engaging Actively with Issues in the Responsible Conduct of Science: Lessons from International Efforts Are Relevant for Undergraduate Education in the United States %A Clements, John D. %A Connell, Nancy D. %A Dirks, Clarissa %A El-Faham, Mohamed %A Hay, Alastair %A Heitman, Elizabeth %A Stith, James H. %A Bond, Enriqueta C. %A Rita R Colwell %A Anestidou, Lida %A Husbands, Jo L. %A Labov, Jay B. %X Numerous studies are demonstrating that engaging undergraduate students in original research can improve their achievement in the science, technology, engineering, and mathematics (STEM) fields and increase the likelihood that some of them will decide to pursue careers in these disciplines. Associated with this increased prominence of research in the undergraduate curriculum are greater expectations from funders, colleges, and universities that faculty mentors will help those students, along with their graduate students and postdoctoral fellows, develop an understanding and sense of personal and collective obligation for responsible conduct of science (RCS). This Feature describes an ongoing National Research Council (NRC) project and a recent report about educating faculty members in culturally diverse settings (Middle East/North Africa and Asia) to employ active-learning strategies to engage their students and colleagues deeply in issues related to RCS. The NRC report describes the first phase of this project, which took place in Aqaba and Amman, Jordan, in September 2012 and April 2013, respectively. Here we highlight the findings from that report and our subsequent experience with a similar interactive institute in Kuala Lumpur, Malaysia. Our work provides insights and perspectives for faculty members in the United States as they engage undergraduate and graduate students, as well as postdoctoral fellows, to help them better understand the intricacies of and connections among various components of RCS. Further, our experiences can provide insights for those who may wish to establish “train-the-trainer” programs at their home institutions. %B CBE—Life Sciences Education %P 596 - 603 %8 Jan-12-2013 %G eng %U https://www.lifescied.org/doi/10.1187/cbe.13-09-0184 %N 4 %! LSE %R 10.1187/cbe.13-09-0184 %0 Journal Article %J SPIE Newsroom %D 2013 %T Understanding the impact of image quality on segmentation accuracy %A Li-Baboud, Ya-Shian %A Cardone, Antonio %A Chalfoun, Joe %A Bajcsy, Peter %A Elliott, John %B SPIE Newsroom %8 2013 %G eng %0 Journal Article %J The ISME Journal %D 2012 %T An additional step in the transmission of Yersinia pestis? %A Easterday, W Ryan %A Kausrud, Kyrre L %A Star, Bastiaan %A Heier, Lise %A Haley, Bradd J %A Ageyev, Vladimir %A Rita R Colwell %A Stenseth, Nils Chr %X Plague, caused by the bacterium Yersinia pestis, is a mammalian vector-borne disease, transmitted by fleas that serve as the vector between rodent hosts. For many pathogens, including Y. pestis, there are strong evolutionary pressures that lead to a reduction in ‘useless genes’, with only those retained that reflect function in the specific environment inhabited by the pathogen. Genetic traits critical for survival and transmission between two environments, the rodent and the flea, are conserved in epizootic/epidemic plague strains. However, there are genes that remain conserved for which no function in the flea–rodent cycle has yet been observed, indicating an additional environment may exist in the transmission cycle of plague. Here, we present evidence for highly conserved genes that suggests a role in the persistence of Y. pestis after death of its host. Furthermore, maintenance of these genes points to Y. pestis traversing a post-mortem path between, and possibly within, epizootic periods and offering insight into mechanisms that may allow Y. pestis an alternative route of transmission in the natural environment. %B The ISME Journal %P 231 - 236 %8 Jan-02-2012 %G eng %U http://www.nature.com/articles/ismej2011105 %N 2 %! ISME J %R 10.1038/ismej.2011.105 %0 Conference Paper %B LEET'12 Proceedings of the 5th USENIX conference on Large-Scale Exploits and Emergent Threats %D 2012 %T Ask WINE: Are We Safer Today? Evaluating Operating System Security Through Big Data Analysis %A Tudor Dumitras %A Efstathopoulos, Petros %X The Internet can be a dangerous place: 800,000 new malware variants are detected each day, and this number is growing at an exponential rate--driven by the quest for economic gains. However, over the past ten years operating-system vendors have introduced a number of security technologies that aim to make exploits harder and to reduce the attack surface of the platform. Faced with these two conflicting trends, it is difficult for end-users to determine what techniques make them safer from Internet attacks. In this position paper, we argue that to answer this question conclusively we must analyze field data collected on real hosts that are targeted by attacks--e.g., the approximately 50 million records of anti-virus telemetry available through Symantec's WINE platform. Such studies can characterize the factors that drive the production of malware, can help us understand the impact of security technologies in the real world and can suggest new security metrics, derived from field observations rather than small lab experiments, indicating how susceptible to attacks a computing platform may be. %B LEET'12 Proceedings of the 5th USENIX conference on Large-Scale Exploits and Emergent Threats %S LEET'12 %I USENIX Association %P 11 - 11 %8 2012/04/24/ %G eng %U http://dl.acm.org/citation.cfm?id=2228340.2228356 %0 Journal Article %J Proceedings of the National Academy of Sciences %D 2012 %T Genomic diversity of 2010 Haitian cholera outbreak strains %A Hasan, N. A. %A Choi, S. Y. %A Eppinger, M. %A Clark, P. W. %A Chen, A. %A Alam, M. %A Haley, B. J. %A Taviani, E. %A Hine, E. %A Su, Q. %A Tallon, L. J. %A Prosper, J. B. %A Furth, K. %A Hoq, M. M. %A Li, H. %A Fraser-Liggett, C. M. %A Cravioto, A. %A Huq, A. %A Ravel, J. %A Cebula, T. A. %A Rita R Colwell %B Proceedings of the National Academy of Sciences %P E2010 - E2017 %8 05/2012 %G eng %U http://www.pnas.org/cgi/doi/10.1073/pnas.1207359109 %! Proceedings of the National Academy of Sciences %R 10.1073/pnas.1207359109 %0 Journal Article %J arXiv:1207.1813 [cs] %D 2012 %T Introspective Pushdown Analysis of Higher-Order Programs %A Earl, Christopher %A Sergey, Ilya %A Might, Matthew %A David Van Horn %K Computer Science - Programming Languages %K D.3.4 %K F.3.2 %X In the static analysis of functional programs, pushdown flow analysis and abstract garbage collection skirt just inside the boundaries of soundness and decidability. Alone, each method reduces analysis times and boosts precision by orders of magnitude. This work illuminates and conquers the theoretical challenges that stand in the way of combining the power of these techniques. The challenge in marrying these techniques is not subtle: computing the reachable control states of a pushdown system relies on limiting access during transition to the top of the stack; abstract garbage collection, on the other hand, needs full access to the entire stack to compute a root set, just as concrete collection does. \emph{Introspective} pushdown systems resolve this conflict. Introspective pushdown systems provide enough access to the stack to allow abstract garbage collection, but they remain restricted enough to compute control-state reachability, thereby enabling the sound and precise product of pushdown analysis and abstract garbage collection. Experiments reveal synergistic interplay between the techniques, and the fusion demonstrates "better-than-both-worlds" precision. %B arXiv:1207.1813 [cs] %8 2012/07/07/ %G eng %U http://arxiv.org/abs/1207.1813 %0 Journal Article %J Environmental Microbiology Reports %D 2012 %T Vibrio cholerae in a historically cholera-free country %A Haley, Bradd J. %A Chen, Arlene %A Grim, Christopher J. %A Clark, Philip %A Diaz, Celia M %A Taviani, Elisa %A Hasan, Nur A. %A Sancomb, Elizabeth %A Elnemr, Wessam M %A Islam, Muhammad A. %A Huq, Anwar %A Rita R Colwell %A Benediktsdóttir, Eva %X 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. %B Environmental Microbiology Reports %P 381 - 389 %8 Jan-08-2012 %G eng %U http://doi.wiley.com/10.1111/j.1758-2229.2012.00332.x %N 4 %R 10.1111/j.1758-2229.2012.00332.x %0 Conference Paper %B Proceedings of the 2nd ACM SIGHIT International Health Informatics Symposium %D 2012 %T Optimizing epidemic protection for socially essential workers %A Barrett,Chris %A Beckman,Richard %A Bisset,Keith %A Chen,Jiangzhuo %A DuBois,Thomas %A Eubank,Stephen %A Kumar,V. S. Anil %A Lewis,Bryan %A Marathe,Madhav V. %A Srinivasan, Aravind %A Stretz,Paula E. %K epidemiology %K OPTIMIZATION %K public health informatics %X Public-health policy makers have many tools to mitigate an epidemic's effects. Most related research focuses on the direct effects on those infected (in terms of health, life, or productivity). Interventions including treatment, prophylaxis, quarantine, and social distancing are well studied in this context. These interventions do not address indirect effects due to the loss of critical services and infrastructures when too many of those responsible for their day-to-day operations fall ill. We examine, both analytically and through simulation, the protection of such essential subpopulations by sequestering them, effectively isolating them into groups during an epidemic. We develop a framework for studying the benefits of sequestering and heuristics for when to sequester. We also prove a key property of sequestering placement which helps partition the subpopulations optimally. Thus we provide a first step toward determining how to allocate resources between the direct protection of a population, and protection of those responsible for critical services. %B Proceedings of the 2nd ACM SIGHIT International Health Informatics Symposium %S IHI '12 %I ACM %C New York, NY, USA %P 31 - 40 %8 2012/// %@ 978-1-4503-0781-9 %G eng %U http://doi.acm.org/10.1145/2110363.2110371 %R 10.1145/2110363.2110371 %0 Conference Paper %B Dependable Computing Conference (EDCC), 2012 Ninth European %D 2012 %T The Provenance of WINE %A Tudor Dumitras %A Efstathopoulos, P. %K Benchmark testing %K CYBER SECURITY %K cyber security experiments %K data attacks %K data collection %K dependability benchmarking %K distributed databases %K distributed sensors %K experimental research %K field data %K information quality %K MALWARE %K Pipelines %K provenance %K provenance information %K raw data sharing %K research groups %K security of data %K self-documenting experimental process %K sensor fusion %K software %K variable standards %K WINE %K WINE benchmark %X The results of cyber security experiments are often impossible to reproduce, owing to the lack of adequate descriptions of the data collection and experimental processes. Such provenance information is difficult to record consistently when collecting data from distributed sensors and when sharing raw data among research groups with variable standards for documenting the steps that produce the final experimental result. In the WINE benchmark, which provides field data for cyber security experiments, we aim to make the experimental process self-documenting. The data collected includes provenance information – such as when, where and how an attack was first observed or detected – and allows researchers to gauge information quality. Experiments are conducted on a common test bed, which provides tools for recording each procedural step. The ability to understand the provenance of research results enables rigorous cyber security experiments, conducted at scale. %B Dependable Computing Conference (EDCC), 2012 Ninth European %P 126 - 131 %8 2012/// %G eng %0 Journal Article %J IEEE Symposium on Security and Privacy %D 2012 %T Quid Pro Quo-tocols: Strengthening Semi-Honest Protocols with Dual Execution %A Huang,Y. %A Katz, Jonathan %A Evans,D. %X Known protocols for secure two-party computa-tion that are designed to provide full security against malicious behavior are significantly less efficient than protocols intended only to thwart semi-honest adversaries. We present a concrete design and implementation of protocols achieving security guarantees that are much stronger than are possible with semi-honest protocols, at minimal extra cost. Specifically, we consider protocols in which a malicious adversary may learn a single (arbitrary) bit of additional information about the honest party’s input. Correctness of the honest party’s output is still guaranteed. Adapting prior work of Mohassel and Franklin, the basic idea in our protocols is to conduct two separate runs of a (specific) semi-honest, garbled-circuit protocol, with the parties swapping roles, followed by an inexpensive secure equality test. We provide a rigorous definition and prove that this protocol leaks no more than one additional bit against a malicious adversary. In addition, we propose some heuristic enhancements to reduce the overall information a cheating adversary learns. Our experiments show that protocols meeting this security level can be implemented at cost very close to that of protocols that only achieve semi-honest security. Our results indicate that this model enables the large-scale, practical applications possible within the semi-honest security model, while providing stronger security guarantees. %B IEEE Symposium on Security and Privacy %8 2012/// %G eng %0 Journal Article %J Frontiers in Microbiology %D 2012 %T Role of Shrimp Chitin in the Ecology of Toxigenic Vibrio cholerae and Cholera Transmission %A Nahar,Shamsun %A Sultana,Marzia %A Naser,M. Niamul %A Nair,Gopinath B. %A Watanabe,Haruo %A Ohnishi,Makoto %A Yamamoto,Shouji %A Endtz,Hubert %A Cravioto,Alejandro %A Sack,R. Bradley %A Hasan,Nur A. %A Sadique,Abdus %A Huq,Anwar %A Rita R Colwell %A Alam,Munirul %X Seasonal plankton blooms correlate with occurrence of cholera in Bangladesh, although the mechanism of how dormant Vibrio cholerae, enduring interepidemic period in biofilms and plankton, initiates seasonal cholera is not fully understood. In this study, laboratory microcosms prepared with estuarine Mathbaria water (MW) samples supported active growth of toxigenic V. cholerae O1 up to 7 weeks as opposed to 6 months when microcosms were supplemented with dehydrated shrimp chitin chips (CC) as the single source of nutrient. Bacterial counting and detection of wbe and ctxA genes were done employing culture, direct fluorescent antibody (DFA) assay, and multiplex-polymerase chain reaction methods. In MW microcosm, the aqueous phase became clear as the non-culturable cells settled, whereas the aqueous phase of the MW–CC microcosm became turbid from bacterial growth stimulated by chitin. Bacterial chitin degradation and biofilm formation proceeded from an initial steady state to a gradually declining bacterial culturable count. V. cholerae within the microenvironments of chitin and chitin-associated biofilms remained metabolically active even in a high acidic environment without losing either viability or virulence. It is concluded that the abundance of chitin that occurs during blooms plays an important role in the aquatic life cycle of V. cholerae and, ultimately, in the seasonal transmission of cholera. %B Frontiers in Microbiology %V 2:260 %8 01/2012 %@ 1664-302X %G eng %R 10.3389/fmicb.2011.00260 %0 Journal Article %J Nature %D 2012 %T Structure, function and diversity of the healthy human microbiome %A Huttenhower, C. %A Gevers, D. %A Knight,R. %A Abubucker, S. %A Badger, J.H. %A Chinwalla, A.T. %A Creasy, H.H. %A Earl, A.M. %A Fitzgerald, M.G. %A Fulton, R.S. %A others %X 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’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–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. %B Nature %V 486 %P 207 - 214 %8 2012 %G eng %0 Journal Article %J Association for Computational Linguistics %D 2012 %T Topic Models for Dynamic Translation Model Adaptation %A Vladimir Eidelman %A Jordan Boyd-Graber %A Resnik, Philip %X We propose an approach that biases machine translation systems toward relevant transla- tions based on topic-specific contexts, where topics are induced in an unsupervised way using topic models; this can be thought of as inducing subcorpora for adaptation with- out any human annotation. We use these topic distributions to compute topic-dependent lex- ical weighting probabilities and directly in- corporate them into our translation model as features. Conditioning lexical probabilities on the topic biases translations toward topic- relevant output, resulting in significant im- provements of up to 1 BLEU and 3 TER on Chinese to English translation over a strong baseline. %B Association for Computational Linguistics %8 2012/// %G eng %0 Journal Article %J Cytometry. Part A : the journal of the International Society for Analytical Cytology %D 2011 %T Cell cycle dependent TN-C promoter activity determined by live cell imaging. %A Halter, Michael %A Sisan, Daniel R %A Chalfoun, Joe %A Stottrup, Benjamin L %A Cardone, Antonio %A Dima,Alden A. %A Tona, Alessandro %A Plant,Anne L. %A Elliott, John T %K Animals %K cell cycle %K Gene Expression Regulation %K Green Fluorescent Proteins %K Image Processing, Computer-Assisted %K Mice %K Microscopy, Fluorescence %K Microscopy, Phase-Contrast %K NIH 3T3 Cells %K Promoter Regions, Genetic %K Tenascin %X The extracellular matrix protein tenascin-C plays a critical role in development, wound healing, and cancer progression, but how it is controlled and how it exerts its physiological responses remain unclear. By quantifying the behavior of live cells with phase contrast and fluorescence microscopy, the dynamic regulation of TN-C promoter activity is examined. We employ an NIH 3T3 cell line stably transfected with the TN-C promoter ligated to the gene sequence for destabilized green fluorescent protein (GFP). Fully automated image analysis routines, validated by comparison with data derived from manual segmentation and tracking of single cells, are used to quantify changes in the cellular GFP in hundreds of individual cells throughout their cell cycle during live cell imaging experiments lasting 62 h. We find that individual cells vary substantially in their expression patterns over the cell cycle, but that on average TN-C promoter activity increases during the last 40% of the cell cycle. We also find that the increase in promoter activity is proportional to the activity earlier in the cell cycle. This work illustrates the application of live cell microscopy and automated image analysis of a promoter-driven GFP reporter cell line to identify subtle gene regulatory mechanisms that are difficult to uncover using population averaged measurements. %B Cytometry. Part A : the journal of the International Society for Analytical Cytology %V 79 %P 192-202 %8 2011 Mar %G eng %N 3 %1 http://www.ncbi.nlm.nih.gov/pubmed/22045641?dopt=Abstract %R 10.1002/cyto.a.21028 %0 Journal Article %J ACM SIGCOMM Computer Communication Review %D 2011 %T Communicating with caps: managing usage caps in home networks %A Kim,Hyojoon %A Sundaresan,Srikanth %A Marshini Chetty %A Feamster, Nick %A Edwards,W. Keith %K home network %K openflow %K usage cap %X As Internet service providers increasingly implement and impose "usage caps", consumers need better ways to help them understand and control how devices in the home use up the available network resources or available capacity. Towards this goal, we will demonstrate a system that allows users to monitor and manage their usage caps. The system uses the BISMark firmware running on network gateways to collect usage statistics and report them to a logically centralized controller, which displays usage information. The controller allows users to specify policies about how different people, devices, and applications should consume the usage cap; it implements and enforces these policies via a secure OpenFlow control channel to each gateway device. The demonstration will show various use cases, such as limiting the usage of a particular application, visualizing usage statistics, and allowing users within a single household to "trade" caps with one another. %B ACM SIGCOMM Computer Communication Review %V 41 %P 470 - 471 %8 2011/08// %@ 0146-4833 %G eng %U http://doi.acm.org/10.1145/2043164.2018526 %N 4 %R 10.1145/2043164.2018526 %0 Journal Article %J SIGCOMM Comput. Commun. Rev. %D 2011 %T Communicating with Caps: Managing Usage Caps in Home Networks %A Kim, Hyojoon %A Sundaresan, Srikanth %A Marshini Chetty %A Feamster, Nick %A Edwards, W. Keith %K home network %K openflow %K usage cap %X As Internet service providers increasingly implement and impose "usage caps", consumers need better ways to help them understand and control how devices in the home use up the available network resources or available capacity. Towards this goal, we will demonstrate a system that allows users to monitor and manage their usage caps. The system uses the BISMark firmware running on network gateways to collect usage statistics and report them to a logically centralized controller, which displays usage information. The controller allows users to specify policies about how different people, devices, and applications should consume the usage cap; it implements and enforces these policies via a secure OpenFlow control channel to each gateway device. The demonstration will show various use cases, such as limiting the usage of a particular application, visualizing usage statistics, and allowing users within a single household to "trade" caps with one another. %B SIGCOMM Comput. Commun. Rev. %V 41 %P 470 - 471 %8 2011/08// %@ 0146-4833 %G eng %U http://doi.acm.org/10.1145/2043164.2018526 %N 4 %0 Conference Paper %B 2011 18th IEEE International Conference on Image Processing (ICIP) %D 2011 %T Component-based restoration of speckled images %A Patel, Vishal M. %A Easley,G. R %A Chellapa, Rama %K coherent imaging modalities %K component optimization formulation %K component-based restoration %K Dictionaries %K image restoration %K iterative algorithm %K iterative methods %K multiplicative noise %K NOISE %K optimisation %K radar imaging %K SAR images %K Speckle %K speckle reduction algorithm %K speckled images %K structure components %K surrogate functionals %K synthetic aperture radar %K texture components %K transforms %K TV %X Many coherent imaging modalities are often characterized by a multiplicative noise, known as speckle which often makes the interpretation of data difficult. In this paper, we present a speckle reduction algorithm based on separating the structure and texture components of SAR images. An iterative algorithm based on surrogate functionals is presented that solves the component optimization formulation. Experiments indicate this proposed method performs favorably compared to state-of-the-art speckle reduction methods. %B 2011 18th IEEE International Conference on Image Processing (ICIP) %I IEEE %P 2797 - 2800 %8 2011/09/11/14 %@ 978-1-4577-1304-0 %G eng %R 10.1109/ICIP.2011.6116252 %0 Journal Article %J Journal of Mechanical Design %D 2011 %T Design of Revolute Joints for In-Mold Assembly Using Insert Molding %A Ananthanarayanan,A. %A Ehrlich,L. %A Desai,J. P. %A Gupta,S.K. %B Journal of Mechanical Design %V 133 %P 121010 - 121010 %8 2011/// %G eng %0 Journal Article %J Nature Medicine %D 2011 %T Direct targeting of Sec23a by miR-200s influences cancer cell secretome and promotes metastatic colonization %A Korpal, Manav %A Ell, Brian J. %A Buffa, Francesca M. %A Ibrahim, Toni %A Blanco, Mario A. %A Celià-Terrassa, Toni %A Mercatali, Laura %A Zia Khan %A Goodarzi, Hani %A Hua, Yuling %A Wei, Yong %A Hu, Guohong %A Garcia, Benjamin A. %A Ragoussis, Jiannis %A Amadori, Dino %A Harris, Adrian L. %A Kang, Yibin %X 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–dependent epithelial traits and Sec23a-mediated tumor cell secretome.View full text %B Nature Medicine %V 17 %P 1101 - 1108 %8 2011/09// %@ 1078-8956 %G eng %U http://www.nature.com/nm/journal/v17/n9/abs/nm.2401.html %N 9 %! Nat Med %0 Journal Article %J Network and Distributed System Security Symposium %D 2011 %T Efficient privacy-preserving biometric identification %A Huang,Y. %A Malka,L. %A Evans,D. %A Katz, Jonathan %X We present an efficient matching protocol that can be usedin many privacy-preserving biometric identification systems in the semi-honest setting. Our most general technical con- tribution is a new backtracking protocol that uses the by- product of evaluating a garbled circuit to enable efficient oblivious information retrieval. We also present a more ef- ficient protocol for computing the Euclidean distances of vectors, and optimized circuits for finding the closest match between a point held by one party and a set of points held by another. We evaluate our protocols by implementing a practical privacy-preserving fingerprint matching system. %B Network and Distributed System Security Symposium %8 2011/// %G eng %0 Journal Article %J Information Systems Security %D 2011 %T Efficient Secure Computation with Garbled Circuits %A Huang,Y. %A Shen,C. %A Evans,D. %A Katz, Jonathan %A Shelat,A. %X Secure two-party computation enables applications in which participants compute the output of a function that depends on their private inputs, without revealing those inputs or relying on any trusted third party. In this paper, we show the potential of building privacy-preserving applications using garbled circuits, a generic technique that until recently was believed to be too inefficient to scale to realistic problems. We present a Java-based framework that uses pipelining and circuit-level optimizations to build efficient and scalable privacy-preserving applications. Although the standard garbled circuit protocol assumes a very week, honest-but-curious adversary, techniques are available for converting such protocols to resist stronger adversaries, including fully malicious adversaries. We summarize approaches to producing malicious-resistant secure computations that reduce the costs of transforming a protocol to be secure against stronger adversaries. In addition, we summarize results on ensuring fairness, the property that either both parties receive the result or neither party does. Several open problems remain, but as theory and pragmatism advance, secure computation is approaching the point where it offers practical solutions for a wide variety of important problems. %B Information Systems Security %P 28 - 48 %8 2011/// %G eng %R 10.1007/978-3-642-25560-1_2 %0 Journal Article %J International Journal for Numerical Methods in Fluids %D 2011 %T Fast solvers for models of ICEO microfluidic flows %A Shuttleworth, R. R %A Elman, Howard %A Long, K. R %A Templeton, J. A %B International Journal for Numerical Methods in Fluids %V 65 %P 383 - 404 %8 2011/// %G eng %N 4 %0 Journal Article %J USENIX Security Symposium %D 2011 %T Faster secure two-party computation using garbled circuits %A Huang,Y. %A Evans,D. %A Katz, Jonathan %A Malka,L. %X Secure two-party computation enables two parties toevaluate a function cooperatively without revealing to ei- ther party anything beyond the function’s output. The garbled-circuit technique, a generic approach to secure two-party computation for semi-honest participants, was developed by Yao in the 1980s, but has been viewed as being of limited practical significance due to its in- efficiency. We demonstrate several techniques for im- proving the running time and memory requirements of the garbled-circuit technique, resulting in an implemen- tation of generic secure two-party computation that is significantly faster than any previously reported while also scaling to arbitrarily large circuits. We validate our approach by demonstrating secure computation of cir- cuits with over 109 gates at a rate of roughly 10 µs per garbled gate, and showing order-of-magnitude improve- ments over the best previous privacy-preserving proto- cols for computing Hamming distance, Levenshtein dis- tance, Smith-Waterman genome alignment, and AES. %B USENIX Security Symposium %8 2011/// %G eng %0 Conference Paper %B ACM SIGCOMM Workshop on Home Networks '11 %D 2011 %T Helping Users Shop for ISPs with Internet Nutrition Labels %A Sundaresan, Srikanth %A Feamster, Nick %A Teixeira, Renata %A Tang, Anthony %A Edwards, W. Keith %A Grinter, Rebecca E. %A Marshini Chetty %A de Donato, Walter %K access networks %K benchmarking %K bismark %K broadband networks %K gateway measurements %X 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. %B ACM SIGCOMM Workshop on Home Networks '11 %S HomeNets '11 %I ACM %P 13 - 18 %8 2011/// %@ 978-1-4503-0798-7 %G eng %U http://doi.acm.org/10.1145/2018567.2018571 %0 Book %D 2011 %T Image Registration for Remote Sensing %A LeMoigne,Jacqueline %A Netanyahu,Nathan S. %A Eastman,Roger D. %K Science / Astronomy %K Science / Earth Sciences / General %K Technology & Engineering / Environmental / General %K Technology & Engineering / Remote Sensing & Geographic Information Systems %X Image registration is a digital image processing discipline that studies how to bring two or more digital images into precise alignment for analysis and comparison. Accurate registration algorithms are essential for creating mosaics of satellite images and tracking changes on the planet's surface over time. Bringing together invited contributions from 36 distinguished researchers, the book presents a detailed overview of current research and practice in the application of image registration to remote sensing imagery. Chapters cover the problem definition, theoretical issues in accuracy and efficiency, fundamental algorithms, and real-world case studies of image registration software applied to imagery from operational satellite systems. This book provides a comprehensive and practical overview for Earth and space scientists, presents image processing researchers with a summary of current research, and can be used for specialized graduate courses. %I Cambridge University Press %P 515 %8 2011 %@ 9781139494373 %G eng %0 Journal Article %J SIGCOMM Comput. Commun. Rev. %D 2011 %T Instrumenting home networks %A Calvert,Kenneth L. %A Edwards,W. Keith %A Feamster, Nick %A Grinter,Rebecca E. %A Deng,Ye %A Zhou,Xuzi %K home network management %K home network troubleshooting %X 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. %B SIGCOMM Comput. Commun. Rev. %V 41 %P 84 - 89 %8 2011/// %@ 0146-4833 %G eng %U http://doi.acm.org/10.1145/1925861.1925875 %N 1 %R 10.1145/1925861.1925875 %0 Journal Article %J IEEE Automatic Speech Recognition and Understanding Workshop %D 2011 %T Linear versus Mel Frequency Cepstral Coefficients for Speaker Recognition %A Zhou,X. %A Garcia-Romero,D. %A Duraiswami, Ramani %A Espy-Wilson,C. %A Shamma,S. %X 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. %B IEEE Automatic Speech Recognition and Understanding Workshop %8 2011/// %G eng %0 Journal Article %J Bangladesh Journal of Microbiology %D 2011 %T Metagenomic 16S rDNA Targeted PCR-DGGE in Determining Bacterial Diversity in Aquatic Ecosystem %A Hasan,Nur A. %A Chowdhury,W Bari %A Rahim,Niaz %A Sultana,Marzia %A Shabnam,S Antara %A Mai,Volker %A Ali,Afsar %A Morris,Glen J %A Sack,R. Bradley %A Huq,Anwar %A Rita R Colwell %A Endtz,Hubert Ph %A Cravioto,Alejandro %A Alam,Munirul %X Bacterial numbers in surface water samples, collected randomly from six different water bodies, were estimated by acridine orange direct counting (AODC) and conventional culture-based heterotrophic plate counting (HPC). Bacterial genomic DNA was prepared from water samples by employing methods used for stool samples, including the population dynamics, were determined by primer extension of the 16S rDNA (V6/V8 region) using polymerase chain reaction (PCR), followed by denaturing gradient gel electrophoresis (DGGE), a metagenomic tool that is capable of separating unrelated DNAs based on the differences in their sequences and GC contents. The bacterial numbers in water samples ranged from 103 – 106 CFU/ mL for HPC and 104 – 107 cells/ mL for AODC, showing that a great majority of bacteria prevail as uncultivable which do not respond to culture methods that are used widely for tracking bacterial pathogens. The acridine orange-stained bacteria varied in sizes and shapes, and appeared either as planktonic (solitary) cells or as clusters of biofilms, showing the presence of diverse community under the epifluorescence microscope. The DGGE of the ca. 457 bp amplicons, as confirmed by agarose gel electrophoresis, produced bands that ranged in intensities and numbers from 18 to 31, with each band possibly indicating the presence of one or more closely related bacterial species. The enrichment of pathogenic bacteria in the aquatic ecosystem is known to precede the seasonal diarrhoeal outbreaks; therefore, bacterial community dynamics determined by Metagenomic 16S PCR-DGGE during pre-epidemic enrichment appears promising in predicting the upcoming diarrheal outbreaks. %B Bangladesh Journal of Microbiology %V 27 %8 2011/12/13/ %@ 1011-9981 %G eng %U http://www.banglajol.info/bd/index.php/BJM/article/view/9171 %N 2 %R 10.3329/bjm.v27i2.9171 %0 Journal Article %J Journal of Signal Processing Systems %D 2011 %T Overview of the MPEG Reconfigurable Video Coding Framework %A Bhattacharyya, Shuvra S. %A Eker, Johan %A Janneck, Jörn W. %A Lucarz, Christophe %A Mattavelli, Marco %A Raulet, Mickaël %K CAL actor language %K Circuits and Systems %K Code synthesis %K Computer Imaging, Vision, Pattern Recognition and Graphics %K Dataflow programming %K Electrical Engineering %K Image Processing and Computer Vision %K pattern recognition %K Reconfigurable Video Coding %K Signal, Image and Speech Processing %X Video coding technology in the last 20 years has evolved producing a variety of different and complex algorithms and coding standards. So far the specification of such standards, and of the algorithms that build them, has been done case by case providing monolithic textual and reference software specifications in different forms and programming languages. However, very little attention has been given to provide a specification formalism that explicitly presents common components between standards, and the incremental modifications of such monolithic standards. The MPEG Reconfigurable Video Coding (RVC) framework is a new ISO standard currently under its final stage of standardization, aiming at providing video codec specifications at the level of library components instead of monolithic algorithms. The new concept is to be able to specify a decoder of an existing standard or a completely new configuration that may better satisfy application-specific constraints by selecting standard components from a library of standard coding algorithms. The possibility of dynamic configuration and reconfiguration of codecs also requires new methodologies and new tools for describing the new bitstream syntaxes and the parsers of such new codecs. The RVC framework is based on the usage of a new actor/ dataflow oriented language called CAL for the specification of the standard library and instantiation of the RVC decoder model. This language has been specifically designed for modeling complex signal processing systems. CAL dataflow models expose the intrinsic concurrency of the algorithms by employing the notions of actor programming and dataflow. The paper gives an overview of the concepts and technologies building the standard RVC framework and the non standard tools supporting the RVC model from the instantiation and simulation of the CAL model to software and/or hardware code synthesis. %B Journal of Signal Processing Systems %V 63 %P 251 - 263 %8 2011 %@ 1939-8018, 1939-8115 %G eng %U http://link.springer.com/article/10.1007/s11265-009-0399-3 %N 2 %! J Sign Process Syst %0 Journal Article %J Proceedings of the Twenty-Fifth Conference on Artificial Intelligence (AAAI) %D 2011 %T Predicting author blog channels with high value future posts for monitoring %A Wu,S. %A Elsayed,T. %A Rand, William %A Raschid, Louiqa %X The phenomenal growth of social media, both in scale andimportance, has created a unique opportunity to track infor- mation diffusion and the spread of influence, but can also make efficient tracking difficult. Given data streams rep- resenting blog posts on multiple blog channels and a focal query post on some topic of interest, our objective is to pre- dict which of those channels are most likely to contain a fu- ture post that is relevant, or similar, to the focal query post. We denote this task as the future author prediction problem (FAPP). This problem has applications in information diffu- sion for brand monitoring and blog channel personalization and recommendation. We develop prediction methods in- spired by (naıve) information retrieval approaches that use historical posts in the blog channel for prediction. We also train a ranking support vector machine (SVM) to solve the problem. We evaluate our methods on an extensive social media dataset; despite the difficulty of the task, all methods perform reasonably well. Results show that ranking SVM prediction can exploit blog channel and diffusion characteris- tics to improve prediction accuracy. Moreover, it is surpris- ingly good for prediction in emerging topics and identifying inconsistent authors. %B Proceedings of the Twenty-Fifth Conference on Artificial Intelligence (AAAI) %8 2011/// %G eng %0 Journal Article %J 19th Network and Distributed Security Symposium %D 2011 %T Private Set Intersection: Are Garbled Circuits Better than Custom Protocols? %A Huang,Y. %A Evans,D. %A Katz, Jonathan %X Cryptographic protocols for Private Set Intersection (PSI)are the basis for many important privacy-preserving ap- plications. Over the past few years, intensive research has been devoted to designing custom protocols for PSI based on homomorphic encryption and other public-key tech- niques, apparently due to the belief that solutions using generic approaches would be impractical. This paper ex- plores the validity of that belief. We develop three classes of protocols targeted to different set sizes and domains, all based on Yao’s generic garbled-circuit method. We then compare the performance of our protocols to the fastest custom PSI protocols in the literature. Our results show that a careful application of garbled circuits leads to solu- tions that can run on million-element sets on typical desk- tops, and that can be competitive with the fastest custom protocols. Moreover, generic protocols like ours can be used directly for performing more complex secure com- putations, something we demonstrate by adding a simple information-auditing mechanism to our PSI protocols. %B 19th Network and Distributed Security Symposium %8 2011/// %G eng %0 Conference Paper %B Twenty-Fifth AAAI Conference on Artificial Intelligence %D 2011 %T Selective transfer between learning tasks using task-based boosting %A Eaton,E. %A desJardins, Marie %A others %B Twenty-Fifth AAAI Conference on Artificial Intelligence %8 2011/// %G eng %0 Journal Article %J IFIP Advances in Information and Communication Technology (AICT) %D 2011 %T Threat-Aware Clustering in Wireless Sensor Networks %A Abd-Almageed, Wael %A Blace,R.E. %A Eltoweissy,M. %B IFIP Advances in Information and Communication Technology (AICT) %V 264 %P 1 - 12 %8 2011/// %G eng %N 264 %0 Journal Article %J Nucleic Acids ResearchNucl. Acids Res. %D 2011 %T Transcriptional Regulation Via TF-Modifying Enzymes: An Integrative Model-Based Analysis %A Everett,Logan J %A Jensen,Shane T %A Hannenhalli, Sridhar %X Transcription factor activity is largely regulated through post-translational modification. Here, we report the first integrative model of transcription that includes both interactions between transcription factors and promoters, and between transcription factors and modifying enzymes. Simulations indicate that our method is robust against noise. We validated our tool on a well-studied stress response network in yeast and on a STAT1-mediated regulatory network in human B cells. Our work represents a significant step toward a comprehensive model of gene transcription. %B Nucleic Acids ResearchNucl. Acids Res. %V 39 %P e78-e78 - e78-e78 %8 2011/07/01/ %@ 0305-1048, 1362-4962 %G eng %U http://nar.oxfordjournals.org/content/39/12/e78 %N 12 %R 10.1093/nar/gkr172 %0 Journal Article %J IFIP Lecture Notes in Computer Science (LNCS) %D 2011 %T Visualizing Missing Data: Graph Interpretation User Study %A Drizd,Terence %A Eaton,Cyntrica %A Plaisant, Catherine %X Visualizing Missing Data: Graph Interpretation User Study %B IFIP Lecture Notes in Computer Science (LNCS) %V 3585 %P 861 - 872 %8 2011/03/31/ %G eng %U http://dl.ifip.org/index.php/lncs/article/view/25927 %N 3585 %0 Journal Article %J SIAM Journal on Scientific Computing %D 2011 %T Windowed Spectral Regularization of Inverse Problems %A Chung,Julianne M. %A Easley,Glenn R %A O'Leary, Dianne P. %B SIAM Journal on Scientific Computing %V 33 %8 2011/// %G eng %N 6 %R DOI: 10.1137/100809787 %0 Conference Paper %B Proceedings of the ACL 2010 System Demonstrations %D 2010 %T cdec: A decoder, alignment, and learning framework for finite-state and context-free translation models %A Dyer,C. %A Weese,J. %A Setiawan,H. %A Lopez,A. %A Ture,F. %A Eidelman,V. %A Ganitkevitch,J. %A Blunsom,P. %A Resnik, Philip %B Proceedings of the ACL 2010 System Demonstrations %P 7 - 12 %8 2010/// %G eng %0 Conference Paper %B Proceedings of the 19th ACM international conference on Information and knowledge management %D 2010 %T Challenges in personalized authority flow based ranking of social media %A Sayyadi,H. %A Edmonds,J. %A Hristidis,V. %A Raschid, Louiqa %B Proceedings of the 19th ACM international conference on Information and knowledge management %P 1409 - 1412 %8 2010/// %G eng %0 Journal Article %J IEEE Journal of Selected Topics in Signal Processing %D 2010 %T Compressed Synthetic Aperture Radar %A Patel, Vishal M. %A Easley,G. R %A Healy,D. M %A Chellapa, Rama %K Compressed sensing %K compressed sensing (CS) %K compressive sensing %K electromagnetic waveforms %K image resolution %K radar imaging %K SAR imaging modality %K synthetic aperture radar %K Synthetic aperture radar (SAR) %K targets spatial distribution %X In this paper, we introduce a new synthetic aperture radar (SAR) imaging modality which can provide a high-resolution map of the spatial distribution of targets and terrain using a significantly reduced number of needed transmitted and/or received electromagnetic waveforms. This new imaging scheme, requires no new hardware components and allows the aperture to be compressed. It also presents many new applications and advantages which include strong resistance to countermesasures and interception, imaging much wider swaths and reduced on-board storage requirements. %B IEEE Journal of Selected Topics in Signal Processing %V 4 %P 244 - 254 %8 2010/04// %@ 1932-4553 %G eng %N 2 %R 10.1109/JSTSP.2009.2039181 %0 Book Section %B Integer Programming and Combinatorial OptimizationInteger Programming and Combinatorial Optimization %D 2010 %T Fault-Tolerant Facility Location: A Randomized Dependent LP-Rounding Algorithm %A Byrka,Jaroslaw %A Srinivasan, Aravind %A Swamy,Chaitanya %E Eisenbrand,Friedrich %E Shepherd,F. %B Integer Programming and Combinatorial OptimizationInteger Programming and Combinatorial Optimization %S Lecture Notes in Computer Science %I Springer Berlin / Heidelberg %V 6080 %P 244 - 257 %8 2010/// %@ 978-3-642-13035-9 %G eng %U http://dx.doi.org/10.1007/978-3-642-13036-6_19 %0 Journal Article %J Developmental Cell %D 2010 %T Hopx and Hdac2 Interact to Modulate Gata4 Acetylation and Embryonic Cardiac Myocyte Proliferation %A Trivedi,Chinmay M. %A Zhu,Wenting %A Wang,Qiaohong %A Jia,Cheng %A Kee,Hae Jin %A Li,Li %A Hannenhalli, Sridhar %A Epstein,Jonathan A. %X SummaryRegulation of chromatin structure via histone modification has recently received intense attention. Here, we demonstrate that the chromatin-modifying enzyme histone deacetylase 2 (Hdac2) functions with a small homeodomain factor, Hopx, to mediate deacetylation of Gata4, which is expressed by cardiac progenitor cells and plays critical roles in the regulation of cardiogenesis. In the absence of Hopx and Hdac2 in mouse embryos, Gata4 hyperacetylation is associated with a marked increase in cardiac myocyte proliferation, upregulation of Gata4 target genes, and perinatal lethality. Hdac2 physically interacts with Gata4, and this interaction is stabilized by Hopx. The ability of Gata4 to transactivate cell cycle genes is impaired by Hopx/Hdac2-mediated deacetylation, and this effect is abrogated by loss of Hdac2-Gata4 interaction. These results suggest that Gata4 is a nonhistone target of Hdac2-mediated deacetylation and that Hdac2, Hopx, and Gata4 coordinately regulate cardiac myocyte proliferation during embryonic development. %B Developmental Cell %V 19 %P 450 - 459 %8 2010/09/14/ %@ 1534-5807 %G eng %U http://www.sciencedirect.com/science/article/pii/S1534580710003874 %N 3 %R 10.1016/j.devcel.2010.08.012 %0 Journal Article %J SIGKDD explorations %D 2010 %T On the importance of sharing negative results %A Giraud-Carrier,C. %A Dunham,M.H. %A Atreya,A. %A Elkan,C. %A Perlich,C. %A Swirszcz,G. %A Shi,X. %A Philip,S.Y. %A Fürnkranz,J. %A Sima,J.F. %B SIGKDD explorations %V 12 %P 3 - 4 %8 2010/// %G eng %N 2 %0 Book Section %B Integer Programming and Combinatorial OptimizationInteger Programming and Combinatorial Optimization %D 2010 %T On k-Column Sparse Packing Programs %A Bansal,Nikhil %A Korula,Nitish %A Nagarajan,Viswanath %A Srinivasan, Aravind %E Eisenbrand,Friedrich %E Shepherd,F. %X We consider the class of packing integer programs (PIPs) that are column sparse, where there is a specified upper bound k on the number of constraints that each variable appears in. We give an improved (ek + o(k))-approximation algorithm for k-column sparse PIPs. Our algorithm is based on a linear programming relaxation, and involves randomized rounding combined with alteration. We also show that the integrality gap of our LP relaxation is at least 2k − 1; it is known that even special cases of k-column sparse PIPs are (klogk)-hard to approximate.We generalize our result to the case of maximizing monotone submodular functions over k-column sparse packing constraints, and obtain an e2ke−1+o(k) -approximation algorithm. In obtaining this result, we prove a new property of submodular functions that generalizes the fractionally subadditive property, which might be of independent interest. %B Integer Programming and Combinatorial OptimizationInteger Programming and Combinatorial Optimization %S Lecture Notes in Computer Science %I Springer Berlin / Heidelberg %V 6080 %P 369 - 382 %8 2010/// %@ 978-3-642-13035-9 %G eng %U http://dx.doi.org/10.1007/978-3-642-13036-6_28 %0 Journal Article %J Journal of the American Society for Information Science and Technology %D 2010 %T Making sense of archived e‐mail: Exploring the Enron collection with NetLens %A Kang,Hyunmo %A Plaisant, Catherine %A Elsayed,Tamer %A Oard, Douglas %X Informal communications media pose new challenges for information-systems design, but the nature of informal interaction offers new opportunities as well. This paper describes NetLens-E-mail, a system designed to support exploration of the content-actor network in large e-mail collections. Unique features of NetLens-E-mail include close coupling of orientation, specification, restriction, and expansion, and introduction and incorporation of a novel capability for iterative projection between content and actor networks within the same collection. Scenarios are presented to illustrate the intended employment of NetLens-E-mail, and design walkthroughs with two domain experts provide an initial basis for assessment of the suitability of the design by scholars and analysts. %B Journal of the American Society for Information Science and Technology %V 61 %P 723 - 744 %8 2010/04/01/ %@ 1532-2890 %G eng %U http://onlinelibrary.wiley.com/doi/10.1002/asi.21275/full %N 4 %R 10.1002/asi.21275 %0 Journal Article %J Algorithms for Molecular Biology %D 2010 %T Mimosa: Mixture model of co-expression to detect modulators of regulatory interaction %A Hansen,Matthew %A Everett,Logan %A Singh,Larry %A Hannenhalli, Sridhar %X Functionally related genes tend to be correlated in their expression patterns across multiple conditions and/or tissue-types. Thus co-expression networks are often used to investigate functional groups of genes. In particular, when one of the genes is a transcription factor (TF), the co-expression-based interaction is interpreted, with caution, as a direct regulatory interaction. However, any particular TF, and more importantly, any particular regulatory interaction, is likely to be active only in a subset of experimental conditions. Moreover, the subset of expression samples where the regulatory interaction holds may be marked by presence or absence of a modifier gene, such as an enzyme that post-translationally modifies the TF. Such subtlety of regulatory interactions is overlooked when one computes an overall expression correlation. %B Algorithms for Molecular Biology %V 5 %P 4 - 4 %8 2010/01/04/ %@ 1748-7188 %G eng %U http://www.almob.org/content/5/1/4 %N 1 %R 10.1186/1748-7188-5-4 %0 Journal Article %J Proceedings of SPIE %D 2010 %T Multiscale directional filtering of noisy InSAR phase images %A Patel, Vishal M. %A Easley,Glenn R %A Chellapa, Rama %X In this work, we present a new approach for the problem of interferometric phase noise reduction in synthetic aperture radar interferometry based on the shearlet representation. Shearlets provide a multidirectional and multiscale decomposition that have advantages when dealing with noisy phase fringes over standard filtering methods. Using a shearlet decomposition of a noisy phase image, we can adaptively estimate a phase representation in a multiscale and anisotropic fashion. Such denoised phase interferograms can be used to provide much better digital elevation maps (DEM). Experiments show that this method performs significantly better than many competitive methods. %B Proceedings of SPIE %V 7703 %P 770308-770308-9 - 770308-770308-9 %8 2010/04/05/ %@ 0277786X %G eng %U http://spiedigitallibrary.org/proceedings/resource/2/psisdg/7703/1/770308_1?isAuthorized=no %N 1 %R doi:10.1117/12.849576 %0 Conference Paper %B Proceedings of the 19th ACM international conference on Information and knowledge management %D 2010 %T Multi-view clustering with constraint propagation for learning with an incomplete mapping between views %A Eaton,Eric %A desJardins, Marie %A Jacob,Sara %K constrained clustering %K multi-view learning %K semi-supervised learning %X Multi-view learning algorithms typically assume a complete bipartite mapping between the different views in order to exchange information during the learning process. However, many applications provide only a partial mapping between the views, creating a challenge for current methods. To address this problem, we propose a multi-view algorithm based on constrained clustering that can operate with an incomplete mapping. Given a set of pairwise constraints in each view, our approach propagates these constraints using a local similarity measure to those instances that can be mapped to the other views, allowing the propagated constraints to be transferred across views via the partial mapping. It uses co-EM to iteratively estimate the propagation within each view based on the current clustering model, transfer the constraints across views, and update the clustering model, thereby learning a unified model for all views. We show that this approach significantly improves clustering performance over several other methods for transferring constraints and allows multi-view clustering to be reliably applied when given a limited mapping between the views. %B Proceedings of the 19th ACM international conference on Information and knowledge management %S CIKM '10 %I ACM %C New York, NY, USA %P 389 - 398 %8 2010/// %@ 978-1-4503-0099-5 %G eng %U http://doi.acm.org/10.1145/1871437.1871489 %R 10.1145/1871437.1871489 %0 Book Section %B Image Registration for Remote SensingImage Registration for Remote Sensing %D 2010 %T New Approaches to Robust, Point-Based Image Registration %A Mount, Dave %A Netanyahu,N. S %A Ratanasanya,S. %E LeMoigne,Jacqueline %E Netanyahu,Nathan S. %E Eastman,Roger D. %X We consider various algorithmic solutions to image registration based on thealignment of a set of feature points. We present a number of enhancements to a branch-and-bound algorithm introduced by Mount, Netanyahu, and Le Moigne (Pattern Recognition, Vol. 32, 1999, pp. 17–38), which presented a registration algorithm based on the partial Hausdorff distance. Our enhance- ments include a new distance measure, the discrete Gaussian mismatch, and a number of improvements and extensions to the above search algorithm. Both distance measures are robust to the presence of outliers, that is, data points from either set that do not match any point of the other set. We present experimental studies, which show that the new distance measure considered can provide significant improvements over the partial Hausdorff distance in instances where the number of outliers is not known in advance. These experiments also show that our other algorithmic improvements can offer tangible improvements. We demonstrate the algorithm’s efficacy by considering images involving different sensors and different spectral bands, both in a traditional framework and in a multiresolution framework. %B Image Registration for Remote SensingImage Registration for Remote Sensing %I Cambridge University Press %8 2010/// %@ 9780521516112 %G eng %0 Journal Article %J arXiv:1007.4268 [cs] %D 2010 %T Pushdown Control-Flow Analysis of Higher-Order Programs %A Earl, Christopher %A Might, Matthew %A David Van Horn %K Computer Science - Programming Languages %K F.3.2 %K F.4.1 %X Context-free approaches to static analysis gain precision over classical approaches by perfectly matching returns to call sites---a property that eliminates spurious interprocedural paths. Vardoulakis and Shivers's recent formulation of CFA2 showed that it is possible (if expensive) to apply context-free methods to higher-order languages and gain the same boost in precision achieved over first-order programs. To this young body of work on context-free analysis of higher-order programs, we contribute a pushdown control-flow analysis framework, which we derive as an abstract interpretation of a CESK machine with an unbounded stack. One instantiation of this framework marks the first polyvariant pushdown analysis of higher-order programs; another marks the first polynomial-time analysis. In the end, we arrive at a framework for control-flow analysis that can efficiently compute pushdown generalizations of classical control-flow analyses. %B arXiv:1007.4268 [cs] %8 2010/07/24/ %G eng %U http://arxiv.org/abs/1007.4268 %0 Book Section %B Computational Biology of Transcription Factor BindingComputational Biology of Transcription Factor Binding %D 2010 %T Regulating the Regulators: Modulators of Transcription Factor Activity %A Everett,Logan %A Hansen,Matthew %A Hannenhalli, Sridhar %E Ladunga,Istvan %X Gene transcription is largely regulated by DNA-binding transcription factors ( TFs ). However, the TF activity itself is modulated via, among other things, post-translational modifications ( PTMs ) by specific modification enzymes in response to cellular stimuli. TF-PTMs thus serve as “molecular switchboards” that map upstream signaling events to the downstream transcriptional events. An important long-term goal is to obtain a genome-wide map of “regulatory triplets” consisting of a TF, target gene, and a modulator gene that specifically modulates the regulation of the target gene by the TF. A variety of genome-wide data sets can be exploited by computational methods to obtain a rough map of regulatory triplets, which can guide directed experiments. However, a prerequisite to developing such computational tools is a systematic catalog of known instances of regulatory triplets. We first describe PTM-Switchboard, a recent database that stores triplets of genes such that the ability of one gene (the TF) to regulate a target gene is dependent on one or more PTMs catalyzed by a third gene, the modifying enzyme. We also review current computational approaches to infer regulatory triplets from genome-wide data sets and conclude with a discussion of potential future research. PTM-Switchboard is accessible at http://cagr.pcbi.upenn.edu/PTMswitchboard / %B Computational Biology of Transcription Factor BindingComputational Biology of Transcription Factor Binding %S Methods in Molecular Biology %I Humana Press %V 674 %P 297 - 312 %8 2010/// %@ 978-1-60761-854-6 %G eng %U http://dx.doi.org/10.1007/978-1-60761-854-6_19 %0 Conference Paper %B Proceedings of the 41st ACM technical symposium on Computer science education %D 2010 %T Is teaching parallel algorithmic thinking to high school students possible?: one teacher's experience %A Torbert,Shane %A Vishkin, Uzi %A Tzur,Ron %A Ellison,David J. %K high school %K parallel algorithmic thinking %K pram algorithms %K XMT %X All students at our high school are required to take at least one course in Computer Science prior to their junior year. They are also required to complete a year-long senior project associated with a specific in-house laboratory, one of which is the Computer Systems Lab. To prepare students for this experience the lab offers elective courses at the post-AP Computer Science level. Since the early 1990s one of these electives has focused on parallel computing. The course enrolls approximately 40 students each year for two semesters of instruction. The lead programming language is C and topics include a wide array of industry-standard and experimental tools. Since the 2007-2008 school year we have included a unit on parallel algorithmic thinking (PAT) using the Explicit Multi-Threading (XMT) system. We describe our experiences using this system after self-studying the approach from a publicly available tutorial. Overall, this article provides significant evidence regarding the unique teachability of the XMT PAT approach, and advocates using it broadly in Computer Science education. %B Proceedings of the 41st ACM technical symposium on Computer science education %S SIGCSE '10 %I ACM %C New York, NY, USA %P 290 - 294 %8 2010/// %@ 978-1-4503-0006-3 %G eng %U http://doi.acm.org/10.1145/1734263.1734363 %R 10.1145/1734263.1734363 %0 Conference Paper %B Software Testing, Verification, and Validation Workshops (ICSTW), 2010 Third International Conference on %D 2010 %T Using methods & measures from network analysis for gui testing %A Elsaka,E. %A Moustafa,W. E %A Nguyen,Bao %A Memon, Atif M. %K betweenness clustering method %K event sequences %K event-flow graph model %K Graphical user interfaces %K GUI quality assurance %K GUI testing %K network analysis %K network centrality measures %K program testing %K Software quality %X Graphical user interfaces (GUIs) for today's applications are extremely large. Moreover, they provide many degrees of freedom to the end-user, thus allowing the user to perform a very large number of event sequences on the GUI. The large sizes and degrees of freedom create severe problems for GUI quality assurance, including GUI testing. In this paper, we leverage methods and measures from network analysis to analyze and study GUIs, with the goal of aiding GUI testing activities. We apply these methods and measures on the event-flow graph model of GUIs. Results of a case study show that "network centrality measures" are able to identify the most important events in the GUI as well as the most important sequences of events. These events and sequences are good candidates for test prioritization. In addition, the "betweenness clustering" method is able to partition the GUI into regions that can be tested separately. %B Software Testing, Verification, and Validation Workshops (ICSTW), 2010 Third International Conference on %P 240 - 246 %8 2010/04// %G eng %R 10.1109/ICSTW.2010.61 %0 Book Section %B Computer Performance IssuesComputer Performance Issues %D 2009 %T Advances in Web Testing %A Eaton,Cyntrica %A Memon, Atif M. %E Zelkowitz, Marvin V %X AbstractDemand for high‐quality Web applications continues to escalate as reliance on Web‐based software increases and Web systems become increasingly complex. Given the importance of quality and its impact on the user experience, a significant research effort has been invested in developing tools and methodologies that facilitate effective quality assurance for Web applications. Testing, in particular, provides a critical inroad toward meeting the quality demand by enabling developers to discover failures and anomalies in applications before they are released. In this survey, we discuss advances in Web testing and begin by exploring the peculiarities of Web applications that makes evaluating their correctness a challenge and the direct translation of conventional software engineering principles impractical in some cases. We then provide an overview of research contributions in three critical aspects of Web testing: deriving adequate Web application models, defining appropriate Web testing strategies, and conducting Web portability analysis. In short, models are used to capture Web application components, their attributes, and interconnections; testing strategies use the models to generate test cases; and portability analysis enables Web developers to ensure that their applications remain correct as they are launched in highly diverse configurations. %B Computer Performance IssuesComputer Performance Issues %I Elsevier %V Volume 75 %P 281 - 306 %8 2009/// %@ 0065-2458 %G eng %U http://www.sciencedirect.com/science/article/pii/S006524580800805X %0 Conference Paper %B Proceedings of the ACL-IJCNLP 2009 Conference Short Papers$}$ %D 2009 %T Arabic Cross-Document Coreference Resolution %A Sayeed,A. %A Elsayed,T. %A Garera,N. %A Alexander,D. %A Xu,T. %A Oard, Douglas %A Yarowsky,D. %A Piatko,C. %B Proceedings of the ACL-IJCNLP 2009 Conference Short Papers$}$ %P 357 - 360 %8 2009/// %G eng %0 Conference Paper %B Robotics and Automation, 2009. ICRA '09. IEEE International Conference on %D 2009 %T Assigning cameras to subjects in video surveillance systems %A El-Alfy,H. %A Jacobs, David W. %A Davis, Larry S. %K agent %K algorithm;multiple %K assignment;computation %K augmenting %K cameras;video %K cost %K detection;video %K graph;camera %K MATCHING %K matching;minimum %K matching;target %K path;bipartite %K reduction;maximum %K segment;video %K Surveillance %K surveillance; %K system;graph %K theory;image %K TIME %K tracking;obstacle %K tracking;video %K video %X We consider the problem of tracking multiple agents moving amongst obstacles, using multiple cameras. Given an environment with obstacles, and many people moving through it, we construct a separate narrow field of view video for as many people as possible, by stitching together video segments from multiple cameras over time. We employ a novel approach to assign cameras to people as a function of time, with camera switches when needed. The problem is modeled as a bipartite graph and the solution corresponds to a maximum matching. As people move, the solution is efficiently updated by computing an augmenting path rather than by solving for a new matching. This reduces computation time by an order of magnitude. In addition, solving for the shortest augmenting path minimizes the number of camera switches at each update. When not all people can be covered by the available cameras, we cluster as many people as possible into small groups, then assign cameras to groups using a minimum cost matching algorithm. We test our method using numerous runs from different simulators. %B Robotics and Automation, 2009. ICRA '09. IEEE International Conference on %P 837 - 843 %8 2009/05// %G eng %R 10.1109/ROBOT.2009.5152753 %0 Journal Article %J IMA Journal of Numerical Analysis %D 2009 %T Block-diagonal preconditioning for spectral stochastic finite-element systems %A Powell, C. E %A Elman, Howard %B IMA Journal of Numerical Analysis %V 29 %P 350 - 350 %8 2009/// %G eng %N 2 %0 Conference Paper %B 2009 16th IEEE International Conference on Image Processing (ICIP) %D 2009 %T Compressed sensing for Synthetic Aperture Radar imaging %A Patel, Vishal M. %A Easley,G. R %A Healy,D. M %A Chellapa, Rama %K Compressed sensing %K High-resolution imaging %K Image coding %K image resolution %K Optical imaging %K Radar antennas %K radar imaging %K Radar polarimetry %K Reflectivity %K SAR %K spatial distribution %K synthetic aperture radar %K synthetic aperture radar imaging %X In this paper, we introduce a new Synthetic Aperture Radar (SAR) imaging modality that provides a high resolution map of the spatial distribution of targets and terrain based on a significant reduction in the number of transmitted and/or received electromagnetic waveforms. This new imaging scheme, which requires no new hardware components, allows the aperture to be compressed and presents many important applications and advantages among which include resolving ambiguities, strong resistance to countermeasures and interception, and reduced on-board storage constraints. %B 2009 16th IEEE International Conference on Image Processing (ICIP) %I IEEE %P 2141 - 2144 %8 2009/11// %@ 978-1-4244-5653-6 %G eng %R 10.1109/ICIP.2009.5414307 %0 Conference Paper %B SIGCHI '09 %D 2009 %T Computer Help at Home: Methods and Motivations for Informal Technical Support %A Poole, Erika Shehan %A Marshini Chetty %A Morgan, Tom %A Grinter, Rebecca E. %A Edwards, W. Keith %K help-giving %K help-seeking %K Home computing %K identity management %K social networks %X 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's personal identity as a computer expert and accountability to one'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. %B SIGCHI '09 %S CHI '09 %I ACM %P 739 - 748 %8 2009/// %@ 978-1-60558-246-7 %G eng %U http://doi.acm.org/10.1145/1518701.1518816 %0 Conference Paper %B Image Processing (ICIP), 2009 16th IEEE International Conference on %D 2009 %T Concurrent transition and shot detection in football videos using Fuzzy Logic %A Refaey,M.A. %A Elsayed,K.M. %A Hanafy,S.M. %A Davis, Larry S. %K analysis;inference %K boundary;shot %K Color %K colour %K detection;sports %K functions;shot %K histogram;concurrent %K logic;image %K logic;inference %K mechanism;intensity %K mechanisms;sport;video %K processing; %K processing;videonanalysis;fuzzy %K signal %K transition;edgeness;football %K variance;membership %K video;video %K videos;fuzzy %X Shot detection is a fundamental step in video processing and analysis that should be achieved with high degree of accuracy. In this paper, we introduce a unified algorithm for shot detection in sports video using fuzzy logic as a powerful inference mechanism. Fuzzy logic overcomes the problems of hard cut thresholds and the need to large training data used in previous work. The proposed algorithm integrates many features like color histogram, edgeness, intensity variance, etc. Membership functions to represent different features and transitions between shots have been developed to detect different shot boundary and transition types. We address the detection of cut, fade, dissolve, and wipe shot transitions. The results show that our algorithm achieves high degree of accuracy. %B Image Processing (ICIP), 2009 16th IEEE International Conference on %P 4341 - 4344 %8 2009/11// %G eng %R 10.1109/ICIP.2009.5413648 %0 Conference Paper %B AAAI Spring Symposium on Learning by Reading and Learning to Read %D 2009 %T Cross-document coreference resolution: A key technology for learning by reading %A Mayfield,J. %A Alexander,D. %A Dorr, Bonnie J %A Eisner,J. %A Elsayed,T. %A Finin,T. %A Fink,C. %A Freedman,M. %A Garera,N. %A McNamee,P. %A others %B AAAI Spring Symposium on Learning by Reading and Learning to Read %8 2009/// %G eng %0 Journal Article %J Genome Biology %D 2009 %T CTCF binding site classes exhibit distinct evolutionary, genomic, epigenomic and transcriptomic features %A Essien,Kobby %A Vigneau,Sebastien %A Apreleva,Sofia %A Singh,Larry N. %A Bartolomei,Marisa S. %A Hannenhalli, Sridhar %X CTCF (CCCTC-binding factor) is an evolutionarily conserved zinc finger protein involved in diverse functions ranging from negative regulation of MYC, to chromatin insulation of the beta-globin gene cluster, to imprinting of the Igf2 locus. The 11 zinc fingers of CTCF are known to differentially contribute to the CTCF-DNA interaction at different binding sites. It is possible that the differences in CTCF-DNA conformation at different binding sites underlie CTCF's functional diversity. If so, the CTCF binding sites may belong to distinct classes, each compatible with a specific functional role. %B Genome Biology %V 10 %P R131 - R131 %8 2009/11/18/ %@ 1465-6906 %G eng %U http://genomebiology.com/2009/10/11/R131 %N 11 %R 10.1186/gb-2009-10-11-r131 %0 Conference Paper %B CCS '09 Proceedings of the 16th ACM Conference on Computer and Communications Security %D 2009 %T Dynamic Provable Data Possession %A Erway, Chris %A Küp\ccü, Alptekin %A Charalampos Papamanthou %A Tamassia, Roberto %K authenticated data structures %K Authentication %K integrity checking %K outsourced storage %K proof of retrievability %K provable data possession %K skip list %X We consider the problem of efficiently proving the integrity of data stored at untrusted servers. In the provable data possession (PDP) model, the client preprocesses the data and then sends it to an untrusted server for storage, while keeping a small amount of meta-data. The client later asks the server to prove that the stored data has not been tampered with or deleted (without downloading the actual data). However, the original PDP scheme applies only to static (or append-only) files. We present a definitional framework and efficient constructions for dynamic provable data possession (DPDP), which extends the PDP model to support provable updates to stored data. We use a new version of authenticated dictionaries based on rank information. The price of dynamic updates is a performance change from O(1) to O(logn) (or O(nεlog n), for a file consisting of n blocks, while maintaining the same (or better, respectively) probability of misbehavior detection. Our experiments show that this slowdown is very low in practice (e.g. 415KB proof size and 30ms computational overhead for a 1GB file). We also show how to apply our DPDP scheme to outsourced file systems and version control systems (e.g. CVS). %B CCS '09 Proceedings of the 16th ACM Conference on Computer and Communications Security %S CCS '09 %I ACM %P 213 - 222 %8 2009/// %@ 978-1-60558-894-0 %G eng %U http://doi.acm.org/10.1145/1653662.1653688 %0 Conference Paper %B Image Processing (ICIP), 2009 16th IEEE International Conference on %D 2009 %T Enhancing sparsity using gradients for compressive sensing %A Patel, Vishal M. %A Easley,G. R %A Chellapa, Rama %A Healy,D. M %K analysis;gradient %K domain;compressive %K domain;image %K Fourier %K generalized %K measurement %K methods; %K methods;image %K Poisson %K reconstruction;image %K reconstruction;partial %K representation;Fourier %K representation;sampling %K samples;robust %K scenarios;sparse %K sensing;enhancing %K solver;sampling %K sparsity;gradient %X In this paper, we propose a reconstruction method that recovers images assumed to have a sparse representation in a gradient domain by using partial measurement samples that are collected in the Fourier domain. A key improvement of this technique is that it makes use of a robust generalized Poisson solver that greatly aids in achieving a significantly improved performance over similar proposed methods. Experiments provided also demonstrate that this new technique is more flexible to work with either random or restricted sampling scenarios better than its competitors. %B Image Processing (ICIP), 2009 16th IEEE International Conference on %P 3033 - 3036 %8 2009/11// %G eng %R 10.1109/ICIP.2009.5414411 %0 Journal Article %J Sci Transl Med %D 2009 %T Extreme polymorphism in a vaccine antigen and risk of clinical malaria: implications for vaccine development %A Takala,S. L %A Coulibaly,D. %A Thera,M. A %A Batchelor,A. H %A Cummings, Michael P. %A Escalante,A. A %A Ouattara,A. %A Traoré,K. %A Niangaly,A. %A Djimdé,A. A %A Doumbo,OK %A Plowe,CV %X Vaccines directed against the blood stages of Plasmodium falciparum malaria are intended to prevent the parasite from invading and replicating within host cells. No blood-stage malaria vaccine has shown clinical efficacy in humans. Most malaria vaccine antigens are parasite surface proteins that have evolved extensive genetic diversity, and this diversity could allow malaria parasites to escape vaccine-induced immunity. We examined the extent and within-host dynamics of genetic diversity in the blood-stage malaria vaccine antigen apical membrane antigen-1 in a longitudinal study in Mali. Two hundred and fourteen unique apical membrane antigen-1 haplotypes were identified among 506 human infections, and amino acid changes near a putative invasion machinery binding site were strongly associated with the development of clinical symptoms, suggesting that these residues may be important to consider in designing polyvalent apical membrane antigen-1 vaccines and in assessing vaccine efficacy in field trials. This extreme diversity may pose a serious obstacle to an effective polyvalent recombinant subunit apical membrane antigen-1 vaccine. %B Sci Transl Med %V 1 %P 2ra5 - 2ra5 %8 2009/10// %G eng %N 2 %R 10.1126/scitranslmed.3000257 %0 Journal Article %J Proceedings of HLT-NAACL %D 2009 %T Generating surveys of scientific paradigms %A Mohammad,S. %A Dorr, Bonnie J %A Egan,M. %A Hassan,A. %A Muthukrishan,P. %A Qazvinian,V. %A Radev,D. %A Zajic, David %X The number of research publications in var-ious disciplines is growing exponentially. Researchers and scientists are increasingly finding themselves in the position of having to quickly understand large amounts of tech- nical material. In this paper we present the first steps in producing an automatically gen- erated, readily consumable, technical survey. Specifically we explore the combination of citation information and summarization tech- niques. Even though prior work (Teufel et al., 2006) argues that citation text is unsuitable for summarization, we show that in the frame- work of multi-document survey creation, cita- tion texts can play a crucial role. %B Proceedings of HLT-NAACL %8 2009/// %G eng %0 Journal Article %J ACM Trans. Comput.-Hum. Interact. %D 2009 %T The Ins and Outs of Home Networking: The Case for Useful and Usable Domestic Networking %A Grinter, Rebecca E. %A Edwards, W. Keith %A Marshini Chetty %A Poole, Erika S. %A Sung, Ja-Young %A Yang, Jeonghwa %A Crabtree, Andy %A Tolmie, Peter %A Rodden, Tom %A Greenhalgh, Chris %A Benford, Steve %K home networking %K Human computer interaction %X 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 “work to make the home network work” 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. %B ACM Trans. Comput.-Hum. Interact. %V 16 %P 8:1 - 8:28 %8 2009/06// %@ 1073-0516 %G eng %U http://doi.acm.org/10.1145/1534903.1534905 %N 2 %0 Conference Paper %B Proceedings of SPIE %D 2009 %T Inverse halftoning using a shearlet representation %A Easley,G. R %A Patel, Vishal M. %A Healy Jr,D.M. %B Proceedings of SPIE %V 7446 %P 74460C - 74460C %8 2009/// %G eng %0 Patent %D 2009 %T Method and system for optimal data diagnosis %A V.S. Subrahmanian %A Ernst,Jason %E University of Maryland %X In the method and system for automated data diagnosis, a relational data base is formed of attributes characterizing an entity. The framework computes optimal diagnosis for a diagnostic inference problem which separates the desirable attributes from the undesirable attributes. The user of the system is permitted to specify certain parameters based on which the system computes a set of optimal or near optimal association rules between the attributes of a specific process, product, or other entity. The system and method of the present invention considers the simplicity of conditions in addition to support and confidence when ordering them, contributes the notion of tight conditions and semi-equivalence to remove redundant rules, uses the concept of the top fringes which allows near optimal conditions to be found, in addition to optimal conditions. Numeric as well as non-numeric attributes can be analyzed. %V 10/774,516 %8 2009/01/06/ %G eng %U http://www.google.com/patents?id=fHnVAAAAEBAJ %N 7474987 %0 Conference Paper %B Proceedings of the 9th international conference on Algorithms in bioinformatics %D 2009 %T Mimosa: mixture model of co-expression to detect modulators of regulatory interaction %A Hansen,Matthew %A Everett,Logan %A Singh,Larry %A Hannenhalli, Sridhar %X Functionally related genes tend to be correlated in their expression patterns across multiple conditions and/or tissue-types. Thus co-expression networks are often used to investigate functional groups of genes. In particular, when one of the genes is a transcription factor (TF), the co-expression-based interaction is interpreted, with caution, as a direct regulatory interaction. However, any particular TF, and more importantly, any particular regulatory interaction, is likely to be active only in a subset of experimental conditions. Moreover, the subset of expression samples where the regulatory interaction holds may be marked by presence or absence of a modifier gene, such as an enzyme that post-translationally modifies the TF. Such subtlety of regulatory interactions is overlooked when one computes an overall expression correlation. Here we present a novel mixture modeling approach where a TF-Gene pair is presumed to be significantly correlated (with unknown coefficient) in a (unknown) subset of expression samples. The parameters of the model are estimated using a Maximum Likelihood approach. The estimated mixture of expression samples is then mined to identify genes potentially modulating the TF-Gene interaction. We have validated our approach using synthetic data and on three biological cases in cow and in yeast. While limited in some ways, as discussed, the work represents a novel approach to mine expression data and detect potential modulators of regulatory interactions. %B Proceedings of the 9th international conference on Algorithms in bioinformatics %S WABI'09 %I Springer-Verlag %C Berlin, Heidelberg %P 133 - 144 %8 2009/// %@ 3-642-04240-6, 978-3-642-04240-9 %G eng %U http://dl.acm.org/citation.cfm?id=1812906.1812918 %0 Conference Paper %B Proceedings of the 18th international conference on World wide web %D 2009 %T Network-aware forward caching %A Erman,Jeffrey %A Gerber,Alexandre %A Hajiaghayi, Mohammad T. %A Pei,Dan %A Spatscheck,Oliver %K caching %K Web %X 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. %B Proceedings of the 18th international conference on World wide web %S WWW '09 %I ACM %C New York, NY, USA %P 291 - 300 %8 2009/// %@ 978-1-60558-487-4 %G eng %U http://doi.acm.org/10.1145/1526709.1526749 %R 10.1145/1526709.1526749 %0 Journal Article %J Relation %D 2009 %T Pairwise Document Similarity in Large Collections with MapReduce %A Elsayed,T. %A Jimmy Lin %A Oard, Douglas %B Relation %V 10 %P 8372 - 8372 %8 2009/// %G eng %N 1.91 %0 Journal Article %J Molecular biology and evolution %D 2009 %T A phylogenetic mixture model for the evolution of gene expression %A Eng,K. H %A Corrada Bravo, Hector %A Keleş,S. %B Molecular biology and evolution %V 26 %P 2363 - 2363 %8 2009/// %G eng %N 10 %0 Journal Article %J Nucleic Acids ResearchNucleic Acids Research %D 2009 %T PTM-Switchboard--a database of posttranslational modifications of transcription factors, the mediating enzymes and target genes %A Everett,L. %A Vo,A. %A Hannenhalli, Sridhar %B Nucleic Acids ResearchNucleic Acids Research %V 37 %P D66-D71 - D66-D71 %8 2009/01// %@ 0305-1048 %G eng %U http://nar.oxfordjournals.org/content/37/suppl_1/D66.short %N Database %R 10.1093/nar/gkn731 %0 Conference Proceedings %B Proc. CHI Workshop on Defining the Role of HCI in the Challenge of Sustainability %D 2009 %T Sensing opportunities for personalized feedback technology to reduce consumption %A Jon Froehlich %A Everitt,K. %A Fogarty,J. %A Patel,S. %A Landay,J. %B Proc. CHI Workshop on Defining the Role of HCI in the Challenge of Sustainability %8 2009 %G eng %0 Journal Article %J Applied and Environmental MicrobiologyAppl. Environ. Microbiol. %D 2009 %T Serogroup, Virulence, and Genetic Traits of Vibrio Parahaemolyticus in the Estuarine Ecosystem of Bangladesh %A Alam,Munirul %A Chowdhury,Wasimul B. %A Bhuiyan,N. A. %A Islam,Atiqul %A Hasan,Nur A. %A Nair,G. Balakrish %A Watanabe,H. %A Siddique,A. K. %A Huq,Anwar %A Sack,R. Bradley %A Akhter,M. Z. %A Grim,Christopher J. %A Kam,K.-M. %A Luey,C. K. Y. %A Endtz,Hubert P. %A Cravioto,Alejandro %A Rita R Colwell %X 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., “clonal cluster,” 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. %B Applied and Environmental MicrobiologyAppl. Environ. Microbiol. %V 75 %P 6268 - 6274 %8 2009/10/01/ %@ 0099-2240, 1098-5336 %G eng %U http://aem.asm.org/content/75/19/6268 %N 19 %R 10.1128/AEM.00266-09 %0 Conference Paper %B Data Mining Workshops, 2009. ICDMW '09. IEEE International Conference on %D 2009 %T Set-Based Boosting for Instance-Level Transfer %A Eaton,Eric %A desJardins, Marie %X The success of transfer to improve learning on a target task is highly dependent on the selected source data. Instance-based transfer methods reuse data from the source tasks to augment the training data for the target task. If poorly chosen, this source data may inhibit learning, resulting in negative transfer. The current best performing algorithm for instance-based transfer, TrAdaBoost, performs poorly when given irrelevant source data. We present a novel set-based boosting technique for instance-based transfer. The proposed algorithm, TransferBoost, boosts both individual instances and collective sets of instances from each source task. In effect, TransferBoost boosts each source task, assigning higher weight to those source tasks which show positive transferability to the target task, and then adjusts the weights of the instances within each source task via AdaBoost. The results demonstrate that TransferBoost significantly improves transfer performance over existing instance-based algorithms when given a mix of relevant and irrelevant source data. %B Data Mining Workshops, 2009. ICDMW '09. IEEE International Conference on %I IEEE %P 422 - 428 %8 2009/12// %@ 978-1-4244-5384-9 %G eng %U http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=5360442&tag=1 %R 10.1109/ICDMW.2009.97 %0 Journal Article %J IEEE Transactions on Image Processing %D 2009 %T Shearlet-Based Deconvolution %A Patel, Vishal M. %A Easley,G. R %A Healy,D. M %K approximation inversion operator %K contourlets %K curvelets %K Deconvolution %K distributed discontinuities %K generalized cross validation %K image restoration %K M-channel implementation %K shearlet-based deconvolution %K shearlets %K Wavelet transforms %K wavelets %X In this paper, a new type of deconvolution algorithm is proposed that is based on estimating the image from a shearlet decomposition. Shearlets provide a multidirectional and multiscale decomposition that has been mathematically shown to represent distributed discontinuities such as edges better than traditional wavelets. Constructions such as curvelets and contourlets share similar properties, yet their implementations are significantly different from that of shearlets. Taking advantage of unique properties of a new M-channel implementation of the shearlet transform, we develop an algorithm that allows for the approximation inversion operator to be controlled on a multiscale and multidirectional basis. A key improvement over closely related approaches such as ForWaRD is the automatic determination of the threshold values for the noise shrinkage for each scale and direction without explicit knowledge of the noise variance using a generalized cross validation (GCV). Various tests show that this method can perform significantly better than many competitive deconvolution algorithms. %B IEEE Transactions on Image Processing %V 18 %P 2673 - 2685 %8 2009/12// %@ 1057-7149 %G eng %N 12 %R 10.1109/TIP.2009.2029594 %0 Journal Article %J Molecular Cell %D 2009 %T Structure of the S5a:K48-Linked Diubiquitin Complex and Its Interactions with Rpn13 %A Zhang,Naixia %A Wang,Qinghua %A Ehlinger,Aaron %A Randles,Leah %A Lary,Jeffrey W. %A Kang,Yang %A Haririnia,Aydin %A Storaska,Andrew J. %A Cole,James L. %A Fushman, David %A Walters,Kylie J. %K Proteins %X SummaryDegradation by the proteasome typically requires substrate ubiquitination. Two ubiquitin receptors exist in the proteasome, S5a/Rpn10 and Rpn13. Whereas Rpn13 has only one ubiquitin-binding surface, S5a binds ubiquitin with two independent ubiquitin-interacting motifs (UIMs). Here, we use nuclear magnetic resonance (NMR) and analytical ultracentrifugation to define at atomic level resolution how S5a binds K48-linked diubiquitin, in which K48 of one ubiquitin subunit (the “proximal” one) is covalently bonded to G76 of the other (the “distal” subunit). We demonstrate that S5a's UIMs bind the two subunits simultaneously with a preference for UIM2 binding to the proximal subunit while UIM1 binds to the distal one. In addition, NMR experiments reveal that Rpn13 and S5a bind K48-linked diubiquitin simultaneously with subunit specificity, and a model structure of S5a and Rpn13 bound to K48-linked polyubiquitin is provided. Altogether, our data demonstrate that S5a is highly adaptive and cooperative toward binding ubiquitin chains. %B Molecular Cell %V 35 %P 280 - 290 %8 2009/08/14/ %@ 1097-2765 %G eng %U http://www.sciencedirect.com/science/article/pii/S1097276509004018 %N 3 %R 10.1016/j.molcel.2009.06.010 %0 Journal Article %J BMC Evol Biol %D 2009 %T Toward reconstructing the evolution of advanced moths and butterflies (Lepidoptera: Ditrysia): an initial molecular study %A Regier,J. C %A Zwick,A. %A Cummings, Michael P. %A Kawahara,A. Y %A Cho,S. %A Weller,S. %A Roe,A. %A Baixeras,J. %A Brown,J. W %A Parr,C. %A Davis,DR %A Epstein,M %A Hallwachs,W %A Hausmann,A %A Janzen,DH %A Kitching,IJ %A Solis,MA %A Yen,S-H %A Bazinet,A. L %A Mitter,C %X BACKGROUND: In the mega-diverse insect order Lepidoptera (butterflies and moths; 165,000 described species), deeper relationships are little understood within the clade Ditrysia, to which 98% of the species belong. To begin addressing this problem, we tested the ability of five protein-coding nuclear genes (6.7 kb total), and character subsets therein, to resolve relationships among 123 species representing 27 (of 33) superfamilies and 55 (of 100) families of Ditrysia under maximum likelihood analysis. RESULTS: Our trees show broad concordance with previous morphological hypotheses of ditrysian phylogeny, although most relationships among superfamilies are weakly supported. There are also notable surprises, such as a consistently closer relationship of Pyraloidea than of butterflies to most Macrolepidoptera. Monophyly is significantly rejected by one or more character sets for the putative clades Macrolepidoptera as currently defined (P < 0.05) and Macrolepidoptera excluding Noctuoidea and Bombycoidea sensu lato (P < or = 0.005), and nearly so for the superfamily Drepanoidea as currently defined (P < 0.08). Superfamilies are typically recovered or nearly so, but usually without strong support. Relationships within superfamilies and families, however, are often robustly resolved. We provide some of the first strong molecular evidence on deeper splits within Pyraloidea, Tortricoidea, Geometroidea, Noctuoidea and others.Separate analyses of mostly synonymous versus non-synonymous character sets revealed notable differences (though not strong conflict), including a marked influence of compositional heterogeneity on apparent signal in the third codon position (nt3). As available model partitioning methods cannot correct for this variation, we assessed overall phylogeny resolution through separate examination of trees from each character set. Exploration of "tree space" with GARLI, using grid computing, showed that hundreds of searches are typically needed to find the best-feasible phylogeny estimate for these data. CONCLUSION: Our results (a) corroborate the broad outlines of the current working phylogenetic hypothesis for Ditrysia, (b) demonstrate that some prominent features of that hypothesis, including the position of the butterflies, need revision, and (c) resolve the majority of family and subfamily relationships within superfamilies as thus far sampled. Much further gene and taxon sampling will be needed, however, to strongly resolve individual deeper nodes. %B BMC Evol Biol %V 9 %P 280 - 280 %8 2009/// %G eng %R 10.1186/1471-2148-9-280 %0 Conference Paper %B Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics %D 2009 %T Using citations to generate surveys of scientific paradigms %A Mohammad,Saif %A Dorr, Bonnie J %A Egan,Melissa %A Hassan,Ahmed %A Muthukrishan,Pradeep %A Qazvinian,Vahed %A Radev,Dragomir %A Zajic, David %X The number of research publications in various disciplines is growing exponentially. Researchers and scientists are increasingly finding themselves in the position of having to quickly understand large amounts of technical material. In this paper we present the first steps in producing an automatically generated, readily consumable, technical survey. Specifically we explore the combination of citation information and summarization techniques. Even though prior work (Teufel et al., 2006) argues that citation text is unsuitable for summarization, we show that in the framework of multi-document survey creation, citation texts can play a crucial role. %B Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics %S NAACL '09 %I Association for Computational Linguistics %C Stroudsburg, PA, USA %P 584 - 592 %8 2009/// %@ 978-1-932432-41-1 %G eng %U http://dl.acm.org/citation.cfm?id=1620754.1620839 %0 Journal Article %J AI Magazine %D 2008 %T Collective Classification in Network Data %A Sen,Prithviraj %A Namata,Galileo %A Bilgic,Mustafa %A Getoor, Lise %A Galligher,Brian %A Eliassi-Rad,Tina %X Collective Classification in Network Data %B AI Magazine %V 29 %P 93 - 93 %8 2008/09/06/ %@ 0738-4602 %G eng %U http://www.aaai.org/ojs/index.php/aimagazine/article/viewArticle/2157 %N 3 %R 10.1609/aimag.v29i3.2157 %0 Journal Article %J PLoS ONEPLoS ONE %D 2008 %T Computational Analysis of Constraints on Noncoding Regions, Coding Regions and Gene Expression in Relation to Plasmodium Phenotypic Diversity %A Essien,Kobby %A Hannenhalli, Sridhar %A Stoeckert,Christian J. %X Malaria-causing Plasmodium species exhibit marked differences including host choice and preference for invading particular cell types. The genetic bases of phenotypic differences between parasites can be understood, in part, by investigating constraints on gene expression and genic sequences, both coding and regulatory.We investigated the evolutionary constraints on sequence and expression of parasitic genes by applying comparative genomics approaches to 6 Plasmodium genomes and 2 genome-wide expression studies. We found that the coding regions of Plasmodium transcription factor and sexual development genes are relatively less constrained, as are those of genes encoding CCCH zinc fingers and invasion proteins, which all play important roles in these parasites. Transcription factors and genes with stage-restricted expression have conserved upstream regions and so do several gene classes critical to the parasite's lifestyle, namely, ion transport, invasion, chromatin assembly and CCCH zinc fingers. Additionally, a cross-species comparison of expression patterns revealed that Plasmodium-specific genes exhibit significant expression divergence. Overall, constraints on Plasmodium's protein coding regions confirm observations from other eukaryotes in that transcription factors are under relatively lower constraint. Proteins relevant to the parasite's unique lifestyle also have lower constraint on their coding regions. Greater conservation between Plasmodium species in terms of promoter motifs suggests tight regulatory control of lifestyle genes. However, an interspecies divergence in expression patterns of these genes suggests that either expression is controlled via genomic or epigenomic features not encoded in the proximal promoter sequence, or alternatively, the combinatorial interactions between motifs confer species-specific expression patterns. %B PLoS ONEPLoS ONE %V 3 %P e3122 - e3122 %8 2008/// %G eng %U UR - http://dx.doi.org/10.1371/journal.pone.0003122,http://dx.doi.org/10.1371/journal.pone.0003122 %N 9 %R 10.1371/journal.pone.0003122 %0 Journal Article %J CONVERGENCE %D 2008 %T Convergence analysis of iterative solvers in inexact Rayleigh quotient iteration %A Xue, F. %A Elman, Howard %B CONVERGENCE %V 31 %P 877 - 899 %8 2008/// %G eng %N 3 %0 Report %D 2008 %T CrossTalk: The Journal of Defense Software Engineering. Volume 21, Number 10, October 2008 %A Basili, Victor R. %A Dangle,K. %A Esker,L. %A Marotta,F. %A Rus,I. %A Brosgol,B. M %A Jamin,S. %A Arthur,J. D %A Ravichandar,R. %A Wisnosky,D. E %I DTIC Document %8 2008/// %G eng %0 Report %D 2008 %T Estimating Tree-Structured Covariance Matrices via Mixed-Integer Programming with an Application to Phylogenetic Analysis of Gene Expression %A Corrada Bravo, Hector %A Eng,K. H %A Keles,S. %A Wahba,G. %A Wright,S. %X We present a novel method for estimating tree-structured covariance matrices directly fromobserved continuous data. A representation of these classes of matrices as linear combinations of rank-one matrices indicating object partitions is used to formulate estimation as instances of well-studied numerical optimization problems. In particular, we present estimation based on projection where the covariance estimate is the nearest tree-structured covariance matrix to an observed sample covariance matrix. The problem is posed as a linear or quadratic mixed-integer program (MIP) where a setting of the integer variables in the MIP specifies a set of tree topologies of the structured covariance matrix. We solve these problems to optimality using efficient and robust existing MIP solvers. We also show that the least squares distance method of Fitch and Margoliash (1967) can be formulated as a quadratic MIP and thus solved exactly using existing, robust branch-and-bound MIP solvers. Our motivation for this method is the discovery of phylogenetic structure directly from gene expression data. Recent studies have adapted traditional phylogenetic comparative anal- ysis methods to expression data. Typically, these methods first estimate a phylogenetic tree from genomic sequence data and subsequently analyze expression data. A covariance matrix constructed from the sequence-derived tree is used to correct for the lack of independence in phy- logenetically related taxa. However, recent results have shown that the hierarchical structure of sequence-derived tree estimates are highly sensitive to the genomic region chosen to build them. To circumvent this difficulty, we propose a stable method for deriving tree-structured covariance matrices directly from gene expression as an exploratory step that can guide investigators in their modelling choices for these types of comparative analysis. We present a case study in phylogenetic analysis of expression in yeast gene families. Our method is able to corroborate the presence of phylogenetic structure in the response of expression in a subset of the gene families under particular experimental conditions. Additionally, when used in conjunction with transcription factor occupancy data, our methods show that alternative modelling choices should be considered when creating sequence-derived trees for this comparative analysis. %I Department of Statistics, University of Wisconsin %V 1142 %8 2008/// %G eng %0 Report %D 2008 %T H (div) preconditioning for a mixed finite element formulation of the stochastic diffusion problem %A Elman, Howard %A Furnival, D. G %A Powell, C. E %I Citeseer %8 2008/// %G eng %0 Report %D 2008 %T Measures and Risk Indicators for Early Insight into Software Safety. Development of Fault-Tolerant Systems %A Basili, Victor R. %A Marotta,Frank %A Dangle,Kathleen %A Esker,Linda %A Rus,Ioana %K *SOFTWARE ENGINEERING %K *SYSTEM SAFETY %K COMPUTER PROGRAMMING AND SOFTWARE %K fault tolerant computing %K INDICATORS %K measurement %K REPRINTS %K risk %K SAFETY ENGINEERING %X Software contributes an ever-increasing level of functionality and control in today's systems. This increased use of software can dramatically increase the complexity and time needed to evaluate the safety of a system. Although the actual system safety cannot be verified during its development, measures can reveal early insights into potential safety problems and risks. An approach for developing early software safety measures is presented in this article. The approach and the example software measures presented are based on experience working with the safety engineering group on a large Department of Defense program. %I ABERDEEN TEST CENTER MD %8 2008/10// %G eng %U http://stinet.dtic.mil/oai/oai?&verb=getRecord&metadataPrefix=html&identifier=ADA487120 %0 Patent %D 2008 %T Method and System for Detecting and Responding to Attacking Networks %A Dagon,David %A Feamster, Nick %A Lee,Weake %A Edmonds,Robert %A Lipton,Richard %A Ramachandran,Anirudh %E Damballa, Inc. %X A system and method for detecting a first network of compromised computers in a second network of computers, comprising: collecting Domain Name System (DNS) data for the second network; examining the collected data relative to DNS data from known comprised and/or uncompromised computers in the second network; and determining the existence of the first network and/or the identity of compromised computers in the second network based on the examination. %V 11/538,212 %8 2008/01/31/ %G eng %U http://www.google.com/patents?id=TYunAAAAEBAJ %0 Book Section %B Machine Learning and Knowledge Discovery in DatabasesMachine Learning and Knowledge Discovery in Databases %D 2008 %T Modeling Transfer Relationships Between Learning Tasks for Improved Inductive Transfer %A Eaton,Eric %A desJardins, Marie %A Lane,Terran %E Daelemans,Walter %E Goethals,Bart %E Morik,Katharina %X In this paper, we propose a novel graph-based method for knowledge transfer. We model the transfer relationships between source tasks by embedding the set of learned source models in a graph using transferability as the metric. Transfer to a new problem proceeds by mapping the problem into the graph, then learning a function on this graph that automatically determines the parameters to transfer to the new learning task. This method is analogous to inductive transfer along a manifold that captures the transfer relationships between the tasks. We demonstrate improved transfer performance using this method against existing approaches in several real-world domains. %B Machine Learning and Knowledge Discovery in DatabasesMachine Learning and Knowledge Discovery in Databases %S Lecture Notes in Computer Science %I Springer Berlin / Heidelberg %V 5211 %P 317 - 332 %8 2008/// %@ 978-3-540-87478-2 %G eng %U http://dx.doi.org/10.1007/978-3-540-87479-9_39 %0 Conference Paper %B Proceedings of the 7th ACM conference on Designing interactive systems %D 2008 %T More Than Meets the Eye: Transforming the User Experience of Home Network Management %A Poole, Erika Shehan %A Marshini Chetty %A Grinter, Rebecca E. %A Edwards, W. Keith %K home networks %K sketching %K troubleshooting %X As computing migrates from the workplace to the home, householders must tackle problems of home network maintenance. Often they lack the technical knowledge or motivation to complete these tasks, making the user experience of home network maintenance frustrating. In response to these difficulties, many householders rely on handwritten reminders or interactive networking tools that are ill-suited for the home environment. In this paper, we seek to understand how to design better home network management tools through a study of sketches created by 40 people in 18 households. In our study, we obtained information about householders' knowledge, practices and needs with respect to home networking. Based on our results, we present guidelines for transforming the user experience of home network management. %B Proceedings of the 7th ACM conference on Designing interactive systems %S DIS '08 %I ACM %P 455 - 464 %8 2008/// %@ 978-1-60558-002-9 %G eng %U http://doi.acm.org/10.1145/1394445.1394494 %0 Journal Article %J Proceedings of the Text Analysis Conference (TAC-2008), Gaithersburg, MD %D 2008 %T Multiple alternative sentence compressions and word-pair antonymy for automatic text summarization and recognizing textual entailment %A Mohammad,S. %A Dorr, Bonnie J %A Egan,M. %A Jimmy Lin %A Zajic, David %X The University of Maryland participatedin three tasks organized by the Text Anal- ysis Conference 2008 (TAC 2008): (1) the update task of text summarization; (2) the opinion task of text summariza- tion; and (3) recognizing textual entail- ment (RTE). At the heart of our summa- rization system is Trimmer, which gener- ates multiple alternative compressed ver- sions of the source sentences that act as candidate sentences for inclusion in the summary. For the first time, we investi- gated the use of automatically generated antonym pairs for both text summariza- tion and recognizing textual entailment. We used an antonymy feature in both the opinion summarization task and for rec- ognizing textual entailment. More coher- ent summaries resulted when using the antonymy feature as compared to when not using it. However, performance on ROUGE dropped. The RTE system per- formed almost equally well when using antonyms from WordNet and when using automatically generated antonyms. %B Proceedings of the Text Analysis Conference (TAC-2008), Gaithersburg, MD %8 2008/// %G eng %0 Conference Paper %B 15th IEEE International Conference on Image Processing, 2008. ICIP 2008 %D 2008 %T A new multiresolution generalized directional filter bank design and application in image enhancement %A Patel, Vishal M. %A Easley,G. R %A Healy,D. M %K Algorithm design and analysis %K Approximation error %K Channel bank filters %K contourlet transform %K Design methodology %K Discrete transforms %K Feature extraction %K Filter bank %K Frequency %K geometric feature extraction %K Image Enhancement %K IMAGE PROCESSING %K image resolution %K image restoration %K Multidimensional digital filters %K Multidimensional systems %K multiresolution generalized directional filter bank design %K shearlet transform %K shift-invariant overcomplete representation %K transforms %K Wavelet transforms %X In this paper, we present an image enhancement technique based on a new multiscale generalized directional filter bank design. The design presented is a shift-invariant overcomplete representation, which is well suited to extracting geometric features such as edges. Special cases of this design method can be made to reduce to different and improved implementations of the shearlet and the contourlet transforms, which are known to represent certain classes of images optimally. Use of this new filter bank design has proven itself competitive in image restoration for noisy images and is well suited for distinguishing noise from weak edges. Experimental results show that our unique image enhancement technique out-performs wavelet and contourlet based enhancement methods. %B 15th IEEE International Conference on Image Processing, 2008. ICIP 2008 %I IEEE %P 2816 - 2819 %8 2008/10// %@ 978-1-4244-1765-0 %G eng %R 10.1109/ICIP.2008.4712380 %0 Journal Article %J SIGCOMM Comput. Commun. Rev. %D 2008 %T Path splicing %A Motiwala,Murtaza %A Elmore,Megan %A Feamster, Nick %A Vempala,Santosh %K multi-path routing %K path diversity %K path splicing %X We present path splicing, a new routing primitive that allows network paths to be constructed by combining multiple routing trees ("slices") to each destination over a single network topology. Path splicing allows traffic to switch trees at any hop en route to the destination. End systems can change the path on which traffic is forwarded by changing a small number of additional bits in the packet header. We evaluate path splicing for intradomain routing using slices generated from perturbed link weights and find that splicing achieves reliability that approaches the best possible using a small number of slices, for only a small increase in latency and no adverse effects on traffic in the network. In the case of interdomain routing, where splicing derives multiple trees from edges in alternate backup routes, path splicing achieves near-optimal reliability and can provide significant benefits even when only a fraction of ASes deploy it. We also describe several other applications of path splicing, as well as various possible deployment paths. %B SIGCOMM Comput. Commun. Rev. %V 38 %P 27 - 38 %8 2008/08// %@ 0146-4833 %G eng %U http://doi.acm.org/10.1145/1402946.1402963 %N 4 %R 10.1145/1402946.1402963 %0 Journal Article %J Relation %D 2008 %T Position Paper: Improving Browsing Environment Compliance Evaluations for Websites %A Eaton,C. %A Memon, Atif M. %X Though it would be ideal for web pages to render and function con-sistently across heterogeneous browsing environments, the browser, browser version, and operating system used to navigate and interact with web content is known to have a significant impact on the subsequent level of user accessibil- ity. While research endeavors directed toward improving web accessibility have generally focused on addressing usability issues for individuals with physical limitations, providing accessible information and services for the en- tire web population also encompasses addressing the limitations of devices and platforms used to deploy web pages. We propose that more research be in- vested in the latter issue to facilitate the development of effective tools for de- tecting browsing environment influenced usability issues before inaccessible pages are released in the field. %B Relation %V 10 %P 6113 - 6113 %8 2008/// %G eng %N 1.14 %0 Conference Paper %B Association for Computational Linguistics (ACL) %D 2008 %T Resolving personal names in email using context expansion %A Elsayed,T. %A Oard, Douglas %A Namata,G. %B Association for Computational Linguistics (ACL) %8 2008/// %G eng %0 Journal Article %J Microbes and Infection %D 2008 %T Role of transposable elements in trypanosomatids %A Bringaud,Frédéric %A Ghedin,Elodie %A El‐Sayed, Najib M. %A Papadopoulou,Barbara %K Cellular function %K Domestication %K Evolution %K Gene expression %K Leishmania %K Regulation of mRNA stability %K Retroposon %K Transposable element %K Trypanosoma %X Transposable elements constitute 2-5% of the genome content in trypanosomatid parasites. Some of them are involved in critical cellular functions, such as the regulation of gene expression in Leishmania spp. In this review, we highlight the remarkable role extinct transposable elements can play as the source of potential new functions. %B Microbes and Infection %V 10 %P 575 - 581 %8 2008/05// %@ 1286-4579 %G eng %U http://www.sciencedirect.com/science/article/pii/S1286457908000464 %N 6 %R 16/j.micinf.2008.02.009 %0 Journal Article %J Molecular and Biochemical Parasitology %D 2008 %T Sequence diversity and evolution of multigene families in Trypanosoma cruzi %A Cerqueira,Gustavo C. %A Bartholomeu,Daniella C. %A DaRocha,Wanderson D. %A Hou,Lihua %A Freitas-Silva,Danielle M. %A Machado,Carlos Renato %A El‐Sayed, Najib M. %A Teixeira,Santuza M.R. %K Amastin %K Gene conversion %K Genetic diversity %K Multigene families %K Trypanosoma cruzi %X Several copies of genes belonging to three multigene families present in the genome of Trypanosoma cruzi were sequenced and comparatively analyzed across six different strains of the parasite belonging to the T. cruzi I lineage (Colombiana, Silvio X10 and Dm28c), the T. cruzi II lineage (Esmeraldo and JG) and a hybrid strain (CL Brener). For all three gene families analyzed, our results support the division in T. cruzi I and II lineages. Furthermore, in agreement with its hybrid nature, sequences derived from the CL Brener clone clustered together with T. cruzi II sequences as well as with a third group of sequences. Paralogous sequences encoding Amastin, an amastigote surface glycoprotein and TcAG48, an antigenic RNA binding protein, which are clustered in the parasite genome, present higher intragenomic variability in T. cruzi II and CL Brener strains, when compared to T. cruzi I strains. Paralogous sequences derived from the TcADC gene family, which encode various isoforms of adenylyl cyclases and are dispersed throughout the T. cruzi genome, exhibit similar degree of variability in all strains, except in the CL Brener strain, in which the sequences were more divergent. Several factors including mutation rates and gene conversion mechanisms, acting differently within the T. cruzi population, may contribute to create such distinct levels of sequence diversity in multigene families that are clustered in the T. cruzi genome. %B Molecular and Biochemical Parasitology %V 157 %P 65 - 72 %8 2008/01// %@ 0166-6851 %G eng %U http://www.sciencedirect.com/science/article/pii/S0166685107002769 %N 1 %R 16/j.molbiopara.2007.10.002 %0 Journal Article %J Parasitology research %D 2007 %T Cofactor-independent phosphoglycerate mutase is an essential gene in procyclic form Trypanosoma brucei %A Djikeng,A. %A Raverdy,S. %A Foster, Jeffrey S. %A Bartholomeu,D. %A Zhang,Y. %A El‐Sayed, Najib M. %A Carlow,C. %B Parasitology research %V 100 %P 887 - 892 %8 2007/// %G eng %N 4 %0 Journal Article %J International Journal of Human-Computer Interaction %D 2007 %T Conducting In Situ Evaluations for and With Ubiquitous Computing Technologies %A Consolvo,Sunny %A Harrison,Beverly %A Smith,Ian %A Chen,Mike Y. %A Everitt,Katherine %A Jon Froehlich %A Landay,James A. %X Abstract To evaluate ubiquitous computing technologies, which may be embedded in the environment, embedded in objects, worn, or carried by the user throughout everyday life, it is essential to use methods that accommodate the often unpredictable, real-world environments in which the technologies are used. This article discusses how we have adapted and applied traditional methods from psychology and human-computer interaction, such as Wizard of Oz and Experience Sampling, to be more amenable to the in situ evaluations of ubiquitous computing applications, particularly in the early stages of design. The way that ubiquitous computing technologies can facilitate the in situ collection of self-report data is also discussed. Although the focus is on ubiquitous computing applications and tools for their assessment, it is believed that the in situ evaluation tools that are proposed will be generally useful for field trials of other technology, applications, or formative studies that are concerned with collecting data in situ.Abstract To evaluate ubiquitous computing technologies, which may be embedded in the environment, embedded in objects, worn, or carried by the user throughout everyday life, it is essential to use methods that accommodate the often unpredictable, real-world environments in which the technologies are used. This article discusses how we have adapted and applied traditional methods from psychology and human-computer interaction, such as Wizard of Oz and Experience Sampling, to be more amenable to the in situ evaluations of ubiquitous computing applications, particularly in the early stages of design. The way that ubiquitous computing technologies can facilitate the in situ collection of self-report data is also discussed. Although the focus is on ubiquitous computing applications and tools for their assessment, it is believed that the in situ evaluation tools that are proposed will be generally useful for field trials of other technology, applications, or formative studies that are concerned with collecting data in situ. %B International Journal of Human-Computer Interaction %V 22 %P 103 - 118 %8 2007/// %@ 1044-7318 %G eng %U http://www.tandfonline.com/doi/abs/10.1080/10447310709336957 %N 1-2 %R 10.1080/10447310709336957 %0 Journal Article %J Journal of Molecular Biology %D 2007 %T Crystal Structure and Solution NMR Studies of Lys48-linked Tetraubiquitin at Neutral pH %A Eddins,Michael J. %A Varadan,Ranjani %A Fushman, David %A Pickart,Cecile M. %A Wolberger,Cynthia %K crystal structure %K Lys48-linked %K polyubiquitin chains %K tetraubiquitin %K ubiquitin %X Ubiquitin modification of proteins is used as a signal in many cellular processes. Lysine side-chains can be modified by a single ubiquitin or by a polyubiquitin chain, which is defined by an isopeptide bond between the C terminus of one ubiquitin and a specific lysine in a neighboring ubiquitin. Polyubiquitin conformations that result from different lysine linkages presumably differentiate their roles and ability to bind specific targets and enzymes. However, conflicting results have been obtained regarding the precise conformation of Lys48-linked tetraubiquitin. We report the crystal structure of Lys48-linked tetraubiquitin at near-neutral pH. The two tetraubiquitin complexes in the asymmetric unit show the complete connectivity of the chain and the molecular details of the interactions. This tetraubiquitin conformation is consistent with our NMR data as well as with previous studies of diubiquitin and tetraubiquitin in solution at neutral pH. The structure provides a basis for understanding Lys48-linked polyubiquitin recognition under physiological conditions. %B Journal of Molecular Biology %V 367 %P 204 - 211 %8 2007/03/16/ %@ 0022-2836 %G eng %U http://www.sciencedirect.com/science/article/pii/S0022283606017554 %N 1 %R 10.1016/j.jmb.2006.12.065 %0 Journal Article %J Science %D 2007 %T Draft Genome of the Filarial Nematode Parasite Brugia Malayi %A Ghedin,Elodie %A Wang,Shiliang %A Spiro,David %A Caler,Elisabet %A Zhao,Qi %A Crabtree,Jonathan %A Allen,Jonathan E %A Delcher,Arthur L. %A Guiliano,David B %A Miranda-Saavedra,Diego %A Angiuoli,Samuel V %A Creasy,Todd %A Amedeo,Paolo %A Haas,Brian %A El‐Sayed, Najib M. %A Wortman,Jennifer R. %A Feldblyum,Tamara %A Tallon,Luke %A Schatz,Michael %A Shumway,Martin %A Koo,Hean %A Salzberg,Steven L. %A Schobel,Seth %A Pertea,Mihaela %A Pop, Mihai %A White,Owen %A Barton,Geoffrey J %A Carlow,Clotilde K. S %A Crawford,Michael J %A Daub,Jennifer %A Dimmic,Matthew W %A Estes,Chris F %A Foster,Jeremy M %A Ganatra,Mehul %A Gregory,William F %A Johnson,Nicholas M %A Jin,Jinming %A Komuniecki,Richard %A Korf,Ian %A Kumar,Sanjay %A Laney,Sandra %A Li,Ben-Wen %A Li,Wen %A Lindblom,Tim H %A Lustigman,Sara %A Ma,Dong %A Maina,Claude V %A Martin,David M. A %A McCarter,James P %A McReynolds,Larry %A Mitreva,Makedonka %A Nutman,Thomas B %A Parkinson,John %A Peregrín-Alvarez,José M %A Poole,Catherine %A Ren,Qinghu %A Saunders,Lori %A Sluder,Ann E %A Smith,Katherine %A Stanke,Mario %A Unnasch,Thomas R %A Ware,Jenna %A Wei,Aguan D %A Weil,Gary %A Williams,Deryck J %A Zhang,Yinhua %A Williams,Steven A %A Fraser-Liggett,Claire %A Slatko,Barton %A Blaxter,Mark L %A Scott,Alan L %X 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. %B Science %V 317 %P 1756 - 1760 %8 2007/09/21/ %@ 0036-8075, 1095-9203 %G eng %U http://www.sciencemag.org/content/317/5845/1756 %N 5845 %R 10.1126/science.1145406 %0 Journal Article %J International Journal of Web Engineering and Technology %D 2007 %T An empirical approach to evaluating web application compliance across diverse client platform configurations %A Eaton,Cyntrica %A Memon, Atif M. %X Web applications are the most widely used class of software today. Increased diversity of web-client platform configurations causes execution of web applications to vary unpredictably, creating a myriad of challenges for quality assurance during development. This paper presents a novel technique and an inductive model that leverages empirical data from fielded systems to evaluate web application correctness across multiple client configurations. The inductive model is based on HTML tags and represents how web applications are expected to execute in each client configuration based on the fielded systems observed. End-users and developers update this model by providing empirical data in the form of positive (correctly executing) and negative (incorrectly executing) instances of fielded web applications. The results of an empirical study show that the approach is useful and that popular web applications have serious client-configuration-specific flaws. %B International Journal of Web Engineering and Technology %V 3 %P 227 - 253 %8 2007/01/01/ %G eng %U http://inderscience.metapress.com/content/7Y4ABR5FJHKRAPAA %N 3 %0 Journal Article %J Interacting with Computers %D 2007 %T Evaluating a cross-cultural children’s online book community: Lessons learned for sociability, usability, and cultural exchange %A Komlodi,Anita %A Hou,Weimin %A Preece,Jenny %A Druin, Allison %A Golub,Evan %A Alburo,Jade %A Liao,Sabrina %A Elkiss,Aaron %A Resnik, Philip %K children %K Cross-cultural %K Evaluation and design %K International Children’s Digital Library %K Online communities %X 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’s cross-language online communities via a case study of the International Children’s Digital Library Communities (ICDLCommunities). This project supports the development of communities for children (ages 7–11) that form around the International Digital Children’s Library (ICDL) book collection. In this community the children can learn about each others’ 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’s cross-cultural online communities. %B Interacting with Computers %V 19 %P 494 - 511 %8 2007/07// %@ 0953-5438 %G eng %U http://www.sciencedirect.com/science/article/pii/S0953543807000240 %N 4 %R 10.1016/j.intcom.2007.03.001 %0 Journal Article %J Nature %D 2007 %T Evolution of genes and genomes on the Drosophila phylogeny %A Clark,Andrew G. %A Eisen,Michael B. %A Smith,Douglas R. %A Bergman,Casey M. %A Oliver,Brian %A Markow,Therese A. %A Kaufman,Thomas C. %A Kellis,Manolis %A Gelbart,William %A Iyer,Venky N. %A Pollard,Daniel A. %A Sackton,Timothy B. %A Larracuente,Amanda M. %A Singh,Nadia D. %A Abad,Jose P. %A Abt,Dawn N. %A Adryan,Boris %A Aguade,Montserrat %A Akashi,Hiroshi %A Anderson,Wyatt W. %A Aquadro,Charles F. %A Ardell,David H. %A Arguello,Roman %A Artieri,Carlo G. %A Barbash,Daniel A. %A Barker,Daniel %A Barsanti,Paolo %A Batterham,Phil %A Batzoglou,Serafim %A Begun,Dave %A Bhutkar,Arjun %A Blanco,Enrico %A Bosak,Stephanie A. %A Bradley,Robert K. %A Brand,Adrianne D. %A Brent,Michael R. %A Brooks,Angela N. %A Brown,Randall H. %A Butlin,Roger K. %A Caggese,Corrado %A Calvi,Brian R. %A Carvalho,A. Bernardo de %A Caspi,Anat %A Castrezana,Sergio %A Celniker,Susan E. %A Chang,Jean L. %A Chapple,Charles %A Chatterji,Sourav %A Chinwalla,Asif %A Civetta,Alberto %A Clifton,Sandra W. %A Comeron,Josep M. %A Costello,James C. %A Coyne,Jerry A. %A Daub,Jennifer %A David,Robert G. %A Delcher,Arthur L. %A Delehaunty,Kim %A Do,Chuong B. %A Ebling,Heather %A Edwards,Kevin %A Eickbush,Thomas %A Evans,Jay D. %A Filipski,Alan %A Findei|[szlig]|,Sven %A Freyhult,Eva %A Fulton,Lucinda %A Fulton,Robert %A Garcia,Ana C. L. %A Gardiner,Anastasia %A Garfield,David A. %A Garvin,Barry E. %A Gibson,Greg %A Gilbert,Don %A Gnerre,Sante %A Godfrey,Jennifer %A Good,Robert %A Gotea,Valer %A Gravely,Brenton %A Greenberg,Anthony J. %A Griffiths-Jones,Sam %A Gross,Samuel %A Guigo,Roderic %A Gustafson,Erik A. %A Haerty,Wilfried %A Hahn,Matthew W. %A Halligan,Daniel L. %A Halpern,Aaron L. %A Halter,Gillian M. %A Han,Mira V. %A Heger,Andreas %A Hillier,LaDeana %A Hinrichs,Angie S. %A Holmes,Ian %A Hoskins,Roger A. %A Hubisz,Melissa J. %A Hultmark,Dan %A Huntley,Melanie A. %A Jaffe,David B. %A Jagadeeshan,Santosh %A Jeck,William R. %A Johnson,Justin %A Jones,Corbin D. %A Jordan,William C. %A Karpen,Gary H. %A Kataoka,Eiko %A Keightley,Peter D. %A Kheradpour,Pouya %A Kirkness,Ewen F. %A Koerich,Leonardo B. %A Kristiansen,Karsten %A Kudrna,Dave %A Kulathinal,Rob J. %A Kumar,Sudhir %A Kwok,Roberta %A Lander,Eric %A Langley,Charles H. %A Lapoint,Richard %A Lazzaro,Brian P. %A Lee,So-Jeong %A Levesque,Lisa %A Li,Ruiqiang %A Lin,Chiao-Feng %A Lin,Michael F. %A Lindblad-Toh,Kerstin %A Llopart,Ana %A Long,Manyuan %A Low,Lloyd %A Lozovsky,Elena %A Lu,Jian %A Luo,Meizhong %A Machado,Carlos A. %A Makalowski,Wojciech %A Marzo,Mar %A Matsuda,Muneo %A Matzkin,Luciano %A McAllister,Bryant %A McBride,Carolyn S. %A McKernan,Brendan %A McKernan,Kevin %A Mendez-Lago,Maria %A Minx,Patrick %A Mollenhauer,Michael U. %A Montooth,Kristi %A Mount, Stephen M. %A Mu,Xu %A Myers,Eugene %A Negre,Barbara %A Newfeld,Stuart %A Nielsen,Rasmus %A Noor,Mohamed A. F. %A O'Grady,Patrick %A Pachter,Lior %A Papaceit,Montserrat %A Parisi,Matthew J. %A Parisi,Michael %A Parts,Leopold %A Pedersen,Jakob S. %A Pesole,Graziano %A Phillippy,Adam M %A Ponting,Chris P. %A Pop, Mihai %A Porcelli,Damiano %A Powell,Jeffrey R. %A Prohaska,Sonja %A Pruitt,Kim %A Puig,Marta %A Quesneville,Hadi %A Ram,Kristipati Ravi %A Rand,David %A Rasmussen,Matthew D. %A Reed,Laura K. %A Reenan,Robert %A Reily,Amy %A Remington,Karin A. %A Rieger,Tania T. %A Ritchie,Michael G. %A Robin,Charles %A Rogers,Yu-Hui %A Rohde,Claudia %A Rozas,Julio %A Rubenfield,Marc J. %A Ruiz,Alfredo %A Russo,Susan %A Salzberg,Steven L. %A Sanchez-Gracia,Alejandro %A Saranga,David J. %A Sato,Hajime %A Schaeffer,Stephen W. %A Schatz,Michael C %A Schlenke,Todd %A Schwartz,Russell %A Segarra,Carmen %A Singh,Rama S. %A Sirot,Laura %A Sirota,Marina %A Sisneros,Nicholas B. %A Smith,Chris D. %A Smith,Temple F. %A Spieth,John %A Stage,Deborah E. %A Stark,Alexander %A Stephan,Wolfgang %A Strausberg,Robert L. %A Strempel,Sebastian %A Sturgill,David %A Sutton,Granger %A Sutton,Granger G. %A Tao,Wei %A Teichmann,Sarah %A Tobari,Yoshiko N. %A Tomimura,Yoshihiko %A Tsolas,Jason M. %A Valente,Vera L. S. %A Venter,Eli %A Venter,J. Craig %A Vicario,Saverio %A Vieira,Filipe G. %A Vilella,Albert J. %A Villasante,Alfredo %A Walenz,Brian %A Wang,Jun %A Wasserman,Marvin %A Watts,Thomas %A Wilson,Derek %A Wilson,Richard K. %A Wing,Rod A. %A Wolfner,Mariana F. %A Wong,Alex %A Wong,Gane Ka-Shu %A Wu,Chung-I %A Wu,Gabriel %A Yamamoto,Daisuke %A Yang,Hsiao-Pei %A Yang,Shiaw-Pyng %A Yorke,James A. %A Yoshida,Kiyohito %A Zdobnov,Evgeny %A Zhang,Peili %A Zhang,Yu %A Zimin,Aleksey V. %A Baldwin,Jennifer %A Abdouelleil,Amr %A Abdulkadir,Jamal %A Abebe,Adal %A Abera,Brikti %A Abreu,Justin %A Acer,St Christophe %A Aftuck,Lynne %A Alexander,Allen %A An,Peter %A Anderson,Erica %A Anderson,Scott %A Arachi,Harindra %A Azer,Marc %A Bachantsang,Pasang %A Barry,Andrew %A Bayul,Tashi %A Berlin,Aaron %A Bessette,Daniel %A Bloom,Toby %A Blye,Jason %A Boguslavskiy,Leonid %A Bonnet,Claude %A Boukhgalter,Boris %A Bourzgui,Imane %A Brown,Adam %A Cahill,Patrick %A Channer,Sheridon %A Cheshatsang,Yama %A Chuda,Lisa %A Citroen,Mieke %A Collymore,Alville %A Cooke,Patrick %A Costello,Maura %A D'Aco,Katie %A Daza,Riza %A Haan,Georgius De %A DeGray,Stuart %A DeMaso,Christina %A Dhargay,Norbu %A Dooley,Kimberly %A Dooley,Erin %A Doricent,Missole %A Dorje,Passang %A Dorjee,Kunsang %A Dupes,Alan %A Elong,Richard %A Falk,Jill %A Farina,Abderrahim %A Faro,Susan %A Ferguson,Diallo %A Fisher,Sheila %A Foley,Chelsea D. %A Franke,Alicia %A Friedrich,Dennis %A Gadbois,Loryn %A Gearin,Gary %A Gearin,Christina R. %A Giannoukos,Georgia %A Goode,Tina %A Graham,Joseph %A Grandbois,Edward %A Grewal,Sharleen %A Gyaltsen,Kunsang %A Hafez,Nabil %A Hagos,Birhane %A Hall,Jennifer %A Henson,Charlotte %A Hollinger,Andrew %A Honan,Tracey %A Huard,Monika D. %A Hughes,Leanne %A Hurhula,Brian %A Husby,M Erii %A Kamat,Asha %A Kanga,Ben %A Kashin,Seva %A Khazanovich,Dmitry %A Kisner,Peter %A Lance,Krista %A Lara,Marcia %A Lee,William %A Lennon,Niall %A Letendre,Frances %A LeVine,Rosie %A Lipovsky,Alex %A Liu,Xiaohong %A Liu,Jinlei %A Liu,Shangtao %A Lokyitsang,Tashi %A Lokyitsang,Yeshi %A Lubonja,Rakela %A Lui,Annie %A MacDonald,Pen %A Magnisalis,Vasilia %A Maru,Kebede %A Matthews,Charles %A McCusker,William %A McDonough,Susan %A Mehta,Teena %A Meldrim,James %A Meneus,Louis %A Mihai,Oana %A Mihalev,Atanas %A Mihova,Tanya %A Mittelman,Rachel %A Mlenga,Valentine %A Montmayeur,Anna %A Mulrain,Leonidas %A Navidi,Adam %A Naylor,Jerome %A Negash,Tamrat %A Nguyen,Thu %A Nguyen,Nga %A Nicol,Robert %A Norbu,Choe %A Norbu,Nyima %A Novod,Nathaniel %A O'Neill,Barry %A Osman,Sahal %A Markiewicz,Eva %A Oyono,Otero L. %A Patti,Christopher %A Phunkhang,Pema %A Pierre,Fritz %A Priest,Margaret %A Raghuraman,Sujaa %A Rege,Filip %A Reyes,Rebecca %A Rise,Cecil %A Rogov,Peter %A Ross,Keenan %A Ryan,Elizabeth %A Settipalli,Sampath %A Shea,Terry %A Sherpa,Ngawang %A Shi,Lu %A Shih,Diana %A Sparrow,Todd %A Spaulding,Jessica %A Stalker,John %A Stange-Thomann,Nicole %A Stavropoulos,Sharon %A Stone,Catherine %A Strader,Christopher %A Tesfaye,Senait %A Thomson,Talene %A Thoulutsang,Yama %A Thoulutsang,Dawa %A Topham,Kerri %A Topping,Ira %A Tsamla,Tsamla %A Vassiliev,Helen %A Vo,Andy %A Wangchuk,Tsering %A Wangdi,Tsering %A Weiand,Michael %A Wilkinson,Jane %A Wilson,Adam %A Yadav,Shailendra %A Young,Geneva %A Yu,Qing %A Zembek,Lisa %A Zhong,Danni %A Zimmer,Andrew %A Zwirko,Zac %A Jaffe,David B. %A Alvarez,Pablo %A Brockman,Will %A Butler,Jonathan %A Chin,CheeWhye %A Gnerre,Sante %A Grabherr,Manfred %A Kleber,Michael %A Mauceli,Evan %A MacCallum,Iain %X 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. %B Nature %V 450 %P 203 - 218 %8 2007/11/08/ %@ 0028-0836 %G eng %U http://www.nature.com/nature/journal/v450/n7167/full/nature06341.html %N 7167 %R 10.1038/nature06341 %0 Journal Article %J Nature %D 2007 %T Evolution of genes and genomes on the Drosophila phylogeny %A Clark, A.G. %A Eisen,M. B %A Smith,D. R %A Bergman, C.M. %A Oliver, B. %A Markow, T.A. %A Kaufman, T.C. %A Kellis, M. %A Gelbart, W. %A Iyer, V.N. %A others %B Nature %V 450 %P 203 - 218 %8 2007 %G eng %N 7167 %0 Journal Article %J Protist %D 2007 %T The Expression of a Plant-type Ferredoxin Redox System provides Molecular Evidence for a Plastid in the Early Dinoflagellate Perkinsus marinus %A Stelter,Kathrin %A El‐Sayed, Najib M. %A Seeber,Frank %K Apicomplexa %K ferredoxin %K Perkinsozoa %K plastid %K transit peptide %X Perkinsus marinus is a parasitic protozoan with a phylogenetic positioning between Apicomplexa and dinoflagellates. It is thus of interest for reconstructing the early evolution of eukaryotes, especially with regard to the acquisition of secondary plastids in these organisms. It is also an important pathogen of oysters, and the definition of parasite-specific metabolic pathways would be beneficial for the identification of efficient treatments for infected mollusks. Although these different scientific interests have resulted in the start of a genome project for this organism, it is still unknown whether P. marinus contains a plastid or plastid-like organelle like the related dinoflagellates and Apicomplexa. Here, we show that in vitro-cultivated parasites contain transcripts of the plant-type ferredoxin and its associated reductase. Both proteins are nuclear-encoded and possess N-terminal targeting sequences similar to those characterized in dinoflagellates. Since this redox pair is exclusively found in cyanobacteria and plastid-harboring organisms its presence also in P. marinus is highly indicative of a plastid. We also provide additional evidence for such an organelle by demonstrating pharmacological sensitivity to inhibitors of plastid-localized enzymes involved in fatty acid biosynthesis (e.g. acetyl-CoA carboxylase) and by detection of genes for three enzymes of plastid-localized isoprenoid biosynthesis (1-deoxy-D-xylulose 5-phosphate reductoisomerase, (E)-4-hydroxy-3-methyl-but-2-enyl diphosphate reductase, and (E)-4-hydroxy-3-methyl-but-2-enyl diphosphate synthase). %B Protist %V 158 %P 119 - 130 %8 2007/01/22/ %@ 1434-4610 %G eng %U http://www.sciencedirect.com/science/article/pii/S1434461006001015 %N 1 %R 16/j.protis.2006.09.003 %0 Journal Article %J ACM Transactions on Mathematical Software %D 2007 %T IFISS: A Matlab toolbox for modelling incompressible flow %A Elman, Howard %A Ramage, A. %A Silvester, D. J %B ACM Transactions on Mathematical Software %V 33 %8 2007/// %G eng %N 2 %0 Journal Article %J American Association for Artificial Intelligence (AAAI) %D 2007 %T Learning and visualizing user preferences over sets %A Wagstaff,K. %A desJardins, Marie %A Eaton,E. %A Montminy,J. %X In previous work, we introduced a representation language,DD-PREF, that balances preferences for particular items with preferences about the properties of the set. Specifically, DD- PREF permits the expression of preferences for depth (i.e., preferences for specific attribute values over others) and di- versity of sets (i.e., preferences for broad vs. narrow distri- butions of attribute values). We have also shown how pref- erences represented in DD-PREF can be learned from training data. In this paper, we present a new experimental method- ology, and give results in a Mars rover image domain. We also provide new visualizations of the learned preferences in this domain. Finally, we describe a Chinese restaurant menu domain for which we are currently gathering user data. %B American Association for Artificial Intelligence (AAAI) %8 2007/// %G eng %0 Journal Article %J SIAM J. Sci. Comput %D 2007 %T Least squares preconditioners for stabilized discretizations of the Navier-Stokes equations %A Elman, Howard %A Howle, V. E %A Shadid, J. %A Silvester, D. %A Tuminaro, R. %B SIAM J. Sci. Comput %V 30 %P 290 - 311 %8 2007/// %G eng %N 1 %0 Conference Paper %B Proceedings of SPIE %D 2007 %T An M-channel directional filter bank compatible with the contourlet and shearlet frequency tiling %A Easley,G. R %A Patel, Vishal M. %A Healy Jr,D.M. %B Proceedings of SPIE %V 6701 %P 67010C - 67010C %8 2007/// %G eng %0 Journal Article %J BMC Genomics %D 2007 %T Microarray analysis of gene expression induced by sexual contact in Schistosoma mansoni %A Waisberg,Michael %A Lobo,Francisco %A Cerqueira,Gustavo %A Passos,Liana %A Carvalho,Omar %A Franco,Gloria %A El‐Sayed, Najib M. %X BACKGROUND:The parasitic trematode Schistosoma mansoni is one of the major causative agents of Schistosomiasis, a disease that affects approximately 200 million people, mostly in developing countries. Since much of the pathology is associated with eggs laid by the female worm, understanding the mechanisms involved in oogenesis and sexual maturation is an important step towards the discovery of new targets for effective drug therapy. It is known that the adult female worm only develops fully in the presence of a male worm and that the rates of oviposition and maturation of eggs are significantly increased by mating. In order to study gene transcripts associated with sexual maturation and oviposition, we compared the gene expression profiles of sexually mature and immature parasites using DNA microarrays.RESULTS:For each experiment, three amplified RNA microarray hybridizations and their dye swaps were analyzed. Our results show that 265 transcripts are differentially expressed in adult females and 53 in adult males when mature and immature worms are compared. Of the genes differentially expressed, 55% are expressed at higher levels in paired females while the remaining 45% are more expressed in unpaired ones and 56.6% are expressed at higher levels in paired male worms while the remaining 43.4% are more expressed in immature parasites. Real-time RT-PCR analysis validated the microarray results. Several new maturation associated transcripts were identified. Genes that were up-regulated in single-sex females were mostly related to energy generation (i.e. carbohydrate and protein metabolism, generation of precursor metabolites and energy, cellular catabolism, and organelle organization and biogenesis) while genes that were down-regulated related to RNA metabolism, reactive oxygen species metabolism, electron transport, organelle organization and biogenesis and protein biosynthesis.CONCLUSION:Our results confirm previous observations related to gene expression induced by sexual maturation in female schistosome worms. They also increase the list of S. mansoni maturation associated transcripts considerably, therefore opening new and exciting avenues for the study of the conjugal biology and development of new drugs against schistosomes. %B BMC Genomics %V 8 %P 181 - 181 %8 2007/// %@ 1471-2164 %G eng %U http://www.biomedcentral.com/1471-2164/8/181 %N 1 %R 10.1186/1471-2164-8-181 %0 Conference Paper %B Proceedings of the 15th international conference on Multimedia %D 2007 %T Multi-scale video cropping %A El-Alfy,Hazem %A Jacobs, David W. %A Davis, Larry S. %K shortest path algorithm %K Surveillance %K video cropping %X We consider the problem of cropping surveillance videos. This process chooses a trajectory that a small sub-window can take through the video, selecting the most important parts of the video for display on a smaller monitor. We model the information content of the video simply, by whether the image changes at each pixel. Then we show that we can find the globally optimal trajectory for a cropping window by using a shortest path algorithm. In practice, we can speed up this process without affecting the results, by stitching together trajectories computed over short intervals. This also reduces system latency. We then show that we can use a second shortest path formulation to find good cuts from one trajectory to another, improving coverage of interesting events in the video. We describe additional techniques to improve the quality and efficiency of the algorithm, and show results on surveillance videos. %B Proceedings of the 15th international conference on Multimedia %S MULTIMEDIA '07 %I ACM %C New York, NY, USA %P 97 - 106 %8 2007/// %@ 978-1-59593-702-5 %G eng %U http://doi.acm.org/10.1145/1291233.1291255 %R 10.1145/1291233.1291255 %0 Journal Article %J Eukaryotic Cell %D 2007 %T New Trypanosoma cruzi Repeated Element That Shows Site Specificity for Insertion %A Souza,Renata T. %A Santos,Marcia R. M. %A Lima,Fabio M. %A El‐Sayed, Najib M. %A Myler,Peter J. %A Ruiz,Jeronimo C. %A da Silveira,Jose Franco %X A new family of site-specific repeated elements identified in Trypanosoma cruzi, which we named TcTREZO, is described here. TcTREZO appears to be a composite repeated element, since three subregions may be defined within it on the basis of sequence similarities with other T. cruzi sequences. Analysis of the distribution of TcTREZO in the genome clearly indicates that it displays site specificity for insertion. Most TcTREZO elements are flanked by conserved sequences. There is a highly conserved 68-bp sequence at the 5' end of the element and a sequence domain of [~]500 bp without a well-defined borderline at the 3' end. Northern blot hybridization and reverse transcriptase PCR analyses showed that TcTREZO transcripts are expressed as oligo(A)-terminated transcripts whose length corresponds to the unit size of the element (1.6 kb). Transcripts of [~]0.2 kb derived from a small part of TcTREZO are also detected in steady-state RNA. TcTREZO transcripts are unspliced and not translated. The copy number of TcTREZO sequences was estimated to be [~]173 copies per haploid genome. TcTREZO appears to have been assembled by insertions of sequences into a progenitor element. Once associated with each other, these subunits were amplified as a new transposable element. TcTREZO shows site specificity for insertion, suggesting that a sequence-specific endonuclease could be responsible for its insertion at a unique site. %B Eukaryotic Cell %V 6 %P 1228 - 1238 %8 2007/07/01/ %G eng %U http://ec.asm.org/cgi/content/abstract/6/7/1228 %N 7 %R

10.1128/EC.00036-07

%0 Journal Article %J Experimental Parasitology %D 2007 %T Schistosoma mansoni genome: Closing in on a final gene set %A Haas,Brian J. %A Berriman,Matthew %A Hirai,Hirohisa %A Cerqueira,Gustavo G. %A LoVerde,Philip T. %A El‐Sayed, Najib M. %K Annotation %K Gene finding %K Genome %K Schistosoma mansoni %X The Schistosoma mansoni genome sequencing consortium has recently released the latest versions of the genome assembly as well as an automated preliminary gene structure annotation. The combined datasets constitute a vast resource for researchers to exploit in a variety of post-genomic studies with an emphasis of transcriptomic and proteomic tools. Here we present an innovative method used for combining diverse sources of evidence including ab initio gene predictions, protein and transcript sequence homologies, and cross-genome sequence homologies between S. mansoni and Schistosoma japonicum to define a comprehensive list of protein-coding genes. %B Experimental Parasitology %V 117 %P 225 - 228 %8 2007/11// %@ 0014-4894 %G eng %U http://www.sciencedirect.com/science/article/pii/S0014489407001683 %N 3 %R 16/j.exppara.2007.06.005 %0 Journal Article %J IMA journal of numerical analysis %D 2007 %T Solving the stochastic steady-state diffusion problem using multigrid %A Elman, Howard %A Furnival, D. %B IMA journal of numerical analysis %V 27 %P 675 - 675 %8 2007/// %G eng %N 4 %0 Journal Article %J Computing and Visualization in Science %D 2007 %T Some observations on multigrid convergence for convection–diffusion equations %A Ramage, A. %A Elman, Howard %B Computing and Visualization in Science %V 10 %P 43 - 56 %8 2007/// %G eng %N 1 %0 Conference Paper %B Proceedings of the 22nd national conference on Artificial intelligence - Volume 2 %D 2007 %T Using multiresolution learning for transfer in image classification %A Eaton,Eric %A desJardins, Marie %A Stevenson,John %X Our work explores the transfer of knowledge at multiple levels of abstraction to improve learning. By exploiting the similarities between objects at various levels of detail, multiresolution learning can facilitate transfer between image classification tasks.We extract features from images at multiple levels of resolution, then use these features to create models at different resolutions. Upon receiving a new task, the closest-matching stored model can be generalized (adapted to the appropriate resolution) and transferred to the new task. %B Proceedings of the 22nd national conference on Artificial intelligence - Volume 2 %S AAAI'07 %I AAAI Press %P 1852 - 1853 %8 2007/// %@ 978-1-57735-323-2 %G eng %U http://dl.acm.org/citation.cfm?id=1619797.1619927 %0 Journal Article %J ANALYSIS %D 2006 %T Analysis and comparison of geometric and algebraic multigrid for convection-diffusion equations %A Wu, C. T %A Elman, Howard %B ANALYSIS %V 28 %P 2208 - 2228 %8 2006/// %G eng %N 6 %0 Journal Article %J SIAM Journal on Scientific Computing %D 2006 %T Block preconditioners based on approximate commutators %A Elman, Howard %A Howle, V. E %A Shadid, J. %A Shuttleworth, R. %A Tuminaro, R. %B SIAM Journal on Scientific Computing %V 27 %P 1651 - 1668 %8 2006/// %G eng %N 5 %0 Book Section %B Comparative GenomicsComparative Genomics %D 2006 %T Conservation Patterns in cis-Elements Reveal Compensatory Mutations %A Evans,Perry %A Donahue,Greg %A Hannenhalli, Sridhar %E Bourque,Guillaume %E El-Mabrouk,Nadia %X Transcriptional regulation critically depends on proper interactions between transcription factors (TF) and their cognate DNA binding sites or cis elements. A better understanding and modelling of the TF-DNA interaction is an important area of research. The Positional Weight Matrix (PWM) is the most common model of TF-DNA binding and it presumes that the nucleotide preferences at individual positions within the binding site are independent. However, studies have shown that this independence assumption does not always hold. If the nucleotide preference at one position depends on the nucleotide at another position, a chance mutation at one position should exert selection pressures at the other position. By comparing the patterns of evolutionary conservation at individual positions within cis elements, here we show that positional dependence within binding sites is highly prevalent. We also show that dependent positions are more likely to be functional, as evidenced by a higher information content and higher conservation. We discuss two examples—Elk-1 and SAP-1 where the inferred compensatory mutation is consistent with known TF-DNA crystal structure. %B Comparative GenomicsComparative Genomics %S Lecture Notes in Computer Science %I Springer Berlin / Heidelberg %V 4205 %P 186 - 199 %8 2006/// %@ 978-3-540-44529-6 %G eng %U http://dx.doi.org/10.1007/11864127_15 %0 Journal Article %J International Journal of Human-Computer Interaction %D 2006 %T Creativity Support Tools: Report From a U.S. National Science Foundation Sponsored Workshop %A Shneiderman, Ben %A Fischer,Gerhard %A Czerwinski,Mary %A Resnick,Mitch %A Myers,Brad %A Candy,Linda %A Edmonds,Ernest %A Eisenberg,Mike %A Giaccardi,Elisa %A Hewett,Tom %A Jennings,Pamela %A Kules,Bill %A Nakakoji,Kumiyo %A Nunamaker,Jay %A Pausch,Randy %A Selker,Ted %A Sylvan,Elisabeth %A Terry,Michael %X 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. %B International Journal of Human-Computer Interaction %V 20 %P 61 - 77 %8 2006/// %@ 1044-7318 %G eng %U http://www.tandfonline.com/doi/abs/10.1207/s15327590ijhc2002_1 %N 2 %R 10.1207/s15327590ijhc2002_1 %0 Journal Article %J BioinformaticsBioinformatics %D 2006 %T Dense Subgraph Computation Via Stochastic Search: Application to Detect Transcriptional Modules %A Everett,Logan %A Wang,Li-San %A Hannenhalli, Sridhar %X Motivation: In a tri-partite biological network of transcription factors, their putative target genes, and the tissues in which the target genes are differentially expressed, a tightly inter-connected (dense) subgraph may reveal knowledge about tissue specific transcription regulation mediated by a specific set of transcription factors—a tissue-specific transcriptional module. This is just one context in which an efficient computation of dense subgraphs in a multi-partite graph is needed.Result: Here we report a generic stochastic search based method to compute dense subgraphs in a graph with an arbitrary number of partitions and an arbitrary connectivity among the partitions. We then use the tool to explore tissue-specific transcriptional regulation in the human genome. We validate our findings in Skeletal muscle based on literature. We could accurately deduce biological processes for transcription factors via the tri-partite clusters of transcription factors, genes, and the functional annotation of genes. Additionally, we propose a few previously unknown TF-pathway associations and tissue-specific roles for certain pathways. Finally, our combined analysis of Cardiac, Skeletal, and Smooth muscle data recapitulates the evolutionary relationship among the three tissues. Contact:sridharh@pcbi.upenn.edu %B BioinformaticsBioinformatics %V 22 %P e117-e123 - e117-e123 %8 2006/07/15/ %@ 1367-4803, 1460-2059 %G eng %U http://bioinformatics.oxfordjournals.org/content/22/14/e117 %N 14 %R 10.1093/bioinformatics/btl260 %0 Journal Article %J Computer Vision and Image Understanding %D 2006 %T Edge affinity for pose-contour matching %A Prasad,V. S.N %A Davis, Larry S. %A Tran,Son Dinh %A Elgammal,Ahmed %K Contour matching %K Edge continuity %X We present an approach for whole-body pose-contour matching. Contour matching in natural images in the absence of foreground–background segmentation is difficult. Usually an asymmetric approach is adopted, where a contour is said to match well if it aligns with a subset of the image’s gradients. This leads to problems as the contour can match with a portion of an object’s outline and ignore the remainder. We present a model for using edge continuity to address this issue. Pairs of edge elements in the image are linked with affinities if they are likely to belong to the same object. A contour that matches with a set of image gradients is constrained to also match with other gradients having high affinities with the chosen ones. Experimental results show that this improves matching performance. %B Computer Vision and Image Understanding %V 104 %P 36 - 47 %8 2006/10// %@ 1077-3142 %G eng %U http://www.sciencedirect.com/science/article/pii/S1077314206000737 %N 1 %R 10.1016/j.cviu.2006.06.008 %0 Journal Article %J Molecular and Biochemical Parasitology %D 2006 %T Evolution of non-LTR retrotransposons in the trypanosomatid genomes: Leishmania major has lost the active elements %A Bringaud,Frédéric %A Ghedin,Elodie %A Blandin,Gaëlle %A Bartholomeu,Daniella C. %A Caler,Elisabet %A Levin,Mariano J. %A Baltz,Théo %A El‐Sayed, Najib M. %K Degenerate retroelement %K Evolution %K Ingi %K L1Tc %K Leishmania major %K Non-LTR retrotransposon %K Retroposon %K Trypanosoma brucei %K Trypanosoma cruzi %X 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'-extremity of all the full length DIREs and suggests a possible role for this conserved motif, as well as for DIREs. %B Molecular and Biochemical Parasitology %V 145 %P 158 - 170 %8 2006/02// %@ 0166-6851 %G eng %U http://www.sciencedirect.com/science/article/pii/S0166685105002963 %N 2 %R 16/j.molbiopara.2005.09.017 %0 Journal Article %J BIT Numerical Mathematics %D 2006 %T Fourier analysis of multigrid for a model two-dimensional convection-diffusion equation %A Elman, Howard %A Ramage, A. %B BIT Numerical Mathematics %V 46 %P 283 - 306 %8 2006/// %G eng %N 2 %0 Conference Paper %B Acoustics, Speech and Signal Processing, 2006. ICASSP 2006 Proceedings. 2006 IEEE International Conference on %D 2006 %T Image Registration and Fusion Studies for the Integration of Multiple Remote Sensing Data %A Le Moigne,J. %A Cole-Rhodes,A. %A Eastman,R. %A Jain,P. %A Joshua,A. %A Memarsadeghi,N. %A Mount, Dave %A Netanyahu,N. %A Morisette,J. %A Uko-Ozoro,E. %K ALI %K EO-1 %K fusion studies %K geophysical signal processing %K Hyperion sensors %K image registration %K Internet %K multiple remote sensing data %K multiple source data %K Remote sensing %K Web-based image registration toolbox %X The future of remote sensing will see the development of spacecraft formations, and with this development will come a number of complex challenges such as maintaining precise relative position and specified attitudes. At the same time, there will be increasing needs to understand planetary system processes and build accurate prediction models. One essential technology to accomplish these goals is the integration of multiple source data. For this integration, image registration and fusion represent the first steps and need to be performed with very high accuracy. In this paper, we describe studies performed in both image registration and fusion, including a modular framework that was built to describe registration algorithms, a Web-based image registration toolbox, and the comparison of several image fusion techniques using data from the EO-1/ALI and Hyperion sensors %B Acoustics, Speech and Signal Processing, 2006. ICASSP 2006 Proceedings. 2006 IEEE International Conference on %V 5 %P V - V %8 2006/05// %G eng %R 10.1109/ICASSP.2006.1661494 %0 Conference Paper %B Data Engineering Workshops, 2006. Proceedings. 22nd International Conference on %D 2006 %T Implementing a bioinformatics pipeline (bip) on a mediator platform: Comparing cost and quality of alternate choices %A Eckman,B. A %A Gaasterland,T. %A Lacroix,Z. %A Raschid, Louiqa %A Snyder,B. %A Vidal,M. E %B Data Engineering Workshops, 2006. Proceedings. 22nd International Conference on %P 67 - 67 %8 2006/// %G eng %0 Book Section %B Systems Biology and Regulatory GenomicsSystems Biology and Regulatory Genomics %D 2006 %T An Interaction-Dependent Model for Transcription Factor Binding %A Wang,Li-San %A Jensen,Shane %A Hannenhalli, Sridhar %E Eskin,Eleazar %E Ideker,Trey %E Raphael,Ben %E Workman,Christopher %X Transcriptional regulation is accomplished by several transcription factor proteins that bind to specific DNA elements in the relative vicinity of the gene, and interact with each other and with Polymerase enzyme. Thus the determination of transcription factor-DNA binding is an important step toward understanding transcriptional regulation. An effective way to experimentally determine the genomic regions bound by a transcription factor is by a ChIP-on-chip assay. Then, given the putative genomic regions, computational motif finding algorithms are applied to estimate the DNA binding motif or positional weight matrix for the TF. The a priori expectation is that the presence or absence of the estimated motif in a promoter should be a good indicator of the binding of the TF to that promoter. This association between the presence of the transcription factor motif and its binding is however weak in a majority of cases where the whole genome ChIP experiments have been performed. One possible reason for this is that the DNA binding of a particular transcription factor depends not only on its own motif, but also on synergistic or antagonistic action of neighboring motifs for other transcription factors. We believe that modeling this interaction-dependent binding with linear regression can better explain the observed binding data. We assess this hypothesis based on the whole genome ChIP-on-chip data for Yeast. The derived interactions are largely consistent with previous results that combine ChIP-on-chip data with expression data. We additionally apply our method to determine interacting partners for CREB and validate our findings based on published experimental results. %B Systems Biology and Regulatory GenomicsSystems Biology and Regulatory Genomics %S Lecture Notes in Computer Science %I Springer Berlin / Heidelberg %V 4023 %P 225 - 234 %8 2006/// %@ 978-3-540-48293-2 %G eng %U http://dx.doi.org/10.1007/978-3-540-48540-7_19 %0 Journal Article %J ICML Workshop on Structural Knowledge Transfer for Machine Learning %D 2006 %T Knowledge transfer with a multiresolution ensemble of classifiers %A Eaton,E. %A desJardins, Marie %B ICML Workshop on Structural Knowledge Transfer for Machine Learning %8 2006/// %G eng %0 Conference Paper %B Proceedings of the 23rd international conference on Machine learning %D 2006 %T Learning user preferences for sets of objects %A desJardins, Marie %A Eaton,Eric %A Wagstaff,Kiri L %X Most work on preference learning has focused on pairwise preferences or rankings over individual items. In this paper, we present a method for learning preferences over sets of items. Our learning method takes as input a collection of positive examples---that is, one or more sets that have been identified by a user as desirable. Kernel density estimation is used to estimate the value function for individual items, and the desired set diversity is estimated from the average set diversity observed in the collection. Since this is a new learning problem, we introduce a new evaluation methodology and evaluate the learning method on two data collections: synthetic blocks-world data and a new real-world music data collection that we have gathered. %B Proceedings of the 23rd international conference on Machine learning %S ICML '06 %I ACM %C New York, NY, USA %P 273 - 280 %8 2006/// %@ 1-59593-383-2 %G eng %U http://doi.acm.org/10.1145/1143844.1143879 %R 10.1145/1143844.1143879 %0 Journal Article %J Discrete & Computational Geometry %D 2006 %T On the Least Median Square Problem %A Erickson,Jeff %A Har-Peled,Sariel %A Mount, Dave %K Mathematics and Statistics %X We consider the exact and approximate computational complexity of the multivariate least median-of-squares (LMS) linear regression estimator. The LMS estimator is among the most widely used robust linear statistical estimators. Given a set of n points in and a parameter k, the problem is equivalent to computing the narrowest slab bounded by two parallel hyperplanes that contains k of the points. We present algorithms for the exact and approximate versions of the multivariate LMS problem. We also provide nearly matching lower bounds for these problems. These lower bounds hold under the assumptions that k is Ω(n) and that deciding whether n given points in are affinely non-degenerate requires Ω(n d ) time. %B Discrete & Computational Geometry %V 36 %P 593 - 607 %8 2006/// %@ 0179-5376 %G eng %U http://www.springerlink.com/content/j44818j11173017k/abstract/ %N 4 %R 10.1007/s00454-006-1267-6 %0 Journal Article %J Science %D 2006 %T Metagenomic Analysis of the Human Distal Gut Microbiome %A Gill,Steven R. %A Pop, Mihai %A DeBoy,Robert T. %A Eckburg,Paul B %A Turnbaugh,Peter J %A Samuel,Buck S %A Gordon,Jeffrey I %A Relman,David A %A Fraser-Liggett,Claire M %A Nelson,Karen E. %X The human intestinal microbiota is composed of 1013 to 1014 microorganisms whose collective genome (“microbiome”) 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–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–mediated biosynthesis of vitamins and isoprenoids. Thus, humans are superorganisms whose metabolism represents an amalgamation of microbial and human attributes. %B Science %V 312 %P 1355 - 1359 %8 2006/06/02/ %@ 0036-8075, 1095-9203 %G eng %U http://www.sciencemag.org/content/312/5778/1355 %N 5778 %R 10.1126/science.1124234 %0 Conference Paper %B Proceedings of the 2006 Conference on Email and Anti-Spam (CEAS 06) %D 2006 %T Modeling identity in archival collections of email: A preliminary study %A Elsayed,T. %A Oard, Douglas %B Proceedings of the 2006 Conference on Email and Anti-Spam (CEAS 06) %P 95 - 103 %8 2006/// %G eng %0 Journal Article %J Infect. Immun. %D 2006 %T Molecular Characterization of Serine-, Alanine-, and Proline-Rich Proteins of Trypanosoma cruzi and Their Possible Role in Host Cell Infection %A Baida,Renata C. P. %A Santos,Marcia R. M. %A Carmo,Mirian S. %A Yoshida,Nobuko %A Ferreira,Danielle %A Ferreira,Alice Teixeira %A El Sayed,Najib M. %A Andersson,Bjorn %A da Silveira,Jose Franco %X We previously reported the isolation of a novel protein gene family, termed SAP (serine-, alanine-, and proline-rich protein), from Trypanosoma cruzi. Aided by the availability of the completed genome sequence of T. cruzi, we have now identified 39 full-length sequences of SAP, six pseudogenes and four partial genes. SAPs share a central domain of about 55 amino acids and can be divided into four groups based on their amino (N)- and carboxy (C)-terminal sequences. Some SAPs have conserved N- and C-terminal domains encoding a signal peptide and a glycosylphosphatidylinositol anchor addition site, respectively. Analysis of the expression of SAPs in metacyclic trypomastigotes by two-dimensional electrophoresis and immunoblotting revealed that they are likely to be posttranslationally modified in vivo. We have also demonstrated that some SAPs are shed into the extracellular medium. The recombinant SAP exhibited an adhesive capacity toward mammalian cells, where binding was dose dependent and saturable, indicating a possible ligand-receptor interaction. SAP triggered the host cell Ca2+ response required for parasite internalization. A cell invasion assay performed in the presence of SAP showed inhibition of internalization of the metacyclic forms of the CL strain. Taken together, these results show that SAP is involved in the invasion of mammalian cells by metacyclic trypomastigotes, and they confirm the hypothesis that infective trypomastigotes exploit an arsenal of surface glycoproteins and shed proteins to induce signaling events required for their internalization. %B Infect. Immun. %V 74 %P 1537 - 1546 %8 2006/03/01/ %G eng %U http://iai.asm.org/cgi/content/abstract/74/3/1537 %N 3 %R

10.1128/IAI.74.3.1537-1546.2006

%0 Journal Article %J BrainBrain %D 2006 %T Nuclear Envelope Dystrophies Show a Transcriptional Fingerprint Suggesting Disruption of Rb–MyoD Pathways in Muscle Regeneration %A Bakay,Marina %A Wang,Zuyi %A Melcon,Gisela %A Schiltz,Louis %A Xuan,Jianhua %A Zhao,Po %A Sartorelli,Vittorio %A Seo,Jinwook %A Pegoraro,Elena %A Angelini,Corrado %A Shneiderman, Ben %A Escolar,Diana %A Chen,Yi-Wen %A Winokur,Sara T %A Pachman,Lauren M %A Fan,Chenguang %A Mandler,Raul %A Nevo,Yoram %A Gordon,Erynn %A Zhu,Yitan %A Dong,Yibin %A Wang,Yue %A Hoffman,Eric P %K EDMD = Emery–Dreifuss muscular dystrophy %K emerin %K Emery-Dreifuss muscular dystrophy %K FSHD = fascioscapulohumeral muscular dystrophy %K IDG = individual discriminatory genes %K JDG = jointly discriminatory genes %K lamin A/C %K LGMD = limb-girdle muscular dystrophy %K LOO = leave-one-out %K RT–PCR = reverse transcription–polymerase chain reaction; VISDA = Visual and Statistical Data Analyzer %K Skeletal muscle %K wFC = weighted Fisher criterion %X Mutations of lamin A/C (LMNA) cause a wide range of human disorders, including progeria, lipodystrophy, neuropathies and autosomal dominant Emery–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–polymerase chain reaction (RT–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. %B BrainBrain %V 129 %P 996 - 1013 %8 2006/04/01/ %@ 0006-8950, 1460-2156 %G eng %U http://brain.oxfordjournals.org/content/129/4/996 %N 4 %R 10.1093/brain/awl023 %0 Journal Article %J PLoS PathogPLoS Pathog %D 2006 %T Retroviral DNA Integration: Viral and Cellular Determinants of Target-Site Selection %A Lewinski,Mary K %A Yamashita,Masahiro %A Emerman,Michael %A Ciuffi,Angela %A Marshall,Heather %A Crawford,Gregory %A Collins,Francis %A Shinn,Paul %A Leipzig,Jeremy %A Hannenhalli, Sridhar %A Berry,Charles C %A Ecker,Joseph R %A Bushman,Frederic D. %X Retroviruses differ in their preferences for sites for viral DNA integration in the chromosomes of infected cells. Human immunodeficiency virus (HIV) integrates preferentially within active transcription units, whereas murine leukemia virus (MLV) integrates preferentially near transcription start sites and CpG islands. We investigated the viral determinants of integration-site selection using HIV chimeras with MLV genes substituted for their HIV counterparts. We found that transferring the MLV integrase (IN) coding region into HIV (to make HIVmIN) caused the hybrid to integrate with a specificity close to that of MLV. Addition of MLV gag (to make HIVmGagmIN) further increased the similarity of target-site selection to that of MLV. A chimeric virus with MLV Gag only (HIVmGag) displayed targeting preferences different from that of both HIV and MLV, further implicating Gag proteins in targeting as well as IN. We also report a genome-wide analysis indicating that MLV, but not HIV, favors integration near DNase I–hypersensitive sites (i.e., +/− 1 kb), and that HIVmIN and HIVmGagmIN also favored integration near these features. These findings reveal that IN is the principal viral determinant of integration specificity; they also reveal a new role for Gag-derived proteins, and strengthen models for integration targeting based on tethering of viral IN proteins to host proteins. %B PLoS PathogPLoS Pathog %V 2 %P e60 - e60 %8 2006/06/23/ %G eng %U UR - http://dx.plos.org/10.1371/journal.ppat.0020060,http://dx.plos.org/10.1371/journal.ppat.0020060 %N 6 %R 10.1371/journal.ppat.0020060 %0 Journal Article %J Gene %D 2006 %T Schistosoma mansoni (Platyhelminthes, Trematoda) nuclear receptors: Sixteen new members and a novel subfamily %A Wu,Wenjie %A Niles,Edward G. %A El‐Sayed, Najib M. %A Berriman,Matthew %A LoVerde,Philip T. %K Nuclear receptors %K Schistosoma mansoni %X Nuclear receptors (NRs) are important transcriptional modulators in metazoans. Sixteen new NRs were identified in the Platyhelminth trematode, Schistosoma mansoni. Three were found to possess novel tandem DNA-binding domains that identify a new subfamily of NR. Two NRs are homologues of the thyroid hormone receptor that previously were thought to be restricted to chordates. This study brings the total number of identified NR in S. mansoni to 21. Phylogenetic and comparative genomic analyses demonstrate that S. mansoni NRs share an evolutionary lineage with that of arthropods and vertebrates. Phylogenic analysis shows that more than half of the S. mansoni nuclear receptors evolved from a second gene duplication. As the second gene duplication of NRs was thought to be specific to vertebrates, our data challenge the current theory of NR evolution. %B Gene %V 366 %P 303 - 315 %8 2006/02/01/ %@ 0378-1119 %G eng %U http://www.sciencedirect.com/science/article/pii/S0378111905005871 %N 2 %R 16/j.gene.2005.09.013 %0 Journal Article %J DIMACS Series in Discrete Mathematics and Theoretical Computer Science %D 2006 %T Structure of social contact networks and their impact on epidemics %A Eubank,S. %A Kumar,V. S.A %A Marathe,M. V %A Srinivasan, Aravind %A Wang,N. %X Traditional epidemiological research has focused on rate-based differential-equation models on completely mixing populations. In this paper, we outline an approach based on a combination of net- work theory and discrete-event simulations to study epidemics in large urban areas. We survey some of our results published in Nature (2004) and the Proc. ACM-SIAM Symposium on Discrete Algorithms (2004), and present some new results on: (i) mathematical properties of large social contact networks, as well as (ii) simulation-based dynamic anal- ysis of disease-spread in such networks. We identify a number of new measures that are significant for understanding epidemics and for devel- oping new strategies in policy planning. We also perform a very detailed structural analysis of the social contact networks produced by TRAN- SIMS, a simulator for detailed transportation/traffic studies, and study two random graph models to generate realistic social networks: Chung- Lu’s model and the configuration model. We also develop combinatorial formulations and approximation algorithms for quarantining, vaccina- tion and sensor placement, as aids to decision-making. %B DIMACS Series in Discrete Mathematics and Theoretical Computer Science %V 70 %P 181 - 181 %8 2006/// %G eng %0 Journal Article %J Circulation %D 2006 %T Transcriptional Genomics Associates FOX Transcription Factors With Human Heart Failure %A Hannenhalli, Sridhar %A Putt,Mary E. %A Gilmore,Joan M. %A Wang,Junwen %A Parmacek,Michael S. %A Epstein,Jonathan A. %A Morrisey,Edward E. %A Margulies,Kenneth B. %A Cappola,Thomas P. %X Background— 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— 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— 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. %B Circulation %V 114 %P 1269 - 1276 %8 2006/// %G eng %U http://circ.ahajournals.org/content/114/12/1269.abstract %N 12 %R 10.1161/CIRCULATIONAHA.106.632430 %0 Journal Article %J Molecular biology and evolution %D 2006 %T The Trypanosoma cruzi L1Tc and NARTc non-LTR retrotransposons show relative site specificity for insertion %A Bringaud,F. %A Bartholomeu,D. C %A Blandin,G. %A Delcher,A. %A Baltz,T. %A El‐Sayed, Najib M. %A Ghedin,E. %B Molecular biology and evolution %V 23 %P 411 - 411 %8 2006/// %G eng %N 2 %0 Journal Article %J BMC Genomics %D 2006 %T Trypanosoma cruzi mitochondrial maxicircles display species- and strain-specific variation and a conserved element in the non-coding region %A Westenberger,Scott %A Cerqueira,Gustavo %A El‐Sayed, Najib M. %A Zingales,Bianca %A Campbell,David %A Sturm,Nancy %X BACKGROUND:The mitochondrial DNA of kinetoplastid flagellates is distinctive in the eukaryotic world due to its massive size, complex form and large sequence content. Comprised of catenated maxicircles that contain rRNA and protein-coding genes and thousands of heterogeneous minicircles encoding small guide RNAs, the kinetoplast network has evolved along with an extreme form of mRNA processing in the form of uridine insertion and deletion RNA editing. Many maxicircle-encoded mRNAs cannot be translated without this post-transcriptional sequence modification.RESULTS:We present the complete sequence and annotation of the Trypanosoma cruzi maxicircles for the CL Brener and Esmeraldo strains. Gene order is syntenic with Trypanosoma brucei and Leishmania tarentolae maxicircles. The non-coding components have strain-specific repetitive regions and a variable region that is unique for each strain with the exception of a conserved sequence element that may serve as an origin of replication, but shows no sequence identity with L. tarentolae or T. brucei. Alternative assemblies of the variable region demonstrate intra-strain heterogeneity of the maxicircle population. The extent of mRNA editing required for particular genes approximates that seen in T. brucei. Extensively edited genes were more divergent among the genera than non-edited and rRNA genes. Esmeraldo contains a unique 236-bp deletion that removes the 5'-ends of ND4 and CR4 and the intergenic region. Esmeraldo shows additional insertions and deletions outside of areas edited in other species in ND5, MURF1, and MURF2, while CL Brener has a distinct insertion in MURF2.CONCLUSION:The CL Brener and Esmeraldo maxicircles represent two of three previously defined maxicircle clades and promise utility as taxonomic markers. Restoration of the disrupted reading frames might be accomplished by strain-specific RNA editing. Elements in the non-coding region may be important for replication, transcription, and anchoring of the maxicircle within the kinetoplast network. %B BMC Genomics %V 7 %P 60 - 60 %8 2006/// %@ 1471-2164 %G eng %U http://www.biomedcentral.com/1471-2164/7/60 %N 1 %R 10.1186/1471-2164-7-60 %0 Journal Article %J Science %D 2005 %T Comparative Genomics of Trypanosomatid Parasitic Protozoa %A El‐Sayed, Najib M. %A Myler,Peter J. %A Blandin,Gaëlle %A Berriman,Matthew %A Crabtree,Jonathan %A Aggarwal,Gautam %A Caler,Elisabet %A Renauld,Hubert %A Worthey,Elizabeth A. %A Hertz-Fowler,Christiane %A Ghedin,Elodie %A Peacock,Christopher %A Bartholomeu,Daniella C. %A Haas,Brian J. %A Tran,Anh-Nhi %A Wortman,Jennifer R. %A Alsmark,U. Cecilia M. %A Angiuoli,Samuel %A Anupama,Atashi %A Badger,Jonathan %A Bringaud,Frederic %A Cadag,Eithon %A Carlton,Jane M. %A Cerqueira,Gustavo C. %A Creasy,Todd %A Delcher,Arthur L. %A Djikeng,Appolinaire %A Embley,T. Martin %A Hauser,Christopher %A Ivens,Alasdair C. %A Kummerfeld,Sarah K. %A Pereira-Leal,Jose B. %A Nilsson,Daniel %A Peterson,Jeremy %A Salzberg,Steven L. %A Shallom,Joshua %A Silva,Joana C. %A Sundaram,Jaideep %A Westenberger,Scott %A White,Owen %A Melville,Sara E. %A Donelson,John E. %A Andersson,Björn %A Stuart,Kenneth D. %A Hall,Neil %X 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—along with gene divergence, acquisition and loss, and rearrangement within the syntenic regions—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. %B Science %V 309 %P 404 - 409 %8 2005/07/15/ %G eng %U http://www.sciencemag.org/content/309/5733/404.abstract %N 5733 %R 10.1126/science.1112181 %0 Journal Article %J Computer Methods in Applied Mechanics and Engineering %D 2005 %T Efficient iterative algorithms for the stochastic finite element method with application to acoustic scattering %A Elman, Howard %A Ernst, Oliver G. %A O’Leary,Dianne P. %A Stewart, Michael %K 01 %K 28 %K 60 %K finite element %K multigrid %K Multiple right-hand side %K Scattering %K Stochastic %X In this study, we describe the algebraic computations required to implement the stochastic finite element method for solving problems in which uncertainty is restricted to right-hand side data coming from forcing functions or boundary conditions. We show that the solution can be represented in a compact outer product form which leads to efficiencies in both work and storage, and we demonstrate that block iterative methods for algebraic systems with multiple right-hand sides can be used to advantage to compute this solution. We also show how to generate a variety of statistical quantities from the computed solution. Finally, we examine the behavior of these statistical quantities in one setting derived from a model of acoustic scattering. %B Computer Methods in Applied Mechanics and Engineering %V 194 %P 1037 - 1055 %8 2005/03/18/ %@ 0045-7825 %G eng %U http://www.sciencedirect.com/science/article/pii/S0045782504003123 %N 9–11 %R 10.1016/j.cma.2004.06.028 %0 Conference Paper %B Parallel and Distributed Processing Symposium, 2005. Proceedings. 19th IEEE International %D 2005 %T EMPS: an environment for memory performance studies %A Hollingsworth, Jeffrey K %A Snavely, A. %A Sbaraglia, S. %A Ekanadham, K. %K Application software %K cache storage %K Computational modeling %K Concurrent computing %K data gathering %K Delay %K digital simulation %K Economic forecasting %K EMP radiation effects %K high end computing system %K High performance computing %K memory architecture %K memory performance %K Moore's Law %K PARALLEL PROCESSING %K parallel program %K Predictive models %K simulation tool %K Writing %X This paper describes an overview of environment for memory performance studies (EMPS). EMPS is a framework to allow different data gathering and simulation tools to be composed together to predict the performance of parallel programs on a variety of current and future high end computing (HEC) systems. The framework seeks to combine the automated nature of direct execution simulation with the predictive capabilities of performance modeling. %B Parallel and Distributed Processing Symposium, 2005. Proceedings. 19th IEEE International %I IEEE %8 2005/04// %@ 0-7695-2312-9 %G eng %R 10.1109/IPDPS.2005.196 %0 Book %D 2005 %T Finite Elements and Fast Iterative Solvers : with Applications in Incompressible Fluid Dynamics %A Elman, Howard %A Silvester, David J %A Wathen, Andrew J %K Computers / Computer Science %K Mathematics / Numerical Analysis %K Science / Mechanics / Fluids %K Science / Physics / General %K Technology & Engineering / Mechanical %X The subject of this book is the efficient solution of partial differential equations (PDEs) that arise when modelling incompressible fluid flow. The material is organized into four groups of two chapters each, covering the Poisson equation (chapters 1 & 2); the convection-diffucion equation (chapters 3 & 4); the Stokes equations (chapters 5 & 6); and the Navier-Stokes equations (chapters 7 & 8). These equations represent important models within the domain of computational fluid dynamics, but they also arise in many other settings. For each PDE model, there is a chapter concerned with finite element discretization. For each problem and associated solvers there is a description of how to compute along with theoretical analysis which guides the choice of approaches. Illustrative numerical results occur throughout the book, which have been computed with the freely downloadable IFISS software. All numerical results should be reproducible by readers who have access to MATLAB and there is considerable scope for experimentation in the 'computational laboratory' provided by the software. This book provides an excellent introduction to finite elements, iterative linear solvers and scientific computing aimed at graduates in engineering, numerical analysis, applied mathematics and interdisciplinary scientific computing. Including theoretical problems and practical exercises closely tied with freely downloadable MATLAB software, this book is an ideal teaching and learning resource. %I Oxford University Press %P 416 %8 2005 %@ 9780191523786 %G eng %0 Journal Article %J Nucleic acids research %D 2005 %T The genetic map and comparative analysis with the physical map of Trypanosoma brucei %A MacLeod,A. %A Tweedie,A. %A McLellan,S. %A Taylor,S. %A Hall,N. %A Berriman,M. %A El‐Sayed, Najib M. %A Hope,M. %A Turner,C. M.R %A Tait,A. %B Nucleic acids research %V 33 %P 6688 - 6688 %8 2005/// %G eng %N 21 %0 Journal Article %J Science %D 2005 %T The Genome Sequence of Trypanosoma cruzi, Etiologic Agent of Chagas Disease %A El‐Sayed, Najib M. %A Myler,Peter J. %A Bartholomeu,Daniella C. %A Nilsson,Daniel %A Aggarwal,Gautam %A Tran,Anh-Nhi %A Ghedin,Elodie %A Worthey,Elizabeth A. %A Delcher,Arthur L. %A Blandin,Gaëlle %A Westenberger,Scott J. %A Caler,Elisabet %A Cerqueira,Gustavo C. %A Branche,Carole %A Haas,Brian %A Anupama,Atashi %A Arner,Erik %A Åslund,Lena %A Attipoe,Philip %A Bontempi,Esteban %A Bringaud,Frédéric %A Burton,Peter %A Cadag,Eithon %A Campbell,David A. %A Carrington,Mark %A Crabtree,Jonathan %A Darban,Hamid %A da Silveira,Jose Franco %A de Jong,Pieter %A Edwards,Kimberly %A Englund,Paul T. %A Fazelina,Gholam %A Feldblyum,Tamara %A Ferella,Marcela %A Frasch,Alberto Carlos %A Gull,Keith %A Horn,David %A Hou,Lihua %A Huang,Yiting %A Kindlund,Ellen %A Klingbeil,Michele %A Kluge,Sindy %A Koo,Hean %A Lacerda,Daniela %A Levin,Mariano J. %A Lorenzi,Hernan %A Louie,Tin %A Machado,Carlos Renato %A McCulloch,Richard %A McKenna,Alan %A Mizuno,Yumi %A Mottram,Jeremy C. %A Nelson,Siri %A Ochaya,Stephen %A Osoegawa,Kazutoyo %A Pai,Grace %A Parsons,Marilyn %A Pentony,Martin %A Pettersson,Ulf %A Pop, Mihai %A Ramirez,Jose Luis %A Rinta,Joel %A Robertson,Laura %A Salzberg,Steven L. %A Sanchez,Daniel O. %A Seyler,Amber %A Sharma,Reuben %A Shetty,Jyoti %A Simpson,Anjana J. %A Sisk,Ellen %A Tammi,Martti T. %A Tarleton,Rick %A Teixeira,Santuza %A Van Aken,Susan %A Vogt,Christy %A Ward,Pauline N. %A Wickstead,Bill %A Wortman,Jennifer %A White,Owen %A Fraser,Claire M. %A Stuart,Kenneth D. %A Andersson,Björn %X 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. %B Science %V 309 %P 409 - 415 %8 2005/07/15/ %G eng %U http://www.sciencemag.org/content/309/5733/409.abstract %N 5733 %R 10.1126/science.1112631 %0 Journal Article %J ScienceScience %D 2005 %T The Genome Sequence of Trypanosoma Cruzi, Etiologic Agent of Chagas Disease %A El‐Sayed, Najib M. %A Myler,Peter J. %A Bartholomeu,Daniella C. %A Nilsson,Daniel %A Aggarwal,Gautam %A Tran,Anh-Nhi %A Ghedin,Elodie %A Worthey,Elizabeth A. %A Delcher,Arthur L. %A Blandin,Gaëlle %A Westenberger,Scott J. %A Caler,Elisabet %A Cerqueira,Gustavo C. %A Branche,Carole %A Haas,Brian %A Anupama,Atashi %A Arner,Erik %A Åslund,Lena %A Attipoe,Philip %A Bontempi,Esteban %A Bringaud,Frédéric %A Burton,Peter %A Cadag,Eithon %A Campbell,David A. %A Carrington,Mark %A Crabtree,Jonathan %A Darban,Hamid %A da Silveira,Jose Franco %A de Jong,Pieter %A Edwards,Kimberly %A Englund,Paul T. %A Fazelina,Gholam %A Feldblyum,Tamara %A Ferella,Marcela %A Frasch,Alberto Carlos %A Gull,Keith %A Horn,David %A Hou,Lihua %A Huang,Yiting %A Kindlund,Ellen %A Klingbeil,Michele %A Kluge,Sindy %A Koo,Hean %A Lacerda,Daniela %A Levin,Mariano J. %A Lorenzi,Hernan %A Louie,Tin %A Machado,Carlos Renato %A McCulloch,Richard %A McKenna,Alan %A Mizuno,Yumi %A Mottram,Jeremy C. %A Nelson,Siri %A Ochaya,Stephen %A Osoegawa,Kazutoyo %A Pai,Grace %A Parsons,Marilyn %A Pentony,Martin %A Pettersson,Ulf %A Pop, Mihai %A Ramirez,Jose Luis %A Rinta,Joel %A Robertson,Laura %A Salzberg,Steven L. %A Sanchez,Daniel O. %A Seyler,Amber %A Sharma,Reuben %A Shetty,Jyoti %A Simpson,Anjana J. %A Sisk,Ellen %A Tammi,Martti T. %A Tarleton,Rick %A Teixeira,Santuza %A Van Aken,Susan %A Vogt,Christy %A Ward,Pauline N. %A Wickstead,Bill %A Wortman,Jennifer %A White,Owen %A Fraser,Claire M. %A Stuart,Kenneth D. %A Andersson,Björn %X 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. %B ScienceScience %V 309 %P 409 - 415 %8 2005/07/15/ %@ 0036-8075, 1095-9203 %G eng %U http://www.sciencemag.org/content/309/5733/409 %N 5733 %R 10.1126/science.1112631 %0 Journal Article %J Science %D 2005 %T The genome sequence of Trypanosoma cruzi, etiologic agent of Chagas disease %A El-Sayed, N.M. %A Myler,P. J %A Bartholomeu,D. C %A Nilsson,D. %A Aggarwal,G. %A Tran,A. N %A Ghedin,E. %A Worthey,E. A %A Delcher,A. L %A Blandin,G. %A others %B Science %V 309 %8 2005 %G eng %N 5733 %0 Journal Article %J Journal of VirologyJ. Virol. %D 2005 %T Genome-Wide Analysis of Chromosomal Features Repressing Human Immunodeficiency Virus Transcription %A Lewinski,M. K %A Bisgrove,D. %A Shinn,P. %A Chen,H. %A Hoffmann,C. %A Hannenhalli, Sridhar %A Verdin,E. %A Berry,C. C %A Ecker,J. R %A Bushman,F. D %X We have investigated regulatory sequences in noncoding human DNA that are associated with repression of an integrated human immunodeficiency virus type 1 (HIV-1) promoter. HIV-1 integration results in the formation of precise and homogeneous junctions between viral and host DNA, but integration takes place at many locations. Thus, the variation in HIV-1 gene expression at different integration sites reports the activity of regulatory sequences at nearby chromosomal positions. Negative regulation of HIV transcription is of particular interest because of its association with maintaining HIV in a latent state in cells from infected patients. To identify chromosomal regulators of HIV transcription, we infected Jurkat T cells with an HIV-based vector transducing green fluorescent protein (GFP) and separated cells into populations containing well-expressed (GFP-positive) or poorly expressed (GFP-negative) proviruses. We then determined the chromosomal locations of the two classes by sequencing 971 junctions between viral and cellular DNA. Possible effects of endogenous cellular transcription were characterized by transcriptional profiling. Low-level GFP expression correlated with integration in (i) gene deserts, (ii) centromeric heterochromatin, and (iii) very highly expressed cellular genes. These data provide a genome-wide picture of chromosomal features that repress transcription and suggest models for transcriptional latency in cells from HIV-infected patients. %B Journal of VirologyJ. Virol. %V 79 %P 6610 - 6619 %8 2005/06/01/ %@ 0022-538X, 1098-5514 %G eng %U http://jvi.asm.org/content/79/11/6610 %N 11 %R 10.1128/JVI.79.11.6610-6619.2005 %0 Conference Paper %B 2005 IEEE International Conference on Systems, Man and Cybernetics %D 2005 %T A learning automata based power management for ad-hoc networks %A El-Osery,A. I %A Baird,D. %A Abd-Almageed, Wael %K ad hoc networks %K ad-hoc networks %K Computer network management %K Computer networks %K Energy management %K Engineering management %K learning automata %K network metrics %K network simulator %K packet retransmissions %K power control %K power system management %K power transmission control %K stochastic learning automata %K stochastic learning automta %K Stochastic processes %K system bandwidth %K Technology management %K Throughput %K transmission power control %K transmission power level %K transmission power management %X Power management is a very important aspect of ad-hoc networks. It directly impacts the network throughput among other network metrics. On the other hand, transmission power management may result in disconnected networks and increased level of collisions. In this paper, we introduce a transmission power control based on stochastic learning automata (SLA) to modify the transmission power. Based on the level of successful transmissions and the level of packet retransmissions, the SLA will modify the transmission power level either by increasing it or decreasing it. The probabilistic nature of SLA makes it a useful choice for ad-hoc networks. Using the network simulator NS, we show that using SLA for transmission power will result in an increased system bandwidth and a decrease in the collision levels. %B 2005 IEEE International Conference on Systems, Man and Cybernetics %I IEEE %V 4 %P 3569- 3573 Vol. 4 - 3569- 3573 Vol. 4 %8 2005/10// %@ 0-7803-9298-1 %G eng %R 10.1109/ICSMC.2005.1571701 %0 Conference Paper %B Proceedings of the ACL 2005 on Interactive poster and demonstration sessions %D 2005 %T The linguist's search engine: an overview %A Resnik, Philip %A Elkiss,A. %B Proceedings of the ACL 2005 on Interactive poster and demonstration sessions %P 33 - 36 %8 2005/// %G eng %0 Journal Article %J Journal of Scientific Computing %D 2005 %T Preconditioning strategies for models of incompressible flow %A Elman, Howard %B Journal of Scientific Computing %V 25 %P 347 - 366 %8 2005/// %G eng %N 1 %0 Journal Article %J Molecular Microbiology %D 2005 %T Promoter architecture and response to a positive regulator of archaeal transcription %A Ouhammouch,Mohamed %A Langham,Geoffrey E %A Hausner,Winfried %A Simpson,Anjana J. %A El‐Sayed, Najib M. %A Geiduschek,E. Peter %X 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 ‘one-site’ 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. %B Molecular Microbiology %V 56 %P 625 - 637 %8 2005/05/01/ %@ 1365-2958 %G eng %U http://onlinelibrary.wiley.com/doi/10.1111/j.1365-2958.2005.04563.x/abstract %N 3 %R 10.1111/j.1365-2958.2005.04563.x %0 Journal Article %J Genome Biology %D 2005 %T Serendipitous discovery of Wolbachia genomes in multiple Drosophila species %A Salzberg,Steven L. %A Hotopp,Julie CD %A Delcher,Arthur L. %A Pop, Mihai %A Smith,Douglas R. %A Eisen,Michael B. %A Nelson,William C. %X The Trace Archive is a repository for the raw, unanalyzed data generated by large-scale genome sequencing projects. The existence of this data offers scientists the possibility of discovering additional genomic sequences beyond those originally sequenced. In particular, if the source DNA for a sequencing project came from a species that was colonized by another organism, then the project may yield substantial amounts of genomic DNA, including near-complete genomes, from the symbiotic or parasitic organism. %B Genome Biology %V 6 %P R23 - R23 %8 2005/02/22/ %@ 1465-6906 %G eng %U http://genomebiology.com/2005/6/3/R23 %N 3 %R 10.1186/gb-2005-6-3-r23 %0 Journal Article %J Environmental Microbiology %D 2005 %T Transcriptional profiling of the hyperthermophilic methanarchaeon Methanococcus jannaschii in response to lethal heat and non‐lethal cold shock %A Boonyaratanakornkit,Boonchai B %A Simpson,Anjana J. %A Whitehead,Timothy A %A Fraser,Claire M. %A El‐Sayed, Najib M. %A Clark,Douglas S %X Temperature shock of the hyperthermophilic methanarchaeon Methanococcus jannaschii from its optimal growth temperature of 85°C to 65°C and 95°C resulted in different transcriptional responses characteristic of both the direction of shock (heat or cold shock) and whether the shock was lethal. Specific outcomes of lethal heat shock to 95°C included upregulation of genes encoding chaperones, and downregulation of genes encoding subunits of the H+ transporting ATP synthase. A gene encoding an α subunit of a putative prefoldin was also upregulated, which may comprise a novel element in the protein processing pathway in M. jannaschii. Very different responses were observed upon cold shock to 65°C. These included upregulation of a gene encoding an RNA helicase and other genes involved in transcription and translation, and upregulation of genes coding for proteases and transport proteins. Also upregulated was a gene that codes for an 18 kDa FKBP-type PPIase, which may facilitate protein folding at low temperatures. Transcriptional profiling also revealed several hypothetical proteins that respond to temperature stress conditions. %B Environmental Microbiology %V 7 %P 789 - 797 %8 2005/06/01/ %@ 1462-2920 %G eng %U http://onlinelibrary.wiley.com/doi/10.1111/j.1462-2920.2005.00751.x/abstract %N 6 %R 10.1111/j.1462-2920.2005.00751.x %0 Conference Paper %B Proceedings of the 2005 ACM/IEEE conference on Supercomputing %D 2005 %T Using Dynamic Tracing Sampling to Measure Long Running Programs %A Odom, Jeffrey %A Hollingsworth, Jeffrey K %A DeRose,Luiz %A Ekanadham, Kattamuri %A Sbaraglia, Simone %K data communications %K design %K experimentation %K measurement %K performance %K tracing %X Detailed cache simulation can be useful to both system developers and application writers to understand an application's performance. However, measuring long running programs can be extremely slow. In this paper we present a technique to use dynamic sampling of trace snippets throughout an application's execution. We demonstrate that our approach improves accuracy compared to sampling a few timesteps at the beginning of execution by judiciously choosing the frequency, as well as the points in the control flow, at which samples are collected. Our approach is validated using the SIGMA tracing and simulation framework for the IBM Power family of processors. %B Proceedings of the 2005 ACM/IEEE conference on Supercomputing %S SC '05 %I IEEE Computer Society %P 59– - 59– %8 2005/// %@ 1-59593-061-2 %G eng %U http://dx.doi.org/10.1109/SC.2005.77 %R http://dx.doi.org/10.1109/SC.2005.77 %0 Journal Article %J Proceedings of INTERACT %D 2005 %T Visualizing missing data: classification and empirical study %A Eaton,C. %A Plaisant, Catherine %A Drizd,T. %X Most visualization tools fail to provide support for missing data. We identify sources of missing, and categorize data visualization techniques based on the impact missing data have on the display: region dependent, attribute dependent, and neighbor dependent. We then report on a user study with 30 participants that compared three design variants. A between-subject graph interpretation study provides strong evidence for the need of indicating the presence of missing information, and some direction for addressing the problem. %B Proceedings of INTERACT %P 861 - 872 %8 2005/// %G eng %0 Book Section %B Human-Computer Interaction - INTERACT 2005 %D 2005 %T Visualizing Missing Data: Graph Interpretation User Study %A Eaton,Cyntrica %A Plaisant, Catherine %A Drizd,Terence %E Costabile,Maria %E Paternò,Fabio %X Most visualization tools fail to provide support for missing data. In this paper, we identify sources of missing data and describe three levels of impact missing data can have on the visualization: perceivable, invisible or propagating. We then report on a user study with 30 participants that compared three design variants. A between-subject graph interpretation study provides strong evidence for the need of indicating the presence of missing information, and some direction for addressing the problem. %B Human-Computer Interaction - INTERACT 2005 %S Lecture Notes in Computer Science %I Springer Berlin / Heidelberg %V 3585 %P 861 - 872 %8 2005/// %@ 978-3-540-28943-2 %G eng %U http://dx.doi.org/10.1007/11555261_68 %0 Conference Paper %B 31st Meeting of the Berkeley Linguistics Society %D 2005 %T The web in theoretical linguistics research: Two case studies using the Linguist’s Search Engine %A Resnik, Philip %A Elkiss,A. %A Lau,E. %A Taylor,H. %B 31st Meeting of the Berkeley Linguistics Society %P 265 - 276 %8 2005/// %G eng %0 Conference Paper %B Proceedings of the 2005 IEEE International Conference on Robotics and Automation, 2005. ICRA 2005 %D 2005 %T What Are the Ants Doing? Vision-Based Tracking and Reconstruction of Control Programs %A Egerstedt, M. %A Balch, T. %A Dellaert, F. %A Delmotte, F. %A Zia Khan %K Animals %K Automatic generation control %K Biological information theory %K Computer vision %K Control systems %K Mobile robots %K Probability distribution %K Robot control %K target tracking %K Trajectory %X In this paper, we study the problem of going from a real-world, multi-agent system to the generation of control programs in an automatic fashion. In particular, a computer vision system is presented, capable of simultaneously tracking multiple agents, such as social insects. Moreover, the data obtained from this system is fed into a mode-reconstruction module that generates low-complexity control programs, i.e. strings of symbolic descriptions of control-interrupt pairs, consistent with the empirical data. The result is a mechanism for going from the real system to an executable implementation that can be used for controlling multiple mobile robots. %B Proceedings of the 2005 IEEE International Conference on Robotics and Automation, 2005. ICRA 2005 %P 4182 - 4187 %8 2005/04// %G eng %0 Journal Article %J Trends in Parasitology %D 2004 %T Advances in schistosome genomics %A El‐Sayed, Najib M. %A Bartholomeu,Daniella %A Ivens,Alasdair %A Johnston,David A. %A LoVerde,Philip T. %X In Spring 2004, the first draft of the 270 Mb genome of Schistosoma mansoni will be released. This sequence is based on the assembly and annotation of a >7.5-fold coverage, shotgun sequencing project. The key stages involved in the international collaborative efforts that have led to the generation of these sequencing data for the parasite S. mansoni are discussed here. %B Trends in Parasitology %V 20 %P 154 - 157 %8 2004/04/01/ %@ 1471-4922 %G eng %U http://www.sciencedirect.com/science/article/pii/S1471492204000480 %N 4 %R 16/j.pt.2004.02.002 %0 Journal Article %J Report of the DHS Workshop Data Sciences, Jointly Released by Sandia National Laboratories and Lawrence Livermore National Laboratory, Alexandria, Va %D 2004 %T Data sciences technology for homeland security information management and knowledge discovery %A Kolda,T. %A Brown,D %A Corones,J. %A Critchlow,T. %A Eliassi-Rad,T. %A Getoor, Lise %A Hendrickson,B. %A Kumar, V. %A Lambert,D. %A Matarazzo,C. %B Report of the DHS Workshop Data Sciences, Jointly Released by Sandia National Laboratories and Lawrence Livermore National Laboratory, Alexandria, Va %8 2004/// %G eng %0 Journal Article %J Proceedings of the 15th IEEE International Symposium on Software Reliability Engineering (ISSRE'04) %D 2004 %T Evaluating web page reliability across varied browsing environments %A Eaton,C. %A Memon, Atif M. %X Web page reliability is significantly influenced by thebrowser, browser version, and operating system incorpo- rated in end-user browsing environments. The tool we have developed evaluates reliability of web-bound content across various client platforms based on the relationship between two key accessibility factors: (1) the HTML tags that struc- ture a given web page and (2) the support provided for each tag in target browsing environments. To optimize evaluation accuracy, we have designed a learning mechanism that in- ductively acquires knowledge of tag support criteria based on observed samples of accessible (properly rendered) and inaccessible (faulty) web page source code. Our contribu- tion is expected to provide web developers with a basis for maximizing audience reach through improved awareness of the browsing environment profiles associated with dimin- ished accessibility to their websites. %B Proceedings of the 15th IEEE International Symposium on Software Reliability Engineering (ISSRE'04) %8 2004/// %G eng %0 Journal Article %J Proceedings of the International Workshop on Web Quality (WQ'04) %D 2004 %T Improving browsing environment compliance evaluations for websites %A Eaton,C. %A Memon, Atif M. %X Identifying accessibility issues that can threaten universal website usability is criticalfor web service and content providers who wish to accommodate the diverse web audience. Detecting page-to-environment incompliance and modifying pages to promote universal accessibility is one important step in improving the process of exploration and navigation in the web user experience. To address this issue, we have designed a system that evaluates the accessibility of a web page in a given browsing environment based on knowledge of the HyperText Markup Language (HTML) tags that comprise the page and knowledge of the tag support provided in respective browsing environments. Given this approach, one of the most important aspects of the system is the comprehensive nature of tag support knowledge. The more support rules known, the more environment-specific bugs the system can accurately identify. In order to optimize knowledge of tag support criteria, we have also incorporated a learning mechanism that can inductively determine HTML tags that are unsupported in a given environment by observing both positive and negative examples of web page appearance and behavior. %B Proceedings of the International Workshop on Web Quality (WQ'04) %8 2004/// %G eng %0 Journal Article %J Molecular biology and evolution %D 2004 %T The ingi and RIME non-LTR retrotransposons are not randomly distributed in the genome of Trypanosoma brucei %A Bringaud,F. %A Biteau,N. %A Zuiderwijk,E. %A Berriman,M. %A El‐Sayed, Najib M. %A Ghedin,E. %A Melville,S. E. %A Hall,N. %A Baltz,T. %B Molecular biology and evolution %V 21 %P 520 - 520 %8 2004/// %G eng %N 3 %0 Journal Article %J Nature %D 2004 %T Modelling disease outbreaks in realistic urban social networks %A Eubank,Stephen %A Guclu,Hasan %A Kumar,V. S. Anil %A Marathe,Madhav V. %A Srinivasan, Aravind %A Toroczkai,Zolt|[aacute]|n %A Wang,Nan %X 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. %B Nature %V 429 %P 180 - 184 %8 2004/05/13/ %@ 0028-0836 %G eng %U http://www.nature.com/nature/journal/v429/n6988/full/nature02541.html %N 6988 %R 10.1038/nature02541 %0 Journal Article %J Indian Conference on Computer Vision, Graphics and Image Processing %D 2004 %T Multi-cue exemplar-based nonparametric model for gesture recognition %A Shet,V. D %A Prasad,V. S.N %A Elgammal,A. %A Yacoob,Yaser %A Davis, Larry S. %X This paper presents an approach for a multi-cue, view-based recognition of gestures. We describe an exemplar- based technique that combines two different forms of exem- plars - shape exemplars and motion exemplars - in a uni- fied probabilistic framework. Each gesture is represented as a sequence of learned body poses as well as a sequence of learned motion parameters. The shape exemplars are comprised of pose contours, and the motion exemplars are represented as affine motion parameters extracted using a robust estimation approach. The probabilistic framework learns by employing a nonparametric estimation technique to model the exemplar distributions. It imposes temporal constraints between different exemplars through a learned Hidden Markov Model (HMM) for each gesture. We use the proposed multi-cue approach to recognize a set of four- teen gestures and contrast it against a shape only, single- cue based system. %B Indian Conference on Computer Vision, Graphics and Image Processing %P 16 - 18 %8 2004/// %G eng %0 Journal Article %J IEEE, 0-7695-2158-2164 %D 2004 %T On-Line Kernel-Based Tracking in Joint Feature-Spatial Spaces %A Yang,C. %A Duraiswami, Ramani %A Elgammal,A. %A Davis, Larry S. %X We will demonstrate an object tracking algorithm thatuses a novel simple symmetric similarity function between spatially-smoothed kernel-density estimates of the model and target distributions. The similarity measure is based on the expectation of the density estimates over the model or target images. The density is estimated using radial-basis kernel functions which measure the affinity between points and provide a better outlier rejection property. The mean- shift algorithm is used to track objects by iteratively max- imizing this similarity function. To alleviate the quadratic complexity of the density estimation, we employ Gaussian kernels and the fast Gauss transform to reduce the compu- tations to linear order. This leads to a very efficient and robust nonparametric tracking algorithm. More details can be found in [2]. The system processes online video stream on a P4 1.4GHz and achieves 30 frames per second using an ordinary webcam. %B IEEE, 0-7695-2158-2164 %8 2004/// %G eng %0 Journal Article %J Environmental Microbiology %D 2004 %T Polylysogeny and prophage induction by secondary infection in Vibrio cholerae %A Espeland,Eric M. %A Lipp,Erin K. %A Huq,Anwar %A Rita R Colwell %X Strains of Vibrio cholerae O1, biotypes El Tor and classical, were infected with a known temperate phage (ΦP15) and monitored over a 15-day period for prophage induction. Over the course of the experiment two morphologically and three genomically distinct virus-like particles were observed from the phage-infected El Tor strain by transmission electron microscopy and field inversion gel electrophoresis, respectively, whereas only one phage, ΦP15, was observed from the infected classical strain. In the uninfected El Tor culture one prophage was spontaneously induced after 6 days. No induction in either strain was observed after treatment with mitomycin C. Data indicate that El Tor biotypes of V. cholerae may be polylysogenic and that secondary infection can promote multiple prophage induction. These traits may be important in the transfer of genetic material among V. cholerae by providing an environmentally relevant route for multiple prophage propagation and transmission. %B Environmental Microbiology %V 6 %P 760 - 763 %8 2004/07/01/ %@ 1462-2920 %G eng %U http://onlinelibrary.wiley.com/doi/10.1111/j.1462-2920.2004.00603.x/abstract?userIsAuthenticated=false&deniedAccessCustomisedMessage= %N 7 %R 10.1111/j.1462-2920.2004.00603.x %0 Report %D 2004 %T Real-Time Kernel-Based Tracking in Joint Feature-Spatial Spaces %A Yang,Changjiang %A Duraiswami, Ramani %A Elgammal,Ahmed %A Davis, Larry S. %K Technical Report %X An object tracking algorithm that uses a novel simple symmetric similarityfunction between spatially-smoothed kernel-density estimates of the model and target distributions is proposed and tested. The similarity measure is based on the expectation of the density estimates over the model or target images. The density is estimated using radial-basis kernel functions which measure the affinity between points and provide a better outlier rejection property. The mean-shift algorithm is used to track objects by iteratively maximizing this similarity function. To alleviate the quadratic complexity of the density estimation, we employ Gaussian kernels and the fast Gauss transform to reduce the computations to linear order. This leads to a very efficient and robust nonparametric tracking algorithm. The proposed algorithm is tested with several image sequences and shown to achieve robust and reliable real-time tracking. (UMIACS-TR-2004-12) %B Technical Reports from UMIACS %8 2004/04/19/ %G eng %U http://drum.lib.umd.edu/handle/1903/1341 %0 Journal Article %J Parasitology International %D 2004 %T Schistosoma mansoni genome project: an update %A LoVerde,Philip T. %A Hirai,Hirohisa %A Merrick,Joseph M %A Lee,Norman H %A El‐Sayed, Najib M. %K Chromosome mapping %K Gene discovery %K Genomics %K Schistosoma mansoni %X A schistosome genome project was initiated by the World Health Organization in 1994 with the notion that the best prospects for identifying new targets for drugs, vaccines, and diagnostic development lie in schistosome gene discovery, development of chromosome maps, whole genome sequencing and genome analysis. Schistosoma mansoni has a haploid genome of 270 Mb contained on 8 pairs of chromosomes. It is estimated that the S. mansoni genome contains between 15 000 and 25 000 genes. There are approximately 16 689 ESTs obtained from diverse libraries representing different developmental stages of S. mansoni, deposited in the NCBI EST database. More than half of the deposited sequences correspond to genes of unknown function. Approximately 40-50% of the sequences form unique clusters, suggesting that approximately 20-25% of the total schistosome genes have been discovered. Efforts to develop low resolution chromosome maps are in progress. There is a genome sequencing program underway that will provide 3X sequence coverage of the S. mansoni genome that will result in approximately 95% gene discovery. The genomics era has provided the resources to usher in the era of functional genomics that will involve microarrays to focus on specific metabolic pathways, proteomics to identify relevant proteins and protein-protein interactions to understand critical parasite pathways. Functional genomics is expected to accelerate the development of control and treatment strategies for schistosomiasis. %B Parasitology International %V 53 %P 183 - 192 %8 2004/06// %@ 1383-5769 %G eng %U http://www.sciencedirect.com/science/article/pii/S1383576904000108 %N 2 %R 16/j.parint.2004.01.009 %0 Journal Article %J METHODS IN MOLECULAR BIOLOGY-CLIFTON THEN TOTOWA- %D 2004 %T Sequencing Strategies for Parasite Genomes %A Bartholomeu,D. %A El‐Sayed, Najib M. %A Melville,S. E. %B METHODS IN MOLECULAR BIOLOGY-CLIFTON THEN TOTOWA- %V 270 %P 1 - 16 %8 2004/// %G eng %0 Conference Paper %B Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms %D 2004 %T Structural and algorithmic aspects of massive social networks %A Eubank,Stephen %A Kumar,V. S. Anil %A Marathe,Madhav V. %A Srinivasan, Aravind %A Wang,Nan %X We study the algorithmic and structural properties of very large, realistic social contact networks. We consider the social network for the city of Portland, Oregon, USA, developed as a part of the TRANSIMS/EpiSims project at the Los Alamos National Laboratory. The most expressive social contact network is a bipartite graph, with two types of nodes: people and locations; edges represent people visiting locations on a typical day. Three types of results are presented. (i) Our empirical results show that many basic characteristics of the dataset are well-modeled by a random graph approach suggested by Fan Chung Graham and Lincoln Lu (the CL-model), with a power-law degree distribution. (ii) We obtain fast approximation algorithms for computing basic structural properties such as clustering coefficients and shortest paths distribution. We also study the dominating set problem for such networks; this problem arose in connection with optimal sensor-placement for disease-detection. We present a fast approximation algorithm for computing near-optimal dominating sets. (iii) Given the close approximations provided by the CL-model to our original dataset and the large data-volume, we investigate fast methods for generating such random graphs. We present methods that can generate such a random network in near-linear time, and show that these variants asymptotically share many key features of the CL-model, and also match the Portland social network.The structural results have been used to study the impact of policy decisions for controlling large-scale epidemics in urban environments. %B Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms %S SODA '04 %I Society for Industrial and Applied Mathematics %C Philadelphia, PA, USA %P 718 - 727 %8 2004/// %@ 0-89871-558-X %G eng %U http://dl.acm.org/citation.cfm?id=982792.982902 %0 Journal Article %J Journal of bioinformatics and computational biology %D 2004 %T Techniques for optimization of queries on integrated biological resources %A Lacroix,Z. %A Raschid, Louiqa %A Eckman,B. A %B Journal of bioinformatics and computational biology %V 2 %P 375 - 412 %8 2004/// %G eng %N 2 %0 Journal Article %J 2003 IEEE Workshop on Applications of Signal Processing to Audio and Acoustics: October 19-22, 2003, Mohonk Mountain House, New Paltz, NY, USA %D 2003 %T 2003 IEEE Workshop on Applications of Signal Processing to Audio and Acoustics October 19-22, 2003, New Paltz. NY %A Adams,N. %A EssI,G. %A Makino,S. %A Martens,A.A.C.F.W.L. %A Algazi,R. %A Fellers,M. %A Martin,R. %A Avendano,C. %A Fielder,L. %A Mellody,M. %A others %B 2003 IEEE Workshop on Applications of Signal Processing to Audio and Acoustics: October 19-22, 2003, Mohonk Mountain House, New Paltz, NY, USA %P 238 - 238 %8 2003/// %G eng %0 Journal Article %J SIAM Journal on Numerical Analysis %D 2003 %T An Analysis of Smoothing Effects of Upwinding Strategies for the Convection-Diffusion Equation %A Elman, Howard %A Alison Ramage %X Using a technique for constructing analytic expressions for discrete solutions to the convection-diffusion equation, we examine and characterize the effects of upwinding strategies on solution quality. In particular, for grid-aligned flow and discretization based on bilinear finite elements with streamline upwinding, we show precisely how the amount of upwinding included in the discrete operator affects solution oscillations and accuracy when different types of boundary layers are present. This analysis provides a basis for choosing a streamline upwinding parameter which also gives accurate solutions for problems with non-grid-aligned and variable speed flows. In addition, we show that the same analytic techniques provide insight into other discretizations, such as a finite difference method that incorporates streamline diffusion and the isotropic artificial diffusion method. %B SIAM Journal on Numerical Analysis %V 40 %P 254 - 281 %8 2003/01/01/ %@ 0036-1429 %G eng %U http://www.jstor.org/stable/4100953 %N 1 %0 Conference Paper %B IEEE Global Telecommunications Conference, 2003. GLOBECOM '03 %D 2003 %T Bootstrapping security associations for routing in mobile ad-hoc networks %A Bobba,R. B %A Eschenauer,L. %A Gligor,V. %A Arbaugh, William A. %K ad hoc networks %K bootstrapping security association %K Cryptographic protocols %K dynamic source routing protocol %K Fabrics %K Intelligent networks %K IP address %K IP key %K IP networks %K Message authentication %K mobile ad-hoc network %K mobile radio %K Protection %K Public key %K public key cryptography %K routing layer security reliability %K routing protocols %K secure routing %K Security %K security service %K statistically unique cryptographically verification %K telecommunication security %X 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. %B IEEE Global Telecommunications Conference, 2003. GLOBECOM '03 %I IEEE %V 3 %P 1511- 1515 vol.3 - 1511- 1515 vol.3 %8 2003/12/01/5 %@ 0-7803-7974-8 %G eng %R 10.1109/GLOCOM.2003.1258490 %0 Conference Paper %B Proceedings of the 14th IEEE Visualization 2003 (VIS'03) %D 2003 %T The Challenge of Missing and Uncertain Data %A Eaton,Cyntrica %A Plaisant, Catherine %A Drizd,Terence %B Proceedings of the 14th IEEE Visualization 2003 (VIS'03) %S VIS '03 %I IEEE Computer Society %C Washington, DC, USA %P 100– - 100– %8 2003/// %@ 0-7695-2030-8 %G eng %U http://dx.doi.org/10.1109/VIS.2003.10029 %R 10.1109/VIS.2003.10029 %0 Journal Article %J Mathematics of computation %D 2003 %T A characterisation of oscillations in the discrete two-dimensional convection-diffusion equation %A Elman, Howard %A Ramage, A. %B Mathematics of computation %V 72 %P 263 - 288 %8 2003/// %G eng %N 241 %0 Journal Article %J Linear Algebra and its Applications %D 2003 %T Complete stagnation of %A Zavorin, Ilya %A O'Leary, Dianne P. %A Elman, Howard %K Convergence %K GMRES %K iterative methods %K Stagnation %X We study problems for which the iterative method for solving linear systems of equations makes no progress in its initial iterations. Our tool for analysis is a nonlinear system of equations, the stagnation system, that characterizes this behavior. We focus on complete stagnation, for which there is no progress until the last iteration. We give necessary and sufficient conditions for complete stagnation of systems involving unitary matrices, and show that if a normal matrix completely stagnates then so does an entire family of nonnormal matrices with the same eigenvalues. Finally, we show that there are real matrices for which complete stagnation occurs for certain complex right-hand sides but not for real ones. %B Linear Algebra and its Applications %V 367 %P 165 - 183 %8 2003/07/01/ %@ 0024-3795 %G eng %U http://www.sciencedirect.com/science/article/pii/S0024379502006122 %R 16/S0024-3795(02)00612-2 %0 Journal Article %J Linear Algebra and its Applications %D 2003 %T Complete stagnation of GMRES %A Zavorin, Ilya %A O’Leary,Dianne P. %A Elman, Howard %K Convergence %K GMRES %K iterative methods %K Stagnation %X We study problems for which the iterative method gmres for solving linear systems of equations makes no progress in its initial iterations. Our tool for analysis is a nonlinear system of equations, the stagnation system, that characterizes this behavior. We focus on complete stagnation, for which there is no progress until the last iteration. We give necessary and sufficient conditions for complete stagnation of systems involving unitary matrices, and show that if a normal matrix completely stagnates then so does an entire family of nonnormal matrices with the same eigenvalues. Finally, we show that there are real matrices for which complete stagnation occurs for certain complex right-hand sides but not for real ones. %B Linear Algebra and its Applications %V 367 %P 165 - 183 %8 2003/07/01/ %@ 0024-3795 %G eng %U http://www.sciencedirect.com/science/article/pii/S0024379502006122 %R 10.1016/S0024-3795(02)00612-2 %0 Book %D 2003 %T Design Considerations for Optically Connected Systems on Chip %A Bhattacharyya, Shuvra S. %A Bambha,N. K %A Euliss,G. %I MARYLAND UNIV COLLEGE PARK DEPT OF ELECTRICAL AND COMPUTER ENGINEERING %8 2003/// %G eng %0 Journal Article %J Applied and Environmental MicrobiologyAppl. Environ. Microbiol. %D 2003 %T Direct Detection of Vibrio Cholerae and ctxA in Peruvian Coastal Water and Plankton by PCR %A Lipp,Erin K. %A Rivera,Irma N. G. %A Gil,Ana I. %A Espeland,Eric M. %A Choopun,Nipa %A Louis,Valérie R. %A Russek-Cohen,Estelle %A Huq,Anwar %A Rita R Colwell %X 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. %B Applied and Environmental MicrobiologyAppl. Environ. Microbiol. %V 69 %P 3676 - 3680 %8 2003/06/01/ %@ 0099-2240, 1098-5336 %G eng %U http://aem.asm.org/content/69/6/3676 %N 6 %R 10.1128/AEM.69.6.3676-3680.2003 %0 Journal Article %J Pattern Analysis and Machine Intelligence, IEEE Transactions on %D 2003 %T Efficient kernel density estimation using the fast gauss transform with applications to color modeling and tracking %A Elgammal,A. %A Duraiswami, Ramani %A Davis, Larry S. %K algorithms; %K Color %K Computer %K density %K estimation; %K fast %K function; %K Gauss %K image %K Kernel %K modeling; %K segmentation; %K tracking; %K transform; %K transforms; %K VISION %K vision; %X Many vision algorithms depend on the estimation of a probability density function from observations. Kernel density estimation techniques are quite general and powerful methods for this problem, but have a significant disadvantage in that they are computationally intensive. In this paper, we explore the use of kernel density estimation with the fast Gauss transform (FGT) for problems in vision. The FGT allows the summation of a mixture of ill Gaussians at N evaluation points in O(M+N) time, as opposed to O(MN) time for a naive evaluation and can be used to considerably speed up kernel density estimation. We present applications of the technique to problems from image segmentation and tracking and show that the algorithm allows application of advanced statistical techniques to solve practical vision problems in real-time with today's computers. %B Pattern Analysis and Machine Intelligence, IEEE Transactions on %V 25 %P 1499 - 1504 %8 2003/11// %@ 0162-8828 %G eng %N 11 %R 10.1109/TPAMI.2003.1240123 %0 Journal Article %J Pattern Analysis and Machine Intelligence, IEEE Transactions on %D 2003 %T Efficient kernel density estimation using the fast gauss transform with applications to color modeling and tracking %A Elgammal,A. %A Duraiswami, Ramani %A Davis, Larry S. %B Pattern Analysis and Machine Intelligence, IEEE Transactions on %V 25 %P 1499 - 1504 %8 2003/// %G eng %N 11 %0 Conference Paper %B Image and Signal Processing and Analysis, 2003. ISPA 2003. Proceedings of the 3rd International Symposium on %D 2003 %T Exemplar-based tracking and recognition of arm gestures %A Elgammal,A. %A Shet,V. %A Yacoob,Yaser %A Davis, Larry S. %K arm %K constrains; %K correspondence-free %K edge %K exemplar-based %K framework; %K gesture %K hidden %K HMM; %K image %K logic; %K Markov %K MATCHING %K matching; %K model; %K models; %K probabilistic %K recognition; %K scheme; %K segmentation; %K temporal %K tracking; %K weighted %X This paper presents a probabilistic exemplar-based framework for recognizing gestures. The approach is based on representing each gesture as a sequence of learned body poses. The gestures are recognized through a probabilistic framework for matching these body poses and for imposing temporal constrains between different poses. Matching individual poses to image data is performed using a probabilistic formulation for edge matching to obtain a likelihood measurement for each individual pose. The paper introduces a correspondence-free weighted matching scheme for edge templates that emphasize discriminating features in the matching. The weighting does not require establishing correspondences between the different pose models. The probabilistic framework also imposes temporal constrains between different pose through a learned hidden Markov model (HMM) of each gesture. %B Image and Signal Processing and Analysis, 2003. ISPA 2003. Proceedings of the 3rd International Symposium on %V 2 %P 656 - 661 Vol.2 - 656 - 661 Vol.2 %8 2003/09// %G eng %R 10.1109/ISPA.2003.1296358 %0 Journal Article %J Nature %D 2003 %T The genome sequence of Bacillus anthracis Ames and comparison to closely related bacteria %A Read,Timothy D. %A Peterson,Scott N. %A Tourasse,Nicolas %A Baillie,Les W. %A Paulsen,Ian T. %A Nelson,Karen E. %A Tettelin,Herv|[eacute]| %A Fouts,Derrick E. %A Eisen,Jonathan A. %A Gill,Steven R. %A Holtzapple,Erik K. %A |[Oslash]|kstad,Ole Andreas %A Helgason,Erlendur %A Rilstone,Jennifer %A Wu,Martin %A Kolonay,James F. %A Beanan,Maureen J. %A Dodson,Robert J. %A Brinkac,Lauren M. %A Gwinn,Michelle %A DeBoy,Robert T. %A Madpu,Ramana %A Daugherty,Sean C. %A Durkin,A. Scott %A Haft,Daniel H. %A Nelson,William C. %A Peterson,Jeremy D. %A Pop, Mihai %A Khouri,Hoda M. %A Radune,Diana %A Benton,Jonathan L. %A Mahamoud,Yasmin %A Jiang,Lingxia %A Hance,Ioana R. %A Weidman,Janice F. %A Berry,Kristi J. %A Plaut,Roger D. %A Wolf,Alex M. %A Watkins,Kisha L. %A Nierman,William C. %A Hazen,Alyson %A Cline,Robin %A Redmond,Caroline %A Thwaite,Joanne E. %A White,Owen %A Salzberg,Steven L. %A Thomason,Brendan %A Friedlander,Arthur M. %A Koehler,Theresa M. %A Hanna,Philip C. %A Kolst|[oslash]|,Anne-Brit %A Fraser,Claire M. %X 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—including haemolysins, phospholipases and iron acquisition functions—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. %B Nature %V 423 %P 81 - 86 %8 2003/05/01/ %@ 0028-0836 %G eng %U http://www.nature.com/nature/journal/v423/n6935/full/nature01586.html %N 6935 %R 10.1038/nature01586 %0 Conference Paper %B Multimedia and Expo, 2003. ICME '03. Proceedings. 2003 International Conference on %D 2003 %T Image-based pan-tilt camera control in a multi-camera surveillance environment %A Lim,Ser-Nam %A Elgammal,A. %A Davis, Larry S. %K automated %K camera %K cameras; %K control; %K detection; %K environment; %K image %K image-based %K information; %K multicamera %K object %K pan-tilt %K position; %K processing; %K sensors; %K Surveillance %K surveillance; %K systems; %K vantage %K zero-position; %K zero-positions; %X In automated surveillance systems with multiple cameras, the system must be able to position the cameras accurately. Each camera must be able to pan-tilt such that an object detected in the scene is in a vantage position in the camera's image plane and subsequently capture images of that object. Typically, camera calibration is required. We propose an approach that uses only image-based information. Each camera is assigned a pan-tilt zero-position. Position of an object detected in one camera is related to the other cameras by homographies between the zero-positions while different pan-tilt positions of the same camera are related in the form of projective rotations. We then derive that the trajectories in the image plane corresponding to these projective rotations are approximately circular for pan and linear for tilt. The camera control technique is subsequently tested in a working prototype. %B Multimedia and Expo, 2003. ICME '03. Proceedings. 2003 International Conference on %V 1 %P I - 645-8 vol.1 - I - 645-8 vol.1 %8 2003/07// %G eng %R 10.1109/ICME.2003.1221000 %0 Conference Paper %B Computer Vision and Pattern Recognition, 2003. Proceedings. 2003 IEEE Computer Society Conference on %D 2003 %T Learning dynamics for exemplar-based gesture recognition %A Elgammal,A. %A Shet,V. %A Yacoob,Yaser %A Davis, Larry S. %K arbitrary %K body %K by %K Computer %K constraint; %K detection; %K discrete %K distribution %K dynamics; %K edge %K estimation; %K example; %K exemplar %K exemplar-based %K extraction; %K feature %K framework; %K gesture %K gesture; %K hidden %K HMM; %K human %K image %K learning %K Markov %K matching; %K model; %K models; %K motion; %K nonparametric %K pose %K probabilistic %K recognition; %K sequence; %K space; %K state; %K statistics; %K system %K temporal %K tool; %K view-based %K vision; %X This paper addresses the problem of capturing the dynamics for exemplar-based recognition systems. Traditional HMM provides a probabilistic tool to capture system dynamics and in exemplar paradigm, HMM states are typically coupled with the exemplars. Alternatively, we propose a non-parametric HMM approach that uses a discrete HMM with arbitrary states (decoupled from exemplars) to capture the dynamics over a large exemplar space where a nonparametric estimation approach is used to model the exemplar distribution. This reduces the need for lengthy and non-optimal training of the HMM observation model. We used the proposed approach for view-based recognition of gestures. The approach is based on representing each gesture as a sequence of learned body poses (exemplars). The gestures are recognized through a probabilistic framework for matching these body poses and for imposing temporal constraints between different poses using the proposed non-parametric HMM. %B Computer Vision and Pattern Recognition, 2003. Proceedings. 2003 IEEE Computer Society Conference on %V 1 %P I-571 - I-578 vol.1 - I-571 - I-578 vol.1 %8 2003/06// %G eng %R 10.1109/CVPR.2003.1211405 %0 Conference Paper %B IEEE International Conference on Systems, Man and Cybernetics, 2003 %D 2003 %T Non-parametric expectation maximization: a learning automata approach %A Abd-Almageed, Wael %A El-Osery,A. %A Smith,C.E. %K Automatic speech recognition %K bivariate simulation data %K Computational modeling %K Computer vision %K Density functional theory %K expectation maximization technique %K learning automata %K mixture parameters estimation %K nonparametric expectation maximization %K nonparametric statistics %K optimisation %K parameter estimation %K Parzen Window %K PDF %K probability %K probability density function %K Speech processing %K Speech recognition %K stochastic learning automata %K Stochastic processes %K stochastic technique %X The famous expectation maximization technique suffers two major drawbacks. First, the number of components has to be specified apriori. Also, the expectation maximization is sensitive to initialization. In this paper, we present a new stochastic technique for estimating the mixture parameters. Parzen Window is used to estimate a discrete estimate of the PDF of the given data. Stochastic learning automata is then used to select the mixture parameters that minimize the distance between the discrete estimate of the PDF and the estimate of the expectation maximization. The validity of the proposed approach is verified using bivariate simulation data. %B IEEE International Conference on Systems, Man and Cybernetics, 2003 %I IEEE %V 3 %P 2996- 3001 vol.3 - 2996- 3001 vol.3 %8 2003/10// %@ 0-7803-7952-7 %G eng %R 10.1109/ICSMC.2003.1244347 %0 Conference Paper %B Computer Vision and Pattern Recognition, 2003. Proceedings. 2003 IEEE Computer Society Conference on %D 2003 %T Probabilistic tracking in joint feature-spatial spaces %A Elgammal,A. %A Duraiswami, Ramani %A Davis, Larry S. %K analysis; %K appearance %K appearance; %K color; %K colour %K Computer %K constraint; %K deformation; %K detection; %K distribution; %K edge %K estimation; %K extraction; %K feature %K feature-spatial %K feature; %K function %K gradient; %K image %K intensity; %K joint %K likelihood %K local %K maximization; %K maximum %K nonparametric %K object %K objective %K occlusion; %K optical %K partial %K probabilistic %K probability; %K region %K representation; %K row %K similarity-based %K small %K space; %K structure; %K target %K tracker; %K tracking; %K transformation %K vision; %X In this paper, we present a probabilistic framework for tracking regions based on their appearance. We exploit the feature-spatial distribution of a region representing an object as a probabilistic constraint to track that region over time. The tracking is achieved by maximizing a similarity-based objective function over transformation space given a nonparametric representation of the joint feature-spatial distribution. Such a representation imposes a probabilistic constraint on the region feature distribution coupled with the region structure, which yields an appearance tracker that is robust to small local deformations and partial occlusion. We present the approach for the general form of joint feature-spatial distributions and apply it to tracking with different types of image features including row intensity, color and image gradient. %B Computer Vision and Pattern Recognition, 2003. Proceedings. 2003 IEEE Computer Society Conference on %V 1 %P I-781 - I-788 vol.1 - I-781 - I-788 vol.1 %8 2003/06// %G eng %R 10.1109/CVPR.2003.1211432 %0 Journal Article %J Proc. 2nd IEEE International Computer Society %D 2003 %T A query language to support scientific discovery %A Eckman,B. %A Deutsch,K. %A Janer,M. %A Lacroix,Z. %A Raschid, Louiqa %B Proc. 2nd IEEE International Computer Society %8 2003/// %G eng %0 Book %D 2003 %T Real 802.11 Security: Wi-Fi Protected Access and 802.11 i, 480 pages %A Edney,J. %A Arbaugh, William A. %I Addison Wesley %8 2003/// %G eng %0 Conference Paper %B Proceedings. IEEE Conference on Advanced Video and Signal Based Surveillance, 2003. %D 2003 %T Scalable image-based multi-camera visual surveillance system %A Lim,Ser-Nam %A Davis, Larry S. %A Elgammal,A. %K ACQUISITION %K algorithm; %K camera; %K constraints; %K feature %K hidden %K image-based %K MATCHING %K maximum %K multi-camera %K occlusion %K pan-tilt-zoom %K PLAN %K prediction; %K processing; %K removal; %K scalable %K scheduling; %K signal %K Surveillance %K surveillance; %K system; %K task %K video %K view; %K visibility %K visual %K weight %X We describe the design of a scalable and wide coverage visual surveillance system. Scalability (the ability to add and remove cameras easily during system operation with minimal overhead and system degradation) is achieved by utilizing only image-based information for camera control. We show that when a pan-tilt-zoom camera pans and tilts, a given image point moves in a circular and a linear trajectory, respectively. We create a scene model using a plan view of the scene. The scene model makes it easy for us to handle occlusion prediction and schedule video acquisition tasks subject to visibility constraints. We describe a maximum weight matching algorithm to assign cameras to tasks that meet the visibility constraints. The system is illustrated both through simulations and real video from a 6-camera configuration. %B Proceedings. IEEE Conference on Advanced Video and Signal Based Surveillance, 2003. %P 205 - 212 %8 2003/07// %G eng %R 10.1109/AVSS.2003.1217923 %0 Journal Article %J Nucleic acids research %D 2003 %T The sequence and analysis of Trypanosoma brucei chromosome II %A El‐Sayed, Najib M. %A Ghedin,E. %A Song,J. %A MacLeod,A. %A Bringaud,F. %A Larkin,C. %A Wanless,D. %A Peterson,J. %A Hou,L. %A Taylor,S. %A others %B Nucleic acids research %V 31 %P 4856 - 4856 %8 2003/// %G eng %N 16 %0 Conference Paper %B Proceedings of the SIGCHI conference on Human factors in computing systems %D 2003 %T Technology probes: inspiring design for and with families %A Hutchinson,Hilary %A Mackay,Wendy %A Westerlund,Bo %A Bederson, Benjamin B. %A Druin, Allison %A Plaisant, Catherine %A Beaudouin-Lafon,Michel %A Conversy,Stéphane %A Evans,Helen %A Hansen,Heiko %A Roussel,Nicolas %A Eiderbäck,Björn %K computer mediated communication %K ethnography %K Home %K participatory design and cooperative design %X We describe a new method for use in the process of co-designing technologies with users called technology probes. Technology probes are simple, flexible, adaptable technologies with three interdisciplinary goals: the social science goal of understanding the needs and desires of users in a real-world setting, the engineering goal of field-testing the technology, and the design goal of inspiring users and researchers to think about new technologies. We present the results of designing and deploying two technology probes, the messageProbe and the videoProbe, with diverse families in France, Sweden, and the U.S. We conclude with our plans for creating new technologies for and with families based on our experiences. %B Proceedings of the SIGCHI conference on Human factors in computing systems %S CHI '03 %I ACM %C New York, NY, USA %P 17 - 24 %8 2003/// %@ 1-58113-630-7 %G eng %U http://doi.acm.org/10.1145/642611.642616 %R 10.1145/642611.642616 %0 Journal Article %J Commun. ACM %D 2003 %T Use of the SAND spatial browser for digital government applications %A Samet, Hanan %A Alborzi,Houman %A Brabec,František %A Esperança,Claudio %A Hjaltason,Gísli R. %A Morgan,Frank %A Tanin,Egemen %K GIS %X Numerous federal agencies produce official statistics made accessible to ordinary citizens for searching and data retrieval. This is frequently done via the Internet through a Web browser interface. If this data is presented in textual format, it can often be searched and retrieved by such attributes as topic, responsible agency, keywords, or press release. However, if the data is of spatial nature, for example, in the form of a map, then using text-based queries is often too cumbersome for the intended audience. We describe the use of the SAND Spatial Browser to provide more power to users of these databases by enabling them to define and explore the specific spatial region of interest graphically. The SAND Spatial Browser allows users to form either purely spatial or mixed spatial/nonspatial queries intuitively, which can present information to users that might have been missed if only a textual interface was available. %B Commun. ACM %V 46 %P 61 - 64 %8 2003/01// %@ 0001-0782 %G eng %U http://doi.acm.org/10.1145/602421.602453 %N 1 %R 10.1145/602421.602453 %0 Journal Article %J ACM Comput. Surv. %D 2002 %T Algorithmic issues in modeling motion %A Agarwal,Pankaj K. %A Guibas,Leonidas J. %A Edelsbrunner,Herbert %A Erickson,Jeff %A Isard,Michael %A Har-Peled,Sariel %A Hershberger,John %A Jensen,Christian %A Kavraki,Lydia %A Koehl,Patrice %A Lin,Ming %A Manocha,Dinesh %A Metaxas,Dimitris %A Mirtich,Brian %A Mount, Dave %A Muthukrishnan,S. %A Pai,Dinesh %A Sacks,Elisha %A Snoeyink,Jack %A Suri,Subhash %A Wolefson,Ouri %K computational geometry %K Computer vision %K mobile networks %K modeling %K molecular biology %K motion modeling %K physical simulation %K robotoics %K spatio-temporal databases %X 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. %B ACM Comput. Surv. %V 34 %P 550 - 572 %8 2002/12// %@ 0360-0300 %G eng %U http://doi.acm.org/10.1145/592642.592647 %N 4 %R 10.1145/592642.592647 %0 Journal Article %J Molecular and Biochemical Parasitology %D 2002 %T Analysis of stage-specific gene expression in the bloodstream and the procyclic form of Trypanosoma brucei using a genomic DNA-microarray %A Diehl,Susanne %A Diehl,Frank %A El‐Sayed, Najib M. %A Clayton,Christine %A Hoheisel,Jörg D. %K Expression %K Gene %K Microarray %K Regulation %K Trypanosoma brucei %X A microarray comprising 21[punctuation space]024 different PCR products spotted on glass slides was constructed for gene expression studies on Trypanosoma brucei. The arrayed fragments were generated from a T. brucei shotgun clone library, which had been prepared from randomly sheared and size-fractionated genomic DNA. For the identification of stage-specific gene activity, total RNA from in vitro cultures of the human, long slender form and the insect, procyclic form of the parasite was labelled and hybridised to the microarray. Approximately 75% of the genomic fragments produced a signal and about 2% exhibited significant differences between the transcript levels in the bloodstream and procyclic forms. A few results were confirmed by Northern blot analysis or reverse-transcription and PCR. Three hundred differentially regulated clones have been selected for sequencing. So far, of 33 clones that showed about 2-fold or more over-expression in bloodstream forms, 15 contained sequences similar to those of VSG expression sites and at least six others appeared non-protein-coding. Of 29 procyclic-specific clones, at least eight appeared not to be protein-coding. A surprisingly large proportion of known regulated genes was already identified in this small sample, and some new ones were found, illustrating the utility of genomic arrays. %B Molecular and Biochemical Parasitology %V 123 %P 115 - 123 %8 2002/08/28/ %@ 0166-6851 %G eng %U http://www.sciencedirect.com/science/article/pii/S016668510200138X %N 2 %R 16/S0166-6851(02)00138-X %0 Journal Article %J International Journal for Numerical Methods in Fluids %D 2002 %T Block preconditioners for the discrete incompressible Navier–Stokes equations %A Elman, Howard %A Silvester, David J %A Wathen, Andrew J %K Iterative algorithms %K Navier–Stokes equations %K preconditioning %X We examine the convergence characteristics of iterative methods based on a new preconditioning operator for solving the linear systems arising from discretization and linearization of the steady-state Navier–Stokes equations. For steady-state problems, we show that the preconditioned problem has an eigenvalue distribution consisting of a tightly clustered set together with a small number of outliers. These characteristics are directly correlated with the convergence properties of iterative solvers, with convergence rates independent of mesh size and only mildly dependent on viscosity. For evolutionary problems, we show that implicit treatment of the time derivatives leads to systems for which convergence is essentially independent of viscosity. Copyright © 2002 John Wiley & Sons, Ltd. %B International Journal for Numerical Methods in Fluids %V 40 %P 333 - 344 %8 2002/09/30/ %@ 1097-0363 %G eng %U http://onlinelibrary.wiley.com/doi/10.1002/fld.311/abstract %N 3‐4 %R 10.1002/fld.311 %0 Book Section %B Chip TechnologyChip Technology %D 2002 %T Combinatorial Algorithms for Design of DNA Arrays %A Hannenhalli, Sridhar %A Hubbell,Earl %A Lipshutz,Robert %A Pevzner,Pavel %E Hoheisel,Jörg %E Brazma,A. %E Büssow,K. %E Cantor,C. %E Christians,F. %E Chui,G. %E Diaz,R. %E Drmanac,R. %E Drmanac,S. %E Eickhoff,H. %E Fellenberg,K. %E Hannenhalli, Sridhar %E Hoheisel,J. %E Hou,A. %E Hubbell,E. %E Jin,H. %E Jin,P. %E Jurinke,C. %E Konthur,Z. %E Köster,H. %E Kwon,S. %E Lacy,S. %E Lehrach,H. %E Lipshutz,R. %E Little,D. %E Lueking,A. %E McGall,G. %E Moeur,B. %E Nordhoff,E. %E Nyarsik,L. %E Pevzner,P. %E Robinson,A. %E Sarkans,U. %E Shafto,J. %E Sohail,M. %E Southern,E. %E Swanson,D. %E Ukrainczyk,T. %E van den Boom,D. %E Vilo,J. %E Vingron,M. %E Walter,G. %E Xu,C. %X Optimal design of DNA arrays requires the development of algorithms with two-fold goals: reducing the effects caused by unintended illumination ( border length minimization problem ) and reducing the complexity of masks ( mask decomposition problem ). We describe algorithms that reduce the number of rectangles in mask decomposition by 20–30% as compared to a standard array design under the assumption that the arrangement of oligonucleotides on the array is fixed. This algorithm produces provably optimal solution for all studied real instances of array design. We also address the difficult problem of finding an arrangement which minimizes the border length and come up with a new idea of threading that significantly reduces the border length as compared to standard designs. %B Chip TechnologyChip Technology %S Advances in Biochemical Engineering/Biotechnology %I Springer Berlin / Heidelberg %V 77 %P 1 - 19 %8 2002/// %@ 978-3-540-43215-9 %G eng %U http://dx.doi.org/10.1007/3-540-45713-5_1 %0 Journal Article %J Kowalski, Part I %D 2002 %T Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A %A Eiter,T. %A Mascardi,V. %A V.S. Subrahmanian %B Kowalski, Part I %P 586 - 625 %8 2002/// %G eng %0 Book Section %B Computational Logic: Logic Programming and BeyondComputational Logic: Logic Programming and Beyond %D 2002 %T Error-Tolerant Agents %A Eiter,Thomas %A Mascardi,Viviana %A Subrahmanian,V. %E Kakas,Antonis %E Sadri,Fariba %K Computer %K Science %X The use of agents in today’s Internet world is expanding rapidly. Yet, agent developers proceed largely under the optimistic assumption that agents will be error-free. Errors may arise in agents for numerous reasons — agents may share a workspace with other agents or humans and updates made by these other entities may cause an agent to face a situation that it was not explicitly programmed to deal with. Likewise, errors in coding agents may lead to inconsistent situations where it is unclear how the agent should act. In this paper, we define an agent execution model that allows agents to continue acting “reasonably” even when some errors of the above types occur. More importantly, in our framework, agents take “repair” actions automatically when confronted with such situations, but while taking such repair actions, they can often continue to engage in work and/or interactions with other agents that are unaffected by repairs. %B Computational Logic: Logic Programming and BeyondComputational Logic: Logic Programming and Beyond %S Lecture Notes in Computer Science %I Springer Berlin / Heidelberg %V 2407 %P 83 - 104 %8 2002/// %@ 978-3-540-43959-2 %G eng %U http://dx.doi.org/10.1007/3-540-45628-7_22 %0 Journal Article %J Nature %D 2002 %T Genome sequence and comparative analysis of the model rodent malaria parasite Plasmodium yoelii yoelii %A Carlton,Jane M. %A Angiuoli,Samuel V %A Suh,Bernard B. %A Kooij,Taco W. %A Pertea,Mihaela %A Silva,Joana C. %A Ermolaeva,Maria D. %A Allen,Jonathan E %A Jeremy D Selengut %A Koo,Hean L. %A Peterson,Jeremy D. %A Pop, Mihai %A Kosack,Daniel S. %A Shumway,Martin F. %A Bidwell,Shelby L. %A Shallom,Shamira J. %A Aken,Susan E. van %A Riedmuller,Steven B. %A Feldblyum,Tamara V. %A Cho,Jennifer K. %A Quackenbush,John %A Sedegah,Martha %A Shoaibi,Azadeh %A Cummings,Leda M. %A Florens,Laurence %A Yates,John R. %A Raine,J. Dale %A Sinden,Robert E. %A Harris,Michael A. %A Cunningham,Deirdre A. %A Preiser,Peter R. %A Bergman,Lawrence W. %A Vaidya,Akhil B. %A Lin,Leo H. van %A Janse,Chris J. %A Waters,Andrew P. %A Smith,Hamilton O. %A White,Owen R. %A Salzberg,Steven L. %A Venter,J. Craig %A Fraser,Claire M. %A Hoffman,Stephen L. %A Gardner,Malcolm J. %A Carucci,Daniel J. %X 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. %B Nature %V 419 %P 512 - 519 %8 2002/10/03/ %@ 0028-0836 %G eng %U http://www.nature.com/nature/journal/v419/n6906/full/nature01099.html %N 6906 %R 10.1038/nature01099 %0 Conference Paper %B Workshop on Automatic Summarization %D 2002 %T GLEANS: A generator of logical extracts and abstracts for nice summaries %A Daumé, Hal %A Echihabi,A. %A Marcu,D. %A Munteanu,D. %A Soricut,R. %B Workshop on Automatic Summarization %P 9 - 14 %8 2002/// %G eng %0 Journal Article %J Molecular and Biochemical Parasitology %D 2002 %T Identification of non-autonomous non-LTR retrotransposons in the genome of Trypanosoma cruzi %A Bringaud,Frédéric %A García-Pérez,José Luis %A Heras,Sara R. %A Ghedin,Elodie %A El‐Sayed, Najib M. %A Andersson,Björn %A Baltz,Théo %A Lopez,Manuel C. %K Ingi %K L1Tc %K Non-LTR retrotransposon %K RIME %K Trypanosoma brucei %K Trypanosoma cruzi %X 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'-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. %B Molecular and Biochemical Parasitology %V 124 %P 73 - 78 %8 2002/09/10/ %@ 0166-6851 %G eng %U http://www.sciencedirect.com/science/article/pii/S0166685102001676 %N 1-2 %R 16/S0166-6851(02)00167-6 %0 Journal Article %J SIAM Journal on scientific computing %D 2002 %T A multigrid method enhanced by Krylov subspace iteration for discrete Helmholtz equations %A Elman, Howard %A Ernst, O. G %A O'Leary, Dianne P. %A others %B SIAM Journal on scientific computing %V 23 %P 1291 - 1315 %8 2002/// %G eng %N 4 %0 Journal Article %J Eukaryotic cell %D 2002 %T A new, expressed multigene family containing a hot spot for insertion of retroelements is associated with polymorphic subtelomeric regions of Trypanosoma brucei %A Bringaud,F. %A Biteau,N. %A Melville,S. E. %A Hez,S. %A El‐Sayed, Najib M. %A Leech,V. %A Berriman,M. %A Hall,N. %A Donelson,J. E %A Baltz,T. %B Eukaryotic cell %V 1 %P 137 - 137 %8 2002/// %G eng %N 1 %0 Report %D 2002 %T A Parallel Block Multi-level Preconditioner for the 3D Incompressible Navier--Stokes Equations %A Elman, Howard %A Howle, V. E %A Shadid,John %A Tuminaro,Ray %K Technical Report %X The development of robust and efficient algorithms for both steady-statesimulations and fully-implicit time integration of the Navier--Stokes equations is an active research topic. To be effective, the linear subproblems generated by these methods require solution techniques that exhibit robust and rapid convergence. In particular, they should be insensitive to parameters in the problem such as mesh size, time step, and Reynolds number. In this context, we explore a parallel preconditioner based on a block factorization of the coefficient matrix generated in an Oseen nonlinear iteration for the primitive variable formulation of the system. The key to this preconditioner is the approximation of a certain Schur complement operator by a technique first proposed by Kay, Loghin, and Wathen [25] and Silvester, Elman, Kay, and Wathen [45]. The resulting operator entails subsidiary computations (solutions of pressure Poisson and convection--diffusion subproblems) that are similar to those required for decoupled solution methods; however, in this case these solutions are applied as preconditioners to the coupled Oseen system. One important aspect of this approach is that the convection--diffusion and Poisson subproblems are significantly easier to solve than the entire coupled system, and a solver can be built using tools developed for the subproblems. In this paper, we apply smoothed aggregation algebraic multigrid to both subproblems. Previous work has focused on demonstrating the optimality of these preconditioners with respect to mesh size on serial, two-dimensional, steady-state computations employing geometric multi-grid methods; we focus on extending these methods to large-scale, parallel, three-dimensional, transient and steady-state simulations employing algebraic multigrid (AMG) methods. Our results display nearly optimal convergence rates for steady-state solutions as well as for transient solutions over a wide range of CFL numbers on the two-dimensional and three-dimensional lid-driven cavity problem. Also UMIACS-TR-2002-95 %I Instititue for Advanced Computer Studies, Univ of Maryland, College Park %V UMIACS-TR-2002-95 %8 2002/10/25/ %G eng %U http://drum.lib.umd.edu//handle/1903/1239 %0 Journal Article %J Numerische Mathematik %D 2002 %T Performance and analysis of saddle point preconditioners for the discrete steady-state Navier-Stokes equations %A Elman, Howard %A Silvester, D. J %A Wathen, A. J %B Numerische Mathematik %V 90 %P 665 - 688 %8 2002/// %G eng %N 4 %0 Conference Paper %B SC Conference %D 2002 %T SIGMA: A Simulator Infrastructure to Guide Memory Analysis %A DeRose,Luiz %A Ekanadham, K. %A Hollingsworth, Jeffrey K %A Sbaraglia, Simone %X In this paper we present SIGMA (Simulation Infrastructure to Guide Memory Analysis), a new data collection framework and family of cache analysis tools. The SIGMA environment provides detailed cache information by gathering memory reference data using software-based instrumentation. This infrastructure can facilitate quick probing into the factors that influence the performance of an application by highlighting bottleneck scenarios including: excessive cache/TLB misses and inefficient data layouts. The tool can also assist in perturbation analysis to determine performance variations caused by changes to architecture or program. Our validation tests using the SPEC Swim benchmark show that most of the performance metrics obtained with SIGMA are within 1% of the metrics obtained with hardware performance counters, with the advantage that SIGMA provides performance data on a data structure level, as specified by the programmer. %B SC Conference %I IEEE Computer Society %C Los Alamitos, CA, USA %P 1 - 1 %8 2002/// %G eng %R http://doi.ieeecomputersociety.org/10.1109/SC.2002.10055 %0 Patent %D 2002 %T System and method for entering text in a virtual environment %A Evans,Francine %A Skiena,Steven %A Varshney, Amitabh %E The Research Foundation of the State University of New York %X A system and method for entering text in a virtual environment by sensory gloves. The user enters a key that represents one or more letters by simulating a press of a keyboard in the gloves. The user calibrates the gloves by entering text, during which time the system establishes threshold values that represent simulated presses for each finger. After the initial calibration of the sensory gloves, the user enters text with simulated finger presses. The system distinguishes which movements are intended as simulated finger presses by examining the relative motions of fingers and maintaining dynamic thresholds. Errors are alleviated by providing feedback to the user, such as beeps and a visual display of the fingers and the current text. Because keys may represent more than one character, the system determines the intended text by probabilistic analysis and the Viterbi algorithm. %V : 09/364,433 %8 2002/06/18/ %G eng %U http://www.google.com/patents?id=w0QJAAAAEBAJ %N 6407679 %0 Journal Article %J Advances in Information Retrieval %D 2002 %T Translation-based indexing for cross-language retrieval %A Oard, Douglas %A Ertunc,F. %B Advances in Information Retrieval %P 425 - 447 %8 2002/// %G eng %0 Journal Article %J Experimental Parasitology %D 2002 %T Trypanosoma cruzi: RNA structure and post-transcriptional control of tubulin gene expression %A Bartholomeu,Daniella C. %A Silva,Rosiane A. %A Galvão,Lucia M. C. %A El‐Sayed, Najib M. %A Donelson,John E. %A Teixeira,Santuza M.R. %X 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' 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' 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. %B Experimental Parasitology %V 102 %P 123 - 133 %8 2002/11// %@ 0014-4894 %G eng %U http://www.sciencedirect.com/science/article/pii/S0014489403000341 %N 3-4 %R 16/S0014-4894(03)00034-1 %0 Journal Article %J Journal of Parallel and Distributed Computing %D 2001 %T Achieving Efficiency and Accuracy in Simulation for I/O-Intensive Applications %A Eom, Hyeonsang %A Hollingsworth, Jeffrey K %K simulation; I/O-intensive applications; parallel or distributed applications; performance prediction; discrete-event simulation %X This paper presents a family of simulators for data-intensive applications, and a methodology to select the most efficient simulator based on a user-supplied requirement for accuracy. The methodology consists of a series of tests that select an appropriate simulation based on the attributes of the application. In addition, each simulator provides two estimates of application execution time: one for the minimum expected time and the other for the maximum. We present the results of applying the strategy to existing applications and show that we can accurately simulate applications tens to hundreds of times faster than application execution time. %B Journal of Parallel and Distributed Computing %V 61 %P 1732 - 1750 %8 2001/12// %@ 0743-7315 %G eng %U http://www.sciencedirect.com/science/article/pii/S0743731501917691 %N 12 %R 06/jpdc.2001.1769 %0 Journal Article %J Nucleic acids research %D 2001 %T Analysis of a donor gene region for a variant surface glycoprotein and its expression site in African trypanosomes %A LaCount,D. J %A El‐Sayed, Najib M. %A Kaul,S. %A Wanless,D. %A Turner,C. M.R %A Donelson,J. E %B Nucleic acids research %V 29 %P 2012 - 2012 %8 2001/// %G eng %N 10 %0 Book %D 2001 %T Becoming a Scholar in the Digital Age %A Duderstadt,James %A Arms,William %A Messina,Paul %A Ellisman,Mark %A Atkins,Daniel %A Fox,Edward %A Shneiderman, Ben %A Nissenbaum,Helen %A Lederberg,Joshua %K bibtex-import %K digital-library %K dlbook %I National Research Council %8 2001/// %G eng %0 Conference Paper %B Proceedings of the IEEE 2nd International Symposium on Bioinformatics and Bioengineering Conference, 2001 %D 2001 %T Optimized seamless integration of biomolecular data %A Eckman,B. A %A Lacroix,Z. %A Raschid, Louiqa %K analysis %K Bioinformatics %K biology computing %K cost based knowledge %K Costs %K Data analysis %K data mining %K data visualisation %K Data visualization %K Data warehouses %K decision support %K digital library %K Educational institutions %K information resources %K Internet %K low cost query evaluation plans %K Mediation %K meta data %K metadata %K molecular biophysics %K multiple local heterogeneous data sources %K multiple remote heterogeneous data sources %K optimized seamless biomolecular data integration %K scientific discovery %K scientific information systems %K semantic knowledge %K software libraries %K visual databases %K Visualization %X Today, scientific data is inevitably digitized, stored in a variety of heterogeneous formats, and is accessible over the Internet. Scientists need to access an integrated view of multiple remote or local heterogeneous data sources. They then integrate the results of complex queries and apply further analysis and visualization to support the task of scientific discovery. Building a digital library for scientific discovery requires accessing and manipulating data extracted from flat files or databases, documents retrieved from the Web, as well as data that is locally materialized in warehouses or is generated by software. We consider several tasks to provide optimized and seamless integration of biomolecular data. Challenges to be addressed include capturing and representing source capabilities; developing a methodology to acquire and represent metadata about source contents and access costs; and decision support to select sources and capabilities using cost based and semantic knowledge, and generating low cost query evaluation plans %B Proceedings of the IEEE 2nd International Symposium on Bioinformatics and Bioengineering Conference, 2001 %I IEEE %P 23 - 32 %8 2001/11/04/6 %@ 0-7695-1423-5 %G eng %R 10.1109/BIBE.2001.974408 %0 Report %D 2001 %T Preconditioners for Saddle Point Problems Arising in Computational Fluid Dynamics %A Elman, Howard %K Technical Report %X Discretization and linearization of the incompressible Navier-Stokesequations leads to linear algebraic systems in which the coefficient matrix has the form of a saddle point problem ( F B^T ) (u) = (f) (1) ( B 0 ) (p) (g) In this paper, we describe the development of efficient and general iterative solution algorithms for this class of problems. We review the case where (1) arises from the steady-state Stokes equations and show that solution methods such as the Uzawa algorithm lead naturally to a focus on the Schur complement operator BF^{-1}B^T together with efficient strategies of applying the action of F^{-1} to a vector. We then discuss the advantages of explicitly working with the coupled form of the block system (1). Using this point of view, we describe some new algorithms derived by developing efficient methods for the Schur complement systems arising from the Navier-Stokes equations, and we demonstrate their effectiveness for solving both steady-state and evolutionary problems. (Also referenced as UMIACS-TR-2001-88) %I Instititue for Advanced Computer Studies, Univ of Maryland, College Park %V UMIACS-TR-2001-88 %8 2001/12/03/ %G eng %U http://drum.lib.umd.edu//handle/1903/1170 %0 Journal Article %J ACM Trans. Database Syst. %D 2001 %T Probabilistic object bases %A Eiter,Thomas %A Lu,James J. %A Lukasiewicz,Thomas %A V.S. Subrahmanian %K consistency %K object-oriented database %K probabilistic object algebra %K probabilistic object base %K probability %K query language %K Query optimization %X Although there are many applications where an object-oriented data model is a good way of representing and querying data, current object database systems are unable to handle objects whose attributes are uncertain. In this article, we extend previous work by Kornatzky and Shimony to develop an algebra to handle object bases with uncertainty. We propose concepts of consistency for such object bases, together with an NP-completeness result, and classes of probabilistic object bases for which consistency is polynomially checkable. In addition, as certain operations involve conjunctions and disjunctions of events, and as the probability of conjunctive and disjunctive events depends both on the probabilities of the primitive events involved as well as on what is known (if anything) about the relationship between the events, we show how all our algebraic operations may be performed under arbitrary probabilistic conjunction and disjunction strategies. We also develop a host of equivalence results in our algebra, which may be used as rewrite rules for query optimization. Last but not least, we have developed a prototype probabilistic object base server on top of ObjectStore. We describe experiments to assess the efficiency of different possible rewrite rules. %B ACM Trans. Database Syst. %V 26 %P 264 - 312 %8 2001/09// %@ 0362-5915 %G eng %U http://doi.acm.org/10.1145/502030.502031 %N 3 %R 10.1145/502030.502031 %0 Conference Paper %B CHI '01 extended abstracts on Human factors in computing systems %D 2001 %T Therapeutic play with a storytelling robot %A Lathan,Corinna %A Vice,Jack Maxwell %A Tracey,Michael %A Plaisant, Catherine %A Druin, Allison %A Edward,Kris %A Montemayor,Jaime %K children %K design process %K rehabilitation %K robot %K therapeutic play %K user interface %X We are developing a prototype storytelling robot for use with children in rehabilitation. Children can remotely control a furry robot by using a variety of body sensors adapted to their disability or rehabilitation goal. We believe this robot can motivate children and help them reach their therapy goals through therapeutic play, either by exercising muscles or joints (e.g. for physically challenged children) or by reflecting on the stories (e.g. for children with developmental disabilities). To develop this technology we use an innovative design methodology involving children as design partners. %B CHI '01 extended abstracts on Human factors in computing systems %S CHI EA '01 %I ACM %C New York, NY, USA %P 27 - 28 %8 2001/// %@ 1-58113-340-5 %G eng %U http://doi.acm.org/10.1145/634067.634088 %R 10.1145/634067.634088 %0 Journal Article %J IEEE Transactions on Software Engineering %D 2001 %T A tool to help tune where computation is performed %A Eom, Hyeonsang %A Hollingsworth, Jeffrey K %K Computational modeling %K Current measurement %K Distributed computing %K distributed program %K distributed programming %K load balancing factor %K Load management %K parallel program %K parallel programming %K Performance analysis %K performance evaluation %K Performance gain %K performance metric %K Programming profession %K software metrics %K software performance evaluation %K Testing %K Time measurement %K tuning %X We introduce a new performance metric, called load balancing factor (LBF), to assist programmers when evaluating different tuning alternatives. The LBF metric differs from traditional performance metrics since it is intended to measure the performance implications of a specific tuning alternative rather than quantifying where time is spent in the current version of the program. A second unique aspect of the metric is that it provides guidance about moving work within a distributed or parallel program rather than reducing it. A variation of the LBF metric can also be used to predict the performance impact of changing the underlying network. The LBF metric is computed incrementally and online during the execution of the program to be tuned. We also present a case study that shows that our metric can accurately predict the actual performance gains for a test suite of six programs %B IEEE Transactions on Software Engineering %V 27 %P 618 - 629 %8 2001/07// %@ 0098-5589 %G eng %N 7 %R 10.1109/32.935854 %0 Journal Article %J International Journal for Parasitology %D 2000 %T The African trypanosome genome %A El‐Sayed, Najib M. %A Hegde,Priti %A Quackenbush,John %A Melville,Sara E. %A Donelson,John E. %X The haploid nuclear genome of the African trypanosome, Trypanosoma brucei, is about 35 Mb and varies in size among different trypanosome isolates by as much as 25%. The nuclear DNA of this diploid organism is distributed among three size classes of chromosomes: the megabase chromosomes of which there are at least 11 pairs ranging from 1 Mb to more than 6 Mb (numbered I-XI from smallest to largest); several intermediate chromosomes of 200-900 kb and uncertain ploidy; and about 100 linear minichromosomes of 50-150 kb. Size differences of as much as four-fold can occur, both between the two homologues of a megabase chromosome pair in a specific trypanosome isolate and among chromosome pairs in different isolates. The genomic DNA sequences determined to date indicated that about 50% of the genome is coding sequence. The chromosomal telomeres possess TTAGGG repeats and many, if not all, of the telomeres of the megabase and intermediate chromosomes are linked to expression sites for genes encoding variant surface glycoproteins (VSGs). The minichromosomes serve as repositories for VSG genes since some but not all of their telomeres are linked to unexpressed VSG genes. A gene discovery program, based on sequencing the ends of cloned genomic DNA fragments, has generated more than 20 Mb of discontinuous single-pass genomic sequence data during the past year, and the complete sequences of chromosomes I and II (about 1 Mb each) in T. brucei GUTat 10.1 are currently being determined. It is anticipated that the entire genomic sequence of this organism will be known in a few years. Analysis of a test microarray of 400 cDNAs and small random genomic DNA fragments probed with RNAs from two developmental stages of T. brucei demonstrates that the microarray technology can be used to identify batteries of genes differentially expressed during the various life cycle stages of this parasite. %B International Journal for Parasitology %V 30 %P 329 - 345 %8 2000/04// %@ 0020-7519 %G eng %U http://www.sciencedirect.com/science/article/pii/S0020751900000151 %N 4 %R 16/S0020-7519(00)00015-1 %0 Journal Article %J Technical Reports (CIS) %D 2000 %T Agents in Network Management %A Ertugay,Osman %A Hicks, Michael W. %A Smith,Jonathan %A Kornblum,Jessica %X The ubiquity and complexity of modern networks require automated management and control. With increases in scale, automated solutions based on simple data access models such as SNMP will give way to more distributed and algorithmic techniques. This article outlines present and near-term solutions based on the ideas of active networks and mobile agents, which permit sophisticated programmable control and management of ultra large scale networks. %B Technical Reports (CIS) %8 2000/02/26/ %G eng %U http://repository.upenn.edu/cis_reports/138 %0 Journal Article %J Molecular Biology and EvolutionMol Biol Evol %D 2000 %T A Case for Evolutionary Genomics and the Comprehensive Examination of Sequence Biodiversity %A Pollock,David D %A Eisen,Jonathan A. %A Doggett,Norman A %A Cummings, Michael P. %X Comparative analysis is one of the most powerful methods available for understanding the diverse and complex systems found in biology, but it is often limited by a lack of comprehensive taxonomic sampling. Despite the recent development of powerful genome technologies capable of producing sequence data in large quantities (witness the recently completed first draft of the human genome), there has been relatively little change in how evolutionary studies are conducted. The application of genomic methods to evolutionary biology is a challenge, in part because gene segments from different organisms are manipulated separately, requiring individual purification, cloning, and sequencing. We suggest that a feasible approach to collecting genome-scale data sets for evolutionary biology (i.e., evolutionary genomics) may consist of combination of DNA samples prior to cloning and sequencing, followed by computational reconstruction of the original sequences. This approach will allow the full benefit of automated protocols developed by genome projects to be realized; taxon sampling levels can easily increase to thousands for targeted genomes and genomic regions. Sequence diversity at this level will dramatically improve the quality and accuracy of phylogenetic inference, as well as the accuracy and resolution of comparative evolutionary studies. In particular, it will be possible to make accurate estimates of normal evolution in the context of constant structural and functional constraints (i.e., site-specific substitution probabilities), along with accurate estimates of changes in evolutionary patterns, including pairwise coevolution between sites, adaptive bursts, and changes in selective constraints. These estimates can then be used to understand and predict the effects of protein structure and function on sequence evolution and to predict unknown details of protein structure, function, and functional divergence. In order to demonstrate the practicality of these ideas and the potential benefit for functional genomic analysis, we describe a pilot project we are conducting to simultaneously sequence large numbers of vertebrate mitochondrial genomes. %B Molecular Biology and EvolutionMol Biol Evol %V 17 %P 1776 - 1788 %8 2000/12/01/ %@ 0737-4038, 1537-1719 %G eng %U http://mbe.oxfordjournals.org/content/17/12/1776 %N 12 %0 Journal Article %J Virtual Environments %D 2000 %T Continuously-adaptive haptic rendering %A El-Sana,J. %A Varshney, Amitabh %X Haptic display with force feedback is often necessary in sev-eral virtual environments. To enable haptic rendering of large datasets we introduce Continuously-Adaptive Haptic Rendering, a novel approach to reduce the complexity of the rendered dataset. We construct a continu- ous, multiresolution hierarchy of the model during the pre-processing and then at run time we use high-detail representation for regions around the probe pointer and coarser representation farther away. We achieve this by using a bell-shaped filter centered at the position of the probe pointer. Using our algorithm we are able to haptically render one to two orders of magnitude larger datasets than otherwise possible. Our approach is orthogonal to the previous work done in accelerating haptic rendering and thus can be used with them. %B Virtual Environments %V 2000 %P 135 - 135 %8 2000/// %G eng %0 Journal Article %J International Journal of High Performance Computing Applications %D 2000 %T Efficient performance prediction for large-scale, data-intensive applications %A Kurc, T. %A Uysal, M. %A Eom, H. %A Hollingsworth, Jeffrey K %A Saltz, J. %A Sussman, Alan %B International Journal of High Performance Computing Applications %V 14 %P 216 - 216 %8 2000/// %G eng %N 3 %0 Journal Article %J Computer Aided Design %D 2000 %T Efficiently computing and updating triangle strips for real-time rendering %A El-Sana,J. %A Evans,F. %A Kalaiah,A. %A Varshney, Amitabh %A Skiena,S. %A Azanli,E. %X Triangle strips are a widely used hardware-supported data-structure to compactly represent and efficiently render polygonal meshes. In thispaper we survey the efficient generation of triangle strips as well as their variants. We present efficient algorithms for partitioning polygonal meshes into triangle strips. Triangle strips have traditionally used a buffer size of two vertices. In this paper we also study the impact of larger buffer sizes and various queuing disciplines on the effectiveness of triangle strips. View-dependent simplification has emerged as a powerful tool for graphics acceleration in visualization of complex environments. However, in a view-dependent framework the triangle mesh connectivity changes at every frame making it difficult to use triangle strips. In this paper we present a novel data-structure, Skip Strip, that efficiently maintains triangle strips during such view-dependent changes. A Skip Strip stores the vertex hierarchy nodes in a skip-list-like manner with path compression. We anticipate that Skip Strips will provide a road-map to combine rendering acceleration techniques for static datasets, typical of retained-mode graphics applications, with those for dynamic datasets found in immediate-mode applications. %B Computer Aided Design %V 32 %P 753 - 772 %8 2000/// %G eng %N 13 %0 Journal Article %J Science %D 2000 %T The genome sequence of Drosophila melanogaster %A Adams,M.D. %A Celniker,S.E. %A Holt,R.A. %A Evans,C.A. %A Gocayne,J.D. %A Amanatides,P.G. %A Scherer,S.E. %A Li,P.W. %A Hoskins,R.A. %A Galle,R.F. %A others %X 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. %B Science %V 287 %P 2185 - 2185 %8 2000/// %@ 0036-8075, 1095-9203 %G eng %U http://www.sciencemag.org/content/287/5461/2185 %N 5461 %R 10.1126/science.287.5461.2185 %0 Journal Article %J IMA journal of numerical analysis %D 2000 %T Iterative methods for stabilized discrete convection-diffusion problems %A Shih, Y. T %A Elman, Howard %B IMA journal of numerical analysis %V 20 %P 333 - 333 %8 2000/// %G eng %N 3 %0 Journal Article %J PE & RS- Photogrammetric Engineering and Remote Sensing %D 2000 %T Kronos: A software system for the processing and retrieval of large-scale AVHRR data sets %A Zhang,Z. %A JaJa, Joseph F. %A Bader, D.A. %A Kalluri, SNV %A Song,H. %A El Saleous,N. %A Vermote,E. %A Townshend,J.R.G. %X Raw remotely sensed satellite data have to be processed andmapped into a standard projection in order to produce a multi- temporal data set which can then be used for regional or global Earth science studies. However, traditional methods of processing remotely sensed satellite data have inherent limitations because they are based on a fixed processing chain. Different users may need the data in different forms with possibly different processing steps; hence, additional transformations may have to be applied to the processed data, resulting in potentially significant errors. In this paper, we describe a software system, Kronos, for the generation of custom-tailored products from the Advanced Very High Resolution Radiometer (AVHRR) sensor. It allows the generation of a rich set of products that can be easily specified through a simple interface by scientists wishing to carry out Earth system modeling or analysis. Kronos is based on a flexible methodology and consists of four major components: ingest and preprocessing, indexing and storage, a search and processing engine, and a Java interface. After geo-location and calibration, every pixel is indexed and stored using a combination of data structures. Following the users' queries, data are selectively retrieved and secondary processing such as atmospheric correction, compositing, and projection are performed as specified. The processing is divided into two stages, the first of which involves the geo-location and calibration of the remotely sensed data and, hence, results in no loss of information. The second stage involves the retrieval of the appropriate data subsets and the application of the secondary processing specified by the user. This scheme allows the indexing and the storage of data from different sensors without any loss of information and, therefore, allows assimilation of data from multiple sensors. User specified processing can be applied later as needed. %B PE & RS- Photogrammetric Engineering and Remote Sensing %V 66 %P 1073 - 1082 %8 2000/// %G eng %N 9 %0 Conference Paper %B Parallel and Distributed Processing Symposium, International %D 2000 %T Speed vs. Accuracy in Simulation for I/O-Intensive Applications %A Eom, Hyeonsang %A Hollingsworth, Jeffrey K %K discrete-event simulation %K i/o-intensive applications %K parallel or distributed applications %K performance prediction %K simulation %X This paper presents a family of simulators that have been developed for data-intensive applications, and a methodology to select the most efficient one based on a user-supplied requirement for accuracy. The methodology consists of a series of tests that select an appropriate simulation based on the attributes of the application. In addition, each simulator provides two estimates of application execution time: one for the minimum expected time and the other for the maximum. We present the results of applying the strategy to existing applications and show that we can accurately simulate applications tens to hundreds of times faster than application execution time. %B Parallel and Distributed Processing Symposium, International %I IEEE Computer Society %C Los Alamitos, CA, USA %P 315 - 315 %8 2000/// %G eng %R http://doi.ieeecomputersociety.org/10.1109/IPDPS.2000.846001 %0 Conference Paper %B Proceedings of the fourth international ACM conference on Assistive technologies %D 2000 %T A storytelling robot for pediatric rehabilitation %A Plaisant, Catherine %A Druin, Allison %A Lathan,Corinna %A Dakhane,Kapil %A Edwards,Kris %A Vice,Jack Maxwell %A Montemayor,Jaime %K children %K design process %K rehabilitation %K robot %K therapeutic play %K user interface %B Proceedings of the fourth international ACM conference on Assistive technologies %S Assets '00 %I ACM %C New York, NY, USA %P 50 - 55 %8 2000/// %@ 1-58113-313-8 %G eng %U http://doi.acm.org/10.1145/354324.354338 %R 10.1145/354324.354338 %0 Book %D 2000 %T Visualization 2000 %A Ertl,T. %A Hamann,B. %A Varshney, Amitabh %I IEEE Computer Society Press %8 2000/// %G eng %0 Journal Article %J Computer Networks: The International Journal of Computer and Telecommunications Networking %D 1999 %T Agents vs. direct manipulation: what's best to disentangle the Web? %A Sánchez,J. Alfredo %A Etzioni,Oren %A Kautz,Henry %A Lieberman,Henry %A Shneiderman, Ben %B Computer Networks: The International Journal of Computer and Telecommunications Networking %V 31 %P 1765 - 1767 %8 1999/05// %@ 1389-1286 %G eng %U http://dl.acm.org/citation.cfm?id=313009.313142 %N 11-16 %0 Conference Paper %B Proceedings of the eighth international conference on World Wide Web %D 1999 %T Agents vs. direct manipulation: what's best to disentangle the Web? %A Sánchez,J.A. %A Etzioni,O. %A Kautz,H. %A Lieberman,H. %A Shneiderman, Ben %B Proceedings of the eighth international conference on World Wide Web %8 1999/// %G eng %0 Book %D 1999 %T Efficient preconditioning of the linearized Navier-Stokes equations %A Silvester, D. %A Elman, Howard %A Kay, D. %A Wathen, A. %I Citeseer %8 1999/// %G eng %0 Journal Article %J Numerische Mathematik %D 1999 %T Eigenanalysis of Some Preconditioned Helmholtz Problems %A Elman, Howard %A O'Leary, Dianne P. %X In this work we calculate the eigenvalues obtained by preconditioning the discrete Helmholtz operator with Sommerfeld-like boundary conditions on a rectilinear domain, by a related operator with boundary conditions that permit the use of fast solvers. The main innovation is that the eigenvalues for two and three-dimensional domains can be calculated exactly by solving a set of one-dimensional eigenvalue problems. This permits analysis of quite large problems. For grids fine enough to resolve the solution for a given wave number, preconditioning using Neumann boundary conditions yields eigenvalues that are uniformly bounded, located in the first quadrant, and outside the unit circle. In contrast, Dirichlet boundary conditions yield eigenvalues that approach zero as the product of wave number with the mesh size is decreased. These eigenvalue properties yield the first insight into the behavior of iterative methods such as GMRES applied to these preconditioned problems. %B Numerische Mathematik %V 83 %P 231 - 257 %8 1999/// %G eng %0 Conference Paper %B In Proceedings of the IJCAI’99 Workshop on Practical Reasoning and Rationality %D 1999 %T Fkpurang, darsana, traum, cfa, perlisg@ cs. umd. edu %A Edu,C. U %A Purang,K. %A Purushothaman,D. %A Traum,D. %A Andersen,C. %A Perlis, Don %B In Proceedings of the IJCAI’99 Workshop on Practical Reasoning and Rationality %8 1999/// %G eng %0 Journal Article %J Computer Graphics Forum %D 1999 %T Generalized View‐Dependent Simplification %A El‐Sana,Jihad %A Varshney, Amitabh %K Interactive Cut %K Physically Based Modeling %K Runge Kutta Method %K Soft Tissue %K Surgery Simulation %K Tetrahedralization %K Virtual Scalpel %X We propose a technique for performing view-dependent geometry and topology simplifications for level-of-detail-based renderings of large models. The algorithm proceeds by preprocessing the input dataset into a binary tree, the view-dependence tree of general vertex-pair collapses. A subset of the Delaunay edges is used to limit the number of vertex pairs considered for topology simplification. Dependencies to avoid mesh foldovers in manifold regions of the input object are stored in the view-dependence tree in an implicit fashion. We have observed that this not only reduces the space requirements by a factor of two, it also highly localizes the memory accesses at run time. The view-dependence tree is used at run time to generate the triangles for display. We also propose a cubic-spline-based distance metric that can be used to unify the geometry and topology simplifications by considering the vertex positions and normals in an integrated manner. %B Computer Graphics Forum %V 18 %P 83 - 94 %8 1999/09/01/ %@ 1467-8659 %G eng %U http://onlinelibrary.wiley.com/doi/10.1111/1467-8659.00330/abstract %N 3 %R 10.1111/1467-8659.00330 %0 Conference Paper %B Geoscience and Remote Sensing Symposium, 1999. IGARSS '99 Proceedings. IEEE 1999 International %D 1999 %T A hierarchical data archiving and processing system to generate custom tailored products from AVHRR data %A Kalluri, SNV %A Zhang,Z. %A JaJa, Joseph F. %A Bader, D.A. %A Song,H. %A El Saleous,N. %A Vermote,E. %A Townshend,J.R.G. %K archiving;image %K AVHRR;GIS;PACS;custom %K data %K image;land %K image;remote %K mapping; %K mapping;PACS;geophysical %K measurement %K PROCESSING %K processing;geophysical %K product;data %K remote %K scheme;infrared %K sensing;optical %K sensing;terrain %K signal %K surface;multispectral %K system;indexing %K tailored %K technique;hierarchical %K techniques;remote %X A novel indexing scheme is described to catalogue satellite data on a pixel basis. The objective of this research is to develop an efficient methodology to archive, retrieve and process satellite data, so that data products can be generated to meet the specific needs of individual scientists. When requesting data, users can specify the spatial and temporal resolution, geographic projection, choice of atmospheric correction, and the data selection methodology. The data processing is done in two stages. Satellite data is calibrated, navigated and quality flags are appended in the initial processing. This processed data is then indexed and stored. Secondary processing such as atmospheric correction and projection are done after a user requests the data to create custom made products. By dividing the processing in to two stages saves time, since the basic processing tasks such as navigation and calibration which are common to all requests are not repeated when different users request satellite data. The indexing scheme described can be extended to allow fusion of data sets from different sensors %B Geoscience and Remote Sensing Symposium, 1999. IGARSS '99 Proceedings. IEEE 1999 International %V 5 %P 2374 -2376 vol.5 - 2374 -2376 vol.5 %8 1999/// %G eng %R 10.1109/IGARSS.1999.771514 %0 Journal Article %J IEEE Computer Graphics and Applications %D 1999 %T Human-centered computing, online communities, and virtual environments %A Brown,J. R %A van Dam,A. %A Earnshaw,R. %A Encarnacao,J. %A Guedj,R. %A Preece,J. %A Shneiderman, Ben %A Vince,J. %K Books %K Collaboration %K Collaborative work %K Conferences %K EC/NSF joint Advanced Research Workshop %K Feeds %K Human computer interaction %K human-centered computing %K Internet %K Joining materials %K Laboratories %K Online communities %K Research initiatives %K USA Councils %K User interfaces %K Virtual environment %K virtual environments %K Virtual reality %X 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 %B IEEE Computer Graphics and Applications %V 19 %P 70 - 74 %8 1999/12//Nov %@ 0272-1716 %G eng %N 6 %R 10.1109/38.799742 %0 Journal Article %J Computer Methods in Applied Mechanics and Engineering %D 1999 %T Modified streamline diffusion schemes for convection-diffusion problems %A Shih,Yin-Tzer %A Elman, Howard %X We consider the design of robust and accurate finite element approximation methods for solving convection--diffusion problems. We develop some two-parameter streamline diffusion schemes with piecewise bilinear (or linear) trial functions and show that these schemes satisfy the necessary conditions for L2-uniform convergence of order greater than 1/2 introduced by Stynes and Tobiska M. Stynes and L. Tobiska, Necessary L2-uniform convergence conditions for difference schemes for two dimensional convection--diffusion problems, Comput. Math. Applic. 29 (1995) 45-53. For smooth problems, the schemes satisfy error bounds of the form O(h)u2 in an energy norm. In addition, extensive numerical experiments show that they effectively reproduce boundary layers and internal layers caused by discontinuities on relatively coarse grids, without any requirements on alignment of flow and grid. %B Computer Methods in Applied Mechanics and Engineering %V 174 %P 137 - 151 %8 1999/05/04/ %@ 0045-7825 %G eng %U http://www.sciencedirect.com/science/article/pii/S0045782598002837 %N 1-2 %R 16/S0045-7825(98)00283-7 %0 Journal Article %J Proceedings of the National Academy of Sciences of the United States of America %D 1999 %T More surprises from Kinetoplastida %A Donelson,J. E %A Gardner,M. J %A El‐Sayed, Najib M. %B Proceedings of the National Academy of Sciences of the United States of America %V 96 %P 2579 - 2579 %8 1999/// %G eng %N 6 %0 Journal Article %J SIAM Journal on Scientific Computing %D 1999 %T Preconditioning for the steady-state Navier-Stokes equations with low viscosity %A Elman, Howard %B SIAM Journal on Scientific Computing %V 20 %P 1299 - 1316 %8 1999/// %G eng %N 4 %0 Conference Paper %B Visualization '99. Proceedings %D 1999 %T Skip Strips: maintaining triangle strips for view-dependent rendering %A El-Sana,J. %A Azanli,E. %A Varshney, Amitabh %K (computer %K Acceleration %K acceleration;graphics %K applications;path %K applications;skip-list-like %K changes;view-dependent %K compression;rendering %K connectivity;triangle %K data %K datasets;graphics %K datasets;static %K environments;data %K equipment;data %K graphic %K Graphics %K graphics);spatial %K hardware;hardware-supported %K hierarchy %K manner;static %K mechanism;immediate-mode %K mesh %K meshes;triangle %K nodes;view-dependent %K rendering;view-dependent %K simplification;visualization;computer %K Skip %K Strips;complex %K strips;vertex %K structure;dynamic %K structures; %K techniques;retained-mode %K triangle %K visualisation;rendering %X View-dependent simplification has emerged as a powerful tool for graphics acceleration in visualization of complex environments. However, view-dependent simplification techniques have not been able to take full advantage of the underlying graphics hardware. Specifically, triangle strips are a widely used hardware-supported mechanism to compactly represent and efficiently render static triangle meshes. However, in a view-dependent framework, the triangle mesh connectivity changes at every frame, making it difficult to use triangle strips. We present a novel data structure, Skip Strip, that efficiently maintains triangle strips during such view-dependent changes. A Skip Strip stores the vertex hierarchy nodes in a skip-list-like manner with path compression. We anticipate that Skip Strips will provide a road map to combine rendering acceleration techniques for static datasets, typical of retained-mode graphics applications, with those for dynamic datasets found in immediate-mode applications. %B Visualization '99. Proceedings %P 131 - 518 %8 1999/10// %G eng %R 10.1109/VISUAL.1999.809877 %0 Journal Article %J Readings in information visualization: using vision to think %D 1999 %T TennisViewer: A Browser for Competition Trees %A Johnson,B. %A Shneiderman, Ben %A Baker,MJ %A Eick,SG %B Readings in information visualization: using vision to think %P 149 - 149 %8 1999/// %G eng %0 Journal Article %J Virtual Environments %D 1999 %T View-dependent topology simplification %A El-Sana,J. %A Varshney, Amitabh %X We propose a technique for performing view-dependent sim-plifications for level-of-detail-based renderings of complex models. Our method is based on exploiting frame-to-frame coherence and is tolerant of various commonly found degeneracies in real-life polygonal models. The algorithm proceeds by preprocessing the input dataset into a binary tree of vertex collapses. This tree is used at run time to generate the triangles for display. Dependencies to avoid mesh foldovers in manifold regions of the input object are stored in the tree in an implicit fashion. This obviates the need for any extra storage for dependency pointers and suggests a potential for application to external memory prefetching algo- rithms. We also propose a distance metric that can be used to unify the geometry and genus simplifications with the view-dependent parameters such as viewpoint, view-frustum, and local illumination. %B Virtual Environments %V 99 %P 11 - 22 %8 1999/// %G eng %0 Journal Article %J Technical Reports of the Computer Science Department %D 1998 %T Buttons vs. menus: An exploratory study of pull-down menu selection as compared to button bars %A Ellis,Jason %A Tran,Chi %A Ryoo,Jake %A Shneiderman, Ben %K Technical Report %X Button bars are a relatively new interaction method intended to speedup application use as compared to pull-down menus. This exploratory study compares three command selection methods: pull-down menus, button bars, and user choice of pull-down menus or button bars. Effectiveness was measured in two ways: speed of selection and error rate. 15 participants performed 15 word processor related tasks. Results show that in frequently used functions, such as character attribute selection (bold, italic, u nderline, etc.), button bars are faster. There were no statistically significant differences in error rates between the three interaction methods. (Also cross-referenced as CAR-TR-764) %B Technical Reports of the Computer Science Department %8 1998/10/15/ %G eng %U http://drum.lib.umd.edu/handle/1903/428 %0 Journal Article %J Journal of Computational Physics %D 1998 %T Efficient Iterative Solution of the Three-Dimensional Helmholtz Equation %A Elman, Howard %A O'Leary, Dianne P. %X We examine preconditioners for the discrete indefinite Helmholtz equation on a three-dimensional box-shaped domain with Sommerfeld-like boundary conditions. The preconditioners are of two types. The first is derived by discretization of a related continuous operator that differs from the original only in its boundary conditions. The second is derived by a block Toeplitz approximation to the descretized problem. The resulting preconditioning matrices allow the use of fast transform methods and differ from the discrete Helmholtz operator by an operator of low rank. We present experimental results demonstrating that when these methods are combined with Krylov subspace iteration, convergence rates depend only mildly on both the wave number and discretization mesh size. In addition, the methods display high efficiencies in an implementation on an IBM SP-2 parallel computer. %B Journal of Computational Physics %V 142 %P 163 - 181 %8 1998/05/01/ %@ 0021-9991 %G eng %U http://www.sciencedirect.com/science/article/pii/S0021999198959393 %N 1 %R 10.1006/jcph.1998.5939 %0 Journal Article %J Mol Biochem Parasitol %D 1998 %T Genetic nomenclature for Trypanosoma and Leishmania. %A Clayton, C %A Adams, M %A Almeida, R %A Baltz, T %A Barrett, M %A Bastien, P %A Belli, S %A Beverley, S %A Biteau, N %A Blackwell, J %A Blaineau, C %A Boshart, M %A Bringaud, F %A Cross, G %A Cruz, A %A Degrave, W %A Donelson, J %A El-Sayed, N %A Fu, G %A Ersfeld, K %A Gibson, W %A Gull, K %A Ivens, A %A Kelly, J %A Vanhamme, L %K Animals %K Leishmania %K Terminology as Topic %K Trypanosoma %B Mol Biochem Parasitol %V 97 %P 221-4 %8 1998 Nov 30 %G eng %N 1-2 %0 Conference Paper %B 18th International Conference on Distributed Computing Systems, 1998. Proceedings %D 1998 %T LBF: a performance metric for program reorganization %A Eom, H. %A Hollingsworth, Jeffrey K %K case study %K Computational modeling %K computer network %K Computer science %K Debugging %K distributed processing %K distributed program %K Educational institutions %K Integrated circuit testing %K LBF metric %K load balancing factor %K Load management %K measurement %K NIST %K parallel program %K parallel programming %K performance metric %K program reorganization %K program tuning %K Programming profession %K resource allocation %K software metrics %K software performance evaluation %K US Department of Energy %X We introduce a new performance metric, called Load Balancing Factor (LBF), to assist programmers with evaluating different tuning alternatives. The LBF metric differs from traditional performance metrics since it is intended to measure the performance implications of a specific tuning alternative rather than quantifying where time is spent in the current version of the program. A second unique aspect of the metric is that it provides guidance about moving work within a distributed or parallel program rather than reducing it. A variation of the LBF metric can also be used to predict the performance impact of changing the underlying network. The LBF metric can be computed incrementally and online during the execution of the program to be tuned. We also present a case study that shows that our metric can predict the actual performance gains accurately for a test suite of six programs %B 18th International Conference on Distributed Computing Systems, 1998. Proceedings %I IEEE %P 222 - 229 %8 1998/05/26/29 %@ 0-8186-8292-2 %G eng %R 10.1109/ICDCS.1998.679505 %0 Journal Article %J Technical Reports of the Computer Science Department %D 1998 %T Life cycle of user interface techniques: The DJJ information system design Process %A Rose,Anne %A Ellis,Jason %A Plaisant, Catherine %A Greene,Stephan %K Technical Report %X 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) %B Technical Reports of the Computer Science Department %8 1998/10/15/ %G eng %U http://drum.lib.umd.edu/handle/1903/458 %0 Journal Article %J Molecular and Biochemical Parasitology %D 1998 %T Multiple mechanisms of immune evasion by African trypanosomes %A Donelson,John E. %A Hill,Kent L. %A El‐Sayed, Najib M. %K Leishmania %K Recombinant cloning %K T cell %K Trypanosomes %K VSG genes %X During infection of a mammalian host, African trypanosomes are in constant contact with the host's immune system. These protozoan parasites are infamous for their ability to evade the immune responses by periodically switching their major variant surface glycoprotein (VSG), a phenomenon called antigenic variation. Antigenic variation, however, is likely to be only one of several mechanisms enabling these organisms to thrive in the face of the immune defenses. The ability to grow in high levels of interferon-gamma (IFN-[gamma]) and to avoid complement-mediated destruction may also facilitate the parasite's survival. In this review we summarize (i) the activation of trypanosome genes for three different VSGs during antigenic variation, (ii) the secretion of a trypanosome protein that induces host CD8+ T cells to produce IFN-[gamma], and (iii) the evidence for trypansome protein similar to a surface protease of Leishmania that plays a role in resistance to complement-mediated lysis. %B Molecular and Biochemical Parasitology %V 91 %P 51 - 66 %8 1998/03/01/ %@ 0166-6851 %G eng %U http://www.sciencedirect.com/science/article/pii/S0166685197002090 %N 1 %R 16/S0166-6851(97)00209-0 %0 Journal Article %J Visualization and Computer Graphics, IEEE Transactions on %D 1998 %T Topology simplification for polygonal virtual environments %A El-Sana,J. %A Varshney, Amitabh %K accessibility;intuitive %K alpha;-shapes;L %K approach;triangulations;unified %K cube;L %K datasets;polygonal %K distance %K environments;protuberance %K framework;computational %K geometry;topology;virtual %K hierarchies;polygonal %K infin; %K meshes;polygonal %K metric;genus %K models;polygonal %K notion;multiresolution %K reality; %K reductions;geometry %K removal;topology %K simplification;geometry %K simplification;topology %K simplifications;internal %K simplifying %K virtual %X We present a topology simplifying approach that can be used for genus reductions, removal of protuberances, and repair of cracks in polygonal models in a unified framework. Our work is complementary to the existing work on geometry simplification of polygonal datasets and we demonstrate that using topology and geometry simplifications together yields superior multiresolution hierarchies than is possible by using either of them alone. Our approach can also address the important issue of repair of cracks in polygonal models, as well as for rapid identification and removal of protuberances based on internal accessibility in polygonal models. Our approach is based on identifying holes and cracks by extending the concept of alpha;-shapes to polygonal meshes under the L infin; distance metric. We then generate valid triangulations to fill them using the intuitive notion of sweeping an L infin; cube over the identified regions %B Visualization and Computer Graphics, IEEE Transactions on %V 4 %P 133 - 144 %8 1998/06//apr %@ 1077-2626 %G eng %N 2 %R 10.1109/2945.694955 %0 Book %D 1998 %T Trends in the Early Careers of Life Scientists %A Tilghman,S %A Astin,HS %A Brinkley,W %A Chilton,MD %A Cummings, Michael P. %A Ehrenberg,RG %A Fox,MF %A Glenn,K %A Green,PJ %A Hans,S %A Kelman,A %A LaPidus,J %A Levin,B %A McIntosh,JR %A Riecken,H %A Stephen,PE %I National Academy Press %C Washington, DC %8 1998/// %G eng %0 Journal Article %J Mol Biol Cell %D 1998 %T Trends in the early careers of life scientists - Preface and executive summary %A Tilghman,S %A Astin,HS %A Brinkley,W %A Chilton,MD %A Cummings, Michael P. %A Ehrenberg,RG %A Fox,MF %A Glenn,K %A Green,PJ %A Hans,S %A Kelman,A %A LaPidus,J %A Levin,B %A McIntosh,JR %A Riecken,H %A Stephen,PE %B Mol Biol Cell %V 9 %P 3007 - 3015 %8 1998/11// %G eng %N 11 %0 Journal Article %J Visualization and Computer Graphics, IEEE Transactions on %D 1997 %T Adaptive real-time level-of-detail based rendering for polygonal models %A Xia,J. C %A El-Sana,J. %A Varshney, Amitabh %K (computer %K adaptive %K attributes;scientific %K attributes;view-dependent %K coherence;image-space;lighting;multiresolution %K direction;visibility;computational %K geometry;data %K graphics); %K hierarchies;object-space;run %K hierarchies;triangulated %K level-of-detail %K models;vector %K polygonal %K real-time %K refinement;triangle %K rendering;displayed %K simplifications;viewing %K systems;rendering %K time;scalar %K triangles;frame-to-frame %K visualisation;real-time %K visualization;selective %X We present an algorithm for performing adaptive real-time level-of-detail-based rendering for triangulated polygonal models. The simplifications are dependent on viewing direction, lighting, and visibility and are performed by taking advantage of image-space, object-space, and frame-to-frame coherences. In contrast to the traditional approaches of precomputing a fixed number of level-of-detail representations for a given object, our approach involves statically generating a continuous level-of-detail representation for the object. This representation is then used at run time to guide the selection of appropriate triangles for display. The list of displayed triangles is updated incrementally from one frame to the next. Our approach is more effective than the current level-of-detail-based rendering approaches for most scientific visualization applications, where there are a limited number of highly complex objects that stay relatively close to the viewer. Our approach is applicable for scalar (such as distance from the viewer) as well as vector (such as normal direction) attributes %B Visualization and Computer Graphics, IEEE Transactions on %V 3 %P 171 - 183 %8 1997/06//apr %@ 1077-2626 %G eng %N 2 %R 10.1109/2945.597799 %0 Journal Article %J Journal of Biological Chemistry %D 1997 %T African trypanosomes have differentially expressed genes encoding homologues of the Leishmania GP63 surface protease %A El‐Sayed, Najib M. %A Donelson,J. E %B Journal of Biological Chemistry %V 272 %P 26742 - 26742 %8 1997/// %G eng %N 42 %0 Conference Paper %B Visualization '97., Proceedings %D 1997 %T Controlled simplification of genus for polygonal models %A El-Sana,J. %A Varshney, Amitabh %K (computer %K /spl %K alpha/-hulls;L/sub %K distance %K framework;small %K geometry;controlled %K geometry;data %K graphics); %K hierarchies;object %K holes;triangulations;tunnels;computational %K infin// %K meshes;polygonal %K metric;cavities;computational %K models;simplification %K rendering;multiresolution %K representations;polygonal %K simplification;datasets;genus-preserving %K simplifications;genus-reducing %K simplifications;level-of-detail-based %K visualisation;rendering %X Genus-reducing simplifications are important in constructing multiresolution hierarchies for level-of-detail-based rendering, especially for datasets that have several relatively small holes, tunnels, and cavities. We present a genus-reducing simplification approach that is complementary to the existing work on genus-preserving simplifications. We propose a simplification framework in which genus-reducing and genus-preserving simplifications alternate to yield much better multiresolution hierarchies than would have been possible by using either one of them. In our approach we first identify the holes and the concavities by extending the concept of alpha;-hulls to polygonal meshes under the L infin; distance metric and then generate valid triangulations to fill them. %B Visualization '97., Proceedings %P 403 - 410 %8 1997/10// %G eng %R 10.1109/VISUAL.1997.663909 %0 Journal Article %J ACM Transactions on Graphics %D 1997 %T Efficient triangle strips for fast rendering %A Evans,F. %A Skiena,S. %A Varshney, Amitabh %B ACM Transactions on Graphics %8 1997/// %G eng %0 Journal Article %J Proceedings of ASME Design Engineering Technical Conferences, Sept %D 1997 %T Enabling virtual reality for large-scale mechanical CAD datasets %A Varshney, Amitabh %A El-Sana,J. %A Evans,F. %A Darsa,L. %A Costa,B. %A Skiena,S. %X Reconciling scene realism with interactivity has emerged asone of the most important areas in making virtual reality fea- sible for large-scale mechanical CAD datasets consisting of sev- eral millions of primitives. This paper surveys our research and related work for achieving interactivity without sacrificing real- ism in virtual reality walkthroughs and flythroughs of polygonal CAD datasets. We outline our recent work on efficient genera- tion of triangle strips from polygonal models that takes advan- tage of compression of connectivity information. This results in substantial savings in rendering, transmission, and storage. We outline our work on genus-reducing simplifications as well as real-time view-dependent simplifications that allow on-the-fly selection amongst multiple levels of detail, based upon lighting and viewing parameters. Our method allows multiple levels of detail to coexist on the same object at different regions and to merge seamlessly without any cracks or shading artifacts. We also present an overview of our work on hardware-assisted image- based rendering that allows interactive exploration of computer- generated scenes. %B Proceedings of ASME Design Engineering Technical Conferences, Sept %V 14 %P 17 - 17 %8 1997/// %G eng %0 Conference Paper %B IPPS %D 1997 %T Interoperability of data parallel runtime libraries %A Edjlali,G. %A Sussman, Alan %A Saltz, J. %B IPPS %P 451 - 451 %8 1997/// %G eng %0 Book %D 1997 %T Iterative Methods for Linear and Nonlinear Equations. %A Elman, Howard %I JSTOR %V 66 %8 1997/// %G eng %0 Journal Article %J Iterative Methods in Scientific Computing %D 1997 %T Iterative methods for problems in computational fluid dynamics %A Elman, Howard %A Silvester, D. J %A Wathen, A. J %B Iterative Methods in Scientific Computing %P 271 - 327 %8 1997/// %G eng %0 Journal Article %J Science of Computer Programming %D 1997 %T Modeling and verifying active structural control systems %A Elseaidy,W. %B Science of Computer Programming %V 29 %P 99 - 122 %8 1997/07// %@ 01676423 %G eng %U zotero://attachment/28808/ %R 10.1016/S0167-6423(96)00031-7 %0 Journal Article %J IEEE Transactions on Pattern Analysis and Machine Intelligence %D 1997 %T Multiscale Document Page Segmentation Using Soft Decision Integration %A Etemad,K. %A David Doermann %A Chellapa, Rama %B IEEE Transactions on Pattern Analysis and Machine Intelligence %P 92 - 96 %8 1997/// %G eng %0 Journal Article %J Numerische Mathematik %D 1997 %T A note on conjugate gradient convergence %A Naiman, A. E %A Babuška, I. M %A Elman, Howard %B Numerische Mathematik %V 76 %P 209 - 230 %8 1997/// %G eng %N 2 %0 Journal Article %J SIAM Journal on Matrix Analysis and Applications %D 1997 %T Perturbation of eigenvalues of preconditioned Navier-Stokes operators %A Elman, Howard %B SIAM Journal on Matrix Analysis and Applications %V 18 %P 733 - 751 %8 1997/// %G eng %N 3 %0 Journal Article %J Scientific Programming %D 1997 %T Run-time and compiler support for programming in adaptive parallel environments %A Edjlali,G. %A Agrawal,G. %A Sussman, Alan %A Humphries,J. %A Saltz, J. %B Scientific Programming %V 6 %P 215 - 227 %8 1997/// %G eng %N 2 %0 Journal Article %J Molecular and Biochemical Parasitology %D 1997 %T A survey of the Trypanosoma brucei rhodesiense genome using shotgun sequencing %A El‐Sayed, Najib M. %A Donelson,John E. %K Expressed sequence tag %K Genome survey sequence %K Trypanosoma brucei rhodesiense %X A comparison of the efficiency of sequencing random genomic DNA fragments versus random cDNAs for the discovery of new genes in African trypanosomes was undertaken. Trypanosome DNA was sheared to a 1.5-2.5 kb size distribution, cloned into a plasmid and the sequences at both ends of 183 cloned fragments determined. Sequences of both kinetoplast and nuclear DNA were identified. New coding regions were discovered for a variety of proteins, including cell division proteins, an RNA-binding protein and a homologue of the Leishmania surface protease GP63. In some cases, each end of a fragment was found to contain a different gene, demonstrating the proximity of those genes and suggesting that the density of genes in the African trypanosome genome is quite high. Repetitive sequence elements found included telomeric hexamer repeats, 76 bp repeats associated with VSG gene expression sites, 177 bp satellite repeats in minichromosomes and the Ingi transposon-like elements. In contrast to cDNA sequencing, no ribosomal protein genes were detected. For the sake of comparison, the sequences of 190 expressed sequence tags (ESTs) were also determined, and a similar number of new trypanosomal homologues were found including homologues of another putative surface protein and a human leucine-rich repeat-containing protein. We conclude from this analysis and our previous work that sequencing random DNA fragments in African trypanosomes is as efficient for gene discovery as is sequencing random cDNA clones. %B Molecular and Biochemical Parasitology %V 84 %P 167 - 178 %8 1997/02// %@ 0166-6851 %G eng %U http://www.sciencedirect.com/science/article/pii/S0166685196027922 %N 2 %R 16/S0166-6851(96)02792-2 %0 Journal Article %J Journal of Biological Chemistry %D 1996 %T Differential expression of the expression site-associated gene I family in African trypanosomes %A Morgan,R. W %A El‐Sayed, Najib M. %A Kepa,J. K %A Pedram,M. %A Donelson,J. E %B Journal of Biological Chemistry %V 271 %P 9771 - 9771 %8 1996/// %G eng %N 16 %0 Journal Article %J SIAM Journal on Scientific Computing %D 1996 %T Fast nonsymmetric iterations and preconditioning for Navier-Stokes equations %A Elman, Howard %A Silvester, D. %B SIAM Journal on Scientific Computing %V 17 %P 33 - 46 %8 1996/// %G eng %N 1 %0 Journal Article %J Computers in Biology and Medicine %D 1996 %T Feature discovery and classification of Doppler umbilical artery blood flow velocity waveforms %A Baykal,Nazife %A Reogia,James A. %A Yalabik,Nese %A Erkmen,Aydan %A Beksac,M.Sinan %K Doppler umbilical artery blood flow velocity waveforms %K Feature extraction %K IMAGE PROCESSING %K Pattern classification %X Doppler umbilical artery blood flow velocity waveform measurements are used in perinatal surveillance for the evaluation of fetal condition. There is an ongoing debate on the predictive value of Doppler measurements concerning the critical effect of the selection of parameters for the interpretation of Doppler waveforms. In this paper, we describe how neural network methods can be used both to discover relevant classification features and subsequently to classify Doppler umbilical artery blood flow velocity waveforms. Results obtained from 199 normal and high risk patients' umbilical artery waveforms highlighted a classification concordance varying from 90 to 98% accuracy. %B Computers in Biology and Medicine %V 26 %P 451 - 462 %8 1996/11// %@ 0010-4825 %G eng %U http://www.sciencedirect.com/science/article/pii/S0010482596000182 %N 6 %R 10.1016/S0010-4825(96)00018-2 %0 Journal Article %J International journal for numerical methods in fluids %D 1996 %T Multigrid and Krylov subspace methods for the discrete Stokes equations %A Elman, Howard %B International journal for numerical methods in fluids %V 22 %P 755 - 770 %8 1996/// %G eng %N 8 %0 Conference Paper %B Visualization '96. Proceedings. %D 1996 %T Optimizing triangle strips for fast rendering %A Evans,F. %A Skiena,S. %A Varshney, Amitabh %K buffer %K data;triangulated %K disciplines;rendering %K model %K models;polygonal %K optimisation;triangulated %K partitioning;queuing %K rendering;graphics %K sizes;fast %K strip %K subsystem;interactive %K surfaces;data %K times;scientific %K triangulated %K visualisation; %K visualization;partially %K visualization;triangle %X Almost all scientific visualization involving surfaces is currently done via triangles. The speed at which such triangulated surfaces can be displayed is crucial to interactive visualization and is bounded by the rate at which triangulated data can be sent to the graphics subsystem for rendering. Partitioning polygonal models into triangle strips can significantly reduce rendering times over transmitting each triangle individually. We present new and efficient algorithms for constructing triangle strips from partially triangulated models, and experimental results showing these strips are on average 15% better than those from previous codes. Further, we study the impact of larger buffer sizes and various queuing disciplines on the effectiveness of triangle strips. %B Visualization '96. Proceedings. %P 319 - 326 %8 1996/11/27/1 %G eng %R 10.1109/VISUAL.1996.568125 %0 Conference Paper %B Proceedings of the 10th international conference on Supercomputing %D 1996 %T Runtime coupling of data-parallel programs %A Ranganathan,M. %A Acharya, A. %A Edjlali,G. %A Sussman, Alan %A Saltz, J. %B Proceedings of the 10th international conference on Supercomputing %P 229 - 236 %8 1996/// %G eng %0 Conference Paper %B ACM SIGGRAPH 96 Visual Proceedings: The art and interdisciplinary programs of SIGGRAPH '96 %D 1996 %T Stripe: a software tool for efficient triangle strips %A Evans,Francine %A Skiena,Steven %A Varshney, Amitabh %B ACM SIGGRAPH 96 Visual Proceedings: The art and interdisciplinary programs of SIGGRAPH '96 %S SIGGRAPH '96 %I ACM %C New York, NY, USA %P 153– - 153– %8 1996/// %@ 0-89791-784-7 %G eng %U http://doi.acm.org/10.1145/253607.253894 %R 10.1145/253607.253894 %0 Journal Article %J Engineering with computers %D 1996 %T Verification of an active control system using temporal process algebra %A Elseaidy,W. M %A Baugh,J. W. %A Cleaveland, Rance %B Engineering with computers %V 12 %P 46 - 61 %8 1996/// %G eng %N 1 %0 Journal Article %J SIAM Journal on Matrix Analysis and ApplicationsSIAM. J. Matrix Anal. & Appl. %D 1995 %T Algebraic Analysis of the Hierarchical Basis Preconditioner %A Elman, Howard %A Zhang, Xuejun %B SIAM Journal on Matrix Analysis and ApplicationsSIAM. J. Matrix Anal. & Appl. %V 16 %P 192 - 192 %8 1995/// %@ 08954798 %G eng %U http://epubs.siam.org/sima/resource/1/sjmael/v16/i1/p192_s1 %N 1 %R 10.1137/S0895479892236933 %0 Journal Article %J Molecular and Biochemical Parasitology %D 1995 %T cDNA expressed sequence tags of Trypanosoma brucei rhodesiense provide new insights into the biology of the parasite %A El‐Sayed, Najib M. %A Alarcon,Clara M. %A Beck,John C. %A Sheffield,Val C. %A Donelson,John E. %K cDNA %K Expressed sequence tag %K Trypanosoma brucei rhodesiense %X A total of 518 expressed sequence tags (ESTs) have been generated from clones randomly selected from a cDNA library and a spliced leader sub-library of a Trypanosoma brucei rhodesiense bloodstream clone. 205 (39%) of the clones were identified based on matches to 113 unique genes in the public databases. Of these, 71 cDNAs display significant similarities to genes in unrelated organisms encoding metabolic enzymes, signal transduction proteins, transcription factors, ribosomal proteins, histones, a proliferation-associated protein and thimet oligopeptidase, among others. 313 of the cDNAs are not related to any other sequences in the databases. These cDNA ESTs provide new avenues of research for exploring both the novel trypanosome-specific genes and the genome organization of this parasite, as well as a resource for identifying trypanosome homologs to genes expressed in other organisms. %B Molecular and Biochemical Parasitology %V 73 %P 75 - 90 %8 1995/07// %@ 0166-6851 %G eng %U http://www.sciencedirect.com/science/article/pii/016668519500098L %N 1-2 %R 16/0166-6851(95)00098-L %0 Journal Article %J Proteins: Structure, Function, and Bioinformatics %D 1995 %T Crystallization and preliminary X-ray investigation of the recombinant Trypanosoma brucei rhodesiense calmodulin %A El‐Sayed, Najib M. %A Patton,C. L %A Harkins,P. C %A Fox,R. O %A Anderson,K. %B Proteins: Structure, Function, and Bioinformatics %V 21 %P 354 - 357 %8 1995/// %G eng %N 4 %0 Conference Paper %B Parallel Processing Symposium, 1995. Proceedings., 9th International %D 1995 %T Data parallel programming in an adaptive environment %A Edjlali,G. %A Agrawal,G. %A Sussman, Alan %A Saltz, J. %B Parallel Processing Symposium, 1995. Proceedings., 9th International %P 827 - 832 %8 1995/// %G eng %0 Journal Article %J Parallel Computing %D 1995 %T Use of linear algebra kernels to build an efficient finite element solver %A Elman, Howard %A Lee,Dennis K. -Y. %K Cache memory %K finite element %K hp-version %K Level 3 BLAS %K Parallel algorithm %K shared memory multiprocessor %X For scientific codes to achieve good performance on computers with hierarchical memories, it is necessary that the ratio of memory references to arithmetic operations be low. In this paper, we show that Level 3 BLAS linear algebra kernels can be used to satisfy this requirement to produce an efficient implementation of a parallel finite element solver on a shared memory parallel computer with a fast cache memory. %B Parallel Computing %V 21 %P 161 - 173 %8 1995/01// %@ 0167-8191 %G eng %U http://www.sciencedirect.com/science/article/pii/016781919400030E %N 1 %R 16/0167-8191(94)00030-E %0 Journal Article %J AI Magazine %D 1994 %T AAAI 1994 Spring Symposium Series Reports %A Woods,William %A Uckun,Sendar %A Kohane,Isaac %A Bates,Joseph %A Hulthage,Ingemar %A Gasser,Les %A Hanks,Steve %A Gini,Maria %A Ram,Ashwin %A desJardins, Marie %A Johnson,Peter %A Etzioni,Oren %A Coombs,David %A Whitehead,Steven %B AI Magazine %V 15 %P 22 - 22 %8 1994/09/15/ %@ 0738-4602 %G eng %U http://www.aaai.org/ojs/index.php/aimagazine/article/viewArticle/1101 %N 3 %R 10.1609/aimag.v15i3.1101 %0 Report %D 1994 %T Calibrating, Counting, Grounding, Grouping %A Elgot-drapkin,J. %A Gordon,D. %A Kraus,S. %A Miller,M. %A Nirkhe,M. %A Perlis, Don %I Association for the Advancement of Artificial Intelligence %V FS-94-03 %8 1994/// %G eng %0 Journal Article %J Numerische Mathematik %D 1994 %T On the convergence of line iterative methods for cyclically reduced non-symmetrizable linear systems %A Elman, Howard %A Golub, G. H %A Starke, G. %B Numerische Mathematik %V 67 %P 177 - 190 %8 1994/// %G eng %N 2 %0 Conference Paper %B International Conference on Neural Networks %D 1994 %T Document page decomposition by integration of distributed soft decisions %A Etemad,K. %A David Doermann %A Chellapa, Rama %B International Conference on Neural Networks %P 4022 - 4027 %8 1994/// %G eng %0 Journal Article %J SIAM Journal on Numerical Analysis %D 1994 %T Inexact and Preconditioned Uzawa Algorithms for Saddle Point Problems %A Elman, Howard %A Golub, Gene H. %X 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. %B SIAM Journal on Numerical Analysis %V 31 %P 1645 - 1661 %8 1994/12/01/ %@ 0036-1429 %G eng %U http://www.jstor.org/stable/2158371 %N 6 %0 Conference Paper %B Proceedings of the Annual Symposium on Computer Application in Medical Care %D 1994 %T Interpretation of Doppler blood flow velocity waveforms using neural networks. %A Baykal,N. %A Reggia, James A. %A Yalabik,N. %A Erkmen,A. %A Beksac,M. S. %B Proceedings of the Annual Symposium on Computer Application in Medical Care %P 865 - 865 %8 1994/// %G eng %0 Journal Article %J Large-Scale Matrix Problems and the Numerical Solution of Partial Differential Equations %D 1994 %T Iterative methods for linear systems %A Elman, Howard %B Large-Scale Matrix Problems and the Numerical Solution of Partial Differential Equations %V 3 %P 69 - 177 %8 1994/// %G eng %0 Conference Paper %B ICPR %D 1994 %T Page Segmentation Using Decision Integration and Wavelet Packet Basis %A Etemad,K. %A David Doermann %A Chellapa, Rama %B ICPR %P 345 - 349 %8 1994/// %G eng %0 Book Section %B Dependable Computing — EDCC-1 %D 1994 %T Software reliability analysis of three successive generations of a Switching System %A Kaâniche,M. %A Kanoun,K. %A Michel Cukier %A Martini,M. %E Echtle,Klaus %E Hammer,Dieter %E Powell,David %K Computer science %X Most current approaches to software reliability evaluation are based on data collected on a single generation of products. However, many applications are developed through improvements of the existing software: to the families of products are added various generations as the need for new functionalities arises. Experimental studies dealing with the analysis of data collected on families of products are seldom reported. In this paper, we analyze the data (failure and correction reports) collected on the software of three successive generations of the Brazilian Switching System — TROPICO-R, during validation and operation. A comparative analysis of the three products is done and the main results are outlined. Emphasis is placed on the evolution of the software and the corresponding failures and corrected faults. The analysis addresses: i) the modifications introduced on system components, ii) the distribution of failures and corrected faults in the components and the functions fulfilled by the system, and iii) the evolution of the failure intensity functions. %B Dependable Computing — EDCC-1 %S Lecture Notes in Computer Science %I Springer Berlin / Heidelberg %V 852 %P 471 - 490 %8 1994/// %@ 978-3-540-58426-1 %G eng %U http://www.springerlink.com/content/f71g30v177521471/abstract/ %0 Conference Paper %B Real-Time Systems Symposium, 1994., Proceedings. %D 1994 %T Verifying an intelligent structural control system: a case study %A Elseaidy,W. M %A Cleaveland, Rance %A Baugh,J. W. %K automatic verification tool %K case study %K Concurrency Workbench %K Distributed computing %K Distributed control %K distributed processing %K finite automata %K finite-state processes %K formal verification %K graphical specification language %K high-level design %K intelligent control %K intelligent structural control system verification %K Logic %K Modechart %K Process algebra %K Real time systems %K real-time systems %K Specification languages %K structural engineering computing %K temporal logic %K temporal process algebra %K time-varying systems %K Timing %K timing properties %K visual languages %X Describes the formal verification of the timing properties of the design of an intelligent structural control system using the Concurrency Workbench, an automatic verification tool for finite-state processes. The high-level design of the system is first given in Modechart, a graphical specification language for real-time systems, and then translated into a temporal process algebra supported by the Workbench. The facilities provided by this tool are then used to analyze the system and ultimately show it to be correct %B Real-Time Systems Symposium, 1994., Proceedings. %I IEEE %P 271 - 275 %8 1994/12/07/9 %@ 0-8186-6600-5 %G eng %R 10.1109/REAL.1994.342708 %0 Journal Article %J IEEE Transactions on Knowledge and Data Engineering %D 1993 %T ADMS: a testbed for incremental access methods %A Roussopoulos, Nick %A Economou,N. %A Stamenas,A. %K Add-drop multiplexers %K ADMS %K advanced database management system %K client-server architecture %K commercial database management systems %K Computational modeling %K Database systems %K distributed databases %K heterogeneous DBMS %K incremental access methods %K incremental gateway %K Information retrieval %K interoperability %K join index %K large databases %K Navigation %K network operating systems %K Object oriented databases %K Object oriented modeling %K Query processing %K System testing %K very large databases %K view index %K Workstations %X ADMS is an advanced database management system developed-to experiment with incremental access methods for large and distributed databases. It has been developed over the past eight years at the University of Maryland. The paper provides an overview of ADMS, and describes its capabilities and the performance attained by its incremental access methods. This paper also describes an enhanced client-server architecture that allows an incremental gateway access to multiple heterogeneous commercial database management systems %B IEEE Transactions on Knowledge and Data Engineering %V 5 %P 762 - 774 %8 1993/10// %@ 1041-4347 %G eng %N 5 %R 10.1109/69.243508 %0 Book %D 1993 %T Costs of Solving the Discrete Convection-diffusion Equation by Relaxation Methods %A Chernesky, M. P %A Elman, Howard %I University of Maryland %8 1993/// %G eng %0 Journal Article %J SIAM Journal on Numerical Analysis %D 1993 %T Ordering Effects on Relaxation Methods Applied to the Discrete One- Dimensional Convection-Diffusion Equation %A Elman, Howard %A Chernesky, Michael P. %X The authors present an analysis of relaxation methods for the one-dimensional discrete convection-diffusion equation based on norms of the iteration matrices. In contrast to standard analytic techniques that use spectral radii, these results show how the performance of iterative solvers is affected by directions of flow associated with the underlying operator, and by orderings of the discrete grid points. In particular, for problems of size n, relaxation against the flow incurs a latency of approximately n steps in which convergence is slow, and red-black relaxation incurs a latency of approximately n/2 steps. There is no latency associated with relaxation that follows that flow. These results are largely independent of the choice of discretization. %B SIAM Journal on Numerical Analysis %V 30 %P 1268 - 1290 %8 1993/10/01/ %@ 0036-1429 %G eng %U http://www.jstor.org/stable/2158237 %N 5 %0 Journal Article %J SIAM Journal on Scientific ComputingSIAM J. Sci. Comput. %D 1993 %T Performance Enhancements and Parallel Algorithms for Two Multilevel Preconditioners %A Elman, Howard %A Guo,Xian-Zhong %B SIAM Journal on Scientific ComputingSIAM J. Sci. Comput. %V 14 %P 890 - 890 %8 1993/// %@ 10648275 %G eng %U http://link.aip.org/link/SJOCE3/v14/i4/p890/s1&Agg=doi %N 4 %R 10.1137/0914055 %0 Conference Paper %B Proceedings of AAAI 1993 Fall Symposium Series: Instantiating Real-World Agents %D 1993 %T Vacuum-logic %A Elgot-drapkin,J. %A Kraus,S. %A Miller,M. %A Nirkhe,M. %A Perlis, Don %B Proceedings of AAAI 1993 Fall Symposium Series: Instantiating Real-World Agents %P 51 - 54 %8 1993/// %G eng %0 Journal Article %J Parallel Computing %D 1992 %T Parallel sparse Cholesky factorization on a shared memory multiprocessor %A Zhang, G. %A Elman, Howard %K linear algebra %K Parallel algorithms %K shared memory multiprocessor %K sparse Cholesky factorization %X Parallel implementations of Cholesky factorization for sparse symmetric positive definite matrices are considered on a shared memory multiprocessor computer. Two column-oriented schemes, known as the column-Cholesky algorithm and the fan-in algorithm, along with enhancements of each, are implemented and discussed. High parallel efficiency of the column-Cholesky algorithm and its enhancement is demonstrated for test problems. A detailed investigation of the performance of the fan-in algorithm and its enhancement, the compute-ahead fan-in algorithm, is made to study the effects of overhead associated with the fan-in based schemes. %B Parallel Computing %V 18 %P 1009 - 1022 %8 1992/09// %@ 0167-8191 %G eng %U http://www.sciencedirect.com/science/article/pii/016781919290014X %N 9 %R 16/0167-8191(92)90014-X %0 Journal Article %J Math. Comp %D 1991 %T Iterative methods for cyclically reduced non-self-adjoint linear systems II %A Elman, Howard %A Golub, G. H %B Math. Comp %V 56 %P 215 - 242 %8 1991/// %G eng %N 193 %0 Journal Article %J Philosophy and AI: Essays at the Interface %D 1991 %T Memory, reason and time: the Step-Logic approach %A Elgot-drapkin,J. %A Miller,M. %A Perlis, Don %B Philosophy and AI: Essays at the Interface %P 79 - 103 %8 1991/// %G eng %0 Journal Article %J Artificial Intelligence %D 1991 %T Nonmonotonicity and the scope of reasoning %A Etherington,D. W %A Kraus,S. %A Perlis, Don %B Artificial Intelligence %V 52 %P 221 - 261 %8 1991/// %G eng %N 3 %0 Journal Article %J International Journal of Intelligent Systems %D 1991 %T Stop the world—I want to think %A Perlis, Don %A Elgot-Drapkin,J. J %A Miller,M. %B International Journal of Intelligent Systems %V 6 %P 443 - 456 %8 1991/// %G eng %N 4 %0 Journal Article %J Human factors in computing systems: CHI'90 Conference proceedings, April 1-5, Seattle %D 1990 %T EVALUATING HYPERMEDIA SYSTEMS %A Ehrlich,K. %A Microsytems,S. %A Marchionini,G. %A Nielsen,J. %A Shneiderman, Ben %B Human factors in computing systems: CHI'90 Conference proceedings, April 1-5, Seattle %P 387 - 387 %8 1990/// %G eng %0 Journal Article %J Math. Comp %D 1990 %T Iterative methods for cyclically reduced non-self-adjoint linear systems %A Elman, Howard %A Golub, G. H %B Math. Comp %V 54 %P 671 - 700 %8 1990/// %G eng %N 190 %0 Journal Article %J International Journal of Expert Systems %D 1990 %T Limited scope and circumscriptive reasoning %A Etherington,D. W %A Kraus,S. %A Perlis, Don %B International Journal of Expert Systems %V 3 %P 207 - 217 %8 1990/// %G eng %N 3 %0 Book %D 1990 %T Line iterative methods for cyclically reduced discrete convection-diffusion problems %A Elman, Howard %A Golub, G. H %I University of Maryland %8 1990/// %G eng %0 Journal Article %J Neural Computation %D 1990 %T Phase transitions in connectionist models having rapidly varying connection strengths %A Reggia, James A. %A Edwards,M. %B Neural Computation %V 2 %P 523 - 535 %8 1990/// %G eng %N 4 %0 Journal Article %J Journal of Experimental and Theoretical Artificial Intellige %D 1990 %T Reasoning situated in time I: Basic concepts %A Elgot-Drapkin,J. J %A Perlis, Don %B Journal of Experimental and Theoretical Artificial Intellige %V 2 %P 75 - 98 %8 1990/// %G eng %N 1 %0 Journal Article %J SIAM Journal on Scientific and Statistical ComputingSIAM J. Sci. and Stat. Comput. %D 1989 %T Approximate Schur Complement Preconditioners on Serial and Parallel Computers %A Elman, Howard %B SIAM Journal on Scientific and Statistical ComputingSIAM J. Sci. and Stat. Comput. %V 10 %P 581 - 581 %8 1989/// %@ 01965204 %G eng %U http://link.aip.org/link/SJOCE3/v10/i3/p581/s1&Agg=doi %N 3 %R 10.1137/0910037 %0 Journal Article %J SIAM Review %D 1989 %T Fourier Analysis of Iterative Methods for Elliptic Problems %A Chan, Tony F. %A Elman, Howard %X This paper presents a Fourier method for analyzing stationary iterative methods and preconditioners for discretized elliptic boundary value problems. As in the von Neumann stability analysis of hyperbolic and parabolic problems, the approach is easier to apply, reveals more details about convergence properties than about standard techniques, and can be applied in a systematic way to a wide class of numerical methods. Although the analysis is applicable only to periodic problems, the results essentially reproduce those of classical convergence and condition number analysis for problems with other boundary conditions, such as the Dirichlet problem. In addition, they give suggestive new evidence of the strengths and weaknesses of methods such as incomplete factorization preconditioners in the Dirichlet case. %B SIAM Review %V 31 %P 20 - 49 %8 1989/03/01/ %@ 0036-1445 %G eng %U http://www.jstor.org/stable/2030846 %N 1 %0 Journal Article %J Computer Physics Communications %D 1989 %T Ordering techniques for the preconditioned conjugate gradient method on parallel computers %A Elman, Howard %A Agrón, Elvira %X We consider the parallel implementation of the preconditioned conjugate gradient method using multicolor incomplete factorization as preconditioners. We discuss numerical experiments on sample problems arising from elliptic partial differential equations, together with an analytic study of the effects of communication and artihmetic costs on loosely coupled architectures. Our main conclusion is that multicolor orderings result in slower convergence of the preconditioned conjugate gradient method than natural orderings, but that the lower parallel costs of the multicolor techniques typically make their overall performance better. %B Computer Physics Communications %V 53 %P 253 - 269 %8 1989/05// %@ 0010-4655 %G eng %U http://www.sciencedirect.com/science/article/pii/0010465589901641 %N 1-3 %R 16/0010-4655(89)90164-1 %0 Journal Article %J BIT Numerical Mathematics %D 1989 %T Relaxed and stabilized incomplete factorizations for non-self-adjoint linear systems %A Elman, Howard %B BIT Numerical Mathematics %V 29 %P 890 - 915 %8 1989/// %G eng %N 4 %0 Journal Article %J Journal of Computational and Applied Mathematics %D 1989 %T Some aspects of parallel implementation of the finite-element method on message passing architectures %A Babuska, I. %A Elman, Howard %K Finite-element methods %K hp-version %K nested dissection %K parallel computations %K preconditioned conjugate gradient %X We discuss some aspects of implementing the finite-element method on parallel computers with local memory and message passing. In particular, we compare the costs of using high-order and low-order elements and of direct and iterative solvers for solving the linear systems that occur. Our model of parallel computation is a two-dimensional grid of processors chosen to be similar in shape to the underlying grid. Our main conclusions are that use of high-order methods is an effective way to achieve high accuracy for some problems, on both serial and parallel computers, and that such methods provide a natural way to achieve efficiency in parallel implementations. In addition, we show that sparse direct solvers generalize naturally to methods based on high-order elements, and that direct solvers are adequate for two-dimensional problems, especially for multiple load vectors. %B Journal of Computational and Applied Mathematics %V 27 %P 157 - 187 %8 1989/09// %@ 0377-0427 %G eng %U http://www.sciencedirect.com/science/article/pii/0377042789903658 %N 1-2 %R 16/0377-0427(89)90365-8 %0 Journal Article %J SPE Reservoir EngineeringSPERE %D 1988 %T Block-Preconditioned Conjugate-Gradient-Like Methods for Numerical Reservoir Simulation %A Eisenstat, Stanley %A Elman, Howard %A Schlutz, Martin %B SPE Reservoir EngineeringSPERE %V 3 %8 1988/02// %@ 0885-9248 %G eng %U http://www.onepetro.org/mslib/servlet/onepetropreview?id=00013534&soc=SPE %N 1 %R 10.2118/13534-PA %0 Journal Article %J Theoretical Computer Science %D 1988 %T Matching patterns in strings subject to multi-linear transformations %A Eilam-Tzoreff,T. %A Vishkin, Uzi %B Theoretical Computer Science %V 60 %P 231 - 254 %8 1988/// %G eng %N 3 %0 Journal Article %J International Journal of Man-Machine Studies %D 1986 %T An experimental comparison of a mouse and arrow-jump keys for an interactive encyclopedia %A Ewing,John %A Mehrabanzad,Simin %A Sheck,Scott %A Ostroff,Dan %A Shneiderman, Ben %X This paper reports on an experiment which was conducted to examine relative merits of using a mouse or arrow-jump keys to select text in an interactive encyclopedia. Timed path traversais were performed by subjects using each device, and were followed by subjective questions. Personality and background of the subjects were recorded to see if those attributes would affect device preference and performance. The arrow-jump keys were found to have the quickest traversal times for paths with either short or long target distances. The subjective responses indicated that the arrow-jump method was overwhelmingly preferred over the mouse method. Personality type was not found to play a critical role. %B International Journal of Man-Machine Studies %V 24 %P 29 - 45 %8 1986/01// %@ 0020-7373 %G eng %U http://www.sciencedirect.com/science/article/pii/S0020737386800384 %N 1 %R 10.1016/S0020-7373(86)80038-4 %0 Journal Article %J SIAM Journal on Scientific and Statistical ComputingSIAM J. Sci. and Stat. Comput. %D 1986 %T A Hybrid Chebyshev Krylov Subspace Algorithm for Solving Nonsymmetric Systems of Linear Equations %A Elman, Howard %A Saad, Youcef %A Saylor, Paul E. %B SIAM Journal on Scientific and Statistical ComputingSIAM J. Sci. and Stat. Comput. %V 7 %P 840 - 840 %8 1986/// %@ 01965204 %G eng %U http://link.aip.org/link/SJOCE3/v7/i3/p840/s1&Agg=doi %N 3 %R 10.1137/0907057 %0 Journal Article %J Numerical Analysis %D 1986 %T Polynomial iteration for nonsymmetric indefinite linear systems %A Elman, Howard %A Streit, R. %B Numerical Analysis %P 103 - 117 %8 1986/// %G eng %0 Journal Article %J SIAM Journal on Numerical Analysis %D 1986 %T Preconditioning by Fast Direct Methods for Nonself-Adjoint Nonseparable Elliptic Equations %A Elman, Howard %A Schultz, Martin H. %X We consider the use of fast direct methods as preconditioners for iterative methods for computing the numerical solution of nonself-adjoint elliptic boundary value problems. We derive bounds on convergence rates that are independent of discretization mesh size. For two-dimensional problems on rectangular domains, discretized on an n × n grid, these bounds lead to asymptotic operation counts of O(n2 log n log ε-1) to achieve relative error ε and O(n2(log n)2) to reach truncation error. %B SIAM Journal on Numerical Analysis %V 23 %P 44 - 57 %8 1986/02/01/ %@ 0036-1429 %G eng %U http://www.jstor.org/stable/2157450 %N 1 %0 Journal Article %J Mathematics of Computation %D 1986 %T A Stability Analysis of Incomplete LU Factorizations %A Elman, Howard %X The combination of iterative methods with preconditionings based on incomplete LU factorizations constitutes an effective class of methods for solving the sparse linear systems arising from the discretization of elliptic partial differential equations. In this paper, we show that there are some settings in which the incomplete LU preconditioners are not effective, and we demonstrate that their poor performance is due to numerical instability. Our analysis consists of an analytic and numerical study of a sample two-dimensional non-self-adjoint elliptic problem discretized by several finite-difference schemes. %B Mathematics of Computation %V 47 %P 191 - 217 %8 1986/07/01/ %@ 0025-5718 %G eng %U http://www.jstor.org/stable/2008089 %N 175 %R 10.2307/2008089 %0 Conference Paper %B Proceedings of the IEEE 1st International Conference on Computer Workstations %D 1985 %T The Engineering of an Environment on Small Machines %A Zelkowitz, Marvin V %A Elgot,J. %A Itkin,D. %A Kowalchack,B. %A Maggio,M. %B Proceedings of the IEEE 1st International Conference on Computer Workstations %P 61 - 69 %8 1985/// %G eng %0 Journal Article %J Elliptic problem solvers II %D 1983 %T The (new) Yale sparse matrix package %A Eisenstat, S. C %A Elman, Howard %A Schultz, M. H %A Sherman, A. H %B Elliptic problem solvers II %P 45 - 52 %8 1983/// %G eng %0 Journal Article %J SIAM Journal on Numerical Analysis %D 1983 %T Variational Iterative Methods for Nonsymmetric Systems of Linear Equations %A Eisenstat, Stanley C. %A Elman, Howard %A Schultz, Martin H. %X We consider a class of iterative algorithms for solving systems of linear equations where the coefficient matrix is nonsymmetric with positive-definite symmetric part. The algorithms are modelled after the conjugate gradient method, and are well suited for large sparse systems. They do not make use of any associated symmetric problems. Convergence results and error bounds are presented. %B SIAM Journal on Numerical Analysis %V 20 %P 345 - 357 %8 1983/04/01/ %@ 0036-1429 %G eng %U http://www.jstor.org/stable/2157222 %N 2 %0 Journal Article %J Dissertation Abstracts International Part B: Science and Engineering[DISS. ABST. INT. PT. B- SCI. & ENG.], %D 1982 %T Iterative methods for large, sparse, nonsymmetric systems of linear equations. %A Elman, Howard %B Dissertation Abstracts International Part B: Science and Engineering[DISS. ABST. INT. PT. B- SCI. & ENG.], %V 43 %P 1982 - 1982 %8 1982/// %G eng %N 5 %0 Report %D 1981 %T Preconditioned Conjugate-Gradient Methods for Nonsymmetric Systems of Linear Equations. %A Elman, Howard %I DTIC Document %8 1981/// %G eng