@article {19691, title = {Discovering Pronoun Categories using Discourse Information}, journal = {Proceedings of the 35th Annual Conference of the Cognitive Science Society}, year = {Submitted}, abstract = {Abstract Interpretation of a pronoun is driven by properties of syntactic distribution. Consequently, acquiring the meaning and the distribution are intertwined. In order to learn that a pronoun is reflexive, learners need to know which entity the pronoun refers to in a ...}, url = {http://ling.umd.edu/~naho/orita_cogsci2013.pdf}, author = {McKeown, R and Feldman, N H and Lidz, J and Jordan Boyd-Graber} } @article {20548, title = {Rapid, quantitative therapeutic screening for Alzheimer{\textquoteright}s enzymes enabled by optimal signal transduction with transistors}, journal = {The Analyst}, volume = {145}, year = {2020}, month = {Feb-04-2021}, pages = {2925 - 2936}, issn = {0003-2654}, doi = {10.1039/C9AN01804B}, url = {http://xlink.rsc.org/?DOI=C9AN01804Bhttp://pubs.rsc.org/en/content/articlepdf/2020/AN/C9AN01804Bhttp://pubs.rsc.org/en/content/articlepdf/2020/AN/C9AN01804B}, author = {Le, Son T. and Morris, Michelle A. and Cardone, Antonio and Guros, Nicholas B. and Klauda, Jeffery B. and Sperling, Brent A. and Richter, Curt A. and Pant, Harish C. and Balijepalli, Arvind} } @article {20300, title = {High-Throughput DNA Sequencing To Profile Microbial Water Quality Of Potable Reuse}, year = {2018}, url = {https://www.wateronline.com/doc/high-throughput-dna-sequencing-to-profile-microbial-water-quality-of-potable-reuse-0001}, author = {Menu B. Leddy and Megan H. Plumlee and Rose S. Kantor and Kara L. Nelson and Scott E. Miller and Lauren C. Kennedy and Blake W. Stamps and John R. Spear and Nur A. Hasan and Rita R Colwell} } @article {20299, title = {Occurrence of Vibrio cholerae in water reservoirs of Burkina Faso}, journal = {Research in Microbiology}, volume = {169}, year = {2018}, month = {Jan-01-2018}, pages = {1 - 10}, abstract = {Africa is currently an important region in which cholera epidemics occur. Little is known about the presence of Vibrio cholerae in freshwater bodies in Africa. There are ca. 1700 lakes and reservoirs in Burkina Faso, most of which have been built within recent decades to secure water resources. The purpose of this study was to investigate the presence of V. cholerae in the water of reservoirs, using the most-probable-number polymerase chain reaction. Results showed that V. cholerae could be detected in water samples collected from 14 of 39 sampled reservoirs. The concentrations varied from 0 MPN/l to more than 1100 MPN/l. Fifty strains of V. cholerae isolated on CHROMagar{\texttrademark} vibrio were identified as V. cholerae non-O1/non-O139, none of which carried the ctxA gene. A significant positive correlation was found between the presence of V. cholerae in the reservoirs and both alkaline pH and phytoplankton biomass. V. cholerae was present in significantly higher numbers in reservoirs of urban areas than in rural areas. Since V. cholerae non-O1/non-O139 has been shown to be a causative agent of endemic diarrheal outbreaks, their presence in Burkina Faso reservoirs suggests they may play a role in gastroenteritis in that country.}, issn = {09232508}, doi = {10.1016/j.resmic.2017.08.004}, url = {https://www.sciencedirect.com/science/article/pii/S092325081730147X?via\%3Dihub}, author = {Kabor{\'e}, Saidou and Cecchi, Philippe and Mosser, Thomas and Toubiana, Myl{\`e}ne and Traor{\'e}, Oumar and Ouattara, Aboubakar S. and Traor{\'e}, Alfred S. and Barro, Nicolas and Rita R Colwell and Monfort, Patrick} } @article {20320, title = {Application of a paper based device containing a new culture medium to detect Vibrio cholerae in water samples collected in Haiti}, journal = {Journal of Microbiological Methods}, volume = {133}, year = {2017}, month = {Jan-02-2017}, pages = {23 - 31}, issn = {01677012}, doi = {10.1016/j.mimet.2016.12.014}, url = {https://www.sciencedirect.com/science/article/pii/S0167701216303578?via\%3Dihub}, author = {Briquaire, Romain and Rita R Colwell and Boncy, Jacques and Rossignol, Emmanuel and Dardy, Aline and Pandini, Isabelle and Villeval, Fran{\c c}ois and Machuron, Jean-Louis and Huq, Anwar and Rashed, Shah and Vandevelde, Thierry and Rozand, Christine} } @article {20315, title = {Assessment of Risk of Cholera in Haiti following Hurricane Matthew}, journal = {The American Journal of Tropical Medicine and Hygiene}, volume = {97}, year = {2017}, month = {Jul-09-2017}, pages = {896 - 903}, abstract = {Damage to the inferior and fragile water and sanitation infrastructure of Haiti after Hurricane Matthew has created an urgent public health emergency in terms of likelihood of cholera occurring in the human population. Using satellite-derived data on precipitation, gridded air temperature, and hurricane path and with information on water and sanitation (WASH) infrastructure, we tracked changing environmental conditions conducive for growth of pathogenic vibrios. Based on these data, we predicted and validated the likelihood of cholera cases occurring past hurricane. The risk of cholera in the southwestern part of Haiti remained relatively high since November 2016 to the present. Findings of this study provide a contemporary process for monitoring ground conditions that can guide public health intervention to control cholera in human population by providing access to vaccines, safe WASH facilities. Assuming current social and behavioral patterns remain constant, it is recommended that WASH infrastructure should be improved and considered a priority especially before 2017 rainy season.}, issn = {0002-9637}, doi = {10.4269/ajtmh.17-0048}, url = {http://www.ajtmh.org/content/journals/10.4269/ajtmh.17-0048}, author = {Huq, Anwar and Anwar, Rifat and Rita R Colwell and McDonald, Michael D. and Khan, Rakib and Jutla, Antarpreet and Akanda, Shafqat} } @article {20314, title = {Beyond cost-effectiveness: Using systems analysis for infectious disease preparedness}, journal = {Vaccine}, volume = {35}, year = {2017}, month = {Jan-01-2017}, pages = {A46 - A49}, abstract = {Until the recent outbreaks, Ebola vaccines ranked low in decision makers{\textquoteright} priority lists based on cost-effectiveness analysis and (or) corporate profitability. Despite a relatively small number of Ebola-related cases and deaths (compared to other causes), Ebola vaccines suddenly leapt to highest priority among international health agencies and vaccine developers. Clearly, earlier cost-effectiveness analyses badly missed some factors affecting real world decisions. Multi-criteria systems analysis can improve evaluation and prioritization of vaccine development and also of many other health policy and investment decisions. Neither cost-effectiveness nor cost-benefit analysis can capture important aspects of problems such as Ebola or the emerging threat of Zika, especially issues of inequality and disparity{\textemdash}issues that dominate the planning of many global health and economic organizations. Cost-benefit analysis requires assumptions about the specific value of life{\textemdash}an idea objectionable to many analysts and policy makers. Additionally, standard cost-effectiveness calculations cannot generally capture effects on people uninfected with Ebola for example, but nevertheless affected through such factors as contagion, herd immunity, and fear of dread disease, reduction of travel and commerce, and even the hope of disease eradication. Using SMART Vaccines, we demonstrate how systems analysis can visibly include important {\textquotedblleft}other factors{\textquotedblright} and more usefully guide decision making and beneficially alter priority setting processes.}, issn = {0264410X}, doi = {10.1016/j.vaccine.2016.08.090}, url = {https://linkinghub.elsevier.com/retrieve/pii/S0264410X16309501}, author = {Phelps, Charles and Madhavan, Guruprasad and Rappuoli, Rino and Rita R Colwell and Fineberg, Harvey} } @article {20308, title = {Comprehensive benchmarking and ensemble approaches for metagenomic classifiers}, journal = {Genome Biology}, year = {2017}, month = {Jan-12-2017}, doi = {10.1186/s13059-017-1299-7}, url = {http://genomebiology.biomedcentral.com/articles/10.1186/s13059-017-1299-7}, author = {McIntyre, Alexa B. R. and Ounit, Rachid and Afshinnekoo, Ebrahim and Prill, Robert J. and H{\'e}naff, Elizabeth and Alexander, Noah and Minot, Samuel S. and Danko, David and Foox, Jonathan and Ahsanuddin, Sofia and Tighe, Scott and Hasan, Nur A. and Subramanian, Poorani and Moffat, Kelly and Levy, Shawn and Lonardi, Stefano and Greenfield, Nick and Rita R Colwell and Rosen, Gail L. and Mason, Christopher E.} } @article {20313, title = {Genomic Methods and Microbiological Technologies for Profiling Novel and Extreme Environments for the Extreme Microbiome Project (XMP)}, journal = {Journal of Biomolecular Techniques : JBT}, volume = {28}, year = {2017}, month = {Jan-04-2017}, pages = {31 - 39}, abstract = {The Extreme Microbiome Project (XMP) is a project launched by the Association of Biomolecular Resource Facilities Metagenomics Research Group (ABRF MGRG) that focuses on whole genome shotgun sequencing of extreme and unique environments using a wide variety of biomolecular techniques. The goals are multifaceted, including development and refinement of new techniques for the following: 1) the detection and characterization of novel microbes, 2) the evaluation of nucleic acid techniques for extremophilic samples, and 3) the identification and implementation of the appropriate bioinformatics pipelines. Here, we highlight the different ongoing projects that we have been working on, as well as details on the various methods we use to characterize the microbiome and metagenome of these complex samples. In particular, we present data of a novel multienzyme extraction protocol that we developed, called Polyzyme or MetaPolyZyme. Presently, the XMP is characterizing sample sites around the world with the intent of discovering new species, genes, and gene clusters. Once a project site is complete, the resulting data will be publically available. Sites include Lake Hillier in Western Australia, the {\textquotedblleft}Door to Hell{\textquotedblright} crater in Turkmenistan, deep ocean brine lakes of the Gulf of Mexico, deep ocean sediments from Greenland, permafrost tunnels in Alaska, ancient microbial biofilms from Antarctica, Blue Lagoon Iceland, Ethiopian toxic hot springs, and the acidic hypersaline ponds in Western Australia.}, issn = {1524-0215}, doi = {10.7171/jbt.17-2801-004}, url = {https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5345951/}, author = {Tighe, Scott and Afshinnekoo, Ebrahim and Rock, Tara M. and McGrath, Ken and Alexander, Noah and McIntyre, Alexa and Ahsanuddin, Sofia and Bezdan, Daniela and Green, Stefan J. and Joye, Samantha and Stewart Johnson, Sarah and Baldwin, Don A. and Bivens, Nathan and Ajami, Nadim and Carmical, Joseph R. and Herriott, Ian Charold and Rita R Colwell and Donia, Mohamed and Foox, Jonathan and Greenfield, Nick and Hunter, Tim and Hoffman, Jessica and Hyman, Joshua and Jorgensen, Ellen and Krawczyk, Diana and Lee, Jodie and Levy, Shawn and Garcia-Reyero, {\`a}lia and Settles, Matthew and Thomas, Kelley and {\'o}mez, Felipe and Schriml, Lynn and Kyrpides, Nikos and Zaikova, Elena and Penterman, Jon and Mason, Christopher E.} } @article {20324, title = {Chitin promotes Mycobacterium ulcerans growth}, journal = {FEMS Microbiology Ecology}, volume = {928565871}, year = {2016}, month = {Jun-06-2017}, pages = {fiw067}, abstract = {Mycobacterium ulcerans (MU) is the causative agent of Buruli ulcer, an emerging human infectious disease. However, both the ecology and life cycle of MU are poorly understood. The occurrence of MU has been linked to the aquatic environment, notably water bodies affected by human activities. It has been hypothesized that one or a combination of environmental factor(s) connected to human activities could favour growth of MU in aquatic systems. Here, we tested in vitro the growth effect of two ubiquitous polysaccharides and five chemical components on MU at concentration ranges shown to occur in endemic regions. Real-time PCR showed that chitin increased MU growth significantly providing a nutrient source or environmental support for the bacillus, thereby, providing a focus on the association between MU and aquatic arthropods. Aquatic environments with elevated population of arthropods provide increased chitin availability and, thereby, enhanced multiplication of MU. If calcium very slightly enhanced MU growth, iron, zinc, sulphate and phosphate did not stimulate MU growth, and at the concentration ranges of this study would limit MU population in natural ecosystems.}, doi = {10.1093/femsec/fiw067}, url = {https://academic.oup.com/femsec/article-lookup/doi/10.1093/femsec/fiw067}, author = {Sanhueza, Daniel and Chevillon, Christine and Rita R Colwell and Babonneau, J{\'e}r{\'e}mie and Marion, Estelle and Marsollier, Laurent and {\'e}gan, {\c c}ois}, editor = {Sobecky, Patricia} } @article {20332, title = {Comparison of inferred relatedness based on multilocus variable-number tandem-repeat analysis and whole genome sequencing of Vibrio cholerae O1}, journal = {FEMS Microbiology Letters}, volume = {36389}, year = {2016}, month = {Nov-06-2017}, pages = {fnw116}, abstract = {Vibrio cholerae causes cholera, a severe diarrheal disease. Understanding the local genetic diversity and transmission of V. cholerae will improve our ability to control cholera. Vibrio cholerae isolates clustered in genetically related groups (clonal complexes, CC) by multilocus variable tandem-repeat analysis (MLVA) were compared by whole genome sequencing (WGS). Isolates in CC1 had been isolated from two geographical locations. Isolates in a second genetically distinct group, CC2, were isolated only at one location. Using WGS, CC1 isolates from both locations revealed, on average, 43.8 nucleotide differences, while those strains comprising CC2 averaged 19.7 differences. Strains from both MLVA-CCs had an average difference of 106.6. Thus, isolates comprising CC1 were more closely related (P < 10-6) to each other than to isolates in CC2. Within a MLVA-CC, after removing all paralogs, alternative alleles were found in all possible combinations on separate chromosomes indicative of recombination within the core genome. Including recombination did not affect the distinctiveness of the MLVA-CCs when measured by WGS. We found that WGS generally reflected the same genetic relatedness of isolates as MLVA, indicating that isolates from the same MLVA-CC shared a more recent common ancestor than isolates from the same location that clustered in a distinct MLVA-CC.}, doi = {10.1093/femsle/fnw116}, url = {https://academic.oup.com/femsle/article-lookup/doi/10.1093/femsle/fnw116}, author = {Rashid, Mahamud-ur and Almeida, Mathieu and Azman, Andrew S. and Lindsay, Brianna R. and Sack, David A. and Rita R Colwell and Huq, Anwar and Morris, J. Glenn and Alam, Munirul and Stine, O. Colin}, editor = {Winstanley, Craig} } @article {20331, title = {In Plain View: A Transparent Systems Approach for Enhancing Health Policy Decisions}, year = {2016}, month = {07/2016}, url = {https://www.nae.edu/19582/Bridge/155266/155393.aspx}, author = {Guru Madhavan and Charles E. Phelps and Rita R Colwell and Rino Rappuoli and Harvey V. Fineberg} } @article {20321, title = {Modeling Sustainability: Population, Inequality, Consumption, and Bidirectional Coupling of the Earth and Human Systems}, journal = {National Science Review}, year = {2016}, month = {Nov-12-2016}, pages = {nww081}, abstract = {Over the last two centuries, the impact of the Human System has grown dramatically, becoming strongly dominant within the Earth System in many different ways. Consumption, inequality, and population have increased extremely fast, especially since about 1950, threatening to overwhelm the many critical functions and ecosystems of the Earth System. Changes in the Earth System, in turn, have important feedback effects on the Human System, with costly and potentially serious consequences. However, current models do not incorporate these critical feedbacks. We argue that in order to understand the dynamics of either system, Earth System Models must be coupled with Human System Models through bidirectional couplings representing the positive, negative, and delayed feedbacks that exist in the real systems. In particular, key Human System variables, such as demographics, inequality, economic growth, and migration, are not coupled with the Earth System but are instead driven by exogenous estimates, such as United Nations population projections. This makes current models likely to miss important feedbacks in the real Earth{\textendash}Human system, especially those that may result in unexpected or counterintuitive outcomes, and thus requiring different policy interventions from current models. The importance and imminence of sustainability challenges, the dominant role of the Human System in the Earth System, and the essential roles the Earth System plays for the Human System, all call for collaboration of natural scientists, social scientists, and engineers in multidisciplinary research and modeling to develop coupled Earth{\textendash}Human system models for devising effective science-based policies and measures to benefit current and future generations.}, issn = {2095-5138}, doi = {10.1093/nsr/nww081}, url = {https://academic.oup.com/nsr/article-lookup/doi/10.1093/nsr/nww081}, author = {Motesharrei, Safa and Rivas, Jorge and Kalnay, Eugenia and Asrar, Ghassem R. and Busalacchi, Antonio J. and Cahalan, Robert F. and Cane, Mark A. and Rita R Colwell and Feng, Kuishuang and Franklin, Rachel S. and Hubacek, Klaus and Miralles-Wilhelm, Fernando and Miyoshi, Takemasa and Ruth, Matthias and Sagdeev, Roald and Shirmohammadi, Adel and Shukla, Jagadish and Srebric, Jelena and Yakovenko, Victor M. and Zeng, Ning} } @article {20327, title = {Recognition of achievement {\textendash} priorities and process}, journal = {Materials Today}, volume = {19}, year = {2016}, month = {Jan-12-2016}, pages = {547 - 549}, issn = {13697021}, doi = {10.1016/j.mattod.2016.08.001}, url = {https://linkinghub.elsevier.com/retrieve/pii/S1369702116301055}, author = {Madsen, Lynnette D. and Rita R Colwell} } @article {20333, title = {Strategic Planning in Population Health and Public Health Practice: A Call to Action for Higher Education}, journal = {The Milbank Quarterly}, volume = {94906033}, year = {2016}, month = {Jan-03-2016}, pages = {109 - 125}, abstract = {POLICY POINTS: Scarce resources, especially in population health and public health practice, underlie the importance of strategic planning. Public health agencies{\textquoteright} current planning and priority setting efforts are often narrow, at times opaque, and focused on single metrics such as cost-effectiveness. As demonstrated by SMART Vaccines, a decision support software system developed by the Institute of Medicine and the National Academy of Engineering, new approaches to strategic planning allow the formal incorporation of multiple stakeholder views and multicriteria decision making that surpass even those sophisticated cost-effectiveness analyses widely recommended and used for public health planning. Institutions of higher education can and should respond by building on modern strategic planning tools as they teach their students how to improve population health and public health practice. CONTEXT: Strategic planning in population health and public health practice often uses single indicators of success or, when using multiple indicators, provides no mechanism for coherently combining the assessments. Cost-effectiveness analysis, the most complex strategic planning tool commonly applied in public health, uses only a single metric to evaluate programmatic choices, even though other factors often influence actual decisions. METHODS: Our work employed a multicriteria systems analysis approach--specifically, multiattribute utility theory--to assist in strategic planning and priority setting in a particular area of health care (vaccines), thereby moving beyond the traditional cost-effectiveness analysis approach. FINDINGS: (1) Multicriteria systems analysis provides more flexibility, transparency, and clarity in decision support for public health issues compared with cost-effectiveness analysis. (2) More sophisticated systems-level analyses will become increasingly important to public health as disease burdens increase and the resources to deal with them become scarcer. CONCLUSIONS: The teaching of strategic planning in public health must be expanded in order to fill a void in the profession{\textquoteright}s planning capabilities. Public health training should actively incorporate model building, promote the interactive use of software tools, and explore planning approaches that transcend restrictive assumptions of cost-effectiveness analysis. The Strategic Multi-Attribute Ranking Tool for Vaccines (SMART Vaccines), which was recently developed by the Institute of Medicine and the National Academy of Engineering to help prioritize new vaccine development, is a working example of systems analysis as a basis for decision support.}, doi = {10.1111/1468-0009.12182}, url = {https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4941964/}, author = {Phelps, Charles and Madhavan, Guruprasad and Rappuoli, Rino and LEVIN, SCOTT and Shortlife, Edward and Rita R Colwell} } @article {20348, title = {Deep-sea hydrothermal vent bacteria related to human pathogenic Vibrio species}, journal = {Proceedings of the National Academy of Sciences}, year = {2015}, month = {Feb-05-2017}, pages = {E2813 - E2819}, abstract = {Vibrio species are both ubiquitous and abundant in marine coastal waters, estuaries, ocean sediment, and aquaculture settings worldwide. We report here the isolation, characterization, and genome sequence of a novel Vibrio species, Vibrio antiquarius, isolated from a mesophilic bacterial community associated with hydrothermal vents located along the East Pacific Rise, near the southwest coast of Mexico. Genomic and phenotypic analysis revealed V. antiquarius is closely related to pathogenic Vibrio species, namely Vibrio alginolyticus, Vibrio parahaemolyticus, Vibrio harveyi, and Vibrio vulnificus, but sufficiently divergent to warrant a separate species status. The V. antiquarius genome encodes genes and operons with ecological functions relevant to the environment conditions of the deep sea and also harbors factors known to be involved in human disease caused by freshwater, coastal, and brackish water vibrios. The presence of virulence factors in this deep-sea Vibrio species suggests a far more fundamental role of these factors for their bacterial host. Comparative genomics revealed a variety of genomic events that may have provided an important driving force in V. antiquarius evolution, facilitating response to environmental conditions of the deep sea.}, issn = {0027-8424}, doi = {10.1073/pnas.1503928112}, url = {http://www.pnas.org/lookup/doi/10.1073/pnas.1503928112}, author = {Hasan, Nur A. and Grim, Christopher J. and Lipp, Erin K. and Rivera, Irma N. G. and Chun, Jongsik and Haley, Bradd J. and Taviani, Elisa and Choi, Seon Young and Hoq, Mozammel and Munk, A. Christine and Brettin, Thomas S. and Bruce, David and Challacombe, Jean F. and Detter, J. Chris and Han, Cliff S. and Eisen, Jonathan A. and Huq, Anwar and Rita R Colwell} } @article {20337, title = {Environmental Surveillance for Toxigenic Vibrio cholerae in Surface Waters of Haiti}, journal = {The American Journal of Tropical Medicine and Hygiene}, volume = {92}, year = {2015}, month = {Jul-01-2015}, pages = {118 - 125}, abstract = {Epidemic cholera was reported in Haiti in 2010, with no information available on the occurrence or geographic distribution of toxigenic Vibrio cholerae in Haitian waters. In a series of field visits conducted in Haiti between 2011 and 2013, water and plankton samples were collected at 19 sites. Vibrio cholerae was detected using culture, polymerase chain reaction, and direct viable count methods (DFA-DVC). Cholera toxin genes were detected by polymerase chain reaction in broth enrichments of samples collected in all visits except March 2012. Toxigenic V. cholerae was isolated from river water in 2011 and 2013. Whole genome sequencing revealed that these isolates were a match to the outbreak strain. The DFA-DVC tests were positive for V. cholerae O1 in plankton samples collected from multiple sites. Results of this survey show that toxigenic V. cholerae could be recovered from surface waters in Haiti more than 2 years after the onset of the epidemic.}, issn = {0002-9637}, doi = {10.4269/ajtmh.13-0601}, url = {http://www.ajtmh.org/content/journals/10.4269/ajtmh.13-0601}, author = {Hill, Vincent R. and Humphrys, Michael S. and Kahler, Amy M. and Boncy, Jacques and Tarr, Cheryl L. and Huq, Anwar and Chen, Arlene and Katz, Lee S. and Mull, Bonnie J. and Derado, Gordana and Haley, Bradd J. and Freeman, Nicole and Rita R Colwell and Turnsek, Maryann} } @article {20347, title = {Hybrid Vibrio~cholerae El Tor Lacking SXT Identified as the Cause of a Cholera Outbreak in the Philippines}, journal = {mBio}, year = {2015}, month = {Jan-05-2015}, abstract = {Cholera continues to be a global threat, with high rates of morbidity and mortality. In 2011, a cholera outbreak occurred in Palawan, Philippines, affecting more than 500 people, and 20 individuals died. Vibrio cholerae O1 was confirmed as the etiological agent. Source attribution is critical in cholera outbreaks for proper management of the disease, as well as to control spread. In this study, three V. cholerae O1 isolates from a Philippines cholera outbreak were sequenced and their genomes analyzed to determine phylogenetic relatedness to V. cholerae O1 isolates from recent outbreaks of cholera elsewhere. The Philippines V. cholerae O1 isolates were determined to be V. cholerae O1 hybrid El Tor belonging to the seventh-pandemic clade. They clustered tightly, forming a monophyletic clade closely related to V. cholerae O1 hybrid El Tor from Asia and Africa. The isolates possess a unique multilocus variable-number tandem repeat analysis (MLVA) genotype (12-7-9-18-25 and 12-7-10-14-21) and lack SXT. In addition, they possess a novel 15-kb genomic island (GI-119) containing a predicted type I restriction-modification system. The CTXΦ-RS1 array of the Philippines isolates was similar to that of V. cholerae O1 MG116926, a hybrid El Tor strain isolated in Bangladesh in 1991. Overall, the data indicate that the Philippines V. cholerae O1 isolates are unique, differing from recent V. cholerae O1 isolates from Asia, Africa, and Haiti. Furthermore, the results of this study support the hypothesis that the Philippines isolates of V. cholerae O1 are indigenous and exist locally in the aquatic ecosystem of the Philippines.}, doi = {10.1128/mBio.00047-15}, url = {http://mbio.asm.org/lookup/doi/10.1128/mBio.00047-15}, author = {Klinzing, David C. and Choi, Seon Young and Hasan, Nur A. and Matias, Ronald R. and Tayag, Enrique and Geronimo, Josefina and Skowronski, Evan and Rashed, Shah M. and Kawashima, Kent and Rosenzweig, C. Nicole and Gibbons, Henry S. and Torres, Brian C. and Liles, Veni and Alfon, Alicia C. and Juan, Maria Luisa and Natividad, Filipinas F. and Cebula, Thomas A. and Rita R Colwell} } @article {20338, title = {Nontoxigenic Vibrio cholerae Non-O1/O139 Isolate from a Case of Human Gastroenteritis in the U.S. Gulf Coast}, journal = {Journal of Clinical Microbiology}, year = {2015}, month = {Jun-01-2016}, pages = {9 - 14}, abstract = {An occurrence of Vibrio cholerae non-O1/O139 gastroenteritis in the U.S. Gulf Coast is reported here. Genomic analysis revealed that the isolate lacked known virulence factors associated with the clinical outcome of a V. cholerae infection but did contain putative genomic islands and other accessory virulence factors. Many of these factors are widespread among environmental strains of V. cholerae, suggesting that there might be additional virulence factors in non-O1/O139 V. cholerae yet to be determined. Phylogenetic analysis revealed that the isolate belonged to a phyletic lineage of environmental V. cholerae isolates associated with sporadic cases of gastroenteritis in the Western Hemisphere, suggesting a need to monitor non-O1/O139 V. cholerae in the interest of public health.}, issn = {0095-1137}, doi = {10.1128/JCM.02187-14}, url = {http://jcm.asm.org/lookup/doi/10.1128/JCM.02187-14}, author = {Hasan, Nur A. and Rezayat, Talayeh and Blatz, Peter J. and Choi, Seon Young and Griffitt, Kimberly J. and Rashed, Shah M. and Huq, Anwar and Conger, Nicholas G. and Rita R Colwell and Grimes, D. Jay}, editor = {Munson, E.} } @article {20319, title = {Occurrence and Diversity of Clinically Important Vibrio Species in the Aquatic Environment of Georgia}, journal = {Frontiers in Public Health}, year = {2015}, month = {10/2015}, doi = {10.3389/fpubh.2015.00232}, url = {http://journal.frontiersin.org/Article/10.3389/fpubh.2015.00232/}, author = {Kokashvili, Tamar and Whitehouse, Chris A. and Tskhvediani, Ana and Grim, Christopher J. and Elbakidze, Tinatin and Mitaishvili, Nino and Janelidze, Nino and Jaiani, Ekaterine and Haley, Bradd J. and Lashkhi, Nino and Huq, Anwar and Rita R Colwell and Tediashvili, Marina} } @article {20344, title = {Rapid Proliferation of Vibrio parahaemolyticus, Vibrio vulnificus, and Vibrio cholerae during Freshwater Flash Floods in French Mediterranean Coastal Lagoons}, journal = {Applied and Environmental Microbiology}, year = {2015}, month = {Jan-11-2015}, pages = {7600 - 7609}, abstract = {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{\textdegree}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{\textperthousand} and concentrations of V. parahaemolyticus, V. vulnificus, and V. cholerae varied from 0 to 1.5 {\texttimes} 103 most probable number (MPN)/liter, 0.7 to 2.1 {\texttimes} 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{\textperthousand} 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{\textperthousand} for V. parahaemolyticus, 10 and 15{\textperthousand} for V. vulnificus, and 5 and 12{\textperthousand} 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.}, issn = {0099-2240}, doi = {10.1128/AEM.01848-15}, url = {http://aem.asm.org/lookup/doi/10.1128/AEM.01848-15}, author = {Esteves, Kevin and Hervio-Heath, Dominique and Mosser, Thomas and Rodier, Claire and Tournoud, Marie-George and Jumas-Bilak, Estelle and Rita R Colwell and Monfort, Patrick}, editor = {Wommack, K. E.} } @article {20062, title = {Survey statistics of automated segmentations applied to optical imaging of mammalian cells}, journal = {BMC bioinformatics}, volume = {16}, year = {2015}, pages = {1}, author = {Bajcsy, Peter and Cardone, Antonio and Chalfoun, Joe and Halter, Michael and Juba, Derek and Kociolek, Marcin and Majurski, Michael and Peskin, Adele and Simon, Carl and Simon, Mylene and others} } @article {20340, title = {A unified initiative to harness Earth{\textquoteright}s microbiomes}, journal = {Science}, year = {2015}, month = {Jun-10-2017}, pages = {507 - 508}, issn = {0036-8075}, doi = {10.1126/science.aac8480}, url = {http://www.sciencemag.org/cgi/doi/10.1126/science.aac8480}, author = {Alivisatos, A. P. and Blaser, M. J. and Brodie, E. L. and Chun, M. and Dangl, J. L. and Donohue, T. J. and Dorrestein, P. C. and Gilbert, J. A. and Green, J. L. and Jansson, J. K. and Knight, R. and Maxon, M. E. and McFall-Ngai, M. J. and Miller, J. F. and Pollard, K. S. and Ruby, E. G. and Taha, S. A. and Rita R Colwell} } @inbook {19631, title = {Can Optimally-Fair Coin Tossing Be Based on One-Way Functions?}, booktitle = {Theory of Cryptography}, series = {Lecture Notes in Computer Science}, year = {2014}, month = {2014/01/01/}, pages = {217 - 239}, publisher = {Springer Berlin Heidelberg}, organization = {Springer Berlin Heidelberg}, abstract = {Coin tossing is a basic cryptographic task that allows two distrustful parties to obtain an unbiased random bit in a way that neither party can bias the output by deviating from the protocol or halting the execution. Cleve [STOC{\textquoteright}86] showed that in any r round coin tossing protocol one of the parties can bias the output by Ω(1/r) through a {\textquotedblleft}fail-stop{\textquotedblright} attack; namely, they simply execute the protocol honestly and halt at some chosen point. In addition, relying on an earlier work of Blum [COMPCON{\textquoteright}82], Cleve presented an r-round protocol based on one-way functions that was resilient to bias at most O(1/r√)O(1/\sqrt r) . Cleve{\textquoteright}s work left open whether {\textquotedblright}{\textquoteleft}optimally-fair{\textquoteright}{\textquotedblright} coin tossing (i.e. achieving bias O(1/r) in r rounds) is possible. Recently Moran, Naor, and Segev [TCC{\textquoteright}09] showed how to construct optimally-fair coin tossing based on oblivious transfer, however, it was left open to find the minimal assumptions necessary for optimally-fair coin tossing. The work of Dachman-Soled et al. [TCC{\textquoteright}11] took a step toward answering this question by showing that any black-box construction of optimally-fair coin tossing based on a one-way functions with n-bit input and output needs Ω(n/logn) rounds. In this work we take another step towards understanding the complexity of optimally-fair coin-tossing by showing that this task (with an arbitrary number of rounds) cannot be based on one-way functions in a black-box way, as long as the protocol is {\textquotedblright}{\textquoteleft}oblivious{\textquoteright}{\textquotedblright} to the implementation of the one-way function. Namely, we consider a natural class of black-box constructions based on one-way functions, called function oblivious, in which the output of the protocol does not depend on the specific implementation of the one-way function and only depends on the randomness of the parties. Other than being a natural notion on its own, the known coin tossing protocols of Blum and Cleve (both based on one-way functions) are indeed function oblivious. Thus, we believe our lower bound for function-oblivious constructions is a meaningful step towards resolving the fundamental open question of the complexity of optimally-fair coin tossing.}, keywords = {Algorithm Analysis and Problem Complexity, black-box separations, Coin-Tossing, Computation by Abstract Devices, Data Encryption, Discrete Mathematics in Computer Science, One-Way Functions, Systems and Data Security}, isbn = {978-3-642-54241-1, 978-3-642-54242-8}, url = {http://link.springer.com/chapter/10.1007/978-3-642-54242-8_10}, author = {Dana Dachman-Soled and Mahmoody, Mohammad and Malkin, Tal}, editor = {Lindell, Yehuda} } @article {20361, title = {Microbial Community Profiling of Human Saliva Using Shotgun Metagenomic Sequencing}, journal = {PLoS ONE}, year = {2014}, month = {Aug-05-2015}, pages = {e97699}, abstract = {Human saliva is clinically informative of both oral and general health. Since next generation shotgun sequencing (NGS) is now widely used to identify and quantify bacteria, we investigated the bacterial flora of saliva microbiomes of two healthy volunteers and five datasets from the Human Microbiome Project, along with a control dataset containing short NGS reads from bacterial species representative of the bacterial flora of human saliva. GENIUS, a system designed to identify and quantify bacterial species using unassembled short NGS reads was used to identify the bacterial species comprising the microbiomes of the saliva samples and datasets. Results, achieved within minutes and at greater than 90\% accuracy, showed more than 175 bacterial species comprised the bacterial flora of human saliva, including bacteria known to be commensal human flora but also Haemophilus influenzae, Neisseria meningitidis, Streptococcus pneumoniae, and Gamma proteobacteria. Basic Local Alignment Search Tool (BLASTn) analysis in parallel, reported ca. five times more species than those actually comprising the in silico sample. Both GENIUS and BLAST analyses of saliva samples identified major genera comprising the bacterial flora of saliva, but GENIUS provided a more precise description of species composition, identifying to strain in most cases and delivered results at least 10,000 times faster. Therefore, GENIUS offers a facile and accurate system for identification and quantification of bacterial species and/or strains in metagenomic samples.}, doi = {10.1371/journal.pone.0097699}, url = {https://dx.plos.org/10.1371/journal.pone.0097699}, author = {Hasan, Nur A. and Young, Brian A. and Minard-Smith, Angela T. and Saeed, Kelly and Li, Huai and Heizer, Esley M. and McMillan, Nancy J. and Isom, Richard and Abdullah, Abdul Shakur and Bornman, Daniel M. and Faith, Seth A. and Choi, Seon Young and Dickens, Michael L. and Cebula, Thomas A. and Rita R Colwell}, editor = {Ahmed, Niyaz} } @article {20362, title = {Molecular diversity and predictability of Vibrio parahaemolyticus along the Georgian coastal zone of the Black Sea}, journal = {Frontiers in Microbiology}, volume = {5}, year = {2014}, month = {Jan-01-2014}, abstract = {Vibrio parahaemolyticus is a leading cause of seafood-related gastroenteritis and is also an autochthonous member of marine and estuarine environments worldwide. One-hundred seventy strains of V. parahaemolyticus were isolated from water and plankton samples collected along the Georgian coast of the Black Sea during 28 months of sample collection. All isolated strains were tested for presence of tlh, trh, and tdh. A subset of strains were serotyped and tested for additional factors and markers of pandemicity. Twenty-six serotypes, five of which are clinically relevant, were identified. Although all 170 isolates were negative for tdh, trh, and the Kanagawa Phenomenon, 7 possessed the GS-PCR sequence and 27 the 850 bp sequence of V. parahaemolyticus pandemic strains. The V. parahaemolyticus population in the Black Sea was estimated to be genomically heterogeneous by rep-PCR and the serodiversity observed did not correlate with rep-PCR genomic diversity. Statistical modeling was used to predict presence of V. parahaemolyticus as a function of water temperature, with strongest concordance observed for Green Cape site samples (Percent of total variance = 70, P < 0.001). Results demonstrate a diverse population of V. parahaemolyticus in the Black Sea, some of which carry pandemic markers, with increased water temperature correlated to an increase in abundance of V. parahaemolyticus.}, doi = {10.3389/fmicb.2014.00045}, url = {http://journal.frontiersin.org/article/10.3389/fmicb.2014.00045}, author = {Haley, Bradd J. and Kokashvili, Tamar and Tskshvediani, Ana and Janelidze, Nino and Mitaishvili, Nino and Grim, Christopher J. and Constantin_de_Magny, Guillaume and Chen, Arlene J. and Taviani, Elisa and Eliashvili, Tamar and Tediashvili, Marina and Whitehouse, Chris A. and Rita R Colwell and Huq, Anwar} } @article {20334, title = {Occurrence in Mexico, 1998{\textendash}2008, of Vibrio cholerae CTX + El Tor carrying an additional truncated CTX prophage}, journal = {Proceedings of the National Academy of Sciences}, volume = {111}, year = {2014}, month = {Aug-07-2014}, pages = {9917 - 9922}, issn = {0027-8424}, doi = {10.1073/pnas.1323408111}, url = {http://www.pnas.org/lookup/doi/10.1073/pnas.1323408111}, author = {Alam, Munirul and Rashed, Shah M and Mannan, Shahnewaj Bin and Islam, Tarequl and Lizarraga-Partida, Marcial L. and Delgado, Gabriela and Morales-Espinosa, Rosario and Mendez, Jose Luis and Navarro, Armando and Watanabe, Haruo and Ohnishi, Makoto and Hasan, Nur A. and Huq, Anwar and Sack, R. Bradley and Rita R Colwell and Cravioto, Alejandro} } @article {20357, title = {Phylodynamic Analysis of Clinical and Environmental Vibrio cholerae Isolates from Haiti Reveals Diversification Driven by Positive Selection}, journal = {mBio}, year = {2014}, month = {Jul-12-2016}, abstract = {Phylodynamic analysis of genome-wide single-nucleotide polymorphism (SNP) data is a powerful tool to investigate underlying evolutionary processes of bacterial epidemics. The method was applied to investigate a collection of 65 clinical and environmental isolates of Vibrio cholerae from Haiti collected between 2010 and 2012. Characterization of isolates recovered from environmental samples identified a total of four toxigenic V. cholerae O1 isolates, four non-O1/O139 isolates, and a novel nontoxigenic V. cholerae O1 isolate with the classical tcpA gene. Phylogenies of strains were inferred from genome-wide SNPs using coalescent-based demographic models within a Bayesian framework. A close phylogenetic relationship between clinical and environmental toxigenic V. cholerae O1 strains was observed. As cholera spread throughout Haiti between October 2010 and August 2012, the population size initially increased and then fluctuated over time. Selection analysis along internal branches of the phylogeny showed a steady accumulation of synonymous substitutions and a progressive increase of nonsynonymous substitutions over time, suggesting diversification likely was driven by positive selection. Short-term accumulation of nonsynonymous substitutions driven by selection may have significant implications for virulence, transmission dynamics, and even vaccine efficacy.}, doi = {10.1128/mBio.01824-14}, url = {http://mbio.asm.org/lookup/doi/10.1128/mBio.01824-14}, author = {Azarian, Taj and Ali, Afsar and Johnson, Judith A. and Mohr, David and Prosperi, Mattia and Veras, Nazle M. and Jubair, Mohammed and Strickland, Samantha L. and Rashid, Mohammad H. and Alam, Meer T. and Weppelmann, Thomas A. and Katz, Lee S. and Tarr, Cheryl L. and Rita R Colwell and Morris, J. Glenn and Salemi, Marco} } @article {19669, title = {Stable isotope labeling of phosphoproteins for large-scale phosphorylation rate determination}, journal = {Molecular \& Cellular Proteomics}, year = {2014}, month = {2014/02/16/}, abstract = {Signals that control response to stimuli and cellular function are transmitted through dynamic phosphorylation of thousands of proteins by protein kinases. Many techniques have been developed to study phosphorylation dynamics, including several mass spectrometry (MS)-based methods. Over the last few decades, substantial developments have been made in MS techniques for the large-scale identification of proteins and their post-translational modifications. Nevertheless, all of the current MS-based techniques for quantifying protein phosphorylation dynamics rely on the measurement of changes in peptide abundance levels and many methods suffer from low confidence in phosphopeptide identification due to poor fragmentation. Here we have optimized an approach for the Stable Isotope Labeling of Amino acids by Phosphate (SILAP) using [gamma-18O4]ATP in nucleo to determine global site-specific phosphorylation rates. The advantages of this metabolic labeling technique are: increased confidence in phosphorylated peptide identification, direct labeling of phosphorylation sites, measurement phosphorylation rates, and the identification of actively phosphorylated sites in a cell-like environment. In this study we calculated approximate rate constants for over 500 phosphorylation sites based on labeling progress curves. We measured a wide range of phosphorylation rate constants from 0.34 min-1 to 0.001 min-1. Finally, we applied SILAP to determine sites that have different phosphorylation kinetics during G1/S and M phase. We found that most sites have very similar phosphorylation rates under both conditions; however a small subset of sites on proteins involved in the mitotic spindle were more actively phosphorylated during M phase, while proteins involved in DNA replication and transcription were more actively phosphorylated during G1/S phase.}, keywords = {DYNAMICS, Phosphoproteins*, Phosphoproteome, Phosphorylation, Post-translational modifications*, Signal Transduction*, turnover}, isbn = {1535-9476, 1535-9484}, url = {http://www.mcponline.org/content/early/2014/02/16/mcp.O113.036145}, author = {Molden, Rosalynn C. and Goya, Jonathan and Zia Khan and Garcia, Benjamin A.} } @article {20360, title = {Validation of high throughput sequencing and microbial forensics applications}, journal = {Investigative Genetics}, volume = {5}, year = {2014}, month = {Jan-01-2014}, pages = {9}, abstract = {High throughput sequencing (HTS) generates large amounts of high quality sequence data for microbial genomics. The value of HTS for microbial forensics is the speed at which evidence can be collected and the power to characterize microbial-related evidence to solve biocrimes and bioterrorist events. As HTS technologies continue to improve, they provide increasingly powerful sets of tools to support the entire field of microbial forensics. Accurate, credible results allow analysis and interpretation, significantly influencing the course and/or focus of an investigation, and can impact the response of the government to an attack having individual, political, economic or military consequences. Interpretation of the results of microbial forensic analyses relies on understanding the performance and limitations of HTS methods, including analytical processes, assays and data interpretation. The utility of HTS must be defined carefully within established operating conditions and tolerances. Validation is essential in the development and implementation of microbial forensics methods used for formulating investigative leads attribution. HTS strategies vary, requiring guiding principles for HTS system validation. Three initial aspects of HTS, irrespective of chemistry, instrumentation or software are: 1) sample preparation, 2) sequencing, and 3) data analysis. Criteria that should be considered for HTS validation for microbial forensics are presented here. Validation should be defined in terms of specific application and the criteria described here comprise a foundation for investigators to establish, validate and implement HTS as a tool in microbial forensics, enhancing public safety and national security.}, issn = {2041-2223}, doi = {10.1186/2041-2223-5-9}, url = {http://investigativegenetics.biomedcentral.com/articles/10.1186/2041-2223-5-9}, author = {Budowle, Bruce and Connell, Nancy D and Bielecka-Oder, Anna and Rita R Colwell and Corbett, Cindi R and Fletcher, Jacqueline and Forsman, Mats and Kadavy, Dana R and Markotic, Alemka and Morse, Stephen A and Murch, Randall S and Sajantila, Antti and Schmedes, Sarah E and Ternus, Krista L and Turner, Stephen D and Minot, Samuel} } @article {20366, title = {Viewing Marine Bacteria, Their Activity and Response to Environmental Drivers from Orbit}, journal = {Microbial Ecology}, year = {2014}, month = {Jan-04-2014}, pages = {489 - 500}, abstract = {Satellite-based remote sensing of marine microorganisms has become a useful tool in predicting human health risks associated with these microscopic targets. Early applications were focused on harmful algal blooms, but more recently methods have been developed to interrogate the ocean for bacteria. As satellite-based sensors have become more sophisticated and our ability to interpret information derived from these sensors has advanced, we have progressed from merely making fascinating pictures from space to developing process models with predictive capability. Our understanding of the role of marine microorganisms in primary production and global elemental cycles has been vastly improved as has our ability to use the combination of remote sensing data and models to provide early warning systems for disease outbreaks. This manuscript will discuss current approaches to monitoring cyanobacteria and vibrios, their activity and response to environmental drivers, and will also suggest future directions.}, issn = {0095-3628}, doi = {10.1007/s00248-013-0363-4}, url = {http://link.springer.com/10.1007/s00248-013-0363-4}, author = {Grimes, D. Jay and Ford, Tim E. and Rita R Colwell and Baker-Austin, Craig and Martinez-Urtaza, Jaime and Subramaniam, Ajit and Capone, Douglas G.} } @inbook {19629, title = {Adaptive and Concurrent Secure Computation from New Adaptive, Non-malleable Commitments}, booktitle = {Advances in Cryptology - ASIACRYPT 2013}, series = {Lecture Notes in Computer Science}, year = {2013}, month = {2013/01/01/}, pages = {316 - 336}, publisher = {Springer Berlin Heidelberg}, organization = {Springer Berlin Heidelberg}, abstract = {We present a unified approach for obtaining general secure computation that achieves adaptive-Universally Composable (UC)-security. Using our approach we essentially obtain all previous results on adaptive concurrent secure computation, both in relaxed models (e.g., quasi-polynomial time simulation), as well as trusted setup models (e.g., the CRS model, the imperfect CRS model). This provides conceptual simplicity and insight into what is required for adaptive and concurrent security, as well as yielding improvements to set-up assumptions and/or computational assumptions in known models. Additionally, we provide the first constructions of concurrent secure computation protocols that are adaptively secure in the timing model, and the non-uniform simulation model. As a corollary we also obtain the first adaptively secure multiparty computation protocol in the plain model that is secure under bounded-concurrency. Conceptually, our approach can be viewed as an adaptive analogue to the recent work of Lin, Pass and Venkitasubramaniam [STOC {\textquoteleft}09], who considered only non-adaptive adversaries. Their main insight was that the non-malleability requirement could be decoupled from the simulation requirement to achieve UC-security. A main conceptual contribution of this work is, quite surprisingly, that it is still the case even when considering adaptive security. A key element in our construction is a commitment scheme that satisfies a strong definition of non-malleability. Our new primitive of concurrent equivocal non-malleable commitments, intuitively, guarantees that even when a man-in-the-middle adversary observes concurrent equivocal commitments and decommitments, the binding property of the commitments continues to hold for commitments made by the adversary. This definition is stronger than previous ones, and may be of independent interest. Previous constructions that satisfy our definition have been constructed in setup models, but either require existence of stronger encryption schemes such as CCA-secure encryption or require independent {\textquotedblleft}trapdoors{\textquotedblright} provided by the setup for every pair of parties to ensure non-malleability. A main technical contribution of this work is to provide a construction that eliminates these requirements and requires only a single trapdoor.}, keywords = {Algorithm Analysis and Problem Complexity, Applications of Mathematics, Data Encryption, Discrete Mathematics in Computer Science, Management of Computing and Information Systems, Systems and Data Security}, isbn = {978-3-642-42032-0, 978-3-642-42033-7}, url = {http://link.springer.com/chapter/10.1007/978-3-642-42033-7_17}, author = {Dana Dachman-Soled and Malkin, Tal and Raykova, Mariana and Venkitasubramaniam, Muthuramakrishnan}, editor = {Sako, Kazue and Sarkar, Palash} } @book {20379, title = {Current Topics in Microbiology and Immunology One Health: The Human-Animal-Environment Interfaces in Emerging Infectious Diseases The Human Environment Interface: Applying Ecosystem Concepts to Health}, volume = {365}, year = {2013}, pages = {83 - 100}, publisher = {Springer Berlin Heidelberg}, organization = {Springer Berlin Heidelberg}, address = {Berlin, Heidelberg}, isbn = {978-3-642-36888-2}, issn = {0070-217X}, doi = {10.1007/978-3-642-36889-9}, url = {http://link.springer.com/10.1007/978-3-642-36889-9}, author = {Preston, Nicholas D. and Daszak, Peter and Rita R Colwell}, editor = {Mackenzie, John S. and Jeggo, Martyn and Daszak, Peter and Richt, Juergen A.} } @article {20367, title = {Drug response and genetic properties of Vibrio cholerae associated with endemic cholera in north-eastern Thailand, 2003-2011}, journal = {Journal of Medical Microbiology}, year = {2013}, month = {Jan-04-2013}, pages = {599 - 609}, abstract = {Cholera, caused by Vibrio cholerae, results in significant morbidity and mortality worldwide, including Thailand. Representative V. cholerae strains associated with endemic cholera (n = 32), including strains (n = 3) from surface water sources, in Khon Kaen, Thailand (2003{\textendash}2011), were subjected to microbiological, molecular and phylogenetic analyses. According to phenotypic and related genetic data, all tested V. cholerae strains belonged to serogroup O1, biotype El Tor (ET), Inaba (IN) or Ogawa (OG). All of the strains were sensitive to gentamicin and ciprofloxacin, while multidrug-resistant (MDR) strains showing resistance to erythromycin, tetracycline, trimethoprim/sulfamethoxazole and ampicillin were predominant in 2007. V. cholerae strains isolated before and after 2007 were non-MDR. All except six diarrhoeal strains possessed ctxA and ctxB genes and were toxigenic altered ET, confirmed by MAMA-PCR and DNA sequencing. Year-wise data revealed that V. cholerae INET strains isolated between 2003 and 2004, plus one strain isolated in 2007, lacked the RS1 sequence (rstC) and toxin-linked cryptic plasmid (TLC)-specific genetic marker, but possessed CTXCL prophage genes ctxB CL and rstR CL. A sharp genetic transition was noted, namely the majority of V. cholerae strains in 2007 and all in 2010 and 2011 were not repressor genotype rstR CL but instead were rstR ET, and all ctx + strains possessed RS1 and TLC-specific genetic markers. DNA sequencing data revealed that strains isolated since 2007 had a mutation in the tcpA gene at amino acid position 64 (N{\textrightarrow}S). Four clonal types, mostly of environmental origin, including subtypes, reflected genetic diversity, while distinct signatures were observed for clonally related, altered ET from Thailand, Vietnam and Bangladesh, confirmed by distinct subclustering patterns observed in the PFGE (NotI)-based dendrogram, suggesting that endemic cholera is caused by V. cholerae indigenous to Khon Kaen.}, issn = {0022-2615}, doi = {10.1099/jmm.0.053801-0}, url = {http://jmm.microbiologyresearch.org/content/journal/jmm/10.1099/jmm.0.053801-0}, author = {Chomvarin, C. and Johura, F.-T. and Mannan, S. B. and Jumroenjit, W. and Kanoktippornchai, B. and Tangkanakul, W. and Tantisuwichwong, N. and Huttayananont, S. and Watanabe, H. and Hasan, N. A. and Huq, A. and Cravioto, A. and Rita R Colwell and Alam, M.} } @article {19700, title = {Improving public transit accessibility for blind riders by crowdsourcing bus stop landmark locations with Google street view}, journal = {The 15th International ACM SIGACCESS Conference}, year = {2013}, month = {2013/00/21}, pages = {16 - 8}, publisher = {SIGACCESS, ACM Special Interest Group on Accessible ComputingACM}, address = {New York, New York, USA}, abstract = {Abstract Low-vision and blind bus riders often rely on known physical landmarks to help locate and verify bus stop locations (eg., by searching for a shelter, bench, newspaper bin). However, there are currently few, if any, methods to determine this information a priori via ...}, isbn = {9781450324052}, doi = {10.1145/2513383.2513448}, url = {http://dl.acm.org/citation.cfm?doid=2513383.2513448}, author = {Hara, Kotaro and Azenkot, Shiri and Campbell, Megan and Bennett, Cynthia L and Le, Vicki and Pannella, Sean and Moore, Robert and Minckler, Kelly and Ng, Rochelle H and Jon Froehlich} } @article {19686, title = {Modeling topic control to detect influence in conversations using nonparametric topic models}, journal = {Machine Learning}, year = {2013}, month = {2013/00/01}, pages = {1 - 41}, publisher = {Springer US}, abstract = {Abstract Identifying influential speakers in multi-party conversations has been the focus of research in communication, sociology, and psychology for decades. It has been long acknowledged qualitatively that controlling the topic of a conversation is a sign of ...}, doi = {10.1007/s10994-013-5417-9/fulltext.html}, url = {http://link.springer.com/article/10.1007/s10994-013-5417-9/fulltext.html}, author = {Nguyen, Viet-An and Jordan Boyd-Graber and Resnik, Philip and Cai, Deborah A and Midberry, Jennifer E and Wang, Yuanxin} } @article {19590, title = {Optimizing Abstract Abstract Machines}, journal = {arXiv:1211.3722 [cs]}, year = {2013}, note = {Comment: Proceedings of the International Conference on Functional Programming 2013 (ICFP 2013). Boston, Massachusetts. September, 2013}, month = {2013///}, abstract = {The technique of abstracting abstract machines (AAM) provides a systematic approach for deriving computable approximations of evaluators that are easily proved sound. This article contributes a complementary step-by-step process for subsequently going from a naive analyzer derived under the AAM approach, to an efficient and correct implementation. The end result of the process is a two to three order-of-magnitude improvement over the systematically derived analyzer, making it competitive with hand-optimized implementations that compute fundamentally less precise results.}, keywords = {Computer Science - Programming Languages, F.3.2}, url = {http://arxiv.org/abs/1211.3722}, author = {Johnson, J. Ian and Labich, Nicholas and Might, Matthew and David Van Horn} } @article {19666, title = {Primate Transcript and Protein Expression Levels Evolve Under Compensatory Selection Pressures}, journal = {Science}, volume = {342}, year = {2013}, month = {2013/11/29/}, pages = {1100 - 1104}, abstract = {Changes in gene regulation have likely played an important role in the evolution of primates. Differences in messenger RNA (mRNA) expression levels across primates have often been documented; however, it is not yet known to what extent measurements of divergence in mRNA levels reflect divergence in protein expression levels, which are probably more important in determining phenotypic differences. We used high-resolution, quantitative mass spectrometry to collect protein expression measurements from human, chimpanzee, and rhesus macaque lymphoblastoid cell lines and compared them to transcript expression data from the same samples. We found dozens of genes with significant expression differences between species at the mRNA level yet little or no difference in protein expression. Overall, our data suggest that protein expression levels evolve under stronger evolutionary constraint than mRNA levels.Don{\textquoteright}t Ape Protein Variation Changes in DNA and messenger RNA (mRNA) expression levels have been used to estimate evolutionary changes between species. However protein expression levels may better reflect selection on divergent and constrained phenotypes. Khan et al. (p. 1100, published online 17 October; see the Perspective by Vogel) measured the differences among and within species between mRNA expression and protein levels in humans, chimpanzees, and rhesus macaques, identifying protein transcripts that seem to be under lineage-specific constraint between humans and chimpanzees. }, isbn = {0036-8075, 1095-9203}, url = {http://www.sciencemag.org/content/342/6162/1100}, author = {Zia Khan and Ford, Michael J. and Cusanovich, Darren A. and Mitrano, Amy and Pritchard, Jonathan K. and Gilad, Yoav} } @article {20369, title = {Quantification of Vibrio parahaemolyticus, Vibrio vulnificus and Vibrio cholerae in French Mediterranean coastal lagoons}, journal = {Research in Microbiology}, volume = {164}, year = {2013}, month = {Jan-10-2013}, pages = {867 - 874}, abstract = {Vibrio parahaemolyticus, Vibrio vulnificus and Vibrio cholerae are human pathogens. Little is known about these Vibrio spp. in the coastal lagoons of France. The purpose of this study was to investigate their incidence in water, shellfish and sediment of three French Mediterranean coastal lagoons using the most probable number-polymerase chain reaction (MPN-PCR). In summer, the total number of V. parahaemolyticus in water, sediment, mussels and clams collected from the three lagoons varied from 1 to >1.1 {\texttimes} 103 MPN/l, 0.09 to 1.1 {\texttimes} 103 MPN/ml, 9 to 210 MPN/g and 1.5 to 2.1 MPN/g, respectively. In winter, all samples except mussels contained V. parahaemolyticus, but at very low concentrations. Pathogenic (tdh- or trh2-positive) V. parahaemolyticus were present in water, sediment and shellfish samples collected from these lagoons. The number of V. vulnificus in water, sediment and shellfish samples ranged from 1 to 1.1 {\texttimes} 103 MPN/l, 0.07 to 110 MPN/ml and 0.04 to 15 MPN/g, respectively, during summer. V. vulnificus was not detected during winter. V. cholerae was rarely detected in water and sediment during summer. In summary, results of this study highlight the finding that the three human pathogenic Vibrio spp. are present in the lagoons and constitute a potential public health hazard.}, issn = {09232508}, doi = {10.1016/j.resmic.2013.06.005}, url = {https://linkinghub.elsevier.com/retrieve/pii/S092325081300106X}, author = {Cantet, Franck and Hervio-Heath, Dominique and Caro, Audrey and Le Mennec, C{\'e}cile and Monteil, Caroline and Qu{\'e}m{\'e}r{\'e}, Catherine and Jolivet-Gougeon, Anne and Rita R Colwell and Monfort, Patrick} } @article {20373, title = {Species composition of limnetic zooplankton from the southern coastal areas (Mathbaria and Bakerganj) in Bangladesh}, journal = {Journal of the Asiatic Society of Bangladesh, Science}, volume = {38}, year = {2013}, month = {Apr-06-2014}, abstract = {We studied the coastal zooplankton community structure of six waterbodies of Mathbaria and Bakerganj from January 2008 to June 2009. In total 35 zooplankton species were identified under 26 genera under 20 families under 8 orders from Mathbaria. Among them 6 were protozoans, 24 were rotifers, 3 were copepods, 1 was cladocerans and 1 was ostracods. From Bakergonj a total of 42 zooplankton species were identified under 23 genera under 17 Families under 7 orders. Among them 3 were protozoans, 25 were rotifers, 7 were copepods, 6 were cladocerans and 1 was ostracods. Results showed that abundance of rotifera group from both area was higher in Mathbaria (64.86\%) and Bakerganj (60.98\%) than other groups while abundance of ostracoda of Bakerganj area was lowest.}, issn = {1016-6947}, doi = {10.3329/jasbs.v38i1.15326}, url = {http://banglajol.info/index.php/JASBS/article/view/15326}, author = {Mozumder, Pronob K and Nahar, Samsun and Naser, M Niamul and Alam, Munirul and Huq, Anwar and Sack, R Bradley and Rita R Colwell} } @book {15503, title = {Advances in Computers}, year = {2012}, month = {2012/05/01/}, publisher = {Academic Press}, organization = {Academic Press}, abstract = {Since its first volume in 1960, Advances in Computers has presented detailed coverage of innovations in computer hardware, software, theory, design, and applications. It has also provided contributors with a medium in which they can explore their subjects in greater depth and breadth than journal articles usually allow. As a result, many articles have become standard references that continue to be of sugnificant, lasting value in this rapidly expanding field. In-depth surveys and tutorials on new computer technologyWell-known authors and researchers in the fieldExtensive bibliographies with most chaptersMany of the volumes are devoted to single themes or subfields of computer science}, keywords = {Computers / Programming / General, Computers / Software Development \& Engineering / General, Mathematics / General}, isbn = {9780123964786}, author = {Memon, Atif M.} } @article {19130, title = {AGORA: Assembly Guided by Optical Restriction Alignment}, journal = {BMC bioinformatics}, volume = {13}, year = {2012}, month = {2012}, abstract = {Genome assembly is difficult due to repeated sequences within the genome, which create ambiguities and cause the final assembly to be broken up into many separate sequences (contigs). Long range linking information, such as mate-pairs or mapping data, is necessary to help assembly software resolve repeats, thereby leading to a more complete reconstruction of genomes. Prior work has used optical maps for validating assemblies and scaffolding contigs, after an initial assembly has been produced. However, optical maps have not previously been used within the genome assembly process. Here, we use optical map information within the popular de Bruijn graph assembly paradigm to eliminate paths in the de Bruijn graph which are not consistent with the optical map and help determine the correct reconstruction of the genome.We developed a new algorithm called AGORA: Assembly Guided by Optical Restriction Alignment. AGORA is the first algorithm to use optical map information directly within the de Bruijn graph framework to help produce an accurate assembly of a genome that is consistent with the optical map information provided. Our simulations on bacterial genomes show that AGORA is effective at producing assemblies closely matching the reference sequences. Additionally, we show that noise in the optical map can have a strong impact on the final assembly quality for some complex genomes, and we also measure how various characteristics of the starting de Bruijn graph may impact the quality of the final assembly. Lastly, we show that a proper choice of restriction enzyme for the optical map may substantially improve the quality of the final assembly. Our work shows that optical maps can be used effectively to assemble genomes within the de Bruijn graph assembly framework. Our experiments also provide insights into the characteristics of the mapping data that most affect the performance of our algorithm, indicating the potential benefit of more accurate optical mapping technologies, such as nano-coding. }, author = {Lin, H.C. and Goldstein, S. and Mendelowitz, L. and Zhou, S. and Wetzel, J. and Schwartz, D.C. and Pop, Mihai} } @article {19654, title = {BclAF1 restriction factor is neutralized by proteasomal degradation and microRNA repression during human cytomegalovirus infection}, journal = {Proceedings of the National Academy of Sciences}, volume = {109}, year = {2012}, month = {2012/06/12/}, pages = {9575 - 9580}, abstract = {Cell proteins can restrict the replication of viruses. Here, we identify the cellular BclAF1 protein as a human cytomegalovirus restriction factor and describe two independent mechanisms the virus uses to decrease its steady-state levels. Immediately following infection, the viral pp71 and UL35 proteins, which are delivered to cells within virions, direct the proteasomal degradation of BclAF1. Although BclAF1 reaccumulates through the middle stages of infection, it is subsequently down-regulated at late times by miR-UL112-1, a virus-encoded microRNA. In the absence of BclAF1 neutralization, viral gene expression and replication are inhibited. These data identify two temporally and mechanistically distinct functions used by human cytomegalovirus to down-regulate a cellular antiviral protein.}, keywords = {innate immunity, intrinsic immunity, miRNA, Proteasome, UL82}, isbn = {0027-8424, 1091-6490}, url = {http://www.pnas.org/content/109/24/9575}, author = {Lee, Song Hee and Kalejta, Robert F. and Kerry, Julie and Semmes, Oliver John and O{\textquoteright}Connor, Christine M. and Zia Khan and Garcia, Benjamin A. and Shenk, Thomas and Murphy, Eain} } @inbook {12400, title = {Collecting Semantic Similarity Ratings to Connect Concepts in Assistive Communication Tools}, booktitle = {Modeling, Learning, and Processing of Text Technological Data StructuresModeling, Learning, and Processing of Text Technological Data Structures}, series = {Studies in Computational Intelligence}, volume = {370}, year = {2012}, month = {2012///}, pages = {81 - 93}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {To compensate for the common inability of people with lexical production impairments to access and express intended concepts, we make use of models of human semantic memory that build on the notion of semantic similarity and relatedness. Such models, constructed on evidence gained from psycholinguistic experiments, form the basis of a large lexical database, WordNet . We augment WordNet with many additional links among words and concepts that are semantically related. Making this densely connected semantic network available to people with anomic aphasia through assistive technologies should enable them to navigate among related words and concepts and retrieve the words that they intend to express.}, isbn = {978-3-642-22612-0}, url = {http://dx.doi.org/10.1007/978-3-642-22613-7_5}, author = {Nikolova,Sonya and Jordan Boyd-Graber and Fellbaum,Christiane}, editor = {Mehler,Alexander and K{\"u}hnberger,Kai-Uwe and Lobin,Henning and L{\"u}ngen,Harald and Storrer,Angelika and Witt,Andreas} } @book {19345, title = {Computational Analysis of Terrorist Groups: Lashkar-e-Taiba}, year = {2012}, month = {2012}, publisher = {Springer Publishing Company, Incorporated}, organization = {Springer Publishing Company, Incorporated}, abstract = {Computational Analysis of Terrorist Groups: Lashkar-e-Taiba provides an in-depth look at Web intelligence, and how advanced mathematics and modern computing technology can influence the insights we have on terrorist groups. This book primarily focuses on one famous terrorist group known as Lashkar-e-Taiba (or LeT), and how it operates. After 10 years of counter Al Qaeda operations, LeT is considered by many in the counter-terrorism community to be an even greater threat to the US and world peace than Al Qaeda. Computational Analysis of Terrorist Groups: Lashkar-e-Taiba is the first book that demonstrates how to use modern computational analysis techniques including methods for big data analysis. This book presents how to quantify both the environment in which LeT operate, and the actions it took over a 20-year period, and represent it as a relational database table. This table is then mined using sophisticated data mining algorithms in order to gain detailed, mathematical, computational and statistical insights into LeT and its operations. This book also provides a detailed history of Lashkar-e-Taiba based on extensive analysis conducted by using open source information and public statements. Each chapter includes a case study, as well as a slide describing the key results which are available on the authors web sites. Computational Analysis of Terrorist Groups: Lashkar-e-Taiba is designed for a professional market composed of government or military workers, researchers and computer scientists working in the web intelligence field. Advanced-level students in computer science will also find this valuable as a reference book.}, isbn = {1461447682, 9781461447689}, author = {V.S. Subrahmanian and Mannes, Aaron and Sliva,Amy and Shakarian, Jana and Dickerson, John P.} } @inbook {19632, title = {Computational Extractors and Pseudorandomness}, booktitle = {Theory of Cryptography}, series = {Lecture Notes in Computer Science}, year = {2012}, month = {2012/01/01/}, pages = {383 - 403}, publisher = {Springer Berlin Heidelberg}, organization = {Springer Berlin Heidelberg}, abstract = {Computational extractors are efficient procedures that map a source of sufficiently high min-entropy to an output that is computationally indistinguishable from uniform. By relaxing the statistical closeness property of traditional randomness extractors one hopes to improve the efficiency and entropy parameters of these extractors, while keeping their utility for cryptographic applications. In this work we investigate computational extractors and consider questions of existence and inherent complexity from the theoretical and practical angles, with particular focus on the relationship to pseudorandomness. An obvious way to build a computational extractor is via the {\textquotedblleft}extract-then-prg{\textquotedblright} method: apply a statistical extractor and use its output to seed a PRG. This approach carries with it the entropy cost inherent to implementing statistical extractors, namely, the source entropy needs to be substantially higher than the PRG{\textquoteright}s seed length. It also requires a PRG and thus relies on one-way functions. We study the necessity of one-way functions in the construction of computational extractors and determine matching lower and upper bounds on the {\textquotedblleft}black-box efficiency{\textquotedblright} of generic constructions of computational extractors that use a one-way permutation as an oracle. Under this efficiency measure we prove a direct correspondence between the complexity of computational extractors and that of pseudorandom generators, showing the optimality of the extract-then-prg approach for generic constructions of computational extractors and confirming the intuition that to build a computational extractor via a PRG one needs to make up for the entropy gap intrinsic to statistical extractors. On the other hand, we show that with stronger cryptographic primitives one can have more entropy- and computationally-efficient constructions. In particular, we show a construction of a very practical computational extractor from any weak PRF without resorting to statistical extractors.}, keywords = {Algorithm Analysis and Problem Complexity, Coding and Information Theory, Computer Communication Networks, Data Encryption, Math Applications in Computer Science, Systems and Data Security}, isbn = {978-3-642-28913-2, 978-3-642-28914-9}, url = {http://link.springer.com/chapter/10.1007/978-3-642-28914-9_22}, author = {Dana Dachman-Soled and Gennaro, Rosario and Krawczyk, Hugo and Malkin, Tal}, editor = {Cramer, Ronald} } @article {12853, title = {Conversion of viable but nonculturable enteric bacteria to culturable by co-culture with eukaryotic cells}, journal = {Microbiology and Immunology}, volume = {56}, year = {2012}, month = {2012/04/27/}, pages = {342 - 345}, abstract = {Viable but nonculturable (VBNC) Vibrio cholerae non-O1/non-O139, V. parahaemolyticus, enterohemorrhagic Escherichia coli, enterotoxigenic E. coli, enteropathogenic E. coli, Shigella flexneri, and Salmonella enterica were converted to the culturable state by co-culture with selected eukaryotic cells, e.g., HT-29, Caco-2, T84, HeLa, Intestine 407, and CHO cells.}, keywords = {conversion to culturability, enteric bacteria, viable but nonculturable}, isbn = {1348-0421}, doi = {10.1111/j.1348-0421.2012.00440.x}, url = {http://onlinelibrary.wiley.com/doi/10.1111/j.1348-0421.2012.00440.x/abstract?userIsAuthenticated=false\&deniedAccessCustomisedMessage=}, author = {Senoh,Mitsutoshi and Ghosh-Banerjee,Jayeeta and Ramamurthy,Thandavarayan and Rita R Colwell and Miyoshi,Shin-ichi and Nair,G. Balakrish and Takeda,Yoshifumi} } @article {19128, title = {Deep Sequencing of the Oral Microbiome Reveals Signatures of Periodontal Disease}, journal = {PloS one}, volume = {7}, year = {2012}, month = {2012}, abstract = {The oral microbiome, the complex ecosystem of microbes inhabiting the human mouth, harbors several thousands of bacterial types. The proliferation of pathogenic bacteria within the mouth gives rise to periodontitis, an inflammatory disease known to also constitute a risk factor for cardiovascular disease. While much is known about individual species associated with pathogenesis, the system-level mechanisms underlying the transition from health to disease are still poorly understood. Through the sequencing of the 16S rRNA gene and of whole community DNA we provide a glimpse at the global genetic, metabolic, and ecological changes associated with periodontitis in 15 subgingival plaque samples, four from each of two periodontitis patients, and the remaining samples from three healthy individuals. We also demonstrate the power of whole-metagenome sequencing approaches in characterizing the genomes of key players in the oral microbiome, including an unculturable TM7 organism. We reveal the disease microbiome to be enriched in virulence factors, and adapted to a parasitic lifestyle that takes advantage of the disrupted host homeostasis. Furthermore, diseased samples share a common structure that was not found in completely healthy samples, suggesting that the disease state may occupy a narrow region within the space of possible configurations of the oral microbiome. Our pilot study demonstrates the power of high-throughput sequencing as a tool for understanding the role of the oral microbiome in periodontal disease. Despite a modest level of sequencing (~2 lanes Illumina 76 bp PE) and high human DNA contamination (up to ~90\%) we were able to partially reconstruct several oral microbes and to preliminarily characterize some systems-level differences between the healthy and diseased oral microbiomes.}, author = {Liu,B. and Faller, L.L. and Klitgord, N. and Mazumdar, V. and Ghodsi,M. and Sommer, D.D. and Gibbons, T.R. and Treangen, T.J. and Chang, Y.C. and Li,S.} } @article {19658, title = {Drosophila Src regulates anisotropic apical surface growth to control epithelial tube size}, journal = {Nature Cell Biology}, volume = {14}, year = {2012}, month = {2012/05//}, pages = {518 - 525}, abstract = {Networks of epithelial and endothelial tubes are essential for the function of organs such as the lung, kidney and vascular system. The sizes and shapes of these tubes are highly regulated to match their individual functions. Defects in tube size can cause debilitating diseases such as polycystic kidney disease and ischaemia. It is therefore critical to understand how tube dimensions are regulated. Here we identify the tyrosine kinase Src as an instructive regulator of epithelial-tube length in the Drosophila tracheal system. Loss-of-function Src42 mutations shorten tracheal tubes, whereas Src42 overexpression elongates them. Surprisingly, Src42 acts distinctly from known tube-size pathways and regulates both the amount of apical surface growth and, with the conserved formin dDaam, the direction of growth. Quantitative three-dimensional image analysis reveals that Src42- and dDaam-mutant tracheal cells expand more in the circumferential than the axial dimension, resulting in tubes that are shorter in length{\textemdash}but larger in diameter{\textemdash}than wild-type tubes. Thus, Src42 and dDaam control tube dimensions by regulating the direction of anisotropic growth, a mechanism that has not previously been described.}, isbn = {1465-7392}, url = {http://www.nature.com/ncb/journal/v14/n5/abs/ncb2467.html}, author = {Nelson, Kevin S. and Zia Khan and Moln{\'a}r, Imre and Mih{\'a}ly, J{\'o}zsef and Kaschube, Matthias and Beitel, Greg J.} } @article {20387, title = {Ecology of Vibrio parahaemolyticus and Vibrio vulnificus in the Coastal and Estuarine Waters of Louisiana, Maryland, Mississippi, and Washington (United States)}, journal = {Applied and Environmental Microbiology}, year = {2012}, month = {Mar-10-2013}, pages = {7249 - 7257}, abstract = {Vibrio parahaemolyticus and Vibrio vulnificus, which are native to estuaries globally, are agents of seafood-borne or wound infections, both potentially fatal. Like all vibrios autochthonous to coastal regions, their abundance varies with changes in environmental parameters. Sea surface temperature (SST), sea surface height (SSH), and chlorophyll have been shown to be predictors of zooplankton and thus factors linked to vibrio populations. The contribution of salinity, conductivity, turbidity, and dissolved organic carbon to the incidence and distribution of Vibrio spp. has also been reported. Here, a multicoastal, 21-month study was conducted to determine relationships between environmental parameters and V. parahaemolyticus and V. vulnificus populations in water, oysters, and sediment in three coastal areas of the United States. Because ecologically unique sites were included in the study, it was possible to analyze individual parameters over wide ranges. Molecular methods were used to detect genes for thermolabile hemolysin (tlh), thermostable direct hemolysin (tdh), and tdh-related hemolysin (trh) as indicators of V. parahaemolyticus and the hemolysin gene vvhA for V. vulnificus. SST and suspended particulate matter were found to be strong predictors of total and potentially pathogenic V. parahaemolyticus and V. vulnificus. Other predictors included chlorophyll a, salinity, and dissolved organic carbon. For the ecologically unique sites included in the study, SST was confirmed as an effective predictor of annual variation in vibrio abundance, with other parameters explaining a portion of the variation not attributable to SST.}, issn = {0099-2240}, doi = {10.1128/AEM.01296-12}, url = {http://aem.asm.org/lookup/doi/10.1128/AEM.01296-12}, author = {Johnson, Crystal N. and Bowers, John C. and Griffitt, Kimberly J. and Molina, Vanessa and Clostio, Rachel W. and Pei, Shaofeng and Laws, Edward and Paranjpye, Rohinee N. and Strom, Mark S. and Chen, Arlene and Hasan, Nur A. and Huq, Anwar and Noriea, Nicholas F. and Grimes, D. Jay and Rita R Colwell} } @inbook {19634, title = {Efficient Password Authenticated Key Exchange via Oblivious Transfer}, booktitle = {Public Key Cryptography {\textendash} PKC 2012}, series = {Lecture Notes in Computer Science}, year = {2012}, month = {2012/01/01/}, pages = {449 - 466}, publisher = {Springer Berlin Heidelberg}, organization = {Springer Berlin Heidelberg}, abstract = {We present a new framework for constructing efficient password authenticated key exchange (PAKE) protocols based on oblivious transfer (OT). Using this framework, we obtain: an efficient and simple UC-secure PAKE protocol that is secure against adaptive corruptions without erasures. efficient and simple PAKE protocols under the Computational Diffie-Hellman (CDH) assumption and the hardness of factoring. (Previous efficient constructions rely on hash proof systems, which appears to be inherently limited to decisional assumptions.) All of our constructions assume a common reference string (CRS) but do not rely on random oracles.}, keywords = {adaptive security, Algorithm Analysis and Problem Complexity, Computer Communication Networks, Data Encryption, Discrete Mathematics in Computer Science, Management of Computing and Information Systems, oblivious transfer, Password Authenticated Key Exchange, search assumptions, Systems and Data Security, UC security}, isbn = {978-3-642-30056-1, 978-3-642-30057-8}, url = {http://link.springer.com/chapter/10.1007/978-3-642-30057-8_27}, author = {Canetti, Ran and Dana Dachman-Soled and Vaikuntanathan, Vinod and Wee, Hoeteck}, editor = {Fischlin, Marc and Buchmann, Johannes and Manulis, Mark} } @article {19126, title = {Exploiting sparseness in de novo genome assembly}, journal = {BMC bioinformatics}, volume = {13}, year = {2012}, month = {2012}, abstract = {The very large memory requirements for the construction of assembly graphs for de novo genome assembly limit current algorithms to super-computing environments.In this paper, we demonstrate that constructing a sparse assembly graph which stores only a small fraction of the observed k-mers as nodes and the links between these nodes allows the de novo assembly of even moderately-sized genomes (~500 M) on a typical laptop computer. We implement this sparse graph concept in a proof-of-principle software package, SparseAssembler, utilizing a new sparse k-mer graph structure evolved from the de Bruijn graph. We test our SparseAssembler with both simulated and real data, achieving ~90\% memory savings and retaining high assembly accuracy, without sacrificing speed in comparison to existing de novo assemblers. }, author = {Ye, C. and Ma, Z.S. and Cannon, C.H. and Pop, Mihai and Yu, D.W.} } @article {19131, title = {A framework for human microbiome research}, journal = {Nature}, volume = {486}, year = {2012}, month = {2012}, pages = {215 - 221}, abstract = {A variety of microbial communities and their genes (the microbiome) exist throughout the human body, with fundamental roles in human health and disease. The National Institutes of Health (NIH)-funded Human Microbiome Project Consortium has established a population-scale framework to develop metagenomic protocols, resulting in a broad range of quality-controlled resources and data including standardized methods for creating, processing and interpreting distinct types of high-throughput metagenomic data available to the scientific community. Here we present resources from a population of 242 healthy adults sampled at 15 or 18 body sites up to three times, which have generated 5,177 microbial taxonomic profiles from 16S ribosomal RNA genes and over 3.5 terabases of metagenomic sequence so far. In parallel, approximately 800 reference strains isolated from the human body have been sequenced. Collectively, these data represent the largest resource describing the abundance and variety of the human microbiome, while providing a framework for current and future studies.}, author = {Meth{\'e}, B.A. and Nelson,K. E and Pop, Mihai and Creasy, H.H. and Giglio, M.G. and Huttenhower, C. and Gevers, D. and Petrosino, J.F. and Abubucker, S. and Badger, J.H.} } @article {16266, title = {GAGE: A Critical Evaluation of Genome Assemblies and Assembly Algorithms}, journal = {Genome Research}, volume = {22}, year = {2012}, month = {2012}, pages = {557 - 567}, abstract = {New sequencing technology has dramatically altered the landscape of whole-genome sequencing, allowing scientists to initiate numerous projects to decode the genomes of previously unsequenced organisms. The lowest-cost technology can generate deep coverage of most species, including mammals, in just a few days. The sequence data generated by one of these projects consist of millions or billions of short DNA sequences (reads) that range from 50 to 150 nt in length. These sequences must then be assembled de novo before most genome analyses can begin. Unfortunately, genome assembly remains a very difficult problem, made more difficult by shorter reads and unreliable long-range linking information. In this study, we evaluated several of the leading de novo assembly algorithms on four different short-read data sets, all generated by Illumina sequencers. Our results describe the relative performance of the different assemblers as well as other significant differences in assembly difficulty that appear to be inherent in the genomes themselves. Three overarching conclusions are apparent: first, that data quality, rather than the assembler itself, has a dramatic effect on the quality of an assembled genome; second, that the degree of contiguity of an assembly varies enormously among different assemblers and different genomes; and third, that the correctness of an assembly also varies widely and is not well correlated with statistics on contiguity. To enable others to replicate our results, all of our data and methods are freely available, as are all assemblers used in this study.}, doi = {10.1101/gr.131383.111}, url = {http://genome.cshlp.org/content/22/3/557}, author = {Salzberg,Steven L. and Phillippy,Adam M and Zimin,Aleksey and Puiu,Daniela and Magoc,Tanja and Koren,Sergey and Treangen,Todd J and Schatz,Michael C and Delcher,Arthur L. and Roberts,Michael and Mar{\c c}ais,Guillaume and Pop, Mihai and Yorke,James A.} } @article {20374, title = {Genetic characteristics of drug-resistant Vibrio cholerae O1 causing endemic cholera in Dhaka, 2006-2011}, journal = {Journal of Medical Microbiology}, year = {2012}, month = {Jan-12-2012}, pages = {1736 - 1745}, abstract = {Vibrio cholerae O1 biotype El Tor (ET), causing the seventh cholera pandemic, was recently replaced in Bangladesh by an altered ET possessing ctxB of the Classical (CL) biotype, which caused the first six cholera pandemics. In the present study, V. cholerae O1 strains associated with endemic cholera in Dhaka between 2006 and 2011 were analysed for major phenotypic and genetic characteristics. Of 54 representative V. cholerae isolates tested, all were phenotypically ET and showed uniform resistance to trimethoprim/sulfamethoxazole (SXT) and furazolidone (FR). Resistance to tetracycline (TE) and erythromycin (E) showed temporal fluctuation, varying from year to year, while all isolates were susceptible to gentamicin (CN) and ciprofloxacin (CIP). Year-wise data revealed erythromycin resistance to be 33.3 \% in 2006 and 11 \% in 2011, while tetracycline resistance accounted for 33, 78, 0, 100 and 27 \% in 2006, 2007, 2008, 2009 and 2010, respectively; interestingly, all isolates tested were sensitive to TE in 2011, as observed in 2008. All V. cholerae isolates tested possessed genetic elements such as SXT, ctxAB, tcpA ET, rstR ET and rtxC; none had IntlI (Integron I). Double mismatch amplification mutation assay (DMAMA)-PCR followed by DNA sequencing and analysis of the ctxB gene revealed a point mutation at position 58 (C{\textrightarrow}A), which has resulted in an amino acid substitution from histidine (H) to asparagine (N) at position 20 (genotype 7) since 2008. Although the multi-resistant strains having tetracycline resistance showed minor genetic divergence, V. choleraestrains were clonal, as determined by a PFGE (NotI)-based dendrogram. This study shows 2008{\textendash}2010 to be the time of transition from ctxB genotype 1 to genotype 7 in V. cholerae ET causing endemic cholera in Dhaka, Bangladesh.}, issn = {0022-2615}, doi = {10.1099/jmm.0.049635-0}, url = {http://jmm.microbiologyresearch.org/content/journal/jmm/10.1099/jmm.0.049635-0}, author = {Rashed, S. M. and Mannan, S. B. and Johura, F.-T. and Islam, M. T. and Sadique, A. and Watanabe, H. and Sack, R. B. and Huq, A. and Rita R Colwell and Cravioto, A. and Alam, M.} } @article {15917, title = {Gradient-based Image Recovery Methods from Incomplete Fourier Measurements}, journal = {IEEE Transactions on Image Processing}, volume = {PP}, year = {2012}, month = {2012///}, pages = {1 - 1}, abstract = {A major problem in imaging applications such as Magnetic Resonance Imaging (MRI) and Synthetic Aperture Radar (SAR) is the task of trying to reconstruct an image with the smallest possible set of Fourier samples, every single one of which has a potential time and/or power cost. The theory of Compressive Sensing (CS) points to ways of exploiting inherent sparsity in such images in order to achieve accurate recovery using sub- Nyquist sampling schemes. Traditional CS approaches to this problem consist of solving total-variation minimization programs with Fourier measurement constraints or other variations thereof. This paper takes a different approach: Since the horizontal and vertical differences of a medical image are each more sparse or compressible than the corresponding total-variational image, CS methods will be more successful in recovering these differences individually. We develop an algorithm called GradientRec that uses a CS algorithm to recover the horizontal and vertical gradients and then estimates the original image from these gradients. We present two methods of solving the latter inverse problem: one based on least squares optimization and the other based on a generalized Poisson solver. After a thorough derivation of our complete algorithm, we present the results of various experiments that compare the effectiveness of the proposed method against other leading methods.}, keywords = {Compressed sensing, Fourier transforms, Image coding, Image edge detection, Image reconstruction, L1{\textendash}minimization, minimization, Noise measurement, OPTIMIZATION, Poisson solver, Sparse recovery, Total variation, TV}, isbn = {1057-7149}, doi = {10.1109/TIP.2011.2159803}, author = {Patel, Vishal M. and Maleh,R. and Gilbert,A. C and Chellapa, Rama} } @article {15427, title = {Grey-box GUI Testing: Efficient Generation of Event Sequences}, journal = {arXiv:1205.4928}, year = {2012}, month = {2012/05/22/}, abstract = {Graphical user interfaces (GUIs), due to their event driven nature, present a potentially unbounded space of all possible ways to interact with software. During testing it becomes necessary to effectively sample this space. In this paper we develop algorithms that sample the GUI{\textquoteright}s input space by only generating sequences that (1) are allowed by the GUI{\textquoteright}s structure, and (2) chain together only those events that have data dependencies between their event handlers. We create a new abstraction, called an event-dependency graph (EDG) of the GUI, that captures data dependencies between event handler code. We develop a mapping between EDGs and an existing black-box user-level model of the GUI{\textquoteright}s workflow, called an event-flow graph (EFG). We have implemented automated EDG construction in a tool that analyzes the bytecode of each event handler. We evaluate our "grey-box" approach using four open-source applications and compare it with the current state-of-the-art EFG approach. Our results show that using the EDG reduces the number of test cases while still achieving at least the same coverage. Furthermore, we were able to detect 2 new bugs in the subject applications.}, keywords = {68N30, Computer Science - Software Engineering}, url = {http://arxiv.org/abs/1205.4928}, author = {Arlt,Stephan and Banerjee,Ishan and Bertolini,Cristiano and Memon, Atif M. and Sch{\"a}f,Martin} } @article {19721, title = {InterPro in 2011: new developments in the family and domain prediction database.}, journal = {Nucleic Acids Res}, volume = {40}, year = {2012}, month = {2012 Jan}, pages = {D306-12}, abstract = {

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

}, keywords = {Databases, Protein, Protein Structure, Tertiary, Proteins, Sequence Analysis, Protein, software, Terminology as Topic, User-Computer Interface}, issn = {1362-4962}, doi = {10.1093/nar/gkr948}, author = {Hunter, Sarah and Jones, Philip and Mitchell, Alex and Apweiler, Rolf and Attwood, Teresa K and Bateman, Alex and Bernard, Thomas and Binns, David and Bork, Peer and Burge, Sarah and de Castro, Edouard and Coggill, Penny and Corbett, Matthew and Das, Ujjwal and Daugherty, Louise and Duquenne, Lauranne and Finn, Robert D and Fraser, Matthew and Gough, Julian and Haft, Daniel and Hulo, Nicolas and Kahn, Daniel and Kelly, Elizabeth and Letunic, Ivica and Lonsdale, David and Lopez, Rodrigo and Madera, Martin and Maslen, John and McAnulla, Craig and McDowall, Jennifer and McMenamin, Conor and Mi, Huaiyu and Mutowo-Muellenet, Prudence and Mulder, Nicola and Natale, Darren and Orengo, Christine and Pesseat, Sebastien and Punta, Marco and Quinn, Antony F and Rivoire, Catherine and Sangrador-Vegas, Amaia and Jeremy D Selengut and Sigrist, Christian J A and Scheremetjew, Maxim and Tate, John and Thimmajanarthanan, Manjulapramila and Thomas, Paul D and Wu, Cathy H and Yeats, Corin and Yong, Siew-Yit} } @article {19589, title = {Introspective Pushdown Analysis of Higher-Order Programs}, journal = {arXiv:1207.1813 [cs]}, year = {2012}, note = {Comment: Proceedings of the 17th ACM SIGPLAN International Conference on Functional Programming, 2012, ACM}, month = {2012/07/07/}, abstract = {In the static analysis of functional programs, pushdown flow analysis and abstract garbage collection skirt just inside the boundaries of soundness and decidability. Alone, each method reduces analysis times and boosts precision by orders of magnitude. This work illuminates and conquers the theoretical challenges that stand in the way of combining the power of these techniques. The challenge in marrying these techniques is not subtle: computing the reachable control states of a pushdown system relies on limiting access during transition to the top of the stack; abstract garbage collection, on the other hand, needs full access to the entire stack to compute a root set, just as concrete collection does. \emph{Introspective} pushdown systems resolve this conflict. Introspective pushdown systems provide enough access to the stack to allow abstract garbage collection, but they remain restricted enough to compute control-state reachability, thereby enabling the sound and precise product of pushdown analysis and abstract garbage collection. Experiments reveal synergistic interplay between the techniques, and the fusion demonstrates "better-than-both-worlds" precision.}, keywords = {Computer Science - Programming Languages, D.3.4, F.3.2}, url = {http://arxiv.org/abs/1207.1813}, author = {Earl, Christopher and Sergey, Ilya and Might, Matthew and David Van Horn} } @article {12854, title = {Vibrio Cholerae Classical Biotype Strains Reveal Distinct Signatures in Mexico}, journal = {Journal of Clinical Microbiology}, year = {2012}, month = {04/2012}, abstract = {Vibrio cholerae O1 Classical (CL) biotype caused the 5th and 6th, and probably the earlier cholera pandemics, before the El Tor (ET) biotype initiated the 7th pandemic in Asia in the 1970{\textquoteright}s by completely displacing the CL biotype. Although the CL biotype was thought to be extinct in Asia, and it had never been reported from Latin America, V. cholerae CL and ET biotypes, including hybrid ET were found associated with endemic cholera in Mexico between 1991 and 1997. In this study, CL biotype strains isolated from endemic cholera in Mexico, between 1983 and 1997 were characterized in terms of major phenotypic and genetic traits, and compared with CL biotype strains isolated in Bangladesh between 1962 and 1989. According to sero- and bio-typing data, all V. cholerae strains tested had the major phenotypic and genotypic characteristics specific for the CL biotype. Antibiograms revealed the majority of the Bangladeshi strains to be resistant to trimethoprim/sulfamethoxazole, furazolidone, ampicillin, and gentamycin, while the Mexican strains were sensitive to all of these drugs, as well as to ciprofloxacin, erythromycin, and tetracycline. Pulsed-field gel electrophoresis (PFGE) of NotI-digested genomic DNA revealed characteristic banding patterns for all the CL biotype strains, although the Mexican strains differed with the Bangladeshi strains in 1-2 DNA bands. The difference may be subtle, but consistent, as confirmed by the sub-clustering patterns in the PFGE-based dendrogram, and can serve as regional signature, suggesting pre-1991 existence and evolution of the CL biotype strains in the Americas, independent from that of Asia.}, isbn = {0095-1137, 1098-660X}, doi = {10.1128/JCM.00189-12}, url = {http://jcm.asm.org/content/early/2012/04/12/JCM.00189-12}, author = {Alam,Munirul and Islam,M. Tarequl and Rashed,Shah Manzur and Johura,Fatema-Tuz and Bhuiyan,Nurul A. and Delgado,Gabriela and Morales,Rosario and Mendez,Jose Luis and Navarro,Armando and Watanabe,Haruo and Hasan,Nur-A. and Rita R Colwell and Cravioto,Alejandro} } @article {17673, title = {Mobile Data Offloading through Opportunistic Communications and Social Participation}, journal = {Mobile Computing, IEEE Transactions on}, volume = {11}, year = {2012}, month = {2012/05//}, pages = {821 - 834}, abstract = {3G networks are currently overloaded, due to the increasing popularity of various applications for smartphones. Offloading mobile data traffic through opportunistic communications is a promising solution to partially solve this problem, because there is almost no monetary cost for it. We propose to exploit opportunistic communications to facilitate information dissemination in the emerging Mobile Social Networks (MoSoNets) and thus reduce the amount of mobile data traffic. As a case study, we investigate the target-set selection problem for information delivery. In particular, we study how to select the target set with only k users, such that we can minimize the mobile data traffic over cellular networks. We propose three algorithms, called Greedy, Heuristic, and Random, for this problem and evaluate their performance through an extensive trace-driven simulation study. Our simulation results verify the efficiency of these algorithms for both synthetic and real-world mobility traces. For example, the Heuristic algorithm can offload mobile data traffic by up to 73.66 percent for a real-world mobility trace. Moreover, to investigate the feasibility of opportunistic communications for mobile phones, we implement a proof-of-concept prototype, called Opp-off, on Nokia N900 smartphones, which utilizes their Bluetooth interface for device/service discovery and content transfer.}, keywords = {3G mobile communication, 3G networks, Bluetooth interface, cellular networks, cellular radio, content transfer, device/service discovery, graph theory, greedy algorithm, heuristic algorithm, information delivery, information dissemination, mobile data offloading, mobile data traffic, mobile phones, mobile social networks, MoSoNets, Nokia N900 smartphones, Opp-off, opportunistic communications, random algorithm, real-world mobility traces, smart phones, social networking (online), social participation, target-set selection problem, telecommunication network routing, Telecommunication traffic, trace-driven simulation study}, isbn = {1536-1233}, doi = {10.1109/TMC.2011.101}, author = {Han,Bo and Hui,Pan and Kumar,V. S.A and Marathe,M. V and Shao,Jianhua and Srinivasan, Aravind} } @article {13829, title = {Modality and Negation in SIMT Use of Modality and Negation in Semantically-Informed Syntactic MT}, journal = {Computational Linguistics}, year = {2012}, month = {2012///}, pages = {1 - 48}, abstract = {This paper describes the resource- and system-building efforts of an eight-week Johns Hopkins University Human Language Technology Center of Excellence Summer Camp for Applied Language Exploration (SCALE-2009) on Semantically-Informed Machine Translation (SIMT). We describe a new modality/negation (MN) annotation scheme, the creation of a (publicly available) MN lexicon, and two automated MN taggers that we built using the annotation scheme and lexicon. Our annotation scheme isolates three components of modality and negation: a trigger (a word that conveys modality or negation), a target (an action associated with modality or negation) and a holder (an experiencer of modality). We describe how our MN lexicon was semi-automatically produced and we demonstrate that a structure-based MN tagger results in precision around 86\% (depending on genre) for tagging of a standard LDC data set.}, isbn = {0891-2017}, doi = {10.1162/COLI_a_00099}, url = {http://dx.doi.org/10.1162/COLI_a_00099}, author = {Baker,Kathryn and Bloodgood,Michael and Dorr, Bonnie J and Callison-Burch,Chris and Filardo,Nathaniel W. and Piatko,Christine and Levin,Lori and Miller,Scott} } @article {12857, title = {Occurrence of protozoans \& their limnological relationships in some ponds of Mathbaria, Bangladesh}, journal = {University Journal of Zoology, Rajshahi University}, volume = {29}, year = {2012}, month = {2012///}, pages = {69 - 71}, isbn = {1023-6104}, url = {http://journals.sfu.ca/bd/index.php/UJZRU}, author = {Mozumder,P. K. and Banu,M. A. and Naser,M. N. and Ali,M. S. and Alam,M. and Sack,R. B. and Rita R Colwell and Huq,A.} } @conference {17641, title = {Optimizing epidemic protection for socially essential workers}, booktitle = {Proceedings of the 2nd ACM SIGHIT International Health Informatics Symposium}, series = {IHI {\textquoteright}12}, year = {2012}, month = {2012///}, pages = {31 - 40}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Public-health policy makers have many tools to mitigate an epidemic{\textquoteright}s effects. Most related research focuses on the direct effects on those infected (in terms of health, life, or productivity). Interventions including treatment, prophylaxis, quarantine, and social distancing are well studied in this context. These interventions do not address indirect effects due to the loss of critical services and infrastructures when too many of those responsible for their day-to-day operations fall ill. We examine, both analytically and through simulation, the protection of such essential subpopulations by sequestering them, effectively isolating them into groups during an epidemic. We develop a framework for studying the benefits of sequestering and heuristics for when to sequester. We also prove a key property of sequestering placement which helps partition the subpopulations optimally. Thus we provide a first step toward determining how to allocate resources between the direct protection of a population, and protection of those responsible for critical services.}, keywords = {epidemiology, OPTIMIZATION, public health informatics}, isbn = {978-1-4503-0781-9}, doi = {10.1145/2110363.2110371}, url = {http://doi.acm.org/10.1145/2110363.2110371}, author = {Barrett,Chris and Beckman,Richard and Bisset,Keith and Chen,Jiangzhuo and DuBois,Thomas and Eubank,Stephen and Kumar,V. S. Anil and Lewis,Bryan and Marathe,Madhav V. and Srinivasan, Aravind and Stretz,Paula E.} } @conference {19219, title = {Personal informatics in practice: improving quality of life through data}, year = {2012}, month = {2012}, pages = {2799 - 2802}, publisher = {ACM}, organization = {ACM}, isbn = {1450310168}, author = {Li, I. and Medynskiy, Y. and Jon Froehlich and Larsen, J.} } @conference {15650, title = {Polytope approximation and the Mahler volume}, booktitle = {Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms}, series = {SODA {\textquoteright}12}, year = {2012}, month = {2012///}, pages = {29 - 42}, publisher = {SIAM}, organization = {SIAM}, abstract = {The problem of approximating convex bodies by polytopes is an important and well studied problem. Given a convex body K in Rd, the objective is to minimize the number of vertices (alternatively, the number of facets) of an approximating polytope for a given Hausdorff error ε. Results to date have been of two types. The first type assumes that K is smooth, and bounds hold in the limit as ε tends to zero. The second type requires no such assumptions. The latter type includes the well known results of Dudley (1974) and Bronshteyn and Ivanov (1976), which show that in spaces of fixed dimension, O((diam(K)/ε)(d-1)/2) vertices (alt., facets) suffice. Our results are of this latter type. In our first result, under the assumption that the width of the body in any direction is at least ε, we strengthen the above bound to [EQUATION]. This is never worse than the previous bound (by more than logarithmic factors) and may be significantly better for skinny bodies. Our analysis exploits an interesting analogy with a classical concept from the theory of convexity, called the Mahler volume. This is a dimensionless quantity that involves the product of the volumes of a convex body and its polar dual. In our second result, we apply the same machinery to improve upon the best known bounds for answering ε-approximate polytope membership queries. Given a convex polytope P defined as the intersection of halfspaces, such a query determines whether a query point q lies inside or outside P, but may return either answer if q{\textquoteright}s distance from P{\textquoteright}s boundary is at most ε. We show that, without increasing storage, it is possible to reduce the best known search times for ε-approximate polytope membership significantly. This further implies improvements to the best known search times for approximate nearest neighbor searching in spaces of fixed dimension.}, url = {http://dl.acm.org/citation.cfm?id=2095116.2095119}, author = {Arya,Sunil and da Fonseca,Guilherme D. and Mount, Dave} } @article {19611, title = {Preserving Link Privacy in Social Network Based Systems}, journal = {arXiv:1208.6189 [cs]}, year = {2012}, note = {Comment: 16 pages, 15 figures}, month = {2012/08/30/}, abstract = {A growing body of research leverages social network based trust relationships to improve the functionality of the system. However, these systems expose users{\textquoteright} trust relationships, which is considered sensitive information in today{\textquoteright}s society, to an adversary. In this work, we make the following contributions. First, we propose an algorithm that perturbs the structure of a social graph in order to provide link privacy, at the cost of slight reduction in the utility of the social graph. Second we define general metrics for characterizing the utility and privacy of perturbed graphs. Third, we evaluate the utility and privacy of our proposed algorithm using real world social graphs. Finally, we demonstrate the applicability of our perturbation algorithm on a broad range of secure systems, including Sybil defenses and secure routing.}, keywords = {Computer Science - Cryptography and Security, Computer Science - Social and Information Networks}, url = {http://arxiv.org/abs/1208.6189}, author = {Mittal, Prateek and Charalampos Papamanthou and Song, Dawn} } @book {19356, title = {Scientific Freedom and Human Rights}, year = {2012}, month = {2012}, pages = {564}, publisher = {IEEE Computer Society Press}, organization = {IEEE Computer Society Press}, abstract = {There is a great deal of difference between feeling empathy for those whose human rights are being violated around the world and actually doing something about it. This memoir, written by the Vice-Chair Computer Science (CS) of the Committee of Concerned Scientists (CCS), 1962-present, and Vice-Chair of the Committee on Scientific Freedom and Human Rights (CSFHR) of the ACM, 1980-1989, is a first-hand account of computer scientists working with numerous other constituencies to safeguard or advance the human rights of scientists throughout the world. Drawing from the author{\textquoteright}s considerable archives from the period, "Scientific Freedom and Human Rights" is a treasure trove of historical information about a critical -- and relatively unsung -- human rights campaign, its successes and heartbreaking challenges, and possible lessons to be applied to future human rights campaigns. "The solidarity of the global scientific community was especially important in giving moral support to the intellectual leaders of the struggle for Soviet Jewry, helping them to continue their scientific activity even in a time of persecution. Their activism also helped to link scientific cooperation with the Soviet Union with freedom within the Soviet Union.... You will read these stories and see the support given many scientists throughout the world in this book." -- Natan Sharansky, Jewish Agency Chairman of the Executive "It is not very often that solidarity among scientists is brought to the public eye, and it is certainly not common for people outside science to associate scientists with heroic struggles for human rights, freedom, and dignity. Jack Minker{\textquoteright}s new book will change this perception." -- Professor Judea Pearl, University of California at Los Angeles}, keywords = {Biography \& Autobiography / Science \& Technology}, isbn = {9780769546605}, author = {Minker, Jack} } @article {15182, title = {Secure multi-party computation of boolean circuits with applications to privacy in on-line marketplaces}, journal = {Topics in Cryptology{\textendash}CT-RSA 2012}, year = {2012}, month = {2012///}, pages = {416 - 432}, abstract = {Protocols for generic secure multi-party computation (MPC) generally come in two forms: they either represent the function being computed as a boolean circuit, or as an arithmetic circuit over a large field. Either type of protocol can be used for any function, but the choice of which protocol to use can have a significant impact on efficiency. The magnitude of the effect, however, has never been quantified.With this in mind, we implement the MPC protocol of Goldreich, Micali, and Wigderson [13], which uses a boolean representation and is secure against a semi-honest adversary corrupting any number of parties. We then consider applications of secure MPC in on-line marketplaces, where customers select resources advertised by providers and it is desired to ensure privacy to the extent possible. Problems here are more naturally formulated in terms of boolean circuits, and we study the performance of our MPC implementation relative to existing ones that use an arithmetic-circuit representation. Our protocol easily handles tens of customers/providers and thousands of resources, and outperforms existing implementations including FairplayMP [3], VIFF [11], and SEPIA [7]. }, doi = {10.1007/978-3-642-27954-6_26}, author = {Choi,S. and Hwang,K.W. and Katz, Jonathan and Malkin,T. and Rubenstein,D.} } @conference {19374, title = {Sub-cellular feature detection and automated extraction of collocalized actin and myosin regions}, booktitle = {the 2nd ACM SIGHIT symposiumProceedings of the 2nd ACM SIGHIT symposium on International health informatics - IHI {\textquoteright}12}, year = {2012}, pages = {399}, publisher = {ACM Press}, organization = {ACM Press}, address = {Miami, Florida, USANew York, New York, USA}, isbn = {9781450307819}, doi = {10.1145/211036310.1145/2110363.2110409}, author = {Martineau, Justin and Mokashi,Ronil and Chapman, David and Grasso, Michael and Brady,Mary and Yesha,Yelena and Yesha,Yaacov and Cardone, Antonio and Dima, Alden} } @article {12858, title = {Temporal and Spatial Variability in the Distribution of Vibrio vulnificus in the Chesapeake Bay: A Hindcast Study}, journal = {EcoHealth}, year = {2012}, month = {2012///}, pages = {1 - 12}, abstract = {Vibrio vulnificus, an estuarine bacterium, is the causative agent of seafood-related gastroenteritis, primary septicemia, and wound infections worldwide. It occurs as part of the normal microflora of coastal marine environments and can be isolated from water, sediment, and oysters. Hindcast prediction was undertaken to determine spatial and temporal variability in the likelihood of occurrence of V. vulnificus in surface waters of the Chesapeake Bay. Hindcast predictions were achieved by forcing a multivariate habitat suitability model with simulated sea surface temperature and salinity in the Bay for the period between 1991 and 2005 and the potential hotspots of occurrence of V. vulnificus in the Chesapeake Bay were identified. The likelihood of occurrence of V. vulnificus during high and low rainfall years was analyzed. From results of the study, it is concluded that hindcast prediction yields an improved understanding of environmental conditions associated with occurrence of V. vulnificus in the Chesapeake Bay.}, doi = {10.1007/s10393-011-0736-4}, author = {Banakar,V. and Constantin de Magny,G. and Jacobs,J. and Murtugudde,R. and Huq,A. and J. Wood,R. and Rita R Colwell} } @article {18605, title = {Towards a cost model for network traffic}, journal = {SIGCOMM Comput. Commun. Rev.}, volume = {42}, year = {2012}, month = {2012///}, pages = {54 - 60}, abstract = {We develop a holistic cost model that operators can use to help evaluate the costs of various routing and peering decisions. Using real traffic data from a large carrier network, we show how network operators can use this cost model to significantly reduce the cost of carrying traffic in their networks. We find that adjusting the routing for a small fraction of total flows (and total traffic volume) significantly reduces cost in many cases. We also show how operators can use the cost model both to evaluate potential peering arrangements and for other network operations problems.}, keywords = {cost optimization, traffic cost model}, isbn = {0146-4833}, doi = {10.1145/2096149.2096157}, url = {http://doi.acm.org/10.1145/2096149.2096157}, author = {Motiwala,Murtaza and Dhamdhere,Amogh and Feamster, Nick and Lakhina,Anukool} } @article {15115, title = {Two-server password-only authenticated key exchange}, journal = {Journal of Computer and System Sciences}, volume = {78}, year = {2012}, month = {2012/03//}, pages = {651 - 669}, abstract = {Typical protocols for password-based authentication assume a single server that stores all the information (e.g., the password) necessary to authenticate a user. An inherent limitation of this approach, assuming low-entropy passwords are used, is that the user's password is exposed if this server is ever compromised. To address this issue, it has been suggested to share a user's password information among multiple servers, and to have these servers cooperate (possibly in a threshold manner) when the user wants to authenticate. We show here a two-server version of the password-only key-exchange protocol of Katz, Ostrovsky, and Yung (the KOY protocol). Our work gives the first secure two-server protocol for the password-only setting (in which the user need remember only a password, and not the servers' public keys), and is the first two-server protocol (in any setting) with a proof of security in the standard model. Our work thus fills a gap left by the work of MacKenzie et al. (2006) [31] and Di Raimondo and Gennaro (2006) [16]. As an additional benefit of our work, we show modifications that improve the efficiency of the original KOY protocol.}, keywords = {Key-exchange protocols, passwords}, isbn = {0022-0000}, doi = {10.1016/j.jcss.2011.09.005}, url = {http://www.sciencedirect.com/science/article/pii/S0022000011001048}, author = {Katz, Jonathan and MacKenzie,Philip and Taban,Gelareh and Gligor,Virgil} } @article {19717, title = {Whole genome analysis of Leptospira licerasiae provides insight into leptospiral evolution and pathogenicity.}, journal = {PLoS Negl Trop Dis}, volume = {6}, year = {2012}, month = {2012}, pages = {e1853}, abstract = {

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

}, keywords = {DNA, Bacterial, Evolution, Molecular, Gene Transfer, Horizontal, Genome, Bacterial, Genomic islands, HUMANS, Leptospira, Molecular Sequence Data, Multigene Family, Prophages, Sequence Analysis, DNA, Virulence factors}, issn = {1935-2735}, doi = {10.1371/journal.pntd.0001853}, author = {Ricaldi, Jessica N and Fouts, Derrick E and Jeremy D Selengut and Harkins, Derek M and Patra, Kailash P and Moreno, Angelo and Lehmann, Jason S and Purushe, Janaki and Sanka, Ravi and Torres, Michael and Webster, Nicholas J and Vinetz, Joseph M and Matthias, Michael A} } @conference {17746, title = {Abduction in Annotated Probabilistic Temporal Logic}, booktitle = {Technical Communications of the 27th International Conference on Logic Programming (ICLP{\textquoteright}11)}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, volume = {11}, year = {2011}, month = {2011///}, pages = {240 - 250}, publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}, organization = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}, abstract = {Annotated Probabilistic Temporal (APT) logic programs are a form of logic programs that allow users to state (or systems to automatically learn)rules of the form {\textquoteleft}{\textquoteleft}formula G becomes true K time units after formula F became true with L to U\% probability.{\textquoteright}{\textquoteright} In this paper, we develop a theory of abduction for APT logic programs. Specifically, given an APT logic program Pi, a set of formulas H that can be {\textquoteleft}{\textquoteleft}added{\textquoteright}{\textquoteright} to Pi, and a goal G, is there a subset S of H such that Pi \cup S is consistent and entails the goal G? In this paper, we study the complexity of the Basic APT Abduction Problem (BAAP). We then leverage a geometric characterization of BAAP to suggest a set of pruning strategies when solving BAAP and use these intuitions to develop a sound and complete algorithm.}, isbn = {978-3-939897-31-6}, doi = {http://dx.doi.org/10.4230/LIPIcs.ICLP.2011.240}, author = {Molinaro,Cristian and Sliva,Amy and V.S. Subrahmanian} } @article {19583, title = {Abstracting Abstract Machines: A Systematic Approach to Higher-Order Program Analysis}, journal = {arXiv:1105.1743 [cs]}, year = {2011}, note = {Comment: Communications of the ACM, Research Highlight}, month = {2011/05/09/}, abstract = {Predictive models are fundamental to engineering reliable software systems. However, designing conservative, computable approximations for the behavior of programs (static analyses) remains a difficult and error-prone process for modern high-level programming languages. What analysis designers need is a principled method for navigating the gap between semantics and analytic models: analysis designers need a method that tames the interaction of complex languages features such as higher-order functions, recursion, exceptions, continuations, objects and dynamic allocation. We contribute a systematic approach to program analysis that yields novel and transparently sound static analyses. Our approach relies on existing derivational techniques to transform high-level language semantics into low-level deterministic state-transition systems (with potentially infinite state spaces). We then perform a series of simple machine refactorings to obtain a sound, computable approximation, which takes the form of a non-deterministic state-transition systems with finite state spaces. The approach scales up uniformly to enable program analysis of realistic language features, including higher-order functions, tail calls, conditionals, side effects, exceptions, first-class continuations, and even garbage collection.}, keywords = {Computer Science - Programming Languages, F.3.2, F.4.1}, url = {http://arxiv.org/abs/1105.1743}, author = {David Van Horn and Might, Matthew} } @conference {18330, title = {Active inference for retrieval in camera networks}, booktitle = {Person-Oriented Vision (POV), 2011 IEEE Workshop on}, year = {2011}, month = {2011/01//}, pages = {13 - 20}, publisher = {IEEE}, organization = {IEEE}, abstract = {We address the problem of searching camera network videos to retrieve frames containing specified individuals. We show the benefit of utilizing a learned probabilistic model that captures dependencies among the cameras. In addition, we develop an active inference framework that can request human input at inference time, directing human attention to the portions of the videos whose correct annotation would provide the biggest performance improvements. Our primary contribution is to show that by mapping video frames in a camera network onto a graphical model, we can apply collective classification and active inference algorithms to significantly increase the performance of the retrieval system, while minimizing the number of human annotations required.}, isbn = {978-1-61284-036-9}, doi = {10.1109/POV.2011.5712363}, url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=5712363\&tag=1}, author = {Daozheng Chen and Bilgic,Mustafa and Getoor, Lise and Jacobs, David W. and Mihalkova,Lilyana and Tom Yeh} } @conference {14431, title = {Active inference for retrieval in camera networks}, booktitle = {Person-Oriented Vision (POV), 2011 IEEE Workshop on}, year = {2011}, month = {2011/01//}, pages = {13 - 20}, abstract = {We address the problem of searching camera network videos to retrieve frames containing specified individuals. We show the benefit of utilizing a learned probabilistic model that captures dependencies among the cameras. In addition, we develop an active inference framework that can request human input at inference time, directing human attention to the portions of the videos whose correct annotation would provide the biggest performance improvements. Our primary contribution is to show that by mapping video frames in a camera network onto a graphical model, we can apply collective classification and active inference algorithms to significantly increase the performance of the retrieval system, while minimizing the number of human annotations required.}, keywords = {active, annotation;probabilistic, frame;cameras;inference, inference;camera, mechanisms;probability;search, model;human, model;retrieval, network;graphical, problem;video, problems;video, processing;, retrieval;video, signal, system;searching}, doi = {10.1109/POV.2011.5712363}, author = {Daozheng Chen and Bilgic,M. and Getoor, Lise and Jacobs, David W. and Mihalkova,L. and Tom Yeh} } @article {15616, title = {Approximate polytope membership queries}, journal = {Proceedings of 43rd Annual ACM Symposium on Theory of Computing}, year = {2011}, month = {2011///}, pages = {579 - 586}, abstract = {We consider an approximate version of a fundamental geo-metric search problem, polytope membership queries. Given a convex polytope P in Rd, presented as the intersection of halfspaces, the objective is to preprocess P so that, given a query point q, it is possible to determine efficiently whether q lies inside P subject to an error bound ε. Previous solutions to this problem were based on straight- forward applications of classic polytope approximation tech- niques by Dudley (1974) and Bentley et al. (1982). The former yields minimum storage, and the latter yields con- stant query time. A space-time tradeoff can be obtained by interpolating between the two. We present the first sig- nificant improvements to this tradeoff. For example, using the same storage as Dudley, we reduce the query time from O(1/ε (d-1)/2 ) to O(1/ε (d-1)/4 ). Our approach is based on a very simple algorithm. Both lower bounds and upper bounds on the performance of the algorithm are presented. To establish the relevance of our results, we introduce a reduction from approximate nearest neighbor searching to approximate polytope membership queries. We show that our tradeoff provides significant improvements to the best known space-time tradeoffs for approximate nearest neigh- bor searching. Furthermore, this is achieved with construc- tions that are much simpler than existing methods }, author = {Arya,S. and da Fonseca,G. D and Mount, Dave} } @article {18547, title = {Architecting for innovation}, journal = {SIGCOMM Comput. Commun. Rev.}, volume = {41}, year = {2011}, month = {2011///}, pages = {24 - 36}, abstract = {We argue that the biggest problem with the current Internet architecture is not a particular functional deficiency, but its inability to accommodate innovation. To address this problem we propose a minimal architectural "framework" in which comprehensive architectures can reside. The proposed Framework for Internet Innovation (FII) --- which is derived from the simple observation that network interfaces should be extensible and abstract --- allows for a diversity of architectures to coexist, communicate, and evolve. We demonstrate FII{\textquoteright}s ability to accommodate diversity and evolution with a detailed examination of how information flows through the architecture and with a skeleton implementation of the relevant interfaces.}, keywords = {diversity, Evolution, innovation, internet architecture}, isbn = {0146-4833}, doi = {10.1145/2002250.2002256}, url = {http://doi.acm.org/10.1145/2002250.2002256}, author = {Koponen,Teemu and Shenker,Scott and Balakrishnan,Hari and Feamster, Nick and Ganichev,Igor and Ghodsi,Ali and Godfrey,P. Brighten and McKeown,Nick and Parulkar,Guru and Raghavan,Barath and Rexford,Jennifer and Arianfar,Somaya and Kuptsov,Dmitriy} } @conference {18333, title = {Associating the visual representation of user interfaces with their internal structures and metadata}, booktitle = {Proceedings of the 24th annual ACM symposium on User interface software and technology}, series = {UIST {\textquoteright}11}, year = {2011}, month = {2011///}, pages = {245 - 256}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Pixel-based methods are emerging as a new and promising way to develop new interaction techniques on top of existing user interfaces. However, in order to maintain platform independence, other available low-level information about GUI widgets, such as accessibility metadata, was neglected intentionally. In this paper, we present a hybrid framework, PAX, which associates the visual representation of user interfaces (i.e. the pixels) and their internal hierarchical metadata (i.e. the content, role, and value). We identify challenges to building such a framework. We also develop and evaluate two new algorithms for detecting text at arbitrary places on the screen, and for segmenting a text image into individual word blobs. Finally, we validate our framework in implementations of three applications. We enhance an existing pixel-based system, Sikuli Script, and preserve the readability of its script code at the same time. Further, we create two novel applications, Screen Search and Screen Copy, to demonstrate how PAX can be applied to development of desktop-level interactive systems.}, keywords = {accessibility api, Graphical user interfaces, Pixel, text detection, text segmentation}, isbn = {978-1-4503-0716-1}, doi = {10.1145/2047196.2047228}, url = {http://doi.acm.org/10.1145/2047196.2047228}, author = {Chang,Tsung-Hsiang and Tom Yeh and Miller,Rob} } @inbook {18819, title = {Automated Planning Logic Synthesis for Autonomous Unmanned Vehicles in Competitive Environments with Deceptive Adversaries}, booktitle = {New Horizons in Evolutionary Robotics}, series = {Studies in Computational Intelligence}, volume = {341}, year = {2011}, month = {2011///}, pages = {171 - 193}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {We developed a new approach for automated synthesis of a planning logic for autonomous unmanned vehicles. This new approach can be viewed as an automated iterative process during which an initial version of a logic is synthesized and then gradually improved by detecting and fixing its shortcomings. This is achieved by combining data mining for extraction of vehicle{\textquoteright}s states of failure and Genetic Programming (GP) technique for synthesis of corresponding navigation code. We verified the feasibility of the approach using unmanned surface vehicles (USVs) simulation. Our focus was specifically on the generation of a planning logic used for blocking the advancement of an intruder boat towards a valuable target. Developing autonomy logic for this behavior is challenging as the intruder{\textquoteright}s attacking logic is human-competitive with deceptive behavior so the USV is required to learn specific maneuvers for specific situations to do successful blocking. We compared the performance of the generated blocking logic to the performance of logic that was manually implemented. Our results show that the new approach was able to synthesize a blocking logic with performance closely approaching the performance of the logic coded by hand.}, keywords = {engineering}, isbn = {978-3-642-18271-6}, url = {http://www.springerlink.com/content/f454477212518671/abstract/}, author = {Svec,Petr and Gupta, Satyandra K.}, editor = {Doncieux,St{\'e}phane and Bred{\`e}che,Nicolas and Mouret,Jean-Baptiste} } @conference {13069, title = {AVSS 2011 demo session: A large-scale benchmark dataset for event recognition in surveillance video}, booktitle = {Advanced Video and Signal-Based Surveillance (AVSS), 2011 8th IEEE International Conference on}, year = {2011}, month = {2011/09/30/2}, pages = {527 - 528}, abstract = {We introduce to the surveillance community the VIRAT Video Dataset[1], which is a new large-scale surveillance video dataset designed to assess the performance of event recognition algorithms in realistic scenes1.}, doi = {10.1109/AVSS.2011.6027400}, author = {Oh,Sangmin and Hoogs,Anthony and Perera,Amitha and Cuntoor,Naresh and Chen,Chia-Chih and Lee,Jong Taek and Mukherjee,Saurajit and Aggarwal, JK and Lee,Hyungtae and Davis, Larry S. and Swears,Eran and Wang,Xiaoyang and Ji,Qiang and Reddy,Kishore and Shah,Mubarak and Vondrick,Carl and Pirsiavash,Hamed and Ramanan,Deva and Yuen,Jenny and Torralba,Antonio and Song,Bi and Fong,Anesco and Roy-Chowdhury,Amit and Desai,Mita} } @conference {12398, title = {Believe Me{\textemdash}We Can Do This! Annotating Persuasive Acts in Blog Text}, booktitle = {Workshops at the Twenty-Fifth AAAI Conference on Artificial Intelligence}, year = {2011}, month = {2011///}, author = {Anand,P. and King,J. and Jordan Boyd-Graber and Wagner,E. and Martell,C. and Oard, Douglas and Resnik, Philip} } @conference {13067, title = {Birdlets: Subordinate categorization using volumetric primitives and pose-normalized appearance}, booktitle = {Computer Vision (ICCV), 2011 IEEE International Conference on}, year = {2011}, month = {2011/11//}, pages = {161 - 168}, abstract = {Subordinate-level categorization typically rests on establishing salient distinctions between part-level characteristics of objects, in contrast to basic-level categorization, where the presence or absence of parts is determinative. We develop an approach for subordinate categorization in vision, focusing on an avian domain due to the fine-grained structure of the category taxonomy for this domain. We explore a pose-normalized appearance model based on a volumetric poselet scheme. The variation in shape and appearance properties of these parts across a taxonomy provides the cues needed for subordinate categorization. Training pose detectors requires a relatively large amount of training data per category when done from scratch; using a subordinate-level approach, we exploit a pose classifier trained at the basic-level, and extract part appearance and shape information to build subordinate-level models. Our model associates the underlying image pattern parameters used for detection with corresponding volumetric part location, scale and orientation parameters. These parameters implicitly define a mapping from the image pixels into a pose-normalized appearance space, removing view and pose dependencies, facilitating fine-grained categorization from relatively few training examples.}, keywords = {appearance, Birdlets;category, categorization;subordinate-level, detection;pose, detectors;pose-normalized, distinctions;shape, estimation;, extraction;pose, extraction;subordinate-level, information, model;salient, models;volumetric, pixels;part, poselet, primitives;computer, resolution;information, retrieval;object, scheme;volumetric, taxonomy;computer, vision;image}, doi = {10.1109/ICCV.2011.6126238}, author = {Farrell,R. and Oza,O. and Zhang,Ning and Morariu,V.I. and Darrell,T. and Davis, Larry S.} } @inbook {19640, title = {On the Black-Box Complexity of Optimally-Fair Coin Tossing}, booktitle = {Theory of Cryptography}, series = {Lecture Notes in Computer Science}, year = {2011}, month = {2011/01/01/}, pages = {450 - 467}, publisher = {Springer Berlin Heidelberg}, organization = {Springer Berlin Heidelberg}, abstract = {A fair two-party coin tossing protocol is one in which both parties output the same bit that is almost uniformly distributed (i.e., it equals 0 and 1 with probability that is at most negligibly far from one half). It is well known that it is impossible to achieve fair coin tossing even in the presence of fail-stop adversaries (Cleve, FOCS 1986). In fact, Cleve showed that for every coin tossing protocol running for r rounds, an efficient fail-stop adversary can bias the output by Ω(1/r). Since this is the best possible, a protocol that limits the bias of any adversary to O(1/r) is called optimally-fair. The only optimally-fair protocol that is known to exist relies on the existence of oblivious transfer, because it uses general secure computation (Moran, Naor and Segev, TCC 2009). However, it is possible to achieve a bias of O(1/r√)O(1/\sqrt{r}) in r rounds relying only on the assumption that there exist one-way functions. In this paper we show that it is impossible to achieve optimally-fair coin tossing via a black-box construction from one-way functions for r that is less than O(n/logn), where n is the input/output length of the one-way function used. An important corollary of this is that it is impossible to construct an optimally-fair coin tossing protocol via a black-box construction from one-way functions whose round complexity is independent of the security parameter n determining the security of the one-way function being used. Informally speaking, the main ingredient of our proof is to eliminate the random-oracle from {\textquotedblleft}secure{\textquotedblright} protocols with {\textquotedblleft}low round-complexity{\textquotedblright} and simulate the protocol securely against semi-honest adversaries in the plain model. We believe our simulation lemma to be of broader interest.}, keywords = {Algorithm Analysis and Problem Complexity, black-box separations, Coding and Information Theory, coin tossing, Computer Communication Networks, Data Encryption, lower-bound, Math Applications in Computer Science, optimally-fair coin tossing, round-complexity, Systems and Data Security}, isbn = {978-3-642-19570-9, 978-3-642-19571-6}, url = {http://link.springer.com/chapter/10.1007/978-3-642-19571-6_27}, author = {Dana Dachman-Soled and Lindell, Yehuda and Mahmoody, Mohammad and Malkin, Tal}, editor = {Ishai, Yuval} } @article {12984, title = {Can Deliberately Incomplete Gene Sample Augmentation Improve a Phylogeny Estimate for the Advanced Moths and Butterflies (Hexapoda: Lepidoptera)?}, journal = {Systematic BiologySyst Biol}, volume = {60}, year = {2011}, month = {2011/12/01/}, pages = {782 - 796}, abstract = {This paper addresses the question of whether one can economically improve the robustness of a molecular phylogeny estimate by increasing gene sampling in only a subset of taxa, without having the analysis invalidated by artifacts arising from large blocks of missing data. Our case study stems from an ongoing effort to resolve poorly understood deeper relationships in the large clade Ditrysia ( > 150,000 species) of the insect order Lepidoptera (butterflies and moths). Seeking to remedy the overall weak support for deeper divergences in an initial study based on five nuclear genes (6.6 kb) in 123 exemplars, we nearly tripled the total gene sample (to 26 genes, 18.4 kb) but only in a third (41) of the taxa. The resulting partially augmented data matrix (45\% intentionally missing data) consistently increased bootstrap support for groupings previously identified in the five-gene (nearly) complete matrix, while introducing no contradictory groupings of the kind that missing data have been predicted to produce. Our results add to growing evidence that data sets differing substantially in gene and taxon sampling can often be safely and profitably combined. The strongest overall support for nodes above the family level came from including all nucleotide changes, while partitioning sites into sets undergoing mostly nonsynonymous versus mostly synonymous change. In contrast, support for the deepest node for which any persuasive molecular evidence has yet emerged (78{\textendash}85\% bootstrap) was weak or nonexistent unless synonymous change was entirely excluded, a result plausibly attributed to compositional heterogeneity. This node (Gelechioidea + Apoditrysia), tentatively proposed by previous authors on the basis of four morphological synapomorphies, is the first major subset of ditrysian superfamilies to receive strong statistical support in any phylogenetic study. A {\textquotedblleft}more-genes-only{\textquotedblright} data set (41 taxa{\texttimes}26 genes) also gave strong signal for a second deep grouping (Macrolepidoptera) that was obscured, but not strongly contradicted, in more taxon-rich analyses.}, keywords = {Ditrysia, gene sampling, Hexapoda, Lepidoptera, missing data, molecular phylogenetics, nuclear genes, taxon sampling}, isbn = {1063-5157, 1076-836X}, doi = {10.1093/sysbio/syr079}, url = {http://sysbio.oxfordjournals.org/content/60/6/782}, author = {Cho,Soowon and Zwick,Andreas and Regier,Jerome C and Mitter,Charles and Cummings, Michael P. and Yao,Jianxiu and Du,Zaile and Zhao,Hong and Kawahara,Akito Y and Weller,Susan and Davis,Donald R and Baixeras,Joaquin and Brown,John W and Parr,Cynthia} } @article {17571, title = {Capacity of wireless networks under SINR interference constraints}, journal = {Wireless Networks}, volume = {17}, year = {2011}, month = {2011///}, pages = {1605 - 1624}, abstract = {A fundamental problem in wireless networks is to estimate their throughput capacity{\textemdash}given a set of wireless nodes and a set of connections, what is the maximum rate at which data can be sent on these connections. Most of the research in this direction has focused either on random distributions of points, or has assumed simple graph-based models for wireless interference. In this paper, we study the capacity estimation problem using a realistic Signal to Interference Plus Noise Ratio (SINR) model for interference, on arbitrary wireless networks without any assumptions on node distributions. The problem becomes much more challenging for this setting, because of the non-locality of the SINR model. Recent work by Moscibroda et al. (IEEE INFOCOM 2006, ACM MobiHoc 2006) has shown that the throughput achieved by using SINR models can differ significantly from that obtained by using graph-based models. In this work, we develop polynomial time algorithms to provably approximate the throughput capacity of wireless network under the SINR model.}, isbn = {1022-0038}, url = {http://dx.doi.org/10.1007/s11276-011-0367-2}, author = {Chafekar,Deepti and Anil Kumar,V. and Marathe,Madhav and Parthasarathy,Srinivasan and Srinivasan, Aravind} } @article {13280, title = {Computing morse decompositions for triangulated terrains: an analysis and an experimental evaluation}, journal = {Image Analysis and Processing{\textendash}ICIAP 2011}, year = {2011}, month = {2011///}, pages = {565 - 574}, abstract = {We consider the problem of extracting the morphology of a terrain discretized as a triangle mesh. We discuss first how to transpose Morse theory to the discrete case in order to describe the morphology of triangulated terrains. We review algorithms for computing Morse decompositions, that we have adapted and implemented for triangulated terrains. We compare the the Morse decompositions produced by them, by considering two different metrics.}, doi = {10.1007/978-3-642-24085-0_58}, author = {Vitali,M. and De Floriani, Leila and Magillo,P.} } @article {15085, title = {Constant-Round Private Function Evaluation with Linear Complexity}, journal = {Advances in Cryptology{\textendash}ASIACRYPT 2011}, year = {2011}, month = {2011///}, pages = {556 - 571}, abstract = {We consider the problem of private function evaluation (PFE) in the two-party setting. Here, informally, one party holds an input x while the other holds a (circuit describing a) function f; the goal is for one (or both) of the parties to learn f(x) while revealing nothing more to either party. In contrast to the usual setting of secure computation, where the function being computed is known to both parties, PFE is useful in settings where the function (i.e., algorithm) itself must remain secret, e.g., because it is proprietary or classified.It is known that PFE can be reduced to standard secure computation by having the parties evaluate a universal circuit, and this is the approach taken in most prior work. Using a universal circuit, however, introduces additional overhead and results in a more complex implementation. We show here a completely new technique for PFE that avoids universal circuits, and results in constant-round protocols with communication/computational complexity linear in the size of the circuit computing f. This gives the first constant-round protocol for PFE with linear complexity (without using fully homomorphic encryption), even restricted to semi-honest adversaries. }, doi = {10.1007/978-3-642-25385-0_30}, author = {Katz, Jonathan and Malka,L.} } @conference {13531, title = {Correcting Errors in Digital Lexicographic Resources Using a Dictionary Manipulation Language}, booktitle = {Electronic lexicography in the 21st century: new applications for new users (eLEX2011)}, year = {2011}, month = {2011///}, pages = {297 - 301}, abstract = {We describe a paradigm for combining manual and automatic error correction of noisy structured lexicographic data. Modifications to the structure and underlying text of the lexicographic data are expressed in a simple, interpreted programming language. Dictionary Manipulation Language (DML) commands identify nodes by unique identifiers, and manipulations are performed using simple commands such as create, move, set text, etc. Corrected lexicons are produced by applying sequences of DML commands to the source version of the lexicon. DML commands can be written manually to repair one-off errors or generated automatically to correct recurring problems. We discuss advantages of the paradigm for the task of editing digital bilingual dictionaries.}, author = {Zajic, David and Maxwell,Michael and David Doermann and Rodrigues,Paul and Bloodgood,Michael} } @conference {13532, title = {Cross Language Entity Linking}, booktitle = {IJCNLP: International Joint Conference on Natural Language Processing}, year = {2011}, month = {2011///}, abstract = {There has been substantial recent interest in aligning mentions of named entities in unstructured texts to knowledge base descriptors, a task commonly called entity linking. This technology is crucial for applications in knowledge discovery and text data mining. This paper presents experiments in the new problem of cross language entity linking, where documents and named entities are in a different language than that used for the content of the reference knowledge base. We have created a new test collection to evaluate cross-language entity linking performance in twenty-one languages. We present experiments that examine issues such as: the importance of transliteration; the utility of cross-language information retrieval; and, the potential benefit of multilingual named entity recognition. Our best model achieves performance which is 94\% of a strong monolingual baseline.}, author = {McNamee,Paul and Mayfield,James and Lawrie,Dawn and Oard, Douglas and David Doermann} } @conference {13533, title = {Cross-Language Entity Linking in Maryland during a Hurricane}, booktitle = {TAC}, year = {2011}, month = {2011///}, abstract = {Our team from the JHUHLTCOE and the University of Maryland submitted runs for all three variants of the TACKBP entity linking task. For the monolingual tasks, we essentially mirrored our HLTCOETAC-KBP 2010 submission, making only modest changes to accommodate differences in 2011, namely the requirement to cluster NIL responses, and the change in evaluation measure. However, our work on the cross-lingual task was significantly more involved, requiring development of robust, multiphased transliteration software, use of techniques in cross-language information retrieval, and reliance on a Chinese-to- English statistical machine translation system. In this paper we describe our work for the 2011 evaluation and the results we obtained.}, author = {McNamee,Paul and Mayfield,James and Oard, Douglas and David Doermann and Xu,Tan and Wu,Ke} } @conference {13362, title = {Declarative analysis of noisy information networks}, booktitle = {2011 IEEE 27th International Conference on Data Engineering Workshops (ICDEW)}, year = {2011}, month = {2011/04/11/16}, pages = {106 - 111}, publisher = {IEEE}, organization = {IEEE}, abstract = {There is a growing interest in methods for analyzing data describing networks of all types, including information, biological, physical, and social networks. Typically the data describing these networks is observational, and thus noisy and incomplete; it is often at the wrong level of fidelity and abstraction for meaningful data analysis. This has resulted in a growing body of work on extracting, cleaning, and annotating network data. Unfortunately, much of this work is ad hoc and domain-specific. In this paper, we present the architecture of a data management system that enables efficient, declarative analysis of large-scale information networks. We identify a set of primitives to support the extraction and inference of a network from observational data, and describe a framework that enables a network analyst to easily implement and combine new extraction and analysis techniques, and efficiently apply them to large observation networks. The key insight behind our approach is to decouple, to the extent possible, (a) the operations that require traversing the graph structure (typically the computationally expensive step), from (b) the operations that do the modification and update of the extracted network. We present an analysis language based on Datalog, and show how to use it to cleanly achieve such decoupling. We briefly describe our prototype system that supports these abstractions. We include a preliminary performance evaluation of the system and show that our approach scales well and can efficiently handle a wide spectrum of data cleaning operations on network data.}, keywords = {Cleaning, Data analysis, data cleaning operations, data management system, data mining, Databases, Datalog, declarative analysis, graph structure, information networks, Noise measurement, noisy information networks, Prediction algorithms, semantics, Syntactics}, isbn = {978-1-4244-9195-7}, doi = {10.1109/ICDEW.2011.5767619}, author = {Moustafa,W. E and Namata,G. and Deshpande, Amol and Getoor, Lise} } @article {15470, title = {Developing a Single Model and Test Prioritization Strategies for Event-Driven Software}, journal = {Software Engineering, IEEE Transactions on}, volume = {37}, year = {2011}, month = {2011///}, pages = {48 - 64}, abstract = {Event-Driven Software (EDS) can change state based on incoming events; common examples are GUI and Web applications. These EDSs pose a challenge to testing because there are a large number of possible event sequences that users can invoke through a user interface. While valuable contributions have been made for testing these two subclasses of EDS, such efforts have been disjoint. This work provides the first single model that is generic enough to study GUI and Web applications together. In this paper, we use the model to define generic prioritization criteria that are applicable to both GUI and Web applications. Our ultimate goal is to evolve the model and use it to develop a unified theory of how all EDS should be tested. An empirical study reveals that the GUI and Web-based applications, when recast using the new model, show similar behavior. For example, a criterion that gives priority to all pairs of event interactions did well for GUI and Web applications; another criterion that gives priority to the smallest number of parameter value settings did poorly for both. These results reinforce our belief that these two subclasses of applications should be modeled and studied together.}, keywords = {EDS, event-driven software, graphical user interface, Graphical user interfaces, GUI testing, Internet, program testing, service-oriented architecture, test prioritization strategy, Web application testing}, isbn = {0098-5589}, doi = {10.1109/TSE.2010.12}, author = {Bryce,R.C. and Sampath,S. and Memon, Atif M.} } @article {19656, title = {Direct targeting of Sec23a by miR-200s influences cancer cell secretome and promotes metastatic colonization}, journal = {Nature Medicine}, volume = {17}, year = {2011}, month = {2011/09//}, pages = {1101 - 1108}, abstract = {Although the role of miR-200s in regulating E-cadherin expression and epithelial-to-mesenchymal transition is well established, their influence on metastatic colonization remains controversial. Here we have used clinical and experimental models of breast cancer metastasis to discover a pro-metastatic role of miR-200s that goes beyond their regulation of E-cadherin and epithelial phenotype. Overexpression of miR-200s is associated with increased risk of metastasis in breast cancer and promotes metastatic colonization in mouse models, phenotypes that cannot be recapitulated by E-cadherin expression alone. Genomic and proteomic analyses revealed global shifts in gene expression upon miR-200 overexpression toward that of highly metastatic cells. miR-200s promote metastatic colonization partly through direct targeting of Sec23a, which mediates secretion of metastasis-suppressive proteins, including Igfbp4 and Tinagl1, as validated by functional and clinical correlation studies. Overall, these findings suggest a pleiotropic role of miR-200s in promoting metastatic colonization by influencing E-cadherin{\textendash}dependent epithelial traits and Sec23a-mediated tumor cell secretome.View full text }, isbn = {1078-8956}, url = {http://www.nature.com/nm/journal/v17/n9/abs/nm.2401.html}, author = {Korpal, Manav and Ell, Brian J. and Buffa, Francesca M. and Ibrahim, Toni and Blanco, Mario A. and Celi{\`a}-Terrassa, Toni and Mercatali, Laura and Zia Khan and Goodarzi, Hani and Hua, Yuling and Wei, Yong and Hu, Guohong and Garcia, Benjamin A. and Ragoussis, Jiannis and Amadori, Dino and Harris, Adrian L. and Kang, Yibin} } @inbook {14676, title = {Directed Symbolic Execution}, booktitle = {Static AnalysisStatic Analysis}, series = {Lecture Notes in Computer Science}, volume = {6887}, year = {2011}, month = {2011///}, pages = {95 - 111}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {In this paper, we study the problem of automatically finding program executions that reach a particular target line. This problem arises in many debugging scenarios; for example, a developer may want to confirm that a bug reported by a static analysis tool on a particular line is a true positive. We propose two new directed symbolic execution strategies that aim to solve this problem: shortest-distance symbolic execution (SDSE) uses a distance metric in an interprocedural control flow graph to guide symbolic execution toward a particular target; and call-chain-backward symbolic execution (CCBSE) iteratively runs forward symbolic execution, starting in the function containing the target line, and then jumping backward up the call chain until it finds a feasible path from the start of the program. We also propose a hybrid strategy, Mix-CCBSE, which alternates CCBSE with another (forward) search strategy. We compare these three with several existing strategies from the literature on a suite of six GNU Coreutils programs. We find that SDSE performs extremely well in many cases but may fail badly. CCBSE also performs quite well, but imposes additional overhead that sometimes makes it slower than SDSE. Considering all our benchmarks together, Mix-CCBSE performed best on average, combining to good effect the features of its constituent components.}, isbn = {978-3-642-23701-0}, url = {http://dx.doi.org/10.1007/978-3-642-23702-7_11}, author = {Ma,Kin-Keung and Yit Phang,Khoo and Foster, Jeffrey S. and Hicks, Michael W.}, editor = {Yahav,Eran} } @article {13290, title = {Discrete Curvature Estimators: an Experimental Evaluation}, volume = {DISI-TR-11-12}, year = {2011}, month = {2011///}, institution = {Department of Computer Science and Information Science, University of Genoa}, abstract = {In this paper, we consider a surface, embedded in 3D space, which is discretely approximatedas triangle mesh. We define a method for estimating mean and Gaussian curvatures of such a discrete surface, based on simulating the analytic definition of mean and Gaussian curvatures in the continuum. Such method leads to what we call mean and Gaussian Ccurvatures. We present experiments evaluating such curvatures. }, author = {Mesmoudi,M. M. and De Floriani, Leila and Magillo,P.} } @conference {19441, title = {A Dive into Online Community Properties}, booktitle = {CSCW {\textquoteright}11}, series = {CSCW {\textquoteright}11}, year = {2011}, month = {2011///}, pages = {725 - 728}, publisher = {ACM}, organization = {ACM}, abstract = {As digital communities grow in size their feature sets also grow with them. Different users have different experiences with the same tools and communities. Enterprises and other organizations seeking to leverage these communities need a straightforward way to analyze and compare a variety of salient attributes of these communities. We describe a taxonomy and tool for crowd-sourcing user based evaluations of enterprise relevant attributes of digital communities and present the results of a small scale study on its usefulness and stability across multiple raters.}, keywords = {enterprise, Online communities, Taxonomy, Visualization}, isbn = {978-1-4503-0556-3}, url = {http://doi.acm.org/10.1145/1958824.1958955}, author = {Wagstrom, Patrick and Martino, Jacquelyn and von Kaenel, Juerg and Marshini Chetty and Thomas, John and Jones, Lauretta} } @conference {19024, title = {Do You Know Where Your Data Are? Secure Data Capsules for Deployable Data Protection}, year = {2011}, month = {2011}, url = {http://static.usenix.org/event/hotos11/tech/final_files/ManiatisAkhawe.pdf}, author = {Maniatis, P. and Akhawe, D. and Fall,K. and Elaine Shi and McCamant, S. and Song,D.} } @conference {14679, title = {Dynamic Enforcement of Knowledge-Based Security Policies}, booktitle = {Computer Security Foundations Symposium (CSF), 2011 IEEE 24th}, year = {2011}, month = {2011/06/27/29}, pages = {114 - 128}, publisher = {IEEE}, organization = {IEEE}, abstract = {This paper explores the idea of knowledge-based security policies, which are used to decide whether to answer queries over secret data based on an estimation of the querier{\textquoteright}s (possibly increased) knowledge given the results. Limiting knowledge is the goal of existing information release policies that employ mechanisms such as noising, anonymization, and redaction. Knowledge-based policies are more general: they increase flexibility by not fixing the means to restrict information flow. We enforce a knowledge-based policy by explicitly tracking a model of a querier{\textquoteright}s belief about secret data, represented as a probability distribution, and denying any query that could increase knowledge above a given threshold. We implement query analysis and belief tracking via abstract interpretation using a novel probabilistic polyhedral domain, whose design permits trading off precision with performance while ensuring estimates of a querier{\textquoteright}s knowledge are sound. Experiments with our implementation show that several useful queries can be handled efficiently, and performance scales far better than would more standard implementations of probabilistic computation based on sampling.}, keywords = {abstract interpretation, belief networks, belief tracking, Data models, dynamic enforcement, Facebook, information flow, knowledge based systems, knowledge-based security, knowledge-based security policy, privacy, probabilistic computation, probabilistic logic, probabilistic polyhedral domain, probabilistic polyhedron, probability, query analysis, Security, security of data, semantics, Waste materials}, isbn = {978-1-61284-644-6}, doi = {10.1109/CSF.2011.15}, author = {Mardziel,P. and Magill,S. and Hicks, Michael W. and Srivatsa,M.} } @article {15130, title = {Efficient privacy-preserving biometric identification}, journal = {Network and Distributed System Security Symposium}, year = {2011}, month = {2011///}, abstract = {We present an efficient matching protocol that can be usedin many privacy-preserving biometric identification systems in the semi-honest setting. Our most general technical con- tribution is a new backtracking protocol that uses the by- product of evaluating a garbled circuit to enable efficient oblivious information retrieval. We also present a more ef- ficient protocol for computing the Euclidean distances of vectors, and optimized circuits for finding the closest match between a point held by one party and a set of points held by another. We evaluate our protocols by implementing a practical privacy-preserving fingerprint matching system. }, author = {Huang,Y. and Malka,L. and Evans,D. and Katz, Jonathan} } @article {14485, title = {Eighth workshop on mining and learning with graphs}, journal = {SIGKDD Explor. Newsl.}, volume = {12}, year = {2011}, month = {2011/03//}, pages = {63 - 65}, abstract = {The Eighth Workshop on Mining and Learning with Graphs (MLG)1was held at KDD 2010 in Washington DC. It brought together a variete of researchers interested in analyzing data that is best represented as a graph. Examples include the WWW, social networks, biological networks, communication networks, and many others. The importance of being able to effectively mine and learn from such data is growing, as more and more structured and semi-structured data is becoming available. This is a problem across widely different fields such as economics, statistics, social science, physics and computer science, and is studied within a variety of sub-disciplines of machine learning and data mining including graph mining, graphical models, kernel theory, statistical relational learning, etc. The objective of this workshop was to bring together practitioners from these various fields and areas to foster a rich discussion of which problems we work on, how we frame them in the context of graphs, which tools and algorithms we apply and our general findings and lessons learned. This year{\textquoteright}s workshop was very successful with well over 100 attendees, excellent keynote speakers and papers. This is a rapidly growing area and we believe that this community is only in its infancy. We hope that the readers will join us next year for MLG 2011.}, keywords = {data mining, dynamic network analysis, graph mining, kernel methods, link mining, machine learning, network analysis, pattern recognition, relational learning, scalable graph mining, statistical relational learning}, isbn = {1931-0145}, doi = {10.1145/1964897.1964915}, url = {http://doi.acm.org/10.1145/1964897.1964915}, author = {Brefeld,Ulf and Getoor, Lise and Macskassy,Sofus A.} } @article {15263, title = {Energy efficient monitoring in sensor networks}, journal = {Algorithmica}, volume = {59}, year = {2011}, month = {2011///}, pages = {94 - 114}, abstract = {We study a set of problems related to efficient battery energy utilization for monitoring applications in a wireless sensor network with the goal to increase the sensor network lifetime. We study several generalizations of a basic problem called Set k-Cover. The problem can be described as follows: we are given a set of sensors, and a set of targets to be monitored. Each target can be monitored by a subset of the sensors. To increase the lifetime of the sensor network, we would like to partition the sensors into k sets (or time-slots), and activate each set of sensors in a different time-slot, thus extending the battery life of the sensors by a factor of k. The goal is to find a partitioning that maximizes the total coverage of the targets for a given k. This problem is known to be NP-hard. We develop an improved approximation algorithm for this problem using a reduction to Max k-Cut. Moreover, we are able to demonstrate that this algorithm is efficient, and yields almost optimal solutions in practice.We also consider generalizations of this problem in several different directions. First, we allow each sensor to be active in α different sets (time-slots). This means that the battery life is extended by a factor of k, and allows for a richer space of solutions. We also consider different coverage requirements, such as requiring that all targets, or at least a certain number of targets, be covered in each time slot. In the Set k-Cover formulation, there is no requirement that a target be monitored at all, or in any number of time slots. We develop a randomized rounding algorithm for this problem. We also consider extensions where each sensor can monitor only a bounded number of targets in any time-slot, and not all the targets adjacent to it. This kind of problem may arise when a sensor has a directional camera, or some other physical constraint might prevent it from monitoring all adjacent targets even when it is active. We develop the first approximation algorithms for this problem. }, doi = {10.1007/s00453-010-9407-z}, author = {Deshpande, Amol and Khuller, Samir and Malekian,A. and Toossi,M.} } @conference {14469, title = {Exploiting statistical and relational information on the web and in social media}, booktitle = {Proceedings of the fourth ACM international conference on Web search and data mining}, series = {WSDM {\textquoteright}11}, year = {2011}, month = {2011///}, pages = {9 - 10}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {The popularity of Web 2.0, characterized by a proliferation of social media sites, and Web 3.0, with more richly semantically annotated objects and relationships, brings to light a variety of important prediction, ranking, and extraction tasks. The input to these tasks is often best seen as a (noisy) multi-relational graph, such as the click graph, defined by user interactions with Web sites; and the social graph, defined by friendships and affiliations on social media sites. This tutorial will provide an overview of statistical relational learning and inference techniques, motivating and illustrating them using web and social media applications. We will start by briefly surveying some of the sources of statistical and relational information on the web and in social media and will then dedicate most of the tutorial time to an introduction to representations and techniques for learning and reasoning with multi-relational information, viewing them through the lens of web and social media domains. We will end with a discussion of current trends and related fields, such as privacy in social networks.}, keywords = {graph analysis, probabilistic inference, query log data, social media, statistical relational learning}, isbn = {978-1-4503-0493-1}, doi = {10.1145/1935826.1935834}, url = {http://doi.acm.org/10.1145/1935826.1935834}, author = {Getoor, Lise and Mihalkova,Lilyana} } @inbook {12459, title = {Face Detection}, booktitle = {Visual Analysis of HumansVisual Analysis of Humans}, year = {2011}, month = {2011///}, pages = {71 - 90}, publisher = {Springer London}, organization = {Springer London}, abstract = {Face detection in still images and videos has been extensively studied over the last two decades. Attributed to the recent proliferation of cameras in consumer applications, research in face detection has gradually transformed into more unconstrained settings, with the goal of achieving performance close to humans. This presents two main challenges: (i) in addition to modeling the facial characteristics, understanding the information portrayed by the surrounding scene is important in resolving visual ambiguities, and (ii) the computational time needed for decision making should be compatible for real-time applications, since detection is primarily a front-end process on which additional knowledge extraction is built upon. This chapter begins with a review of recent work in modeling face-specific information, including appearance-based methods used by sliding window classifiers, concepts from learning and local interest-point descriptors, and then focuses on representing the contextual information shared by faces with the surrounding scene. To provide better understanding of working concepts, we discuss a method for learning the semantic context shared by the face with other human body parts that facilitates reasoning under occlusion, and then present an image representation which efficiently encodes contour information to enable fast detection of faces. We conclude the chapter by discussing some existing challenges.}, isbn = {978-0-85729-997-0}, url = {http://dx.doi.org/10.1007/978-0-85729-997-0_5}, author = {Gopalan,Raghuraman and Schwartz,William R. and Chellapa, Rama and Srivastava,Ankur}, editor = {Moeslund,Thomas B. and Hilton,Adrian and Kr{\"u}ger,Volker and Sigal,Leonid} } @article {19580, title = {A family of abstract interpretations for static analysis of concurrent higher-order programs}, journal = {arXiv:1103.5167 [cs]}, year = {2011}, note = {Comment: The 18th International Static Analysis Symposium (SAS 2011)}, month = {2011/03/26/}, abstract = {We develop a framework for computing two foundational analyses for concurrent higher-order programs: (control-)flow analysis (CFA) and may-happen-in-parallel analysis (MHP). We pay special attention to the unique challenges posed by the unrestricted mixture of first-class continuations and dynamically spawned threads. To set the stage, we formulate a concrete model of concurrent higher-order programs: the P(CEK*)S machine. We find that the systematic abstract interpretation of this machine is capable of computing both flow and MHP analyses. Yet, a closer examination finds that the precision for MHP is poor. As a remedy, we adapt a shape analytic technique-singleton abstraction-to dynamically spawned threads (as opposed to objects in the heap). We then show that if MHP analysis is not of interest, we can substantially accelerate the computation of flow analysis alone by collapsing thread interleavings with a second layer of abstraction.}, keywords = {Computer Science - Programming Languages}, url = {http://arxiv.org/abs/1103.5167}, author = {Might, Matthew and David Van Horn} } @article {15184, title = {Faster secure two-party computation using garbled circuits}, journal = {USENIX Security Symposium}, year = {2011}, month = {2011///}, abstract = {Secure two-party computation enables two parties toevaluate a function cooperatively without revealing to ei- ther party anything beyond the function{\textquoteright}s output. The garbled-circuit technique, a generic approach to secure two-party computation for semi-honest participants, was developed by Yao in the 1980s, but has been viewed as being of limited practical significance due to its in- efficiency. We demonstrate several techniques for im- proving the running time and memory requirements of the garbled-circuit technique, resulting in an implemen- tation of generic secure two-party computation that is significantly faster than any previously reported while also scaling to arbitrarily large circuits. We validate our approach by demonstrating secure computation of cir- cuits with over 109 gates at a rate of roughly 10 {\textmu}s per garbled gate, and showing order-of-magnitude improve- ments over the best previous privacy-preserving proto- cols for computing Hamming distance, Levenshtein dis- tance, Smith-Waterman genome alignment, and AES. }, author = {Huang,Y. and Evans,D. and Katz, Jonathan and Malka,L.} } @conference {17181, title = {Group-in-a-Box Layout for Multi-faceted Analysis of Communities}, booktitle = {Privacy, Security, Risk and Trust (PASSAT), 2011 IEEE Third International Conference on and 2011 IEEE Third International Confernece on Social Computing (SocialCom)}, year = {2011}, month = {2011/10/09/11}, pages = {354 - 361}, publisher = {IEEE}, organization = {IEEE}, abstract = {Communities in social networks emerge from interactions among individuals and can be analyzed through a combination of clustering and graph layout algorithms. These approaches result in 2D or 3D visualizations of clustered graphs, with groups of vertices representing individuals that form a community. However, in many instances the vertices have attributes that divide individuals into distinct categories such as gender, profession, geographic location, and similar. It is often important to investigate what categories of individuals comprise each community and vice-versa, how the community structures associate the individuals from the same category. Currently, there are no effective methods for analyzing both the community structure and the category-based partitions of social graphs. We propose Group-In-a-Box (GIB), a meta-layout for clustered graphs that enables multi-faceted analysis of networks. It uses the tree map space filling technique to display each graph cluster or category group within its own box, sized according to the number of vertices therein. GIB optimizes visualization of the network sub-graphs, providing a semantic substrate for category-based and cluster-based partitions of social graphs. We illustrate the application of GIB to multi-faceted analysis of real social networks and discuss desirable properties of GIB using synthetic datasets.}, keywords = {Algorithm design and analysis, category based social graph partitions, clustered graphs, clustering, Clustering algorithms, Communities, data visualisation, force-directed, gender, geographic location, graph layout algorithms, graph theory, group-in-a-box, group-in-a-box layout, Image edge detection, Layout, meta-layout, multifaceted community analysis, network subgraph visualization, network visualization, pattern clustering, profession, semantic substrates, Social network services, social networking (online), social networks, treemap space filling technique, Visualization}, isbn = {978-1-4577-1931-8}, doi = {10.1109/PASSAT/SocialCom.2011.139}, author = {Rodrigues,E.M. and Milic-Frayling,N. and Smith,M. and Shneiderman, Ben and Hansen,D.} } @article {15477, title = {GUI Interaction Testing: Incorporating Event Context}, journal = {Software Engineering, IEEE Transactions on}, volume = {37}, year = {2011}, month = {2011/08//july}, pages = {559 - 574}, abstract = {Graphical user interfaces (GUIs), due to their event-driven nature, present an enormous and potentially unbounded way for users to interact with software. During testing, it is important to $\#$x201C;adequately cover $\#$x201D; this interaction space. In this paper, we develop a new family of coverage criteria for GUI testing grounded in combinatorial interaction testing. The key motivation of using combinatorial techniques is that they enable us to incorporate $\#$x201C;context $\#$x201D; into the criteria in terms of event combinations, sequence length, and by including all possible positions for each event. Our new criteria range in both efficiency (measured by the size of the test suite) and effectiveness (the ability of the test suites to detect faults). In a case study on eight applications, we automatically generate test cases and systematically explore the impact of context, as captured by our new criteria. Our study shows that by increasing the event combinations tested and by controlling the relative positions of events defined by the new criteria, we can detect a large number of faults that were undetectable by earlier techniques.}, keywords = {automatic test case generation, automatic test pattern generation, combinatorial interaction testing, event driven nature, graphical user interface, Graphical user interfaces, GUI interaction testing, program testing}, isbn = {0098-5589}, doi = {10.1109/TSE.2010.50}, author = {Xun Yuan and Cohen,M. B and Memon, Atif M.} } @article {15505, title = {Homage to Michael Gelfond on His 65 th Birthday}, journal = {Logic programming, knowledge representation, and nonmonotonic reasoning}, year = {2011}, month = {2011///}, pages = {1 - 11}, abstract = {Michael Gelfond is one of the world leading scientists in the field of logic programming and nonmonotonic reasoning. This essay covers several aspects of Michael{\textquoteright}s personal life, starting from his birth in the USSR, through his experiences in the USSR up to the time he emigrated to the United States (U.S.). This is followed by his first experiences in the U.S.: how he became involved in logic programming and nonmonotonic reasoning and some of his major scientific achievements. Michael is a warm, generous person, and I discuss his impact on some colleagues and students. In the concluding section, I observe that starting his career with impediments in the FSU, he overcame them to become one of the top computer scientists in logic programming and nonmonotonic reasoning.}, doi = {10.1007/978-3-642-20832-4_1}, author = {Minker, Jack} } @article {14868, title = {Illumination Recovery From Image With Cast Shadows Via Sparse Representation}, journal = {Image Processing, IEEE Transactions on}, volume = {20}, year = {2011}, month = {2011/08//}, pages = {2366 - 2377}, abstract = {In this paper, we propose using sparse representation for recovering the illumination of a scene from a single image with cast shadows, given the geometry of the scene. The images with cast shadows can be quite complex and, therefore, cannot be well approximated by low-dimensional linear subspaces. However, it can be shown that the set of images produced by a Lambertian scene with cast shadows can be efficiently represented by a sparse set of images generated by directional light sources. We first model an image with cast shadows composed of a diffusive part (without cast shadows) and a residual part that captures cast shadows. Then, we express the problem in an $\#$x2113;1-regularized least-squares formulation, with nonnegativity constraints (as light has to be non-negative at any point in space). This sparse representation enjoys an effective and fast solution thanks to recent advances in compressive sensing. In experiments on synthetic and real data, our approach performs favorably in comparison with several previously proposed methods.}, keywords = {$\#$x2113;1-regularized, approximations;, coding;image, compression;image, constraints;sparse, formulation;Lambertian, illumination, image, least-square, light, linear, reconstruction;image, recovery;low-dimensional, representation;data, representation;least, scene;cast, sensing;directional, shadows;compressive, sources;image, squares, subspaces;nonnegativity}, isbn = {1057-7149}, doi = {10.1109/TIP.2011.2118222}, author = {Mei,Xue and Ling,Haibin and Jacobs, David W.} } @inbook {12456, title = {Image and Video-Based Biometrics}, booktitle = {Visual Analysis of HumansVisual Analysis of Humans}, year = {2011}, month = {2011///}, pages = {437 - 454}, publisher = {Springer London}, organization = {Springer London}, abstract = {Biometrics deals with the problem of identifying individuals based on physiological or behavioral characteristics. Since many physical characteristics, such as face, iris, etc., and behavioral characteristics, such as voice, expression, etc., are unique to an individual, biometric analysis offers a reliable and natural solution to the problem of identity verification. In this chapter, we discuss image and video-based biometrics involving face, iris and gait. In particular, we discuss several recent approaches to physiological biometrics based on Sparse Representations and Compressed Sensing. Some of the most compelling challenges and issues that confront research in biometrics are also addressed.}, isbn = {978-0-85729-997-0}, url = {http://dx.doi.org/10.1007/978-0-85729-997-0_22}, author = {Patel, Vishal M. and Pillai,Jaishanker K. and Chellapa, Rama}, editor = {Moeslund,Thomas B. and Hilton,Adrian and Kr{\"u}ger,Volker and Sigal,Leonid} } @inbook {19034, title = {Implicit Authentication through Learning User Behavior}, booktitle = {Information Security}, series = {Lecture Notes in Computer Science}, volume = {6531}, year = {2011}, month = {2011}, pages = {99 - 113}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {Users are increasingly dependent on mobile devices. However, current authentication methods like password entry are significantly more frustrating and difficult to perform on these devices, leading users to create and reuse shorter passwords and pins, or no authentication at all. We present implicit authentication - authenticating users based on behavior patterns. We describe our model for performing implicit authentication and assess our techniques using more than two weeks of collected data from over 50 subjects.}, keywords = {Computer science}, isbn = {978-3-642-18177-1}, url = {http://www.springerlink.com/content/m57u551u3133475m/abstract/}, author = {Elaine Shi and Niu, Yuan and Jakobsson, Markus and Chow, Richard}, editor = {Burmester, Mike and Tsudik, Gene and Magliveras, Spyros and Ilic, Ivana} } @article {14353, title = {Improving Classifier Performance by Autonomously Collecting Background Knowledge from the Web}, journal = {2011 10th International Conference on Machine Learning and Applications Workshops}, year = {2011}, month = {2011///}, pages = {1 - 6}, abstract = {Many websites allow users to tag data items to makethem easier to find. In this paper we consider the problem of classifying tagged data according to user-specified interests. We present an approach for aggregating background knowledge from the Web to improve the performance of a classier. In previous work, researchers have developed technology for extracting knowledge, in the form of relational tables, from semi- structured websites. In this paper we integrate this extraction technology with generic machine learning algorithms, showing that knowledge extracted from the Web can significantly benefit the learning process. Specifically, the knowledge can lead to better generalizations, reduce the number of samples required for supervised learning, and eliminate the need to retrain the system when the environment changes. We validate the approach with an application that classifies tagged Fickr data. }, author = {Minton,S.N. and Michelson,M. and See,K. and Macskassy,S. and Gazen,B.C. and Getoor, Lise} } @article {13003, title = {Increased gene sampling provides stronger support for higher-level groups within gracillariid leaf mining moths and relatives (Lepidoptera: Gracillariidae)}, journal = {BMC Evol Biol}, volume = {11:182}, year = {2011}, month = {2011///}, author = {Kawahara,A. Y and Ohshima,I and Kawakita,A and Regier,J. C and Mitter,C and Cummings, Michael P. and Davis,DR and Wagner,DL and De Prinis,J and Lopez-Vaamonde,C} } @article {13004, title = {Increased gene sampling yields robust support for higher-level clades within Bombycoidea (Lepidoptera)}, journal = {Systematic Entomology}, volume = {36}, year = {2011}, month = {2011/01/01/}, pages = {31 - 43}, abstract = {This study has as its primary aim the robust resolution of higher-level relationships within the lepidopteran superfamily Bombycoidea. Our study builds on an earlier analysis of five genes (\~{}6.6 kbp) sequenced for 50 taxa from Bombycoidea and its sister group Lasiocampidae, plus representatives of other macrolepidoteran superfamilies. The earlier study failed to yield strong support for the monophyly of and basal splits within Bombycoidea, among others. Therefore, in an effort to increase support specifically for higher-level nodes, we generated 11.7 kbp of additional data from 20 genes for 24 of 50 bombycoid and lasiocampid taxa. The data from the genes are all derived from protein-coding nuclear genes previously used to resolve other lepidopteran relationships. With these additional data, all but a few higher-level nodes are strongly supported. Given our decision to minimize project costs by augmenting genes for only 24 of the 50 taxa, we explored whether the resulting pattern of missing data in the combined-gene matrix introduced a nonphylogenetic bias, a possibility reported by others. This was achieved by comparing node support values (i.e. nonparametric bootstrap values) based on likelihood and parsimony analyses of three datasets that differ in their number of taxa and level of missing data: 50 taxa/5 genes (dataset A), 50 taxa/25 genes (dataset B) and 24 taxa/25 genes (dataset C). Whereas datasets B and C provided similar results for common nodes, both frequently yielded higher node support relative to dataset A, arguing that: (i) more data yield increased node support and (ii) partial gene augmentation does not introduce an obvious nonphylogenetic bias. A comparison of single-gene bootstrap analyses identified four nodes for which one or two of the 25 genes provided modest to strong support for a grouping not recovered by the combined-gene result. As a summary proposal, two of these four groupings (one each within Bombycoidea and Lasiocampidae) were deemed sufficiently problematic to regard them as unresolved trichotomies. Since the alternative groupings were always highly localized on the tree, we did not judge a combined-gene analysis to present a problem outside those regions. Based on our robustly resolved results, we have revised the classification of Bombycoidea: the family Bombycidae is restricted to its nominate subfamily, and its tribe Epiini is elevated to subfamily rank (Epiinae stat.rev.), whereas the bombycid subfamily Phiditiinae is reinstated as a separate family (Phiditiidae stat.rev.). The bombycid subfamilies Oberthueriinae Kuznetzov \& Stekolnikov, 1985, syn.nov. and Prismostictinae Forbes, 1955, syn.nov., and the family Mirinidae Kozlov, 1985, syn.nov. are established as subjective junior synonyms of Endromidae Boisduval, 1828. The family Anthelidae (Lasiocampoidea) is reincluded in the superfamily Bombycoidea.}, isbn = {1365-3113}, doi = {10.1111/j.1365-3113.2010.00543.x}, url = {http://onlinelibrary.wiley.com/doi/10.1111/j.1365-3113.2010.00543.x/abstract;jsessionid=B5B1F8BF73034A4C41427FB1FBD7383F.d02t04}, author = {Zwick,Andreas and Regier,Jerome C and Mitter,Charles and Cummings, Michael P.} } @article {13274, title = {An iterative algorithm for homology computation on simplicial shapes}, journal = {Computer-Aided Design}, volume = {43}, year = {2011}, month = {2011/11//}, pages = {1457 - 1467}, abstract = {We propose a new iterative algorithm for computing the homology of arbitrary shapes discretized through simplicial complexes. We demonstrate how the simplicial homology of a shape can be effectively expressed in terms of the homology of its sub-components. The proposed algorithm retrieves the complete homological information of an input shape including the Betti numbers, the torsion coefficients and the representative homology generators.To the best of our knowledge, this is the first algorithm based on the constructive Mayer{\textendash}Vietoris sequence, which relates the homology of a topological space to the homologies of its sub-spaces, i.e. the sub-components of the input shape and their intersections. We demonstrate the validity of our approach through a specific shape decomposition, based only on topological properties, which minimizes the size of the intersections between the sub-components and increases the efficiency of the algorithm. }, keywords = {Computational topology, Generators, Mayer{\textendash}Vietoris sequence, shape decomposition, simplicial complexes, Z -homology}, isbn = {0010-4485}, doi = {10.1016/j.cad.2011.08.015}, url = {http://www.sciencedirect.com/science/article/pii/S0010448511002144}, author = {Boltcheva,Dobrina and Canino,David and Merino Aceituno,Sara and L{\'e}on,Jean-Claude and De Floriani, Leila and H{\'e}troy,Franck} } @article {12865, title = {Vibrio Cholerae O1 Detection in Estuarine and Coastal Zooplankton}, journal = {Journal of Plankton Research}, volume = {33}, year = {2011}, month = {01/2011}, pages = {51 - 62}, abstract = {Vibrio cholerae is an autochthonous marine bacterium, and its association with diverse planktonic crustaceans has been extensively investigated; however, the presence of V. cholerae on individuals of most phyla of planktonic animals is still incompletely understood. The objective of this study was to analyze the distribution of V. cholerae serogroup O1 associated with specific zooplankton taxa in an estuary and the adjacent continental shelf of the southeastern Brazilian coast. The occurrence of the bacterium was assessed in zooplankton samples, specifically on the most abundant taxa, using direct fluorescence assay (DFA) and direct viable count{\textendash}direct fluorescence assay (DVC{\textendash}DFA) methods. Vibrio cholerae O1 was detected in 88\% of samples collected from the Santos-Bertioga estuary and in 67\% of samples from the shelf. The salinity of the estuarine water ranged from 21.8 to 34.6, significantly lower than the shelf water which was 32.1{\textendash}36.1. Salinity was the only environmental variable measured that displayed a significant correlation with the presence of V. cholerae (P< 0.05). Vibrio cholerae O1 was detected in chaetognaths, pluteus larvae of echinoderms and planktonic fish eggs (Engraulidae), all new sites for this bacterium.}, keywords = {DFA, estuary, plankton, Southwest Atlantic}, isbn = {0142-7873, 1464-3774}, doi = {10.1093/plankt/fbq093}, url = {http://plankt.oxfordjournals.org/content/33/1/51}, author = {Martinelli Filho,Jos{\'e} E. and Lopes,Rubens M. and Rivera,Irma N. G. and Rita R Colwell} } @conference {13074, title = {A large-scale benchmark dataset for event recognition in surveillance video}, booktitle = {Computer Vision and Pattern Recognition (CVPR), 2011 IEEE Conference on}, year = {2011}, month = {2011/06//}, pages = {3153 - 3160}, abstract = {We introduce a new large-scale video dataset designed to assess the performance of diverse visual event recognition algorithms with a focus on continuous visual event recognition (CVER) in outdoor areas with wide coverage. Previous datasets for action recognition are unrealistic for real-world surveillance because they consist of short clips showing one action by one individual [15, 8]. Datasets have been developed for movies [11] and sports [12], but, these actions and scene conditions do not apply effectively to surveillance videos. Our dataset consists of many outdoor scenes with actions occurring naturally by non-actors in continuously captured videos of the real world. The dataset includes large numbers of instances for 23 event types distributed throughout 29 hours of video. This data is accompanied by detailed annotations which include both moving object tracks and event examples, which will provide solid basis for large-scale evaluation. Additionally, we propose different types of evaluation modes for visual recognition tasks and evaluation metrics along with our preliminary experimental results. We believe that this dataset will stimulate diverse aspects of computer vision research and help us to advance the CVER tasks in the years ahead.}, keywords = {algorithm;evaluation, CVER, databases;, databases;video, dataset;moving, event, metrics;large-scale, object, recognition, recognition;diverse, recognition;video, scenes;surveillance, surveillance;visual, tasks;computer, tracks;outdoor, video, video;computer, vision;continuous, vision;image, visual}, doi = {10.1109/CVPR.2011.5995586}, author = {Oh,Sangmin and Hoogs, A. and Perera,A. and Cuntoor, N. and Chen,Chia-Chih and Lee,Jong Taek and Mukherjee,S. and Aggarwal, JK and Lee,Hyungtae and Davis, Larry S. and Swears,E. and Wang,Xioyang and Ji,Qiang and Reddy,K. and Shah,M. and Vondrick,C. and Pirsiavash,H. and Ramanan,D. and Yuen,J. and Torralba,A. and Song,Bi and Fong,A. and Roy-Chowdhury, A. and Desai,M.} } @conference {14457, title = {Learning statistical models from relational data}, booktitle = {Proceedings of the 2011 international conference on Management of data}, series = {SIGMOD {\textquoteright}11}, year = {2011}, month = {2011///}, pages = {1195 - 1198}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Statistical Relational Learning (SRL) is a subarea of machine learning which combines elements from statistical and probabilistic modeling with languages which support structured data representations. In this survey, we will: 1) provide an introduction to SRL, 2) describe some of the distinguishing characteristics of SRL systems, including relational feature construction and collective classification, 3) describe three SRL systems in detail, 4) discuss applications of SRL techniques to important data management problems such as entity resolution, selectivity estimation, and information integration, and 5) discuss connections between SRL methods and existing database research such as probabilistic databases.}, keywords = {machine learning, probabilistic graphical models, statistical relational learning}, isbn = {978-1-4503-0661-4}, doi = {10.1145/1989323.1989451}, url = {http://doi.acm.org/10.1145/1989323.1989451}, author = {Getoor, Lise and Mihalkova,Lilyana} } @article {14501, title = {Learning to predict web collaborations}, journal = {Workshop on User Modeling for Web Applications (UMWA-11)}, year = {2011}, month = {2011///}, abstract = {Much of the knowledge available on the web today comes asa result of fruitful collaborations among large groups of peo- ple. One of the most striking examples of successful web col- laboration is the online encyclopedia Wikipedia. The web is used as a collaboration platform by highly specialized blog- ging communities and by the scientific community. An im- portant reason for the richness of content generated through web collaborations is that the participants in such collabo- rations are not constrained by geographic location. Thus, like-minded individuals from across the world can join their efforts. This also means, however, that web collaborators of- ten do not know each other, and, thus, finding collaborators on the web is more difficult than it is with more traditional forms of collaboration that are initiated based on acquain- tance. This difficulty is further exacerbated by the fact that web collaborations tend to be more dynamic as participants join and abandon communities. We consider the task of rec- ommending project-specific potential collaborators to web users and propose an approach that is based on statistical relational learning. Our proposed model thus has the ad- vantages that it can include complex features composed of multiple properties and relationships of the entities, it can handle the high levels of noise and uncertainty inherent in user actions, and it allows for joint decision-making, which leads to more accurate predictions. To ensure scalability, our model is trained in an online fashion. We demonstrate the effectiveness of our approach on a data set collected from Wikipedia. }, author = {Mihalkova,L. and Moustafa,W. and Getoor, Lise} } @inbook {13822, title = {Machine Translation Evaluation and Optimization}, booktitle = {Handbook of Natural Language Processing and Machine TranslationHandbook of Natural Language Processing and Machine Translation}, year = {2011}, month = {2011///}, pages = {745 - 843}, publisher = {Springer New York}, organization = {Springer New York}, abstract = {The evaluation of machine translation (MT) systems is a vital field of research, both for determining the effectiveness of existing MT systems and for optimizing the performance of MT systems. This part describes a range of different evaluation approaches used in the GALE community and introduces evaluation protocols and methodologies used in the program. We discuss the development and use of automatic, human, task-based and semi-automatic (human-in-the-loop) methods of evaluating machine translation, focusing on the use of a human-mediated translation error rate HTER as the evaluation standard used in GALE. We discuss the workflow associated with the use of this measure, including post editing, quality control, and scoring. We document the evaluation tasks, data, protocols, and results of recent GALE MT Evaluations. In addition, we present a range of different approaches for optimizing MT systems on the basis of different measures. We outline the requirements and specific problems when using different optimization approaches and describe how the characteristics of different MT metrics affect the optimization. Finally, we describe novel recent and ongoing work on the development of fully automatic MT evaluation metrics that have the potential to substantially improve the effectiveness of evaluation and optimization of MT systems.}, isbn = {978-1-4419-7713-7}, url = {http://dx.doi.org/10.1007/978-1-4419-7713-7_5}, author = {Dorr, Bonnie J and Olive,Joseph and McCary,John and Christianson,Caitlin}, editor = {Olive,Joseph and Christianson,Caitlin and McCary,John} } @conference {14470, title = {Materializing multi-relational databases from the web using taxonomic queries}, booktitle = {Proceedings of the fourth ACM international conference on Web search and data mining}, series = {WSDM {\textquoteright}11}, year = {2011}, month = {2011///}, pages = {355 - 364}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Recently, much attention has been given to extracting tables from Web data. In this problem, the column definitions and tuples (such as what "company" is headquartered in what "city,") are extracted from Web text, structured Web data such as lists, or results of querying the deep Web, creating the table of interest. In this paper, we examine the problem of extracting and discovering multiple tables in a given domain, generating a truly multi-relational database as output. Beyond discovering the relations that define single tables, our approach discovers and leverages "within column" set membership relations, and discovers relations across the extracted tables (e.g., joins). By leveraging within-column relations our method can extract table instances that are ambiguous or rare, and by discovering joins, our method generates truly multi-relational output. Further, our approach uses taxonomic queries to bootstrap the extraction, rather than the more traditional "seed instances." Creating seeds often requires more domain knowledge than taxonomic queries, and previous work has shown that extraction methods may be sensitive to which input seeds they are given. We test our approach on two real world domains: NBA basketball and cancer information. Our results demonstrate that our approach generates databases of relevant tables from disparate Web information, and discovers the relations between them. Further, we show that by leveraging the "within column" relation our approach can identify a significant number of relevant tuples that would be difficult to do so otherwise.}, keywords = {discovering multi-relational data, multirelational data}, isbn = {978-1-4503-0493-1}, doi = {10.1145/1935826.1935885}, url = {http://doi.acm.org/10.1145/1935826.1935885}, author = {Michelson,Matthew and Macskassy,Sofus A. and Minton,Steven N. and Getoor, Lise} } @article {17622, title = {Maximum bipartite flow in networks with adaptive channel width}, journal = {Theoretical Computer Science}, volume = {412}, year = {2011}, month = {2011/05/27/}, pages = {2577 - 2587}, abstract = {Traditionally, network optimization problems assume that each link in the network has a fixed capacity. Recent research in wireless networking has shown that it is possible to design networks where the capacity of the links can be changed adaptively to suit the needs of specific applications. In particular, one gets a choice of having a few high capacity outgoing links or many low capacity ones at any node of the network. This motivates us to have a re-look at classical network optimization problems and design algorithms to solve them in this new framework. In particular, we consider the problem of maximum bipartite flow, which has been studied extensively in the fixed-capacity network model. One of the motivations for studying this problem arises from the need to maximize the throughput of an infrastructure wireless network comprising base-stations (one set of vertices in the bipartition) and clients (the other set of vertices in the bipartition). We show that this problem has a significantly different combinatorial structure in this new network model from the fixed-capacity one. While there are several polynomial time algorithms for the maximum bipartite flow problem in traditional networks, we show that the problem is NP-hard in the new model. In fact, our proof extends to showing that the problem is APX-hard. We complement our lower bound by giving two algorithms for solving the problem approximately. The first algorithm is deterministic and achieves an approximation factor of O ( log N ) , where N is the number of nodes in the network, while the second algorithm is randomized and achieves an approximation factor of e e - 1 .}, keywords = {Adaptive channel width, graph algorithm, Linear program rounding, Maximum flow, Wireless networks}, isbn = {0304-3975}, doi = {10.1016/j.tcs.2010.10.023}, url = {http://www.sciencedirect.com/science/article/pii/S0304397510005852}, author = {Azar,Yossi and M{\k a}dry,Aleksander and Moscibroda,Thomas and Panigrahi,Debmalya and Srinivasan, Aravind} } @article {16039, title = {Medication Reconciliation: Work Domain Ontology, Prototype Development, and a Predictive Model}, journal = {AMIA Annual Symposium ProceedingsAMIA Annu Symp Proc}, volume = {2011}, year = {2011}, month = {2011///}, pages = {878 - 887}, abstract = {Medication errors can result from administration inaccuracies at any point of care and are a major cause for concern. To develop a successful Medication Reconciliation (MR) tool, we believe it necessary to build a Work Domain Ontology (WDO) for the MR process. A WDO defines the explicit, abstract, implementation-independent description of the task by separating the task from work context, application technology, and cognitive architecture. We developed a prototype based upon the WDO and designed to adhere to standard principles of interface design. The prototype was compared to Legacy Health System{\textquoteright}s and Pre-Admission Medication List Builder MR tools via a Keystroke-Level Model analysis for three MR tasks. The analysis found the prototype requires the fewest mental operations, completes tasks in the fewest steps, and completes tasks in the least amount of time. Accordingly, we believe that developing a MR tool, based upon the WDO and user interface guidelines, improves user efficiency and reduces cognitive load.}, isbn = {1942-597X}, author = {Markowitz,Eliz and Bernstam,Elmer V. and Herskovic,Jorge and Zhang,Jiajie and Shneiderman, Ben and Plaisant, Catherine and Johnson,Todd R.} } @article {12859, title = {Metagenomic 16S rDNA Targeted PCR-DGGE in Determining Bacterial Diversity in Aquatic Ecosystem}, journal = {Bangladesh Journal of Microbiology}, volume = {27}, year = {2011}, month = {2011/12/13/}, abstract = {Bacterial numbers in surface water samples, collected randomly from six different water bodies, were estimated by acridine orange direct counting (AODC) and conventional culture-based heterotrophic plate counting (HPC). Bacterial genomic DNA was prepared from water samples by employing methods used for stool samples, including the population dynamics, were determined by primer extension of the 16S rDNA (V6/V8 region) using polymerase chain reaction (PCR), followed by denaturing gradient gel electrophoresis (DGGE), a metagenomic tool that is capable of separating unrelated DNAs based on the differences in their sequences and GC contents. The bacterial numbers in water samples ranged from 103 {\textendash} 106 CFU/ mL for HPC and 104 {\textendash} 107 cells/ mL for AODC, showing that a great majority of bacteria prevail as uncultivable which do not respond to culture methods that are used widely for tracking bacterial pathogens. The acridine orange-stained bacteria varied in sizes and shapes, and appeared either as planktonic (solitary) cells or as clusters of biofilms, showing the presence of diverse community under the epifluorescence microscope. The DGGE of the ca. 457 bp amplicons, as confirmed by agarose gel electrophoresis, produced bands that ranged in intensities and numbers from 18 to 31, with each band possibly indicating the presence of one or more closely related bacterial species. The enrichment of pathogenic bacteria in the aquatic ecosystem is known to precede the seasonal diarrhoeal outbreaks; therefore, bacterial community dynamics determined by Metagenomic 16S PCR-DGGE during pre-epidemic enrichment appears promising in predicting the upcoming diarrheal outbreaks.}, isbn = {1011-9981}, doi = {10.3329/bjm.v27i2.9171}, url = {http://www.banglajol.info/bd/index.php/BJM/article/view/9171}, author = {Hasan,Nur A. and Chowdhury,W Bari and Rahim,Niaz and Sultana,Marzia and Shabnam,S Antara and Mai,Volker and Ali,Afsar and Morris,Glen J and Sack,R. Bradley and Huq,Anwar and Rita R Colwell and Endtz,Hubert Ph and Cravioto,Alejandro and Alam,Munirul} } @article {13944, title = {Method and System for Dereverberation of Signals Propagating in ...}, volume = {13/047,311}, year = {2011}, month = {2011/03//}, abstract = {The dereverberation of signals in reverberating environments is carried out via acquiring the representation (image) of spatial distribution of the signals in space of interest and automatic identification of reflections of the source signal in the reverberative space. The technique relies on identification of prominent features at the image, as well as corresponding directions of propagation of signals manifested by the prominent features at the image, and computation of similarity metric between signals corresponding to the prominent features in the image. The time delays between the correlated signals (i.e., source signal and related reflections) are found and the signals are added coherently. Multiple beamformers operate on the source signal and corresponding reflections, enabling one to improve the signal-to-noise ratio in multi-path environments.}, url = {http://www.google.com/patents?id=gBHuAQAAEBAJ}, author = {O{\textquoteright}donovan,Adam and Duraiswami, Ramani and Zotkin,Dmitry N}, editor = {University of Maryland} } @article {12443, title = {Method and system for markerless motion capture using multiple cameras}, volume = {11/937,834}, year = {2011}, month = {2011/09/20/}, abstract = {Completely automated end-to-end method and system for markerless motion capture performs segmentation of articulating objects in Laplacian Eigenspace and is applicable to handling of the poses of some complexity. 3D voxel representation of acquired images are mapped to a higher dimensional space (k), where k depends on the number of articulated chains of the subject body, so as to extract the 1-D representations of the articulating chains. A bottom-up approach is suggested in order to build a parametric (spline-based) representation of a general articulated body in the high dimensional space followed by a top-down probabilistic approach that registers the segments to an average human body model. The parameters of the model are further optimized using the segmented and registered voxels.}, url = {http://www.google.com/patents?id=-THwAQAAEBAJ}, author = {Sundaresan,Aravind and Chellapa, Rama}, editor = {University of Maryland} } @conference {19621, title = {MOMMIE Knows Best: Systematic Optimizations for Verifiable Distributed Algorithms}, booktitle = {HotOS{\textquoteright}13 Proceedings of the 13th USENIX Conference on Hot Topics in Operating Systems }, series = {HotOS{\textquoteright}13}, year = {2011}, month = {2011///}, pages = {30 - 30}, publisher = {USENIX Association}, organization = {USENIX Association}, url = {http://dl.acm.org/citation.cfm?id=1991596.1991636}, author = {Maniatis, Petros and Dietz, Michael and Charalampos Papamanthou} } @conference {13075, title = {Multi-agent event recognition in structured scenarios}, booktitle = {Computer Vision and Pattern Recognition (CVPR), 2011 IEEE Conference on}, year = {2011}, month = {2011/06//}, pages = {3289 - 3296}, abstract = {We present a framework for the automatic recognition of complex multi-agent events in settings where structure is imposed by rules that agents must follow while performing activities. Given semantic spatio-temporal descriptions of what generally happens (i.e., rules, event descriptions, physical constraints), and based on video analysis, we determine the events that occurred. Knowledge about spatio-temporal structure is encoded using first-order logic using an approach based on Allen{\textquoteright}s Interval Logic, and robustness to low-level observation uncertainty is provided by Markov Logic Networks (MLN). Our main contribution is that we integrate interval-based temporal reasoning with probabilistic logical inference, relying on an efficient bottom-up grounding scheme to avoid combinatorial explosion. Applied to one-on-one basketball, our framework detects and tracks players, their hands and feet, and the ball, generates event observations from the resulting trajectories, and performs probabilistic logical inference to determine the most consistent sequence of events. We demonstrate our approach on 1hr (100,000 frames) of outdoor videos.}, keywords = {Allen, analysis;Markov, descriptions;video, event, grounding, inference;semantic, interval, Logic, logic;interval-based, logic;Markov, logic;multi-agent, logical, networks;bottom-up, processes;formal, processing;, reasoning;multiagent, reasoning;video, recognition;probabilistic, recognition;temporal, scheme;first-order, signal, spatio-temporal, systems;object, temporal}, doi = {10.1109/CVPR.2011.5995386}, author = {Morariu,V.I. and Davis, Larry S.} } @article {16489, title = {New models and algorithms for throughput maximization in broadcast scheduling}, journal = {Approximation and Online Algorithms}, year = {2011}, month = {2011///}, pages = {71 - 82}, author = {Chekuri,C. and Gal,A. and Im,S. and Khuller, Samir and Li,J. and McCutchen,R. and Moseley,B. and Raschid, Louiqa} } @conference {13617, title = {Overview of the FIRE 2011 RISOTTask}, booktitle = {FIRE}, year = {2011}, month = {2011///}, abstract = {RISOT was a pilot task in FIRE 2011 which focused on the retrieval of automatically recognized text from machine printed sources. The collection used for search was a subset of the FIRE 2008 and 2010 Bengali test collections that contained 92 topics and 62,825 documents. Two teams participated, submitting a total of 11 monolingual runs.}, author = {Garain,Utpal and Paik,Jiaul and Pal,Tamaltaru and Majumder,Prasenjit and David Doermann and Oard, Douglas} } @article {19271, title = {Overview of the MPEG Reconfigurable Video Coding Framework}, journal = {Journal of Signal Processing Systems}, volume = {63}, year = {2011}, month = {2011}, pages = {251 - 263}, abstract = {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.}, keywords = {CAL actor language, Circuits and Systems, Code synthesis, Computer Imaging, Vision, Pattern Recognition and Graphics, Dataflow programming, Electrical Engineering, Image Processing and Computer Vision, pattern recognition, Reconfigurable Video Coding, Signal, Image and Speech Processing}, isbn = {1939-8018, 1939-8115}, url = {http://link.springer.com/article/10.1007/s11265-009-0399-3}, author = {Bhattacharyya, Shuvra S. and Eker, Johan and Janneck, J{\"o}rn W. and Lucarz, Christophe and Mattavelli, Marco and Raulet, Micka{\"e}l} } @article {18521, title = {Practical Data-Leak Prevention for Legacy Applications in Enterprise Networks}, volume = {GT-CS-11-01}, year = {2011}, month = {2011///}, institution = {Georgia Institute of Technology}, abstract = {Organizations must control where private information spreads; this problem is referred to in the industry as data leak prevention. Commercial solutions for DLP are based on scanning content; these impose high overhead and are easily evaded. Research solutions for this problem, information flow control, require rewriting applications or running a custom operating system, which makes these approaches difficult to deploy. They also typically enforce information flow control on a single host, not across a network, making it difficult to implement an information flow control policy for a network of machines. This paper presents Pedigree, which enforces information flow control across a network for legacy applications. Pedigree allows enterprise administrators and users to associate a label with each file and process; a small, trusted module on the host uses these labels to determine whether two processes on the same host can communicate. When a process attempts to communicate across the network, Pedigree tracks these information flows and enforces information flow control either at end-hosts or at a network switch. Pedigree allows users and operators to specify network-wide information flow policies rather than having to specify and implement policies for each host. Enforcing information flow policies in the network allows Pedigree to operate in networks with heterogeneous devices and operating systems. We present the design and implementation of Pedigree, show that it can prevent data leaks, and investigate its feasibility and usability in common environments.}, url = {http://hdl.handle.net/1853/36612}, author = {Mundada,Y. and Ramachandran,A. and Tariq,M.B. and Feamster, Nick} } @conference {19042, title = {Privacy settings from contextual attributes: A case study using Google Buzz}, year = {2011}, month = {2011}, pages = {257 - 262}, abstract = {Social networks provide users with privacy settings to control what information is shared with connections and other users. In this paper, we analyze factors influencing changes in privacy-related settings in the Google Buzz social network. Specifically, we show statistics on contextual data related to privacy settings that are derived from crawled datasets and analyze the characteristics of users who changed their privacy settings. We also investigate potential neighboring effects among such users.}, keywords = {contextual attributes, data privacy, Google Buzz, privacy settings, social networking (online), social networks, Statistics}, author = {Mashima, D. and Elaine Shi and Chow, R. and Sarkar, P. and Li,C. and Song,D.} } @article {14639, title = {Regulation of Lung Endoderm Progenitor Cell Behavior by miR302/367}, journal = {DevelopmentDevelopment}, volume = {138}, year = {2011}, month = {2011/04/01/}, pages = {1235 - 1245}, abstract = {The temporal and spatial control of organ-specific endoderm progenitor development is poorly understood. miRNAs affect cell function by regulating programmatic changes in protein expression levels. We show that the miR302/367 cluster is a target of the transcription factor Gata6 in mouse lung endoderm and regulates multiple aspects of early lung endoderm progenitor development. miR302/367 is expressed at early stages of lung development, but its levels decline rapidly as development proceeds. Gain- and loss-of-function studies show that altering miR302/367 expression disrupts the balance of lung endoderm progenitor proliferation and differentiation, as well as apical-basal polarity. Increased miR302/367 expression results in the formation of an undifferentiated multi-layered lung endoderm, whereas loss of miR302/367 activity results in decreased proliferation and enhanced lung endoderm differentiation. miR302/367 coordinates the balance between proliferation and differentiation, in part, through direct regulation of Rbl2 and Cdkn1a, whereas apical-basal polarity is controlled by regulation of Tiam1 and Lis1. Thus, miR302/367 directs lung endoderm development by coordinating multiple aspects of progenitor cell behavior, including proliferation, differentiation and apical-basal polarity.}, keywords = {Lung, MicroRNA, mouse, Progenitor}, isbn = {0950-1991, 1477-9129}, doi = {10.1242/dev.061762}, url = {http://dev.biologists.org/content/138/7/1235}, author = {Tian,Ying and Zhang,Yuzhen and Hurd,Laura and Hannenhalli, Sridhar and Liu,Feiyan and Lu,Min Min and Morrisey,Edward E.} } @article {17920, title = {A robust and rotationally invariant local surface descriptor with applications to non-local mesh processing}, journal = {Graphical Models}, volume = {73}, year = {2011}, month = {2011/09//}, pages = {231 - 242}, abstract = {In recent years, we have witnessed a striking increase in research concerning how to describe a meshed surface. These descriptors are commonly used to encode mesh properties or guide mesh processing, not to augment existing computations by replication. In this work, we first define a robust surface descriptor based on a local height field representation, and present a transformation via the extraction of Zernike moments. Unlike previous work, our local surface descriptor is innately rotationally invariant. Second, equipped with this novel descriptor, we present SAMPLE {\textendash} similarity augmented mesh processing using local exemplars {\textendash} a method which uses feature neighbourhoods to propagate mesh processing done in one part of the mesh, the local exemplar, to many others. Finally, we show that SAMPLE can be used in a number of applications, such as detail transfer and parameterization.}, keywords = {Local descriptors, Non-local mesh processing, shape analysis, Similarity processing}, isbn = {1524-0703}, doi = {10.1016/j.gmod.2011.05.002}, url = {http://www.sciencedirect.com/science/article/pii/S1524070311000166}, author = {Maximo, A. and Patro,R. and Varshney, Amitabh and Farias, R.} } @article {12861, title = {Role of Zooplankton Diversity in Vibrio Cholerae Population Dynamics and in the Incidence of Cholera in the Bangladesh Sundarbans}, journal = {Applied and Environmental Microbiology}, volume = {77}, year = {2011}, month = {09/2011}, pages = {6125 - 6132}, abstract = {Vibrio cholerae, a bacterium autochthonous to the aquatic environment, is the causative agent of cholera, a severe watery, life-threatening diarrheal disease occurring predominantly in developing countries. V. cholerae, including both serogroups O1 and O139, is found in association with crustacean zooplankton, mainly copepods, and notably in ponds, rivers, and estuarine systems globally. The incidence of cholera and occurrence of pathogenic V. cholerae strains with zooplankton were studied in two areas of Bangladesh: Bakerganj and Mathbaria. Chitinous zooplankton communities of several bodies of water were analyzed in order to understand the interaction of the zooplankton population composition with the population dynamics of pathogenic V. cholerae and incidence of cholera. Two dominant zooplankton groups were found to be consistently associated with detection of V. cholerae and/or occurrence of cholera cases, namely, rotifers and cladocerans, in addition to copepods. Local differences indicate there are subtle ecological factors that can influence interactions between V. cholerae, its plankton hosts, and the incidence of cholera.}, isbn = {0099-2240, 1098-5336}, doi = {10.1128/AEM.01472-10}, url = {http://aem.asm.org/content/77/17/6125}, author = {De Magny,Guillaume Constantin and Mozumder,Pronob K. and Grim,Christopher J. and Hasan,Nur A. and Naser,M. Niamul and Alam,Munirul and Sack,R. Bradley and Huq,Anwar and Rita R Colwell} } @article {15190, title = {Secure computation with sublinear amortized work}, year = {2011}, month = {2011///}, institution = {Cryptology ePrint Archive, Report 2011/482}, abstract = {Traditional approaches to secure computation begin by representing the function f beingcomputed as a circuit. For any function f that depends on each of its inputs, this implies a protocol with complexity at least linear in the input size. In fact, linear running time is inherent for secure computation of non-trivial functions, since each party must {\textquotedblleft}touch{\textquotedblright} every bit of their input lest information about other party{\textquoteright}s input be leaked. This seems to rule out many interesting applications of secure computation in scenarios where at least one of the inputs is huge and sublinear-time algorithms can be utilized in the insecure setting; private database search is a prime example. We present an approach to secure two-party computation that yields sublinear-time proto- cols, in an amortized sense, for functions that can be computed in sublinear time on a random access machine (RAM). Furthermore, a party whose input is {\textquotedblleft}small{\textquotedblright} is required to maintain only small state. We provide a generic protocol that achieves the claimed complexity, based on any oblivious RAM and any protocol for secure two-party computation. We then present an optimized version of this protocol, where generic secure two-party computation is used only for evaluating a small number of simple operations. }, author = {Gordon,D. and Katz, Jonathan and Kolesnikov,V. and Malkin,T. and Raykova,M. and Vahlis,Y.} } @inbook {19643, title = {Secure Efficient Multiparty Computing of Multivariate Polynomials and Applications}, booktitle = {Applied Cryptography and Network Security}, series = {Lecture Notes in Computer Science}, year = {2011}, month = {2011/01/01/}, pages = {130 - 146}, publisher = {Springer Berlin Heidelberg}, organization = {Springer Berlin Heidelberg}, abstract = {We present a robust secure methodology for computing functions that are represented as multivariate polynomials where parties hold different variables as private inputs. Our generic efficient protocols are fully black-box and employ threshold additive homomorphic encryption; they do not assume honest majority, yet are robust in detecting any misbehavior. We achieve solutions that take advantage of the algebraic structure of the polynomials, and are polynomial-time in all parameters (security parameter, polynomial size, polynomial degree, number of parties). We further exploit a {\textquotedblleft}round table{\textquotedblright} communication paradigm to reduce the complexity in the number of parties. A large collection of problems are naturally and efficiently represented as multivariate polynomials over a field or a ring: problems from linear algebra, statistics, logic, as well as operations on sets represented as polynomials. In particular, we present a new efficient solution to the multi-party set intersection problem, and a solution to a multi-party variant of the polynomial reconstruction problem.}, keywords = {additive homomorphic encryption, Algorithm Analysis and Problem Complexity, Computer Communication Networks, Data Encryption, Discrete Mathematics in Computer Science, Management of Computing and Information Systems, multiparty set intersection, multivariate polynomial evaluation, secret sharing, secure multiparty computation, Systems and Data Security, threshold cryptosystems}, isbn = {978-3-642-21553-7, 978-3-642-21554-4}, url = {http://link.springer.com/chapter/10.1007/978-3-642-21554-4_8}, author = {Dana Dachman-Soled and Malkin, Tal and Raykova, Mariana and Yung, Moti}, editor = {Lopez, Javier and Tsudik, Gene} } @article {18535, title = {SilverLine: Data and Network Isolation for Cloud Services}, journal = {2nd USENIX Workshop on Hot Topics in Cloud Computing}, year = {2011}, month = {2011///}, abstract = {Although cloud computing service providers offer op-portunities for improving the administration, reliability, and maintenance of hosted services, they also concen- trate network resources and data in a small number of cloud service providers. The concentration of data and resources also entails various associated risks, including sharing the underlying infrastructure with unknown (and untrusted) tenants and relying on the availability and se- curity of the underlying infrastructure itself. These se- curity risks represent some of the most significant bar- riers to the adoption of cloud-based services. To begin tackling these risks, a cloud hosting infrastructure should provide strong guarantees for resource and data isolation. This paper examines data and network isolation prob- lems with today{\textquoteright}s cloud hosting infrastructures and pro- poses SilverLine, a collection of techniques to improve data and network isolation for a cloud tenants{\textquoteright} service. }, author = {Mundada,Y. and Ramachandran,A. and Feamster, Nick} } @conference {13330, title = {Smale-like decomposition and forman theory for discrete scalar fields}, booktitle = {Discrete Geometry for Computer Imagery}, year = {2011}, month = {2011///}, pages = {477 - 488}, abstract = {Forman theory, which is a discrete alternative for cell complexes to the well-known Morse theory, is currently finding several applications in areas where the data to be handled are discrete, such as image processing and computer graphics. Here, we show that a discrete scalar field f, defined on the vertices of a triangulated multidimensional domain Σ, and its gradient vector field Grad f through the Smale-like decomposition of f [6], are both the restriction of a Forman function F and its gradient field Grad F that extends f over all the simplexes of Σ. We present an algorithm that gives an explicit construction of such an extension. Hence, the scalar field f inherits the properties of Forman gradient vector fields and functions from field Grad F and function F.}, doi = {10.1007/978-3-642-19867-0_40}, author = {{\v C}omi{\'c},L. and Mesmoudi,M. and De Floriani, Leila} } @article {13072, title = {Smart task-driven video collection}, volume = {11/649,393}, year = {2011}, month = {2011/06/14/}, abstract = {A multi-camera system that collects images and videos of moving objects in dynamic and crowded scenes, subject to task constraints is disclosed. The system constructs {\textquotedblleft}task visibility intervals{\textquotedblright} comprising information about what can be sensed in future time intervals. Methods for constructing these intervals applying prediction of future object motion and including consideration of factors such as object occlusion and camera control parameters are also disclosed. Using a plane-sweep algorithm, these atomic intervals can be combined in a method to form multi-task intervals, during which a single camera can collect videos suitable for multiple tasks simultaneously. Methods for fast camera scheduling that yield solutions within a small constant factor of an optimal solution are also disclosed.}, url = {http://www.google.com/patents?id=pgPnAQAAEBAJ}, author = {Lim,Ser-Nam and Mittal,Anurag and Davis, Larry S.}, editor = {Siemens Corporation} } @article {19595, title = {Systematic Abstraction of Abstract Machines}, journal = {arXiv:1107.3539 [cs]}, year = {2011}, month = {2011/07/18/}, abstract = {We describe a derivational approach to abstract interpretation that yields novel and transparently sound static analyses when applied to well-established abstract machines for higher-order and imperative programming languages. To demonstrate the technique and support our claim, we transform the CEK machine of Felleisen and Friedman, a lazy variant of Krivine{\textquoteright}s machine, and the stack-inspecting CM machine of Clements and Felleisen into abstract interpretations of themselves. The resulting analyses bound temporal ordering of program events; predict return-flow and stack-inspection behavior; and approximate the flow and evaluation of by-need parameters. For all of these machines, we find that a series of well-known concrete machine refactorings, plus a technique of store-allocated continuations, leads to machines that abstract into static analyses simply by bounding their stores. We demonstrate that the technique scales up uniformly to allow static analysis of realistic language features, including tail calls, conditionals, side effects, exceptions, first-class continuations, and even garbage collection. In order to close the gap between formalism and implementation, we provide translations of the mathematics as running Haskell code for the initial development of our method.}, keywords = {Computer Science - Programming Languages}, url = {http://arxiv.org/abs/1107.3539}, author = {David Van Horn and Might, Matthew} } @article {12860, title = {Temperature regulation of virulence factors in the pathogen Vibrio coralliilyticus}, journal = {The ISME Journal}, volume = {6}, year = {2011}, month = {2011/12/08/}, pages = {835 - 846}, abstract = {Sea surface temperatures (SST) are rising because of global climate change. As a result, pathogenic Vibrio species that infect humans and marine organisms during warmer summer months are of growing concern. Coral reefs, in particular, are already experiencing unprecedented degradation worldwide due in part to infectious disease outbreaks and bleaching episodes that are exacerbated by increasing SST. For example, Vibrio coralliilyticus, a globally distributed bacterium associated with multiple coral diseases, infects corals at temperatures above 27 {\textdegree}C. The mechanisms underlying this temperature-dependent pathogenicity, however, are unknown. In this study, we identify potential virulence mechanisms using whole genome sequencing of V. coralliilyticus ATCC (American Type Culture Collection) BAA-450. Furthermore, we demonstrate direct temperature regulation of numerous virulence factors using proteomic analysis and bioassays. Virulence factors involved in motility, host degradation, secretion, antimicrobial resistance and transcriptional regulation are upregulated at the higher virulent temperature of 27 {\textdegree}C, concurrent with phenotypic changes in motility, antibiotic resistance, hemolysis, cytotoxicity and bioluminescence. These results provide evidence that temperature regulates multiple virulence mechanisms in V. coralliilyticus, independent of abundance. The ecological and biological significance of this temperature-dependent virulence response is reinforced by climate change models that predict tropical SST to consistently exceed 27 {\textdegree}C during the spring, summer and fall seasons. We propose V. coralliilyticus as a model Gram-negative bacterium to study temperature-dependent pathogenicity in Vibrio-related diseases.}, keywords = {ecophysiology, ecosystems, environmental biotechnology, geomicrobiology, ISME J, microbe interactions, microbial communities, microbial ecology, microbial engineering, microbial epidemiology, microbial genomics, microorganisms}, isbn = {1751-7362}, doi = {10.1038/ismej.2011.154}, url = {http://www.nature.com/ismej/journal/v6/n4/full/ismej2011154a.html}, author = {Kimes,Nikole E. and Grim,Christopher J. and Johnson,Wesley R. and Hasan,Nur A. and Tall,Ben D. and Kothary,Mahendra H. and Kiss,Hajnalka and Munk,A. Christine and Tapia,Roxanne and Green,Lance and Detter,Chris and Bruce,David C. and Brettin,Thomas S. and Rita R Colwell and Morris,Pamela J.} } @article {15450, title = {Towards incremental component compatibility testing}, journal = {Proceedings of the 14th international ACM Sigsoft symposium on Component based software engineering, CBSE}, volume = {11}, year = {2011}, month = {2011///}, pages = {119 - 128}, abstract = {Software components are increasingly assembled from othercomponents. Each component may further depend on oth- ers, and each may have multiple active versions. The to- tal number of configurations{\textemdash}combinations of components and their versions{\textemdash}deployed by end users can be very large. Component developers, therefore, spend considerable time and effort doing compatibility testing {\textendash} determining whether their components can be built correctly for all deployed con- figurations. In previous work we developed Rachet to sup- port large-scale compatibility testing of components. In this paper, we describe and evaluate methods to enable Rachet to perform incremental compatibility testing. We de- scribe algorithms to compute differences in component com- patibilities between current and previous component builds, a formal test adequacy criterion based on covering the differ- ences, and cache-aware configuration sampling and testing methods that attempt to reuse effort from previous testing sessions. We evaluate our approach using the 5-year evo- lution history of a scientific middleware component. Our results show significant performance improvements over Ra- chet{\textquoteright}s previous retest-all approach, making the process of compatibility testing practical for evolving components. }, author = {Yoon,I. and Sussman, Alan and Memon, Atif M. and Porter, Adam} } @inbook {12458, title = {Tracking and Identification via Object Reflectance Using a Hyperspectral Video Camera}, booktitle = {Machine Vision Beyond Visible SpectrumMachine Vision Beyond Visible Spectrum}, series = {Augmented Vision and Reality}, volume = {1}, year = {2011}, month = {2011///}, pages = {201 - 219}, publisher = {Springer Berlin Heidelberg}, organization = {Springer Berlin Heidelberg}, abstract = {Recent advances in electronics and sensor design have enabled the development of a hyperspectral video camera that can capture hyperspectral datacubes at near video rates. The sensor offers the potential for novel and robust methods for surveillance by combining methods from computer vision and hyperspectral image analysis. Here, we focus on the problem of tracking objects through challenging conditions, such as rapid illumination and pose changes, occlusions, and in the presence of confusers. A new framework that incorporates radiative transfer theory to estimate object reflectance and particle filters to simultaneously track and identify an object based on its reflectance spectra is proposed. By exploiting high-resolution spectral features in the visible and near-infrared regimes, the framework is able to track objects that appear featureless to the human eye. For example, we demonstrate that near-IR spectra of human skin can also be used to distinguish different people in a video sequence. These capabilities are illustrated using experiments conducted on real hyperspectral video data.}, isbn = {978-3-642-11568-4}, url = {http://dx.doi.org/10.1007/978-3-642-11568-4_9}, author = {Nguyen,Hien Van and Banerjee,Amit and Burlina,Philippe and Broadwater,Joshua and Chellapa, Rama}, editor = {Hammoud,Riad and Fan,Guoliang and McMillan,Robert W. W. and Ikeuchi,Katsushi and Hammoud,Riad I. and Wolff,Lawrence B.} } @article {14488, title = {Understanding actor loyalty to event-based groups in affiliation networks}, journal = {Social Network Analysis and Mining}, volume = {1}, year = {2011}, month = {2011///}, pages = {115 - 126}, abstract = {In this paper, we introduce a method for analyzing the temporal dynamics of affiliation networks. We define affiliation groups which describe temporally related subsets of actors and describe an approach for exploring changing memberships in these affiliation groups over time. To model the dynamic behavior in these networks, we consider the concept of loyalty and introduce a measure that captures an actor{\textquoteright}s loyalty to an affiliation group as the degree of {\textquoteleft}commitment{\textquoteright} an actor shows to the group over time. We evaluate our measure using three real world affiliation networks: a publication network, a senate bill cosponsorship network, and a dolphin network. The results show the utility of our measure for analyzing the dynamic behavior of actors and quantifying their loyalty to different time-varying affiliation groups.}, doi = {10.1007/s13278-010-0005-5}, author = {Sharara,H. and Singh,L. and Getoor, Lise and Mann,J.} } @article {15193, title = {Universally composable synchronous computation}, year = {2011}, month = {2011///}, institution = {Cryptology ePrint Archive, Report 2011/310, 2011. http://eprint. iacr. org}, abstract = {In synchronous networks, protocols can achieve security guarantees that are not possible in an asynchronousworld: i.e., they can simultaneously achieve input completeness (all honest parties{\textquoteright} inputs are included in the computation) and guaranteed termination (honest parties do not {\textquotedblleft}hang{\textquotedblright} indefinitely). In practice truly syn- chronous networks rarely exist, but synchrony can be emulated if channels have (known) latency and parties have loosely synchronized clocks. The framework of universal composability (UC) is inherently asynchronous, but several approaches for adding synchrony to the framework have been proposed. However, we show that the existing proposals do not provide the expected guarantees. Given this, we propose a {\textquotedblleft}clean slate{\textquotedblright} approach to defining synchrony in the UC framework by introducing functionalities exactly meant to model, respectively, bounded-delay networks and loosely synchronized clocks. We show that the expected guarantees of synchronous computation can be realized given these functionalities, and that previous models can all be expressed within our new framework. }, author = {Katz, Jonathan and Maurer,U. and Tackmann,B. and Zikas,V.} } @article {17462, title = {Usability and Accessibility in Consumer Health Informatics: Current Trends and Future Challenges}, journal = {American Journal of Preventive Medicine}, volume = {40}, year = {2011}, month = {2011/05//}, pages = {S187-S197 - S187-S197}, abstract = {It is a truism that, for innovative eHealth systems to have true value and impact, they must first and foremost be usable and accessible by clinicians, consumers, and other stakeholders. In this paper, current trends and future challenges in the usability and accessibility of consumer health informatics will be described. Consumer expectations of their healthcare providers and healthcare records in this new era of consumer-directed care will be explored, and innovative visualizations, assistive technologies, and other ways that healthcare information is currently being provided and/or shared will be described. Challenges for ensuring the usability of current and future systems will also be discussed. An innovative model for conducting systematic, timely, user-centered research on consumer-facing websites at the National Cancer Institute (NCI) and the ongoing efforts at the National Institute of Standards and Technology (NIST) to promote health information technology (HIT) usability standards and evaluation criteria will also be presented.}, isbn = {0749-3797}, doi = {10.1016/j.amepre.2011.01.009}, url = {http://www.sciencedirect.com/science/article/pii/S0749379711000869}, author = {Goldberg,Larry and Lide,Bettijoyce and Lowry,Svetlana and Massett,Holly A. and O{\textquoteright}Connell,Trisha and Preece,Jennifer and Quesenbery,Whitney and Shneiderman, Ben} } @conference {12445, title = {Variable remapping of images from very different sources}, booktitle = {2011 18th IEEE International Conference on Image Processing (ICIP)}, year = {2011}, month = {2011/09/11/14}, pages = {1501 - 1504}, publisher = {IEEE}, organization = {IEEE}, abstract = {We present a system which registers image sequences acquired by very different sources, so that multiple views could be transformed to the same coordinates system. This enables the functionality of automatic object identification and confirmation across views and platforms. The capability of the system comes from three ingredients: 1) image context enlargement through temporal integration; 2) robust motion estimation using the G-RANSAC framework with a relaxed correspondence criteria; 3) constrained motion estimation within the G-RANSAC framework. The proposed system has worked successfully on thousands of frames from multiple collections with significant variations in scale and resolution.}, keywords = {automatic object identification, Buildings, CAMERAS, Conferences, constrained motion estimation, coordinates system, Estimation, G-RANSAC framework, image context enlargement, Image Enhancement, image registration, image sequence registration, Image sequences, Motion estimation, Robustness, temporal integration, variable image remapping}, isbn = {978-1-4577-1304-0}, doi = {10.1109/ICIP.2011.6115729}, author = {Wei Zhang and Yanlin Guo and Meth, R. and Sokoloff, H. and Pope, A. and Strat, T. and Chellapa, Rama} } @article {17487, title = {Visual Exploration across Biomedical Databases}, journal = {IEEE/ACM Transactions on Computational Biology and Bioinformatics}, volume = {8}, year = {2011}, month = {2011/04//March}, pages = {536 - 550}, abstract = {Though biomedical research often draws on knowledge from a wide variety of fields, few visualization methods for biomedical data incorporate meaningful cross-database exploration. A new approach is offered for visualizing and exploring a query-based subset of multiple heterogeneous biomedical databases. Databases are modeled as an entity-relation graph containing nodes (database records) and links (relationships between records). Users specify a keyword search string to retrieve an initial set of nodes, and then explore intra- and interdatabase links. Results are visualized with user-defined semantic substrates to take advantage of the rich set of attributes usually present in biomedical data. Comments from domain experts indicate that this visualization method is potentially advantageous for biomedical knowledge exploration.}, keywords = {Bioinformatics, Biomedical computing, biomedical databases, cross-database exploration, Data exploration and discovery, Data visualization, database management systems, Databases, Factual, DNA, graph theory, Information Storage and Retrieval, information visualization., Keyword search, medical computing, natural language processing, Proteins, semantic networks, semantics, sequences, text mining, User-Computer Interface, user-defined semantics, visual databases}, isbn = {1545-5963}, doi = {10.1109/TCBB.2010.1}, author = {Lieberman,M.D. and Taheri, S. and Guo,Huimin and Mirrashed,F. and Yahav,I. and Aris,A. and Shneiderman, Ben} } @article {19582, title = {Abstracting Abstract Machines}, journal = {arXiv:1007.4446 [cs]}, year = {2010}, note = {Comment: The 15th ACM SIGPLAN International Conference on Functional Programming (ICFP{\textquoteright}10), Baltimore, Maryland, September, 2010}, month = {2010/07/26/}, abstract = {We describe a derivational approach to abstract interpretation that yields novel and transparently sound static analyses when applied to well-established abstract machines. To demonstrate the technique and support our claim, we transform the CEK machine of Felleisen and Friedman, a lazy variant of Krivine{\textquoteright}s machine, and the stack-inspecting CM machine of Clements and Felleisen into abstract interpretations of themselves. The resulting analyses bound temporal ordering of program events; predict return-flow and stack-inspection behavior; and approximate the flow and evaluation of by-need parameters. For all of these machines, we find that a series of well-known concrete machine refactorings, plus a technique we call store-allocated continuations, leads to machines that abstract into static analyses simply by bounding their stores. We demonstrate that the technique scales up uniformly to allow static analysis of realistic language features, including tail calls, conditionals, side effects, exceptions, first-class continuations, and even garbage collection.}, keywords = {Computer Science - Programming Languages, F.3.2, F.4.1}, url = {http://arxiv.org/abs/1007.4446}, author = {David Van Horn and Might, Matthew} } @article {14396, title = {Active learning for networked data}, journal = {ICML{\textquoteright}10}, year = {2010}, month = {2010///}, abstract = {We introduce a novel active learning algo-rithm for classification of network data. In this setting, training instances are connected by a set of links to form a network, the labels of linked nodes are correlated, and the goal is to exploit these dependencies and accu- rately label the nodes. This problem arises in many domains, including social and biologi- cal network analysis and document classifica- tion, and there has been much recent interest in methods that collectively classify the nodes in the network. While in many cases labeled examples are expensive, often network infor- mation is available. We show how an active learning algorithm can take advantage of net- work structure. Our algorithm effectively ex- ploits the links between instances and the in- teraction between the local and collective as- pects of a classifier to improve the accuracy of learning from fewer labeled examples. We ex- periment with two real-world benchmark col- lective classification domains, and show that we are able to achieve extremely accurate re- sults even when only a small fraction of the data is labeled. }, author = {Bilgic,M. and Mihalkova,L. and Getoor, Lise} } @inbook {15424, title = {Advances in Automated Model-Based System Testing of Software Applications with a GUI Front-End}, booktitle = {Advances in ComputersAdvances in Computers}, volume = {Volume 80}, year = {2010}, month = {2010///}, pages = {121 - 162}, publisher = {Elsevier}, organization = {Elsevier}, abstract = {Despite the ubiquity of software applications that employ a graphical-user interface (GUI) front-end, functional system testing of these applications has remained, until recently, an understudied research area. During {\textquotedblleft}GUI testing,{\textquotedblright} test cases, modeled as sequences of user input events, are created and executed on the software by exercising the GUI{\textquoteright}s widgets. Because each possible sequence of user events may potentially be a test case and today{\textquoteright}s GUIs offer enormous flexibility to end-users, in principle, GUI testing requires a prohibitively large number of test cases. Any practical test-case generation technique must sample the vast GUI input space. Existing techniques are largely manual, and hence extremely resource intensive. Several new automated model-based techniques have been developed in the past decade. All these techniques develop, either manually or automatically, a model of the GUI and employ it to generate test cases. This chapter presents the first detailed taxonomy of these techniques. A small GUI application is used as a running example to demonstrate each technique and illustrate its relative strengths and weaknesses.}, isbn = {0065-2458}, url = {http://www.sciencedirect.com/science/article/pii/S0065245810800038}, author = {Memon, Atif M. and Nguyen,Bao N.}, editor = {Zelkowitz, Marvin V} } @inbook {12503, title = {Aligning Spatio-Temporal Signals on a Special Manifold}, booktitle = {Computer Vision {\textendash} ECCV 2010Computer Vision {\textendash} ECCV 2010}, series = {Lecture Notes in Computer Science}, volume = {6315}, year = {2010}, month = {2010///}, pages = {547 - 560}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {We investigate the spatio-temporal alignment of videos or features/signals extracted from them. Specifically, we formally define an alignment manifold and formulate the alignment problem as an optimization procedure on this non-linear space by exploiting its intrinsic geometry. We focus our attention on semantically meaningful videos or signals, e.g., those describing or capturing human motion or activities, and propose a new formalism for temporal alignment accounting for executing rate variations among realizations of the same video event. By construction, we address this static and deterministic alignment task in a dynamic and stochastic manner: we regard the search for optimal alignment parameters as a recursive state estimation problem for a particular dynamic system evolving on the alignment manifold. Consequently, a Sequential Importance Sampling iteration on the alignment manifold is designed for effective and efficient alignment. We demonstrate the performance on several types of input data that arise in vision problems.}, isbn = {978-3-642-15554-3}, url = {http://dx.doi.org/10.1007/978-3-642-15555-0_40}, author = {Ruonan Li and Chellapa, Rama}, editor = {Daniilidis,Kostas and Maragos,Petros and Paragios,Nikos} } @article {15564, title = {Approximate range searching: The absolute model}, journal = {Computational Geometry}, volume = {43}, year = {2010}, month = {2010/05//}, pages = {434 - 444}, abstract = {Range searching is a well known problem in the area of geometric data structures. We consider this problem in the context of approximation, where an approximation parameter ε \> 0 is provided. Most prior work on this problem has focused on the case of relative errors, where each range shape R is bounded, and points within distance ε . diam ( R ) of the range{\textquoteright}s boundary may or may not be included. We consider a different approximation model, called the absolute model, in which points within distance ε of the range{\textquoteright}s boundary may or may not be included, regardless of the diameter of the range. We consider range spaces consisting of halfspaces, Euclidean balls, simplices, axis-aligned rectangles, and general convex bodies. We consider a variety of problem formulations, including range searching under general commutative semigroups, idempotent semigroups, groups, and range emptiness. We show how idempotence can be used to improve not only approximate, but also exact halfspace range searching. Our data structures are much simpler than both their exact and relative model counterparts, and so are amenable to efficient implementation.}, keywords = {Absolute model, approximation, Halfbox quadtree, Idempotence, Range searching}, isbn = {0925-7721}, doi = {10.1016/j.comgeo.2008.09.009}, url = {http://www.sciencedirect.com/science/article/pii/S0925772109000844}, author = {da Fonseca,Guilherme D. and Mount, Dave} } @article {15566, title = {Approximation algorithm for the kinetic robust K-center problem}, journal = {Computational Geometry}, volume = {43}, year = {2010}, month = {2010/08//}, pages = {572 - 586}, abstract = {Two complications frequently arise in real-world applications, motion and the contamination of data by outliers. We consider a fundamental clustering problem, the k-center problem, within the context of these two issues. We are given a finite point set S of size n and an integer k. In the standard k-center problem, the objective is to compute a set of k center points to minimize the maximum distance from any point of S to its closest center, or equivalently, the smallest radius such that S can be covered by k disks of this radius. In the discrete k-center problem the disk centers are drawn from the points of S, and in the absolute k-center problem the disk centers are unrestricted.We generalize this problem in two ways. First, we assume that points are in continuous motion, and the objective is to maintain a solution over time. Second, we assume that some given robustness parameter 0 \< t ⩽ 1 is given, and the objective is to compute the smallest radius such that there exist k disks of this radius that cover at least ⌈ t n ⌉ points of S. We present a kinetic data structure (in the KDS framework) that maintains a ( 3 + ε ) -approximation for the robust discrete k-center problem and a ( 4 + ε ) -approximation for the robust absolute k-center problem, both under the assumption that k is a constant. We also improve on a previous 8-approximation for the non-robust discrete kinetic k-center problem, for arbitrary k, and show that our data structure achieves a ( 4 + ε ) -approximation. All these results hold in any metric space of constant doubling dimension, which includes Euclidean space of constant dimension. }, keywords = {Approximation algorithms, clustering, kinetic data structures, robust statistics}, isbn = {0925-7721}, doi = {10.1016/j.comgeo.2010.01.001}, url = {http://www.sciencedirect.com/science/article/pii/S0925772110000027}, author = {Friedler,Sorelle A. and Mount, Dave} } @inbook {12504, title = {Articulation-Invariant Representation of Non-planar Shapes}, booktitle = {Computer Vision {\textendash} ECCV 2010Computer Vision {\textendash} ECCV 2010}, series = {Lecture Notes in Computer Science}, volume = {6313}, year = {2010}, month = {2010///}, pages = {286 - 299}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {Given a set of points corresponding to a 2D projection of a non-planar shape, we would like to obtain a representation invariant to articulations (under no self-occlusions). It is a challenging problem since we need to account for the changes in 2D shape due to 3D articulations, viewpoint variations, as well as the varying effects of imaging process on different regions of the shape due to its non-planarity. By modeling an articulating shape as a combination of approximate convex parts connected by non-convex junctions, we propose to preserve distances between a pair of points by (i) estimating the parts of the shape through approximate convex decomposition, by introducing a robust measure of convexity and (ii) performing part-wise affine normalization by assuming a weak perspective camera model, and then relating the points using the inner distance which is insensitive to planar articulations. We demonstrate the effectiveness of our representation on a dataset with non-planar articulations, and on standard shape retrieval datasets like MPEG-7.}, isbn = {978-3-642-15557-4}, url = {http://dx.doi.org/10.1007/978-3-642-15558-1_21}, author = {Gopalan,Raghuraman and Turaga,Pavan and Chellapa, Rama}, editor = {Daniilidis,Kostas and Maragos,Petros and Paragios,Nikos} } @conference {19026, title = {Authentication in the clouds: a framework and its application to mobile users}, series = {CCSW {\textquoteright}10}, year = {2010}, month = {2010}, pages = {1 - 6}, publisher = {ACM}, organization = {ACM}, abstract = {Cloud computing is a natural fit for mobile security. Typical handsets have input constraints and practical computational and power limitations, which must be respected by mobile security technologies in order to be effective. We describe how cloud computing can address these issues. Our approach is based on a flexible framework for supporting authentication decisions we call TrustCube (to manage the authentication infrastructure) and on a behavioral authentication approach referred to as implicit authentication (to translate user behavior into authentication scores). The combination results in a new authentication paradigm for users of mobile technologies, one where an appropriate balance between usability and trust can be managed through flexible policies and dynamic tuning.}, keywords = {Authentication, Cloud computing, Mobile computing}, isbn = {978-1-4503-0089-6}, url = {http://doi.acm.org/10.1145/1866835.1866837}, author = {Chow, Richard and Jakobsson, Markus and Masuoka, Ryusuke and Molina,Jesus and Niu, Yuan and Elaine Shi and Song,Zhexuan} } @article {16459, title = {BioNav: An Ontology-Based Framework to Discover Semantic Links in the Cloud of Linked Data}, journal = {The Semantic Web: Research and Applications}, year = {2010}, month = {2010///}, pages = {441 - 445}, author = {Vidal,M. E and Raschid, Louiqa and M{\'a}rquez,N. and Rivera,J. and Ruckhaus,E.} } @conference {17572, title = {Cellular traffic offloading through opportunistic communications: a case study}, booktitle = {Proceedings of the 5th ACM workshop on Challenged networks}, series = {CHANTS {\textquoteright}10}, year = {2010}, month = {2010///}, pages = {31 - 38}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Due to the increasing popularity of various applications for smartphones, 3G networks are currently overloaded by mobile data traffic. Offloading cellular traffic through opportunistic communications is a promising solution to partially solve this problem, because there is no monetary cost for it. As a case study, we investigate the target-set selection problem for information delivery in the emerging Mobile Social Networks (MoSoNets). We propose to exploit opportunistic communications to facilitate the information dissemination and thus reduce the amount of cellular traffic. In particular, we study how to select the target set with only k users, such that we can minimize the cellular data traffic. In this scenario, initially the content service providers deliver information over cellular networks to only users in the target set. Then through opportunistic communications, target-users will further propagate the information among all the subscribed users. Finally, service providers will send the information to users who fail to receive it before the delivery deadline (i.e., delay-tolerance threshold). We propose three algorithms, called Greedy, Heuristic, and Random, for this problem and evaluate their performance through an extensive trace-driven simulation study. The simulation results verify the efficiency of these algorithms for both synthetic and real-world mobility traces. For example, the Heuristic algorithm can offload cellular traffic by up to 73.66\% for a real-world mobility trace.}, keywords = {cellular traffic offloading, mobile social networks, opportunistic communications, target-set selection}, isbn = {978-1-4503-0139-8}, doi = {10.1145/1859934.1859943}, url = {http://doi.acm.org/10.1145/1859934.1859943}, author = {Han,Bo and Hui,Pan and Kumar,V. S. Anil and Marathe,Madhav V. and Guanhong Pei and Srinivasan, Aravind} } @article {15326, title = {Coherent turbulent motions in a Mach 3 boundary layer}, journal = {Bulletin of the American Physical Society}, volume = {55}, year = {2010}, month = {2010///}, author = {Beekman,I. and Kan,Y. C and Priebe,S. and Martin, M.P} } @article {15366, title = {Common Mode Analysis of Ethernet Transformers}, journal = {Magnetics Letters, IEEE}, volume = {1}, year = {2010}, month = {2010///}, abstract = {In this letter, a distributed model for Ethernet transformers subject to common mode signals is developed.Explicit formulas for transfer functions are derived and illustrated by numerical examples. }, author = {Bowen,D. and Mayergoyz, Issak D and Krafft,C. and Kroop,D.} } @conference {15457, title = {Community-based, collaborative testing and analysis}, booktitle = {Proceedings of the FSE/SDP workshop on Future of software engineering research}, series = {FoSER {\textquoteright}10}, year = {2010}, month = {2010///}, pages = {239 - 244}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {This article proposes a research agenda aimed at enabling optimized testing and analysis processes and tools to support component-based software development communities. We hypothesize that de facto communities---sets of projects that provide, maintain and integrate many shared infrastructure components---are commonplace. Currently, community members, often unknown to each other, tend to work in isolation, duplicating work, failing to learn from each other{\textquoteright}s effort, and missing opportunities to efficiently improve the common infrastructure. We further hypothesize that as software integration continues to become the predominant mode of software development, there will be increasing value in tools and techniques that empower these communities to coordinate and optimize their development efforts, and to generate and broadly share information. Such tools and techniques will greatly improve the robustness, quality and usability of the common infrastructure which, in turn, will greatly reduce the time and effort needed to produce and use the end systems that are the true goal of the entire community.}, keywords = {component-based software development communities, testing and analysis}, isbn = {978-1-4503-0427-6}, doi = {10.1145/1882362.1882412}, url = {http://doi.acm.org/10.1145/1882362.1882412}, author = {Memon, Atif M. and Porter, Adam and Sussman, Alan} } @article {12870, title = {Comparative Genomics of Clinical and Environmental Vibrio Mimicus}, journal = {Proceedings of the National Academy of SciencesPNAS}, volume = {107}, year = {2010}, month = {2010/12/07/}, pages = {21134 - 21139}, abstract = {Whether Vibrio mimicus is a variant of Vibrio cholerae or a separate species has been the subject of taxonomic controversy. A genomic analysis was undertaken to resolve the issue. The genomes of V. mimicus MB451, a clinical isolate, and VM223, an environmental isolate, comprise ca. 4,347,971 and 4,313,453 bp and encode 3,802 and 3,290 ORFs, respectively. As in other vibrios, chromosome I (C-I) predominantly contains genes necessary for growth and viability, whereas chromosome II (C-II) bears genes for adaptation to environmental change. C-I harbors many virulence genes, including some not previously reported in V. mimicus, such as mannose-sensitive hemagglutinin (MSHA), and enterotoxigenic hemolysin (HlyA); C-II encodes a variant of Vibrio pathogenicity island 2 (VPI-2), and Vibrio seventh pandemic island II (VSP-II) cluster of genes. Extensive genomic rearrangement in C-II indicates it is a hot spot for evolution and genesis of speciation for the genus Vibrio. The number of virulence regions discovered in this study (VSP-II, MSHA, HlyA, type IV pilin, PilE, and integron integrase, IntI4) with no notable difference in potential virulence genes between clinical and environmental strains suggests these genes also may play a role in the environment and that pathogenic strains may arise in the environment. Significant genome synteny with prototypic pre-seventh pandemic strains of V. cholerae was observed, and the results of phylogenetic analysis support the hypothesis that, in the course of evolution, V. mimicus and V. cholerae diverged from a common ancestor with a prototypic sixth pandemic genomic backbone.}, isbn = {0027-8424, 1091-6490}, doi = {10.1073/pnas.1013825107}, url = {http://www.pnas.org/content/107/49/21134}, author = {Hasan,Nur A. and Grim,Christopher J. and Haley,Bradd J. and Jongsik Chun and Alam,Munirul and Taviani,Elisa and Mozammel Hoq and Munk,A. Christine and Rita R Colwell} } @inbook {12500, title = {Compressive Acquisition of Dynamic Scenes}, booktitle = {Computer Vision {\textendash} ECCV 2010Computer Vision {\textendash} ECCV 2010}, series = {Lecture Notes in Computer Science}, volume = {6311}, year = {2010}, month = {2010///}, pages = {129 - 142}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {Compressive sensing (CS) is a new approach for the acquisition and recovery of sparse signals and images that enables sampling rates significantly below the classical Nyquist rate. Despite significant progress in the theory and methods of CS, little headway has been made in compressive video acquisition and recovery. Video CS is complicated by the ephemeral nature of dynamic events, which makes direct extensions of standard CS imaging architectures and signal models infeasible. In this paper, we develop a new framework for video CS for dynamic textured scenes that models the evolution of the scene as a linear dynamical system (LDS). This reduces the video recovery problem to first estimating the model parameters of the LDS from compressive measurements, from which the image frames are then reconstructed. We exploit the low-dimensional dynamic parameters (the state sequence) and high-dimensional static parameters (the observation matrix) of the LDS to devise a novel compressive measurement strategy that measures only the dynamic part of the scene at each instant and accumulates measurements over time to estimate the static parameters. This enables us to considerably lower the compressive measurement rate considerably. We validate our approach with a range of experiments including classification experiments that highlight the effectiveness of the proposed approach.}, isbn = {978-3-642-15548-2}, url = {http://dx.doi.org/10.1007/978-3-642-15549-9_10}, author = {Sankaranarayanan,Aswin and Turaga,Pavan and Baraniuk,Richard and Chellapa, Rama}, editor = {Daniilidis,Kostas and Maragos,Petros and Paragios,Nikos} } @article {12467, title = {COMPRESSIVE SENSING SYSTEM AND METHOD FOR BEARING ESTIMATION OF SPARSE SOURCES IN THE ANGLE DOMAIN}, volume = {12/740,947}, year = {2010}, month = {2010/10/21/}, abstract = {Compressive Sensing (CS) is an emerging area which uses a relatively small number of non-traditional samples in the form of randomized projections to reconstruct sparse or com-pressible signals. Direction-of-arrival (DOA) estimation is performed with an array of sensors using CS. Using random projections of the sensor data, along with a full waveform recording on one reference sensor, a sparse angle space scenario can be reconstructed, giving the number of sources and their DOA{\textquoteright}s. Signal processing algorithms are also developed and described herein for randomly deployable wireless sensor arrays that are severely constrained in communication bandwidth. There is a focus on the acoustic bearing estimation problem and it is shown that when the target bearings are modeled as a sparse vector in the angle space, functions of the low dimensional random projections of the microphone signals can be used to determine multiple source bearings as a solution of an 1]-norm minimization problem.}, url = {http://www.google.com/patents?id=xDLYAAAAEBAJ}, author = {Cevher,Volkan and Gurbuz,Ali Cafer and McClellan,James H. and Chellapa, Rama} } @article {13426, title = {Confidence-based feature acquisition to minimize training and test costs}, journal = {Proceedings of the SIAM Conference on Data Mining}, volume = {76}, year = {2010}, month = {2010///}, pages = {514 - 524}, abstract = {We present Confidence-based Feature Acquisition (CFA), a novel supervised learning method for acquiring missing feature values when there is missing data at both training and test time. Previous work has considered the cases of missing data at training time (e.g., Active Feature Acquisition, AFA 8), or at test time (e.g., Cost-Sensitive Naive Bayes, CSNB 2), but not both. At training time, CFA constructs a cascaded ensemble of classifiers, starting with the zero-cost features and adding a single feature for each successive model. For each model, CFA selects a subset of training instances for which the added feature should be acquired. At test time, the set of models is applied sequentially (as a cascade), stopping when a user-supplied confidence threshold is met. We compare CFA to AFA, CSNB, and several other baselines, and find that CFAs accuracy is at least as high as the other methods, while incurring significantly lower feature acquisition costs.}, doi = {10.2307/2287057}, author = {desJardins, Marie and MacGlashan,James and Wagstaff,Kiri L} } @article {13914, title = {Connecting generations: developing co-design methods for older adults and children}, journal = {Behaviour \& Information Technology}, volume = {99999}, year = {2010}, month = {2010///}, pages = {1 - 11}, author = {Xie,B. and Druin, Allison and Fails,J. and Massey,S. and Golub,E. and Franckel,S. and Schneider,K.} } @conference {18940, title = {Crowdsourcing the evaluation of a domain-adapted named entity recognition system}, series = {HLT {\textquoteright}10}, year = {2010}, month = {2010///}, pages = {345 - 348}, publisher = {Association for Computational Linguistics}, organization = {Association for Computational Linguistics}, address = {Stroudsburg, PA, USA}, abstract = {Named entity recognition systems sometimes have difficulty when applied to data from domains that do not closely match the training data. We first use a simple rule-based technique for domain adaptation. Data for robust validation of the technique is then generated, and we use crowdsourcing techniques to show that this strategy produces reliable results even on data not seen by the rule designers. We show that it is possible to extract large improvements on the target data rapidly at low cost using these techniques.}, isbn = {1-932432-65-5}, url = {http://dl.acm.org/citation.cfm?id=1857999.1858050}, author = {Sayeed,Asad B. and Meyer,Timothy J. and Nguyen,Hieu C. and Buzek,Olivia and Weinberg, Amy} } @article {18189, title = {Data hiding in compiled program binaries for supplementing computer functionality}, volume = {11/445,374}, year = {2010}, month = {2010/11/23/}, abstract = {Bit reductions in program instructions are achieved by determining the set of bit patterns in bit locations of the instructions. If only a subset of bit patterns is present in the instructions, they may be represented by an index value having a smaller number of bits. The index value may be substituted into the instruction and later used in decoding by referencing a corresponding bit pattern in a lookup table. The bit-reduction in the instruction makes way for supplemental data bits which may then be embedded.}, url = {http://www.google.com/patents?id=tNHbAAAAEBAJ}, author = {M. Wu and Swaminathan,Ashwin and Mao,Yinian}, editor = {University of Maryland} } @conference {18559, title = {Decoupling policy from configuration in campus and enterprise networks}, booktitle = {Local and Metropolitan Area Networks (LANMAN), 2010 17th IEEE Workshop on}, year = {2010}, month = {2010/05//}, pages = {1 - 6}, abstract = {This paper surveys our ongoing work on the use of software-defined networking to simplify two acute policy problems in campus and enterprise network operations: access control and information flow control. We describe how the current coupling of high-level policy with low-level configuration makes these problems challenging today. We describe the specific policy problems faced by campus and enterprise network operators; illustrate our approach, which leverages recent trends in separating the network{\textquoteright}s $\#$x201C;control plane $\#$x201D; from the data plane; and show how this approach can be applied to simplify these two enterprise network management tasks. We also describe our ongoing deployment efforts to build a campus network testbed where trial designs can be deployed and evaluated. We close with a summary of current and future research challenges for solving challenges within enterprise networks within the context of this new paradigm.}, keywords = {Access control, Business communication, campus network, decoupling policy, enterprise network management tasks, enterprise network operator, information flow control, software defined network, software radio, telecommunication network management, telecommunication security}, doi = {10.1109/LANMAN.2010.5507162}, author = {Feamster, Nick and Nayak,A. and Kim,Hyojoon and Clark,R. and Mundada,Y. and Ramachandran,A. and bin Tariq,M.} } @article {13286, title = {Design, Analysis and Comparison of Spatial Indexes for Tetrahedral Meshes}, volume = {DISI-TR-2010-05}, year = {2010}, month = {2010///}, institution = {Department of Computer Science and Information Science, University of Genoa}, abstract = {We address the problem of performing spatial queries on tetrahedral meshes. These latterarise in several application domains including 3D GIS, scientific visualization, finite element analysis. We have defined and implemented a family of spatial indexes, that we call tetrahedral trees. Tetrahedral trees are based on a subdivision of a cubic domain containing the mesh defined either by an octree or a 3D kd-tree. For each of them, we have four variants of the spatial index, depending on four different subdivision criteria. Here, we present such indexes, we discuss how to construct them and perform classical spatial queries such as point location and window queries. We compare the various tetrahedral trees based in memory usage, performances in spatial queries and computation times for constructing them. }, author = {De Floriani, Leila and Fellegara,R. and Magillo,P.} } @article {18525, title = {Distributed Implementation of Coordinated, Network-Wide Policies and Protocols with FlowFlex}, volume = {GT-CS-10-07}, year = {2010}, month = {2010///}, institution = {Georgia Institute of Technology}, abstract = {The increasing programmability of network devices gives protocol designers and network operators considerably more flexibility in defining custom protocols and traffic processing functions. Today, network operators and protocol designers have the option of either operating at flow-level granularity, which offers coordinated control; or packet-level granularity, which offers flexibility, but not coordinated control. Today{\textquoteright}s network programming paradigms force operators to choose between the fine-grained control and expressiveness of packet processing and the coordination of flow processing, which makes it difficult to quickly realize a distributed implementation of a global, network-wide policy. Designers must also choose between the flexibility of hardware-based solutions and the fast development cycles offered by software. This paper proposes a system called FlowFlex that offers network designers the best of both worlds: with FlowFlex, operators can quickly design, implement, and deploy network systems and protocols that offer fast, distributed, implementations that require coordinated control and fine-grained operations on packets. We present the design and implementation of the FlowFlex framework and show how it can improve both expressiveness and efficiency for three real-world networking applications.}, url = {http://hdl.handle.net/1853/35002}, author = {Mundada,Y. and Sherwood,R. and Feamster, Nick} } @article {12876, title = {Diversity and distribution of cholix toxin, a novel ADP-ribosylating factor from Vibrio cholerae}, journal = {Environmental Microbiology Reports}, volume = {2}, year = {2010}, month = {2010/02/08/}, pages = {198 - 207}, abstract = {Non-toxigenic non-O1, non-O139 Vibrio cholerae strains isolated from both environmental and clinical settings carry a suite of virulence factors aside from cholera toxin. Among V. cholerae strains isolated from coastal waters of southern California, this includes cholix toxin, an ADP-ribosylating factor that is capable of halting protein synthesis in eukaryotic cells. The prevalence of the gene encoding cholix toxin, chxA, was assessed among a collection of 155 diverse V. cholerae strains originating from both clinical and environmental settings in Bangladesh and Mexico and other countries around the globe. The chxA gene was present in 47\% of 83 non-O1, non-O139 strains and 16\% of 72 O1/O139 strains screened as part of this study. A total of 86 chxA gene sequences were obtained, and phylogenetic analysis revealed that they fall into two distinct clades. These two clades were also observed in the phylogenies of several housekeeping genes, suggesting that the divergence observed in chxA extends to other regions of the V. cholerae genome, and most likely has arisen from vertical descent rather than horizontal transfer. Our results clearly indicate that ChxA is a major toxin of V. cholerae with a worldwide distribution that is preferentially associated with non-pandemic strains.}, isbn = {1758-2229}, doi = {10.1111/j.1758-2229.2010.00139.x}, url = {http://onlinelibrary.wiley.com/doi/10.1111/j.1758-2229.2010.00139.x/abstract?userIsAuthenticated=false\&deniedAccessCustomisedMessage=}, author = {Purdy,Alexandra E. and Balch,Deborah and Liz{\'a}rraga-Partida,Marcial Leonardo and Islam,Mohammad Sirajul and Martinez-Urtaza,Jaime and Huq,Anwar and Rita R Colwell and Bartlett,Douglas H.} } @conference {15621, title = {A dynamic data structure for approximate range searching}, booktitle = {Proceedings of the 2010 annual symposium on Computational geometry}, series = {SoCG {\textquoteright}10}, year = {2010}, month = {2010///}, pages = {247 - 256}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced variant of a quadtree data structure. In particular, it defines a hierarchical decomposition of space into cells, which are based on hyperrectangles of bounded aspect ratio, each of constant combinatorial complexity. It can be viewed as a multidimensional generalization of the treap data structure of Seidel and Aragon. When inserted, points are assigned random priorities, and the tree is restructured through rotations as if the points had been inserted in priority order. In any fixed dimension d, we show it is possible to store a set of n points in a quadtreap of space O(n). The height h of the tree is O(log n) with high probability. It supports point insertion in time O(h). It supports point deletion in worst-case time O(h2) and expected-case time O(h), averaged over the points of the tree. It can answer ε-approximate spherical range counting queries over groups and approximate nearest neighbor queries in time O(h + (1/ε)d-1).}, keywords = {Approximation algorithms, dynamic data structures, geometric data structures, quadtrees, Range searching}, isbn = {978-1-4503-0016-2}, doi = {10.1145/1810959.1811002}, url = {http://doi.acm.org/10.1145/1810959.1811002}, author = {Mount, Dave and Park,Eunhui} } @conference {14688, title = {Dynamically checking ownership policies in concurrent c/c++ programs}, booktitle = {Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages}, series = {POPL {\textquoteright}10}, year = {2010}, month = {2010///}, pages = {457 - 470}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Concurrent programming errors arise when threads share data incorrectly. Programmers often avoid these errors by using synchronization to enforce a simple ownership policy: data is either owned exclusively by a thread that can read or write the data, or it is read owned by a set of threads that can read but not write the data. Unfortunately, incorrect synchronization often fails to enforce these policies and memory errors in languages like C and C++ can violate these policies even when synchronization is correct. In this paper, we present a dynamic analysis for checking ownership policies in concurrent C and C++ programs despite memory errors. The analysis can be used to find errors in commodity multi-threaded programs and to prevent attacks that exploit these errors. We require programmers to write ownership assertions that describe the sharing policies used by different parts of the program. These policies may change over time, as may the policies{\textquoteright} means of enforcement, whether it be locks, barriers, thread joins, etc. Our compiler inserts checks in the program that signal an error if these policies are violated at runtime. We evaluated our tool on several benchmark programs. The run-time overhead was reasonable: between 0 and 49\% with an average of 26\%. We also found the tool easy to use: the total number of ownership assertions is small, and the asserted specification and implementation can be debugged together by running the instrumented program and addressing the errors that arise. Our approach enjoys a pleasing modular soundness property: if a thread executes a sequence of statements on variables it owns, the statements are serializable within a valid execution, and thus their effects can be reasoned about in isolation from other threads in the program.}, keywords = {concurrency, Debugging, Dynamic analysis, Security, Testing, tools}, isbn = {978-1-60558-479-9}, doi = {10.1145/1706299.1706351}, url = {http://doi.acm.org/10.1145/1706299.1706351}, author = {Martin,Jean-Phillipe and Hicks, Michael W. and Costa,Manuel and Akritidis,Periklis and Castro,Miguel} } @article {13959, title = {Efficient kriging for real-time spatio-temporal interpolation}, journal = {Proceedings of the 20 th Conference on Probability and Statistics in the Atmospheric Sciences}, year = {2010}, month = {2010///}, pages = {228 - 235}, abstract = {Atmospheric data is often recorded at scattered stationlocations. While the data is generally available over a long period of time it cannot be used directly for extract- ing coherent patterns and mechanistic correlations. The only recourse is to spatially and temporally interpolate the data both to organize the station recording to a reg- ular grid and to query the data for predictions at a par- ticular location or time of interest. Spatio-temporal in- terpolation approaches require the evaluation of weights at each point of interest. A widely used interpolation ap- proach is kriging. However, kriging has a computational cost that scales as the cube of the number of data points N, resulting in cubic time complexity for each point of interest, which leads to a time complexity of O(N4) for interpolation at O(N) points. In this work, we formulate the kriging problem, to first reduce the computational cost to O(N3). We use an iterative solver (Saad, 2003), and further accelerate the solver using fast summation algo- rithms like GPUML (Srinivasan and Duraiswami, 2009) or FIGTREE (Morariu et al., 2008). We illustrate the speedup on synthetic data and compare the performance with other standard kriging approaches to demonstrate substantial improvement in the performance of our ap- proach. We then apply the developed approach on ocean color data from the Chesapeake Bay and present some quantitative analysis of the kriged results. }, author = {Srinivasan,B.V. and Duraiswami, Ramani and Murtugudde,R.} } @conference {17750, title = {Efficient Policy-Based Inconsistency Management in Relational Knowledge Bases}, booktitle = {Scalable Uncertainty Management: 4th International Conference}, volume = {6379}, year = {2010}, month = {2010///}, pages = {264 - 264}, abstract = {Real-world databases are frequently inconsistent. Even though the users who work with a body of data are far more familiar not only with that data, but also their own job and the risks they are willing to take and the inferences they are willing to make from inconsistent data, most DBMSs force them to use the policy embedded in the DBMS. Inconsistency management policies (IMPs) were introduced so that users can apply policies that they deem are appropriate for data they know and understand better than anyone else. In this paper, we develop an efficient {\textquotedblleft}cluster table{\textquotedblright} method to implement IMPs and show that using cluster tables instead of a standard DBMS index is far more efficient when less than about 3\% of a table is involved in an inconsistency (which is hopefully the case in most real world DBs), while standard DBMS indexes perform better when the amount of inconsistency in a database is over 3\%.}, doi = {10.1007/978-3-642-15951-0_26}, author = {Martinez,M. V and Parisi,F. and Pugliese, A. and Simari,G. I and V.S. Subrahmanian} } @article {15383, title = {Electromagnetic Modeling of Ethernet Transformers}, journal = {Magnetics, IEEE Transactions on}, volume = {46}, year = {2010}, month = {2010/02//}, pages = {563 - 569}, abstract = {The unique features of Ethernet transformers are reviewed, and novel testing techniques for identification of lumped parameters of equivalent circuits are presented. To account for the distributed nature of the cross-winding and intrawinding capacitances, novel distributed models for electromagnetic analysis of Ethernet transformers are presented.}, keywords = {analysis;electromagnetic, area, capacitances;lumped, circuits;ethernet, circuits;local, cross-winding;distributed, modeling;equivalent, models;electromagnetic, networks;lumped, networks;transformer, parameter, parameters;novel, techniques;capacitance;equivalent, Testing, transformers;intrawinding, windings;transformers;}, isbn = {0018-9464}, doi = {10.1109/TMAG.2009.2033203}, author = {Bowen,D. and Mayergoyz, Issak D and Krafft,C.} } @article {18975, title = {Evolutionary dynamics of U12-type spliceosomal introns}, journal = {BMC Evolutionary Biology}, volume = {10}, year = {2010}, month = {2010/02/17/}, pages = {47 - 47}, abstract = {Many multicellular eukaryotes have two types of spliceosomes for the removal of introns from messenger RNA precursors. The major (U2) spliceosome processes the vast majority of introns, referred to as U2-type introns, while the minor (U12) spliceosome removes a small fraction (less than 0.5\%) of introns, referred to as U12-type introns. U12-type introns have distinct sequence elements and usually occur together in genes with U2-type introns. A phylogenetic distribution of U12-type introns shows that the minor splicing pathway appeared very early in eukaryotic evolution and has been lost repeatedly.}, isbn = {1471-2148}, doi = {10.1186/1471-2148-10-47}, url = {http://www.biomedcentral.com/1471-2148/10/47/abstract}, author = {Lin,Chiao-Feng and Mount, Stephen M. and Jarmo{\l}owski,Artur and Maka{\l}owski,Wojciech} } @inbook {12995, title = {Evolutionary framework for Lepidoptera model systems}, booktitle = {Genetics and Molecular Biology of LepidopteraGenetics and Molecular Biology of Lepidoptera}, year = {2010}, month = {2010///}, pages = {1 - 24}, publisher = {Taylor \& Francis}, organization = {Taylor \& Francis}, address = {Boca Raton}, abstract = {{\textquotedblleft}Model systems{\textquotedblright} are specific organisms upon which detailed studies have been conducted examining a fundamental biological question. If the studies are robust, their results can be extrapolated among an array of organisms that possess features in common with the subject organism. The true power of model systems lies in the ability to extrapolate these details across larger groups of organisms. In order to generalize these results, comparative studies are essential and require that model systems be placed into their evolutionary or phylogenetic context. This chapter examines model systems in the insect order Lepidoptera from the perspective of several different superfamilies. Historically, many species of Lepidoptera have been essential in the development of invaluable model systems in the fields of development biology, genetics, molecular biology, physiology, co-evolution, population dynamics, and ecology.}, author = {Roe,A. and Weller,S. and Baixeras,J. and Brown,J. W and Cummings, Michael P. and Davis,DR and Horak,M and Kawahara,A. Y and Mitter,C and Parr,C.S. and Regier,J. C and Rubinoff,D and Simonsen,TJ and Wahlberg,N and Zwick,A.}, editor = {Goldsmith,M and Marec,F} } @inbook {14196, title = {An Experimental Study of Color-Based Segmentation Algorithms Based on the Mean-Shift Concept}, booktitle = {Computer Vision {\textendash} ECCV 2010Computer Vision {\textendash} ECCV 2010}, series = {Lecture Notes in Computer Science}, volume = {6312}, year = {2010}, month = {2010///}, pages = {506 - 519}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {We point out a difference between the original mean-shift formulation of Fukunaga and Hostetler and the common variant in the computer vision community, namely whether the pairwise comparison is performed with the original or with the filtered image of the previous iteration. This leads to a new hybrid algorithm, called Color Mean Shift, that roughly speaking, treats color as Fukunaga{\textquoteright}s algorithm and spatial coordinates as Comaniciu{\textquoteright}s algorithm. We perform experiments to evaluate how different kernel functions and color spaces affect the final filtering and segmentation results, and the computational speed, using the Berkeley and Weizmann segmentation databases. We conclude that the new method gives better results than existing mean shift ones on four standard comparison measures ( improvement on RAND and BDE measures respectively for color images), with slightly higher running times ( ). Overall, the new method produces segmentations comparable in quality to the ones obtained with current state of the art segmentation algorithms.}, isbn = {978-3-642-15551-2}, url = {http://dx.doi.org/10.1007/978-3-642-15552-9_37}, author = {Bitsakos,K. and Ferm{\"u}ller, Cornelia and Aloimonos, J.}, editor = {Daniilidis,Kostas and Maragos,Petros and Paragios,Nikos} } @conference {18943, title = {Expresses-an-opinion-about: using corpus statistics in an information extraction approach to opinion mining}, series = {COLING {\textquoteright}10}, year = {2010}, month = {2010///}, pages = {1095 - 1103}, publisher = {Association for Computational Linguistics}, organization = {Association for Computational Linguistics}, address = {Stroudsburg, PA, USA}, abstract = {We present a technique for identifying the sources and targets of opinions without actually identifying the opinions themselves. We are able to use an information extraction approach that treats opinion mining as relation mining; we identify instances of a binary "expresses-an-opinion-about" relation. We find that we can classify source-target pairs as belonging to the relation at a performance level significantly higher than two relevant baselines. This technique is particularly suited to emerging approaches in corpus-based social science which focus on aggregating interactions between sources to determine their effects on socio-economically significant targets. Our application is the analysis of information technology (IT) innovations. This is an example of a more general problem where opinion is expressed using either sub- or supersets of expressive words found in newswire. We present an annotation scheme and an SVM-based technique that uses the local context as well as the corpus-wide frequency of a source-target pair as data to determine membership in "expresses-an-opinion-about". While the presence of conventional subjectivity keywords appears significant in the success of this technique, we are able to find the most domain-relevant keywords without sacrificing recall.}, url = {http://dl.acm.org/citation.cfm?id=1944566.1944692}, author = {Sayeed,Asad B. and Nguyen,Hieu C. and Meyer,Timothy J. and Weinberg, Amy} } @article {15478, title = {Generating Event Sequence-Based Test Cases Using GUI Runtime State Feedback}, journal = {Software Engineering, IEEE Transactions on}, volume = {36}, year = {2010}, month = {2010/02//jan}, pages = {81 - 95}, abstract = {This paper presents a fully automatic model-driven technique to generate test cases for graphical user interfaces (GUIs)-based applications. The technique uses feedback from the execution of a ??seed test suite,?? which is generated automatically using an existing structural event interaction graph model of the GUI. During its execution, the runtime effect of each GUI event on all other events pinpoints event semantic interaction (ESI) relationships, which are used to automatically generate new test cases. Two studies on eight applications demonstrate that the feedback-based technique 1) is able to significantly improve existing techniques and helps identify serious problems in the software and 2) the ESI relationships captured via GUI state yield test suites that most often detect more faults than their code, event, and event-interaction-coverage equivalent counterparts.}, keywords = {automatic model driven technique, event interaction coverage equivalent counterparts, event semantic interaction relationships, event sequence based test cases, Graphical user interfaces, GUI runtime state feedback, program testing, Software quality}, isbn = {0098-5589}, doi = {10.1109/TSE.2009.68}, author = {Xun Yuan and Memon, Atif M.} } @article {13779, title = {Generating Phrasal and Sentential Paraphrases: A Survey of Data-Driven Methods}, journal = {Computational Linguistics}, volume = {36}, year = {2010}, month = {2010///}, pages = {341 - 387}, abstract = {The task of paraphrasing is inherently familiar to speakers of all languages. Moreover, the task of automatically generating or extracting semantic equivalences for the various units of language{\textemdash}words, phrases, and sentences{\textemdash}is an important part of natural language processing (NLP) and is being increasingly employed to improve the performance of several NLP applications. In this article, we attempt to conduct a comprehensive and application-independent survey of data-driven phrasal and sentential paraphrase generation methods, while also conveying an appreciation for the importance and potential use of paraphrases in the field of NLP research. Recent work done in manual and automatic construction of paraphrase corpora is also examined. We also discuss the strategies used for evaluating paraphrase generation techniques and briefly explore some future trends in paraphrase generation.}, isbn = {0891-2017}, doi = {10.1162/coli_a_00002}, url = {http://dx.doi.org/10.1162/coli_a_00002}, author = {Madnani,Nitin and Dorr, Bonnie J} } @article {14584, title = {Genetic and Physiological Activation of Osmosensitive Gene Expression Mimics Transcriptional Signatures of Pathogen Infection in C. elegans}, journal = {PLoS ONEPLoS ONE}, volume = {5}, year = {2010}, month = {2010/02/02/}, pages = {e9010 - e9010}, abstract = {The soil-dwelling nematode C. elegans is a powerful system for comparative molecular analyses of environmental stress response mechanisms. Infection of worms with bacterial and fungal pathogens causes the activation of well-characterized innate immune transcriptional programs in pathogen-exposed hypodermal and intestinal tissues. However, the pathophysiological events that drive such transcriptional responses are not understood. Here, we show that infection-activated transcriptional responses are, in large part, recapitulated by either physiological or genetic activation of the osmotic stress response. Microarray profiling of wild type worms exposed to non-lethal hypertonicity identified a suite of genes that were also regulated by infection. Expression profiles of five different osmotic stress resistant (osr) mutants under isotonic conditions reiterated the wild type transcriptional response to osmotic stress and also showed substantial similarity to infection-induced gene expression under isotonic conditions. Computational, transgenic, and functional approaches revealed that two GATA transcription factors previously implicated in infection-induced transcriptional responses, elt-2 and elt-3, are also essential for coordinated tissue-specific activation of osmosensitive gene expression and promote survival under osmotically stressful conditions. Together, our data suggest infection and osmotic adaptation share previously unappreciated transcriptional similarities which might be controlled via regulation of tissue-specific GATA transcription factors.}, doi = {10.1371/journal.pone.0009010}, url = {http://dx.doi.org/10.1371/journal.pone.0009010}, author = {Rohlfing,Anne-Katrin and Miteva,Yana and Hannenhalli, Sridhar and Lamitina,Todd} } @conference {13262, title = {A geometric approach to curvature estimation on triangulated 3D shapes}, booktitle = {Int. Conf. on Computer Graphics Theory and Applications (GRAPP)}, year = {2010}, month = {2010///}, pages = {90 - 95}, abstract = {We present a geometric approach to define discrete normal, principal, Gaussian and mean curvatures, thatwe call Ccurvature. Our approach is based on the notion of concentrated curvature of a polygonal line and a simulation of rotation of the normal plane of the surface at a point. The advantages of our approach is its simplicity and its natural meaning. A comparison with widely-used discrete methods is presented. }, author = {Mesmoudi,M. M. and De Floriani, Leila and Magillo,P.} } @conference {18341, title = {GUI testing using computer vision}, booktitle = {Proceedings of the 28th international conference on Human factors in computing systems}, series = {CHI {\textquoteright}10}, year = {2010}, month = {2010///}, pages = {1535 - 1544}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Testing a GUI{\textquoteright}s visual behavior typically requires human testers to interact with the GUI and to observe whether the expected results of interaction are presented. This paper presents a new approach to GUI testing using computer vision for testers to automate their tasks. Testers can write a visual test script that uses images to specify which GUI components to interact with and what visual feedback to be observed. Testers can also generate visual test scripts by demonstration. By recording both input events and screen images, it is possible to extract the images of components interacted with and the visual feedback seen by the demonstrator, and generate a visual test script automatically. We show that a variety of GUI behavior can be tested using this approach. Also, we show how this approach can facilitate good testing practices such as unit testing, regression testing, and test-driven development.}, keywords = {gui automation, GUI testing, test by demonstration}, isbn = {978-1-60558-929-9}, doi = {10.1145/1753326.1753555}, url = {http://doi.acm.org/10.1145/1753326.1753555}, author = {Chang,Tsung-Hsiang and Tom Yeh and Miller,Robert C.} } @article {12875, title = {Identification of Pathogenic Vibrio Species by Multilocus PCR-Electrospray Ionization Mass Spectrometry and Its Application to Aquatic Environments of the Former Soviet Republic of Georgia}, journal = {Applied and Environmental MicrobiologyAppl. Environ. Microbiol.}, volume = {76}, year = {2010}, month = {2010/03/15/}, pages = {1996 - 2001}, abstract = {The Ibis T5000 is a novel diagnostic platform that couples PCR and mass spectrometry. In this study, we developed an assay that can identify all known pathogenic Vibrio species and field-tested it using natural water samples from both freshwater lakes and the Georgian coastal zone of the Black Sea. Of the 278 total water samples screened, 9 different Vibrio species were detected, 114 (41\%) samples were positive for V. cholerae, and 5 (0.8\%) samples were positive for the cholera toxin A gene (ctxA). All ctxA-positive samples were from two freshwater lakes, and no ctxA-positive samples from any of the Black Sea sites were detected.}, isbn = {0099-2240, 1098-5336}, doi = {10.1128/AEM.01919-09}, url = {http://aem.asm.org/content/76/6/1996}, author = {Whitehouse,Chris A. and Baldwin,Carson and Sampath,Rangarajan and Blyn,Lawrence B. and Melton,Rachael and Li,Feng and Hall,Thomas A. and Harpin,Vanessa and Matthews,Heather and Tediashvili,Marina and Jaiani,Ekaterina and Kokashvili,Tamar and Janelidze,Nino and Grim,Christopher and Rita R Colwell and Huq,Anwar} } @conference {12429, title = {Image classification of vascular smooth muscle cells}, booktitle = {Proceedings of the 1st ACM International Health Informatics Symposium}, series = {IHI {\textquoteright}10}, year = {2010}, month = {2010///}, pages = {484 - 486}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, keywords = {cell biology, digital image processing, machine learning}, isbn = {978-1-4503-0030-8}, doi = {10.1145/1882992.1883068}, url = {http://doi.acm.org/10.1145/1882992.1883068}, author = {Grasso,Michael A. and Mokashi,Ronil and Dalvi,Darshana and Cardone, Antonio and Dima,Alden A. and Bhadriraju,Kiran and Plant,Anne L. and Brady,Mary and Yesha,Yaacov and Yesha,Yelena} } @article {16052, title = {Interactive information visualization for exploring and querying electronic health records: A systematic review}, year = {2010}, month = {2010///}, institution = {Human-Computer Interaction Lab, University of Maryland}, abstract = {To overcome the complexity and scale of making medical decisions based on electronic health records (EHRs) a variety of visual methods have been proposed. This paper surveys twelve state-of-the-art information visualization systems described in the scientific literature and compares them based on a set of carefully selected criteria. It aims to systematically examine the systems{\textquoteright} strengths and weaknesses to inform future information visualization designs.We select twelve state-of-the-art information visualization systems from information visualization, medical information systems and human-computer interaction conferences and journals. We compare the systems using the following criteria: (1) data types covered, (2) multivariate analysis support, (3) number of patients records used (one or many), and (4) user intents addressed. The review describes the twelve systems in detail and evaluates the systems using the aforementioned criteria. We discuss how the systems differ in their features and highlight how these differences are related to their design and affect the user intent model. Examples of findings include: (1) most systems handle numerical or categorical data but not both, (2) most systems are specifically designed for looking at a single patient or multiple patients but not both, (3) most systems utilize horizontal time lines to represent time, (4) only systems that handle multiple patient records have good support for Filter, and (5) some specific user intents (e.g. the Encode and Connect intents) are rarely addressed. Based on our review results, we believe that effective information visualization can facilitate analysis of patient records, and we encourage the information visualization community to study the application of their systems and conduct more in depth evaluations. We identify potential future research topics in interactive support for data abstraction and medical tasks that involve looking at a single or multiple records. Finally, we propose to create a repository for data and tasks so benchmarks can be established for both academic and commercial patient record visualization systems. }, author = {Rind,A. and Wang,T. D and Aigner,W. and Miksh,S. and Wongsuphasawat,K. and Plaisant, Catherine and Shneiderman, Ben} } @article {13798, title = {Interlingual Annotation of Parallel Text Corpora: A New Framework for Annotation and Evaluation}, journal = {Natural Language Engineering}, volume = {16}, year = {2010}, month = {2010///}, pages = {197 - 243}, abstract = {This paper focuses on an important step in the creation of a system of meaning representation and the development of semantically annotated parallel corpora, for use in applications such as machine translation, question answering, text summarization, and information retrieval. The work described below constitutes the first effort of any kind to annotate multiple translations of foreign-language texts with interlingual content. Three levels of representation are introduced: deep syntactic dependencies (IL0), intermediate semantic representations (IL1), and a normalized representation that unifies conversives, nonliteral language, and paraphrase (IL2). The resulting annotated, multilingually induced, parallel corpora will be useful as an empirical basis for a wide range of research, including the development and evaluation of interlingual NLP systems and paraphrase-extraction systems as well as a host of other research and development efforts in theoretical and applied linguistics, foreign language pedagogy, translation studies, and other related disciplines.}, doi = {10.1017/S1351324910000070}, author = {Dorr, Bonnie J and Passonneau,Rebecca J. and Farwell,David and Green,Rebecca and Habash,Nizar and Helmreich,Stephen and Hovy,Eduard and Levin,Lori and Miller,Keith J. and Mitamura,Teruko and Rambow,Owen and Siddharthan,Advaith} } @article {15440, title = {Iterative execution-feedback model-directed GUI testing}, journal = {Information and Software Technology}, volume = {52}, year = {2010}, month = {2010/05//}, pages = {559 - 575}, abstract = {Current fully automatic model-based test-case generation techniques for GUIs employ a static model. Therefore they are unable to leverage certain state-based relationships between GUI events (e.g., one enables the other, one alters the other{\textquoteright}s execution) that are revealed at run-time and non-trivial to infer statically. We present ALT {\textendash} a new technique to generate GUI test cases in batches. Because of its {\textquotedblleft}alternating{\textquotedblright} nature, ALT enhances the next batch by using GUI run-time information from the current batch. An empirical study on four fielded GUI-based applications demonstrated that ALT was able to detect new 4- and 5-way GUI interaction faults; in contrast, previous techniques, due to their requirement of too many test cases, were unable to even test 4- and 5-way GUI interactions.}, keywords = {event-driven software, event-flow graphs, GUI testing, model-based testing, test-case generation}, isbn = {0950-5849}, doi = {10.1016/j.infsof.2009.11.009}, url = {http://www.sciencedirect.com/science/article/pii/S0950584909002092}, author = {Xun Yuan and Memon, Atif M.} } @conference {18578, title = {Joint analysis of network incidents and intradomain routing changes}, booktitle = {Network and Service Management (CNSM), 2010 International Conference on}, year = {2010}, month = {2010/10//}, pages = {198 - 205}, abstract = {This paper studies how intradomain routing instability relates to events in network trouble tickets for two networks: a VPN provider and the Internet2 backbone network. Our goal in performing this joint analysis of routing and trouble tickets is to better understand the likely underlying causes of intradomain routing instability. We develop a method to correlate trouble tickets with instability events and find that, although unplanned events last longer than scheduled maintenance, there is no single underlying cause for most instability, and that these causes differ across networks. In comparison to a similar study from Labovitz et al. from ten years ago, we find that, while certain causes of instability such as maintenance and circuit problems remain significant, power issues have become much less prevalent, and software-related problems have become more common.}, keywords = {correlation method, Internet, Internet2 backbone network, intradomain routing instability, network maintenance, network routing joint analysis, telecommunication network routing, Virtual private networks, VPN provider}, doi = {10.1109/CNSM.2010.5691306}, author = {Medem,A. and Teixeira,R. and Feamster, Nick and Meulle,M.} } @article {12502, title = {Large-scale matrix factorization with missing data under additional constraints}, journal = {Advances in Neural Information Processing Systems}, volume = {23}, year = {2010}, month = {2010///}, pages = {1642 - 1650}, abstract = {Matrix factorization in the presence of missing data is at the core of many com-puter vision problems such as structure from motion (SfM), non-rigid SfM and photometric stereo. We formulate the problem of matrix factorization with miss- ing data as a low-rank semidefinite program (LRSDP) with the advantage that: 1) an efficient quasi-Newton implementation of the LRSDP enables us to solve large-scale factorization problems, and 2) additional constraints such as ortho- normality, required in orthographic SfM, can be directly incorporated in the new formulation. Our empirical evaluations suggest that, under the conditions of ma- trix completion theory, the proposed algorithm finds the optimal solution, and also requires fewer observations compared to the current state-of-the-art algorithms. We further demonstrate the effectiveness of the proposed algorithm in solving the affine SfM problem, non-rigid SfM and photometric stereo problems. }, author = {Mitra, K. and Sheorey,S. and Chellapa, Rama} } @conference {15310, title = {Learning to efficiently rank}, booktitle = {Proceedings of the 33rd international ACM SIGIR conference on Research and development in information retrieval}, series = {SIGIR {\textquoteright}10}, year = {2010}, month = {2010///}, pages = {138 - 145}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {It has been shown that learning to rank approaches are capable of learning highly effective ranking functions. However, these approaches have mostly ignored the important issue of efficiency. Given that both efficiency and effectiveness are important for real search engines, models that are optimized for effectiveness may not meet the strict efficiency requirements necessary to deploy in a production environment. In this work, we present a unified framework for jointly optimizing effectiveness and efficiency. We propose new metrics that capture the tradeoff between these two competing forces and devise a strategy for automatically learning models that directly optimize the tradeoff metrics. Experiments indicate that models learned in this way provide a good balance between retrieval effectiveness and efficiency. With specific loss functions, learned models converge to familiar existing ones, which demonstrates the generality of our framework. Finally, we show that our approach naturally leads to a reduction in the variance of query execution times, which is important for query load balancing and user satisfaction.}, keywords = {effectiveness and efficiency tradeoff, Learning to rank, Linear Models}, isbn = {978-1-4503-0153-4}, doi = {10.1145/1835449.1835475}, url = {http://doi.acm.org/10.1145/1835449.1835475}, author = {Wang,Lidan and Jimmy Lin and Metzler,Donald} } @article {12144, title = {Linking Software Development and Business Strategy Through Measurement}, journal = {Computer}, volume = {43}, year = {2010}, month = {2010/04//}, pages = {57 - 65}, abstract = {The GQM+Strategies approach extends the goal/question/metric paradigm for measuring the success or failure of goals and strategies, adding enterprise-wide support for determining action on the basis of measurement results. An organization can thus integrate its measurement program across all levels.}, keywords = {approach;business, aspects;software, development;organisational, engineering;, GQM+Strategies, program;software, strategy;enterprise, support;measurement, wide}, isbn = {0018-9162}, doi = {10.1109/MC.2010.108}, author = {Basili, Victor R. and Lindvall,M. and Regardie,M. and Seaman,C. and Heidrich,J. and Munch,J. and Rombach,D. and Trendowicz,A.} } @conference {12223, title = {Maranello: practical partial packet recovery for 802.11}, booktitle = {Proceedings of the 7th USENIX conference on Networked systems design and implementation}, series = {NSDI{\textquoteright}10}, year = {2010}, month = {2010///}, pages = {14 - 14}, publisher = {USENIX Association}, organization = {USENIX Association}, address = {Berkeley, CA, USA}, abstract = {Partial packet recovery protocols attempt to repair corrupted packets instead of retransmitting them in their entirety. Recent approaches have used physical layer confidence estimates or additional error detection codes embedded in each transmission to identify corrupt bits, or have applied forward error correction to repair without such explicit knowledge. In contrast to these approaches, our goal is a practical design that simultaneously: (a) requires no extra bits in correct packets, (b) reduces recovery latency, except in rare instances, (c) remains compatible with existing 802.11 devices by obeying timing and backoff standards, and (d) can be incrementally deployed on widely available access points and wireless cards. In this paper, we design, implement, and evaluate Maranello, a novel partial packet recovery mechanism for 802.11. In Maranello, the receiver computes checksums over blocks in corrupt packets and bundles these checksums into a negative acknowledgment sent when the sender expects to receive an acknowledgment. The sender then retransmits only those blocks for which the checksum is incorrect, and repeats this partial retransmission until it receives an acknowledgment. Successful transmissions are not burdened by additional bits and the receiver needs not infer which bits were corrupted. We implemented Maranello using OpenFWWF (open source firmware for Broadcom wireless cards) and deployed it in a small testbed. We compare Maranello to alternative recovery protocols using a trace-driven simulation and to 802.11 using a live implementation under various channel conditions. To our knowledge, Maranello is the first partial packet recovery design to be implemented in commonly available firmware.}, url = {http://dl.acm.org/citation.cfm?id=1855711.1855725}, author = {Han,Bo and Schulman,Aaron and Gringoli,Francesco and Spring, Neil and Bhattacharjee, Bobby and Nava,Lorenzo and Ji,Lusheng and Lee,Seungjoon and Miller,Robert} } @conference {12405, title = {Measuring transitivity using untrained annotators}, booktitle = {Proceedings of the NAACL HLT 2010 Workshop on Creating Speech and Language Data with Amazon{\textquoteright}s Mechanical Turk}, series = {CSLDAMT {\textquoteright}10}, year = {2010}, month = {2010///}, pages = {188 - 194}, publisher = {Association for Computational Linguistics}, organization = {Association for Computational Linguistics}, address = {Stroudsburg, PA, USA}, abstract = {Hopper and Thompson (1980) defined a multi-axis theory of transitivity that goes beyond simple syntactic transitivity and captures how much "action" takes place in a sentence. Detecting these features requires a deep understanding of lexical semantics and real-world pragmatics. We propose two general approaches for creating a corpus of sentences labeled with respect to the Hopper-Thompson transitivity schema using Amazon Mechanical Turk. Both approaches assume no existing resources and incorporate all necessary annotation into a single system; this is done to allow for future generalization to other languages. The first task attempts to use language-neutral videos to elicit human-composed sentences with specified transitivity attributes. The second task uses an iterative process to first label the actors and objects in sentences and then annotate the sentences{\textquoteright} transitivity. We examine the success of these techniques and perform a preliminary classification of the transitivity of held-out data.}, url = {http://dl.acm.org/citation.cfm?id=1866696.1866726}, author = {Madnani,Nitin and Jordan Boyd-Graber and Resnik, Philip} } @article {18238, title = {Method for concealing data in curves of an image}, volume = {:~11/221,727}, year = {2010}, month = {2010/10/19/}, abstract = {A method of concealing data in images imperceptibly alters curves therein, such as through adding a value representing the data to be hidden to each of a number of B-spline control points representing the original curve. The altered control points characterize the imperceptibly altered curve, which replaces the original curve in the image. The altered control points may be later extracted from the image and compared with the original control points to determine the hidden value. Prudent selection of the values altering the control points as well as an iterative alignment-minimization algorithm in the detection process provides protection against numerous techniques for preventing the hidden values from being recovered.}, url = {http://www.google.com/patents?id=USnYAAAAEBAJ}, author = {M. Wu and Gou,Hongmei}, editor = {University of Maryland} } @article {18239, title = {Method for fingerprinting multimedia content}, volume = {11/326,313}, year = {2010}, month = {2010/10/12/}, abstract = {To identify participants in collusion directed to altering a digital fingerprint embedded in multimedia content, an ECC based fingerprinting technique establishes a code symbol for each of a plurality of segments of digital data forming the multimedia content. The code symbols are concatenated to form a fingerprint signal, which is subdivided into a plurality of subsegments for each segment in the digital data. The subsegments are permuted and embedded into the digital data. When a suspicious copy of the multimedia content is discovered, the permuted fingerprint signal is extracted from the content and inversely permuted to form a test fingerprint. The identity of one of the colluders is determined by correlation with characteristics of the codeword originally assigned to the user. The determination of identity may be enhanced by the addition of group data embedded as an additional fingerprint in the digital data. Joint consideration of coding and embedding provide benefits over...}, url = {http://www.google.com/patents?id=GXnXAAAAEBAJ}, author = {He,Shan and M. Wu}, editor = {University of Maryland} } @article {13951, title = {Method for measurement of head related transfer functions}, volume = {10/702,465}, year = {2010}, month = {2010/05/18/}, abstract = {Head Related Transfer Functions (HRTFs) of an individual are measured in rapid fashion in an arrangement where a sound source is positioned in the individual{\textquoteright}s ear channel, while microphones are arranged in the microphone array enveloping the individual{\textquoteright}s head. The pressure waves generated by the sounds emanating from the sound source reach the microphones and are converted into corresponding electrical signals which are further processed in a processing system to extract HRTFs, which may then be used to synthesize a spatial audio scene. The acoustic field generated by the sounds from the sound source can be evaluated at any desired point inside or outside the microphone array.}, url = {http://www.google.com/patents?id=JHrQAAAAEBAJ}, author = {Duraiswami, Ramani and Gumerov, Nail A.}, editor = {University of Maryland} } @conference {13301, title = {Modeling and generalization of discrete Morse terrain decompositions}, booktitle = {Proc. 20th Int. Conf. on Pattern Recognition, ICPR}, volume = {10}, year = {2010}, month = {2010///}, pages = {999 - 1002}, abstract = {We address the problem of morphological analysis ofreal terrains. We describe a morphological model for a terrain by considering extensions of Morse theory to the discrete case. We propose a two-level model of the morphology of a terrain based on a graph joining the critical points of the terrain through integral lines. We present a new set of generalization operators specific for discrete piece-wise linear terrain models, which are used to reduce noise and the size of the morphological representation. We show results of our approach on real terrains. }, author = {De Floriani, Leila and Magillo,P. and Vitali,M.} } @inbook {15770, title = {Modelling Type 1a Supernova Light Curves}, booktitle = {Exponential Data Fitting and Its ApplicationsExponential Data Fitting and Its Applications}, year = {2010}, month = {2010///}, pages = {169 - 186}, publisher = {Bentham Science Publishers Ltd.}, organization = {Bentham Science Publishers Ltd.}, url = {http://www.bentham.org/ebooks/9781608050482/http://www.bentham.org/ebooks/9781608050482/}, author = {Rust,Bert W. and O{\textquoteright}Leary, Dianne P. and Mullen,Katharine M.}, editor = {Pereyra,V. and Scherer,G.} } @conference {13313, title = {Multiresolution analysis of 3D images based on discrete distortion}, booktitle = {International Conference on Pattern Recognition (ICPR)}, year = {2010}, month = {2010///}, pages = {4093 - 4096}, abstract = {We consider a model of a 3D image obtained bydiscretizing it into a multiresolution tetrahedral mesh known as a hierarchy of diamonds. This model enables us to extract crack-free approximations of the 3D image at any uniform or variable resolution, thus reducing the size of the data set without reducing the accuracy. A 3D intensity image is a scalar field (the intensity field) defined at the vertices of a 3D regular grid and thus the graph of the image is a hypersurface in R4. We measure the discrete distortion, a generalization of the notion of curvature, of the transformation which maps the tetrahedralized 3D grid onto its graph in R4. We evaluate the use of a hierarchy of diamonds to analyze properties of a 3D image, such as its discrete distortion, directly on lower resolution approximations. Our results indicate that distortion-guided extractions focus the resolution of approximated images on the salient features of the intensity image. }, author = {Weiss,K. and De Floriani, Leila and Mesmoudi,M. M.} } @conference {13315, title = {Multiresolution morse triangulations}, booktitle = {Proceedings of the 14th ACM Symposium on Solid and Physical Modeling}, series = {SPM {\textquoteright}10}, year = {2010}, month = {2010///}, pages = {183 - 188}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {We address the problem of representing the geometry and the morphology of a triangulated surface endowed with a scalar field in a combined geometric and topological multiresolution model. The model, called a Multiresolution Morse Triangulation (MMT), is composed of a multiresolution triangle mesh, and of a multiresolution Morse complex describing the morphology of the field. The MMT is built through a combined morphological and geometrical generalization, and supports queries to extract consistent geometrical and morphological representations of the field at both uniform and variable resolutions.}, isbn = {978-1-60558-984-8}, doi = {10.1145/1839778.1839806}, url = {http://doi.acm.org/10.1145/1839778.1839806}, author = {Danovaro,Emanuele and De Floriani, Leila and Magillo,Paola and Vitali,Maria} } @inbook {15597, title = {New Approaches to Robust, Point-Based Image Registration}, booktitle = {Image Registration for Remote SensingImage Registration for Remote Sensing}, year = {2010}, month = {2010///}, publisher = {Cambridge University Press}, organization = {Cambridge University Press}, abstract = {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{\textendash}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{\textquoteright}s efficacy by considering images involving different sensors and different spectral bands, both in a traditional framework and in a multiresolution framework. }, isbn = {9780521516112}, author = {Mount, Dave and Netanyahu,N. S and Ratanasanya,S.}, editor = {LeMoigne,Jacqueline and Netanyahu,Nathan S. and Eastman,Roger D.} } @conference {12481, title = {Object Dependent Manifold Priors for Image Deconvolution}, booktitle = {Digital Image Processing and Analysis}, series = {OSA Technical Digest (CD)}, year = {2010}, month = {2010/06/07/}, pages = {DMC2 - DMC2}, publisher = {Optical Society of America}, organization = {Optical Society of America}, abstract = {In this paper we propose a manifold based deconvolution algorithm by estimating a manifold from a set of natural images that exploits the availability of the sample class data for regularizing the deblurring problem.}, keywords = {Deconvolution, IMAGE PROCESSING, Inverse problems}, url = {http://www.opticsinfobase.org/abstract.cfm?URI=DIPA-2010-DMC2}, author = {Ni,Jie and Turaga,Pavan and M.Patel,Vishal and Chellapa, Rama} } @inbook {19604, title = {Optimal Authenticated Data Structures with Multilinear Forms}, booktitle = {Pairing-Based Cryptography - Pairing 2010}, series = {Lecture Notes in Computer Science}, year = {2010}, month = {2010/01/01/}, pages = {246 - 264}, publisher = {Springer Berlin Heidelberg}, organization = {Springer Berlin Heidelberg}, abstract = {Cloud computing and cloud storage are becoming increasingly prevalent. In this paradigm, clients outsource their data and computations to third-party service providers. Data integrity in the cloud therefore becomes an important factor for the functionality of these web services.Authenticated data structures, implemented with various cryptographic primitives, have been widely studied as a means of providing efficient solutions to data integrity problems (e.g., Merkle trees). In this paper, we introduce a new authenticated dictionary data structure that employs multilinear forms, a cryptographic primitive proposed by Silverberg and Boneh in 2003 [10], the construction of which, however, remains an open problem to date. Our authenticated dictionary is optimal, that is, it does not add any extra asymptotic cost to the plain dictionary data structure, yielding proofs of constant size, i.e., asymptotically equal to the size of the answer, while maintaining other relevant complexities logarithmic. Instead, solutions based on cryptographic hashing (e.g., Merkle trees) require proofs of logarithmic size [40]. Because multilinear forms are not known to exist yet, our result can be viewed from a different angle: if one could prove that optimal authenticated dictionaries cannot exist in the computational model, irrespectively of cryptographic primitives, then our solution would imply that cryptographically interesting multilinear form generators cannot exist as well (i.e., it can be viewed as a reduction). Thus, we provide an alternative avenue towards proving the nonexistence of multilinear form generators in the context of general lower bounds for authenticated data structures [40] and for memory checking [18], a model similar to the authenticated data structures model.}, keywords = {Algorithm Analysis and Problem Complexity, authenticated dictionary, Coding and Information Theory, Computer Communication Networks, Data Encryption, Discrete Mathematics in Computer Science, multilinear forms, Systems and Data Security}, isbn = {978-3-642-17454-4, 978-3-642-17455-1}, url = {http://link.springer.com/chapter/10.1007/978-3-642-17455-1_16}, author = {Charalampos Papamanthou and Tamassia, Roberto and Triandopoulos, Nikos}, editor = {Joye, Marc and Miyaji, Atsuko and Otsuka, Akira} } @article {12466, title = {PADS: A Probabilistic Activity Detection Framework for Video Data}, journal = {Pattern Analysis and Machine Intelligence, IEEE Transactions on}, volume = {32}, year = {2010}, month = {2010/12//}, pages = {2246 - 2261}, abstract = {There is now a growing need to identify various kinds of activities that occur in videos. In this paper, we first present a logical language called Probabilistic Activity Description Language (PADL) in which users can specify activities of interest. We then develop a probabilistic framework which assigns to any subvideo of a given video sequence a probability that the subvideo contains the given activity, and we finally develop two fast algorithms to detect activities within this framework. OffPad finds all minimal segments of a video that contain a given activity with a probability exceeding a given threshold. In contrast, the OnPad algorithm examines a video during playout (rather than afterwards as OffPad does) and computes the probability that a given activity is occurring (even if the activity is only partially complete). Our prototype Probabilistic Activity Detection System (PADS) implements the framework and the two algorithms, building on top of existing image processing algorithms. We have conducted detailed experiments and compared our approach to four different approaches presented in the literature. We show that-for complex activity definitions-our approach outperforms all the other approaches.}, keywords = {Automated;Programming Languages;Video Recording;, Computer-Assisted;Models, PADL;PADS;image processing algorithms;offPad algorithm;onPad algorithm;probabilistic activity description language;probabilistic activity detection framework;video data;video sequence;image sequences;object detection;probability;video surveillance;Algorit, Statistical;Movement;Pattern Recognition}, isbn = {0162-8828}, doi = {10.1109/TPAMI.2010.33}, author = {Albanese, M. and Chellapa, Rama and Cuntoor, N. and Moscato, V. and Picariello, A. and V.S. Subrahmanian and Udrea,O.} } @article {14466, title = {Probabilistic similarity logic}, journal = {Proceedings of the Conference on Uncertainty in Artificial Intelligence}, year = {2010}, month = {2010///}, abstract = {Many machine learning applications require theability to learn from and reason about noisy multi-relational data. To address this, several ef- fective representations have been developed that provide both a language for expressing the struc- tural regularities of a domain, and principled sup- port for probabilistic inference. In addition to these two aspects, however, many applications also involve a third aspect{\textendash}the need to reason about similarities{\textendash}which has not been directly supported in existing frameworks. This paper introduces probabilistic similarity logic (PSL), a general-purpose framework for joint reason- ing about similarity in relational domains that incorporates probabilistic reasoning about sim- ilarities and relational structure in a principled way. PSL can integrate any existing domain- specific similarity measures and also supports reasoning about similarities between sets of en- tities. We provide efficient inference and learn- ing techniques for PSL and demonstrate its ef- fectiveness both in common relational tasks and in settings that require reasoning about similarity. }, author = {Br{\"o}cheler,M. and Mihalkova,L. and Getoor, Lise} } @article {19591, title = {Pushdown Control-Flow Analysis of Higher-Order Programs}, journal = {arXiv:1007.4268 [cs]}, year = {2010}, note = {Comment: The 2010 Workshop on Scheme and Functional Programming}, month = {2010/07/24/}, abstract = {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{\textquoteright}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.}, keywords = {Computer Science - Programming Languages, F.3.2, F.4.1}, url = {http://arxiv.org/abs/1007.4268}, author = {Earl, Christopher and Might, Matthew and David Van Horn} } @conference {13843, title = {Putting the user in the loop: interactive Maximal Marginal Relevance for query-focused summarization}, booktitle = {Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics}, series = {HLT {\textquoteright}10}, year = {2010}, month = {2010///}, pages = {305 - 308}, publisher = {Association for Computational Linguistics}, organization = {Association for Computational Linguistics}, address = {Stroudsburg, PA, USA}, abstract = {This work represents an initial attempt to move beyond "single-shot" summarization to interactive summarization. We present an extension to the classic Maximal Marginal Relevance (MMR) algorithm that places a user "in the loop" to assist in candidate selection. Experiments in the complex interactive Question Answering (ciQA) task at TREC 2007 show that interactively-constructed responses are significantly higher in quality than automatically-generated ones. This novel algorithm provides a starting point for future work on interactive summarization.}, isbn = {1-932432-65-5}, url = {http://dl.acm.org/citation.cfm?id=1857999.1858040}, author = {Jimmy Lin and Madnani,Nitin and Dorr, Bonnie J} } @conference {15302, title = {Ranking under temporal constraints}, booktitle = {Proceedings of the 19th ACM international conference on Information and knowledge management}, series = {CIKM {\textquoteright}10}, year = {2010}, month = {2010///}, pages = {79 - 88}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {This paper introduces the notion of temporally constrained ranked retrieval, which, given a query and a time constraint, produces the best possible ranked list within the specified time limit. Naturally, more time should translate into better results, but the ranking algorithm should always produce some results. This property is desirable from a number of perspectives: to cope with diverse users and information needs, as well as to better manage system load and variance in query execution times. We propose two temporally constrained ranking algorithms based on a class of probabilistic prediction models that can naturally incorporate efficiency constraints: one that makes independent feature selection decisions, and the other that makes joint feature selection decisions. Experiments on three different test collections show that both ranking algorithms are able to satisfy imposed time constraints, although the joint model outperforms the independent model in being able to deliver more effective results, especially under tight time constraints, due to its ability to capture feature dependencies.}, keywords = {efficiency, Learning to rank, Linear Models}, isbn = {978-1-4503-0099-5}, doi = {10.1145/1871437.1871452}, url = {http://doi.acm.org/10.1145/1871437.1871452}, author = {Wang,Lidan and Metzler,Donald and Jimmy Lin} } @article {15667, title = {Realistic Compression of Kinetic Sensor Data}, volume = {CS-TR-4959}, year = {2010}, month = {2010/06/06/}, institution = {Department of Computer Science, University of Maryland, College Park}, abstract = {We introduce a realistic analysis for a framework for storing andprocessing kinetic data observed by sensor networks. The massive data sets generated by these networks motivates a significant need for compression. We are interested in the kinetic data generated by a finite set of objects moving through space. Our previously introduced framework and accompanying compression algorithm assumed a given set of sensors, each of which continuously observes these moving objects in its surrounding region. The model relies purely on sensor observations; it allows points to move freely and requires no advance notification of motion plans. Here, we extend the initial theoretical analysis of this framework and compression scheme to a more realistic setting. We extend the current understanding of empirical entropy to introduce definitions for joint empirical entropy, conditional empirical entropy, and empirical independence. We also introduce a notion of limited independence between the outputs of the sensors in the system. We show that, even with this notion of limited independence and in both the statistical and empirical settings, the previously introduced compression algorithm achieves an encoding size on the order of the optimal. }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu//handle/1903/10114}, author = {Friedler,Sorelle A. and Mount, Dave} } @conference {15493, title = {Repairing GUI Test Suites Using a Genetic Algorithm}, booktitle = {Software Testing, Verification and Validation (ICST), 2010 Third International Conference on}, year = {2010}, month = {2010/04//}, pages = {245 - 254}, abstract = {Recent advances in automated functional testing of Graphical User Interfaces (GUIs) rely on deriving graph models that approximate all possible sequences of events that may be executed on the GUI, and then use the graphs to generate test cases (event sequences) that achieve a specified coverage goal. However, because these models are only approximations of the actual event flows, the generated test cases may suffer from problems of infeasibility, i.e., some events may not be available for execution causing the test case to terminate prematurely. In this paper we develop a method to automatically repair GUI test suites, generating new test cases that are feasible. We use a genetic algorithm to evolve new test cases that increase our test suite{\textquoteright}s coverage while avoiding infeasible sequences. We experiment with this algorithm on a set of synthetic programs containing different types of constraints and for test sequences of varying lengths. Our results suggest that we can generate new test cases to cover most of the feasible coverage and that the genetic algorithm outperforms a random algorithm trying to achieve the same goal in almost all cases.}, keywords = {automated functional testing, genetic algorithm, Genetic algorithms, graph model, graphical user interface, Graphical user interfaces, GUI test suite, program testing, random algorithm, synthetic program, test case}, doi = {10.1109/ICST.2010.39}, author = {Huang,Si and Cohen,M. B and Memon, Atif M.} } @conference {19593, title = {Resolving and Exploiting the k-CFA Paradox: Illuminating Functional vs. Object-oriented Program Analysis}, booktitle = {PLDI {\textquoteright}10 Proceedings of the 2010 ACM SIGPLAN Conference on Programming Language Design and Implementation}, series = {PLDI {\textquoteright}10}, year = {2010}, month = {2010///}, pages = {305 - 315}, publisher = {ACM}, organization = {ACM}, abstract = {Low-level program analysis is a fundamental problem, taking the shape of "flow analysis" in functional languages and "points-to" analysis in imperative and object-oriented languages. Despite the similarities, the vocabulary and results in the two communities remain largely distinct, with limited cross-understanding. One of the few links is Shivers{\textquoteright}s k-CFA work, which has advanced the concept of "context-sensitive analysis" and is widely known in both communities. Recent results indicate that the relationship between the functional and object-oriented incarnations of k-CFA is not as well understood as thought. Van Horn and Mairson proved k-CFA for k >= 1 to be EXPTIME-complete; hence, no polynomial-time algorithm can exist. Yet, there are several polynomial-time formulations of context-sensitive points-to analyses in object-oriented languages. Thus, it seems that functional k-CFA may actually be a profoundly different analysis from object-oriented k-CFA. We resolve this paradox by showing that the exact same specification of k-CFA is polynomial-time for object-oriented languages yet exponential-time for functional ones: objects and closures are subtly different, in a way that interacts crucially with context-sensitivity and complexity. This illumination leads to an immediate payoff: by projecting the object-oriented treatment of objects onto closures, we derive a polynomial-time hierarchy of context-sensitive CFAs for functional programs.}, keywords = {control-flow analysis, functional, k-cfa, m-cfa, object-oriented, pointer analysis, static analysis}, isbn = {978-1-4503-0019-3}, url = {http://doi.acm.org/10.1145/1806596.1806631}, author = {Might, Matthew and Smaragdakis, Yannis and David Van Horn} } @conference {12492, title = {Robust regression using sparse learning for high dimensional parameter estimation problems}, booktitle = {Acoustics Speech and Signal Processing (ICASSP), 2010 IEEE International Conference on}, year = {2010}, month = {2010/03//}, pages = {3846 - 3849}, abstract = {Algorithms such as Least Median of Squares (LMedS) and Random Sample Consensus (RANSAC) have been very successful for low-dimensional robust regression problems. However, the combinatorial nature of these algorithms makes them practically unusable for high-dimensional applications. In this paper, we introduce algorithms that have cubic time complexity in the dimension of the problem, which make them computationally efficient for high-dimensional problems. We formulate the robust regression problem by projecting the dependent variable onto the null space of the independent variables which receives significant contributions only from the outliers. We then identify the outliers using sparse representation/learning based algorithms. Under certain conditions, that follow from the theory of sparse representation, these polynomial algorithms can accurately solve the robust regression problem which is, in general, a combinatorial problem. We present experimental results that demonstrate the efficacy of the proposed algorithms. We also analyze the intrinsic parameter space of robust regression and identify an efficient and accurate class of algorithms for different operating conditions. An application to facial age estimation is presented.}, keywords = {algorithm;random, analysis;, combinatorial, complexity;least, complexity;parameter, consensus;robust, Estimation, estimation;polynomials;regression, learning;sparse, median, of, problem;cubic, problem;polynomial, problem;sparse, regression, representation;computational, sample, squares;parameter, TIME}, doi = {10.1109/ICASSP.2010.5495830}, author = {Mitra, K. and Veeraraghavan,A. and Chellapa, Rama} } @conference {12482, title = {Robust RVM regression using sparse outlier model}, booktitle = {Computer Vision and Pattern Recognition (CVPR), 2010 IEEE Conference on}, year = {2010}, month = {2010/06//}, pages = {1887 - 1894}, abstract = {Kernel regression techniques such as Relevance Vector Machine (RVM) regression, Support Vector Regression and Gaussian processes are widely used for solving many computer vision problems such as age, head pose, 3D human pose and lighting estimation. However, the presence of outliers in the training dataset makes the estimates from these regression techniques unreliable. In this paper, we propose robust versions of the RVM regression that can handle outliers in the training dataset. We decompose the noise term in the RVM formulation into a (sparse) outlier noise term and a Gaussian noise term. We then estimate the outlier noise along with the model parameters. We present two approaches for solving this estimation problem: (1) a Bayesian approach, which essentially follows the RVM framework and (2) an optimization approach based on Basis Pursuit Denoising. In the Bayesian approach, the robust RVM problem essentially becomes a bigger RVM problem with the advantage that it can be solved efficiently by a fast algorithm. Empirical evaluations, and real experiments on image de-noising and age estimation demonstrate the better performance of the robust RVM algorithms over that of the RVM reg ression.}, keywords = {3D, analysis;, approach;Gaussian, denoising;computer, denoising;lighting, denoising;regression, estimation;relevance, human, machine;robust, model;Gaussian, noise;basis, noise;computer, outlier, pose;Bayesian, pursuit, regression;sparse, RVM, vector, vision;image}, doi = {10.1109/CVPR.2010.5539861}, author = {Mitra, K. and Veeraraghavan,A. and Chellapa, Rama} } @conference {15138, title = {Secure text processing with applications to private DNA matching}, booktitle = {Proceedings of the 17th ACM conference on Computer and communications security}, series = {CCS {\textquoteright}10}, year = {2010}, month = {2010///}, pages = {485 - 492}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Motivated by the problem of private DNA matching, we consider the design of efficient protocols for secure text processing. Here, informally, a party P1 holds a text T and a party P2 holds a pattern p and some additional information y, and P2 wants to learn {f(T,j,y)} for all locations j where p is found as a substring in T. (In particular, this generalizes the basic pattern matching problem.) We aim for protocols with full security against a malicious P2 that also preserve privacy against a malicious P1 (i.e., one-sided security). We show how to modify Yao{\textquoteright}s garbled circuit approach to obtain a protocol where the size of the garbled circuit is linear in the number of occurrences of p in T (rather than linear in $|T|$). Along the way we show a new keyword search protocol that may be of independent interest.}, keywords = {COMPUTATION, secure}, isbn = {978-1-4503-0245-6}, doi = {10.1145/1866307.1866361}, url = {http://doi.acm.org/10.1145/1866307.1866361}, author = {Katz, Jonathan and Malka,Lior} } @article {16592, title = {Self-assembly of neural networks viewed as swarm intelligence}, journal = {Swarm Intelligence}, volume = {4}, year = {2010}, month = {2010///}, pages = {1 - 36}, author = {Martin,C. E and Reggia, James A.} } @article {14734, title = {Serializing C intermediate representations for efficient and portable parsing}, journal = {Software: Practice and Experience}, volume = {40}, year = {2010}, month = {2010/03/01/}, pages = {225 - 238}, abstract = {C static analysis tools often use intermediate representations (IRs) that organize program data in a simple, well-structured manner. However, the C parsers that create IRs are slow, and because they are difficult to write, only a few implementations exist, limiting the languages in which a C static analysis can be written. To solve these problems, we investigate two language-independent, on-disk representations of C IRs: one using XML and the other using an Internet standard binary encoding called eXternal Data Representation (XDR). We benchmark the parsing speeds of both options, finding the XML to be about a factor of 2 slower than parsing C and the XDR over 6 times faster. Furthermore, we show that the XML files are far too large at 19 times the size of C source code, whereas XDR is only 2.2 times the C size. We also demonstrate the portability of our XDR system by presenting a C source code querying tool in Ruby. Our solution and the insights we gained from building it will be useful to analysis authors and other clients of C IRs. We have made our software freely available for download at http://www.cs.umd.edu/projects/PL/scil/. Copyright {\textcopyright} 2010 John Wiley\&Sons, Ltd.}, keywords = {C, intermediate representations, parsing, static analysis, XDR, XML}, isbn = {1097-024X}, doi = {10.1002/spe.954}, url = {http://onlinelibrary.wiley.com/doi/10.1002/spe.954/abstract}, author = {Meister,Jeffrey A and Foster, Jeffrey S. and Hicks, Michael W.} } @conference {13332, title = {Spatial indexing on tetrahedral meshes}, booktitle = {Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems}, series = {GIS {\textquoteright}10}, year = {2010}, month = {2010///}, pages = {506 - 509}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {We address the problem of performing spatial queries on tetrahedral meshes. These latter arise in several application domains including 3D GIS, scientific visualization, finite element analysis. We have defined and implemented a family of spatial indexes, that we call tetrahedral trees. Tetrahedral trees subdivide a cubic domain containing the mesh in an octree or 3D kd-tree fashion, with three different subdivision criteria. Here, we present and compare such indexes, their memory usage, and spatial queries on them.}, keywords = {kd-trees, octrees, spatial indexes, tetrahedral meshes}, isbn = {978-1-4503-0428-3}, doi = {10.1145/1869790.1869873}, url = {http://doi.acm.org/10.1145/1869790.1869873}, author = {De Floriani, Leila and Fellegara,Riccardo and Magillo,Paola} } @article {15559, title = {Spatio-temporal range searching over compressed kinetic sensor data}, journal = {Algorithms{\textendash}ESA 2010}, year = {2010}, month = {2010///}, pages = {386 - 397}, abstract = {As sensor networks increase in size and number, efficient techniques are required to process the very large data sets that they generate. Frequently, sensor networks monitor objects in motion within their vicinity; the data associated with the movement of these objects are known as kinetic data. In an earlier paper we introduced an algorithm which, given a set of sensor observations, losslessly compresses this data to a size that is within a constant factor of the asymptotically optimal joint entropy bound. In this paper we present an efficient algorithm for answering spatio-temporal range queries. Our algorithm operates on a compressed representation of the data, without the need to decompress it. We analyze the efficiency of our algorithm in terms of a natural measure of information content, the joint entropy of the sensor outputs. We show that with space roughly equal to entropy, queries can be answered in time that is roughly logarithmic in entropy. In addition, we show experimentally that on real-world data our range searching structures use less space and have faster query times than the naive versions. These results represent the first solutions to range searching problems over compressed kinetic sensor data.}, doi = {10.1007/978-3-642-15775-2_33}, author = {Friedler,S. and Mount, Dave} } @article {13087, title = {SPECIAL SECTION ON SHAPE ANALYSIS AND ITS APPLICATIONS IN IMAGE UNDERSTANDING}, journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {32}, year = {2010}, month = {2010///}, pages = {0162 - 8828}, author = {Srivastava, A. and Damon,J.N. and Dryden,I.L. and Jermyn,I.H. and Das,S. and Vaswani, N. and Huckemann,S. and Hotz,T. and Munk,A. and Lin,Z. and others} } @article {15397, title = {On Stability of Magnetization Dynamics in Nanoparticles}, journal = {Magnetics, IEEE Transactions on}, volume = {46}, year = {2010}, month = {2010/06//}, pages = {1718 - 1721}, abstract = {It is rigorously demonstrated that spatially uniform magnetization oscillations in sufficiently small ellipsoidal nanoparticles can be unconditionally stable with respect to spatially nonuniform perturbations. The proof reveals the dominant stabilizing effect of exchange field which is mathematically manifested through the Poincare inequality.}, keywords = {(electron);magnetic, DYNAMICS, ellipsoidal, field;magnetization, inequality;exchange, INTERACTIONS, magnetization, nanoparticles;spatially, nonuniform, oscillations;spin-wave, particles;magnetisation;nanoparticles;spin, perturbations;exchange, perturbations;spatially, Poincare, stability;small, uniform, waves;}, isbn = {0018-9464}, doi = {10.1109/TMAG.2009.2039119}, author = {Mayergoyz, Issak D and Serpico,C. and Bertotti,G.} } @conference {17423, title = {The state of visual analytics: Views on what visual analytics is and where it is going}, booktitle = {2010 IEEE Symposium on Visual Analytics Science and Technology (VAST)}, year = {2010}, month = {2010/10/25/26}, pages = {257 - 259}, publisher = {IEEE}, organization = {IEEE}, abstract = {In the 2005 publication "Illuminating the Path" visual analytics was defined as "the science of analytical reasoning facilitated by interactive visual interfaces." A lot of work has been done in visual analytics over the intervening five years. While visual analytics started in the United States with a focus on security, it is now a worldwide research agenda with a broad range of application domains. This is evidenced by efforts like the European VisMaster program and the upcoming Visual Analytics and Knowledge Discovery (VAKD) workshop, just to name two.There are still questions concerning where and how visual analytics fits in the large body of research and applications represented by the VisWeek community. This panel will present distinct viewpoints on what visual analytics is and its role in understanding complex information in a complex world. The goal of this panel is to engender discussion from the audience on the emergence and continued advancement of visual analytics and its role relative to fields of related research. Four distinguished panelists will provide their perspective on visual analytics focusing on what it is, what it should be, and thoughts about a development path between these two states. The purpose of the presentations is not to give a critical review of the literature but rather to give a review on the field and to provide a contextual perspective based on the panelists{\textquoteright} years of experience and accumulated knowledge.}, keywords = {analytical reasoning, Data analysis, data mining, data visualisation, European VisMaster program, interactive visual interfaces, knowledge discovery, United States, visual analytics, VisWeek community}, isbn = {978-1-4244-9488-0}, doi = {10.1109/VAST.2010.5649078}, author = {May,R. and Hanrahan,P. and Keim,D. A and Shneiderman, Ben and Card,S.} } @article {18601, title = {SwitchBlade: a platform for rapid deployment of network protocols on programmable hardware}, journal = {SIGCOMM Comput. Commun. Rev.}, volume = {40}, year = {2010}, month = {2010/08//}, pages = {183 - 194}, abstract = {We present SwitchBlade, a platform for rapidly deploying custom protocols on programmable hardware. SwitchBlade uses a pipeline-based design that allows individual hardware modules to be enabled or disabled on the fly, integrates software exception handling, and provides support for forwarding based on custom header fields. SwitchBlade{\textquoteright}s ease of programmability and wire-speed performance enables rapid prototyping of custom data-plane functions that can be directly deployed in a production network. SwitchBlade integrates common packet-processing functions as hardware modules, enabling different protocols to use these functions without having to resynthesize hardware. SwitchBlade{\textquoteright}s customizable forwarding engine supports both longest-prefix matching in the packet header and exact matching on a hash value. SwitchBlade{\textquoteright}s software exceptions can be invoked based on either packet or flow-based rules and updated quickly at runtime, thus making it easy to integrate more flexible forwarding function into the pipeline. SwitchBlade also allows multiple custom data planes to operate in parallel on the same physical hardware, while providing complete isolation for protocols running in parallel. We implemented SwitchBlade using NetFPGA board, but SwitchBlade can be implemented with any FPGA. To demonstrate SwitchBlade{\textquoteright}s flexibility, we use SwitchBlade to implement and evaluate a variety of custom network protocols: we present instances of IPv4, IPv6, Path Splicing, and an OpenFlow switch, all running in parallel while forwarding packets at line rate.}, keywords = {netfpga, network virtualization}, isbn = {0146-4833}, doi = {10.1145/1851275.1851206}, url = {http://doi.acm.org/10.1145/1851275.1851206}, author = {Anwer,Muhammad Bilal and Motiwala,Murtaza and Bin Tariq,Mukarram and Feamster, Nick} } @article {18284, title = {System and Method for Confidentiality-Preserving Rank-Ordered Search}, volume = {12/608,724}, year = {2010}, month = {2010/06/10/}, abstract = {A confidentiality preserving system and method for performing a rank-ordered search and retrieval of contents of a data collection. The system includes at least one computer system including a search and retrieval algorithm using term frequency and/or similar features for rank-ordering selective contents of the data collection, and enabling secure retrieval of the selective contents based on the rank-order. The search and retrieval algorithm includes a baseline algorithm, a partially server oriented algorithm, and/or a fully server oriented algorithm. The partially and/or fully server oriented algorithms use homomorphic and/or order preserving encryption for enabling search capability from a user other than an owner of the contents of the data collection. The confidentiality preserving method includes using term frequency for rank-ordering selective contents of the data collection, and retrieving the selective contents based on the rank-order.}, url = {http://www.google.com/patents?id=kInVAAAAEBAJ}, author = {Swaminathan,Ashwin and Mao,Yinian and Su,Guan-Ming and Gou,Hongmei and Varna,Avinash L. and He,Shan and M. Wu and Oard, Douglas} } @conference {15620, title = {Tight lower bounds for halfspace range searching}, booktitle = {Proceedings of the 2010 annual symposium on Computational geometry}, series = {SoCG {\textquoteright}10}, year = {2010}, month = {2010///}, pages = {29 - 37}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {We establish two new lower bounds for the halfspace range searching problem: Given a set of n points in ℜd, where each point is associated with a weight from a commutative semigroup, compute the semigroup sum of the weights of the points lying within any query halfspace. Letting $m$ denote the space requirements, we prove a lower bound for general semigroups of Ω(n1-1/(d+1)/m1/(d+1)) and for integral semigroups of Ω(n/m1/d). Our lower bounds are proved in the semigroup arithmetic model. Neglecting logarithmic factors, our result for integral semigroups matches the best known upper bound due to Matou{\v s}ek. Our result for general semigroups improves upon the best known lower bound due to Br{\"o}nnimann, Chazelle, and Pach. Moreover, Fonseca and Mount have recently shown that, given uniformly distributed points, halfspace range queries over idempotent semigroups can be answered in O(n1-1/(d+1)/m1/(d+1)) time in the semigroup arithmetic model. As our lower bounds are established for uniformly distributed point sets, it follows that they also resolve the computational complexity of halfspace range searching over idempotent semigroups in this important special case.}, keywords = {Idempotence, lower bounds, Range searching}, isbn = {978-1-4503-0016-2}, doi = {10.1145/1810959.1810964}, url = {http://doi.acm.org/10.1145/1810959.1810964}, author = {Arya,Sunil and Mount, Dave and Xia,Jian} } @article {15558, title = {A unified approach to approximate proximity searching}, journal = {Algorithms{\textendash}ESA 2010}, year = {2010}, month = {2010///}, pages = {374 - 385}, author = {Arya,S. and da Fonseca,G. and Mount, Dave} } @conference {15496, title = {Using methods \& measures from network analysis for gui testing}, booktitle = {Software Testing, Verification, and Validation Workshops (ICSTW), 2010 Third International Conference on}, year = {2010}, month = {2010/04//}, pages = {240 - 246}, abstract = {Graphical user interfaces (GUIs) for today{\textquoteright}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.}, keywords = {betweenness clustering method, event sequences, event-flow graph model, Graphical user interfaces, GUI quality assurance, GUI testing, network analysis, network centrality measures, program testing, Software quality}, doi = {10.1109/ICSTW.2010.61}, author = {Elsaka,E. and Moustafa,W. E and Nguyen,Bao and Memon, Atif M.} } @conference {14306, title = {Using symbolic evaluation to understand behavior in configurable software systems}, booktitle = {Software Engineering, 2010 ACM/IEEE 32nd International Conference on}, volume = {1}, year = {2010}, month = {2010///}, pages = {445 - 454}, author = {Reisner,E. and Song,C. and Ma,K.K. and Foster, Jeffrey S. and Porter, Adam} } @conference {18355, title = {VizWiz: nearly real-time answers to visual questions}, booktitle = {Proceedings of the 23nd annual ACM symposium on User interface software and technology}, series = {UIST {\textquoteright}10}, year = {2010}, month = {2010///}, pages = {333 - 342}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {The lack of access to visual information like text labels, icons, and colors can cause frustration and decrease independence for blind people. Current access technology uses automatic approaches to address some problems in this space, but the technology is error-prone, limited in scope, and quite expensive. In this paper, we introduce VizWiz, a talking application for mobile phones that offers a new alternative to answering visual questions in nearly real-time - asking multiple people on the web. To support answering questions quickly, we introduce a general approach for intelligently recruiting human workers in advance called quikTurkit so that workers are available when new questions arrive. A field deployment with 11 blind participants illustrates that blind people can effectively use VizWiz to cheaply answer questions in their everyday lives, highlighting issues that automatic approaches will need to address to be useful. Finally, we illustrate the potential of using VizWiz as part of the participatory design of advanced tools by using it to build and evaluate VizWiz::LocateIt, an interactive mobile tool that helps blind people solve general visual search problems.}, keywords = {blind users, non-visual interfaces, real-time human computation}, isbn = {978-1-4503-0271-5}, doi = {10.1145/1866029.1866080}, url = {http://doi.acm.org/10.1145/1866029.1866080}, author = {Bigham,Jeffrey P. and Jayant,Chandrika and Ji,Hanjie and Little,Greg and Miller,Andrew and Miller,Robert C. and Miller,Robin and Tatarowicz,Aubrey and White,Brandyn and White,Samual and Tom Yeh} } @conference {18356, title = {VizWiz::LocateIt - enabling blind people to locate objects in their environment}, booktitle = {Computer Vision and Pattern Recognition Workshops (CVPRW), 2010 IEEE Computer Society Conference on}, year = {2010}, month = {2010/06//}, pages = {65 - 72}, publisher = {IEEE}, organization = {IEEE}, abstract = {Blind people face a number of challenges when interacting with their environments because so much information is encoded visually. Text is pervasively used to label objects, colors carry special significance, and items can easily become lost in surroundings that cannot be quickly scanned. Many tools seek to help blind people solve these problems by enabling them to query for additional information, such as color or text shown on the object. In this paper we argue that many useful problems may be better solved by directly modeling them as search problems, and present a solution called VizWiz::LocateIt that directly supports this type of interaction. VizWiz::LocateIt enables blind people to take a picture and ask for assistance in finding a specific object. The request is first forwarded to remote workers who outline the object, enabling efficient and accurate automatic computer vision to guide users interactively from their existing cellphones. A two-stage algorithm is presented that uses this information to guide users to the appropriate object interactively from their phone.}, isbn = {978-1-4244-7029-7}, doi = {10.1109/CVPRW.2010.5543821}, url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=5543821}, author = {Bigham,Jeffrey P. and Jayant,Chandrika and Miller,Andrew and White,Brandyn and Tom Yeh} } @inbook {18357, title = {Why Did the Person Cross the Road (There)? Scene Understanding Using Probabilistic Logic Models and Common Sense Reasoning}, booktitle = {Computer Vision {\textendash} ECCV 2010}, series = {Lecture Notes in Computer Science}, volume = {6312}, year = {2010}, month = {2010///}, pages = {693 - 706}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {We develop a video understanding system for scene elements, such as bus stops, crosswalks, and intersections, that are characterized more by qualitative activities and geometry than by intrinsic appearance. The domain models for scene elements are not learned from a corpus of video, but instead, naturally elicited by humans, and represented as probabilistic logic rules within a Markov Logic Network framework. Human elicited models, however, represent object interactions as they occur in the 3D world rather than describing their appearance projection in some specific 2D image plane. We bridge this gap by recovering qualitative scene geometry to analyze object interactions in the 3D world and then reasoning about scene geometry, occlusions and common sense domain knowledge using a set of meta-rules. The effectiveness of this approach is demonstrated on a set of videos of public spaces.}, isbn = {978-3-642-15551-2}, url = {http://dx.doi.org/10.1007/978-3-642-15552-9_50}, author = {Kembhavi,Aniruddha and Tom Yeh and Davis, Larry S.}, editor = {Daniilidis,Kostas and Maragos,Petros and Paragios,Nikos} } @conference {15456, title = {Workshop on experimental evaluation of software and systems in computer science (Evaluate 2010)}, booktitle = {Proceedings of the ACM international conference companion on Object oriented programming systems languages and applications companion}, series = {SPLASH {\textquoteright}10}, year = {2010}, month = {2010///}, pages = {291 - 292}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {We call ourselves {\textquoteright}computer scientists{\textquoteright}, but are we scientists? If we are scientists, then we must practice the scientific method. This includes a solid experimental evaluation. In our experience, our experimental methodology is ad hoc at best, and nonexistent at worst. This workshop brings together experts from different areas of computer science to discuss, explore, and attempt to identify the principles of sound experimental evaluation}, keywords = {Evaluation, METHODOLOGY}, isbn = {978-1-4503-0240-1}, doi = {10.1145/1869542.1869618}, url = {http://doi.acm.org/10.1145/1869542.1869618}, author = {Blackburn,Steven M. and Diwan,Amer and Hauswirth,Matthias and Memon, Atif M. and Sweeney,Peter F.} } @conference {14193, title = {Active segmentation for robotics}, booktitle = {IEEE/RSJ International Conference on Intelligent Robots and Systems, 2009. IROS 2009}, year = {2009}, month = {2009/10/10/15}, pages = {3133 - 3139}, publisher = {IEEE}, organization = {IEEE}, abstract = {The semantic robots of the immediate future are robots that will be able to find and recognize objects in any environment. They need the capability of segmenting objects in their visual field. In this paper, we propose a novel approach to segmentation based on the operation of fixation by an active observer. Our approach is different from current approaches: while existing works attempt to segment the whole scene at once into many areas, we segment only one image region, specifically the one containing the fixation point. Furthermore, our solution integrates monocular cues (color, texture) with binocular cues (stereo disparities and optical flow). Experiments with real imagery collected by our active robot and from the known databases demonstrate the promise of the approach.}, keywords = {binocular cues, image colour analysis, Image segmentation, Image texture, Intelligent robots, Layout, Machine vision, monocular cues, Navigation, optical flow, Orbital robotics, Robot sensing systems, robot vision, Robot vision systems, robotics active segmentation, Robotics and automation, semantic robot, Simultaneous localization and mapping, stereo disparity, stereo image processing}, isbn = {978-1-4244-3803-7}, doi = {10.1109/IROS.2009.5354325}, author = {Mishra,A. and Aloimonos, J. and Ferm{\"u}ller, Cornelia} } @inbook {15431, title = {Advances in Web Testing}, booktitle = {Computer Performance IssuesComputer Performance Issues}, volume = {Volume 75}, year = {2009}, month = {2009///}, pages = {281 - 306}, publisher = {Elsevier}, organization = {Elsevier}, abstract = {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. }, isbn = {0065-2458}, url = {http://www.sciencedirect.com/science/article/pii/S006524580800805X}, author = {Eaton,Cyntrica and Memon, Atif M.}, editor = {Zelkowitz, Marvin V} } @conference {17752, title = {Aggregate Query Answering under Uncertain Schema Mappings}, booktitle = {Data Engineering, 2009. ICDE {\textquoteright}09. IEEE 25th International Conference on}, year = {2009}, month = {2009/04/29/2}, pages = {940 - 951}, abstract = {Recent interest in managing uncertainty in data integration has led to the introduction of probabilistic schema mappings and the use of probabilistic methods to answer queries across multiple databases using two semantics: by-table and by-tuple. In this paper, we develop three possible semantics for aggregate queries: the range, distribution, and expected value semantics, and show that these three semantics combine with the by-table and by-tuple semantics in six ways. We present algorithms to process COUNT, AVG, SUM, MIN, and MAX queries under all six semantics and develop results on the complexity of processing such queries under all six semantics. We show that computing COUNT is in PTIME for all six semantics and computing SUM is in PTIME for all but the by-tuple/distribution semantics. Finally, we show that AVG, MIN, and MAX are PTIME computable for all by-table semantics and for the by-tuple/range semantics.We developed a prototype implementation and experimented with both real-world traces and simulated data. We show that, as expected, naive processing of aggregates does not scale beyond small databases with a small number of mappings. The results also show that the polynomial time algorithms are scalable up to several million tuples as well as with a large number of mappings.}, keywords = {aggregate, algorithm;probabilistic, answering;by-table, complexity;data, complexity;distributed, database;polynomial, databases;, databases;probability;query, integration;distribution, mapping;computational, mapping;query, processing;range, processing;statistical, query, schema, semantics;by-tuple, semantics;computational, semantics;expected, semantics;multiple, semantics;uncertain, TIME, value}, doi = {10.1109/ICDE.2009.55}, author = {Gal,A. and Martinez,M. V and Simari,G. I and V.S. Subrahmanian} } @conference {12229, title = {All Bits Are Not Equal - A Study of IEEE 802.11 Communication Bit Errors}, booktitle = {INFOCOM 2009, IEEE}, year = {2009}, month = {2009/04//}, pages = {1602 - 1610}, abstract = {In IEEE 802.11 Wireless LAN (WLAN) systems, techniques such as acknowledgement, retransmission, and transmission rate adaptation, are frame-level mechanisms designed for combating transmission errors. Recently sub-frame level mechanisms such as frame combining have been proposed by the research community. In this paper, we present results obtained from our bit error study for identifying sub-frame error patterns because we believe that identifiable bit error patterns can potentially introduce new opportunities in channel coding, network coding, forward error correction (FEC), and frame combining mechanisms. We have constructed a number of IEEE 802.11 wireless LAN testbeds and conducted extensive experiments to study the characteristics of bit errors and their location distribution. Conventional wisdom dictates that bit error probability is the result of channel condition and ought to follow corresponding distribution. However our measurement results identify three repeatable bit error patterns that are not induced by channel conditions. We have verified that such error patterns are present in WLAN transmissions in different physical environments and across different wireless LAN hardware platforms. We also discuss our current hypotheses for the reasons behind these bit error probability patterns and how identifying these patterns may help improving WLAN transmission robustness.}, keywords = {802.11, bit, coding;error, coding;forward, coding;subframe, combining, Communication, correction;frame, correction;wireless, error, errors;channel, errors;wireless, IEEE, LAN;, LAN;channel, mechanisms;network, patterns;transmission, statistics;forward}, doi = {10.1109/INFCOM.2009.5062078}, author = {Han,Bo and Ji,Lusheng and Lee,Seungjoon and Bhattacharjee, Bobby and Miller,R.R.} } @article {12886, title = {Analysis of clonally related environmental Vibrio cholerae O1 El Tor isolated before 1992 from Varanasi, India reveals origin of SXT-ICEs belonging to O139 and O1 serogroups}, journal = {Environmental Microbiology Reports}, volume = {2}, year = {2009}, month = {2009/07/21/}, pages = {50 - 57}, abstract = {In this study, we report the presence of SXT in environmental Vibrio cholerae O1 El Tor strains isolated before 1992 from Varanasi, India. All isolates, except one, were resistant to Tm, and/or Sul, Sm, Fr, Na and Am. None contained plasmids. PCR and DNA sequencing revealed the presence of SXT containing dfrA1 and/or sulII, strAB in six isolates and dfr18, sulII and strAB in five isolates. Three clinical V. cholerae O1 isolated during 1992 contained the antibiotic resistance gene cassette aadA1 in the class 1 integron. Conjugation experiments, followed by PCR analysis of transconjugants, provided evidence of the transferable nature of SXT and associated antibiotic resistance genes, and its integration into the prfC site. Results of phylogenetic analysis of the intSXT gene of clonally similar V. cholerae showed a clear difference between dfr18+ and dfrA1+V. cholerae O1 isolates. This is the first report of the occurrence of SXT harbouring sulII, strAB, dfr18 and/or dfrA1 genes in environmental V. cholerae O1 isolated prior to 1992 from Varanasi, India, and suggests emergence of SXT+ antibiotic-resistant V. cholerae O139 and O1 from an environmental V. cholerae progenitor by acquisition of SXT and antibiotic-resistant gene clusters.}, isbn = {1758-2229}, doi = {10.1111/j.1758-2229.2009.00051.x}, url = {http://onlinelibrary.wiley.com/doi/10.1111/j.1758-2229.2009.00051.x/abstract?userIsAuthenticated=false\&deniedAccessCustomisedMessage=}, author = {Mohapatra,Saswat S. and Mantri,Chinmay K. and Mohapatra,Harapriya and Rita R Colwell and Singh,Durg V.} } @article {15377, title = {Analytical Description of Quasi-Random Magnetization Relaxation to Equilibrium}, journal = {Magnetics, IEEE Transactions on}, volume = {45}, year = {2009}, month = {2009/11//}, pages = {5224 - 5227}, abstract = {The Landau-Lifshitz (LL) dynamics of a uniformly magnetized particle is considered. The LL equation is written in the form of a Hamiltonian perturbed dynamical system. By using suitable averaging technique, the equation for the slow dynamics of the energy is derived. The averaging technique breaks up in the case of separatrix crossing. It is shown that, in the limit of small damping, the separatrix crossing can be described by using a probabilistic approach.}, keywords = {approach;quasirandom, crossing;uniformly, dynamical, dynamics;averaging, Hamiltonian, magnetization, magnetized, particle;magnetic, particles;magnetic, perturbed, relaxation;magnetisation;probability;, relaxation;separatrix, system;Landau-Lifshitz, technique;damping;probabilistic}, isbn = {0018-9464}, doi = {10.1109/TMAG.2009.2031067}, author = {Serpico,C. and d{\textquoteright}Aquino,M. and Bertotti,G. and Mayergoyz, Issak D} } @conference {16974, title = {Analyzing (social media) networks with NodeXL}, booktitle = {Proceedings of the fourth international conference on Communities and technologies}, series = {C\&$\#$38;T {\textquoteright}09}, year = {2009}, month = {2009///}, pages = {255 - 264}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {We present NodeXL, an extendible toolkit for network overview, discovery and exploration implemented as an add-in to the Microsoft Excel 2007 spreadsheet software. We demonstrate NodeXL data analysis and visualization features with a social media data sample drawn from an enterprise intranet social network. A sequence of NodeXL operations from data import to computation of network statistics and refinement of network visualization through sorting, filtering, and clustering functions is described. These operations reveal sociologically relevant differences in the patterns of interconnection among employee participants in the social media space. The tool and method can be broadly applied.}, keywords = {excel, network analysis, social media, social network, spreadsheet, Visualization}, isbn = {978-1-60558-713-4}, doi = {10.1145/1556460.1556497}, url = {http://doi.acm.org/10.1145/1556460.1556497}, author = {Smith,Marc A. and Shneiderman, Ben and Milic-Frayling,Natasa and Mendes Rodrigues,Eduarda and Barash,Vladimir and Dunne,Cody and Capone,Tony and Perer,Adam and Gleave,Eric} } @article {17756, title = {CAPE: Automatically Predicting Changes in Group Behavior}, journal = {Mathematical Methods in Counterterrorism}, year = {2009}, month = {2009///}, pages = {253 - 269}, abstract = {There is now intense interest in the problem of forecasting what a group will do in the future. Past work [1, 2, 3] has built complex models of a group{\textquoteright}s behavior and used this to predict what the group might do in the future. However, almost all past work assumes that the group will not change its past behavior. Whether the group is a group of investors, or a political party, or a terror group, there is much interest in when and how the group will change its behavior. In this paper, we develop an architecture and algorithms called CAPE to forecast the conditions under which a group will change its behavior. We have tested CAPE on social science data about the behaviors of seven terrorist groups and show that CAPE is highly accurate in its predictions{\textemdash}at least in this limited setting.}, doi = {10.1007/978-3-211-09442-6_15}, author = {Sliva,A. and V.S. Subrahmanian and Martinez,V. and Simari,G.} } @conference {12227, title = {Channel Access Throttling for Improving WLAN QoS}, booktitle = {Sensor, Mesh and Ad Hoc Communications and Networks, 2009. SECON {\textquoteright}09. 6th Annual IEEE Communications Society Conference on}, year = {2009}, month = {2009/06//}, pages = {1 - 9}, abstract = {The de facto QoS channel access method for the IEEE 802.11 Wireless LANs is the Enhanced Distributed Channel Access (EDCA) mechanism, which differentiates transmission treatments for data frames belonging to different traffic categories with four different levels of channel access priority. In this paper, we propose extending EDCA with Channel Access Throttling (CAT) for more flexible and efficient QoS support. By assigning different member stations different channel access parameters, CAT differentiates channel access priorities not between traffic categories but between member stations. Then by dynamically changing the channel access parameters of each member station based on a pre-computed schedule, CAT enables EDCA WLANs the benefits of scheduled access QoS. We also present evaluation results of CAT obtained from both simulations and experiments conducted using off-the-shelf WLAN hardware and open-source device driver. Our results show that CAT can proportionally partition channel capacity, significantly improve performance of multimedia applications, effectively achieve performance protection for admitted flows, and increase per cell VoIP call capacity by up to 41\%.}, keywords = {802.11, access, area, call, capacity;data, capacity;quality, capacity;WLAN, categories;transmission, channel, device, distributed, driver;quality, facto, frames;de, IEEE, LAN;, LAN;VoIP, local, mechanism;member, method;enhanced, multimedia, network;wireless, networks;channel, of, parameters;channel, priority;channel, QoS, QoS;channel, service;telecommunication, service;traffic, standards;telecommunication, stations;open-source, throttling;channel, traffic;wireless, treatments;wireless, wireless}, doi = {10.1109/SAHCN.2009.5168915}, author = {Han,Bo and Ji,Lusheng and Lee,Seungjoon and Miller,R.R. and Bhattacharjee, Bobby} } @conference {12226, title = {Channel Access Throttling for Overlapping BSS Management}, booktitle = {Communications, 2009. ICC {\textquoteright}09. IEEE International Conference on}, year = {2009}, month = {2009/06//}, pages = {1 - 6}, abstract = {Multiple co-channel WLAN BSSes (i.e., WLAN cells) overlapping in coverage are generally considered undesirable because members of the OBSSes compete for channel access, which typically increases the contention level of wireless medium access and reduces overall system performance. In this paper, we propose to use channel access throttling (CAT) for managing Wireless LAN radio resources for overlapping BSSes (OBSSes). CAT provides an access point (AP) of each BSS with a mechanism to control channel access parameters of its member stations on the fly. By coordinating the CAT operations of the OBSS APs, we can enable privileged channel access to an individual BSS at a particular time, for example, by assigning high priority access parameters to member stations associated with the BSS. By controlling how much each BSS may be given the privileged channel access, we can also achieve a proportional partitioning of channel capacity among OBSSes. We present evaluation results obtained from both simulations and experiments using testbed built with commercial off-the-shelf (COTS) WLAN hardware and open-source device driver. Our results show that with CAT, not only can we proportionally partition channel capacity among the OBSSes, but also improve channel utilization efficiency and increase overall capacity.}, keywords = {access, access;cellular, allocation;channel, BSS, capacity;computer, capacity;proportional, cell;open-source, channel, channels;, co-channel, device, driver;overlapping, efficiency;high-priority, LAN;wireless, management;partition, management;wireless, medium, network, parameters;multiple, partitioning;radio, radio;channel, resources;wireless, throttling;channel, utilization, WLAN}, doi = {10.1109/ICC.2009.5198815}, author = {Han,Bo and Ji,Lusheng and Lee,Seungjoon and Miller,R.R. and Bhattacharjee, Bobby} } @conference {18555, title = {Characterizing VLAN-induced sharing in a campus network}, booktitle = {Proceedings of the 9th ACM SIGCOMM conference on Internet measurement conference}, series = {IMC {\textquoteright}09}, year = {2009}, month = {2009///}, pages = {116 - 121}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Many enterprise, campus, and data-center networks have complex layer-2 virtual LANs ("VLANs") below the IP layer. The interaction between layer-2 and IP topologies in these VLANs introduces hidden dependencies between IP level network and the physical infrastructure that has implications for network management tasks such as planning for capacity or reliability, and for fault diagnosis. This paper characterizes the extent and effect of these dependencies in a large campus network. We first present the design and implementation of EtherTrace, a tool that we make publicly available, which infers the layer-2 topology using data passively collected from Ethernet switches. Using this tool, we infer the layer-2 topology for a large campus network and compare it with the IP topology. We find that almost 70\% of layer-2 edges are shared by 10 or more IP edges, and a single layer-2 edge may be shared by as many as 34 different IP edges. This sharing of layer-2 edges and switches among IP paths commonly results from trunking multiple VLANs to the same access router, or from colocation of academic departments that share layer-2 infrastructure, but have logically separate IP subnet and routers. We examine how this sharing affects the accuracy and specificity of fault diagnosis. For example, applying network tomography to the IP topology to diagnose failures caused by layer-2 devices results in only 54\% accuracy, compared to 100\% accuracy when our tomography algorithm takes input across layers.}, keywords = {network diagnosis, network virtualization, VLAN, vlan-induced dependency}, isbn = {978-1-60558-771-4}, doi = {10.1145/1644893.1644907}, url = {http://doi.acm.org/10.1145/1644893.1644907}, author = {Bin Tariq,Mukarram and Mansy,Ahmed and Feamster, Nick and Ammar,Mostafa} } @article {14482, title = {Common effect of antipsychotics on the biosynthesis and regulation of fatty acids and cholesterol supports a key role of lipid homeostasis in schizophrenia}, journal = {Schizophrenia Research}, volume = {108}, year = {2009}, month = {2009/03//}, pages = {134 - 142}, abstract = {For decades, the dopamine hypothesis has gained the most attention in an attempt to explain the origin and the symptoms of schizophrenia. While this hypothesis offers an explanation for the relationship between psychotic symptoms and dopamine kinetics, it does not provide a direct explanation of the etiology of schizophrenia which remains poorly understood. Consequently, current antipsychotics that target neurotransmitter receptors, have limited and inconsistent efficacy. To gain insights into the mechanism of action of these drugs, we studied the expression profile of 12,490 human genes in a cell line treated with 18 antipsychotics, and compared it to that of a library of 448 other compounds used in a variety of disorders. Analysis reveals a common effect of antipsychotics on the biosynthesis and regulation of fatty acids and cholesterol, which is discussed in the context of a lipid hypothesis where alterations in lipid homeostasis might underlie the pathogenesis of schizophrenia. This finding may help research aimed at the development of novel treatments for this devastating disease.}, keywords = {Antipsychotic action, Gene expression, Lipid homeostasis, Pathogenesis}, isbn = {0920-9964}, doi = {10.1016/j.schres.2008.11.025}, url = {http://www.sciencedirect.com/science/article/pii/S0920996408005306}, author = {Polymeropoulos,Mihael H. and Licamele,Louis and Volpi,Simona and Mack,Kendra and Mitkus,Shruti N. and Carstea,Eugene D. and Getoor, Lise and Thompson,Andrew and Lavedan,Christian} } @article {15548, title = {Compressing kinetic data from sensor networks}, journal = {Algorithmic Aspects of Wireless Sensor Networks}, year = {2009}, month = {2009///}, pages = {191 - 202}, abstract = {We introduce a framework for storing and processing kinetic data observed by sensor networks. These sensor networks generate vast quantities of data, which motivates a significant need for data compression. We are given a set of sensors, each of which continuously monitors some region of space. We are interested in the kinetic data generated by a finite set of objects moving through space, as observed by these sensors. Our model relies purely on sensor observations; it allows points to move freely and requires no advance notification of motion plans. Sensor outputs are represented as random processes, where nearby sensors may be statistically dependent. We model the local nature of sensor networks by assuming that two sensor outputs are statistically dependent only if the two sensors are among the k nearest neighbors of each other. We present an algorithm for the lossless compression of the data produced by the network. We show that, under the statistical dependence and locality assumptions of our framework, asymptotically this compression algorithm encodes the data to within a constant factor of the information-theoretic lower bound optimum dictated by the joint entropy of the system.}, doi = {10.1007/978-3-642-05434-1_20}, author = {Friedler,S. and Mount, Dave} } @conference {19443, title = {Computer Help at Home: Methods and Motivations for Informal Technical Support}, booktitle = {SIGCHI {\textquoteright}09}, series = {CHI {\textquoteright}09}, year = {2009}, month = {2009///}, pages = {739 - 748}, publisher = {ACM}, organization = {ACM}, abstract = {Prior research suggests that people may ask their family and friends for computer help. But what influences whether and how a "helper" will provide help? To answer this question, we conducted a qualitative investigation of people who participated in computer support activities with family and friends in the past year. We describe how factors including maintenance of one{\textquoteright}s personal identity as a computer expert and accountability to one{\textquoteright}s social network determine who receives help and the quality of help provided. We also discuss the complex, fractured relationship between the numerous stakeholders involved in the upkeep of home computing infrastructures. Based on our findings, we provide implications for the design of systems to support informal help-giving in residential settings.}, keywords = {help-giving, help-seeking, Home computing, identity management, social networks}, isbn = {978-1-60558-246-7}, url = {http://doi.acm.org/10.1145/1518701.1518816}, author = {Poole, Erika Shehan and Marshini Chetty and Morgan, Tom and Grinter, Rebecca E. and Edwards, W. Keith} } @conference {19029, title = {Controlling data in the cloud: outsourcing computation without outsourcing control}, series = {CCSW {\textquoteright}09}, year = {2009}, month = {2009}, pages = {85 - 90}, publisher = {ACM}, organization = {ACM}, abstract = {Cloud computing is clearly one of today{\textquoteright}s most enticing technology areas due, at least in part, to its cost-efficiency and flexibility. However, despite the surge in activity and interest, there are significant, persistent concerns about cloud computing that are impeding momentum and will eventually compromise the vision of cloud computing as a new IT procurement model. In this paper, we characterize the problems and their impact on adoption. In addition, and equally importantly, we describe how the combination of existing research thrusts has the potential to alleviate many of the concerns impeding adoption. In particular, we argue that with continued research advances in trusted computing and computation-supporting encryption, life in the cloud can be advantageous from a business intelligence standpoint over the isolated alternative that is more common today.}, keywords = {Cloud computing, privacy, Security}, isbn = {978-1-60558-784-4}, url = {http://doi.acm.org/10.1145/1655008.1655020}, author = {Chow, Richard and Golle, Philippe and Jakobsson, Markus and Elaine Shi and Staddon, Jessica and Masuoka, Ryusuke and Molina,Jesus} } @article {13701, title = {A cost-effective lexical acquisition process for large-scale thesaurus translation}, journal = {Language resources and evaluation}, volume = {43}, year = {2009}, month = {2009///}, pages = {27 - 40}, abstract = {Thesauri and controlled vocabularies facilitate access to digital collections by explicitly representing the underlying principles of organization. Translation of such resources into multiple languages is an important component for providing multilingual access. However, the specificity of vocabulary terms in most thesauri precludes fully-automatic translation using general-domain lexical resources. In this paper, we present an efficient process for leveraging human translations to construct domain-specific lexical resources. This process is illustrated on a thesaurus of 56,000 concepts used to catalog a large archive of oral histories. We elicited human translations on a small subset of concepts, induced a probabilistic phrase dictionary from these translations, and used the resulting resource to automatically translate the rest of the thesaurus. Two separate evaluations demonstrate the acceptability of the automatic translations and the cost-effectiveness of our approach.}, author = {Jimmy Lin and Murray,G. C and Dorr, Bonnie J and Haji{\v c},J. and Pecina,P.} } @conference {17037, title = {Creativity challenges and opportunities in social computing}, booktitle = {Proceedings of the 27th international conference extended abstracts on Human factors in computing systems}, series = {CHI EA {\textquoteright}09}, year = {2009}, month = {2009///}, pages = {3283 - 3286}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {There is a convergence in recent theories of creativity that go beyond characteristics and cognitive processes of individuals to recognize the importance of the social construction of creativity. In parallel, there has been a rise in social computing supporting the collaborative construction of knowledge. The panel will discuss the challenges and opportunities from the confluence of these two developments by bringing together the contrasting and controversial perspective of the individual panel members. It will synthesize from different perspectives an analytic framework to understand these new developments, and how to promote rigorous research methods and how to identify the unique challenges in developing evaluation and assessment methods for creativity research.}, keywords = {creativity, social computing}, isbn = {978-1-60558-247-4}, doi = {10.1145/1520340.1520470}, url = {http://doi.acm.org/10.1145/1520340.1520470}, author = {Fischer,Gerhard and Jennings,Pamela and Maher,Mary Lou and Resnick,Mitchel and Shneiderman, Ben} } @conference {15891, title = {Cross-document coreference resolution: A key technology for learning by reading}, booktitle = {AAAI Spring Symposium on Learning by Reading and Learning to Read}, year = {2009}, month = {2009///}, author = {Mayfield,J. and Alexander,D. and Dorr, Bonnie J and Eisner,J. and Elsayed,T. and Finin,T. and Fink,C. and Freedman,M. and Garera,N. and McNamee,P. and others} } @conference {18562, title = {Detecting network neutrality violations with causal inference}, booktitle = {Proceedings of the 5th international conference on Emerging networking experiments and technologies}, series = {CoNEXT {\textquoteright}09}, year = {2009}, month = {2009///}, pages = {289 - 300}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {We present NANO, a system that detects when ISPs apply policies that discriminate against specific classes of applications, users, or destinations. Existing systems for detecting discrimination are typically specific to an application or to a particular discrimination mechanism and rely on active measurement tests. Unfortunately, ISPs can change discrimination policies and mechanisms, and they can evade these tests by giving probe traffic higher priority. NANO detects ISP discrimination by passively collecting performance data from clients. To distinguish discrimination from other causes of degradation (e.g., overload, misconfiguration, failure), NANO establishes a causal relationship between an ISP and observed performance by adjusting for confounding factors. NANO agents deployed at participating clients across the Internet collect performance data for selected services and report this information to centralized servers, which analyze the measurements to establish causal relationship between an ISP and performance degradations. We have implemented NANO and deployed clients in a controlled environment on Emulab. We run a combination of controlled experiments on Emulab and wide-area experiments on PlanetLab that show that NANO can determine the extent and criteria for discrimination for a variety of discrimination policies and applications.}, keywords = {causal inference, network neutrality}, isbn = {978-1-60558-636-6}, doi = {10.1145/1658939.1658972}, url = {http://doi.acm.org/10.1145/1658939.1658972}, author = {Bin Tariq,Mukarram and Motiwala,Murtaza and Feamster, Nick and Ammar,Mostafa} } @article {12891, title = {Determination of relationships among non-toxigenic Vibrio cholerae O1 biotype El Tor strains from housekeeping gene sequences and ribotype patterns}, journal = {Research in Microbiology}, volume = {160}, year = {2009}, month = {2009/01//}, pages = {57 - 62}, abstract = {Sequencing of three housekeeping genes, mdh, dnaE and recA, and ribotyping for seven non-toxigenic Vibrio cholerae O1 strains isolated from different geographic sources indicate a phylogenetic relationship among the strains. Results of MLST and ribotyping indicate a clear difference between three toxigenic strains (N16961, O395, and 569B) and three non-toxigenic strains from India (GS1, GS2, and GW87) and one Guam strain (X392), the latter of which were similar in both MLST and ribotyping, while two other non-toxigenic strains from the USA and India (2740-80 and OR69) appeared to be more closely related to toxigenic strains than to non-toxigenic strains, although this was not supported by ribotyping. These results provide clues to the emergence of toxigenic strains from a non-toxigenic progenitor by acquisition of virulence gene clusters. Results of split decomposition analysis suggest that widespread recombination occurs among the three housekeeping genes and that recombination plays an important role in the emergence of toxigenic strains of V. cholerae O1.}, keywords = {Housekeeping genes, Ribotyping, sequencing, Vibrio cholerae}, isbn = {0923-2508}, doi = {10.1016/j.resmic.2008.10.008}, url = {http://www.sciencedirect.com/science/article/pii/S0923250808001794}, author = {Mohapatra,Saswat S. and Ramachandran,Dhanya and Mantri,Chinmay K. and Rita R Colwell and Singh,Durg V.} } @article {18519, title = {Determining the causes of intradomain routing changes}, year = {2009}, month = {2009///}, institution = {University Pierre and Marie Curie}, abstract = {This paper studies how intradomain routinginstability relates to events in network trouble tickets for two networks: a VPN provider and the Internet2 backbone network. Our goal in performing this joint analysis of routing and trouble tickets is to better understand the likely underlying causes of intradomain routing instability. We develop a method to correlate trouble tickets with instability events and find that, although unplanned events last longer than scheduled maintenance, there is no single underlying cause for most instability, and that these causes differ across networks. In comparison to a similar study from Labovitz et al. from ten years ago, we find that, while certain causes of instability such as maintenance and circuit problems remain significant, power issues have become much less prevalent, and software-related problems have become more common. }, author = {Medem,A. and Teixeira,R. and Feamster, Nick and Meulle,M.} } @article {18196, title = {Digital forensics [From the Guest Editors]}, journal = {Signal Processing Magazine, IEEE}, volume = {26}, year = {2009}, month = {2009/03//}, pages = {14 - 15}, abstract = {This special issue provides a comprehensive overview of recent developments and open problems in digital forensics that are amenable to signal processing techniques.}, isbn = {1053-5888}, doi = {10.1109/MSP.2008.931089}, author = {Delp,E. and Memon, N. and Wu,M.} } @article {13259, title = {A dimension-independent library for building and manipulating multiresolution triangulations}, volume = {DISI-TR-99-03}, year = {2009}, month = {2009///}, institution = {Department of Computer Science and Information Science, University of Genoa}, abstract = {A Multi-Triangulation (MT) is a general multiresolution model for representing k-dimensional geometricobjects through simplicial complexes. An MT integrates several alternative representations of an object, and provides simple methods for handling representations at variable resolution efficiently , thus offering a basis for the development of applications that need to manage the level-of-detail of complex objects. In this paper, we present an object-oriented library that provides an open-ended tool for building and manipulating object representations based on the MT. }, author = {De Floriani, Leila and Magillo,P. and Puppo,E.} } @article {13291, title = {Discrete distortion for surface meshes}, journal = {Image Analysis and Processing{\textendash}ICIAP 2009}, year = {2009}, month = {2009///}, pages = {652 - 661}, abstract = {Discrete distortion for two- and three-dimensional combinatorial manifolds is a discrete alternative to Ricci curvature known for differentiable manifolds. Here, we show that distortion can be successfully used to estimate mean curvature at any point of a surface. We compare our approach with the continuous case and with a common discrete approximation of mean curvature, which depends on the area of the star of each vertex in the triangulated surface. This provides a new, area-independent, tool for curvature estimation and for morphological shape analysis. We illustrate our approach through experimental results showing the behavior of discrete distortion.}, doi = {10.1007/978-3-642-04146-4_70}, author = {Mesmoudi,M. and De Floriani, Leila and Magillo,P.} } @conference {17585, title = {Distributed Strategies for Channel Allocation and Scheduling in Software-Defined Radio Networks}, booktitle = {IEEE INFOCOM 2009}, year = {2009}, month = {2009/04/19/25}, pages = {1521 - 1529}, publisher = {IEEE}, organization = {IEEE}, abstract = {Equipping wireless nodes with multiple radios can significantly increase the capacity of wireless networks, by making these radios simultaneously transmit over multiple non-overlapping channels. However, due to the limited number of radios and available orthogonal channels, designing efficient channel assignment and scheduling algorithms in such networks is a major challenge. In this paper, we present provably-good distributed algorithms for simultaneous channel allocation of individual links and packet-scheduling, in software-defined radio (SDR) wireless networks. Our distributed algorithms are very simple to implement, and do not require any coordination even among neighboring nodes. A novel access hash function or random oracle methodology is one of the key drivers of our results. With this access hash function, each radio can know the transmitters{\textquoteright} decisions for links in its interference set for each time slot without introducing any extra communication overhead between them. Further, by utilizing the inductive-scheduling technique, each radio can also backoff appropriately to avoid collisions. Extensive simulations demonstrate that our bounds are valid in practice.}, keywords = {access hash function, Channel allocation, channel assignment algorithm, channel capacity, collision avoidance, Computer science, cryptography, distributed algorithm, distributed algorithms, Educational institutions, inductive-scheduling technique, Interference, interference set, packet scheduling algorithm, Peer to peer computing, Radio network, radio networks, radiofrequency interference, random oracle methodology, scheduling, Scheduling algorithm, simultaneous channel allocation, software radio, software-defined radio wireless network capacity, telecommunication congestion control, telecommunication security, Throughput, wireless channels, Wireless networks}, isbn = {978-1-4244-3512-8}, doi = {10.1109/INFCOM.2009.5062069}, author = {Han,Bo and Kumar,V. S.A and Marathe,M. V and Parthasarathy,S. and Srinivasan, Aravind} } @article {17095, title = {Do you know the way to SNA?: A process model for analyzing and visualizing social media data}, journal = {University of Maryland Tech Report: HCIL-2009-17}, year = {2009}, month = {2009///}, abstract = {Traces of activity left by social media users can shed lighton individual behavior, social relationships, and community efficacy. Tools and processes to analyze social traces are essential for enabling practitioners to study and nurture meaningful and sustainable social interaction. Yet such tools and processes remain in their infancy. We conducted a study of 15 graduate students who were learning to apply Social Network Analysis (SNA) to data from online communities. Based on close observations of their emergent practices, we derived the Network Analysis and Visualization (NAV) process model and identified stages where intervention from peers, experts, and an SNA tool were most useful. We show how the NAV model informs the design of SNA tools and services, education practices, and support for social media practitioners. }, author = {Hansen,D. L and Rotman,D. and Bonsignore,E. and Milic-Frayling,N. and Rodrigues,E.M. and Smith,M. and Shneiderman, Ben} } @conference {14684, title = {Dynamic software updates: a VM-centric approach}, booktitle = {Proceedings of the 2009 ACM SIGPLAN conference on Programming language design and implementation}, series = {PLDI {\textquoteright}09}, year = {2009}, month = {2009///}, pages = {1 - 12}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Software evolves to fix bugs and add features. Stopping and restarting programs to apply changes is inconvenient and often costly. Dynamic software updating (DSU) addresses this problem by updating programs while they execute, but existing DSU systems for managed languages do not support many updates that occur in practice and are inefficient. This paper presents the design and implementation of Jvolve, a DSU-enhanced Java VM. Updated programs may add, delete, and replace fields and methods anywhere within the class hierarchy. Jvolve implements these updates by adding to and coordinating VM classloading, just-in-time compilation, scheduling, return barriers, on-stack replacement, and garbage collection. Jvolve, is safe: its use of bytecode verification and VM thread synchronization ensures that an update will always produce type-correct executions. Jvolve is flexible: it can support 20 of 22 updates to three open-source programs--Jetty web server, JavaEmailServer, and CrossFTP server--based on actual releases occurring over 1 to 2 years. Jvolve is efficient: performance experiments show that incurs no overhead during steady-state execution. These results demonstrate that this work is a significant step towards practical support for dynamic updates in virtual machines for managed languages.}, keywords = {dynamic software updating, garbage collection, virtual machine technology}, isbn = {978-1-60558-392-1}, doi = {10.1145/1542476.1542478}, url = {http://doi.acm.org/10.1145/1542476.1542478}, author = {Subramanian,Suriya and Hicks, Michael W. and McKinley,Kathryn S.} } @article {14683, title = {Dynamic software updates for Java: A VM-centric approach}, journal = {Proceedings of the ACM Conference on Programming Language Design and Implementation (PLDI)}, year = {2009}, month = {2009///}, abstract = {Software evolves to fix bugs and add features, but stopping andrestarting existing programs to take advantage of these changes can be inconvenient and costly. Dynamic software updating (DSU) addresses these problems by updating programs while they run. The challenge is to develop DSU infrastructure that is flexible, safe, and efficient{\textemdash}DSU should enable updates that are likely to occur in practice, and updated programs should be as reliable and as efficient as those started from scratch. This paper presents the design and implementation of a JVM we call JVOLVE that is enhanced with DSU support. The pa- per{\textquoteright}s key insight is that flexible, safe, and efficient DSU can be supported by naturally extending existing VM services. By piggybacking on classloading and garbage collection, JVOLVE can flexibly support additions and replacements of fields and methods anywhere within the class hierarchy, and in a manner that may alter class signatures. By utilizing bytecode verifi- cation and thread synchronization support, JVOLVE can ensure that an applied update will never violate type-safety. Finally, by employing JIT compilation, all DSU-related overhead be- fore or after an update can be effectively eliminated. Using JVOLVE, we successfully applied dynamic continuous updates corresponding to 20 of the 22 releases that occurred over nearly two years{\textquoteright} time, one update per release, for three open-source programs, Jetty web server, JavaEmailServer, and CrossFTP server. Our results indicate that the VM is well-suited to sup- port practical DSU services. }, author = {Subramanian,S. and Hicks, Michael W. and McKinley,K.S.} } @conference {14489, title = {The Dynamics of Actor Loyalty to Groups in Affiliation Networks}, booktitle = {Social Network Analysis and Mining, 2009. ASONAM {\textquoteright}09. International Conference on Advances in}, year = {2009}, month = {2009/07//}, pages = {101 - 106}, abstract = {In this paper, we introduce a method for analyzing the temporal dynamics of affiliation networks. We define affiliation groups which describe temporally related subsets of actors and describe an approach for exploring changing memberships in these affiliation groups over time. To model the dynamic behavior in these networks, we consider the concept of loyalty and introduce a measure that captures an actorpsilas loyalty to an affiliation group as the degree of dasiacommitmentpsila an actor shows to the group over time. We evaluate our measure using two real world affiliation networks: a senate bill co-sponsorship network and a dolphin network. The results show how the behavior of actors in different affiliation groups change dynamically over time, reinforcing the utility of our measure for understanding the loyalty of actors to time-varying affiliation groups.}, keywords = {actor, bill, co-sponsorship, dynamics;social, groups;affiliation, loyalty;affiliation, network;senate, network;temporal, networks;dolphin, sciences;}, doi = {10.1109/ASONAM.2009.27}, author = {Sharara,H. and Singh,L. and Getoor, Lise and Mann,J.} } @article {15579, title = {The effect of corners on the complexity of approximate range searching}, journal = {Discrete \& Computational Geometry}, volume = {41}, year = {2009}, month = {2009///}, pages = {398 - 443}, abstract = {Given an n-element point set in ℝ d , the range searching problem involves preprocessing these points so that the total weight, or for our purposes the semigroup sum, of the points lying within a given query range η can be determined quickly. In ε-approximate range searching we assume that η is bounded, and the sum is required to include all the points that lie within η and may additionally include any of the points lying within distance ε.diam(η) of η{\textquoteright}s boundary.In this paper we contrast the complexity of approximate range searching based on properties of the semigroup and range space. A semigroup (S,+) is idempotent if x+x=x for all x∈S, and it is integral if for all k>=2, the k-fold sum x+...+x is not equal to x. Recent research has shown that the computational complexity of approximate spherical range searching is significantly lower for idempotent semigroups than it is for integral semigroups in terms of the dependencies on ε. In this paper we consider whether these results can be generalized to other sorts of ranges. We show that, as with integrality, allowing sharp corners on ranges has an adverse effect on the complexity of the problem. In particular, we establish lower bounds on the worst-case complexity of approximate range searching in the semigroup arithmetic model for ranges consisting of d-dimensional unit hypercubes under rigid motions. We show that for arbitrary (including idempotent) semigroups and linear space, the query time is at least \varOmega(1/{\varepsilon }^{d-2\sqrt{d}}) . In the case of integral semigroups we prove a tighter lower bound of Ω(1/ε d-2). These lower bounds nearly match existing upper bounds for arbitrary semigroups. In contrast, we show that the improvements offered by idempotence do apply to smooth convex ranges. We say that a range is smooth if at every boundary point there is an incident Euclidean sphere that lies entirely within the range whose radius is proportional to the range{\textquoteright}s diameter. We show that for smooth ranges and idempotent semigroups, ε-approximate range queries can be answered in O(log n+(1/ε)(d-1)/2log (1/ε)) time using O(n/ε) space. We show that this is nearly tight by presenting a lower bound of Ω(log n+(1/ε)(d-1)/2). This bound is in the decision-tree model and holds irrespective of space. }, doi = {10.1007/s00454-009-9140-z}, author = {Arya,S. and Malamatos,T. and Mount, Dave} } @inbook {19635, title = {Efficient Robust Private Set Intersection}, booktitle = {Applied Cryptography and Network Security}, series = {Lecture Notes in Computer Science}, year = {2009}, month = {2009/01/01/}, pages = {125 - 142}, publisher = {Springer Berlin Heidelberg}, organization = {Springer Berlin Heidelberg}, abstract = {Computing Set Intersection privately and efficiently between two mutually mistrusting parties is an important basic procedure in the area of private data mining. Assuring robustness, namely, coping with potentially arbitrarily misbehaving (i.e., malicious) parties, while retaining protocol efficiency (rather than employing costly generic techniques) is an open problem. In this work the first solution to this problem is presented.}, keywords = {Coding and Information Theory, Computer Communication Networks, Cryptographic protocols, Data Encryption, Data Structures, Cryptology and Information Theory, Information Systems Applications (incl.Internet), Privacy Preserving Data Mining, Secure Two-party Computation, Set Intersection, Systems and Data Security}, isbn = {978-3-642-01956-2, 978-3-642-01957-9}, url = {http://link.springer.com/chapter/10.1007/978-3-642-01957-9_8}, author = {Dana Dachman-Soled and Malkin, Tal and Raykova, Mariana and Yung, Moti}, editor = {Abdalla, Michel and Pointcheval, David and Fouque, Pierre-Alain and Vergnaud, Damien} } @article {15382, title = {Electromagnetic Analysis of Plasmon-Resonance Based All-Optical Magnetic Recording}, journal = {Magnetics, IEEE Transactions on}, volume = {45}, year = {2009}, month = {2009/03//}, pages = {1634 - 1637}, abstract = {The electromagnetic analysis of plasmon-resonance-based all-optical magnetic recording is performed. This analysis is based on the treatment of plasmon resonances as an eigenvalue problem for specific boundary integral equations. The plasmon modes which can be excited in circular nanoholes and cylindrical nanoshells by circularly polarized light are theoretically and numerically studied. Dramatic enhancement of circularly polarized light intensity on the nanoscale through the excitation of specific plasmon modes in uniaxial nanostructures is demonstrated.}, keywords = {Ag;boundary, all-optical, analysis;magnetization, and, based, effects;nanoparticles;silver;surface, eigenfunctions;magnetic, equations;circular, equations;eigenvalues, integral, intensity;cylindrical, light, magnetic, modes;plasmon-resonance, nanoholes;circularly, nanoshells;eigenvalue, nanostructures;boundary, plasmon, polarized, problem;electromagnetic, recording;magnetisation, recording;silver;uniaxial, resonance;, reversal;magneto-optical, reversals;nanoparticle;plasmon}, isbn = {0018-9464}, doi = {10.1109/TMAG.2009.2012762}, author = {Mayergoyz, Issak D and Zhang,Zhenyu and McAvoy,P. and Bowen,D. and Krafft,C.} } @inbook {15436, title = {Enhancing Testing Technologies for Globalization of Software Engineering and Productivity}, booktitle = {Handbook of Research on Software Engineering and Productivity Technologies: Implications of GlobalizationHandbook of Research on Software Engineering and Productivity Technologies: Implications of Globalization}, year = {2009}, month = {2009///}, pages = {49 - 49}, publisher = {Idea Group Inc (IGI)}, organization = {Idea Group Inc (IGI)}, isbn = {1605667315, 9781605667317}, author = {Khan,A.H. and Memon, Atif M.} } @conference {16691, title = {Estimating semantic distance using soft semantic constraints in knowledge-source-corpus hybrid models}, booktitle = {Proceedings of the 2009 Conference on Empirical Methods in Natural Language Processing: Volume 2-Volume 2}, year = {2009}, month = {2009///}, pages = {775 - 783}, author = {Marton,Y. and Mohammad,S. and Resnik, Philip} } @article {18637, title = {Evaluating Attack Resiliency for Host Intrusion Detection Systems}, journal = {Journal of Information Assurance and Security}, volume = {4}, year = {2009}, month = {2009///}, pages = {001 - 009}, abstract = {Host intrusion detection systems (HIDSs) areimportant tools used to provide security to computer systems. Many HIDSs exist and security practitioners need a way to determine the optimal security solution for their environment. Current evaluations of HIDSs focus on detection accuracy and typically do not account for the possibility that an adversary may subvert the HIDS and modify the outcome. As some elements from the HIDS need to reside within the system under supervi- sion, evaluating the strength against HIDS subversion is critical. This paper defines HIDS subversion and presents HIDS resiliency as a metric of HIDS strength in the event of an attack against the system being supervised. To estimate HIDS resiliency, we evaluated the inde- pendency between the system being supervised and the HIDS. Then we integrated resiliency into current frame- works to evaluate detection accuracy. }, url = {http://www.softcomputing.net/jias/molina.pdf}, author = {Molina,J. and Michel Cukier} } @conference {18669, title = {Evaluating Files to Audit for Detecting Intrusions in FileSystem Data}, year = {2009}, month = {2009/07//}, pages = {163 - 170}, abstract = {Monitoring filesystem data is a common method used to detect intrusions. Once a computer is compromised, an attacker may alter files, add new files or delete existing files. The changes that attackers make may target any part of the filesystem, including metadata along with files (e.g., permissions, ownerships and inodes). The accuracy of detecting an intrusion depends on the data audited: if an intrusion does not manifest in the data, the intrusion will not be detected. Moreover, not all files, which contain filesystem activity, are suitable to detect intrusions, as some may fail to provide useful information. In this paper, we describe an empirical study that focused on filesystem attack activity after a SSH compromise. Three types of attacker action are considered: reconnaissance, password modification, and malware download. For each type of action, we evaluated the files to audit using metrics derived from the field of information theory and estimated with the empirical SSH compromise data.}, keywords = {authorisation, Bayes methods, Bayesian metric, data auditing, empirical SSH compromise data, Entropy, entropy-based metric, file evaluation, file organisation, filesystem attack activity, filesystem data monitoring, honeypot, information theory, intrusion detection system, invasive software, malware download, meta data, optimisation, optimization problem, password modification, probability, reconnaissance action, unauthorized user}, doi = {10.1109/NCA.2009.38}, author = {Molina,J. and Michel Cukier} } @article {14573, title = {Evidence for Coregulation of Myocardial Gene Expression by MEF2 and NFAT in Human Heart Failure / CLINICAL PERSPECTIVE}, journal = {Circulation: Cardiovascular Genetics}, volume = {2}, year = {2009}, month = {2009/06/01/}, pages = {212 - 219}, abstract = {Background{\textemdash} Pathological stresses induce heart failure in animal models through activation of multiple cardiac transcription factors (TFs) working cooperatively. However, interactions among TFs in human heart failure are less understood. Here, we use genomic data to examine the evidence that 5 candidate TF families coregulate gene expression in human heart failure.Methods and Results{\textemdash} RNA isolates from failing (n=86) and nonfailing (n=16) human hearts were hybridized with Affymetrix HU133A arrays. For each gene on the array, we determined conserved MEF2, NFAT, NKX , GATA , and FOX binding motifs within the -1-kb promoter region using human-murine sequence alignments and the TRANSFAC database. Across 9076 genes expressed in the heart, TF-binding motifs tended to cluster together in nonrandom patterns within promoters of specific genes (P values ranging from 10-2 to 10-21), suggesting coregulation. We then modeled differential expression as a function of TF combinations present in promoter regions. Several combinations predicted increased odds of differential expression in the failing heart, with the highest odds ratios noted for genes containing both MEF2 and NFAT binding motifs together in the same promoter region (peak odds ratio, 3.47; P=0.005).Conclusions{\textemdash} These findings provide genomic evidence for coregulation of myocardial gene expression by MEF2 and NFAT in human heart failure. In doing so, they extend the paradigm of combinatorial regulation of gene expression to the human heart and identify new target genes for mechanistic study. More broadly, we demonstrate how integrating diverse sources of genomic data yields novel insight into human cardiovascular disorders.}, doi = {10.1161/CIRCGENETICS.108.816686}, url = {http://circgenetics.ahajournals.org/content/2/3/212.abstract}, author = {Putt,Mary E. and Hannenhalli, Sridhar and Lu,Yun and Haines,Philip and Chandrupatla,Hareesh R. and Morrisey,Edward E. and Margulies,Kenneth B. and Cappola,Thomas P.} } @conference {15494, title = {An Extensible Heuristic-Based Framework for GUI Test Case Maintenance}, booktitle = {Software Testing, Verification and Validation Workshops, 2009. ICSTW {\textquoteright}09. International Conference on}, year = {2009}, month = {2009/04//}, pages = {251 - 254}, abstract = {Graphical user interfaces (GUIs) make up a large portion of the code comprising many modern software applications. However, GUI testing differs significantly from testing of traditional software. One respect in which this is true is test case maintenance. Due to the way that GUI test cases are often implemented, relatively minor changes to the construction of the GUI can cause a large number of test case executions to malfunction, often because GUI elements referred to by the test cases have been renamed, moved, or otherwise altered. We posit that a general solution to the problem of GUI test case maintenance must be based on heuristics that attempt to match an applicationpsilas GUI elements across versions. We demonstrate the use of some heuristics with framework support. Our tool support is general in that it may be used with other heuristics if needed in the future.}, keywords = {extensible heuristic-based framework, graphical user interface, Graphical user interfaces, GUI code, GUI test case maintenance, program testing, Software maintenance}, doi = {10.1109/ICSTW.2009.11}, author = {McMaster,S. and Memon, Atif M.} } @conference {17531, title = {Fighting Spam with the NeighborhoodWatch DHT}, booktitle = {IEEE INFOCOM 2009}, year = {2009}, month = {2009/04/19/25}, pages = {1755 - 1763}, publisher = {IEEE}, organization = {IEEE}, abstract = {In this paper, we present DHTBL, an anti-spam blacklist built upon a novel secure distributed hash table (DHT). We show how DHTBL can be used to replace existing DNS-based blacklists (DNSBLs) of IP addresses of mail relays that forward spam. Implementing a blacklist on a DHT improves resilience to DoS attacks and secures message delivery, when compared to DNSBLs. However, due to the sensitive nature of the blacklist, storing the data in a peer-to-peer DHT would invite attackers to infiltrate the system. Typical DHTs can withstand fail-stop failures, but malicious nodes may provide incorrect routing information, refuse to return published items, or simply ignore certain queries. The neighborhoodwatch DHT is resilient to malicious nodes and maintains the O(logiV) bounds on routing table size and expected lookup time. NeighborhoodWatch depends on two assumptions in order to make these guarantees: (1) the existence of an on-line trusted authority that periodically contacts and issues signed certificates to each node, and (2) for every sequence of k + 1 consecutive nodes in the ID space, at least one is alive and non-malicious. We show how NeighborhoodWatch maintains many of its security properties even when the second assumption is violated. Honest nodes in NeighborhoodWatch can detect malicious behavior and expel the responsible nodes from the DHT.}, keywords = {Communications Society, computer crime, cryptography, Databases, IP addresses, IP networks, on-line trusted authority, Peer to peer computing, peer-to-peer computing, peer-to-peer distributed hash table, Postal services, Relays, Resilience, Routing, Security, table size routing, Unsolicited electronic mail}, isbn = {978-1-4244-3512-8}, doi = {10.1109/INFCOM.2009.5062095}, author = {Bender,A. and Sherwood,R. and Monner,D. and Goergen,N. and Spring, Neil and Bhattacharjee, Bobby} } @conference {13773, title = {Fluency, adequacy, or HTER?: exploring different human judgments with a tunable MT metric}, booktitle = {Proceedings of the Fourth Workshop on Statistical Machine Translation}, series = {StatMT {\textquoteright}09}, year = {2009}, month = {2009///}, pages = {259 - 268}, publisher = {Association for Computational Linguistics}, organization = {Association for Computational Linguistics}, address = {Stroudsburg, PA, USA}, abstract = {Automatic Machine Translation (MT) evaluation metrics have traditionally been evaluated by the correlation of the scores they assign to MT output with human judgments of translation performance. Different types of human judgments, such as Fluency, Adequacy, and HTER, measure varying aspects of MT performance that can be captured by automatic MT metrics. We explore these differences through the use of a new tunable MT metric: TER-Plus, which extends the Translation Edit Rate evaluation metric with tunable parameters and the incorporation of morphology, synonymy and paraphrases. TER-Plus was shown to be one of the top metrics in NIST{\textquoteright}s Metrics MATR 2008 Challenge, having the highest average rank in terms of Pearson and Spearman correlation. Optimizing TER-Plus to different types of human judgments yields significantly improved correlations and meaningful changes in the weight of different types of edits, demonstrating significant differences between the types of human judgments.}, url = {http://dl.acm.org/citation.cfm?id=1626431.1626480}, author = {Snover,Matthew and Madnani,Nitin and Dorr, Bonnie J and Schwartz,Richard} } @article {14614, title = {Gene Profiling of Human Adipose Tissue During Evoked Inflammation In Vivo}, journal = {DiabetesDiabetes}, volume = {58}, year = {2009}, month = {2009/10/01/}, pages = {2211 - 2219}, abstract = {OBJECTIVE Adipose inflammation plays a central role in obesity-related metabolic and cardiovascular complications. However, few human adipose-secreted proteins are known to mediate these processes. We hypothesized that microarray mRNA profiling of human adipose during evoked inflammation could identify novel adipocytokines.RESEARCH DESIGN AND METHODS Healthy human volunteers (n = 14) were treated with intravenous endotoxin (3 ng/kg lipopolysaccharide [LPS]) and underwent subcutaneous adipose biopsies before and after LPS. On Affymetrix U133Plus 2.0 arrays, adipose mRNAs modulated >1.5-fold (with P < 0.00001) were selected. SignalP 3.0 and SecretomeP 2.0 identified genes predicted to encode secreted proteins. Of these, 86 candidates were chosen for validation in adipose from an independent human endotoxemia protocol (N = 7, with 0.6 ng/kg LPS) and for exploration of cellular origin in primary human adipocytes and macrophages in vitro. RESULTS Microarray identified 776 adipose genes modulated by LPS; 298 were predicted to be secreted. Of detectable prioritized genes, 82 of 85 (96\% [95\% CI 90{\textendash}99]) were upregulated (fold changes >1.0) during the lower-dose (LPS 0.6 ng/kg) validation study and 51 of 85 (59\% [49{\textendash}70]) were induced greater than 1.5-fold. Treatment of primary adipocytes with LPS and macrophage polarization to M1 proinflammatory phenotype increased expression by 1.5-fold for 58 and 73\% of detectable genes, respectively. CONCLUSIONS We demonstrate that evoked inflammation of human adipose in vivo modulated expression of multiple genes likely secreted by adipocytes and monocytes. These included established adipocytokines and chemokines implicated in recruitment and activation of lymphocytes, adhesion molecules, antioxidants, and several novel genes with unknown function. Such candidates may represent biomarkers and therapeutic targets for obesity-related complications. }, isbn = {0012-1797, 1939-327X}, doi = {10.2337/db09-0256}, url = {http://diabetes.diabetesjournals.org/content/58/10/2211}, author = {Shah,Rachana and Lu,Yun and Hinkle,Christine C and McGillicuddy,Fiona C and Kim,Roy and Hannenhalli, Sridhar and Cappola,Thomas P. and Heffron,Sean and Wang,XingMei and Mehta,Nehal N and Putt,Mary and Reilly,Muredach P} } @conference {13778, title = {Generating high-coverage semantic orientation lexicons from overtly marked words and a thesaurus}, booktitle = {Proceedings of the 2009 Conference on Empirical Methods in Natural Language Processing: Volume 2 - Volume 2}, series = {EMNLP {\textquoteright}09}, year = {2009}, month = {2009///}, pages = {599 - 608}, publisher = {Association for Computational Linguistics}, organization = {Association for Computational Linguistics}, address = {Stroudsburg, PA, USA}, abstract = {Sentiment analysis often relies on a semantic orientation lexicon of positive and negative words. A number of approaches have been proposed for creating such lexicons, but they tend to be computationally expensive, and usually rely on significant manual annotation and large corpora. Most of these methods use WordNet. In contrast, we propose a simple approach to generate a high-coverage semantic orientation lexicon, which includes both individual words and multi-word expressions, using only a Roget-like thesaurus and a handful of affixes. Further, the lexicon has properties that support the Polyanna Hypothesis. Using the General Inquirer as gold standard, we show that our lexicon has 14 percentage points more correct entries than the leading WordNet-based high-coverage lexicon (SentiWordNet). In an extrinsic evaluation, we obtain significantly higher performance in determining phrase polarity using our thesaurus-based lexicon than with any other. Additionally, we explore the use of visualization techniques to gain insight into the our algorithm beyond the evaluations mentioned above.}, isbn = {978-1-932432-62-6}, url = {http://dl.acm.org/citation.cfm?id=1699571.1699591}, author = {Mohammad,Saif and Dunne,Cody and Dorr, Bonnie J} } @article {13780, title = {Generating surveys of scientific paradigms}, journal = {Proceedings of HLT-NAACL}, year = {2009}, month = {2009///}, abstract = {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. }, author = {Mohammad,S. and Dorr, Bonnie J and Egan,M. and Hassan,A. and Muthukrishan,P. and Qazvinian,V. and Radev,D. and Zajic, David} } @article {12896, title = {Genome assortment, not serogroup, defines Vibrio cholerae pandemic strains}, journal = {Nature}, year = {2009}, month = {2009///}, abstract = {Vibrio cholerae, the causative agent of cholera, is a bacterium autochthonous to the aquatic environment, and a serious public health threat. V. cholerae serogroup O1 is responsible for the previous two cholera pandemics, in which classical and El Tor biotypes were dominant in the 6th and the current 7th pandemics, respectively. Cholera researchers continually face newly emerging and re-emerging pathogenic clones carrying combinations of new serogroups as well as of phenotypic and genotypic properties. These genotype and phenotype changes have hampered control of the disease. Here we compare the complete genome sequences of 23 strains of V. cholerae isolated from a variety of sources and geographical locations over the past 98 years in an effort to elucidate the evolutionary mechanisms governing genetic diversity and genesis of new pathogenic clones. The genome-based phylogeny revealed 12 distinct V. cholerae phyletic lineages, of which one, designated the V. cholerae core genome (CG), comprises both O1 classical and EI Tor biotypes. All 7th pandemic clones share nearly identical gene content, i.e., the same genome backbone. The transition from 6th to 7th pandemic strains is defined here as a {\textquoteright}shift{\textquoteright} between pathogenic clones belonging to the same O1 serogroup, but from significantly different phyletic lineages within the CG clade. In contrast, transition among clones during the present 7th pandemic period can be characterized as a {\textquoteright}drift{\textquoteright} between clones, differentiated mainly by varying composition of laterally transferred genomic islands, resulting in emergence of variants, exemplified by V.cholerae serogroup O139 and V.cholerae O1 El Tor hybrid clones that produce cholera toxin of classical biotype. Based on the comprehensive comparative genomics presented in this study it is concluded that V. cholerae undergoes extensive genetic recombination via lateral gene transfer, and, therefore, genome assortment, not serogroup, should be used to define pathogenic V. cholerae clones.}, keywords = {59; CHOLERA; GENES; GENETICS; GENOTYPE; ISLANDS; ORIGIN; PHENOTYPE; PUBLIC HEALTH; RECOMBINATION; STRAINS; TOXINS}, url = {http://www.osti.gov/energycitations/servlets/purl/962365-icnke9/}, author = {Brettin,Thomas S[Los Alamos National Laboratory and Bruce,David C[Los Alamos National Laboratory and Challacombe,Jean F[Los Alamos National Laboratory and Detter,John C[Los Alamos National Laboratory and Han,Cliff S[Los Alamos National Laboratory and Munik,A. C[Los Alamos National Laboratory and Chertkov,Olga[Los Alamos National Laboratory and Meincke,Linda[Los Alamos National Laboratory and Saunders,Elizabeth[Los Alamos National Laboratory and Choi,Seon Y[SEOUL NATL UNIV and Haley,Bradd J[U MARYLAND and Taviani,Elisa[U MARYLAND and Jeon,Yoon-Seong[INTL VACCINE INST SEOUL and Kim,Dong Wook[INTL VACCINE INST SEOUL and Lee,Jae-Hak[SEOUL NATL UNIV and Walters,Ronald A[PNNL and Hug,Anwar[NATL INST CHOLERIC ENTERIC DIS and Rita R Colwell} } @article {17186, title = {HEALTH AND WELLBEING}, journal = {The fourth paradigm: data-intensive scientific discovery}, year = {2009}, month = {2009///}, pages = {57 - 57}, author = {Gillam,M. and Feied,C. and MOODY,E. and Shneiderman, Ben and Smith,M. and DICKASON,J.} } @inbook {19638, title = {Improved Non-committing Encryption with Applications to Adaptively Secure Protocols}, booktitle = {Advances in Cryptology {\textendash} ASIACRYPT 2009}, series = {Lecture Notes in Computer Science}, year = {2009}, month = {2009/01/01/}, pages = {287 - 302}, publisher = {Springer Berlin Heidelberg}, organization = {Springer Berlin Heidelberg}, abstract = {We present a new construction of non-committing encryption schemes. Unlike the previous constructions of Canetti et al. (STOC {\textquoteright}96) and of Damg{\r a}rd and Nielsen (Crypto {\textquoteright}00), our construction achieves all of the following properties: Optimal round complexity. Our encryption scheme is a 2-round protocol, matching the round complexity of Canetti et al. and improving upon that in Damg{\r a}rd and Nielsen. Weaker assumptions. Our construction is based on trapdoor simulatable cryptosystems, a new primitive that we introduce as a relaxation of those used in previous works. We also show how to realize this primitive based on hardness of factoring. Improved efficiency. The amortized complexity of encrypting a single bit is O(1) public key operations on a constant-sized plaintext in the underlying cryptosystem. As a result, we obtain the first non-committing public-key encryption schemes under hardness of factoring and worst-case lattice assumptions; previously, such schemes were only known under the CDH and RSA assumptions. Combined with existing work on secure multi-party computation, we obtain protocols for multi-party computation secure against a malicious adversary that may adaptively corrupt an arbitrary number of parties under weaker assumptions than were previously known. Specifically, we obtain the first adaptively secure multi-party protocols based on hardness of factoring in both the stand-alone setting and the UC setting with a common reference string.}, keywords = {adaptive corruption, Algorithm Analysis and Problem Complexity, Applications of Mathematics, Data Encryption, Data Structures, Cryptology and Information Theory, Discrete Mathematics in Computer Science, non-committing encryption, public-key encryption, secure multi-party computation, Systems and Data Security}, isbn = {978-3-642-10365-0, 978-3-642-10366-7}, url = {http://link.springer.com/chapter/10.1007/978-3-642-10366-7_17}, author = {Choi, Seung Geol and Dana Dachman-Soled and Malkin, Tal and Wee, Hoeteck}, editor = {Matsui, Mitsuru} } @conference {16679, title = {Improved statistical machine translation using monolingually-derived paraphrases}, booktitle = {Proceedings of the 2009 Conference on Empirical Methods in Natural Language Processing: Volume 1-Volume 1}, year = {2009}, month = {2009///}, pages = {381 - 390}, author = {Marton,Y. and Callison-Burch,C. and Resnik, Philip} } @conference {13101, title = {Incremental Multiple Kernel Learning for object recognition}, booktitle = {Computer Vision, 2009 IEEE 12th International Conference on}, year = {2009}, month = {2009/10/29/2}, pages = {638 - 645}, abstract = {A good training dataset, representative of the test images expected in a given application, is critical for ensuring good performance of a visual categorization system. Obtaining task specific datasets of visual categories is, however, far more tedious than obtaining a generic dataset of the same classes. We propose an Incremental Multiple Kernel Learning (IMKL) approach to object recognition that initializes on a generic training database and then tunes itself to the classification task at hand. Our system simultaneously updates the training dataset as well as the weights used to combine multiple information sources. We demonstrate our system on a vehicle classification problem in a video stream overlooking a traffic intersection. Our system updates itself with images of vehicles in poses more commonly observed in the scene, as well as with image patches of the background, leading to an increase in performance. A considerable change in the kernel combination weights is observed as the system gathers scene specific training data over time. The system is also seen to adapt itself to the illumination change in the scene as day transitions to night.}, doi = {10.1109/ICCV.2009.5459179}, author = {Kembhavi,Aniruddha and Siddiquie,Behjat and Miezianko,Roland and McCloskey,Scott and Davis, Larry S.} } @conference {15491, title = {An Initial Characterization of Industrial Graphical User Interface Systems}, booktitle = {Software Testing Verification and Validation, 2009. ICST {\textquoteright}09. International Conference on}, year = {2009}, month = {2009/04//}, pages = {11 - 20}, abstract = {To date we have developed and applied numerous model-based GUI testing techniques; however, we are unable to provide definitive improvement schemes to real-world GUI test planners, as our data was derived from open source applications, small compared to industrial systems. This paper presents a study of three industrial GUI-based software systems developed at ABB, including data on classified defects detected during late-phase testing and customer usage, test suites, and source code change metrics. The results show that (1) 50\% of the defects found through the GUI are categorized as data access and handling, control flow and sequencing, correctness, and processing defects, (2) system crashes exposed defects 12-19\% of the time, and (3) GUI and non-GUI components are constructed differently, in terms of source code metrics.}, keywords = {Graphical user interfaces, GUI-based software systems, industrial graphical user interface systems, model-based GUI testing techniques, program testing, software metrics, source code change metrics}, doi = {10.1109/ICST.2009.11}, author = {Brooks,P.A. and Robinson,B.P. and Memon, Atif M.} } @article {18751, title = {Integrated product and process design for a flapping wing drive mechanism}, journal = {Journal of Mechanical Design}, volume = {131}, year = {2009}, month = {2009///}, pages = {061006 - 061006}, author = {Bejgerowski,W. and Ananthanarayanan,A. and Mueller,D. and Gupta,S.K.} } @conference {17242, title = {Interacting with eHealth: towards grand challenges for HCI}, booktitle = {Proceedings of the 27th international conference extended abstracts on Human factors in computing systems}, year = {2009}, month = {2009///}, pages = {3309 - 3312}, abstract = {While health records are increasingly stored electronically, we, as citizens, have little access to this data about ourselves. We are not used to thinking of these official records either as ours or as useful to us. We increasingly turn to the Web, however, to query any ache, pain or health goal we may have before consulting with health care professionals. Likewise, for proactive health care such as nutrition or fitness, or to find fellow-sufferers for post diagnosis support, we turn to online resources. There is a potential disconnect between points at which professional and lay eHealth data and resources intersect for preventative or proactive health care. Such gaps in information sharing may have direct impact on practices we decide to take up, the care we seek, or the support professionals offer. In this panel, we consider several places within proactive, preventative health care in particular HCI has a role towards enhancing health knowledge discovery and health support interaction. Our goal is to demonstrate how now is the time for eHealth to come to the forefront of the HCI research agenda.}, author = {Andr{\'e},P. and White,R. and Tan,D. and Berners-Lee,T. and Consolvo,S. and Jacobs,R. and Kohane,I. and Le Dantec,C.A. and Mamykina,L. and Marsden,G.} } @inbook {13797, title = {Interlingual annotation of multilingual text corpora and FrameNet}, booktitle = {Multilingual FrameNets in Computational LexicographyMultilingual FrameNets in Computational Lexicography}, volume = {200}, year = {2009}, month = {2009/07/14/}, pages = {287 - 318}, publisher = {Mouton de Gruyter}, organization = {Mouton de Gruyter}, address = {Berlin, New York}, isbn = {978-3-11-021296-9, 978-3-11-021297-6}, url = {http://www.degruyter.com/view/books/9783110212976/9783110212976.4.287/9783110212976.4.287.xml}, author = {Farwell,David and Dorr, Bonnie J and Habash,Nizar and Helmreich,Stephen and Hovy,Eduard and Green,Rebecca and Levin,Lori and Miller,Keith and Mitamura,Teruko and Rambow,Owen and Reeder,Flo and Siddharthan,Advaith}, editor = {Bisang,Walter and Hock,Hans Henrich and Winter,Werner and Boas,Hans C.} } @conference {15485, title = {Introducing a test suite similarity metric for event sequence-based test cases}, booktitle = {Software Maintenance, 2009. ICSM 2009. IEEE International Conference on}, year = {2009}, month = {2009/09//}, pages = {243 - 252}, abstract = {Most of today{\textquoteright}s event driven software (EDS) systems are tested using test cases that are carefully constructed as sequences of events; they test the execution of an event in the context of its preceding events. Because sizes of these test suites can be extremely large, researchers have developed techniques, such as reduction and minimization, to obtain test suites that are ldquosimilarrdquo to the original test suite, but smaller. Existing similarity metrics mostly use code coverage; they do not consider the contextual relationships between events. Consequently, reduction based on such metrics may eliminate desirable test cases. In this paper, we present a new parameterized metric, CONTeSSi(n) which uses the context of n preceding events in test cases to develop a new context-aware notion of test suite similarity for EDS. This metric is defined and evaluated by comparing four test suites for each of four open source applications. Our results show that CONT eSSi(n) is a better indicator of the similarity of EDS test suites than existing metrics.}, keywords = {event driven software systems, event sequence-based test cases, open source systems, program testing, public domain software, software metrics, Software testing, test suite similarity metric}, doi = {10.1109/ICSM.2009.5306305}, author = {Brooks,P.A. and Memon, Atif M.} } @conference {19455, title = {It{\textquoteright}s Not Easy Being Green: Understanding Home Computer Power Management}, booktitle = {SIGCHI {\textquoteright}09}, series = {CHI {\textquoteright}09}, year = {2009}, month = {2009///}, pages = {1033 - 1042}, publisher = {ACM}, organization = {ACM}, abstract = {Although domestic computer use is increasing, most efforts to reduce energy use through improved power management have focused on computers in the workplace. We studied 20 households to understand how people use power management strategies on their home computers. We saw computers in the home, particularly desktop computers, are left on much more than they are actively used suggesting opportunities for economic and energy savings. However, for most of our participants, the economic incentives were too minor to motivate them to turn off devices when not in use, especially given other frustrations such as long boot up times. We suggest research directions for home computer power management that could help users be more green without having to dramatically change their home computing habits.}, keywords = {home computer use, power management, Sustainability}, isbn = {978-1-60558-246-7}, url = {http://doi.acm.org/10.1145/1518701.1518860}, author = {Marshini Chetty and Brush, A.J. Bernheim and Meyers, Brian R. and Johns, Paul} } @article {15552, title = {Maintaining nets and net trees under incremental motion}, journal = {Algorithms and Computation}, year = {2009}, month = {2009///}, pages = {1134 - 1143}, abstract = {The problem of maintaining geometric structures for points in motion has been well studied over the years. Much theoretical work to date has been based on the assumption that point motion is continuous and predictable, but in practice, motion is typically presented incrementally in discrete time steps and may not be predictable. We consider the problem of maintaining a data structure for a set of points undergoing such incremental motion. We present a simple online model in which two agents cooperate to maintain the structure. One defines the data structure and provides a collection of certificates, which guarantee the structure{\textquoteright}s correctness. The other checks that the motion over time satisfies these certificates and notifies the first agent of any violations.We present efficient online algorithms for maintaining both nets and net trees for a point set undergoing incremental motion in a space of constant dimension. We analyze our algorithms{\textquoteright} efficiencies by bounding their competitive ratios relative to an optimal algorithm. We prove a constant factor competitive ratio for maintaining a slack form of nets, and our competitive ratio for net trees is proportional to the square of the tree{\textquoteright}s height. }, doi = {10.1007/978-3-642-10631-6_114}, author = {Cho,M. and Mount, Dave and Park,E.} } @conference {18513, title = {Measuring vlan-induced dependencies on a campus network}, booktitle = {Proceedings of the ACM SIGCOMM Internet measurement conference}, year = {2009}, month = {2009///}, abstract = {Many enterprise, campus, and data-center networks have complexlayer-2 virtual LANs ({\textquotedblleft}VLANs{\textquotedblright}) underlying the layer-3 network. The interac- tion between layer-2 and layer-3 topologies can introduce dependencies that are not visible when analyzed solely from layer 3; this paper studies the extent and impact of these dependencies. We first present EtherTrace, a tool that infers the layer-2 topology using data passively collected from Ethernet switches. Using this tool, we infer the layer-2 topology for a large campus network and compare the two topologies. Our comparison yields some striking initial findings: almost 70\% of layer-2 edges are shared by 10 or more IP edges, and a single layer-2 edge may be shared by as many as 34 different IP edges. This sharing has significant implications for both robustness and for network tomography. Applying network tomography to the IP topology to diagnose failures caused by layer-2 devices results in only 54\% accuracy, compared to 100\% accuracy when tomography is performed at layer 2. }, author = {Mansy,A. and Tariq,M.B. and Feamster, Nick and Ammar,M.} } @article {17753, title = {Method and system for optimal data diagnosis}, volume = {10/774,516}, year = {2009}, month = {2009/01/06/}, abstract = {In the method and system for automated data diagnosis, a relational data base is formed of attributes characterizing an entity. The framework computes optimal diagnosis for a diagnostic inference problem which separates the desirable attributes from the undesirable attributes. The user of the system is permitted to specify certain parameters based on which the system computes a set of optimal or near optimal association rules between the attributes of a specific process, product, or other entity. The system and method of the present invention considers the simplicity of conditions in addition to support and confidence when ordering them, contributes the notion of tight conditions and semi-equivalence to remove redundant rules, uses the concept of the top fringes which allows near optimal conditions to be found, in addition to optimal conditions. Numeric as well as non-numeric attributes can be analyzed.}, url = {http://www.google.com/patents?id=fHnVAAAAEBAJ}, author = {V.S. Subrahmanian and Ernst,Jason}, editor = {University of Maryland} } @article {15390, title = {Modeling and Testing of Ethernet Transformers}, journal = {Magnetics, IEEE Transactions on}, volume = {45}, year = {2009}, month = {2009/10//}, pages = {4793 - 4796}, abstract = {In this paper, novel techniques for the testing and identification of lumped parameters of equivalent circuits for Ethernet transformers are presented. It is demonstrated experimentally and theoretically that resonance phenomena may occur in the loop formed by leakage inductances and cross-winding capacitance. This resonance may corrupt the pass band of the transformers transfer characteristic for differential-mode signals.}, keywords = {area, capacitance;differential-mode, characteristic;local, Ethernet, identification;lumped, inductances;lumped, networks;transformers;, PARAMETERS, phenomena;transformers, signals;leakage, testing;resonance, transfer, transformers;cross-winding}, isbn = {0018-9464}, doi = {10.1109/TMAG.2009.2023918}, author = {Bowen,D. and Mayergoyz, Issak D and Zhang,Zhenyu and McAvoy,P. and Krafft,C. and Kroop,D.} } @conference {13305, title = {Morphology analysis of 3D scalar fields based on morse theory and discrete distortion}, booktitle = {Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems}, series = {GIS {\textquoteright}09}, year = {2009}, month = {2009///}, pages = {187 - 196}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {We investigate a morphological approach to the analysis and understanding of 3D scalar fields defined by volume data sets. We consider a discrete model of the 3D field obtained by discretizing its domain into a tetrahedral mesh. We use Morse theory as the basic mathematical tool which provides a segmentation of the graph of the scalar field based on relevant morphological features (such as critical points). Since the graph of a discrete 3D field is a tetrahedral hypersurface in 4D space, we measure the distortion of the transformation which maps the tetrahedral decomposition of the domain of the scalar field into the tetrahedral mesh representing its graph in R4, and we call it discrete distortion. We develop a segmentation algorithm to produce a Morse decompositions associated with the scalar field and its discrete distortion. We use a merging procedure to control the number of 3D regions in the segmentation output. Experimental results show the validity of our approach.}, keywords = {curvature, morphological analysis, Morse theory, segmentation}, isbn = {978-1-60558-649-6}, doi = {10.1145/1653771.1653799}, url = {http://doi.acm.org/10.1145/1653771.1653799}, author = {Mesmoudi,Mohammed Mostefa and De Floriani, Leila and Magillo,Paola} } @article {18534, title = {A Narrow Waist for Multipath Routing}, year = {2009}, month = {2009///}, institution = {School of Computer Science, Georgia Tech}, abstract = {Many applications can use multipath routing to improvereliability or throughput, and many multipath routing pro- tocols exist. Despite this diversity of mechanisms and applications, no common interface exists to allow an ap- plication to select these paths. This paper presents a de- sign for such a common interface, called path bits. Path bits are a small string of opaque, semantic-free bits in a packet header; these bits have a simple property: changing a packet{\textquoteright}s path bits should, with high probability, result in the packet taking a different path to the destination. This paper presents the design of path bits and demonstrates that they are simple enough to be easily implemented in both hardware and software and expressive enough to sup- port a variety of applications that can benefit from mul- tipath routing. We present both hardware and software implementations of multipath routing protocols that im- plement the path bits abstraction, as well as implementa- tions of applications that can use this abstraction with only small modifications. }, author = {Motiwala,M. and bin Tariq,M. and Anwer,B. and Andersen,D. and Feamster, Nick} } @article {15391, title = {Nonlinear Resonant and Chaotic Dynamics in Microwave Assisted Magnetization Switching}, journal = {Magnetics, IEEE Transactions on}, volume = {45}, year = {2009}, month = {2009/10//}, pages = {3950 - 3953}, abstract = {The switching process of a uniformly magnetized magnetic nanoparticle is considered. The particle is subject to applied fields having both dc and linearly-polarized radio-frequency (RF) components. The possibility of using the RF power to obtain a reduced coercivity of the particle is related to the onset of chaotic magnetization dynamics for moderately low values of the RF field amplitude. Perturbation technique for the evaluation of the reduced coercive field is developed and applied to the microwave assisted switching of the particle. Numerical simulations confirm the predictions of the theory.}, keywords = {amplitude;chaotic, components;magnetic, dynamical, dynamics;coercive, dynamics;numerical, field, field;coercivity;linearly-polarized, force;magnetic, magnetization, nanoparticle;microwave-assisted, particles;magnetic, radiofrequency, resonant, RF, simulations;perturbation, switching;nanoparticles;nonlinear, switching;nonlinear, systems;perturbation, technique;chaos;coercive, theory;}, isbn = {0018-9464}, doi = {10.1109/TMAG.2009.2023242}, author = {d{\textquoteright}Aquino,M. and Serpico,C. and Bertotti,G. and Mayergoyz, Issak D and Bonin,R.} } @conference {15258, title = {Online allocation of display advertisements subject to advanced sales contracts}, booktitle = {Proceedings of the Third International Workshop on Data Mining and Audience Intelligence for Advertising}, series = {ADKDD {\textquoteright}09}, year = {2009}, month = {2009///}, pages = {69 - 77}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {In this paper we propose a utility model that accounts for both sales and branding advertisers. We first study the computational complexity of optimization problems related to both online and offline allocation of display advertisements. Next, we focus on a particular instance of the online allocation problem, and design a simple online algorithm with provable approximation guarantees. Our algorithm is near optimal as is shown by a matching lower bound. Finally, we report on experiments to establish actual case behavior on some real datasets, with encouraging results.}, keywords = {display advertising, modeling, online algorithms, OPTIMIZATION, simulation}, isbn = {978-1-60558-671-7}, doi = {10.1145/1592748.1592758}, url = {http://doi.acm.org/10.1145/1592748.1592758}, author = {Alaei,Saeed and Arcaute,Esteban and Khuller, Samir and Ma,Wenjing and Malekian,Azarakhsh and Tomlin,John} } @article {18538, title = {An OpenFlow switch element for Click}, journal = {Symposium on Click Modular Router}, year = {2009}, month = {2009///}, author = {Mundada,Y. and Sherwood,R. and Feamster, Nick} } @article {17993, title = {Optical interconnect structure in a computer system and method of transporting data between processing elements and memory through the optical interconnect structure}, volume = {10/529,310}, year = {2009}, month = {2009/03/17/}, abstract = {A multi-chip processor/memory arrangement replacing a large computer chip, includes a number of modules each including processing elements, registers, and/or memories interconnected by an optical interconnection fabric providing an all-to-all interconnection between the chips, so that the memory cells on each chip represent a portion of shared memory. The optical interconnect fabric is responsible for transporting data between the chips while processing elements on each chip dominate processing. Each chip is manufactured in mass production so that the entire processor/memory arrangement is fabricated in an inexpensive and simplified technology process. The optical communication fabric is based on waveguide technology and includes a number of waveguides, the layout of which follows certain constraints. The waveguides can intersect each other in the single plane, or alternatively, a double layer of waveguide structures and bent over approach may be used. Specific layout patterns of...}, url = {http://www.google.com/patents?id=wgS6AAAAEBAJ}, author = {Vishkin, Uzi}, editor = {University of Maryland} } @article {14713, title = {Passive aggressive measurement with MGRP}, journal = {SIGCOMM Comput. Commun. Rev.}, volume = {39}, year = {2009}, month = {2009/08//}, pages = {279 - 290}, abstract = {We present the Measurement Manager Protocol (MGRP), an in-kernel service that schedules and transmits probes on behalf of active measurement tools. Unlike prior measurement services, MGRP transparently piggybacks application packets inside the often significant amounts of empty padding contained in typical probes. Using MGRP thus combines the modularity, flexibility, and accuracy of standalone active measurement tools with the lower overhead of passive measurement techniques. Microbenchmark experiments show that the resulting bandwidth savings makes it possible to measure the network accurately, but faster and more aggressively than without piggybacking, and with few ill effects to piggybacked application or competing traffic. When using MGRP to schedule measurements on behalf of MediaNet, an overlay service that adaptively schedules media streams, we show MediaNet can achieve significantly higher streaming rates under the same network conditions.}, keywords = {active, available bandwidth, kernel module, passive, piggybacking, probing, streaming, transport protocol}, isbn = {0146-4833}, doi = {10.1145/1594977.1592601}, url = {http://doi.acm.org/10.1145/1594977.1592601}, author = {Papageorge,Pavlos and McCann,Justin and Hicks, Michael W.} } @conference {13462, title = {Predicting and Controlling System-Level Parameters of Multi-Agent Systems}, booktitle = {2009 AAAI Fall Symposium Series}, year = {2009}, month = {2009/10/30/}, abstract = {Boid flocking is a system in which several individual agents follow three simple rules to generate swarm-level flocking behavior. To control this system, the user must adjust the agent program parameters, which indirectly modifies the flocking behavior. This is unintuitive because the properties of the flocking behavior are non-explicit in the agent program. In this paper, we discuss a domain-independent approach for detecting and controlling two emergent properties of boids: density and a qualitative threshold effect of swarming vs. flocking. Also, we discuss the possibility of applying this approach to detecting and controlling traffic jams in traffic simulations.}, keywords = {Complex Adaptive Systems, System-level behavior}, url = {http://www.aaai.org/ocs/index.php/FSS/FSS09/paper/viewPaper/909}, author = {Miner,Don and desJardins, Marie} } @article {12892, title = {Predicting the distribution of Vibrio spp. in the Chesapeake Bay: a Vibrio cholerae case study}, journal = {EcoHealth}, volume = {6}, year = {2009}, month = {2009///}, pages = {378 - 389}, abstract = {Vibrio cholerae, the causative agent of cholera, is a naturally occurring inhabitant of the Chesapeake Bay and serves as a predictor for other clinically important vibrios, including Vibrio parahaemolyticus and Vibrio vulnificus. A system was constructed to predict the likelihood of the presence of V. cholerae in surface waters of the Chesapeake Bay, with the goal to provide forecasts of the occurrence of this and related pathogenic Vibrio spp. Prediction was achieved by driving an available multivariate empirical habitat model estimating the probability of V. cholerae within a range of temperatures and salinities in the Bay, with hydrodynamically generated predictions of ambient temperature and salinity. The experimental predictions provided both an improved understanding of the in situ variability of V. cholerae, including identification of potential hotspots of occurrence, and usefulness as an early warning system. With further development of the system, prediction of the probability of the occurrence of related pathogenic vibrios in the Chesapeake Bay, notably V. parahaemolyticus and V. vulnificus, will be possible, as well as its transport to any geographical location where sufficient relevant data are available.}, doi = {10.1007/s10393-009-0273-6}, author = {Constantin de Magny,G. and Long,W. and Brown,C. W. and Hood,R. R. and Huq,A. and Murtugudde,R. and Rita R Colwell} } @conference {15486, title = {Prioritizing component compatibility tests via user preferences}, booktitle = {Software Maintenance, 2009. ICSM 2009. IEEE International Conference on}, year = {2009}, month = {2009/09//}, pages = {29 - 38}, abstract = {Many software systems rely on third-party components during their build process. Because the components are constantly evolving, quality assurance demands that developers perform compatibility testing to ensure that their software systems build correctly over all deployable combinations of component versions, also called configurations. However, large software systems can have many configurations, and compatibility testing is often time and resource constrained. We present a prioritization mechanism that enhances compatibility testing by examining the ldquomost importantrdquo configurations first, while distributing the work over a cluster of computers. We evaluate our new approach on two large scientific middleware systems and examine tradeoffs between the new prioritization approach and a previously developed lowest-cost-configuration-first approach.}, keywords = {compatibility testing prioritization, component configurations, computer clusters, Middleware, Middleware systems, object-oriented programming, program testing, software engineering, Software systems, third-party components, user preferences}, doi = {10.1109/ICSM.2009.5306357}, author = {Yoon,Il-Chul and Sussman, Alan and Memon, Atif M. and Porter, Adam} } @conference {17636, title = {On random sampling auctions for digital goods}, booktitle = {Proceedings of the 10th ACM conference on Electronic commerce}, series = {EC {\textquoteright}09}, year = {2009}, month = {2009///}, pages = {187 - 196}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {In the context of auctions for digital goods, an interesting Random Sampling Optimal Price auction (RSOP) has been proposed by Goldberg, Hartline and Wright; this leads to a truthful mechanism. Since random sampling is a popular approach for auctions that aims to maximize the seller{\textquoteright}s revenue, this method has been analyzed further by Feige, Flaxman, Hartline and Kleinberg, who have shown that it is 15-competitive in the worst case -- which is substantially better than the previously proved bounds but still far from the conjectured competitive ratio of 4. In this paper, we prove that RSOP is indeed 4-competitive for a large class of instances in which the number λ of bidders receiving the item at the optimal uniform price, is at least 6. We also show that it is 4.68 competitive for the small class of remaining instances thus leaving a negligible gap between the lower and upper bound. Furthermore, we develop a robust version of RSOP -- one in which the seller{\textquoteright}s revenue is, with high probability, not much below its mean -- when the above parameter λ grows large. We employ a mix of probabilistic techniques and dynamic programming to compute these bounds.}, keywords = {auction, mechanism design, random sampling}, isbn = {978-1-60558-458-4}, doi = {10.1145/1566374.1566402}, url = {http://doi.acm.org/10.1145/1566374.1566402}, author = {Alaei,Saeed and Malekian,Azarakhsh and Srinivasan, Aravind} } @article {15116, title = {Reducing complexity assumptions for statistically-hiding commitment}, journal = {Journal of cryptology}, volume = {22}, year = {2009}, month = {2009///}, pages = {283 - 310}, abstract = {We revisit the following question: what are the minimal assumptions needed to construct statistically-hiding commitment schemes? Naor et al. show how to construct such schemes based on any one-way permutation. We improve upon this by showing a construction based on any approximable preimage-size one-way function. These are one-way functions for which it is possible to efficiently approximate the number of pre-images of a given output. A special case is the class of regular one-way functions where all points in the image of the function have the same (known) number of pre-images.We also prove two additional results related to statistically-hiding commitment. First, we prove a (folklore) parallel composition theorem showing, roughly speaking, that the statistical hiding property of any such commitment scheme is amplified exponentially when multiple independent parallel executions of the scheme are carried out. Second, we show a compiler which transforms any commitment scheme which is statistically hiding against an honest-but-curious receiver into one which is statistically hiding even against a malicious receiver. }, doi = {10.1007/s00145-007-9012-8}, author = {Haitner,I. and Horvitz,O. and Katz, Jonathan and Koo,C. Y and Morselli,R. and Shaltiel,R.} } @article {14640, title = {Resistin gene variation is associated with systemic inflammation but not plasma adipokine levels, metabolic syndrome or coronary atherosclerosis in nondiabetic Caucasians}, journal = {Clinical Endocrinology}, volume = {70}, year = {2009}, month = {2009/05/01/}, pages = {698 - 705}, abstract = {Objective Resistin causes insulin resistance and diabetes in mice whereas in humans it is linked to inflammation and atherosclerosis. Few human genetic studies of resistin in inflammation and atherosclerosis have been performed. We hypothesized that the {\textendash}420C>G putative gain-of-function resistin variant would be associated with inflammatory markers and atherosclerosis but not with metabolic syndrome or adipokines in humans.Design and methods We examined the association of three resistin polymorphisms, {\textendash}852A>G, {\textendash}420C>G and +157C>T, and related haplotypes with plasma resistin, cytokines, C-reactive protein (CRP), adipokines, plasma lipoproteins, metabolic syndrome and coronary artery calcification (CAC) in nondiabetic Caucasians (n~=~851). Results Resistin levels were higher, dose-dependently, with the {\textendash}420G allele (CC 5{\textperiodcentered}9~{\textpm}~2{\textperiodcentered}7~ng/ml, GC 6{\textperiodcentered}5~{\textpm}~4{\textperiodcentered}0~ng/ml and GG 7{\textperiodcentered}2~{\textpm}~4{\textperiodcentered}8~ng/ml, trend P~=~0{\textperiodcentered}04) after age and gender adjustment [fold higher for GC~+~GG vs. CC; 1{\textperiodcentered}07~(1{\textperiodcentered}00{\textendash}1{\textperiodcentered}15), P~<~0{\textperiodcentered}05)]. The {\textendash}852A>G single nucleotide polymorphism (SNP) was associated with higher soluble tumour necrosis factor-receptor~2 (sol-TNFR2) levels in fully adjusted models [1{\textperiodcentered}06~(95\%~CI 1{\textperiodcentered}01{\textendash}1{\textperiodcentered}11), P~=~0{\textperiodcentered}01)]. The estimated resistin haplotype (GGT) was associated with sol-TNFR2 (P~=~0{\textperiodcentered}04) and the AGT haplotype was related to CRP (P~=~0{\textperiodcentered}04) in the fully adjusted models. Resistin SNPs and haplotypes were not associated with body mass index (BMI), fasting glucose, insulin resistance, metabolic syndrome, adipokines or CAC scores. Conclusions Despite modest associations with plasma resistin and inflammatory biomarkers, resistin 5' variants were not associated with metabolic parameters or coronary calcification. This suggests that resistin is an inflammatory cytokine in humans but has little influence on adiposity, metabolic syndrome or atherosclerosis. }, isbn = {1365-2265}, doi = {10.1111/j.1365-2265.2008.03375.x}, url = {http://onlinelibrary.wiley.com/doi/10.1111/j.1365-2265.2008.03375.x/abstract;jsessionid=3EAA174C4993EDEE1267334CDA36E086.d01t01}, author = {Qasim,Atif N and Metkus,Thomas S and Tadesse,Mahlet and Lehrke,Michael and Restine,Stephanie and Wolfe,Megan L and Hannenhalli, Sridhar and Cappola,Thomas and Rader,Daniel J and Reilly,Muredach P} } @article {15119, title = {Ring signatures: Stronger definitions, and constructions without random oracles}, journal = {Journal of Cryptology}, volume = {22}, year = {2009}, month = {2009///}, pages = {114 - 138}, abstract = {Ring signatures, first introduced by Rivest, Shamir, and Tauman, enable a user to sign a message so that a ring of possible signers (of which the user is a member) is identified, without revealing exactly which member of that ring actually generated the signature. In contrast to group signatures, ring signatures are completely {\textquotedblleft}ad-hoc{\textquotedblright} and do not require any central authority or coordination among the various users (indeed, users do not even need to be aware of each other); furthermore, ring signature schemes grant users fine-grained control over the level of anonymity associated with any particular signature.This paper has two main areas of focus. First, we examine previous definitions of security for ring signature schemes and suggest that most of these prior definitions are too weak, in the sense that they do not take into account certain realistic attacks. We propose new definitions of anonymity and unforgeability which address these threats, and give separation results proving that our new notions are strictly stronger than previous ones. Second, we show the first constructions of ring signature schemes in the standard model. One scheme is based on generic assumptions and satisfies our strongest definitions of security. Two additional schemes are more efficient, but achieve weaker security guarantees and more limited functionality. }, doi = {10.1007/s00145-007-9011-9}, author = {Bender,A. and Katz, Jonathan and Morselli,R.} } @article {12884, title = {RNA Colony Blot Hybridization Method for Enumeration of Culturable Vibrio Cholerae and Vibrio Mimicus Bacteria}, journal = {Applied and Environmental MicrobiologyAppl. Environ. Microbiol.}, volume = {75}, year = {2009}, month = {2009/09/01/}, pages = {5439 - 5444}, abstract = {A species-specific RNA colony blot hybridization protocol was developed for enumeration of culturable Vibrio cholerae and Vibrio mimicus bacteria in environmental water samples. Bacterial colonies on selective or nonselective plates were lysed by sodium dodecyl sulfate, and the lysates were immobilized on nylon membranes. A fluorescently labeled oligonucleotide probe targeting a phylogenetic signature sequence of 16S rRNA of V. cholerae and V. mimicus was hybridized to rRNA molecules immobilized on the nylon colony lift blots. The protocol produced strong positive signals for all colonies of the 15 diverse V. cholerae-V. mimicus strains tested, indicating 100\% sensitivity of the probe for the targeted species. For visible colonies of 10 nontarget species, the specificity of the probe was calculated to be 90\% because of a weak positive signal produced by Grimontia (Vibrio) hollisae, a marine bacterium. When both the sensitivity and specificity of the assay were evaluated using lake water samples amended with a bioluminescent V. cholerae strain, no false-negative or false-positive results were found, indicating 100\% sensitivity and specificity for culturable bacterial populations in freshwater samples when G. hollisae was not present. When the protocol was applied to laboratory microcosms containing V. cholerae attached to live copepods, copepods were found to carry approximately 10,000 to 50,000 CFU of V. cholerae per copepod. The protocol was also used to analyze pond water samples collected in an area of cholera endemicity in Bangladesh over a 9-month period. Water samples collected from six ponds demonstrated a peak in abundance of total culturable V. cholerae bacteria 1 to 2 months prior to observed increases in pathogenic V. cholerae and in clinical cases recorded by the area health clinic. The method provides a highly specific and sensitive tool for monitoring the dynamics of V. cholerae in the environment. The RNA blot hybridization protocol can also be applied to detection of other gram-negative bacteria for taxon-specific enumeration.}, isbn = {0099-2240, 1098-5336}, doi = {10.1128/AEM.02007-08}, url = {http://aem.asm.org/content/75/17/5439}, author = {Grim,Christopher J. and Zo,Young-Gun and Hasan,Nur A. and Ali,Afsar and Chowdhury,Wasimul B. and Islam,Atiqul and Rashid,Mohammed H. and Alam,Munirul and Morris,J. Glenn and Huq,Anwar and Rita R Colwell} } @article {13114, title = {Scene it or not? incremental multiple kernel learning for object detection}, journal = {Proceedings of the International Conference on Computer Vision}, year = {2009}, month = {2009///}, author = {Kembhavi,A. and Siddiquie,B. and Miezianko,R. and McCloskey,S. and Davis, Larry S. and Schwartz, W.R. and Harwood,D. and Gupta,A. and Farrell,R. and Luo,Y. and others} } @article {17655, title = {Scheduling on Unrelated Machines under Tree-Like Precedence Constraints}, journal = {Algorithmica}, volume = {55}, year = {2009}, month = {2009///}, pages = {205 - 226}, abstract = {We present polylogarithmic approximations for the R | prec | C max and R | prec |∑ j w j C j problems, when the precedence constraints are {\textquotedblleft}treelike{\textquotedblright}{\textemdash}i.e., when the undirected graph underlying the precedences is a forest. These are the first non-trivial generalizations of the job shop scheduling problem to scheduling with precedence constraints that are not just chains. These are also the first non-trivial results for the weighted completion time objective on unrelated machines with precedence constraints of any kind . We obtain improved bounds for the weighted completion time and flow time for the case of chains with restricted assignment{\textemdash}this generalizes the job shop problem to these objective functions. We use the same lower bound of {\textquotedblleft}congestion + dilation{\textquotedblright}, as in other job shop scheduling approaches (e.g. Shmoys, Stein and Wein, SIAM J. Comput. 23, 617{\textendash}632, 1994 ). The first step in our algorithm for the R | prec | C max problem with treelike precedences involves using the algorithm of Lenstra, Shmoys and Tardos to obtain a processor assignment with the congestion + dilation value within a constant factor of the optimal. We then show how to generalize the random-delays technique of Leighton, Maggs and Rao to the case of trees. For the special case of chains, we show a dependent rounding technique which leads to a bicriteria approximation algorithm for minimizing the flow time, a notoriously hard objective function.}, isbn = {0178-4617}, url = {http://dx.doi.org/10.1007/s00453-007-9004-y}, author = {Anil Kumar,V. and Marathe,Madhav and Parthasarathy,Srinivasan and Srinivasan, Aravind} } @conference {18354, title = {Sikuli: using GUI screenshots for search and automation}, booktitle = {Proceedings of the 22nd annual ACM symposium on User interface software and technology}, series = {UIST {\textquoteright}09}, year = {2009}, month = {2009///}, pages = {183 - 192}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {We present Sikuli, a visual approach to search and automation of graphical user interfaces using screenshots. Sikuli allows users to take a screenshot of a GUI element (such as a toolbar button, icon, or dialog box) and query a help system using the screenshot instead of the element{\textquoteright}s name. Sikuli also provides a visual scripting API for automating GUI interactions, using screenshot patterns to direct mouse and keyboard events. We report a web-based user study showing that searching by screenshot is easy to learn and faster to specify than keywords. We also demonstrate several automation tasks suitable for visual scripting, such as map navigation and bus tracking, and show how visual scripting can improve interactive help systems previously proposed in the literature.}, keywords = {Automation, image search, online help}, isbn = {978-1-60558-745-5}, doi = {10.1145/1622176.1622213}, url = {http://doi.acm.org/10.1145/1622176.1622213}, author = {Tom Yeh and Chang,Tsung-Hsiang and Miller,Robert C.} } @inbook {19645, title = {Simple, Black-Box Constructions of Adaptively Secure Protocols}, booktitle = {Theory of Cryptography}, series = {Lecture Notes in Computer Science}, year = {2009}, month = {2009/01/01/}, pages = {387 - 402}, publisher = {Springer Berlin Heidelberg}, organization = {Springer Berlin Heidelberg}, abstract = {We present a compiler for transforming an oblivious transfer (OT) protocol secure against an adaptive semi-honest adversary into one that is secure against an adaptive malicious adversary. Our compiler achieves security in the universal composability framework, assuming access to an ideal commitment functionality, and improves over previous work achieving the same security guarantee in two ways: it uses black-box access to the underlying protocol and achieves a constant multiplicative overhead in the round complexity. As a corollary, we obtain the first constructions of adaptively secure protocols in the stand-alone model using black-box access to a low-level primitive.}, keywords = {Algorithm Analysis and Problem Complexity, computers and society, Data Encryption, Discrete Mathematics in Computer Science, Management of Computing and Information Systems, Systems and Data Security}, isbn = {978-3-642-00456-8, 978-3-642-00457-5}, url = {http://link.springer.com/chapter/10.1007/978-3-642-00457-5_23}, author = {Choi, Seung Geol and Dana Dachman-Soled and Malkin, Tal and Wee, Hoeteck}, editor = {Reingold, Omer} } @article {15610, title = {Space-time tradeoffs for approximate nearest neighbor searching}, journal = {Journal of the ACM (JACM)}, volume = {57}, year = {2009}, month = {2009/11//}, pages = {1:1{\textendash}1:54 - 1:1{\textendash}1:54}, abstract = {Nearest neighbor searching is the problem of preprocessing a set of n point points in d-dimensional space so that, given any query point q, it is possible to report the closest point to q rapidly. In approximate nearest neighbor searching, a parameter ϵ > 0 is given, and a multiplicative error of (1 + ϵ) is allowed. We assume that the dimension d is a constant and treat n and ϵ as asymptotic quantities. Numerous solutions have been proposed, ranging from low-space solutions having space O(n) and query time O(log n + 1/ϵd-1) to high-space solutions having space roughly O((n log n)/ϵd) and query time O(log (n/ϵ)). We show that there is a single approach to this fundamental problem, which both improves upon existing results and spans the spectrum of space-time tradeoffs. Given a tradeoff parameter γ, where 2 <= γ <= 1/ϵ, we show that there exists a data structure of space O(nγd-1 log(1/ϵ)) that can answer queries in time O(log(nγ) + 1/(ϵγ)(d-1)/2. When γ = 2, this yields a data structure of space O(n log (1/ϵ)) that can answer queries in time O(log n + 1/ϵ(d-1)/2). When γ = 1/ϵ, it provides a data structure of space O((n/ϵd-1)log(1/ϵ)) that can answer queries in time O(log(n/ϵ)). Our results are based on a data structure called a (t,ϵ)-AVD, which is a hierarchical quadtree-based subdivision of space into cells. Each cell stores up to t representative points of the set, such that for any query point q in the cell at least one of these points is an approximate nearest neighbor of q. We provide new algorithms for constructing AVDs and tools for analyzing their total space requirements. We also establish lower bounds on the space complexity of AVDs, and show that, up to a factor of O(log (1/ϵ)), our space bounds are asymptotically tight in the two extremes, γ = 2 and γ = 1/ϵ.}, keywords = {nearest neighbor searching, space-time tradeoffs}, isbn = {0004-5411}, doi = {10.1145/1613676.1613677}, url = {http://doi.acm.org/10.1145/1613676.1613677}, author = {Arya,Sunil and Malamatos,Theocharis and Mount, Dave} } @conference {14863, title = {Sparse representation of cast shadows via l1-regularized least squares}, booktitle = {Computer Vision, 2009 IEEE 12th International Conference on}, year = {2009}, month = {2009///}, pages = {583 - 590}, abstract = {Scenes with cast shadows can produce complex sets of images. These images cannot be well approximated by low-dimensional linear subspaces. However, in this paper we show that the set of images produced by a Lambertian scene with cast shadows can be efficiently represented by a sparse set of images generated by directional light sources. We first model an image with cast shadows as composed of a diffusive part (without cast shadows) and a residual part that captures cast shadows. Then, we express the problem in an $\#$x2113;1-regularized least squares formulation, with nonnegativity constraints. This sparse representation enjoys an effective and fast solution, thanks to recent advances in compressive sensing. In experiments on both synthetic and real data, our approach performs favorably in comparison to several previously proposed methods.}, keywords = {$\#$x2113;1-regularized, approximations;lighting;, formulation;Lambertian, least, representation;image, representation;least, scene;cast, sensing;sparse, shadows;compressive, squares}, doi = {10.1109/ICCV.2009.5459185}, author = {Mei,Xue and Ling,Haibin and Jacobs, David W.} } @conference {12414, title = {Speaking through pictures: images vs. icons}, booktitle = {Proceedings of the 11th international ACM SIGACCESS conference on Computers and accessibility}, series = {Assets {\textquoteright}09}, year = {2009}, month = {2009///}, pages = {163 - 170}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {People with aphasia, a condition that impairs the ability to understand or generate written or spoken language, are aided by assistive technology that helps them communicate through a vocabulary of icons. These systems are akin to language translation systems, translating icon arrangements into spoken or written language and vice versa. However, these icon-based systems have little vocabulary breadth or depth, making it difficult for people with aphasia to apply their usage to multiple real world situations. Pictures from the web are numerous, varied, and easily accessible and thus, could potentially address the small size issues of icon-based systems. We present results from two studies that investigate this potential and demonstrate that images can be as effective as icons when used as a replacement for English language communication. The first study uses elderly subjects to investigate the efficacy of images vs. icons in conveying word meaning; the second study examines the retention of word-level meaning by both images and icons with a population of aphasics. We conclude that images collected from the web are as functional as icons in conveying information and thus, are feasible to use in assistive technology that supports people with aphasia.}, keywords = {aphasia, computerized visual communication (C-VIC), visual communication (VIC)}, isbn = {978-1-60558-558-1}, doi = {10.1145/1639642.1639672}, url = {http://doi.acm.org/10.1145/1639642.1639672}, author = {Ma,Xiaojuan and Jordan Boyd-Graber and Nikolova,Sonya and Cook,Perry R.} } @article {13868, title = {Symbolic-to-statistical hybridization: extending generation-heavy machine translation}, journal = {Machine Translation}, volume = {23}, year = {2009}, month = {2009///}, pages = {23 - 63}, abstract = {The last few years have witnessed an increasing interest in hybridizing surface-based statistical approaches and rule-based symbolic approaches to machine translation (MT). Much of that work is focused on extending statistical MT systems with symbolic knowledge and components. In the brand of hybridization discussed here, we go in the opposite direction: adding statistical bilingual components to a symbolic system. Our base system is Generation-heavy machine translation (GHMT), a primarily symbolic asymmetrical approach that addresses the issue of Interlingual MT resource poverty in source-poor/target-rich language pairs by exploiting symbolic and statistical target-language resources. GHMT{\textquoteright}s statistical components are limited to target-language models, which arguably makes it a simple form of a hybrid system . We extend the hybrid nature of GHMT by adding statistical bilingual components. We also describe the details of retargeting it to Arabic{\textendash}English MT. The morphological richness of Arabic brings several challenges to the hybridization task. We conduct an extensive evaluation of multiple system variants. Our evaluation shows that this new variant of GHMT{\textemdash}a primarily symbolic system extended with monolingual and bilingual statistical components{\textemdash}has a higher degree of grammaticality than a phrase-based statistical MT system, where grammaticality is measured in terms of correct verb-argument realization and long-distance dependency translation.}, isbn = {0922-6567}, url = {http://dx.doi.org/10.1007/s10590-009-9056-7}, author = {Habash,Nizar and Dorr, Bonnie J and Monz,Christof} } @article {15275, title = {A synthesis for exactly 3-edge-connected graphs}, journal = {Arxiv preprint arXiv:0905.1053}, year = {2009}, month = {2009///}, author = {Kingsford, Carl and Mar{\c c}ais,G.} } @article {13110, title = {System and method for fast illumination-invariant background subtraction ...}, volume = {11/282,513}, year = {2009}, month = {2009/03/31/}, abstract = {A method for eliminating errors in foreground object detection in digitized images comprises providing a reference camera and a secondary camera, vertically aligning each said camera with a baseline that is approximately perpendicular to a ground plane, wherein said reference camera is placed lower than said secondary camera, selecting a foreground pixel in a reference view of a first point in a foreground object, finding a conjugate pixel of the foreground pixel in a secondary view, using the foreground and conjugate pixels to determine an image base pixel of a base point in the reference view, wherein said base point is a point on the ground plane below the first point, and using the foreground and image base pixels to find a location where the ground plane is first visible.}, url = {http://www.google.com/patents?id=8yK_AAAAEBAJ}, author = {Lim,Ser-Nam and Mittal,Anurag and Davis, Larry S.}, editor = {Siemens Corporate Research, Inc.} } @article {11909, title = {System and Method for Spatio-Temporal-Context Aware Interaction of Users ...}, volume = {12/267,921}, year = {2009}, month = {2009/05/14/}, abstract = {A multifunctional interaction system which is capable of spatio-temporal context localization of users and of communication of audio/video streams to an entity of interest defined by the user, includes a communication domain supporting a predefined localization service, a server associated with the communication domain, client devices, and a dynamically changing context database which is customized in accord with the dynamics of interaction sessions of client devices with the server. The client communicates with the system to either request services therefrom or to send a message to the entity of interest. The system is provided with a panic alert mechanism which, upon actuation, transmits an audio/video data stream along with the client location tag, time stamp, and client ID, to a police precinct for prompt action.}, url = {http://www.google.com/patents?id=nZbGAAAAEBAJ}, author = {Agrawala, Ashok K. and Varshney, Amitabh and Almazan,Christian B.}, editor = {University of Maryland} } @article {16056, title = {Temporal Summaries: Supporting Temporal Categorical Searching, Aggregation and Comparison}, journal = {Visualization and Computer Graphics, IEEE Transactions on}, volume = {15}, year = {2009}, month = {2009/12//nov}, pages = {1049 - 1056}, abstract = {When analyzing thousands of event histories, analysts often want to see the events as an aggregate to detect insights and generate new hypotheses about the data. An analysis tool must emphasize both the prevalence and the temporal ordering of these events. Additionally, the analysis tool must also support flexible comparisons to allow analysts to gather visual evidence. In a previous work, we introduced align, rank, and filter (ARF) to accentuate temporal ordering. In this paper, we present temporal summaries, an interactive visualization technique that highlights the prevalence of event occurrences. Temporal summaries dynamically aggregate events in multiple granularities (year, month, week, day, hour, etc.) for the purpose of spotting trends over time and comparing several groups of records. They provide affordances for analysts to perform temporal range filters. We demonstrate the applicability of this approach in two extensive case studies with analysts who applied temporal summaries to search, filter, and look for patterns in electronic health records and academic records.}, keywords = {Automated;Thrombocytopenia;Time Factors;, Computerized;Pattern Recognition, Factual;Heparin;Humans;Medical Records Systems, interactive visualization technique;temporal categorical searching;temporal ordering;temporal summaries;data visualisation;human computer interaction;Computational Biology;Computer Graphics;Databases}, isbn = {1077-2626}, doi = {10.1109/TVCG.2009.187}, author = {Wang,T. D and Plaisant, Catherine and Shneiderman, Ben and Spring, Neil and Roseman,D. and Marchand,G. and Mukherjee,V. and Smith,M.} } @article {17397, title = {Temporal Summaries: Supporting Temporal Categorical Searching, Aggregation and Comparison}, journal = {IEEE Transactions on Visualization and Computer Graphics}, volume = {15}, year = {2009}, month = {2009/12//Nov}, pages = {1049 - 1056}, abstract = {When analyzing thousands of event histories, analysts often want to see the events as an aggregate to detect insights and generate new hypotheses about the data. An analysis tool must emphasize both the prevalence and the temporal ordering of these events. Additionally, the analysis tool must also support flexible comparisons to allow analysts to gather visual evidence. In a previous work, we introduced align, rank, and filter (ARF) to accentuate temporal ordering. In this paper, we present temporal summaries, an interactive visualization technique that highlights the prevalence of event occurrences. Temporal summaries dynamically aggregate events in multiple granularities (year, month, week, day, hour, etc.) for the purpose of spotting trends over time and comparing several groups of records. They provide affordances for analysts to perform temporal range filters. We demonstrate the applicability of this approach in two extensive case studies with analysts who applied temporal summaries to search, filter, and look for patterns in electronic health records and academic records.}, keywords = {Aggregates, Collaborative work, Computational Biology, Computer Graphics, Data analysis, data visualisation, Data visualization, Databases, Factual, Displays, Event detection, Filters, Heparin, History, Human computer interaction, Human-computer interaction, HUMANS, Information Visualization, Interaction design, interactive visualization technique, Medical Records Systems, Computerized, Pattern Recognition, Automated, Performance analysis, Springs, temporal categorical data visualization, temporal categorical searching, temporal ordering, temporal summaries, Thrombocytopenia, Time factors}, isbn = {1077-2626}, doi = {10.1109/TVCG.2009.187}, author = {Wang,T. D and Plaisant, Catherine and Shneiderman, Ben and Spring, Neil and Roseman,D. and Marchand,G. and Mukherjee,V. and Smith,M.} } @article {13872, title = {TER-Plus: paraphrase, semantic, and alignment enhancements to Translation Edit Rate}, journal = {Machine Translation}, volume = {23}, year = {2009}, month = {2009///}, pages = {117 - 127}, abstract = {This paper describes a new evaluation metric, TER-Plus (TERp) for automatic evaluation of machine translation (MT). TERp is an extension of Translation Edit Rate (TER). It builds on the success of TER as an evaluation metric and alignment tool and addresses several of its weaknesses through the use of paraphrases, stemming, synonyms, as well as edit costs that can be automatically optimized to correlate better with various types of human judgments. We present a correlation study comparing TERp to BLEU, METEOR and TER, and illustrate that TERp can better evaluate translation adequacy.}, isbn = {0922-6567}, url = {http://dx.doi.org/10.1007/s10590-009-9062-9}, author = {Snover,Matthew and Madnani,Nitin and Dorr, Bonnie J and Schwartz,Richard} } @inbook {15465, title = {TESTING EVENT-DRIVEN SOFTWARE{\textendash}THE NEXT QA CHALLENGE?}, booktitle = {Software Engineering and DevelopmentSoftware Engineering and Development}, year = {2009}, month = {2009///}, pages = {187 - 187}, publisher = {Nova Science Publishers, Inc.}, organization = {Nova Science Publishers, Inc.}, abstract = {A particular class of software that is fast becoming ubiquitous is event-driven software(EDS). All EDS share a common event-driven model{\textendash}they take sequences of events (eg, messages, mouse-clicks) as input, change their state, and (sometimes) output an event sequence. Examples include web applications, graphical user interfaces (GUIs), network protocols, device drivers, and embedded software. Quality assurance tasks such as testing have become important for EDS since they are being used in critical applications. Numerous researchers have shown that existing testing techniques do not apply directly to EDS because of the new challenges that EDS offer. This column lists some of these challenges and emphasizes on the need to develop new techniques (or enhance existing ones) to test EDS. }, isbn = {978-1-60692-146-3}, author = {Memon, Atif M.} } @article {15433, title = {Testing graphical user interfaces}, journal = {Encyclopedia of Information Science and Technology}, year = {2009}, month = {2009///}, author = {Strecker,J. and Memon, Atif M.} } @article {19726, title = {Three genomes from the phylum Acidobacteria provide insight into the lifestyles of these microorganisms in soils.}, journal = {Appl Environ Microbiol}, volume = {75}, year = {2009}, month = {2009 Apr}, pages = {2046-56}, abstract = {

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

}, keywords = {Anti-Bacterial Agents, bacteria, Biological Transport, Carbohydrate Metabolism, Cyanobacteria, DNA, Bacterial, Fungi, Genome, Bacterial, Macrolides, Molecular Sequence Data, Nitrogen, Phylogeny, Proteobacteria, Sequence Analysis, DNA, sequence homology, Soil Microbiology}, issn = {1098-5336}, doi = {10.1128/AEM.02294-08}, author = {Ward, Naomi L and Challacombe, Jean F and Janssen, Peter H and Henrissat, Bernard and Coutinho, Pedro M and Wu, Martin and Xie, Gary and Haft, Daniel H and Sait, Michelle and Badger, Jonathan and Barabote, Ravi D and Bradley, Brent and Brettin, Thomas S and Brinkac, Lauren M and Bruce, David and Creasy, Todd and Daugherty, Sean C and Davidsen, Tanja M and DeBoy, Robert T and Detter, J Chris and Dodson, Robert J and Durkin, A Scott and Ganapathy, Anuradha and Gwinn-Giglio, Michelle and Han, Cliff S and Khouri, Hoda and Kiss, Hajnalka and Kothari, Sagar P and Madupu, Ramana and Nelson, Karen E and Nelson, William C and Paulsen, Ian and Penn, Kevin and Ren, Qinghu and Rosovitz, M J and Jeremy D Selengut and Shrivastava, Susmita and Sullivan, Steven A and Tapia, Roxanne and Thompson, L Sue and Watkins, Kisha L and Yang, Qi and Yu, Chunhui and Zafar, Nikhat and Zhou, Liwei and Kuske, Cheryl R} } @article {18724, title = {Together, Rpn10 and Dsk2 Can Serve as a Polyubiquitin Chain-Length Sensor}, journal = {Molecular Cell}, volume = {36}, year = {2009}, month = {2009/12/24/}, pages = {1018 - 1033}, abstract = {SummaryAs a signal for substrate targeting, polyubiquitin meets various layers of receptors upstream to the 26S proteasome. We obtained structural information on two receptors, Rpn10 and Dsk2, alone and in complex with (poly)ubiquitin or with each other. A~hierarchy of affinities emerges with Dsk2 binding monoubiquitin tighter than Rpn10 does, whereas Rpn10 prefers the ubiquitin-like domain of Dsk2 to monoubiquitin, with increasing affinities for longer polyubiquitin chains. We demonstrated the formation of ternary complexes of both receptors simultaneously with (poly)ubiquitin and found that, depending on the ubiquitin chain length, the orientation of the resulting complex is entirely different, providing for alternate signals. Dynamic rearrangement provides a chain-length sensor, possibly explaining how accessibility of Dsk2 to the proteasome is limited unless it carries a properly tagged cargo. We propose a mechanism for a malleable ubiquitin signal that depends both on chain length and combination of receptors to produce tetraubiquitin as an efficient signal threshold. }, keywords = {Proteins, signaling}, isbn = {1097-2765}, doi = {10.1016/j.molcel.2009.11.012}, url = {http://www.sciencedirect.com/science/article/pii/S1097276509008260}, author = {Zhang,Daoning and Chen,Tony and Ziv,Inbal and Rosenzweig,Rina and Matiuhin,Yulia and Bronner,Vered and Glickman,Michael H. and Fushman, David} } @article {13026, title = {Toward reconstructing the evolution of advanced moths and butterflies (Lepidoptera: Ditrysia): an initial molecular study}, journal = {BMC Evol Biol}, volume = {9}, year = {2009}, month = {2009///}, pages = {280 - 280}, abstract = {BACKGROUND: In the mega-diverse insect order Lepidoptera (butterflies and moths; 165,000 described species), deeper relationships are little understood within the clade Ditrysia, to which 98\% of the species belong. To begin addressing this problem, we tested the ability of five protein-coding nuclear genes (6.7 kb total), and character subsets therein, to resolve relationships among 123 species representing 27 (of 33) superfamilies and 55 (of 100) families of Ditrysia under maximum likelihood analysis. RESULTS: Our trees show broad concordance with previous morphological hypotheses of ditrysian phylogeny, although most relationships among superfamilies are weakly supported. There are also notable surprises, such as a consistently closer relationship of Pyraloidea than of butterflies to most Macrolepidoptera. Monophyly is significantly rejected by one or more character sets for the putative clades Macrolepidoptera as currently defined (P < 0.05) and Macrolepidoptera excluding Noctuoidea and Bombycoidea sensu lato (P < or = 0.005), and nearly so for the superfamily Drepanoidea as currently defined (P < 0.08). Superfamilies are typically recovered or nearly so, but usually without strong support. Relationships within superfamilies and families, however, are often robustly resolved. We provide some of the first strong molecular evidence on deeper splits within Pyraloidea, Tortricoidea, Geometroidea, Noctuoidea and others.Separate analyses of mostly synonymous versus non-synonymous character sets revealed notable differences (though not strong conflict), including a marked influence of compositional heterogeneity on apparent signal in the third codon position (nt3). As available model partitioning methods cannot correct for this variation, we assessed overall phylogeny resolution through separate examination of trees from each character set. Exploration of "tree space" with GARLI, using grid computing, showed that hundreds of searches are typically needed to find the best-feasible phylogeny estimate for these data. CONCLUSION: Our results (a) corroborate the broad outlines of the current working phylogenetic hypothesis for Ditrysia, (b) demonstrate that some prominent features of that hypothesis, including the position of the butterflies, need revision, and (c) resolve the majority of family and subfamily relationships within superfamilies as thus far sampled. Much further gene and taxon sampling will be needed, however, to strongly resolve individual deeper nodes.}, doi = {10.1186/1471-2148-9-280}, author = {Regier,J. C and Zwick,A. and Cummings, Michael P. and Kawahara,A. Y and Cho,S. and Weller,S. and Roe,A. and Baixeras,J. and Brown,J. W and Parr,C. and Davis,DR and Epstein,M and Hallwachs,W and Hausmann,A and Janzen,DH and Kitching,IJ and Solis,MA and Yen,S-H and Bazinet,A. L and Mitter,C} } @conference {15495, title = {Towards Dynamic Adaptive Automated Test Generation for Graphical User Interfaces}, booktitle = {Software Testing, Verification and Validation Workshops, 2009. ICSTW {\textquoteright}09. International Conference on}, year = {2009}, month = {2009/04//}, pages = {263 - 266}, abstract = {Graphical user interfaces (GUIs) present an enormous number of potential event sequences to users. During testing it is necessary to cover this space, however the complexity of modern GUIs has made this an increasingly difficult task. Our past work has demonstrated that it is important to incorporate "context{\textquotedblright} into GUI test cases, in terms of event combinations, event sequence length, and by considering all possible starting and ending positions for each event. Despite the use of our most refined modeling techniques, many of the generated test cases remain unexecutable. In this paper, we posit that due to the dynamic state-based nature of GUIs, it is important to incorporate feedback from the execution of tests into test case generation algorithms. We propose the use of an evolutionary algorithm to generate test suites with fewer unexecutable test cases and higher event interaction coverage.}, keywords = {adaptive automated test generation, computational complexity, event sequence length, evolutionary algorithm, evolutionary computation, graphical user interface, Graphical user interfaces, GUI test case, program testing}, doi = {10.1109/ICSTW.2009.26}, author = {Xun Yuan and Cohen,M. B and Memon, Atif M.} } @inbook {12235, title = {Triangle Inequality and Routing Policy Violations in the Internet}, booktitle = {Passive and Active Network MeasurementPassive and Active Network Measurement}, series = {Lecture Notes in Computer Science}, volume = {5448}, year = {2009}, month = {2009///}, pages = {45 - 54}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {Triangle inequality violations (TIVs) are the effect of packets between two nodes being routed on the longer direct path between them when a shorter detour path through an intermediary is available. TIVs are a natural, widespread and persistent consequence of Internet routing policies. By exposing opportunities to improve the delay between two nodes, TIVs can help myriad applications that seek to minimize end-to-end latency. However, sending traffic along the detour paths revealed by TIVs may influence Internet routing negatively. In this paper we study the interaction between triangle inequality violations and policy routing in the Internet. We use measured and predicted AS paths between Internet nodes to show that 25\% of the detour paths exposed by TIVs are in fact available to BGP but are simply deemed {\textquotedblleft}less efficient{\textquotedblright}. We also compare the AS paths of detours and direct paths and find that detours use AS edges that are rarely followed by default Internet paths, while avoiding others that BGP seems to prefer. Our study is important both for understanding the various interactions that occur at the routing layer as well as their effects on applications that seek to use TIVs to minimize latency.}, keywords = {Computer, Science}, isbn = {978-3-642-00974-7}, url = {http://dx.doi.org/10.1007/978-3-642-00975-4_5}, author = {Lumezanu,Cristian and Baden,Randy and Spring, Neil and Bhattacharjee, Bobby}, editor = {Moon,Sue and Teixeira,Renata and Uhlig,Steve} } @article {19008, title = {Two Alternatively Spliced Isoforms of the Arabidopsis SR45 Protein Have Distinct Roles during Normal Plant Development}, journal = {Plant PhysiologyPlant Physiol.}, volume = {150}, year = {2009}, month = {2009/07/01/}, pages = {1450 - 1458}, abstract = {The serine-arginine-rich (SR) proteins constitute a conserved family of pre-mRNA splicing factors. In Arabidopsis (Arabidopsis thaliana), they are encoded by 19 genes, most of which are themselves alternatively spliced. In the case of SR45, the use of alternative 3' splice sites 21 nucleotides apart generates two alternatively spliced isoforms. Isoform 1 (SR45.1) has an insertion relative to isoform 2 (SR45.2) that replaces a single arginine with eight amino acids (TSPQRKTG). The biological implications of SR45 alternative splicing have been unclear. A previously described loss-of-function mutant affecting both isoforms, sr45-1, shows several developmental defects, including defects in petal development and root growth. We found that the SR45 promoter is highly active in regions with actively growing and dividing cells. We also tested the ability of each SR45 isoform to complement the sr45-1 mutant by overexpression of isoform-specific green fluorescent protein (GFP) fusion proteins. As expected, transgenic plants overexpressing either isoform displayed both nuclear speckles and GFP fluorescence throughout the nucleoplasm. We found that SR45.1-GFP complements the flower petal phenotype, but not the root growth phenotype. Conversely, SR45.2-GFP complements root growth but not floral morphology. Mutation of a predicted phosphorylation site within the alternatively spliced segment, SR45.1-S219A-GFP, does not affect complementation. However, a double mutation affecting both serine-219 and the adjacent threonine-218 (SR45.1-T218A + S219A-GFP) behaves like isoform 2, complementing the root but not the floral phenotype. In conclusion, our study provides evidence that the two alternatively spliced isoforms of SR45 have distinct biological functions.}, isbn = {0032-0889, 1532-2548}, doi = {10.1104/pp.109.138180}, url = {http://www.plantphysiol.org/content/150/3/1450}, author = {Zhang,Xiao-Ning and Mount, Stephen M.} } @conference {14346, title = {UbiGreen: investigating a mobile tool for tracking and supporting green transportation habits}, booktitle = {Proceedings of the 27th international conference on Human factors in computing systems}, series = {CHI {\textquoteright}09}, year = {2009}, month = {2009///}, pages = {1043 - 1052}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, keywords = {ambient displays, mobile phones, sensing, Sustainability, transportation, ubicomp}, isbn = {978-1-60558-246-7}, doi = {10.1145/1518701.1518861}, url = {http://doi.acm.org/10.1145/1518701.1518861}, author = {Jon Froehlich and Dillahunt,Tawanna and Klasnja,Predrag and Mankoff,Jennifer and Consolvo,Sunny and Harrison,Beverly and Landay,James A.} } @article {17549, title = {A unified approach to scheduling on unrelated parallel machines}, journal = {J. ACM}, volume = {56}, year = {2009}, month = {2009/08//}, pages = {28:1{\textendash}28:31 - 28:1{\textendash}28:31}, abstract = {We develop a single rounding algorithm for scheduling on unrelated parallel machines; this algorithm works well with the known linear programming-, quadratic programming-, and convex programming-relaxations for scheduling to minimize completion time, makespan, and other well-studied objective functions. This algorithm leads to the following applications for the general setting of unrelated parallel machines: (i) a bicriteria algorithm for a schedule whose weighted completion-time and makespan simultaneously exhibit the current-best individual approximations for these criteria; (ii) better-than-two approximation guarantees for scheduling to minimize the Lp norm of the vector of machine-loads, for all 1 < p < $\infty$; and (iii) the first constant-factor multicriteria approximation algorithms that can handle the weighted completion-time and any given collection of integer Lp norms. Our algorithm has a natural interpretation as a melding of linear-algebraic and probabilistic approaches. Via this view, it yields a common generalization of rounding theorems due to Karp et al. [1987] and Shmoys \& Tardos [1993], and leads to improved approximation algorithms for the problem of scheduling with resource-dependent processing times introduced by Grigoriev et al. [2007].}, keywords = {Approximation algorithms, Randomized rounding, scheduling under multiple criteria}, isbn = {0004-5411}, doi = {10.1145/1552285.1552289}, url = {http://doi.acm.org/10.1145/1552285.1552289}, author = {Kumar,V. S. Anil and Marathe,Madhav V. and Parthasarathy,Srinivasan and Srinivasan, Aravind} } @conference {16665, title = {The University of Maryland statistical machine translation system for the Fourth Workshop on Machine Translation}, booktitle = {Proceedings of the Fourth Workshop on Statistical Machine Translation}, year = {2009}, month = {2009///}, pages = {145 - 149}, author = {Dyer,C. and Setiawan,H. and Marton,Y. and Resnik, Philip} } @conference {16583, title = {An unsupervised learning method for representing simple sentences}, booktitle = {Neural Networks, 2009. IJCNN 2009. International Joint Conference on}, year = {2009}, month = {2009///}, pages = {2133 - 2140}, author = {Monner,D. and Reggia, James A.} } @conference {13888, title = {Using citations to generate surveys of scientific paradigms}, booktitle = {Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics}, series = {NAACL {\textquoteright}09}, year = {2009}, month = {2009///}, pages = {584 - 592}, publisher = {Association for Computational Linguistics}, organization = {Association for Computational Linguistics}, address = {Stroudsburg, PA, USA}, abstract = {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.}, isbn = {978-1-932432-41-1}, url = {http://dl.acm.org/citation.cfm?id=1620754.1620839}, author = {Mohammad,Saif and Dorr, Bonnie J and Egan,Melissa and Hassan,Ahmed and Muthukrishan,Pradeep and Qazvinian,Vahed and Radev,Dragomir and Zajic, David} } @article {15504, title = {Using GUI Run-Time State as Feedback for Test Automation}, year = {2009}, month = {2009/08/18/}, institution = {Computer Science Research Works, University of Maryland, College Park}, abstract = {Graphical user interfaces (GUIs) are the sole mode of interactionbetween end-users and back-end code for almost all of today{\textquoteright}s software applications. Because of this strategic role of GUIs, their quality has become important. During GUI testing, test cases---modeled as sequences of user events---sample the vast input space of all possible sequences with the goal of detecting faults; for effective testing, it is important to sample this space carefully. Existing techniques either sample manually or employ manually constructed abstract models---the abstraction and/or subsequent test-case generation algorithms enable sampling. This report presents an alternative approach to GUI testing -- it{\textquoteright}s focus is on developing a fully automatic model-driven technique to generate GUI test cases. The technique is novel in that it uses feedback from the execution of a {\textquoteleft}{\textquoteleft}seed test suite{\textquoteright}{\textquoteright} on a GUI. The seed suite is generated automatically using an existing structural event-interaction graph (EIG) model of the GUI. During its execution, the run-time effect of each GUI event on all other events pinpoints new important event-semantic interaction (ESI) relationships between them, which are used to automatically create an ESI graph (ESIG) model and generate new test cases. Together with a reverse-engineering algorithm used to obtain the EIG, seed suite, ESIG, and new test cases, the feedback-based technique yields a fully automatic, end-to-end GUI testing process. }, keywords = {GUI testing, Software testing, test automation, test-case generation}, url = {http://drum.lib.umd.edu//handle/1903/9416}, author = {Xun Yuan and Memon, Atif M.} } @article {15437, title = {Using reverse engineering for automated usability evaluation of GUI-based applications}, journal = {Human-Centered Software Engineering}, year = {2009}, month = {2009///}, pages = {335 - 355}, abstract = {Graphical user interfaces (GUIs) are important parts of today{\textquoteright}s software and their usability ensures the usefulness of the overall software. A popular technique to check the usability of GUIs is by performing usability evaluations either manually or automatically using tools. While manual evaluation is resource intensive, performing automatic usability evaluation usually involves the creation of a model of the GUI, a significant resource-intensive step that intimidates many practitioners and prevents the application of the automated techniques. This chapter presents {\textquotedblleft}GUI ripping,{\textquotedblright} a new process that automatically recovers models of the GUI by dynamically {\textquotedblleft}traversing{\textquotedblright} all its windows and extracting all the widgets, properties, and values. The usefulness of this process is demonstrated by recovering a structural model called a GUI forest and dynamic models called event-flow graphs and integration trees. Results of case studies show that GUI ripping is effective and requires very little human intervention.}, doi = {10.1007/978-1-84800-907-3_16}, author = {Memon, Atif M.} } @article {12885, title = {Using Satellite Images of Environmental Changes to Predict Infectious Disease Outbreaks}, journal = {Emerging Infectious DiseasesEmerg Infect Dis}, volume = {15}, year = {2009}, month = {2009/09//}, pages = {1341 - 1346}, abstract = {A strong global satellite imaging system is essential for predicting outbreaks., Recent events clearly illustrate a continued vulnerability of large populations to infectious diseases, which is related to our changing human-constructed and natural environments. A single person with multidrug-resistant tuberculosis in 2007 provided a wake-up call to the United States and global public health infrastructure, as the health professionals and the public realized that today{\textquoteright}s ease of airline travel can potentially expose hundreds of persons to an untreatable disease associated with an infectious agent. Ease of travel, population increase, population displacement, pollution, agricultural activity, changing socioeconomic structures, and international conflicts worldwide have each contributed to infectious disease events. Today, however, nothing is larger in scale, has more potential for long-term effects, and is more uncertain than the effects of climate change on infectious disease outbreaks, epidemics, and pandemics. We discuss advances in our ability to predict these events and, in particular, the critical role that satellite imaging could play in mounting an effective response.}, isbn = {1080-6040}, doi = {10.3201/eid/1509.081334}, author = {Ford,Timothy E. and Rita R Colwell and Rose,Joan B. and Morse,Stephen S. and Rogers,David J. and Yates,Terry L.} } @conference {12806, title = {Validating Automotive Control Software Using Instrumentation-Based Verification}, booktitle = {Automated Software Engineering, International Conference on}, year = {2009}, month = {2009///}, pages = {15 - 25}, publisher = {IEEE Computer Society}, organization = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, abstract = {This paper discusses the results of an application of a formally based verification technique, called Instrumentation-Based Verification (IBV), to a production automotive lighting controller. The goal of the study is to assess, from both a tools as well as a methodological perspective, the performance of IBV in an industrial setting. The insights obtained as a result of the project include a refinement of a previously developed architecture for requirements specifications; observations about changes to model-based design workflows; insights into the role of requirements during development; and the capability of automated verification to detect inconsistencies among requirements as well as between requirements and design models.}, doi = {http://doi.ieeecomputersociety.org/10.1109/ASE.2009.98}, author = {Ray,Arnab and Morschhaeuser,Iris and Ackermann,Chris and Cleaveland, Rance and Shelton,Charles and Martin,Chris} } @article {12525, title = {Vehicle Speed Estimation Using Acoustic Wave Patterns}, journal = {Signal Processing, IEEE Transactions on}, volume = {57}, year = {2009}, month = {2009/01//}, pages = {30 - 47}, abstract = {We estimate a vehicle{\textquoteright}s speed, its wheelbase length, and tire track length by jointly estimating its acoustic wave pattern with a single passive acoustic sensor that records the vehicle{\textquoteright}s drive-by noise. The acoustic wave pattern is determined using the vehicle{\textquoteright}s speed, the Doppler shift factor, the sensor{\textquoteright}s distance to the vehicle{\textquoteright}s closest-point-of-approach, and three envelope shape (ES) components, which approximate the shape variations of the received signal{\textquoteright}s power envelope. We incorporate the parameters of the ES components along with estimates of the vehicle engine RPM, the number of cylinders, and the vehicle{\textquoteright}s initial bearing, loudness and speed to form a vehicle profile vector. This vector provides a fingerprint that can be used for vehicle identification and classification. We also provide possible reasons why some of the existing methods are unable to provide unbiased vehicle speed estimates using the same framework. The approach is illustrated using vehicle speed estimation and classification results obtained with field data.}, keywords = {acoustic, Doppler, estimation;passive, estimation;road, estimation;wheelbase, factor;acoustic, identification;vehicle, length;Doppler, length;vehicle, likelihood, patterns;envelope, processing;maximum, profile, sensor;tire, shape;maximum, shift, shift;acoustic, signal, speed, track, vector;vehicle, vehicles;, wave}, isbn = {1053-587X}, doi = {10.1109/TSP.2008.2005750}, author = {Cevher, V. and Chellapa, Rama and McClellan, J.H.} } @article {12561, title = {3D shape-encoded particle filter for object tracking and its application to human body tracking}, journal = {J. Image Video Process.}, volume = {2008}, year = {2008}, month = {2008/01//}, pages = {12:1{\textendash}12:16 - 12:1{\textendash}12:16}, abstract = {We present a nonlinear state estimation approach using particle filters, for tracking objects whose approximate 3D shapes are known. The unnormalized conditional density for the solution to the nonlinear filtering problem leads to the Zakai equation, and is realized by the weights of the particles. The weight of a particle represents its geometric and temporal fit, which is computed bottom-up from the raw image using a shape-encoded filter. The main contribution of the paper is the design of smoothing filters for feature extraction combined with the adoption of unnormalized conditional density weights. The "shape filter" has the overall form of the predicted 2D projection of the 3D model, while the cross-section of the filter is designed to collect the gradient responses along the shape. The 3D-model-based representation is designed to emphasize the changes in 2D object shape due to motion, while de-emphasizing the variations due to lighting and other imaging conditions. We have found that the set of sparse measurements using a relatively small number of particles is able to approximate the high-dimensional state distribution very effectively. As a measure to stabilize the tracking, the amount of random diffusion is effectively adjusted using a Kalman updating of the covariance matrix. For a complex problem of human body tracking, we have successfully employed constraints derived from joint angles and walking motion.}, isbn = {1687-5176}, doi = {10.1155/2008/596989}, url = {http://dx.doi.org/10.1155/2008/596989}, author = {Moon, H. and Chellapa, Rama} } @article {18544, title = {Accountable internet protocol (aip)}, journal = {SIGCOMM Comput. Commun. Rev.}, volume = {38}, year = {2008}, month = {2008/08//}, pages = {339 - 350}, abstract = {This paper presents AIP (Accountable Internet Protocol), a network architecture that provides accountability as a first-order property. AIP uses a hierarchy of self-certifying addresses, in which each component is derived from the public key of the corresponding entity. We discuss how AIP enables simple solutions to source spoofing, denial-of-service, route hijacking, and route forgery. We also discuss how AIP{\textquoteright}s design meets the challenges of scaling, key management, and traffic engineering.}, keywords = {accountability, address, internet architecture, scalability, Security}, isbn = {0146-4833}, doi = {10.1145/1402946.1402997}, url = {http://doi.acm.org/10.1145/1402946.1402997}, author = {Andersen,David G. and Balakrishnan,Hari and Feamster, Nick and Koponen,Teemu and Moon,Daekyeong and Shenker,Scott} } @conference {14323, title = {Activity sensing in the wild: a field trial of ubifit garden}, booktitle = {Proceeding of the twenty-sixth annual SIGCHI conference on Human factors in computing systems}, year = {2008}, month = {2008///}, pages = {1797 - 1806}, author = {Consolvo,S. and McDonald,D.W. and Toscos,T. and Chen,M.Y. and Jon Froehlich and Harrison,B. and Klasnja,P. and LaMarca,A. and LeGrand,L. and Libby,R. and others} } @article {15835, title = {Advances in multilingual and multimodal information retrieval}, journal = {Lecture Notes in Computer Science}, volume = {5152}, year = {2008}, month = {2008///}, author = {Peters,C. and Jijkoun,V. and Mandl,T. and M{\"u}ller,H. and Oard, Douglas and Pe{\~n}as,A. and Santos,D.} } @conference {16069, title = {Aligning temporal data by sentinel events: discovering patterns in electronic health records}, booktitle = {Proceedings of the twenty-sixth annual SIGCHI conference on Human factors in computing systems}, series = {CHI {\textquoteright}08}, year = {2008}, month = {2008///}, pages = {457 - 466}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Electronic Health Records (EHRs) and other temporal databases contain hidden patterns that reveal important cause-and-effect phenomena. Finding these patterns is a challenge when using traditional query languages and tabular displays. We present an interactive visual tool that complements query formulation by providing operations to align, rank and filter the results, and to visualize estimates of the intervals of validity of the data. Display of patient histories aligned on sentinel events (such as a first heart attack) enables users to spot precursor, co-occurring, and aftereffect events. A controlled study demonstrates the benefits of providing alignment (with a 61\% speed improvement for complex tasks). A qualitative study and interviews with medical professionals demonstrates that the interface can be learned quickly and seems to address their needs.}, keywords = {electronic health record, Evaluation, Information Visualization, search, temporal data, Uncertainty}, isbn = {978-1-60558-011-1}, doi = {10.1145/1357054.1357129}, url = {http://doi.acm.org/10.1145/1357054.1357129}, author = {Wang,Taowei David and Plaisant, Catherine and Quinn,Alexander J. and Stanchak,Roman and Murphy,Shawn and Shneiderman, Ben} } @conference {15447, title = {Alternating GUI Test Generation and Execution}, booktitle = {Practice and Research Techniques, 2008. TAIC PART {\textquoteright}08. Testing: Academic Industrial Conference}, year = {2008}, month = {2008///}, pages = {23 - 32}, abstract = {Users of today{\textquoteright}s software perform tasks by interacting with a graphical user interface (GUI) front-end via sequences of input events. Due to the flexibility offered by most GUIs, the number of event sequences grows exponentially with length. One ubiquitous challenge of GUI testing is to selectively generate those sequences that lead to potentially problematic states. This paper presents ALT, a new technique that generates GUI test cases in batches, by leveraging GUI run-time information from a previously run batch to obtain the next batch. Each successive batch consists of "longer" test cases that expand the state space to be explored, yet prune the "unimportant" states. The "alternating" nature of ALT allows it to enhance the next batch by leveraging certain relationships between GUI events (e.g., one enables the other, one alters the other{\textquoteright}s execution) that are revealed only at run-time and non-trivial to infer statically. An empirical study on four fielded GUI-based applications demonstrates that ALT is successful at identifying complex failure-causing interactions between GUI events.}, keywords = {ALT, complex failure-causing interactions, event sequences, graphical user interface, Graphical user interfaces, GUI test generation, Testing}, doi = {10.1109/TAIC-PART.2008.10}, author = {Xun Yuan and Memon, Atif M.} } @article {13724, title = {Applying automatically generated semantic knowledge: A case study in machine translation}, journal = {NSF Symposium on Semantic Knowledge Discovery, Organization and Use}, year = {2008}, month = {2008///}, abstract = {In this paper, we discuss how we apply automatically generated semantic knowledge to benefit statisticalmachine translation (SMT). Currently, almost all statistical machine translation systems rely heavily on memorizing translations of phrases. Some systems attempt to go further and generalize these learned phrase translations into templates using empirically derived information about word alignments and a small amount of syntactic information, if at all. There are several issues in a SMT pipeline that could be addressed by the application of semantic knowledge, if such knowledge were easily available. One such issue, an important one, is that of reference sparsity. The fundamental problem that translation systems have to face is that there is no such thing as the correct translation for any sentence. In fact, any given source sentence can often be translated into the target language in many valid ways. Since there can be many {\textquotedblleft}correct answers,{\textquotedblright} almost all models employed by SMT systems require, in addition to a large bitext, a held-out development set comprised of multiple high-quality, human-authored reference translations in the target language in order to tune their parameters relative to a translation quality metric.1 There are several reasons that this requirement is not an easy one to satisfy. First, with a few exceptions{\textemdash}notably NIST{\textquoteright}s annual MT evaluations{\textemdash}most new MT research data sets are provided with only a single reference translation. Second, obtaining multiple reference translations in rapid development, low-density source language scenarios (e.g. (Oard, 2003)) is likely to be severely limited (or made entirely impractical) by limitations of time, cost, and ready availability of qualified translators. }, author = {Madnani,N. and Resnik, Philip and Dorr, Bonnie J and Schwartz,R.} } @conference {17559, title = {Approximation Algorithms for Computing Capacity of Wireless Networks with SINR Constraints}, booktitle = {IEEE INFOCOM 2008. The 27th Conference on Computer Communications}, year = {2008}, month = {2008/04/13/18}, pages = {1166 - 1174}, publisher = {IEEE}, organization = {IEEE}, abstract = {A fundamental problem in wireless networks is to estimate its throughput capacity - given a set of wireless nodes, and a set of connections, what is the maximum rate at which data can be sent on these connections. Most of the research in this direction has focused on either random distributions of points, or has assumed simple graph-based models for wireless interference. In this paper, we study capacity estimation problem using the more general Signal to Interference Plus Noise Ratio (SINR) model for interference, on arbitrary wireless networks. The problem becomes much harder in this setting, because of the non-locality of the SINR model. Recent work by Moscibroda et al. (2006) has shown that the throughput in this model can differ from graph based models significantly. We develop polynomial time algorithms to provably approximate the total throughput in this setting.}, keywords = {Algorithm design and analysis, approximation algorithm, Approximation algorithms, approximation theory, Computer networks, Computer science, graph theory, graph-based model, Interference constraints, polynomial time algorithm, Propagation losses, Protocols, radio networks, radiofrequency interference, signal to interference plus noise ratio, Signal to noise ratio, Throughput, wireless interference, wireless network, Wireless networks}, isbn = {978-1-4244-2025-4}, doi = {10.1109/INFOCOM.2008.172}, author = {Chafekar,D. and Kumart,V. S.A and Marathe,M. V and Parthasarathy,S. and Srinivasan, Aravind} } @article {13725, title = {Are multiple reference translations necessary? investigating the value of paraphrased reference translations in parameter optimization}, journal = {Proceedings of the Eighth Conference of the Association for Machine Translation in the Americas, October}, year = {2008}, month = {2008///}, abstract = {Most state-of-the-art statistical machine trans-lation systems use log-linear models, which are defined in terms of hypothesis features and weights for those features. It is standard to tune the feature weights in order to maxi- mize a translation quality metric, using held- out test sentences and their corresponding ref- erence translations. However, obtaining refer- ence translations is expensive. In our earlier work (Madnani et al., 2007), we introduced a new full-sentence paraphrase technique, based on English-to-English decoding with an MT system, and demonstrated that the resulting paraphrases can be used to cut the number of human reference translations needed in half. In this paper, we take the idea a step further, asking how far it is possible to get with just a single good reference translation for each item in the development set. Our analysis suggests that it is necessary to invest in four or more hu- man translations in order to significantly im- prove on a single translation augmented by monolingual paraphrases. }, author = {Madnani,N. and Resnik, Philip and Dorr, Bonnie J and Schwartz,R.} } @article {13129, title = {Automatic online tuning for fast Gaussian summation}, journal = {Advances in Neural Information Processing Systems}, year = {2008}, month = {2008///}, abstract = {Many machine learning algorithms require the summation of Gaussian kernelfunctions, an expensive operation if implemented straightforwardly. Several meth- ods have been proposed to reduce the computational complexity of evaluating such sums, including tree and analysis based methods. These achieve varying speedups depending on the bandwidth, dimension, and prescribed error, making the choice between methods difficult for machine learning tasks. We provide an algorithm that combines tree methods with the Improved Fast Gauss Transform (IFGT). As originally proposed the IFGT suffers from two problems: (1) the Taylor series expansion does not perform well for very low bandwidths, and (2) parameter se- lection is not trivial and can drastically affect performance and ease of use. We address the first problem by employing a tree data structure, resulting in four eval- uation methods whose performance varies based on the distribution of sources and targets and input parameters such as desired accuracy and bandwidth. To solve the second problem, we present an online tuning approach that results in a black box method that automatically chooses the evaluation method and its parameters to yield the best performance for the input data, desired accuracy, and bandwidth. In addition, the new IFGT parameter selection approach allows for tighter error bounds. Our approach chooses the fastest method at negligible additional cost, and has superior performance in comparisons with previous approaches. }, author = {Morariu,V. and Srinivasan,B.V. and Raykar,V.C. and Duraiswami, Ramani and Davis, Larry S.} } @article {15412, title = {Automatically repairing event sequence-based GUI test suites for regression testing}, journal = {ACM Transactions on Software Engineering and Methodology (TOSEM)}, volume = {18}, year = {2008}, month = {2008/11//}, pages = {4:1{\textendash}4:36 - 4:1{\textendash}4:36}, abstract = {Although graphical user interfaces (GUIs) constitute a large part of the software being developed today and are typically created using rapid prototyping, there are no effective regression testing techniques for GUIs. The needs of GUI regression testing differ from those of traditional software. When the structure of a GUI is modified, test cases from the original GUI{\textquoteright}s suite are either reusable or unusable on the modified GUI. Because GUI test case generation is expensive, our goal is to make the unusable test cases usable, thereby helping to retain the suite{\textquoteright}s event coverage. The idea of reusing these unusable (obsolete) test cases has not been explored before. This article shows that a large number of test cases become unusable for GUIs. It presents a new GUI regression testing technique that first automatically determines the usable and unusable test cases from a test suite after a GUI modification, then determines the unusable test cases that can be repaired so that they can execute on the modified GUI, and finally uses repairing transformations to repair the test cases. This regression testing technique along with four repairing transformations has been implemented. An empirical study for four open-source applications demonstrates that (1) this approach is effective in that many of the test cases can be repaired, and is practical in terms of its time performance, (2) certain types of test cases are more prone to becoming unusable, and (3) certain types of {\textquotedblleft}dominator{\textquotedblright} events, when modified, make a large number of test cases unusable.}, keywords = {Graphical user interfaces, regression testing, repairing test cases, test case management, test maintenance}, isbn = {1049-331X}, doi = {10.1145/1416563.1416564}, url = {http://doi.acm.org/10.1145/1416563.1416564}, author = {Memon, Atif M.} } @inbook {19630, title = {Black-Box Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One}, booktitle = {Theory of Cryptography}, series = {Lecture Notes in Computer Science}, year = {2008}, month = {2008/01/01/}, pages = {427 - 444}, publisher = {Springer Berlin Heidelberg}, organization = {Springer Berlin Heidelberg}, abstract = {We show how to transform any semantically secure encryption scheme into a non-malleable one, with a black-box construction that achieves a quasi-linear blow-up in the size of the ciphertext. This improves upon the previous non-black-box construction of Pass, Shelat and Vaikuntanathan (Crypto {\textquoteright}06). Our construction also extends readily to guarantee non-malleability under a bounded-CCA2 attack, thereby simultaneously improving on both results in the work of Cramer et al. (Asiacrypt {\textquoteright}07). Our construction departs from the oft-used paradigm of re-encrypting the same message with different keys and then proving consistency of encryptions; instead, we encrypt an encoding of the message with certain locally testable and self-correcting properties. We exploit the fact that low-degree polynomials are simultaneously good error-correcting codes and a secret-sharing scheme.}, keywords = {Algorithm Analysis and Problem Complexity, black-box constructions, computers and society, Data Encryption, Discrete Mathematics in Computer Science, Management of Computing and Information Systems, non-malleability, public-key encryption, semantic security, Systems and Data Security}, isbn = {978-3-540-78523-1, 978-3-540-78524-8}, url = {http://link.springer.com/chapter/10.1007/978-3-540-78524-8_24}, author = {Choi, Seung Geol and Dana Dachman-Soled and Malkin, Tal and Wee, Hoeteck}, editor = {Canetti, Ran} } @article {15472, title = {Call-Stack Coverage for GUI Test Suite Reduction}, journal = {Software Engineering, IEEE Transactions on}, volume = {34}, year = {2008}, month = {2008/02//jan}, pages = {99 - 115}, abstract = {Graphical user interfaces (GUIs) are used as front ends to most of today{\textquoteright}s software applications. The event-driven nature of GUIs presents new challenges for testing. One important challenge is test suite reduction. Conventional reduction techniques/tools based on static analysis are not easily applicable due to the increased use of multilanguage GUI implementations, callbacks for event handlers, virtual function calls, reflection, and multithreading. Moreover, many existing techniques ignore code in libraries and fail to consider the context in which event handlers execute. Consequently, they yield GUI test suites with seriously impaired fault-detection abilities. This paper presents a reduction technique based on the call-stack coverage criterion. Call stacks may be collected for any executing program with very little overhead. Empirical studies in this paper compare reduction based on call-stack coverage to reduction based on line, method, and event coverage, including variations that control for the size and optional consideration of library methods. These studies show that call-stack-based reduction provides unique trade-offs between the reduction in test suite size and the loss of fault detection effectiveness, which may be valuable in practice. Additionally, an analysis of the relationship between coverage requirements and fault-revealing test cases is presented.}, keywords = {call-stack coverage criterion, computer testing, Graphical user interfaces, test suite reduction}, isbn = {0098-5589}, doi = {10.1109/TSE.2007.70756}, author = {McMaster,S. and Memon, Atif M.} } @conference {17570, title = {Capacity of Asynchronous Random-Access Scheduling in Wireless Networks}, booktitle = {IEEE INFOCOM 2008. The 27th Conference on Computer Communications}, year = {2008}, month = {2008/04/13/18}, pages = {1148 - 1156}, publisher = {IEEE}, organization = {IEEE}, abstract = {We study the throughput capacity of wireless networks which employ (asynchronous) random-access scheduling as opposed to deterministic scheduling. The central question we answer is: how should we set the channel-access probability for each link in the network so that the network operates close to its optimal throughput capacity? We design simple and distributed channel-access strategies for random-access networks which are provably competitive with respect to the optimal scheduling strategy, which is deterministic, centralized, and computationally infeasible. We show that the competitiveness of our strategies are nearly the best achievable via random-access scheduling, thus establishing fundamental limits on the performance of random- access. A notable outcome of our work is that random access compares well with deterministic scheduling when link transmission durations differ by small factors, and much worse otherwise. The distinguishing aspects of our work include modeling and rigorous analysis of asynchronous communication, asymmetry in link transmission durations, and hidden terminals under arbitrary link-conflict based wireless interference models.}, keywords = {asynchronous random-access scheduling, channel access probability, Computer networks, Computer science, Educational institutions, Interference, Optimal scheduling, Peer to peer computing, probability, Processor scheduling, radio link, radio links, radio networks, Routing, scheduling, Throughput, throughput capacity, wireless channels, Wireless networks}, isbn = {978-1-4244-2025-4}, doi = {10.1109/INFOCOM.2008.170}, author = {Chafekar,D. and Levin,D. and Kumar,V. S.A and Marathe,M. V and Parthasarathy,S. and Srinivasan, Aravind} } @book {14504, title = {On classification, ranking, and probability estimation}, year = {2008}, month = {2008///}, publisher = {Internationales Begegnungs- und Forschungszentrum fur Informatik (IBFI), Schloss Dagstuhl, Germany}, organization = {Internationales Begegnungs- und Forschungszentrum fur Informatik (IBFI), Schloss Dagstuhl, Germany}, abstract = {Given a binary classification task, a ranker is an algorithm that can sort a set of instances from highest to lowest expectation that the instance is positive. In contrast to a classifier, a ranker does not output class predictions {\~A}{\textcent}{\^a}{\quotesinglbase}{\textlnot}{\^a}{\texteuro}{\oe} although it can be turned into a classifier with help of an additional procedure to split the ranked list into two. A straightforward way to compute rankings is to train a scoring classifier to assign numerical scores to instances, for example the predicted odds that an instance is positive. However, rankings can be computed without scores, as we demonstrate in this paper. We propose a lexicographic ranker, LexRank , whose rankings are derived not from scores, but from a simple ranking of attribute values obtained from the training data. Although various metrics can be used, we show that by using the odds ratio to rank the attribute values we obtain a ranker that is conceptually close to the naive Bayes classifier, in the sense that for every instance of LexRank there exists an instance of naive Bayes that achieves the same ranking. However, the reverse is not true, which means that LexRank is more biased than naive Bayes. We systematically develop the relationships and differences between classification, ranking, and probability estimation, which leads to a novel connection between the Brier score and ROC curves. Combining LexRank with isotonic regression, which derives probability estimates from the ROC convex hull, results in the lexicographic probability estimator LexProb.}, author = {Flach,P. and Matsubara,E.T. and De Raedt,L. and Dietterich,T. and Getoor, Lise and Kersting,K. and Muggleton,S. H} } @inbook {13522, title = {Combining Classifiers with Informational Confidence}, booktitle = {Studies in Computational Intelligence: Machine Learning in Document Analysis and RecognitionStudies in Computational Intelligence: Machine Learning in Document Analysis and Recognition}, year = {2008}, month = {2008///}, pages = {163 - 192}, publisher = {Springer}, organization = {Springer}, abstract = {We propose a new statistical method for learning normalized confidence values in multiple classifier systems. Our main idea is to adjust confidence values so that their nominal values equal the information actually conveyed. In order to do so, we assume that information depends on the actual performance of each confidence value on an evaluation set. As information measure, we use Shannon{\textquoteright}s well-known logarithmic notion of information. With the confidence values matching their informational content, the classifier combination scheme reduces to the simple sum-rule, theoretically justifying this elementary combination scheme. In experimental evaluations for script identification, and both handwritten and printed character recognition, we achieve a consistent improvement on the best single recognition rate. We cherish the hope that our information-theoretical framework helps fill the theoretical gap we still experience in classifier combination, and puts the excellent practical performance of multiple classifier systems on a more solid basis.}, author = {Jaeger,Stefan and Ma,Huanfeng and David Doermann}, editor = {Simone Marinai,Hiromichi Fujisawa} } @conference {13739, title = {Combining open-source with research to re-engineer a hands-on introductory NLP course}, booktitle = {Proceedings of the Third Workshop on Issues in Teaching Computational Linguistics}, series = {TeachCL {\textquoteright}08}, year = {2008}, month = {2008///}, pages = {71 - 79}, publisher = {Association for Computational Linguistics}, organization = {Association for Computational Linguistics}, address = {Stroudsburg, PA, USA}, abstract = {We describe our first attempts to re-engineer the curriculum of our introductory NLP course by using two important building blocks: (1) Access to an easy-to-learn programming language and framework to build hands-on programming assignments with real-world data and corpora and, (2) Incorporation of interesting ideas from recent NLP research publications into assignment and examination problems. We believe that these are extremely important components of a curriculum aimed at a diverse audience consisting primarily of first-year graduate students from both linguistics and computer science. Based on overwhelmingly positive student feedback, we find that our attempts were hugely successful.}, isbn = {978-1-932432-14-5}, url = {http://dl.acm.org/citation.cfm?id=1627306.1627318}, author = {Madnani,Nitin and Dorr, Bonnie J} } @conference {12555, title = {Compressive wireless arrays for bearing estimation}, booktitle = {Acoustics, Speech and Signal Processing, 2008. ICASSP 2008. IEEE International Conference on}, year = {2008}, month = {2008/04/31/4}, pages = {2497 - 2500}, abstract = {Joint processing of sensor array outputs improves the performance of parameter estimation and hypothesis testing problems beyond the sum of the individual sensor processing results. When the sensors have high data sampling rates, arrays are tethered, creating a disadvantage for their deployment and also limiting their aperture size. In this paper, we develop the signal processing algorithms for randomly deployable wireless sensor arrays that are severely constrained in communication bandwidth. We focus on the acoustic bearing estimation problem and show that when the target bearings are modeled as a sparse vector in the angle space, low dimensional random projections of the microphone signals can be used to determine multiple source bearings by solving an l 1-norm minimization problem. Field data results are shown where only 10 bits of information is passed from each microphone to estimate multiple target bearings.}, keywords = {acoustic, algorithms;sparse, arrays;acoustic, arrays;hypothesis, bandwidth;compressive, bearing, Estimation, estimation;signal, estimation;sparse, matrices;vectors;wireless, minimization, networks;, problem;communication, problem;microphone, problems;joint, PROCESSING, processing;array, processing;direction-of-arrival, processing;l1-norm, sensor, signal, signals;parameter, Testing, vector;wireless, wireless}, doi = {10.1109/ICASSP.2008.4518155}, author = {Cevher, V. and Gurbuz, A.C. and McClellan, J.H. and Chellapa, Rama} } @article {17764, title = {Computational cultural dynamics}, journal = {IEEE intelligent systems}, volume = {23}, year = {2008}, month = {2008///}, pages = {51 - 57}, author = {Martinez,V. and Simari,G. I and Sliva,A. and V.S. Subrahmanian} } @conference {13741, title = {Computing word-pair antonymy}, booktitle = {Proceedings of the Conference on Empirical Methods in Natural Language Processing}, series = {EMNLP {\textquoteright}08}, year = {2008}, month = {2008///}, pages = {982 - 991}, publisher = {Association for Computational Linguistics}, organization = {Association for Computational Linguistics}, address = {Stroudsburg, PA, USA}, abstract = {Knowing the degree of antonymy between words has widespread applications in natural language processing. Manually-created lexicons have limited coverage and do not include most semantically contrasting word pairs. We present a new automatic and empirical measure of antonymy that combines corpus statistics with the structure of a published thesaurus. The approach is evaluated on a set of closest-opposite questions, obtaining a precision of over 80\%. Along the way, we discuss what humans consider antonymous and how antonymy manifests itself in utterances.}, url = {http://dl.acm.org/citation.cfm?id=1613715.1613843}, author = {Mohammad,Saif and Dorr, Bonnie J and Hirst,Graeme} } @article {12549, title = {A Constrained Probabilistic Petri Net Framework for Human Activity Detection in Video}, journal = {Multimedia, IEEE Transactions on}, volume = {10}, year = {2008}, month = {2008/10//}, pages = {982 - 996}, abstract = {Recognition of human activities in restricted settings such as airports, parking lots and banks is of significant interest in security and automated surveillance systems. In such settings, data is usually in the form of surveillance videos with wide variation in quality and granularity. Interpretation and identification of human activities requires an activity model that a) is rich enough to handle complex multi-agent interactions, b) is robust to uncertainty in low-level processing and c) can handle ambiguities in the unfolding of activities. We present a computational framework for human activity representation based on Petri nets. We propose an extension-Probabilistic Petri Nets (PPN)-and show how this model is well suited to address each of the above requirements in a wide variety of settings. We then focus on answering two types of questions: (i) what are the minimal sub-videos in which a given activity is identified with a probability above a certain threshold and (ii) for a given video, which activity from a given set occurred with the highest probability? We provide the PPN-MPS algorithm for the first problem, as well as two different algorithms (naive PPN-MPA and PPN-MPA) to solve the second. Our experimental results on a dataset consisting of bank surveillance videos and an unconstrained TSA tarmac surveillance dataset show that our algorithms are both fast and provide high quality results.}, keywords = {activity, dataset;automated, detection;human, interactions;security, net;human, nets;image, Petri, probabilistic, processing;multiagent, processing;video, representation;low-level, representation;video, signal, Surveillance, surveillance;, systems;constrained, systems;surveillance, tarmac, TSA, videos;Petri}, isbn = {1520-9210}, doi = {10.1109/TMM.2008.2001369}, author = {Albanese, M. and Chellapa, Rama and Moscato, V. and Picariello, A. and V.S. Subrahmanian and Turaga,P. and Udrea,O.} } @article {13125, title = {Constraint Integration for Efficient Multiview Pose Estimation with Self-Occlusions}, journal = {Pattern Analysis and Machine Intelligence, IEEE Transactions on}, volume = {30}, year = {2008}, month = {2008/03//}, pages = {493 - 506}, abstract = {Automatic initialization and tracking of human pose is an important task in visual surveillance. We present a part-based approach that incorporates a variety of constraints in a unified framework. These constraints include the kinematic constraints between parts that are physically connected to each other, the occlusion of one part by another, and the high correlation between the appearance of certain parts, such as the arms. The location probability distribution of each part is determined by evaluating appropriate likelihood measures. The graphical (nontree) structure representing the interdependencies between parts is utilized to "connect" such part distributions via nonparametric belief propagation. Methods are also developed to perform this optimization efficiently in the large space of pose configurations.}, keywords = {Automated;Posture;Reproducibility of Results;Sensitivity and Specificity;Video Recording;Whole Body Imaging;, automatic initialization;constraint integration;graphical structure;human pose tracking;kinematic constraint;likelihood measure;location probability distribution;multiview pose estimation;nonparametric belief propagation;optimization;pose configuration;se, Computer-Assisted;Imaging, Three-Dimensional;Pattern Recognition}, isbn = {0162-8828}, doi = {10.1109/TPAMI.2007.1173}, author = {Gupta,A. and Mittal,A. and Davis, Larry S.} } @article {17758, title = {CONVEX: Similarity-Based Algorithms for Forecasting Group Behavior}, journal = {Intelligent Systems, IEEE}, volume = {23}, year = {2008}, month = {2008/08//july}, pages = {51 - 57}, abstract = {A proposed framework for predicting a group{\textquoteright}s behavior associates two vectors with that group. The context vector tracks aspects of the environment in which the group functions; the action vector tracks the group{\textquoteright}s previous actions. Given a set of past behaviors consisting of a pair of these vectors and given a query context vector, the goal is to predict the associated action vector. To achieve this goal, two families of algorithms employ vector similarity. CONVEXk _NN algorithms use k-nearest neighbors in high-dimensional metric spaces; CONVEXMerge algorithms look at linear combinations of distances of the query vector from context vectors. Compared to past prediction algorithms, these algorithms are extremely fast. Moreover, experiments on real-world data sets show that the algorithms are highly accurate, predicting actions with well over 95-percent accuracy.}, keywords = {(artificial, algorithm;action, algorithm;behavioural, algorithm;CONVEXk-NN, BEHAVIOR, computing;ontologies, CONVEXMerge, forecasting;high-dimensional, intelligence);, metric, sciences, space;ontology;similarity-based, vector;context, vector;group}, isbn = {1541-1672}, doi = {10.1109/MIS.2008.62}, author = {Martinez,V. and Simari,G. I and Sliva,A. and V.S. Subrahmanian} } @article {12127, title = {CrossTalk: The Journal of Defense Software Engineering. Volume 21, Number 10, October 2008}, year = {2008}, month = {2008///}, institution = {DTIC Document}, author = {Basili, Victor R. and Dangle,K. and Esker,L. and Marotta,F. and Rus,I. and Brosgol,B. M and Jamin,S. and Arthur,J. D and Ravichandar,R. and Wisnosky,D. E} } @conference {19584, title = {Deciding kCFA is Complete for EXPTIME}, booktitle = {ICFP {\textquoteright}08 Proceedings of the 13th ACM SIGPLAN International Conference on Functional Programming}, series = {ICFP {\textquoteright}08}, year = {2008}, month = {2008///}, pages = {275 - 282}, publisher = {ACM}, organization = {ACM}, abstract = {We give an exact characterization of the computational complexity of the kCFA hierarchy. For any k > 0, we prove that the control flow decision problem is complete for deterministic exponential time. This theorem validates empirical observations that such control flow analysis is intractable. It also provides more general insight into the complexity of abstract interpretation.}, keywords = {complexity, flow analysis}, isbn = {978-1-59593-919-7}, url = {http://doi.acm.org/10.1145/1411204.1411243}, author = {David Van Horn and Mairson, Harry G.} } @article {18768, title = {Development of a multi-piece multi-gate mold for manufacturing a flapping wing drive-mechanism}, journal = {Transactions of North American Manufacturing Research Institution of SME}, volume = {36}, year = {2008}, month = {2008///}, abstract = {Successful realization a flapping wing microair vehicle (MAV) requires development of a light weight drive-mechanism that can convert the continuous rotary motion to oscillatory flapping motion. Molded compliant drive-mechanisms are an attractive design option because of manufacturing scalability and reduction in the number of parts. The unique characteristics of this mechanism require development of a complex multi-piece multi-gate mold design. This paper describes a systematic approach for determining the part shape and size, optimizing the mold pieces, and placing the gates on the multi-piece mold. The novel aspects of this work include (1) selecting non-critical shape features to optimize the mold design and (2) the use of sacrificial structural elements to reduce the impact of the weld lines on the structural performance. The mold developed using our approach was utilized to realize a working flapping wing MAV. }, url = {http://web.mit.edu/arvinda/www/NAMRI_2008_Draft.pdf}, author = {Ananthanarayanan,A. and Bejgerowski,W. and Mueller,D. and Gupta,S.K.} } @article {13292, title = {Discrete Distortion in Triangulated 3-Manifolds}, journal = {Computer Graphics Forum}, volume = {27}, year = {2008}, month = {2008/09/29/}, pages = {1333 - 1340}, abstract = {We introduce a novel notion, that we call discrete distortion, for a triangulated 3-manifold. Discrete distortion naturally generalizes the notion of concentrated curvature defined for triangulated surfaces and provides a powerful tool to understand the local geometry and topology of 3-manifolds. Discrete distortion can be viewed as a discrete approach to Ricci curvature for singular flat manifolds. We distinguish between two kinds of distortion, namely, vertex distortion, which is associated with the vertices of the tetrahedral mesh decomposing the 3-manifold, and bond distortion, which is associated with the edges of the tetrahedral mesh. We investigate properties of vertex and bond distortions. As an example, we visualize vertex distortion on manifold hypersurfaces in R4 defined by a scalar field on a 3D mesh. distance fields.}, keywords = {I.3.3 [Computer Graphics], I.3.5 [Computational Geometry and Object Modeling]}, isbn = {1467-8659}, doi = {10.1111/j.1467-8659.2008.01272.x}, url = {http://onlinelibrary.wiley.com/doi/10.1111/j.1467-8659.2008.01272.x/abstract?userIsAuthenticated=false\&deniedAccessCustomisedMessage=}, author = {Mesmoudi,Mohammed Mostefa and De Floriani, Leila and Port,Umberto} } @article {19615, title = {Distortion lower bounds for line embeddings}, journal = {Information Processing Letters}, volume = {108}, year = {2008}, month = {2008/10/31/}, pages = {175 - 178}, abstract = {In this paper, we show how we can derive lower bounds and also compute the exact distortion for the line embeddings of some special metrics, especially trees and graphs with certain structure. Using linear programming to formulate a simpler version of the problem gives an interesting intuition and direction concerning the computation of general lower bounds for distortion into the line. We also show that our lower bounds on special cases of metrics are a lot better than previous lower bounds.}, keywords = {combinatorial problems, Theory of computation}, isbn = {0020-0190}, url = {http://www.sciencedirect.com/science/article/pii/S0020019008001464}, author = {Mathieu, Claire and Charalampos Papamanthou} } @article {18961, title = {The draft genome of the transgenic tropical fruit tree papaya (Carica papaya Linnaeus)}, journal = {Nature}, volume = {452}, year = {2008}, month = {2008///}, pages = {991 - 996}, abstract = {Papaya, a fruit crop cultivated in tropical and subtropical regions, is known for its nutritional benefits and medicinal applications. Here we report a 3 draft genome sequence of {\textquoteright}SunUp{\textquoteright} papaya, the first commercial virus-resistant transgenic fruit tree to be sequenced. The papaya genome is three times the size of the Arabidopsis genome, but contains fewer genes, including significantly fewer disease-resistance gene analogues. Comparison of the five sequenced genomes suggests a minimal angiosperm gene set of 13,311. A lack of recent genome duplication, atypical of other angiosperm genomes sequenced so far, may account for the smaller papaya gene number in most functional groups. Nonetheless, striking amplifications in gene number within particular functional groups suggest roles in the evolution of tree-like habit, deposition and remobilization of starch reserves, attraction of seed dispersal agents, and adaptation to tropical daylengths. Transgenesis at three locations is closely associated with chloroplast insertions into the nuclear genome, and with topoisomerase I recognition sites. Papaya offers numerous advantages as a system for fruit-tree functional genomics, and this draft genome sequence provides the foundation for revealing the basis of Carica{\textquoteright}s distinguishing morpho-physiological, medicinal and nutritional properties.}, isbn = {0028-0836}, doi = {10.1038/nature06856}, url = {http://www.nature.com/nature/journal/v452/n7190/full/nature06856.html}, author = {Ming,R. and Hou,S. and Feng,Y. and Yu,Q. and Dionne-Laporte,A. and Saw,J.H. and Senin,P. and Wang,W. and Ly,B.V. and Lewis,K.L.T. and others} } @conference {15452, title = {Effective and scalable software compatibility testing}, booktitle = {Proceedings of the 2008 international symposium on Software testing and analysis}, series = {ISSTA {\textquoteright}08}, year = {2008}, month = {2008///}, pages = {63 - 74}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Today{\textquoteright}s software systems are typically composed of multiple components, each with different versions. Software compatibility testing is a quality assurance task aimed at ensuring that multi-component based systems build and/or execute correctly across all their versions{\textquoteright} combinations, or configurations. Because there are complex and changing interdependencies between components and their versions, and because there are such a large number of configurations, it is generally infeasible to test all potential configurations. Consequently, in practice, compatibility testing examines only a handful of default or popular configurations to detect problems; as a result costly errors can and do escape to the field. This paper presents a new approach to compatibility testing, called Rachet. We formally model the entire configuration space for software systems and use the model to generate test plans to sample a portion of the space. In this paper, we test all direct dependencies between components and execute the test plan efficiently in parallel. We present empirical results obtained by applying our approach to two large-scale scientific middleware systems. The results show that for these systems Rachet scaled well and discovered incompatibilities between components, and that testing only direct dependences did not compromise test quality.}, keywords = {component-based software system, software compatibility testing}, isbn = {978-1-60558-050-0}, doi = {10.1145/1390630.1390640}, url = {http://doi.acm.org/10.1145/1390630.1390640}, author = {Yoon,Il-Chul and Sussman, Alan and Memon, Atif M. and Porter, Adam} } @inbook {19607, title = {Effective Visualization of File System Access-Control}, booktitle = {Visualization for Computer Security}, series = {Lecture Notes in Computer Science}, year = {2008}, month = {2008/01/01/}, pages = {18 - 25}, publisher = {Springer Berlin Heidelberg}, organization = {Springer Berlin Heidelberg}, abstract = {In this paper, we present a visual representation of access control permissions in a standard hierarchical file system. Our visualization of file permissions leverages treemaps, a popular graphical representation of hierarchical data. In particular, we present a visualization of access control for the NTFS file system that can help a non-expert user understand and manipulate file system permissions in a simple and effective way. While our examples are based on NTFS, our approach can be used for many other hierarchical file systems as well.}, keywords = {Computer Communication Networks, Computer Imaging, Vision, Pattern Recognition and Graphics, data mining and knowledge discovery, Data Structures, Cryptology and Information Theory, Visualization}, isbn = {978-3-540-85931-4, 978-3-540-85933-8}, url = {http://link.springer.com/chapter/10.1007/978-3-540-85933-8_2}, author = {Heitzmann, Alexander and Palazzi, Bernardo and Charalampos Papamanthou and Tamassia, Roberto}, editor = {Goodall, John R. and Conti, Gregory and Ma, Kwan-Liu} } @conference {15544, title = {Efficient Kriging via Fast Matrix-Vector Products}, booktitle = {Aerospace Conference, 2008 IEEE}, year = {2008}, month = {2008/03//}, pages = {1 - 7}, abstract = {Interpolating scattered data points is a problem of wide ranging interest. Ordinary kriging is an optimal scattered data estimator, widely used in geosciences and remote sensing. A generalized version of this technique, called cokriging, can be used for image fusion of remotely sensed data. However, it is computationally very expensive for large data sets. We demonstrate the time efficiency and accuracy of approximating ordinary kriging through the use of fast matrix-vector products combined with iterative methods. We used methods based on the fast Multipole methods and nearest neighbor searching techniques for implementations of the fast matrix-vector products.}, keywords = {cokriging technique, fast matrix-vector products, fast multipole methods, geophysical techniques, image fusion, Interpolation, iterative methods, nearest neighbor searching, optimal scattered data estimator, Remote sensing, remotely sensed data, scattered data points, sensor fusion, time efficiency}, doi = {10.1109/AERO.2008.4526433}, author = {Memarsadeghi,N. and Raykar,V.C. and Duraiswami, Ramani and Mount, Dave} } @conference {13984, title = {Efficient Kriging via Fast Matrix-Vector Products}, booktitle = {Aerospace Conference, 2008 IEEE}, year = {2008}, month = {2008/03//}, pages = {1 - 7}, abstract = {Interpolating scattered data points is a problem of wide ranging interest. Ordinary kriging is an optimal scattered data estimator, widely used in geosciences and remote sensing. A generalized version of this technique, called cokriging, can be used for image fusion of remotely sensed data. However, it is computationally very expensive for large data sets. We demonstrate the time efficiency and accuracy of approximating ordinary kriging through the use of fast matrix-vector products combined with iterative methods. We used methods based on the fast Multipole methods and nearest neighbor searching techniques for implementations of the fast matrix-vector products.}, keywords = {cokriging, data, data;scattered, efficiency;geophysical, estimator;remotely, fusion;, fusion;interpolation;iterative, matrix-vector, methods;image, methods;nearest, methods;remote, multipole, neighbor, points;time, products;fast, scattered, searching;optimal, sensed, sensing;sensor, technique;fast, techniques;iterative}, doi = {10.1109/AERO.2008.4526433}, author = {Memarsadeghi,N. and Raykar,V.C. and Duraiswami, Ramani and Mount, Dave} } @conference {15648, title = {Embedding and similarity search for point sets under translation}, booktitle = {Proceedings of the twenty-fourth annual symposium on Computational geometry}, series = {SCG {\textquoteright}08}, year = {2008}, month = {2008///}, pages = {320 - 327}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Pattern matching in point sets is a well studied problem with numerous applications. We assume that the point sets may contain outliers (missing or spurious points) and are subject to an unknown translation. We define the distance between any two point sets to be the minimum size of their symmetric difference over all translations of one set relative to the other. We consider the problem in the context of similarity search. We assume that a large database of point sets is to be preprocessed so that given any query point set, the closest matches in the database can be computed efficiently. Our approach is based on showing that there is a randomized algorithm that computes a translation-invariant embedding of any point set of size at most n into the L_1 metric, so that with high probability, distances are subject to a distortion that is O(log2 n).}, keywords = {EMBEDDING, point pattern matching, randomized algorithms, Similarity Search}, isbn = {978-1-60558-071-5}, doi = {10.1145/1377676.1377731}, url = {http://doi.acm.org/10.1145/1377676.1377731}, author = {Cho,Minkyoung and Mount, Dave} } @inbook {13365, title = {Energy Efficient Monitoring in Sensor Networks}, booktitle = {LATIN 2008: Theoretical InformaticsLATIN 2008: Theoretical Informatics}, series = {Lecture Notes in Computer Science}, volume = {4957}, year = {2008}, month = {2008///}, pages = {436 - 448}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {In this paper we study a set of problems related to efficient energy management for monitoring applications in wireless sensor networks. We study several generalizations of a basic problem called Set k -Cover, which can be described as follows: we are given a set of sensors, and a set of regions to be monitored. Each region can be monitored by a subset of the sensors. To increase the lifetime of the sensor network, we would like to partition the sensors into k sets (or time-slots) and activate each partition in a different time-slot. The goal is to find the partitioning that maximizes the coverage of the regions. This problem is known to be NP -hard. We first develop improved approximation algorithms for this problem based on its similarities to the max k -cut problem. We then consider a variation, called Set ( k , α )-cover, where each sensor is allowed to be active in α different time-slots. We develop a randomized routing algorithm for this problem. We then consider extensions where each sensor can monitor only a bounded number of regions in any time-slot. We develop the first approximation algorithms for this problem. An experimental evaluation of the algorithms we propose can be found in the full version of the paper.}, isbn = {978-3-540-78772-3}, url = {http://dx.doi.org/10.1007/978-3-540-78773-0_38}, author = {Deshpande, Amol and Khuller, Samir and Malekian,Azarakhsh and Toossi,Mohammed}, editor = {Laber,Eduardo and Bornstein,Claudson and Nogueira,Loana and Faria,Luerbio} } @conference {15585, title = {Enhancements in robust feature matching}, booktitle = {Electrical Engineering/Electronics, Computer, Telecommunications and Information Technology, 2008. ECTI-CON 2008. 5th International Conference on}, volume = {1}, year = {2008}, month = {2008/05//}, pages = {505 - 508}, abstract = {We present in this paper a number of new enhancements to a branch-and-bound algorithm given by Mount, Netanyahu, and Le Moigne [8] for feature matching. We introduce a new distance measure, which is more robust to the presence of outliers than the previously used measure, as well as a new variant of the search algorithm and a new search strategy. We also present experimental results, which show that these enhancements offer significant tangible improvements in performance.}, keywords = {branch-and-bound algorithm, distance measure, Image Enhancement, Image matching, robust feature matching, tree searching}, doi = {10.1109/ECTICON.2008.4600481}, author = {Ratanasanya,S. and Mount, Dave and Netanyahu,N. S and Achalakul,T.} } @article {12913, title = {Environmental signatures associated with cholera epidemics}, journal = {Proceedings of the National Academy of Sciences}, volume = {105}, year = {2008}, month = {2008///}, pages = {17676 - 17676}, abstract = {The causative agent of cholera, Vibrio cholerae, has been shown to be autochthonous to riverine, estuarine, and coastal waters along with its host, the copepod, a significant member of the zooplankton community. Temperature, salinity, rainfall and plankton have proven to be important factors in the ecology of V. cholerae, influencing the transmission of the disease in those regions of the world where the human population relies on untreated water as a source of drinking water. In this study, the pattern of cholera outbreaks during 1998{\textendash}2006 in Kolkata, India, and Matlab, Bangladesh, and the earth observation data were analyzed with the objective of developing a prediction model for cholera. Satellite sensors were used to measure chlorophyll a concentration (CHL) and sea surface temperature (SST). In addition, rainfall data were obtained from both satellite and in situ gauge measurements. From the analyses, a statistically significant relationship between the time series for cholera in Kolkata, India, and CHL and rainfall anomalies was determined. A statistically significant one month lag was observed between CHL anomaly and number of cholera cases in Matlab, Bangladesh. From the results of the study, it is concluded that ocean and climate patterns are useful predictors of cholera epidemics, with the dynamics of endemic cholera being related to climate and/or changes in the aquatic ecosystem. When the ecology of V. cholerae is considered in predictive models, a robust early warning system for cholera in endemic regions of the world can be developed for public health planning and decision making.ecology epidemiology microbiology remote sensing }, isbn = {0027-8424, 1091-6490}, doi = {10.1073/pnas.0809654105}, url = {http://www.pnas.org/content/105/46/17676}, author = {Constantin de Magny,G. and Murtugudde,R. and Sapiano,M. R. P. and Nizam,A. and Brown,C. W. and Busalacchi,A. J. and Yunus,M. and Nair,G. B. and Gil,A. I. and Lanata,C. F. and Rita R Colwell} } @inbook {12996, title = {Expanding the reach of Grid computing: combining Globus- and BOINC-based systems}, booktitle = {Grids for Bioinformatics and Computational BiologyGrids for Bioinformatics and Computational Biology}, series = {Wiley Book Series on Bioinformatics: Computational Techniques and Engineering}, year = {2008}, month = {2008///}, pages = {71 - 85}, publisher = {Wiley-Interscience}, organization = {Wiley-Interscience}, address = {Hoboken}, author = {Myers,D. S and Bazinet,A. L and Cummings, Michael P.}, editor = {Talbi,E-G and Zomaya,AY} } @article {14432, title = {Exploiting Prior Knowledge in Intelligent Assistants: Combining Relational Models with Hierarchies}, journal = {Probabilistic, Logical and Relational Learning - A Further Synthesis}, year = {2008}, month = {2008///}, abstract = {Statitsical relational models have been successfully used to model static probabilistic relationships between the entities of the domain. In this talk, we illustrate their use in a dynamic decison-theoretic setting where the task is to assist a user by inferring his intentional structure and taking appropriate assistive actions. We show that the statistical relational models can be used to succintly express the system{\textquoteright}s prior knowledge about the user{\textquoteright}s goal-subgoal structure and tune it with experience. As the system is better able to predict the user{\textquoteright}s goals, it improves the effectiveness of its assistance. We show through experiments that both the hierarchical structure of the goals and the parameter sharing facilitated by relational models significantly improve the learning speed.}, author = {Natarajan,S. and Tadepalli,P. and Fern,A. and De Raedt,L. and Dietterich,T. and Getoor, Lise and Kersting,K. and Muggleton,S. H} } @conference {15317, title = {Fast, easy, and cheap: Construction of statistical machine translation models with MapReduce}, booktitle = {Proceedings of the Third Workshop on Statistical Machine Translation}, year = {2008}, month = {2008///}, pages = {199 - 207}, publisher = {Association for Computational Linguistics}, organization = {Association for Computational Linguistics}, abstract = {In recent years, the quantity of parallel train-ing data available for statistical machine trans- lation has increased far more rapidly than the performance of individual computers, re- sulting in a potentially serious impediment to progress. Parallelization of the model- building algorithms that process this data on computer clusters is fraught with challenges such as synchronization, data exchange, and fault tolerance. However, the MapReduce programming paradigm has recently emerged as one solution to these issues: a powerful functional abstraction hides system-level de- tails from the researcher, allowing programs to be transparently distributed across potentially very large clusters of commodity hardware. We describe MapReduce implementations of two algorithms used to estimate the parame- ters for two word alignment models and one phrase-based translation model, all of which rely on maximum likelihood probability esti- mates. On a 20-machine cluster, experimental results show that our solutions exhibit good scaling characteristics compared to a hypo- thetical, optimally-parallelized version of cur- rent state-of-the-art single-core tools. }, author = {Dyer,C. and Cordova,A. and Mont,A. and Jimmy Lin} } @inbook {19586, title = {Flow Analysis, Linearity, and PTIME}, booktitle = {Static Analysis}, series = {Lecture Notes in Computer Science}, year = {2008}, month = {2008/01/01/}, pages = {255 - 269}, publisher = {Springer Berlin Heidelberg}, organization = {Springer Berlin Heidelberg}, abstract = {Flow analysis is a ubiquitous and much-studied component of compiler technology{\textemdash}and its variations abound. Amongst the most well known is Shivers{\textquoteright} 0CFA; however, the best known algorithm for 0CFA requires time cubic in the size of the analyzed program and is unlikely to be improved. Consequently, several analyses have been designed to approximate 0CFA by trading precision for faster computation. Henglein{\textquoteright}s simple closure analysis, for example, forfeits the notion of directionality in flows and enjoys an {\textquotedblleft}almost linear{\textquotedblright} time algorithm. But in making trade-offs between precision and complexity, what has been given up and what has been gained? Where do these analyses differ and where do they coincide? We identify a core language{\textemdash}the linear λ-calculus{\textemdash}where 0CFA, simple closure analysis, and many other known approximations or restrictions to 0CFA are rendered identical. Moreover, for this core language, analysis corresponds with (instrumented) evaluation. Because analysis faithfully captures evaluation, and because the linear λ-calculus is complete for ptime, we derive ptime-completeness results for all of these analyses.}, keywords = {Logics and Meanings of Programs, Mathematical Logic and Formal Languages, Programming Languages, Compilers, Interpreters, Programming Techniques, software engineering}, isbn = {978-3-540-69163-1, 978-3-540-69166-2}, url = {http://link.springer.com/chapter/10.1007/978-3-540-69166-2_17}, author = {David Van Horn and Mairson, Harry G.}, editor = {Alpuente, Mar{\'\i}a and Vidal, Germ{\'a}n} } @conference {14331, title = {Flowers or a robot army?: encouraging awareness \& activity with personal, mobile displays}, booktitle = {Proceedings of the 10th international conference on Ubiquitous computing}, series = {UbiComp {\textquoteright}08}, year = {2008}, month = {2008///}, pages = {54 - 63}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Personal, mobile displays, such as those on mobile phones, are ubiquitous, yet for the most part, underutilized. We present results from a field experiment that investigated the effectiveness of these displays as a means for improving awareness of daily life (in our case, self-monitoring of physical activity). Twenty-eight participants in three experimental conditions used our UbiFit system for a period of three months in their day-to-day lives over the winter holiday season. Our results show, for example, that participants who had an awareness display were able to maintain their physical activity level (even during the holidays), while the level of physical activity for participants who did not have an awareness display dropped significantly. We discuss our results and their general implications for the use of everyday mobile devices as awareness displays.}, keywords = {ambient display, awareness, calm technology, field experiment, fitness, glanceable display, mobile phone, personal mobile display, persuasive technology, physical activity}, isbn = {978-1-60558-136-1}, doi = {10.1145/1409635.1409644}, url = {http://doi.acm.org/10.1145/1409635.1409644}, author = {Consolvo,Sunny and Klasnja,Predrag and McDonald,David W. and Avrahami,Daniel and Jon Froehlich and LeGrand,Louis and Libby,Ryan and Mosher,Keith and Landay,James A.} } @inbook {14698, title = {Formalizing Soundness of Contextual Effects}, booktitle = {Theorem Proving in Higher Order LogicsTheorem Proving in Higher Order Logics}, series = {Lecture Notes in Computer Science}, volume = {5170}, year = {2008}, month = {2008///}, pages = {262 - 277}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {A contextual effect system generalizes standard type and effect systems: where a standard effect system computes the effect of an expression e , a contextual effect system additionally computes the prior and future effect of e , which characterize the behavior of computation prior to and following, respectively, the evaluation of e . This paper describes the formalization and proof of soundness of contextual effects, which we mechanized using the Coq proof assistant. Contextual effect soundness is an unusual property because the prior and future effect of a term e depends not on e itself (or its evaluation), but rather on the evaluation of the context in which e appears. Therefore, to state and prove soundness we must {\textquotedblleft}match up{\textquotedblright} a subterm in the original typing derivation with the possibly-many evaluations of that subterm during the evaluation of the program, in a way that is robust under substitution. We do this using a novel typed operational semantics. We conjecture that our approach could prove useful for reasoning about other properties of derivations that rely on the context in which that derivation appears.}, isbn = {978-3-540-71065-3}, url = {http://dx.doi.org/10.1007/978-3-540-71067-7_22}, author = {Pratikakis,Polyvios and Foster, Jeffrey S. and Hicks, Michael W. and Neamtiu,Iulian}, editor = {Mohamed,Otmane and Mu{\~n}oz,C{\'e}sar and Tahar,Sofi{\`e}ne} } @conference {12106, title = {A Framework for Software Engineering Experimental Replications}, booktitle = {Engineering of Complex Computer Systems, 2008. ICECCS 2008. 13th IEEE International Conference on}, year = {2008}, month = {2008/04/31/3}, pages = {203 - 212}, abstract = {Experimental replications are very important to the advancement of empirical software engineering. Replications are one of the key mechanisms to confirm previous experimental findings. They are also used to transfer experimental knowledge, to train people, and to expand a base of experimental evidence. Unfortunately, experimental replications are difficult endeavors. It is not easy to transfer experimental know-how and experimental findings. Based on our experience, this paper discusses this problem and proposes a Framework for Improving the Replication of Experiments (FIRE). The FIRE addresses knowledge sharing issues both at the intra-group (internal replications) and inter-group (external replications) levels. It encourages coordination of replications in order to facilitate knowledge transfer for lower cost, higher quality replications and more generalizable results.}, keywords = {engineering, engineering;, evidence;experimental, experimental, Experiments;experimental, for, Framework, Improving, knowledge, of, replication, replication;software, sharing;software, the, transfer;knowledge}, doi = {10.1109/ICECCS.2008.38}, author = {Mendonca,M.G. and Maldonado,J.C. and de Oliveira,M.C.F. and Carver, J. and Fabbri,C.P.F. and Shull, F. and Travassos,G.H. and Hohn,E.N. and Basili, Victor R.} } @article {13130, title = {A general method for sensor planning in multi-sensor systems: Extension to random occlusion}, journal = {International Journal of Computer Vision}, volume = {76}, year = {2008}, month = {2008///}, pages = {31 - 52}, abstract = {ystems utilizing multiple sensors are required in many domains. In this paper, we specifically concern ourselves with applications where dynamic objects appear randomly and the system is employed to obtain some user-specified characteristics of such objects. For such systems, we deal with the tasks of determining measures for evaluating their performance and of determining good sensor configurations that would maximize such measures for better system performance.We introduce a constraint in sensor planning that has not been addressed earlier: visibility in the presence of random occluding objects. occlusion causes random loss of object capture from certain necessitates the use of other sensors that have visibility of this object. Two techniques are developed to analyze such visibility constraints: a probabilistic approach to determine {\textquotedblleft}average{\textquotedblright} visibility rates and a deterministic approach to address worst-case scenarios. Apart from this constraint, other important constraints to be considered include image resolution, field of view, capture orientation, and algorithmic constraints such as stereo matching and background appearance. Integration of such constraints is performed via the development of a probabilistic framework that allows one to reason about different occlusion events and integrates different multi-view capture and visibility constraints in a natural way. Integration of the thus obtained capture quality measure across the region of interest yields a measure for the effectiveness of a sensor configuration and maximization of such measure yields sensor configurations that are best suited for a given scenario. The approach can be customized for use in many multi-sensor applications and our contribution is especially significant for those that involve randomly occurring objects capable of occluding each other. These include security systems for surveillance in public places, industrial automation and traffic monitoring. Several examples illustrate such versatility by application of our approach to a diverse set of different and sometimes multiple system objectives. }, author = {Mittal,A. and Davis, Larry S.} } @article {16717, title = {Generalizing Word Lattice Translation}, year = {2008}, month = {2008/02//}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {Word lattice decoding has proven useful in spoken language translation; we argue that it provides a compelling model for translation of text genres, as well. We extend lattice decoding to hierarchical phrase-based models, providing a unified treatment with phrase-based decoding by treating lattices as a case of weighted finite-state automata. In the process, we resolve a significant complication that lattice representations introduce in reordering models. Our experiments evaluating the approach demonstrate substantial gains for Chinese-English and Arabic-English translation.}, keywords = {*MACHINE TRANSLATION, *STATISTICAL MACHINE TRANSLATION, *WORD LATTICE TRANSLATION, grammars, HIERARCHICAL PHRASE-BASED MODELS, linguistics, MODELS, STATISTICAL PROCESSES}, url = {http://stinet.dtic.mil/oai/oai?\&verb=getRecord\&metadataPrefix=html\&identifier=ADA481994}, author = {Dyer,Christopher and Muresan,Smaranda and Resnik, Philip} } @article {16271, title = {Genome-Wide Analysis of Repetitive Elements in Papaya}, journal = {Tropical Plant Biology}, volume = {1}, year = {2008}, month = {2008///}, pages = {191 - 201}, abstract = {Papaya ( Carica papaya L.) is an important fruit crop cultivated in tropical and subtropical regions worldwide. A first draft of its genome sequence has been recently released. Together with Arabidopsis , rice, poplar, grapevine and other genomes in the pipeline, it represents a good opportunity to gain insight into the organization of plant genomes. Here we report a detailed analysis of repetitive elements in the papaya genome, including transposable elements (TEs), tandemly-arrayed sequences, and high copy number genes. These repetitive sequences account for \~{}56\% of the papaya genome with TEs being the most abundant at 52\%, tandem repeats at 1.3\% and high copy number genes at 3\%. Most common types of TEs are represented in the papaya genome with retrotransposons being the dominant class, accounting for 40\% of the genome. The most prevalent retrotransposons are Ty3-gypsy (27.8\%) and Ty1-copia (5.5\%). Among the tandem repeats, microsatellites are the most abundant in number, but represent only 0.19\% of the genome. Minisatellites and satellites are less abundant, but represent 0.68\% and 0.43\% of the genome, respectively, due to greater repeat length. Despite an overall smaller gene repertoire in papaya than many other angiosperms, a significant fraction of genes (\>2\%) are present in large gene families with copy number greater than 20. This repeat database clarified a major part of the papaya genome organization and partly explained the lower gene repertoire in papaya than in Arabidopsis .}, isbn = {1935-9756}, url = {http://dx.doi.org/10.1007/s12042-008-9015-0}, author = {Nagarajan,Niranjan and Navajas-P{\'e}rez,Rafael and Pop, Mihai and Alam,Maqsudul and Ming,Ray and Paterson,Andrew and Salzberg,Steven} } @conference {12245, title = {Growth of the flickr social network}, booktitle = {Proceedings of the first workshop on Online social networks}, series = {WOSN {\textquoteright}08}, year = {2008}, month = {2008///}, pages = {25 - 30}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Online social networking sites like MySpace, Orkut, and Flickr are among the most popular sites on the Web and continue to experience dramatic growth in their user population. The popularity of these sites offers a unique opportunity to study the dynamics of social networks at scale. Having a proper understanding of how online social networks grow can provide insights into the network structure, allow predictions of future growth, and enable simulation of systems on networks of arbitrary size. However, to date, most empirical studies have focused on static network snapshots rather than growth dynamics. In this paper, we collect and examine detailed growth data from the Flickr online social network, focusing on the ways in which new links are formed. Our study makes two contributions. First, we collect detailed data covering three months of growth, encompassing 950,143 new users and over 9.7 million new links, and we make this data available to the research community. Second, we use a first-principles approach to investigate the link formation process. In short, we find that links tend to be created by users who already have many links, that users tend to respond to incoming links by creating links back to the source, and that users link to other users who are already close in the network.}, keywords = {growth, measurement, social networks}, isbn = {978-1-60558-182-8}, doi = {10.1145/1397735.1397742}, url = {http://doi.acm.org/10.1145/1397735.1397742}, author = {Mislove,Alan and Koppula,Hema Swetha and Gummadi,Krishna P. and Druschel,Peter and Bhattacharjee, Bobby} } @conference {19450, title = {Hci for community and international development}, booktitle = {SIGCHI EA {\textquoteright}08}, series = {CHI EA {\textquoteright}08}, year = {2008}, month = {2008///}, pages = {3909 - 3912}, publisher = {ACM}, organization = {ACM}, abstract = {This workshop explores the challenges in applying, extending and inventing appropriate methods and contributions of Human Computer Interaction (HCI) to International economic and community Development. We address interaction design for parts of the world that are often marginalized by the Global North as well as people in the Global North who are themselves similarly marginalized by poverty or other barriers. We hope to extend the boundaries of the field of Human Computer Interaction by spurring a discussion on how existing methods and practices can be adapted and modified, and how new practices can be developed, to deal with the unique challenges posed by these contexts.}, keywords = {community design, ict4d, information and communication technology, international development, participatory design, ucd4id, User centered design}, isbn = {978-1-60558-012-8}, url = {http://doi.acm.org/10.1145/1358628.1358954}, author = {Thomas, John and Dearden, Andy and Dray, Susan and Light, Ann and Best, Michael and Arkin, Nuray and Maunder, Andrew and Kam, Mathew and Marshini Chetty and Sambasivan, Nithya and Buckhalter, Celeste and Krishnan, Gaurishankar} } @conference {13263, title = {A hierarchical spatial index for triangulated surfaces}, booktitle = {Int. Conf. on Computer Graphics Theory and Applications (GRAPP)}, year = {2008}, month = {2008///}, pages = {86 - 91}, abstract = {We present the PM2-Triangle quadtree (PM2T-quadtree), a new hierarchical spatial index for triangle mesheswhich has been designed for performing spatial queries on triangle-based terrain models. The PM2T-quadtree is based on a recursive space decomposition into square blocks. Here, we propose a highly compact data structure encoding a PM2T-quadtree, which decouples the spatial indexing structure from the combinatorial description of the mesh. We compare the PM2T-quadtree against other spatial indexes by considering the structure of the underlying domain subdivision, the storage costs of their data structures and the performance in geometric queries. }, author = {De Floriani, Leila and Facinoli,M. and Magillo,P. and Dimitri,D.} } @article {18492, title = {Hosting virtual networks on commodity hardware}, volume = {GT-CS-07-10}, year = {2008}, month = {2008///}, institution = {Georgia Institute of Technology}, abstract = {This paper describes Trellis, a software platform for hostingmultiple virtual networks on shared commodity hardware. Trellis allows each virtual network to define its own topol- ogy, control protocols, and forwarding tables, which low- ers the barrier for deploying custom services on an isolated, reconfigurable, and programmable network, while amor- tizing costs by sharing the physical infrastructure. Trellis synthesizes two container-based virtualization technologies, VServer and NetNS, as well as a new tunneling mechanism, EGRE, into a coherent platform that enables high-speed vir- tual networks. We describe the design and implementation, of Trellis, including kernel-level performance optimizations, and evaluate its supported packet-forwarding rates against other virtualization technologies. We are in the process of upgrading the VINI facility to use Trellis. We also plan to release Trellis as part of MyVINI, a standalone software dis- tribution that allows researchers and application developers to deploy their own virtual network hosting platforms. }, author = {Bhatia,S. and Motiwala,M. and Muhlbauer,W. and Valancius,V. and Bavier,A. and Feamster, Nick and Peterson,L. and Rexford,J.} } @conference {18224, title = {Image acquisition forensics: Forensic analysis to identify imaging source}, booktitle = {Acoustics, Speech and Signal Processing, 2008. ICASSP 2008. IEEE International Conference on}, year = {2008}, month = {2008/04/31/4}, pages = {1657 - 1660}, abstract = {With widespread availability of digital images and easy-to-use image editing softwares, the origin and integrity of digital images has become a serious concern. This paper introduces the problem of image acquisition forensics and proposes a fusion of a set of signal processing features to identify the source of digital images. Our results show that the devices{\textquoteright} color interpolation coefficients and noise statistics can jointly serve as good forensic features to help accurately trace the origin of the input image to its production process and to differentiate between images produced by cameras, cell phone cameras, scanners, and computer graphics. Further, the proposed features can also be extended to determining the brand and model of the device. Thus, the techniques introduced in this work provide a unified framework for image acquisition forensics.}, keywords = {ACQUISITION, acquisition;image, analysis;, analysis;image, analysis;interpolation;statistical, cameras;color, cell, coefficients;computer, colour, editing, forensics;image, graphics;digital, identification;noise, images;forensic, Interpolation, phone, processing;data, softwares;imaging, source, statistics;scanners;signal}, doi = {10.1109/ICASSP.2008.4517945}, author = {McKay,C. and Swaminathan,A. and Gou,Hongmei and M. Wu} } @conference {15694, title = {Immunity-Based Epidemic Routing in Intermittent Networks}, booktitle = {5th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, 2008. SECON {\textquoteright}08}, year = {2008}, month = {2008/06/16/20}, pages = {609 - 611}, publisher = {IEEE}, organization = {IEEE}, abstract = {In this research, we propose to modify and extend epidemic routing used in intermittent networks. In particular, we propose to include immunity-based information disseminated in the reverse once messages get delivered to their destination. The goal is to design a more efficient routing protocol in terms of resource utilization. The idea is to analyze and evaluate the network performance using an immunity scheme in the context of epidemic routing and its variants. The reverse dissemination of such information requires minimal resources and the tradeoff in timely purging of delivered messages can be significant. We are using ns2 to implement a detailed simulation of the proposed immunity-based epidemic routing.}, keywords = {Analytical models, Delay, delivered messages, Disruption tolerant networking, Educational institutions, immunity-based epidemic routing, information dissemination, intermittent networks, Mobile ad hoc networks, Network topology, Performance analysis, Resource management, resource utilization, routing protocol, routing protocols, telecommunication network topology}, isbn = {978-1-4244-1777-3}, doi = {10.1109/SAHCN.2008.86}, author = {Mundur, Padma and Seligman,M. and Jin Na Lee} } @article {15550, title = {Improved approximation bounds for planar point pattern matching}, journal = {Algorithmica}, volume = {50}, year = {2008}, month = {2008///}, pages = {175 - 207}, abstract = {We analyze the performance of simple algorithms for matching two planar point sets under rigid transformations so as to minimize the directed Hausdorff distance between the sets. This is a well studied problem in computational geometry. Goodrich, Mitchell, and Orletsky presented a very simple approximation algorithm for this problem, which computes transformations based on aligning pairs of points. They showed that their algorithm achieves an approximation ratio of 4. We introduce a modification to their algorithm, which is based on aligning midpoints rather than endpoints. This modification has the same simplicity and running time as theirs, and we show that it achieves a better approximation ratio of roughly 3.14. We also analyze the approximation ratio in terms of a instance-specific parameter that is based on the ratio between diameter of the pattern set to the optimum Hausdorff distance. We show that as this ratio increases (as is common in practical applications) the approximation ratio approaches 3 in the limit. We also investigate the performance of the algorithm by Goodrich et al. as a function of this ratio, and present nearly matching lower bounds on the approximation ratios of both algorithms.}, doi = {10.1007/s00453-007-9059-9}, author = {Cho,M. and Mount, Dave} } @conference {17766, title = {Inconsistency management policies}, booktitle = {Proc. 2008 Intl. Conference on Knowledge Representation and Reasoning (KR 2008)}, year = {2008}, month = {2008///}, abstract = {Though there is much work on how inconsistency indatabases should be managed, there is good reason to believe that end users will want to bring their domain expertise and needs to bear in how to deal with inconsistencies. In this paper, we propose the concept of inconsistency management policies (IMPs). We show that IMPs are rich enough to spec- ify many types of inconsistency management methods pro- posed previously, but provide end users with tools that allow them to use the policies that they want. Our policies are also capable of allowing inconsistency to persist in the database or of eliminating more than a minimal subset of tuples involved in the inconsistency. We present a formal axiomatic definition of IMPs and present appropriate complexity results, together with results linking different IMPs together. We extend the relational algebra (RA) to incorporate IMPs and present the- oretical results showing how IMPs and classical RA operators interact. }, author = {Martinez,M. V and Parisi,F. and Pugliese, A. and Simari,G. I and V.S. Subrahmanian} } @conference {12240, title = {Integrating categorical resource types into a P2P desktop grid system}, booktitle = {Grid Computing, 2008 9th IEEE/ACM International Conference on}, year = {2008}, month = {2008/10/29/1}, pages = {284 - 291}, abstract = {We describe and evaluate a set of protocols that implement a distributed, decentralized desktop grid. Incoming jobs are matched with system nodes through proximity in an N-dimensional resource space. This work improves on prior work by (1) efficiently accommodating node and job characterizations that include both continuous and categorical resource types, and (2) scaling gracefully to large system sizes even with highly non-uniform distributions of job and node types. We use extensive simulation results to show that the resulting system handles both continuous and categorical constraints efficiently, and that the new scalability techniques are effective.}, keywords = {computing;peer-to-peer, computing;protocols;, computing;protocols;scalability, desktop, Grid, grid;distributed, grid;peer-to-peer, N-dimensional, resource, space;P2P, system;categorical, technique;grid, types;decentralized}, doi = {10.1109/GRID.2008.4662810}, author = {Kim,Jik-Soo and Nam,Beomseok and Marsh,M. and Keleher,P. and Bhattacharjee, Bobby and Sussman, Alan} } @article {13447, title = {Learning Abstract Properties of Swarm Systems}, journal = {Proceedings of the 8th International Conference on Autonomous Agents and Multiagent Systems}, year = {2008}, month = {2008///}, author = {Miner,D. and desJardins, Marie} } @conference {12244, title = {Matchmaking and implementation issues for a P2P desktop grid}, booktitle = {Parallel and Distributed Processing, 2008. IPDPS 2008. IEEE International Symposium on}, year = {2008}, month = {2008/04//}, pages = {1 - 5}, abstract = {We present some recent and ongoing work in our decentralized desktop computing grid project. Specifically, we discuss matching jobs with compute nodes in a peer-to-peer grid of heterogeneous platforms, and the implementation of our algorithms in a concrete system.}, keywords = {computing, computing;, computing;peer-to-peer, desktop, grid;decentralized, grid;grid, grid;peer-to-peer, P2P}, doi = {10.1109/IPDPS.2008.4536388}, author = {Marsh,M. and Kim,Jik-Soo and Nam,Beomseok and Jaehwan Lee and Ratanasanya,S. and Bhattacharjee, Bobby and Keleher,P. and Richardson,D. and Wellnitz,D.} } @article {14569, title = {Maternal depletion of CTCF reveals multiple functions during oocyte and preimplantation embryo development}, journal = {Development}, volume = {135}, year = {2008}, month = {2008///}, pages = {2729 - 2738}, abstract = {CTCF is a multifunctional nuclear factor involved in epigenetic regulation. Despite recent advances that include the systematic discovery of CTCF-binding sites throughout the mammalian genome, the in vivo roles of CTCF in adult tissues and during embryonic development are largely unknown. Using transgenic RNAi, we depleted maternal stores of CTCF from growing mouse oocytes, and identified hundreds of misregulated genes. Moreover, our analysis suggests that CTCF predominantly activates or derepresses transcription in oocytes. CTCF depletion causes meiotic defects in the egg, and mitotic defects in the embryo that are accompanied by defects in zygotic gene expression, and culminate in apoptosis. Maternal pronuclear transfer and CTCF mRNA microinjection experiments indicate that CTCF is a mammalian maternal effect gene, and that persistent transcriptional defects rather than persistent chromosomal defects perturb early embryonic development. This is the first study detailing a global and essential role for CTCF in mouse oocytes and preimplantation embryos.}, doi = {10.1242/dev.024539}, url = {http://dev.biologists.org/content/135/16/2729.abstract}, author = {Wan,Le-Ben and Pan,Hua and Hannenhalli, Sridhar and Cheng,Yong and Ma,Jun and Fedoriw,Andrew and Lobanenkov,Victor and Latham,Keith E. and Schultz,Richard M. and Bartolomei,Marisa S.} } @article {12147, title = {Measures and Risk Indicators for Early Insight into Software Safety. Development of Fault-Tolerant Systems}, year = {2008}, month = {2008/10//}, institution = {ABERDEEN TEST CENTER MD}, abstract = {Software contributes an ever-increasing level of functionality and control in today{\textquoteright}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.}, keywords = {*SOFTWARE ENGINEERING, *SYSTEM SAFETY, COMPUTER PROGRAMMING AND SOFTWARE, fault tolerant computing, INDICATORS, measurement, REPRINTS, risk, SAFETY ENGINEERING}, url = {http://stinet.dtic.mil/oai/oai?\&verb=getRecord\&metadataPrefix=html\&identifier=ADA487120}, author = {Basili, Victor R. and Marotta,Frank and Dangle,Kathleen and Esker,Linda and Rus,Ioana} } @article {12851, title = {Model Based Design Verification: A Monitor Based Approach}, volume = {2008-01-0741}, year = {2008}, month = {2008/04//}, institution = {SAE International}, address = {Warrendale, PA}, abstract = {This paper assesses the utility of an automated functional verification methodology in the design of a body electronics application. The use of design models as detailed specifications for software is gaining steady acceptance in the automotive industry because of the advantages it offers in terms of rapid system prototyping and automatic code generation. This paper argues that such modeling effort can also be used to provide support for design verification, so that errors may be pinpointed before they find their way into code, when they become much harder and more expensive to isolate, diagnose and repair.}, url = {http://papers.sae.org/2008-01-0741}, author = {Ackermann,Chris and Ray,Arnab and Cleaveland, Rance and Heit,J{\"u}rgen and Martin,Christopher and Shelton,Charles} } @inbook {13455, title = {Modeling Transfer Relationships Between Learning Tasks for Improved Inductive Transfer}, booktitle = {Machine Learning and Knowledge Discovery in DatabasesMachine Learning and Knowledge Discovery in Databases}, series = {Lecture Notes in Computer Science}, volume = {5211}, year = {2008}, month = {2008///}, pages = {317 - 332}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {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.}, isbn = {978-3-540-87478-2}, url = {http://dx.doi.org/10.1007/978-3-540-87479-9_39}, author = {Eaton,Eric and desJardins, Marie and Lane,Terran}, editor = {Daelemans,Walter and Goethals,Bart and Morik,Katharina} } @conference {13304, title = {Morphological analysis of terrains based on discrete curvature and distortion}, booktitle = {Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems}, series = {GIS {\textquoteright}08}, year = {2008}, month = {2008///}, pages = {53:1{\textendash}53:4 - 53:1{\textendash}53:4}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {In order to characterize the morphology of a triangulated terrain, we define several discrete estimators that mimic mean and Gaussian curvatures in the discrete case. We start from concentrated curvature, a discrete notion of Gaussian curvature for polyhedral surfaces, defined by Troyanov [7]. Since concentrated curvature does not depend on the local geometric shape of the terrain, we introduce Ccurvature that allows us to obtain discrete counterparts of both Gaussian and mean curvature. Finally, we define distortion, which behaves as an approximation of mean curvature. We apply all such measures to the analysis of the morphology of triangulated terrains.}, keywords = {curvature, Morphology, terrain modeling}, isbn = {978-1-60558-323-5}, doi = {10.1145/1463434.1463498}, url = {http://doi.acm.org/10.1145/1463434.1463498}, author = {Mesmoudi,Mohammed Mostefa and De Floriani, Leila and Magillo,Paola} } @article {13833, title = {Multiple alternative sentence compressions and word-pair antonymy for automatic text summarization and recognizing textual entailment}, journal = {Proceedings of the Text Analysis Conference (TAC-2008), Gaithersburg, MD}, year = {2008}, month = {2008///}, abstract = {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. }, author = {Mohammad,S. and Dorr, Bonnie J and Egan,M. and Jimmy Lin and Zajic, David} } @article {18502, title = {NANO: Network Access Neutrality Observatory}, volume = {GT-CS-08-03}, year = {2008}, month = {2008///}, institution = {Georgia Institute of Technology}, abstract = {This paper tackles a technical problem that is of growing interest in light of the ongoing network neutrality debate: We aim to develop a system that can reliably determine whether particular ISP is discriminating against a service using only passive measurements from end-hosts. This problem presents significant challenges because many types of discrimination can often resemble commonplace performance degradations (e.g., resulting from failure or misconfiguration). To distinguish discrimination from degradation, we propose a statistical method to estimate causal effect and develop a system, NANO, based on this method. NANO aggregates passive measurements from end-hosts, stratifies the measurements to account for possible confounding factors, and distinguishes when an ISP is discriminating against a particular service or group of clients. Preliminary simulation results demonstrate the promise of NANO for both detecting various types of discrimination and absolving an ISP when it is not discriminating.}, url = {http://hdl.handle.net/1853/25461}, author = {Tariq,M.B. and Motiwala,M. and Feamster, Nick} } @article {15339, title = {Nitric oxide production from surface recombination of oxygen and nitrogen atoms}, journal = {Journal of Thermophysics and Heat Transfer}, volume = {22}, year = {2008}, month = {2008///}, pages = {178 - 186}, author = {Pejakovi{\'c},D. A and Marschall,J. and Duan,L. and Martin, M.P} } @inbook {19642, title = {Optimal Cryptographic Hardness of Learning Monotone Functions}, booktitle = {Automata, Languages and Programming}, series = {Lecture Notes in Computer Science}, year = {2008}, month = {2008/01/01/}, pages = {36 - 47}, publisher = {Springer Berlin Heidelberg}, organization = {Springer Berlin Heidelberg}, abstract = {A wide range of positive and negative results have been established for learning different classes of Boolean functions from uniformly distributed random examples. However, polynomial-time algorithms have thus far been obtained almost exclusively for various classes of monotone functions, while the computational hardness results obtained to date have all been for various classes of general (nonmonotone) functions. Motivated by this disparity between known positive results (for monotone functions) and negative results (for nonmonotone functions), we establish strong computational limitations on the efficient learnability of various classes of monotone functions. We give several such hardness results which are provably almost optimal since they nearly match known positive results. Some of our results show cryptographic hardness of learning polynomial-size monotone circuits to accuracy only slightly greater than 1/2+1/n--√1/2 + 1/\sqrt{n} ; this accuracy bound is close to optimal by known positive results (Blum et al., FOCS {\textquoteright}98). Other results show that under a plausible cryptographic hardness assumption, a class of constant-depth, sub-polynomial-size circuits computing monotone functions is hard to learn; this result is close to optimal in terms of the circuit size parameter by known positive results as well (Servedio, Information and Computation {\textquoteright}04). Our main tool is a complexity-theoretic approach to hardness amplification via noise sensitivity of monotone functions that was pioneered by O{\textquoteright}Donnell (JCSS {\textquoteright}04).}, keywords = {Data structures, Data Structures, Cryptology and Information Theory, Discrete Mathematics in Computer Science, Numeric Computing, Software Engineering/Programming and Operating Systems, Theory of computation}, isbn = {978-3-540-70574-1, 978-3-540-70575-8}, url = {http://link.springer.com/chapter/10.1007/978-3-540-70575-8_4}, author = {Dana Dachman-Soled and Lee, Homin K. and Malkin, Tal and Servedio, Rocco A. and Wan, Andrew and Wee, Hoeteck}, editor = {Aceto, Luca and Damg{\r a}rd, Ivan and Goldberg, Leslie Ann and Halld{\'o}rsson, Magn{\'u}s M. and Ing{\'o}lfsd{\'o}ttir, Anna and Walukiewicz, Igor} } @article {15256, title = {An Optimal Incremental Algorithm for Minimizing Lateness with Rejection}, journal = {Algorithms-ESA 2008}, year = {2008}, month = {2008///}, pages = {601 - 610}, abstract = {This paper re-examines the classical problem of minimizing maximum lateness which is defined as follows: given a collection of n jobs with processing times and due dates, in what order should they be processed on a single machine to minimize maximum lateness? The lateness of a job is defined as its completion time minus its due date. This problem can be solved easily by ordering the jobs in non-decreasing due date order. We now consider the following question: which subset of k jobs should we reject to reduce the maximum lateness by the largest amount? While this problem can be solved optimally in polynomial time, we show the following surprising result: there is a fixed permutation of the jobs, such that for all k, if we reject the first k jobs from this permutation, we derive an optimal solution for the problem in which we are allowed to reject k jobs. This allows for an incremental solution in which we can keep incrementally rejecting jobs if we need a solution with lower maximum lateness value. Moreover, we also develop an optimal O(n logn) time algorithm to find this permutation.}, doi = {10.1007/978-3-540-87744-8_50}, author = {Khuller, Samir and Mestre,J.} } @article {18592, title = {Path splicing}, journal = {SIGCOMM Comput. Commun. Rev.}, volume = {38}, year = {2008}, month = {2008/08//}, pages = {27 - 38}, abstract = {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.}, keywords = {multi-path routing, path diversity, path splicing}, isbn = {0146-4833}, doi = {10.1145/1402946.1402963}, url = {http://doi.acm.org/10.1145/1402946.1402963}, author = {Motiwala,Murtaza and Elmore,Megan and Feamster, Nick and Vempala,Santosh} } @article {15463, title = {Position Paper: Improving Browsing Environment Compliance Evaluations for Websites}, journal = {Relation}, volume = {10}, year = {2008}, month = {2008///}, pages = {6113 - 6113}, abstract = {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. }, author = {Eaton,C. and Memon, Atif M.} } @conference {15497, title = {Relationships between Test Suites, Faults, and Fault Detection in GUI Testing}, booktitle = {Software Testing, Verification, and Validation, 2008 1st International Conference on}, year = {2008}, month = {2008/04//}, pages = {12 - 21}, abstract = {Software-testing researchers have long sought recipes for test suites that detect faults well. In the literature, empirical studies of testing techniques abound, yet the ideal technique for detecting the desired kinds of faults in a given situation often remains unclear. This work shows how understanding the context in which testing occurs, in terms of factors likely to influence fault detection, can make evaluations of testing techniques more readily applicable to new situations. We present a methodology for discovering which factors do statistically affect fault detection, and we perform an experiment with a set of test-suite- and fault-related factors in the GUI testing of two fielded, open-source applications. Statement coverage and GUI-event coverage are found to be statistically related to the likelihood of detecting certain kinds of faults.}, keywords = {Fault detection, fault-related factors, Graphical user interfaces, GUI testing, program testing, software-testing, test suites, test-suite-related factors}, doi = {10.1109/ICST.2008.26}, author = {Strecker,J. and Memon, Atif M.} } @article {13016, title = {Resolving arthropod phylogeny: exploring phylogenetic signal within 41 kb of protein-coding nuclear gene sequence}, journal = {Syst Biol}, volume = {57}, year = {2008}, month = {2008/12//}, pages = {920 - 938}, abstract = {This study attempts to resolve relationships among and within the four basal arthropod lineages (Pancrustacea, Myriapoda, Euchelicerata, Pycnogonida) and to assess the widespread expectation that remaining phylogenetic problems will yield to increasing amounts of sequence data. Sixty-eight regions of 62 protein-coding nuclear genes (approximately 41 kilobases (kb)/taxon) were sequenced for 12 taxonomically diverse arthropod taxa and a tardigrade outgroup. Parsimony, likelihood, and Bayesian analyses of total nucleotide data generally strongly supported the monophyly of each of the basal lineages represented by more than one species. Other relationships within the Arthropoda were also supported, with support levels depending on method of analysis and inclusion/exclusion of synonymous changes. Removing third codon positions, where the assumption of base compositional homogeneity was rejected, altered the results. Removing the final class of synonymous mutations{\textendash}first codon positions encoding leucine and arginine, which were also compositionally heterogeneous{\textendash}yielded a data set that was consistent with a hypothesis of base compositional homogeneity. Furthermore, under such a data-exclusion regime, all 68 gene regions individually were consistent with base compositional homogeneity. Restricting likelihood analyses to nonsynonymous change recovered trees with strong support for the basal lineages but not for other groups that were variably supported with more inclusive data sets. In a further effort to increase phylogenetic signal, three types of data exploration were undertaken. (1) Individual genes were ranked by their average rate of nonsynonymous change, and three rate categories were assigned{\textendash}fast, intermediate, and slow. Then, bootstrap analysis of each gene was performed separately to see which taxonomic groups received strong support. Five taxonomic groups were strongly supported independently by two or more genes, and these genes mostly belonged to the slow or intermediate categories, whereas groups supported only by a single gene region tended to be from genes of the fast category, arguing that fast genes provide a less consistent signal. (2) A sensitivity analysis was performed in which increasing numbers of genes were excluded, beginning with the fastest. The number of strongly supported nodes increased up to a point and then decreased slightly. Recovery of Hexapoda required removal of fast genes. Support for Mandibulata (Pancrustacea + Myriapoda) also increased, at times to "strong" levels, with removal of the fastest genes. (3) Concordance selection was evaluated by clustering genes according to their ability to recover Pancrustacea, Euchelicerata, or Myriapoda and analyzing the three clusters separately. All clusters of genes recovered the three concordance clades but were at times inconsistent in the relationships recovered among and within these clades, a result that indicates that the a priori concordance criteria may bias phylogenetic signal in unexpected ways. In a further attempt to increase support of taxonomic relationships, sequence data from 49 additional taxa for three slow genes (i.e., EF-1 alpha, EF-2, and Pol II) were combined with the various 13-taxon data sets. The 62-taxon analyses supported the results of the 13-taxon analyses and provided increased support for additional pancrustacean clades found in an earlier analysis including only EF-1 alpha, EF-2, and Pol II.}, doi = {10.1080/10635150802570791}, author = {Regier,J. C and Shultz,J. W and Ganley,A. R.D and Hussey,A. and Shi,D. and Ball,B. and Zwick,A. and Stajich,J. E and Cummings, Michael P. and Martin,J. W and Cunningham,CW} } @conference {12541, title = {A Scalable Projective Bundle Adjustment Algorithm using the L infinity Norm}, booktitle = {Computer Vision, Graphics Image Processing, 2008. ICVGIP {\textquoteright}08. Sixth Indian Conference on}, year = {2008}, month = {2008/12//}, pages = {79 - 86}, abstract = {The traditional bundle adjustment algorithm for structure from motion problem has a computational complexity of O((m+n)3) per iteration and memory requirement of O(mn(m+n)), where m is the number of cameras and n is the number of structure points. The sparse version of bundle adjustment has a computational complexity of O(m3+mn) per iteration and memory requirement of O(mn). Here we propose an algorithm that has a computational complexity of O(mn(radicm+radicn)) per iteration and memory requirement of O(max(m,n)). The proposed algorithm is based on minimizing the Linfin norm of reprojection error. It alternately estimates the camera and structure parameters, thus reducing the potentially large scale optimization problem to many small scale subproblems each of which is a quasi-convex optimization problem and hence can be solved globally. Experiments using synthetic and real data show that the proposed algorithm gives good performance in terms of minimizing the reprojection error and also has a good convergence rate.}, keywords = {adjustment, algorithm;structure, bundle, complexity;convex, complexity;iteration, error;scalable, estimation;, estimation;cameras;computational, Linfin, method;large, methods;parameter, norm;camera;computational, OPTIMIZATION, parameter, problem;memory, problem;projection, problem;reprojection, programming;image, projective, reconstruction;iterative, reconstruction;quasiconvex, requirement;motion, scale}, doi = {10.1109/ICVGIP.2008.51}, author = {Mitra, K. and Chellapa, Rama} } @article {16070, title = {Searching Electronic Health Records for Temporal Patterns in Patient Histories: A Case Study with Microsoft Amalga}, journal = {AMIA Annual Symposium ProceedingsAMIA Annu Symp Proc}, volume = {2008}, year = {2008}, month = {2008///}, pages = {601 - 605}, abstract = {As electronic health records (EHR) become more widespread, they enable clinicians and researchers to pose complex queries that can benefit immediate patient care and deepen understanding of medical treatment and outcomes. However, current query tools make complex temporal queries difficult to pose, and physicians have to rely on computer professionals to specify the queries for them. This paper describes our efforts to develop a novel query tool implemented in a large operational system at the Washington Hospital Center (Microsoft Amalga, formerly known as Azyxxi). We describe our design of the interface to specify temporal patterns and the visual presentation of results, and report on a pilot user study looking for adverse reactions following radiology studies using contrast.}, isbn = {1942-597X}, author = {Plaisant, Catherine and Lam,Stanley and Shneiderman, Ben and Smith,Mark S. and Roseman,David and Marchand,Greg and Gillam,Michael and Feied,Craig and Handler,Jonathan and Rappaport,Hank} } @article {12907, title = {Seasonal Cholera from Multiple Small Outbreaks, Rural Bangladesh}, journal = {Emerging Infectious DiseasesEmerg Infect Dis}, volume = {14}, year = {2008}, month = {2008/05//}, pages = {831 - 833}, abstract = {Clinical and environmental Vibrio cholerae organisms collected from February 2004 through April 2005 were systematically isolated from 2 rural Bangladeshi locales. Their genetic relatedness was evaluated at 5 loci that contained a variable number of tandem repeats (VNTR). The observed minimal overlap in VNTR patterns between the 2 communities was consistent with sequential, small outbreaks from local sources.}, isbn = {1080-6040}, doi = {10.3201/eid1405.071116}, author = {Stine,O. Colin and Alam,Munirul and Tang,Li and Nair,G. Balakrish and Siddique,A. Kasem and Faruque,Shah M. and Huq,Anwar and Rita R Colwell and Sack,R. Bradley and Morris,J. Glenn} } @article {18509, title = {Securing enterprise networks using traffic tainting}, journal = {Special Interest Group on Data Communication}, year = {2008}, month = {2008///}, abstract = {Enterprise networks are vulnerable to attacks ranging from dataleaks to the spread of malware to insider threats. Previous defenses have largely focused on securing hosts; unfortunately, when hosts are compromised, these defenses become ineffective. Rather than attempting to harden the host against every possible attack (which is impractical) or constraining the software that can run on a host (which is inconvenient), we place a small amount of trusted code on the host to assist with tracking the provenance of network traf- fic, moving the rest of the trust and function to the network. We present Pedigree, a system that tracks information flow across pro- cesses and hosts within a network by annotating traffic with taints that reflect the process that generated the traffic and the inputs that process has taken (we call this function traffic tainting). A tagger on the host annotates network traffic with information about the {\textquotedblleft}taints{\textquotedblright} that the sending process has acquired. Network devices act as arbiters to take appropriate actions (e.g., blocking) based on the taints associated with the traffic and the enterprise network{\textquoteright}s secu- rity policy. We have implemented Pedigree{\textquoteright}s host-based tagger as a Linux kernel module and the arbiter using the OpenFlow platform. This demonstration presents a prototype deployment of Pedigree that identifies and prevents both sensitive data leaks and the spread of malware in a typical enterprise network setting. The demon- stration will show that Pedigree can defend against these attacks without significant overhead at the host or the filtering device. }, author = {Ramachandran,A. and Mundada,Y. and Tariq,M.B. and Feamster, Nick} } @article {14098, title = {Sequence diversity and evolution of multigene families in Trypanosoma cruzi}, journal = {Molecular and Biochemical Parasitology}, volume = {157}, year = {2008}, month = {2008/01//}, pages = {65 - 72}, abstract = {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.}, keywords = {Amastin, Gene conversion, Genetic diversity, Multigene families, Trypanosoma cruzi}, isbn = {0166-6851}, doi = {16/j.molbiopara.2007.10.002}, url = {http://www.sciencedirect.com/science/article/pii/S0166685107002769}, author = {Cerqueira,Gustavo C. and Bartholomeu,Daniella C. and DaRocha,Wanderson D. and Hou,Lihua and Freitas-Silva,Danielle M. and Machado,Carlos Renato and El-Sayed, Najib M. and Teixeira,Santuza M.R.} } @article {14574, title = {Sex and Age Dimorphism of Myocardial Gene Expression in Nonischemic Human Heart Failure}, journal = {Circulation: Cardiovascular Genetics}, volume = {1}, year = {2008}, month = {2008/12/01/}, pages = {117 - 125}, abstract = {Background{\textemdash} We report the first comprehensive analysis of gene expression differences by sex and age in left ventricular samples from 102 patients with dilated cardiomyopathy.Methods and Results{\textemdash} Gene expression data (HG-U133A gene chip, Affymetrix) were analyzed from 30 females and 72 males from 3 separate centers. More than 1800 genes displayed sexual dimorphism in the heart (adjusted P value <0.05). A significant number of these genes were highly represented in gene ontology pathways involved in ion transport and G-protein-coupled receptor signaling. Localization of these genes revealed enrichment on both the sex chromosomes as well as chromosomes 3, 4, and 14. The second goal of this study was to determine the effect of age on gene expression. Within the female cohort, >140 genes were differentially expressed in the <55 years age group compared with the >55 years age group. These genes were highly represented in gene ontology pathways involved in DNA damage. In contrast, zero genes in the male cohort <55 years met statistical significance when compared with the >55 years age group.Conclusions{\textemdash} Gene expression in dilated cardiomyopathy displayed evidence of sexual dimorphism similar to other somatic tissues and age dimorphism within the female cohort.}, doi = {10.1161/CIRCGENETICS.108.802652}, url = {http://circgenetics.ahajournals.org/content/1/2/117.abstract}, author = {Fermin,David R. and Barac,Ana and Lee,Sangjin and Polster,Sean P. and Hannenhalli, Sridhar and Bergemann,Tracy L. and Grindle,Suzanne and Dyke,David B. and Pagani,Francis and Miller,Leslie W. and Tan,Sarah and dos Remedios,Cris and Cappola,Thomas P. and Margulies,Kenneth B. and Hall,Jennifer L.} } @article {16673, title = {Soft syntactic constraints for hierarchical phrased-based translation}, journal = {Proceedings of ACL-08: HLT}, year = {2008}, month = {2008///}, pages = {1003 - 1011}, author = {Marton,Y. and Resnik, Philip} } @article {17760, title = {The SOMA Terror Organization Portal (STOP): social network and analytic tools for the real-time analysis of terror groups}, journal = {Social Computing, Behavioral Modeling, and Prediction}, year = {2008}, month = {2008///}, pages = {9 - 18}, abstract = {Stochastic Opponent Modeling Agents (SOMA) have been proposed as a paradigm for reasoning about cultural groups, terror groups, and other socioeconomic-political-military organizations worldwide. In this paper, we describe the SOMA Terror Organization Portal (STOP). STOP provides a single point of contact through which analysts may access data about terror groups world wide. In order to analyze this data, SOMA provides three major components: the SOMA Extraction Engine (SEE), the SOMA Adversarial Forecast Engine (SAFE), and the SOMA Analyst NEtwork (SANE) that allows analysts to find other analysts doing similar work, share findings with them, and let consensus findings emerge. This paper describes the STOP framework.}, doi = {10.1007/978-0-387-77672-9_2}, author = {Sliva,A. and V.S. Subrahmanian and Martinez,V. and Simari,G. I} } @conference {17765, title = {The soma terror organization portal (stop): Social network and analytic tools for the real-time analysis of terror groups}, booktitle = {First Intl. Workshop on Social Computing, Behavioral Modeling and Prediction}, year = {2008}, month = {2008///}, abstract = {Stochastic Opponent Modeling Agents (SOMA) have been proposed as a paradigm for reasoning about cultural groups, terror groups, and other socioeconomic-political-military organizations worldwide. In this paper, we describe the SOMA Terror Organization Portal (STOP). STOP provides a single point of contact through which analysts may access data about terror groups world wide. In order to analyze this data, SOMA provides three major components: the SOMA Extraction Engine (SEE), the SOMA Adversarial Forecast Engine (SAFE), and the SOMA Analyst NEtwork (SANE) that allows analysts to find other analysts doing similar work, share findings with them, and let consensus findings emerge. This paper describes the STOP framework.}, doi = {10.1007/978-0-387-77672-9_2}, author = {Martinez,V. and Simari,G. and Sliva,A. and V.S. Subrahmanian} } @article {15557, title = {Space-time tradeoffs for proximity searching in doubling spaces}, journal = {Algorithms-ESA 2008}, year = {2008}, month = {2008///}, pages = {112 - 123}, abstract = {We consider approximate nearest neighbor searching in metric spaces of constant doubling dimension. More formally, we are given a set S of n points and an error bound ε> 0. The objective is to build a data structure so that given any query point q in the space, it is possible to efficiently determine a point of S whose distance from q is within a factor of (1 + ε) of the distance between q and its nearest neighbor in S. In this paper we obtain the following space-time tradeoffs. Given a parameter γ ∈ [2,1/ε], we show how to construct a data structure of space nO(dim)log(1) space that can answer queries in time O(log(n))+(1())O(dim) . This is the first result that offers space-time tradeoffs for approximate nearest neighbor queries in doubling spaces. At one extreme it nearly matches the best result currently known for doubling spaces, and at the other extreme it results in a data structure that can answer queries in time O(log(n/ε)), which matches the best query times in Euclidean space. Our approach involves a novel generalization of the AVD data structure from Euclidean space to doubling space.}, doi = {10.1007/978-3-540-87744-8_10}, author = {Arya,S. and Mount, Dave and Vigneron,A. and Xia,J.} } @article {17767, title = {Stochastic opponent modeling agents: A case study with Hamas}, journal = {Proceedings of ICCCD}, year = {2008}, month = {2008///}, abstract = {Stochastic Opponent Modeling Agents (SOMA) have beenproposed as a paradigm for reasoning about cultural groups, terror groups, and other socio-economic-political-military organizations worldwide. In this paper, we describe a case study that shows how SOMA was used to model the behavior of the terrorist organization, Hamas. Our team, consisting of a mix of computer scientists, policy experts, and political scientists, were able to understand new facts about Hamas of which even seasoned Hamas experts may not have been aware. This paper briefly overviews SOMA rules, explains how several thousand SOMA rules for Hamas were automatically derived, and then describes a few key findings about Hamas, enabled by this framework. }, author = {Mannes,A. and Sliva,A. and V.S. Subrahmanian and Wilkenfeld,J.} } @article {15257, title = {Streaming algorithms for k-center clustering with outliers and with anonymity}, journal = {Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques}, year = {2008}, month = {2008///}, pages = {165 - 178}, abstract = {Clustering is a common problem in the analysis of large data sets. Streaming algorithms, which make a single pass over the data set using small working memory and produce a clustering comparable in cost to the optimal offline solution, are especially useful. We develop the first streaming algorithms achieving a constant-factor approximation to the cluster radius for two variations of the k-center clustering problem. We give a streaming (4 + ε)-approximation algorithm using O(ε - 1 kz) memory for the problem with outliers, in which the clustering is allowed to drop up to z of the input points; previous work used a random sampling approach which yields only a bicriteria approximation. We also give a streaming (6 + ε)-approximation algorithm using O(ε - 1 ln (ε - 1) k + k 2) memory for a variation motivated by anonymity considerations in which each cluster must contain at least a certain number of input points.}, doi = {10.1007/978-3-540-85363-3_14}, author = {Matthew McCutchen,R. and Khuller, Samir} } @article {14433, title = {Structural Sampling for Statistical Software Testing}, journal = {Probabilistic, Logical and Relational Learning-A Further Synthesis}, year = {2008}, month = {2008///}, abstract = {Structural Statistical Software Testing exploits the control flow graph of the program being tested to construct test cases. While test cases can easily be extracted from {em feasible paths} in the control flow graph, that is, paths which are actually exerted for some values of the program input, the feasible path region is a tiny fraction of the graph paths (less than $10^{-5}]$ for medium size programs). The S4T algorithm presented in this paper aims to address this limitation; as an Active Relational Learning Algorithm, it uses the few feasible paths initially available to sample new feasible paths. The difficulty comes from the non-Markovian nature of the feasible path concept, due to the long-range dependencies between the nodes in the control flow graph. Experimental validation on real-world and artificial problems demonstrates significant improvements compared to the state of the art.}, author = {Baskiotis,N. and Sebag,M. and De Raedt,L. and Dietterich,T. and Getoor, Lise and Kersting,K. and Muggleton,S. H} } @article {14419, title = {Structured machine learning: the next ten years}, journal = {Machine Learning}, volume = {73}, year = {2008}, month = {2008///}, pages = {3 - 23}, abstract = {The field of inductive logic programming (ILP) has made steady progress, since the first ILP workshop in 1991, based on a balance of developments in theory, implementations and applications. More recently there has been an increased emphasis on Probabilistic ILP and the related fields of Statistical Relational Learning (SRL) and Structured Prediction. The goal of the current paper is to consider these emerging trends and chart out the strategic directions and open problems for the broader area of structured machine learning for the next 10 years.}, doi = {10.1007/s10994-008-5079-1}, author = {Dietterich,T. G and Domingos,P. and Getoor, Lise and Muggleton,S. and Tadepalli,P.} } @conference {13473, title = {The swarm application framework}, booktitle = {In Proceedings of the 23rd AAAI Conference on Artificial Intelligence (Student Abstract}, year = {2008}, month = {2008///}, abstract = {The Swarm Application Framework (SAF) is a tool that makes the development of swarm applications more intuitive. Traditionally, swarm applications are created by programming several low-level rules. This approach leads to several problems in designing and testing swarms, which serve as inspiration for the features of SAF. SAF encourages a new paradigm for designing swarm applications: engineers can interact with a swarm at the abstract (swarm) level instead of the individual (agent) level. In this paper, we discuss the design of the framework, how agents and rules in SAF operate, and a planned rule abstraction feature.}, author = {Miner,D. and desJardins, Marie} } @article {13873, title = {TERp system description}, journal = {MetricsMATR workshop at AMTA}, year = {2008}, month = {2008///}, abstract = {This paper describes TER-Plus (TERp) the University of Maryland / BBN Technologies submission for the NIST Metric MATR 2008 workshop on automatic machine translation evaluation metrics. TERp is an extension of Translation Edit Rate (TER) that builds off of the success of TER as an evaluation metric and alignment tool while addressing several of its weaknesses through the use of paraphrases, morphological stemming, and synonyms, as well as edit costs that are optimized to correlate better with various types of human judgments.}, author = {Snover,M. and Madnani,N. and Dorr, Bonnie J and Schwartz,R.} } @conference {15430, title = {Test case generator for GUITAR}, booktitle = {Companion of the 30th international conference on Software engineering}, series = {ICSE Companion {\textquoteright}08}, year = {2008}, month = {2008///}, pages = {959 - 960}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {As GUIs become more popular, the need for GUI testing tools becomes greater. Many current GUI test generation techniques require proprietary tools and can be hard to use to their fullest potential. This paper outlines a new test case generation strategy, which enables testers to automatically produce cases in a widely used format. We hope that this strategy will encourage more complete GUI testing.}, keywords = {code coverage, event-flow, Graphical user interfaces, gui ripping, integration tree, jfcunit, junit, Test Case Generation}, isbn = {978-1-60558-079-1}, doi = {10.1145/1370175.1370207}, url = {http://doi.acm.org/10.1145/1370175.1370207}, author = {Hackner,Daniel R. and Memon, Atif M.} } @conference {15573, title = {Tradeoffs in Approximate Range Searching Made Simpler}, booktitle = {Computer Graphics and Image Processing, 2008. SIBGRAPI {\textquoteright}08. XXI Brazilian Symposium on}, year = {2008}, month = {2008/10//}, pages = {237 - 244}, abstract = {Range searching is a fundamental problem in computational geometry. The problem involves preprocessing a set of n points in R^d into a data structure, so that it is possible to determine the subset of points lying within a given query range. In approximate range searching, a parameter eps epsiv gt; 0 is given, and for a given query range R the points lying within distance eps diam(R) of the range{\textquoteright}s boundary may be counted or not. In this paper we present three results related to the issue of tradeoffs in approximate range searching. First, we introduce the range sketching problem. Next, we present a space-time tradeoff for smooth convex ranges, which generalize spherical ranges. Finally, we show how to modify the previous data structure to obtain a space-time tradeoff for simplex ranges. In contrast to existing results, which are based on relatively complex data structures, all three of our results are based on simple, practical data structures.}, keywords = {approximate range searching, computational geometry, data structure, Data structures, query range}, doi = {10.1109/SIBGRAPI.2008.24}, author = {Arya,S. and Fonseca,G. and Mount, Dave} } @article {12243, title = {Trade-offs in matching jobs and balancing load for distributed desktop grids}, journal = {Future Generation Computer Systems}, volume = {24}, year = {2008}, month = {2008/05//}, pages = {415 - 424}, abstract = {Desktop grids~can achieve tremendous computing power at low cost through opportunistic sharing of resources. However, traditional client{\textendash}server Grid architectures do not deal with all types of failures, and do not always cope well with very dynamic environments. This paper describes the design of a desktop grid implemented over a modified Peer-to-Peer (P2P) architecture. The underlying P2P system is decentralized and inherently adaptable, giving the Grid robustness, scalability, and the ability to cope with dynamic environments, while still efficiently mapping application instances to available resources throughout the system.We use simulation to compare three different types of matching algorithms under differing workloads. Overall, the P2P approach produces significantly lower wait times than prior approaches, while adapting efficiently to the dynamic environment. }, keywords = {Desktop grid, load balancing, Matchmaking, peer-to-peer computing, Resource discovery}, isbn = {0167-739X}, doi = {10.1016/j.future.2007.07.007}, url = {http://www.sciencedirect.com/science/article/pii/S0167739X07001240}, author = {Kim,Jik-Soo and Nam,Beomseok and Keleher,Peter and Marsh,Michael and Bhattacharjee, Bobby and Sussman, Alan} } @conference {18608, title = {Trellis: a platform for building flexible, fast virtual networks on commodity hardware}, booktitle = {Proceedings of the 2008 ACM CoNEXT Conference}, series = {CoNEXT {\textquoteright}08}, year = {2008}, month = {2008///}, pages = {72:1{\textendash}72:6 - 72:1{\textendash}72:6}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {We describe Trellis, a platform for hosting virtual networks on shared commodity hardware. Trellis allows each virtual network to define its own topology, control protocols, and forwarding tables, while amortizing costs by sharing the physical infrastructure. Trellis synthesizes two container-based virtualization technologies, VServer and NetNS, as well as a new tunneling mechanism, EGRE, into a coherent platform that enables high-speed virtual networks. We describe the design and implementation of Trellis and evaluate its packet-forwarding rates relative to other virtualization technologies and native kernel forwarding performance.}, isbn = {978-1-60558-210-8}, doi = {10.1145/1544012.1544084}, url = {http://doi.acm.org/10.1145/1544012.1544084}, author = {Bhatia,Sapan and Motiwala,Murtaza and Muhlbauer,Wolfgang and Mundada,Yogesh and Valancius,Vytautas and Bavier,Andy and Feamster, Nick and Peterson,Larry and Rexford,Jennifer} } @conference {15332, title = {Upstream and downstream in unsteadiness of STBLI using DNS data in two con gurations}, booktitle = {46th AIAA Aerospace Sciences Meeting}, year = {2008}, month = {2008///}, abstract = {Statistical analysis of the upstream and downstream flow influence on shock unsteadiness in shock and turbulent boundary layer interactions are performed using DNS data of a compression corner Wu \& Martin1 and a reflected shock case interaction. For both cases, the scaling proposed by Dussauge et al.2 for the characteristic low frequency applies. The statistical analysis for the compression corner shows that the unsteadiness of the shock is dominated by the downstream flow. The same analysis applied to the reflected shock case also indicates downstream influence. Additional studies are required to fully characterize the reflected shock case DNS data.}, author = {Martin, M.P and Priebe,S. and Wu,M.} } @article {15356, title = {Upstream and downstream influence on the unsteadiness of STBLI using DNS data in two configurations}, journal = {AIAA Paper 2008-0719, 46, h}, year = {2008}, month = {2008///}, author = {Martin, M.P and Priebe,S. and Wu,M.} } @article {15413, title = {Using a pilot study to derive a GUI model for automated testing}, journal = {ACM Transactions on Software Engineering and Methodology (TOSEM)}, volume = {18}, year = {2008}, month = {2008/11//}, pages = {7:1{\textendash}7:35 - 7:1{\textendash}7:35}, abstract = {Graphical user interfaces (GUIs) are one of the most commonly used parts of today{\textquoteright}s software. Despite their ubiquity, testing GUIs for functional correctness remains an understudied area. A typical GUI gives many degrees of freedom to an end-user, leading to an enormous input event interaction space that needs to be tested. GUI test designers generate and execute test cases (modeled as sequences of user events) to traverse its parts; targeting a subspace in order to maximize fault detection is a nontrivial task. In this vein, in previous work, we used informal GUI code examination and personal intuition to develop an event-interaction graph (EIG). In this article we empirically derive the EIG model via a pilot study, and the resulting EIG validates our intuition used in previous work; the empirical derivation process also allows for model evolution as our understanding of GUI faults improves. Results of the pilot study show that events interact in complex ways; a GUI{\textquoteright}s response to an event may vary depending on the context established by preceding events and their execution order. The EIG model helps testers to understand the nature of interactions between GUI events when executed in test cases and why certain events detect faults, so that they can better traverse the event space. New test adequacy criteria are defined for the EIG; new algorithms use these criteria and EIG to systematically generate test cases that are shown to be effective on four fielded open-source applications.}, keywords = {Graphical user interfaces, model-based testing, test minimization, Test suite management}, isbn = {1049-331X}, doi = {10.1145/1416563.1416567}, url = {http://doi.acm.org/10.1145/1416563.1416567}, author = {Xie,Qing and Memon, Atif M.} } @article {15330, title = {Validation of a DNS code for wall-bounded turbulence including finite-rate reactions and surface catalysis}, journal = {AIAA Paper 2008}, volume = {645}, year = {2008}, month = {2008///}, abstract = {This paper discusses the constitutive relations, surface catalytic model,and numerical methods for direct numerical simulation (DNS) of wall- bounded turbulence including finite-rate chemistry and gas-surface in- teraction. The validation of the code is provided for the mean flow by comparison to similarity solutions and laminar hypersonic boundary layer solutions, for the surface catalysis by comparison to analytic solutions for the one-dimensional diffusion-reaction equation, and for turbulent bound- ary layers by comparison to empirical predictions. }, author = {Duan,L. and Martin, M.P} } @article {14434, title = {Variational Bayes via Propositionalization}, journal = {Probabilistic, Logical and Relational Learning-A Further Synthesis}, year = {2008}, month = {2008///}, author = {Sato,T. and Kameya,Y. and Kurihara,K. and De Raedt,L. and Dietterich,T. and Getoor, Lise and Kersting,K. and Muggleton,S. H} } @article {12909, title = {Vibrio cholerae non-O1, non-O139 strains isolated before 1992 from Varanasi, India are multiple drug resistant, contain intSXT, dfr18 and aadA5 genes}, journal = {Environmental Microbiology}, volume = {10}, year = {2008}, month = {2008/04/01/}, pages = {866 - 873}, abstract = {In this study, we report the presence of the SXT element and Class I integron in Vibrio cholerae non-O1, non-O139 strains isolated from Varanasi, India. Isolates were resistant to cotrimoxazole, trimethoprim and/or streptomycin, furazolidone and ampicillin. None contained plasmids. Polymerase chain reaction (PCR) and DNA sequencing revealed the presence of antibiotic resistance gene cassettes, aadA1, aadA2, aadA5 and dfrA15, in the Class I integron and SXT, an integrative conjugative element containing dfr18, sulII and strAB, in three and six of the isolates respectively. Conjugation experiments, followed by PCR analysis of transconjugants, provided evidence for the transferable nature of intSXT and associated antibiotic resistance gene cassettes. This is the first report of the occurrence of SXT ICE, dfr18, sulII, strAB and aadA5 genes in environmental V.~cholerae non-O1, non-O139 strains from Varanasi, India, that had been isolated before 1992.}, isbn = {1462-2920}, doi = {10.1111/j.1462-2920.2007.01502.x}, url = {http://onlinelibrary.wiley.com/doi/10.1111/j.1462-2920.2007.01502.x/abstract?userIsAuthenticated=false\&deniedAccessCustomisedMessage=}, author = {Mohapatra,Harapriya and Mohapatra,Saswat S. and Mantri,Chinmay K. and Rita R Colwell and Singh,Durg V.} } @article {15831, title = {Why Do Hubs in the Yeast Protein Interaction Network Tend To Be Essential: Reexamining the Connection between the Network Topology and Essentiality}, journal = {PLoS Comput BiolPLoS Comput Biol}, volume = {4}, year = {2008}, month = {2008///}, pages = {e1000140 - e1000140}, abstract = {Analysis of protein interaction networks in the budding yeast Saccharomyces cerevisiae has revealed that a small number of proteins, the so-called hubs, interact with a disproportionately large number of other proteins. Furthermore, many hub proteins have been shown to be essential for survival of the cell{\textemdash}that is, in optimal conditions, yeast cannot grow and multiply without them. This relation between essentiality and the number of neighbors in the protein{\textendash}protein interaction network has been termed the centrality-lethality rule. However, why are such hubs essential? Jeong and colleagues [1] suggested that overrepresentation of essential proteins among high-degree nodes can be attributed to the central role that hubs play in mediating interactions among numerous, less connected proteins. Another view, proposed by He and Zhang, suggested that that the majority of proteins are essential due to their involvement in one or more essential protein{\textendash}protein interactions that are distributed uniformly at random along the network edges [2]. We find that none of the above reasons determines essentiality. Instead, the majority of hubs are essential due to their involvement in Essential Complex Biological Modules, a group of densely connected proteins with shared biological function that are enriched in essential proteins. This study sheds new light on the topological complexity of protein interaction networks.}, doi = {10.1371/journal.pcbi.1000140}, url = {http://dx.doi.org/10.1371/journal.pcbi.1000140}, author = {Zotenko,Elena and Mestre,Julian and O{\textquoteright}Leary, Dianne P. and Przytycka,Teresa M.} } @inbook {17770, title = {Aggregates in Generalized Temporally Indeterminate Databases}, booktitle = {Scalable Uncertainty ManagementScalable Uncertainty Management}, series = {Lecture Notes in Computer Science}, volume = {4772}, year = {2007}, month = {2007///}, pages = {171 - 186}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {Dyreson and Snodgrass as well as Dekhtyar et. al. have provided a probabilistic model (as well as compelling example applications) for why there may be temporal indeterminacy in databases. In this paper, we first propose a formal model for aggregate computation in such databases when there is uncertainty not just in the temporal attribute, but also in the ordinary (non-temporal) attributes. We identify two types of aggregates: event correlated aggregates, and non event correlated aggregations, and provide efficient algorithms for both of them. We prove that our algorithms are correct, and we present experimental results showing that the algorithms work well in practice.}, keywords = {Computer, Science}, isbn = {978-3-540-75407-7}, url = {http://dx.doi.org/10.1007/978-3-540-75410-7_13}, author = {Udrea,Octavian and Majki{\'c},Zoran and Subrahmanian,V.}, editor = {Prade,Henri and Subrahmanian,V.} } @inbook {15425, title = {Agile Quality Assurance Techniques for GUI-Based Applications}, booktitle = {Agile software development quality assuranceAgile software development quality assurance}, year = {2007}, month = {2007///}, pages = {114 - 114}, publisher = {Idea Group Inc (IGI)}, organization = {Idea Group Inc (IGI)}, isbn = {1599042169, 9781599042169}, author = {Memon, Atif M. and Xie,Q.} } @article {15350, title = {Assessment of WENO methods with shock-confining filtering for LES of compressible turbulence}, journal = {AIAA Paper 2007}, volume = {4198}, year = {2007}, month = {2007///}, author = {Grube,N. E and Taylor,E. M and Martin, M.P} } @conference {15460, title = {Automated gui testing guided by usage profiles}, booktitle = {Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering}, series = {ASE {\textquoteright}07}, year = {2007}, month = {2007///}, pages = {333 - 342}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Most software developed in recent years has a graphical userinterface (GUI). The only way for the end-user to interact with the software application is through the GUI. Hence, acceptance and system testing of the software requires GUI testing. This paper presents a new technique for testing of GUI applications. Information on the actual usage of the application, in the form of "usage profiles," is used to ensure that a new version of the application will function correctly. Usage profiles, sequences of events that end-users execute on a GUI, are used to develop a probabilistic usage model of the application. An algorithm uses the model to generate test cases that represent events the user is most likely to execute. Reverse engineering methods are used to extract the underlying structure of the application. An empirical study on four open source GUI applications reveals that test suites generated from the probabilistic model are 0.2-22\% of the size of test suites produced directly from usage profiles. Furthermore, the test suites generated from the model detect more faults per test case than those detected directly from the usage profiles, and detect faults not detected by the original profiles}, keywords = {event-driven software, GUI testing, usage profiles}, isbn = {978-1-59593-882-4}, doi = {10.1145/1321631.1321681}, url = {http://doi.acm.org/10.1145/1321631.1321681}, author = {Brooks,Penelope A. and Memon, Atif M.} } @article {12345, title = {Beyond single-appearance schedules: Efficient DSP software synthesis using nested procedure calls}, journal = {ACM Transactions on Embedded Computing Systems (TECS)}, volume = {6}, year = {2007}, month = {2007///}, pages = {14{\textendash}es - 14{\textendash}es}, author = {Ko,M. Y and Murthy,P. K and Bhattacharyya, Shuvra S.} } @article {18897, title = {CARA: A Cultural-Reasoning Architecture}, journal = {IEEE Intelligent Systems}, volume = {22}, year = {2007}, month = {2007///}, pages = {12 - 16}, abstract = {The Cognitive Architecture for Reasoning about Adversaries supports methods to gather data about different cultural groups and learn the intensity of those groups{\textquoteright} opinions on various topics. It also lets users build and extract models of those groups{\textquoteright} behavior and continuously refine those models through shared multiperson learning experiences. Researchers have applied the architecture to develop cultural-reasoning applications for example, a game that teaches soldiers about cultural norms in an Afghan village.}, keywords = {cultural reasoning, opinion extraction, opponent modeling}, isbn = {1541-1672}, author = {V.S. Subrahmanian and Albanese,Massimiliano and Martinez,Mar?a Vanina and Nau, Dana S. and Reforgiato,Diego and Simari,Gerardo I. and Sliva,Amy and Udrea,Octavian and Wilkenfeld,Jonathan} } @article {14556, title = {Cell breathing in wireless LANs: Algorithms and evaluation}, journal = {IEEE Transactions on Mobile Computing}, volume = {6}, year = {2007}, month = {2007///}, pages = {164 - 178}, author = {Hajiaghayi, Mohammad T. and Mirrokni,S. V. and Saberi,A. and Bahl,P. and Jain,K. and Qiu,L.} } @conference {13926, title = {Children{\textquoteright}s interests and concerns when using the international children{\textquoteright}s digital library: a four-country case study}, booktitle = {Proceedings of the 7th ACM/IEEE-CS joint conference on Digital libraries}, year = {2007}, month = {2007///}, pages = {167 - 176}, author = {Druin, Allison and Weeks,A. and Massey,S. and Bederson, Benjamin B.} } @article {13740, title = {Combining outputs from multiple machine translation systems}, journal = {Human Language Technologies 2007: The Conference of the North American Chapter of the Association for Computational Linguistics; Proceedings of the Main Conference}, year = {2007}, month = {2007///}, pages = {228 - 235}, abstract = {Currently there are several approaches tomachine translation (MT) based on differ- ent paradigms; e.g., phrasal, hierarchical and syntax-based. These three approaches yield similar translation accuracy despite using fairly different levels of linguistic knowledge. The availability of such a variety of systems has led to a growing interest toward finding better translations by combining outputs from multiple sys- tems. This paper describes three differ- ent approaches to MT system combina- tion. These combination methods oper- ate on sentence, phrase and word level exploiting information from N -best lists, system scores and target-to-source phrase alignments. The word-level combination provides the most robust gains but the best results on the development test sets (NIST MT05 and the newsgroup portion of GALE 2006 dry-run) were achieved by combining all three methods. }, author = {Rosti,A.V.I. and Ayan,N.F. and Xiang,B. and Matsoukas,S. and Schwartz,R. and Dorr, Bonnie J} } @article {14600, title = {COMPUTATIONAL BIOLOGY}, journal = {Nucleic acids research}, volume = {35}, year = {2007}, month = {2007///}, pages = {3163 - 3163}, author = {Leparc,GG and Mitra,RD and Vardhanabhuti,S. and Wang,J. and Hannenhalli, Sridhar and Smit,S. and Widmann,J. and Knight,R. and Wu,S. and Zhang,Y. and others} } @article {18966, title = {A computational survey of candidate exonic splicing enhancer motifs in the model plant Arabidopsis thaliana}, journal = {BMC Bioinformatics}, volume = {8}, year = {2007}, month = {2007/05/21/}, pages = {159 - 159}, abstract = {Algorithmic approaches to splice site prediction have relied mainly on the consensus patterns found at the boundaries between protein coding and non-coding regions. However exonic splicing enhancers have been shown to enhance the utilization of nearby splice sites.}, isbn = {1471-2105}, doi = {10.1186/1471-2105-8-159}, url = {http://www.biomedcentral.com/1471-2105/8/159/abstract}, author = {Pertea,Mihaela and Mount, Stephen M. and Salzberg,Steven L.} } @article {18900, title = {Computing most probable worlds of action probabilistic logic programs: scalable estimation for 10^30,000 worlds}, journal = {Annals of Mathematics and Artificial Intelligence}, volume = {51}, year = {2007}, month = {2007///}, pages = {295 - 331}, abstract = {The semantics of probabilistic logic programs (PLPs) is usually given through a possible worlds semantics. We propose a variant of PLPs called action probabilistic logic programs or -programs that use a two-sorted alphabet to describe the conditions under which certain real-world entities take certain actions. In such applications, worlds correspond to sets of actions these entities might take. Thus, there is a need to find the most probable world (MPW) for -programs. In contrast, past work on PLPs has primarily focused on the problem of entailment. This paper quickly presents the syntax and semantics of -programs and then shows a naive algorithm to solve the MPW problem using the linear program formulation commonly used for PLPs. As such linear programs have an exponential number of variables, we present two important new algorithms, called and to solve the MPW problem exactly. Both these algorithms can significantly reduce the number of variables in the linear programs. Subsequently, we present a {\textquotedblleft}binary{\textquotedblright} algorithm that applies a binary search style heuristic in conjunction with the Naive, and algorithms to quickly find worlds that may not be {\textquotedblleft}most probable.{\textquotedblright} We experimentally evaluate these algorithms both for accuracy (how much worse is the solution found by these heuristics in comparison to the exact solution) and for scalability (how long does it take to compute). We show that the results of are very accurate and also very fast: more than 10 30,000 worlds can be handled in a few minutes. Subsequently, we develop parallel versions of these algorithms and show that they provide further speedups.}, keywords = {Computer science}, isbn = {1012-2443}, doi = {10.1007/s10472-008-9089-2}, url = {http://www.springerlink.com/content/t70g873h613273pu/abstract/}, author = {Khuller, Samir and Martinez,M. and Nau, Dana S. and Sliva,Amy and Simari,Gerardo and Subrahmanian,V.} } @article {15508, title = {COMPUTING PERFECT AND STABLE MODELS USING ORDERED MODEL TREES}, journal = {Computational Intelligence}, volume = {11}, year = {2007}, month = {2007/04/02/}, pages = {89 - 112}, abstract = {Ordered model trees were introduced as a normal form for disjunctive deductive databases. They were also used to facilitate the computation of minimal models for disjunctive theories by exploiting the order imposed on the Herbrand base of the theory. In this work we show how the order on the Herbrand base can be used to compute perfect models of a disjunctive stratified finite theory. We are able to compute the stable models of a general finite theory by combining the order on the elements of the Herbrand base with previous results that had shown that the stable models of a theory T can be computed as the perfect models of a corresponding disjunctive theory ɛT resulting from applying the so called evidential transformation to T. While other methods consider many models that are rejected at the end, the use of atom ordering allows us to guarantee that every model generated belongs to the class of models being computed. As for negation-free databases, the ordered tree serves as the canonical representation of the database.}, keywords = {disjunctive database, model tree, ordered model tree, perfect model, stable model}, isbn = {1467-8640}, doi = {10.1111/j.1467-8640.1995.tb00024.x}, url = {http://onlinelibrary.wiley.com/doi/10.1111/j.1467-8640.1995.tb00024.x/abstract}, author = {Fern{\'a}ndez1,Jos{\'e} Alberto and Minker, Jack and Yahya,Adnan} } @conference {15904, title = {Confidentiality-preserving rank-ordered search}, booktitle = {Proceedings of the 2007 ACM workshop on Storage security and survivability}, series = {StorageSS {\textquoteright}07}, year = {2007}, month = {2007///}, pages = {7 - 12}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {This paper introduces a new framework for confidentiality preserving rank-ordered search and retrieval over large document collections. The proposed framework not only protects document/query confidentiality against an outside intruder, but also prevents an untrusted data center from learning information about the query and the document collection. We present practical techniques for proper integration of relevance scoring methods and cryptographic techniques, such as order preserving encryption, to protect data collections and indices and provide efficient and accurate search capabilities to securely rank-order documents in response to a query. Experimental results on the W3C collection show that these techniques have comparable performance to conventional search systems designed for non-encrypted data in terms of search accuracy. The proposed methods thus form the first steps to bring together advanced information retrieval and secure search capabilities for a wide range of applications including managing data in government and business operations, enabling scholarly study of sensitive data, and facilitating the document discovery process in litigation.}, keywords = {encrypted domain search, Ranked retrieval, secure index}, isbn = {978-1-59593-891-6}, doi = {10.1145/1314313.1314316}, url = {http://doi.acm.org/10.1145/1314313.1314316}, author = {Swaminathan,Ashwin and Mao,Yinian and Su,Guan-Ming and Gou,Hongmei and Varna,Avinash L. and He,Shan and M. Wu and Oard, Douglas} } @article {17777, title = {CONVEX: Context vectors as a paradigm for learning group behaviors based on similarity}, journal = {IEEE Intelligent Systems}, volume = {23}, year = {2007}, month = {2007///}, pages = {51 - 57}, author = {Martinez,V. and Simari,G. I and Sliva,A. and V.S. Subrahmanian} } @conference {13141, title = {COST: An Approach for Camera Selection and Multi-Object Inference Ordering in Dynamic Scenes}, booktitle = {Computer Vision, 2007. ICCV 2007. IEEE 11th International Conference on}, year = {2007}, month = {2007/10//}, pages = {1 - 8}, abstract = {Development of multiple camera based vision systems for analysis of dynamic objects such as humans is challenging due to occlusions and similarity in the appearance of a person with the background and other people- visual "confusion". Since occlusion and confusion depends on the presence of other people in the scene, it leads to a dependency structure where there are often loops in the resulting Bayesian network. While approaches such as loopy belief propagation can be used for inference, they are computationally expensive and convergence is not guaranteed in many situations. We present a unified approach, COST, that reasons about such dependencies and yields an order for the inference of each person in a group of people and a set of cameras to be used for inferences for a person. Using the probabilistic distribution of the positions and appearances of people, COST performs visibility and confusion analysis for each part of each person and computes the amount of information that can be computed with and without more accurate estimation of the positions of other people. We present an optimization problem to select set of cameras and inference dependencies for each person which attempts to minimize the computational cost under given performance constraints. Results show the efficiency of COST in improving the performance of such systems and reducing the computational resources required.}, doi = {10.1109/ICCV.2007.4408842}, author = {Gupta,Abhinav and Mittal,Anurag and Davis, Larry S.} } @conference {15462, title = {Covering array sampling of input event sequences for automated gui testing}, booktitle = {Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering}, series = {ASE {\textquoteright}07}, year = {2007}, month = {2007///}, pages = {405 - 408}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {This paper describes a new automated technique to generate test cases for GUIs by using covering arrays (CAs). The key motivation is to generate long GUI event sequences that are systematically sampled at a particular coverage strength. CAs, to date, have not been effectively used in sampling event driven systems such as GUIs which maintain state. We leverage a "stateless" abstraction of GUIs that allows us to use CAs. Once the CAs have been generated, we reuse the abstractions to reinsert ordering relationships between GUI events, thereby creating executable test cases. A feasibility study on a well-studied GUI-based application shows that the new technique is able to detect a large number of previously undetected faults}, keywords = {covering arrays, event driven software, GUI testing}, isbn = {978-1-59593-882-4}, doi = {10.1145/1321631.1321695}, url = {http://doi.acm.org/10.1145/1321631.1321695}, author = {Xun Yuan and Cohen,Myra and Memon, Atif M.} } @conference {12252, title = {Creating a Robust Desktop Grid using Peer-to-Peer Services}, booktitle = {Parallel and Distributed Processing Symposium, 2007. IPDPS 2007. IEEE International}, year = {2007}, month = {2007/03//}, pages = {1 - 7}, abstract = {The goal of the work described in this paper is to design and build a scalable infrastructure for executing grid applications on a widely distributed set of resources. Such grid infrastructure must be decentralized, robust, highly available, and scalable, while efficiently mapping application instances to available resources in the system. However, current desktop grid computing platforms are typically based on a client-server architecture, which has inherent shortcomings with respect to robustness, reliability and scalability. Fortunately, these problems can be addressed through the capabilities promised by new techniques and approaches in peer-to-peer (P2P) systems. By employing P2P services, our system allows users to submit jobs to be run in the system and to run jobs submitted by other users on any resources available in the system, essentially allowing a group of users to form an ad-hoc set of shared resources. The initial target application areas for the desktop grid system are in astronomy and space science simulation and data analysis.}, keywords = {allocation;, architecture;load, balancing;peer-to-peer, client-server, computing;peer-to-peer, computing;resource, desktop, grid;scalable, infrastructure;client-server, system;robust, systems;grid}, doi = {10.1109/IPDPS.2007.370505}, author = {Kim,J.-S. and Nam,B. and Marsh,M. and Keleher,P. and Bhattacharjee, Bobby and Richardson,D. and Wellnitz,D. and Sussman, Alan} } @conference {17582, title = {Cross-layer latency minimization in wireless networks with SINR constraints}, booktitle = {Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing}, series = {MobiHoc {\textquoteright}07}, year = {2007}, month = {2007///}, pages = {110 - 119}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Recently, there has been substantial interest in the design of cross-layer protocols for wireless networks. These protocols optimize certain performance metric(s) of interest (e.g. latency, energy, rate) by jointly optimizing the performance of multiple layers of the protocol stack. Algorithm designers often use geometric-graph-theoretic models for radio interference to design such cross-layer protocols. In this paper we study the problem of designing cross-layer protocols for multi-hop wireless networks using a more realistic Signal to Interference plus Noise Ratio (SINR) model for radio interference. The following cross-layer latency minimization problem is studied: Given a set V of transceivers, and a set of source-destination pairs, (i) choose power levels for all the transceivers, (ii) choose routes for all connections, and (iii) construct an end-to-end schedule such that the SINR constraints are satisfied at each time step so as to minimize the make-span of the schedule (the time by which all packets have reached their respective destinations). We present a polynomial-time algorithm with provable worst-case performance guarantee for this cross-layer latency minimization problem. As corollaries of the algorithmic technique we show that a number of variants of the cross-layer latency minimization problem can also be approximated efficiently in polynomial time. Our work extends the results of Kumar et al. (Proc. SODA, 2004) and Moscibroda et al. (Proc. MOBIHOC, 2006). Although our algorithm considers multiple layers of the protocol stack, it can naturally be viewed as compositions of tasks specific to each layer --- this allows us to improve the overall performance while preserving the modularity of the layered structure.}, keywords = {cross-layer design, end-to-end scheduling, Interference, SINR model, Wireless networks}, isbn = {978-1-59593-684-4}, doi = {10.1145/1288107.1288123}, url = {http://doi.acm.org/10.1145/1288107.1288123}, author = {Chafekar,Deepti and Kumar,V. S. Anil and Marathe,Madhav V. and Parthasarathy,Srinivasan and Srinivasan, Aravind} } @inbook {15506, title = {Deductive Databases}, booktitle = {Wiley Encyclopedia of Computer Science and EngineeringWiley Encyclopedia of Computer Science and Engineering}, year = {2007}, month = {2007/12/14/}, publisher = {John Wiley \& Sons, Inc.}, organization = {John Wiley \& Sons, Inc.}, keywords = {answer set semantics, Datalog, deductive database, disjunctive database, extended database}, isbn = {9780470050118}, url = {http://onlinelibrary.wiley.com/doi/10.1002/9780470050118.ecse105/abstract}, author = {Grant,John and Minker, Jack} } @article {15411, title = {Designing and comparing automated test oracles for GUI-based software applications}, journal = {ACM Trans. Softw. Eng. Methodol.}, volume = {16}, year = {2007}, month = {2007/02//}, abstract = {Test designers widely believe that the overall effectiveness and cost of software testing depends largely on the type and number of test cases executed on the software. This article shows that the test oracle, a mechanism that determines whether a software is executed correctly for a test case, also significantly impacts the fault detection effectiveness and cost of a test case. Graphical user interfaces (GUIs), which have become ubiquitous for interacting with today{\textquoteright}s software, have created new challenges for test oracle development. Test designers manually {\textquotedblleft}assert{\textquotedblright} the expected values of specific properties of certain GUI widgets in each test case; during test execution, these assertions are used as test oracles to determine whether the GUI executed correctly. Since a test case for a GUI is a sequence of events, a test designer must decide: (1) what to assert; and (2) how frequently to check an assertion, for example, after each event in the test case or after the entire test case has completed execution. Variations of these two factors significantly impact the fault-detection ability and cost of a GUI test case. A technique to declaratively specify different types of automated GUI test oracles is described. Six instances of test oracles are developed and compared in an experiment on four software systems. The results show that test oracles do affect the fault detection ability of test cases in different and interesting ways: (1) Test cases significantly lose their fault detection ability when using {\textquotedblleft}weak{\textquotedblright} test oracles; (2) in many cases, invoking a {\textquotedblleft}thorough{\textquotedblright} oracle at the end of test case execution yields the best cost-benefit ratio; (3) certain test cases detect faults only if the oracle is invoked during a small {\textquotedblleft}window of opportunity{\textquotedblright} during test execution; and (4) using thorough and frequently-executing test oracles can compensate for not having long test cases.}, keywords = {Graphical user interfaces, GUI state, GUI testing, test oracles, User interfaces, widgets}, isbn = {1049-331X}, doi = {10.1145/1189748.1189752}, url = {http://doi.acm.org/10.1145/1189748.1189752}, author = {Xie,Qing and Memon, Atif M.} } @conference {17782, title = {Detecting stochastically scheduled activities in video}, booktitle = {International Joint Conference on Artificial Intelligence}, year = {2007}, month = {2007///}, pages = {1802 - 1807}, abstract = {The ability to automatically detect activities invideo is of increasing importance in applications such as bank security, airport tarmac security, bag- gage area security and building site surveillance. We present a stochastic activity model composed of atomic actions which are directly observable through image understanding primitives. We focus on answering two types of questions: (i) what are the minimal sub-videos in which a given action is identified with probability above a certain thresh- old and (ii) for a given video, can we decide which activity from a given set most likely occurred? We provide the MPS algorithm for the first problem, as well as two different algorithms (naiveMPA and MPA) to solve the second. Our experimental re- sults on a dataset consisting of staged bank robbery videos (described in [Vu et al., 2003]) show that our algorithms are both fast and provide high qual- ity results when compared to human reviewers. }, author = {Albanese, M. and Moscato, V. and Picariello, A. and V.S. Subrahmanian and Udrea,O.} } @article {15507, title = {Developing a Computer Science Department at the University of Maryland}, journal = {Annals of the History of Computing, IEEE}, volume = {29}, year = {2007}, month = {2007/12//oct}, pages = {64 - 75}, abstract = {This article describes the first six years of the Computer Science Department, established in 1973 at the University of Maryland. The department evolved out of the Computer Science Center, which had been instituted in February 1962. In 1980, the National Academy of Sciences judged the department as being among the leading computer science departments in the US.}, keywords = {administrative, data, department;educational, MARYLAND, processing;, Science, University;computer}, isbn = {1058-6180}, doi = {10.1109/MAHC.2007.4407446}, author = {Minker, Jack} } @conference {15461, title = {Direct-dependency-based software compatibility testing}, booktitle = {Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering}, series = {ASE {\textquoteright}07}, year = {2007}, month = {2007///}, pages = {409 - 412}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Software compatibility testing is an important quality assurance task aimed at ensuring that component-based software systems build and/or execute properly across a broad range of user system configurations. Because each configuration can involve multiple components with different versions, and because there are complex and changing interdependencies between components and their versions, it is generally infeasible to test all potential configurations. Therefore, compatibility testing usually means examining only a handful of default or popular configurations to detect problems, and as a result costly errors can and do escape to the field This paper presents an improved approach to compatibility testing called RACHET. We formally model the configuration space for component-based systems and use the model to generate test plans covering user-specified portion of the space - the example in this paper is covering all it direct dependencies between components. The test plan is executed efficiently in parallel, by distributing work so as to best utilize test resources. We conducted experimentsand simulation studies applying our approach to a large-scale data management middleware system. The results showed that for this system RACHET discovered incompatibilities between components at a small fraction of the cost for exhaustive testing without compromising test quality}, keywords = {compatibility testing, component-based software system}, isbn = {978-1-59593-882-4}, doi = {10.1145/1321631.1321696}, url = {http://doi.acm.org/10.1145/1321631.1321696}, author = {Yoon,Il-Chul and Sussman, Alan and Memon, Atif M. and Porter, Adam} } @inbook {17584, title = {Distributed Ranked Search}, booktitle = {High Performance Computing {\textendash} HiPC 2007High Performance Computing {\textendash} HiPC 2007}, series = {Lecture Notes in Computer Science}, volume = {4873}, year = {2007}, month = {2007///}, pages = {7 - 20}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {P2P deployments are a natural infrastructure for building distributed search networks. Proposed systems support locating and retrieving all results, but lack the information necessary to rank them. Users, however, are primarily interested in the most relevant results, not necessarily all possible results. Using random sampling, we extend a class of well-known information retrieval ranking algorithms such that they can be applied in this decentralized setting. We analyze the overhead of our approach, and quantify how our system scales with increasing number of documents, system size, document to node mapping (uniform versus non-uniform), and types of queries (rare versus popular terms). Our analysis and simulations show that a) these extensions are efficient, and scale with little overhead to large systems, and b) the accuracy of the results obtained using distributed ranking is comparable to that of a centralized implementation.}, isbn = {978-3-540-77219-4}, url = {http://dx.doi.org/10.1007/978-3-540-77220-0_6}, author = {Gopalakrishnan,Vijay and Morselli,Ruggero and Bhattacharjee, Bobby and Keleher,Pete and Srinivasan, Aravind}, editor = {Aluru,Srinivas and Parashar,Manish and Badrinath,Ramamurthy and Prasanna,Viktor} } @article {12261, title = {Distributed ranked search}, journal = {High Performance Computing{\textendash}HiPC 2007}, year = {2007}, month = {2007///}, pages = {7 - 20}, abstract = {P2P deployments are a natural infrastructure for building distributed search networks. Proposed systems support locating and retrieving all results, but lack the information necessary to rank them. Users, however, are primarily interested in the most relevant results, not necessarily all possible results.Using random sampling, we extend a class of well-known information retrieval ranking algorithms such that they can be applied in this decentralized setting. We analyze the overhead of our approach, and quantify how our system scales with increasing number of documents, system size, document to node mapping (uniform versus non-uniform), and types of queries (rare versus popular terms). Our analysis and simulations show that a) these extensions are efficient, and scale with little overhead to large systems, and b) the accuracy of the results obtained using distributed ranking is comparable to that of a centralized implementation. }, author = {Gopalakrishnan,V. and Morselli,R. and Bhattacharjee, Bobby and Keleher,P. and Srinivasan, Aravind} } @article {16257, title = {Draft Genome of the Filarial Nematode Parasite Brugia Malayi}, journal = {Science}, volume = {317}, year = {2007}, month = {2007/09/21/}, pages = {1756 - 1760}, abstract = {Parasitic nematodes that cause elephantiasis and river blindness threaten hundreds of millions of people in the developing world. We have sequenced the \~{}90 megabase (Mb) genome of the human filarial parasite Brugia malayi and predict \~{}11,500 protein coding genes in 71 Mb of robustly assembled sequence. Comparative analysis with the free-living, model nematode Caenorhabditis elegans revealed that, despite these genes having maintained little conservation of local synteny during \~{}350 million years of evolution, they largely remain in linkage on chromosomal units. More than 100 conserved operons were identified. Analysis of the predicted proteome provides evidence for adaptations of B. malayi to niches in its human and vector hosts and insights into the molecular basis of a mutualistic relationship with its Wolbachia endosymbiont. These findings offer a foundation for rational drug design.}, isbn = {0036-8075, 1095-9203}, doi = {10.1126/science.1145406}, url = {http://www.sciencemag.org/content/317/5845/1756}, author = {Ghedin,Elodie and Wang,Shiliang and Spiro,David and Caler,Elisabet and Zhao,Qi and Crabtree,Jonathan and Allen,Jonathan E and Delcher,Arthur L. and Guiliano,David B and Miranda-Saavedra,Diego and Angiuoli,Samuel V and Creasy,Todd and Amedeo,Paolo and Haas,Brian and El-Sayed, Najib M. and Wortman,Jennifer R. and Feldblyum,Tamara and Tallon,Luke and Schatz,Michael and Shumway,Martin and Koo,Hean and Salzberg,Steven L. and Schobel,Seth and Pertea,Mihaela and Pop, Mihai and White,Owen and Barton,Geoffrey J and Carlow,Clotilde K. S and Crawford,Michael J and Daub,Jennifer and Dimmic,Matthew W and Estes,Chris F and Foster,Jeremy M and Ganatra,Mehul and Gregory,William F and Johnson,Nicholas M and Jin,Jinming and Komuniecki,Richard and Korf,Ian and Kumar,Sanjay and Laney,Sandra and Li,Ben-Wen and Li,Wen and Lindblom,Tim H and Lustigman,Sara and Ma,Dong and Maina,Claude V and Martin,David M. A and McCarter,James P and McReynolds,Larry and Mitreva,Makedonka and Nutman,Thomas B and Parkinson,John and Peregr{\'\i}n-Alvarez,Jos{\'e} M and Poole,Catherine and Ren,Qinghu and Saunders,Lori and Sluder,Ann E and Smith,Katherine and Stanke,Mario and Unnasch,Thomas R and Ware,Jenna and Wei,Aguan D and Weil,Gary and Williams,Deryck J and Zhang,Yinhua and Williams,Steven A and Fraser-Liggett,Claire and Slatko,Barton and Blaxter,Mark L and Scott,Alan L} } @article {15570, title = {Efficient implementation of an optimal interpolator for large spatial data sets}, journal = {Computational Science{\textendash}ICCS 2007}, year = {2007}, month = {2007///}, pages = {503 - 510}, abstract = {Interpolating scattered data points is a problem of wide ranging interest. One of the most popular interpolation methods in geostatistics is ordinary kriging. The price for its statistical optimality is that the estimator is computationally very expensive. We demonstrate the space and time efficiency and accuracy of approximating ordinary kriging through the use of covariance tapering combined with iterative methods.}, doi = {10.1007/978-3-540-72586-2_74}, author = {Memarsadeghi,N. and Mount, Dave} } @article {17591, title = {Efficient lookup on unstructured topologies}, journal = {IEEE Journal on Selected Areas in Communications}, volume = {25}, year = {2007}, month = {2007/01//}, pages = {62 - 72}, abstract = {We present LMS, a protocol for efficient lookup on unstructured networks. Our protocol uses a virtual namespace without imposing specific topologies. It is more efficient than existing lookup protocols for unstructured networks, and thus is an attractive alternative for applications in which the topology cannot be structured as a Distributed Hash Table (DHT). We present analytic bounds for the worst-case performance of LMS. Through detailed simulations (with up to 100,000 nodes), we show that the actual performance on realistic topologies is significantly better. We also show in both simulations and a complete implementation (which includes over five hundred nodes) that our protocol is inherently robust against multiple node failures and can adapt its replication strategy to optimize searches according to a specific heuristic. Moreover, the simulation demonstrates the resilience of LMS to high node turnover rates, and that it can easily adapt to orders of magnitude changes in network size. The overhead incurred by LMS is small, and its performance approaches that of DHTs on networks of similar size}, keywords = {Computer science, DHT, distributed algorithms, Distributed computing, distributed hash table, Least squares approximation, LMS, local minima search, lookup protocol, Network topology, node failures, Peer to peer computing, Performance analysis, Protocols, replication strategy, Resilience, Robustness, table lookup, telecommunication network topology, unstructured network topology}, isbn = {0733-8716}, doi = {10.1109/JSAC.2007.07007}, author = {Morselli,R. and Bhattacharjee, Bobby and Marsh,M.A. and Srinivasan, Aravind} } @article {15444, title = {An empirical approach to evaluating web application compliance across diverse client platform configurations}, journal = {International Journal of Web Engineering and Technology}, volume = {3}, year = {2007}, month = {2007/01/01/}, pages = {227 - 253}, abstract = {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.}, url = {http://inderscience.metapress.com/content/7Y4ABR5FJHKRAPAA}, author = {Eaton,Cyntrica and Memon, Atif M.} } @conference {18654, title = {An empirical study of filesystem activity following a SSH compromise}, year = {2007}, month = {2007/12//}, pages = {1 - 5}, abstract = {Monitoring filesystem data is a common method used to detect attacks. Once a computer is compromised, attackers will likely alter files, add new files or delete existing files. The changes that attackers make may target any part of the filesystem, including metadata along with files (e.g., permissions, ownerships and inodes). In this paper, we describe an empirical study that focused on SSH compromised attacks. First statistical data on the number of files targeted and the associated activity (e.g., read, write, delete, ownership and rights) is reported. Then, we refine the analysis to identify and understand patterns in the attack activity.}, keywords = {attack activity, filesystem activity, filesystem data monitoring, intrusion detection systems evaluation, meta data, metadata, security of data, SSH compromised attacks}, doi = {10.1109/ICICS.2007.4449675}, author = {Molina,J. and Gordon,J. and Chorin,X. and Michel Cukier} } @conference {15327, title = {Evaluation of Traditional and Shock-Confining LES Filters using DNS Data of Compressible Turbulence}, booktitle = {Proceedings of 18th AIAA Computational Fluid Dynamics Conference}, year = {2007}, month = {2007///}, abstract = {Uniformly high-order-accurate filtering of fluid flow properties in the presence of shocksand shocklets is theoretically susceptible to the same problem that afflicts uniformly high- order-accurate numerical methods for approximating the convective terms of the Navier- Stokes equations: the introduction of new, non-physical extrema near discontinuities. Ex- tensive investigations have been conducted into myriad types of shock-capturing methods, which adaptively decrease their order of accuracy within shock-containing regions in order to maintain accuracy and stability over time. Inspired by such work, Grube et al. (AIAA 2007-4198) have proposed the conceptually similar idea of {\textquotedblleft}shock-confining{\textquotedblright} filtering (SCF) for compressible large-eddy simulations (LES), in which a class of linear filters is subject to adaptive adjustments based on smoothness information provided by a weighted essen- tially non-oscillatory (WENO) method. In the current work, we utilize the turbulent flow fields produced by direct numerical simulations (DNS) of shock/isotropic-turbulence inter- action to perform preliminary a priori testing of these shock-confining filters against the corresponding linear filters. Although additional study, both a priori and a posteriori, is required to verify the necessity and suitability of SCF for LES, we conclude that linear filtering can indeed create serious qualitative discrepancies in global flow characteristics, discrepancies that are avoided by the use of SCF. }, author = {Taylor,E. M and Grube,N. E and Martin, M.P} } @article {15492, title = {An event-flow model of GUI-based applications for testing}, journal = {Software Testing, Verification and Reliability}, volume = {17}, year = {2007}, month = {2007///}, pages = {137 - 157}, abstract = {Graphical user interfaces (GUIs) are by far the most popular means used to interact with today{\textquoteright}s software. The functional correctness of a GUI is required to ensure the safety, robustness and usability of an entire software system. GUI testing techniques used in practice are resource intensive; model-based automated techniques are rarely employed. A key reason for the reluctance in the adoption of model-based solutions proposed by researchers is their limited applicability; moreover, the models are expensive to create. Over the past few years, the present author has been developing different models for various aspects of GUI testing. This paper consolidates all of the models into one scalable event-flow model and outlines algorithms to semi-automatically reverse-engineer the model from an implementation. Earlier work on model-based test-case generation, test-oracle creation, coverage evaluation, and regression testing is recast in terms of this model by defining event-space exploration strategies (ESESs) and creating an end-to-end GUI testing process. Three such ESESs are described: for checking the event-flow model, test-case generation, and test-oracle creation. Two demonstrational scenarios show the application of the model and the three ESESs for experimentation and application in GUI testing. Copyright {\textcopyright} 2007 John Wiley \& Sons, Ltd.}, keywords = {event-driven software, event-flow graph, event-flow model, Graphical user interfaces, integration tree, Model checking, test oracles, test-case generation}, isbn = {1099-1689}, doi = {10.1002/stvr.364}, url = {http://onlinelibrary.wiley.com/doi/10.1002/stvr.364/abstract}, author = {Memon, Atif M.} } @article {16261, title = {Evolution of genes and genomes on the Drosophila phylogeny}, journal = {Nature}, volume = {450}, year = {2007}, month = {2007/11/08/}, pages = {203 - 218}, abstract = {Comparative analysis of multiple genomes in a phylogenetic framework dramatically improves the precision and sensitivity of evolutionary inference, producing more robust results than single-genome analyses can provide. The genomes of 12 Drosophila species, ten of which are presented here for the first time (sechellia, simulans, yakuba, erecta, ananassae, persimilis, willistoni, mojavensis, virilis and grimshawi), illustrate how rates and patterns of sequence divergence across taxa can illuminate evolutionary processes on a genomic scale. These genome sequences augment the formidable genetic tools that have made Drosophila melanogaster a pre-eminent model for animal genetics, and will further catalyse fundamental research on mechanisms of development, cell biology, genetics, disease, neurobiology, behaviour, physiology and evolution. Despite remarkable similarities among these Drosophila species, we identified many putatively non-neutral changes in protein-coding genes, non-coding RNA genes, and cis-regulatory regions. These may prove to underlie differences in the ecology and behaviour of these diverse species.}, isbn = {0028-0836}, doi = {10.1038/nature06341}, url = {http://www.nature.com/nature/journal/v450/n7167/full/nature06341.html}, author = {Clark,Andrew G. and Eisen,Michael B. and Smith,Douglas R. and Bergman,Casey M. and Oliver,Brian and Markow,Therese A. and Kaufman,Thomas C. and Kellis,Manolis and Gelbart,William and Iyer,Venky N. and Pollard,Daniel A. and Sackton,Timothy B. and Larracuente,Amanda M. and Singh,Nadia D. and Abad,Jose P. and Abt,Dawn N. and Adryan,Boris and Aguade,Montserrat and Akashi,Hiroshi and Anderson,Wyatt W. and Aquadro,Charles F. and Ardell,David H. and Arguello,Roman and Artieri,Carlo G. and Barbash,Daniel A. and Barker,Daniel and Barsanti,Paolo and Batterham,Phil and Batzoglou,Serafim and Begun,Dave and Bhutkar,Arjun and Blanco,Enrico and Bosak,Stephanie A. and Bradley,Robert K. and Brand,Adrianne D. and Brent,Michael R. and Brooks,Angela N. and Brown,Randall H. and Butlin,Roger K. and Caggese,Corrado and Calvi,Brian R. and Carvalho,A. Bernardo de and Caspi,Anat and Castrezana,Sergio and Celniker,Susan E. and Chang,Jean L. and Chapple,Charles and Chatterji,Sourav and Chinwalla,Asif and Civetta,Alberto and Clifton,Sandra W. and Comeron,Josep M. and Costello,James C. and Coyne,Jerry A. and Daub,Jennifer and David,Robert G. and Delcher,Arthur L. and Delehaunty,Kim and Do,Chuong B. and Ebling,Heather and Edwards,Kevin and Eickbush,Thomas and Evans,Jay D. and Filipski,Alan and Findei|[szlig]|,Sven and Freyhult,Eva and Fulton,Lucinda and Fulton,Robert and Garcia,Ana C. L. and Gardiner,Anastasia and Garfield,David A. and Garvin,Barry E. and Gibson,Greg and Gilbert,Don and Gnerre,Sante and Godfrey,Jennifer and Good,Robert and Gotea,Valer and Gravely,Brenton and Greenberg,Anthony J. and Griffiths-Jones,Sam and Gross,Samuel and Guigo,Roderic and Gustafson,Erik A. and Haerty,Wilfried and Hahn,Matthew W. and Halligan,Daniel L. and Halpern,Aaron L. and Halter,Gillian M. and Han,Mira V. and Heger,Andreas and Hillier,LaDeana and Hinrichs,Angie S. and Holmes,Ian and Hoskins,Roger A. and Hubisz,Melissa J. and Hultmark,Dan and Huntley,Melanie A. and Jaffe,David B. and Jagadeeshan,Santosh and Jeck,William R. and Johnson,Justin and Jones,Corbin D. and Jordan,William C. and Karpen,Gary H. and Kataoka,Eiko and Keightley,Peter D. and Kheradpour,Pouya and Kirkness,Ewen F. and Koerich,Leonardo B. and Kristiansen,Karsten and Kudrna,Dave and Kulathinal,Rob J. and Kumar,Sudhir and Kwok,Roberta and Lander,Eric and Langley,Charles H. and Lapoint,Richard and Lazzaro,Brian P. and Lee,So-Jeong and Levesque,Lisa and Li,Ruiqiang and Lin,Chiao-Feng and Lin,Michael F. and Lindblad-Toh,Kerstin and Llopart,Ana and Long,Manyuan and Low,Lloyd and Lozovsky,Elena and Lu,Jian and Luo,Meizhong and Machado,Carlos A. and Makalowski,Wojciech and Marzo,Mar and Matsuda,Muneo and Matzkin,Luciano and McAllister,Bryant and McBride,Carolyn S. and McKernan,Brendan and McKernan,Kevin and Mendez-Lago,Maria and Minx,Patrick and Mollenhauer,Michael U. and Montooth,Kristi and Mount, Stephen M. and Mu,Xu and Myers,Eugene and Negre,Barbara and Newfeld,Stuart and Nielsen,Rasmus and Noor,Mohamed A. F. and O{\textquoteright}Grady,Patrick and Pachter,Lior and Papaceit,Montserrat and Parisi,Matthew J. and Parisi,Michael and Parts,Leopold and Pedersen,Jakob S. and Pesole,Graziano and Phillippy,Adam M and Ponting,Chris P. and Pop, Mihai and Porcelli,Damiano and Powell,Jeffrey R. and Prohaska,Sonja and Pruitt,Kim and Puig,Marta and Quesneville,Hadi and Ram,Kristipati Ravi and Rand,David and Rasmussen,Matthew D. and Reed,Laura K. and Reenan,Robert and Reily,Amy and Remington,Karin A. and Rieger,Tania T. and Ritchie,Michael G. and Robin,Charles and Rogers,Yu-Hui and Rohde,Claudia and Rozas,Julio and Rubenfield,Marc J. and Ruiz,Alfredo and Russo,Susan and Salzberg,Steven L. and Sanchez-Gracia,Alejandro and Saranga,David J. and Sato,Hajime and Schaeffer,Stephen W. and Schatz,Michael C and Schlenke,Todd and Schwartz,Russell and Segarra,Carmen and Singh,Rama S. and Sirot,Laura and Sirota,Marina and Sisneros,Nicholas B. and Smith,Chris D. and Smith,Temple F. and Spieth,John and Stage,Deborah E. and Stark,Alexander and Stephan,Wolfgang and Strausberg,Robert L. and Strempel,Sebastian and Sturgill,David and Sutton,Granger and Sutton,Granger G. and Tao,Wei and Teichmann,Sarah and Tobari,Yoshiko N. and Tomimura,Yoshihiko and Tsolas,Jason M. and Valente,Vera L. S. and Venter,Eli and Venter,J. Craig and Vicario,Saverio and Vieira,Filipe G. and Vilella,Albert J. and Villasante,Alfredo and Walenz,Brian and Wang,Jun and Wasserman,Marvin and Watts,Thomas and Wilson,Derek and Wilson,Richard K. and Wing,Rod A. and Wolfner,Mariana F. and Wong,Alex and Wong,Gane Ka-Shu and Wu,Chung-I and Wu,Gabriel and Yamamoto,Daisuke and Yang,Hsiao-Pei and Yang,Shiaw-Pyng and Yorke,James A. and Yoshida,Kiyohito and Zdobnov,Evgeny and Zhang,Peili and Zhang,Yu and Zimin,Aleksey V. and Baldwin,Jennifer and Abdouelleil,Amr and Abdulkadir,Jamal and Abebe,Adal and Abera,Brikti and Abreu,Justin and Acer,St Christophe and Aftuck,Lynne and Alexander,Allen and An,Peter and Anderson,Erica and Anderson,Scott and Arachi,Harindra and Azer,Marc and Bachantsang,Pasang and Barry,Andrew and Bayul,Tashi and Berlin,Aaron and Bessette,Daniel and Bloom,Toby and Blye,Jason and Boguslavskiy,Leonid and Bonnet,Claude and Boukhgalter,Boris and Bourzgui,Imane and Brown,Adam and Cahill,Patrick and Channer,Sheridon and Cheshatsang,Yama and Chuda,Lisa and Citroen,Mieke and Collymore,Alville and Cooke,Patrick and Costello,Maura and D{\textquoteright}Aco,Katie and Daza,Riza and Haan,Georgius De and DeGray,Stuart and DeMaso,Christina and Dhargay,Norbu and Dooley,Kimberly and Dooley,Erin and Doricent,Missole and Dorje,Passang and Dorjee,Kunsang and Dupes,Alan and Elong,Richard and Falk,Jill and Farina,Abderrahim and Faro,Susan and Ferguson,Diallo and Fisher,Sheila and Foley,Chelsea D. and Franke,Alicia and Friedrich,Dennis and Gadbois,Loryn and Gearin,Gary and Gearin,Christina R. and Giannoukos,Georgia and Goode,Tina and Graham,Joseph and Grandbois,Edward and Grewal,Sharleen and Gyaltsen,Kunsang and Hafez,Nabil and Hagos,Birhane and Hall,Jennifer and Henson,Charlotte and Hollinger,Andrew and Honan,Tracey and Huard,Monika D. and Hughes,Leanne and Hurhula,Brian and Husby,M Erii and Kamat,Asha and Kanga,Ben and Kashin,Seva and Khazanovich,Dmitry and Kisner,Peter and Lance,Krista and Lara,Marcia and Lee,William and Lennon,Niall and Letendre,Frances and LeVine,Rosie and Lipovsky,Alex and Liu,Xiaohong and Liu,Jinlei and Liu,Shangtao and Lokyitsang,Tashi and Lokyitsang,Yeshi and Lubonja,Rakela and Lui,Annie and MacDonald,Pen and Magnisalis,Vasilia and Maru,Kebede and Matthews,Charles and McCusker,William and McDonough,Susan and Mehta,Teena and Meldrim,James and Meneus,Louis and Mihai,Oana and Mihalev,Atanas and Mihova,Tanya and Mittelman,Rachel and Mlenga,Valentine and Montmayeur,Anna and Mulrain,Leonidas and Navidi,Adam and Naylor,Jerome and Negash,Tamrat and Nguyen,Thu and Nguyen,Nga and Nicol,Robert and Norbu,Choe and Norbu,Nyima and Novod,Nathaniel and O{\textquoteright}Neill,Barry and Osman,Sahal and Markiewicz,Eva and Oyono,Otero L. and Patti,Christopher and Phunkhang,Pema and Pierre,Fritz and Priest,Margaret and Raghuraman,Sujaa and Rege,Filip and Reyes,Rebecca and Rise,Cecil and Rogov,Peter and Ross,Keenan and Ryan,Elizabeth and Settipalli,Sampath and Shea,Terry and Sherpa,Ngawang and Shi,Lu and Shih,Diana and Sparrow,Todd and Spaulding,Jessica and Stalker,John and Stange-Thomann,Nicole and Stavropoulos,Sharon and Stone,Catherine and Strader,Christopher and Tesfaye,Senait and Thomson,Talene and Thoulutsang,Yama and Thoulutsang,Dawa and Topham,Kerri and Topping,Ira and Tsamla,Tsamla and Vassiliev,Helen and Vo,Andy and Wangchuk,Tsering and Wangdi,Tsering and Weiand,Michael and Wilkinson,Jane and Wilson,Adam and Yadav,Shailendra and Young,Geneva and Yu,Qing and Zembek,Lisa and Zhong,Danni and Zimmer,Andrew and Zwirko,Zac and Jaffe,David B. and Alvarez,Pablo and Brockman,Will and Butler,Jonathan and Chin,CheeWhye and Gnerre,Sante and Grabherr,Manfred and Kleber,Michael and Mauceli,Evan and MacCallum,Iain} } @article {19072, title = {Evolution of genes and genomes on the Drosophila phylogeny}, journal = {Nature}, volume = {450}, year = {2007}, month = {2007}, pages = {203 - 218}, author = {Clark, A.G. and Eisen,M. B and Smith,D. R and Bergman, C.M. and Oliver, B. and Markow, T.A. and Kaufman, T.C. and Kellis, M. and Gelbart, W. and Iyer, V.N. and others} } @article {12134, title = {Experimenting with software testbeds for evaluating new technologies}, journal = {Empirical Software Engineering}, volume = {12}, year = {2007}, month = {2007///}, pages = {417 - 444}, abstract = {The evolution of a new technology depends upon a good theoretical basis for developing the technology, as well as upon its experimental validation. In order to provide for this experimentation, we have investigated the creation of a software testbed and the feasibility of using the same testbed for experimenting with a broad set of technologies. The testbed is a set of programs, data, and supporting documentation that allows researchers to test their new technology on a standard software platform. An important component of this testbed is the Unified Model of Dependability (UMD), which was used to elicit dependability requirements for the testbed software. With a collection of seeded faults and known issues of the target system, we are able to determine if a new technology is adept at uncovering defects or providing other aids proposed by its developers. In this paper, we present the Tactical Separation Assisted Flight Environment (TSAFE) testbed environment for which we modeled and evaluated dependability requirements and defined faults to be seeded for experimentation. We describe two completed experiments that we conducted on the testbed. The first experiment studies a technology that identifies architectural violations and evaluates its ability to detect the violations. The second experiment studies model checking as part of design for verification. We conclude by describing ongoing experimental work studying testing, using the same testbed. Our conclusion is that even though these three experiments are very different in terms of the studied technology, using and re-using the same testbed is beneficial and cost effective.}, doi = {10.1007/s10664-006-9034-0}, author = {Lindvall,M. and Rus,I. and Donzelli,P. and Memon, Atif M. and Zelkowitz, Marvin V and Betin-Can,A. and Bultan,T. and Ackermann,C. and Anders,B. and Asgari, S. and Basili, Victor R.} } @conference {12249, title = {Exploiting approximate transitivity of trust}, booktitle = {Broadband Communications, Networks and Systems, 2007. BROADNETS 2007. Fourth International Conference on}, year = {2007}, month = {2007/09//}, pages = {515 - 524}, abstract = {Social networks, of which webs of trust are a particular type, have been shown to be effective ways of moving information with minimal external configuration, setup, or management. For applications requiring information assurance, a web of trust is an appealing system architecture, since trust is an inherent component of both the network design and assurance. The trust in a typical web of trust is not transitive, however, making the construction of an application with strong assurance difficult or impossible. Instead, in this paper we examine a notion of weak assurance that can be provided by a web of trust, and might be $\#$x201C;good enough $\#$x201D; for many applications. As a motivating example, and to provide a more concrete basis for exposition, we present KeyChains, a peer-to-peer system that operates over a distributed web of trust to provide fully decentralized public key publishing and retrieval. In addition to weak assurance guarantees, KeyChains also provides an audit trail for public keys retrieved. Our analysis and simulations show that the resulting system is both efficient and secure.}, doi = {10.1109/BROADNETS.2007.4550477}, author = {Morselli,Ruggero and Bhattacharjee, Bobby and Katz, Jonathan and Marsh,Michael} } @article {15606, title = {A fast implementation of the ISODATA clustering algorithm}, journal = {International Journal of Computational Geometry and Applications}, volume = {17}, year = {2007}, month = {2007///}, pages = {71 - 103}, abstract = {Clustering is central to many image processing and remote sensing applications. isodatais one of the most popular and widely used clustering methods in geoscience applications, but it can run slowly, particularly with large data sets. We present a more efficient approach to isodata clustering, which achieves better running times by storing the points in a kd-tree and through a modification of the way in which the algorithm estimates the dispersion of each cluster. We also present an approximate version of the algorithm which allows the user to further improve the running time, at the expense of lower fidelity in computing the nearest cluster center to each point. We provide both theoretical and empirical justification that our modified approach produces clusterings that are very similar to those produced by the standard isodata approach. We also provide empirical studies on both synthetic data and remotely sensed Landsat and MODIS images that show that our approach has significantly lower running times. }, author = {Memarsadeghi,N. and Mount, Dave and Netanyahu,N. S and Le Moigne,J. and de Berg,M.} } @article {15754, title = {Fast Robust Regression Algorithms for Problems with Toeplitz Structure}, journal = {Computational Statistics and Data Analysis}, volume = {52:2}, year = {2007}, month = {2007///}, pages = {1119 - 1131}, url = {doi:10.1016/j.csda.2007.05.008doi:10.1016/j.csda.2007.05.008}, author = {Mastronardi,Nicola and O{\textquoteright}Leary, Dianne P.} } @conference {15484, title = {Fault Detection Probability Analysis for Coverage-Based Test Suite Reduction}, booktitle = {Software Maintenance, 2007. ICSM 2007. IEEE International Conference on}, year = {2007}, month = {2007/10//}, pages = {335 - 344}, abstract = {Test suite reduction seeks to reduce the number of test cases in a test suite while retaining a high percentage of the original suite{\textquoteright}s fault detection effectiveness. Most approaches to this problem are based on eliminating test cases that are redundant relative to some coverage criterion. The effectiveness of applying various coverage criteria in test suite reduction is traditionally based on empirical comparison of two metrics derived from the full and reduced test suites and information about a set of known faults: (1) percentage size reduction and (2) percentage fault detection reduction, neither of which quantitatively takes test coverage data into account. Consequently, no existing measure expresses the likelihood of various coverage criteria to force coverage-based reduction to retain test cases that expose specific faults. In this paper, we develop and empirically evaluate, using a number of different coverage criteria, a new metric based on the "average expected probability of finding a fault" in a reduced test suite. Our results indicate that the average probability of detecting each fault shows promise for identifying coverage criteria that work well for test suite reduction.}, keywords = {coverage-based test suite reduction, fault detection probability analysis, Fault diagnosis, force coverage-based reduction, percentage fault detection reduction, percentage size reduction, program testing, software reliability, statistical analysis}, doi = {10.1109/ICSM.2007.4362646}, author = {McMaster,S. and Memon, Atif M.} } @conference {15435, title = {Faults{\textquoteright} context matters}, booktitle = {Fourth international workshop on Software quality assurance: in conjunction with the 6th ESEC/FSE joint meeting}, series = {SOQUA {\textquoteright}07}, year = {2007}, month = {2007///}, pages = {112 - 115}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {When choosing a testing technique, practitioners want to know which one will detect the faults that matter most to them in the programs that they plan to test. Do empirical evaluations of testing techniques provide this information? More often than not, they report how many faults in a carefully chosen "representative" sample the evaluated techniques detect. But the population of faults that such a sample would represent depends heavily on the faults{\textquoteright} context or environment---as does the cost of failing to detect those faults. If empirical studies are to provide information that a practitioner can apply outside the context of the study, they must characterize the faults studied in a way that translates across contexts. A testing technique{\textquoteright}s fault-detecting abilities could then be interpreted relative to the fault characterization. In this paper, we present a list of criteria that a fault characterization must meet in order to be fit for this task, and we evaluate several well-known fault characterizations against the criteria. Two families of characterizations are found to satisfy the criteria: those based on graph models of programs and those based on faults{\textquoteright} detection by testing techniques.}, isbn = {978-1-59593-724-7}, doi = {10.1145/1295074.1295096}, url = {http://doi.acm.org/10.1145/1295074.1295096}, author = {Strecker,Jaymie and Memon, Atif M.} } @article {18976, title = {Features generated for computational splice-site prediction correspond to functional elements}, journal = {BMC Bioinformatics}, volume = {8}, year = {2007}, month = {2007/10/24/}, pages = {410 - 410}, abstract = {Accurate selection of splice sites during the splicing of precursors to messenger RNA requires both relatively well-characterized signals at the splice sites and auxiliary signals in the adjacent exons and introns. We previously described a feature generation algorithm (FGA) that is capable of achieving high classification accuracy on human 3{\textquoteright} splice sites. In this paper, we extend the splice-site prediction to 5{\textquoteright} splice sites and explore the generated features for biologically meaningful splicing signals.}, isbn = {1471-2105}, doi = {10.1186/1471-2105-8-410}, url = {http://www.biomedcentral.com/1471-2105/8/410/abstract}, author = {Dogan,Rezarta I. and Getoor,Lise and Wilbur,W. John and Mount, Stephen M.} } @conference {18674, title = {Filesystem activity following a SSH compromise: an empirical study of file sequences}, series = {ICISC{\textquoteright}07}, year = {2007}, month = {2007///}, pages = {144 - 155}, publisher = {Springer-Verlag}, organization = {Springer-Verlag}, address = {Berlin, Heidelberg}, abstract = {A common method used to detect intrusions is monitoring filesystem data. Once a computer is compromised, an attacker may alter files, add new files or delete existing ones. Attackers may target any part of the filesystem, including metadata along with files (e.g., permissions, ownerships and inodes). In this paper, we will describe an empirical study that focused on computer attack activity after a SSH compromise. Statistical data will be provided on the number of files targeted and the associated activity (e.g., read, write, delete, ownership and rights). We extend this analysis to include the sequence of files and activities targeted. We focused on the most frequent sequences of consecutive files and activities, then explored in greater detail the longer sequences using state machines. Finally, we developed a simple state machine representing three major observed attack activities (i.e., reconnaissance, malware download and password change) with the number of transitions and time for each transition. The analysis of individual and sequences of files and activities will help to better understand attack activity patterns resulting in more efficient intrusion detection.}, keywords = {filesystem data, host intrusion detection systems, intrusion detection systems evaluation, SSH compromises}, isbn = {3-540-76787-8, 978-3-540-76787-9}, url = {http://dl.acm.org/citation.cfm?id=1775532.1775548}, author = {Molina,Jesus and Chorin,Xavier and Michel Cukier} } @inbook {18904, title = {Finding Most Probable Worlds of Probabilistic Logic Programs}, booktitle = {Scalable Uncertainty Management}, series = {Lecture Notes in Computer Science}, volume = {4772}, year = {2007}, month = {2007///}, pages = {45 - 59}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {Probabilistic logic programs have primarily studied the problem of entailment of probabilistic atoms. However, there are some interesting applications where we are interested in finding a possible world that is most probable. Our first result shows that the problem of computing such {\textquotedblright}maximally probable worlds{\textquotedblright} (MPW) is intractable. We subsequently show that we can often greatly reduce the size of the linear program used in past work (by Ng and Subrahmanian) and yet solve the problem exactly. However, the intractability results still make computational efficiency quite impossible. We therefore also develop several heuristics to solve the MPW problem and report extensive experimental results on the accuracy and efficiency of such heuristics.}, keywords = {Computer science}, isbn = {978-3-540-75407-7}, url = {http://www.springerlink.com/content/e4463p4rv4k01u93/abstract/}, author = {Khuller, Samir and Martinez,Vanina and Nau, Dana S. and Simari,Gerardo and Sliva,Amy and Subrahmanian,V.}, editor = {Prade,Henri and Subrahmanian,V.} } @article {15255, title = {Finding most probable worlds of probabilistic logic programs}, journal = {Scalable Uncertainty Management}, year = {2007}, month = {2007///}, pages = {45 - 59}, abstract = {Probabilistic logic programs have primarily studied the problem of entailment of probabilistic atoms. However, there are some interesting applications where we are interested in finding a possible world that is most probable. Our first result shows that the problem of computing such {\textquotedblright}maximally probable worlds{\textquotedblright} (MPW) is intractable. We subsequently show that we can often greatly reduce the size of the linear program used in past work (by Ng and Subrahmanian) and yet solve the problem exactly. However, the intractability results still make computational efficiency quite impossible. We therefore also develop several heuristics to solve the MPW problem and report extensive experimental results on the accuracy and efficiency of such heuristics.}, doi = {10.1007/978-3-540-75410-7_4}, author = {Khuller, Samir and Martinez,V. and Nau, Dana S. and Simari,G. and Sliva,A. and Subrahmanian,V.} } @article {15509, title = {Forming a Computer Science Center at the University of Maryland}, volume = {29}, year = {2007}, month = {2007///}, pages = {49 - 64}, abstract = {The use of and first courses on computers at Maryland began in the 1940s. The Computer Science Center beginnings are examined in the context of founding director Werner C. Rheinboldt{\textquoteright}s noteworthy accomplishments to develop a computation facility with research and educational components, supported by John Menard, assistant director. William F. Atchison, who replaced Rheinboldt as Center director, continued these accomplishments.}, keywords = {acm curriculum {\textquoteright}68, federal grants, first cs courses, first cs director, formation of cs center, graduate/undergraduate education programs, loss of computer autonomy, planning a cs building, research, software developments}, isbn = {1058-6180}, author = {Minker, Jack} } @article {14581, title = {GATA and Nkx factors synergistically regulate tissue-specific gene expression and development in vivo}, journal = {Development}, volume = {134}, year = {2007}, month = {2007/01/01/}, pages = {189 - 198}, abstract = {In vitro studies have suggested that members of the GATA and Nkx transcription factor families physically interact, and synergistically activate pulmonary epithelial- and cardiac-gene promoters. However, the relevance of this synergy has not been demonstrated in vivo. We show that Gata6-Titf1 (Gata6-Nkx2.1) double heterozygous (G6-Nkx DH) embryos and mice have severe defects in pulmonary epithelial differentiation and distal airway development, as well as reduced phospholipid production. The defects in G6-Nkx DH embryos and mice are similar to those observed in human neonates with respiratory distress syndromes, including bronchopulmonary dysplasia, and differential gene expression analysis reveals essential developmental pathways requiring synergistic regulation by both Gata6 and Titf1 (Nkx2.1). These studies indicate that Gata6 and Nkx2.1 act in a synergistic manner to direct pulmonary epithelial differentiation and development in vivo, providing direct evidence that interactions between these two transcription factor families are crucial for the development of the tissues in which they are co-expressed.}, doi = {10.1242/dev.02720}, url = {http://dev.biologists.org/content/134/1/189.abstract}, author = {Zhang,Yuzhen and Rath,Nibedita and Hannenhalli, Sridhar and Wang,Zhishan and Cappola,Thomas and Kimura,Shioko and Atochina-Vasserman,Elena and Lu,Min Min and Beers,Michael F. and Morrisey,Edward E.} } @conference {12580, title = {Gaussian Approximations for Energy-Based Detection and Localization in Sensor Networks}, booktitle = {Statistical Signal Processing, 2007. SSP {\textquoteright}07. IEEE/SP 14th Workshop on}, year = {2007}, month = {2007/08//}, pages = {655 - 659}, abstract = {Energy-based detection and estimation are crucial in sensor networks for sensor localization, target tracking, etc. In this paper, we present novel Gaussian approximations that are applicable to general energy-based source detection and localization problems in sensor networks. Using our approximations, we derive receiver operating characteristics curves and Cramer-Rao bounds, and we provide a factorized variational Bayes approximation to the location and source energy posterior for centralized or decentralized estimation. When the source signal and the sensor noise have uncorrelated Gaussian distributions, we demonstrate that the envelope of the sensor output can be accurately modeled with a multiplicative Gaussian noise model, which results in smaller estimation biases than the other Gaussian models typically used in the literature. We also prove that additive Gaussian noise models result in negatively biased speed estimates under the same signal assumptions, which can be circumvented by the proposed approximations.}, doi = {10.1109/SSP.2007.4301340}, author = {Cevher,Volkan and Chellapa, Rama and McClellan,James H.} } @conference {19637, title = {Geometry and Charge State of Mixed-Ligand Au13 Nanoclusters}, booktitle = {X-RAY ABSORPTION FINE STRUCTURE - XAFS13: 13th International Conference}, volume = {882}, year = {2007}, month = {2007/02/02/}, pages = {749 - 751}, publisher = {AIP Publishing}, organization = {AIP Publishing}, abstract = {The integration of synthetic, experimental and theoretical tools into a self-consistent data analysis methodology allowed us to develop unique new levels of detail in nanoparticle characterization. We describe our methods using an example of Au 13 monolayer-protected clusters (MPCs), synthesized by ligand exchange methods. The combination of atom counting methods of scanning transmission electron microscopy and Au L3-edge EXAFS allowed us to characterize these clusters as icosahedral, with surface strain reduced from 5\% (as in ideal, regular icosahedra) to 3\%, due to the interaction with ligands. Charge transfer from Au to the thiol and phosphine ligands was evidenced by S and P K-edge XANES. A comparison of total energies of bare clusters of different geometries was performed by equivalent crystal theory calculations.}, keywords = {Atom surface interactions, Charge transfer, Data analysis, Extended X-ray absorption fine structure spectroscopy, Gold, nanoparticles, Scanning transmission electron microscopy, Surface strains, Total energy calculations, X-ray absorption near edge structure}, url = {http://scitation.aip.org/content/aip/proceeding/aipcp/10.1063/1.2644652}, author = {Frenkel, A. I. and Menard, L. D. and Northrup, P. and Rodriguez, J. A. and Zypman, F. and Dana Dachman-Soled and Gao, S.-P. and Xu, H. and Yang, J. C. and Nuzzo, R. G.} } @article {13002, title = {Grid Services Base Library: A high-level, procedural application programming interface for writing Globus-based Grid services}, journal = {Future Generation Comp Syst}, volume = {23}, year = {2007}, month = {2007///}, pages = {517 - 522}, abstract = {The Grid Services Base Library (GSBL) is a procedural application programming interface (API) that abstracts many of the high-level functions performed by Globus Grid services, thus dramatically lowering the barriers to writing Grid services. The library has been extensively tested and used for computational biology research in a Globus Toolkit-based Grid system, in which no fewer than twenty Grid services written with this API are deployed.}, author = {Bazinet,A. L and Myers,D. S and Fuetsch,J. and Cummings, Michael P.} } @conference {18573, title = {Holding the Internet Accountable}, booktitle = {Proc. 6th ACM Workshop on Hot Topics in Networks (Hotnets-VI)}, year = {2007}, month = {2007/11/01/}, abstract = {Today{\textquoteright}s IP network layer provides little to no protection against misconfiguration or malice. Despite some progress in improving the robustness and security of the IP layer, misconfigurations and attacks still occur frequently. We show how a network layer that provides accountability, i.e., the ability to associate each action with the responsible entity, provides a firm foundation for defenses against misconfiguration and malice. We present the design of a network layer that incorporates accountability called AIP (Accountable Internet Protocol) and show how its features{\textemdash}notably, its use of self-certifying addresses{\textemdash} can improve both source accountability (the ability to trace actions to a particular end host and stop that host from misbehaving) and control-plane accountability (the ability to pinpoint and prevent attacks on routing).}, url = {http://repository.cmu.edu/compsci/66}, author = {Andersen,David and Balakrishnan,Hari and Feamster, Nick and Koponen,Teemu and Moon,Daekyong and Shenker,Scott} } @conference {15986, title = {Hood College, Master of Business Administration, 2005 Hood College, Master of Science (Computer Science), 2001 Hood College, Bachelor of Science (Computer Science), 1998 Frederick Community College, Associate in Arts (Business Administration), 1993}, booktitle = {Proceedings of the Workshop on Metareasoning in Agent-Based Systems}, year = {2007}, month = {2007///}, author = {Anderson,M. L and Schmill,M. and Oates,T. and Perlis, Don and Josyula,D. and Wright,D. and Human,S. W.T.D.N and Metacognition,L. and Fults,S. and Josyula,D. P} } @article {13151, title = {Human activity understanding using visibility context}, journal = {IEEE/RSJ IROS Workshop: From sensors to human spatial concepts (FS2HSC)}, year = {2007}, month = {2007///}, abstract = {Visibility in architectural layouts affects humannavigation, so a suitable representation of visibility context is useful in understanding human activity. Motivated by studies of spatial behavior, we use a set of features from visibility analysis to represent spatial context in the interpretation of human activity. An agent{\textquoteright}s goal, belief about the world, trajectory and visible layout are considered to be random variables that evolve with time during the agent{\textquoteright}s movement, and are modeled in a Bayesian framework. We design a search-based task in a sprite-world, and compare the results of our framework to those of human subject experiments. Our findings confirm that knowledge of spatial layout improves human interpretations of the trajectories (implying that visibility context is useful in this task). Since our framework demonstrates performance close to that of human subjects with knowledge of spatial layout, our findings confirm that our model makes adequate use of visibility context. In addition, the representation we use for visibility context allows our model to generalize well when presented with new scenes. }, author = {Morariu,V.I. and Prasad,V. S.N and Davis, Larry S.} } @article {12590, title = {Hyperstereo algorithms for the perception of terrain drop-offs}, journal = {Proceedings of SPIE}, volume = {6557}, year = {2007}, month = {2007/04/27/}, pages = {65570L-65570L-10 - 65570L-65570L-10}, abstract = {The timely detection of terrain drop-offs is critical for safe and efficient off-road mobility, whether with human drivers or with terrain navigation systems that use autonomous machine-vision. In this paper, we propose a joint tracking and detection machine-vision approach for accurate and efficient terrain drop-off detection and localization. We formulate the problem using a hyperstereo camera system and build an elevation map using the range map obtained from a stereo algorithm. A terrain drop-off is then detected with the use of optimal drop-off detection filters applied to the range map. For more robust results, a method based on multi-frame fusion of terrain drop-off evidence is proposed. Also presented is a fast, direct method that does not employ stereo disparity mapping. We compared our algorithm{\textquoteright}s detection of terrain drop-offs with time-code data from human observers viewing the same video clips in stereoscopic 3D. The algorithm detected terrain drop-offs an average of 9 seconds sooner, or 12m farther, than the human observers. This suggests that passive image-based hyperstereo machine-vision may be useful as an early warning system for off-road mobility.}, isbn = {0277786X}, doi = {doi:10.1117/12.721066}, url = {http://spiedigitallibrary.org/proceedings/resource/2/psisdg/6557/1/65570L_1?isAuthorized=no}, author = {Mohananchettiar,Arunkumar and Cevher,Volkan and CuQlock-Knopp,Grayson and Chellapa, Rama and Merritt,John} } @article {14285, title = {Inferring aliasing and encapsulation properties for Java}, journal = {ACM SIGPLAN Notices}, volume = {42}, year = {2007}, month = {2007///}, pages = {423 - 440}, author = {Ma,K.K. and Foster, Jeffrey S.} } @conference {13443, title = {Interactive visual clustering}, booktitle = {Proceedings of the 12th international conference on Intelligent user interfaces}, series = {IUI {\textquoteright}07}, year = {2007}, month = {2007///}, pages = {361 - 364}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Interactive Visual Clustering (IVC) is a novel method that allows a user to explore relational data sets interactively, in order to produce a clustering that satisfies their objectives. IVC combines spring-embedded graph layout with user interaction and constrained clustering. Experimental results on several synthetic and real-world data sets show that IVC yields better clustering performance than alternative methods.}, keywords = {clustering, constraints, interaction}, isbn = {1-59593-481-2}, doi = {10.1145/1216295.1216367}, url = {http://doi.acm.org/10.1145/1216295.1216367}, author = {desJardins, Marie and MacGlashan,James and Ferraioli,Julia} } @article {12575, title = {Jmin-image based color-texture segmentation using watershed and hierarchical clustering}, journal = {Proceedings of the 8th International Symposium on Mathematical Morphology}, volume = {2}, year = {2007}, month = {2007/10//undefin}, pages = {35 - 36}, author = {Santos, T.T. and Morimoto, CH and Chellapa, Rama} } @conference {12595, title = {Joint Acoustic-Video Fingerprinting of Vehicles, Part I}, booktitle = {Acoustics, Speech and Signal Processing, 2007. ICASSP 2007. IEEE International Conference on}, volume = {2}, year = {2007}, month = {2007/04//}, pages = {II-745 -II-748 - II-745 -II-748}, abstract = {We address vehicle classification and measurement problems using acoustic and video sensors. In this paper, we show how to estimate a vehicle{\textquoteright}s speed, width, and length by jointly estimating its acoustic wave-pattern using a single passive sensor that records the vehicle{\textquoteright}s drive-by noise. The acoustic wave-pattern is approximated using three envelope shape (ES) components, which approximate the shape of the received signal{\textquoteright}s power envelope. We incorporate the parameters of the ES components along with the estimates of the vehicle engine RPM and number of cylinders to create a vehicle profile vector that forms an intuitive discriminatory feature space. In the companion paper, we discuss vehicle classification and mensuration based on silhouette extraction and wheel detection, using a video sensor. Vehicle speed estimation and classification results are provided using field data.}, keywords = {acoustic, acoustic-video, components;joint, detection;acoustic, estimation;video, fingerprinting;passive, processing;, processing;acoustic, sensor;vehicle, sensors;acoustic, sensors;wheel, SHAPE, signal, speed, transducers;video, wave-pattern;envelope}, doi = {10.1109/ICASSP.2007.366343}, author = {Cevher, V. and Chellapa, Rama and McClellan, J.H.} } @article {13448, title = {Learning and visualizing user preferences over sets}, journal = {American Association for Artificial Intelligence (AAAI)}, year = {2007}, month = {2007///}, abstract = {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. }, author = {Wagstaff,K. and desJardins, Marie and Eaton,E. and Montminy,J.} } @conference {14453, title = {Leveraging data and structure in ontology integration}, booktitle = {Proceedings of the 2007 ACM SIGMOD international conference on Management of data}, series = {SIGMOD {\textquoteright}07}, year = {2007}, month = {2007///}, pages = {449 - 460}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {There is a great deal of research on ontology integration which makes use of rich logical constraints to reason about the structural and logical alignment of ontologies. There is also considerable work on matching data instances from heterogeneous schema or ontologies. However, little work exploits the fact that ontologies include both data and structure. We aim to close this gap by presenting a new algorithm (ILIADS) that tightly integrates both data matching and logical reasoning to achieve better matching of ontologies. We evaluate our algorithm on a set of 30 pairs of OWL Lite ontologies with the schema and data matchings found by human reviewers. We compare against two systems - the ontology matching tool FCA-merge [28] and the schema matching tool COMA++ [1]. ILIADS shows an average improvement of 25\% in quality over FCA-merge and a 11\% improvement in recall over COMA++.}, keywords = {Data integration, logical inference, ontology alignment, schema mapping, statistical inference}, isbn = {978-1-59593-686-8}, doi = {10.1145/1247480.1247531}, url = {http://doi.acm.org/10.1145/1247480.1247531}, author = {Udrea,Octavian and Getoor, Lise and Miller,Ren{\'e}e J.} } @conference {12256, title = {Measurement and analysis of online social networks}, booktitle = {Proceedings of the 7th ACM SIGCOMM conference on Internet measurement}, series = {IMC {\textquoteright}07}, year = {2007}, month = {2007///}, pages = {29 - 42}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Online social networking sites like Orkut, YouTube, and Flickr are among the most popular sites on the Internet. Users of these sites form a social network, which provides a powerful means of sharing, organizing, and finding content and contacts. The popularity of these sites provides an opportunity to study the characteristics of online social network graphs at large scale. Understanding these graphs is important, both to improve current systems and to design new applications of online social networks. This paper presents a large-scale measurement study and analysis of the structure of multiple online social networks. We examine data gathered from four popular online social networks: Flickr, YouTube, LiveJournal, and Orkut. We crawled the publicly accessible user links on each site, obtaining a large portion of each social network{\textquoteright}s graph. Our data set contains over 11.3 million users and 328 million links. We believe that this is the first study to examine multiple online social networks at scale. Our results confirm the power-law, small-world, and scale-free properties of online social networks. We observe that the indegree of user nodes tends to match the outdegree; that the networks contain a densely connected core of high-degree nodes; and that this core links small groups of strongly clustered, low-degree nodes at the fringes of the network. Finally, we discuss the implications of these structural properties for the design of social network based systems.}, keywords = {analysis, measurement, social networks}, isbn = {978-1-59593-908-1}, doi = {10.1145/1298306.1298311}, url = {http://doi.acm.org/10.1145/1298306.1298311}, author = {Mislove,Alan and Marcon,Massimiliano and Gummadi,Krishna P. and Druschel,Peter and Bhattacharjee, Bobby} } @conference {13828, title = {Measuring variability in sentence ordering for news summarization}, booktitle = {Proceedings of the Eleventh European Workshop on Natural Language Generation}, series = {ENLG {\textquoteright}07}, year = {2007}, month = {2007///}, pages = {81 - 88}, publisher = {Association for Computational Linguistics}, organization = {Association for Computational Linguistics}, address = {Stroudsburg, PA, USA}, abstract = {The issue of sentence ordering is an important one for natural language tasks such as multi-document summarization, yet there has not been a quantitative exploration of the range of acceptable sentence orderings for short texts. We present results of a sentence reordering experiment with three experimental conditions. Our findings indicate a very high degree of variability in the orderings that the eighteen subjects produce. In addition, the variability of reorderings is significantly greater when the initial ordering seen by subjects is different from the original summary. We conclude that evaluation of sentence ordering should use multiple reference orderings. Our evaluation presents several metrics that might prove useful in assessing against multiple references. We conclude with a deeper set of questions: (a) what sorts of independent assessments of quality of the different reference orderings could be made and (b) whether a large enough test set would obviate the need for such independent means of quality assessment.}, url = {http://dl.acm.org/citation.cfm?id=1610163.1610177}, author = {Madnani,Nitin and Passonneau,Rebecca and Ayan,Necip Fazil and Conroy,John M. and Dorr, Bonnie J and Klavans,Judith L. and O{\textquoteright}Leary, Dianne P. and Schlesinger,Judith D.} } @article {12596, title = {Method of three-dimensional object reconstruction from a video sequence using a generic model}, volume = {10/644,817}, year = {2007}, month = {2007/02/27/}, abstract = {In a novel method of 3D modeling of an object from a video sequence using an SfM algorithm and a generic object model, the generic model is incorporated after the SfM algorithm generates a 3D estimate of the object model purely and directly from the input video sequence. An optimization framework provides for comparison of the local trends of the 3D estimate and the generic model so that the errors in the 3D estimate are corrected. The 3D estimate is obtained by fusing intermediate 3D reconstructions of pairs of frames of the video sequence after computing the uncertainty of the two frame solutions. The quality of the fusion algorithm is tracked using a rate-distortion function. In order to combine the generic model with the 3D estimate, an energy function minimization procedure is applied to the 3D estimate. The optimization is performed using a Metropolis-Hasting sampling strategy.}, url = {http://www.google.com/patents?id=4At_AAAAEBAJ}, author = {Chellapa, Rama and Chowdhury,Amit K. Roy and Srinivasan,Sridhar}, editor = {University of Maryland} } @conference {18586, title = {MobCast: Overlay Architecture for Seamless IP Mobility using Scalable Anycast Proxies}, booktitle = {Wireless Communications and Networking Conference, 2007.WCNC 2007. IEEE}, year = {2007}, month = {2007/03//}, pages = {3872 - 3876}, abstract = {We propose a routing overlay system, MobCast, for simple and efficient routing to mobile hosts. Mobcast nodes advertise the same address space at each proxy location, and each mobile host is assigned a "universal" IP address from this address space, so packets sent to a mobile host{\textquoteright}s universal IP address automatically go to the nearest proxy on the overlay. The overlay then delivers the packets to the mobile host. Our architecture enables seamless mobility for both micro and macro mobility. While our initial design is not as mature as Mobile IP, it shows great promise to solve the traditional problems of ingress routing, firewalls, NATs, and rapid mobility with much lower complexity. We present our design as a scalable and deployable alternative to mobile IP. In this paper, we focus on describing the MobCast system architecture. We form our arguments for scalability, handoff-speed, and simplicity, and give our initial results for scalability. We postpone a detailed discussion of MobCast{\textquoteright}s security model for future work.}, keywords = {address space, handoff-speed, IP networks, MobCast, mobile hosts, mobile radio, overlay architecture, proxy location, routing overlay system, scalable anycast proxies, seamless IP mobility, telecommunication network routing, universal IP address}, doi = {10.1109/WCNC.2007.708}, author = {Lee,C.P. and Attrey,K. and Caballero,C. and Feamster, Nick and Mihail,M. and Copeland,J.A.} } @article {13834, title = {Multiple alternative sentence compressions for automatic text summarization}, journal = {Proceedings of DUC}, year = {2007}, month = {2007///}, abstract = {We perform multi-document summariza-tion by generating compressed versions of source sentences as summary candi- dates and using weighted features of these candidates to construct summaries. We combine a parse-and-trim approach with a novel technique for producing multiple alternative compressions for source sen- tences. In addition, we use a novel method for tuning the feature weights that maxi- mizes the change in the ROUGE-2 score (∆ROUGE) between the already existing summary state and the new state that re- sults from the addition of the candidate under consideration. We also describe ex- periments using a new paraphrase-based feature for redundancy checking. Finally, we present the results of our DUC2007 submissions and some ideas for future work. }, author = {Madnani,N. and Zajic, David and Dorr, Bonnie J and Ayan,N.F. and Jimmy Lin} } @article {13316, title = {Multiresolution Terrain Processing and Visualization with VARIANT}, journal = {Department of Computer and Information Sciences, University of Genova, Via Dodecaneso}, volume = {35}, year = {2007}, month = {2007///}, pages = {16146 - 16146}, abstract = {We present VARIANT (VAriable Resolution Interactive ANalysis of Terrain), a system forprocessing and visualizing terrains represented through Triangulated Irregular Networks (TINs) at multiple resolutions. Multiresolution refers to the possibility of dynamically varying the density of the TIN, and is used to enhance speed of computation while guaranteeing the accuracy needed by operations. VARIANT directly supports basic queries as well as some high-level operations, and it can be enriched with many other functionalities. It is built on the Multi- Triangulation (MT) Library, an extensible library for multiresolution geometric modeling. }, author = {De Floriani, Leila and Magillo,P.} } @conference {13312, title = {Multi-scale dual morse complexes for representing terrain morphology}, booktitle = {Proceedings of the 15th annual ACM international symposium on Advances in geographic information systems}, series = {GIS {\textquoteright}07}, year = {2007}, month = {2007///}, pages = {29:1{\textendash}29:8 - 29:1{\textendash}29:8}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {We propose a new multi-scale terrain model, based on a hierarchical representation for the morphology of a terrain. The basis of our morphological model is a dual Morse decomposition of the terrain, composed by the stable and unstable manifolds defined by its critical points and its integral lines. We propose a two-level representation of the dual Morse decomposition and we define new simplification operators for the Morse decomposition which act on such representation. Based on these operators, we define a hierarchical morphology-based representation, that we call a Multi-scale Morse Complex (MMC). Results from our implementation of the MMC are presented.}, keywords = {Morphology, multi-scale representations, terrain modeling}, isbn = {978-1-59593-914-2}, doi = {10.1145/1341012.1341050}, url = {http://doi.acm.org/10.1145/1341012.1341050}, author = {Danovaro,Emanuele and De Floriani, Leila and Vitali,Maria and Magillo,Paola} } @article {14074, title = {New Trypanosoma cruzi Repeated Element That Shows Site Specificity for Insertion}, journal = {Eukaryotic Cell}, volume = {6}, year = {2007}, month = {2007/07/01/}, pages = {1228 - 1238}, abstract = {A new family of site-specific repeated elements identified in Trypanosoma cruzi, which we named TcTREZO, is described here. TcTREZO appears to be a composite repeated element, since three subregions may be defined within it on the basis of sequence similarities with other T. cruzi sequences. Analysis of the distribution of TcTREZO in the genome clearly indicates that it displays site specificity for insertion. Most TcTREZO elements are flanked by conserved sequences. There is a highly conserved 68-bp sequence at the 5{\textquoteright} end of the element and a sequence domain of [~]500 bp without a well-defined borderline at the 3{\textquoteright} end. Northern blot hybridization and reverse transcriptase PCR analyses showed that TcTREZO transcripts are expressed as oligo(A)-terminated transcripts whose length corresponds to the unit size of the element (1.6 kb). Transcripts of [~]0.2 kb derived from a small part of TcTREZO are also detected in steady-state RNA. TcTREZO transcripts are unspliced and not translated. The copy number of TcTREZO sequences was estimated to be [~]173 copies per haploid genome. TcTREZO appears to have been assembled by insertions of sequences into a progenitor element. Once associated with each other, these subunits were amplified as a new transposable element. TcTREZO shows site specificity for insertion, suggesting that a sequence-specific endonuclease could be responsible for its insertion at a unique site.}, doi = {

10.1128/EC.00036-07

}, url = {http://ec.asm.org/cgi/content/abstract/6/7/1228}, author = {Souza,Renata T. and Santos,Marcia R. M. and Lima,Fabio M. and El-Sayed, Najib M. and Myler,Peter J. and Ruiz,Jeronimo C. and da Silveira,Jose Franco} } @article {15392, title = {Numerical Analysis of Nanoparticle-Structured Plasmon Waveguides of Light}, journal = {Magnetics, IEEE Transactions on}, volume = {43}, year = {2007}, month = {2007/04//}, pages = {1685 - 1688}, abstract = {A novel numerical approach to the analysis of nanoparticle-structured plasmon waveguides of light is presented. The extinct cross-sections and resonance (propagation) frequencies are computed for various geometries of these waveguides and compared with available experimental data. The computational results for resonance frequencies corresponding to different light polarizations are reported as well}, keywords = {analysis;optical, analysis;resonant, cross-sections;light, Frequency, frequency;light, nanoparticle-structured, plasmon, polarisation;light, polarization;numerical, propagation;numerical, waveguides;light, waveguides;plasmonics;plasmons;}, isbn = {0018-9464}, doi = {10.1109/TMAG.2006.892270}, author = {Mayergoyz, Issak D and Zhang,Zhenyu} } @article {15394, title = {Numerical Analysis of Plasmon Resonances in Metallic Nanoshells}, journal = {Magnetics, IEEE Transactions on}, volume = {43}, year = {2007}, month = {2007/04//}, pages = {1689 - 1692}, abstract = {A novel boundary integral equation-based technique for the direct computations of resonance frequencies for plasmon resonances in metallic nanoshells is presented. In this technique, the calculation of resonance frequencies is reduced to a generalized eigenvalue problem. Numerical results that demonstrate fairly good agreement with theoretical results and available experimental data are reported}, keywords = {analysis;plasmon, and, boundary, eigenfunctions;nanostructured, equation-based, equations;eigenvalues, frequency;boundary, integral, materials;nanotechnology;plasmons;, nanoshells;numerical, problems;metallic, resonance;resonant, techniques;eigenvalue}, isbn = {0018-9464}, doi = {10.1109/TMAG.2006.892271}, author = {Mayergoyz, Issak D and Zhang,Zhenyu} } @article {13993, title = {Numerical Analysis of Plasmon Resonances in Nanoparticles Based on Fast Multipole Method}, journal = {Magnetics, IEEE Transactions on}, volume = {43}, year = {2007}, month = {2007/04//}, pages = {1465 - 1468}, abstract = {A novel technique for the numerical analysis of plasmon resonances by using the fast multipole method (FMM) is presented. This approach is based on the solution of the eigenvalue problem for boundary integral equations, which can be naturally implemented by using the FMM. Numerical examples that highlight the efficiency of the fast multipole implementation are reported}, keywords = {analysis;boundary, and, boundary, eigenfunctions;nanoparticles;plasmons;, equations;eigenvalue, equations;eigenvalues, integral, method;nanoparticle, multipole, plasmon, problems;fast, resonance;numerical}, isbn = {0018-9464}, doi = {10.1109/TMAG.2007.891413}, author = {Zhang,Zhenyu and Mayergoyz, Issak D and Gumerov, Nail A. and Duraiswami, Ramani} } @article {15652, title = {Optimal expected-case planar point location}, journal = {SIAM Journal on Computing}, volume = {37}, year = {2007}, month = {2007///}, pages = {584 - 584}, abstract = {Point location is the problem of preprocessing a planar polygonal subdivision S of size ninto a data structure in order to determine efficiently the cell of the subdivision that contains a given query point. We consider this problem from the perspective of expected query time. We are given the probabilities pz that the query point lies within each cell z ∈ S. The entropy H of the resulting discrete probability distribution is the dominant term in the lower bound on the expected-case query time. We show that it is possible to achieve query time H + O( √ H + 1) with space O(n), which is optimal up to lower order terms in the query time. We extend this result to subdivisions with convex cells, assuming a uniform query distribution within each cell. In order to achieve space efficiency, we introduce the concept of entropy-preserving cuttings. }, author = {Arya,S. and Malamatos,T. and Mount, Dave and Wong,K.C.} } @article {15338, title = {Optimization of nonlinear error for weighted essentially non-oscillatory methods in direct numerical simulations of compressible turbulence}, journal = {Journal of Computational Physics}, volume = {223}, year = {2007}, month = {2007///}, pages = {384 - 397}, abstract = {Weighted essentially non-oscillatory (WENO) methods have been developed to simultaneously provide robust shock-capturing in compressible fluid flow and avoid excessive damping of fine-scale flow features such as turbulence. Under certain conditions in compressible turbulence, however, numerical dissipation remains unacceptably high even after optimization of the linear component that dominates in smooth regions. We therefore construct and evaluate WENO schemes that also reduce dissipation due to one source of nonlinear error: the smoothness measurement that governs the application of stencil adaptation away from the linear optimal stencil. Direct numerical simulations (DNS) include a one-dimensional Euler solution and three-dimensional compressible isotropic turbulence. We find that the smoothness measurement modifications that we call the {\textquotedblleft}relative smoothness limiter{\textquotedblright} and the {\textquotedblleft}relative total variation limiter{\textquotedblright} each significantly enhance thez grid-convergence properties of WENO schemes while generating, respectively, small and moderate additional computational expense. Moreover, we observe these techniques to be broadly effective regardless of flow configuration.}, keywords = {Compressible turbulence, direct numerical simulation, Limiters, Linear dissipation, Non-linear dissipation, Numerical dissipation, Shock capturing}, isbn = {0021-9991}, doi = {10.1016/j.jcp.2006.09.010}, url = {http://www.sciencedirect.com/science/article/pii/S0021999106004426}, author = {Taylor,Ellen M. and Wu,Minwei and Martin, M.P} } @article {18498, title = {Path splicing: Reliable connectivity with rapid recovery}, journal = {ACM SIGCOMM HotNets VI}, year = {2007}, month = {2007///}, abstract = {We present path splicing, a primitive that constructs net-work paths from multiple independent routing processes that run over a single network topology. The routing processes compute distinct routing trees using randomly perturbed link weights. A few additional bits in packet headers give end systems access to a large number of paths. By changing these bits, nodes can redirect traffic without detailed knowl- edge of network paths. Assembling paths by {\textquotedblleft}splicing{\textquotedblright} segments can yield up to an exponential improvement in path diversity for only a linear increase in storage and mes- sage complexity. We present randomized approaches for slice construction and failure recovery that achieve near- optimal performance and are extremely simple to config- ure. Our evaluation of path splicing on realistic ISP topolo- gies demonstrates a dramatic increase in reliability that ap- proaches the best possible using only a small number of slices and for only a small increase in latency. }, author = {Motiwala,M. and Feamster, Nick and Vempala,S.} } @conference {18516, title = {Path splicing with network slicing}, booktitle = {Proc. ACM SIGCOMM Hot-Nets}, year = {2007}, month = {2007///}, author = {Feamster, Nick and Motiwala,M. and Vempala,S.} } @article {15602, title = {Pointerless implementation of hierarchical simplicial meshes and efficient neighbor finding in arbitrary dimensions}, journal = {International Journal of Computational Geometry and Applications}, volume = {17}, year = {2007}, month = {2007///}, pages = {595 - 631}, abstract = {We describe a pointerless representation of hierarchical regular simplicial meshes, basedon a bisection approach proposed by Maubach. We introduce a new labeling scheme, called an LPT code, which uniquely encodes the geometry of each simplex of the hi- erarchy, and we present rules to compute the neighbors of a given simplex efficiently through the use of these codes. In addition, we show how to traverse the associated tree and how to answer point location and interpolation queries. Our system works in arbitrary dimensions. }, author = {Atalay,F. B and Mount, Dave and Mitchell,J.} } @conference {19040, title = {Portcullis: protecting connection setup from denial-of-capability attacks}, series = {SIGCOMM {\textquoteright}07}, year = {2007}, month = {2007}, pages = {289 - 300}, publisher = {ACM}, organization = {ACM}, abstract = {Systems using capabilities to provide preferential service to selected flows have been proposed as a defense against large-scale network denial-of-service attacks. While these systems offer strong protection for established network flows, the Denial-of-Capability (DoC) attack, which prevents new capability-setup packets from reaching the destination, limits the value of these systems. Portcullis mitigates DoC attacks by allocating scarce link bandwidth for connection establishment packets based on per-computation fairness. We prove that a legitimate sender can establish a capability with high probability regardless of an attacker{\textquoteright}s resources or strategy and that no system can improve on our guarantee. We simulate full and partial deployments of Portcullis on an Internet-scale topology to confirm our theoretical results and demonstrate the substantial benefits of using per-computation fairness.}, keywords = {network capability, per-computation fairness}, isbn = {978-1-59593-713-1}, url = {http://doi.acm.org/10.1145/1282380.1282413}, author = {Parno, Bryan and Wendlandt, Dan and Elaine Shi and Perrig, Adrian and Maggs, Bruce and Hu, Yih-Chun} } @article {14561, title = {Power optimization in fault-tolerant topology control algorithms for wireless multi-hop networks}, journal = {IEEE/ACM Transactions on Networking (TON)}, volume = {15}, year = {2007}, month = {2007///}, pages = {1345 - 1358}, author = {Hajiaghayi, Mohammad T. and Immorlica,N. and Mirrokni,V. S} } @article {15572, title = {A practical approximation algorithm for the LMS line estimator}, journal = {Computational Statistics \& Data Analysis}, volume = {51}, year = {2007}, month = {2007/02/01/}, pages = {2461 - 2486}, abstract = {The problem of fitting a straight line to a finite collection of points in the plane is an important problem in statistical estimation. Robust estimators are widely used because of their lack of sensitivity to outlying data points. The least median-of-squares (LMS) regression line estimator is among the best known robust estimators. Given a set of n points in the plane, it is defined to be the line that minimizes the median squared residual or, more generally, the line that minimizes the residual of any given quantile q, where 0 \< q ⩽ 1 . This problem is equivalent to finding the strip defined by two parallel lines of minimum vertical separation that encloses at least half of the points.The best known exact algorithm for this problem runs in O ( n 2 ) time. We consider two types of approximations, a residual approximation, which approximates the vertical height of the strip to within a given error bound ε r ⩾ 0 , and a quantile approximation, which approximates the fraction of points that lie within the strip to within a given error bound ε q ⩾ 0 . We present two randomized approximation algorithms for the LMS line estimator. The first is a conceptually simple quantile approximation algorithm, which given fixed q and ε q \> 0 runs in O ( n log n ) time. The second is a practical algorithm, which can solve both types of approximation problems or be used as an exact algorithm. We prove that when used as a quantile approximation, this algorithm{\textquoteright}s expected running time is O ( n log 2 n ) . We present empirical evidence that the latter algorithm is quite efficient for a wide variety of input distributions, even when used as an exact algorithm. }, keywords = {Approximation algorithms, least median-of-squares regression, line arrangements, line fitting, randomized algorithms, robust estimation}, isbn = {0167-9473}, doi = {10.1016/j.csda.2006.08.033}, url = {http://www.sciencedirect.com/science/article/pii/S0167947306002921}, author = {Mount, Dave and Netanyahu,Nathan S. and Romanik,Kathleen and Silverman,Ruth and Wu,Angela Y.} } @article {17644, title = {Provable algorithms for joint optimization of transport, routing and MAC layers in wireless ad hoc networks}, journal = {Proc. DialM-POMC Workshop on Foundations of Mobile Computing}, year = {2007}, month = {2007///}, author = {Kumar,V. S.A and Marathe,M. V and Parthasarathy,S. and Srinivasan, Aravind} } @conference {19592, title = {Relating Complexity and Precision in Control Flow Analysis}, booktitle = {ICFP {\textquoteright}07 Proceedings of the 12th ACM SIGPLAN International Conference on Functional Programming}, series = {ICFP {\textquoteright}07}, year = {2007}, month = {2007///}, pages = {85 - 96}, publisher = {ACM}, organization = {ACM}, abstract = {We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies related decision problems, quite apart from any algorithms that may implement their solutions. We identify a simple decision problem answered by this analysis and prove that in the 0CFA case, the problem is complete for polynomial time. The proof is based on a nonstandard, symmetric implementation of Boolean logic within multiplicative linear logic (MLL). We also identify a simpler version of 0CFA related to η-expansion, and prove that it is complete for logarithmic space, using arguments based on computing paths and permutations. For any fixed k>0, it is known that kCFA (and the analogous decision problem) can be computed in time exponential in the program size. For k=1, we show that the decision problem is NP-hard, and sketch why this remains true for larger fixed values of k. The proof technique depends on using the approximation of CFA as an essentially nondeterministic computing mechanism, as distinct from the exactness of normalization. When k=n, so that the "depth" of the control flow analysis grows linearly in the program length, we show that the decision problem is complete for exponential time. In addition, we sketch how the analysis presented here may be extended naturally to languages with control operators. All of the insights presented give clear examples of how straightforward observations about linearity, and linear logic, may in turn be used to give a greater understanding of functional programming and program analysis.}, keywords = {complexity, continuation, control flow analysis, eta expansion, geometry of interaction, linear logic, normalization, proofnet, static analysis}, isbn = {978-1-59593-815-2}, url = {http://doi.acm.org/10.1145/1291151.1291166}, author = {David Van Horn and Mairson, Harry G.} } @article {15476, title = {Reliable Effects Screening: A Distributed Continuous Quality Assurance Process for Monitoring Performance Degradation in Evolving Software Systems}, journal = {Software Engineering, IEEE Transactions on}, volume = {33}, year = {2007}, month = {2007/02//}, pages = {124 - 141}, abstract = {Developers of highly configurable performance-intensive software systems often use in-house performance-oriented "regression testing" to ensure that their modifications do not adversely affect their software{\textquoteright}s performance across its large configuration space. Unfortunately, time and resource constraints can limit in-house testing to a relatively small number of possible configurations, followed by unreliable extrapolation from these results to the entire configuration space. As a result, many performance bottlenecks escape detection until systems are fielded. In our earlier work, we improved the situation outlined above by developing an initial quality assurance process called "main effects screening". This process 1) executes formally designed experiments to identify an appropriate subset of configurations on which to base the performance-oriented regression testing, 2) executes benchmarks on this subset whenever the software changes, and 3) provides tool support for executing these actions on in-the-field and in-house computing resources. Our initial process had several limitations, however, since it was manually configured (which was tedious and error-prone) and relied on strong and untested assumptions for its accuracy (which made its use unacceptably risky in practice). This paper presents a new quality assurance process called "reliable effects screening" that provides three significant improvements to our earlier work. First, it allows developers to economically verify key assumptions during process execution. Second, it integrates several model-driven engineering tools to make process configuration and execution much easier and less error prone. Third, we evaluate this process via several feasibility studies of three large, widely used performance-intensive software frameworks. Our results indicate that reliable effects screening can detect performance degradation in large-scale systems more reliably and with significantly less resources than conventional t- echniques}, keywords = {configuration subset, distributed continuous quality assurance process, evolving software systems, in house testing, main effects screening, performance bottlenecks, performance degradation monitoring, performance intensive software systems, process configuration, process execution, program testing, regression testing, reliable effects screening, software benchmarks, Software performance, software performance evaluation, Software quality, software reliability, tool support}, isbn = {0098-5589}, doi = {10.1109/TSE.2007.20}, author = {Yilmaz,C. and Porter, Adam and Krishna,A. S and Memon, Atif M. and Schmidt,D. C and Gokhale,A.S. and Natarajan,B.} } @article {13400, title = {Report on the Fourth International Workshop on Data Management for Sensor Networks (DMSN 2007)}, journal = {SIGMOD Rec.}, volume = {36}, year = {2007}, month = {2007/12//}, pages = {53 - 55}, abstract = {Sensor networks enable an unprecedented level of access to the physical world, and hold tremendous potential to revolutionize many application domains. Research on sensor networks spans many areas of computer science, and there are now major conferences, e.g., IPSN and SenSys, devoted to sensor networks. However, there is no focused forum for discussion of early and innovative work on data management in sensor networks. The International Workshop on Data Management for Sensor Networks (DMSN), inaugurated in 2004, aims to fill this significant gap in the database and sensor network communities.}, isbn = {0163-5808}, doi = {10.1145/1361348.1361362}, url = {http://doi.acm.org/10.1145/1361348.1361362}, author = {Balazinska,Magdalena and Deshpande, Amol and Labrinidis,Alexandros and Luo,Qiong and Madden,Samuel and Yang,Jun} } @article {15471, title = {Semantics-Preserving Design of Embedded Control Software from Synchronous Models}, journal = {Software Engineering, IEEE Transactions on}, volume = {33}, year = {2007}, month = {2007/08//}, pages = {497 - 509}, abstract = {The design of embedded controllers is experiencing a growth in complexity as embedded systems increase their functionality while they become ubiquitous in electronic appliances, cars, airplanes, etc. As requirements become more challenging, mathematical models gain importance for mastering complexity. Among the different computational models proposed, synchronous models have proved to be the most widely used for control dominated applications. While synchronous models simplify the way of dealing with concurrency by decoupling functional and timing aspects, their software implementation on multitasking and multiprocessor platforms is far from straightforward, because of the asynchronous nature of most industrial software platforms. Known solutions in the literature either restrict the solution space or focus on special cases. We present a method for preserving the synchronous semantics through buffer-based intertask communication mechanisms, grounded on an abstraction of the target platform. This allows us to deal with any task set and, most importantly, being independent of the implementation, to explore the design space effectively.}, keywords = {embedded control software, embedded systems, multiprocessing programs, multiprocessor, multitasking, semantics-preserving design, software engineering, software implementation, systems analysis}, isbn = {0098-5589}, doi = {10.1109/TSE.2007.70718}, author = {Mangeruca,L. and Baleani,M. and Ferrari,A. and Sangiovanni-Vincentelli,A.} } @conference {18160, title = {A Signal Processing and Randomization Perspective of Robust and Secure Image Hashing}, booktitle = {Statistical Signal Processing, 2007. SSP {\textquoteright}07. IEEE/SP 14th Workshop on}, year = {2007}, month = {2007/08//}, pages = {166 - 170}, abstract = {An image hash is a content-based compact representation of an image and finds applications in image authentication, watermarking, and image similarity comparison. This paper reviews representative approaches developed by the research community in constructing robust and secure image hash. A unified framework and case studies on representative image hash schemes are presented to demonstrate important roles of signal processing and controlled randomization in constructing and evaluating robust and secure hashing for visual data.}, doi = {10.1109/SSP.2007.4301240}, author = {M. Wu and Mao,Yinian and Swaminathan,Ashwin} } @article {12572, title = {Signal Processing for Biometric Systems [DSP Forum]}, journal = {Signal Processing Magazine, IEEE}, volume = {24}, year = {2007}, month = {2007/11//}, pages = {146 - 152}, abstract = {This IEEE signal processing magazine (SPM) forum discuses signal processing applications, technologies, requirements, and standardization of biometric systems. The forum members bring their expert insights into issues such as biometric security, privacy, and multibiometric and fusion techniques. The invited forum members are Prof. Anil K. Jain of Michigan State University, Prof. Rama Chellappa of the University of Maryland, Dr. Stark C. Draper of theUniversity of Wisconsin in Madison, Prof. Nasir Memon of Polytechnic University, and Dr. P. Jonathon Phillips of the National Institute of Standards and Technology. The moderator of the forum is Dr. Anthony Vetro of Mitsubishi Electric Research Labs, and associate editor of SPM.}, keywords = {(access, biometric, control);security;signal, forum;signal, magazine, PROCESSING, processing;, security;biometric, standardization;fusion, systems, technique;multibiometric, technique;signal, technology;biometrics}, isbn = {1053-5888}, doi = {10.1109/MSP.2007.905886}, author = {Jain, A.K. and Chellapa, Rama and Draper, S.C. and Memon, N. and Phillips,P.J. and Vetro, A.} } @article {15542, title = {A simple entropy-based algorithm for planar point location}, journal = {ACM Transactions on Algorithms (TALG)}, volume = {3}, year = {2007}, month = {2007/05//}, abstract = {Given a planar polygonal subdivision S, point location involves preprocessing this subdivision into a data structure so that given any query point q, the cell of the subdivision containing q can be determined efficiently. Suppose that for each cell z in the subdivision, the probability pz that a query point lies within this cell is also given. The goal is to design the data structure to minimize the average search time. This problem has been considered before, but existing data structures are all quite complicated. It has long been known that the entropy H of the probability distribution is the dominant term in the lower bound on the average-case search time. In this article, we show that a very simple modification of a well-known randomized incremental algorithm can be applied to produce a data structure of expected linear size that can answer point-location queries in O(H) average time. We also present empirical evidence for the practical efficiency of this approach.}, keywords = {Entropy, expected-case complexity, Point location, polygonal subdivision, randomized algorithms, trapezoidal maps}, isbn = {1549-6325}, doi = {10.1145/1240233.1240240}, url = {http://doi.acm.org/10.1145/1240233.1240240}, author = {Arya,Sunil and Malamatos,Theocharis and Mount, Dave} } @article {15475, title = {Skoll: A Process and Infrastructure for Distributed Continuous Quality Assurance}, journal = {Software Engineering, IEEE Transactions on}, volume = {33}, year = {2007}, month = {2007/08//}, pages = {510 - 525}, abstract = {Software engineers increasingly emphasize agility and flexibility in their designs and development approaches. They increasingly use distributed development teams, rely on component assembly and deployment rather than green field code writing, rapidly evolve the system through incremental development and frequent updating, and use flexible product designs supporting extensive end-user customization. While agility and flexibility have many benefits, they also create an enormous number of potential system configurations built from rapidly changing component implementations. Since today{\textquoteright}s quality assurance (QA) techniques do not scale to handle highly configurable systems, we are developing and validating novel software QA processes and tools that leverage the extensive computing resources of user and developer communities in a distributed, continuous manner to improve software quality significantly. This paper provides several contributions to the study of distributed, continuous QA (DCQA). First, it shows the structure and functionality of Skoll, which is an environment that defines a generic around-the-world, around-the-clock QA process and several sophisticated tools that support this process. Second, it describes several novel QA processes built using the Skoll environment. Third, it presents two studies using Skoll: one involving user testing of the Mozilla browser and another involving continuous build, integration, and testing of the ACE+TAO communication software package. The results of our studies suggest that the Skoll environment can manage and control distributed continuous QA processes more effectively than conventional QA processes. For example, our DCQA processes rapidly identified problems that had taken the ACE+TAO developers much longer to find and several of which they had not found. Moreover, the automatic analysis of QA results provided developers information that enabled them to quickly find the root causes of problems}, keywords = {ACE+TAO communication software package, component assembly, component deployment, distributed continuous quality assurance, distributed development teams, distributed processing, end-user customization, flexible product design, incremental development, object-oriented programming, Skoll, software engineering, Software quality, systems analysis}, isbn = {0098-5589}, doi = {10.1109/TSE.2007.70719}, author = {Porter, Adam and Yilmaz,C. and Memon, Atif M. and Schmidt,D. C and Natarajan,B.} } @conference {17775, title = {Soma models of the behaviors of stakeholders in the afghan drug economy: A preliminary report}, booktitle = {Proc. 2007 Intl. Conf. on Computational Cultural Dynamics}, year = {2007}, month = {2007///}, pages = {78 - 86}, abstract = {Most cultural reasoning today is done by anthropologists andsociologists who use their detailed knowledge of culture to make predictions about how a given group will respond to a given situation. The main problem with this is that experts in a particular culture or subculture are few and not readily accessible to the many who might suddenly need to tap their expertise (e.g. in cases of war or conflict). In this paper, we briefly describe how the SOMA (Stochastic Opponent Mod- eling Agents) paradigm proposed by the authors can and has been used to model the behaviors of various stake-holders in the drug trade in Afghanistan. }, author = {Sliva,A. and Martinez,V. and Simari,G. I and V.S. Subrahmanian} } @article {18998, title = {Spliceosomal small nuclear RNA genes in 11 insect genomes}, journal = {RNARNA}, volume = {13}, year = {2007}, month = {2007/01/01/}, pages = {5 - 14}, abstract = {A monthly journal publishing high-quality, peer-reviewed research on all topics related to RNA and its metabolism in all organisms}, keywords = {honeybee, Insecta, secondary structure, snRNA, spliceosomal snRNA, U12 introns}, isbn = {1355-8382, 1469-9001}, doi = {10.1261/rna.259207}, url = {http://rnajournal.cshlp.org/content/13/1/5}, author = {Mount, Stephen M. and Gotea,Valer and Lin,Chiao-Feng and Hernandez,Kristina and Maka{\l}owski,Wojciech} } @article {14428, title = {SplicePort--An interactive splice-site analysis tool}, journal = {Nucleic Acids Research}, volume = {35}, year = {2007}, month = {2007/05/08/}, pages = {W285-W291 - W285-W291}, abstract = {SplicePort is a web-based tool for splice-site analysis that allows the user to make splice-site predictions for submitted sequences. In addition, the user can also browse the rich catalog of features that underlies these predictions, and which we have found capable of providing high classification accuracy on human splice sites. Feature selection is optimized for human splice sites, but the selected features are likely to be predictive for other mammals as well. With our interactive feature browsing and visualization tool, the user can view and explore subsets of features used in splice-site prediction (either the features that account for the classification of a specific input sequence or the complete collection of features). Selected feature sets can be searched, ranked or displayed easily. The user can group features into clusters and frequency plot WebLogos can be generated for each cluster. The user can browse the identified clusters and their contributing elements, looking for new interesting signals, or can validate previously observed signals. The SplicePort web server can be accessed at http://www.cs.umd.edu/projects/SplicePort and http://www.spliceport.org.}, isbn = {0305-1048, 1362-4962}, doi = {10.1093/nar/gkm407}, url = {http://nar.oxfordjournals.org/content/35/suppl_2/W285.short}, author = {Dogan,R. I and Getoor, Lise and Wilbur,W. J and Mount, Stephen M.} } @article {15325, title = {Stencil adaptation properties of a WENO scheme in direct numerical simulations of compressible turbulence}, journal = {Journal of Scientific Computing}, volume = {30}, year = {2007}, month = {2007///}, pages = {533 - 554}, author = {Taylor,E. M and Martin, M.P} } @article {19503, title = {Stochastic Communication: A New Paradigm for Fault-Tolerant Networks-on-Chip}, journal = {VLSI Design}, volume = {2007}, year = {2007}, month = {2007/04/22/}, abstract = {As CMOS technology scales down into the deep-submicron (DSM) domain, the costs of design and verification for Systems-on-Chip (SoCs) are rapidly increasing. Relaxing the requirement of 100\&$\#$x0025; correctness for devices and interconnects drastically reduces the costs of design but, at the same time, requires SoCs to be designed with some degree of system-level fault-tolerance. Towards this end, this paper introduces a novel communication paradigm for SoCs, called stochastic communication. This scheme separates communication from computation by allowing the on-chip interconnect to be designed as a reusable IP and also provides a built-in tolerance to DSM failures, without a significant performance penalty. By using this communication scheme, a large percentage of data upsets, packet losses due to buffers overflow, and severe levels of synchronization failures can be tolerated, while providing high levels of performance.}, isbn = {1065-514X}, url = {http://www.hindawi.com/journals/vlsi/2007/095348/abs/}, author = {Bogdan, Paul and Dumitra\&$\#$351 and Tudor and Marculescu, Radu} } @article {15688, title = {Storage routing for dtn congestion control}, journal = {Wireless communications and mobile computing}, volume = {7}, year = {2007}, month = {2007///}, pages = {1183 - 1196}, author = {Seligman,M. and Fall,K. and Mundur, Padma} } @article {18717, title = {Structural Biology: Analysis of {\textquoteright}downhill{\textquoteright} protein folding; Analysis of protein-folding cooperativity (Reply)}, journal = {Nature}, volume = {445}, year = {2007}, month = {2007/02/15/}, pages = {E17-E18 - E17-E18}, abstract = {Ferguson et al. and Zhou and Bai criticize the quality of our nuclear magnetic resonance (NMR) data and atom-by-atom analysis of global {\textquoteright}downhill{\textquoteright} folding, also claiming that the data are compatible with two-state folding.}, keywords = {Astronomy, astrophysics, Biochemistry, Bioinformatics, Biology, biotechnology, cancer, cell cycle, cell signalling., climate change, Computational Biology, development, developmental biology, DNA, drug discovery, earth science, ecology, environmental science, Evolution, evolutionary biology, functional genomics, Genetics, Genomics, geophysics, immunology, interdisciplinary science, life, marine biology, materials science, medical research, medicine, metabolomics, molecular biology, molecular interactions, nanotechnology, Nature, neurobiology, neuroscience, palaeobiology, pharmacology, Physics, proteomics, quantum physics, RNA, Science, science news, science policy, signal transduction, structural biology, systems biology, transcriptomics}, isbn = {0028-0836}, doi = {10.1038/nature05645}, url = {http://www.nature.com/nature/journal/v445/n7129/full/nature05645.html?lang=en}, author = {Sadqi,Mourad and Fushman, David and Mu{\~n}oz,Victor} } @conference {13334, title = {Surface Segmentation through Concentrated Curvature}, booktitle = {Image Analysis and Processing, 2007. ICIAP 2007. 14th International Conference on}, year = {2007}, month = {2007/09//}, pages = {671 - 676}, abstract = {Curvature is one of the most relevant notions that links the metric properties of a surface to its geometry and to its topology (Gauss-Bonnet theorem). In the literature, a variety of approaches exist to compute curvatures in the discrete case. Several techniques are computationally intensive or suffer from convergence problems. In this paper, we discuss the notion of concentrated curvature, introduced by Troyanov [24]. We discuss properties of this curvature and compare with a widely-used technique that estimates the Gaussian curvatures on a triangulated surface. We apply our STD method [13] for terrain segmentation to segment a surface by using different curvature approaches and we illustrate our comparisons through examples.}, keywords = {curvature;convergence, curvatures;concentrated, Gauss-Bonnet, problems;surface, processes;image, segmentation;, segmentation;terrain, segmentation;triangulated, surface;Gaussian, theorem;Gaussian}, doi = {10.1109/ICIAP.2007.4362854}, author = {Mesmoudi,M. M. and Danovaro,E. and De Floriani, Leila and Port,U.} } @article {12587, title = {Target Tracking Using a Joint Acoustic Video System}, journal = {Multimedia, IEEE Transactions on}, volume = {9}, year = {2007}, month = {2007/06//}, pages = {715 - 727}, abstract = {In this paper, a multitarget tracking system for collocated video and acoustic sensors is presented. We formulate the tracking problem using a particle filter based on a state-space approach. We first discuss the acoustic state-space formulation whose observations use a sliding window of direction-of-arrival estimates. We then present the video state space that tracks a target{\textquoteright}s position on the image plane based on online adaptive appearance models. For the joint operation of the filter, we combine the state vectors of the individual modalities and also introduce a time-delay variable to handle the acoustic-video data synchronization issue, caused by acoustic propagation delays. A novel particle filter proposal strategy for joint state-space tracking is introduced, which places the random support of the joint filter where the final posterior is likely to lie. By using the Kullback-Leibler divergence measure, it is shown that the joint operation of the filter decreases the worst case divergence of the individual modalities. The resulting joint tracking filter is quite robust against video and acoustic occlusions due to our proposal strategy. Computer simulations are presented with synthetic and field data to demonstrate the filter{\textquoteright}s performance}, keywords = {(numerical, acoustic, adaptive, appearance, approach;synchronization;time-delay, data, delay;acoustic, divergence;acoustic, estimate;joint, estimation;hidden, feature, filter;sliding, Filtering, fusion;multitarget, fusion;synchronisation;target, highways;direction-of-arrival, Kullback-Leibler, methods);sensor, model;particle, processing;, processing;automated, propagation, removal;optical, signal, system;multimodal, tracking;acoustic, tracking;direction-of-arrival, tracking;occlusion;online, tracking;particle, tracking;video, variable;visual, video, window;state-space}, isbn = {1520-9210}, doi = {10.1109/TMM.2007.893340}, author = {Cevher, V. and Sankaranarayanan,A. C and McClellan, J.H. and Chellapa, Rama} } @article {13154, title = {Task scheduling in large camera networks}, journal = {Computer Vision{\textendash}ACCV 2007}, year = {2007}, month = {2007///}, pages = {397 - 407}, abstract = {Visibility in architectural layouts affects humannavigation, so a suitable representation of visibility context is useful in understanding human activity. Motivated by studies of spatial behavior, we use a set of features from visibility analysis to represent spatial context in the interpretation of human activity. An agent{\textquoteright}s goal, belief about the world, trajectory and visible layout are considered to be random variables that evolve with time during the agent{\textquoteright}s movement, and are modeled in a Bayesian framework. We design a search-based task in a sprite-world, and compare the results of our framework to those of human subject experiments. Our findings confirm that knowledge of spatial layout improves human interpretations of the trajectories (implying that visibility context is useful in this task). Since our framework demonstrates performance close to that of human subjects with knowledge of spatial layout, our findings confirm that our model makes adequate use of visibility context. In addition, the representation we use for visibility context allows our model to generalize well when presented with new scenes. }, author = {Lim,S.N. and Davis, Larry S. and Mittal,A.} } @article {13870, title = {Task-based evaluation of text summarization using Relevance Prediction}, journal = {Information Processing \& Management}, volume = {43}, year = {2007}, month = {2007/11//}, pages = {1482 - 1499}, abstract = {This article introduces a new task-based evaluation measure called Relevance Prediction that is a more intuitive measure of an individual{\textquoteright}s performance on a real-world task than interannotator agreement. Relevance Prediction parallels what a user does in the real world task of browsing a set of documents using standard search tools, i.e., the user judges relevance based on a short summary and then that same user{\textemdash}not an independent user{\textemdash}decides whether to open (and judge) the corresponding document. This measure is shown to be a more reliable measure of task performance than LDC Agreement, a current gold-standard based measure used in the summarization evaluation community. Our goal is to provide a stable framework within which developers of new automatic measures may make stronger statistical statements about the effectiveness of their measures in predicting summary usefulness. We demonstrate{\textemdash}as a proof-of-concept methodology for automatic metric developers{\textemdash}that a current automatic evaluation measure has a better correlation with Relevance Prediction than with LDC Agreement and that the significance level for detected differences is higher for the former than for the latter.}, keywords = {Relevance prediction, Summarization evaluation, Summary usefulness}, isbn = {0306-4573}, doi = {10.1016/j.ipm.2007.01.002}, url = {http://www.sciencedirect.com/science/article/pii/S0306457307000234}, author = {Hobson,Stacy President and Dorr, Bonnie J and Monz,Christof and Schwartz,Richard} } @conference {15500, title = {Test suite prioritization by interaction coverage}, booktitle = {Workshop on Domain specific approaches to software test automation: in conjunction with the 6th ESEC/FSE joint meeting}, series = {DOSTA {\textquoteright}07}, year = {2007}, month = {2007///}, pages = {1 - 7}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Event-driven software (EDS) is a widely used class of software that takes sequences of events as input, changes state, and outputs new event sequences. Managing the size of tests suites for EDS is difficult as the number of event combinations and sequences grow exponentially with the number of events. We propose a new testing technique that extends software interaction testing. Traditional software interaction testing systematically examines all t-way interactions of parameters for a program. This paper extends the notion to t-way interactions over sequences of events. The technique applies to many classes of software; we focus on that of EDS. As a proof-of-concept, we prioritize existing test suites for four GUI-based programs by t-way interaction coverage. We compare the rate of fault detection with that of several other prioritization criteria. Results show that prioritization by interaction coverage has the fastest rate of fault detection in half of our experiments, making the most impact when tests have high interaction coverage.}, keywords = {t-way interaction coverage, combinatorial interaction testing, covering arrays, event driven software, test suite prioritization}, isbn = {978-1-59593-726-1}, doi = {10.1145/1294921.1294922}, url = {http://doi.acm.org/10.1145/1294921.1294922}, author = {Bryce,Ren{\'e}e C. and Memon, Atif M.} } @article {13918, title = {A theoretical model of children{\textquoteright}s storytelling using physically-oriented technologies (SPOT)}, journal = {Journal of Educational Multimedia and Hypermedia}, volume = {16}, year = {2007}, month = {2007///}, pages = {389 - 389}, author = {Guha,M.L. and Druin, Allison and Montemayor,J. and Chipman,G. and Farber,A.} } @article {15254, title = {To fill or not to fill: the gas station problem}, journal = {Algorithms{\textendash}ESA 2007}, year = {2007}, month = {2007///}, pages = {534 - 545}, abstract = {In this paper we study several routing problems that generalize shortest paths and the Traveling Salesman Problem. We consider a more general model that incorporates the actual cost in terms of gas prices. We have a vehicle with a given tank capacity. We assume that at each vertex gas may be purchased at a certain price. The objective is to find the cheapest route to go from s to t, or the cheapest tour visiting a given set of locations. Surprisingly, the problem of find the cheapest way to go from s to t can be solved in polynomial time and is not NP-complete. For most other versions however, the problem is NP-complete and we develop polynomial time approximation algorithms for these versions.}, doi = {10.1007/978-3-540-75520-3_48}, author = {Khuller, Samir and Malekian,A. and Mestre,J.} } @article {18286, title = {Tracing malicious relays in cooperative wireless communications}, journal = {Information Forensics and Security, IEEE Transactions on}, volume = {2}, year = {2007}, month = {2007///}, pages = {198 - 212}, author = {Mao,Y. and Wu,M.} } @article {13880, title = {TREC 2007 ciQA Task: University of Maryland}, journal = {Proceedings of TREC}, year = {2007}, month = {2007///}, author = {Madnani,N. and Jimmy Lin and Dorr, Bonnie J} } @article {12920, title = {Ultrastructure of coccoid viable but non-culturable Vibrio cholerae}, journal = {Environmental Microbiology}, volume = {9}, year = {2007}, month = {2007/02/01/}, pages = {393 - 402}, abstract = {Morphology of viable but non-culturable Vibrio cholerae was monitored for 2~years by scanning and transmission electron microscopy. Morphological changes included very small coccoid forms, after extended incubation at 4{\textdegree}C and room temperature, and sequential transformation from curved rods to irregular (\~{}1~μm) rods to \~{}0.8~μm coccoid cells and, ultimately, to tiny coccoid forms (0.07{\textendash}0.4~μm). Irregular rod-shaped and coccoid cells were equally distributed in microcosms during the first 30{\textendash}60~days of incubation at both temperatures, but only coccoid cells were observed after incubation for 60~days at 4{\textdegree}C. When V.~cholerae O1 and O139, maintained for 30{\textendash}60~days at both temperatures, were heated to 45{\textdegree}C for 60~s, after serial passage through 0.45~μm and 0.1~μm filters, and plating on Luria{\textendash}Bertania (LB) agar, only cells larger than 1~μm yielded colonies on LB agar. Approximately 0.1\% of heat-treated cultures were culturable. Cell division in the smallest coccoid cells was observed, yielding daughter cells of equal size, whereas other coccoid cells revealed bleb-like, cell wall evagination, followed by transfer of nuclear material. Coccoid cells of V.~cholerae O1 and O139 incubated at 4{\textdegree}C for more than 1~year remained substrate responsive and antigenic.}, isbn = {1462-2920}, doi = {10.1111/j.1462-2920.2006.01150.x}, url = {http://onlinelibrary.wiley.com/doi/10.1111/j.1462-2920.2006.01150.x/abstract?userIsAuthenticated=false\&deniedAccessCustomisedMessage=}, author = {Chaiyanan,Saipin and Chaiyanan,Sitthipan and Grim,Christopher and Maugel,Timothy and Huq,Anwar and Rita R Colwell} } @article {18287, title = {Unicity Distance of Robust Image Hashing}, journal = {Information Forensics and Security, IEEE Transactions on}, volume = {2}, year = {2007}, month = {2007/09//}, pages = {462 - 467}, abstract = {An image hash is a randomized compact representation of image content and finds applications in image authentication, image and video watermarking, and image similarity comparison. Usually, an image-hashing scheme is required to be robust and secure, and the security issue is particularly important in applications, such as multimedia authentication, watermarking, and fingerprinting. In this paper, we investigate the security of image hashing from the perspective of unicity distance, a concept pioneered by Shannon in one of his seminal papers. Using two recently proposed image-hashing schemes as representatives, we show that the concept of unicity distance can be adapted to evaluate the security of image hashing. Our analysis shows that the secret hashing key, or its equivalent form, can be estimated with high accuracy when the key is reused several dozen times. The estimated unicity distance determines the maximum number of key reuses in the investigated hashing schemes. A countermeasure of randomized key initialization is discussed to avoid key reuse and strengthen the security of robust image hashing.}, keywords = {authentication;image, authentication;randomized, coding;image, compact, comparison;multimedia, content;image, data;, distance;watermarking;image, fingerprinting;image, hashing;unicity, image, initialization;robust, key, of, representation;randomized, representation;security, similarity}, isbn = {1556-6013}, doi = {10.1109/TIFS.2007.902260}, author = {Mao,Yinian and M. Wu} } @article {17893, title = {Using Content-Addressable Networks for Load Balancing in Desktop Grids}, volume = {UMIACS-TR-2007-16}, year = {2007}, month = {2007/03/29/}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {Desktop grids combine Peer-to-Peer and Grid computing techniques to improvethe robustness, reliability and scalability of job execution infrastructures. However, efficiently matching incoming jobs to available system resources and achieving good load balance in a fully decentralized and heterogeneous computing environment is a challenging problem. In this paper, we extend our prior work with a new decentralized algorithm for maintaining approximate global load information, and a job pushing mechanism that uses the global information to push jobs towards underutilized portions of the system. The resulting system more effectively balances load and improves overall system throughput. Through a comparative analysis of experimental results across different system configurations and job profiles, performed via simulation, we show that our system can reliably execute Grid applications on a distributed set of resources both with low cost and with good load balance. }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu//handle/1903/4355}, author = {Kim,Jik-Soo and Keleher,Peter and Marsh,Michael and Bhattacharjee, Bobby and Sussman, Alan} } @conference {15469, title = {Using GUI Run-Time State as Feedback to Generate Test Cases}, booktitle = {Software Engineering, 2007. ICSE 2007. 29th International Conference on}, year = {2007}, month = {2007/05//}, pages = {396 - 405}, abstract = {This paper presents a new automated model-driven technique to generate test cases by using feedback from the execution of a "seed test suite" on an application under test (AUT). The test cases in the seed suite are designed to be generated automatically and executed very quickly. During their execution, feedback obtained from the AUT{\textquoteright}s run-time state is used to generate new, "improved" test cases. The new test cases subsequently become part of the seed suite. This "anytime technique" continues iteratively, generating and executing additional test cases until resources are exhausted or testing goals have been met. The feedback-based technique is demonstrated for automated testing of graphical user interfaces (GUIs). An existing abstract model of the GUI is used to automatically generate the seed test suite. It is executed; during its execution, state changes in the GUI pinpoint important relationships between GUI events, which evolve the model and help to generate new test cases. Together with a reverse- engineering algorithm used to obtain the initial model and seed suite, the feedback-based technique yields a fully automatic, end-to-end GUI testing process. A feasibility study on four large fielded open-source software (OSS) applications demonstrates that this process is able to significantly improve existing techniques and help identify/report serious problems in the OSS. In response, these problems have been fixed by the developers of the OSS in subsequent versions.}, keywords = {application under test, automated test case generation, Feedback, feedback-based technique, Graphical user interfaces, GUI run-time state, model-driven technique, open-source software, program testing, public domain software, reverse engineering, reverse-engineering algorithm, seed test suite}, doi = {10.1109/ICSE.2007.94}, author = {Xun Yuan and Memon, Atif M.} } @conference {13889, title = {Using paraphrases for parameter tuning in statistical machine translation}, booktitle = {Proceedings of the Second Workshop on Statistical Machine Translation}, series = {StatMT {\textquoteright}07}, year = {2007}, month = {2007///}, pages = {120 - 127}, publisher = {Association for Computational Linguistics}, organization = {Association for Computational Linguistics}, address = {Stroudsburg, PA, USA}, abstract = {Most state-of-the-art statistical machine translation systems use log-linear models, which are defined in terms of hypothesis features and weights for those features. It is standard to tune the feature weights in order to maximize a translation quality metric, using held-out test sentences and their corresponding reference translations. However, obtaining reference translations is expensive. In this paper, we introduce a new full-sentence paraphrase technique, based on English-to-English decoding with an MT system, and we demonstrate that the resulting paraphrases can be used to drastically reduce the number of human reference translations needed for parameter tuning, without a significant decrease in translation quality.}, url = {http://dl.acm.org/citation.cfm?id=1626355.1626371}, author = {Madnani,Nitin and Ayan,Necip Fazil and Resnik, Philip and Dorr, Bonnie J} } @conference {16662, title = {Using paraphrases for parameter tuning in statistical machine translation}, booktitle = {Proceedings of the Second Workshop on Statistical Machine Translation}, year = {2007}, month = {2007///}, pages = {120 - 127}, author = {Madnani,N. and Ayan,N.F. and Resnik, Philip and Dorr, Bonnie J} } @article {14572, title = {Variola virus topoisomerase: DNA cleavage specificity and distribution of sites in Poxvirus genomes}, journal = {Virology}, volume = {365}, year = {2007}, month = {2007/08/15/}, pages = {60 - 69}, abstract = {Topoisomerase enzymes regulate superhelical tension in DNA resulting from transcription, replication, repair, and other molecular transactions. Poxviruses encode an unusual type IB topoisomerase that acts only at conserved DNA sequences containing the core pentanucleotide 5{\textquoteright}-(T/C)CCTT-3{\textquoteright}. In X-ray structures of the variola virus topoisomerase bound to DNA, protein-DNA contacts were found to extend beyond the core pentanucleotide, indicating that the full recognition site has not yet been fully defined in functional studies. Here we report quantitation of DNA cleavage rates for an optimized 13~bp site and for all possible single base substitutions (40 total sites), with the goals of understanding the molecular mechanism of recognition and mapping topoisomerase sites in poxvirus genome sequences. The data allow a precise definition of enzyme-DNA interactions and the energetic contributions of each. We then used the resulting "action matrix" to show that favorable topoisomerase sites are distributed all along the length of poxvirus DNA sequences, consistent with a requirement for local release of superhelical tension in constrained topological domains. In orthopox genomes, an additional central cluster of sites was also evident. A negative correlation of predicted topoisomerase sites was seen relative to early terminators, but no correlation was seen with early or late promoters. These data define the full variola virus topoisomerase recognition site and provide a new window on topoisomerase function in vivo.}, keywords = {Annotation of topoisomerase sites, Sequence specific recognition, Topoisomerase IB, Variola virus}, isbn = {0042-6822}, doi = {16/j.virol.2007.02.037}, url = {http://www.sciencedirect.com/science/article/pii/S0042682207001225}, author = {Minkah,Nana and Hwang,Young and Perry,Kay and Van Duyne,Gregory D. and Hendrickson,Robert and Lefkowitz,Elliot J. and Hannenhalli, Sridhar and Bushman,Frederic D.} } @article {15657, title = {Vision Geometry XV}, journal = {Society of Photo-Optical Instrumentation Engineers (SPIE) Conference Series}, volume = {6499}, year = {2007}, month = {2007///}, author = {Latecki,L.J. and Mount, Dave and Wu,A. Y} } @conference {15689, title = {Alternative custodians for congestion control in delay tolerant networks}, booktitle = {Proceedings of the 2006 SIGCOMM workshop on Challenged networks}, series = {CHANTS {\textquoteright}06}, year = {2006}, month = {2006///}, pages = {229 - 236}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, keywords = {delay tolerant network, Routing}, isbn = {1-59593-572-X}, doi = {10.1145/1162654.1162660}, url = {http://doi.acm.org/10.1145/1162654.1162660}, author = {Seligman,Matthew and Fall,Kevin and Mundur, Padma} } @article {15341, title = {Analysis of Shock Motion in a Compression Ramp Configuration using DNS data}, journal = {Bulletin of the American Physical Society}, year = {2006}, month = {2006///}, author = {Wu,M. and Martin, M.P} } @conference {13723, title = {Annotation compatibility working group report}, booktitle = {Proceedings of the Workshop on Frontiers in Linguistically Annotated Corpora 2006}, series = {LAC {\textquoteright}06}, year = {2006}, month = {2006///}, pages = {38 - 53}, publisher = {Association for Computational Linguistics}, organization = {Association for Computational Linguistics}, address = {Stroudsburg, PA, USA}, abstract = {This report explores the question of compatibility between annotation projects including translating annotation formalisms to each other or to common forms. Compatibility issues are crucial for systems that use the results of multiple annotation projects. We hope that this report will begin a concerted effort in the field to track the compatibility of annotation schemes for part of speech tagging, time annotation, treebanking, role labeling and other phenomena.}, isbn = {1-932432-78-7}, url = {http://dl.acm.org/citation.cfm?id=1641991.1641997}, author = {Meyers,A. and Fang,A. C. and Ferro,L. and K{\"u}bler,S. and Jia-Lin,T. and Palmer,M. and Poesio,M. and Dolbey,A. and Schuler,K. K. and Loper,E. and Zinsmeister,H. and Penn,G. and Xue,N. and Hinrichs,E. and Wiebe,J. and Pustejovsky,J. and Farwell,D. and Hajicova,E. and Dorr, Bonnie J and Hovy,E. and Onyshkevych,B. A. and Levin,L.} } @conference {18664, title = {Assessing the Attack Threat due to IRC Channels}, year = {2006}, month = {2006/06//}, pages = {467 - 472}, abstract = {This practical experience report presents the results of an investigation into the threat of attacks associated with the chat medium IRC. A combination of simulated users (i.e., bots), some configured with scripts that simulated conversations, and regular users were used. The average number of attacks per day a user on IRC can expect, the effect of channel activity, gender based on the name, and network type on the number of attacks were determined. The social structure of IRC channels and the types of users that use it were analyzed. The results indicate that attacks through IRC channels come from human users selecting targets rather than automated scripts targeting every user in a channel}, keywords = {attack threat assessment, channel activity, client-server systems, computer crime, intrusion-resilient channels, IRC channels, IRC protocols, Protocols, telecommunication channels, telecommunication security}, doi = {10.1109/DSN.2006.12}, author = {Meyer,R. and Michel Cukier} } @article {13037, title = {A Bayesian model for supervised clustering with the Dirichlet process prior}, journal = {Journal of Machine Learning Research}, volume = {6}, year = {2006}, month = {2006///}, pages = {1551 - 1551}, author = {Daum{\'e}, Hal and Marcu,D.} } @conference {13063, title = {Bayesian query-focused summarization}, booktitle = {Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics}, series = {ACL-44}, year = {2006}, month = {2006///}, pages = {305 - 312}, publisher = {Association for Computational Linguistics}, organization = {Association for Computational Linguistics}, address = {Stroudsburg, PA, USA}, abstract = {We present BAYESUM (for "Bayesian summarization"), a model for sentence extraction in query-focused summarization. BAYESUM leverages the common case in which multiple documents are relevant to a single query. Using these documents as reinforcement for query terms, BAYESUM is not afflicted by the paucity of information in short queries. We show that approximate inference in BAYESUM is possible on large data sets and results in a state-of-the-art summarization system. Furthermore, we show how BAYESUM can be understood as a justified query expansion technique in the language modeling for IR framework.}, doi = {10.3115/1220175.1220214}, url = {http://dx.doi.org/10.3115/1220175.1220214}, author = {Daum{\'e}, Hal and Marcu,Daniel} } @article {18008, title = {Bootstrapping free-space optical networks}, journal = {Selected Areas in Communications, IEEE Journal on}, volume = {24}, year = {2006}, month = {2006/12//}, pages = {13 - 22}, abstract = {We introduce a challenging problem in establishing and initially configuring or bootstrapping a Free Space Optical (FSO) network. In such networks, it is assumed that each communication node is a base station, including a router and wireless optical communications hardware, and its number of transceivers is limited. In addition, the FSO networks are characterized by narrow beam, directional links (e.g., operating at 1550 nm) and support up to Gbps data rates. The problem of initially configuring the transceivers to form a connected topology is NP-complete because of the transceiver limitation. What makes this problem even more challenging is the need to configure the transceiver in a "distributed" fashion, because a node can have only direct knowledge of its neighbors. We have developed a fully distributed approximation algorithm, which constructs a spanning tree with maximal node degree at most one larger than that in the optimal solution. Due to its distributed nature, this algorithm outperforms known serial algorithms. For a graph with 200 nodes generated in some randomized model, speed-ups greater than 6 have been demonstrated.}, keywords = {algorithm;free-space, algorithms;optical, approximation, communication;telecommunication, communications, configuration;randomized, FSO;base, hardware;distributed, model;spanning, network, network;network, node;connected, optical, router;optical, routing;telecommunication, searching;, station;bootstrapping;communication, topology;distributed, topology;transceivers;tree, transceiver, tree;wireless}, isbn = {0733-8716}, doi = {10.1109/JSAC.2006.258219}, author = {Liu,F. and Vishkin, Uzi and Milner,S.} } @article {18007, title = {A bootstrapping model for directional wireless networks}, journal = {Communications Letters, IEEE}, volume = {10}, year = {2006}, month = {2006/12//}, pages = {840 - 842}, abstract = {Initially configuring or bootstrapping a connected topology in directional wireless networks is a challenging problem, especially when nodes only have local connectivity information and a limited number of transceivers. This paper presents a scalable bootstrapping model which integrates: 1) a distributed bottom-up algorithm that constructs a spanning tree with degree at most one larger than the optimal 2) a resource discovery algorithm for efficient dissemination of local connectivity information, and 3) synchronization protocols to guarantee the efficient emergence of overall network connectivity from local interactions. We investigate the feasibility and scalability of the proposed model. Results are presented for different network systems, with varying size and signaling data rates.}, keywords = {(mathematics);, algorithm;resource, algorithm;spanning, bootstrapping, bottom-up, discovery, model;directional, network;distributed, networks;trees, protocols;protocols;radio, tree;synchronization, wireless}, isbn = {1089-7798}, doi = {10.1109/LCOMM.2006.060808}, author = {Milner,S. and Llorca,J. and Anibha,A. and Vishkin, Uzi} } @article {13736, title = {Challenges in building an Arabic-English GHMT system with SMT components}, journal = {Proceedings of the 11th Annual Conference of the European Association for Machine Translation (EAMT-2006)}, year = {2006}, month = {2006///}, pages = {56 - 65}, abstract = {The research context of this paper is de-veloping hybrid machine translation (MT) systems that exploit the advantages of linguistic rule-based and statistical MT systems. Arabic, as a morphologically rich language, is especially challenging even without addressing the hybridiza- tion question. In this paper, we describe the challenges in building an Arabic- English generation-heavy machine trans- lation (GHMT) system and boosting it with statistical machine translation (SMT) components. We present an extensive evaluation of multiple system variants and report positive results on the advantages of hybridization. }, author = {Habash,N. and Dorr, Bonnie J and Monz,C.} } @article {15340, title = {Characterization of the turbulence structure in supersonic boundary layers using DNS data}, journal = {AIAA Paper}, volume = {3539}, year = {2006}, month = {2006///}, author = {Ringuette,M. J and Martin, M.P and Smits,A. J. and Wu,M.} } @article {17544, title = {A client-driven approach for channel management in wireless LANs}, journal = {IEEE Infocom}, volume = {6}, year = {2006}, month = {2006///}, abstract = {We propose an efficient client-based approach for channel man-agement (channel assignment and load balancing) in 802.11-based WLANs that lead to better usage of the wireless spectrum. This approach is based on a {\textquotedblleft}conflict set coloring{\textquotedblright} formulation that jointly performs load balancing along with channel assignment. Such a formulation has a number of advantages. First, it explicitly captures interference effects at clients. Next, it intrinsically ex- poses opportunities for better channel re-use. Finally, algorithms based on this formulation do not depend on specific physical RF models and hence can be applied efficiently to a wide-range of in- building as well as outdoor scenarios. We have performed extensive packet-level simulations and mea- surements on a deployed wireless testbed of 70 APs to validate the performance of our proposed algorithms. We show that in addi- tion to single network scenarios, the conflict set coloring formu- lation is well suited for channel assignment where multiple wire- less networks share and contend for spectrum in the same physical space. Our results over a wide range of both simulated topologies and in-building testbed experiments indicate that our approach improves application level performance at the clients by upto three times (and atleast 50\%) in comparison to current best-known tech- niques. }, author = {Mishra,A. and Brik,V. and Banerjee,S. and Srinivasan, Aravind and Arbaugh, William A.} } @article {17574, title = {Client-driven channel management for wireless LANs}, journal = {SIGMOBILE Mob. Comput. Commun. Rev.}, volume = {10}, year = {2006}, month = {2006/10//}, pages = {8 - 10}, abstract = {With the explosive growth in the density of 802.11 access points (APs) in the form of hotspots and public/home access networks, coordinating the shared use of spectrum has become an important problem. The irregular coverage topologies present in WLANs due to the vagaries of the indoor RF environment make the channel assignment algorithms in cellular networks inapplicable [1, 2].}, isbn = {1559-1662}, doi = {10.1145/1215976.1215981}, url = {http://doi.acm.org/10.1145/1215976.1215981}, author = {Mishra,Arunesh and Brik,Vladimir and Banerjee,Suman and Srinivasan, Aravind and Arbaugh, William A.} } @article {18971, title = {Comprehensive analysis of alternative splicing in rice and comparative analyses with Arabidopsis}, journal = {BMC Genomics}, volume = {7}, year = {2006}, month = {2006/12/28/}, pages = {327 - 327}, abstract = {Recently, genomic sequencing efforts were finished for Oryza sativa (cultivated rice) and Arabidopsis thaliana (Arabidopsis). Additionally, these two plant species have extensive cDNA and expressed sequence tag (EST) libraries. We employed the Program to Assemble Spliced Alignments (PASA) to identify and analyze alternatively spliced isoforms in both species.}, isbn = {1471-2164}, doi = {10.1186/1471-2164-7-327}, url = {http://www.biomedcentral.com/1471-2164/7/327/abstract}, author = {Campbell,Matthew A. and Haas,Brian J. and Hamilton,John P. and Mount, Stephen M. and Buell,C. Robin} } @conference {13163, title = {Constraint Integration for Multiview Pose Estimation of Humans with Self-Occlusions}, booktitle = {3D Data Processing, Visualization, and Transmission, Third International Symposium on}, year = {2006}, month = {2006/06//}, pages = {900 - 907}, abstract = {Detection of articulated objects such as humans is an important task in computer vision. We present a system that incorporates a variety of constraints in a unified multi- view framework to automatically detect humans in possibly crowded scenes. These constraints include the kinematic constraints, the occlusion of one part by another and the high correlation between the appearance of parts such as the two arms. The graphical structure (non-tree) obtained is optimized in a nonparametric belief propagation framework using prior based search.}, keywords = {articulated, belief, constraint;multiview, detection;computer, detection;pose, estimation;, estimation;nonparametric, framework;self-occlusion;computer, graphics;computer, method;graphical, methods;object, object, pose, propagation, structure;kinematic, vision;correlation}, doi = {10.1109/3DPVT.2006.45}, author = {Gupta,A. and Mittal,A. and Davis, Larry S.} } @article {13176, title = {Constructing task visibility intervals for video surveillance}, journal = {Multimedia systems}, volume = {12}, year = {2006}, month = {2006///}, pages = {211 - 226}, abstract = {Vision systems are increasingly being deployed to perform complex surveillance tasks. While improved algorithms are being developed to perform these tasks, it is also important that data suitable for these algorithms be acquired {\textendash} a non-trivial task in a dynamic and crowded scene viewed by multiple PTZ cameras. In this paper, we describe a real-time multi-camera system that collects images and videos of moving objects in such scenes, subject to task constraints. The system constructs {\textquotedblleft}task visibility intervals{\textquotedblright} that contain information about what can be sensed in future time intervals. Constructing these intervals requires prediction of future object motion and consideration of several factors such as object occlusion and camera control parameters. Such intervals can also be combined to form multi-task intervals, during which a single camera can collect videos suitable for multiple tasks simultaneously. Experimental results are provided to illustrate the system capabilities in constructing such task visibility intervals, followed by scheduling them using a greedy algorithm.}, author = {Lim,S.N. and Davis, Larry S. and Mittal,A.} } @article {15619, title = {The cost of compatible refinement of simplex decomposition trees}, journal = {Proceedings of the 15th International Meshing Roundtable}, year = {2006}, month = {2006///}, pages = {57 - 69}, abstract = {A hierarchical simplicial mesh is a recursive decomposition of space into cells that are simplices. Such a mesh is compatible if pairs of neighboring cells meet along a single common face. Compatibility condition is important in many applications where the mesh serves as a discretization of a function. Enforcing compatibility involves refining the simplices of the mesh further, thus generates a larger mesh. We show that the size of a simplicial mesh grows by no more than a constant factor when compatibly refined. We prove a tight upper bound on the expansion factor for 2-dimensional meshes, and we sketch upper bounds for d-dimensional meshes.}, doi = {10.1007/978-3-540-34958-7_4}, author = {Atalay,F. and Mount, Dave} } @article {17042, title = {Creativity Support Tools: Report From a U.S. National Science Foundation Sponsored Workshop}, journal = {International Journal of Human-Computer Interaction}, volume = {20}, year = {2006}, month = {2006///}, pages = {61 - 77}, abstract = {Creativity support tools is a research topic with high risk but potentially very high payoff. The goal is to develop improved software and user interfaces that empower users to be not only more productive but also more innovative. Potential users include software and other engineers, diverse scientists, product and graphic designers, architects, educators, students, and many others. Enhanced interfaces could enable more effective searching of intellectual resources, improved collaboration among teams, and more rapid discovery processes. These advanced interfaces should also provide potent support in hypothesis formation, speedier evaluation of alternatives, improved understanding through visualization, and better dissemination of results. For creative endeavors that require composition of novel artifacts (e.g., computer programs, scientific papers, engineering diagrams, symphonies, artwork), enhanced interfaces could facilitate exploration of alternatives, prevent unproductive choices, and enable easy backtracking. This U.S. National Science Foundation sponsored workshop brought together 25 research leaders and graduate students to share experiences, identify opportunities, and formulate research challenges. Two key outcomes emerged: (a) encouragement to evaluate creativity support tools through multidimensional in-depth longitudinal case studies and (b) formulation of 12 principles for design of creativity support tools.Creativity support tools is a research topic with high risk but potentially very high payoff. The goal is to develop improved software and user interfaces that empower users to be not only more productive but also more innovative. Potential users include software and other engineers, diverse scientists, product and graphic designers, architects, educators, students, and many others. Enhanced interfaces could enable more effective searching of intellectual resources, improved collaboration among teams, and more rapid discovery processes. These advanced interfaces should also provide potent support in hypothesis formation, speedier evaluation of alternatives, improved understanding through visualization, and better dissemination of results. For creative endeavors that require composition of novel artifacts (e.g., computer programs, scientific papers, engineering diagrams, symphonies, artwork), enhanced interfaces could facilitate exploration of alternatives, prevent unproductive choices, and enable easy backtracking. This U.S. National Science Foundation sponsored workshop brought together 25 research leaders and graduate students to share experiences, identify opportunities, and formulate research challenges. Two key outcomes emerged: (a) encouragement to evaluate creativity support tools through multidimensional in-depth longitudinal case studies and (b) formulation of 12 principles for design of creativity support tools. }, isbn = {1044-7318}, doi = {10.1207/s15327590ijhc2002_1}, url = {http://www.tandfonline.com/doi/abs/10.1207/s15327590ijhc2002_1}, author = {Shneiderman, Ben and Fischer,Gerhard and Czerwinski,Mary and Resnick,Mitch and Myers,Brad and Candy,Linda and Edmonds,Ernest and Eisenberg,Mike and Giaccardi,Elisa and Hewett,Tom and Jennings,Pamela and Kules,Bill and Nakakoji,Kumiyo and Nunamaker,Jay and Pausch,Randy and Selker,Ted and Sylvan,Elisabeth and Terry,Michael} } @article {13042, title = {Domain adaptation for statistical classifiers}, journal = {Journal of Artificial Intelligence Research}, volume = {26}, year = {2006}, month = {2006///}, pages = {101 - 126}, author = {Daum{\'e}, Hal and Marcu,D.} } @article {15488, title = {Employing user profiles to test a new version of a GUI component in its context of use}, journal = {Software Quality Journal}, volume = {14}, year = {2006}, month = {2006///}, pages = {359 - 377}, abstract = {Advancement in reusable component technology has had a significant impact on the development of complex graphical user interfaces (GUIs), which are front-ends to most of today{\textquoteright}s software. Software developers can, with very little effort, integrate components into their software{\textquoteright}s GUI. Problems, however, arise when new versions of GUI components replace their predecessors in an implementation. Often, the inclusion of a new version of a component breaks some part of the software, i.e., tasks that end-users were able to perform before modifications were made can no longer be performed. Software developers (who also happen to be component users) are unable to perform adequate regression testing in this context because of several factors, including lack of source code, environmental side-effects on GUI rendering, event-driven nature of GUIs, and large number of possible permutations of events. This paper presents a new technique that end-users{\textquoteright} quality assurance (QA) teams can employ to test the new version of a component in its application context by using the existing version as a baseline. The technique combines lightweight event-level dynamic profiling to collect user profiles in a transparent manner, GUI reverse engineering to extract the structure of the component{\textquoteright}s GUI, test case execution to replay the collected profiles on the new version, and GUI oracles that collect properties from the existing version. Empirical studies demonstrate the practicality, usefulness, and limitations of the technique.}, doi = {10.1007/s11219-006-0040-7}, author = {Memon, Atif M.} } @conference {15852, title = {Evaluation of Multilingual and Multi-modal Information Retrieval-Seventh Workshop of the Cross-Language Evaluation Forum, CLEF 2006, Alicante, Spain, September 19-21, 2006, Revised Selected Papers}, booktitle = {Seventh Workshop of the Cross-Language Evaluation Forum, CLEF 2006}, year = {2006}, month = {2006///}, address = {Alicante, Spain}, author = {Peters,C. and Clough,P. and Gey,F. and Karlgren,J. and Magnini,B. and Oard, Douglas and De Rijke,M. and Stempfhuber,M.} } @article {14435, title = {Exploiting independence for branch operations in Bayesian learning of C\&RTs}, journal = {Probabilistic, Logical and Relational Learning-Towards a Synthesis}, year = {2006}, month = {2006///}, abstract = {In this paper we extend a methodology for Bayesian learning via MCMC, with the ability to grow arbitrarily long branches in C\&RT models. We are able to do so by exploiting independence in the model construction process. The ability to grow branches rather than single nodes has been noted as desirable in the literature. The most singular feature of the underline methodology used here in comparison to other approaches is the coupling of the prior and the proposal. The main contribution of this paper is to show how taking advantage of independence in the coupled process, can allow branch growing and swapping for proposal models.}, author = {Angelopoulos,N. and Cussens,J. and De Raedt,L. and Dietterich,T. and Getoor, Lise and Muggleton,S. H} } @article {14909, title = {First Steps Toward an Electronic Field Guide for Plants}, journal = {Taxon}, volume = {55}, year = {2006}, month = {2006///}, pages = {597 - 610}, abstract = {this paper, we will describe our progress towards building a digital collection of the Smithsonian{\textquoteright}s type specimens, developing recognition algorithms that can match an image of a leaf to the species of plant from which it comes, and designing user interfaces for interacting with an electronic field guide. To start, we are developing a prototype electronic field guide for the flora of Plummers Island, a small, well-studied island in the Potomac River. This prototype system contains multiple images for each of about 130 species of plants on the island, and should soon grow to cover all 200+ species currently recorded (Shetler et al., 2005). Images of full specimens are available, as well as images of isolated leaves of each species. A zoomable user interface allows a user to browse these images, zooming in on ones of interest. Visual recognition algorithms assist a botanist in locating the specimens that are most relevant to identify the species of a plant. The system currently runs on a small hand-held computer. We will describe the components of this prototype, and also describe some of the future challenges we anticipate if we are to provide botanists in the field with all the resources that are now currently available in the world{\textquoteright}s museums and herbaria. Type Specimen Digital Collection The first challenge in producing our electronic field guide is to create a digital collection covering all of the Smithsonian{\textquoteright}s 85,000 vascular plant type specimens. For each type specimen, the database should eventually include systematically acquired high-resolution digital images of the specimen, textual descriptions, links to decision trees, images of live plants, and 3D models. Figure 1: On the left, our set-up at the Smithsonian for digitally photographing type specimens. On the...}, author = {Haibin,Gaurav Agarwal and Agarwal,Gaurav and Ling,Haibin and Jacobs, David W. and Shirdhonkar,Sameer and Kress,W. John and Russell,Rusty and Belhumeur,Peter and Dixit,An and Feiner,Steve and Mahajan,Dhruv and Sunkavalli,Kalyan and Ramamoorthi,Ravi and White,Sean} } @article {15681, title = {Fuzzy svm ensembles for relevance feedback in image retrieval}, journal = {Image and Video Retrieval}, year = {2006}, month = {2006///}, pages = {350 - 359}, author = {Rao,Y. and Mundur, Padma and Yesha,Y.} } @article {14623, title = {Identification and cross-species comparison of canine osteoarthritic gene regulatory cis-elements}, journal = {Osteoarthritis and Cartilage}, volume = {14}, year = {2006}, month = {2006/08//}, pages = {830 - 838}, abstract = {SummaryObjectiveTo better understand transcription regulation of osteoarthritis (OA) by examining common promoter motifs in canine osteoarthritic genes, to identify other genes containing these motifs and to assess the conservation of these motifs between canine, human, mouse and rat. Design Differentially expressed transcripts in canine OA were mapped to the human genome. We thus identified 20 orthologous human transcripts representing 19 up-regulated genes and 62 orthologous transcripts representing 60 down-regulated genes. The 5\&$\#$xa0;kbp upstream regions of these transcripts were used to identify binding sites and build promoter models based on those sites. The human genome was subsequently searched for other transcripts likely to be regulated by the same promoter models. Orthologous transcripts were then identified in canine, rat and mouse for determination of potential cross-species conservation of binding sites comprising the promoter model. Results Four promoter models containing 5{\textendash}6 transcripts and 5{\textendash}8 common transcription factor binding sites were developed. They include binding sites for AP-4, AP-2α and γ, and E2F. Several hundred other human genes were found to contain these promoter motifs. Furthermore these motifs were significantly over represented in the orthologous genes in canine, rat and mouse genomes. Conclusions We have developed and applied a computational methodology to identify common promoter elements implicated in OA and shared amongst four higher vertebrates. The transcription factors associated with these binding sites and other genes driven by these promoter motifs have been implicated in OA, chondrocyte development and with other biological factors involved in the disease. }, keywords = {Chondrocyte, Gene expression, Osteoarthritis, Promoter}, isbn = {1063-4584}, doi = {10.1016/j.joca.2006.02.007}, url = {http://www.sciencedirect.com/science/article/pii/S1063458406000379}, author = {Hannenhalli, Sridhar and Middleton,R.P. and Levy,S. and Perroud,B. and Holzwarth,J.A. and McDonald,K. and Hannah,S.S.} } @article {15590, title = {Image fusion using cokriging}, journal = {Geosci. and Remote Sens. Symp., 2006. IGARSS 2006. IEEE Int. Conf. on}, year = {2006}, month = {2006///}, pages = {2518 - 2521}, author = {Memarsadeghi,N. and Le Moigne,J. and Mount, Dave} } @conference {15543, title = {Image Registration and Fusion Studies for the Integration of Multiple Remote Sensing Data}, booktitle = {Acoustics, Speech and Signal Processing, 2006. ICASSP 2006 Proceedings. 2006 IEEE International Conference on}, volume = {5}, year = {2006}, month = {2006/05//}, pages = {V - V}, abstract = {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}, keywords = {ALI, EO-1, fusion studies, geophysical signal processing, Hyperion sensors, image registration, Internet, multiple remote sensing data, multiple source data, Remote sensing, Web-based image registration toolbox}, doi = {10.1109/ICASSP.2006.1661494}, author = {Le Moigne,J. and Cole-Rhodes,A. and Eastman,R. and Jain,P. and Joshua,A. and Memarsadeghi,N. and Mount, Dave and Netanyahu,N. and Morisette,J. and Uko-Ozoro,E.} } @conference {15642, title = {On the importance of idempotence}, booktitle = {Proceedings of the thirty-eighth annual ACM symposium on Theory of computing}, series = {STOC {\textquoteright}06}, year = {2006}, month = {2006///}, pages = {564 - 573}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Range searching is among the most fundamental problems in computational geometry. An n-element point set in Rd is given along with an assignment of weights to these points from some commutative semigroup. Subject to a fixed space of possible range shapes, the problem is to preprocess the points so that the total semigroup sum of the points lying within a given query range η can be determined quickly. In the approximate version of the problem we assume that η is bounded, and we are given an approximation parameter ε > 0. We are to determine the semigroup sum of all the points contained within η and may additionally include any of the points lying within distance ε {\textbullet} diam(η) of η{\textquoteright}s boundar.In this paper we contrast the complexity of range searching based on semigroup properties. A semigroup (S,+) is idempotent if x + x = x for all x ∈ S, and it is integral if for all k >= 2, the k-fold sum x + ... + x is not equal to x. For example, (R, min) and (0,1, ∨) are both idempotent, and (N, +) is integral. To date, all upper and lower bounds hold irrespective of the semigroup. We show that semigroup properties do indeed make a difference for both exact and approximate range searching, and in the case of approximate range searching the differences are dramatic.First, we consider exact halfspace range searching. The assumption that the semigroup is integral allows us to improve the best lower bounds in the semigroup arithmetic model. For example, assuming O(n) storage in the plane and ignoring polylog factors, we provide an Ω*(n2/5) lower bound for integral semigroups, improving upon the best lower bound of Ω*(n1/3), thus closing the gap with the O(n1/2) upper bound.We also consider approximate range searching for Euclidean ball ranges. We present lower bounds and nearly matching upper bounds for idempotent semigroups. We also present lower bounds for range searching for integral semigroups, which nearly match existing upper bounds. These bounds show that the advantages afforded by idempotency can result in major improvements. In particular, assuming roughly linear space, the exponent in the ε-dependencies is smaller by a factor of nearly 1/2. All our results are presented in terms of space-time tradeoffs, and our lower and upper bounds match closely throughout the entire spectrum.To our knowledge, our results provide the first proof that semigroup properties affect the computational complexity of range searching in the semigroup arithmetic model. These are the first lower bound results for any approximate geometric retrieval problems. The existence of nearly matching upper bounds, throughout the range of space-time tradeoffs, suggests that we are close to resolving the computational complexity of both idempotent and integral approximate spherical range searching in the semigroup arithmetic model.}, keywords = {Approximation algorithms, Idempotence, Range searching}, isbn = {1-59593-134-1}, doi = {10.1145/1132516.1132598}, url = {http://doi.acm.org/10.1145/1132516.1132598}, author = {Arya,Sunil and Malamatos,Theocharis and Mount, Dave} } @article {15247, title = {Improved algorithms for data migration}, journal = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques}, year = {2006}, month = {2006///}, pages = {164 - 175}, abstract = {Our work is motivated by the need to manage data on a collection of storage devices to handle dynamically changing demand. As demand for data changes, the system needs to automatically respond to changes in demand for different data items. The problem of computing a migration plan among the storage devices is called the data migration problem. This problem was shown to be NP-hard, and an approximation algorithm achieving an approximation factor of 9.5 was presented for the half-duplex communication model in [Khuller, Kim and Wan: Algorithms for Data Migration with Cloning, SIAM J. on Computing, Vol. 33(2):448{\textendash}461 (2004)]. In this paper we develop an improved approximation algorithm that gives a bound of 6.5+o(1) using various new ideas. In addition, we develop better algorithms using external disks and get an approximation factor of 4.5. We also consider the full duplex communication model and develop an improved bound of 4 +o(1) for this model, with no external disks.}, doi = {10.1007/11830924_17}, author = {Khuller, Samir and Kim,Y. A and Malekian,A.} } @article {13929, title = {Initial findings from a three-year international case study exploring children{\textquoteright}s responses to literature in a digital library}, journal = {Library trends}, volume = {54}, year = {2006}, month = {2006///}, pages = {245 - 265}, author = {Druin, Allison and Massey,S. and Weeks,A. C} } @article {16088, title = {Integrating data and interfaces to enhance understanding of government statistics: toward the national statistical knowledge network project briefing}, journal = {Proceedings of 7th Annual International Conference on Digital Libraries (DG06)}, year = {2006}, month = {2006///}, pages = {21 - 24}, abstract = {This paper reports the results of work in the final no-costextension year of a digital government project that developed user interface models and prototypes to help people find and understand government statistics; proposed a Statistical Knowledge Network architecture that supports cross agency information access; and demonstrated models for government- academic collaboration. }, author = {Marchionini,G. and Haas,S. and Plaisant, Catherine and Shneiderman, Ben} } @article {18231, title = {JET: dynamic join-exit-tree amortization and scheduling for contributory key management}, journal = {IEEE/ACM Trans. Netw.}, volume = {14}, year = {2006}, month = {2006/10//}, pages = {1128 - 1140}, abstract = {In secure group communications, the time cost associated with key updates in the events of member join and departure is an important aspect of quality of service, especially in large groups with highly dynamic membership. To achieve better time efficiency, we propose a join-exit-tree (JET) key management framework. First, a special key tree topology with join and exit subtrees is introduced to handle key updates for dynamic membership. Then, optimization techniques are employed to determine the capacities of join and exit subtrees for achieving the best time efficiency, and algorithms are designed to dynamically update the join and exit trees. We show that, on average, the asymptotic time cost for each member join/departure event is reduced to O(log (log n)) from the previous cost of O(log n), where n is the group size. Our experimental results based on simulated user activities as well as the real MBone data demonstrate that the proposed JET scheme can significantly improve the time efficiency, while maintaining low communication and computation cost, of tree-based contributory key management.}, keywords = {contributory key management, dynamic tree topology, secure group communications, time efficiency}, isbn = {1063-6692}, doi = {10.1109/TNET.2006.882851}, url = {http://dx.doi.org/10.1109/TNET.2006.882851}, author = {Mao,Yinian and Sun,Yan and M. Wu and Liu,K. J.R} } @article {18153, title = {A joint signal processing and cryptographic approach to multimedia encryption}, journal = {Image Processing, IEEE Transactions on}, volume = {15}, year = {2006}, month = {2006/07//}, pages = {2061 - 2075}, abstract = {In recent years, there has been an increasing trend for multimedia applications to use delegate service providers for content distribution, archiving, search, and retrieval. These delegate services have brought new challenges to the protection of multimedia content confidentiality. This paper discusses the importance and feasibility of applying a joint signal processing and cryptographic approach to multimedia encryption, in order to address the access control issues unique to multimedia applications. We propose two atomic encryption operations that can preserve standard compliance and are friendly to delegate processing. Quantitative analysis for these operations is presented to demonstrate that a good tradeoff can be made between security and bitrate overhead. In assisting the design and evaluation of media security systems, we also propose a set of multimedia-oriented security scores to quantify the security against approximation attacks and to complement the existing notion of generic data security. Using video as an example, we present a systematic study on how to strategically integrate different atomic operations to build a video encryption system. The resulting system can provide superior performance over both generic encryption and its simple adaptation to video in terms of a joint consideration of security, bitrate overhead, and friendliness to delegate processing.}, keywords = {access control;approximation attacks;atomic encryption operations;bitrate overhead;content distribution;cryptographic approach;delegate processing;delegate service providers;generic data security;media security systems;multimedia content confidentiality;m, Computer-Assisted;, Computer-Assisted;Information Storage and Retrieval;Multimedia;Signal Processing}, isbn = {1057-7149}, doi = {10.1109/TIP.2006.873426}, author = {Mao,Yinian and M. Wu} } @conference {15627, title = {Keep Your Friends Close and Your Enemies Closer: The Art of Proximity Searching}, booktitle = {Proceedings of the eighth Workshop on Algorithm Engineering and Experiments and the third Workshop on Analytic Algorithmics and Combinatorics}, volume = {123}, year = {2006}, month = {2006///}, pages = {65 - 65}, author = {Mount, Dave} } @article {12269, title = {KeyChains: A Decentralized Public-Key Infrastructure}, journal = {Technical Reports from UMIACS, UMIACS-TR-2006-12}, year = {2006}, month = {2006/03/02/}, abstract = {A Certification Authority (CA) can be used to certify keys and build apublic-key infrastructure (PKI) when all users trust the same CA. A decentralized PKI trades off absolute assurance on keys for independence from central control and improved scalability and robustness. The PGP {\textquoteleft}{\textquoteleft}web of trust{\textquoteright}{\textquoteright} model has been suggested as a decentralized certification system, and has been used with great success for secure email. Although the PGP web of trust model allows anyone to issue certificates which can be used to form certificate chains, the discovery and construction of certificate chains relies on centralized keyservers to store certificates and respond to queries. In this paper, we design and implement KeyChains, a peer-to-peer system which incorporates a novel lookup mechanism specifically tailored to the task of generating and retrieving certificate chains in completely unstructured networks. By layering our system on top of the web of trust model, we thus obtain the first PKI which is truly decentralized in all respects. Our analysis and simulations show that the resulting system is both efficient and secure. }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/3332}, author = {Morselli,Ruggero and Bhattacharjee, Bobby and Katz, Jonathan and Marsh,Michael A} } @article {14436, title = {Learning through failure}, journal = {Probabilistic, Logical and Relational Learning-Towards a Synthesis}, year = {2006}, month = {2006///}, abstract = {PRISM, a symbolic-statistical modeling language we have been developing since {\textquoteright}97, recently incorporated a program transformation technique to handle failure in generative modeling. I{\textquoteright}ll show this feature opens a way to new breeds of symbolic models, including EM learning from negative observations, constrained HMMs and finite PCFGs.}, author = {Sato,T. and Kameya,Y. and De Raedt,L. and Dietterich,T. and Getoor, Lise and Muggleton,S. H} } @conference {18877, title = {Learning to do HTN planning}, year = {2006}, month = {2006///}, pages = {390 - 393}, abstract = {We describe HDL, an algorithm that learns HTN do- main descriptions by examining plan traces produced by an expert problem-solver. Prior work on learning HTN methods requires that all the methods{\textquoteright} informa- tion except for their preconditions be given in advance so that the learner can learn the preconditions. In con- trast, HDL has no prior information about the methods. In our experiments, in most cases HDL converged fully with no more than about 200 plan traces. Furthermore, even when HDL was given only half the plan traces it required to fully converge, it usually was able to pro- duce HTN methods that were sufficient to solve more than 3/4 of the planning problems in the test set.}, url = {https://www.aaai.org/Papers/ICAPS/2006/ICAPS06-048.pdf}, author = {Ilghami,O. and Nau, Dana S. and Munoz-Avila,H.} } @article {15581, title = {On the Least Median Square Problem}, journal = {Discrete \& Computational Geometry}, volume = {36}, year = {2006}, month = {2006///}, pages = {593 - 607}, abstract = {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.}, keywords = {Mathematics and Statistics}, isbn = {0179-5376}, doi = {10.1007/s00454-006-1267-6}, url = {http://www.springerlink.com/content/j44818j11173017k/abstract/}, author = {Erickson,Jeff and Har-Peled,Sariel and Mount, Dave} } @article {13812, title = {Leveraging recurrent phrase structure in large-scale ontology translation}, journal = {Proceedings of the 11th Annual Conference of the European Association for Machine Translation}, year = {2006}, month = {2006///}, abstract = {This paper presents a process for leveraging structural relationships and reusablephrases when translating large-scale ontologies. Digital libraries are becoming more and more prevalent. An important step in providing universal access to such material is to pro- vide multi-lingual access to the underlying principles of organization via ontologies, thesauri, and controlled vocabularies. Machine translation of these resources requires high accuracy and a deep vocabulary. Human input is often required, but full manual translation can be slow and expensive. We report on a cost-effective approach to ontology translation. We describe our technique of prioritization, our process of collecting aligned translations and generating a new lexicon, and the resulting improvement to translation system output. Our preliminary evaluation indicates that this technique provides significant cost savings for human-assisted translation. The process we developed can be applied to ontologies in other domains and is easily incorporated into other translation systems. }, author = {Murray,G. C and Dorr, Bonnie J and Jimmy Lin and Haji{\v c},J. and Pecina,P.} } @conference {13813, title = {Leveraging reusability: cost-effective lexical acquisition for large-scale ontology translation}, booktitle = {Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics}, series = {ACL-44}, year = {2006}, month = {2006///}, pages = {945 - 952}, publisher = {Association for Computational Linguistics}, organization = {Association for Computational Linguistics}, address = {Stroudsburg, PA, USA}, abstract = {Thesauri and ontologies provide important value in facilitating access to digital archives by representing underlying principles of organization. Translation of such resources into multiple languages is an important component for providing multilingual access. However, the specificity of vocabulary terms in most ontologies precludes fully-automated machine translation using general-domain lexical resources. In this paper, we present an efficient process for leveraging human translations when constructing domain-specific lexical resources. We evaluate the effectiveness of this process by producing a probabilistic phrase dictionary and translating a thesaurus of 56,000 concepts used to catalogue a large archive of oral histories. Our experiments demonstrate a cost-effective technique for accurate machine translation of large ontologies.}, doi = {10.3115/1220175.1220294}, url = {http://dx.doi.org/10.3115/1220175.1220294}, author = {Murray,G. Craig and Dorr, Bonnie J and Jimmy Lin and Haji{\v c},Jan and Pecina,Pavel} } @conference {17285, title = {Making a difference: integrating socially relevant projects into HCI teaching}, booktitle = {CHI {\textquoteright}06 extended abstracts on Human factors in computing systems}, series = {CHI EA {\textquoteright}06}, year = {2006}, month = {2006///}, pages = {41 - 44}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Enriching courses on human-computer interaction with socially-relevant projects provides a compelling opportunity for students to improve their education and make socially beneficial contributions. By having clearly defined user communities outside the classroom, students have the chance to practice their interview, observation, and usability testing skills, while developing projects that continue beyond the semester. These projects often give students life-changing exposure to genuine needs and impressive results to include in their portfolio when seeking employment. Educators will present their strategies for arranging, supervising, and grading these projects. Students will describe their experience and how it influenced them.}, keywords = {education, making a difference, relevance, service learning, social impact, team projects}, isbn = {1-59593-298-4}, doi = {10.1145/1125451.1125463}, url = {http://doi.acm.org/10.1145/1125451.1125463}, author = {Shneiderman, Ben and Bishop,Ann and Friedman,Batya and Lazar,Jonathan and Marsden,Gary and Nass,Cliff} } @article {15365, title = {MATHEMATICAL MODELS OF HYSTERESIS (DYNAMIC PROBLEMS IN HYSTERESIS)}, year = {2006}, month = {2006/08/21/}, institution = {University of Maryland College Park}, abstract = {This research has further advanced the current state of the art in the areas of dynamic aspects of hysteresis and nonlinear large scale magnetization dynamics. The results of this research will find important engineering applications in the areas of magnetic data storage technology and the emerging technology of {\textquotedblleft}spintronics{\textquotedblright}. Our research efforts have been focused on the following tasks: {\textbullet} Study of fast (pulse) precessional switching of magnetization in magnetic materials. {\textbullet} Analysis of critical fields and critical angles for precessional switching of magnetization. {\textbullet} Development of inverse problem approach to the design of magnetic field pulses for precessional switching of magnetization. {\textbullet} Study of magnetization dynamics induced by spin polarized current injection. {\textbullet} Construction of complete stability diagrams for spin polarized current induced magnetization dynamics. {\textbullet} Development of the averaging technique for the analysis of the slow time scale magnetization dynamics. {\textbullet} Study of thermal effects on magnetization dynamics by using the theory of stochastic processes on graphs.}, author = {Mayergoyz, Issak D} } @conference {13382, title = {MauveDB: supporting model-based user views in database systems}, booktitle = {Proceedings of the 2006 ACM SIGMOD international conference on Management of data}, series = {SIGMOD {\textquoteright}06}, year = {2006}, month = {2006///}, pages = {73 - 84}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Real-world data --- especially when generated by distributed measurement infrastructures such as sensor networks --- tends to be incomplete, imprecise, and erroneous, making it impossible to present it to users or feed it directly into applications. The traditional approach to dealing with this problem is to first process the data using statistical or probabilistic models that can provide more robust interpretations of the data. Current database systems, however, do not provide adequate support for applying models to such data, especially when those models need to be frequently updated as new data arrives in the system. Hence, most scientists and engineers who depend on models for managing their data do not use database systems for archival or querying at all; at best, databases serve as a persistent raw data store.In this paper we define a new abstraction called model-based views and present the architecture of MauveDB, the system we are building to support such views. Just as traditional database views provide logical data independence, model-based views provide independence from the details of the underlying data generating mechanism and hide the irregularities of the data by using models to present a consistent view to the users. MauveDB supports a declarative language for defining model-based views, allows declarative querying over such views using SQL, and supports several different materialization strategies and techniques to efficiently maintain them in the face of frequent updates. We have implemented a prototype system that currently supports views based on regression and interpolation, using the Apache Derby open source DBMS, and we present results that show the utility and performance benefits that can be obtained by supporting several different types of model-based views in a database system.}, keywords = {Query processing, regression, sensor networks, statistical models, uncertain data, views}, isbn = {1-59593-434-0}, doi = {10.1145/1142473.1142483}, url = {http://doi.acm.org/10.1145/1142473.1142483}, author = {Deshpande, Amol and Madden,Samuel} } @article {12636, title = {Measuring human movement for biomechanical applications using markerless motion capture}, journal = {Proceedings of SPIE}, volume = {6056}, year = {2006}, month = {2006///}, pages = {60560R - 60560R}, abstract = {Modern biomechanical and clinical applications require the accurate capture of normal and pathological humanmovement without the artifacts associated with standard marker-based motion capture techniques such as soft tissue artifacts and the risk of artificial stimulus of taped-on or strapped-on markers. In this study, the need for new markerless human motion capture methods is discussed in view of biomechanical applications. Three different approaches for estimating human movement from multiple image sequences were explored. The first two approaches tracked a 3D articulated model in 3D representations constructed from the image sequences, while the third approach tracked a 3D articulated model in multiple 2D image planes. The three methods are systematically evaluated and results for real data are presented. The role of choosing appropriate technical equipment and algorithms for accurate markerless motion capture is critical. The implementation of this new methodology offers the promise for simple, time-efficient, and potentially more meaningful assessments of human movement in research and clinical practice. }, author = {M{\"u}ndermann, L. and Corazza, S. and Chaudhari, A.M. and Andriacchi, T.P. and Sundaresan, A. and Chellapa, Rama} } @book {12356, title = {Memory management for synthesis of DSP software}, year = {2006}, month = {2006///}, publisher = {CRC}, organization = {CRC}, author = {Murthy,P. K and Bhattacharyya, Shuvra S.} } @conference {15483, title = {Model-based testing of community-driven open-source GUI applications}, booktitle = {Software Maintenance, 2006. ICSM{\textquoteright}06. 22nd IEEE International Conference on}, year = {2006}, month = {2006///}, pages = {145 - 154}, abstract = {Although the World-Wide-Web (WWW) has significantly enhanced open-source software (OSS) development, it has also created new challenges for quality assurance (QA), especially for OSS with a graphical-user interface (GUI) front-end. Distributed communities of developers, connected by the WWW, work concurrently on loosely-coupled parts of the OSS and the corresponding GUI code. Due to the unprecedented code churn rates enabled by the WWW, developers may not have time to determine whether their recent modifications have caused integration problems with the overall OSS; these problems can often be detected via GUI integration testing. However, the resource-intensive nature of GUI testing prevents the application of existing automated QA techniques used during conventional OSS evolution. In this paper we develop new process support for three nested techniques that leverage developer communities interconnected by the WWW to automate model-based testing of evolving GUI-based OSS. The "innermost" technique (crash testing) operates on each code check-in of the GUI software and performs a quick and fully automatic integration test. The second technique {smoke testing) operates on each day{\textquoteright}s GUI build and performs functional "reference testing" of the newly integrated version of the GUI. The third (outermost) technique (comprehensive GUI testing) conducts detailed integration testing of a major GUI release. An empirical study involving four popular OSS shows that (1) the overall approach is useful to detect severe faults in GUI-based OSS and (2) the nesting paradigm helps to target feedback and makes effective use of the WWW by implicitly distributing QA}, isbn = {0-7695-2354-4}, doi = {10.1109/ICSM.2006.39}, author = {Xie,Q. and Memon, Atif M.} } @article {18253, title = {Multiuser cross-layer resource allocation for video transmission over wireless networks}, journal = {Network, IEEE}, volume = {20}, year = {2006}, month = {2006/04//march}, pages = {21 - 27}, abstract = {With the advancement of video-compression technology and the wide deployment of wireless networks, there is an increasing demand for wireless video communication services, and many design challenges remain to be overcome. In this article, we discuss how to dynamically allocate resources according to the changing environments and requirements, so as to improve the overall system performance and ensure individual quality of service (QoS). Specifically, we consider two aspects with regard to design issues: cross-layer design, which jointly optimizes resource utilization from the physical layer to the application layer, and multiuser diversity, which explores source and channel heterogeneity for different users. We study how to efficiently transmit multiple video streams, encoded by current and future video codecs, over resource-limited wireless networks such as 3G/4G cellular system and future wireless local/metropolitan area networks (WLANs/WMANs)}, keywords = {3G, allocation;multiuser, allocation;video, cellular, channels;quality, codecs;video, coding;video, communication;4G, communication;data, compression;diversity, cross-layer, diversity;physical, layer;multiple, layer;quality, mobile, networks;3G, of, reception;multiuser, resource, service;resource, service;video, streaming;, streams;multiuser, system;4G, system;QoS;application, technology;wireless, transmission;video-compression, video}, isbn = {0890-8044}, doi = {10.1109/MNET.2006.1607892}, author = {Su,Guan-Ming and Man,Zhu and M. Wu and Liu,K. J.R} } @article {14437, title = {Multi-View Learning and Link Farm Discovery}, journal = {Probabilistic, Logical and Relational Learning-Towards a Synthesis}, year = {2006}, month = {2006///}, abstract = {The first part of this abstract focuses on estimation of mixture models for problems in which multiple views of the instances are available. Examples of this setting include clustering web pages or research papers that have intrinsic (text) and extrinsic (references) attributes. Mixture model estimation is a key problem for both semi-supervised and unsupervised learning. An appropriate optimization criterion quantifies the likelihood and the consensus among models in the individual views; maximizing this consensus minimizes a bound on the risk of assigning an instance to an incorrect mixture component. An EM algorithm maximizes this criterion. The second part of this abstract focuses on the problem of identifying link spam. Search engine optimizers inflate the page rank of a target site by spinning an artificial web for the sole purpose of providing inbound links to the target. Discriminating natural from artificial web sites is a difficult multi-view problem.}, author = {Scheffer,T. and De Raedt,L. and Dietterich,T. and Getoor, Lise and Muggleton,S. H} } @article {13184, title = {Multi-view Reconstruction of Static and Dynamic Scenes}, journal = {Handbook of Mathematical Models in Computer Vision}, year = {2006}, month = {2006///}, pages = {405 - 422}, abstract = {We explore the reconstruction of a three-dimensional scene from multiple images captured from far away viewpoints (wide-baseline camera arrangement). Such an arrangement is required for complex scenes where the visibility flora any one viewpoint is not sufficient to adequately reconstruct the entire scene. Also, such an arrangement reduces the error in triangulation of the features, thereby improving the accuracy of reconstruction. Our emphasis is on algorithms that recover a volumetric model of the scene from calibrated cameras by explicitly modeling and detecting occlusions. We present a brief overview of the state of the art in such methods for multi-view reconstruction. In particular, algorithms based on a probabilistic framework have become quite popular and produce very accurate models. Several such probabilistic volume reconstruction methods will be described. For the dynamic parts of the scene, where an online reconstruction is needed, simpler methods are required. An important case of such scenes is that of walking people in a surveillance scenario. For this case, we present fast online algorithms that recover approximate shape and appearance models and 3D trajectories of people as they walk in the scene. Finally, we address the problem of optimal placement of cameras in order to acquire the best possible image data for the reconstruction of a given scene according to the particular task specification.}, author = {Agrawal,M. and Mittal,A. and Davis, Larry S.} } @conference {15344, title = {New DNS results of shockwave/turbulent boundary layer interaction}, booktitle = {3rd AIAA Flow Control Conference}, year = {2006}, month = {2006///}, author = {Wu,M. and Martin, M.P} } @article {17309, title = {Nuclear Envelope Dystrophies Show a Transcriptional Fingerprint Suggesting Disruption of Rb{\textendash}MyoD Pathways in Muscle Regeneration}, journal = {BrainBrain}, volume = {129}, year = {2006}, month = {2006/04/01/}, pages = {996 - 1013}, abstract = {Mutations of lamin A/C (LMNA) cause a wide range of human disorders, including progeria, lipodystrophy, neuropathies and autosomal dominant Emery{\textendash}Dreifuss muscular dystrophy (EDMD). EDMD is also caused by X-linked recessive loss-of-function mutations of emerin, another component of the inner nuclear lamina that directly interacts with LMNA. One model for disease pathogenesis of LMNA and emerin mutations is cell-specific perturbations of the mRNA transcriptome in terminally differentiated cells. To test this model, we studied 125 human muscle biopsies from 13 diagnostic groups (125 U133A, 125 U133B microarrays), including EDMD patients with LMNA and emerin mutations. A Visual and Statistical Data Analyzer (VISDA) algorithm was used to statistically model cluster hierarchy, resulting in a tree of phenotypic classifications. Validations of the diagnostic tree included permutations of U133A and U133B arrays, and use of two probe set algorithms (MAS5.0 and MBEI). This showed that the two nuclear envelope defects (EDMD LMNA, EDMD emerin) were highly related disorders and were also related to fascioscapulohumeral muscular dystrophy (FSHD). FSHD has recently been hypothesized to involve abnormal interactions of chromatin with the nuclear envelope. To identify disease-specific transcripts for EDMD, we applied a leave-one-out (LOO) cross-validation approach using LMNA patient muscle as a test data set, with reverse transcription{\textendash}polymerase chain reaction (RT{\textendash}PCR) validations in both LMNA and emerin patient muscle. A high proportion of top-ranked and validated transcripts were components of the same transcriptional regulatory pathway involving Rb1 and MyoD during muscle regeneration (CRI-1, CREBBP, Nap1L1, ECREBBP/p300), where each was specifically upregulated in EDMD. Using a muscle regeneration time series (27 time points) we develop a transcriptional model for downstream consequences of LMNA and emerin mutations. We propose that key interactions between the nuclear envelope and Rb and MyoD fail in EDMD at the point of myoblast exit from the cell cycle, leading to poorly coordinated phosphorylation and acetylation steps. Our data is consistent with mutations of nuclear lamina components leading to destabilization of the transcriptome in differentiated cells.}, keywords = {EDMD = Emery{\textendash}Dreifuss muscular dystrophy, emerin, Emery-Dreifuss muscular dystrophy, FSHD = fascioscapulohumeral muscular dystrophy, IDG = individual discriminatory genes, JDG = jointly discriminatory genes, lamin A/C, LGMD = limb-girdle muscular dystrophy, LOO = leave-one-out, RT{\textendash}PCR = reverse transcription{\textendash}polymerase chain reaction; VISDA = Visual and Statistical Data Analyzer, Skeletal muscle, wFC = weighted Fisher criterion}, isbn = {0006-8950, 1460-2156}, doi = {10.1093/brain/awl023}, url = {http://brain.oxfordjournals.org/content/129/4/996}, author = {Bakay,Marina and Wang,Zuyi and Melcon,Gisela and Schiltz,Louis and Xuan,Jianhua and Zhao,Po and Sartorelli,Vittorio and Seo,Jinwook and Pegoraro,Elena and Angelini,Corrado and Shneiderman, Ben and Escolar,Diana and Chen,Yi-Wen and Winokur,Sara T and Pachman,Lauren M and Fan,Chenguang and Mandler,Raul and Nevo,Yoram and Gordon,Erynn and Zhu,Yitan and Dong,Yibin and Wang,Yue and Hoffman,Eric P} } @conference {14010, title = {Numerical Analysis of Plasmon Resonances Based on Fast Multipole Method}, booktitle = {Electromagnetic Field Computation, 2006 12th Biennial IEEE Conference on}, year = {2006}, month = {2006///}, pages = {459 - 459}, abstract = {A novel technique for the numerical analysis of plasmon resonances by using fast multipole method (FMM) is presented. This approach is based on the solution of eigenvalue problem for boundary integral equations, which can be naturally implemented by using the fast multipole method. Numerical examples that highlight the efficiency of the fast multipole implementation are reported}, keywords = {analysis;plasmon, and, boundary, eigenfunctions;plasmons;, equations;eigenvalue, equations;eigenvalues, integral, method;numerical, multipole, problem;fast, resonances;boundary}, doi = {10.1109/CEFC-06.2006.1633249}, author = {Zhang,Zhenyu and Mayergoyz, Issak D and Gumerov, Nail A. and Duraiswami, Ramani} } @article {15395, title = {Numerical analysis of plasmon resonances in nanoparticles}, journal = {Magnetics, IEEE Transactions on}, volume = {42}, year = {2006}, month = {2006/04//}, pages = {759 - 762}, abstract = {Plasmon (electrostatic) resonances in nanoparticles are treated as an eigenvalue problem for a specific boundary integral equation. This leads to direct calculation of resonance values of permittivity and resonance frequency. The numerical technique is illustrated by examples of calculation of resonance frequencies for three-dimensional nanoparticles}, keywords = {3D, analysis;plasmon, and, boundary, eigenfunctions;electrostatics;nanoparticles;permittivity;surface, equation;boundary, equations;eigenvalues, integral, nanoparticles;eigenvalue, plasmon, problem;numerical, resonance;, resonances;specific}, isbn = {0018-9464}, doi = {10.1109/TMAG.2006.870976}, author = {Mayergoyz, Issak D and Zhang,Zhenyu} } @article {15348, title = {A parallel implicit method for the direct numerical simulation of wall-bounded compressible turbulence}, journal = {Journal of Computational Physics}, volume = {215}, year = {2006}, month = {2006///}, pages = {153 - 171}, abstract = {A new second-order accurate implicit temporal numerical scheme for the direct numerical simulation of turbulent flows is presented. The formulation of the implicit method and the corresponding tunable parameters are introduced. The numerical simulation results are compared with the results given by explicit Runge{\textendash}Kutta schemes, theoretical results, and published experimental and numerical data. An assessment of the accuracy and performance of the method to simulate turbulent flows is made for temporally decaying isotropic turbulence and subsonic and supersonic turbulent boundary layers. Whereas no significant advantage over typical explicit time integration methods are found for the incompressible flows; it is shown that the implicit scheme yields significant reduction in computer cost while assuring time-accurate solutions for compressible turbulence simulations.}, keywords = {direct numerical simulation, Implicit time integration, Wall-bounded turbulent flow}, isbn = {0021-9991}, doi = {10.1016/j.jcp.2005.10.017}, url = {http://www.sciencedirect.com/science/article/pii/S0021999105004833}, author = {Martin, M.P and Candler,Graham V.} } @article {13839, title = {Parallel syntactic annotation of multiple languages}, journal = {Proceedings of the Fifth International Conference on Language Resources and Evaluation (LREC2006). Genoa, Italy}, year = {2006}, month = {2006///}, abstract = {This paper describes an effort to investigate the incrementally deepening development of an interlingua notation, validated by humanannotation of texts in English plus six languages. We begin with deep syntactic annotation, and in this paper present a series of annotation manuals for six different languages at the deep-syntactic level of representation. Many syntactic differences between languages are removed in the proposed syntactic annotation, making them useful resources for multilingual NLP projects with semantic components. }, author = {Rambow,O. and Dorr, Bonnie J and Farwell,D. and Green,R. and Habash,N. and Helmreich,S. and Hovy,E. and Levin,L. and Miller,K.J. and Mitamura,T. and others} } @conference {12083, title = {Partially overlapped channels not considered harmful}, booktitle = {Proceedings of the joint international conference on Measurement and modeling of computer systems}, year = {2006}, month = {2006///}, pages = {63 - 74}, author = {Mishra,A. and Shrivastava,V. and Banerjee,S. and Arbaugh, William A.} } @conference {12410, title = {Participatory design with proxies: developing a desktop-PDA system to support people with aphasia}, booktitle = {Proceedings of the SIGCHI conference on Human Factors in computing systems}, series = {CHI {\textquoteright}06}, year = {2006}, month = {2006///}, pages = {151 - 160}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {In this paper, we describe the design and preliminary evaluation of a hybrid desktop-handheld system developed to support individuals with aphasia, a disorder which impairs the ability to speak, read, write, or understand language. The system allows its users to develop speech communication through images and sound on a desktop computer and download this speech to a mobile device that can then support communication outside the home. Using a desktop computer for input addresses some of this population{\textquoteright}s difficulties interacting with handheld devices, while the mobile device addresses stigma and portability issues. A modified participatory design approach was used in which proxies, that is, speech-language pathologists who work with aphasic individuals, assumed the role normally filled by users. This was done because of the difficulties in communicating with the target population and the high variability in aphasic disorders. In addition, the paper presents a case study of the proxy-use participatory design process that illustrates how different interview techniques resulted in different user feedback.}, keywords = {aphasia, assistive technology, multi-modal interfaces, participatory design}, isbn = {1-59593-372-7}, doi = {10.1145/1124772.1124797}, url = {http://doi.acm.org/10.1145/1124772.1124797}, author = {Jordan Boyd-Graber and Nikolova,Sonya S. and Moffatt,Karyn A. and Kin,Kenrick C. and Lee,Joshua Y. and Mackey,Lester W. and Tremaine,Marilyn M. and Klawe,Maria M.} } @article {14631, title = {Patterns of sequence conservation in presynaptic neural genes}, journal = {Genome Biology}, volume = {7}, year = {2006}, month = {2006/11/10/}, pages = {R105 - R105}, abstract = {The neuronal synapse is a fundamental functional unit in the central nervous system of animals. Because synaptic function is evolutionarily conserved, we reasoned that functional sequences of genes and related genomic elements known to play important roles in neurotransmitter release would also be conserved.}, isbn = {1465-6906}, doi = {10.1186/gb-2006-7-11-r105}, url = {http://genomebiology.com/2006/7/11/R105}, author = {Hadley,Dexter and Murphy,Tara and Valladares,Otto and Hannenhalli, Sridhar and Ungar,Lyle and Kim,Junhyong and Bu{\'c}an,Maja} } @article {14383, title = {Probabilistic, Logical and Relational Learning-Towards a Synthesis}, journal = {Dagstuhl Seminar Proceedings}, volume = {5051}, year = {2006}, month = {2006///}, author = {De Raedt,L. and Dietterich,T. and Getoor, Lise and Muggleton,S. H and Lloyd,J. W and Sears,T. D and Milch,B. and Marthi,B. and Russell,S. and Sontag,D.} } @article {17645, title = {Provable algorithms for parallel generalized sweep scheduling}, journal = {Journal of Parallel and Distributed Computing}, volume = {66}, year = {2006}, month = {2006///}, pages = {807 - 821}, author = {Anil Kumar,V. S and Marathe,M. V and Parthasarathy,S. and Srinivasan, Aravind and Zust,S.} } @article {15565, title = {Proximity problems on line segments spanned by points}, journal = {Computational Geometry}, volume = {33}, year = {2006}, month = {2006/02//}, pages = {115 - 129}, abstract = {Finding the closest or farthest line segment (line) from a point are fundamental proximity problems. Given a set S of n points in the plane and another point q, we present optimal O ( n log n ) time, O ( n ) space algorithms for finding the closest and farthest line segments (lines) from q among those spanned by the points in S. We further show how to apply our techniques to find the minimum (maximum) area triangle with a vertex at q and the other two vertices in S \ { q } in optimal O ( n log n ) time and O ( n ) space. Finally, we give an O ( n log n ) time, O ( n ) space algorithm to find the kth closest line from q and show how to find the k closest lines from q in O ( n log n + k ) time and O ( n + k ) space.}, keywords = {Closest, Farthest, k closest lines, Minimum (maximum) area triangle, Proximity problem}, isbn = {0925-7721}, doi = {10.1016/j.comgeo.2005.08.007}, url = {http://www.sciencedirect.com/science/article/pii/S0925772105000805}, author = {Daescu,Ovidiu and Luo,Jun and Mount, Dave} } @conference {16472, title = {Query Rewriting in the Semantic Web7}, booktitle = {Data Engineering Workshops, 22nd International Conference on}, year = {2006}, month = {2006///}, pages = {7 - 7}, publisher = {IEEE Computer Society}, organization = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, abstract = {The widespread explosion of Web accessible resources has lead to a new challenge of locating all relevant resources and identifying the best ones to answer a query. This challenge has to address the difficult task of ranking the resources based on user needs, as well as the more expensive computational task of determining all the solutions to answer a query. In this paper, we define a Top K problem for query rewriting on the Semantic Web. We first introduce a three level data model composed of the ontology level, the physical level of the physical resources, and the data level composed of the entries in the different resources. We present a query language for Top K navigational queries over ontology concepts. We then sketch the outline of an efficient search algorithm to compute an approximation of the Top K rewriting options to produce source paths among the physical resources. We briefly discuss the results of an experimental study}, isbn = {0-7695-2571-7}, doi = {http://doi.ieeecomputersociety.org/10.1109/ICDEW.2006.124}, author = {Vidal,Maria Esther and Raschid, Louiqa and Marquez,Natalia and Cardenas,Marelis and Yao Wu} } @article {12276, title = {Ranking search results in P2P systems}, journal = {Technical Report, CR-TR-4779, Department of Computer Science, University of Maryland}, year = {2006}, month = {2006///}, abstract = {P2P deployments are a natural infrastructure for buildingdistributed search networks. Proposed systems support locating and retrieving all results, but lack the information necessary to rank them. Users, however, are primarily interested in the most relevant, and not all possible results. Using random sampling, we extend a class of well- known information retrieval ranking algorithms such that they can be applied in this distributed setting. We analyze the overhead of our approach, and quantify exactly how our system scales with increasing number of documents, system size, document to node mapping (uniform versus non-uniform), and types of queries (rare versus popular terms). Our analysis and simulations show that a) these extensions are efficient, and can scale with little overhead to large systems, and b) the accuracy of the results ob- tained using distributed ranking is comparable to a cen- tralized implementation. }, author = {Gopalakrishnan,V. and Morselli,R. and Bhattacharjee, Bobby and Keleher,P. and Srinivasan, Aravind} } @article {17649, title = {Ranking search results in peer-to-peer systems}, journal = {Technical Reports from UMIACS}, year = {2006}, month = {2006///}, abstract = {P2P deployments are a natural infrastructure for building distributed search networks. Proposed systems support locating and retrieving all results, but lack the information necessary to rank them. Users, however, are primarily interested in the most relevant, and not all possible results. Using random sampling, we extend a class of well-known information retrieval ranking algorithms such that they can be applied in this distributed setting. We analyze the overhead of our approach, and quantify exactly how our system scales with increasing number of documents, system size, document to node mapping (uniform versus non-uniform), and types of queries (rare versus popular terms). Our analysis and simulations show that a) these extensions are efficient, and can scale with little overhead to large systems, and b) the accuracy of the results obtained using distributed ranking is comparable to a centralized implementation.}, author = {Gopalakrishnan,V. and Morselli,R. and Bhattacharjee, Bobby and Keleher,P. and Srinivasan, Aravind} } @conference {12275, title = {Resource Discovery Techniques in Distributed Desktop Grid Environments}, booktitle = {Proceedings of the 7th IEEE/ACM International Conference on Grid Computing}, series = {GRID {\textquoteright}06}, year = {2006}, month = {2006///}, pages = {9 - 16}, publisher = {IEEE Computer Society}, organization = {IEEE Computer Society}, address = {Washington, DC, USA}, abstract = {Desktop grids use opportunistic sharing to exploit large collections of personal computers and workstations across the Internet, achieving tremendous computing power at low cost. Traditional desktop grid systems are typically based on a client-server architecture, which has inherent shortcomings with respect to robustness, reliability and scalability. In this paper, we propose a decentralized, robust, highly available, and scalable infrastructure to match incoming jobs to available resources. Through a comparative analysis on the experimental results obtained via simulation of three different types of matchmaking algorithms under different workload scenarios, we show the trade-offs between effcient matchmaking and good load balancing in a fully decentralized, heterogeneous computational environment.}, isbn = {1-4244-0343-X}, doi = {10.1109/ICGRID.2006.310992}, url = {http://dx.doi.org/10.1109/ICGRID.2006.310992}, author = {Kim,Jik-Soo and Nam,Beomseok and Keleher,Peter and Marsh,Michael and Bhattacharjee, Bobby and Sussman, Alan} } @article {14641, title = {Retroviral DNA Integration: Viral and Cellular Determinants of Target-Site Selection}, journal = {PLoS PathogPLoS Pathog}, volume = {2}, year = {2006}, month = {2006/06/23/}, pages = {e60 - e60}, abstract = {Retroviruses differ in their preferences for sites for viral DNA integration in the chromosomes of infected cells. Human immunodeficiency virus (HIV) integrates preferentially within active transcription units, whereas murine leukemia virus (MLV) integrates preferentially near transcription start sites and CpG islands. We investigated the viral determinants of integration-site selection using HIV chimeras with MLV genes substituted for their HIV counterparts. We found that transferring the MLV integrase (IN) coding region into HIV (to make HIVmIN) caused the hybrid to integrate with a specificity close to that of MLV. Addition of MLV gag (to make HIVmGagmIN) further increased the similarity of target-site selection to that of MLV. A chimeric virus with MLV Gag only (HIVmGag) displayed targeting preferences different from that of both HIV and MLV, further implicating Gag proteins in targeting as well as IN. We also report a genome-wide analysis indicating that MLV, but not HIV, favors integration near DNase I{\textendash}hypersensitive sites (i.e., +/- 1 kb), and that HIVmIN and HIVmGagmIN also favored integration near these features. These findings reveal that IN is the principal viral determinant of integration specificity; they also reveal a new role for Gag-derived proteins, and strengthen models for integration targeting based on tethering of viral IN proteins to host proteins.}, doi = {10.1371/journal.ppat.0020060}, url = {UR - http://dx.plos.org/10.1371/journal.ppat.0020060,http://dx.plos.org/10.1371/journal.ppat.0020060}, author = {Lewinski,Mary K and Yamashita,Masahiro and Emerman,Michael and Ciuffi,Angela and Marshall,Heather and Crawford,Gregory and Collins,Francis and Shinn,Paul and Leipzig,Jeremy and Hannenhalli, Sridhar and Berry,Charles C and Ecker,Joseph R and Bushman,Frederic D.} } @article {15166, title = {Ring signatures: Stronger definitions, and constructions without random oracles}, journal = {Theory of Cryptography}, year = {2006}, month = {2006///}, pages = {60 - 79}, abstract = {Ring signatures, first introduced by Rivest, Shamir, and Tauman, enable a user to sign a message so that a ring of possible signers (of which the user is a member) is identified, without revealing exactly which member of that ring actually generated the signature. In contrast to group signatures, ring signatures are completely {\textquotedblleft}ad-hoc{\textquotedblright} and do not require any central authority or coordination among the various users (indeed, users do not even need to be aware of each other); furthermore, ring signature schemes grant users fine-grained control over the level of anonymity associated with any particular signature.This paper has two main areas of focus. First, we examine previous definitions of security for ring signature schemes and suggest that most of these prior definitions are too weak, in the sense that they do not take into account certain realistic attacks. We propose new definitions of anonymity and unforgeability which address these threats, and then give separation results proving that our new notions are strictly stronger than previous ones. Next, we show two constructions of ring signature schemes in the standard model: one based on generic assumptions which satisfies our strongest definitions of security, and a second, more efficient scheme achieving weaker security guarantees and more limited functionality. These are the first constructions of ring signature schemes that do not rely on random oracles or ideal ciphers. }, doi = {10.1007/11681878_4}, author = {Bender,A. and Katz, Jonathan and Morselli,R.} } @article {18267, title = {Robust and secure image hashing}, journal = {Information Forensics and Security, IEEE Transactions on}, volume = {1}, year = {2006}, month = {2006/06//}, pages = {215 - 230}, abstract = {Image hash functions find extensive applications in content authentication, database search, and watermarking. This paper develops a novel algorithm for generating an image hash based on Fourier transform features and controlled randomization. We formulate the robustness of image hashing as a hypothesis testing problem and evaluate the performance under various image processing operations. We show that the proposed hash function is resilient to content-preserving modifications, such as moderate geometric and filtering distortions. We introduce a general framework to study and evaluate the security of image hashing systems. Under this new framework, we model the hash values as random variables and quantify its uncertainty in terms of differential entropy. Using this security framework, we analyze the security of the proposed schemes and several existing representative methods for image hashing. We then examine the security versus robustness tradeoff and show that the proposed hashing methods can provide excellent security and robustness.}, keywords = {content-preserving, cryptography;, differential, distortions;, entropy;, Filtering, Fourier, functions;, hash, hashing;, image, modifications;, processing;, secure, theory;, transform;, transforms;}, isbn = {1556-6013}, doi = {10.1109/TIFS.2006.873601}, author = {Swaminathan,A. and Mao,Yinian and M. Wu} } @conference {15677, title = {Routing for data delivery in dynamic networks}, booktitle = {Proceedings of the IEEE MILCOM}, year = {2006}, month = {2006///}, pages = {1 - 7}, author = {Mundur, Padma and Lee,S. and Seligman,M.} } @article {15695, title = {Routing in Delay Tolerant Networks Using Storage Domains}, volume = {UMIACS-TR-2007-01}, year = {2006}, month = {2006/11/20/}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {In this paper, we present a routing algorithm for a class ofdynamic networks called the Delay Tolerant Networks (DTNs). The proposed algorithm takes into account the quintessential DTN characteristic namely, intermittent link connectivity. We modify the breadth first search (BFS) algorithm to take into account link state changes and find the quickest route between source and destination nodes. We adopt a message drop policy at intermediate nodes to incorporate storage constraint. We also introduce the idea of time-varying storage domains where all nodes connected for a length of time act as a single storage unit by sharing the aggregated storage capacity of the nodes. We evaluate the routing algorithm with and without storage domain in an extensive simulation. We analyze the performance using metrics such as delivery ratio, incomplete transfers with no routes and dropped messages. The DTN topology dynamics are analyzed by varying: number of nodes generating traffic, link probability, link availability through combinations of downtime/uptime values, storage per node, message size, and traffic. The delay performance of the proposed algorithms is conceptually the same as flooding-based algorithms but without the penalty of multiple copies. More significantly, we show that the Quickest Storage Domain (Quickest SD) algorithm distributes the storage demand across many nodes in the network topology, enabling balanced load and higher network utilization. In fact, we show that for the same level of performance, we can actually cut the storage requirement in half using the Quickest SD algorithm. }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu//handle/1903/4024}, author = {Mundur, Padma and Lee,Sookyoung and Seligman,Matthew} } @conference {15686, title = {Routing in intermittent network topologies}, booktitle = {Proceedings of the 9th ACM international symposium on Modeling analysis and simulation of wireless and mobile systems}, series = {MSWiM {\textquoteright}06}, year = {2006}, month = {2006///}, pages = {385 - 389}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, keywords = {delay tolerant network (DTN), performance evaluation, routing algorithms}, isbn = {1-59593-477-4}, doi = {10.1145/1164717.1164782}, url = {http://doi.acm.org/10.1145/1164717.1164782}, author = {Mundur, Padma and Lee,Sookyoung and Seligman,Matthew} } @article {14731, title = {Safe manual memory management in Cyclone}, journal = {Science of Computer Programming}, volume = {62}, year = {2006}, month = {2006/10/01/}, pages = {122 - 144}, abstract = {The goal of the Cyclone project is to investigate how to make a low-level C-like language safe. Our most difficult challenge has been providing programmers with control over memory management while retaining safety. This paper describes our experience trying to integrate and use effectively two previously-proposed, safe memory-management mechanisms: statically-scoped regions and tracked pointers. We found that these typing mechanisms can be combined to build alternative memory-management abstractions, such as reference counted objects and arenas with dynamic lifetimes, and thus provide a flexible basis. Our experience {\textemdash} porting C programs and device drivers, and building new applications for resource-constrained systems {\textemdash} confirms that experts can use these features to improve memory footprint and sometimes to improve throughput when used instead of, or in combination with, conservative garbage collection.}, keywords = {cyclone, Memory management, memory safety, Reaps, Reference counting, regions, unique pointers}, isbn = {0167-6423}, doi = {10.1016/j.scico.2006.02.003}, url = {http://www.sciencedirect.com/science/article/pii/S0167642306000785}, author = {Swamy,Nikhil and Hicks, Michael W. and Morrisett,Greg and Grossman,Dan and Jim,Trevor} } @article {15361, title = {Scalar Preisach Models of Hysteresis}, journal = {The Science of Hysteresis: Mathematical modeling and applications}, volume = {1}, year = {2006}, month = {2006///}, pages = {293 - 293}, author = {Mayergoyz, Issak D} } @book {15403, title = {The Science of Hysteresis: Mathematical modeling and applications}, year = {2006}, month = {2006///}, publisher = {Academic Press}, organization = {Academic Press}, keywords = {Business \& Economics / Economics / Microeconomics, Hysteresis, Magnetism, Science / Physics / Magnetism}, isbn = {9780123694317}, author = {Bertotti,Giorgio and Mayergoyz, Issak D} } @conference {18279, title = {Security Issues in Cooperative Communications: Tracing Adversarial Relays}, booktitle = {Acoustics, Speech and Signal Processing, 2006. ICASSP 2006 Proceedings. 2006 IEEE International Conference on}, volume = {4}, year = {2006}, month = {2006/05//}, pages = {IV - IV}, abstract = {Cooperative communication system explores a new dimension of diversity in wireless communications to combat unfriendly wireless environment through strategic relays. While this emerging technology is promising in improving communication quality, some security problems inherent to cooperative relay also arise. In this paper we investigate the security issues in cooperative communications that consist of multiple relay nodes using decode-and-forward strategy. In particular, we consider the situation where one of the relay nodes is adversarial and tries to corrupt the communications by sending garbled signals. We show that the conventional physical-layer signal detection will not be effective in such a scenario, and the application-layer cryptography alone is not sufficient to identify the adversarial relay. To combat adversarial relay, we propose a cross-layer scheme that uses pseudo-random tracing symbols, with an adaptive signal detection rule at the physical layer, and direct sequence spread spectrum symbol construction at the application layer for tracing and identifying adversarial relay. Our experimental simulations show that the proposed tracing scheme is effective and efficient}, keywords = {adaptive, Communication, communications;adaptive, construction;multiple, detection;adversarial, detection;decoding;radiocommunication;telecommunication, issues;strategic, nodes;pseudo-random, relay, relay;decode-and-forward, relays;cooperative, relays;wireless, security;, sequence, signal, spectrum, spread, strategy;direct, symbol, symbols;security, system;cooperative, tracing}, doi = {10.1109/ICASSP.2006.1660907}, author = {Mao,Yinian and M. Wu} } @article {12924, title = {Septaplex PCR assay for rapid identification of Vibrio cholerae including detection of virulence and int SXT genes}, journal = {FEMS Microbiology Letters}, volume = {265}, year = {2006}, month = {2006/12/01/}, pages = {208 - 214}, abstract = {In this study, we describe a septaplex PCR assay for rapid identification of Vibrio cholerae including detection of the virulence and intsxt genes. Conditions were optimized to amplify fragments of ISRrRNA (encoding for 16S{\textendash}23S rRNA gene, Intergenic spacer regions), O1rfb (O1 serogroup specific rfb), O139rfb (O139 serogroup specific rfb), ctxA (cholera toxin subunit A), tcpA (toxin coregulated pilus), and intsxt (sxt integron) simultaneously in a single PCR. The septaplex PCR was evaluated using 211 strains of V. cholerae and six water samples for in situ testing. PCR results were correlated with genotype data obtained by individual PCR and slot-blot assays. The one-step PCR described here can be used to identify V. cholerae accurately and rapidly. Also, the virulence and intsxt genes can be simultaneously detected, providing a useful method for monitoring pathogenic, intsxt-positive and nonpathogenic, intsxt-negative V. cholerae serogroups both in the environment and clinical settings.}, keywords = {DETECTION, intsxt, septaplex PCR, Vibrio cholerae, virulence}, isbn = {1574-6968}, doi = {10.1111/j.1574-6968.2006.00491.x}, url = {http://onlinelibrary.wiley.com/doi/10.1111/j.1574-6968.2006.00491.x/full}, author = {Mantri,Chinmay K. and Mohapatra,Saswat S. and Ramamurthy,Thandavarayan and Ghosh,Raikamal and Rita R Colwell and Singh,Durg V.} } @conference {17538, title = {A structural approach to latency prediction}, booktitle = {Proceedings of the 6th ACM SIGCOMM conference on Internet measurement}, series = {IMC {\textquoteright}06}, year = {2006}, month = {2006///}, pages = {99 - 104}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Several models have been recently proposed for predicting the latency of end to end Internet paths. These models treat the Internet as a black-box, ignoring its internal structure. While these models are simple, they can often fail systematically; for example, the most widely used models use metric embeddings that predict no benefit to detour routes even though half of all Internet routes can benefit from detours.In this paper, we adopt a structural approach that predicts path latency based on measurements of the Internet{\textquoteright}s routing topology, PoP connectivity, and routing policy. We find that our approach outperforms Vivaldi, the most widely used black-box model. Furthermore, unlike metric embeddings, our approach successfully predicts 65\% of detour routes in the Internet. The number of measurements used in our approach is comparable with that required by black box techniques, but using traceroutes instead of pings.}, keywords = {internet topology, latency prediction, route measurements}, isbn = {1-59593-561-4}, doi = {10.1145/1177080.1177092}, url = {http://doi.acm.org/10.1145/1177080.1177092}, author = {Madhyastha,Harsha V. and Anderson,Thomas and Krishnamurthy,Arvind and Spring, Neil and Venkataramani,Arun} } @article {17662, title = {Structure of social contact networks and their impact on epidemics}, journal = {DIMACS Series in Discrete Mathematics and Theoretical Computer Science}, volume = {70}, year = {2006}, month = {2006///}, pages = {181 - 181}, abstract = {Traditional epidemiological research has focused on rate-based differential-equation models on completely mixing populations. In this paper, we outline an approach based on a combination of net- work theory and discrete-event simulations to study epidemics in large urban areas. We survey some of our results published in Nature (2004) and the Proc. ACM-SIAM Symposium on Discrete Algorithms (2004), and present some new results on: (i) mathematical properties of large social contact networks, as well as (ii) simulation-based dynamic anal- ysis of disease-spread in such networks. We identify a number of new measures that are significant for understanding epidemics and for devel- oping new strategies in policy planning. We also perform a very detailed structural analysis of the social contact networks produced by TRAN- SIMS, a simulator for detailed transportation/traffic studies, and study two random graph models to generate realistic social networks: Chung- Lu{\textquoteright}s model and the configuration model. We also develop combinatorial formulations and approximation algorithms for quarantining, vaccina- tion and sensor placement, as aids to decision-making. }, author = {Eubank,S. and Kumar,V. S.A and Marathe,M. V and Srinivasan, Aravind and Wang,N.} } @article {13714, title = {A study of translation edit rate with targeted human annotation}, journal = {Proceedings of Association for Machine Translation in the Americas}, year = {2006}, month = {2006///}, pages = {223 - 231}, abstract = {We examine a new, intuitive measurefor evaluating machine-translation output that avoids the knowledge intensiveness of more meaning-based approaches, and the labor-intensiveness of human judg- ments. Translation Edit Rate (TER) mea- sures the amount of editing that a hu- man would have to perform to change a system output so it exactly matches a reference translation. We show that the single-reference variant of TER correlates as well with human judgments of MT quality as the four-reference variant of BLEU. We also define a human-targeted TER (or HTER) and show that it yields higher correlations with human judgments than BLEU{\textemdash}even when BLEU is given human-targeted references. Our results in- dicate that HTER correlates with human judgments better than HMETEOR and that the four-reference variants of TER and HTER correlate with human judg- ments as well as{\textemdash}or better than{\textemdash}a sec- ond human judgment does. }, author = {Snover,M. and Dorr, Bonnie J and Schwartz,R. and Micciulla,L. and Makhoul,J.} } @conference {15489, title = {Studying the Characteristics of a "Good" GUI Test Suite}, booktitle = {Software Reliability Engineering, 2006. ISSRE {\textquoteright}06. 17th International Symposium on}, year = {2006}, month = {2006/11//}, pages = {159 - 168}, abstract = {The widespread deployment of graphical-user interfaces (GUIs) has increased the overall complexity of testing. A GUI test designer needs to perform the daunting task of adequately testing the GUI, which typically has very large input interaction spaces, while considering tradeoffs between GUI test suite characteristics such as the number of test cases (each modeled as a sequence of events), their lengths, and the event composition of each test case. There are no published empirical studies on GUI testing that a GUI test designer may reference to make decisions about these characteristics. Consequently, in practice, very few GUI testers know how to design their test suites. This paper takes the first step towards assisting in GUI test design by presenting an empirical study that evaluates the effect of these characteristics on testing cost and fault detection effectiveness. The results show that two factors significantly effect the fault-detection effectiveness of a test suite: (1) the diversity of states in which an event executes and (2) the event coverage of the suite. Test designers need to improve the diversity of states in which each event executes by developing a large number of short test cases to detect the majority of "shallow" faults, which are artifacts of modern GUI design. Additional resources should be used to develop a small number of long test cases to detect a small number of "deep" faults}, keywords = {Fault detection, Fault diagnosis, graphical user interface testing, Graphical user interfaces, program debugging, program testing}, doi = {10.1109/ISSRE.2006.45}, author = {Xie,Qing and Memon, Atif M.} } @conference {15352, title = {On Synchronization of Weighted Essentially Non-Oscillatory Methods}, booktitle = {36th AIAA Fluid Dynamics Conference and Exhibit}, year = {2006}, month = {2006///}, address = {San Francisco, CA}, abstract = {Weighted essentially non-oscillatory (WENO) methods have been developed to simul-taneously provide robust shock-capturing in compressible fluid flow and avoid excessive damping of fine-scale flow features such as turbulence. Under certain conditions in com- pressible turbulence, however, numerical dissipation remains unacceptably high even after optimization of the linear component that dominates in smooth regions. We demonstrate that a significant nonlinear source of dissipation error is due to a WENO implementa- tion defect that we call the {\textquotedblleft}synchronization deficiency,{\textquotedblright} and we develop and evaluate a preliminary technique to mitigate its effects. Direct numerical simulations (DNS) include one-dimensional test cases and three-dimensional compressible isotropic turbulence. Al- though we find the current formulation of our mitigation technique to be quite successful for the one-dimensional problems, its efficacy is more modest in the turbulence simulations, and its cost-to-benefit ratio is uncomfortably high. We believe, however, that with further work it will be possible to alleviate these drawbacks. }, author = {Taylor,E. M and Martin, M.P} } @article {13164, title = {SYSTEM AND METHOD FOR FAST ILLUMINATION-INVARIANT BACKGROUND SUBTRACTION USING TWO VIEWS}, volume = {PCT/EP2005/056207}, year = {2006}, month = {2006/06//}, abstract = {A method for eliminating errors in foreground object detection in digitized images comprises providing (1101) a reference camera and a secondary camera, vertically aligning each said camera with a baseline that is approximately perpendicular to a ground plane, wherein said reference camera is placed lower than said secondary camera, selecting (1104) a foreground pixel in a reference view of a first point in a foreground object, finding (1105) a conjugate pixel of the foreground pixel in a secondary view, using (1106) the foreground and conjugate pixels to determine an image base pixel of a base point in the reference view, wherein said base point is a point on the ground plane below the first point, and using (1107) the foreground and image base pixels to find a location where the ground plane is first visible.}, author = {Davis, Larry S. and Lim,S.N. and Mittal,A.} } @article {13167, title = {Task-Driven Video Collection}, journal = {Technical Reports from UMIACS}, year = {2006}, month = {2006/01/23/T17:1}, abstract = {Vision systems are increasingly being deployed to perform complexsurveillance tasks. While improved algorithms are being developed to perform these tasks, it is also important that data suitable for these algorithms be acquired - a non-trivial task in a dynamic and crowded scene viewed by multiple PTZ cameras. In this paper, we describe a multi-camera system that collects images and videos of moving objects in such scenes, subject to task constraints. The system constructs "task visibility intervals" that contain information about what can be sensed in future time intervals. Constructing these intervals requires prediction of future object motion and consideration of several factors such as object occlusion and camera control parameters. Using a plane-sweep algorithm, these atomic intervals can be combined to form multi-task intervals, during which a single camera can collect videos suitable for multiple tasks simultaneously. Although cameras can then be scheduled based on the constructed intervals, finding an optimal schedule is a typical NP-hard problem. Due to this, and the lack of exact future information in a dynamic environment, we propose several methods for fast camera scheduling that yield solutions within a small constant factor of optimal. Experimental results illustrate system capabilities for both real and more complicated simulated scenarios. }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/3042}, author = {Lim,Ser-Nam and Mittal,Anuarg and Davis, Larry S.} } @article {15487, title = {Techniques and processes for improving the quality and performance of open-source software}, journal = {Software Process: Improvement and Practice}, volume = {11}, year = {2006}, month = {2006///}, pages = {163 - 176}, abstract = {Open-source development processes have emerged as an effective approach to reduce cycle-time and decrease design, implementation, and quality assurance (QA) costs for certain types of software, particularly systems infrastructure software, such as operating systems (OS), compilers and language processing tools, text and drawing editors, and middleware. This article presents two contributions to the study of open-source software processes. First, we describe key challenges of open-source software and illustrate how QA processes{\textemdash}specifically those tailored to open-source development{\textemdash}help mitigate these challenges better than traditional closed-source processes do. Second, we summarize results of empirical studies that evaluate how our Skoll distributed continuous quality assurance (DCQA) techniques and processes help to resolve key challenges in developing and validating open-source software. Our results show that: (a) using models to configure and guide the DCQA process improves developer understanding of open-source software, (b) improving the diversity of platform configurations helps QA engineers find defects missed during conventional testing, and (c) centralizing control of QA activities helps to eliminate redundant work. Copyright {\textcopyright} 2006 John Wiley \& Sons, Ltd.}, keywords = {distributed continuous quality assurance, open-source software development and testing}, isbn = {1099-1670}, doi = {10.1002/spip.260}, url = {http://onlinelibrary.wiley.com/doi/10.1002/spip.260/abstract}, author = {Porter, Adam and Yilmaz,Cemal and Memon, Atif M. and Krishna,Arvind S. and Schmidt,Douglas C. and Gokhale,Aniruddha} } @conference {16327, title = {Towards Dependability in Everyday Software Using Software Telemetry}, booktitle = {Engineering of Autonomic and Autonomous Systems, IEEE International Workshop on}, year = {2006}, month = {2006///}, pages = {9 - 18}, publisher = {IEEE Computer Society}, organization = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, abstract = {Application-level software dependability is difficult to ensure. Thus it?s typically used only in custom systems and is achieved using one-of-a-kind, handcrafted solutions. We are interested in understanding whether and how these techniques can be applied to more common, lower-end systems. To this end, we have adapted a condition-based maintenance (CBM) approach called the Multivariate State Estimation Technique (MSET). This approach automatically creates sophisticated statistical models that predict system failure well before failures occur, leading to simpler and more successful recoveries. We have packaged this approach in the Software Dependability Framework (SDF). The SDF consists of instrumentation and data management libraries, a CBM module, performance visualization tools, and a software architecture that supports system designers. Finally, we evaluated our framework on a simple video game application. Our results suggest that we can cheaply and reliably predict impending runtime failures and respond to them in time to improve the system?s dependability.}, isbn = {0-7695-2544-X}, doi = {http://doi.ieeecomputersociety.org/10.1109/EASE.2006.21}, author = {Gross,Kenny C. and Urmanov,Aleksey and Votta,Lawrence G. and McMaster,Scott and Porter, Adam} } @article {14585, title = {Transcriptional Genomics Associates FOX Transcription Factors With Human Heart Failure}, journal = {Circulation}, volume = {114}, year = {2006}, month = {2006///}, pages = {1269 - 1276}, abstract = {Background{\textemdash} Specific transcription factors (TFs) modulate cardiac gene expression in murine models of heart failure, but their relevance in human subjects remains untested. We developed and applied a computational approach called transcriptional genomics to test the hypothesis that a discrete set of cardiac TFs is associated with human heart failure.Methods and Results{\textemdash} RNA isolates from failing (n=196) and nonfailing (n=16) human hearts were hybridized with Affymetrix HU133A arrays, and differentially expressed heart failure genes were determined. TF binding sites overrepresented in the -5-kb promoter sequences of these heart failure genes were then determined with the use of public genome sequence databases. Binding sites for TFs identified in murine heart failure models (MEF2, NKX, NF-AT, and GATA) were significantly overrepresented in promoters of human heart failure genes (P<0.002; false discovery rate 2\% to 4\%). In addition, binding sites for FOX TFs showed substantial overrepresentation in both advanced human and early murine heart failure (P<0.002 and false discovery rate <4\% for each). A role for FOX TFs was supported further by expression of FOXC1, C2, P1, P4, and O1A in failing human cardiac myocytes at levels similar to established hypertrophic TFs and by abundant FOXP1 protein in failing human cardiac myocyte nuclei.Conclusions{\textemdash} Our results provide the first evidence that specific TFs identified in murine models (MEF2, NKX, NFAT, and GATA) are associated with human heart failure. Moreover, these data implicate specific members of the FOX family of TFs (FOXC1, C2, P1, P4, and O1A) not previously suggested in heart failure pathogenesis. These findings provide a crucial link between animal models and human disease and suggest a specific role for FOX signaling in modulating the hypertrophic response of the heart to stress in humans.}, doi = {10.1161/CIRCULATIONAHA.106.632430}, url = {http://circ.ahajournals.org/content/114/12/1269.abstract}, author = {Hannenhalli, Sridhar and Putt,Mary E. and Gilmore,Joan M. and Wang,Junwen and Parmacek,Michael S. and Epstein,Jonathan A. and Morrisey,Edward E. and Margulies,Kenneth B. and Cappola,Thomas P.} } @conference {14750, title = {Trusted declassification:: high-level policy for a security-typed language}, booktitle = {Proceedings of the 2006 workshop on Programming languages and analysis for security}, series = {PLAS {\textquoteright}06}, year = {2006}, month = {2006///}, pages = {65 - 74}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Security-typed languages promise to be a powerful tool with which provably secure software applications may be developed. Programs written in these languages enforce a strong, global policy of noninterferencewhich ensures that high-security data will not be observable on low-security channels. Because noninterference is typically too strong a property, most programs use some form of declassification to selectively leak high security information, e.g. when performing a password check or data encryption. Unfortunately, such a declassification is often expressed as an operation within a given program, rather than as part of a global policy, making reasoning about the security implications of a policy more difficult.In this paper, we propose a simple idea we call trusted declassification in which special declassifier functions are specified as part of the global policy. In particular, individual principals declaratively specify which declassifiers they trust so that all information flows implied by the policy can be reasoned about in absence of a particular program. We formalize our approach for a Java-like language and prove a modified form of noninterference which we call noninterference modulo trusted methods. We have implemented our approach as an extension to Jif and provide some of our experience using it to build a secure e-mail client.}, keywords = {noninterference modolo trusted methods, declassification, FJifP, information-flow control, Jif, security policy, security-typed languages, trusted declassification}, isbn = {1-59593-374-3}, doi = {10.1145/1134744.1134757}, url = {http://doi.acm.org/10.1145/1134744.1134757}, author = {Hicks,Boniface and King,Dave and McDaniel,Patrick and Hicks, Michael W.} } @conference {15343, title = {The turbulence structure of shockwave and boundary layer interaction in a compression corner}, booktitle = {44th AIAA Aerospace Meeting and Exhibit}, volume = {2006}, year = {2006}, month = {2006///}, address = {Reno, NV}, abstract = {Shockwave and turbulent boundary layer interactions (STBLI) result in intense localizedheating rates and pressure loads, making them extremely important flow features that must be identified for engineering design. The absence of detailed and complete experimental and numerical data at the same flow and boundary conditions is one of the major stumbling blocks in the development of accurate turbulence models for the prediction of STBLI. We use a set of direct numerical simulation data (Wu \& Martin, 2006) that has been validated against experiments (Bookey et al., 2005) at the same conditions to present detailed flow features of the STBLI over a compression corner at Mach 3 and low Reynolds number with Reθ=2100. Details regarding the evolution of the turbulence structure angle, characteristic streamwise length scales, and hairpin packets through the interaction are presented. The three-dimensionality of the turbulence field and main shock are illustrated and the strength of shocks and shocklets through the interaction are considered. }, author = {Martin, M.P and Smits,A. and Wu,M. and Ringuette,M.} } @article {15358, title = {Vector Preisach models of hysteresis}, journal = {The Science of Hysteresis: Mathematical modeling and applications}, volume = {1}, year = {2006}, month = {2006///}, pages = {447 - 447}, author = {Mayergoyz, Issak D} } @article {12606, title = {Vehicle Fingerprinting Using Drive-By Sounds}, year = {2006}, month = {2006/11//}, institution = {CENTER FOR AUTOMATION RESEARCH, UNIVERSITY OF MARYLAND COLLEGE PARK}, abstract = {We estimate a vehicle{\textquoteright}s speed, width, and length by jointly estimating its acoustic wave-pattern using a single passive acoustic sensor that records the vehicle{\textquoteright}s drive-by noise. The acoustic wave-pattern is estimated using three envelope shape (ES) components, which approximate the shape of the received signal{\textquoteright}s power envelope. We incorporate the parameters of the ES components along with estimates of the vehicle engine RPM and number of cylinders to form a vehicle profile vector. This vector provides a compressed statistics that can be used for vehicle identification and classification. Vehicle speed estimation and classification results are provided using field data.}, keywords = {*ACOUSTIC DETECTORS, *GROUND VEHICLES, *SIGNAL PROCESSING, ACOUSTIC DETECTION AND DETECTORS, AMPLITUDE, Interference, PASSIVE SYSTEMS, spatial distribution, STATISTICAL PROCESSES, SURFACE TRANSPORTATION AND EQUIPMENT, SYMPOSIA, WAVE PROPAGATION}, url = {http://stinet.dtic.mil/oai/oai?\&verb=getRecord\&metadataPrefix=html\&identifier=ADA481471}, author = {Cevher, V. and Chellapa, Rama and Gurbuz, A.C. and Shah, F. and McClellan, J.H.} } @article {19462, title = {VoIP deregulation in South Africa: Implications for underserviced areas}, journal = {Telecommunications Policy}, volume = {30}, year = {2006}, month = {2006/06//}, pages = {332 - 344}, abstract = {Several statutory restrictions have recently been lifted on the use of Voice over Internet Protocol (VoIP) in South Africa. Previously, VoIP could only be utilised by the incumbent telecommunications operator, Telkom, the Second National Operator (SNO) and under serviced area licensees (USALs). This means new opportunities and cost savings for both network service providers and consumers. However, in rural and remote regions, further liberalisation is required so that service providers can take advantage of wireless technologies to provide connectivity in these areas. This paper discusses the legislative environment in South Africa and around the world with respect to VoIP and Wireless Fidelity (WiFi). In addition, examples are provided of how these technologies have been combined to provide last mile solutions around the world and particularly in South Africa. The paper concludes that further liberalisation in the telecommunications environment in South Africa is required if the goal of providing affordable access in rural areas is to be attained. Specifically, it is recommended that wireless technologies be deregulated since the combination of VoIP and WiFi may benefit rural areas. Also, the paper finds that USALs may not be the right model for underserviced areas in South Africa. Lastly, it is apparent that applications drive development and dictate which technologies are relevant for rural areas.}, keywords = {South Africa, VoIP, WiFi}, isbn = {0308-5961}, url = {http://www.sciencedirect.com/science/article/pii/S0308596106000231}, author = {Marshini Chetty and Blake, Edwin and McPhie, Ewan} } @conference {16353, title = {What do high-level memory models mean for transactions?}, booktitle = {Proceedings of the 2006 workshop on Memory system performance and correctness - MSPC {\textquoteright}06}, year = {2006}, month = {2006///}, pages = {62 - 62}, address = {San Jose, California}, doi = {10.1145/1178597.1178609}, url = {http://dl.acm.org/citation.cfm?id=1178609}, author = {Grossman,Dan and Manson,Jeremy and Pugh, William} } @article {12094, title = {Wireless Network Security and Interworking}, journal = {Proceedings of the IEEE}, volume = {94}, year = {2006}, month = {2006/02//}, pages = {455 - 466}, abstract = {A variety of wireless technologies have been standardized and commercialized, but no single technology is considered the best because of different coverage and bandwidth limitations. Thus, interworking between heterogeneous wireless networks is extremely important for ubiquitous and high-performance wireless communications. Security in interworking is a major challenge due to the vastly different security architectures used within each network. The goal of this paper is twofold. First, we provide a comprehensive discussion of security problems and current technologies in 3G and WLAN systems. Second, we provide introductory discussions about the security problems in interworking, the state-of-the-art solutions, and open problems.}, keywords = {3G mobile communication, 3G systems, Authentication, Bandwidth, Communication system security, computer network security, computer security, Data security, internetworking, Land mobile radio cellular systems, Paper technology, security architectures, security of data, telecommunication security, wireless communication, wireless communications, Wireless LAN, wireless network security, Wireless networks, wireless technologies, WLAN systems}, isbn = {0018-9219}, doi = {10.1109/JPROC.2005.862322}, author = {Shin,M. and Ma,J. and Mishra,A. and Arbaugh, William A.} } @article {15553, title = {The ABCs of AVDs: Geometric Retrieval Made Simple}, journal = {Algorithms and Computation}, year = {2005}, month = {2005///}, pages = {819 - 826}, abstract = {One of the best known structures in computational geometry is the Voronoi diagram. Given a set of n points in space, called sites, this is a subdivision that partitions space into n convex cells according which site is closest. The Voronoi diagram and its dual, the Delaunay triangulation are among the most fundamental proximity structures known, and have numerous uses in science. For example, applying point location to the subdivision defined by a Voronoi diagram answers nearest neighbor queries. Although they are popular in low dimensional spaces, there are various reasons why Voronoi diagrams are rarely used higher dimensions. First, the combinatorial complexity of the diagram grows rapidly, as fast as Ω(nd/2) in d-dimensional space. Second, the diagram does not admit a straightforward search structure in higher dimensions.}, doi = {10.1007/978-3-540-30551-4_2}, author = {Mount, Dave} } @inbook {13416, title = {Active Constrained Clustering by Examining Spectral Eigenvectors}, booktitle = {Discovery ScienceDiscovery Science}, series = {Lecture Notes in Computer Science}, volume = {3735}, year = {2005}, month = {2005///}, pages = {294 - 307}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {This work focuses on the active selection of pairwise constraints for spectral clustering. We develop and analyze a technique for Active Constrained Clustering by Examining Spectral eigenvectorS (ACCESS) derived from a similarity matrix. The ACCESS method uses an analysis based on the theoretical properties of spectral decomposition to identify data items that are likely to be located on the boundaries of clusters, and for which providing constraints can resolve ambiguity in the cluster descriptions. Empirical results on three synthetic and five real data sets show that ACCESS significantly outperforms constrained spectral clustering using randomly selected constraints.}, isbn = {978-3-540-29230-2}, url = {http://dx.doi.org/10.1007/11563983_25}, author = {Xu,Qianjun and desJardins, Marie and Wagstaff,Kiri}, editor = {Hoffmann,Achim and Motoda,Hiroshi and Scheffer,Tobias} } @conference {13490, title = {Adaptive OCR with Limited User Feedback}, booktitle = {8th Int. Conf. on Document Analysis and Recognition (ICDAR{\textquoteright}05)}, year = {2005}, month = {2005/08//}, pages = {814 - 818}, abstract = {A methodology is proposed for processing noisy printed documents with limited user feedback. Without the support of ground truth, a specific collection of scanned documents can be processed to extract character templates. The adaptiveness of this approach lies in that the extracted templates are used to train an OCR classifier quickly and with limited user feedback. Experimental results show that this approach is extremely useful for the processing of noisy documents with many touching characters.}, author = {Ma,Huanfeng and David Doermann} } @conference {17550, title = {Algorithmic aspects of capacity in wireless networks}, booktitle = {Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems}, series = {SIGMETRICS {\textquoteright}05}, year = {2005}, month = {2005///}, pages = {133 - 144}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {This paper considers two inter-related questions: (i) Given a wireless ad-hoc network and a collection of source-destination pairs {(si,ti)}, what is the maximum throughput capacity of the network, i.e. the rate at which data from the sources to their corresponding destinations can be transferred in the network? (ii) Can network protocols be designed that jointly route the packets and schedule transmissions at rates close to the maximum throughput capacity? Much of the earlier work focused on random instances and proved analytical lower and upper bounds on the maximum throughput capacity. Here, in contrast, we consider arbitrary wireless networks. Further, we study the algorithmic aspects of the above questions: the goal is to design provably good algorithms for arbitrary instances. We develop analytical performance evaluation models and distributed algorithms for routing and scheduling which incorporate fairness, energy and dilation (path-length) requirements and provide a unified framework for utilizing the network close to its maximum throughput capacity.Motivated by certain popular wireless protocols used in practice, we also explore "shortest-path like" path selection strategies which maximize the network throughput. The theoretical results naturally suggest an interesting class of congestion aware link metrics which can be directly plugged into several existing routing protocols such as AODV, DSR, etc. We complement the theoretical analysis with extensive simulations. The results indicate that routes obtained using our congestion aware link metrics consistently yield higher throughput than hop-count based shortest path metrics.}, keywords = {capacity modeling, end-to-end scheduling, Linear programming, Wireless networks}, isbn = {1-59593-022-1}, doi = {10.1145/1064212.1064228}, url = {http://doi.acm.org/10.1145/1064212.1064228}, author = {Kumar,V. S. Anil and Marathe,Madhav V. and Parthasarathy,Srinivasan and Srinivasan, Aravind} } @conference {13722, title = {Alignment link projection using transformation-based learning}, booktitle = {Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing}, series = {HLT {\textquoteright}05}, year = {2005}, month = {2005///}, pages = {185 - 192}, publisher = {Association for Computational Linguistics}, organization = {Association for Computational Linguistics}, address = {Stroudsburg, PA, USA}, abstract = {We present a new word-alignment approach that learns errors made by existing word alignment systems and corrects them. By adapting transformation-based learning to the problem of word alignment, we project new alignment links from already existing links, using features such as POS tags. We show that our alignment link projection approach yields a significantly lower alignment error rate than that of the best performing alignment system (22.6\% relative reduction on English-Spanish data and 23.2\% relative reduction on English-Chinese data).}, doi = {10.3115/1220575.1220599}, url = {http://dx.doi.org/10.3115/1220575.1220599}, author = {Ayan,Necip Fazil and Dorr, Bonnie J and Monz,Christof} } @article {18893, title = {Applications of SHOP and SHOP2}, journal = {Intelligent Systems, IEEE}, volume = {20}, year = {2005}, month = {2005/04//march}, pages = {34 - 41}, abstract = {We design the simple hierarchical ordered planner (SHOP) and its successor, SHOP2, with two goals in mind: to investigate research issues in automated planning and to provide some simple, practical planning tools. SHOP and SHOP2 are based on a planning formalism called hierarchical task network planning. SHOP and SHOP2 use a search-control strategy called ordered task decomposition, which breaks tasks into subtasks and generates the plan{\textquoteright}s actions in the same order that the plan executor executes them. So, throughout the planning process, the planner can tell what the state of the world at each step of the plan.}, keywords = {automated planning, hierarchical task network planning, ordered task decomposition, planning (artificial intelligence), problem solving, search-control strategy, simple hierarchical ordered planner, trees (mathematics), uncertainty handling}, isbn = {1541-1672}, doi = {10.1109/MIS.2005.20}, author = {Nau, Dana S. and Au,T.-C. and Ilghami,O. and Kuter,U. and Wu,D. and Yaman,F. and Munoz-Avila,H. and Murdock,J. W.} } @conference {17789, title = {Approximation results for probabilistic survivability}, booktitle = {Multi-Agent Security and Survivability, 2005 IEEE 2nd Symposium on}, year = {2005}, month = {2005/08//}, pages = {1 - 10}, abstract = {As multiagent systems (MASs) are increasingly used in industrial applications, the need to make them more robust and resilient against disruption increases dramatically. The author has developed a probabilistic model (assuming complete ignorance of dependencies between node failures) of survivability based on deploying each agent in a MAS on one or more nodes. Finding a deployment that maximizes survivability is highly intractable for two reasons: firstly, computing the survivability of any deployment is intractable, and secondly, going through an exponential number of deployments to find the best one adds another layer of intractability. In this paper, we study what happens when node failures are independent. We show that computing survivability in this environment is still intractable. We propose various heuristics to compute the survivability of a given deployment. We have implemented and tested all these heuristics. We report on the advantages and disadvantages of different heuristics in different environmental settings.}, keywords = {application;, computing;, failure;, fault, heuristic, heuristics, industrial, model;, multi-agent, multiagent, node, probabilistic, probability;, programming;, survivability;, system;, systems;, testing;, tolerant}, doi = {10.1109/MASSUR.2005.1507042}, author = {Zhang,Y. and Manister,E. and Kraus,S. and V.S. Subrahmanian} } @article {15331, title = {Assessment of STBLI DNS data and comparison against experiments}, journal = {AIAA paper}, year = {2005}, month = {2005///}, author = {Wu,M. and Taylor,E. M and Martin, M.P} } @article {15445, title = {Automating regression testing for evolving GUI software}, journal = {Journal of Software Maintenance and Evolution: Research and Practice}, volume = {17}, year = {2005}, month = {2005///}, pages = {27 - 64}, abstract = {With the widespread deployment of broadband connections worldwide, software development and maintenance are increasingly being performed by multiple engineers, often working around-the-clock to maximize code churn rates. To ensure rapid quality assurance of such software, techniques such as {\textquoteleft}nightly/daily building and smoke testing{\textquoteright} have become widespread since they often reveal bugs early in the software development process. During these builds, a development version of the software is checked out from the source code repository tree, compiled, linked, and (re)tested with the goal of (re)validating its basic functionality. Although successful for conventional software, smoke tests are difficult to develop and automatically re-run for software that has a graphical user interface (GUI). In this paper, we describe a framework called DART (Daily Automated Regression Tester) that addresses the needs of frequent and automated re-testing of GUI software. The key to our success is automation: DART automates everything from structural GUI analysis, smoke-test-case generation, test-oracle creation, to code instrumentation, test execution, coverage evaluation, regeneration of test cases, and their re-execution. Together with the operating system{\textquoteright}s task scheduler, DART can execute frequently with little input from the developer/tester to re-test the GUI software. We provide results of experiments showing the time taken and memory required for GUI analysis, test case and test oracle generation, and test execution. We empirically compare the relative costs of employing different levels of detail in the GUI test oracle. We also show the events and statements covered by the smoke test cases. Copyright {\textcopyright} 2005 John Wiley \& Sons, Ltd.}, keywords = {daily/nightly builds, event-flow graphs, Graphical user interfaces, GUI regression testing, GUI testing, smoke testing, Software quality}, isbn = {1532-0618}, doi = {10.1002/smr.305}, url = {http://onlinelibrary.wiley.com/doi/10.1002/smr.305/abstract}, author = {Memon, Atif M. and Nagarajan,Adithya and Xie,Qing} } @conference {12655, title = {Average relative radiance transform for subpixel detection}, booktitle = {Geoscience and Remote Sensing Symposium, 2005. IGARSS {\textquoteright}05. Proceedings. 2005 IEEE International}, volume = {5}, year = {2005}, month = {2005/07//}, pages = {3565 - 3568}, doi = {10.1109/IGARSS.2005.1526617}, author = {Broadwater, J. and Meth, R. and Chellapa, Rama} } @conference {13056, title = {Bayesian summarization at DUC and a suggestion for extrinsic evaluation}, booktitle = {Document understanding conference}, year = {2005}, month = {2005///}, author = {Daum{\'e}, Hal and Marcu,D.} } @article {16696, title = {The Bible and multilingual optical character recognition}, journal = {Communications of the ACM}, volume = {48}, year = {2005}, month = {2005///}, pages = {124 - 130}, author = {Kanungo,T. and Resnik, Philip and Mao,S. and Kim,D.W. and Zheng,Q.} } @conference {15481, title = {Call stack coverage for test suite reduction}, booktitle = {Software Maintenance, 2005. ICSM{\textquoteright}05. Proceedings of the 21st IEEE International Conference on}, year = {2005}, month = {2005/09//}, pages = {539 - 548}, abstract = {Test suite reduction is an important test maintenance activity that attempts to reduce the size of a test suite with respect to some criteria. Emerging trends in software development such as component reuse, multi-language implementations, and stringent performance requirements present new challenges for existing reduction techniques that may limit their applicability. A test suite reduction technique that is not affected by these challenges is presented; it is based on dynamically generated language-independent information that can be collected with little run-time overhead. Specifically, test cases from the suite being reduced are executed on the application under test and the call stacks produced during execution are recorded. These call stacks are then used as a coverage requirement in a test suite reduction algorithm. Results of experiments on test suites for the space antenna-steering application show significant reduction in test suite size at the cost of a moderate loss in fault detection effectiveness.}, keywords = {call stack coverage, component reuse, Fault detection, language-independent information, multi-language implementation, program testing, software development, software fault tolerance, Software maintenance, software reusability, space antenna-steering application, stringent performance requirement, systems analysis, test suite reduction algorithm}, doi = {10.1109/ICSM.2005.29}, author = {McMaster,S. and Memon, Atif M.} } @article {16110, title = {The Challenge of Personal Information Management}, journal = {INTERACT{\textquoteright}05: Communicating Naturally through Computers (Adjunct Proceedings)}, year = {2005}, month = {2005///}, author = {Dix,A. and Jones,W. and Czerwinski,M. and Teevan,J. and Plaisant, Catherine and Moran,TP} } @article {15678, title = {Class-based access control for distributed video-on-demand systems}, journal = {IEEE Transactions on Circuits and Systems for Video Technology}, volume = {15}, year = {2005}, month = {2005/07//}, pages = {844 - 853}, abstract = {The focus of this paper is the analysis of threshold-based admission control policies for distributed video-on-demand (VoD) systems. Traditionally, admission control methods control access to a resource based on the resource capacity. We have extended that concept to include the significance of an arriving request to the VoD system by enforcing additional threshold restrictions in the admission control process on request classes deemed less significant. We present an analytical model for computing blocking performance of the VoD system under threshold-based admission control. Extending the same methodology to a distributed VoD architecture we show through simulation that the threshold performance conforms to the analytical model. We also show that threshold-based analysis can work in conjunction with other request handling policies and are useful for manipulating the VoD performance since we are able to distinguish between different request classes based on their merit. Enforcing threshold restrictions with the option of downgrading blocked requests in a multirate service environment results in improved performance at the same time providing different levels of quality of service (QoS). In fact, we show that the downgrade option combined with threshold restrictions is a powerful tool for manipulating an incoming request mix over which we have no control into a workload that the VoD system can handle.}, keywords = {Access control, Admission control, Analytical models, blocking performance, class-based access control, Computational modeling, Computer architecture, Computer science, Distributed control, Distributed video-on-demand (VoD) system, distributed video-on-demand system, multimedia systems, multirate service model, Performance analysis, QoS, quality of service, request handling policy, resource allocation, resource capacity, telecommunication congestion control, threshold-based admission control, video on demand}, isbn = {1051-8215}, doi = {10.1109/TCSVT.2005.848351}, author = {Mundur, Padma and Sood,A. K and Simon,R.} } @article {14078, title = {Comparative Genomics of Trypanosomatid Parasitic Protozoa}, journal = {Science}, volume = {309}, year = {2005}, month = {2005/07/15/}, pages = {404 - 409}, abstract = {A comparison of gene content and genome architecture of Trypanosoma brucei, Trypanosoma cruzi, and Leishmania major, three related pathogens with different life cycles and disease pathology, revealed a conserved core proteome of about 6200 genes in large syntenic polycistronic gene clusters. Many species-specific genes, especially large surface antigen families, occur at nonsyntenic chromosome-internal and subtelomeric regions. Retroelements, structural RNAs, and gene family expansion are often associated with syntenic discontinuities that{\textemdash}along with gene divergence, acquisition and loss, and rearrangement within the syntenic regions{\textemdash}have shaped the genomes of each parasite. Contrary to recent reports, our analyses reveal no evidence that these species are descended from an ancestor that contained a photosynthetic endosymbiont.}, doi = {10.1126/science.1112181}, url = {http://www.sciencemag.org/content/309/5733/404.abstract}, author = {El-Sayed, Najib M. and Myler,Peter J. and Blandin,Ga{\"e}lle and Berriman,Matthew and Crabtree,Jonathan and Aggarwal,Gautam and Caler,Elisabet and Renauld,Hubert and Worthey,Elizabeth A. and Hertz-Fowler,Christiane and Ghedin,Elodie and Peacock,Christopher and Bartholomeu,Daniella C. and Haas,Brian J. and Tran,Anh-Nhi and Wortman,Jennifer R. and Alsmark,U. Cecilia M. and Angiuoli,Samuel and Anupama,Atashi and Badger,Jonathan and Bringaud,Frederic and Cadag,Eithon and Carlton,Jane M. and Cerqueira,Gustavo C. and Creasy,Todd and Delcher,Arthur L. and Djikeng,Appolinaire and Embley,T. Martin and Hauser,Christopher and Ivens,Alasdair C. and Kummerfeld,Sarah K. and Pereira-Leal,Jose B. and Nilsson,Daniel and Peterson,Jeremy and Salzberg,Steven L. and Shallom,Joshua and Silva,Joana C. and Sundaram,Jaideep and Westenberger,Scott and White,Owen and Melville,Sara E. and Donelson,John E. and Andersson,Bj{\"o}rn and Stuart,Kenneth D. and Hall,Neil} } @conference {13204, title = {Constructing task visibility intervals for a surveillance system}, booktitle = {Proceedings of the third ACM international workshop on Video surveillance \& sensor networks}, series = {VSSN {\textquoteright}05}, year = {2005}, month = {2005///}, pages = {141 - 148}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {One of the goals of a multi-camera surveillance system is to collect useful video clips of objects in the scene. Objects in the collected videos should be unobstructed, in the field of view of the given camera, and meet task-specific resolution requirement. For this purpose, we describe an algorithm that constructs "task visibility intervals", which are tuples of information about what to sense (task-object pairs), when to sense (feasible future temporal intervals to start a task) and how to sense (the camera to use and the corresponding viewing angles and focal length). The algorithm first looks for temporal intervals within which the angular extents of objects overlap each other, causing the object farthest from the given camera to be occluded. Outside these intervals, sub-intervals are then constructed such that feasible camera settings exist for capturing the object. Experimental results are provided to illustrate the system capabilities in constructing such task visibility intervals, followed by scheduling them using a greedy algorithm.}, keywords = {scheduling, sensor}, isbn = {1-59593-242-9}, doi = {10.1145/1099396.1099421}, url = {http://doi.acm.org/10.1145/1099396.1099421}, author = {Lim,Ser-Nam and Mittal,Anurag and Davis, Larry S.} } @article {17030, title = {Content Index to Volume 18}, journal = {INTERNATIONAL JOURNAL OF HUMAN{\textendash}COMPUTER INTERACTION}, volume = {18}, year = {2005}, month = {2005///}, pages = {367 - 368}, author = {Kuniavsky,M. and Vaughan,M. and Bederson, Benjamin B. and Shneiderman, Ben and Rau,P.L.P. and from Menus,T. and Lane,D.M. and Napier,H.A. and Peres,S.C. and S{\'a}ndor,A.} } @conference {18185, title = {Coordinated sensor deployment for improving secure communications and sensing coverage}, booktitle = {Proceedings of the 3rd ACM workshop on Security of ad hoc and sensor networks}, series = {SASN {\textquoteright}05}, year = {2005}, month = {2005///}, pages = {117 - 128}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Sensor network has a great potential in applications such as habitat monitoring, wildlife tracking, building surveillance, and military combat. The design of a sensor network system involves several important issues, including the sensing coverage, node-to-node or node-to-base-station communications, and the security in information gathering and relay by the sensors. In this paper, we show that the system performance on these aspects depends closely on how the sensors are deployed in the field, and on how the sensor locations can be adjusted after the initial deployment. For static sensor deployment, we investigate the hexagon and square lattice topology and analyze their impact on secure connectivity and sensing coverage. For advanced sensing devices that allow for location adjustment after deployment, we have established a new framework for coordinated updates of sensor locations. We propose two new sensor location updating algorithms, the VFSec and the Weighted Centroid algorithm, to jointly optimize sensing coverage and secure connectivity. Simulation results show that these new algorithms provide superior tradeoff over the existing approaches that do not take security into considerations.}, keywords = {key pre-distribution, location adjustment, secure communications, sensing coverage, sensor deployment}, isbn = {1-59593-227-5}, doi = {10.1145/1102219.1102239}, url = {http://doi.acm.org/10.1145/1102219.1102239}, author = {Mao,Yinian and M. Wu} } @article {12931, title = {Critical Factors Influencing the Occurrence of Vibrio Cholerae in the Environment of Bangladesh}, journal = {Applied and Environmental MicrobiologyAppl. Environ. Microbiol.}, volume = {71}, year = {2005}, month = {2005/08/01/}, pages = {4645 - 4654}, abstract = {The occurrence of outbreaks of cholera in Africa in 1970 and in Latin America in 1991, mainly in coastal communities, and the appearance of the new serotype Vibrio cholerae O139 in India and subsequently in Bangladesh have stimulated efforts to understand environmental factors influencing the growth and geographic distribution of epidemic Vibrio cholerae serotypes. Because of the severity of recent epidemics, cholera is now being considered by some infectious disease investigators as a {\textquotedblleft}reemerging{\textquotedblright} disease, prompting new work on the ecology of vibrios. Epidemiological and ecological surveillance for cholera has been under way in four rural, geographically separated locations in Bangladesh for the past 4 years, during which both clinical and environmental samples were collected at biweekly intervals. The clinical epidemiology portion of the research has been published (Sack et al., J. Infect. Dis. 187:96-101, 2003). The results of environmental sampling and analysis of the environmental and clinical data have revealed significant correlations of water temperature, water depth, rainfall, conductivity, and copepod counts with the occurrence of cholera toxin-producing bacteria (presumably V. cholerae). The lag periods between increases or decreases in units of factors, such as temperature and salinity, and occurrence of cholera correlate with biological parameters, e.g., plankton population blooms. The new information on the ecology of V. cholerae is proving useful in developing environmental models for the prediction of cholera epidemics.}, isbn = {0099-2240, 1098-5336}, doi = {10.1128/AEM.71.8.4645-4654.2005}, url = {http://aem.asm.org/content/71/8/4645}, author = {Huq,Anwar and Sack,R. Bradley and Nizam,Azhar and Longini,Ira M. and Nair,G. Balakrish and Ali,Afsar and Morris,J. Glenn and Khan,M. N. Huda and Siddique,A. Kasem and Yunus,Mohammed and Albert,M. John and Sack,David A. and Rita R Colwell} } @article {14673, title = {Cyclone: A type-safe dialect of C}, journal = {C/C++ Users Journal}, volume = {23}, year = {2005}, month = {2005///}, pages = {112 - 139}, abstract = {If any bug has achieved celebrity status, it is thebuffer overflow. It made front-page news as early as 1987, as the enabler of the Morris worm, the first worm to spread through the Internet. In recent years, attacks exploiting buffer overflows have become more frequent, and more virulent. This year, for exam- ple, the Witty worm was released to the wild less than 48 hours after a buffer overflow vulnerability was publicly announced; in 45 minutes, it infected the entire world-wide population of 12,000 machines running the vulnerable programs. Notably, buffer overflows are a problem only for the C and C++ languages{\textemdash}Java and other {\textquotedblleft}safe{\textquotedblright} lan- guages have built-in protection against them. More- over, buffer overflows appear in C programs written by expert programmers who are security concious{\textemdash} programs such as OpenSSH, Kerberos, and the com- mercial intrusion detection programs that were the target of Witty. This is bad news for C. If security experts have trouble producing overflow-free C programs, then there is not much hope for ordinary C program- mers. On the other hand, programming in Java is no panacea; for certain applications, C has no com- petition. From a programmer{\textquoteright}s point of view, all the safe languages are about the same, while C is a very different beast. }, author = {Grossman,D. and Hicks, Michael W. and Jim,T. and Morrisett,G.} } @article {18188, title = {Data hiding in compiled program binaries for enhancing computer system performance}, journal = {Information Hiding}, year = {2005}, month = {2005///}, pages = {357 - 371}, abstract = {Information hiding has been studied in many security applications such as authentication, copyright management and digital forensics. In this work, we introduce a new application where successful information hiding in compiled program binaries could bring system-wide performance improvements. Our goal is to enhance computer system performance by providing additional information to the processor, without changing the instruction set architecture. We first analyze the statistics of typical programs to demonstrate the feasibility of hiding data in them. We then propose several techniques to hide a large amount of data in the operand fields with very low computation and storage requirements during the extraction process. The data embedding is made reversible to recover the original instructions and to ensure the correct execution of the computer program. Our experiments on the SPEC CPU2000 benchmark programs show that up to 110K bits of information can be embedded in large programs with as little as 3K bits of additional run-time memory in the form of a simple look-up table.}, doi = {10.1007/11558859_26}, author = {Swaminathan,A. and Mao,Y. and Wu,M. and Kailas,K.} } @conference {16482, title = {A data model and query language to explore enhanced links and paths in life science sources}, booktitle = {Proceedings of the ACM SIGMOD Workshop on The Web and Databases (WebDB)}, year = {2005}, month = {2005///}, author = {Mihaila,G. and Naumann,F. and Raschid, Louiqa and Vidal,M. E} } @conference {18560, title = {Design and implementation of a routing control platform}, booktitle = {Proceedings of the 2nd conference on Symposium on Networked Systems Design \& Implementation - Volume 2}, series = {NSDI{\textquoteright}05}, year = {2005}, month = {2005///}, pages = {15 - 28}, publisher = {USENIX Association}, organization = {USENIX Association}, address = {Berkeley, CA, USA}, abstract = {The routers in an Autonomous System (AS) must distribute the information they learn about how to reach external destinations. Unfortunately, today{\textquoteright}s internal Border Gateway Protocol (iBGP) architectures have serious problems: a "full mesh" iBGP configuration does not scale to large networks and "route reflection" can introduce problems such as protocol oscillations and persistent loops. Instead, we argue that a Routing Control Platform (RCP) should collect information about external destinations and internal topology and select the BGP routes for each router in an AS. RCP is a logically-centralized platform, separate from the IP forwarding plane, that performs route selection on behalf of routers and communicates selected routes to the routers using the unmodified iBGP protocol. RCP provides scalability without sacrificing correctness. In this paper, we present the design and implementation of an RCP prototype on commodity hardware. Using traces of BGP and internal routing data from a Tier-1 backbone, we demonstrate that RCP is fast and reliable enough to drive the BGP routing decisions for a large network. We show that RCP assigns routes correctly, even when the functionality is replicated and distributed, and that networks using RCP can expect comparable convergence delays to those using today{\textquoteright}s iBGP architectures.}, url = {http://dl.acm.org/citation.cfm?id=1251203.1251205}, author = {Caesar,Matthew and Caldwell,Donald and Feamster, Nick and Rexford,Jennifer and Shaikh,Aman and van der Merwe,Jacobus} } @conference {19032, title = {Detection of denial-of-message attacks on sensor network broadcasts}, year = {2005}, month = {2005}, pages = {64 - 78}, abstract = {So far sensor network broadcast protocols assume a trustworthy environment. However in safety and mission-critical sensor networks this assumption may not be valid and some sensor nodes might be adversarial. In these environments, malicious sensor nodes can deprive other nodes from receiving a broadcast message. We call this attack a denial-of-message attack (DoM). In this paper we model and analyze this attack, and present countermeasures. We present SIS, a secure implicit sampling scheme that permits a broadcasting base station to probabilistically detect the failure of nodes to receive its broadcast, even if these failures result from an attacker motivated to induce these failures undetectably. SIS works by eliciting authenticated acknowledgments from a subset of nodes per broadcast, where the subset is unpredictable to the attacker and tunable so as to mitigate acknowledgment implosion on the base station. We use a game-theoretic approach to evaluate this scheme in the face of an optimal attacker that attempts to maximize the number of nodes it denies the broadcast while remaining undetected by the base station, and show that SIS significantly constrains such an attacker even in sensor networks exhibiting high intrinsic loss rates. We also discuss extensions that permit more targeted detection capabilities.}, keywords = {authenticated acknowledgments, broadcast channels, broadcast protocols, broadcasting base station, countermeasures, denial-of-message attacks, DoM, game theory, game-theoretic approach, malicious sensor nodes, Mobile computing, optimal attacker, probabilistic detection, probability, Protocols, Sampling methods, secure implicit sampling, sensor network broadcasts, SIS, telecommunication security, Wireless sensor networks}, author = {McCune, J.M. and Elaine Shi and Perrig, A. and Reiter, M.K.} } @article {18203, title = {Dynamic network resource allocation using multimedia content features and ...}, volume = {09/795,952}, year = {2005}, month = {2005/09/20/}, abstract = {A method for dynamically allocating network resources while transferring multimedia at variable bit-rates in a network extracts first content features from the multimedia to determine renegotiation points and observation periods. Second content features and traffic features are extracted from the multimedia bit stream during the observation periods. The second content features and the traffic features are combined in a neural network to predict the network resources to be allocated at the renegotiation points.}, url = {http://www.google.com/patents?id=dToWAAAAEBAJ}, author = {M. Wu and Joyce,Robert A. and Vetro,Anthony and Wong,Hau-San and Guan,Ling and Kung,Sun-Yuan}, editor = {Mitsubishi Electric Research Labs, Inc.} } @article {17114, title = {Dynamic Querying for Pattern Identification in Microarray and Genomic Data (2003)}, year = {2005}, month = {2005///}, abstract = {Data sets involving linear ordered sequences are a recurring theme in bioinformatics. Dynamic query tools that support exploration of these data sets can be useful for identifying patterns of interest. This paper describes the use of one such tool TimeSearcher - to interactively explore linear sequence data sets taken from two bioinformatics problems. Microarray time course data sets involve expression levels for large numbers of genes over multiple time points. TimeSearcher can be used to interactively search these data sets for genes with expression profiles of interest. The occurrence frequencies of short sequences of DNA in aligned exons can be used to identify sequences that play a role in the pre-mRNA splicing. TimeSearcher can be used to search these data sets for candidate splicing signals.}, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/6503}, author = {Hochheiser,Harry and Baehrecke,Eric H and Mount, Stephen M. and Shneiderman, Ben} } @conference {12282, title = {Efficient lookup on unstructured topologies}, booktitle = {Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing}, series = {PODC {\textquoteright}05}, year = {2005}, month = {2005///}, pages = {77 - 86}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {We present LMS, a protocol for efficient lookup on unstructured networks. Our protocol uses a virtual namespace without imposing specific topologies. It is more efficient than existing lookup protocols for unstructured networks, and thus is an attractive alternative for applications in which the topology cannot be structured as a Distributed Hash Table (DHT).We present analytic bounds for the worst-case performance of our protocol. Through detailed simulations (with up to 100,000 nodes), we show that the actual performance on realistic topologies is significantly better. We also show in both simulations and a complete implementation (which includes over five hundred nodes) that our protocol is inherently robust against multiple node failures and can adapt its replication strategy to optimize searches according to a specific heuristic. Moreover, the simulation demonstrates the resilience of LMS to high node turnover rates, and that it can easily adapt to orders of magnitude changes in network size. The overhead incurred by LMS is small, and its performance approaches that of DHTs on networks of similar size.}, keywords = {distributed algorithms, lookup protocols, peer-to-peer networks, random walks}, isbn = {1-58113-994-2}, doi = {10.1145/1073814.1073828}, url = {http://doi.acm.org/10.1145/1073814.1073828}, author = {Morselli,Ruggero and Bhattacharjee, Bobby and Srinivasan, Aravind and Marsh,Michael A} } @article {17592, title = {Efficient strategies for channel management in wireless lans}, journal = {UMD, CS Tech. Rep. CS-TR}, volume = {4729}, year = {2005}, month = {2005///}, abstract = {We define efficient algorithms for channel management (channelassignment and load balancing among APs) in 802.11-based WLANs that lead to better usage of the wireless spectrum. These algorithms (called CFAssign) are based on a {\textquotedblleft}conflict-free set coloring{\textquotedblright} for- mulation that jointly perform load balancing along with channel assignment. Such a formulation has a number of advantages. First, it explicitly captures interference effects at clients. Next, it intrinsi- cally exposes opportunities for better channel re-use. Finally, algo- rithms based on this formulation do not depend on specific physical RF models and hence can be applied efficiently to a wide-range of in-building as well as outdoor scenarios. We have performed extensive packet-level simulations and mea- surements on a deployed wireless testbed of 70 APs to validate the performance of our proposed algorithms. We show that in ad- dition to single network scenarios, CFAssign algorithms are well suited for channel assignment in scenarios where multiple wireless networks share the same physical space and contend for the same frequency spectrum. Our results over a wide range of scenarios indicate that CFAssign reduces the interference at clients by about 50-70\% in comparison to current best-known techniques. }, author = {Mishra,A. and Brik,V. and Banerjee,S. and Srinivasan, Aravind and Arbaugh, William A.} } @article {15441, title = {An evolutionary testbed for software technology evaluation}, journal = {Innovations in Systems and Software Engineering}, volume = {1}, year = {2005}, month = {2005///}, pages = {3 - 11}, abstract = {Empirical evidence and technology evaluation are needed to close the gap between the state of the art and the state of the practice in software engineering. However, there are difficulties associated with evaluating technologies based on empirical evidence: insufficient specification of context variables, cost of experimentation, and risks associated with trying out new technologies. In this paper, we propose the idea of an evolutionary testbed for addressing these problems. We demonstrate the utility of the testbed in empirical studies involving two different research technologies applied to the testbed, as well as the results of these studies. The work is part of NASArsquos High Dependability Computing Project (HDCP), in which we are evaluating a wide range of new technologies for improving the dependability of NASA mission-critical systems.}, doi = {10.1007/s11334-005-0007-z}, author = {Lindvall,M. and Rus,I. and Shull, F. and Zelkowitz, Marvin V and Donzelli,P. and Memon, Atif M. and Basili, Victor R. and Costa,P. and Tvedt,R. and Hochstein, L.} } @article {16389, title = {EvoSTOC Contributions}, journal = {Applications of evolutionary computing: EvoWorkshops 2005, EvoBIO, EvoCOMNET, EvoHOT, EvoIASP, EvoMUSART, and EvoSTOC}, year = {2005}, month = {2005///}, author = {Merkle,D. and Middendorf,M. and Scheidler,A. and Avigad,G. and Moshaiov,A. and Brauner,N. and Parsopoulos,K.E. and Vrahatis,M.N. and Rand, William and Riolo,R} } @conference {13367, title = {Exploiting Correlated Attributes in Acquisitional Query Processing}, booktitle = {21st International Conference on Data Engineering, 2005. ICDE 2005. Proceedings}, year = {2005}, month = {2005/04/05/08}, pages = {143 - 154}, publisher = {IEEE}, organization = {IEEE}, abstract = {Sensor networks and other distributed information systems (such as the Web) must frequently access data that has a high per-attribute acquisition cost, in terms of energy, latency, or computational resources. When executing queries that contain several predicates over such expensive attributes, we observe that it can be beneficial to use correlations to automatically introduce low-cost attributes whose observation will allow the query processor to better estimate the selectivity of these expensive predicates. In particular, we show how to build conditional plans that branch into one or more sub-plans, each with a different ordering for the expensive query predicates, based on the runtime observation of low-cost attributes. We frame the problem of constructing the optimal conditional plan for a given user query and set of candidate low-cost attributes as an optimization problem. We describe an exponential time algorithm for finding such optimal plans, and describe a polynomial-time heuristic for identifying conditional plans that perform well in practice. We also show how to compactly model conditional probability distributions needed to identify correlations and build these plans. We evaluate our algorithms against several real-world sensor-network data sets, showing several-times performance increases for a variety of queries versus traditional optimization techniques.}, keywords = {acquisitional query processing, Computer networks, Costs, data acquisition, Delay, Distributed computing, distributed information system, Distributed information systems, distributed processing, exponential time algorithm, optimization techniques, polynomial-time heuristic, Polynomials, probability, Query processing, real-time systems, real-world sensor-network, Runtime, Sensor phenomena and characterization, Sensor systems}, isbn = {0-7695-2285-8}, doi = {10.1109/ICDE.2005.63}, author = {Deshpande, Amol and Guestrin,C. and Wei Hong and Madden,S.} } @conference {12071, title = {Exploiting partially overlapping channels in wireless networks: Turning a peril into an advantage}, booktitle = {Proceedings of the 5th ACM SIGCOMM conference on Internet Measurement}, year = {2005}, month = {2005///}, pages = {29 - 29}, author = {Mishra,A. and Rozner,E. and Banerjee,S. and Arbaugh, William A.} } @article {17157, title = {Extending User Understanding of Federal Statistics in Tables (2000)}, journal = {Institute for Systems Research Technical Reports}, year = {2005}, month = {2005///}, abstract = {This paper describes progress toward improving user interfaces for US Federal government statistics that are presented in tables. Based on studies of user behaviors and needs related to statistical tables, we describe interfaces to assist diverse users with a range of statistical literacy to explore, find, understand, and use US Federal government statistics.}, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/6473}, author = {Marchionini,Gary and Hert,Carol and Liddy,Liz and Shneiderman, Ben} } @conference {13197, title = {Fast illumination-invariant background subtraction using two views: error analysis, sensor placement and applications}, booktitle = {Computer Vision and Pattern Recognition, 2005. CVPR 2005. IEEE Computer Society Conference on}, volume = {1}, year = {2005}, month = {2005/06//}, pages = {1071 - 1078 vol. 1 - 1071 - 1078 vol. 1}, abstract = {Background modeling and subtraction to detect new or moving objects in a scene is an important component of many intelligent video applications. Compared to a single camera, the use of multiple cameras leads to better handling of shadows, specularities and illumination changes due to the utilization of geometric information. Although the result of stereo matching can be used as the feature for detection, it has been shown that the detection process can be made much faster by a simple subtraction of the intensities observed at stereo-generated conjugate pairs in the two views. The methodology however, suffers from false and missed detections due to some geometric considerations. In this paper, we perform a detailed analysis of such errors. Then, we propose a sensor configuration that eliminates false detections. Algorithms are also proposed that effectively eliminate most detection errors due to missed detections, specular reflections and objects being geometrically close to the background. Experiments on several scenes illustrate the utility and enhanced performance of the proposed approach compared to existing techniques.}, keywords = {analysis;, application;, background, cameras;, configuration;, DETECTION, detection;, error, error;, extraction;, false, feature, handling;, illumination-invariance;, image, intelligent, matching;, modeling;, object, placement;, processing;, sensor, sensors;, shadow, stereo, subtraction;, video}, doi = {10.1109/CVPR.2005.155}, author = {Lim,Ser-Nam and Mittal,A. and Davis, Larry S. and Paragios,N.} } @conference {13557, title = {Font identification using the grating cell texture operator}, booktitle = {SPIE Conference on Document Recogntion and Retreival XXII}, year = {2005}, month = {2005///}, pages = {148 - 156}, abstract = {In this paper, a new feature extraction operator, the grating cell operator, is applied to analyze the texture features and classify fonts of scanned document images. This operator is compared with the isotropic Gabor filter which was also employed for font classification. In order to improve the performance, a back-propagation neural network (BPNN) classifier was applied and compared with the simple weighted Euclidean distance (WED) classifier. Experimental results for five fonts of three scripts show that the grating cell operator performs better than the isotropic Gabor filter, and the BPNN classifier can provide more accurate classification results than the WED classifier.}, author = {Ma,H. and David Doermann} } @article {15385, title = {Forensic recovery of hard disk data by using the spin-stand imaging technique}, journal = {Proceedings of SPIE}, volume = {5778}, year = {2005}, month = {2005/05/20/}, pages = {595 - 606}, abstract = {An ex-situ technique for the drive-independent forensic recovery of data from failed hard drives has been developed.For drives which have suffered damage from a head crash or other mechanical problems and cannot be resuscitatedusing standard software, firmware, or part-replacement techniques, there is currently no commercially available meansto recover the data, even though the files are still stored on the magnetic disks. Here, we report on the results of a spinstandimaging based technology, where the failed disk is removed from its native drive, placed on a spin-stand, andscanned with a giant magnetoresistive head. After track centering, track following, signal detection, data decoding, errorcorrection, and sector mapping, the otherwise unrecoverable data can be retrieved to the computer operating system.Spin-stand based data imaging has the potential to provide recovery at data rates approaching those in the native driveand is a truly drive-independent method to recover hard disk data in a time-efficient manner.}, isbn = {0277786X}, doi = {doi:10.1117/12.602572}, url = {http://spiedigitallibrary.org/proceedings/resource/2/psisdg/5778/1/595_1?isAuthorized=no}, author = {Tse,Chun and Krafft,Charles and Mayergoyz, Issak D and McAvoy,Patrick and Tseng,Chun-Yang} } @article {14076, title = {The genetic map and comparative analysis with the physical map of Trypanosoma brucei}, journal = {Nucleic acids research}, volume = {33}, year = {2005}, month = {2005///}, pages = {6688 - 6688}, author = {MacLeod,A. and Tweedie,A. and McLellan,S. and Taylor,S. and Hall,N. and Berriman,M. and El-Sayed, Najib M. and Hope,M. and Turner,C. M.R and Tait,A.} } @article {19077, title = {The genome of the protist parasite Entamoeba histolytica}, journal = {Nature}, volume = {433}, year = {2005}, month = {2005}, pages = {865 - 868}, author = {Loftus,B. and Anderson,I. and Davies,R. and Alsmark,U. C.M and Samuelson,J. and Amedeo,P. and Roncaglia,P. and Berriman,M. and Hirt,R. P and Mann,B. J and others} } @article {14071, title = {The Genome Sequence of Trypanosoma cruzi, Etiologic Agent of Chagas Disease}, journal = {Science}, volume = {309}, year = {2005}, month = {2005/07/15/}, pages = {409 - 415}, abstract = {Whole-genome sequencing of the protozoan pathogen Trypanosoma cruzi revealed that the diploid genome contains a predicted 22,570 proteins encoded by genes, of which 12,570 represent allelic pairs. Over 50\% of the genome consists of repeated sequences, such as retrotransposons and genes for large families of surface molecules, which include trans-sialidases, mucins, gp63s, and a large novel family (>1300 copies) of mucin-associated surface protein (MASP) genes. Analyses of the T. cruzi, T. brucei, and Leishmania major (Tritryp) genomes imply differences from other eukaryotes in DNA repair and initiation of replication and reflect their unusual mitochondrial DNA. Although the Tritryp lack several classes of signaling molecules, their kinomes contain a large and diverse set of protein kinases and phosphatases; their size and diversity imply previously unknown interactions and regulatory processes, which may be targets for intervention.}, doi = {10.1126/science.1112631}, url = {http://www.sciencemag.org/content/309/5733/409.abstract}, author = {El-Sayed, Najib M. and Myler,Peter J. and Bartholomeu,Daniella C. and Nilsson,Daniel and Aggarwal,Gautam and Tran,Anh-Nhi and Ghedin,Elodie and Worthey,Elizabeth A. and Delcher,Arthur L. and Blandin,Ga{\"e}lle and Westenberger,Scott J. and Caler,Elisabet and Cerqueira,Gustavo C. and Branche,Carole and Haas,Brian and Anupama,Atashi and Arner,Erik and {\r A}slund,Lena and Attipoe,Philip and Bontempi,Esteban and Bringaud,Fr{\'e}d{\'e}ric and Burton,Peter and Cadag,Eithon and Campbell,David A. and Carrington,Mark and Crabtree,Jonathan and Darban,Hamid and da Silveira,Jose Franco and de Jong,Pieter and Edwards,Kimberly and Englund,Paul T. and Fazelina,Gholam and Feldblyum,Tamara and Ferella,Marcela and Frasch,Alberto Carlos and Gull,Keith and Horn,David and Hou,Lihua and Huang,Yiting and Kindlund,Ellen and Klingbeil,Michele and Kluge,Sindy and Koo,Hean and Lacerda,Daniela and Levin,Mariano J. and Lorenzi,Hernan and Louie,Tin and Machado,Carlos Renato and McCulloch,Richard and McKenna,Alan and Mizuno,Yumi and Mottram,Jeremy C. and Nelson,Siri and Ochaya,Stephen and Osoegawa,Kazutoyo and Pai,Grace and Parsons,Marilyn and Pentony,Martin and Pettersson,Ulf and Pop, Mihai and Ramirez,Jose Luis and Rinta,Joel and Robertson,Laura and Salzberg,Steven L. and Sanchez,Daniel O. and Seyler,Amber and Sharma,Reuben and Shetty,Jyoti and Simpson,Anjana J. and Sisk,Ellen and Tammi,Martti T. and Tarleton,Rick and Teixeira,Santuza and Van Aken,Susan and Vogt,Christy and Ward,Pauline N. and Wickstead,Bill and Wortman,Jennifer and White,Owen and Fraser,Claire M. and Stuart,Kenneth D. and Andersson,Bj{\"o}rn} } @article {16291, title = {The Genome Sequence of Trypanosoma Cruzi, Etiologic Agent of Chagas Disease}, journal = {ScienceScience}, volume = {309}, year = {2005}, month = {2005/07/15/}, pages = {409 - 415}, abstract = {Whole-genome sequencing of the protozoan pathogen Trypanosoma cruzi revealed that the diploid genome contains a predicted 22,570 proteins encoded by genes, of which 12,570 represent allelic pairs. Over 50\% of the genome consists of repeated sequences, such as retrotransposons and genes for large families of surface molecules, which include trans-sialidases, mucins, gp63s, and a large novel family (>1300 copies) of mucin-associated surface protein (MASP) genes. Analyses of the T. cruzi, T. brucei, and Leishmania major (Tritryp) genomes imply differences from other eukaryotes in DNA repair and initiation of replication and reflect their unusual mitochondrial DNA. Although the Tritryp lack several classes of signaling molecules, their kinomes contain a large and diverse set of protein kinases and phosphatases; their size and diversity imply previously unknown interactions and regulatory processes, which may be targets for intervention.}, isbn = {0036-8075, 1095-9203}, doi = {10.1126/science.1112631}, url = {http://www.sciencemag.org/content/309/5733/409}, author = {El-Sayed, Najib M. and Myler,Peter J. and Bartholomeu,Daniella C. and Nilsson,Daniel and Aggarwal,Gautam and Tran,Anh-Nhi and Ghedin,Elodie and Worthey,Elizabeth A. and Delcher,Arthur L. and Blandin,Ga{\"e}lle and Westenberger,Scott J. and Caler,Elisabet and Cerqueira,Gustavo C. and Branche,Carole and Haas,Brian and Anupama,Atashi and Arner,Erik and {\r A}slund,Lena and Attipoe,Philip and Bontempi,Esteban and Bringaud,Fr{\'e}d{\'e}ric and Burton,Peter and Cadag,Eithon and Campbell,David A. and Carrington,Mark and Crabtree,Jonathan and Darban,Hamid and da Silveira,Jose Franco and de Jong,Pieter and Edwards,Kimberly and Englund,Paul T. and Fazelina,Gholam and Feldblyum,Tamara and Ferella,Marcela and Frasch,Alberto Carlos and Gull,Keith and Horn,David and Hou,Lihua and Huang,Yiting and Kindlund,Ellen and Klingbeil,Michele and Kluge,Sindy and Koo,Hean and Lacerda,Daniela and Levin,Mariano J. and Lorenzi,Hernan and Louie,Tin and Machado,Carlos Renato and McCulloch,Richard and McKenna,Alan and Mizuno,Yumi and Mottram,Jeremy C. and Nelson,Siri and Ochaya,Stephen and Osoegawa,Kazutoyo and Pai,Grace and Parsons,Marilyn and Pentony,Martin and Pettersson,Ulf and Pop, Mihai and Ramirez,Jose Luis and Rinta,Joel and Robertson,Laura and Salzberg,Steven L. and Sanchez,Daniel O. and Seyler,Amber and Sharma,Reuben and Shetty,Jyoti and Simpson,Anjana J. and Sisk,Ellen and Tammi,Martti T. and Tarleton,Rick and Teixeira,Santuza and Van Aken,Susan and Vogt,Christy and Ward,Pauline N. and Wickstead,Bill and Wortman,Jennifer and White,Owen and Fraser,Claire M. and Stuart,Kenneth D. and Andersson,Bj{\"o}rn} } @article {19073, title = {The genome sequence of Trypanosoma cruzi, etiologic agent of Chagas disease}, journal = {Science}, volume = {309}, year = {2005}, month = {2005}, author = {El-Sayed, N.M. and Myler,P. J and Bartholomeu,D. C and Nilsson,D. and Aggarwal,G. and Tran,A. N and Ghedin,E. and Worthey,E. A and Delcher,A. L and Blandin,G. and others} } @article {18846, title = {Geometric algorithms for containment analysis of rotational parts}, journal = {Computer-Aided Design}, volume = {37}, year = {2005}, month = {2005/02//}, pages = {213 - 230}, abstract = {This paper describes a system and underlying algorithms to perform geometric containment analysis to determine if a newly designed rotational part can be manufactured from a part in an existing database of rotational parts. Only material removal of the database part is considered in order to obtain the newly designed part from the database part. The system uses a three-step algorithm to test for containment. The first step analyzes feasibility of containment using bounding cylinders. If the bounding cylinder of the query part is bigger than the part in the database, then the database part cannot contain the query part and it is eliminated from consideration. The second step analyzes feasibility of containment by ignoring off-axis features. Any part that fails to satisfy containment at this stage is eliminated from consideration. The third step analyzes the remaining parts from the database for feasibility of containment by including the off-axis features. Finally, the system rank-orders all the database parts that can contain the query part based on their volume differences with the query part. The system described in this paper can be used by designers and process planners to find an existing part that can be used as a stock to manufacture a newly designed part. This capability is expected to significantly reduce proliferation of parts, to improve manufacturing responsiveness, and to reduce the cost of new products.}, keywords = {COMPUTER AIDED DESIGN, geometric reasoning, Part containment, Shape signatures, Shape similarity}, isbn = {0010-4485}, doi = {10.1016/j.cad.2004.06.007}, url = {http://www.sciencedirect.com/science/article/pii/S0010448504001186}, author = {Karnik,Mukul and Gupta, Satyandra K. and Magrab,Edward B.} } @conference {13335, title = {The half-edge tree: a compact data structure for level-of-detail tetrahedral meshes}, booktitle = {Shape Modeling and Applications, 2005 International Conference}, year = {2005}, month = {2005/06//}, pages = {332 - 337}, abstract = {We propose a new data structure for the compact encoding of a level-of detail (LOD) model of a three-dimensional scalar field based on unstructured tetrahedral meshes. Such data structure, called a half-edge tree (HET), is built through the iterative application of a half-edge collapse, i.e. by contracting an edge to one of its endpoints. We also show that selective refined meshes extracted from an HET contain on average about 34\% and up to 75\% less tetrahedra than those extracted from an LOD model built through a general edge collapse.}, keywords = {application;, compact, computational, data, detection;, edge, encoding;, generation;, geometry;, half-edge, iterative, level-of-detail, mesh, meshes;, methods;, model;, structure;, structures;, tetrahedral, tree, tree;}, doi = {10.1109/SMI.2005.47}, author = {Danovaro,E. and De Floriani, Leila and Magillo,P. and Puppo,E. and Sobrero,D. and Sokolovsky,N.} } @conference {16668, title = {The Hiero machine translation system: Extensions, evaluation, and analysis}, booktitle = {Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing}, year = {2005}, month = {2005///}, pages = {779 - 786}, author = {Chiang,D. and Lopez,A. and Madnani,N. and Monz,C. and Resnik, Philip and Subotin,M.} } @conference {13569, title = {Identifying Script on Word-Level with Informational Confidence}, booktitle = {8th Int. Conf. on Document Analysis and Recognition}, year = {2005}, month = {2005/08//}, pages = {416 - 420}, abstract = {In this paper, we present a multiple classifier system for script identification. Applying a Gabor filter analysis of textures on word-level, our system identifies Latin and non-Latin words in bilingual printed documents. The classifier system comprises four different architectures based on nearest neighbors, weighted Euclidean distances, Gaussian mixture models, and support vector machines. We report results for Arabic, Chinese, Hindi, and Korean script. Moreover, we show that combining informational confidence values using sum-rule can consistently outperform the best single recognition rate.}, author = {Jaeger,Stefan and Ma,Huanfeng and David Doermann} } @article {15555, title = {Improved approximation bounds for planar point pattern matching}, journal = {Algorithms and Data Structures}, year = {2005}, month = {2005///}, pages = {432 - 443}, abstract = {We consider the well known problem of matching two planar point sets under rigid transformations so as to minimize the directed Hausdorff distance. This is a well studied problem in computational geometry. Goodrich, Mitchell, and Orletsky [GMO94] presented a very simple approximation algorithm for this problem, which computes transformations based on aligning pairs of points. They showed that their algorithm achieves an approximation ratio of 4. We consider a minor modification to their algorithm, which is based on aligning midpoints rather than endpoints. We show that this algorithm achieves an approximation ratio not greater than 3.13. Our analysis is sensitive to the ratio between the diameter of the pattern set and the Hausdorff distance, and we show that the approximation ratio approaches 3 in the limit. Finally, we provide lower bounds that show that our approximation bounds are nearly tight.}, doi = {10.1007/11534273_38}, author = {Cho,M. and Mount, Dave} } @article {13051, title = {Induction of Word and Phrase Alignments for Automatic Document Summarization}, journal = {Computational Linguistics}, volume = {31}, year = {2005}, month = {2005///}, pages = {505 - 530}, isbn = {0891-2017, 1530-9312}, doi = {10.1162/089120105775299140}, url = {http://dl.acm.org/citation.cfm?id=1110825.1110829}, author = {Daum{\'e}, Hal and Marcu,Daniel} } @conference {13805, title = {Iterative translation disambiguation for cross-language information retrieval}, booktitle = {Proceedings of the 28th annual international ACM SIGIR conference on Research and development in information retrieval}, series = {SIGIR {\textquoteright}05}, year = {2005}, month = {2005///}, pages = {520 - 527}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Finding a proper distribution of translation probabilities is one of the most important factors impacting the effectiveness of a cross-language information retrieval system. In this paper we present a new approach that computes translation probabilities for a given query by using only a bilingual dictionary and a monolingual corpus in the target language. The algorithm combines term association measures with an iterative machine learning approach based on expectation maximization. Our approach considers only pairs of translation candidates and is therefore less sensitive to data-sparseness issues than approaches using higher n-grams. The learned translation probabilities are used as query term weights and integrated into a vector-space retrieval system. Results for English-German cross-lingual retrieval show substantial improvements over a baseline using dictionary lookup without term weighting.}, keywords = {cross-language retrieval, query formulation, term co-occurrence measures, term weighting, translation disambiguation}, isbn = {1-59593-034-5}, doi = {10.1145/1076034.1076123}, url = {http://doi.acm.org/10.1145/1076034.1076123}, author = {Monz,Christof and Dorr, Bonnie J} } @conference {16384, title = {The Java memory model}, booktitle = {Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages}, series = {POPL {\textquoteright}05}, year = {2005}, month = {2005///}, pages = {378 - 391}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {This paper describes the new Java memory model, which has been revised as part of Java 5.0. The model specifies the legal behaviors for a multithreaded program; it defines the semantics of multithreaded Java programs and partially determines legal implementations of Java virtual machines and compilers.The new Java model provides a simple interface for correctly synchronized programs -- it guarantees sequential consistency to data-race-free programs. Its novel contribution is requiring that the behavior of incorrectly synchronized programs be bounded by a well defined notion of causality. The causality requirement is strong enough to respect the safety and security properties of Java and weak enough to allow standard compiler and hardware optimizations. To our knowledge, other models are either too weak because they do not provide for sufficient safety/security, or are too strong because they rely on a strong notion of data and control dependences that precludes some standard compiler transformations.Although the majority of what is currently done in compilers is legal, the new model introduces significant differences, and clearly defines the boundaries of legal transformations. For example, the commonly accepted definition for control dependence is incorrect for Java, and transformations based on it may be invalid.In addition to providing the official memory model for Java, we believe the model described here could prove to be a useful basis for other programming languages that currently lack well-defined models, such as C++ and C$\#$.}, keywords = {concurrency, java, memory model, Multithreading}, isbn = {1-58113-830-X}, doi = {10.1145/1040305.1040336}, url = {http://doi.acm.org/10.1145/1040305.1040336}, author = {Manson,Jeremy and Pugh, William and Adve,Sarita V.} } @conference {13033, title = {A large-scale exploration of effective global features for a joint entity detection and tracking model}, booktitle = {Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing}, year = {2005}, month = {2005///}, pages = {97 - 104}, author = {Daum{\'e}, Hal and Marcu,D.} } @conference {18911, title = {Learning approximate preconditions for methods in hierarchical plans}, series = {ICML {\textquoteright}05}, year = {2005}, month = {2005///}, pages = {337 - 344}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {A significant challenge in developing planning systems for practical applications is the difficulty of acquiring the domain knowledge needed by such systems. One method for acquiring this knowledge is to learn it from plan traces, but this method typically requires a huge number of plan traces to converge. In this paper, we show that the problem with slow convergence can be circumvented by having the learner generate solution plans even before the planning domain is completely learned. Our empirical results show that these improvements reduce the size of the training set that is needed to find correct answers to a large percentage of planning problems in the test set.}, isbn = {1-59593-180-5}, doi = {10.1145/1102351.1102394}, url = {http://doi.acm.org/10.1145/1102351.1102394}, author = {Ilghami,Okhtay and Mu{\~n}oz-Avila,H{\'e}ctor and Nau, Dana S. and Aha,David W.} } @conference {13062, title = {Learning as search optimization: approximate large margin methods for structured prediction}, booktitle = {Proceedings of the 22nd international conference on Machine learning}, series = {ICML {\textquoteright}05}, year = {2005}, month = {2005///}, pages = {169 - 176}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Mappings to structured output spaces (strings, trees, partitions, etc.) are typically learned using extensions of classification algorithms to simple graphical structures (eg., linear chains) in which search and parameter estimation can be performed exactly. Unfortunately, in many complex problems, it is rare that exact search or parameter estimation is tractable. Instead of learning exact models and searching via heuristic means, we embrace this difficulty and treat the structured output problem in terms of approximate search. We present a framework for learning as search optimization, and two parameter updates with convergence the-orems and bounds. Empirical evidence shows that our integrated approach to learning and decoding can outperform exact models at smaller computational cost.}, isbn = {1-59593-180-5}, doi = {10.1145/1102351.1102373}, url = {http://doi.acm.org/10.1145/1102351.1102373}, author = {Daum{\'e}, Hal and Marcu,Daniel} } @article {18912, title = {Learning preconditions for planning from plan traces and HTN structure}, journal = {Computational Intelligence}, volume = {21}, year = {2005}, month = {2005///}, pages = {388 - 413}, abstract = {A great challenge in developing planning systems for practical applications is the difficulty of acquiring the domain information needed to guide such systems. This paper describes a way to learn some of that knowledge. More specifically, the following points are discussed. (1) We introduce a theoretical basis for formally defining algorithms that learn preconditions for Hierarchical Task Network (HTN) methods. (2) We describe Candidate Elimination Method Learner (CaMeL), a supervised, eager, and incremental learning process for preconditions of HTN methods. We state and prove theorems about CaMeL{\textquoteright}s soundness, completeness, and convergence properties. (3) We present empirical results about CaMeL{\textquoteright}s convergence under various conditions. Among other things, CaMeL converges the fastest on the preconditions of the HTN methods that are needed the most often. Thus CaMeL{\textquoteright}s output can be useful even before it has fully converged.}, keywords = {candidate elimination, HTN planning, learning, version spaces}, isbn = {1467-8640}, doi = {10.1111/j.1467-8640.2005.00279.x}, url = {http://onlinelibrary.wiley.com/doi/10.1111/j.1467-8640.2005.00279.x/abstract}, author = {Ilghami,Okhtay and Nau, Dana S. and Mu{\~n}oz-Avila,H{\'e}ctor and Aha,David W.} } @article {13006, title = {Magic bullets and golden rules: data sampling in molecular phylogenetics}, journal = {Zoology (Jena)}, volume = {108}, year = {2005}, month = {2005///}, pages = {329 - 336}, abstract = {Data collection for molecular phylogenetic studies is based on samples of both genes and taxa. In an ideal world, with no limitations to resources, as many genes could be sampled as deemed necessary to address phylogenetic problems. Given limited resources in the real world, inadequate (in terms of choice of genes or number of genes) sequences or restricted taxon sampling can adversely affect the reliability or information gained in phylogenetics. Recent empirical and simulation-based studies of data sampling in molecular phylogenetics have reached differing conclusions on how to deal with these problems. Some advocated sampling more genes, others more taxa. There is certainly no {\textquoteright}magic bullet{\textquoteright} that will fit all phylogenetic problems, and no specific {\textquoteright}golden rules{\textquoteright} have been deduced, other than that single genes may not always contain sufficient phylogenetic information. However, several general conclusions and suggestions can be made. One suggestion is that the determination of a multiple, but moderate number (e.g., 6-10) of gene sequences might take precedence over sequencing a larger set of genes and thereby permit the sampling of more taxa for a phylogenetic study.}, doi = {10.1016/j.zool.2005.09.006}, author = {Cummings, Michael P. and Meyer,A.} } @conference {16298, title = {Main effects screening}, booktitle = {Proceedings of the 27th international conference on Software engineering - ICSE {\textquoteright}05}, year = {2005}, month = {2005///}, pages = {293 - 293}, address = {St. Louis, MO, USA}, doi = {10.1145/1062455.1062515}, url = {http://dl.acm.org/citation.cfm?id=1062515}, author = {Yilmaz,Cemal and Krishna,Arvind S. and Memon, Atif M. and Porter, Adam and Schmidt,Douglas C. and Gokhale,Aniruddha and Natarajan,Balachandran} } @conference {15453, title = {Main effects screening: a distributed continuous quality assurance process for monitoring performance degradation in evolving software systems}, booktitle = {Proceedings of the 27th international conference on Software engineering}, series = {ICSE {\textquoteright}05}, year = {2005}, month = {2005///}, pages = {293 - 302}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Developers of highly configurable performance-intensive software systems often use a type of in-house performance-oriented "regression testing" to ensure that their modifications have not adversely affected their software{\textquoteright}s performance across its large configuration space. Unfortunately, time and resource constraints often limit developers to in-house testing of a small number of configurations and unreliable extrapolation from these results to the entire configuration space, which allows many performance bottlenecks and sources of QoS degradation to escape detection until systems are fielded. To improve performance assessment of evolving systems across large configuration spaces, we have developed a distributed continuous quality assurance (DCQA) process called main effects screening that uses in-the-field resources to execute formally designed experiments to help reduce the configuration space, thereby allowing developers to perform more targeted in-house QA. We have evaluated this process via several feasibility studies on several large, widely-used performance-intensive software systems. Our results indicate that main effects screening can detect key sources of performance degradation in large-scale systems with significantly less effort than conventional techniques.}, keywords = {design of experiment theory, distributed continuous quality assurance, performance-oriented regression testing}, isbn = {1-58113-963-2}, doi = {10.1145/1062455.1062515}, url = {http://doi.acm.org/10.1145/1062455.1062515}, author = {Yilmaz,Cemal and Krishna,Arvind S. and Memon, Atif M. and Porter, Adam and Schmidt,Douglas C. and Gokhale,Aniruddha and Natarajan,Balachandran} } @article {13707, title = {A methodology for extrinsic evaluation of text summarization: Does ROUGE correlate}, journal = {Proceedings of the ACL Workshop on Intrinsic and Extrinsic Evaluation Measures for Machine Translation and/or Summarization}, year = {2005}, month = {2005///}, pages = {1 - 8}, abstract = {This paper demonstrates the usefulness of sum-maries in an extrinsic task of relevance judgment based on a new method for measuring agree- ment, Relevance-Prediction, which compares sub- jects{\textquoteright} judgments on summaries with their own judg- ments on full text documents. We demonstrate that, because this measure is more reliable than previ- ous gold-standard measures, we are able to make stronger statistical statements about the benefits of summarization. We found positive correlations be- tween ROUGE scores and two different summary types, where only weak or negative correlations were found using other agreement measures. How- ever, we show that ROUGE may be sensitive to the choice of summarization style. We discuss the im- portance of these results and the implications for fu- ture summarization evaluations. }, author = {Dorr, Bonnie J and Monz,C. and President,S. and Schwartz,R. and Zajic, David} } @conference {14986, title = {Mitigating risk of data loss in preservation environments}, booktitle = {Mass Storage Systems and Technologies, 2005. Proceedings. 22nd IEEE / 13th NASA Goddard Conference on}, year = {2005}, month = {2005/04//}, pages = {39 - 48}, abstract = {Preservation environments manage digital records for time periods that are much longer than that of a single vendor product. A primary requirement is the preservation of the authenticity and integrity of the digital records while simultaneously minimizing the cost of long-term storage, as the data is migrated onto successive generations of technology. The emergence of low-cost storage hardware has made it possible to implement innovative software systems that minimize risk of data loss and preserve authenticity and integrity. This paper describes software mechanisms in use in current persistent archives and presents an example based upon the NARA research prototype persistent archive.}, keywords = {archives;, authentication;, authenticity;, computing;, data, databases;, digital, distributed, environment;, Grid, integrity;, management;, message, objects;, persistent, preservation, record, risk, storage}, doi = {10.1109/MSST.2005.20}, author = {Moore,R.W. and JaJa, Joseph F. and Chadduck,R.} } @article {13387, title = {Model-based approximate querying in sensor networks}, journal = {The VLDB Journal}, volume = {14}, year = {2005}, month = {2005///}, pages = {417 - 443}, abstract = {Declarative queries are proving to be an attractive paradigm for interacting with networks of wireless sensors. The metaphor that {\textquotedblleft}the sensornet is a database{\textquotedblright} is problematic, however, because sensors do not exhaustively represent the data in the real world. In order to map the raw sensor readings onto physical reality, a model of that reality is required to complement the readings. In this article, we enrich interactive sensor querying with statistical modeling techniques. We demonstrate that such models can help provide answers that are both more meaningful, and, by introducing approximations with probabilistic confidences, significantly more efficient to compute in both time and energy. Utilizing the combination of a model and live data acquisition raises the challenging optimization problem of selecting the best sensor readings to acquire, balancing the increase in the confidence of our answer against the communication and data acquisition costs in the network. We describe an exponential time algorithm for finding the optimal solution to this optimization problem, and a polynomial-time heuristic for identifying solutions that perform well in practice. We evaluate our approach on several real-world sensor-network datasets, taking into account the real measured data and communication quality, demonstrating that our model-based approach provides a high-fidelity representation of the real phenomena and leads to significant performance gains versus traditional data acquisition techniques.}, isbn = {1066-8888}, url = {http://dx.doi.org/10.1007/s00778-005-0159-3}, author = {Deshpande, Amol and Guestrin,Carlos and Madden,Samuel and Hellerstein,Joseph and Wei Hong} } @conference {13835, title = {NeurAlign: combining word alignments using neural networks}, booktitle = {Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing}, series = {HLT {\textquoteright}05}, year = {2005}, month = {2005///}, pages = {65 - 72}, publisher = {Association for Computational Linguistics}, organization = {Association for Computational Linguistics}, address = {Stroudsburg, PA, USA}, abstract = {This paper presents a novel approach to combining different word alignments. We view word alignment as a pattern classification problem, where alignment combination is treated as a classifier ensemble, and alignment links are adorned with linguistic features. A neural network model is used to learn word alignments from the individual alignment systems. We show that our alignment combination approach yields a significant 20--34\% relative error reduction over the best-known alignment combination technique on English-Spanish and English-Chinese data.}, doi = {10.3115/1220575.1220584}, url = {http://dx.doi.org/10.3115/1220575.1220584}, author = {Ayan,Necip Fazil and Dorr, Bonnie J and Monz,Christof} } @conference {15600, title = {A new approach to image fusion based on cokriging}, booktitle = {Information Fusion, 2005 8th International Conference on}, volume = {1}, year = {2005}, month = {2005/07//}, pages = {8 pp. - 8 pp.}, abstract = {We consider the image fusion problem involving remotely sensed data. We introduce cokriging as a method to perform fusion. We investigate the advantages of fusing Hyperion with ALI. This evaluation is performed by comparing the classification of the fused data with that of input images and by calculating well-chosen quantitative fusion quality metrics. We consider the invasive species forecasting system (ISFS) project as our fusion application. The fusion of ALI with Hyperion data is studied using PCA and wavelet-based fusion. We then propose utilizing a geostatistical based interpolation method called cokriging as a new approach for image fusion.}, keywords = {ALI;, analysis;, based, cokriging;, component, data;, forecasting, fusion, fusion;, geophysical, geostatistical, Hyperion, image, Interpolation, interpolation;, invasive, ISFS, method;, metrics;, PCA;, principal, processing;, project;, QUALITY, quantitative, remote, remotely, sensed, sensing;, sensor, sensors;, signal, species, system;, techniques;, transforms;, wavelet, wavelet-based}, doi = {10.1109/ICIF.2005.1591912}, author = {Memarsadeghi,N. and Le Moigne,J. and Mount, Dave and Morisette,J.} } @article {15329, title = {New experimental data of STBLI at DNS/LES accessible Reynolds numbers}, journal = {AIAA paper}, volume = {309}, year = {2005}, month = {2005///}, pages = {2005 - 2005}, author = {Bookey,P. and Wyckham,C. and Smits,A. J. and Martin, M.P} } @conference {15333, title = {Preliminary Study of the SGS Time Scales for Compressible Boundary Layers using DNS Data}, booktitle = {43rd AIAA Aerospace Sciences Meeting and Exhibit}, year = {2005}, month = {2005///}, address = {Reno, NV}, abstract = {We use direct numerical simulation data of turbulent boundary layers and a priori testingto estimate the time scales that are associated with the subgrid-scale terms in the conser- vative form of the governing equations. The exact and modeled subgrid-scale terms are gathered from the filtered direct numerical simulation fields for several time steps. The model coefficients are evaluated using the Lagrangian averaging technique. We analyze the time scales directly by performing temporal autocorrelations along fluid particle paths. To assess the subgrid-scale models, we compare the time scales and the quantities given by the exact and modeled representations. It is found that in general, mixed models give a larger integral time scale than that of the exact terms and that the discrepancy is not related to the prescribed memory length associated with the evaluation of the model coefficients. }, author = {Martin, M.P} } @conference {15349, title = {Preliminary Study of the Turbulence Structure in Supersonic Boundary Layers using DNS Data}, booktitle = {35th AIAA Fluid Dynamics Conference}, year = {2005}, month = {2005///}, address = {Toronto, Canada}, abstract = {Direct numerical simulation data are used to visualize coherent structures in turbulentboundary layers at Mach numbers from 0.3 to 7. Different criteria to identify the three- dimensional turbulence structure are selected. We find that using the discriminant of the velocity gradient tensor, the swirling strength and the λ2 criteria give nearly identical results, with λ2 identifying more structures very close to the wall. }, author = {Taylor,E. M and Martin, M.P and Smits,A. J.} } @inbook {17793, title = {Probabilistic Ontologies and Relational Databases}, booktitle = {On the Move to Meaningful Internet Systems 2005: CoopIS, DOA, and ODBASEOn the Move to Meaningful Internet Systems 2005: CoopIS, DOA, and ODBASE}, series = {Lecture Notes in Computer Science}, volume = {3760}, year = {2005}, month = {2005///}, pages = {1 - 17}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {The relational algebra and calculus do not take the semantics of terms into account when answering queries. As a consequence, not all tuples that should be returned in response to a query are always returned, leading to low recall. In this paper, we propose the novel notion of a constrained probabilistic ontology (CPO). We developed the concept of a CPO-enhanced relation in which each attribute of a relation has an associated CPO. These CPOs describe relationships between terms occurring in the domain of that attribute. We show that the relational algebra can be extended to handle CPO-enhanced relations. This allows queries to yield sets of tuples, each of which has a probability of being correct.}, keywords = {Computer, Science}, isbn = {978-3-540-29736-9}, url = {http://dx.doi.org/10.1007/11575771_1}, author = {Udrea,Octavian and Yu,Deng and Hung,Edward and Subrahmanian,V.}, editor = {Meersman,Robert and Tari,Zahir} } @inbook {15499, title = {A process and role-based taxonomy of techniques to make testable COTS components}, booktitle = {Testing Commercial-Off-The-Shelf Components And SystemsTesting Commercial-Off-The-Shelf Components And Systems}, year = {2005}, month = {2005///}, pages = {109 - 140}, publisher = {Springer}, organization = {Springer}, isbn = {3540218718, 9783540218715}, author = {Memon, Atif M.} } @conference {15482, title = {Rapid "crash testing" for continuously evolving GUI-based software applications}, booktitle = {Software Maintenance, 2005. ICSM{\textquoteright}05. Proceedings of the 21st IEEE International Conference on}, year = {2005}, month = {2005/09//}, pages = {473 - 482}, abstract = {Several rapid-feedback-based quality assurance mechanisms are used to manage the quality of continuously evolving software. Even though graphical user interfaces (GUIs) are one of the most important parts of software, there are currently no mechanisms to quickly retest evolving GUI software. We leverage our previous work on GUI testing to define a new automatic GUI re-testing process called "crash testing" that is integrated with GUI evolution. We describe two levels of crash testing: (1) immediate feedback-based in which a developer indicates that a GUI bug was fixed in response to a previously reported crash; only select crash test cases are rerun and the developer is notified of the results in a matter of seconds, and (2) between code changes in which new crash test cases are generated on-the-fly and executed on the GUI. Since the code may be changed by another developer before all the crash tests have been executed, hence requiring restarting of the process, we use a simple rotation-based scheme to ensure that all crash tests are executed over a series of code changes. We show, via empirical studies, that our crash tests are effective at revealing serious problems in the GUI.}, keywords = {crash testing, graphical user interface software retesting, Graphical user interfaces, GUI-based software application, immediate feedback, program testing, rapid-feedback-based quality assurance, software evolution, Software maintenance, software prototyping, Software quality}, doi = {10.1109/ICSM.2005.72}, author = {Xie,Q. and Memon, Atif M.} } @article {15089, title = {Reducing complexity assumptions for statistically-hiding commitment}, journal = {Advances in Cryptology{\textendash}EUROCRYPT 2005}, year = {2005}, month = {2005///}, pages = {614 - 614}, abstract = {Determining the minimal assumptions needed to construct various cryptographic building blocks has been a focal point of research in theoretical cryptography. Here, we revisit the following question: what are the minimal assumptions needed to construct statistically-hiding commitment schemes? Previously, it was known how to construct such schemes based on one-way permutations. We improve upon this by constructing statistically-hiding commitment schemes based on approximable-preimage-size one-way functions. These are one-way functions for which there is an efficient way to approximate the number of preimages of a given output. A special case (for which we show a somewhat simpler construction) is that of regular one-way functions where all outputs have the same number of preimages.We utilize two different approaches in constructing statistically-hiding commitment schemes. Our first approach proceeds by showing that the scheme of Naor et al. can be implemented using any one-way function having an output distribution which is {\textquotedblleft}sufficiently similar{\textquotedblright} to uniform. We then construct one-way functions with this property from approximable-preimage-size one-way functions. Our second approach begins by constructing a commitment scheme which is statistically hiding against an honest-but-curious receiver. We then demonstrate a compiler which transforms any such commitment scheme into one which is statistically hiding even against a malicious receiver. This compiler and its analysis may be of independent interest. }, doi = {10.1007/11426639_4}, author = {Haitner,I. and Horvitz,O. and Katz, Jonathan and Koo,C. Y and Morselli,R. and Shaltiel,R.} } @article {13346, title = {Resource-aware wireless sensor-actuator networks}, journal = {Data Engineering}, volume = {1001}, year = {2005}, month = {2005///}, pages = {40 - 40}, author = {Deshpande, Amol and Guestrin,C. and Madden,S. R} } @inbook {17656, title = {Scheduling on Unrelated Machines Under Tree-Like Precedence Constraints}, booktitle = {Approximation, Randomization and Combinatorial Optimization. Algorithms and TechniquesApproximation, Randomization and Combinatorial Optimization. Algorithms and Techniques}, series = {Lecture Notes in Computer Science}, volume = {3624}, year = {2005}, month = {2005///}, pages = {609 - 609}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {We present polylogarithmic approximations for the R | prec | C max and R | prec |∑ j w j C j problems, when the precedence constraints are {\textquotedblleft}treelike{\textquotedblright} {\textendash} i.e., when the undirected graph underlying the precedences is a forest. We also obtain improved bounds for the weighted completion time and flow time for the case of chains with restricted assignment {\textendash} this generalizes the job shop problem to these objective functions. We use the same lower bound of {\textquotedblleft}congestion+dilation{\textquotedblright}, as in other job shop scheduling approaches. The first step in our algorithm for the R | prec | C max problem with treelike precedences involves using the algorithm of Lenstra, Shmoys and Tardos to obtain a processor assignment with the congestion + dilation value within a constant factor of the optimal. We then show how to generalize the random delays technique of Leighton, Maggs and Rao to the case of trees. For the weighted completion time, we show a certain type of reduction to the makespan problem, which dovetails well with the lower bound we employ for the makespan problem. For the special case of chains, we show a dependent rounding technique which leads to improved bounds on the weighted completion time and new bicriteria bounds for the flow time.}, isbn = {978-3-540-28239-6}, url = {http://dx.doi.org/10.1007/11538462_13}, author = {Kumar, V. and Marathe,Madhav and Parthasarathy,Srinivasan and Srinivasan, Aravind}, editor = {Chekuri,Chandra and Jansen,Klaus and Rolim,Jos{\'e} and Trevisan,Luca} } @conference {13036, title = {Search-based structured prediction as classification}, booktitle = {NIPS Workshop on Advances in Structured Learning for Text and Speech Processing, Whistler, Canada}, year = {2005}, month = {2005///}, author = {Daum{\'e}, Hal and Langford,J. and Marcu,D.} } @conference {18280, title = {Security of feature extraction in image hashing}, booktitle = {Acoustics, Speech, and Signal Processing, 2005. Proceedings. (ICASSP {\textquoteright}05). IEEE International Conference on}, volume = {2}, year = {2005}, month = {2005/03//}, pages = {ii/1041 - ii/1044 Vol. 2 - ii/1041 - ii/1044 Vol. 2}, abstract = {Security and robustness are two important requirements for image hash functions. We introduce "differential entropy" as a metric to quantify the amount of randomness in image hash functions and to study their security. We present a mathematical framework and derive expressions for the proposed security metric for various common image hashing schemes. Using the proposed security metric, we discuss the trade-offs between security and robustness in image hashing.}, keywords = {cryptography;, differential, digital, entropy;, extraction;, feature, functions;, hash, hashing;, image, metric;, processing;, randomness;, robustness;, Security, signature;, signatures;}, doi = {10.1109/ICASSP.2005.1415586}, author = {Swaminathan,A. and Mao,Yinian and M. Wu} } @article {13713, title = {A sentence-trimming approach to multi-document summarization}, journal = {Proceedings of DUC2005}, year = {2005}, month = {2005///}, abstract = {We implemented an initial applicationof a sentence-trimming approach (Trim- mer) to the problem of multi-document summarization in the MSE2005 and DUC2005 tasks. Sentence trimming was incorporated into a feature-based summarization system, called Multi- Document Trimmer (MDT), by us- ing sentence trimming as both a pre- processing stage and a feature for sen- tence ranking. We demonstrate that we were able to port Trimmer easily to this new problem. Although the direct im- pact of sentence trimming was minimal compared to other features used in the system, the interaction of the other fea- tures resulted in trimmed sentences ac- counting for nearly half of the selected summary sentences. }, author = {Zajic, David and Dorr, Bonnie J and Jimmy Lin and Monz,C. and Schwartz,R.} } @article {17841, title = {A simulation and data analysis system for large-scale, data-driven oil reservoir simulation studies}, journal = {Concurrency and Computation: Practice and Experience}, volume = {17}, year = {2005}, month = {2005///}, pages = {1441 - 1467}, author = {Kurc, T. and Catalyurek,U. and Zhang,X. and Saltz, J. and Martino,R. and Wheeler,M. and Peszy{\'n}ska,M. and Sussman, Alan and Hansen,C. and Sen,M. and others} } @article {15026, title = {Space-efficient and fast algorithms for multidimensional dominance reporting and counting}, journal = {Algorithms and Computation}, year = {2005}, month = {2005///}, pages = {1755 - 1756}, abstract = {We present linear-space sub-logarithmic algorithms for handling the 3-dimensional dominance reporting and the 2-dimensional dominance counting problems. Under the RAM model as described in [M. L. Fredman and D. E. Willard. ldquoSurpassing the information theoretic bound with fusion treesrdquo, Journal of Computer and System Sciences, 47:424{\textendash}436, 1993], our algorithms achieve O(log n/loglog n+f) query time for the 3-dimensional dominance reporting problem, where f is the output size, and O(log n/loglog n) query time for the 2-dimensional dominance counting problem. We extend these results to any constant dimension d ge 3, achieving O(n(log n/loglog n)d {\textendash} 3) space and O((log n/loglog n)d {\textendash} 2+ f) query time for the reporting case and O(n(log n/loglog n)d {\textendash} 2) space and O((log n/loglog n)d {\textendash} 1) query time for the counting case.}, doi = {10.1007/978-3-540-30551-4_49}, author = {JaJa, Joseph F. and Mortensen,C. and Shi,Q.} } @conference {15638, title = {Space-time tradeoffs for approximate spherical range counting}, booktitle = {Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms}, series = {SODA {\textquoteright}05}, year = {2005}, month = {2005///}, pages = {535 - 544}, publisher = {Society for Industrial and Applied Mathematics}, organization = {Society for Industrial and Applied Mathematics}, address = {Philadelphia, PA, USA}, abstract = {We present space-time tradeoffs for approximate spherical range counting queries. Given a set S of n data points in Rd along with a positive approximation factor ε, the goal is to preprocess the points so that, given any Euclidean ball B, we can return the number of points of any subset of S that contains all the points within a (1 - ε)-factor contraction of B, but contains no points that lie outside a (1 + ε)-factor expansion of B.In many applications of range searching it is desirable to offer a tradeoff between space and query time. We present here the first such tradeoffs for approximate range counting queries. Given 0 < ε <= 1/2 and a parameter γ, where 2 <= γ <= 1/ε, we show how to construct a data structure of space O(nγd log (1/ε)) that allows us to answer ε-approximate spherical range counting queries in time O(log(nγ) + 1/(εγd-1). The data structure can be built in time O(nγd log (n/ε)) log (1/ε)). Here n, ε, and γ are asymptotic quantities, and the dimension d is assumed to be a fixed constant.At one extreme (low space), this yields a data structure of space O(n log (1/e)) that can answer approximate range queries in time O(logn + 1/(ed-1) which, up to a factor of O(n log (1/e) in space, matches the best known result for approximate spherical range counting queries. At the other extreme (high space), it yields a data structure of space O((n/ed) log(1/ε)) that can answer queries in time O(logn + 1/ε). This is the fastest known query time for this problem.We also show how to adapt these data structures to the problem of computing an ε-approximation to the kth nearest neighbor, where k is any integer from 1 to n given at query time. The space bounds are identical to the range searching results, and the query time is larger only by a factor of O(1/(εγ)).Our approach is broadly based on methods developed for approximate Voronoi diagrams (AVDs), but it involves a number of significant extensions from the context of nearest neighbor searching to range searching. These include generalizing AVD node-separation properties from leaves to internal nodes of the tree and constructing efficient generator sets through a radial decomposition of space. We have also developed new arguments to analyze the time and space requirements in this more general setting.}, isbn = {0-89871-585-7}, url = {http://dl.acm.org/citation.cfm?id=1070432.1070505}, author = {Arya,Sunil and Malamatos,Theocharis and Mount, Dave} } @article {15474, title = {Studying the fault-detection effectiveness of GUI test cases for rapidly evolving software}, journal = {Software Engineering, IEEE Transactions on}, volume = {31}, year = {2005}, month = {2005/10//}, pages = {884 - 896}, abstract = {Software is increasingly being developed/maintained by multiple, often geographically distributed developers working concurrently. Consequently, rapid-feedback-based quality assurance mechanisms such as daily builds and smoke regression tests, which help to detect and eliminate defects early during software development and maintenance, have become important. This paper addresses a major weakness of current smoke regression testing techniques, i.e., their inability to automatically (re)test graphical user interfaces (GUIs). Several contributions are made to the area of GUI smoke testing. First, the requirements for GUI smoke testing are identified and a GUI smoke test is formally defined as a specialized sequence of events. Second, a GUI smoke regression testing process called daily automated regression tester (DART) that automates GUI smoke testing is presented. Third, the interplay between several characteristics of GUI smoke test suites including their size, fault detection ability, and test oracles is empirically studied. The results show that: 1) the entire smoke testing process is feasible in terms of execution time, storage space, and manual effort, 2) smoke tests cannot cover certain parts of the application code, 3) having comprehensive test oracles may make up for not having long smoke test cases, and 4) using certain oracles can make up for not having large smoke test suites.}, keywords = {daily automated regression tester, Fault diagnosis, fault-detection, formal specification, formal verification, Graphical user interfaces, GUI test cases, program testing, quality assurance mechanism, rapidly evolving software, smoke regression testing technique, software development, software fault tolerance, Software maintenance, software prototyping, Software quality, test oracles}, isbn = {0098-5589}, doi = {10.1109/TSE.2005.117}, author = {Memon, Atif M. and Xie,Q.} } @article {16104, title = {Toward a Statistical Knowledge Network (2004)}, journal = {Institute for Systems Research Technical Reports}, year = {2005}, month = {2005///}, abstract = {Statistics support planning and decision making and enormous efforts are made to collect data and produce statistics at all levels of governance. An important principle of democratic societies is that government statistics should be accessible to the broadest possible constituencies to empower better plans and decisions in all aspects of life. Given the potential of near-ubiquitous Internet access in homes and workplaces and efforts by government agencies to mount websites, physical access to large volumes of government is close to a fait accompli. What remains a significant challenge is enabling access to the right statistical information at the right time and in the right form.}, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/6522}, author = {Marchionini,Gary and Haas,Stephanie and Plaisant, Catherine and Shneiderman, Ben and Hert,Carol} } @conference {17444, title = {Turning information visualization innovations into commercial products: lessons to guide the next success}, booktitle = {IEEE Symposium on Information Visualization, 2005. INFOVIS 2005}, year = {2005}, month = {2005/10/23/25}, pages = {241 - 244}, publisher = {IEEE}, organization = {IEEE}, abstract = {As information visualization matures as an academic research field, commercial spinoffs are proliferating, but success stories are harder to find. This is the normal process of emergence for new technologies, but the panel organizers believe that there are certain strategies that facilitate success. To teach these lessons, we have invited several key figures who are seeking to commercialize information visualization tools. The panelists make short presentations, engage in a moderated discussion, and respond to audience questions.}, keywords = {Books, commercial development, commercial product, Computer interfaces, Computer science, data visualisation, Data visualization, Educational institutions, exploratory data analysis, information visualization innovation, information visualization tool, innovation management, Laboratories, Management training, new technology emergence, Technological innovation, technology transfer, Turning, User interfaces}, isbn = {0-7803-9464-X}, doi = {10.1109/INFVIS.2005.1532153}, author = {Shneiderman, Ben and Rao,R. and Andrews,K. and Ahlberg,C. and Brodbeck,D. and Jewitt,T. and Mackinlay,J.} } @article {15098, title = {Two-server password-only authenticated key exchange}, journal = {Applied Cryptography and Network Security}, year = {2005}, month = {2005///}, pages = {175 - 206}, abstract = {Typical protocols for password-based authentication assume a single server which stores all the information (e.g.), the password necessary to authenticate a user. Unfortunately, an inherent limitation of this approach (assuming low-entropy passwords are used) is that the user{\textquoteright}s password is exposed if this server is ever compromised. To address this issue, a number of schemes have been proposed in which a user{\textquoteright}s password information is shared among multiple servers, and these servers cooperate in a threshold manner when the user wants to authenticate.We show here a two-server protocol for this task assuming public parameters available to everyone in the system (as well as the adversary). Ours is the first provably-secure two-server protocol for the important password-only setting (in which the user need remember only a password, and not the servers{\textquoteright} public keys), and is the first two-server protocol (in any setting) with a proof of security in the standard model. }, doi = {10.1007/11496137_1}, author = {Katz, Jonathan and MacKenzie,P. and Taban,G. and Gligor,V.} } @article {15087, title = {Universally composable password-based key exchange}, journal = {Advances in Cryptology{\textendash}Eurocrypt 2005}, year = {2005}, month = {2005///}, pages = {557 - 557}, abstract = {We propose and realize a definition of security for password-based key exchange within the framework of universally composable (UC) security, thus providing security guarantees under arbitrary composition with other protocols. In addition, our definition captures some aspects of the problem that were not adequately addressed by most prior notions. For instance, it does not assume any underlying probability distribution on passwords, nor does it assume independence between passwords chosen by different parties. We also formulate a definition of password-based secure channels, and show that such a definition is achievable given password-based key exchange.Our protocol realizing the new definition of password-based key exchange is in the common reference string model and relies on standard number-theoretic assumptions. The components of our protocol can be instantiated to give a relatively efficient solution which is conceivably usable in practice. We also show that it is impossible to satisfy our definition in the {\textquotedblleft}plain{\textquotedblright} model (e.g., without a common reference string). }, doi = {10.1007/11426639_24}, author = {Canetti,R. and Halevi,S. and Katz, Jonathan and Lindell,Y. and MacKenzie,P.} } @article {12431, title = {Using Iterative Strategies for Aligning Attributed Points in Space}, volume = {ISR-TR-2005-2}, year = {2005}, month = {2005///}, institution = {Institute for Systems Research, University of Maryland, College Park}, abstract = {Signatures based on shape features are expected to be useful for several similarity assessment applications. Such signatures can extract the relevant shape information needed for similarity assessment and ignore the shape information not needed for a particular application.

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

This report introduces iterative strategies for optimally aligning attributed points in space. Iterative strategies presented in this report involve successively applying algorithms that perform alignment under restricted rigid body transformations (e.g., rotations only or translations only) to solve point alignment problems that require higher dimension transformations (e.g., combinations rotations and translations). Our preliminary experimental results show that the idea of using of iterative strategies to solve higher dimension attributed point alignment problems is promising and can be used to perform feature-based shape similarity assessment.}, keywords = {Technical Report}, url = {http://drum.lib.umd.edu//handle/1903/6467}, author = {Cardone, Antonio and Gupta, Satyandra K. and Mount, Dave} } @article {16475, title = {Using Non-random Associations for Predicting Latency in WANs}, journal = {Web Information Systems Engineering {\textendash} WISE 2005}, year = {2005}, month = {2005///}, abstract = {In this paper, we propose a scalable performance management tool for Wide Area Applications. Our objective is to scalably identify non-random associations between pairs of individual Latency Profiles (iLPs) (i.e., latency distributions experienced by clients when connecting to a server) and exploit them in latency prediction. Our approach utilizes Relevance Networks (RNs) to manage tens of thousands of iLPs. Non-random associations between iLPs can be identified by topology-independent measures such as correlation and mutual information. We demonstrate that these non-random associations do indeed have a significant impact in improving the error of latency prediction.}, doi = {10.1007/11581062_48}, author = {Raschid, Louiqa and Ye,Q. and Zadorozhny,V. and Gal,A. and Murthy,H.} } @conference {13345, title = {Using probabilistic models for data management in acquisitional environments}, booktitle = {Proc. CIDR}, year = {2005}, month = {2005///}, pages = {317 - 328}, author = {Deshpande, Amol and Guestrin,C. and Madden,S.} } @article {15664, title = {Vision geometry XIII(San Jose CA, 18-19 January 2005)}, journal = {SPIE proceedings series}, year = {2005}, month = {2005///}, author = {Latecki,L.J. and Mount, Dave and Wu,A. Y} } @inbook {18924, title = {Web Service Composition with Volatile Information}, booktitle = {The Semantic Web {\textendash} ISWC 2005}, series = {Lecture Notes in Computer Science}, volume = {3729}, year = {2005}, month = {2005///}, pages = {52 - 66}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {In many Web service composition problems, information may be needed from Web services during the composition process. Existing research on Web service composition (WSC) procedures has generally assumed that this information will not change. We describe two ways to take such WSC procedures and systematically modify them to deal with volatile information. The black-box approach requires no knowledge of the WSC procedure{\textquoteright}s internals: it places a wrapper around the WSC procedure to deal with volatile information. The gray-box approach requires partial information of those internals, in order to insert coding to perform certain bookkeeping operations. We show theoretically that both approaches work correctly. We present experimental results showing that the WSC procedures produced by the gray-box approach can run much faster than the ones produced by the black-box approach.}, keywords = {Computer science}, isbn = {978-3-540-29754-3}, url = {http://www.springerlink.com/content/y105x8464k54l760/abstract/}, author = {Au,Tsz-Chiu and Kuter,Ugur and Nau, Dana S.}, editor = {Gil,Yolanda and Motta,Enrico and Benjamins,V. and Musen,Mark} } @article {12097, title = {Weighted coloring based channel assignment for WLANs}, journal = {ACM SIGMOBILE Mobile Computing and Communications Review}, volume = {9}, year = {2005}, month = {2005///}, pages = {19 - 31}, author = {Mishra,A. and Banerjee,S. and Arbaugh, William A.} } @article {13489, title = {Adaptive Hindi OCRUsing Generalized Hausdorff Image Comparison}, journal = {ACMTransactions on Asian Language Information Processing}, volume = {26}, year = {2004}, month = {2004///}, pages = {198 - 213}, author = {Ma,Huanfeng and David Doermann} } @inbook {15666, title = {Analyzing the number of samples required for an approximate Monte-Carlo LMS line estimator}, booktitle = {Theory and Applications of Recent Robust MethodsTheory and Applications of Recent Robust Methods}, year = {2004}, month = {2004///}, pages = {207 - 219}, publisher = {Birkh{\"a}user}, organization = {Birkh{\"a}user}, isbn = {3764370602, 9783764370602}, author = {Mount, Dave and Netanyahu,N. S and Zuck,E.} } @article {12710, title = {Appearance tracking using adaptive models in a particle filter}, journal = {Proc. of 6th Asian Conference on Computer Vision (ACCV)}, year = {2004}, month = {2004///}, abstract = {The particle filter is a popular tool for visual tracking. Usually, the appearance model is eitherfixed or rapidly changing and the motion model is simply a random walk with fixed noise vari- ance. Also, the number of particles used is typically fixed. All these factors make the visual tracker unstable. To stabilize the tracker, we propose the following measures: an observation model arising from an adaptive noise variance, and adaptive number of particles. The adaptive- velocity is computed via a first-order linear predictor using the previous particle configuration. Tracking under occlusion is accomplished using robust statistics. Experimental results on track- ing visual objects in long video sequences such as vehicles, tank, and human faces demonstrate the effectiveness and robustness of our algorithm. }, author = {Zhou, S. and Chellapa, Rama and Moghaddam, B.} } @article {15439, title = {Applying Model-based Distributed Continuous Quality Assurance Processes to Enhance Persistent Software Attributes}, journal = {IEEE Software}, volume = {21}, year = {2004}, month = {2004///}, pages = {32 - 40}, abstract = {Time and resource constraints often force developers of highlyconfigurable quality of service (QoS)-intensive software sys- tems to guarantee their system{\textquoteright}s persistent software attributes (PSAs) (e.g., functional correctness, portability, efficiency, and QoS) on very few platform configurations and to extrapolate from these configurations to the entire configuration space, which allows many sources of degradation to escape detec- tion until systems are fielded. This article illustrates how distributed continuous quality assurance (DCQA) processes help improve the assessment of these PSAs across large QoS- intensive software system configuration spaces. We also il- lustrate how model-based DCQA processes enable developers to run formally-designed screening experiments that isolate the most significant configuration options, such as different workload parameters, operating system, compiler flags, fea- ture sets, and/or run-time optimization controls. Our empir- ical results show that DCQA processes can be used monitor, safeguard, and enforce PSAs at an acceptable level of cost and effort. }, author = {Krishna,A. S and Yilmaz,C. and Memon, Atif M. and Porter, Adam and Schmidt,D. C and Gokhale,A. and Natarajan,B.} } @article {12979, title = {Applying permutation tests to tree-based statistical models: extending the R package rpart}, volume = {2004-24}, year = {2004}, month = {2004///}, institution = {University of Maryland Institute for Advanced Computer Studies}, abstract = {Tree-based statistical models are useful for evaluating relationships between predictor and response variables and for generating predictions when the response is unknown. However, current methods of constructing tree-based models do not provide a probabilistic assessment of the models produced. Here we describe our work to use permutation tests to quantitatively estimate the probability of tree-based statistical models. We have extended the rpart (recursive partitioning) package of the R system for statistical data analysis. This extension, rpart.permutation, executes the permutations in parallel, using MPI (Message Passing Interface) to greatly decrease the time necessary to complete the analysis.}, author = {Cummings, Michael P. and Myers,D. S and Mangelson,M} } @conference {15466, title = {ASPIRE: automated systematic protocol implementation robustness evaluation}, booktitle = {Software Engineering Conference, 2004. Proceedings. 2004 Australian}, year = {2004}, month = {2004///}, pages = {241 - 250}, abstract = {Network protocol implementations are susceptible to problems caused by their lack of ability to handle invalid inputs. We present ASPIRE: automated systematic protocol implementation robustness evaluation, an automated approach to pro-actively test protocol implementations by observing their responses to faulty protocol data units (PDUs) or messages. In contrast to existing approaches, we sample the faulty PDU space in a systematic manner, thus allowing us to evaluate protocol implementations in the face of a wider variety of faulty PDUs. We use a pruning strategy to reduce, from exponential, the size of the faulty PDU set to polynomial in the number of fields of a PDU. We have implemented the ASPIRE algorithms and evaluated them on implementations of HTTP (Apache, Google Web Server (GWS), and Microsoft IIS) and SMTP (Sendmail and Microsoft Exchange) protocols. Our results show that Apache, GWS, and IIS, although implementing the same protocol specification, behave differently on faulty HTTP PDUs; Sendmail and exchange are different in handling our faulty SMTP PDUs.}, keywords = {algorithm, ASPIRE, automated systematic protocol, automated testing, fault tolerant computing, faulty PDU, formal specification, HTTP, implementation robustness evaluation, Internet, network protocol, protocol data unit, protocol specification, robustness testing, SMTP protocol, stateful protocols, stateless protocols, Transport protocols}, doi = {10.1109/ASWEC.2004.1290477}, author = {Vasan,Arunchandar and Memon, Atif M.} } @article {15342, title = {Assessment of inflow boundary conditions for compressible turbulent boundary layers}, journal = {Physics of Fluids}, volume = {16}, year = {2004}, month = {2004///}, pages = {2623 - 2623}, author = {Xu,S. and Martin, M.P} } @inbook {15426, title = {Automated GUI regression testing using AI planning}, booktitle = {Artificial Intelligence Methods in Software TestingArtificial Intelligence Methods in Software Testing}, year = {2004}, month = {2004///}, pages = {51 - 99}, publisher = {World Scientific}, organization = {World Scientific}, isbn = {9812388540, 9789812388544}, author = {Memon, Atif M.} } @conference {15690, title = {Automatic video summarization for wireless and mobile environments}, booktitle = {2004 IEEE International Conference on Communications}, volume = {3}, year = {2004}, month = {2004/06/20/24}, pages = {1532- 1536 Vol.3 - 1532- 1536 Vol.3}, publisher = {IEEE}, organization = {IEEE}, abstract = {In this paper, we propose a novel video summarization technique using which we can automatically generate high quality video summaries suitable for wireless and mobile environments. The significant contribution of this paper lies in the proposed clustering scheme. We use Delaunay diagrams to cluster multidimensional point data corresponding to the frame contents of the video. In contrast to the existing clustering techniques used for summarization, our clustering algorithm is fully automatic and well suited for batch processing. We illustrate the quality of our clustering and summarization scheme in an experiment using several video clips.}, keywords = {automatic video summarization, batch processing, batch processing (computers), Clustering algorithms, Clustering methods, clustering scheme, Computer science, Delaunay diagram, graph theory, Gunshot detection systems, Image sequences, mesh generation, Mobile computing, mobile radio, multidimensional point data cluster, Multidimensional systems, Multimedia communication, video clip, video frame content, Video sequences, video signal processing, wireless mobile environment}, isbn = {0-7803-8533-0}, doi = {10.1109/ICC.2004.1312767}, author = {Yong Rao and Mundur, Padma and Yesha,Y.} } @inbook {14203, title = {Bias in Shape Estimation}, booktitle = {Computer Vision - ECCV 2004Computer Vision - ECCV 2004}, series = {Lecture Notes in Computer Science}, volume = {3023}, year = {2004}, month = {2004///}, pages = {405 - 416}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {This paper analyses the uncertainty in the estimation of shape from motion and stereo. It is shown that there are computational limitations of a statistical nature that previously have not been recognized. Because there is noise in all the input parameters, we cannot avoid bias. The analysis rests on a new constraint which relates image lines and rotation to shape. Because the human visual system has to cope with bias as well, it makes errors. This explains the underestimation of slant found in computational and psychophysical experiments, and demonstrated here for an illusory display. We discuss properties of the best known estimators with regard to the problem, as well as possible avenues for visual systems to deal with the bias.}, isbn = {978-3-540-21982-8}, url = {http://dx.doi.org/10.1007/978-3-540-24672-5_32}, author = {Hui Ji and Ferm{\"u}ller, Cornelia}, editor = {Pajdla,Tom{\'a}{\v s} and Matas,Jir{\'\i}} } @conference {18552, title = {BorderGuard: detecting cold potatoes from peers}, booktitle = {Proceedings of the 4th ACM SIGCOMM conference on Internet measurement}, series = {IMC {\textquoteright}04}, year = {2004}, month = {2004///}, pages = {213 - 218}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Internet Service Providers often establish contractual "peering" agreements, where they agree to forward traffic to each other{\textquoteright}s customers at no cost. Consistent route advertisement at all peering points is a common provision in these agreements, because it gives an AS the flexibility to select egress points for the traffic (e.g., performing "hot potato" routing). Verifying "consistent export" is challenging because route advertisements are exchanged at multiple peering points and may be modified by routing policies. In this paper, we propose two algorithms to detect inconsistent routes using routing and configuration data from an AS{\textquoteright}s border routers. The first algorithm requires access to all eBGP routes advertised by a peer. Because this data is often unavailable, we propose another algorithm that detects inconsistencies using readily available data. We have applied our algorithms to the routes advertised by the peers of AT\&T{\textquoteright}s commercial IP backbone. Although a peer may intentionally send inconsistent advertisements to prevent its neighbor from performing hot-potato routing, we also discuss several configuration scenarios where a peer may inadvertently advertise inconsistent routes, despite having consistent export policies. Finally, we explain how simple modifications to the routers could make detection of inconsistent advertisements much easier than it is today.}, keywords = {anomalies, BGP, inconsistent advertisement, peering}, isbn = {1-58113-821-0}, doi = {10.1145/1028788.1028815}, url = {http://doi.acm.org/10.1145/1028788.1028815}, author = {Feamster, Nick and Mao,Zhuoqing Morley and Rexford,Jennifer} } @article {12349, title = {Buffer merging{\textemdash}a powerful technique for reducing memory requirements of synchronous dataflow specifications}, journal = {ACM Transactions on Design Automation of Electronic Systems (TODAES)}, volume = {9}, year = {2004}, month = {2004///}, pages = {212 - 237}, author = {Murthy,P. K and Bhattacharyya, Shuvra S.} } @conference {15901, title = {Building an information retrieval test collection for spontaneous conversational speech}, booktitle = {Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval}, series = {SIGIR {\textquoteright}04}, year = {2004}, month = {2004///}, pages = {41 - 48}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Test collections model use cases in ways that facilitate evaluation of information retrieval systems. This paper describes the use of search-guided relevance assessment to create a test collection for retrieval of spontaneous conversational speech. Approximately 10,000 thematically coherent segments were manually identified in 625 hours of oral history interviews with 246 individuals. Automatic speech recognition results, manually prepared summaries, controlled vocabulary indexing, and name authority control are available for every segment. Those features were leveraged by a team of four relevance assessors to identify topically relevant segments for 28 topics developed from actual user requests. Search-guided assessment yielded sufficient inter-annotator agreement to support formative evaluation during system development. Baseline results for ranked retrieval are presented to illustrate use of the collection.}, keywords = {assessment, Automatic speech recognition, oral history, search-guided relevance}, isbn = {1-58113-881-4}, doi = {10.1145/1008992.1009002}, url = {http://doi.acm.org/10.1145/1008992.1009002}, author = {Oard, Douglas and Soergel,Dagobert and David Doermann and Huang,Xiaoli and Murray,G. Craig and Wang,Jianqiang and Ramabhadran,Bhuvana and Franz,Martin and Gustman,Samuel and Mayfield,James and Kharevych,Liliya and Strassel,Stephanie} } @conference {18602, title = {The case for separating routing from routers}, booktitle = {Proceedings of the ACM SIGCOMM workshop on Future directions in network architecture}, series = {FDNA {\textquoteright}04}, year = {2004}, month = {2004///}, pages = {5 - 12}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Over the past decade, the complexity of the Internet{\textquoteright}s routing infrastructure has increased dramatically. This complexity and the problems it causes stem not just from various new demands made of the routing infrastructure, but also from fundamental limitations in the ability of today{\textquoteright}s distributed infrastructure to scalably cope with new requirements.The limitations in today{\textquoteright}s routing system arise in large part from the fully distributed path-selection computation that the IP routers in an autonomous system (AS) must perform. To overcome this weakness, interdomain routing should be separated from today{\textquoteright}s IP routers, which should simply forward packets (for the most part). Instead, a separate Routing Control Platform (RCP) should select routes on behalf of the IP routers in each AS and exchange reachability information with other domains.Our position is that an approach like RCP is a good way of coping with complexity while being responsive to new demands and can lead to a routing system that is substantially easier to manage than today. We present a design overview of RCP based on three architectural principles path computation based on a consistent view of network state, controlled interactions between routing protocol layers, and expressive specification of routing policies and discuss the architectural strengths and weaknesses of our proposal.}, keywords = {BGP, interdomain routing, routing architecture}, isbn = {1-58113-942-X}, doi = {10.1145/1016707.1016709}, url = {http://doi.acm.org/10.1145/1016707.1016709}, author = {Feamster, Nick and Balakrishnan,Hari and Rexford,Jennifer and Shaikh,Aman and van der Merwe,Jacobus} } @article {12338, title = {The CBP Parameter: A Module Characterization Approach for DSP Software Optimization}, journal = {The Journal of VLSI Signal Processing}, volume = {38}, year = {2004}, month = {2004///}, pages = {131 - 146}, author = {Bhattacharyya, Shuvra S. and Murthy,P. K} } @conference {16447, title = {Challenges in selecting paths for navigational queries: Trade-off of benefit of path versus cost of plan}, booktitle = {Proceedings of the 7th International Workshop on the Web and Databases: colocated with ACM SIGMOD/PODS 2004}, year = {2004}, month = {2004///}, pages = {61 - 66}, author = {Vidal,M. E and Raschid, Louiqa and Mestre,J.} } @article {14597, title = {CHARACTERIZATION OF Ath17, A QUANTITATIVE TRAIT LOCUS FOR ATHEROSCLEROSIS SUSCEPTIBILITY BETWEEN C57BL/6J AND 129S1/SvImJ; SINGLE-NUCLEOTIDE POLYMORPHISMS HAVE IMPORTANT IMPLICATIONS ON IDENTIFYING ATHEROSCLEROSIS MODIFIER GENES}, journal = {Cardiovascular Pathology}, volume = {13}, year = {2004}, month = {2004/06//May}, pages = {5 - 6}, abstract = {Although identifying quantitative trait loci (QTL) for atherosclerosis susceptibility in experimental murine models has helped us better understand the pathophysiology of atherosclerosis, identifying the genes underlying these QTL has been a slow and difficult process. We are currently in the process of identifying the gene that underlies Ath17, an atherosclerosis-susceptibility QTL we discovered in a (C57BL/6J{\texttimes}129S1/SvImJ)F2 intercross. Ath17 maps to a 6 cM interval region on chromosome 10 (D10Mit31, LOD score 6.6) and contains 46 annotated and 133 predicted genes. We searched the Celera Discovery System database for single nucleotide polymorphisms (SNPs) between C57BL/6J (B6) and 129S1/SvImJ in the Ath17 region and found defined blocks of high and low diversity and one polymorphic region of over 4 Mb surrounded by nonpolymorphic regions. Four of the genes, including the annotated Desrt, in the polymorphic region contained mis-sense mutations. The Desrt coding region contained four mis-sense mutations: B6 lysine to 129 glutamic acid at aa382, B6 asparagine to 129 serine at aa388, B6 threonine to 129 alanine at aa836, and B6 glycine to 129 serine at aa964. In addition, intron 5 of Desrt contained a SNP which co-localized with a putative transcription factor binding site. Desrt is a DNA binding protein, widely expressed in adult tissues, and likely plays a role in cell proliferation, differentiation, and development, making Dsert a strong candidate gene for Ath17. The murine SNP database dramatically reduced the percentage of the murine genome we had to search to find viable candidate genes for Ath17.}, isbn = {1054-8807}, doi = {10.1016/j.carpath.2004.03.010}, url = {http://www.sciencedirect.com/science/article/pii/S1054880704000377}, author = {Ishimori,Naoki and Walsh,Kenneth and Zheng,Xiangqun and Lu,Fu and Hannenhalli, Sridhar and Nusskern,Deborah and Mural,Richard and Paigen,Beverly} } @conference {12341, title = {Compact procedural implementation in DSP software synthesis through recursive graph decomposition}, booktitle = {Software and compilers for embedded systems: 8th international workshop, SCOPES 2004, Amsterdam, The Netherlands, September 2-3, 2004: proceedings}, volume = {3199}, year = {2004}, month = {2004///}, pages = {47 - 47}, author = {Ko,M. Y and Murthy,P. K and Bhattacharyya, Shuvra S.} } @conference {15647, title = {A computational framework for incremental motion}, booktitle = {Proceedings of the twentieth annual symposium on Computational geometry}, series = {SCG {\textquoteright}04}, year = {2004}, month = {2004///}, pages = {200 - 209}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {We propose a generic computational framework for maintaining a discrete geometric structure defined by a collection of static and mobile objects. We assume that the mobile objects move incrementally, that is, in discrete time steps. We assume that the structure to be maintained is a function of the current locations of the mobile and static objects (independent of their prior motion). Unlike other models for kinetic computation, we place no restrictions on the motion nor on its predictability.In order to handle unrestricted incremental motion, our framework is based on the coordination of two computational entities. The first is the incremental motion algorithm. It is responsible for maintaining the structure and a set of certificates, or conditions, that prove the structure{\textquoteright}s correctness. The other entity, called the motion processor, is responsible for handling all the low-level aspects of motion, including computing and/or tracking the motion of the mobile objects, answering queries about their current positions and velocities, and validating that the object motions satisfy simple motion estimates, which are generated by the incremental motion algorithm. Computational efficiency is measured in terms of the number of interactions between these two entities.}, keywords = {competitive analysis, incremental motion, kinetic data structures}, isbn = {1-58113-885-7}, doi = {10.1145/997817.997849}, url = {http://doi.acm.org/10.1145/997817.997849}, author = {Mount, Dave and Netanyahu,Nathan S. and Piatko,Christine D. and Silverman,Ruth and Wu,Angela Y.} } @conference {12069, title = {Copilot - a coprocessor-based kernel runtime integrity monitor}, booktitle = {Proceedings of the 13th conference on USENIX Security Symposium - Volume 13}, series = {SSYM{\textquoteright}04}, year = {2004}, month = {2004///}, pages = {13 - 13}, publisher = {USENIX Association}, organization = {USENIX Association}, address = {San Diego, CA}, abstract = {Copilot is a coprocessor-based kernel integrity monitor for commodity systems. Copilot is designed to detect malicious modifications to a host{\textquoteright}s kernel and has correctly detected the presence of 12 real-world rootkits, each within 30 seconds of their installation with less than a 1\% penalty to the host{\textquoteright}s performance. Copilot requires no modifications to the protected host{\textquoteright}s software and can be expected to operate correctly even when the host kernel is thoroughly compromised - an advantage over traditional monitors designed to run on the host itself.}, keywords = {design, management, MONITORS, Security, security and protection}, url = {http://portal.acm.org/citation.cfm?id=1251375.1251388}, author = {Petroni,Jr. and Fraser,Timothy and Molina,Jesus and Arbaugh, William A.} } @article {14481, title = {Data sciences technology for homeland security information management and knowledge discovery}, journal = {Report of the DHS Workshop Data Sciences, Jointly Released by Sandia National Laboratories and Lawrence Livermore National Laboratory, Alexandria, Va}, year = {2004}, month = {2004///}, author = {Kolda,T. and Brown,D and Corones,J. and Critchlow,T. and Eliassi-Rad,T. and Getoor, Lise and Hendrickson,B. and Kumar, V. and Lambert,D. and Matarazzo,C.} } @book {15668, title = {Data Structures and Algorithms in C++}, year = {2004}, month = {2004///}, publisher = {John Wiley \& Sons Inc}, organization = {John Wiley \& Sons Inc}, author = {Goodrich,M. T and Tamassia,R. and Mount, Dave} } @conference {15459, title = {Developing testing techniques for event-driven pervasive computing applications}, booktitle = {Proceedings of The OOPSLA 2004 workshop on Building Software for Pervasive Computing (BSPC 2004)}, year = {2004}, month = {2004///}, author = {Memon, Atif M.} } @article {12681, title = {Dimensionality Estimation in Hyperspectral Imagery Using Minimum Description Length}, year = {2004}, month = {2004/12//}, institution = {MARYLAND UNIV COLLEGE PARK CENTER FOR AUTOMATION RESEARCH}, abstract = {Numerous algorithms have been developed for hyperspectral automatic target recognition (ATR) applications. Many of these algorithms require estimation of a background subspace. The estimation of the background subspace has been addressed using multiple methods. but most of these methods assume a-priori knowledge of the background dimensionality. In order to automate the estimation of the background subspace. we present an algorithm based on minimum description length (MDL) that can identify the background dimension. Results show that the MDL criterion estimates the proper dimension of the background for ATR applications.}, keywords = {*ALGORITHMS, *HYPERSPECTRAL IMAGERY, *TARGET DETECTION, *TARGET RECOGNITION, AUTOMATIC, BURIED OBJECTS, COMPONENT REPORTS, MINE DETECTION, NUMERICAL MATHEMATICS, SURFACE TARGETS., SYMPOSIA, TARGET DIRECTION, RANGE AND POSITION FINDING}, url = {http://stinet.dtic.mil/oai/oai?\&verb=getRecord\&metadataPrefix=html\&identifier=ADA431643}, author = {Broadwater,Joshua B and Meth,Reuven and Chellapa, Rama} } @conference {16302, title = {A distributed continuous quality assurance process to manage variability in performance-intensive software}, booktitle = {19th ACM OOPSLA Workshop on Component and Middleware Performance}, year = {2004}, month = {2004///}, author = {Krishna,A. and Yilmaz,C. and Memon, Atif M. and Porter, Adam and Schmidt,D. C and Gokhale,A. and Natarajan,B.} } @article {12990, title = {Divergent Gene Copies in the Asexual Class Bdelloidea (Rotifera) Separated Before the Bdelloid Radiation or Within Bdelloid Families}, journal = {Proceedings of the National Academy of Sciences of the United States of AmericaPNAS}, volume = {101}, year = {2004}, month = {2004/02/10/}, pages = {1622 - 1625}, abstract = {Rotifers of the asexual class Bdelloidea are unusual in possessing two or more divergent copies of every gene that has been examined. Phylogenetic analysis of the heat-shock gene hsp82 and the TATA-box-binding protein gene tbp in multiple bdelloid species suggested that for each gene, each copy belonged to one of two lineages that began to diverge before the bdelloid radiation. Such gene trees are consistent with the two lineages having descended from former alleles that began to diverge after meiotic segregation ceased or from subgenomes of an alloploid ancestor of the bdelloids. However, the original analyses of bdelloid gene-copy divergence used only a single outgroup species and were based on parsimony and neighbor joining. We have now used maximum likelihood and Bayesian inference methods and, for hsp82, multiple outgroups in an attempt to produce more robust gene trees. Here we report that the available data do not unambiguously discriminate between gene trees that root the origin of hsp82 and tbp copy divergence before the bdelloid radiation and those which indicate that the gene copies began to diverge within bdelloid families. The remarkable presence of multiple diverged gene copies in individual genomes is nevertheless consistent with the loss of sex in an ancient ancestor of bdelloids.}, isbn = {0027-8424, 1091-6490}, doi = {10.1073/pnas.2136686100}, url = {http://www.pnas.org/content/101/6/1622}, author = {Welch,David B. Mark and Cummings, Michael P. and Hillis,David M and Meselson,Matthew} } @article {15345, title = {DNS of hypersonic turbulent boundary layers}, journal = {AIAA Paper}, volume = {2337}, year = {2004}, month = {2004///}, pages = {2004 - 2004}, author = {Martin, M.P and others} } @article {19004, title = {The Drosophila U1-70K Protein Is Required for Viability, but Its Arginine-Rich Domain Is Dispensable}, journal = {GeneticsGenetics}, volume = {168}, year = {2004}, month = {2004/12/01/}, pages = {2059 - 2065}, abstract = {The conserved spliceosomal U1-70K protein is thought to play a key role in RNA splicing by linking the U1 snRNP particle to regulatory RNA-binding proteins. Although these protein interactions are mediated by repeating units rich in arginines and serines (RS domains) in vitro, tests of this domain{\textquoteright}s importance in intact multicellular organisms have not been carried out. Here we report a comprehensive genetic analysis of U1-70K function in Drosophila. Consistent with the idea that U1-70K is an essential splicing factor, we find that loss of U1-70K function results in lethality during embryogenesis. Surprisingly, and contrary to the current view of U1-70K function, animals carrying a mutant U1-70K protein lacking the arginine-rich domain, which includes two embedded sets of RS dipeptide repeats, have no discernible mutant phenotype. Through double-mutant studies, however, we show that the U1-70K RS domain deletion no longer supports viability when combined with a viable mutation in another U1 snRNP component. Together our studies demonstrate that while the protein interactions mediated by the U1-70K RS domain are not essential for viability, they nevertheless contribute to an essential U1 snRNP function.}, isbn = {0016-6731, 1943-2631}, doi = {10.1534/genetics.104.032532}, url = {http://www.genetics.org/content/168/4/2059}, author = {Salz,Helen K. and Mancebo,Ricardo S. Y. and Nagengast,Alexis A. and Speck,Olga and Psotka,Mitchell and Mount, Stephen M.} } @conference {18202, title = {Dynamic join-exit amortization and scheduling for time-efficient group key agreement}, booktitle = {INFOCOM 2004. Twenty-third AnnualJoint Conference of the IEEE Computer and Communications Societies}, volume = {4}, year = {2004}, month = {2004/03//}, pages = {2617 - 2627 vol.4 - 2617 - 2627 vol.4}, abstract = {We propose a time-efficient contributory key agreement framework for secure communications in dynamic groups. The proposed scheme employs a special join-tree/exit-tree topology in the logical key tree and effectively exploits the efficiency of amortized operations. We derive the optimal parameters and design an activation algorithm for the join and exit trees. We also show that the asymptotic average time cost per user join and leave event is theta;(log (log n)), where n is the group size. Our experiment results on both simulated user activities and the real MBone data have shown that the proposed scheme outperforms the existing tree-based schemes.}, keywords = {agreement;, asymptotic, average, communication;, complexity;, computational, cost;, cryptography;, dynamic, group, join-tree/exit-tree, key, logical, Multicast, network, secure, security;, special, Telecommunication, TIME, time-efficient, topology;, tree;}, doi = {10.1109/INFCOM.2004.1354681}, author = {Mao,Yinian and Sun,Yan and M. Wu and Liu,K. J.R} } @conference {15480, title = {Empirical evaluation of the fault-detection effectiveness of smoke regression test cases for GUI-based software}, booktitle = {Software Maintenance, 2004. Proceedings. 20th IEEE International Conference on}, year = {2004}, month = {2004/09//}, pages = {8 - 17}, abstract = {Daily builds and smoke regression tests have become popular quality assurance mechanisms to detect defects early during software development and maintenance. In previous work, we addressed a major weakness of current smoke regression testing techniques, i.e., their lack of ability to automatically (re)test graphical user interface (GUI) event interactions - we presented a GUI smoke regression testing process called daily automated regression tester (DART). We have deployed DART and have found several interesting characteristics of GUI smoke tests that we empirically demonstrate in this paper. We also combine smoke tests with different types of test oracles and present guidelines for practitioners to help them generate and execute the most effective combinations of test-case length and test oracle complexity. Our experimental subjects consist of four GUI-based applications. We generate 5000-8000 smoke tests (enough to be run in one night) for each application. Our results show that: (1) short GUI smoke tests with certain test oracles are effective at detecting a large number of faults; (2) there are classes of faults that our smoke test cannot detect; (3) short smoke tests execute a large percentage of code; and (4) the entire smoke testing process is feasible to do in terms of execution time and storage space.}, keywords = {daily automated regression tester, daily builds, fault-detection effectiveness, graphical user interface, Graphical user interfaces, GUI-based software, program testing, Quality assurance, Regression analysis, smoke regression test cases, software development, software fault tolerance, Software maintenance, Software quality, software quality assurance, test oracle complexity, test oracles, test-case length}, doi = {10.1109/ICSM.2004.1357785}, author = {Memon, Atif M. and Xie,Qing} } @conference {19492, title = {Enabling On-chip Diversity Through Architectural Communication Design}, booktitle = {ASP-DAC {\textquoteright}04 Proceedings of the 2004 Asia and South Pacific Design Automation Conference}, series = {ASP-DAC {\textquoteright}04}, year = {2004}, month = {2004///}, pages = {799 - 805}, publisher = {IEEE Press}, organization = {IEEE Press}, abstract = {In this paper, we explore a new concept, called on-chip diversity, and introduce a design methodology for such emerging systems. Simply speaking, on-chip diversity means mixing different architectures and/or technologies in a multiple voltage/frequency island setup in order to achieve the highest levels of performance, fault-tolerance and the needed flexibility in SoC design. As the main contribution, we present the challenges in implementing an efficient communication architecture for on-chip diversity and outline a unified framework which addresses some of these issues. We then provide comparative experimental results and make a qualitative analysis of different architectural choices in the design of the on-chip communication. Having the acoustic beamforming as driver application, we show that an efficient communication infrastructure can be constructed by carefully analyzing the characteristics of the application and the required levels of power, performance and fault-tolerance.}, isbn = {0-7803-8175-0}, url = {http://dl.acm.org/citation.cfm?id=1015090.1015306}, author = {Tudor Dumitras and Kerner, Sam and Marculescu, Radu} } @article {15679, title = {End-to-end analysis of distributed video-on-demand systems}, journal = {IEEE Transactions on Multimedia}, volume = {6}, year = {2004}, month = {2004/02//}, pages = {129 - 141}, abstract = {The focus of the research presented in this paper is the end-to-end analysis of a distributed Video-on-Demand (VoD) system. We analyze the distributed architecture of a VoD system to design global request handling and admission control strategies and evaluate them using global metrics. The performance evaluation methodology developed in this paper helps in determining efficient ways of using all resources in the VoD architecture within the constraints of providing guaranteed high quality service to each request. For instance, our simulation results show that request handling policies based on limited redirection of blocked requests to other resources perform better than load sharing policies. We also show that request handling policies based on redirection have simpler connection establishment semantics than load sharing policies and, therefore, are easily incorporated into reservation or signaling protocols.}, keywords = {Admission control, admission control strategies, Analytical models, Computer science, distributed architecture, distributed video-on-demand systems, end-to-end analysis, global request handling, High-speed networks, Network servers, Next generation networking, Performance analysis, performance evaluation methodology, Protocols, request handling, reservation protocols, resource allocation, Resource management, signaling protocols, telecommunication congestion control, video on demand, Video sharing}, isbn = {1520-9210}, doi = {10.1109/TMM.2003.819757}, author = {Mundur, Padma and Simon,R. and Sood,A. K} } @conference {17593, title = {End-to-end packet-scheduling in wireless ad-hoc networks}, booktitle = {Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms}, series = {SODA {\textquoteright}04}, year = {2004}, month = {2004///}, pages = {1021 - 1030}, publisher = {Society for Industrial and Applied Mathematics}, organization = {Society for Industrial and Applied Mathematics}, address = {Philadelphia, PA, USA}, abstract = {Packet-scheduling is a particular challenge in wireless networks due to interference from nearby transmissions. A distance-2 interference model serves as a useful abstraction here, and we study packet routing and scheduling under this model. The main focus of our work is the development of fully-distributed (decentralized) protocols. We present polylogarithmic/constant factor approximation algorithms for various families of disk graphs (which capture the geometric nature of wireless-signal propagation), as well as near-optimal approximation algorithms for general graphs. The packet-scheduling work by L eighton, Maggs and Rao (Combinatorica, 1994) and a basic distributed coloring procedure, originally due to Luby (J. Computer and System Sciences, 1993), underlie many of our algorithms. Experimental work of Finocchi, Panconesi, and Silvestri (SODA 2002) showed that a natural modification of Luby{\textquoteright}s algorithm leads to improved performance, and a rigorous explanation of this was left as an open question; we prove that the modified algorithm is provably better in the worst-case. Finally, using simulations, we study the impact of the routing strategy and the choice of parameters on the performance of our distributed algorithm for unit disk graphs.}, isbn = {0-89871-558-X}, url = {http://dl.acm.org/citation.cfm?id=982792.982945}, author = {Kumar,V. S. Anil and Marathe,Madhav V. and Parthasarathy,Srinivasan and Srinivasan, Aravind} } @article {15451, title = {Evaluating web page reliability across varied browsing environments}, journal = {Proceedings of the 15th IEEE International Symposium on Software Reliability Engineering (ISSRE{\textquoteright}04)}, year = {2004}, month = {2004///}, abstract = {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. }, author = {Eaton,C. and Memon, Atif M.} } @conference {14694, title = {Experience with safe manual memory-management in cyclone}, booktitle = {Proceedings of the 4th international symposium on Memory management}, series = {ISMM {\textquoteright}04}, year = {2004}, month = {2004///}, pages = {73 - 84}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {The goal of the Cyclone project is to investigate type safety for low-level languages such as C. Our most difficult challenge has been providing programmers control over memory management while retaining type safety. This paper reports on our experience trying to integrate and effectively use two previously proposed, type-safe memory management mechanisms: statically-scoped regions and unique pointers. We found that these typing mechanisms can be combined to build alternative memory-management abstractions, such as reference counted objects and arenas with dynamic lifetimes, and thus provide a flexible basis. Our experience---porting C programs and building new applications for resource-constrained systems---confirms that experts can use these features to improve memory footprint and sometimes to improve throughput when used instead of, or in combination with, conservative garbage collection.}, keywords = {cyclone, Memory management, memory safety, regions, unique pointers}, isbn = {1-58113-945-4}, doi = {10.1145/1029873.1029883}, url = {http://doi.acm.org/10.1145/1029873.1029883}, author = {Hicks, Michael W. and Morrisett,Greg and Grossman,Dan and Jim,Trevor} } @conference {16462, title = {Exploiting multiple paths to express scientific queries}, booktitle = {16th International Conference on Scientific and Statistical Database Management, 2004. Proceedings}, year = {2004}, month = {2004/06/21/23}, pages = {357 - 360}, publisher = {IEEE}, organization = {IEEE}, abstract = {The purpose of this demonstration is to present the main features of the BioNavigation system. Scientific data collection needed in various stages of scientific discovery is typically performed manually. For each scientific object of interest (e.g., a gene, a sequence), scientists query a succession of Web resources following links between retrieved entries. Each of the steps provides part of the intended characterization of the scientific object. This process is sometimes partially supported by hard-coded scripts or complex queries that will be evaluated by a mediation-based data integration system or against a data warehouse. These approaches fail in guiding the scientists during the collection process. In contrast, the BioNavigation approach presented in the paper provides the scientists with information on the available alternative resources, their provenance, and the costs of data collection. The BioNavigation system enhances a mediation-based integration system and provides scientists with support for the following: to ask queries at a high conceptual level; to visualize the multiple alternative resources that may be exploited to execute their data collection queries; to choose the final execution path to evaluate their queries.}, keywords = {access protocols, biology computing, BioNavigation system, complex queries, Costs, Data analysis, data handling, Data visualization, data warehouse, Data warehouses, Databases, diseases, distributed databases, hard-coded scripts, information resources, Information retrieval, mediation-based data integration system, multiple paths, query evaluation, Query processing, scientific data collection, scientific discovery, scientific information, scientific information systems, scientific object of interest, scientific queries, sequences, Web resources}, isbn = {0-7695-2146-0}, doi = {10.1109/SSDM.2004.1311231}, author = {Lacroix,Z. and Moths,T. and Parekh,K. and Raschid, Louiqa and Vidal,M. -E} } @article {13771, title = {Extrinsic Evaluation of Automatic Metrics for Summarization}, year = {2004}, month = {2004/07/20/}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {This paper describes extrinsic-task evaluation of summarization. We show that it is possible to save time using summaries for relevance assessment without adversely impacting the degree of accuracy that would be possible with full documents. In addition, we demonstrate that the extrinsic task we have selected exhibits a high degree of interannotator agreement, i.e., consistent relevance decisions across subjects. We also conducted a composite experiment that better reflects the actual document selection process and found that using a surrogate improves the processing speed over reading the entire document. Finally, we have found a small yet statistically significant correlation between some of the intrinsic measures and a user{\textquoteright}s performance in an extrinsic task. The overall conclusion we can draw at this point is that ROUGE-1 does correlate with precision and to a somewhat lesser degree with accuracy, but that it remains to be investigated how stable these correlations are and how differences in ROUGE-1 translate into significant differences in human performance in an extrinsic task.}, keywords = {*ABSTRACTS, *ACCURACY, *DATA SUMMARIZATION, *DOCUMENT SUMMARIES, *DOCUMENTS, *READING MACHINES, *SOFTWARE METRICS, *STATISTICAL ANALYSIS, ABSTRACT SELECTION, ANNOTATIONS, Automation, COMPUTER PROGRAMMING AND SOFTWARE, COMPUTER SYSTEMS, CORRELATION TECHNIQUES, DATA PROCESSING, DOCUMENT SUMMARIES, EXTRINSIC TASKS, Information retrieval, INFORMATION SCIENCE, PERFORMANCE(HUMAN), PRECISION, RELEVANCY, ROUGE-1 COMPUTER PROGRAM, STATISTICS AND PROBABILITY, TEST AND EVALUATION}, url = {http://stinet.dtic.mil/oai/oai?\&verb=getRecord\&metadataPrefix=html\&identifier=ADA448065}, author = {Dorr, Bonnie J and Monz,Christof and Oard, Douglas and President,Stacy and Zajic, David and Schwartz,Richard} } @conference {18673, title = {Ferret: a host vulnerability checking tool}, year = {2004}, month = {2004/03//}, pages = {389 - 394}, abstract = {Evaluation of computing system security requires knowledge of the vulnerabilities present in the system and of potential attacks against the system. Vulnerabilities can be classified based on their location as application vulnerabilities, network vulnerabilities, or host vulnerabilities. We describe Ferret, a new software tool for checking host vulnerabilities. Ferret helps system administrators by quickly finding vulnerabilities that are present on a host. It is designed and implemented in a modular way: a different plug-in module is used for each vulnerability checked, and each possible output format is specified by a plug-in module. As a result, Ferret is extensible, and can easily be kept up-to-date through addition of checks for new vulnerabilities as they are discovered; the modular approach also makes it easy to provide specific configurations of Ferret tailored to specific operating systems or use environments. Ferret is a freely available open-source software implemented in Perl.}, keywords = {Ferret software tool, host vulnerability checking tool, open-source software, Perl, plug-in module, program verification, security auditing tool, security evaluation, security of data, software tools}, doi = {10.1109/PRDC.2004.1276595}, author = {Sharma,Anil and Martin,J.R. and Anand,N. and Michel Cukier and Sanders,W. H.} } @article {15384, title = {Finite-element computation of nonlinear magnetic diffusion and its effects when coupled to electrical, mechanical, and hydraulic systems}, journal = {Magnetics, IEEE Transactions on}, volume = {40}, year = {2004}, month = {2004/03//}, pages = {537 - 540}, abstract = {Finite elements are used to compute eddy currents and magnetic diffusion times in steel cylinders with nonlinear B{\textendash}H curves. Computations are made of diffusion times versus current in a typical axisymmetric magnetic actuator, showing good agreement with recently published approximate analytical formulas. The computed nonlinear diffusion times are then used to derive an equivalent resistor that is used in a model of an electrohydraulic system. The diffusion time causes delays in the coupled mechanical and hydraulic responses.}, keywords = {actuator;, actuators;, analysis;, axisymmetric, B-H, coupled, currents;, curves;, cylinders;, diffusion, diffusion;, eddy, electrical, electrohydraulic, electrohydraulics;, electromagnetic, element, equivalent, finite, finite-element, flux;, hydraulic, magnetic, mechanical, methods;, nonlinear, resistor;, responses;, steel, system;, systems;, times;, transducers;}, isbn = {0018-9464}, doi = {10.1109/TMAG.2004.824591}, author = {Brauer,J.R. and Mayergoyz, Issak D} } @conference {12293, title = {A game-theoretic framework for analyzing trust-inference protocols}, booktitle = {Workshop on Economics of Peer-to-Peer Systems}, year = {2004}, month = {2004///}, abstract = {We propose a novel game-theoretic framework foranalyzing the robustness of trust-inference protocols in the presence of adversarial (but rational) users. To the best of our knowledge, this is the first such framework which simultaneously (1) admits a rigor- ous and precise definition, thereby enabling formal proofs of security (in various adversarial settings) for specific trust-inference protocols; (2) is flexible enough to accommodate a full range of (realistic) ad- versarial behavior and network models; and (3) is ap- propriate for decentralized networks, and in particu- lar does not posit a trusted, centralized party with complete knowledge of the system history. We also show some preliminary results regarding the design of trust-inference protocols which can be rigorously proven secure within our model. In addition to establishing a solid foundation for future work, our framework also enables a rigorous and objective comparison among existing trust inference protocols. }, author = {Morselli,R. and Katz, Jonathan and Bhattacharjee, Bobby} } @article {15179, title = {A generic construction for intrusion-resilient public-key encryption}, journal = {Topics in Cryptology{\textendash}CT-RSA 2004}, year = {2004}, month = {2004///}, pages = {1997 - 1997}, abstract = {In an intrusion-resilient cryptosystem [10], two entities (a user and a base) jointly evolve a secret decryption key; this provides very strong protection against an active attacker who can break into the user and base repeatedly and even simultaneously. Recently, a construction of an intrusion-resilient public-key encryption scheme based on specific algebraic assumptions has been shown [6]. We generalize this previous work and present a more generic construction for intrusion-resilient public-key encryption from any forward-secure public-key encryption scheme satisfying a certain homomorphic property.}, doi = {10.1007/978-3-540-24660-2_7}, author = {Dodis,Y. and Franklin,M. and Katz, Jonathan and Miyaji,A. and Yung,M.} } @conference {13035, title = {Generic sentence fusion is an ill-defined summarization task}, booktitle = {Proceedings of the Text Summarization Branches Out Workshop at ACL}, volume = {4}, year = {2004}, month = {2004///}, pages = {96 - 103}, author = {Daum{\'e}, Hal and Marcu,D.} } @conference {18788, title = {Geometric Containment Analysis for Rotational Parts}, year = {2004}, month = {2004///}, abstract = {This paper describes a system and underlying algorithms toperform geometric containment analysis to determine if a newly designed rotational part can be manufactured from a part in an existing database of rotational parts. Only material removal of the database part is considered in order to obtain the newly designed part from the database part. The system uses a three-step algorithm to test for containment. The first step analyzes feasibility of containment using bounding cylinders. If the bounding cylinder of the query part is bigger than the part in the database, then the database part cannot contain the query part and it is eliminated from consideration. The second step analyzes feasibility of containment by ignoring off-axis features. Any part that fails to satisfy containment at this stage is eliminated from consideration. The third step analyzes the remaining parts from the database for feasibility of containment by including the off-axis features. Finally, the system rank- orders all the database parts that can contain the query part based on their volume differences with the query part. The system described in this paper can be used to find an existing part from which to manufacture a newly designed part. This capability is expected to significantly reduce proliferation of parts, to improve manufacturing responsiveness, and to reduce the cost of new products. }, url = {ftp://ftp.eng.umd.edu/:/home/glue/s/k/skgupta/pub/Publication/DETC04_Karnik.pdf}, author = {Karnik,M. and Gupta,S.K. and Magrab,E. B.} } @conference {12691, title = {A hybrid algorithm for subpixel detection in hyperspectral imagery}, booktitle = {Geoscience and Remote Sensing Symposium, 2004. IGARSS {\textquoteright}04. Proceedings. 2004 IEEE International}, volume = {3}, year = {2004}, month = {2004/09//}, pages = {1601 -1604 vol.3 - 1601 -1604 vol.3}, abstract = {Numerous subpixel detection algorithms utilizing structured backgrounds have been developed over the past few years. These range from detection schemes based on spectral unmixing to generalized likelihood ratio tests. Spectral unmixing algorithms such as the Fully Constrained Least Squares (FCLS) algorithm have the advantage of physically modeling the interactions of spectral signatures based on reflectance/emittance spectroscopy. Generalized likelihood ratio tests like the Adaptive Matched Subspace Detector (AMSD) have the advantage of identifying targets that are statistically different from the background. Therefore, a hybrid detector based on both AMSD and FCLS was developed to take advantage of each detector{\textquoteright}s strengths. Results demonstrate that the hybrid detector achieved the lowest false alarm rates while also producing meaningful abundance estimates}, keywords = {alarm, algorithm;abundance, algorithm;Fully, algorithm;hybrid, algorithm;statistical, AMSD;Adaptive, analysis;structured, approximations;maximum, backgrounds;subpixel, constrained, detection;alarm, detection;target, Detector;FCLS, detector;hyperspectral, estimation;, estimation;emittance, identification;adaptive, imagery;reflectance, least, likelihood, Matched, matching;least, processing;geophysical, rate;generalized, ratio, signal, signatures;spectral, spectra;false, spectra;spectral, squares, subspace, systems;geophysical, techniques;image, tests;hybrid, unmixing}, doi = {10.1109/IGARSS.2004.1370633}, author = {Broadwater, J. and Meth, R. and Chellapa, Rama} } @conference {18225, title = {Image hashing resilient to geometric and filtering operations}, booktitle = {Multimedia Signal Processing, 2004 IEEE 6th Workshop on}, year = {2004}, month = {2004/10/01/sept}, pages = {355 - 358}, abstract = {Image hash functions provide compact representations of images, which is useful for search and authentication applications. In this work, we have identified a general three step framework and proposed a new image hashing scheme that achieves a better overall performance than the existing approaches under various kinds of image processing distortions. By exploiting the properties of discrete polar Fourier transform and incorporating cryptographic keys, the proposed image hash is resilient to geometric and filtering operations, and is secure against guessing and forgery attacks.}, keywords = {compact, cryptographic, cryptography;, discrete, distortion;, Filtering, Fourier, function;, geometric, hash, image, key, key;, operation;, polar, PROCESSING, public, representation;, theory;, transform;, transforms;}, doi = {10.1109/MMSP.2004.1436566}, author = {Swaminathan,A. and Mao,Yinian and M. Wu} } @article {15760, title = {Implementation of the regularized structured total least squares algorithms for blind image deblurring}, journal = {Linear Algebra and its Applications}, volume = {391}, year = {2004}, month = {2004/11/01/}, pages = {203 - 221}, abstract = {The structured total least squares (STLS) problem has been introduced to handle problems involving structured matrices corrupted by noise. Often the problem is ill-posed. Recently, regularization has been proposed in the STLS framework to solve ill-posed blind deconvolution problems encountered in image deblurring when both the image and the blurring function have uncertainty. The kernel of the regularized STLS (RSTLS) problem is a least squares problem involving Block{\textendash}Toeplitz{\textendash}Toeplitz{\textendash}Block matrices.In this paper an algorithm is described to solve this problem, based on a particular implementation of the generalized Schur Algorithm (GSA). It is shown that this new implementation improves the computational efficiency of the straightforward implementation of GSA from O(N2.5) to O(N2), where N is the number of pixels in the image. }, keywords = {Block Toeplitz matrix, Displacement rank, Generalized Schur algorithm, Image deblurring, Structured total least squares, Tikhonov regularization}, isbn = {0024-3795}, doi = {10.1016/j.laa.2004.07.006}, url = {http://www.sciencedirect.com/science/article/pii/S0024379504003362}, author = {Mastronardi,N. and Lemmerling,P. and Kalsi,A. and O{\textquoteright}Leary,D. P and Huffel,S. Van} } @article {15458, title = {Improving browsing environment compliance evaluations for websites}, journal = {Proceedings of the International Workshop on Web Quality (WQ{\textquoteright}04)}, year = {2004}, month = {2004///}, abstract = {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. }, author = {Eaton,C. and Memon, Atif M.} } @conference {16308, title = {Improving the Quality of Performance-intensive Software via Model-integrated Distributed Continuous Quality Assurance}, booktitle = {Proceedings of the 8th International Conference on Software Reuse}, year = {2004}, month = {2004///}, author = {Krishna,A. S and Schmidt,D. C and Porter, Adam and Memon, Atif M. and Sevilla-Ruiz,D.} } @inbook {18909, title = {Information Gathering During Planning for Web Service Composition}, booktitle = {The Semantic Web {\textendash} ISWC 2004}, series = {Lecture Notes in Computer Science}, volume = {3298}, year = {2004}, month = {2004///}, pages = {335 - 349}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {Hierarchical Task-Network (HTN) based planning techniques have been applied to the problem of composing Web Services, especially when described using the OWL - S service ontologies. Many of the existing Web Services are either exclusively information providing or crucially depend on information-providing services. Thus, many interesting service compositions involve collecting information either during execution or during the composition process itself. In this paper, we focus on the latter issue. In particular, we present ENQUIRER , an HTN-planning algorithm designed for planning domains in which the information about the initial state of the world may not be complete, but it is discoverable through plan-time information-gathering queries. We have shown that ENQUIRER is sound and complete, and derived several mathematical relationships among the amount of available information, the likelihood of the planner finding a plan, and the quality of the plan found. We have performed experimental tests that confirmed our theoretical results and that demonstrated how ENQUIRER can be used in Web Service composition.}, keywords = {Computer science}, isbn = {978-3-540-23798-3}, url = {http://www.springerlink.com/content/v829m5080fc0bpng/abstract/}, author = {Kuter,Ugur and Sirin,Evren and Nau, Dana S. and Parsia,Bijan and Hendler,James}, editor = {McIlraith,Sheila and Plexousakis,Dimitris and van Harmelen,Frank} } @article {14087, title = {The ingi and RIME non-LTR retrotransposons are not randomly distributed in the genome of Trypanosoma brucei}, journal = {Molecular biology and evolution}, volume = {21}, year = {2004}, month = {2004///}, pages = {520 - 520}, author = {Bringaud,F. and Biteau,N. and Zuiderwijk,E. and Berriman,M. and El-Sayed, Najib M. and Ghedin,E. and Melville,S. E. and Hall,N. and Baltz,T.} } @inbook {13795, title = {Interlingual Annotation for MT Development}, booktitle = {Machine Translation: From Real Users to ResearchMachine Translation: From Real Users to Research}, series = {Lecture Notes in Computer Science}, volume = {3265}, year = {2004}, month = {2004///}, pages = {236 - 245}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {MT systems that use only superficial representations, including the current generation of statistical MT systems, have been successful and useful. However, they will experience a plateau in quality, much like other {\textquotedblleft}silver bullet{\textquotedblright} approaches to MT. We pursue work on the development of interlingual representations for use in symbolic or hybrid MT systems. In this paper, we describe the creation of an interlingua and the development of a corpus of semantically annotated text, to be validated in six languages and evaluated in several ways. We have established a distributed, well-functioning research methodology, designed a preliminary interlingua notation, created annotation manuals and tools, developed a test collection in six languages with associated English translations, annotated some 150 translations, and designed and applied various annotation metrics. We describe the data sets being annotated and the interlingual (IL) representation language which uses two ontologies and a systematic theta-role list. We present the annotation tools built and outline the annotation process. Following this, we describe our evaluation methodology and conclude with a summary of issues that have arisen.}, isbn = {978-3-540-23300-8}, url = {http://dx.doi.org/10.1007/978-3-540-30194-3_26}, author = {Reeder,Florence and Dorr, Bonnie J and Farwell,David and Habash,Nizar and Helmreich,Stephen and Hovy,Eduard and Levin,Lori and Mitamura,Teruko and Miller,Keith and Rambow,Owen and Siddharthan,Advaith}, editor = {Frederking,Robert and Taylor,Kathryn} } @article {13796, title = {Interlingual annotation of multilingual text corpora}, journal = {Proceedings of the North American Chapter of the Association for Computational Linguistics Workshop on Frontiers in Corpus Annotation}, year = {2004}, month = {2004///}, pages = {55 - 62}, abstract = {This paper describes a multi-site project toannotate six sizable bilingual parallel corpora for interlingual content. After presenting the background and objectives of the effort, we describe the data set that is being annotated, the interlingua representation language used, an interface environment that supports the an- notation task and the annotation process itself. We will then present a preliminary version of our evaluation methodology and conclude with a summary of the current status of the project along with a number of issues which have arisen. }, author = {Farwell,D. and Helmreich,S. and Dorr, Bonnie J and Habash,N. and Reeder,F. and Miller,K. and Levin,L. and Mitamura,T. and Hovy,E. and Rambow,O. and others} } @conference {12700, title = {Intra-personal kernel space for face recognition}, booktitle = {Automatic Face and Gesture Recognition, 2004. Proceedings. Sixth IEEE International Conference on}, year = {2004}, month = {2004/05//}, pages = {235 - 240}, abstract = {Intra-personal space modeling proposed by Moghaddam et al. has been successfully applied in face recognition. In their work the regular principal subspaces are derived from the intra-personal spacce using a principal componen analysis and embedded in a probabilistic formulation. In this paper, we derive the principal subspace from the intro-personal kernel space by developing a probabilistic analysis for kernel principal components for face recognition. We test this algorithm on a subset of the FERET database with illumination and facial expression variations. The recognition performance demonstrates its advantage over other traditional subspace approaches.}, keywords = {analysis;, component, Expression, Face, facial, illumination, intra-personal, Kernel, lighting;, principal, probabilistic, probability;, recognition;, space;, variation;}, doi = {10.1109/AFGR.2004.1301537}, author = {Zhou,Shaohua and Chellapa, Rama and Moghaddam, B.} } @conference {16487, title = {Links and paths through life sciences data sources}, booktitle = {Data Integration in the Life Sciences}, year = {2004}, month = {2004///}, pages = {203 - 211}, author = {Lacroix,Z. and Murthy,H. and Naumann,F. and Raschid, Louiqa} } @conference {15347, title = {Local Adaption and Dissipation Properties of a Weighted Essentially Non-Oscillatory Scheme}, booktitle = {34th AIAA Fluid Dynamics Conference and Exhibit}, year = {2004}, month = {2004///}, address = {Portland, OR}, abstract = {We perform several direct numerical simulations (DNS) of decaying isotropic turbulencewith various initial turbulent mach numbers Mt using a modifiedi weighted essentially non-oscillatory (WENO) method. We then present a procedure for the identification of shock-containing and smooth regions where the WENO scheme should respectively engage its adaption mechanism and revert to its linear optimal stencil. Weirsi has previously proposed the centrality index CI and nonlinearity index NI as two quantitative measures of stencil adaption, and we analyze these values within the regions of interest in the DNS flow fields. Our preliminary results indicate that these indices are suitable for assessments of the local adaption and dissipation properties of the WENO method; however, further studies must be conducted over a wider range of compressible flow conditions. }, author = {Taylor,E. M and Martin, M.P and Weirs,V. G} } @article {18512, title = {Managing the 802.11 energy/performance tradeoff with machine learning}, volume = {MIT-CSAIL-TR-2004-068}, year = {2004}, month = {2004///}, institution = {Massachusetts Institute of Technology Computer Science and Artificial Intelligence Laboratory}, abstract = {This paper addresses the problem of managing the tradeoff betweenenergy consumption and performance in wireless devices implementingthe IEEE 802.11 standard. To save energy, the 802.11 specificationproposes a power-saving mode (PSM), where a device can sleep to saveenergy, periodically waking up to receive packets from a neighbor(e.g., an access point) that may have buffered packets for thesleeping device. Previous work has shown that a fixed polling time forwaking up degrades the performance of Web transfers, because networkactivity is bursty and time-varying. We apply a new online machinelearning algorithm to this problem and show, using ns simulation andtrace analysis, that it is able to adapt well to network activity. Thelearning process makes no assumptions about the underlying networkactivity being stationary or even Markov. Our learning power-savingalgorithm, LPSM, guides the learning using a "loss function" thatcombines the increased latency from potentially sleeping too long andthe wasted use of energy in waking up too soon. In our nssimulations, LPSM saved 7\%-20\% more energy than 802.11 in power-savingmode, with an associated increase in average latency by a factor of1.02, and not more than 1.2. LPSM is straightforward to implementwithin the 802.11 PSM framework.}, url = {http://hdl.handle.net/1721.1/30499}, author = {Monteleoni,C. and Balakrishnan,H. and Feamster, Nick and Jaakkola,T.} } @article {15861, title = {Mandarin-English Information (MEI): investigating translingual speech retrieval}, journal = {Computer Speech \& Language}, volume = {18}, year = {2004}, month = {2004/04//}, pages = {163 - 179}, abstract = {This paper describes the Mandarin{\^a}{\texteuro}{\textquotedblleft}English Information (MEI) project, where we investigated the problem of cross-language spoken document retrieval (CL-SDR), and developed one of the first English{\^a}{\texteuro}{\textquotedblleft}Chinese CL-SDR systems. Our system accepts an entire English news story (text) as query, and retrieves relevant Chinese broadcast news stories (audio) from the document collection. Hence, this is a cross-language and cross-media retrieval task. We applied a multi-scale approach to our problem, which unifies the use of phrases, words and subwords in retrieval. The English queries are translated into Chinese by means of a dictionary-based approach, where we have integrated phrase-based translation with word-by-word translation. Untranslatable named entities are transliterated by a novel subword translation technique. The multi-scale approach can be divided into three subtasks {\^a}{\texteuro}{\textquotedblleft} multi-scale query formulation, multi-scale audio indexing (by speech recognition) and multi-scale retrieval. Experimental results demonstrate that the use of phrase-based translation and subword translation gave performance gains, and multi-scale retrieval outperforms word-based retrieval.}, keywords = {English{\^a}{\texteuro}{\textquotedblleft}Chinese cross-language spoken document retrieval, Multi-scale spoken document retrieval}, isbn = {0885-2308}, doi = {10.1016/j.csl.2003.09.003}, url = {http://www.sciencedirect.com/science/article/pii/S0885230803000524}, author = {Meng,Helen M. and Chen,Berlin and Khudanpur,Sanjeev and Levow,Gina-Anne and Lo,Wai-Kit and Oard, Douglas and Schone,Patrick and Tang,Karen and Wang,Hsin-Min and Wang,Jianqiang} } @inbook {19651, title = {An MCMC-Based Particle Filter for Tracking Multiple Interacting Targets}, booktitle = {Computer Vision - ECCV 2004}, series = {Lecture Notes in Computer Science}, year = {2004}, month = {2004/01/01/}, pages = {279 - 290}, publisher = {Springer Berlin Heidelberg}, organization = {Springer Berlin Heidelberg}, abstract = {We describe a Markov chain Monte Carlo based particle filter that effectively deals with interacting targets, i.e., targets that are influenced by the proximity and/or behavior of other targets. Such interactions cause problems for traditional approaches to the data association problem. In response, we developed a joint tracker that includes a more sophisticated motion model to maintain the identity of targets throughout an interaction, drastically reducing tracker failures. The paper presents two main contributions: (1) we show how a Markov random field (MRF) motion prior, built on the fly at each time step, can substantially improve tracking when targets interact, and (2) we show how this can be done efficiently using Markov chain Monte Carlo (MCMC) sampling. We prove that incorporating an MRF to model interactions is equivalent to adding an additional interaction factor to the importance weights in a joint particle filter. Since a joint particle filter suffers from exponential complexity in the number of tracked targets, we replace the traditional importance sampling step in the particle filter with an MCMC sampling step. The resulting filter deals efficiently and effectively with complicated interactions when targets approach each other. We present both qualitative and quantitative results to substantiate the claims made in the paper, including a large scale experiment on a video-sequence of over 10,000 frames in length.}, keywords = {Artificial Intelligence (incl. Robotics), Computer Graphics, Image Processing and Computer Vision, pattern recognition}, isbn = {978-3-540-21981-1, 978-3-540-24673-2}, url = {http://link.springer.com/chapter/10.1007/978-3-540-24673-2_23}, author = {Zia Khan and Balch, Tucker and Dellaert, Frank}, editor = {Pajdla, Tom{\'a}s and Matas, Ji{\v r}{\'\i}} } @article {15446, title = {Model-Based Approaches-Validating Quality of Service for Reusable Software Via Model-Integrated Distributed Continuous Quality Assurance}, journal = {Lecture Notes in Computer Science}, volume = {3107}, year = {2004}, month = {2004///}, pages = {286 - 295}, author = {Krishna,A. S and Schmidt,D. C and Memon, Atif M. and Porter, Adam and Sevilla,D.} } @article {15454, title = {A Model-based Distributed Continuous Quality Assurance Process to Enhance the Quality of Service of Evolving Performance-intensive Software Systems}, journal = {Proceedings of the 2nd ICSE Workshop on Remote Analysis and Measurement of Software Systems (RAMSS), Edinburgh, Scotland, UK}, year = {2004}, month = {2004///}, abstract = {Performance-intensive software, such as that found in high-perfo-rmance computing systems and distributed real-time and embedded systems, increasingly executes on a multitude of platforms and user contexts. To ensure that performance-intensive software meets its quality of service (QoS) requirements, it must often be fine-tuned to specific platforms/contexts by adjusting many (in some cases hun- dreds of) configuration options. Developers who write these types of systems must therefore try to ensure that their additions and mod- ifications work across this large configuration space. In practice, however, time and resource constraints often force developers to assess performance on very few configurations and to extrapolate from these to the entire configuration space, which allows many performance bottlenecks and sources of QoS degradation to escape detection until systems are fielded. To improve the assessment of performance across large config- uration spaces, we present a model-based approach to develop- ing and deploying a new distributed continuous quality assurance (DCQA) process. Our approach builds upon and extends the Skoll environment, which is developing and validating novel software QA processes and tools that leverage the extensive computing resources of worldwide user communities in a distributed, continuous man- ner to significantly and rapidly improve software quality. This pa- per describes how our new DCQA performance assessment process enables developers to run formally-designed screening experiments that isolate the most significant options. After that, exhaustive ex- periments (on the now much smaller configuration space) are con- ducted. We implemented this process using model-based software tools and executed it in the Skoll environment to demonstrate its ef- fectiveness via two experiments on widely used QoS-enabled mid- dleware. Our results show that model-based DCQA processes im- proves developer insight into the effect of system changes on per- formance at an acceptable cost. }, author = {Yilmaz,C. and Krishna,A. S and Memon, Atif M. and Porter, Adam and Schmidt,D. C and Gokhale,A. and Natarajan,B.} } @conference {13388, title = {Model-driven data acquisition in sensor networks}, booktitle = {Proceedings of the Thirtieth international conference on Very large data bases - Volume 30}, series = {VLDB {\textquoteright}04}, year = {2004}, month = {2004///}, pages = {588 - 599}, publisher = {VLDB Endowment}, organization = {VLDB Endowment}, abstract = {Declarative queries are proving to be an attractive paradigm for ineracting with networks of wireless sensors. The metaphor that "the sensornet is a database" is problematic, however, because sensors do not exhaustively represent the data in the real world. In order to map the raw sensor readings onto physical reality, a model of that reality is required to complement the readings. In this paper, we enrich interactive sensor querying with statistical modeling techniques. We demonstrate that such models can help provide answers that are both more meaningful, and, by introducing approximations with probabilistic confidences, significantly more efficient to compute in both time and energy. Utilizing the combination of a model and live data acquisition raises the challenging optimization problem of selecting the best sensor readings to acquire, balancing the increase in the confidence of our answer against the communication and data acquisition costs in the network. We describe an exponential time algorithm for finding the optimal solution to this optimization problem, and a polynomial-time heuristic for identifying solutions that perform well in practice. We evaluate our approach on several real-world sensor-network data sets, taking into account the real measured data and communication quality, demonstrating that our model-based approach provides a high-fidelity representation of the real phenomena and leads to significant performance gains versus traditional data acquisition techniques.}, isbn = {0-12-088469-0}, url = {http://dl.acm.org/citation.cfm?id=1316689.1316741}, author = {Deshpande, Amol and Guestrin,Carlos and Madden,Samuel R. and Hellerstein,Joseph M. and Wei Hong} } @article {17626, title = {Modelling disease outbreaks in realistic urban social networks}, journal = {Nature}, volume = {429}, year = {2004}, month = {2004/05/13/}, pages = {180 - 184}, abstract = {Most mathematical models for the spread of disease use differential equations based on uniform mixing assumptions1 or ad hoc models for the contact process2, 3, 4. Here we explore the use of dynamic bipartite graphs to model the physical contact patterns that result from movements of individuals between specific locations. The graphs are generated by large-scale individual-based urban traffic simulations built on actual census, land-use and population-mobility data. We find that the contact network among people is a strongly connected small-world-like5 graph with a well-defined scale for the degree distribution. However, the locations graph is scale-free6, which allows highly efficient outbreak detection by placing sensors in the hubs of the locations network. Within this large-scale simulation framework, we then analyse the relative merits of several proposed mitigation strategies for smallpox spread. Our results suggest that outbreaks can be contained by a strategy of targeted vaccination combined with early detection without resorting to mass vaccination of a population.}, isbn = {0028-0836}, doi = {10.1038/nature02541}, url = {http://www.nature.com/nature/journal/v429/n6988/full/nature02541.html}, author = {Eubank,Stephen and Guclu,Hasan and Kumar,V. S. Anil and Marathe,Madhav V. and Srinivasan, Aravind and Toroczkai,Zolt|[aacute]|n and Wang,Nan} } @article {13267, title = {A multi-resolution topological representation for non-manifold meshes}, journal = {Computer-Aided Design}, volume = {36}, year = {2004}, month = {2004/02//}, pages = {141 - 159}, abstract = {We address the problem of representing and processing 3D objects, described through simplicial meshes, which consist of parts of mixed dimensions, and with a non-manifold topology, at different levels of detail. First, we describe a multi-resolution model, that we call a non-manifold multi-tessellation (NMT), and we consider the selective refinement query, which is at the heart of several analysis operations on multi-resolution meshes. Next, we focus on a specific instance of a NMT, generated by simplifying simplicial meshes based on vertex-pair contraction, and we describe a compact data structure for encoding such a model. We also propose a new data structure for two-dimensional simplicial meshes, capable of representing both connectivity and adjacency information with a small memory overhead, which is used to describe the mesh extracted from an NMT through selective refinement. Finally, we present algorithms to efficiently perform updates on such a data structure.}, keywords = {Data structures, Multi-resolution, Non-manifold modeling}, isbn = {0010-4485}, doi = {10.1016/S0010-4485(03)00058-7}, url = {http://www.sciencedirect.com/science/article/pii/S0010448503000587}, author = {De Floriani, Leila and Magillo,Paola and Puppo,Enrico and Sobrero,Davide} } @article {14990, title = {Multiscale advanced raster map analysis system: definition, design and development}, journal = {Environmental and Ecological Statistics}, volume = {11}, year = {2004}, month = {2004///}, pages = {113 - 138}, abstract = {This paper brings together a multidisciplinary initiative to develop advanced statistical and computational techniques for analyzing, assessing, and extracting information from raster maps. This information will provide a rigorous foundation to address a wide range of applications including disease mapping, emerging infectious diseases, landscape ecological assessment, land cover trends and change detection, watershed assessment, and map accuracy assessment. It will develop an advanced map analysis system that integrates these techniques with an advanced visualization toolbox, and use the system to conduct large case studies using rich sets of raster data, primarily from remotely sensed imagery. As a result, it will be possible to study and evaluate raster maps of societal, ecological, and environmental variables to facilitate quantitative characterization and comparative analysis of geospatial trends, patterns, and phenomena. In addition to environmental and ecological studies, these techniques and tools can be used for policy decisions at national, state, and local levels, crisis management, and protection of infrastructure. Geospatial data form the foundation of an information-based society. Remote sensing has been a vastly under-utilized resource involving a multi-million dollar investment at the national levels. Even when utilized, the credibility has been at stake, largely because of lack of tools that can assess, visualize, and communicate accuracy and reliability in timely manner and at desired confidence levels. Consider an imminent 21st century scenario: What message does a multi-categorical map have about the large landscape it represents? And at what scale, and at what level of detail? Does the spatial pattern of the map reveal any societal, ecological, environmental condition of the landscape? And therefore can it be an indicator of change? How do you automate the assessment of the spatial structure and behavior of change to discover critical areas, hot spots, and their corridors? Is the map accurate? How accurate is it? How do you assess the accuracy of the map? How do we evaluate a temporal change map for change detection? What are the implications of the kind and amount of change and accuracy on what matters, whether climate change, carbon emission, water resources, urban sprawl, biodiversity, indicator species, human health, or early warning? And with what confidence? The proposed research initiative is expected to find answers to these questions and a few more that involve multi-categorical raster maps based on remote sensing and other geospatial data. It includes the development of techniques for map modeling and analysis using Markov Random Fields, geospatial statistics, accuracy assessment and change detection, upper echelons of surfaces, advanced computational techniques for geospatial data mining, and advanced visualization techniques.}, doi = {10.1023/B:EEST.0000027205.77490.8c}, author = {Patil,G. P. and Balbus,J. and Biging,G. and JaJa, Joseph F. and Myers,W. L. and Taillie,C.} } @article {12149, title = {New year{\textquoteright}s resolutions for software quality}, journal = {IEEE Software}, volume = {21}, year = {2004}, month = {2004///}, pages = {12 - 13}, abstract = {In the spirit of making resolutions for betterment in the New Year, ten distinguished individuals in the software quality field offer their recommendations on how organizations can improve software quality In the spirit of making resolutions for betterment in the New Year, ten distinguished individuals in the software quality field offer their recommendations on how organizations can improve software quality.}, author = {Basili, Victor R. and Boehm,B. and Davis,A. and Humphrey,W. S and Leveson,N. and Mead,N. R and Musa,J. D and Parnas,D. L and Pfleeger,S. L and Weyuker,E.} } @article {15372, title = {A novel approach to removing intersymbol interference from spin-stand images}, journal = {Magnetics, IEEE Transactions on}, volume = {40}, year = {2004}, month = {2004/07//}, pages = {2197 - 2199}, abstract = {A novel intersymbol interference (ISI) removal technique based on the "response function" characterization of giant-magnetoresistive heads is presented. It is demonstrated that the ISI-free readback image that corresponds to the actual underlying magnetization patterns can be extracted from the ISI-distorted readback signal through deconvolution. A new image deconvolution algorithm has been implemented, and it has been shown that it effectively removes the ISI distortions.}, keywords = {algorithm;, characterization;, Deconvolution, function, function;, giant, giant-magnetoresistive, Head, heads;, image, image;, imaging;, Interference, interference;, intersymbol, ISI-distorted, ISI-free, magnetic, magnetization, magnetoresistance;, patterns;, readback, removal;, response, signal;, spin-stand, suppression;}, isbn = {0018-9464}, doi = {10.1109/TMAG.2004.830153}, author = {Mayergoyz, Issak D and Tse,C. and Krafft,C. and McAvoy,P.} } @conference {13031, title = {Np bracketing by maximum entropy tagging and SVM reranking}, booktitle = {Proceedings of EMNLP}, volume = {4}, year = {2004}, month = {2004///}, author = {Daum{\'e}, Hal and Marcu,D.} } @article {12938, title = {Pandemic strains of O3:K6 Vibrio parahaemolyticus in the aquatic environment of Bangladesh}, journal = {Canadian Journal of Microbiology}, volume = {50}, year = {2004}, month = {2004/10//}, pages = {827 - 834}, abstract = {A total of 1500 environmental strains of Vibrio parahaemolyticus, isolated from the aquatic environment of Bangladesh, were screened for the presence of a major V. parahaemolyticus virulence factor, the thermostable direct haemolysin (tdh) gene, by the colony blot hybridization method using a digoxigenin-labeled tdh gene probe. Of 1500 strains, 5 carried the tdh sequence, which was further confirmed by PCR using primers specific for the tdh gene. Examination by PCR confirmed that the 5 strains were V. parahamolyticus and lacked the thermostable direct haemolysin-related haemolysin (trh) gene, the alternative major virulence gene known to be absent in pandemic strains. All 5 strains gave positive Kanagawa phenomenon reaction with characteristic beta-haemolysis on Wagatsuma agar medium. Southern blot analysis of the HindIII-digested chromosomal DNA demonstrated, in all 5 strains, the presence of 2 tdh genes common to strains positive for Kanagawa phenomenon. However, the 5 strains were found to belong to 3 different serotypes (O3:K29, O4:K37, and O3:K6). The 2 with pandemic serotype O3:K6 gave positive results in group-specific PCR and ORF8 PCR assays, characteristics unique to the pandemic clone. Clonal variations among the 5 isolates were analyzed by comparing RAPD and ribotyping patterns. Results showed different patterns for the 3 serotypes, but the pattern was identical among the O3:K6 strains. This is the first report on the isolation of pandemic O3:K6 strains of V. parahaemolyticus from the aquatic environment of Bangladesh.}, url = {http://umd.library.ingentaconnect.com/content/nrc/cjm/2004/00000050/00000010/art00007}, author = {Islam,M. S. and Tasmin,Rizwana and Khan,Sirajul I. s l a m and Bakht,Habibul B. M. and Mahmood,Zahid H. a y a t and Rahman,M. Z. i a u r and Bhuiyan,Nurul A. m i n and Nishibuchi,Mitsuaki and Nair,G. B. a l a k r i s h and Sack,R. B. r a d l e y and Huq,Anwar and Rita R Colwell and Sack,David A.} } @article {15015, title = {PAWN: Producer-Archive Workflow Network in support of digital preservation}, volume = {UMIACS-TR-2004}, year = {2004}, month = {2004///}, pages = {2006 - 2006}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {We describe the design and the implementation of the PAWN (Producer {\textendash} ArchiveWorkflow Network) environment to enable secure and distributed ingestion of digital objects into a persistent archive. PAWN was developed to capture the core elements required for long term preservation of digital objects as identified by previous research in the digital library and archiving communities. In fact, PAWN can be viewed as an implementation of the Ingest Process as defined by the Open Archival Information System (OAIS) Reference Model, and is currently being used to ingest significant collections into a pilot persistent archive developed through a collaboration between the San Diego Supercomputer Center, the University of Maryland, and the National Archives and Records Administration. We make use of METS (Metadata Encoding and Transmission Standards) to encapsulate content, structural, descriptive, and preservation metadata. The basic software components are based on open standards and web technologies, and hence are platform independent. }, author = {Smorul,M. and JaJa, Joseph F. and Wang, Y. and McCall,F.} } @conference {13044, title = {A phrase-based hmm approach to document/abstract alignment}, booktitle = {Proceedings of EMNLP}, year = {2004}, month = {2004///}, pages = {119 - 126}, author = {Daum{\'e}, Hal and Marcu,D.} } @article {15498, title = {Preserving distributed systems critical properties: a model-driven approach}, journal = {Software, IEEE}, volume = {21}, year = {2004}, month = {2004///}, pages = {32 - 40}, abstract = {The need for creating predictability in distributed systems is most often specified in terms of quality-of-service (QoS) requirements, which help define the acceptable levels of dependability with which capabilities such as processing capacity, data throughput, or service availability reach users. For longer-term properties such as scalability, maintainability, adaptability, and system security, we can similarly use persistent software attributes (PSAs) to specify how and to what degree such properties must remain intact as a network expands and evolves over time. The Skoll distributed continuous software quality assurance process helps to identify viable system and software configurations for meeting stringent QOS and PSA requirements by coordinating the use of distributed computing resources. The authors tested their process using the large, rapidly evolving ACE+TAO middleware suite.}, keywords = {configuration management, formal verification, Middleware, middleware suite, model-driven approach, persistent software attributes, QoS requirements, Quality assurance, quality of service, quality-of-service, Skoll distributed computing resources, software configuration, Software maintenance, Software quality, software quality assurance process, system dependability}, isbn = {0740-7459}, doi = {10.1109/MS.2004.50}, author = {Yilmaz,C. and Memon, Atif M. and Porter, Adam and Krishna,A. S and Schmidt,D. C and Gokhale,A. and Natarajan,B.} } @article {12080, title = {Proactive key distribution using neighbor graphs}, journal = {IEEE Wireless Communications}, volume = {11}, year = {2004}, month = {2004/02//}, pages = {26 - 36}, abstract = {User mobility in wireless data networks is increasing because of technological advances, and the desire for voice and multimedia applications. These applications, however, require that handoffs between base stations (or access points) be fast to maintain the quality of the connections. In this article we introduce a novel data structure, the neighbor graph, that dynamically captures the mobility topology of a wireless network. We show how neighbor graphs can be utilized to obtain a 99 percent reduction in the authentication time of an IEEE 802.11 handoff (full EAP-TLS) by proactively distributing necessary key material one hop ahead of the mobile user. We also present a reactive method for fast authentication that requires only firmware changes to access points and hence can easily be deployed on existing wireless networks.}, keywords = {access points, Authentication, authentication time, Base stations, Communication system security, Delay, graph theory, GSM, IEEE 802.11 handoff, Land mobile radio cellular systems, Message authentication, mobile radio, Multiaccess communication, neighbor graph, Network topology, Roaming, telecommunication security, Telephone sets, user mobility, Wi-Fi networks, wireless data networks, Wireless LAN, Wireless networks}, isbn = {1536-1284}, doi = {10.1109/MWC.2004.1269714}, author = {Mishra,A. and Min Ho Shin and Petroni,N. L. and Clancy,T. C and Arbaugh, William A.} } @article {12709, title = {Probabilistic analysis of kernel principal components}, journal = {NIPS}, year = {2004}, month = {2004///}, abstract = {This paper presents a probabilistic analysis of kernel principal compo-nents by unifying the theory of probabilistic principal component analy- sis and kernel principal component analysis. It is shown that, while the kernel component enhances the nonlinear modeling power, the proba- bilistic structure offers (i) a mixture model for nonlinear data structure containing nonlinear sub-structures, and (ii) an effective classification scheme. It turns out that the original loading matrix is replaced by a newly defined empirical loading matrix. The expectation/maximization algorithm for learning parameters of interest is also presented. }, author = {Zhou, S. and Chellapa, Rama and Moghaddam, B.} } @conference {16120, title = {Project highlight: toward the statistical knowledge network}, booktitle = {Proceedings of the 2004 annual national conference on Digital government research}, series = {dg.o {\textquoteright}04}, year = {2004}, month = {2004///}, pages = {125:1{\textendash}125:2 - 125:1{\textendash}125:2}, publisher = {Digital Government Society of North America}, organization = {Digital Government Society of North America}, abstract = {This project aims to help people find and understand government statistical information. To achieve this goal, we envision a statistical knowledge network that brings stakeholders from government at all levels together with citizens who provide or seek statistical information. The linchpin of this network is a series of human-computer interfaces that facilitate information seeking, understanding, and use. In turn, these interfaces depend on high-quality metadata and intra-agency cooperation. In this briefing, we summarize our accomplishments in the second year of the project.}, url = {http://dl.acm.org/citation.cfm?id=1124191.1124316}, author = {Marchionini,Gary and Haas,Stephanie and Shneiderman, Ben and Plaisant, Catherine and Hert,Carol A.} } @article {18018, title = {Reconfigurable optical wireless sensor networks}, journal = {Proceedings of SPIE}, volume = {5237}, year = {2004}, month = {2004/02/06/}, pages = {136 - 146}, abstract = {Optical wireless networks are emerging as a viable, cost effective technology for rapidly deployable broadband sensor communication infrastructures. The use of directional, narrow beam, optical wireless links provides great promise for secure, extremely high data rate communication between fixed or mobile nodes, very suitable for sensor networks in civil and military contexts. The main challenge is to maintain the quality of such networks, as changing atmosphericand platform conditions critically affect their performance. Topology control is used as the means to achieve survivable optical wireless networking under adverse conditions, based on dynamic and autonomous topology reconfiguration. The topology control process involves tracking and acquisition of nodes, assessment of link-state information, collection and distribution of topology data, and the algorithmic solution of an optimal topology. This paper focuses onthe analysis, implementation and evaluation of algorithms and heuristics for selecting the best possible topology in order to optimize a given performance objective while satisfying connectivity constraints. The work done at the physical layer is based on link cost information. A cost measure is defined in terms of bit-error-rate and the heuristics developed seek to form a bi-connected topology which minimizes total network cost. At the network layer a key factor is the traffic matrix, and heuristics were developed in order to minimize congestion, flow-rate or end-to-end delay.}, isbn = {0277786X}, doi = {doi:10.1117/12.511368}, url = {http://spiedigitallibrary.org/proceedings/resource/2/psisdg/5237/1/136_1?isAuthorized=no}, author = {Llorca,Jaime and Desai,Aniket and Vishkin, Uzi and Davis,Christopher C. and Milner,Stuart D} } @conference {15109, title = {Reducing complexity assumptions for statistically-hiding commitment}, booktitle = {In EUROCRYPT}, year = {2004}, month = {2004///}, abstract = {Determining the minimal assumptions needed to construct various cryptographic buildingblocks has been a focal point of research in theoretical cryptography. For most {\textemdash} but not all! {\textemdash} cryptographic primitives, complexity assumptions both necessary and sufficient for their existence are known. Here, we revisit the following, decade-old question: what are the minimal assumptions needed to construct a statistically-hiding bit commitment scheme? Previously, it was known how to construct such schemes based on any one-way permutation. In this work, we show that regular one-way functions suffice. We show two constructions of statistically-hiding commitment schemes from regular one-way functions. Our first construction is more direct, and serves as a {\textquotedblleft}stepping-stone{\textquotedblright} for our second construction which has improved round complexity. Of independent interest, as part of our work we show a compiler transforming any commitment scheme which is statistically-hiding against an honest-but-curious receiver to one which is statistically-hiding against a malicious receiver. This demonstrates the equivalence of these two formulations of the problem. }, author = {Horvitz,O. and Katz, Jonathan and Koo,C. Y and Morselli,R.} } @article {18989, title = {Reducing storage requirements for biological sequence comparison}, journal = {BioinformaticsBioinformatics}, volume = {20}, year = {2004}, month = {2004/12/12/}, pages = {3363 - 3369}, abstract = {Motivation: Comparison of nucleic acid and protein sequences is a fundamental tool of modern bioinformatics. A dominant method of such string matching is the {\textquoteleft}seed-and-extend{\textquoteright} approach, in which occurrences of short subsequences called {\textquoteleft}seeds{\textquoteright} are used to search for potentially longer matches in a large database of sequences. Each such potential match is then checked to see if it extends beyond the seed. To be effective, the seed-and-extend approach needs to catalogue seeds from virtually every substring in the database of search strings. Projects such as mammalian genome assemblies and large-scale protein matching, however, have such large sequence databases that the resulting list of seeds cannot be stored in RAM on a single computer. This significantly slows the matching process.Results: We present a simple and elegant method in which only a small fraction of seeds, called {\textquoteleft}minimizers{\textquoteright}, needs to be stored. Using minimizers can speed up string-matching computations by a large factor while missing only a small fraction of the matches found using all seeds. }, isbn = {1367-4803, 1460-2059}, doi = {10.1093/bioinformatics/bth408}, url = {http://bioinformatics.oxfordjournals.org/content/20/18/3363}, author = {Roberts,Michael and Hayes,Wayne and Hunt,Brian R. and Mount, Stephen M. and Yorke,James A.} } @article {13852, title = {RT-S: Surface rich transcription scoring, methodology, and initial results}, journal = {Proc. DARPA Rich Transcription Workshop}, year = {2004}, month = {2004///}, abstract = {In this paper we present a methodoly for the scoring ofpunctuation annotated texts, as well as a preliminary system to perform the task. We modify SCLITE{\textquoteright}s scoring method- ology to support scoring of punctuation. Using this method- ology, we show that the error rate of an initial automatic sys- tem is comparable to annotator inconsistency. However, the use of multiple references allows us to differentiate between human inconsistencies and system errors. }, author = {Snover,M. and Schwartz,R. and Dorr, Bonnie J and Makhoul,J.} } @article {14070, title = {Schistosoma mansoni genome project: an update}, journal = {Parasitology International}, volume = {53}, year = {2004}, month = {2004/06//}, pages = {183 - 192}, abstract = {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.}, keywords = {Chromosome mapping, Gene discovery, Genomics, Schistosoma mansoni}, isbn = {1383-5769}, doi = {16/j.parint.2004.01.009}, url = {http://www.sciencedirect.com/science/article/pii/S1383576904000108}, author = {LoVerde,Philip T. and Hirai,Hirohisa and Merrick,Joseph M and Lee,Norman H and El-Sayed, Najib M.} } @conference {18278, title = {Security evaluation for communication-friendly encryption of multimedia}, booktitle = {Image Processing, 2004. ICIP {\textquoteright}04. 2004 International Conference on}, volume = {1}, year = {2004}, month = {2004/10//}, pages = {569 - 572 Vol. 1 - 569 - 572 Vol. 1}, abstract = {This paper addresses the access control issues unique to multimedia, by using a joint signal processing and cryptographic approach to multimedia encryption. Based on three atomic encryption primitives, we present a systematic study on how to strategically integrate different atomic operations to build a video encryption system. We also propose a set of multimedia-specific security metrics to quantify the security against approximation attacks and to complement the existing notion of generic data security. The resulting system can provide superior performance to both generic encryption and its simple adaptation to video in terms of a joint consideration of security, bitrate overhead, and communication friendliness.}, keywords = {access, approximation, atomic, attacks;, bitrate, coding;, communication-friendly, communication;, control;, cryptography;, data, encryption, encryption;, generic, joint, method;, metrics;, multimedia, multimedia-specific, overhead;, primitives;, processing/cryptographic, Security, security;, signal, system;, Telecommunication, video}, doi = {10.1109/ICIP.2004.1418818}, author = {Mao,Yinian and M. Wu} } @article {12075, title = {Security issues in IEEE 802.11 wireless local area networks: a survey}, journal = {Wireless Communications and Mobile Computing}, volume = {4}, year = {2004}, month = {2004///}, pages = {821 - 833}, author = {Mishra,A. and Petroni Jr,N. L and Arbaugh, William A. and Fraser,T.} } @article {13325, title = {Selective refinement queries for volume visualization of unstructured tetrahedral meshes}, journal = {Visualization and Computer Graphics, IEEE Transactions on}, volume = {10}, year = {2004}, month = {2004///}, pages = {29 - 45}, abstract = {We address the problem of the efficient visualization of large irregular volume data sets by exploiting a multiresolution model based on tetrahedral meshes. Multiresolution models, also called Level-Of-Detail (LOD) models, allow encoding the whole data set at a virtually continuous range of different resolutions. We have identified a set of queries for extracting meshes at variable resolution from a multiresolution model, based on field values, domain location, or opacity of the transfer function. Such queries allow trading off between resolution and speed in visualization. We define a new compact data structure for encoding a multiresolution tetrahedral mesh built through edge collapses to support selective refinement efficiently and show that such a structure has a storage cost from 3 to 5.5 times lower than standard data structures used for tetrahedral meshes. The data structures and variable resolution queries have been implemented together with state-of-the art visualization techniques in a system for the interactive visualization of three-dimensional scalar fields defined on tetrahedral meshes. Experimental results show that selective refinement queries can support interactive visualization of large data sets.}, keywords = {Automated;Signal Processing, Computer-Assisted;Imaging, Computer-Assisted;User-Computer Interface;, data structure;geometric modeling;interactive visualization;large data sets;multiresolution model;selective refinement queries;unstructured tetrahedral meshes;variable resolution queries;volume data visualization;data visualisation;mesh generation;query p, Three-Dimensional;Online Systems;Pattern Recognition}, isbn = {1077-2626}, doi = {10.1109/TVCG.2004.1260756}, author = {Cignoni,P. and De Floriani, Leila and Magillo,P. and Puppo,E. and Scopigno,R.} } @article {13854, title = {Semantic annotation and lexico-syntactic paraphrase}, journal = {Proceedings of the 4th International Conference on Language Resources and Evaluation (LREC) Workshop on Building Lexical Resources from Semantically Annotated Corpora}, year = {2004}, month = {2004///}, pages = {47 - 52}, abstract = {The IAMTC project (Interlingual Annotation of Multilingual Translation Corpora) is developing an interlingual representation frameworkfor annotation of parallel corpora (English paired with Arabic, French, Hindi, Japanese, Korean, and Spanish) with deep-semantic representations. In particular, we are investigating meaning equivalent paraphrases involving conversives and non-literal language use, as well as extended paraphrases involving syntax, lexicon, and grammatical features. The interlingua representation has three levels of depth. Each level is characterized by the types of meaning equivalent paraphrases that receive identical representations at that level. }, author = {Dorr, Bonnie J and Green,R. and Levin,L. and Rambow,O. and Farwell,D. and Habash,N. and Helmreich,S. and Hovy,E. and Miller,K.J. and Mitamura,T. and others} } @article {13855, title = {Semantic Annotation for Interlingual Representation of Multilingual Texts}, journal = {Workshop Programme}, year = {2004}, month = {2004///}, pages = {19 - 19}, abstract = {This paper describes the annotation process being used in a multi-site project to create six sizable bilingual parallel corpora annotated with a consistent interlingua representation. After presenting the background and objectives of the effort, we describe the multilingual corpora and the three stages of interlingual representation being developed. We then focus on the annotation process itself, including an interface environment that supports the annotation task, and the methodology for evaluating the interlingua representation. Finally, we discuss some issues encountered during the annotation tasks. The resulting annotated multilingual corpora will be useful for a wide range of natural language processing research tasks, including machine translation, question answering, text summarization, and information extraction.}, author = {Mitamura,T. and Miller,K. and Dorr, Bonnie J and Farwell,D. and Habash,N. and Helmreich,S. and Hovy,E. and Levin,L. and Rambow,O. and Reeder,F. and others} } @article {14080, title = {Sequencing Strategies for Parasite Genomes}, journal = {METHODS IN MOLECULAR BIOLOGY-CLIFTON THEN TOTOWA-}, volume = {270}, year = {2004}, month = {2004///}, pages = {1 - 16}, author = {Bartholomeu,D. and El-Sayed, Najib M. and Melville,S. E.} } @article {13021, title = {Simple statistical models predict C-to-U edited sites in plant mitochondrial RNA}, journal = {BMC Bioinformatics}, volume = {5}, year = {2004}, month = {2004/09//}, pages = {132 - 132}, abstract = {BACKGROUND: RNA editing is the process whereby an RNA sequence is modified from the sequence of the corresponding DNA template. In the mitochondria of land plants, some cytidines are converted to uridines before translation. Despite substantial study, the molecular biological mechanism by which C-to-U RNA editing proceeds remains relatively obscure, although several experimental studies have implicated a role for cis-recognition. A highly non-random distribution of nucleotides is observed in the immediate vicinity of edited sites (within 20 nucleotides 5{\textquoteright} and 3{\textquoteright}), but no precise consensus motif has been identified. RESULTS: Data for analysis were derived from the the complete mitochondrial genomes of Arabidopsis thaliana, Brassica napus, and Oryza sativa; additionally, a combined data set of observations across all three genomes was generated. We selected datasets based on the 20 nucleotides 5{\textquoteright} and the 20 nucleotides 3{\textquoteright} of edited sites and an equivalently sized and appropriately constructed null-set of non-edited sites. We used tree-based statistical methods and random forests to generate models of C-to-U RNA editing based on the nucleotides surrounding the edited/non-edited sites and on the estimated folding energies of those regions. Tree-based statistical methods based on primary sequence data surrounding edited/non-edited sites and estimates of free energy of folding yield models with optimistic re-substitution-based estimates of approximately 0.71 accuracy, approximately 0.64 sensitivity, and approximately 0.88 specificity. Random forest analysis yielded better models and more exact performance estimates with approximately 0.74 accuracy, approximately 0.72 sensitivity, and approximately 0.81 specificity for the combined observations. CONCLUSIONS: Simple models do moderately well in predicting which cytidines will be edited to uridines, and provide the first quantitative predictive models for RNA edited sites in plant mitochondria. Our analysis shows that the identity of the nucleotide -1 to the edited C and the estimated free energy of folding for a 41 nt region surrounding the edited C are the most important variables that distinguish most edited from non-edited sites. However, the results suggest that primary sequence data and simple free energy of folding calculations alone are insufficient to make highly accurate predictions.}, doi = {10.1186/1471-2105-5-132}, author = {Cummings, Michael P. and Myers,D. S} } @conference {15468, title = {Skoll: distributed continuous quality assurance}, booktitle = {Software Engineering, 2004. ICSE 2004. Proceedings. 26th International Conference on}, year = {2004}, month = {2004/05//}, pages = {459 - 468}, abstract = {Quality assurance (QA) tasks, such as testing, profiling, and performance evaluation, have historically been done in-house on developer-generated workloads and regression suites. Since this approach is inadequate for many systems, tools and processes are being developed to improve software quality by increasing user participation in the QA process. A limitation of these approaches is that they focus on isolated mechanisms, not on the coordination and control policies and tools needed to make the global QA process efficient, effective, and scalable. To address these issues, we have initiated the Skoll project, which is developing and validating novel software QA processes and tools that leverage the extensive computing resources of worldwide user communities in a distributed, continuous manner to significantly and rapidly improve software quality. This paper provides several contributions to the study of distributed continuous QA. First, it illustrates the structure and functionality of a generic around-the-world, around-the-clock QA process and describes several sophisticated tools that support this process. Second, it describes several QA scenarios built using these tools and process. Finally, it presents a feasibility study applying these scenarios to a 1MLOC+ software package called ACE+TAO. While much work remains to be done, the study suggests that the Skoll process and tools effectively manage and control distributed, continuous QA processes. Using Skoll we rapidly identified problems that had taken the ACE+TAO developers substantially longer to find and several of which had previously not been found. Moreover, automatic analysis of QA task results often provided developers information that quickly led them to the root cause of the problems.}, keywords = {1MLOC+ software package, ACE+TAO, around-the-clock QA process, around-the-world QA process, distributed continuous QA, distributed continuous quality assurance, distributed programming, program verification, Quality assurance, Skoll, software performance evaluation, software profiling, Software quality, Software testing}, doi = {10.1109/ICSE.2004.1317468}, author = {Memon, Atif M. and Porter, Adam and Yilmaz,C. and Nagarajan,A. and Schmidt,D. and Natarajan,B.} } @conference {17661, title = {Structural and algorithmic aspects of massive social networks}, booktitle = {Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms}, series = {SODA {\textquoteright}04}, year = {2004}, month = {2004///}, pages = {718 - 727}, publisher = {Society for Industrial and Applied Mathematics}, organization = {Society for Industrial and Applied Mathematics}, address = {Philadelphia, PA, USA}, abstract = {We study the algorithmic and structural properties of very large, realistic social contact networks. We consider the social network for the city of Portland, Oregon, USA, developed as a part of the TRANSIMS/EpiSims project at the Los Alamos National Laboratory. The most expressive social contact network is a bipartite graph, with two types of nodes: people and locations; edges represent people visiting locations on a typical day. Three types of results are presented. (i) Our empirical results show that many basic characteristics of the dataset are well-modeled by a random graph approach suggested by Fan Chung Graham and Lincoln Lu (the CL-model), with a power-law degree distribution. (ii) We obtain fast approximation algorithms for computing basic structural properties such as clustering coefficients and shortest paths distribution. We also study the dominating set problem for such networks; this problem arose in connection with optimal sensor-placement for disease-detection. We present a fast approximation algorithm for computing near-optimal dominating sets. (iii) Given the close approximations provided by the CL-model to our original dataset and the large data-volume, we investigate fast methods for generating such random graphs. We present methods that can generate such a random network in near-linear time, and show that these variants asymptotically share many key features of the CL-model, and also match the Portland social network.The structural results have been used to study the impact of policy decisions for controlling large-scale epidemics in urban environments.}, isbn = {0-89871-558-X}, url = {http://dl.acm.org/citation.cfm?id=982792.982902}, author = {Eubank,Stephen and Kumar,V. S. Anil and Marathe,Madhav V. and Srinivasan, Aravind and Wang,Nan} } @conference {13057, title = {Supervised clustering with the dirichlet process}, booktitle = {NIPS{\textquoteright}04 Learning With Structured Outputs Workshop}, year = {2004}, month = {2004///}, author = {Daum{\'e}, Hal and Marcu,D.} } @article {13867, title = {Symbolic MT With Statistical NLP Components}, year = {2004}, month = {2004/06//}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {This reports provides an overview of the findings and software that have evolved from the "Symbolic MT with Statistical NLP Components" project over the last year. We present the major goals that have been achieved and discuss some of the open issues that we intend to address in the near future. This report also contains some details on the usage of some software that has been implemented during the project.}, keywords = {*MACHINE TRANSLATION, computational linguistics, COMPUTER PROGRAMS, CYBERNETICS, DIVERGENCE UNRAVELING, GHMT(GENERATION-HEAVY MACHINE TRANSLATION), INFORMATION SCIENCE, linguistics, natural language, RESOURCE PROJECTION}, url = {http://stinet.dtic.mil/oai/oai?\&verb=getRecord\&metadataPrefix=html\&identifier=ADA458796}, author = {Dorr, Bonnie J and Habash,Nizar Y and Monz,Christof} } @article {12169, title = {Toolkit design for interactive structured graphics}, journal = {Software Engineering, IEEE Transactions on}, volume = {30}, year = {2004}, month = {2004///}, pages = {535 - 546}, author = {Bederson, Benjamin B. and Grosjean,J. and Meyer,J.} } @article {13909, title = {Tools for children to create physical interactive storyrooms}, journal = {Computers in Entertainment (CIE)}, volume = {2}, year = {2004}, month = {2004///}, pages = {12 - 12}, author = {Montemayor,J. and Druin, Allison and Chipman,G. and Farber,A. and Guha,M.L.} } @conference {13039, title = {A tree-position kernel for document compression}, booktitle = {Proceedings of the Fourth Document Understanding Conference (DUC 2004)}, year = {2004}, month = {2004///}, pages = {6 - 7}, author = {Daum{\'e}, Hal and Marcu,D.} } @conference {12289, title = {Trust-preserving set operations}, booktitle = {INFOCOM 2004. Twenty-third AnnualJoint Conference of the IEEE Computer and Communications Societies}, volume = {4}, year = {2004}, month = {2004/03//}, pages = {2231 - 2241 vol.4 - 2231 - 2241 vol.4}, abstract = {We describe a method for performing trust-preserving set operations by untrusted parties. Our motivation for this is the problem of securely reusing content-based search results in peer-to-peer networks. We model search results and indexes as data sets. Such sets have value for answering a new query only if they are trusted. In the absence of any system-wide security mechanism, a data set is trusted by a node a only if it was generated by some node which is trusted by a. Our main contributions are a formal definition of the problem as well as an efficient scheme that solves this problem by allowing untrusted peers to perform set operations on trusted data sets while also producing unforgeable proofs of correctness. This is accomplished by requiring trusted nodes to sign appropriately-defined digests of generated sets; each such digest consists of an RSA accumulator and a Bloom filter. The scheme is general, and has other applications as well. We give an analysis demonstrating the low overhead of the scheme, and we include experimental data which confirm the analysis.}, keywords = {accumulator;, Bloom, computing;, filter;, mechanism;, network;, operation;, peer-to-peer, RSA, Security, security;, set, system-wide, Telecommunication, theory;, trust-preserving}, doi = {10.1109/INFCOM.2004.1354646}, author = {Morselli,R. and Bhattacharjee, Bobby and Katz, Jonathan and Keleher,P.} } @conference {13210, title = {Uncalibrated stereo rectification for automatic 3D surveillance}, booktitle = {Image Processing, 2004. ICIP {\textquoteright}04. 2004 International Conference on}, volume = {2}, year = {2004}, month = {2004/10//}, pages = {1357 - 1360 Vol.2 - 1357 - 1360 Vol.2}, abstract = {We describe a stereo rectification method suitable for automatic 3D surveillance. We take advantage of the fact that in a typical urban scene, there is ordinarily a small number of dominant planes. Given two views of the scene, we align a dominant plane in one view with the other. Conjugate epipolar lines between the reference view and plane-aligned image become geometrically identical and can be added to the rectified image pair line by line. Selecting conjugate epipolar lines to cover the whole image is simplified since they are geometrically identical. In addition, the polarities of conjugate epipolar lines are automatically preserved by plane alignment, which simplifies stereo matching.}, keywords = {3D, AUTOMATIC, conjugate, epipolar, image, lines;, matching;, method;, processing;, rectification, scene;, stereo, surveillance;, uncalibrated, urban}, doi = {10.1109/ICIP.2004.1419753}, author = {Lim,S.-N. and Mittal,A. and Davis, Larry S. and Paragios,N.} } @article {14271, title = {Uncertainty in visual processes predicts geometrical optical illusions}, journal = {Vision Research}, volume = {44}, year = {2004}, month = {2004/03//}, pages = {727 - 749}, abstract = {It is proposed in this paper that many geometrical optical illusions, as well as illusory patterns due to motion signals in line drawings, are due to the statistics of visual computations. The interpretation of image patterns is preceded by a step where image features such as lines, intersections of lines, or local image movement must be derived. However, there are many sources of noise or uncertainty in the formation and processing of images, and they cause problems in the estimation of these features; in particular, they cause bias. As a result, the locations of features are perceived erroneously and the appearance of the patterns is altered. The bias occurs with any visual processing of line features; under average conditions it is not large enough to be noticeable, but illusory patterns are such that the bias is highly pronounced. Thus, the broader message of this paper is that there is a general uncertainty principle which governs the workings of vision systems, and optical illusions are an artifact of this principle.}, keywords = {Bias, Estimation processes, Motion perception, NOISE, optical illusions}, isbn = {0042-6989}, doi = {10.1016/j.visres.2003.09.038}, url = {http://www.sciencedirect.com/science/article/pii/S0042698903006904}, author = {Ferm{\"u}ller, Cornelia and Malm,Henrik} } @article {13886, title = {Use of Minimal Lexical Conceptual Structures for Single-Document Summarization}, year = {2004}, month = {2004/06//}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {This reports provides an overview of the findings and software that have evolved from the Use of Minimal Lexical Conceptual Structures for Single-Document Summarization project over the last six months. We present the major goals that have been achieved and discuss some of the open issues that we intend to address in the near future. This report also contains some details on the usage of some software that has been implemented during the project.}, keywords = {*COMPUTATIONAL LINGUISTICS, AUTOMATIC HEADLINE GENERATION, CYBERNETICS, DOCUMENT SUMMARIZATION, Information retrieval, INFORMATION SCIENCE, linguistics, Machine translation}, url = {http://stinet.dtic.mil/oai/oai?\&verb=getRecord\&metadataPrefix=html\&identifier=ADA458797}, author = {Dorr, Bonnie J and Habash,Nizar Y and Monz,Christof and Schwartz,Richard} } @article {15442, title = {Using tasks to automate regression testing of GUIs}, journal = {International Conference on Artificial intelligence and Applications (AIA 2004)}, year = {2004}, month = {2004///}, pages = {16 - 18}, abstract = {Graphical User Interfaces (GUIs) present unique chal-lenges for software testing. In this paper, we demonstrate that a test suite originally used to test a GUI contains a large number of unusable test cases for the modified GUI. We present a novel technique to recreate unusable test cases by associating meta-information (called a task) with each test case. Tasks represent activities that can be performed by using the software. The sequence of events in a test case represents the actions needed to complete its associated task. Even when changes to the GUI make test cases unus- able, many tasks remain valid across successive GUI ver- sions. We experimentally show that our technique is able to automatically and efficiently regenerate a large number of test cases. }, author = {Memon, Atif M.} } @conference {14452, title = {Using the structure of Web sites for automatic segmentation of tables}, booktitle = {Proceedings of the 2004 ACM SIGMOD international conference on Management of data}, series = {SIGMOD {\textquoteright}04}, year = {2004}, month = {2004///}, pages = {119 - 130}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Many Web sites, especially those that dynamically generate HTML pages to display the results of a user{\textquoteright}s query, present information in the form of list or tables. Current tools that allow applications to programmatically extract this information rely heavily on user input, often in the form of labeled extracted records. The sheer size and rate of growth of the Web make any solution that relies primarily on user input is infeasible in the long term. Fortunately, many Web sites contain much explicit and implicit structure, both in layout and content, that we can exploit for the purpose of information extraction. This paper describes an approach to automatic extraction and segmentation of records from Web tables. Automatic methods do not require any user input, but rely solely on the layout and content of the Web source. Our approach relies on the common structure of many Web sites, which present information as a list or a table, with a link in each entry leading to a detail page containing additional information about that item. We describe two algorithms that use redundancies in the content of table and detail pages to aid in information extraction. The first algorithm encodes additional information provided by detail pages as constraints and finds the segmentation by solving a constraint satisfaction problem. The second algorithm uses probabilistic inference to find the record segmentation. We show how each approach can exploit the web site structure in a general, domain-independent manner, and we demonstrate the effectiveness of each algorithm on a set of twelve Web sites.}, isbn = {1-58113-859-8}, doi = {10.1145/1007568.1007584}, url = {http://doi.acm.org/10.1145/1007568.1007584}, author = {Lerman,Kristina and Getoor, Lise and Minton,Steven and Knoblock,Craig} } @conference {15429, title = {Using transient/persistent errors to develop automated test oracles for event-driven software}, booktitle = {Automated Software Engineering, 2004. Proceedings. 19th International Conference on}, year = {2004}, month = {2004/09//}, pages = {186 - 195}, abstract = {Today{\textquoteright}s software-intensive systems contain an important class of software, namely event-driven software (EDS). All EDS take events as input, change their state, and (perhaps) output an event sequence. EDS is typically implemented as a collection of event-handlers designed to respond to individual events. The nature of EDS creates new challenges for test automation. In this paper, we focus on those relevant to automated test oracles. A test oracle is a mechanism that determines whether a software executed correctly for a test case. A test case for an EDS consists of a sequence of events. The test case is executed on the EDS, one event at a time. Errors in the EDS may "appear" and later {\textquotedblright}disappear" at several points (e.g., after an event is executed) during test case execution. Because of the behavior of these transient (those that disappear) and persistent (those that don{\textquoteright}t disappear) errors, EDS require complex and expensive test oracles that compare the expected and actual output multiple times during test case execution. We leverage our previous work to study several applications and observe the occurrence of persistent/transient errors. Our studies show that in practice, a large number of errors in EDS are transient and that there are specific classes of events that lead to transient errors. We use the results of this study to develop a new test oracle that compares the expected and actual output at strategic points during test case execution. We show that the oracle is effective at detecting errors and efficient in terms of resource utilization}, keywords = {automated test oracles, Automatic testing, event driven software, Graphical user interfaces, persistent errors, program testing, resource allocation, resource utilization, software intensive systems, test case execution, transient errors}, doi = {10.1109/ASE.2004.1342736}, author = {Memon, Atif M. and Xie,Qing} } @inbook {12294, title = {Using Trust in Recommender Systems: An Experimental Analysis}, booktitle = {Trust ManagementTrust Management}, series = {Lecture Notes in Computer Science}, volume = {2995}, year = {2004}, month = {2004///}, pages = {221 - 235}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {Recommender systems (RS) have been used for suggesting items (movies, books, songs, etc.) that users might like. RSs compute a user similarity between users and use it as a weight for the users{\textquoteright} ratings. However they have many weaknesses, such as sparseness, cold start and vulnerability to attacks. We assert that these weaknesses can be alleviated using a Trust-aware system that takes into account the {\textquotedblleft}web of trust{\textquotedblright} provided by every user. Specifically, we analyze data from the popular Internet web site epinions.com . The dataset consists of 49290 users who expressed reviews (with rating) on items and explicitly specified their web of trust, i.e. users whose reviews they have consistently found to be valuable. We show that any two users have usually few items rated in common. For this reason, the classic RS technique is often ineffective and is not able to compute a user similarity weight for many of the users. Instead exploiting the webs of trust, it is possible to propagate trust and infer an additional weight for other users. We show how this quantity can be computed against a larger number of users.}, keywords = {Computer, Science}, isbn = {978-3-540-21312-3}, url = {http://dx.doi.org/10.1007/978-3-540-24747-0_17}, author = {Massa,Paolo and Bhattacharjee, Bobby}, editor = {Jensen,Christian and Poslad,Stefan and Dimitrakos,Theo} } @article {15490, title = {Validating quality of service for reusable software via model-integrated distributed continuous quality assurance}, journal = {Software Reuse: Methods, Techniques, and Tools}, year = {2004}, month = {2004///}, pages = {286 - 295}, abstract = {Quality assurance (QA) tasks, such as testing, profiling, and performance evaluation, have historically been done in-house on developer-generated workloads and regression suites. Performance-intensive systems software, such as that found in the scientific computing grid and distributed real-time and embedded (DRE) domains, increasingly run on heterogeneous combinations of OS, compiler, and hardware platforms. Such software has stringent quality of service (QoS) requirements and often provides a variety of configuration options to optimize QoS. As a result, QA performed solely in-house is inadequate since it is hard to manage software variability, i.e., ensuring software quality on all supported target platforms across all desired configuration options. This paper describes how the Skoll project is addressing these issues by developing advanced QA processes and tools that leverage the extensive computing resources of user communities in a distributed, continuous manner to improve key software quality attributes.}, doi = {10.1007/978-3-540-27799-6_24}, author = {Krishna,A. and Schmidt,D. and Memon, Atif M. and Porter, Adam and Sevilla,D.} } @article {12942, title = {Variation of toxigenic Vibrio cholerae O1 in the aquatic environment of Bangladesh and its correlation with the clinical strains}, journal = {Microbiology and immunology}, volume = {48}, year = {2004}, month = {2004///}, pages = {773 - 777}, author = {Islam,M. S. and Talukder,K. A. and Khan,N. H. and Mahmud,Z. H. and Rahman,M. Z. and Nair,G. B. and Siddique,A. K. M. and Yunus,M. and Sack,D. A. and Sack,R. B. and Rita R Colwell} } @article {12680, title = {Video-Based Automatic Target Recognition}, year = {2004}, month = {2004/12//}, institution = {MARYLAND UNIV COLLEGE PARK CENTER FOR AUTOMATION RESEARCH}, abstract = {We present an approach for vehicle classification in IR video sequences by integrating detection, tracking and recognition. The method has two steps. First, the moving target is automatically detected using a detection algorithm. Next, we perform simultaneous tracking and recognition using an appearance-model based particle filter. The tracking result is evaluated at each frame. Low confidence in tracking performance initiates a new cycle of detection, tracking and classification. We demonstrate the robustness of the proposed method using outdoor IR video sequences.}, keywords = {*SEQUENCES(MATHEMATICS), *TARGET RECOGNITION, *VEHICLES, *VIDEO RECORDING, algorithms, AUTOMATIC TRACKING., COMPONENT REPORTS, MOVING TARGETS, SURFACE TRANSPORTATION AND EQUIPMENT, SYMPOSIA, TARGET CLASSIFICATION, TARGET DIRECTION, RANGE AND POSITION FINDING, tracking, VIDEO SIGNALS}, url = {http://stinet.dtic.mil/oai/oai?\&verb=getRecord\&metadataPrefix=html\&identifier=ADA431617}, author = {Zhou,S. K and Chellapa, Rama and Mei,Xue and Wu,Hao and Qinfen Zheng} } @article {13228, title = {Visibility analysis and sensor planning in dynamic environments}, journal = {Computer Vision-ECCV 2004}, year = {2004}, month = {2004///}, pages = {175 - 189}, abstract = {We analyze visibility from static sensors in a dynamic scene with moving obstacles (people). Such analysis is considered in a probabilistic sense in the context of multiple sensors, so that visibility from even one sensor might be sufficient. Additionally, we analyze worst-case scenarios for high-security areas where targets are non-cooperative. Such visibility analysis provides important performance characterization of multi-camera systems. Furthermore, maximization of visibility in a given region of interest yields the optimum number and placement of cameras in the scene. Our analysis has applications in surveillance {\textendash} manual or automated {\textendash} and can be utilized for sensor planning in places like museums, shopping malls, subway stations and parking lots. We present several example scenes {\textendash} simulated and real {\textendash} for which interesting camera configurations were obtained using the formal analysis developed in the paper.}, author = {Mittal,A. and Davis, Larry S.} } @article {15656, title = {Vision Geometry XII}, journal = {Society of Photo-Optical Instrumentation Engineers (SPIE) Conference Series}, volume = {5300}, year = {2004}, month = {2004///}, author = {Latecki,L.J. and Mount, Dave and Wu,A. Y} } @article {15663, title = {Vision geometry XII:(San Jose CA, 19-20 January 2004)}, journal = {SPIE proceedings series}, year = {2004}, month = {2004///}, author = {Latecki,L.J. and Mount, Dave and Wu,A. Y} } @article {12682, title = {Visual tracking and recognition using appearance-adaptive models in particle filters}, journal = {IEEE Transactions on Image Processing}, volume = {13}, year = {2004}, month = {2004/11//}, pages = {1491 - 1506}, abstract = {We present an approach that incorporates appearance-adaptive models in a particle filter to realize robust visual tracking and recognition algorithms. Tracking needs modeling interframe motion and appearance changes, whereas recognition needs modeling appearance changes between frames and gallery images. In conventional tracking algorithms, the appearance model is either fixed or rapidly changing, and the motion model is simply a random walk with fixed noise variance. Also, the number of particles is typically fixed. All these factors make the visual tracker unstable. To stabilize the tracker, we propose the following modifications: an observation model arising from an adaptive appearance model, an adaptive velocity motion model with adaptive noise variance, and an adaptive number of particles. The adaptive-velocity model is derived using a first-order linear predictor based on the appearance difference between the incoming observation and the previous particle configuration. Occlusion analysis is implemented using robust statistics. Experimental results on tracking visual objects in long outdoor and indoor video sequences demonstrate the effectiveness and robustness of our tracking algorithm. We then perform simultaneous tracking and recognition by embedding them in a particle filter. For recognition purposes, we model the appearance changes between frames and gallery images by constructing the intra- and extrapersonal spaces. Accurate recognition is achieved when confronted by pose and view variations.}, keywords = {adaptive filters, adaptive noise variance, algorithms, appearance-adaptive model, Artificial intelligence, Cluster Analysis, Computer Graphics, Computer simulation, Feedback, Filtering, first-order linear predictor, hidden feature removal, HUMANS, Image Enhancement, Image Interpretation, Computer-Assisted, image recognition, Information Storage and Retrieval, Kinematics, Laboratories, Male, Models, Biological, Models, Statistical, MOTION, Movement, Noise robustness, Numerical Analysis, Computer-Assisted, occlusion analysis, Particle filters, Particle tracking, Pattern Recognition, Automated, Predictive models, Reproducibility of results, robust statistics, Sensitivity and Specificity, Signal Processing, Computer-Assisted, State estimation, statistical analysis, Subtraction Technique, tracking, Training data, visual recognition, visual tracking}, isbn = {1057-7149}, doi = {10.1109/TIP.2004.836152}, author = {Zhou,Shaohua Kevin and Chellapa, Rama and Moghaddam, B.} } @article {14578, title = {Whole-genome shotgun assembly and comparison of human genome assemblies}, journal = {Proceedings of the National Academy of Sciences of the United States of America}, volume = {101}, year = {2004}, month = {2004///}, pages = {1916 - 1916}, author = {Istrail,S. and Sutton,G. G and Florea,L. and Halpern,A. L and Mobarry,C. M and Lippert,R. and Walenz,B. and Shatkay,H. and Dew,I. and Miller,J. R and others} } @conference {13698, title = {Word Level Script Identification on Scanned Document Images}, booktitle = {SPIEConference on Document Recognition and Retrieval}, year = {2004}, month = {2004///}, pages = {124 - 135}, address = {San Jose, CA}, author = {Ma,Huanfeng and David Doermann} } @article {14066, title = {2003 IEEE Workshop on Applications of Signal Processing to Audio and Acoustics October 19-22, 2003, New Paltz. NY}, journal = {2003 IEEE Workshop on Applications of Signal Processing to Audio and Acoustics: October 19-22, 2003, Mohonk Mountain House, New Paltz, NY, USA}, year = {2003}, month = {2003///}, pages = {238 - 238}, author = {Adams,N. and EssI,G. and Makino,S. and Martens,A.A.C.F.W.L. and Algazi,R. and Fellers,M. and Martin,R. and Avendano,C. and Fielder,L. and Mellody,M. and others} } @article {12955, title = {A 4-Year Study of the Epidemiology of Vibrio Cholerae in Four Rural Areas of Bangladesh}, journal = {Journal of Infectious DiseasesJ Infect Dis.}, volume = {187}, year = {2003}, month = {2003/01/01/}, pages = {96 - 101}, abstract = {How Vibrio cholerae spreads around the world and what determines its seasonal peaks in endemic areas are not known. These features of cholera have been hypothesized to be primarily the result of environmental factors associated with aquatic habitats that can now be identified. Since 1997, fortnightly surveillance in 4 widely separated geographic locations in Bangladesh has been performed to identify patients with cholera and to collect environmental data. A total of 5670 patients (53\% <5 years of age) have been studied; 14.3\% had cholera (10.4\% due to V. cholerae O1 El Tor, 3.8\% due to O139). Both serogroups were found in all locations; outbreaks were seasonal and often occurred simultaneously. Water-use patterns showed that bathing and washing clothes in tube-well water was significantly protective in two of the sites. These data will be correlated with environmental factors, to develop a model for prediction of cholera outbreaks}, isbn = {0022-1899, 1537-6613}, doi = {10.1086/345865}, url = {http://jid.oxfordjournals.org/content/187/1/96}, author = {Sack,R. Bradley and Siddique,A. Kasem and Longini,Ira M. and Nizam,Azhar and Yunus,Md and M. Sirajul Islam and Morris,Jr and Ali,Afsar and Huq,Anwar and Nair,G. Balakrish and Qadri,Firdausi and Faruque,Shah M. and Sack,David A. and Rita R Colwell} } @article {13488, title = {Adaptive Hindi OCRUsing Generalized Hausdorff Image Comparison}, volume = {LAMP-TR-105,CFAR-TR-987,CS-TR-4519,UMIACS-TR-2003-87}, year = {2003}, month = {2003/08//}, institution = {University of Maryland, College Park}, abstract = {In this paper, we present an adaptive Hindi OCR using generalized Hausdor image comparison implemented as part of a rapidly retargetable language tool effort. The system includes: script identification, character segmentation, training sample creation and character recognition. The OCR design (completed in one month) was applied to a complete Hindi-English bilingual dictionary (with 1083 pages) and a collection of ideal images extracted from Hindi documents in PDF format. Experimental results show the recognition accuracy can reach 88\&$\#$x0025; for noisy images and 95\&$\#$x0025; for ideal images, both at the character level. The presented method can also be extended to design OCR systems for different scripts.}, author = {Ma,Huanfeng and David Doermann} } @conference {12723, title = {Adaptive visual tracking and recognition using particle filters}, booktitle = {Multimedia and Expo, 2003. ICME {\textquoteright}03. Proceedings. 2003 International Conference on}, volume = {2}, year = {2003}, month = {2003/07//}, pages = {II - 349-52 vol.2 - II - 349-52 vol.2}, abstract = {This paper presents an improved method for simultaneous tracking and recognition of human faces from video, where a time series model is used to resolve the uncertainties in tracking and recognition. The improvements mainly arise from three aspects: (i) modeling the inter-frame appearance changes within the video sequence using an adaptive appearance model and an adaptive-velocity motion model; (ii) modeling the appearance changes between the video frames and gallery images by constructing intra- and extra-personal spaces; and (iii) utilization of the fact that the gallery images are in frontal views. By embedding them in a particle filter, we are able to achieve a stabilized tracker and an accurate recognizer when confronted by pose and illumination variations.}, keywords = {adaptive, adaptive-velocity, appearance, extra-personal, Filtering, filters;, image, intra-personal, model;, MOTION, particle, processing;, recognition;, sequence;, sequences;, series, signal, spaces;, theory;, TIME, tracking;, video, visual}, doi = {10.1109/ICME.2003.1221625}, author = {Zhou,Shaohua and Chellapa, Rama and Moghaddam, B.} } @inbook {15423, title = {Advances in GUI Testing}, booktitle = {Advances in ComputersAdvances in Computers}, volume = {Volume 58}, year = {2003}, month = {2003///}, pages = {149 - 201}, publisher = {Elsevier}, organization = {Elsevier}, abstract = {Graphical user interfaces are by far the most popular means used to interact with software today. Unfortunately, the state-of-the-practice in GUI testing has not kept pace with the rapidly evolving GUI technology. In practice, GUI testing is largely manual, often resulting in inadequate testing. There have been several research efforts to improve GUI testing. This chapter presents some of the recent advances in GUI testing and provides guidelines on how to combine them.}, isbn = {0065-2458}, url = {http://www.sciencedirect.com/science/article/pii/S0065245803580044}, author = {Memon, Atif M.} } @article {15420, title = {Advances in GUI Testing-10 Summary}, journal = {Advances in Computers}, volume = {58}, year = {2003}, month = {2003///}, pages = {195 - 196}, author = {Memon, Atif M.} } @article {15419, title = {Advances in GUI Testing-2 GUI Testing Steps}, journal = {Advances in Computers}, volume = {58}, year = {2003}, month = {2003///}, pages = {155 - 156}, author = {Memon, Atif M.} } @article {15422, title = {Advances in GUI Testing-3 Record/Playback Tools}, journal = {Advances in Computers}, volume = {58}, year = {2003}, month = {2003///}, pages = {157 - 158}, author = {Memon, Atif M.} } @article {15418, title = {Advances in GUI Testing-4 Challenges}, journal = {Advances in Computers}, volume = {58}, year = {2003}, month = {2003///}, pages = {159 - 161}, author = {Memon, Atif M.} } @article {15416, title = {Advances in GUI Testing-5 State Machine Models}, journal = {Advances in Computers}, volume = {58}, year = {2003}, month = {2003///}, pages = {162 - 167}, author = {Memon, Atif M.} } @article {15417, title = {Advances in GUI Testing-6 Behavioral Models}, journal = {Advances in Computers}, volume = {58}, year = {2003}, month = {2003///}, pages = {168 - 169}, author = {Memon, Atif M.} } @article {15415, title = {Advances in GUI Testing-7 Statistical Methods}, journal = {Advances in Computers}, volume = {58}, year = {2003}, month = {2003///}, pages = {170 - 171}, author = {Memon, Atif M.} } @article {15414, title = {Advances in GUI Testing-8 Hierarchical Techniques}, journal = {Advances in Computers}, volume = {58}, year = {2003}, month = {2003///}, pages = {172 - 193}, author = {Memon, Atif M.} } @article {15421, title = {Advances in GUI Testing-9 Discussion}, journal = {Advances in Computers}, volume = {58}, year = {2003}, month = {2003///}, pages = {194 - 194}, author = {Memon, Atif M.} } @article {12091, title = {An Analysis of the Layer 2 Handoff costs in Wireless Local Area Networks}, journal = {ACM Computer Communications Review}, volume = {33}, year = {2003}, month = {2003///}, author = {Mishra,A. and Shin,M. H. and Arbaugh, William A.} } @article {14061, title = {Augmented intelligibility in simultaneous multi-talker environments}, journal = {Proc. International Conference on Auditory Display (ICAD{\textquoteright}03)}, year = {2003}, month = {2003///}, pages = {71 - 74}, abstract = {Speech intelligibility can be severely compromised inenvironments where there are several competing speakers. It may be possible, however, to improve speech intelligibility in such environments by manipulating certain acoustic parameters known to facilitate the segregation of competing signals. The first step in designing such a feature-rich audio display is to understand the significant elements of human auditory perception that affect information transmission capacity. We review a series of experiments to examine the impact of different audio-display design parameters on overall intelligibility of simultaneous speech messages and show how using these features may improve intelligibility. }, author = {Mesgarani,N. and Shamma,S. and Grant,K.W. and Duraiswami, Ramani} } @inbook {18896, title = {Automating DAML-S Web Services Composition Using SHOP2}, booktitle = {The Semantic Web - ISWC 2003}, series = {Lecture Notes in Computer Science}, volume = {2870}, year = {2003}, month = {2003///}, pages = {195 - 210}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {The DAML-S Process Model is designed to support the application of AI planning techniques to the automated composition of Web services. SHOP2 is an Hierarchical Task Network (HTN) planner well-suited for working with the Process Model. We have proven the correspondence between the semantics of SHOP2 and the situation calculus semantics of the Process Model. We have also implemented a system which soundly and completely plans over sets of DAML-S descriptions using a SHOP2 planner, and then executes the resulting plans over the Web. We discuss the challenges and difficulties of using SHOP2 in the information-rich and human-oriented context of Web services.}, keywords = {Computer science}, isbn = {978-3-540-20362-9}, url = {http://www.springerlink.com/content/rm5ejwlmbw0mdv97/abstract/}, author = {Wu,Dan and Parsia,Bijan and Sirin,Evren and Hendler,James and Nau, Dana S.}, editor = {Fensel,Dieter and Sycara,Katia and Mylopoulos,John} } @article {16996, title = {Bringing Treasures to the Surface: Previews and Overviews in a Prototype for the Library of Congress National Digital Library}, journal = {The craft of information visualization: readings and reflections}, year = {2003}, month = {2003///}, pages = {388 - 388}, author = {Marchionini,A.S. and Nation,D. and Karasik,S. and Cronnell,T. and Shneiderman, Ben and Spotfire,V.D.M.U. and Bederson, Benjamin B. and Data,T.S. and Hochheiser,H. and Shneiderman, Ben and others} } @article {12985, title = {Comparing bootstrap and posterior probability values in the four-taxon case}, journal = {Syst Biol}, volume = {52}, year = {2003}, month = {2003/08//}, pages = {477 - 487}, abstract = {Assessment of the reliability of a given phylogenetic hypothesis is an important step in phylogenetic analysis. Historically, the nonparametric bootstrap procedure has been the most frequently used method for assessing the support for specific phylogenetic relationships. The recent employment of Bayesian methods for phylogenetic inference problems has resulted in clade support being expressed in terms of posterior probabilities. We used simulated data and the four-taxon case to explore the relationship between nonparametric bootstrap values (as inferred by maximum likelihood) and posterior probabilities (as inferred by Bayesian analysis). The results suggest a complex association between the two measures. Three general regions of tree space can be identified: (1) the neutral zone, where differences between mean bootstrap and mean posterior probability values are not significant, (2) near the two-branch corner, and (3) deep in the two-branch corner. In the last two regions, significant differences occur between mean bootstrap and mean posterior probability values. Whether bootstrap or posterior probability values are higher depends on the data in support of alternative topologies. Examination of star topologies revealed that both bootstrap and posterior probability values differ significantly from theoretical expectations; in particular, there are more posterior probability values in the range 0.85-1 than expected by theory. Therefore, our results corroborate the findings of others that posterior probability values are excessively high. Our results also suggest that extrapolations from single topology branch-length studies are unlikely to provide any general conclusions regarding the relationship between bootstrap and posterior probability values.}, author = {Cummings, Michael P. and Handley,S. A and Myers,D. S and Reed,D. L and Rokas,A. and Winka,K.} } @article {15380, title = {Critical fields and pulse durations for precessional switching of thin magnetic films}, journal = {Magnetics, IEEE Transactions on}, volume = {39}, year = {2003}, month = {2003/09//}, pages = {2504 - 2506}, abstract = {The precessional switching process of a uniformly magnetized thin film with in-plane anisotropy subject to pulsed magnetic fields applied in the film plane is analyzed. Critical fields required to achieve switching are studied for the case when the applied field is constant during the pulse duration and forms arbitrary angles with the hard axis. By using two integrals of magnetization motion, the explicit expressions for the critical field are derived. The formulas for durations of rectangular magnetic field pulses that guarantee the precessional switching of magnetization are presented as well.}, keywords = {anisotropy;, axis;, critical, durations;, field;, fields;, film;, films;, hard, in-plane, integrals;, magnetic, magnetisation, magnetization, magnetization;, magnetized, motion;, precessional, pulse, pulsed, rectangular, reversal;, switching;, thin, uniformly}, isbn = {0018-9464}, doi = {10.1109/TMAG.2003.816454}, author = {Bertotti,G. and Mayergoyz, Issak D and Serpico,C.} } @conference {15479, title = {DART: a framework for regression testing "nightly/daily builds" of GUI applications}, booktitle = {Software Maintenance, 2003. ICSM 2003. Proceedings. International Conference on}, year = {2003}, month = {2003/09//}, pages = {410 - 419}, abstract = {"Nightly/daily building and smoke testing" have become widespread since they often reveal bugs early in the software development process. During these builds, software is compiled, linked, and (re)tested with the goal of validating its basic functionality. Although successful for conventional software, smoke tests are difficult to develop and automatically rerun for software that has a graphical user interface (GUI). In this paper, we describe a framework called DART (daily automated regression tester) that addresses the needs of frequent and automated re-testing of GUI software. The key to our success is automation: DART automates everything from structural GUI analysis; test case generation; test oracle creation; to code instrumentation; test execution; coverage evaluation; regeneration of test cases; and their re-execution. Together with the operating system{\textquoteright}s task scheduler, DART can execute frequently with little input from the developer/tester to retest the GUI software. We provide results of experiments showing the time taken and memory required for GUI analysis, test case and test oracle generation, and test execution. We also empirically compare the relative costs of employing different levels of detail in the GUI test cases.}, keywords = {automated retesting, automatic test software, coverage evaluation, daily automated regression tester, DART, frequent retesting, graphical user interface, Graphical user interfaces, GUI software, instrumentation coding, program testing, regression testing, Software development management, Software development process, Software maintenance, Software quality, structural GUI analysis, Test Case Generation, test cases regeneration, Test execution, test oracle creation}, doi = {10.1109/ICSM.2003.1235451}, author = {Memon, Atif M. and Banerjee,I. and Hashmi,N. and Nagarajan,A.} } @book {19346, title = {Data Structures and Algorithms in C++}, year = {2003}, month = {2003}, pages = {714}, publisher = {John Wiley \& Sons}, organization = {John Wiley \& Sons}, abstract = {* Provides a comprehensive introduction to data structures and algorithms, including their design, analysis, and implementation * Each data structure is presented using ADTs and their respective implementations * Helps provide an understanding of the wide spectrum of skills ranging from sound algorithm and data structure design to efficient implementation and coding of these designs in C++}, keywords = {Computers / Databases / General, Computers / Programming / Algorithms, Computers / Programming / General, Computers / Programming Languages / C, Fiction / General}, isbn = {9780471202080}, author = {Goodrich, Michael T. and Tamassia, Roberto and Mount, Dave} } @inbook {13283, title = {Data structures for 3D Multi-Tessellations: an overview}, booktitle = {Data Visualization: The State of the ArtData Visualization: The State of the Art}, series = {KLUWER INTERNATIONAL SERIES IN ENGINEERING AND COMPUTER SCIENCE}, year = {2003}, month = {2003///}, pages = {239 - 256}, publisher = {Springer}, organization = {Springer}, isbn = {9781402072598}, author = {Danovaro,E. and De Floriani, Leila and Magillo,P. and Puppo,E.} } @article {13285, title = {Decomposing non-manifold objects in arbitrary dimensions}, journal = {Graphical Models}, volume = {65}, year = {2003}, month = {2003/05//}, pages = {2 - 22}, abstract = {We address the problem of building valid representations of non-manifold d-dimensional objects through an approach based on decomposing a non-manifold d-dimensional object into an assembly of more regular components. We first define a standard decomposition of d-dimensional non-manifold objects described by abstract simplicial complexes. This decomposition splits a non-manifold object into components that belong to a well-understood class of objects, that we call initial quasi-manifold. Initial quasi-manifolds cannot be decomposed without cutting them along manifold faces. They form a decidable superset of d-manifolds for d⩾3, and coincide with manifolds for d⩽2. We then present an algorithm that computes the standard decomposition of a general non-manifold complex. This decomposition is unique, and removes all singularities which can be removed without cutting the complex along its manifold faces.}, isbn = {1524-0703}, doi = {10.1016/S1524-0703(03)00006-7}, url = {http://www.sciencedirect.com/science/article/pii/S1524070303000067}, author = {De Floriani, Leila and Mesmoudi,Mostefa M. and Morando,Franco and Puppo,Enrico} } @article {16902, title = {Digital government}, journal = {Communications of the ACM}, volume = {46}, year = {2003}, month = {2003///}, pages = {25 - 27}, abstract = {Information technologies are being applied vigorously by governmental units at national,regional, and local levels around the world. The application of IT to government service is often termed {\textquotedblleft}e-government{\textquotedblright} and the larger concept of government that depends upon IT to achieve basic missions is termed {\textquotedblleft}digital government.{\textquotedblright} This distinction is, of course, lexically arbitrary, but serves to distinguish R\&D specifically aimed at creating techniques for applying IT to government operations. Such R\&D efforts also consider the long-term impact of these applications on citizens and government itself. }, author = {Marchionini,G. and Samet, Hanan and Brandt,L.} } @article {17844, title = {Driving scientific applications by data in distributed environments}, journal = {Computational Science{\textemdash}ICCS 2003}, year = {2003}, month = {2003///}, pages = {713 - 713}, author = {Saltz, J. and Catalyurek,U. and Kurc, T. and Gray,M. and Hastings,S. and Langella,S. and Narayanan,S. and Martino,R. and Bryant,S. and Peszynska,M. and others} } @conference {15684, title = {Dynamic load balancing across mirrored multimedia servers}, booktitle = {2003 International Conference on Multimedia and Expo, 2003. ICME {\textquoteright}03. Proceedings}, volume = {2}, year = {2003}, month = {2003/07/06/9}, pages = {II- 53-6 vol.2 - II- 53-6 vol.2}, publisher = {IEEE}, organization = {IEEE}, abstract = {The purpose of this paper is to present protocols for efficient load balancing across replicated multimedia servers in a metropolitan area network. Current multimedia infrastructures, even when they use mirrored servers, do not have standardized load balancing schemes. Existing schemes frequently require participation from the clients in balancing the load across the servers efficiently. We propose two protocols in this paper for fair load balancing without any client-side processing being required. Neither protocol requires any change to the network-level infrastructure. Using network packet loss and packet transmission delay as the chief metrics, we show the effectiveness of the protocols through extensive simulations.}, keywords = {client-server systems, Delay, Internet, load balancing protocols, Load management, media streaming, metropolitan area network, metropolitan area networks, mirrored multimedia servers, Multimedia communication, multimedia servers, network packet loss, Network servers, packet transmission delay, Propagation losses, Protocols, Streaming media, Topology, Traffic control, Web server}, isbn = {0-7803-7965-9}, doi = {10.1109/ICME.2003.1221551}, author = {Matthur,A. and Mundur, Padma} } @conference {17113, title = {Dynamic querying for pattern identification in microarray and genomic data}, booktitle = {2003 International Conference on Multimedia and Expo, 2003. ICME {\textquoteright}03. Proceedings}, volume = {3}, year = {2003}, month = {2003/07/06/9}, pages = {III- 453-6 vol.3 - III- 453-6 vol.3}, publisher = {IEEE}, organization = {IEEE}, abstract = {Data sets involving linear ordered sequences are a recurring theme in bioinformatics. Dynamic query tools that support exploration of these data sets can be useful for identifying patterns of interest. This paper describes the use of one such tool - timesearcher - to interactively explore linear sequence data sets taken from two bioinformatics problems. Microarray time course data sets involve expression levels for large numbers of genes over multiple time points. Timesearcher can be used to interactively search these data sets for genes with expression profiles of interest. The occurrence frequencies of short sequences of DNA in aligned exons can be used to identify sequences that play a role in the pre-mRNA splicing. Timesearcher can be used to search these data sets for candidate splicing signals.}, keywords = {Bioinformatics, data sets, Displays, dynamic querying, expression profiles, Frequency, Gene expression, genes, Genetics, genomic data, Genomics, linear ordered sequences, macromolecules, medical signal processing, Mice, Microarray, pattern identification, pattern recognition, premRNA splicing, Query processing, sequences, Signal processing, splicing, TimeSearcher}, isbn = {0-7803-7965-9}, doi = {10.1109/ICME.2003.1221346}, author = {Hochheiser,H. and Baehrecke,E. H and Mount, Stephen M. and Shneiderman, Ben} } @conference {11911, title = {Energy-efficient broadcast and multicast trees for reliable wireless communication}, booktitle = {Wireless Communications and Networking, 2003. WCNC 2003. 2003 IEEE}, volume = {1}, year = {2003}, month = {2003/03//}, pages = {660 -667 vol.1 - 660 -667 vol.1}, abstract = {We define energy-efficient broadband and multicast schemes for reliable communication in multi-hop wireless networks. Unlike previous techniques, the choice of neighbors in the broadband and multicast trees in these schemes, are based not only on the link distance, but also on the error rates associated with the link. Our schemes can be implemented using both positive and negative acknowledgement based reliable broadcast techniques in the link layer. Through simulations, we show that our scheme achieves up to 45\% improvement over previous schemes on realistic 100-node network topologies. A positive acknowledgment based implementation is preferred. Our simulations show that the additional benefits of a positive acknowledgement based implementation is marginal (1-2\%). Therefore a negative acknowledgement based implementation of our schemes is equally applicable in constructing energy-efficient reliable and multicast data delivery paths.}, keywords = {broadcast, channels;multicast, communication;broadcast, communication;network, data, delivery, energy-efficient, layer;multicast, network, networks;network, networks;telecommunication, paths;multicast, rates;link, reliability;, topologies;wireless, topology;radio, trees;error, trees;multihop, wireless}, doi = {10.1109/WCNC.2003.1200429}, author = {Banerjee,S. and Misra,A. and Yeo,Jihwang and Agrawala, Ashok K.} } @conference {15328, title = {Exploratory studies of turbulence/chemistry interaction in hypersonic flows}, booktitle = {36 th AIAA Thermophysics Conference}, year = {2003}, month = {2003///}, author = {Martin, M.P} } @article {15594, title = {A Fast Implementation of the ISOCLUS Algorithm}, journal = {IEEE 2003 International Geoscience and Remote Sensing Symposium}, year = {2003}, month = {2003///}, abstract = {Unsupervised clustering is a fundamental building block in numerous image processing applications. One of the most popular and widely used clustering schemes for remote sensing applications is the ISOCLUS algorithm, which is based on the ISODATA method. The algorithm is given a set of n data points in d-dimensional space, an integer k indicating the initial number of clusters, and a number of additional parameters. The general goal is to compute the coordinates of a set of cluster centers in d-space, such that those centers minimize the mean squared distance from each data point to its nearest center. This clustering algorithm is similar to another well-known clustering method, called k-means. One significant feature of ISOCLUS over k-means is that the actual number of clusters reported might be fewer or more than the number supplied as part of the input. The algorithm uses different heuristics to determine whether to merge lor split clusters. As ISOCLUS can run very slowly, particularly on large data sets, there has been a growing .interest in the remote sensing community in computing it efficiently. We have developed a faster implementation of the ISOCLUS algorithm. Our improvement is based on a recent acceleration to the k-means algorithm of Kanungo, et al. They showed that, by using a kd-tree data structure for storing the data, it is possible to reduce the running time of k-means. We have adapted this method for the ISOCLUS algorithm, and we show that it is possible to achieve essentially the same results as ISOCLUS on large data sets, but with significantly lower running times. This adaptation involves computing a number of cluster statistics that are needed for ISOCLUS but not for k-means. Both the k-means and ISOCLUS algorithms are based on iterative schemes, in which nearest neighbors are calculated until some convergence criterion is satisfied. Each iteration requires that the nearest center for each data point be computed. Naively, this requires O(kn) time, where k denotes the current number of centers. Traditional techniques for accelerating nearest neighbor searching involve storing the k centers in a data structure. However, because of the iterative nature of the algorithm, this data structure would need to be rebuilt with each new iteration. Our approach is to store the data points in a kd-tree data structure. The assignment of points to nearest neighbors is carried out by a filtering process, which successively eliminates centers that can not possibly be the nearest neighbor for a given region of space. This algorithm is significantly faster, because large groups of data points can be assigned to their nearest center in a single operation. Preliminary results on a number of real Landsat datasets show that our revised ISOCLUS-like scheme runs about twice as fast.}, keywords = {algorithms, Cluster Analysis, Data structures, HEURISTIC METHODS, IMAGE PROCESSING, INTEGERS, LANDSAT SATELLITES, MEAN SQUARE VALUES, Remote sensing}, url = {http://ntrs.nasa.gov/search.jsp?R=20030053175}, author = {Memarsadeghi,Nargess and Mount, Dave and Netanyahu,Nathan S. and LeMoigne,Jacqueline} } @conference {13558, title = {Gabor Filter Based Multi-class Classifier for Scanned Document Images}, booktitle = {7th International Conference on Document Analysis and Recognition (ICDAR)}, year = {2003}, month = {2003///}, pages = {968 - 972}, abstract = {When scanning documents with a large number of pagessuch as books, it is often feasible to provide a minimal number of training samples to personalize the system to compensate for global shifts in how the document was created or in scanning parameters. In this paper, we present a supervised multi-class classifier based on Gabor filters that is used to classify the scripts, font-faces, and font-styles (bold, italic, normal etc.) in an application where the classes are known. Classification is performed at the word level (glyphs separated by white space) given training samples of each class. This method was applied to a variety of bilingual dictionaries to identify different scripts, and simultaneously, to classify Roman scripts into bold, italic and normal font-styles. Experimental results show the effectiveness of this approach in increasing performance over classifiers trained for general documents. }, author = {Ma,H. and David Doermann} } @article {16290, title = {The genome sequence of Bacillus anthracis Ames and comparison to closely related bacteria}, journal = {Nature}, volume = {423}, year = {2003}, month = {2003/05/01/}, pages = {81 - 86}, abstract = {Bacillus anthracis is an endospore-forming bacterium that causes inhalational anthrax1. Key virulence genes are found on plasmids (extra-chromosomal, circular, double-stranded DNA molecules) pXO1 (ref. 2) and pXO2 (ref. 3). To identify additional genes that might contribute to virulence, we analysed the complete sequence of the chromosome of B. anthracis Ames (about 5.23 megabases). We found several chromosomally encoded proteins that may contribute to pathogenicity{\textemdash}including haemolysins, phospholipases and iron acquisition functions{\textemdash}and identified numerous surface proteins that might be important targets for vaccines and drugs. Almost all these putative chromosomal virulence and surface proteins have homologues in Bacillus cereus, highlighting the similarity of B. anthracis to near-neighbours that are not associated with anthrax4. By performing a comparative genome hybridization of 19 B. cereus and Bacillus thuringiensis strains against a B. anthracis DNA microarray, we confirmed the general similarity of chromosomal genes among this group of close relatives. However, we found that the gene sequences of pXO1 and pXO2 were more variable between strains, suggesting plasmid mobility in the group. The complete sequence of B. anthracis is a step towards a better understanding of anthrax pathogenesis.}, isbn = {0028-0836}, doi = {10.1038/nature01586}, url = {http://www.nature.com/nature/journal/v423/n6935/full/nature01586.html}, author = {Read,Timothy D. and Peterson,Scott N. and Tourasse,Nicolas and Baillie,Les W. and Paulsen,Ian T. and Nelson,Karen E. and Tettelin,Herv|[eacute]| and Fouts,Derrick E. and Eisen,Jonathan A. and Gill,Steven R. and Holtzapple,Erik K. and |[Oslash]|kstad,Ole Andreas and Helgason,Erlendur and Rilstone,Jennifer and Wu,Martin and Kolonay,James F. and Beanan,Maureen J. and Dodson,Robert J. and Brinkac,Lauren M. and Gwinn,Michelle and DeBoy,Robert T. and Madpu,Ramana and Daugherty,Sean C. and Durkin,A. Scott and Haft,Daniel H. and Nelson,William C. and Peterson,Jeremy D. and Pop, Mihai and Khouri,Hoda M. and Radune,Diana and Benton,Jonathan L. and Mahamoud,Yasmin and Jiang,Lingxia and Hance,Ioana R. and Weidman,Janice F. and Berry,Kristi J. and Plaut,Roger D. and Wolf,Alex M. and Watkins,Kisha L. and Nierman,William C. and Hazen,Alyson and Cline,Robin and Redmond,Caroline and Thwaite,Joanne E. and White,Owen and Salzberg,Steven L. and Thomason,Brendan and Friedlander,Arthur M. and Koehler,Theresa M. and Hanna,Philip C. and Kolst|[oslash]|,Anne-Brit and Fraser,Claire M.} } @article {15387, title = {Geometrical analysis of precessional switching and relaxation in uniformly magnetized bodies}, journal = {Magnetics, IEEE Transactions on}, volume = {39}, year = {2003}, month = {2003/09//}, pages = {2501 - 2503}, abstract = {Precessional switching and relaxation in a single-domain particle or film is studied by using the Landau-Lifshitz-Gilbert equation. The analysis of the switching process is based on the explicit knowledge of two integrals of motion for the magnetization dynamics in the conservative case. The knowledge of these integrals of motions enables one to carry out the geometrical analysis of the system and give the complete phase portrait. The relaxation process which occurs after the magnetization is reversed is analyzed by using geometrical methods and it is showed that the dynamical system exhibits entanglement of separatrices and riddled basins of attraction.}, keywords = {analysis;, attraction;, basins, bodies;, dynamical, dynamics;, entanglement;, equation;, film;, films;, geometrical, integrals, Landau-Lifshitz-Gilbert, magnetic, magnetisation, magnetization, magnetized, motion;, of, particle;, particles;, phase, portrait;, precessional, relaxation;, reversal;, riddled, separatrices;, single-domain, spin, switching;, system;, thin, uniformly}, isbn = {0018-9464}, doi = {10.1109/TMAG.2003.816453}, author = {Bertotti,G. and Mayergoyz, Issak D and Serpico,C. and d{\textquoteright}Aquino,M.} } @article {15448, title = {GUI ripping: Reverse engineering of graphical user interfaces for testing}, journal = {Proceedings of the 10th working conference on reverse engineering (WCRE{\textquoteright}03)}, volume = {1095}, year = {2003}, month = {2003///}, pages = {17 - 00}, abstract = {Graphical user interfaces (GUIs) are important parts oftoday{\textquoteright}s software and their correct execution is required to ensure the correctness of the overall software. A popular technique to detect defects in GUIs is to test them by exe- cuting test cases and checking the execution results. Test cases may either be created manually or generated auto- matically from a model of the GUI. While manual testing is unacceptably slow for many applications, our experience with GUI testing has shown that creating a model that can be used for automated test case generation is difficult. We describe a new approach to reverse engineer a model represented as structures called a GUI forest, event-flow graphs and an integration tree directly from the executable GUI. We describe {\textquotedblleft}GUI Ripping{\textquotedblright}, a dynamic process in which the software{\textquoteright}s GUI is automatically {\textquotedblleft}traversed{\textquotedblright} by opening all its windows and extracting all their widgets (GUI objects), properties, and values. The extracted infor- mation is then verified by the test designer and used to auto- matically generate test cases. We present algorithms for the ripping process and describe their implementation in a tool suite that operates on Java and Microsoft Windows{\textquoteright} GUIs. We present results of case studies which show that our approach requires very little human intervention and is es- pecially useful for regression testing of software that is mod- ified frequently. We have successfully used the {\textquotedblleft}GUI Rip- per{\textquotedblright} in several large experiments and have made it avail- able as a downloadable tool. }, author = {Memon, Atif M. and Banerjee,I. and Nagarajan,A.} } @article {17185, title = {HCIL Technical Report Listing (1993-2002)}, journal = {The craft of information visualization: readings and reflections}, volume = {27}, year = {2003}, month = {2003///}, pages = {393 - 393}, author = {Ceaparu,I. and Druin, Allison and Guimbretiere,F. and Manipulation,D. and Shneiderman, Ben and Westerlurid,B. and Keogh,E. and Hochheiser,H. and Shrieidemian,B. and Shneidemiari,B. and others} } @conference {13243, title = {Human body pose estimation using silhouette shape analysis}, booktitle = {Proceedings. IEEE Conference on Advanced Video and Signal Based Surveillance, 2003.}, year = {2003}, month = {2003/07//}, pages = {263 - 270}, abstract = {We describe a system for human body pose estimation from multiple views that is fast and completely automatic. The algorithm works in the presence of multiple people by decoupling the problems of pose estimation of different people. The pose is estimated based on a likelihood function that integrates information from multiple views and thus obtains a globally optimal solution. Other characteristics that make our method more general than previous work include: (1) no manual initialization; (2) no specification of the dimensions of the 3D structure; (3) no reliance on some learned poses or patterns of activity; (4) insensitivity to edges and clutter in the background and within the foreground. The algorithm has applications in surveillance and promising results have been obtained.}, keywords = {3D, analysis;, body, classification;, clutter;, detection;, estimation;, extraction;, feature, function;, human, image, likelihood, multiple, object, parameter, parameters;, Pixel, pose, probability;, segmentation;, segmentations;, SHAPE, silhouette, structure;, surveillance;, views;}, doi = {10.1109/AVSS.2003.1217930}, author = {Mittal,A. and Liang Zhao and Davis, Larry S.} } @article {18223, title = {Human visual model for data hiding}, volume = {:~09/691,544}, year = {2003}, month = {2003/08/26/}, abstract = {A method and apparatus of hiding identification data in visual media. When image or video data is received, frequency masking is performed to divide the image or video data into blocks of smooth regions and blocks of non-smooth regions and to obtain preliminary just-noticeable-difference. Edge detection is performed to divide the non-smooth region of the image or video data into texture blocks and edge blocks. Then blocks of regions that are substantially proximate to blocks of smooth regions of the image or video data are determined. The image or video data is then adjusted by applying different strength of watermark in association with the type of each block.}, url = {http://www.google.com/patents?id=aNgOAAAAEBAJ}, author = {M. Wu and Yu,Hong Heather}, editor = {Matsushita Electric Industrial Co., Ltd.} } @article {18907, title = {IMPACTing SHOP: Putting an AI Planner Into a Multi-Agent Environment}, journal = {Annals of Mathematics and Artificial Intelligence}, volume = {37}, year = {2003}, month = {2003///}, pages = {381 - 407}, abstract = {In this paper we describe a formalism for integrating the SHOP HTN planning system with the IMPACT multi-agent environment. We define the A-SHOP algorithm, an agentized adaptation of the SHOP planning algorithm that takes advantage of IMPACT{\textquoteright}s capabilities for interacting with external agents, performing mixed symbolic/numeric computations, and making queries to distributed, heterogeneous information sources (such as arbitrary legacy and/or specialized data structures or external databases). We show that A-SHOP is both sound and complete if certain conditions are met.}, keywords = {Computer science}, isbn = {1012-2443}, doi = {10.1023/A:1021560510377}, url = {http://www.springerlink.com/content/g4r0mn835846p65w/abstract/}, author = {Dix,J{\"u}rgen and Mu{\~n}oz-Avila,H{\'e}ctor and Nau, Dana S. and Zhang,Lingling} } @article {18980, title = {Improving the Arabidopsis genome annotation using maximal transcript alignment assemblies}, journal = {Nucleic Acids ResearchNucl. Acids Res.}, volume = {31}, year = {2003}, month = {2003/10/01/}, pages = {5654 - 5666}, abstract = {The spliced alignment of expressed sequence data to genomic sequence has proven a key tool in the comprehensive annotation of genes in eukaryotic genomes. A novel algorithm was developed to assemble clusters of overlapping transcript alignments (ESTs and full-length cDNAs) into maximal alignment assemblies, thereby comprehensively incorporating all available transcript data and capturing subtle splicing variations. Complete and partial gene structures identified by this method were used to improve The Institute for Genomic Research Arabidopsis genome annotation (TIGR release v.4.0). The alignment assemblies permitted the automated modeling of several novel genes and >1000 alternative splicing variations as well as updates (including UTR annotations) to nearly half of the \~{}27 000 annotated protein coding genes. The algorithm of the Program to Assemble Spliced Alignments (PASA) tool is described, as well as the results of automated updates to Arabidopsis gene annotations.}, isbn = {0305-1048, 1362-4962}, doi = {10.1093/nar/gkg770}, url = {http://nar.oxfordjournals.org/content/31/19/5654}, author = {Haas,Brian J. and Delcher,Arthur L. and Mount, Stephen M. and Wortman,Jennifer R. and Jr,Roger K. Smith and Hannick,Linda I. and Maiti,Rama and Ronning,Catherine M. and Rusch,Douglas B and Town,Christopher D. and Salzberg,Steven L. and White,Owen} } @article {15510, title = {In Memoriam: Raymond Reiter}, journal = {AI Magazine}, volume = {24}, year = {2003}, month = {2003///}, pages = {13 - 13}, author = {Minker, Jack} } @inbook {17237, title = {Innovating the Interaction}, booktitle = {The craft of information visualization: readings and reflectionsThe craft of information visualization: readings and reflections}, year = {2003}, month = {2003///}, pages = {295 - 295}, publisher = {Morgan Kaufmann}, organization = {Morgan Kaufmann}, address = {San Francisco}, isbn = {978-1-55860-915-0}, author = {Bederson, Benjamin B. and Plaisant, Catherine and Mushlin,R. and Snyder,A. and Li,J. and Heller,D. and Shneiderman, Ben and Hochheiser,H. and Fekete,J. D and Czenvinski,M.} } @article {13299, title = {Interactive Visualization of Large Tetrahedral Meshes through Selective Refinement}, journal = {IEEE Transactions on Visualization and Computer Graphics}, year = {2003}, month = {2003///}, abstract = {In this paper, we address the problem of the efficient visualization of very largeirregular volume datasets. To this aim, we exploit a multiresolution representation based on a domain decomposition into tetrahedral cells. A new compact data struc- ture is described which encodes the whole dataset at a virtually continuous range of different resolutions, with a storage cost six times lower than a standard data struc- ture for tetrahedral meshes. Such structure supports on-line selective refinement to focus resolution on areas that the user considers more critical, based on either field values, or domain location, or opacity of the transfer function. Selective refinement is used to trade-off between resolution and speed in visualization, according to user needs and hardware constraints. These features have been implemented in a new system, called TAn2 (Tetrahedra Analyzer), for the interactive visualization of three- dimensional scalar fields defined on very large tetrahedral meshes. Multiresolution representation and selective refinement make the system fully scalable with respect to the size of the dataset and to hardware requirements. }, author = {Cignoni,P. and De Floriani, Leila and Magillo,P. and Puppo,E. and Scopigno,R. and di Genova,U.} } @conference {15632, title = {Interpolation over light fields with applications in computer graphics}, booktitle = {Proceedings of the Fifth Workshop on Algorithm Engineering and Experiments}, year = {2003}, month = {2003///}, pages = {56 - 68}, author = {Atalay,F. B and Mount, Dave} } @article {15183, title = {Intrusion-resilient public-key encryption}, journal = {Topics in Cryptology{\textemdash}CT-RSA 2003}, year = {2003}, month = {2003///}, pages = {19 - 32}, abstract = {Exposure of secret keys seems to be inevitable, and may in practice represent the most likely point of failure in a cryptographic system. Recently, the notion of intrusion-resilience [17] (which extends both the notions of forward security [3], [5] and key insulation [11]) was proposed as a means of mitigating the harmful effects that key exposure can have. In this model, time is divided into distinct periods; the public key remains fixed throughout the lifetime of the protocol but the secret key is periodically updated. Secret information is stored by both a user and a base; the user performs all cryptographic operations during a given time period, while the base helps the user periodically update his key. Intrusion-resilient schemes remain secure in the face of multiple compromises of both the user and the base, as long as they are not both compromised simultaneously. Furthermore, in case the user and base are compromised simultaneously, prior time periods remain secure (as in forward-secure schemes). Intrusion-resilient signature schemes have been previously constructed [17], [15]. Here, we give the first construction of an intrusion-resilient publickey encryption scheme, based on the recently-constructed forwardsecure encryption scheme of [8]. We also consider generic transformations for securing intrusion-resilient encryption schemes against chosenciphertext attacks.}, doi = {10.1007/3-540-36563-X_2}, author = {Dodis,Y. and Franklin,M. and Katz, Jonathan and Miyaji,A. and Yung,M.} } @inbook {16129, title = {LifeLines: Using Visualization to Enhance Navigation and Analysis of Patient Records}, booktitle = {The Craft of Information VisualizationThe Craft of Information Visualization}, year = {2003}, month = {2003///}, pages = {308 - 312}, publisher = {Morgan Kaufmann}, organization = {Morgan Kaufmann}, address = {San Francisco}, isbn = {978-1-55860-915-0}, url = {http://www.sciencedirect.com/science/article/pii/B978155860915050038X}, author = {Plaisant, Catherine and Mushlin,Richard and Snyder,Aaron and Li,Jia and Heller,Dan and Shneiderman, Ben}, editor = {Bederson, Benjamin B. and Shneiderman, Ben} } @article {13252, title = {M 2 Tracker: a multi-view approach to segmenting and tracking people in a cluttered scene}, journal = {International Journal of Computer Vision}, volume = {51}, year = {2003}, month = {2003///}, pages = {189 - 203}, abstract = {When occlusion is minimal, a single camera is generally sufficient to detect and track objects. However, when the density of objects is high, the resulting occlusion and lack of visibility suggests the use of multiple cameras and collaboration between them so that an object is detected using information available from all the cameras in the scene.In this paper, we present a system that is capable of segmenting, detecting and tracking multiple people in a cluttered scene using multiple synchronized surveillance cameras located far from each other. The system is fully automatic, and takes decisions about object detection and tracking using evidence collected from many pairs of cameras. Innovations that help us tackle the problem include a region-based stereo algorithm capable of finding 3D points inside an object knowing only the projections of the object (as a whole) in two views, a segmentation algorithm using bayesian classification and the use of occlusion analysis to combine evidence from different camera pairs. The system has been tested using different densities of people in the scene. This helps us determine the number of cameras required for a particular density of people. Experiments have also been conducted to verify and quantify the efficacy of the occlusion analysis scheme. }, author = {Mittal,A. and Davis, Larry S.} } @book {15389, title = {Mathematical Models of Hysteresis and Their Applications: Second Edition}, year = {2003}, month = {2003/08/15/}, publisher = {Academic Press}, organization = {Academic Press}, abstract = {This new edition has been significantly revised and updated to reflect advances in the field since the publication of the first edition, such as the systematic experimental testing of Preisach models of hysteresis. The author has, however, retained the two most salient features of the original, the emphasis on the universal nature of mathematical models of hysteresis and their applicability to the description of hysteresis phenomena in various areas of science, technology and economics and its accessibility to a broad audience of researchers, engineers, and students. Provides a unique emphasis on the development of universal mathematical models of hysteresis Accessibility to a broad audience, using simple and complex mathematical tools, application to various areas of science. Presents new theoretical and experimental results}, keywords = {Business \& Economics / Industrial Management, Hysteresis, Mathematics / Applied, Mathematics / General, Science / Physics / Magnetism, Science / Physics / Mathematical \& Computational, Technology \& Engineering / Electrical, Technology \& Engineering / Electronics / General, Technology \& Engineering / Electronics / Microelectronics, Technology \& Engineering / Signals \& Signal Processing}, isbn = {9780080535890}, author = {Mayergoyz, Issak D} } @article {15360, title = {Mathematical models of hysterisis and their applications (2003)}, journal = {Recherche}, volume = {67}, year = {2003}, month = {2003///}, pages = {02 - 02}, abstract = {This new edition has been significantly revised and updated to reflect advances in the field since the publication of the first edition, such as the systematic experimental testing of Preisach models of hysteresis. The author has, however, retained the two most salient features of the original, the emphasis on the universal nature of mathematical models of hysteresis and their applicability to the description of hysteresis phenomena in various areas of science, technology and economics and its accessibility to a broad audience of researchers, engineers, and students}, author = {Mayergoyz, Issak D} } @article {17706, title = {Matrix Algorithms, Volume II: Eigensystems}, journal = {Applied Mechanics Reviews}, volume = {56}, year = {2003}, month = {2003///}, pages = {B2-B2 - B2-B2}, keywords = {algorithm theory, Eigenvalues and eigenfunctions, linear algebra, matrix algebra, reviews}, doi = {10.1115/1.1523352}, url = {http://link.aip.org/link/?AMR/56/B2/1}, author = {Stewart, G.W. and Author and Mahajan,A. and Reviewer} } @conference {13306, title = {Morphology-driven simplification and multiresolution modeling of terrains}, booktitle = {Proceedings of the 11th ACM international symposium on Advances in geographic information systems}, series = {GIS {\textquoteright}03}, year = {2003}, month = {2003///}, pages = {63 - 70}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {We propose a technique for simplification and multiresolution modeling of a terrain represented as a TIN. Our goal is to maintain the morphological structure of the terrain in the resulting multiresolution model. To this aim, we extend Morse theory, developed for continuous and differentiable functions, to the case of piecewise linear functions. We decompose a TIN into areas with uniform morphological properties (such as valleys, basins, etc.) separated by a network of critical lines and points. We describe an algorithm to compute the above decomposition and the critical net, and a TIN simplification algorithm that preserves them. On this basis, we build a multiresolution terrain model, which provides a representation of critical features at any level of detail.}, keywords = {morphological structure, Multi-resolution, terrain models}, isbn = {1-58113-730-3}, doi = {10.1145/956676.956685}, url = {http://doi.acm.org/10.1145/956676.956685}, author = {Danovaro,Emanuele and De Floriani, Leila and Magillo,Paola and Mesmoudi,Mohammed Mostefa and Puppo,Enrico} } @article {13007, title = {Necessity is the mother of invention: a simple grid computing system using commodity tools}, journal = {J Parallel Distr Com}, volume = {63}, year = {2003}, month = {2003/05//}, pages = {578 - 589}, abstract = {Access to sufficient resources is a barrier to scientific progress for many researchers facing large computational problems. Gaining access to large-scale resources (i.e., university-wide or federally supported computer centers) can be difficult, given their limited availability, particular architectures, and request/review/approval cycles. Simultaneously, researchers often find themselves with access to workstations and older clusters overlooked by their owners in favor of newer hardware. Software to tie these resources into a coherent Grid, however, has been problematic. Here, we describe our experiences building a Grid computing system to conduct a large-scale simulation study using "borrowed" computing resources distributed over a wide area. Using standard software components, we have produced a Grid computing system capable of coupling several hundred processors spanning multiple continents and administrative domains. We believe that this system fills an important niche between a closely coupled local system and a heavyweight, highly customized wide area system. (C) 2003 Elsevier Science (USA). All rights reserved.}, keywords = {Apache;, computing;, distributed, Grid, HTTP;, Java;, Linux;, Perl;, SQL;, Unix;, XML-RPC}, doi = {DOI 10.1016/S0743-7315(03)00004-2}, author = {Myers,D. S and Cummings, Michael P.} } @conference {19501, title = {On-chip stochastic communication [SoC applications]}, booktitle = {Design, Automation and Test in Europe Conference and Exhibition, 2003}, year = {2003}, month = {2003///}, pages = {790 - 795}, abstract = {As CMOS technology scales down into the deep-submicron (DSM) domain, the costs of design and verification for systems-on-chip (SoCs) are rapidly increasing due to the inefficiency of traditional CAD tools. Relaxing the requirement of 100\% correctness for devices and interconnects drastically reduces the costs of design but, at the same time, requires that SoCs be designed with some system-level fault-tolerance. In this paper, we introduce a new communication paradigm for SoCs, namely stochastic communication. The newly proposed scheme not only separates communication from computation, but also provides the required built-in fault-tolerance to DSM failures, is scalable and cheap to implement. For a generic tile-based architecture, we show how a ubiquitous multimedia application (an MP3 encoder) can be implemented using stochastic communication in an efficient and robust manner. More precisely, up to 70\% data upsets, 80\% packet drops because of buffer overflow, and severe levels of synchronization failures can be tolerated while maintaining a low latency.}, keywords = {buffer overflow, CMOS technology, CMOS technology scaling, Costs, data upsets, Design automation, Digital audio players, Fault tolerance, Fault tolerant systems, generic tile-based architecture, integrated circuit design, integrated circuit interconnections, interconnect correctness requirements, Logic Design, logic simulation, MP3 encoder, Multiprocessor interconnection networks, on-chip fault-tolerance, on-chip stochastic communication, packet drops, Pervasive computing, Robustness, SoC design, SoC verification, Stochastic processes, Synchronisation, synchronization failures, system latency, system-level fault-tolerance, system-on-chip, systems-on-chip, video coding}, author = {Tudor Dumitras and Marculescu, R.} } @article {13622, title = {Parsing and Tagging of Bilingual Dictionaries}, journal = {TALTraitement Automatique Des Langues}, volume = {44}, year = {2003}, month = {2003///}, pages = {125 - 150}, abstract = {Bilingual dictionaries hold great potential as a source of lexical resources for training and testing automated systems for optical character recognition, machine translation, and cross-language information retrieval. In this paper, we describe a system for extracting term lexicons from printed bilingual dictionaries. Our work was divided into three phases - dictionary segmentation, entry tagging, and generation. In segmentation, pages are divided into logical entries based on structural features learned from selected examples. The extracted entries are associated with functional labels and passed to a tagging module which associates linguistic labels with each word or phrase in the entry. The output of the system is a structure that represents the entries from the dictionary. We have used this approach to parse a variety of dictionaries with both Latin and non-Latin alphabets, and demonstrate the results of term lexicon generation for retrieval from a collection of French news stories using English queries.}, author = {Ma,Huanfeng and Karagol-Ayan,Burcu and David Doermann and Oard, Douglas and Wang,Jianqiang} } @article {12954, title = {Pathogenic Potential of Environmental Vibrio Cholerae Strains Carrying Genetic Variants of the Toxin-Coregulated Pilus Pathogenicity Island}, journal = {Infection and ImmunityInfect. Immun.}, volume = {71}, year = {2003}, month = {2003/02/01/}, pages = {1020 - 1025}, abstract = {The major virulence factors of toxigenic Vibrio cholerae are cholera toxin (CT), which is encoded by a lysogenic bacteriophage (CTXΦ), and toxin-coregulated pilus (TCP), an essential colonization factor which is also the receptor for CTXΦ. The genes for the biosynthesis of TCP are part of a larger genetic element known as the TCP pathogenicity island. To assess their pathogenic potential, we analyzed environmental strains of V. cholerae carrying genetic variants of the TCP pathogenicity island for colonization of infant mice, susceptibility to CTXΦ, and diarrheagenicity in adult rabbits. Analysis of 14 environmental strains, including 3 strains carrying a new allele of the tcpA gene, 9 strains carrying a new allele of the toxT gene, and 2 strains carrying conventional tcpA and toxT genes, showed that all strains colonized infant mice with various efficiencies in competition with a control El Tor biotype strain of V. cholerae O1. Five of the 14 strains were susceptible to CTXΦ, and these transductants produced CT and caused diarrhea in adult rabbits. These results suggested that the new alleles of the tcpA and toxT genes found in environmental strains of V. cholerae encode biologically active gene products. Detection of functional homologs of the TCP island genes in environmental strains may have implications for understanding the origin and evolution of virulence genes of V. cholerae.}, isbn = {0019-9567, 1098-5522}, doi = {10.1128/IAI.71.2.1020-1025.2003}, url = {http://iai.asm.org/content/71/2/1020}, author = {Faruque,Shah M. and Kamruzzaman,M. and Meraj,Ismail M. and Chowdhury,Nityananda and Nair,G. Balakrish and Sack,R. Bradley and Rita R Colwell and Sack,David A.} } @inbook {16134, title = {The people in digital libraries: Multifaceted approaches to assessing needs and impact}, booktitle = {Digital library use: Social practice in design and evaluationDigital library use: Social practice in design and evaluation}, year = {2003}, month = {2003///}, pages = {119 - 160}, publisher = {MIT Press}, organization = {MIT Press}, isbn = {9780262025447}, author = {Marchionini,G. and Plaisant, Catherine and Komlodi,A.} } @article {17522, title = {Quantifying the causes of path inflation}, journal = {Topology}, volume = {100}, year = {2003}, month = {2003///}, pages = {2 - 1}, author = {Spring, Neil and Mahajan,R. and Anderson,T.} } @article {15400, title = {Random doping-induced fluctuations of subthreshold characteristics in MOSFET devices}, journal = {Solid-State Electronics}, volume = {47}, year = {2003}, month = {2003/11//}, pages = {2055 - 2061}, abstract = {The random doping-induced fluctuations of subthreshold characteristics in MOSFET devices are analyzed. A technique for the computations of sensitivity coefficients and variances of subthreshold parameters is presented and applied to the computation of fluctuations of subthreshold current and gate-voltage swing. This technique is based on the linearization of transport equations with respect to the fluctuating quantities. It is computationally much more efficient than purely {\textquotedblleft}statistical{\textquotedblright} methods (Monte-Carlo methods) that are based on the simulations of a large number of devices with different doping realizations. The numerical implementation of this technique is discussed and numerous computational results are presented.}, keywords = {Fluctuations, Mismatch, MOSFET, Sensitivity analysis, Statistics, Submicron devices}, isbn = {0038-1101}, doi = {10.1016/S0038-1101(03)00236-3}, url = {http://www.sciencedirect.com/science/article/pii/S0038110103002363}, author = {Andrei,Petru and Mayergoyz, Issak D} } @article {13846, title = {Rapid porting of DUSTer to Hindi}, journal = {ACM Transactions on Asian Language Information Processing (TALIP)}, volume = {2}, year = {2003}, month = {2003/06//}, pages = {118 - 123}, abstract = {The frequent occurrence of divergences{\textemdash}structural differences between languages---presents a great challenge for statistical word-level alignment and machine translation. This paper describes the adaptation of DUSTer, a divergence unraveling package, to Hindi during the DARPA TIDES-2003 Surprise Language Exercise. We show that it is possible to port DUSTer to Hindi in under 3 days.}, keywords = {Divergences, Machine translation}, isbn = {1530-0226}, doi = {10.1145/974740.974744}, url = {http://doi.acm.org/10.1145/974740.974744}, author = {Dorr, Bonnie J and Ayan,Necip Fazil and Habash,Nizar and Madnani,Nitin and Hwa,Rebecca} } @article {15019, title = {Recovery of a Digital Image Collection Through the SDSC/UMD/NARA Prototype Persistent Archive}, volume = {UMIACS-TR-2003-105}, year = {2003}, month = {2003/11/25/}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {The San Diego Supercomputer Center (SDSC), the University of Maryland, and theNational Archives and Records Administration (NARA) are collaborating on building a pilot persistent archive using and extending data grid and digital library technologies. The current prototype consists of node servers at SDSC, University of Maryland, and NARA, connected through the Storage Request Broker (SRB) data grid middleware, and currently holds several terabytes of NARA selected collections. In particular, a historically important image collection that was on the verge of becoming inaccessible was fully restored and ingested into our pilot system. In this report, we describe the methodology behind our approach to fully restore this image collection and the process used to ingest it into the prototype persistent archive. (UMIACS-TR-2003-105) }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/1321}, author = {Smorul,Mike and JaJa, Joseph F. and McCall,Fritz and Brown,Susan Fitch and Moore,Reagan and Marciano,Richard and Chen,Sheau-Yen and Lopez,Rick and Chadduck,Robert} } @article {12953, title = {Reduction of Cholera in Bangladeshi Villages by Simple Filtration}, journal = {Proceedings of the National Academy of SciencesPNAS}, volume = {100}, year = {2003}, month = {2003/02/04/}, pages = {1051 - 1055}, abstract = {Based on results of ecological studies demonstrating that Vibrio cholerae, the etiological agent of epidemic cholera, is commensal to zooplankton, notably copepods, a simple filtration procedure was developed whereby zooplankton, most phytoplankton, and particulates >20 μm were removed from water before use. Effective deployment of this filtration procedure, from September 1999 through July 2002 in 65 villages of rural Bangladesh, of which the total population for the entire study comprised ≈133,000 individuals, yielded a 48\% reduction in cholera (P < 0.005) compared with the control.}, isbn = {0027-8424, 1091-6490}, doi = {10.1073/pnas.0237386100}, url = {http://www.pnas.org/content/100/3/1051}, author = {Rita R Colwell and Huq,Anwar and M. Sirajul Islam and K. M. A. Aziz and Yunus,M. and N. Huda Khan and A. Mahmud and Sack,R. Bradley and Nair,G. B. and J. Chakraborty and Sack,David A. and E. Russek-Cohen} } @article {15434, title = {Refactoring using event-based profiling}, journal = {First International Workshop on REFactoring: Achievements, Challenges, Effects (REFACE)}, year = {2003}, month = {2003///}, abstract = {Refactoring is a disciplined process of restructuring soft-ware code in order to improve it, e.g., to make it more reusable, reliable and maintainable. The source of infor- mation that guides the refactoring process may be the soft- ware{\textquoteright}s user profiles. An increasingly important class of soft- ware is event-based software. Event-based software take an event as an input, change their state, and perhaps output an event. They provide new opportunities for refactoring. For example, reorganizing the objects related to an event and restructuring the event handlers based on the behavior of the software. These opportunities require that we collect user profiles at the level of events rather than the code and model the software in such a way that allows refactoring of event handlers. We present new techniques to collect event- level profiles and organize event handlers. We describe our techniques on one class of event-based software {\textendash} Graphi- cal User Interfaces (GUIs). We demonstrate the practicality and usefulness of our techniques on a large software system. }, author = {Nagarajan,A. and Memon, Atif M.} } @article {15410, title = {Regression testing of GUIs}, journal = {ACM SIGSOFT Software Engineering Notes}, volume = {28}, year = {2003}, month = {2003/09//}, pages = {118 - 127}, abstract = {Although graphical user interfaces (GUIs) constitute a large part of the software being developed today and are typically created using rapid prototyping, there are no effective regression testing techniques for GUIs. The needs of GUI regression testing differ from those of traditional software. When the structure of a GUI is modified, test cases from the original GUI are either reusable or unusable on the modified GUI. Since GUI test case generation is expensive, our goal is to make the unusable test cases usable. The idea of reusing these unusable (a.k.a. obsolete) test cases has not been explored before. In this paper, we show that for GUIs, the unusability of a large number of test cases is a serious problem. We present a novel GUI regression testing technique that first automatically determines the usable and unusable test cases from a test suite after a GUI modification. It then determines which of the unusable test cases can be repaired so they can execute on the modified GUI. The last step is to repair the test cases. Our technique is integrated into a GUI testing framework that, given a test case, automatically executes it on the GUI. We implemented our regression testing technique and demonstrate for two case studies that our approach is effective in that many of the test cases can be repaired, and is practical in terms of its time performance.}, keywords = {call-tree, classification of events, GUI call-graph, GUI control-flow graph, GUI testing, regression testing, repairing test cases}, isbn = {0163-5948}, doi = {10.1145/949952.940088}, url = {http://doi.acm.org/10.1145/949952.940088}, author = {Memon, Atif M. and Soffa,Mary Lou} } @article {12153, title = {Replicated studies: building a body of knowledge about software reading techniques}, journal = {SERIES ON SOFTWARE ENGINEERING AND KNOWLEDGE ENGINEERING}, volume = {12}, year = {2003}, month = {2003///}, pages = {39 - 84}, author = {Shull, F. and Carver, J. and Travassos,G.H. and Maldonado,J.C. and Conradi,R. and Basili, Victor R.} } @conference {13268, title = {A representation for abstract simplicial complexes: an analysis and a comparison}, booktitle = {Discrete Geometry for Computer Imagery}, year = {2003}, month = {2003///}, pages = {454 - 464}, abstract = {Abstract simplicial complexes are used in many application contexts to represent multi-dimensional, possibly non-manifold and non-uniformly dimensional, geometric objects. In this paper we introduce a new general yet compact data structure for representing simplicial complexes, which is based on a decomposition approach that we have presented in our previous work [3]. We compare our data structure with the existing ones and we discuss in which respect it performs better than others.}, doi = {10.1007/978-3-540-39966-7_43}, author = {De Floriani, Leila and Morando,F. and Puppo,E.} } @conference {13322, title = {Representation of non-manifold objects}, booktitle = {Proceedings of the eighth ACM symposium on Solid modeling and applications}, series = {SM {\textquoteright}03}, year = {2003}, month = {2003///}, pages = {304 - 309}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {In our previous work [2], we have shown that a non-manifold, mixed-dimensional object described by simplicial complexes can be decomposed in a unique way into regular components, all belonging to a well-understood class. Based on such decomposition, we define here a two-level topological data structure for representing non-manifold objects in any dimension: the first level represents components; while the second level represents the connectivity relation among them. The resulting data structure is compact and scalable, allowing for the efficient treatment of singularities without burdening well-behaved parts of a complex with excessive space overheads.}, keywords = {Data structures, Non-manifold modeling, simplicial complexes}, isbn = {1-58113-706-0}, doi = {10.1145/781606.781656}, url = {http://doi.acm.org/10.1145/781606.781656}, author = {De Floriani, Leila and Morando,Franco and Puppo,Enrico} } @article {14729, title = {Safe and flexible memory management in Cyclone}, journal = {Technical Reports from UMIACS}, year = {2003}, month = {2003/08/01/undef}, abstract = {Cyclone is a type-safe programming language intended for applications requiring control over memory management. Our previous work on Cyclone included support for stack allocation, lexical region allocation, and a garbage-collected heap. We achieved safety (i.e., prevented dangling pointers) through a region-based type-and-effects system. This paper describes some new memory-management mechanisms that we have integrated into Cyclone: dynamic regions, unique pointers, and reference-counted objects. Our experience shows that these new mechanisms are well suited for the timely recovery of objects in situations where it is awkward to use lexical regions. Crucially, programmers can write reusable functions without unnecessarily restricting callers{\textquoteright} choices among the variety of memory-management options. To achieve this goal, Cyclone employs a combination of polymorphism and scoped constructs that temporarily let us treat objects as if they were allocated in a lexical region.}, author = {Hicks, Michael W. and Morrisett,G. and Grossman,D. and Jim,T.} } @article {14819, title = {A search engine for 3D models}, journal = {ACM Trans. Graph.}, volume = {22}, year = {2003}, month = {2003/01//}, pages = {83 - 105}, abstract = {As the number of 3D models available on the Web grows, there is an increasing need for a search engine to help people find them. Unfortunately, traditional text-based search techniques are not always effective for 3D data. In this article, we investigate new shape-based search methods. The key challenges are to develop query methods simple enough for novice users and matching algorithms robust enough to work for arbitrary polygonal models. We present a Web-based search engine system that supports queries based on 3D sketches, 2D sketches, 3D models, and/or text keywords. For the shape-based queries, we have developed a new matching algorithm that uses spherical harmonics to compute discriminating similarity measures without requiring repair of model degeneracies or alignment of orientations. It provides 46 to 245\% better performance than related shape-matching methods during precision--recall experiments, and it is fast enough to return query results from a repository of 20,000 models in under a second. The net result is a growing interactive index of 3D models available on the Web (i.e., a Google for 3D models).}, keywords = {Search engine, shape matching, shape representation, shape retrieval}, isbn = {0730-0301}, doi = {10.1145/588272.588279}, url = {http://doi.acm.org/10.1145/588272.588279}, author = {Funkhouser,Thomas and Min,Patrick and Kazhdan,Michael and Chen,Joyce and Halderman,Alex and Dobkin,David and Jacobs, David W.} } @article {14104, title = {The sequence and analysis of Trypanosoma brucei chromosome II}, journal = {Nucleic acids research}, volume = {31}, year = {2003}, month = {2003///}, pages = {4856 - 4856}, author = {El-Sayed, Najib M. and Ghedin,E. and Song,J. and MacLeod,A. and Bringaud,F. and Larkin,C. and Wanless,D. and Peterson,J. and Hou,L. and Taylor,S. and others} } @article {18995, title = {Sex-lethal splicing autoregulation in vivo: interactions between SEX-LETHAL, the U1 snRNP and U2AF underlie male exon skipping}, journal = {DevelopmentDevelopment}, volume = {130}, year = {2003}, month = {2003/02/01/}, pages = {463 - 471}, abstract = {Alternative splicing of the Sex-lethal pre-mRNA has long served as a model example of a regulated splicing event, yet the mechanism by which the female-specific SEX-LETHAL RNA-binding protein prevents inclusion of the translation-terminating male exon is not understood. Thus far, the only general splicing factor for which there is in vivo evidence for a regulatory role in the pathway leading to male-exon skipping is sans-fille (snf), a protein component of the spliceosomal U1 and U2 snRNPs. Its role, however, has remained enigmatic because of questions about whether SNF acts as part of an intact snRNP or a free protein. We provide evidence that SEX-LETHAL interacts with SANS-FILLE in the context of the U1 snRNP, through the characterization of a point mutation that interferes with both assembly into the U1 snRNP and complex formation with SEX-LETHAL. Moreover, we find that SEX-LETHAL associates with other integral U1 snRNP components, and we provide genetic evidence to support the biological relevance of these physical interactions. Similar genetic and biochemical approaches also link SEX-LETHAL with the heterodimeric splicing factor, U2AF. These studies point specifically to a mechanism by which SEX-LETHAL represses splicing by interacting with these key splicing factors at both ends of the regulated male exon. Moreover, because U2AF and the U1 snRNP are only associated transiently with the pre-mRNA during the course of spliceosome assembly, our studies are difficult to reconcile with the current model that proposes that the SEX-LETHAL blocks splicing at the second catalytic step, and instead argue that the SEX-LETHAL protein acts after splice site recognition, but before catalysis begins.}, keywords = {Drosophila, SNF, Splicing regulation, SXL, U1 snRNP, U2AF}, isbn = {0950-1991, 1477-9129}, doi = {10.1242/dev.00274}, url = {http://dev.biologists.org/content/130/3/463}, author = {Nagengast,Alexis A. and Stitzinger,Shane M. and Tseng,Chin-Hsiu and Mount, Stephen M. and Salz,Helen K.} } @article {18870, title = {SHOP2: An HTN planning system}, journal = {J. Artif. Intell. Res. (JAIR)}, volume = {20}, year = {2003}, month = {2003///}, pages = {379 - 404}, abstract = {The SHOP2 planning system received one of the awards for distinguished performance in the 2002 International Planning Competition. This paper describes the features of SHOP2 which enabled it to excel in the competition, especially those aspects of SHOP2 that deal with temporal and metric planning domains.}, url = {https://www.aaai.org/Papers/JAIR/Vol20/JAIR-2013.pdf}, author = {Nau, Dana S. and Au,T. C and Ilghami,O. and Kuter,U. and Murdock,J. W. and Wu,D. and Yaman,F.} } @article {15027, title = {Space-Efficient and Fast Algorithms for Multidimensional Dominance Reporting and Range Counting}, volume = {UMIACS-TR-2003-101}, year = {2003}, month = {2003/11/25/}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {We present linear-space sublogarithmic algorithms for handling the {\emthree-dimensional dominance reporting problem} and the {\em two-dimensional range counting problem}. Under the RAM model as described in~[M.~L. Fredman and D.~E. Willard. {\textquoteleft}{\textquoteleft}Surpassing the information theoretic bound with fusion trees{\textquoteright}{\textquoteright}, {\em Journal of Computer and System Sciences}, 47:424--436, 1993], our algorithms achieve $O(\log n/\log\log n+f)$ query time for 3-D dominance reporting, where $f$ is the number of points reported, and $O(\log n/\log\log n)$ query time for 2-D range counting case. We extend these results to any constant dimension $d$ achieving $O(n(\log n/\log\log n)^{d-3})$-space and $O((\log n/\log\log )^{d-2}+f)$-query time for the reporting case and $O(n(\log n/\log\log n)^{d-2})$-space and $O((\log n/\log\log n)^{d-1})$ query time for the counting case. (UMIACS-TR-2003-101) }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/1318}, author = {Shi,Qingmin and JaJa, Joseph F. and Mortensen,Christian} } @book {14916, title = {Special section on perceptual organization in computer vision}, year = {2003}, month = {2003///}, publisher = {IEEE Computer Society}, organization = {IEEE Computer Society}, author = {Jacobs, David W. and Lindenbaum,M. and August,J. and Zucker,SW and Ben-Shahar,O. and Zucker,SW and Tuytelaars,T. and Turina,A. and Van Gool,L. and Mahamud,S.} } @conference {12208, title = {Starting an intergenerational technology design team: a case study}, booktitle = {Proceedings of the 2003 conference on Interaction design and children}, series = {IDC {\textquoteright}03}, year = {2003}, month = {2003///}, pages = {51 - 58}, publisher = {ACM}, organization = {ACM}, address = {Preston, England}, abstract = {This paper presents a case study of the first three months of a new intergenerational design team with children ages 10--13. It discusses the research and design methods used for working with children of this age group, the challenges and opportunities of starting a new team, and the lessons learned.}, keywords = {children, cooperative inquiry, design methods, educational applications, intergenerational design teams, participatory design}, isbn = {1-58113-732-X}, doi = {10.1145/953536.953545}, author = {Knudtzon,Kendra and Druin, Allison and Kaplan,Nancy and Summers,Kathryn and Chisik,Yoram and Kulkarni,Rahul and Moulthrop,Stuart and Weeks,Holly and Bederson, Benjamin B.} } @article {17387, title = {Supporting statistical electronic table usage by citizens}, journal = {Commun. ACM}, volume = {46}, year = {2003}, month = {2003/01//}, pages = {52 - 54}, abstract = {Over 70 agencies at the federal level are charged with collecting data and producing and disseminating statistics. These statistics are used to inform government policy, shape health care initiatives, provide information on the state of the economy, and others. They also have significant impact on the lives of citizens who use the statistics, for example, to determine job opportunities, changes in social security benefits, and quality of life in particular areas. Our digital government project developed several specific technologies to support the location, manipulation, and understanding of a quintessential format for statistical information---the table.}, isbn = {0001-0782}, doi = {10.1145/602421.602449}, url = {http://doi.acm.org/10.1145/602421.602449}, author = {Hert,Carol A. and Liddy,Elizabeth D. and Shneiderman, Ben and Marchionini,Gary} } @article {13657, title = {Tagging and Parsing of Bilingual Dictionary}, volume = {LAMP-TR-106,CFAR-TR-991,CS-TR-4529,UMIACS-TR-2003-97}, year = {2003}, month = {2003/09//}, institution = {University of Maryland, College Park}, abstract = {Bilingual dictionaries hold great potential as a source of lexical resources for training and testing automated systems for optical character recognition, machine translation, and cross-language information retrieval. In this paper, we describe a system for extracting term lexicons from printed bilingual dictionaries. Our work was divided into three phases - dictionary segmentation, entry tagging, and generation. In segmentation, pages are divided into logical entries based on structural features learned from selected examples. The extracted entries are associated with functional labels and passed to a tagging module which associates linguistic labels with each word or phrase in the entry. The output of the system is a structure that represents the entries from the dictionary. We have used this approach to parse a variety of dictionaries with both Latin and non-Latin alphabets, and demonstrate the results of term lexicon generation for retrieval from a collection of French news stories using English queries.}, author = {Ma,Huanfeng and Karagol-Ayan,Burcu and David Doermann and Oard, Douglas and Wang,Jianqiang} } @conference {16139, title = {Technology probes: inspiring design for and with families}, booktitle = {Proceedings of the SIGCHI conference on Human factors in computing systems}, series = {CHI {\textquoteright}03}, year = {2003}, month = {2003///}, pages = {17 - 24}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {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.}, keywords = {computer mediated communication, ethnography, Home, participatory design and cooperative design}, isbn = {1-58113-630-7}, doi = {10.1145/642611.642616}, url = {http://doi.acm.org/10.1145/642611.642616}, author = {Hutchinson,Hilary and Mackay,Wendy and Westerlund,Bo and Bederson, Benjamin B. and Druin, Allison and Plaisant, Catherine and Beaudouin-Lafon,Michel and Conversy,St{\'e}phane and Evans,Helen and Hansen,Heiko and Roussel,Nicolas and Eiderb{\"a}ck,Bj{\"o}rn} } @article {13344, title = {TelegraphCQ: An architectural status report}, journal = {IEEE Data Engineering Bulletin}, volume = {26}, year = {2003}, month = {2003///}, pages = {11 - 18}, author = {Krishnamurthy, S. and Chandrasekaran,S. and Cooper,O. and Deshpande, Amol and Franklin,M.J. and Hellerstein,J. M and Hong,W. and Madden,S. and Reiss,F. and Shah,M. A} } @conference {13405, title = {TelegraphCQ: continuous dataflow processing}, booktitle = {Proceedings of the 2003 ACM SIGMOD international conference on Management of data}, series = {SIGMOD {\textquoteright}03}, year = {2003}, month = {2003///}, pages = {668 - 668}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, isbn = {1-58113-634-X}, doi = {10.1145/872757.872857}, url = {http://doi.acm.org/10.1145/872757.872857}, author = {Chandrasekaran,Sirish and Cooper,Owen and Deshpande, Amol and Franklin,Michael J. and Hellerstein,Joseph M. and Wei Hong and Krishnamurthy,Sailesh and Madden,Samuel R. and Reiss,Fred and Shah,Mehul A.} } @article {13337, title = {Topological analysis and characterization of discrete scalar fields}, journal = {Geometry, Morphology, and Computational Imaging}, year = {2003}, month = {2003///}, pages = {65 - 85}, abstract = {In this paper, we address the problem of analyzing the topology of discrete scalar fields defined on triangulated domains. To this aim, we introduce the notions of discrete gradient vector field and of Smalelike decomposition for the domain of a d-dimensional scalar field. We use such notions to extract the most relevant features representing the topology of the field. We describe a decomposition algorithm, which is independent of the dimension of the scalar field, and, based on it, methods for extracting the critical net of a scalar field. A complete classification of the critical points of a 2-dimensional field that corresponds to a piecewise differentiable field is also presented.}, doi = {10.1007/3-540-36586-9_25}, author = {Danovaro,E. and De Floriani, Leila and Mesmoudi,M.} } @conference {16133, title = {Toward a statistical knowledge network}, booktitle = {Proceedings of the 2003 annual national conference on Digital government research}, series = {dg.o {\textquoteright}03}, year = {2003}, month = {2003///}, pages = {1 - 6}, publisher = {Digital Government Society of North America}, organization = {Digital Government Society of North America}, abstract = {This paper describes an architecture for a statistical knowledge network that depends on user interfaces as the glue among the components. These interfaces aim to serve non-expert users with diverse needs and statistical and computing experiences. Such interfaces are crucially dependent on different indexing schemes and good metadata.}, url = {http://dl.acm.org/citation.cfm?id=1123196.1123312}, author = {Marchionini,Gary and Haas,Stephanie and Plaisant, Catherine and Shneiderman, Ben and Hert,Carol} } @conference {19509, title = {Towards On-chip Fault-tolerant Communication}, booktitle = {ASP-DAC {\textquoteright}03 Proceedings of the 2003 Asia and South Pacific Design Automation Conference}, series = {ASP-DAC {\textquoteright}03}, year = {2003}, month = {2003///}, pages = {225 - 232}, publisher = {ACM}, organization = {ACM}, abstract = {As CMOS technology scales down into the deep-submicron (DSM) domain, devices and interconnects are subject to new types of malfunctions and failures that are harder to predict and avoid with the current system-on-chip (SoC) design methodologies. Relaxing the requirement of 100\% correctness in operation drastically reduces the costs of design but, at the same time, requires SoCs be designed with some degree of system-level fault-tolerance. In this paper, we introduce a high-level model of DSM failure patterns and propose a new communication paradigm for SoCs, namely stochastic communication. Specifically, for a generic tile-based architecture, we propose a randomized algorithm which not only separates computation from communication, but also provides the required fault-tolerance to on-chip failures. This new technique is easy and cheap to implement in SoCs that integrate a large number of communicating IP cores.}, isbn = {0-7803-7660-9}, url = {http://doi.acm.org/10.1145/1119772.1119817}, author = {Tudor Dumitras and Kerner, Sam and M\uarculescu, Radu} } @article {16898, title = {Use of the SAND spatial browser for digital government applications}, journal = {Commun. ACM}, volume = {46}, year = {2003}, month = {2003/01//}, pages = {61 - 64}, abstract = {Numerous federal agencies produce official statistics made accessible to ordinary citizens for searching and data retrieval. This is frequently done via the Internet through a Web browser interface. If this data is presented in textual format, it can often be searched and retrieved by such attributes as topic, responsible agency, keywords, or press release. However, if the data is of spatial nature, for example, in the form of a map, then using text-based queries is often too cumbersome for the intended audience. We describe the use of the SAND Spatial Browser to provide more power to users of these databases by enabling them to define and explore the specific spatial region of interest graphically. The SAND Spatial Browser allows users to form either purely spatial or mixed spatial/nonspatial queries intuitively, which can present information to users that might have been missed if only a textual interface was available.}, keywords = {GIS}, isbn = {0001-0782}, doi = {10.1145/602421.602453}, url = {http://doi.acm.org/10.1145/602421.602453}, author = {Samet, Hanan and Alborzi,Houman and Brabec,Franti{\v s}ek and Esperan{\c c}a,Claudio and Hjaltason,G{\'\i}sli R. and Morgan,Frank and Tanin,Egemen} } @article {12165, title = {User interface evaluation and empirically-based evolution of a prototype experience management tool}, journal = {Software Engineering, IEEE Transactions on}, volume = {29}, year = {2003}, month = {2003/09//}, pages = {838 - 850}, abstract = {Experience management refers to the capture, structuring, analysis, synthesis, and reuse of an organization{\textquoteright}s experience in the form of documents, plans, templates, processes, data, etc. The problem of managing experience effectively is not unique to software development, but the field of software engineering has had a high-level approach to this problem for some time. The Experience Factory is an organizational infrastructure whose goal is to produce, store, and reuse experiences gained in a software development organization. This paper describes The Q-Labs Experience Management System (Q-Labs EMS), which is based on the Experience Factory concept and was developed for use in a multinational software engineering consultancy. A critical aspect of the Q-Labs EMS project is its emphasis on empirical evaluation as a major driver of its development and evolution. The initial prototype requirements were grounded in the organizational needs and vision of Q-Labs, as were the goals and evaluation criteria later used to evaluate the prototype. However, the Q-Labs EMS architecture, data model, and user interface were designed to evolve, based on evolving user needs. This paper describes this approach, including the evaluation that was conducted of the initial prototype and its implications for the further development of systems to support software experience management.}, keywords = {data, development;, empirical, EMS;, engineering;, evaluation;, experience, experience;, Factory;, interface, interfaces;, knowledge, management, management;, model;, models;, organization, performance, prototype, Q-Labs, re-engineering;, reusability;, reuse;, software, system;, systems, tool;, user}, isbn = {0098-5589}, doi = {10.1109/TSE.2003.1232288}, author = {Seaman,C.B and Mendonca,M.G. and Basili, Victor R. and Kim,Y. M} } @conference {17524, title = {User-level internet path diagnosis}, booktitle = {ACM SIGOPS Operating Systems Review}, volume = {37}, year = {2003}, month = {2003///}, pages = {106 - 119}, author = {Mahajan,R. and Spring, Neil and Wetherall,D. and Anderson,T.} } @conference {18456, title = {Using computer vision to generate customized spatial audio}, booktitle = {Multimedia and Expo, IEEE International Conference on}, volume = {3}, year = {2003}, month = {2003///}, pages = {57 - 60}, publisher = {IEEE Computer Society}, organization = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, abstract = {Creating high quality virtual spatial audio over headphones requires real-time head tracking, personalized head-related transfer functions (HRTFs) and customized room response models. While there are expensive solutions to address these issues based on costly head trackers, measured personalized HRTFs and room responses, these are not suitable for widespread or easy deployment and use. We report on the development of a system that uses computer vision to produce customizable models for both the HRTF and the room response, and to achieve head-tracking. The system uses relatively inexpensive cameras and widely available personal computers. Computer-vision based anthropometric measurements of the head, torso, and the external ears are used for HRTF customization. For low-frequency HRTF customization we employ a simple head-and-torso model developed recently [V. R. Algazi et al., 2002]. For high frequency customization we employ measured pinna characteristics as an index into a database of HRTFs [D. N. Zotkin et al., 2002]. For head tracking we employ an online implementation of the POSIT algorithm [D. DeMenthon and L. Davis, 1995] along with active markers to compute head pose in real-time. The system provides an enhanced virtual listening experience at low cost.}, isbn = {0-7803-7965-9}, doi = {http://doi.ieeecomputersociety.org/10.1109/ICME.2003.1221247}, author = {Mohan,A. and Duraiswami, Ramani and Zotkin,Dmitry N and DeMenthon,D. and Davis, Larry S.} } @inbook {16130, title = {Visualizing websites using a hierarchical table of contents browser: WebTOC}, booktitle = {The craft of information visualization: readings and reflectionsThe craft of information visualization: readings and reflections}, year = {2003}, month = {2003///}, pages = {438 - 438}, publisher = {Morgan Kaufmann Publishers Inc.}, organization = {Morgan Kaufmann Publishers Inc.}, isbn = {9781558609150}, author = {Plaisant, Catherine and Marchionini,G. and Komlodi,A.} } @conference {15428, title = {What test oracle should I use for effective GUI testing?}, booktitle = {Automated Software Engineering, 2003. Proceedings. 18th IEEE International Conference on}, year = {2003}, month = {2003/10//}, pages = {164 - 173}, abstract = {Test designers widely believe that the overall effectiveness and cost of software testing depends largely on the type and number of test cases executed on the software. In this paper we show that the test oracle used during testing also contributes significantly to test effectiveness and cost. A test oracle is a mechanism that determines whether software executed correctly for a test case. We define a test oracle to contain two essential parts: oracle information that represents expected output; and an oracle procedure that compares the oracle information with the actual output. By varying the level of detail of oracle information and changing the oracle procedure, a test designer can create different types of test oracles. We design 11 types of test oracles and empirically compare them on four software systems. We seed faults in software to create 100 faulty versions, execute 600 test cases on each version, for all 11 types of oracles. In all, we report results of 660,000 test runs on software. We show (1) the time and space requirements of the oracles, (2) that faults are detected early in the testing process when using detailed oracle information and complex oracle procedures, although at a higher cost per test case, and (3) that employing expensive oracles results in detecting a large number of faults using relatively smaller number of test cases.}, keywords = {empirical studies, graphical user interface, Graphical user interfaces, GUI testing, oracle information, oracle procedure, oracle space requirement, oracle time requirements, program testing, software engineering, Software testing, test cost, test effectiveness, test oracle}, doi = {10.1109/ASE.2003.1240304}, author = {Memon, Atif M. and Banerjee,I. and Nagarajan,A.} } @inbook {16131, title = {The World{\textquoteright}s Information in Digital Libraries}, booktitle = {The craft of information visualization: readings and reflectionsThe craft of information visualization: readings and reflections}, year = {2003}, month = {2003///}, pages = {149 - 149}, publisher = {Morgan Kaufmann Publishers Inc.}, organization = {Morgan Kaufmann Publishers Inc.}, isbn = {978-1-55860-915-0}, author = {Plaisant, Catherine and Marchimini,G. and Bruns,T. and Komlodi,A. and Campbell,L. and Rose,A. and Ding,G.M. and Beale Jr,J. and Nolet,V. and Shneiderman, Ben and others} } @inbook {14589, title = {1.375-Approximation Algorithm for Sorting by Reversals}, booktitle = {Algorithms {\textemdash} ESA 2002Algorithms {\textemdash} ESA 2002}, series = {Lecture Notes in Computer Science}, volume = {2461}, year = {2002}, month = {2002///}, pages = {401 - 408}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {Analysis of genomes evolving by inversions leads to a general combinatorial problem of Sorting by Reversals , MIN-SBR, the problem of sorting a permutation by a minimum number of reversals. Following a series of preliminary results, Hannenhalli and Pevzner developed the first exact polynomial time algorithm for the problem of sorting signed permutations by reversals, and a polynomial time algorithm for a special case of unsigned permutations. The best known approximation algorithm for MIN-SBR, due to Christie, gives a performance ratio of 1.5. In this paper, by exploiting the polynomial time algorithm for sorting signed permutations and by developing a new approximation algorithm for maximum cycle decomposition of breakpoint graphs, we design a new 1.375-algorithm for the MIN-SBR problem.}, isbn = {978-3-540-44180-9}, url = {http://dx.doi.org/10.1007/3-540-45749-6_21}, author = {Berman,Piotr and Hannenhalli, Sridhar and Karpinski,Marek}, editor = {M{\"o}hring,Rolf and Raman,Rajeev} } @article {13414, title = {AAAI 2002 Workshops}, journal = {AI Magazine}, volume = {23}, year = {2002}, month = {2002/12/15/}, pages = {113 - 113}, isbn = {0738-4602}, doi = {10.1609/aimag.v23i4.1678}, url = {http://www.aaai.org/ojs/index.php/aimagazine/article/viewArticle/1678}, author = {Blake,Brian and Haigh,Karen and Hexmoor,Henry and Falcone,Rino and Soh,Leen-Kiat and Baral,Chitta and McIlraith,Sheila and Gmytrasiewicz,Piotr and Parsons,Simon and Malaka,Rainer and Krueger,Antonio and Bouquet,Paolo and Smart,Bill and Kurumantani,Koichi and Pease,Adam and Brenner,Michael and desJardins, Marie and Junker,Ulrich and Delgrande,Jim and Doyle,Jon and Rossi,Francesca and Schaub,Torsten and Gomes,Carla and Walsh,Toby and Guo,Haipeng and Horvitz,Eric J and Ide,Nancy and Welty,Chris and Anger,Frank D and Guegen,Hans W and Ligozat,Gerald} } @article {15685, title = {Adaptive Multimedia System Architecture for Improving QoS inWireless Networks}, journal = {Advances in Multimedia Information Processing{\textemdash}PCM 2002}, year = {2002}, month = {2002///}, pages = {37 - 47}, author = {Mahajan,A. and Mundur, Padma and Joshi,A.} } @book {15676, title = {Algorithm Engineering and Experiments: 4th International Workshop, Alenex 2002, San Francisco, Ca, Usa, January 4-5. 2002 : Revised Papers}, year = {2002}, month = {2002/09/17/}, publisher = {Springer}, organization = {Springer}, abstract = {This book constitutes the thoroughly refereed post-proceedings of the 4th International Workshop on Algorithm Engineering and Experiments, ALENEX 2002, held in San Francisico, CA, USA in January 2002.The 15 revised full papers presented were carefully reviewed and selected from 34 submissions. Among the topics addressed are hewistics for algorithms, combinatorial optimization, searching, graph computation, network optimization, scheduling, computational geometry, sorting, and clustering algorithms.}, keywords = {Architecture / General, Artificial intelligence, Computer algorithms, Computer algorithms/ Congresses, COMPUTERS, Computers / Computer Graphics, Computers / Computer Science, Computers / Data Modeling \& Design, Computers / Data Processing, Computers / General, Computers / Programming / Algorithms, Electronic books, Mathematics / Discrete Mathematics, Medical / General}, isbn = {9783540439776}, author = {Mount, Dave and Stein,Clifford} } @article {15541, title = {Algorithmic issues in modeling motion}, journal = {ACM Comput. Surv.}, volume = {34}, year = {2002}, month = {2002/12//}, pages = {550 - 572}, abstract = {This article is a survey of research areas in which motion plays a pivotal role. The aim of the article is to review current approaches to modeling motion together with related data structures and algorithms, and to summarize the challenges that lie ahead in producing a more unified theory of motion representation that would be useful across several disciplines.}, keywords = {computational geometry, Computer vision, mobile networks, modeling, molecular biology, motion modeling, physical simulation, robotoics, spatio-temporal databases}, isbn = {0360-0300}, doi = {10.1145/592642.592647}, url = {http://doi.acm.org/10.1145/592642.592647}, author = {Agarwal,Pankaj K. and Guibas,Leonidas J. and Edelsbrunner,Herbert and Erickson,Jeff and Isard,Michael and Har-Peled,Sariel and Hershberger,John and Jensen,Christian and Kavraki,Lydia and Koehl,Patrice and Lin,Ming and Manocha,Dinesh and Metaxas,Dimitris and Mirtich,Brian and Mount, Dave and Muthukrishnan,S. and Pai,Dinesh and Sacks,Elisha and Snoeyink,Jack and Suri,Subhash and Wolefson,Ouri} } @article {15682, title = {The Analysis and Performance of Multi-Rate Service in Distributed Video-on-Demand Systems}, journal = {Multimedia Tools and Applications}, volume = {17}, year = {2002}, month = {2002///}, pages = {51 - 75}, author = {Mundur, Padma and Simon,R. and Sood,A.} } @inbook {15578, title = {Analysis of approximate nearest neighbor searching with clustered point sets}, booktitle = {Data Structures, Near Neighbor Searches, and MethodologyData Structures, Near Neighbor Searches, and Methodology}, volume = {59}, year = {2002}, month = {2002///}, pages = {105 - 123}, publisher = {American Mathematical Society}, organization = {American Mathematical Society}, isbn = {0821828924, 9780821828922}, author = {Maneewongvatana,S. and Mount, Dave} } @inbook {16960, title = {An Augmented Visual Query Mechanism for Finding Patterns in Time Series Data}, booktitle = {Flexible Query Answering SystemsFlexible Query Answering Systems}, series = {Lecture Notes in Computer Science}, volume = {2522}, year = {2002}, month = {2002///}, pages = {240 - 250}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {Relatively few query tools exist for data exploration and pattern identification in time series data sets. In previous work we introduced Timeboxes . Timeboxes are rectangular, direct-manipulation queries for studying time-series datasets. We demonstrated how Timeboxes can be used to support interactive exploration via dynamic queries, along with overviews of query results and drag-and-drop support for query-by-example. In this paper, we extend our work by introducing Variable Time Timeboxes (VTT). VTTs are a natural generalization of Timeboxes, which permit the specification of queries that allow a degree of uncertainty in the time axis. We carefully motivate the need for these more expressive queries, and demonstrate the utility of our approach on several data sets.}, isbn = {978-3-540-00074-7}, url = {http://dx.doi.org/10.1007/3-540-36109-X_19}, author = {Keogh,Eamonn and Hochheiser,Harry and Shneiderman, Ben}, editor = {Carbonell,Jaime and Siekmann,J{\"o}rg and Andreasen,Troels and Christiansen,Henning and Motro,Amihai and Legind Larsen,Henrik} } @article {14204, title = {Bias in visual motion processes: A theory predicting illusions}, journal = {Statistical Methods in Video Processing.(in conjunction with European Conference on Computer Vision)}, year = {2002}, month = {2002///}, abstract = {The first step in the interpretation of video sequences is theestimation of spatio-temporal image representations, that is the image motion or the correspondence of points or lines. Noise in the data, however, causes a serious problem for their estimation; in particular, it causes bias. As a result the location of image points, the orientation of image lines and the length and orientation of image motion vectors are esti- mated erroneously. It is suggested that machine vision sys- tems processing video should include statistical procedures to alleviate the bias. However, complete correction in gen- eral does not appear to be feasible, and this provides an ex- planation for most well-known geometrical optical illusions, such as the caf{\'e} wall, the Z{\"o}llner, the Poggendorff illusion and other recently discovered illusions of movement. }, author = {Ferm{\"u}ller, Cornelia and Aloimonos, J. and Malm,H.} } @conference {18873, title = {CaMeL: Learning method preconditions for HTN planning}, year = {2002}, month = {2002///}, pages = {131 - 14}, abstract = {A great challenge in using any planning system to solve real-world problems is the difficulty of acquiring the do- main knowledge that the system will need. We present a way to address part of this problem, in the context of Hierarchical Task Network (HTN) planning, by having the planning system incrementally learn conditions for HTN methods under expert supervision. We present a general formal framework for learning HTN methods, and a supervised learning algorithm, named CaMeL, based on this formalism. We present theoretical results about CaMeL{\textquoteright}s soundness, completeness, and conver- gence properties. We also report experimental results about its speed of convergence under different condi- tions. The experimental results suggest that CaMeL has the potential to be useful in real-world applications.}, url = {https://www.aaai.org/Papers/AIPS/2002/AIPS02-014.pdf}, author = {Ilghami,O. and Nau, Dana S. and Munoz-Avila,H. and Aha,D. W.} } @article {12964, title = {Characterization of Pseudoalteromonas citrea and P. nigrifaciens Isolated from Different Ecological Habitats Based on REP-PCR Genomic Fingerprints}, journal = {Systematic and Applied Microbiology}, volume = {25}, year = {2002}, month = {2002///}, pages = {275 - 283}, abstract = {SummaryDNA primers corresponding to conserved repetitive interspersed genomic motifs and PCR were used to show that REP, ERIC and BOX-like DNA sequences are present in marine, oxidative, Gram-negative Pseudoalteromonas strains. REP, ERIC and BOX-PCR were used for rapid molecular characterization of both the type species of the genus and environmental strains isolated from samples collected in different geographical areas. PCR-generated genomic fingerprint patterns were found to be both complex and strain specific. Analysis of the genotypic structure of phenotypically diverse P. citrea revealed a geographic clustering of Far Eastern brown-pigmented, agar-digesting strains of this species. Marine isolates of P. nigrifaciens with 67{\textendash}70\% DNA relatedness generated genomic patterns different from those of the type strain and formed a separate cluster. It is concluded that REP, ERIC and BOX-PCR are effective in generating strain specific patterns that can be used to elucidate geographic distribution, with these genomic patterns providing a valuable biogeographic criterion. }, keywords = {biogeography, BOX-PCR, ERIC, Pseudoalteromonas, REP}, isbn = {0723-2020}, doi = {10.1078/0723-2020-00103}, url = {http://www.sciencedirect.com/science/article/pii/S0723202004701125}, author = {Ivanova,Elena P. and Matte,Glavur R. and Matte,Maria H. and Coenye,Tom and Huq,Anwarul and Rita R Colwell} } @inbook {14598, title = {Combinatorial Algorithms for Design of DNA Arrays}, booktitle = {Chip TechnologyChip Technology}, series = {Advances in Biochemical Engineering/Biotechnology}, volume = {77}, year = {2002}, month = {2002///}, pages = {1 - 19}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {Optimal design of DNA arrays requires the development of algorithms with two-fold goals: reducing the effects caused by unintended illumination ( border length minimization problem ) and reducing the complexity of masks ( mask decomposition problem ). We describe algorithms that reduce the number of rectangles in mask decomposition by 20{\textendash}30\% as compared to a standard array design under the assumption that the arrangement of oligonucleotides on the array is fixed. This algorithm produces provably optimal solution for all studied real instances of array design. We also address the difficult problem of finding an arrangement which minimizes the border length and come up with a new idea of threading that significantly reduces the border length as compared to standard designs.}, isbn = {978-3-540-43215-9}, url = {http://dx.doi.org/10.1007/3-540-45713-5_1}, author = {Hannenhalli, Sridhar and Hubbell,Earl and Lipshutz,Robert and Pevzner,Pavel}, editor = {Hoheisel,J{\"o}rg and Brazma,A. and B{\"u}ssow,K. and Cantor,C. and Christians,F. and Chui,G. and Diaz,R. and Drmanac,R. and Drmanac,S. and Eickhoff,H. and Fellenberg,K. and Hannenhalli, Sridhar and Hoheisel,J. and Hou,A. and Hubbell,E. and Jin,H. and Jin,P. and Jurinke,C. and Konthur,Z. and K{\"o}ster,H. and Kwon,S. and Lacy,S. and Lehrach,H. and Lipshutz,R. and Little,D. and Lueking,A. and McGall,G. and Moeur,B. and Nordhoff,E. and Nyarsik,L. and Pevzner,P. and Robinson,A. and Sarkans,U. and Shafto,J. and Sohail,M. and Southern,E. and Swanson,D. and Ukrainczyk,T. and van den Boom,D. and Vilo,J. and Vingron,M. and Walter,G. and Xu,C.} } @conference {18182, title = {Communication-friendly encryption of multimedia}, booktitle = {Multimedia Signal Processing, 2002 IEEE Workshop on}, year = {2002}, month = {2002/12//}, pages = {292 - 295}, abstract = {This paper discusses encryption operations that selectively encrypt content-carrying segments of multimedia data stream. We propose and analyze three techniques that work in different domains, namely, a syntax-aware selective bitstream encryption tool with bit stuffing, a generalized index mapping encryption tool with controlled overhead and an intra-bitplane encryption tool compatible with fine granularity scalable coding. The designs of these proposed encryption operations take into consideration the inherent structure and syntax of multimedia sources and have improved friendliness to communications, compression and computation.}, keywords = {bit, bitstream, coding;, Communication, communication;, compression, compression;, COMPUTATION, controlled, cryptography;, data, encryption, encryption;, fine, friendliness;, granularity, image, index, intrabitplane, MAPPING, multimedia, operation;, overhead;, scalable, selective, sources, stream;, stuffing;, syntax-aware, syntax;, tool;}, doi = {10.1109/MMSP.2002.1203303}, author = {M. Wu and Mao,Yinian} } @article {19075, title = {Complete genome sequence and comparative analysis of the metabolically versatile Pseudomonas putida KT2440}, journal = {Environmental microbiology}, volume = {4}, year = {2002}, month = {2002}, pages = {799 - 808}, abstract = {Pseudomonas putida is a metabolically versatile saprophytic soil bacterium that has been certified as a biosafety host for the cloning of foreign genes. The bacterium also has considerable potential for biotechnological applications. Sequence analysis of the 6.18 Mb genome of strain KT2440 reveals diverse transport and metabolic systems. Although there is a high level of genome conservation with the pathogenic Pseudomonad Pseudomonas aeruginosa (85\% of the predicted coding regions are shared), key virulence factors including exotoxin A and type III secretion systems are absent. Analysis of the genome gives insight into the non-pathogenic nature of P. putida and points to potential new applications in agriculture, biocatalysis, bioremediation and bioplastic production.}, author = {Nelson,K. E and Weinel,C. and Paulsen,IT and Dodson,RJ and Hilbert,H. and Martins dos Santos,VAP and Fouts,DE and Gill,S. R and Pop, Mihai and Holmes,M. and others} } @inbook {18914, title = {On the Complexity of Plan Adaptation by Derivational Analogy in a Universal Classical Planning Framework}, booktitle = {Advances in Case-Based Reasoning}, series = {Lecture Notes in Computer Science}, volume = {2416}, year = {2002}, month = {2002///}, pages = {199 - 206}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {In this paper we present an algorithm called DerUCP, which can be regarded as a general model for plan adaptation using Derivational Analogy. Using DerUCP, we show that previous results on the complexity of plan adaptation do not apply to Derivational Analogy. We also show that Derivational Analogy can potentially produce exponential reductions in the size of the search space generated by a planning system.}, keywords = {Computer science}, isbn = {978-3-540-44109-0}, url = {http://www.springerlink.com/content/db2mr13j90mfrcaw/abstract/}, author = {Au,Tsz-Chiu and Mu{\~n}oz-Avila,H{\'e}ctor and Nau, Dana S.}, editor = {Craw,Susan and Preece,Alun} } @article {13278, title = {Compression methods for triangle meshes Preliminary version}, volume = {DISI-02-XX}, year = {2002}, month = {2002///}, institution = {Department of Computer Science and Information Science, University of Genoa}, author = {Danovaro,E. and De Floriani, Leila and Magillo,P.} } @article {17818, title = {Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A}, journal = {Kowalski, Part I}, year = {2002}, month = {2002///}, pages = {586 - 625}, author = {Eiter,T. and Mascardi,V. and V.S. Subrahmanian} } @article {12125, title = {COTS-based software development: Processes and open issues}, journal = {Journal of Systems and Software}, volume = {61}, year = {2002}, month = {2002/04/01/}, pages = {189 - 199}, abstract = {The work described in this paper is an investigation of the COTS-based software development within a particular NASA environment, with an emphasis on the processes used. Fifteen projects using a COTS-based approach were studied and their actual process was documented. This process is evaluated to identify essential differences in comparison to traditional software development. The main differences, and the activities for which projects require more guidance, are requirements definition and COTS selection, high level design, integration and testing. Starting from these empirical observations, a new process and set of guidelines for COTS-based development are developed and briefly presented.}, keywords = {Commercial off-the-shelf, Component-based, COTS, empirical study, Software development process}, isbn = {0164-1212}, doi = {10.1016/S0164-1212(01)00147-9}, url = {http://www.sciencedirect.com/science/article/pii/S0164121201001479}, author = {Morisio,M and Seaman,C.B and Basili, Victor R. and Parra,A.T and Kraft,S.E and Condon,S.E} } @article {14672, title = {Cyclone: A safe dialect of C}, journal = {USENIX Annual Technical Conference}, year = {2002}, month = {2002///}, pages = {275 - 288}, abstract = {Cyclone is a safe dialect of C. It has been designed from the ground up to prevent the buffer overflows, format string attacks, and memory management errors that are common in C programs, while retaining C{\textquoteright}s syntax and semantics. This paper examines safety violations enabled by C{\textquoteright}s design, and shows how Cyclone avoids them, without giving up C{\textquoteright}s hallmark control over low-level details such as data representation and memory management.}, author = {Jim,T. and Morrisett,G. and Grossman,D. and Hicks, Michael W. and Cheney,J. and Wang, Y.} } @article {15512, title = {Disjunctive logic programming: A survey and assessment}, journal = {Computational Logic: Logic Programming and Beyond}, year = {2002}, month = {2002///}, pages = {171 - 197}, abstract = {We describe the fields of disjunctive logic programming and disjunctive deductive databases from the time of their inception to the current time. Contributions with respect to semantics, implementations and applications are surveyed.In the last decade many semantics have been proposed out of which we highlight what we believe to be the most influential ones and compare them. Basic ideas have been borrowed from the semantics of normal logic programs such as stable model semantics and well-founded semantics, which have been generalized in various ways to obtain semantics of disjunctive logic programs. We discuss disjunctive systems such as DLV and Smodels, and related non-disjunctive systems such as XSB and DeReS, that have been implemented. We also describe applications of disjunctive logic programming: reasoning about declarative specifications, reasoning about actions, diagnosis (e.g. in medicine or biology), and in data integration that have resource predicates defined by multiple rules. We discuss the future needs to make the field practical: e.g. integrating concepts from databases (such as aggregation), optimization methods, and object orientation. }, doi = {10.1007/3-540-45628-7_18}, author = {Minker, Jack and Seipel,D.} } @article {15613, title = {An efficient k-means clustering algorithm: analysis and implementation}, journal = {Pattern Analysis and Machine Intelligence, IEEE Transactions on}, volume = {24}, year = {2002}, month = {2002/07//}, pages = {881 - 892}, abstract = {In k-means clustering, we are given a set of n data points in d-dimensional space Rd and an integer k and the problem is to determine a set of k points in Rd, called centers, so as to minimize the mean squared distance from each data point to its nearest center. A popular heuristic for k-means clustering is Lloyd{\textquoteright}s (1982) algorithm. We present a simple and efficient implementation of Lloyd{\textquoteright}s k-means clustering algorithm, which we call the filtering algorithm. This algorithm is easy to implement, requiring a kd-tree as the only major data structure. We establish the practical efficiency of the filtering algorithm in two ways. First, we present a data-sensitive analysis of the algorithm{\textquoteright}s running time, which shows that the algorithm runs faster as the separation between clusters increases. Second, we present a number of empirical studies both on synthetically generated data and on real data sets from applications in color quantization, data compression, and image segmentation}, keywords = {algorithm;color, algorithm;image, algorithm;kd-tree;mean, analysis;filtering, clustering, clustering;, compression;data, distance;covariance, Lloyd, matrices;filtering, quantization;data, segmentation;k-means, squared, structure;data-sensitive, theory;pattern}, isbn = {0162-8828}, doi = {10.1109/TPAMI.2002.1017616}, author = {Kanungo,T. and Mount, Dave and Netanyahu,N. S and Piatko,C. D and Silverman,R. and Wu,A. Y} } @inbook {17817, title = {Error-Tolerant Agents}, booktitle = {Computational Logic: Logic Programming and BeyondComputational Logic: Logic Programming and Beyond}, series = {Lecture Notes in Computer Science}, volume = {2407}, year = {2002}, month = {2002///}, pages = {83 - 104}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {The use of agents in today{\textquoteright}s Internet world is expanding rapidly. Yet, agent developers proceed largely under the optimistic assumption that agents will be error-free. Errors may arise in agents for numerous reasons {\textemdash} agents may share a workspace with other agents or humans and updates made by these other entities may cause an agent to face a situation that it was not explicitly programmed to deal with. Likewise, errors in coding agents may lead to inconsistent situations where it is unclear how the agent should act. In this paper, we define an agent execution model that allows agents to continue acting {\textquotedblleft}reasonably{\textquotedblright} even when some errors of the above types occur. More importantly, in our framework, agents take {\textquotedblleft}repair{\textquotedblright} actions automatically when confronted with such situations, but while taking such repair actions, they can often continue to engage in work and/or interactions with other agents that are unaffected by repairs.}, keywords = {Computer, Science}, isbn = {978-3-540-43959-2}, url = {http://dx.doi.org/10.1007/3-540-45628-7_22}, author = {Eiter,Thomas and Mascardi,Viviana and Subrahmanian,V.}, editor = {Kakas,Antonis and Sadri,Fariba} } @article {18974, title = {Evidence for a Plastid Origin of Plant Ethylene Receptor Genes}, journal = {Plant PhysiologyPlant Physiol.}, volume = {130}, year = {2002}, month = {2002/09/01/}, pages = {10 - 14}, isbn = {0032-0889, 1532-2548}, doi = {10.1104/pp.005397}, url = {http://www.plantphysiol.org/content/130/1/10}, author = {Mount, Stephen M. and Chang,Caren} } @conference {14695, title = {Experiences with capsule-based active networking}, booktitle = {DARPA Active NEtworks Conference and Exposition, 2002. Proceedings}, year = {2002}, month = {2002///}, pages = {16 - 24}, publisher = {IEEE}, organization = {IEEE}, abstract = {Active networking adds programmability to the elements of the network, most aggressively by using programmable packets, or capsules. ANTS [22, 21] and PLANet [10, 8] are the most mature examples of capsule-based systems, both having been publicly available for several years. This paper presents our experience with these systems and the lessons they hold for the future of capsule-based active networking. The paper focuses on four key issues: flexibility, performance, security, and usability. We consider how ANTS and PLANet address these issues, noting that despite substantial surface differences, both systems identify similar key problems and use closely related solutions. Based on our experience with these systems we conclude that capsule-based systems can achieve useful levels of flexibility, performance, and usability. Many aspects of security can also be adequately addressed, but some important problems related to denial of service remain as open problems}, keywords = {active networking, ANTS, application-specific routing, capsule architecture, capsule-based systems, computer crime, Computer network management, Computer networks, Computer science, Contracts, Electronic switching systems, INFORMATION SCIENCE, Internet, internetworking, network management, PLANet, Planets, programmability, programmable packets, Programming, Security, Standards development, telecommunication network routing, usability}, isbn = {0-7695-1564-9}, doi = {10.1109/DANCE.2002.1003481}, author = {Hicks, Michael W. and Moore,J. T and Wetherall,D. and Nettles,S.} } @conference {13293, title = {Extraction of Critical Nets Based on a Discrete Gradient Vector Field}, booktitle = {Proceedings of Eurographics}, year = {2002}, month = {2002///}, abstract = {In this paper we address the problem of representing the topology of discrete scalar fieldsdefined on triangulated domains in two and three dimensions. To this aim, we use the notion of discrete gradient vector field that we have introduced in [3] to classify critical points and extract a critical net representing the main features of a scalar field defined on a two-dimensional domain. The nature of the critical points provided by the discrete gradient vector field is quite different from those obtained in the differentiable case. Thus, we show that our critical net generalizes classical critical nets corresponding to (the classical differentiable) Morse functions. }, author = {De Floriani, Leila and Mesmoudi,M. M. and Danovaro,E.} } @article {18814, title = {An extraction-based verification methodology for MEMS}, journal = {Microelectromechanical Systems, Journal of}, volume = {11}, year = {2002}, month = {2002/02//}, pages = {2 - 11}, abstract = {Micromachining techniques are being increasingly used to develop miniaturized sensor and actuator systems. These system designs tend to be captured as layout, requiring extraction of the equivalent microelectromechanical circuit as a necessary step for design verification. This paper presents an extraction methodology to (re-)construct a circuit schematic representation from the layout, enabling the designer to use microelectromechanical circuit simulators to verify the functional behavior of the layout. This methodology uses a canonical representation of the given layout on which feature-based and graph-based recognition algorithms are applied to generate the equivalent extracted schematic. Extraction can be performed to either the atomic level or the functional level representation of the reconstructed circuit. The choice of level in hierarchy is governed by the trade off between simulation time and simulation accuracy of the extracted circuit. The combination of the MEMS layout extraction and lumped-parameter circuit simulation provides MEMS designers with VLSI-like tools enabling faster design cycles, and improved design productivity}, keywords = {atomic level, canonical representation, circuit schematic representation, circuit simulation, design cycles, design productivity, design verification, digital simulation, equivalent circuits, equivalent microelectromechanical circuit, extraction-based verification methodology, feature-based recognition algorithms, functional behavior, functional level, graph-based recognition algorithms, layout extraction, lumped parameter networks, lumped-parameter circuit simulation, MEMS, microelectromechanical circuit simulators, micromachining techniques, micromechanical devices, simulation accuracy, simulation time}, isbn = {1057-7157}, doi = {10.1109/84.982857}, author = {Baidya,B. and Gupta,S.K. and Mukherjee,T.} } @conference {17178, title = {Getting real about speech: overdue or overhyped?}, booktitle = {CHI {\textquoteright}02 extended abstracts on Human factors in computing systems}, series = {CHI EA {\textquoteright}02}, year = {2002}, month = {2002///}, pages = {708 - 709}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Speech has recently made headway towards becoming a more mainstream interface modality. For example, there is an increasing number of call center applications, especially in the airline and banking industries. However, speech still has many properties that cause its use to be problematic, such as its inappropriateness in both very quiet and very noisy environments, and the tendency of speech to increase cognitive load. Concerns about such problems are valid; however, they do not explain why the use of speech is so controversial in the HCI community. This panel would like to address the issues underlying the controversy around speech, by discussing the current state of the art, the reasons it is so difficult to build a good speech interface, and how HCI research can contribute to the development of speech interfaces.}, keywords = {cognitive load, social responses, speech interfaces}, isbn = {1-58113-454-1}, doi = {10.1145/506443.506557}, url = {http://doi.acm.org/10.1145/506443.506557}, author = {James,Frankie and Lai,Jennifer and Suhm,Bernhard and Balentine,Bruce and Makhoul,John and Nass,Clifford and Shneiderman, Ben} } @conference {13047, title = {GLEANS: A generator of logical extracts and abstracts for nice summaries}, booktitle = {Workshop on Automatic Summarization}, year = {2002}, month = {2002///}, pages = {9 - 14}, author = {Daum{\'e}, Hal and Echihabi,A. and Marcu,D. and Munteanu,D. and Soricut,R.} } @article {15438, title = {GUI testing: Pitfalls and process}, journal = {IEEE Computer}, volume = {35}, year = {2002}, month = {2002///}, pages = {87 - 88}, author = {Memon, Atif M.} } @conference {13053, title = {The importance of lexicalized syntax models for natural language generation tasks}, booktitle = {Proc. of INLG}, year = {2002}, month = {2002///}, pages = {9 - 16}, author = {Daum{\'e}, Hal and Knight,K. and Langkilde-Geary,I. and Marcu,D. and Yamada,K.} } @conference {17539, title = {Inferring link weights using end-to-end measurements}, booktitle = {Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment}, series = {IMW {\textquoteright}02}, year = {2002}, month = {2002///}, pages = {231 - 236}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {We describe a novel constraint-based approach to approximate ISP link weights using only end-to-end measurements. Common routing protocols such as OSPF and IS-IS choose least-cost paths using link weights, so inferred weights provide a simple, concise, and useful model of intradomain routing. Our approach extends router-level ISP maps, which include only connectivity, with link weights that are consistent with routing. Our inferred weights agree well with observed routing: while our inferred weights fully characterize the set of shortest paths between 84--99\% of the router-pairs, alternative models based on hop count and latency do so for only 47--81\% of the pairs.}, isbn = {1-58113-603-X}, doi = {10.1145/637201.637237}, url = {http://doi.acm.org/10.1145/637201.637237}, author = {Mahajan,Ratul and Spring, Neil and Wetherall,David and Anderson,Tom} } @conference {12143, title = {Lessons learned from 25 years of process improvement: the rise and fall of the NASA software engineering laboratory}, booktitle = {Proceedings of the 24th International Conference on Software Engineering}, series = {ICSE {\textquoteright}02}, year = {2002}, month = {2002///}, pages = {69 - 79}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {For 25 years the NASA/GSFC Software Engineering Laboratory (SEL) has been a major resource in software process improvement activities. But due to a changing climate at NASA, agency reorganization, and budget cuts, the SEL has lost much of its impact. In this paper we describe the history of the SEL and give some lessons learned on what we did right, what we did wrong, and what others can learn from our experiences. We briefly describe the research that was conducted by the SEL, describe how we evolved our understanding of software process improvement, and provide a set of lessons learned and hypotheses that should enable future groups to learn from and improve on our quarter century of experiences.}, isbn = {1-58113-472-X}, doi = {10.1145/581339.581351}, url = {http://doi.acm.org/10.1145/581339.581351}, author = {Basili, Victor R. and McGarry,Frank E. and Pajerski,Rose and Zelkowitz, Marvin V} } @conference {13582, title = {Lexicon Acquisition from Bilingual Dictionaries}, booktitle = {SPIEPhotonic West Electronic Imaging Conference}, year = {2002}, month = {2002///}, pages = {37 - 48}, author = {David Doermann and Ma,H. and Karagol-Ayan,B. and Oard, Douglas} } @conference {15624, title = {A local search approximation algorithm for k-means clustering}, booktitle = {Proceedings of the eighteenth annual symposium on Computational geometry}, series = {SCG {\textquoteright}02}, year = {2002}, month = {2002///}, pages = {10 - 18}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {In k-means clustering we are given a set of n data points in d-dimensional space Rd and an integer k, and the problem is to determine a set of k points in {\'O}C;d, called centers, to minimize the mean squared distance from each data point to its nearest center. No exact polynomial-time algorithms are known for this problem. Although asymptotically efficient approximation algorithms exist, these algorithms are not practical due to the extremely high constant factors involved. There are many heuristics that are used in practice, but we know of no bounds on their performance.We consider the question of whether there exists a simple and practical approximation algorithm for k-means clustering. We present a local improvement heuristic based on swapping centers in and out. We prove that this yields a (9+\&egr;)-approximation algorithm. We show that the approximation factor is almost tight, by giving an example for which the algorithm achieves an approximation factor of (9-\&egr;). To establish the practical value of the heuristic, we present an empirical study that shows that, when combined with Lloyd{\textquoteright}s algorithm, this heuristic performs quite well in practice.}, keywords = {Approximation algorithms, clustering, computational geometry, k-means, local search}, isbn = {1-58113-504-1}, doi = {10.1145/513400.513402}, url = {http://doi.acm.org/10.1145/513400.513402}, author = {Kanungo,Tapas and Mount, Dave and Netanyahu,Nathan S. and Piatko,Christine D. and Silverman,Ruth and Wu,Angela Y.} } @article {16477, title = {Locating and accessing data repositories with WebSemantics}, journal = {The VLDB journal}, volume = {11}, year = {2002}, month = {2002///}, pages = {47 - 57}, author = {Mihaila,G. A and Raschid, Louiqa and Tomasic,A.} } @article {15511, title = {A logic-based approach to data integration}, journal = {Theory Pract. Log. Program.}, volume = {2}, year = {2002}, month = {2002/05//}, pages = {323 - 368}, abstract = {An important aspect of data integration involves answering queries using various resources rather than by accessing database relations. The process of transforming a query from the database relations to the resources is often referred to as query folding or answering queries using views, where the views are the resources. We present a uniform approach that includes as special cases much of the previous work on this subject. Our approach is logic-based using resolution. We deal with integrity constraints, negation, and recursion also within this framework.}, keywords = {Clark completion, Data integration, materialized views, query folding, resolution method, stratified databases}, isbn = {1471-0684}, doi = {10.1017/S1471068401001375}, url = {http://dx.doi.org/10.1017/S1471068401001375}, author = {Grant,John and Minker, Jack} } @conference {17520, title = {Measuring ISP topologies with Rocketfuel}, booktitle = {ACM SIGCOMM Computer Communication Review}, volume = {32}, year = {2002}, month = {2002///}, pages = {133 - 145}, author = {Spring, Neil and Mahajan,R. and Wetherall,D.} } @article {18240, title = {Methods and apparatus for multi-layer data hiding}, volume = {:~09/427,321}, year = {2002}, month = {2002/09/24/}, abstract = {A data hiding system and method for providing a method of embedding multiple layers of hidden data into multimedia data. First, a media unit of the multimedia data is evaluated to determine an appropriate embedding procedure. Next during a first embedding pass, a ruling layer of primary hidden data is embedded into the media unit. In another embedding pass, a governing layer of secondary hidden data is embedded on top of the ruling layer. The secondary hidden data provides control information for controlling the primary hidden data and the host data. Control information such as error correction data, synchronization data, decoding data, and authentication data is embedded in the governing layer. Embedding schemes such as base domain and spectrum domain embedding are employed.}, url = {http://www.google.com/patents?id=1KYLAAAAEBAJ}, author = {Yu,Hong Heather and M. Wu and Li,Xin and Gelman,Alexander D.}, editor = {Matsushita Electric Industrial Co., Ltd.} } @article {13314, title = {Multiresolution mesh representation: Models and data structures}, journal = {Tutorials on Multiresolution in Geometric Modelling}, year = {2002}, month = {2002///}, pages = {363 - 418}, abstract = {Multiresolution meshes are a common basis for building representationsof a geometric shape at different levels of detail. The use of the term multiresolu- tion depends on the remark that the accuracy (or, level of detail) of a mesh in approximating a shape is related to the mesh resolution, i.e., to the density (size and number) of its cells. A multiresolution mesh provides several alternative mesh- based approximations of a spatial object (e.g., a surface describing the boundary of a solid object, or the graph of a scalar field). A multiresolution mesh is a collection of mesh fragments, describing usually small portions of a spatial object with different accuracies, plus suitable relations that allow selecting a subset of fragments (according to user-defined accuracy crite- ria), and combining them into a mesh covering the whole object, or an object part. Existing multiresolution models differ in the type of mesh fragments they consider and in the way they define relations among such fragments. In this chapter, we introduce a framework for multiresolution meshes in order to analyze and compare existing models proposed in the literature on a common basis. We have identified two sets of basic queries on a multiresolution meshes, that we call selective refinement and spatial selection. We describe two approaches for answering such queries, and discuss the primitives involved in them, which must be efficiently supported by any data structure implementing a multiresolution mesh. We then describe and analyze data structures proposed in the literature for encoding multiresolution meshes. }, author = {De Floriani, Leila and Magillo,P.} } @article {14090, title = {A new, expressed multigene family containing a hot spot for insertion of retroelements is associated with polymorphic subtelomeric regions of Trypanosoma brucei}, journal = {Eukaryotic cell}, volume = {1}, year = {2002}, month = {2002///}, pages = {137 - 137}, author = {Bringaud,F. and Biteau,N. and Melville,S. E. and Hez,S. and El-Sayed, Najib M. and Leech,V. and Berriman,M. and Hall,N. and Donelson,J. E and Baltz,T.} } @conference {13061, title = {A noisy-channel model for document compression}, booktitle = {Proceedings of the 40th Annual Meeting on Association for Computational Linguistics}, series = {ACL {\textquoteright}02}, year = {2002}, month = {2002///}, pages = {449 - 456}, publisher = {Association for Computational Linguistics}, organization = {Association for Computational Linguistics}, address = {Stroudsburg, PA, USA}, abstract = {We present a document compression system that uses a hierarchical noisy-channel model of text production. Our compression system first automatically derives the syntactic structure of each sentence and the overall discourse structure of the text given as input. The system then uses a statistical hierarchical model of text production in order to drop non-important syntactic and discourse constituents so as to generate coherent, grammatical document compressions of arbitrary length. The system outperforms both a baseline and a sentence-based compression system that operates by simplifying sequentially all sentences in a text. Our results support the claim that discourse knowledge plays an important role in document summarization.}, doi = {10.3115/1073083.1073159}, url = {http://dx.doi.org/10.3115/1073083.1073159}, author = {Daum{\'e}, Hal and Marcu,Daniel} } @conference {13319, title = {Non-manifold decomposition in arbitrary dimensions}, booktitle = {Discrete Geometry for Computer Imagery}, year = {2002}, month = {2002///}, pages = {59 - 115}, abstract = {In this paper we consider the problem of decomposing a nonmanifold n-dimensional object described by an abstract simplicial complex into an assembly of {\textquoteleft}more-regular{\textquoteright} components. Manifolds, which would be natural candidates for components, cannot be used to this aim in high dimensions because they are not decidable sets. Therefore, we define d-quasi-manifolds, a decidable superset of the class of combinatorial d-manifolds that coincides with d-manifolds in dimension less or equal than two. We first introduce the notion of d-quasi-manifold complexes, then we sketch an algorithm to decompose an arbitrary complex into an assembly of quasi-manifold components abutting at non-manifold joints. This result provides a rigorous starting point for our future work, which includes designing efficient data structures for non-manifold modeling, as well as defining a notion of measure of shape complexity of such models.}, doi = {10.1007/3-540-45986-3_6}, author = {De Floriani, Leila and Mesmoudi,M. and Morando,F. and Puppo,E.} } @article {15299, title = {Omnibase: Uniform access to heterogeneous data for question answering}, journal = {Natural Language Processing and Information Systems}, year = {2002}, month = {2002///}, pages = {230 - 234}, abstract = {Although the World Wide Web contains a tremendous amount of information, the lack of uniform structure makes finding the right knowledge difficult. A solution is to turn the Web into a {\textquotedblleft}virtual database{\textquotedblright} and to access it through natural language.We built Omnibase, a system that integrates heterogeneous data sources using an object- property-value model. With the help of Omnibase, our Start natural language system can now access numerous heterogeneous data sources on the Web in a uniform manner, and answers millions of user questions with high precision.}, doi = {10.1007/3-540-36271-1_23}, author = {Katz,B. and Felshin,S. and Yuret,D. and Ibrahim,A. and Jimmy Lin and Marton,G. and Jerome McFarland,A. and Temelkuran,B.} } @article {12121, title = {An operational process for goal-driven definition of measures}, journal = {Software Engineering, IEEE Transactions on}, volume = {28}, year = {2002}, month = {2002/12//}, pages = {1106 - 1125}, abstract = {We propose an approach (GOM/MEDEA) for defining measures of product attributes in software engineering. The approach is driven by the experimental goals of measurement, expressed via the GQM paradigm, and a set of empirical hypotheses. To make the empirical hypotheses quantitatively verifiable, GQM/MEDEA supports the definition of theoretically valid measures for the attributes of interest based on their expected mathematical properties. The empirical hypotheses are subject to experimental verification. This approach integrates several research contributions from the literature into a consistent, practical, and rigorous approach.}, keywords = {attributes;, definition;, development, empirical, engineering;, expected, experimental, goal-driven, GQM, GQM/MEDEA;, hypotheses;, management;, mathematical, measure, measurement;, metrics;, operational, paradigm;, process;, Product, properties;, quality;, software, verification;}, isbn = {0098-5589}, doi = {10.1109/TSE.2002.1158285}, author = {Briand,L.C. and Morasca,S. and Basili, Victor R.} } @article {12748, title = {Optimal edge-based shape detection}, journal = {Image Processing, IEEE Transactions on}, volume = {11}, year = {2002}, month = {2002/11//}, pages = {1209 - 1227}, abstract = {We propose an approach to accurately detecting two-dimensional (2-D) shapes. The cross section of the shape boundary is modeled as a step function. We first derive a one-dimensional (1-D) optimal step edge operator, which minimizes both the noise power and the mean squared error between the input and the filter output. This operator is found to be the derivative of the double exponential (DODE) function, originally derived by Ben-Arie and Rao (1994). We define an operator for shape detection by extending the DODE filter along the shape{\textquoteright}s boundary contour. The responses are accumulated at the centroid of the operator to estimate the likelihood of the presence of the given shape. This method of detecting a shape is in fact a natural extension of the task of edge detection at the pixel level to the problem of global contour detection. This simple filtering scheme also provides a tool for a systematic analysis of edge-based shape detection. We investigate how the error is propagated by the shape geometry. We have found that, under general assumptions, the operator is locally linear at the peak of the response. We compute the expected shape of the response and derive some of its statistical properties. This enables us to predict both its localization and detection performance and adjust its parameters according to imaging conditions and given performance specifications. Applications to the problem of vehicle detection in aerial images, human facial feature detection, and contour tracking in video are presented.}, keywords = {1D, 2D, aerial, analysis;, boundary, conditions;, contour, cross, detection;, DODE, double, edge, edge-based, error, error;, exponential, extraction;, facial, feature, filter, filter;, Filtering, function;, geometry;, global, human, images;, imaging, localization, mean, methods;, NOISE, operator;, optimal, optimisation;, output;, performance;, pixel;, power;, propagation;, properties;, section;, SHAPE, square, squared, statistical, step, theory;, tracking;, two-dimensional, vehicle, video;}, isbn = {1057-7149}, doi = {10.1109/TIP.2002.800896}, author = {Moon, H. and Chellapa, Rama and Rosenfeld, A.} } @conference {13618, title = {Page classification through logical labelling}, booktitle = {Pattern Recognition, 2002. Proceedings. 16th International Conference on}, volume = {3}, year = {2002}, month = {2002///}, pages = {477 - 480 vol.3 - 477 - 480 vol.3}, abstract = {We propose an integrated approach to page classification and logical labelling. Layout is represented by a fully connected attributed relational graph that is matched to the graph of an unknown document, achieving classification and labelling simultaneously. By incorporating global constraints in an integrated fashion, ambiguity at the zone level can be reduced, providing robustness to noise and variation. Models are automatically trained from sample documents. Experimental results show promise for the classification and labelling of technical article title pages, and supports the idea of a hierarchical model base.}, keywords = {article, attributed, base;, character, classification;, constraints;, document, document;, experimental, global, graph, graph;, hierarchical, image, images;, labelling;, logical, model, noise;, OCR;, optical, page, pages;, processing;, recognition;, relational, results;, technical, theory;, title, unknown}, doi = {10.1109/ICPR.2002.1047980}, author = {Liang,Jian and David Doermann and Ma,M. and Guo,J. K} } @article {15540, title = {Partitioning planar graphs with costs and weights}, journal = {4th International Workshop on Algorithm Engineering and Experiments}, volume = {2409}, year = {2002}, month = {2002///}, pages = {98 - 110}, abstract = {A graph separator is a set of vertices or edges whose removal divides an input graph into components of bounded size. This paper describes new algorithms for computing separators in planar graphs as well as techniques that can be used to speed up their implementation and improve the partition quality. In particular, we consider planar graphs with costs and weights on the vertices, where weights are used to estimate the sizes of the components and costs are used to estimate the size of the separator. We show that one can find a small separator that divides the graph into components of bounded size. We describe implementations of the partitioning algorithms and discuss results of our experiments.}, author = {Mount, Dave and Stein,C.} } @article {13459, title = {PASSAT: A user-centric planning framework}, journal = {Proceedings of the 3rd International NASA Workshop on Planning and Scheduling for Space}, year = {2002}, month = {2002///}, abstract = {We describe a plan-authoring system called PASSAT (Plan-Authoring System based on Sketches, Advice, and Templates) that combines interactive tools for constructing plans with a suite of automated and mixed-initiative capabilities designed to complement human planning skills. PASSAT is organized around a library of predefined templates that encode task networks describing standard operating procedures and previous cases. Users can select from these templates to apply during plan development, with the system providing various forms of automated assistance. A mixed-initiative plan sketch facility helps users refine outlines for plans to complete solutions, by detecting problems and proposing possible fixes. An advice capability enables user specification of high-level guidelines for plans that the system helps to enforce. Finally, PASSAT includes process facilitation mechanisms designed to help a user track and manage outstanding planning tasks and information requirements, as a means of improving the efficiency and effectiveness of the planning process. PASSAT is designed for applications for which a core of planning knowledge can be captured in predefined action models but where significant user control of the planning process is required. }, author = {Myers,K.L. and Tyson,W.M. and Wolverton,M.J. and Jarvis,P.A. and Lee,T.J. and desJardins, Marie} } @article {12754, title = {Performance analysis of a simple vehicle detection algorithm}, journal = {Image and Vision Computing}, volume = {20}, year = {2002}, month = {2002/01/01/}, pages = {1 - 13}, abstract = {We have performed an end-to-end analysis of a simple model-based vehicle detection algorithm for aerial parking lot images. We constructed a vehicle detection operator by combining four elongated edge operators designed to collect edge responses from the sides of a vehicle. We derived the detection and localization performance of this algorithm, and verified them by experiments. Performance degradation due to different camera angles and illuminations was also examined using simulated images. Another important aspect of performance characterization {\textemdash} whether and how much prior information about the scene improves performance {\textemdash} was also investigated. As a statistical diagnostic tool for the detection performance, a computational approach employing bootstrap was used.}, keywords = {Aerial image, Bootstrap, empirical evaluation, Performance analysis, Vehicle detection}, isbn = {0262-8856}, doi = {10.1016/S0262-8856(01)00059-2}, url = {http://www.sciencedirect.com/science/article/pii/S0262885601000592}, author = {Moon, H. and Chellapa, Rama and Rosenfeld, A.} } @conference {13623, title = {Performance evaluation of object detection algorithms}, booktitle = {Pattern Recognition, 2002. Proceedings. 16th International Conference on}, volume = {3}, year = {2002}, month = {2002///}, pages = {965 - 969 vol.3 - 965 - 969 vol.3}, abstract = {The continuous development of object detection algorithms is ushering in the need for evaluation tools to quantify algorithm performance. In this paper a set of seven metrics are proposed for quantifying different aspects of a detection algorithm{\textquoteright}s performance. The strengths and weaknesses of these metrics are described. They are implemented in the Video Performance Evaluation Resource (ViPER) system and will be used to evaluate algorithms for detecting text, faces, moving people and vehicles. Results for running two previous text-detection algorithms on a common data set are presented.}, keywords = {algorithms;, common, data, DETECTION, detection;, Evaluation, evaluation;, image, object, performance, recognition;, resource, set;, system;, text-detection, video}, doi = {10.1109/ICPR.2002.1048198}, author = {Mariano,V.Y. and Min,Junghye and Park,Jin-Hyeong and Kasturi,R. and Mihalcik,D. and Huiping Li and David Doermann and Drayer,T.} } @article {15399, title = {Perturbation technique for LLG dynamics in uniformly magnetized bodies subject to RF fields}, journal = {Magnetics, IEEE Transactions on}, volume = {38}, year = {2002}, month = {2002/09//}, pages = {2403 - 2405}, abstract = {The problem of magnetization dynamics of a uniformly magnetized uniaxial particle or film, under elliptically polarized applied field, is considered. In the special case of circularly polarized applied field and particles (films) with a symmetry axis, pure time-harmonic magnetization modes exist that can be computed analytically. Deviations from these highly symmetric conditions are treated as perturbation of the symmetric case. The perturbation technique leads to the exactly solvable system of linear differential equations for the perturbations which enables one to compute higher order magnetization harmonic. The analytical solutions are obtained and then compared with numerical results.}, keywords = {analytical, anisotropy, anisotropy;, applied, bodies;, circularly, component;, constant-in-time, constant;, damping, demagnetisation;, demagnetizing, differential, dynamics;, effective, elliptically, equation;, equations;, exactly, factors;, field;, film;, films;, Frequency, gyromagnetic, harmonic;, higher, Landau-Lifshitz-Gilbert, large, linear, magnetic, magnetisation;, magnetization, magnetization;, magnetized, modes;, MOTION, order, partial, particle;, particles;, perturbation, polarized, radio, ratio;, RF, saturation, solution;, solvable, system;, technique;, techniques;, thin, time-harmonic, uniaxial, uniformly}, isbn = {0018-9464}, doi = {10.1109/TMAG.2002.803596}, author = {Bertotti,G. and Mayergoyz, Issak D and Serpico,C.} } @conference {13906, title = {Physical Programming: Designing Tools for Children to Create Physical Interactive}, booktitle = {Proceedings: SIGCHI}, year = {2002}, month = {2002///}, author = {Montemayor,J. and Druin, Allison and Farber,A. and Simms,S. and Churaman,W.} } @conference {18917, title = {Planning in a multi-agent environment: theory and practice}, series = {AAMAS {\textquoteright}02}, year = {2002}, month = {2002///}, pages = {944 - 945}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {We give the theoretical foundations and empirical evaluation of a planning agent, shop, performing HTN planning in a multi-agent environment. shop is based on A-SHOP, an agentized version of the original SHOP HTN planning algorithm, and is integrated in the IMPACT multi-agent environment. We ran several experiments involving accessing various distributed, heterogeneous information sources, based on simplified versions of noncombatant evacuation operations, NEO{\textquoteright}s. As a result, we noticed that in such realistic settings the time spent on communication (including network time) is orders of magnitude higher than the actual inference process. This has important consequences for optimizations of such planners. Our main results are: (1) using NEO{\textquoteright}s as new, more realistic benchmarks for planners acting in an agent environment, and (2) a memoization mechanism implemented on top of shop, which improves the overall performance in a significant way.}, keywords = {agent architectures, agent selection and planning, formalisms and logics}, isbn = {1-58113-480-0}, doi = {10.1145/544862.544960}, url = {http://doi.acm.org/10.1145/544862.544960}, author = {Dix,J{\"u}rgen and Mu{\~n}oz-Avila,H{\'e}ctor and Nau, Dana S. and Zhang,Lingling} } @article {15612, title = {Ray interpolants for fast raytracing reflections and refractions}, journal = {Journal of WSCG (Proc. International Conf. in Central Europe on Comp. Graph., Visualization and Comp. Vision)}, volume = {10}, year = {2002}, month = {2002///}, pages = {1 - 8}, abstract = {To render an object by ray tracing, one or more rays are shot from the viewpoint through every pixel ofthe image plane. For reflective and refractive objects, especially for multiple levels of reflections and/or refractions, this requires many expensive intersection calculations. This paper presents a new method for accelerating ray-tracing of reflective and refractive objects by substituting accurate-but-slow intersection calculations with approximate-but-fast interpolation computations. Our approach is based on modeling the reflective/refractive object as a function that maps input rays entering the object to output rays exiting the object. We are interested in computing the output ray without actually tracing the input ray through the object. This is achieved by adaptively sampling rays from multiple viewpoints in various directions, as a preprocessing phase, and then interpolating the collection of nearby samples to compute an approximate output ray for any input ray. In most cases, object boundaries and other discontinuities are handled by ap- plying various heuristics. In cases where we cannot find sufficient evidence to interpolate, we perform ray tracing as a last resort. We provide performance studies to demonstrate the efficiency of this method. }, author = {Atalay,F. B and Mount, Dave} } @book {14636, title = {RECOMB {\textquoteright}02: Proceedings of the sixth annual international conference on Computational biology}, year = {2002}, month = {2002///}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {The papers in this volume were presented at the Sixth Annual International Conference on Computational Biology RECOMB 2002, held in Washington, D.C. on April 18-21, 2002. The RECOMB series was started in 1997 by Sorin Istrail, Pavel Pevzner and Michael Waterman. RECOMB {\textquoteright}99 took place in Lyon, France, RECOMB 2000 was held in Tokyo, Japan, and RECOMB 2001 was held in Montreal, Quebec, Canada.This year{\textquoteright}s call for papers gave rise to 118 submissions, out of which the program committee selected 35 papers to be presented at the conference and included in the proceedings. Each submission was refereed by at least three members of the program committee. After the completion of the referees{\textquoteright} reports, an extensive web-based discussion took place.RECOMB 2002 had 8 invited speakers: Ruben Abagyan (The Scripps Research Institute), Ali H. Brivanlou (Rockefeller University), Evan Eichler (Case Western Reserve University), Harold "Skip" Garner (University of Texas Southwestern Medical Center at Dallas), David Ho (Rockefeller University), Gerry Rubin (Howard Hughes Medical Institute), J. Craig Venter (Celera) and Marc Vidal (Dana-Farber Cancer Institute). The Stanislaw Ulam Memorial Lecture was given by J. Craig Venter. The Distinguished Biology Lecture was given by David Ho. The Distinguished New Technologies Lecture was given by Harold Garner.Complete final versions of many of the papers presented in the conference will appear in a special issue of the Journal of Computational Biology, which is closely affiliated with the conference.}, isbn = {1-58113-498-3}, editor = {Myers,Gene and Hannenhalli, Sridhar and Sankoff,David and Istrail,Sorin and Pevzner,Pavel and Waterman,Michael} } @article {14726, title = {Region-based memory management in cyclone}, journal = {SIGPLAN Not.}, volume = {37}, year = {2002}, month = {2002/05//}, pages = {282 - 293}, abstract = {Cyclone is a type-safe programming language derived from C. The primary design goal of Cyclone is to let programmers control data representation and memory management without sacrificing type-safety. In this paper, we focus on the region-based memory management of Cyclone and its static typing discipline. The design incorporates several advancements, including support for region subtyping and a coherent integration with stack allocation and a garbage collector. To support separate compilation, Cyclone requires programmers to write some explicit region annotations, but a combination of default annotations, local type inference, and a novel treatment of region effects reduces this burden. As a result, we integrate C idioms in a region-based framework. In our experience, porting legacy C to Cyclone has required altering about 8\% of the code; of the changes, only 6\% (of the 8\%) were region annotations.}, isbn = {0362-1340}, doi = {10.1145/543552.512563}, url = {http://doi.acm.org/10.1145/543552.512563}, author = {Grossman,Dan and Morrisett,Greg and Jim,Trevor and Hicks, Michael W. and Wang,Yanling and Cheney,James} } @conference {13321, title = {Regular and irregular multi-resolution terrain models: a comparison}, booktitle = {Proceedings of the 10th ACM international symposium on Advances in geographic information systems}, series = {GIS {\textquoteright}02}, year = {2002}, month = {2002///}, pages = {143 - 148}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {The paper deals with the problem of modeling large-size terrain data sets. To this aim, we consider multi-resolution models based on triangle meshes. We analyze and compare two multi-resolution terrain models based on regular and irregular meshes. The two models are viewed as instances of a common multi-resolution model, that we call a multi-resolution triangle mesh. Our comparison takes into account the space requirements of the data structures implementing the two models as well their effectiveness in supporting the extraction of variable-resolution terrain representations.}, keywords = {Multi-resolution, regular and irregular structures, terrain models}, isbn = {1-58113-591-2}, doi = {10.1145/585147.585178}, url = {http://doi.acm.org/10.1145/585147.585178}, author = {De Floriani, Leila and Magillo,Paola} } @conference {13272, title = {A Smale-like decomposition for discrete scalar fields}, booktitle = {Pattern Recognition, 2002. Proceedings. 16th International Conference on}, volume = {1}, year = {2002}, month = {2002///}, pages = {184 - 187 vol.1 - 184 - 187 vol.1}, abstract = {In this paper we address the problem of representing the structure of the topology of a d-dimensional scalar field as a basis for constructing a multiresolution representation of the structure of such afield. To this aim, we define a discrete decomposition of a triangulated d-dimensional domain, on whose vertices the values of the field are given. We extend a Smale decomposition, defined by Thom (1949) and Smale (1960) for differentiable functions, to the discrete case, to what we call a Smale-like decomposition. We introduce the notion of discrete gradient vector field, which indicates the growth of the scalar field and matches with our decomposition. We sketch an algorithm for building a Smale-like decomposition and a graph-based representation of this decomposition. We present results for the case of two-dimensional fields.}, keywords = {data, decomposition;, differentiable, discrete, domain;, field;, fields;, functions;, gradient, graph-based, methods;, multidimensional, multiresolution, representation;, scalar, Smale-like, structure, Topology, triangulated, vector, visualisation;}, doi = {10.1109/ICPR.2002.1044644}, author = {De Floriani, Leila and Mesmoudi,M. M. and Danovaro,E.} } @conference {15643, title = {Space-efficient approximate Voronoi diagrams}, booktitle = {Proceedings of the thiry-fourth annual ACM symposium on Theory of computing}, series = {STOC {\textquoteright}02}, year = {2002}, month = {2002///}, pages = {721 - 730}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {(MATH) Given a set $S$ of $n$ points in $\IR^d$, a {\em $(t,\epsilon)$-approximate Voronoi diagram (AVD)} is a partition of space into constant complexity cells, where each cell $c$ is associated with $t$ representative points of $S$, such that for any point in $c$, one of the associated representatives approximates the nearest neighbor to within a factor of $(1+\epsilon)$. Like the Voronoi diagram, this structure defines a spatial subdivision. It also has the desirable properties of being easy to construct and providing a simple and practical data structure for answering approximate nearest neighbor queries. The goal is to minimize the number and complexity of the cells in the AVD.(MATH) We assume that the dimension $d$ is fixed. Given a real parameter $\gamma$, where $2 \le \gamma \le 1/\epsilon$, we show that it is possible to construct a $(t,\epsilon)$-AVD consisting of \[O(n \epsilon^{\frac{d-1}{2}} \gamma^{\frac{3(d-1)}{2}} \log \gamma) \] cells for $t = O(1/(\epsilon \gamma)^{(d-1)/2})$. This yields a data structure of $O(n \gamma^{d-1} \log \gamma)$ space (including the space for representatives) that can answer $\epsilon$-NN queries in time $O(\log(n \gamma) + 1/(\epsilon \gamma)^{(d-1)/2})$. (Hidden constants may depend exponentially on $d$, but do not depend on $\epsilon$ or $\gamma$).(MATH) In the case $\gamma = 1/\epsilon$, we show that the additional $\log \gamma$ factor in space can be avoided, and so we have a data structure that answers $\epsilon$-approximate nearest neighbor queries in time $O(\log (n/\epsilon))$ with space $O(n/\epsilon^{d-1})$, improving upon the best known space bounds for this query time. In the case $\gamma = 2$, we have a data structure that can answer approximate nearest neighbor queries in $O(\log n + 1/\epsilon^{(d-1)/2})$ time using optimal $O(n)$ space. This dramatically improves the previous best space bound for this query time by a factor of $O(1/\epsilon^{(d-1)/2})$.(MATH) We also provide lower bounds on the worst-case number of cells assuming that cells are axis-aligned rectangles of bounded aspect ratio. In the important extreme cases $\gamma \in \{2, 1/\epsilon\}$, our lower bounds match our upper bounds asymptotically. For intermediate values of $\gamma$ we show that our upper bounds are within a factor of $O((1/\epsilon)^{(d-1)/2}\log \gamma)$ of the lower bound.}, isbn = {1-58113-495-9}, doi = {10.1145/509907.510011}, url = {http://doi.acm.org/10.1145/509907.510011}, author = {Arya,Sunil and Malamatos,Theocharis and Mount, Dave} } @article {17925, title = {State of the art in data representation for visualization}, journal = {IEEE Visualization Tutorial}, year = {2002}, month = {2002///}, author = {Chen,B. and Kaufman,A. and Mueller,K. and Varshney, Amitabh} } @inbook {18923, title = {Theoretical and Empirical Aspects of a Planner in a Multi-agent Environment}, booktitle = {Logics in Artificial Intelligence}, series = {Lecture Notes in Computer Science}, volume = {2424}, year = {2002}, month = {2002///}, pages = {173 - 185}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {We give the theoretical foundations and empirical evaluation of a planning agent, ashop, performing HTN planning in a multi-agent environment. ashop is based on ASHOP , an agentised version of the original SHOP HTN planning algorithm, and is integrated in the IMPACT multi-agent environment. We ran several experiments involving accessing various distributed, heterogeneous information sources, based on simplified versions of noncombatant evacuation operations, NEO{\textquoteright}s. As a result, we noticed that in such realistic settings the time spent on communication (including network time) is orders of magnitude higher than the actual inference process. This has important consequences for optimisations of such planners. Our main results are: (1) using NEO{\textquoteright}s as new, more realistic benchmarks for planners acting in an agent environment, and (2) a memoization mechanism implemented on top of shop, which improves the overall performance considerably.}, keywords = {Computer science}, isbn = {978-3-540-44190-8}, url = {http://www.springerlink.com/content/10lxp56u3e9k0bdd/abstract/}, author = {Dix,J{\"u}rgen and Munoz-Avila,Hector and Nau, Dana S. and Zhang,Lingling}, editor = {Flesca,Sergio and Greco,Sergio and Ianni,Giovambattista and Leone,Nicola} } @article {12073, title = {Using independent auditors as intrusion detection systems}, journal = {Information and Communications Security}, year = {2002}, month = {2002///}, pages = {291 - 302}, author = {Molina,J. and Arbaugh, William A.} } @article {12764, title = {View-Based Recognition of Military Vehicles in Ladar Imagery Using CAD Model Matching}, journal = {OPTICAL ENGINEERING-NEW YORK-MARCEL DEKKER INCORPORATED-}, volume = {78}, year = {2002}, month = {2002///}, pages = {151 - 188}, author = {Der, S.Z. and Zheng,Q. and Redman, B. and Chellapa, Rama and Mahmoud, H.} } @conference {18470, title = {Virtual audio system customization using visual matching of ear parameters}, booktitle = {16th International Conference on Pattern Recognition, 2002. Proceedings}, volume = {3}, year = {2002}, month = {2002///}, pages = {1003- 1006 vol.3 - 1003- 1006 vol.3}, publisher = {IEEE}, organization = {IEEE}, abstract = {Applications in the creation of virtual auditory spaces (VAS) and sonification require individualized head related transfer functions (HRTFs) for perceptual fidelity. HRTFs exhibit significant variation from person to person due to differences between their pinnae, and their body sizes. We propose and preliminarily implement a simple HRTF customization based on the use of a published database of HRTFs (Algazi et al., 2001) that also contains geometrical measurements of subject pinnae. We measure some of these features via simple image processing, and select the HRTF that has features most closely corresponding to the individual{\textquoteright}s features. This selection procedure is implemented along with the virtual auditory system described in (Zotkin et al., 2002), and listener tests conducted comparing the customized HRTF and a fixed HRTF. Despite the simplicity of the method, tests reveal average improvement in localization accuracy of about 25 percent, though performance improvement varies with source location and individuals.}, keywords = {acoustic signal processing, Audio systems, Auditory system, Computer vision, database, Ear, ear parameter matching, geometrical measurements, Head, head related transfer functions, HRTF customization, Image databases, IMAGE PROCESSING, medical image processing, performance improvement, Position measurement, sonification, Spatial databases, System testing, Transfer functions, virtual audio system customization, virtual auditory spaces, virtual auditory system, visual matching}, isbn = {0-7695-1695-X}, doi = {10.1109/ICPR.2002.1048207}, author = {Zotkin,Dmitry N and Duraiswami, Ramani and Davis, Larry S. and Mohan,A. and Raykar,V.} } @article {13479, title = {Virtual Telescopes in Education}, journal = {Journal of Digital Information}, volume = {2}, year = {2002}, month = {2002///}, abstract = {Virtual Telescopes in Education is providing the services required to operate a virtual observatory comprising distributed telescopes, including an interactive, constraint-based scheduling service, data and resource archive, proposal preparation and review environment, and a VTIE Journal. A major goal of VTIE is to elicit from learners questions about the nature of celestial objects and the physical processes that give rise to the spectacular imagery that catches their imaginations. Generation of constrained science questions will assist learners in the science process. To achieve interoperability with other NSDL resources, our approach follows the Open Archives Initiative and the W3C Semantic Web activity.}, author = {Hoban,S. and desJardins, Marie and Farrell,N. and Rathod,P. and Sachs,J. and Sansare,S. and Yesha,Y. and Keating,J. and Busschots,B. and Means,J. and others} } @article {15662, title = {Vision geometry XI(Seattle WA, 7-8 July 2002)}, journal = {SPIE proceedings series}, year = {2002}, month = {2002///}, author = {Latecki,L.J. and Mount, Dave and Wu,A. Y} } @article {17670, title = {Wavelength rerouting in optical networks, or the Venetian Routing problem}, journal = {Journal of Algorithms}, volume = {45}, year = {2002}, month = {2002/11//}, pages = {93 - 125}, abstract = {Wavelength rerouting has been suggested as a viable and cost-effective method to improve the blocking performance of wavelength-routed wavelength-division multiplexing (WDM) networks. This method leads to the following combinatorial optimization problem, dubbed Venetian Routing. Given a directed multigraph G along with two vertices s and t and a collection of pairwise arc-disjoint paths, we wish to find an st-path which arc-intersects the smallest possible number of the given paths. In this paper we prove the computational hardness of this problem even in various special cases, and present several approximation algorithms for its solution. In particular we show a non-trivial connection between Venetian Routing and Label Cover.}, keywords = {Approximation algorithms, Label Cover, Optical networks, Shortest paths, Wavelength rerouting, Wavelength-division multiplexing}, isbn = {0196-6774}, doi = {10.1016/S0196-6774(02)00214-6}, url = {http://www.sciencedirect.com/science/article/pii/S0196677402002146}, author = {Caprara,Alberto and Italiano,Giuseppe F. and Mohan,G. and Panconesi,Alessandro and Srinivasan, Aravind} } @article {12087, title = {Your 802.11 network has no clothes}, journal = {IEEE Communications Magazine}, volume = {9}, year = {2002}, month = {2002///}, pages = {44 - 51}, author = {Mishra,A. and Shin,M. and Arbaugh, William A.} } @conference {15646, title = {Algorithms for facility location problems with outliers}, booktitle = {Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms}, series = {SODA {\textquoteright}01}, year = {2001}, month = {2001///}, pages = {642 - 651}, publisher = {Society for Industrial and Applied Mathematics}, organization = {Society for Industrial and Applied Mathematics}, address = {Philadelphia, PA, USA}, abstract = {Facility location problems are traditionally investigated with the assumption that all the clients are to be provided service. A significant shortcoming of this formulation is that a few very distant clients, called outliers, can exert a disproportionately strong influence over the final solution. In this paper we explore a generalization of various facility location problems (K-center, K-median, uncapacitated facility location etc) to the case when only a specified fraction of the customers are to be served. What makes the problems harder is that we have to also select the subset that should get service. We provide generalizations of various approximation algorithms to deal with this added constraint.}, isbn = {0-89871-490-7}, url = {http://dl.acm.org/citation.cfm?id=365411.365555}, author = {Charikar,Moses and Khuller, Samir and Mount, Dave and Narasimhan,Giri} } @article {15556, title = {The analysis of a probabilistic approach to nearest neighbor searching}, journal = {Algorithms and Data Structures}, year = {2001}, month = {2001///}, pages = {276 - 286}, abstract = {Given a set S of n data points in some metric space. Given a query point q in this space, a nearest neighbor query asks for the nearest point of S to q. Throughout we will assume that the space is real d-dimensional space Rd, and the metric is Euclidean distance. The goal is to preprocess S into a data structure so that such queries can be answered efficiently. Nearest neighbor searching has applications in many areas, including data mining [7], pattern classification [5], data compression [10].}, doi = {10.1007/3-540-44634-6_26}, author = {Maneewongvatana,S. and Mount, Dave} } @article {15596, title = {Approximating large convolutions in digital images}, journal = {Image Processing, IEEE Transactions on}, volume = {10}, year = {2001}, month = {2001/12//}, pages = {1826 - 1835}, abstract = {Computing discrete two-dimensional (2-D) convolutions is an important problem in image processing. In mathematical morphology, an important variant is that of computing binary convolutions, where the kernel of the convolution is a 0-1 valued function. This operation can be quite costly, especially when large kernels are involved. We present an algorithm for computing convolutions of this form, where the kernel of the binary convolution is derived from a convex polygon. Because the kernel is a geometric object, we allow the algorithm some flexibility in how it elects to digitize the convex kernel at each placement, as long as the digitization satisfies certain reasonable requirements. We say that such a convolution is valid. Given this flexibility we show that it is possible to compute binary convolutions more efficiently than would normally be possible for large kernels. Our main result is an algorithm which, given an m times;n image and a k-sided convex polygonal kernel K, computes a valid convolution in O(kmn) time. Unlike standard algorithms for computing correlations and convolutions, the running time is independent of the area or perimeter of K, and our techniques do not rely on computing fast Fourier transforms. Our algorithm is based on a novel use of Bresenham{\textquoteright}s (1965) line-drawing algorithm and prefix-sums to update the convolution incrementally as the kernel is moved from one position to another across the image}, keywords = {2D, algorithm;binary, approximation;mathematical, convolution, convolution;binary, convolutions;Bresenham{\textquoteright}s, convolutions;convex, convolutions;geometric, images;discrete, kernel;convex, kernel;digital, line-drawing, morphology;, morphology;approximation, object;image, polygonal, processing;large, processing;mathematical, theory;convolution;image, two-dimensional}, isbn = {1057-7149}, doi = {10.1109/83.974567}, author = {Mount, Dave and Kanungo,T. and Netanyahu,N. S and Piatko,C. and Silverman,R. and Wu,A. Y} } @conference {15353, title = {Assessment of the k-epsilon turbulence model for compressible flows using direct simulation data}, booktitle = {39th AIAA Aerospace Sciences Meeting and Exhibit}, year = {2001}, month = {2001///}, address = {Reno, NV}, abstract = {We evaluate the k-epsilon turbulence model using direct numerical simulation (DNS) data of a Mach 4 boundary layer. We find that the low Reynolds number damping functions for the Reynolds stress must be corrected by the density ratio to match the DNS data. We present the budget of the k equation and assess the modeling of the various source terms. The models for all the source terms, except for the production and dilatational dissipation terms, are found to be adequate. Finally, we present the solenoidal dissipation rate equation and compute its budget using the boundary layer data. We compare this equation with the dissipation rate equation in an incompressible flow to show the equivalence between the two equations. This is the basis for modeling the solenoidal dissipation equation. However, an additional term in the equation due to variation of fluid viscosity needs to be modeled.}, author = {Sinha,K. and Candler,G. V and Martin, M.P} } @book {16985, title = {Becoming a Scholar in the Digital Age}, year = {2001}, month = {2001///}, publisher = {National Research Council}, organization = {National Research Council}, keywords = {bibtex-import, digital-library, dlbook}, author = {Duderstadt,James and Arms,William and Messina,Paul and Ellisman,Mark and Atkins,Daniel and Fox,Edward and Shneiderman, Ben and Nissenbaum,Helen and Lederberg,Joshua} } @inbook {14667, title = {Compiling PLAN to SNAP}, booktitle = {Active NetworksActive Networks}, series = {Lecture Notes in Computer Science}, volume = {2207}, year = {2001}, month = {2001///}, pages = {134 - 151}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {PLAN (Packet Language for Active Networks) [ 3 ] is a highly flexible and usable active packet language, whereas SNAP (Safe and Nimble Active Packets) [ 12 ] offers significant resource usage safety and achieves much higher performance compared to PLAN, but at the cost of flexibility and usability. Ideally, we would like to combine the good properties of PLAN with those of SNAP. We have achieved this end by developing a compiler that translates PLANi nto SNAP. The compiler allows us to achieve the flexibility and usability of PLAN, but with the safety and efficiency of SNAP. In this paper, we describe both languages, highlighting the features that require special compilation techniques. We then present the details of our compiler and experimental results to evaluate our compiler with respect to code size.}, isbn = {978-3-540-42678-3}, url = {http://dx.doi.org/10.1007/3-540-45451-9_9}, author = {Hicks, Michael W. and Moore,Jonathan and Nettles,Scott}, editor = {Marshall,Ian and Nettles,Scott and Wakamiya,Naoki} } @mastersthesis {15501, title = {A comprehensive framework for testing graphical user interfaces}, year = {2001}, month = {2001///}, school = {University of Pittsburgh}, author = {Memon, Atif M.} } @conference {16346, title = {Core semantics of multithreaded Java}, booktitle = {Proceedings of the 2001 joint ACM-ISCOPE conference on Java Grande - JGI {\textquoteright}01}, year = {2001}, month = {2001///}, pages = {29 - 38}, address = {Palo Alto, California, United States}, doi = {10.1145/376656.376806}, url = {http://dl.acm.org/citation.cfm?id=376806}, author = {Manson,Jeremy and Pugh, William} } @conference {15455, title = {Coverage criteria for GUI testing}, booktitle = {Proceedings of the 8th European software engineering conference held jointly with 9th ACM SIGSOFT international symposium on Foundations of software engineering}, series = {ESEC/FSE-9}, year = {2001}, month = {2001///}, pages = {256 - 267}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {A widespread recognition of the usefulness of graphical user interfaces (GUIs) has established their importance as critical components of today{\textquoteright}s software. GUIs have characteristics different from traditional software, and conventional testing techniques do not directly apply to GUIs. This paper{\textquoteright}s focus is on coverage critieria for GUIs, important rules that provide an objective measure of test quality. We present new coverage criteria to help determine whether a GUI has been adequately tested. These coverage criteria use events and event sequences to specify a measure of test adequacy. Since the total number of permutations of event sequences in any non-trivial GUI is extremely large, the GUI{\textquoteright}s hierarchical structure is exploited to identify the important event sequences to be tested. A GUI is decomposed into GUI components, each of which is used as a basic unit of testing. A representation of a GUI component, called an event-flow graph, identifies the interaction of events within a component and intra-component criteria are used to evaluate the adequacy of tests on these events. The hierarchical relationship among components is represented by an integration tree, and inter-component coverage criteria are used to evaluate the adequacy of test sequences that cross components. Algorithms are given to construct event-flow graphs and an integration tree for a given GUI, and to evaluate the coverage of a given test suite with respect to the new coverage criteria. A case study illustrates the usefulness of the coverage report to guide further testing and an important correlation between event-based coverage of a GUI and statement coverage of its software{\textquoteright}s underlying code.}, keywords = {component testing, event-based coverage, event-flow graph, GUI test coverage, GUI testing, integration tree}, isbn = {1-58113-390-1}, doi = {10.1145/503209.503244}, url = {http://doi.acm.org/10.1145/503209.503244}, author = {Memon, Atif M. and Soffa,Mary Lou and Pollack,Martha E.} } @article {15092, title = {Cryptographic counters and applications to electronic voting}, journal = {Advances in Cryptology{\textemdash}Eurocrypt 2001}, year = {2001}, month = {2001///}, pages = {78 - 92}, abstract = {We formalize the notion of a cryptographic counter, which allows a group of participants to increment and decrement a cryptographic representation of a (hidden) numerical value privately and robustly. The value of the counter can only be determined by a trusted authority (or group of authorities, which may include participants themselves), and participants cannot determine any information about the increment/decrement operations performed by other parties.Previous efficient implementations of such counters have relied on fully-homomorphic encryption schemes; this is a relatively strong requirement which not all encryption schemes satisfy. We provide an alternate approach, starting with any encryption scheme homomorphic over the additive group ℤ2 (i.e., 1-bit XOR). As our main result, we show a general and efficient reduction from any such encryption scheme to a general cryptographic counter. Our main reduction does not use additional assumptions, is efficient, and gives a novel implementation of a general counter. The result can also be viewed as an efficient construction of a general n-bit cryptographic counter from any 1-bit counter which has the additional property that counters can be added securely. As an example of the applicability of our construction, we present a cryptographic counter based on the quadratic residuosity assumption and use it to construct an efficient voting scheme which satisfies universal verifiability, privacy, and robustness. Work done while the author was at Telcordia Technologies. }, doi = {10.1007/3-540-44987-6_6}, author = {Katz, Jonathan and Myers,S. and Ostrovsky,R.} } @article {14671, title = {Cyclone User{\textquoteright}s Manual, Version 0.1. 3}, journal = {Computer Science Technical Reports}, year = {2001}, month = {2001/11/16/undef}, abstract = {The current version of this manual should be available at http://www.cs.cornell.edu/projects/cyclone/ and http://www.research.att.com/projects/cyclone/. The version here describes Cyclone Version 0.1.3, although minor changes may have occurred before the release.}, author = {Grossman,D. and Morrisett,G. and Jim,T. and Hicks, Michael W. and Wang, Y. and Cheney,J.} } @conference {14685, title = {Dynamic software updating}, booktitle = {Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation}, series = {PLDI {\textquoteright}01}, year = {2001}, month = {2001///}, pages = {13 - 23}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Many important applications must run continuously and without interruption, yet must be changed to fix bugs or upgrade functionality. No prior general-purpose methodology for dynamic updating achieves a practical balance between flexibility, robustness, low overhead, and ease of use.We present a new approach for C-like languages that provides type-safe dynamic updating of native code in an extremely flexible manner (code, data, and types may be updated, at programmer-determined times) and permits the use of automated tools to aid the programmer in the updating process. Our system is based on dynamic patches that both contain the updated code and the code needed to transition from the old version to the new. A novel aspect of our patches is that they consist of verifiable native code (e.g. Proof-Carrying Code [17] or Typed Assembly Language [16]), which is native code accompanied by annotations that allow on-line verification of the code{\textquoteright}s safety. We discuss how patches are generated mostly automatically, how they are applied using dynamic-linking technology, and how code is compiled to make it updateable. To concretely illustrate our system, we have implemented a dynamically-updateable web server, FlashEd. We discuss our experience building and maintaining FlashEd. Performance experiments show that for FlashEd, the overhead due to updating is typically less than 1\%. }, isbn = {1-58113-414-2}, doi = {10.1145/378795.378798}, url = {http://doi.acm.org/10.1145/378795.378798}, author = {Hicks, Michael W. and Moore,Jonathan T. and Nettles,Scott} } @article {15571, title = {On the efficiency of nearest neighbor searching with data clustered in lower dimensions}, journal = {Computational Science{\textemdash}ICCS 2001}, year = {2001}, month = {2001///}, pages = {842 - 851}, abstract = {Nearest neighbor searching is an important and fundamental problem in the field of geometric data structures. Given a set S of n data points in real d-dimensional space, R d, we wish to preprocess these points so that, given any query point q ∈ R d, the data point nearest to q can be reported quickly. We assume that distances are measured using any Minkowski distance metric, including the Euclidean, Manhattan, and max metrics. Nearest neighbor searching has numerous applications in diverse areas of science.}, doi = {10.1007/3-540-45545-0_96}, author = {Maneewongvatana,S. and Mount, Dave} } @article {15567, title = {Efficient randomized algorithms for robust estimation of circular arcs and aligned ellipses}, journal = {Computational Geometry}, volume = {19}, year = {2001}, month = {2001/06//}, pages = {1 - 33}, abstract = {Fitting two-dimensional conic sections (e.g., circular and elliptical arcs) to a finite collection of points in the plane is an important problem in statistical estimation and has significant industrial applications. Recently there has been a great deal of interest in robust estimators, because of their lack of sensitivity to outlying data points. The basic measure of the robustness of an estimator is its breakdown point, that is, the fraction (up to 50\%) of outlying data points that can corrupt the estimator. In this paper we introduce nonlinear Theil{\textendash}Sen and repeated median (RM) variants for estimating the center and radius of a circular arc, and for estimating the center and horizontal and vertical radii of an axis-aligned ellipse. The circular arc estimators have breakdown points of ≈~21\% and 50\%, respectively, and the ellipse estimators have breakdown points of ≈ 16\% and 50\%, respectively. We present randomized algorithms for these estimators, whose expected running times are O(n2logn) for the circular case and O(n3logn) for the elliptical case. All algorithms use O(n) space in the worst case.}, keywords = {Aligned ellipse fitting, Arrangements, Circular arc fitting, computational geometry, randomized algorithms, Range searching, RM estimator, robust estimation, Theil{\textendash}Sen estimator}, isbn = {0925-7721}, doi = {10.1016/S0925-7721(01)00009-8}, url = {http://www.sciencedirect.com/science/article/pii/S0925772101000098}, author = {Mount, Dave and Netanyahu,Nathan S.} } @article {15545, title = {An empirical study of a new approach to nearest neighbor searching}, journal = {Algorithm Engineering and Experimentation}, year = {2001}, month = {2001///}, pages = {172 - 187}, abstract = {In nearest neighbor searching we are given a set of n data points in real d-dimensional space, ℜd, and the problem is to preprocess these points into a data structure, so that given a query point, the nearest data point to the query point can be reported efficiently. Because data sets can be quite large, we are interested in data structures that use optimal O(dn) storage.In this paper we consider a novel approach to nearest neighbor searching, in which the search returns the correct nearest neighbor with a given probability assuming that the queries are drawn from some known distribution. The query distribution is represented by providing a set of training query points at preprocessing time. The data structure, called the overlapped split tree, is an augmented BSP-tree in which each node is associated with a cover region, which is used to determine whether the search should visit this node. We use principal component analysis and support vector machines to analyze the structure of the data and training points in order to better adapt the tree structure to the data sets. We show empirically that this new approach provides improved predictability over the kd-tree in average query performance. }, doi = {10.1007/3-540-44808-X_14}, author = {Maneewongvatana,S. and Mount, Dave} } @conference {15645, title = {Entropy-preserving cuttings and space-efficient planar point location}, booktitle = {Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms}, series = {SODA {\textquoteright}01}, year = {2001}, month = {2001///}, pages = {256 - 261}, publisher = {Society for Industrial and Applied Mathematics}, organization = {Society for Industrial and Applied Mathematics}, address = {Philadelphia, PA, USA}, abstract = {Point location is the problem of preprocessing a planar polygonal subdivision S into a data structure in order to determine efficiently the cell of the subdivision that contains a given query point. Given the probabilities pz that the query point lies within each cell z ∈ S, a natural question is how to design such a structure so as to minimize the expected-case query time. The entropy H of the probability distribution is the dominant term in the lower bound on the expected-case search time. Clearly the number of edges n of the subdivision is a lower bound on the space required. There is no known approach that simultaneously achieves the goals of H + \&Ogr;(H) query time and \&Ogr;(n) space. In this paper we introduce entropy-preserving cuttings and show how to use them to achieve query time H + \&Ogr;(H), using only \&Ogr;(n log* n) space.}, isbn = {0-89871-490-7}, url = {http://dl.acm.org/citation.cfm?id=365411.365456}, author = {Arya,Sunil and Malamatos,Theocharis and Mount, Dave} } @article {17116, title = {E-tables: Non-specialist use and understanding of statistical data}, journal = {SURFACE, the Syracuse University Research Facility And Collaborative Environment}, year = {2001}, month = {2001///}, pages = {33 - 33}, abstract = {This paper provides a progress report on a project that aims to understand how people think about and understand statistical data presented in tables. The focus is on people who are not statistical specialists. To this end, studies of various user populations were conducted, underlying data enrichment and explanation was investigated, and interactive user interface prototypes were developed and tested.}, author = {Marchionini,G. and Hert,C. and Shneiderman, Ben and Liddy,L.} } @conference {12120, title = {An experience management system for a software engineering research organization}, booktitle = {Software Engineering Workshop, 2001. Proceedings. 26th Annual NASA Goddard}, year = {2001}, month = {2001///}, pages = {29 - 35}, abstract = {Most businesses rely on the fact that their employees possess relevant knowledge and that they can apply it to the task at hand. The problem is that this knowledge is not owned by the organization. It is owned and controlled by its employees. Maintaining an appropriate level of knowledge in the organization is a very important issue. It is, however, not an easy task for most organizations, and it is particularly problematic for software organizations, which are human- and knowledge-intensive. Knowledge management is a relatively new area that has attempted to address these problems. This paper introduces an approach called the "knowledge dust-to-pearls" approach. This approach addresses some of the issues with knowledge management by providing low-barrier mechanisms to "jump start" the experience base. This approach allows the experience base to become more useful more quickly than traditional approaches. This paper describes the approach and gives an example of its use at the Fraunhofer Center for Experimental Software Engineering, Maryland, USA}, keywords = {and, approach;knowledge, base;experience, Center, control;knowledge, data, development, dust-to-pearls, engineering, Engineering;business, engineering;software, experimental, for, Fraunhofer, houses;, knowledge;employee, knowledge;experience, level, maintenance;knowledge, management, management;knowledge, management;software, mechanisms;software, organization;software, organizational, organizations;administrative, organizations;knowledge, organizations;low-barrier, ownership;knowledge-intensive, processing;personnel;research, research, software, system;human-intensive}, doi = {10.1109/SEW.2001.992652}, author = {Basili, Victor R. and Costa,P. and Lindvall,M. and Mendonca,M. and Seaman,C. and Tesoriero,R. and Zelkowitz, Marvin V} } @inbook {17594, title = {Experimental Analysis of Algorithms for Bilateral-Contract Clearing Mechanisms Arising in Deregulated Power Industry}, booktitle = {Algorithm EngineeringAlgorithm Engineering}, series = {Lecture Notes in Computer Science}, volume = {2141}, year = {2001}, month = {2001///}, pages = {172 - 184}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {We consider the bilateral contract satisfaction problem arising from electrical power networks due to the proposed deregulation of the electric utility industry in the USA. Given a network and a (multi)set of pairs of vertices (contracts) with associated demands, the goal is to find the maximum number of simultaneously satisfiable contracts. We study how four different algorithms perform in fairly realistic settings; we use an approximate electrical power network from Colorado. Our experiments show that three heuristics outperform a theoretically better algorithm. We also test the algorithms on four types of scenarios that are likely to occur in a deregulated marketplace. Our results show that the networks that are adequate in a regulated marketplace might be inadequate for satisfying all the bilateral contracts in a deregulated industry.}, isbn = {978-3-540-42500-7}, url = {http://dx.doi.org/10.1007/3-540-44688-5_14}, author = {Barrett,Chris and Cook,Doug and Hicks,Gregory and Faber,Vance and Marathe,Achla and Marathe,Madhav and Srinivasan, Aravind and Sussmann,Yoram and Thornquist,Heidi}, editor = {Brodal,Gerth and Frigioni,Daniele and Marchetti-Spaccamela,Alberto} } @article {15473, title = {Hierarchical GUI test case generation using automated planning}, journal = {Software Engineering, IEEE Transactions on}, volume = {27}, year = {2001}, month = {2001/02//}, pages = {144 - 155}, abstract = {The widespread use of GUIs for interacting with software is leading to the construction of more and more complex GUIs. With the growing complexity come challenges in testing the correctness of a GUI and its underlying software. We present a new technique to automatically generate test cases for GUIs that exploits planning, a well-developed and used technique in artificial intelligence. Given a set of operators, an initial state, and a goal state, a planner produces a sequence of the operators that will transform the initial state to the goal state. Our test case generation technique enables efficient application of planning by first creating a hierarchical model of a GUI based on its structure. The GUI model consists of hierarchical planning operators representing the possible events in the GUI. The test designer defines the preconditions and effects of the hierarchical operators, which are input into a plan-generation system. The test designer also creates scenarios that represent typical initial and goal states for a GUI user. The planner then generates plans representing sequences of GUI interactions that a user might employ to reach the goal state from the initial state. We implemented our test case generation system, called Planning Assisted Tester for Graphical User Interface Systems (PATHS) and experimentally evaluated its practicality and effectiveness. We describe a prototype implementation of PATHS and report on the results of controlled experiments to generate test cases for Microsoft{\textquoteright}s WordPad}, keywords = {Artificial intelligence, automated planning, automatic test case generation, Automatic testing, correctness testing, goal state, Graphical user interfaces, hierarchical GUI test case generation, initial state, Microsoft WordPad, operators, plan-generation system, planning (artificial intelligence), Planning Assisted Tester for Graphical User Interface Systems, program testing, software}, isbn = {0098-5589}, doi = {10.1109/32.908959}, author = {Memon, Atif M. and Pollack,M. E and Soffa,M. L} } @conference {16779, title = {Integrating distributed scientific data sources with MOCHA and XRoaster}, booktitle = {Thirteenth International Conference on Scientific and Statistical Database Management, 2001. SSDBM 2001. Proceedings}, year = {2001}, month = {2001///}, pages = {263 - 266}, publisher = {IEEE}, organization = {IEEE}, abstract = {MOCHA is a novel middleware system for integrating distributed data sources that we have developed at the University of Maryland. MOCHA is based on the idea that the code that implements user-defined types and functions should be automatically deployed to remote sites by the middleware system itself. To this end, we have developed an XML-based framework to specify metadata about data sites, data sets, and user-defined types and functions. XRoaster is a graphical tool that we have developed to help the user create all the XML metadata elements to be used in MOCHA}, keywords = {client-server systems, data sets, data sites, Databases, Distributed computing, distributed databases, distributed scientific data source integration, Educational institutions, graphical tool, hypermedia markup languages, IP networks, java, Large-scale systems, Maintenance engineering, meta data, metadata, Middleware, middleware system, MOCHA, Query processing, remote sites, scientific information systems, user-defined types, visual programming, XML, XML metadata elements, XML-based framework, XRoaster}, isbn = {0-7695-1218-6}, doi = {10.1109/SSDM.2001.938560}, author = {Rodriguez-Martinez,M. and Roussopoulos, Nick and McGann,J. M and Kelley,S. and Mokwa,J. and White,B. and Jala,J.} } @conference {15899, title = {Mandarin-English Information (MEI): investigating translingual speech retrieval}, booktitle = {Proceedings of the first international conference on Human language technology research}, series = {HLT {\textquoteright}01}, year = {2001}, month = {2001///}, pages = {1 - 7}, publisher = {Association for Computational Linguistics}, organization = {Association for Computational Linguistics}, address = {Stroudsburg, PA, USA}, abstract = {This paper describes the Mandarin-English Information (MEI) project, where we investigated the problem of cross-language spoken document retrieval (CL-SDR), and developed one of the first English-Chinese CL-SDR systems. Our system accepts an entire English news story (text) as query, and retrieves relevant Chinese broadcast news stories (audio) from the document collection. Hence this is a cross-language and cross-media retrieval task. We applied a multi-scale approach to our problem, which unifies the use of phrases, words and subwords in retrieval. The English queries are translated into Chinese by means of a dictionary-based approach, where we have integrated phrase-based translation with word-by-word translation. Untranslatable named entities are transliterated by a novel subword translation technique. The multi-scale approach can be divided into three subtasks -- multi-scale query formulation, multi-scale audio indexing (by speech recognition) and multi-scale retrieval. Experimental results demonstrate that the use of phrase-based translation and subword translation gave performance gains, and multi-scale retrieval outperforms word-based retrieval.}, keywords = {cross-language, English-Chinese, spoken document retrieval}, doi = {10.3115/1072133.1072202}, url = {http://dx.doi.org/10.3115/1072133.1072202}, author = {Meng,Helen and Chen,Berlin and Khudanpur,Sanjeev and Levow,Gina-Anne and Lo,Wai-Kit and Oard, Douglas and Schone,Patrick and Tang,Karen and Wang,Hsin-Min and Wang,Jianqiang} } @article {18983, title = {Messenger RNA Splicing Signals}, journal = {eLS}, year = {2001}, month = {2001///}, abstract = {Splicing signals are elements in the DNA sequence of a gene that specify the accurate splicing of its primary RNA transcript to generate its mature RNA product.}, keywords = {consensus sequences, exon definition, small nuclear ribonucleoprotein particles (snRNPs), splice site selection, splicing enhancers}, doi = {10.1038/npg.els.0000888}, url = {http://onlinelibrary.wiley.com/doi/10.1038/npg.els.0000888/abstract}, author = {Mount, Stephen M.} } @conference {18465, title = {Multimodal localization of a flying bat}, booktitle = {Acoustics, Speech, and Signal Processing, IEEE International Conference on}, volume = {5}, year = {2001}, month = {2001///}, pages = {3057 - 3060}, publisher = {IEEE Computer Society}, organization = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, abstract = {We present a new multimodal system that combines stereoscopic and audio-based source localization to track the position of a flying bat. Also presented are novel algorithms for audio source localization. The bat was allowed to fly in an anechoic room and monitored by two high-speed video cameras. The vocalizations of the bat were simultaneously recorded from six microphones. The data was then processed offline to localize the source and reconstruct the trajectory of the bat. We compare the performance of the localization algorithm with the position data obtained from stereoscopic pictures of the bat. The results confirm that the stereoscopic analysis and the audio localization are in good agreement. This system opens up new possibilities for performing multimodal research, and developing more tightly integrated algorithms.}, isbn = {0-7803-7041-4}, doi = {http://doi.ieeecomputersociety.org/10.1109/ICASSP.2001.940303}, author = {Ghose,K. and Zotkin,Dmitry N and Duraiswami, Ramani and Moss,C.F.} } @article {17628, title = {Near-optimal design of MP S tunnels with shared recovery}, journal = {DIMACS Mini-Workshop on Quality of Service Issues in the Internet}, year = {2001}, month = {2001///}, abstract = {We describe the optimization problem associ-ated with the concurrent routing of demands with guar- anteed shared recovery in case of network failures. This problem arises in routing with protection in meshes and is known to be hard. We describe the problem in the context of the efficient design of restorable MP S tunnels in optical networks. The underlying design gives rise to a stochastic optimization problem that is equivalent to a (very) large- scale linear programming (LP) problem that explicitly in- corporates the network failure scenarios. The feasible re- gion for this LP is given by combined packing and cover- ing constraints for concurrent and optimal multicommodity flows. We develop a novel -approximation procedure for this problem and demonstrate its performance for a variety of real network sizes. An attraction of our approach is that its main computation consists of routing flow along a pair of short paths and these paths are easily found. Commer- cial general-purpose LP solvers are typically unable to solve these problems once they become large enough, while our approach scales for large networks. We conclude that the proposed scheme provides guaranteed approximation to the design of restorable MP S tunnels with shared protection within realistic network settings. }, author = {Fleischer,L. and Meyerson,A. and Saniee,I. and Shepherd,FB and Srinivasan, Aravind} } @article {15601, title = {A point-placement strategy for conforming Delaunay tetrahedralization}, journal = {International Journal of Computational Geometry \& Applications}, volume = {11}, year = {2001}, month = {2001///}, pages = {669 - 682}, abstract = {A strategy is presented to find a set of points that yields a Conforming Delaunay tetrahedralization of a three-dimensional Piecewise-Linear complex (PLC). This algorithm is novel because it imposes no angle restrictions on the input PLC. In the process, an algorithm is described that computes a planar conforming Delaunay triangulation of a Planar Straight-Line Graph (PSLG) such that each triangle has a bounded circumradius, which may be of independent interest.}, doi = {10.1142/S0218195901000699}, author = {Mount, Dave and Gable,C. W} } @conference {14725, title = {Practical programmable packets}, booktitle = {IEEE INFOCOM 2001. Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings}, volume = {1}, year = {2001}, month = {2001///}, pages = {41-50 vol.1 - 41-50 vol.1}, publisher = {IEEE}, organization = {IEEE}, abstract = {We present SNAP (safe and nimble active packets), a new scheme for programmable (or active) packets centered around a new low-level packet language. Unlike previous active packet approaches, SNAP is practical: namely, adding significant flexibility over IP without compromising safety and security or efficiency. In this paper we show how to compile from the well-known active picket language PLAN to SNAP, showing that SNAP retains PLAN{\textquoteright}s flexibility; give proof sketches of its novel approach to resource control; and present experimental data showing SNAP attains performance very close to that of a software IP router}, keywords = {active picket language, Application software, complier, Contracts, Data security, efficiency, Explosives, INFORMATION SCIENCE, Internet, IP, IP networks, low-level packet language, packet switching, performance, PLAN, practical programmable packets, program compilers, Protection, resource control, Resource management, safe and nimble active packets, Safety, Security, SNAP, software IP router, Software performance, telecommunication security, Transport protocols}, isbn = {0-7803-7016-3}, doi = {10.1109/INFCOM.2001.916685}, author = {Moore,J. T and Hicks, Michael W. and Nettles,S.} } @article {12070, title = {The price of safety in an active network}, journal = {Journal of Communications and Networks}, volume = {3}, year = {2001}, month = {2001///}, pages = {4 - 18}, author = {Alexander,D. S and Menage,P. B and Keromytis,A. D and Arbaugh, William A. and Anagnostakis,K. G and Smith,J. M} } @conference {12110, title = {A prototype experience management system for a software consulting organization}, booktitle = {Thirteenth International Conference on Software Engineering and Knowledge Engineering}, year = {2001}, month = {2001///}, pages = {29 - 36}, abstract = {The Experience Management System (EMS) is aimed atsupporting the capture and reuse of software-related experience, based on the Experience Factory concept. It is being developed for use in a multinational software engineering consultancy, Q-Labs. Currently, a prototype EMS exists and has been evaluated. This paper focuses on the EMS architecture, underlying data model, implementation, and user interface. }, author = {Mendon{\c c}a Neto,M. G. and Seaman,C. and Basili, Victor R. and Kim,Y. M} } @article {18710, title = {Rescuing a destabilized protein fold through backbone cyclization}, journal = {Journal of Molecular Biology}, volume = {308}, year = {2001}, month = {2001/05/18/}, pages = {1045 - 1062}, abstract = {We describe the physicochemical characterization of various circular and linear forms of the \~{}60 residue N-terminal Src homology 3 (SH3) domain from the murine c-Crk adapter protein. Structural, dynamic, thermodynamic, kinetic and biochemical studies reveal that backbone circularization does not prevent the adoption of the natural folded structure in any of the circular proteins. Both the folding and unfolding rate of the protein increased slightly upon circularization. Circularization did not lead to a significant thermodynamic stabilization of the full-length protein, suggesting that destabilizing enthalpic effects (e.g. strain) negate the expected favorable entropic contribution to overall stability. In contrast, we find circularization results in a dramatic stabilization of a truncated version of the SH3 domain lacking a key glutamate residue. The ability to rescue the destabilized mutant indicates that circularization may be a useful tool in protein engineering programs geared towards generating minimized proteins.}, keywords = {circular protein, ligation, SH3 domain}, isbn = {0022-2836}, doi = {10.1006/jmbi.2001.4631}, url = {http://www.sciencedirect.com/science/article/pii/S0022283601946315}, author = {Camarero,Julio A and Fushman, David and Sato,Satoshi and Giriat,Izabela and Cowburn,David and Raleigh,Daniel P and Muir,Tom W} } @conference {15592, title = {Robust matching of wavelet features for sub-pixel registration of Landsat data}, booktitle = {Geoscience and Remote Sensing Symposium, 2001. IGARSS {\textquoteright}01. IEEE 2001 International}, volume = {2}, year = {2001}, month = {2001///}, pages = {706 -708 vol.2 - 706 -708 vol.2}, abstract = {For many Earth and space science applications, automatic geo-registration at sub-pixel accuracy has become a necessity. In this work, we are focusing on building an operational system, which will provide a sub-pixel accuracy registration of Landsat-5 and Landsat-7 data. The input to our registration method consists of scenes that have been geometrically and radiometrically corrected. Such preprocessed scenes are then geo-registered relative to a database of Landsat chips. The method assumes a transformation composed of a rotation and a translation, and utilizes rotation- and translation-invariant wavelets to extract image features that are matched using statistically robust feature matching and a partial Hausdorff distance metric. The registration process is described and results on four Landsat input scenes of the Washington, D.C., area are presented}, keywords = {Feature extraction, geo-registration, geophysical measurement technique, geophysical signal processing, geophysical techniques, Hausdorff distance metric, image registration, infrared, IR, land surface, Landsat, Landsat-5, Landsat-7, multispectral remote sensing, robust feature matching, robust matching, sub pixel registration, subpixel accuracy, terrain mapping, visible, wavelet feature, wavelet method, Wavelet transforms}, doi = {10.1109/IGARSS.2001.976609}, author = {Le Moigne,J. and Netanyahu,N. S and Masek,J. G and Mount, Dave and Goward, S.N.} } @article {18271, title = {Rotation, scale, and translation resilient public watermarking for images using a log-polar fourier transform}, year = {2001}, month = {2001/08/28/}, abstract = {A method for detecting a watermark signal in digital image data. The detecting method includes the steps of: computing a log-polar Fourier transform of the image data to obtain a log-polar Fourier spectrum; projecting the log-polar Fourier spectrum down to a lower dimensional space to obtain an extracted signal; comparing the extracted signal to a target watermark signal; and declaring the presence or absence of the target watermark signal in the image data based on the comparison. Also provided is a method for inserting a watermark signal in digital image data to obtain a watermarked image. The inserting method includes the steps of: computing a log-polar Fourier transform of the image data to obtain a log-polar Fourier spectrum; projecting the log-polar Fourier spectrum down to a lower dimensional space to obtain an extracted signal; modifying the extracted signal such that it is similar to a target watermark; performing a one-to-many mapping of the modified signal back to...}, url = {http://www.google.com/patents?id=v4AIAAAAEBAJ}, author = {Bloom,Jeffrey A. and Cox,Ingemar J. and Miller,Matthew L. and M. Wu and Lin,Ching-Yung and Lui,Yui Man}, editor = {Signafy, Inc.} } @article {18272, title = {Rotation, scale, and translation resilient watermarking for images}, journal = {Image Processing, IEEE Transactions on}, volume = {10}, year = {2001}, month = {2001/05//}, pages = {767 - 782}, abstract = {Many electronic watermarks for still images and video content are sensitive to geometric distortions. For example, simple rotation, scaling, and/or translation (RST) of an image can prevent blind detection of a public watermark. In this paper, we propose a watermarking algorithm that is robust to RST distortions. The watermark is embedded into a one-dimensional (1-D) signal obtained by taking the Fourier transform of the image, resampling the Fourier magnitudes into log-polar coordinates, and then summing a function of those magnitudes along the log-radius axis. Rotation of the image results in a cyclical shift of the extracted signal. Scaling of the image results in amplification of the extracted signal, and translation of the image has no effect on the extracted signal. We can therefore compensate for rotation with a simple search, and compensate for scaling by using the correlation coefficient as the detection measure. False positive results on a database of 10 000 images are reported. Robustness results on a database of 2000 images are described. It is shown that the watermark is robust to rotation, scale, and translation. In addition, we describe tests examining the watermarks resistance to cropping and JPEG compression}, keywords = {axis;one-dimensional, coding;security, coefficient;cropping;cyclical, compression;RST, coordinates;log-radius, data;, detection;correlation, distortions;blind, distortions;images;log-polar, encapsulation;image, Fourier, images;translation, magnitudes;Fourier, measure;geometric, of, protection;data, resilient, shift;detection, signal;public, transform;JPEG, transforms;copy, watermark;resampling;rotation;scale;search;still, watermarking;video;Fourier}, isbn = {1057-7149}, doi = {10.1109/83.918569}, author = {Lin,C.-Y. and Wu,M. and Bloom,J.A. and Cox,I.J. and Miller,M.L. and Lui,Y.M.} } @article {18274, title = {Secure Health Information Sharing System: SHARE}, journal = {Proceedings of the AMIA SymposiumProc AMIA Symp}, year = {2001}, month = {2001///}, pages = {1060 - 1060}, isbn = {1531-605X}, author = {M. Wu and Mui,Lik and Mohtashemi,Mojdeh and Szolovits,Peter} } @conference {15644, title = {A simple entropy-based algorithm for planar point location}, booktitle = {Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms}, series = {SODA {\textquoteright}01}, year = {2001}, month = {2001///}, pages = {262 - 268}, publisher = {Society for Industrial and Applied Mathematics}, organization = {Society for Industrial and Applied Mathematics}, address = {Philadelphia, PA, USA}, abstract = {Given a planar polygonal subdivision S, point location involves preprocessing this subdivision into a data structure so that given any query point q, the cell of the subdivision containing q can be determined efficiently. Suppose that for each cell z in the subdivision, the probability pz that a query point lies within this cell is also given. The goal is to design the data structure to minimize the average search time. It has long been known that the entropy H of the probability distribution is the dominant term in the lower bound on the average-case search time. This problem has been considered before, but existing data structures are all quite complicated. In this paper, we show that a very simple modification of a well-known randomized incremental algorithm can be applied to produce a data structure of expected linear size that can answer point location queries in \&Ogr;(H) average time. We also present empirical evidence for the practical efficiency of this approach.}, isbn = {0-89871-490-7}, url = {http://dl.acm.org/citation.cfm?id=365411.365457}, author = {Arya,Sunil and Malamatos,Theocharis and Mount, Dave} } @article {16463, title = {Source Selection and Ranking in the WebSemantics Architecture Using Quality of Data Metadata-1 Introduction}, journal = {Advances in Computers}, volume = {55}, year = {2001}, month = {2001///}, pages = {89 - 90}, author = {Mihaila,G. A and Raschid, Louiqa and Vidal,M. E} } @conference {16156, title = {Therapeutic play with a storytelling robot}, booktitle = {CHI {\textquoteright}01 extended abstracts on Human factors in computing systems}, series = {CHI EA {\textquoteright}01}, year = {2001}, month = {2001///}, pages = {27 - 28}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {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.}, keywords = {children, design process, rehabilitation, robot, therapeutic play, user interface}, isbn = {1-58113-340-5}, doi = {10.1145/634067.634088}, url = {http://doi.acm.org/10.1145/634067.634088}, author = {Lathan,Corinna and Vice,Jack Maxwell and Tracey,Michael and Plaisant, Catherine and Druin, Allison and Edward,Kris and Montemayor,Jaime} } @conference {15836, title = {Translation lexicon acquisition from bilingual dictionaries}, booktitle = {Proceedings of SPIE}, volume = {4670}, year = {2001}, month = {2001///}, pages = {37 - 37}, author = {David Doermann and Ma,H. and Karagol-Ayan,B. and Oard, Douglas} } @book {15363, title = {Transmission Lines and Lumped Circuits. Academic Press Series in Electromagnetism}, year = {2001}, month = {2001///}, publisher = {Elsevier Science \& Technology}, organization = {Elsevier Science \& Technology}, author = {Maffucci,A. and Mayergoyz, Issak D} } @conference {12098, title = {A trend analysis of exploitations}, booktitle = {2001 IEEE Symposium on Security and Privacy, 2001. S\&P 2001. Proceedings}, year = {2001}, month = {2001///}, pages = {214 - 229}, publisher = {IEEE}, organization = {IEEE}, abstract = {We have conducted an empirical study of a number of computer security exploits and determined that the rates at which incidents involving the exploit are reported to CERT can be modeled using a common mathematical framework. Data associated with three significant exploits involving vulnerabilities in phf, imap, and bind can all be modeled using the formula C=I+S{\texttimes}√M where C is the cumulative count of reported incidents, M is the time since the start of the exploit cycle, and I and S are the regression coefficients determined by analysis of the incident report data. Further analysis of two additional exploits involving vulnerabilities in mountd and statd confirm the model. We believe that the models will aid in predicting the severity of subsequent vulnerability exploitations, based on the rate of early incident reports}, keywords = {Computer science, computer security exploits, Data analysis, data mining, Educational institutions, exploitations, Performance analysis, Predictive models, Regression analysis, Risk management, security of data, software engineering, system intrusions, System software, trend analysis, vulnerabilities, vulnerability exploitation}, isbn = {0-7695-1046-9}, doi = {10.1109/SECPRI.2001.924300}, author = {Browne,H. K and Arbaugh, William A. and McHugh,J. and Fithen,W. L} } @conference {15658, title = {Vision Geometry X}, booktitle = {Society of Photo-Optical Instrumentation Engineers (SPIE) Conference Series}, volume = {4476}, year = {2001}, month = {2001///}, author = {Latecki,L.J. and Mount, Dave and Wu,A. Y and Melter,R.A.} } @article {13353, title = {Adaptive query processing: Technology in evolution}, journal = {IEEE Data Engineering Bulletin}, volume = {23}, year = {2000}, month = {2000///}, pages = {7 - 18}, abstract = {As query engines are scaled and federated, they must cope with highly unpredictable and changeableenvironments. In the Telegraph project, we are attempting to architect and implement a continuously adaptive query engine suitable for global-area systems, massive parallelism, and sensor networks. To set the stage for our research, we present a survey of prior work on adaptive query processing, focusing on three characterizations of adaptivity: the frequency of adaptivity, the effects of adaptivity, and the extent of adaptivity. Given this survey, we sketch directions for research in the Telegraph project. }, author = {Hellerstein,J. M and Franklin,M.J. and Chandrasekaran,S. and Deshpande, Amol and Hildrum,K. and Madden,S. and Raman,V. and Shah,M. A} } @article {14089, title = {The African trypanosome genome}, journal = {International Journal for Parasitology}, volume = {30}, year = {2000}, month = {2000/04//}, pages = {329 - 345}, abstract = {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.}, isbn = {0020-7519}, doi = {16/S0020-7519(00)00015-1}, url = {http://www.sciencedirect.com/science/article/pii/S0020751900000151}, author = {El-Sayed, Najib M. and Hegde,Priti and Quackenbush,John and Melville,Sara E. and Donelson,John E.} } @conference {15639, title = {The analysis of a simple k-means clustering algorithm}, booktitle = {Proceedings of the sixteenth annual symposium on Computational geometry}, series = {SCG {\textquoteright}00}, year = {2000}, month = {2000///}, pages = {100 - 109}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, isbn = {1-58113-224-7}, doi = {10.1145/336154.336189}, url = {http://doi.acm.org/10.1145/336154.336189}, author = {Kanungo,Tapas and Mount, Dave and Netanyahu,Nathan S. and Piatko,Christine and Silverman,Ruth and Wu,Angela Y.} } @article {15563, title = {Approximate range searching}, journal = {Computational Geometry}, volume = {17}, year = {2000}, month = {2000/12//}, pages = {135 - 152}, abstract = {The range searching problem is a fundamental problem in computational geometry, with numerous important applications. Most research has focused on solving this problem exactly, but lower bounds show that if linear space is assumed, the problem cannot be solved in polylogarithmic time, except for the case of orthogonal ranges. In this paper we show that if one is willing to allow approximate ranges, then it is possible to do much better. In particular, given a bounded range Q of diameter w and ε\>0, an approximate range query treats the range as a fuzzy object, meaning that points lying within distance εw of the boundary of Q either may or may not be counted. We show that in any fixed dimension d, a set of n points in Rd can be preprocessed in O(n+logn) time and O(n) space, such that approximate queries can be answered in O(logn(1/ε)d) time. The only assumption we make about ranges is that the intersection of a range and a d-dimensional cube can be answered in constant time (depending on dimension). For convex ranges, we tighten this to O(logn+(1/ε)d-1) time. We also present a lower bound for approximate range searching based on partition trees of Ω(logn+(1/ε)d-1), which implies optimality for convex ranges (assuming fixed dimensions). Finally, we give empirical evidence showing that allowing small relative errors can significantly improve query execution times.}, keywords = {Approximation algorithms, Box-decomposition trees, Partition trees, Range searching}, isbn = {0925-7721}, doi = {10.1016/S0925-7721(00)00022-5}, url = {http://www.sciencedirect.com/science/article/pii/S0925772100000225}, author = {Arya,Sunil and Mount, Dave} } @conference {15336, title = {Assessment of Temperature Fluctuation Models for RANS Simulations of Hypersonic Reacting Flows}, booktitle = {38th AIAA Aerospace Sciences Meeting and Exhibit}, year = {2000}, month = {2000///}, address = {Reno, NV}, abstract = {Turbulence-chemistry interactions play an important role in various fluid flow problems. In a hypersonic boundary layer, these interactions can alter the surface heating rate of the vehicle by modifying the temperature profile across the layer. The effect of these interactions is accounted for in a Reynolds-averaged Navier Stokes (RANS) simulation using a probability density function (PDF) of the temperature distribution. In this paper, two presumed PDF models are considered, namely, the Martin and Candler model and the Gaffney et al. model, and their accuracy is assessed by comparing to direct numerical simulation (DNS) of homogeneous isotropic turbulence. TheMartin and Candler model reproduces the turbulence-chemistry interactions in the flow correctly whereas the Gaffney model overpredicts the temperature fluctuations.}, author = {Sinha,K. and Martin, M.P and Candler,G. V} } @article {15464, title = {Automated test oracles for GUIs}, journal = {SIGSOFT Softw. Eng. Notes}, volume = {25}, year = {2000}, month = {2000/11//}, pages = {30 - 39}, abstract = {Graphical User Interfaces (GUIs) are critical components of today{\textquoteright}s software. Because GUIs have different characteristics than traditional software, conventional testing techniques do not apply to GUI software. In previous work, we presented an approach to generate GUI test cases, which take the form of sequences of actions. In this paper we develop a test oracle technique to determine if a GUI behaves as expected for a given test case. Our oracle uses a formal model of a GUI, expressed as sets of objects, object properties, and actions. Given the formal model and a test case, our oracle automatically derives the expected state for every action in the test case. We represent the actual state of an executing GUI in terms of objects and their properties derived from the GUI{\textquoteright}s execution. Using the actual state acquired from an execution monitor, our oracle automatically compares the expected and actual states after each action to verify the correctness of the GUI for the test case. We implemented the oracle as a component in our GUI testing system, called Planning Assisted Tester for grapHical user interface Systems (PATHS), which is based on AI planning. We experimentally evaluated the practicality and effectiveness of our oracle technique and report on the results of experiments to test and verify the behavior of our version of the Microsoft WordPad{\textquoteright}s GUI.}, keywords = {automated oracles, GUI test oracles, GUI testing}, isbn = {0163-5948}, doi = {10.1145/357474.355050}, url = {http://doi.acm.org/10.1145/357474.355050}, author = {Memon, Atif M. and Pollack,Martha E. and Soffa,Mary Lou} } @article {14899, title = {Breakout Session Report: Principles and Methods}, journal = {Perceptual Organization for Artificial Vision Systems}, year = {2000}, month = {2000///}, pages = {17 - 28}, abstract = {This report will present a summary of views presented during a discussion at the 1999 Workshop on Perceptual Organization in Computer Vision. Our goal is to present diverse views, informally expressed on principles and algorithms of perceptual organization. Naturally, such a discussion must be somewhat limited both by the time available and by the specific set of researchers who could be present. Still, we hope to describe some interesting ideas expressed and to note the number of areas of apparent consensus among a fairly broad group. In particular, we will describe views on the state of the art in perceptual grouping, and what seem to be key open questions and promising directions for addressing them.}, doi = {10.1007/978-1-4615-4413-5_2}, author = {Jacobs, David W. and Malik,J. and Nevatia, R.} } @article {15568, title = {Chromatic nearest neighbor searching: A query sensitive approach}, journal = {Computational Geometry}, volume = {17}, year = {2000}, month = {2000/12//}, pages = {97 - 119}, abstract = {The nearest neighbor problem is that of preprocessing a set P of n data points in Rd so that, given any query point q, the closest point in P to q can be determined efficiently. In the chromatic nearest neighbor problem, each point of P is assigned a color, and the problem is to determine the color of the nearest point to the query point. More generally, given k⩾1, the problem is to determine the color occurring most frequently among the k nearest neighbors. The chromatic version of the nearest neighbor problem is used in many applications in pattern recognition and learning. In this paper we present a simple algorithm for solving the chromatic k nearest neighbor problem. We provide a query sensitive analysis, which shows that if the color classes form spatially well separated clusters (as often happens in practice), then queries can be answered quite efficiently. We also allow the user to specify an error bound ε⩾0, and consider the same problem in the context of approximate nearest neighbor searching. We present empirical evidence that for well clustered data sets, this approach leads to significant improvements in efficiency.}, keywords = {BBD trees, Branch-and-bound search, Chromatic nearest neighbors, Classification algorithms, Multidimensional searching, pattern recognition, Query sensitive analysis}, isbn = {0925-7721}, doi = {10.1016/S0925-7721(00)00021-3}, url = {http://www.sciencedirect.com/science/article/pii/S0925772100000213}, author = {Mount, Dave and Netanyahu,Nathan S. and Silverman,Ruth and Wu,Angela Y.} } @article {17576, title = {Combinatorial Problems Arising in Deregulated Electrical Power Industry: Survey and Future Directions}, journal = {NONCONVEX OPTIMIZATION AND ITS APPLICATIONS}, volume = {42}, year = {2000}, month = {2000///}, pages = {138 - 162}, author = {Cook,D. and Hicks,G. and Faber,V. and Marathe,M. V and Srinivasan, Aravind and Sussmann,Y. J and Thornquist,H.} } @article {17579, title = {Contention resolution with constant expected delay}, journal = {J. ACM}, volume = {47}, year = {2000}, month = {2000/11//}, pages = {1048 - 1096}, abstract = {We study contention resolution in a multiple-access channel such as the Ethernet channel. In the model that we consider, n users generate messages for the channel according to a probability distribution. Raghavan and Upfal have given a protocol in which the expected delay (time to get serviced) of every message is O(log n) when messages are generated according to a Bernoulli distribution with generation rate up to about 1/10. Our main results are the following protocols: (a) one in which the expected average message delay is O(1) when messages are generated according to a Bernoulli distribution with a generation rate smaller than 1/e, and (b) one in which the expected delay of any message is O(1) for an analogous model in which users are synchronized (i.e., they agree about the time), there are potentially an infinite number of users, and messages are generated according to a Poisson distribution with generation rate up to 1/e. (Each message constitutes a new user.)To achieve (a), we first show how to simulate (b) using n synchronized users, and then show how to build the synchronization into the protocol.}, keywords = {contention resolution, Ethernet, Markov chains, multiple-access channel}, isbn = {0004-5411}, doi = {10.1145/355541.355567}, url = {http://doi.acm.org/10.1145/355541.355567}, author = {Goldberg,Leslie Ann and Mackenzie,Philip D. and Paterson,Mike and Srinivasan, Aravind} } @conference {13893, title = {Designing StoryRooms: interactive storytelling spaces for children}, booktitle = {Proceedings of the 3rd conference on Designing interactive systems: processes, practices, methods, and techniques}, year = {2000}, month = {2000///}, pages = {95 - 104}, author = {Alborzi,H. and Druin, Allison and Montemayor,J. and Platner,M. and Porteous,J. and Sherman,L. and Boltman,A. and Tax{\'e}n,G. and Best,J. and Hammer,J. and others} } @conference {15335, title = {DNS of a Mach 4 boundary layer with chemical reactions}, booktitle = {AIAA, Aerospace Sciences Meeting and Exhibit, 38 th, Reno, NV}, year = {2000}, month = {2000///}, author = {Martin, M.P} } @article {15547, title = {Efficient expected-case algorithms for planar point location}, journal = {Algorithm Theory-SWAT 2000}, year = {2000}, month = {2000///}, pages = {537 - 543}, doi = {10.1007/3-540-44985-X_31}, author = {Arya,S. and Cheng,S. W and Mount, Dave and Ramesh,H.} } @article {16709, title = {Evaluation of sense disambiguation given hierarchical tag sets}, journal = {Computers and the Humanities}, volume = {34}, year = {2000}, month = {2000///}, author = {Melamed,I.D. and Resnik, Philip} } @conference {17156, title = {Extending understanding of federal statistics in tables}, booktitle = {Proceedings of the 2000 annual national conference on Digital government research}, series = {dg.o {\textquoteright}00}, year = {2000}, month = {2000///}, pages = {1 - 7}, publisher = {Digital Government Society of North America}, organization = {Digital Government Society of North America}, abstract = {This paper describes progress toward improving user interfaces for US Federal government statistics that are presented in tables. Based on studies of user behaviors and needs related to statistical tables, we describe interfaces to assist diverse users with a range of statistical literacy to explore, find, understand, and use US Federal government statistics.}, keywords = {data exploration, dynamic queries, Statistics, tablular data, User interfaces}, url = {http://dl.acm.org/citation.cfm?id=1123075.1123079}, author = {Marchionini,Gary and Hert,Carol and Liddy,Liz and Shneiderman, Ben} } @article {18979, title = {Genomic Sequence, Splicing, and Gene Annotation}, journal = {American Journal of Human GeneticsAm J Hum Genet}, volume = {67}, year = {2000}, month = {2000/10//}, pages = {788 - 792}, isbn = {0002-9297}, url = {http://www.ncbi.nlm.nih.gov/pmc/articles/PMC1287883/}, author = {Mount, Stephen M.} } @conference {15591, title = {Geo-registration of Landsat data by robust matching of wavelet features}, booktitle = {Geoscience and Remote Sensing Symposium, 2000. Proceedings. IGARSS 2000. IEEE 2000 International}, volume = {4}, year = {2000}, month = {2000///}, pages = {1610 -1612 vol.4 - 1610 -1612 vol.4}, abstract = {The goal of our project is to build an operational system, which will provide a sub-pixel accuracy registration of Landsat-5 and Landsat-7 data. Integrated within an automated mass processing/analysis system for Landsat data (REALM), the input to our registration method consists of scenes that have been geometrically and radiometrically corrected, as well as pre-processed for the detection of clouds and cloud shadows. Such pre-processed scenes are then geo-registered relative to a database of Landsat chips. This paper describes our registration process, including the use of a database of landmark chips, a feature extraction performed by an overcomplete wavelet representation, and feature matching using statistically robust techniques. Knowing the approximate longitudes and latitudes of the four corners of the scene, a subset of chips which represent landmarks included in the scene are extracted from the database. For each of these selected landmark chips, a corresponding window is extracted from the scene, and each chip-window pair is registered using our robust wavelet feature matching. First results and future directions are presented in the paper}, keywords = {atmospheric techniques, automated mass processing/analysis system, chip-window pair, cloud shadows, Clouds, Feature extraction, feature matching, geo-registration, geometrically corrected scene, geophysical signal processing, Image matching, image registration, landmark chips, Landsat chips, Landsat data, Landsat-5 data, Landsat-7 data, overcomplete wavelet representation, pre-processed scenes, radiometrically corrected scene, REALM, Remote sensing, robust matching, robust wavelet feature matching, scenes, statistically robust techniques, sub-pixel accuracy registration, wavelet features, Wavelet transforms, window}, doi = {10.1109/IGARSS.2000.857287}, author = {Le Moigne,J. and Netanyahu,N. S and Masek,J. G and Mount, Dave and Goward,S. and Honzak,M.} } @inbook {15515, title = {Introduction to logic-based artificial intelligence}, booktitle = {Logic-based artificial intelligenceLogic-based artificial intelligence}, year = {2000}, month = {2000///}, pages = {3 - 33}, author = {Minker, Jack} } @conference {12168, title = {Jazz: an extensible zoomable user interface graphics toolkit in Java}, booktitle = {Proceedings of the 13th annual ACM symposium on User interface software and technology}, year = {2000}, month = {2000///}, pages = {171 - 180}, author = {Bederson, Benjamin B. and Meyer,J. and Good,L.} } @book {15513, title = {Logic-Based Artificial Intelligence}, year = {2000}, month = {2000/12/01/}, publisher = {Springer}, organization = {Springer}, abstract = {This landmark volume represents the culmination of over 40 years of research in the use of logic as a basis for representing and manipulating problems in the field of artificial intelligence. The use of logic as a basis for commonsense reasoning was started by John McCarthy in 1959. The collection consists of both original research and surveys of almost every subject that uses logic in AI, contributed by leading scientists, and grew out of preliminary work presented at the Workshop on Logic-Based Artificial Intelligence held in Washington, DC, June 1999. All papers have been extensively refereed and revised. The introductory article presents background on research that has transpired since 1959 and discusses the significance of each chapter in this context. The topics covered in the book are commonsense reasoning, knowledge representation, nonmonotonic reasoning, logic for causation and actions, planning and problem solving, cognitive robotics, logic for agents and actions, inductive reasoning, possibilistic logic, logic and beliefs, logic and language, computational logic, knowledge base system implementations, and applications of theorem proving and logic programming. Logic-Based Artificial Intelligence is invaluable to graduate students and researchers in artificial intelligence, and advanced methods for database and knowledge base systems. Logic-Based Artificial Intelligence will also be of interest to those applying theorem proving methods to problems in program and hardware verification, to those who deal with large knowledge base systems, those developing cognitive robotics, and for those interested in the solution of McCarthy{\textquoteright}s 1959 "oldest planning problem in AI: getting from home to the airport".}, keywords = {Artificial intelligence, COMPUTER LOGIC, Computers / Computer Science, Computers / Intelligence (AI) \& Semantics, Logic, Symbolic and mathematical, Mathematics / Logic, Medical / General}, isbn = {9780792372240}, author = {Minker, Jack} } @article {16479, title = {Logic-based query optimization for object databases}, journal = {IEEE Transactions on Knowledge and Data Engineering}, volume = {12}, year = {2000}, month = {2000/08//Jul}, pages = {529 - 547}, abstract = {We present a technique for transferring query optimization techniques, developed for relational databases, into object databases. We demonstrate this technique for ODMG database schemas defined in ODL and object queries expressed in OQL. The object schema is represented using a logical representation (Datalog). Semantic knowledge about the object data model, e.g., class hierarchy information, relationship between objects, etc., as well as semantic knowledge about a particular schema and application domain are expressed as integrity constraints. An OQL object query is represented as a logic query and query optimization is performed in the Datalog representation. We obtain equivalent (optimized) logic queries, and subsequently obtain equivalent (optimized) OQL queries for each equivalent logic query. We present one optimization technique for semantic query optimization (SQO) based on the residue technique of U. Charavarthy et al. (1990; 1986; 1988). We show that our technique generalizes previous research on SQO for object databases. We handle a large class of OQL queries, including queries with constructors and methods. We demonstrate how SQO can be used to eliminate queries which contain contradictions and simplify queries, e.g., by eliminating joins, or by reducing the access scope for evaluating a query to some specific subclass(es). We also demonstrate how the definition of a method or integrity constraints describing the method, can be used in optimizing a query with a method}, keywords = {access scope, application domain, class hierarchy information, Constraint optimization, data integrity, Data models, Datalog, Datalog representation, deductive databases, equivalent logic query, integrity constraints, Lifting equipment, Logic, logic based query optimization, logic programming, logic queries, logic query, logical representation, object data model, object databases, object queries, object schema, object-oriented databases, ODL, ODMG database schemas, optimization technique, optimized OQL queries, OQL object query, query languages, Query optimization, query optimization techniques, Query processing, Relational databases, residue technique, semantic knowledge, semantic query optimization}, isbn = {1041-4347}, doi = {10.1109/69.868906}, author = {Grant,J. and Gryz,J. and Minker, Jack and Raschid, Louiqa} } @conference {14987, title = {MOCHA: a database middleware system featuring automatic deployment of application-specific functionality}, booktitle = {Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, Dallas, Texas}, year = {2000}, month = {2000///}, author = {Rodr{\i}guez-Martinez,M. and Roussopoulos, Nick and McGann,J. M and Keyley,S. and Katz,V. and Song,Z. and JaJa, Joseph F.} } @article {15370, title = {A model for magnetic aftereffect in the presence of time varying demagnetizing fields}, journal = {Magnetics, IEEE Transactions on}, volume = {36}, year = {2000}, month = {2000/09//}, pages = {3182 - 3184}, abstract = {Preisach models driven by stochastic inputs are employed to model magnetic aftereffect in the presence of demagnetizing fields. As a result of thermal relaxation, the magnetization and, consequently, the demagnetizing field vary in time. The new model generalizes earlier work and self-consistently accounts for the effect of time varying demagnetizing fields on the relaxation process. Three practical numerical techniques are proposed to compute the time variation in the magnetic field and the state of the Preisach plane}, keywords = {aftereffect;, aftereffect;magnetization;numerical, demagnetizing, field;demagnetisation;magnetic, model;magnetic, Preisach, relaxation;time, simulation;thermal, varying}, isbn = {0018-9464}, doi = {10.1109/20.908729}, author = {Korman,C.E. and Adly,A.A. and Mayergoyz, Issak D and Rugkwamsook,P.} } @conference {15589, title = {Nearly optimal expected-case planar point location}, booktitle = {Foundations of Computer Science, 2000. Proceedings. 41st Annual Symposium on}, year = {2000}, month = {2000///}, pages = {208 - 218}, abstract = {We consider the planar point location problem from the perspective of expected search time. We are given a planar polygonal subdivision S and for each polygon of the subdivision the probability that a query point lies within this polygon. The goal is to compute a search structure to determine which cell of the subdivision contains a given query point, so as to minimize the expected search time. This is a generalization of the classical problem of computing an optimal binary search tree for one-dimensional keys. In the one-dimensional case it has long been known that the entropy H of the distribution is the dominant term in the lower bound on the expected-case search time, and further there exist search trees achieving expected search times of at most H+2. Prior to this work, there has been no known structure for planar point location with an expected search time better than 2H, and this result required strong assumptions on the nature of the query point distribution. Here we present a data structure whose expected search time is nearly equal to the entropy lower bound, namely H+o(H). The result holds for any polygonal subdivision in which the number of sides of each of the polygonal cells is bounded, and there are no assumptions on the query distribution within each cell. We extend these results to subdivisions with convex cells, assuming a uniform query distribution within each cell}, keywords = {computational geometry, convex cells, data structure, expected search time, nearly optimal expected-case planar point location, optimal binary search tree, planar point location, planar polygonal subdivision, polygonal cells, polygonal subdivision, probability, search problems, search structure, subdivision, trees (mathematics)}, doi = {10.1109/SFCS.2000.892108}, author = {Arya,S. and Malamatos,T. and Mount, Dave} } @article {15396, title = {Numerical simulation of small-signal microwave performance of 4H{\textendash}SiC MESFET}, journal = {Solid-State Electronics}, volume = {44}, year = {2000}, month = {2000/07/01/}, pages = {1281 - 1287}, abstract = {Small-signal high frequency characteristics of 4H{\textendash}SiC MESFET has been studied by using two-dimensional numerical drift-diffusion model in frequency domain. Non-ideal Schottky boundary conditions have been introduced that take into account a thin interfacial layer and interface energy states. It has been demonstrated that the 10 dB/dec small-signal current gain roll-off can be attributed to the existence of high density interface states at the metal{\textendash}semiconductor interface. It has been found that as the gate length is reduced to 0.1 μm, fT and fmax may reach as high as 30 and 62 GHz, respectively.}, isbn = {0038-1101}, doi = {10.1016/S0038-1101(00)00025-3}, url = {http://www.sciencedirect.com/science/article/pii/S0038110100000253}, author = {Huang,Mingwei and Mayergoyz, Issak D and Goldsman,Neil} } @article {15449, title = {A planning-based approach to GUI testing}, journal = {Proceedings of The 13th International Software/Internet Quality Week}, year = {2000}, month = {2000///}, author = {Memon, Atif M. and Pollack,M. E and Soffa,M. L} } @conference {15628, title = {A point-placement strategy for conforming Delaunay tetrahedralization}, booktitle = {Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms}, series = {SODA {\textquoteright}00}, year = {2000}, month = {2000///}, pages = {67 - 74}, publisher = {Society for Industrial and Applied Mathematics}, organization = {Society for Industrial and Applied Mathematics}, address = {Philadelphia, PA, USA}, isbn = {0-89871-453-2}, url = {http://dl.acm.org/citation.cfm?id=338219.338236}, author = {Murphy,Michael and Mount, Dave and Gable,Carl W.} } @article {18987, title = {Pre-Messenger RNA Processing Factors in the Drosophila Genome}, journal = {The Journal of Cell BiologyJ Cell Biol}, volume = {150}, year = {2000}, month = {2000/07/24/}, pages = {F37-F44 - F37-F44}, abstract = {In eukaryotes, messenger RNAs are generated by a process that includes coordinated splicing and 3' end formation. Factors essential for the splicing of mRNA precursors (pre-mRNA) in eukaryotes have been identified primarily through the study of nuclear extracts derived from mammalian cells and Saccharomyces cerevisiae genetics. Here, we identify homologues of most known pre-mRNA processing factors in the recently completed sequence of the Drosophila genome. The set of proteins required for RNA processing shows remarkably little variation among eukaryotic species, and individual proteins are highly conserved. In general, proteins involved in the mechanics of RNA processing are even more conserved than proteins involved in the interpretation of RNA processing signals. The genome does not appear to contain a gene for the U11 RNA, or for a protein unique to the U11 snRNP, which raises the possibility that the U12-dependent spliceosome functions without U11 in Drosophila.}, isbn = {0021-9525, 1540-8140}, doi = {10.1083/jcb.150.2.F37}, url = {http://jcb.rupress.org/content/150/2/F37}, author = {Mount, Stephen M. and Salz,Helen K.} } @article {17327, title = {Previews and overviews in digital libraries: Designing surrogates to support visual information seeking}, journal = {Journal of the American Society for Information Science}, volume = {51}, year = {2000}, month = {2000/01/01/}, pages = {380 - 393}, abstract = {To aid designers of digital library interfaces, we present a framework for the design of information representations in terms of previews and overviews. Previews and overviews are graphic or textual representations of information abstracted from primary information objects. Previews act as surrogates for one or a few objects and overviews represent collections of objects. A design framework is elaborated in terms of the following three dimensions: (1) what information objects are available to users, (2) how information objects are related and displayed, and (3) how users can manipulate information objects. When utilized properly, previews and overviews allow users to rapidly discriminate objects of interest from those not of interest, and to more fully understand the scope and nature of digital libraries. This article presents a definition of previews and overviews in context, provides design guidelines, and describes four example applications.}, isbn = {1097-4571}, doi = {10.1002/(SICI)1097-4571(2000)51:4<380::AID-ASI7>3.0.CO;2-5}, url = {http://onlinelibrary.wiley.com/doi/10.1002/(SICI)1097-4571(2000)51:4\%3C380::AID-ASI7\%3E3.0.CO;2-5/abstract;jsessionid=E15C609DE95671E0E91A862B8AFD1CC6.d03t01}, author = {Greene,Stephan and Marchionini,Gary and Plaisant, Catherine and Shneiderman, Ben} } @article {15607, title = {Quantile approximation for robust statistical estimation and k-enclosing problems}, journal = {International Journal of Computational Geometry and Applications}, volume = {10}, year = {2000}, month = {2000///}, pages = {593 - 608}, abstract = {Given a set P of n points in Rd, a fundamental problem in computational geometryis concerned with finding the smallest shape of some type that encloses all the points of P. Well-known instances of this problem include finding the smallest enclosing box, minimum volume ball, and minimum volume annulus. In this paper we consider the following variant: Given a set of n points in Rd, find the smallest shape in question that contains at least k points or a certain quantile of the data. This type of problem is known as a k-enclosing problem. We present a simple algorithmic framework for computing quantile approximations for the minimum strip, ellipsoid, and annulus containing a given quantile of the points. The algorithms run in O(n log n) time. }, author = {Mount, Dave and Netanyahu,N. S and Piatko,C. D and Silverman,R. and Wu,A. Y} } @article {15401, title = {Resolution enhancement by applying MFM under UHV conditions}, journal = {Magnetics, IEEE Transactions on}, volume = {36}, year = {2000}, month = {2000/09//}, pages = {2975 - 2977}, abstract = {The enhancement in signal-to-noise ratio and lateral resolution in MFM in going from ambient pressure to UHV is demonstrated. The performance of several cantilevers is evaluated using a patterned 50 nm thick permalloy film, with cross-tie as well as 90 deg; domain walls, and a 200 nm thick permalloy film with perpendicular magnetization. The increase in the quality factor of the cantilever oscillation in UHV improves the sensitivity, consequently allowing less magnetic material on the tip to achieve the same signal-to-noise ratio. This reduction in magnetic volume sharpens the lateral resolution. We also demonstrate that the magnetic interaction can be so weak that a magnetic contrast is visible only under UHV conditions}, keywords = {conditions;cantilevers;domain, contrast;magnetic, domain, enhancement;Permalloy;magnetic, enhancement;signal-to-noise, film;perpendicular, films;magnetisation;, force, magnetization;resolution, MFM;NiFe;UHV, microscopy;magnetic, ratio, resolution;magnetic, thin, volume;permalloy, walls;lateral, walls;magnetic}, isbn = {0018-9464}, doi = {10.1109/20.908645}, author = {Dreyer,M. and Gomez,R.D. and Mayergoyz, Issak D} } @article {14652, title = {A Review of Current Routing Protocols for Ad Hoc}, journal = {IEEE Personal Communications}, volume = {29}, year = {2000}, month = {2000///}, pages = {156 - 71}, author = {Royer,E.M. and Toh,C.K. and Hicks, Michael W. and Kakkar,P. and Moore,J. T and Hicks, Michael W. and Moore,J. T and Alexander,D. S and Gunter,C. A and Nettles,S. and others} } @article {18270, title = {Rotation, scale, and translation resilient public watermarking for images}, journal = {PROC SPIE INT SOC OPT ENG}, volume = {3971}, year = {2000}, month = {2000///}, pages = {90 - 98}, abstract = {Many electronic watermarks for still images and video content are sensitive to geometric distortions. For example,simple rotation, scaling, and/or translation (RST) of an image can prevent detection of a public watermark. In this paper, we propose a watermarking algorithm that is robust to RST distortions. The watermark is embedded into a 1-dimensional signal obtained by first taking the Fourier transform of the image, resampling the Fourier magnitudes into log-polar coordinates, and then summing a function of those magnitudes along the log-radius axis. If the image is rotated, the resulting signal is cyclically shifted. If it is scaled, the signal is multiplied by some value. And if the image is translated, the signal is unaffected. We can therefore compensate for rotation with a simple search, and for scaling by using the correlation coefficient for the detection metric. False positive results on a database of 10,000 images are reported. Robustness results on a database of 2,000 images are described. It is shown that the watermark is robust to rotation, scale and translation. In addition, the algorithm shows resistance to cropping. }, author = {Lin,C.Y. and Wu,M. and Bloom,J.A. and Cox,I.J. and Miller,M.L. and Lui,Y.M.} } @article {12089, title = {Secure quality of service handling: SQoSH}, journal = {IEEE Communications Magazine}, volume = {38}, year = {2000}, month = {2000/04//}, pages = {106 - 112}, abstract = {Proposals for programmable network infrastructures, such as active networks and open signaling, provide programmers with access to network resources and data structures. The motivation for providing these interfaces is accelerated introduction of new services, but exposure of the interfaces introduces many new security risks. We describe some of the security issues raised by active networks. We then describe our secure active network environment (SANE) architecture. SANE was designed as a security infrastructure for active networks, and was implemented in the SwitchWare architecture. SANE restricts the actions that loaded modules can perform by restricting the resources that can be named; this is further extended to remote invocation by means of cryptographic credentials. SANE can be extended to support restricted control of quality of service in a programmable network element. The Piglet lightweight device kernel provides a {\textquotedblleft}virtual clock{\textquotedblright} type of scheduling discipline for network traffic, and exports several tuning knobs with which the clock can be adjusted. The ALIEN active loader provides safe access to these knobs to modules that operate on the network element. Thus, the proposed SQoSH architecture is able to provide safe, secure access to network resources, while allowing these resources to be managed by end users needing customized networking services. A desirable consequence of SQoSH{\textquoteright}s integration of access control and resource control is that a large class of denial-of-service attacks, unaddressed solely with access control and cryptographic protocols, can now be prevented}, keywords = {Acceleration, Access control, active networks, ALIEN active loader, Clocks, Computer network management, cryptographic credentials, cryptography, customized networking services, Data security, Data structures, denial-of-service attacks, interfaces, Kernel, loaded modules, network resources, network traffic, open signaling, packet switching, Piglet lightweight device kernel, programmable network element, programmable network infrastructures, Programming profession, Proposals, quality of service, remote invocation, resource control, restricted control of quality of service, SANE, scheduling, scheduling discipline, secure active network environment architecture, secure quality of service handling, security infrastructure, security risks, SQoSH, SwitchWare architecture, telecommunication security, tuning knobs, virtual clock}, isbn = {0163-6804}, doi = {10.1109/35.833566}, author = {Alexander,D. S and Arbaugh, William A. and Keromytis,A. D and Muir,S. and Smith,J. M} } @conference {16163, title = {A storytelling robot for pediatric rehabilitation}, booktitle = {Proceedings of the fourth international ACM conference on Assistive technologies}, series = {Assets {\textquoteright}00}, year = {2000}, month = {2000///}, pages = {50 - 55}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, keywords = {children, design process, rehabilitation, robot, therapeutic play, user interface}, isbn = {1-58113-313-8}, doi = {10.1145/354324.354338}, url = {http://doi.acm.org/10.1145/354324.354338}, author = {Plaisant, Catherine and Druin, Allison and Lathan,Corinna and Dakhane,Kapil and Edwards,Kris and Vice,Jack Maxwell and Montemayor,Jaime} } @article {15337, title = {Subgrid-scale models for compressible large-eddy simulations}, journal = {Theoretical and Computational Fluid Dynamics}, volume = {13}, year = {2000}, month = {2000///}, pages = {361 - 376}, author = {Martin, M.P and Piomelli,U. and Candler,G. V} } @conference {12323, title = {Systematic consolidation of input and output buffers in synchronous dataflow specifications}, booktitle = {Signal Processing Systems, 2000. SiPS 2000. 2000 IEEE Workshop on}, year = {2000}, month = {2000///}, pages = {673 - 682}, author = {Murthy,P. K and Bhattacharyya, Shuvra S.} } @conference {13682, title = {Tools and Techniques for Video Performances Evaluation}, booktitle = {ICPR}, volume = {4}, year = {2000}, month = {2000///}, pages = {167 - 170}, author = {David Doermann and Mihalcik,D.} } @article {15351, title = {Toward the large-eddy simulation over a hypersonic elliptical cross-section cone}, journal = {AIAA Paper No. 00-2311}, year = {2000}, month = {2000///}, author = {Martin, M.P and Weirs,G. and Candler,G. V and Piomelli,U. and Johnson,H. and Nompelis,I.} } @conference {16505, title = {Using quality of data metadata for source selection and ranking}, booktitle = {Proceedings of the Third International Workshop on the Web and Databases, WebDB}, year = {2000}, month = {2000///}, pages = {93 - 98}, author = {Mihaila,G. A and Raschid, Louiqa and Vidal,M. E} } @article {15605, title = {Visibility stabs and depth-first spiralling on line segments in output sensitive time}, journal = {International Journal of Computational Geometry and Applications}, volume = {10}, year = {2000}, month = {2000///}, pages = {535 - 552}, abstract = {Given a set S of n non-intersecting line segments in the plane, we present a newtechnique for e ciently traversing the endpoint visibility graph of S to solve a variety of visibility problems in output sensitive time. In particular, we develop two techniques to compute the 2n visibility polygons of the endpoints of S, in output sensitive time. Depth- rst spiralling is a technique that relies on the ordered endpoint visibility graph information to traverse the endpoints of S in a spiral-like manner using a combination of Jarvis{\textquoteright} March and depth- rst search. It is a practical method and has been implemented in C++ using LEDA. }, author = {Keil,M. and Mount, Dave and Wismath,S.K.} } @article {15661, title = {Vision geometry IX:(San Diego CA, 30-31 July 2000)}, journal = {SPIE proceedings series}, year = {2000}, month = {2000///}, author = {Latecki,L.J. and Mount, Dave and Wu,A. Y} } @inbook {17671, title = {Wavelength Rerouting in Optical Networks, or the Venetian Routing Problem}, booktitle = {Approximation Algorithms for Combinatorial Optimization}, series = {Lecture Notes in Computer Science}, volume = {1913}, year = {2000}, month = {2000///}, pages = {71 - 84}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {Wavelength rerouting has been suggested as a viable and cost-effective method to improve the blocking performance of wavelength-routed Wavelength-Division Multiplexing (WDM) networks. This method leads to the following combinatorial optimization problem, dubbed Venetian Routing. Given a directed multigraph G along with two vertices s and t and a collection of pairwise arc-disjoint paths, we wish to find an st -path which arc-intersects the smallest possible number of such paths. In this paper we prove the computational hardness oft his problem even in various special cases, and present several approximation algorithms for its solution. In particular we show a non-trivial connection between Venetian Routing and Label Cover.}, isbn = {978-3-540-67996-7}, url = {http://dx.doi.org/10.1007/3-540-44436-X_9}, author = {Caprara,Alberto and Italiano,Giuseppe and Mohan,G. and Panconesi,Alessandro and Srinivasan, Aravind}, editor = {Jansen,Klaus and Khuller, Samir} } @conference {15052, title = {Web based progressive transmission for browsing remotely sensed imagery}, booktitle = {Geoscience and Remote Sensing Symposium, 2000. Proceedings. IGARSS 2000. IEEE 2000 International}, volume = {2}, year = {2000}, month = {2000///}, pages = {591 -593 vol.2 - 591 -593 vol.2}, abstract = {This paper describes an image representation technique that entails progressive refinement of user specified regions of interest (ROI) of large images. Progressive refinement to original quality can be accomplished in theory. However, due to heavy burden on storage resources for the authors{\textquoteright} applications, they restrict the refinement to about 25\% of the original data resolution. A wavelet decomposition of the data combined with scalar and vector quantization (VQ) of the high frequency components and JPEG/DCT compression of low frequency component is used as representation framework. Their software will reconstruct the region selected by the user from its wavelet decomposition such that it fills up the preview window with the appropriate subimages at the desired resolution, including full resolution stored for preview. Further refinement from the first preview can be obtained progressively by transmitting high frequency coefficients from low resolution to high resolution which are compressed by variant of vector quantization called model-based VQ (MVQ). The user will have an option for progressive build up of the ROIs until full resolution stored or terminate the transmission at any time during the progressive refinement}, keywords = {based, decomposition;geophysical, image;model-based, interest;remote, interest;vector, mapping;user, mapping;vector, measurement, of, processing;geophysical, processing;image, Progressive, quantisation;wavelet, quantization;wavelet, refinement;region, regions, representation;land, representation;remote, sensing;scalar;terrain, sensing;terrain, signal, specified, specified;user, surface;large, technique;image, techniques;image, transforms;, transmission;browsing;geophysical, VQ;progressive, Web}, doi = {10.1109/IGARSS.2000.861640}, author = {Mareboyana,M. and Srivastava,S. and JaJa, Joseph F.} } @article {12081, title = {Windows of Vulnerability: A Case Study Analysis}, volume = {33}, year = {2000}, month = {2000///}, pages = {52 - 59}, abstract = {The authors propose a life-cycle model for system vulnerabilities, applying to three case studies to show how systems remain vulnerable long after security fixes are available. Complex information and communication systems give rise to design, implementation, and management errors, leading to a vulnerability in an information technology product that can allow security policy violations. Using their vulnerability life-cycle model, the authors present a case study analysis of specific computer vulnerabilities. For each case, the authors provide background information about the vulnerability, such as how attackers exploited it and which systems were affected. They tie the case to the life-cycle model by identifying the dates for each state within the model. Finally, they use a histogram of reported intrusions to show the life of the vulnerability and conclude with an analysis specific to the particular vulnerability.}, isbn = {0018-9162}, author = {Arbaugh, William A. and Fithen,William L. and McHugh,John} } @article {16916, title = {1D, 2D, 3D}, journal = {Readings in information visualization}, year = {1999}, month = {1999///}, pages = {57 - 61}, author = {Card,S.K. and Mackinlay,J.D. and Shneiderman, Ben} } @conference {15376, title = {Advances in spherical harmonic device modeling: calibration and nanoscale electron dynamics}, booktitle = {Simulation of Semiconductor Processes and Devices, 1999. SISPAD {\textquoteright}99. 1999 International Conference on}, year = {1999}, month = {1999///}, pages = {167 - 170}, abstract = {Improvements in the Spherical Harmonic (SH) method for solving Boltzmann Transport Equation (BTE) are presented. The simulation results provide the same physical detail as analytical band Monte Carlo (MC) calculations, and are obtained approximately a thousand times faster. A new physical model for surface scattering has also been developed. As a result, the SHBTE model achieves calibration for a complete process of I-V characteristics and substrate current consistently for the first time}, keywords = {Boltzmann, characteristics;SHBTE, current;surface, device, dynamics;spherical, electron, equation;calibration;semiconductor, equation;I-V, harmonic, model;substrate, models;surface, scattering;, scattering;Boltzmann, simulation;calibration;nanoscale, transport}, doi = {10.1109/SISPAD.1999.799287}, author = {Lin,Chung-Kai and Goldsman,N. and Mayergoyz, Issak D and Aronowitz,S. and Belova,N.} } @article {16958, title = {Alternate geometry}, journal = {Readings in information visualization}, year = {1999}, month = {1999///}, pages = {381 - 381}, author = {Card,S.K. and Mackinlay,J.D. and Shneiderman, Ben} } @article {16977, title = {Applications and implications}, journal = {Readings in information visualization}, year = {1999}, month = {1999///}, pages = {625 - 635}, author = {Card,S.K. and Mackinlay,J.D. and Shneiderman, Ben} } @mastersthesis {15518, title = {An architecture and implementation for a cooperative database system}, year = {1999}, month = {1999///}, school = {University of Maryland at College Park}, author = {Godfrey,P. and Minker, Jack} } @article {16991, title = {Bifocal lens}, journal = {Readings in information visualization}, year = {1999}, month = {1999///}, pages = {331 - 332}, author = {Card,S.K. and Mackinlay,J.D. and Shneiderman, Ben} } @article {15546, title = {Binary space parititions in pl{\"u}cker space}, journal = {Algorithm Engineering and Experimentation}, year = {1999}, month = {1999///}, pages = {663 - 663}, abstract = {One of the important potential applications of computational geometry is in the field of computer graphics. One challenging computational problem in computer graphics is that of rendering scenes with nearly photographic realism. A major distinction in lighting and shading models in computer graphics is between local illumination models and global illumination models. Local illumination models are available with most commercial graphics software. In such a model the color of a point on an object is modeled as a function of the local surface properties of the object and its relation to a typically small number of point light sources. The other objects of scene have no effect. In contrast, in global illumination models, the color of a point is determined by considering illumination both from direct light sources as well as indirect lighting from other surfaces in the environment. In some sense, there is no longer a distinction between objects and light sources, since every surface is a potential emitter of (indirect) light. Two physical-based methods dominate the field of global illumination. They are ray tracing [8] and radiosity [3].}, doi = {10.1007/3-540-48518-X_6}, author = {Mount, Dave and Pu,F. T} } @article {14781, title = {Binary version management for computational grids}, journal = {Parallel processing letters}, volume = {9}, year = {1999}, month = {1999///}, pages = {215 - 225}, author = {Hollingsworth, Jeffrey K and Miller, E. L and Akala, K.} } @article {15228, title = {The budgeted maximum coverage problem}, journal = {Information Processing Letters}, volume = {70}, year = {1999}, month = {1999///}, pages = {39 - 45}, author = {Khuller, Samir and Moss,A. and Naor,J. S} } @article {14665, title = {Chunks in PLAN: Language support for programs as packets}, journal = {PROCEEDINGS OF THE ANNUAL ALLERTON CONFERENCE ON COMMUNICATION CONTROL AND COMPUTING}, volume = {37}, year = {1999}, month = {1999///}, pages = {PROCEEDINGS OF THE ANNUAL ALLERTON CONFERENCE ON COMMUNICATION CONTROL AND COMPUTING - PROCEEDINGS OF THE ANNUAL ALLERTON CONFER}, author = {Moore,J. T and Hicks, Michael W. and Nettles,S.} } @article {15502, title = {Comparing causal-link and propositional planners: Tradeoffs between plan length and domain size}, year = {1999}, month = {1999///}, institution = {Technical Report 99-06, University of Pittsburgh, Pittsburgh}, abstract = {Recent studies have shown that propositional planners, which de-rive from Graphplan and SATPLAN, can generate significantly longer plans than causal-link planners. We present experimental evidence demonstrating that while this may be true, propositional planners also have important limitations relative to the causal-link planners: specifically, they can generate plans only for smaller domains, where the size of a domain is defined by the number of distinguishable objects it contains. Our experiments were conducted in the domain of code optimization, in which the states of the world represent states of the computer program code and the planning operators are the optimiza- tion operators. This domain is well-suited to studying the trade-offs between plan length and domain size, because it is straightforward to manipulate both these factors. On the basis of our experiments, we conclude that causal-link and propositional planners have complementary strengths. }, author = {Memon, Atif M. and Pollack,M. and Soffa,M. L} } @conference {15640, title = {Computing nearest neighbors for moving points and applications to clustering}, booktitle = {Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms}, series = {SODA {\textquoteright}99}, year = {1999}, month = {1999///}, pages = {931 - 932}, publisher = {Society for Industrial and Applied Mathematics}, organization = {Society for Industrial and Applied Mathematics}, address = {Philadelphia, PA, USA}, isbn = {0-89871-434-6}, url = {http://dl.acm.org/citation.cfm?id=314500.315095}, author = {Kanungo,Tapas and Mount, Dave and Netanyahu,Nathan S. and Piatko,Christine and Silverman,Ruth and Wu,Angela Y.} } @article {17055, title = {Departments-Book Preview-Readings in Information Visualization: Using Vision to Think}, journal = {Interactions}, volume = {6}, year = {1999}, month = {1999///}, pages = {51 - 51}, author = {Card,S.K. and Mackinlay,J. and Shneiderman, Ben} } @conference {13938, title = {Designing PETS: a personal electronic teller of stories}, booktitle = {Proceedings of the SIGCHI conference on Human factors in computing systems: the CHI is the limit}, series = {CHI {\textquoteright}99}, year = {1999}, month = {1999///}, pages = {326 - 329}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {We have begun the development of a new robotic pet that cansupport children in the storytelling process. Children can build their own pet by snapping together the modular animal parts of the PETS robot. After their pet is built, children can tell stories using the My Pets software. These stories can then be acted out by their robotic pet. This video paper describes the motivation for this research and the design process of our intergenerational design team in building the first PETS prototypes. We will discuss our progress to date and our focus for the future. }, keywords = {children, cooperative inquiry, design techniques, educational applications, intergenerational design team, PETS, ROBOTICS}, isbn = {0-201-48559-1}, doi = {10.1145/302979.303103}, url = {http://doi.acm.org/10.1145/302979.303103}, author = {Druin, Allison and Montemayor,Jamie and Hendler,Jim and McAlister,Britt and Boltman,Angela and Fiterman,Eric and Plaisant,Aurelie and Kruskal,Alex and Olsen,Hanne and Revett,Isabella and Schwenn,Thomas Plaisant and Sumida,Lauren and Wagner,Rebecca} } @inbook {17100, title = {Dynamic queries}, booktitle = {Readings in information visualizationReadings in information visualization}, year = {1999}, month = {1999///}, pages = {235 - 235}, author = {Card,S.K. and Mackinlay,J.D. and Shneiderman, Ben} } @article {15614, title = {Efficient algorithms for robust feature matching}, journal = {Pattern Recognition}, volume = {32}, year = {1999}, month = {1999///}, pages = {17 - 38}, abstract = {One of the basic building blocks in any point-based registration scheme involves matching feature points that areextracted from a sensed image to their counterparts in a reference image. This leads to the fundamental problem of point matching: Given two sets of points, find the (affine) transformation that transforms one point set so that its distance from the other point set is minimized. Because of measurement errors and the presence of outlying data points, it is important that the distance measure between the two point sets be robust to these effects. We measure distances using the partial Hausdorff distance. Point matching can be a computationally intensive task, and a number of theoretical and applied approaches have been proposed for solving this problem. In this paper, we present two algorithmic approaches to the point matching problem, in an attempt to reduce its computational complexity, while still providing a guarantee of the quality of the final match. Our first method is an approximation algorithm, which is loosely based on a branch-and- bound approach due to Huttenlocher and Rucklidge, (Technical Report 1321, Dept. of Computer Science, Cornell University, Ithaca, 1992; Proc. IEEE Conf. on Computer vision and Pattern Recognition, New York, 1993, pp. 705{\textemdash}706). We show that by varying the approximation error bounds, it is possible to achieve a tradeoff between the quality of the match and the running time of the algorithm. Our second method involves a Monte Carlo method for accelerating the search process used in the first algorithm. This algorithm operates within the framework of a branch-and-bound procedure, but employs point-to-point alignments to accelerate the search. We show that this combination retains many of the strengths of branch-and-bound search, but provides significantly faster search times by exploiting alignments. With high probability, this method succeeds in finding an approximately optimal match. We demonstrate the algorithms{\textquoteright} performances on both synthetically generated data points and actual satellite images. }, author = {Mount, Dave and Netanyahu,N. S and Le Moigne,J.} } @article {16172, title = {The end of zero-hit queries: query previews for NASA{\textquoteright}s Global Change Master Directory}, journal = {International Journal on Digital Libraries}, volume = {2}, year = {1999}, month = {1999///}, pages = {79 - 90}, abstract = {The Human-Computer Interaction Laboratory (HCIL) of the University of Maryland and NASA have collaborated over three years to refine and apply user interface research concepts developed at HCIL in order to improve the usability of NASA data services. The research focused on dynamic query user interfaces, visualization, and overview + preview designs. An operational prototype, using query previews, was implemented with NASA{\textquoteright}s Global Change Master Directory (GCMD), a directory service for earth science datasets. Users can see the histogram of the data distribution over several attributes and choose among attribute values. A result bar shows the cardinality of the result set, thereby preventing users from submitting queries that would have zero hits. Our experience confirmed the importance of metadata accuracy and completeness. The query preview interfaces make visible the problems or gaps in the metadata that are undetectable with classic form fill-in interfaces. This could be seen as a problem, but we think that it will have a long-term beneficial effect on the quality of the metadata as data providers will be compelled to produce more complete and accurate metadata. The adaptation of the research prototype to the NASA data required revised data structures and algorithms.}, isbn = {1432-5012}, url = {http://dx.doi.org/10.1007/s007990050039}, author = {Greene,Stephan and Tanin,Egemen and Plaisant, Catherine and Shneiderman, Ben and Olsen,Lola and Major,Gene and Johns,Steve} } @conference {15692, title = {End-to-end request handling in distributed Video-on-Demand systems}, booktitle = {Proceedings of the CNDS Conference (Society for Computer Simulation)}, year = {1999}, month = {1999///}, pages = {151 - 157}, author = {Mundur, Padma and Simon,R. and Sood,A.} } @article {12767, title = {On the evolution of reactive components: A process-algebraic approach}, journal = {Lecture notes in computer science}, year = {1999}, month = {1999///}, pages = {161 - 175}, author = {M\{\"u}ller-Olm,M. and Steffen,B. and Cleaveland, Rance} } @article {16971, title = {An Exploratory Study of Video Browsing, User Interface Designs and Research Methodologies: Effectiveness in Information Seeking Tasks}, journal = {PROCEEDINGS OF THE ANNUAL MEETING-AMERICAN SOCIETY FOR INFORMATION SCIENCE}, volume = {36}, year = {1999}, month = {1999///}, pages = {681 - 692}, abstract = {The purpose of this exploratory study is to develop research methods to compare the effectiveness of two video browsing interface designs, or surrogates one static (storyboard) and one dynamic (slide show) on two distinct information seeking tasks (gist determination and object recognition). Although video data is multimodal, potentially consisting of images, speech, sound, and text, the surrogates tested depend on image data only and use key frames or stills extracted from source video. A test system was developed to determine the effects of different key frame displays on user performance in specified information seeking tasks. The independent variables were interface display and task type. The dependent variables were task accuracy and subjective satisfaction. Covariates included spatial visual ability and time-to-completion. The study used a repeated block factorial 2x2 design; each of 20 participants interacted with all four interface-task combinations. No statistically significant results for task accuracy were found. Statistically significant differences were found, however, for user satisfaction with the display types: users assessed the static display to be "easier" to use than the dynamic display for both task types, even though there were no performance differences. This methodological approach provides a useful way to learn about the relationship between surrogate types and user tasks during video browsing.}, author = {Tse,T. and Vegh,S. and Shneiderman, Ben and Marchionini,G.} } @inbook {17170, title = {Fisheye views}, booktitle = {Readings in information visualizationReadings in information visualization}, year = {1999}, month = {1999///}, pages = {311 - 311}, author = {Card,S.K. and Mackinlay,J.D. and Shneiderman, Ben} } @inbook {17172, title = {Focus+ context}, booktitle = {Readings in information visualizationReadings in information visualization}, year = {1999}, month = {1999///}, pages = {306 - 309}, author = {Card,S.K. and Mackinlay,J.D. and Shneiderman, Ben} } @conference {15386, title = {Gate leakage current simulation by Boltzmann transport equation and its dependence on the gate oxide thickness}, booktitle = {Simulation of Semiconductor Processes and Devices, 1999. SISPAD {\textquoteright}99. 1999 International Conference on}, year = {1999}, month = {1999///}, pages = {247 - 250}, abstract = {As device dimensions shrink toward 0.1 mu;m, gate oxides are becoming so thin that MOSFET gate leakage current and oxide degradation are becoming limiting issues. We provide a more rigorous way to calculate gate leakage current. To achieve this we build upon the Spherical Harmonic Method of modeling, which deterministically solves the Boltzmann equation for an entire device. The method gives the distribution function and is 1000 times faster than MC. Once the distribution function is calculated, the tunneling probability is derived from the first principle WKB method. The barrier lowering effect is accounted for by the method of image charges. We calculate gate leakage current as a function of DC bias. The thermionic and tunneling components are compared at different DC bias points. The dependence of gate leakage current on gate oxide thickness is simulated}, keywords = {30, angstrom;60, angstrom;Boltzmann, Bias, calculations;leakage, charges;spherical, component;tunneling, current, currents;semiconductor, dependence;method, dependence;MOSFET;barrier, device, effect;distribution, equation;DC, equation;MOSFET;WKB, function;first, harmonic, image, leakage, lowering, method, method;gate, model;thermionic, models;tunnelling;, of, oxide, principle, probability;Boltzmann, simulation;gate, thickness, transport, WKB}, doi = {10.1109/SISPAD.1999.799307}, author = {Han,Zhiyi and Lin,Chung-Kai and Goldsman,N. and Mayergoyz, Issak D and Yu,S. and Stettler,M.} } @conference {14790, title = {Imprecise Calendars: an Approach to Scheduling Computational Grids}, booktitle = {Distributed Computing Systems, International Conference on}, year = {1999}, month = {1999///}, pages = {0352 - 0352}, publisher = {IEEE Computer Society}, organization = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, abstract = {We describe imprecise calendars, a way to organize and schedule clusters of nodes in a computation grid. Imprecise calendars permit the easy and efficient sharing of resources between different clusters of computers that are part of a computational grid. In addition, they can be used to provide specific time reservations for applications. We describe the algorithms and policies for manipulation of imprecise calendars. We also include a series of simulation studies that compare our approach to previous batch scheduling systems for both a single cluster and collection of clusters up to over 3,000 nodes.}, keywords = {parallel computing distributed scheduling computational grid batch scheduler meta computing}, isbn = {0-7695-0222-9}, doi = {http://doi.ieeecomputersociety.org/10.1109/ICDCS.1999.776537}, author = {Hollingsworth, Jeffrey K and Maneewongvatana, Songrit} } @article {17235, title = {Information workspaces}, journal = {Readings in information visualization}, year = {1999}, month = {1999///}, pages = {513 - 514}, author = {Card,S.K. and Mackinlay,J.D. and Shneiderman, Ben} } @article {17236, title = {Infosphere, workspace, tools, objects}, journal = {Readings in information visualization}, year = {1999}, month = {1999///}, pages = {463 - 464}, author = {Card,S.K. and Mackinlay,J.D. and Shneiderman, Ben} } @conference {15691, title = {Integrated admission control in hierarchical video-on-demand systems}, booktitle = {IEEE International Conference on Multimedia Computing and Systems, 1999}, volume = {1}, year = {1999}, month = {1999/07//}, pages = {220-225 vol.1 - 220-225 vol.1}, publisher = {IEEE}, organization = {IEEE}, abstract = {We develop a unified model of a hierarchical video-on-demand (VoD) system by integrating the storage and the network subsystems. Rather than restricting the analysis to an isolated subsystem the performance of the VoD system is analyzed as an end-to-end system. On a system-wide basis, request handling and admission control policies are designed to minimize global performance metrics. Through our simulation, we compare different request handling policies and show that a hierarchical VoD architecture with request handling that allows retrials at more than one resource will minimize overall blocking}, keywords = {Admission control, Bandwidth, blocking, Computer science, Design methodology, end-to-end system, hierarchical video-on-demand systems, integrated admission control, Intelligent networks, Load management, Motion pictures, Network servers, network subsystem, performance, Performance analysis, performance evaluation, quality of service, request handling, resource allocation, Resource management, simulation, storage subsystem, video on demand, video servers}, isbn = {0-7695-0253-9}, doi = {10.1109/MMCS.1999.779196}, author = {Mundur, Padma and Simon,R. and Sood,A.} } @inbook {17245, title = {Interaction}, booktitle = {Readings in information visualizationReadings in information visualization}, year = {1999}, month = {1999///}, pages = {231 - 234}, publisher = {Morgan Kaufmann Publishers Inc.}, organization = {Morgan Kaufmann Publishers Inc.}, address = {San Francisco}, isbn = {1-55860-533-9}, author = {Card,S.K. and Mackinlay,J.D. and Shneiderman, Ben} } @inbook {17246, title = {Interactive analysis}, booktitle = {Readings in information visualizationReadings in information visualization}, year = {1999}, month = {1999///}, pages = {261 - 262}, publisher = {Morgan Kaufmann Publishers Inc.}, organization = {Morgan Kaufmann Publishers Inc.}, address = {San Francisco}, isbn = {1-55860-533-9}, author = {Card,S.K. and Mackinlay,J.D. and Shneiderman, Ben} } @conference {16972, title = {An international SIGCHI research agenda}, booktitle = {CHI {\textquoteright}99 extended abstracts on Human factors in computing systems}, series = {CHI EA {\textquoteright}99}, year = {1999}, month = {1999///}, pages = {171 - 171}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {The goal of this workshop is to articulate an HCI research agenda statement, along with plans for continued refinement with the greater CHI community and plans for disseminating the information beyond the CHI community. There are been several similar prior efforts, including:{\textbullet} 1998 Universal Access program [2]{\textbullet} European community report, "Building the European Information Society for Us All" [1];{\textbullet} CHI 97 workshop [5] and paper [6], "HCI Research and Practice Agenda based on Human Needs {\textellipsis}";{\textbullet} CHI 96 Workshop, "CHI Ten-Year View{\textellipsis}" [3];{\textbullet} 1995 US National Science Foundation report, "New Directions in Human-Computer Interaction {\textellipsis}" [9];{\textbullet} 1995 report from the US National Research Council [7];{\textbullet} 1991 report, "{\textellipsis}HCI{\textellipsis} Serving Human Needs" [4]}, keywords = {agenda, human-computer, interaction, research}, isbn = {1-58113-158-5}, doi = {10.1145/632716.632821}, url = {http://doi.acm.org/10.1145/632716.632821}, author = {Scholtz,Jean C. and Muller,Michael and Novick,David and Olsen,Jr.,Dan R. and Shneiderman, Ben and Wharton,Cathleen} } @inbook {17262, title = {Internet and Infosphere}, booktitle = {Readings in information visualizationReadings in information visualization}, year = {1999}, month = {1999///}, pages = {465 - 468}, publisher = {Morgan Kaufmann Publishers Inc.}, organization = {Morgan Kaufmann Publishers Inc.}, address = {San Francisco}, isbn = {1-55860-533-9}, author = {Card,S.K. and Mackinlay,J.D. and Shneiderman, Ben} } @article {15560, title = {It{\textquoteright}s okay to be skinny, if your friends are fat}, journal = {Center for Geometric Computing 4th Annual Workshop on Computational Geometry}, year = {1999}, month = {1999///}, abstract = {The kd-tree is a popular and simple data structure for range searching and nearest neighborsearching. Such a tree subdivides space into rectangular cells through the recursive application of some splitting rule. The choice of splitting rule affects the shape of cells and the structure of the resulting tree. It has been shown that an important element in achieving efficient query times for approximate queries is that each cell should be fat, meaning that the ratio of its longest side to shortest side (its aspect ratio) should be bounded. Subdivisions with fat cells satisfy a property called the packing constraint, which bounds the number of disjoint cells of a given size that can overlap a ball of a given radius. We consider a splitting rule called the sliding-midpoint rule. It has been shown to provide efficient search times for approximate nearest neighbor and range searching, both in practice and in terms of expected case query time. However it has not been possible to prove results about this tree because it can produce cells of unbounded aspect ratio. We show that in spite of this, the sliding-midpoint rule generates subdivisions that satisfy the packing constraint, thus explaining their good performance. }, author = {Maneewongvatana,S. and Mount, Dave} } @article {15517, title = {Logic and databases: a 20 year retrospective-updated in honor of Ray Reiter}, journal = {Logical Foundations for Cognitive Agents: Contributions in Honor of Ray Reiter}, year = {1999}, month = {1999///}, pages = {234 - 299}, author = {Minker, Jack} } @article {13820, title = {Machine Translation}, journal = {Multilingual Information Management: Current Levels and Future Abilities}, year = {1999}, month = {1999///}, pages = {18 - 18}, author = {Bel,N. and Dorr, Bonnie J and Hovy,E. and Knight,K. and Iida,H. and Boitet,C. and Maegaard,B. and Wilks,Y.} } @conference {17302, title = {Multiple dimensions> 3}, booktitle = {Readings in information visualization}, year = {1999}, month = {1999///}, pages = {93 - 95}, publisher = {Morgan Kaufmann Publishers Inc.}, organization = {Morgan Kaufmann Publishers Inc.}, address = {San Francisco}, isbn = {1-55860-533-9}, author = {Card,S.K. and Mackinlay,J.D. and Shneiderman, Ben} } @article {18862, title = {Nano-to-millimeter scale integrated systems}, journal = {Components and Packaging Technologies, IEEE Transactions on}, volume = {22}, year = {1999}, month = {1999/06//}, pages = {338 - 343}, abstract = {Over the last several years various industries have been developing nano, micro, and millimeter scale technologies, which have resulted in components ranging from quantum transistors, to widely commercialized integrated circuits, to microelectromechanical sensors. A common emphasis of these fabrication industries has been on the integration of different functions in miniaturized systems; however, the technology currently used to realize these systems is monolithic. A unique class of hybrid technology systems is Integrated nano to millimeter (In2m) systems. An In2m system typically has components spanning multiple sizes, diverse technology domains, and mixtures of electrical, mechanical, thermal, chemical, fluidic, and biological functions}, keywords = {fabrication technology, In2m, integrated nano to millimeter system, micromechanical devices, nanotechnology}, isbn = {1521-3331}, doi = {10.1109/6144.774758}, author = {Last,H.R. and Deeds,M. and Garvick,D. and Kavetsky,R. and Sandborn,P. A. and Magrab,E. B. and Gupta,S.K.} } @inbook {14712, title = {Network Programming Using PLAN}, booktitle = {Internet Programming LanguagesInternet Programming Languages}, series = {Lecture Notes in Computer Science}, volume = {1686}, year = {1999}, month = {1999///}, pages = {127 - 143}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {We present here a methodology for programming active networks in the environment defined by our new language PLAN (Packet Language for Active Networks). This environment presumes a two-level architecture consisting of: 1. active packets carrying PLAN code; and 2. downloadable, node-resident services written in more general-purpose languages. We present several examples which illustrate how these two features can be combined to implement various network functions.}, isbn = {978-3-540-66673-8}, url = {http://dx.doi.org/10.1007/3-540-47959-7_7}, author = {Hicks, Michael W. and Kakkar,Pankaj and Moore,Jonathan and Gunter,Carl and Nettles,Scott}, editor = {Bal,Henri and Belkhouche,Boumediene and Cardelli,Luca} } @conference {15687, title = {Network service selection for distributed multimedia applications}, booktitle = {Third International Conference on Computational Intelligence and Multimedia Applications, 1999. ICCIMA {\textquoteright}99. Proceedings}, year = {1999}, month = {1999///}, pages = {388 - 392}, publisher = {IEEE}, organization = {IEEE}, abstract = {An important question in the development of system support for distributed multimedia is the type of network service offered to applications. This paper compares two network service disciplines: weighted fair queueing (WFQ) and non-preemptive earliest deadline first (NEDF). We show that, for a broad class of high-bandwidth distributed multimedia applications, WFQ outperforms NEDF in terms of network throughput while still providing an application-adequate end-to-end service. This result holds despite the fact that NEDF offers applications far greater flexibility in terms of control over end-to-end delivery delay}, keywords = {Admission control, Application software, application-adequate end-to-end service, Bandwidth, Communication system traffic control, Computer science, Delay, distributed processing, end-to-end delivery delay control, flexibility, high-bandwidth distributed multimedia applications, interactive multimedia, multimedia systems, network service selection, network throughput, nonpreemptive earliest deadline first, queueing theory, Regulators, system support, telecommunication services, Throughput, Traffic control, weighted fair queueing}, isbn = {0-7695-0300-4}, doi = {10.1109/ICCIMA.1999.798561}, author = {Simon,R. and Sood,A. and Mundur, Padma} } @inbook {17317, title = {Overview+ detail}, booktitle = {Readings in information visualizationReadings in information visualization}, year = {1999}, month = {1999///}, pages = {285 - 286}, author = {Card,S.K. and Mackinlay,J.D. and Shneiderman, Ben} } @book {14913, title = {Perceptual Organization in Computer Vision}, year = {1999}, month = {1999///}, publisher = {Academic Press}, organization = {Academic Press}, author = {Boyer,K.L. and Sarkar,S. and Feldman,J. and Granlund,G. and Horaud,R. and Hutchinson,S. and Jacobs, David W. and Kak,A. and Lowe,D. and Malik,J.} } @conference {17323, title = {Physical data}, booktitle = {Readings in information visualization}, year = {1999}, month = {1999///}, pages = {37 - 38}, publisher = {Morgan Kaufmann Publishers Inc.}, organization = {Morgan Kaufmann Publishers Inc.}, address = {San Francisco}, isbn = {1-55860-533-9}, author = {Card,S.K. and Mackinlay,J.D. and Shneiderman, Ben} } @article {14722, title = {PLAN: A programming language for active networks}, journal = {ACM SIGPLAN NOTICES}, volume = {34}, year = {1999}, month = {1999///}, pages = {86 - 93}, abstract = {PLAN (Programming Language for Active Networks) is anew language for programs that are carried in the packets of a programmable network. PLAN programs replace the packet headers (which can be viewed as {\textquoteleft}dumb{\textquoteright} programs) used in current networks. As a header replacement, PLAN programs must be lightweight and of limited functionality. These limitations are mitigated by allowing PLAN code to call service routines written in other, more powerful lan- guages. These service routines may also be loaded into the routers dynamically. This two-level architecture, in which PLAN serves as a scripting or {\textquoteleft}glue{\textquoteright} language for more gen- eral services, is the primary contribution of the paper. PLAN is a strict functional language providing a limited set of primitives and datatypes. PLAN de nes primitives for remotely executing PLAN programs on other nodes, and these primitives are used to provide basic data transport in the network. Because remote execution makes debugging di cult, PLAN provides strong static guarantees to the pro- grammer, such as type safety. A more novel property aimed at protecting network availability is a guarantee that PLAN programs use a bounded amount of space and time on active routers and bandwidth in the network. }, author = {Hicks, Michael W. and Kakkar,P. and Moore,J. T and Gunter,C. A and Nettles,S.} } @conference {14723, title = {PLANet: an active internetwork}, booktitle = {IEEE INFOCOM {\textquoteright}99. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings}, volume = {3}, year = {1999}, month = {1999/03/21/25}, pages = {1124-1133 vol.3 - 1124-1133 vol.3}, publisher = {IEEE}, organization = {IEEE}, abstract = {We present PLANet: an active network architecture and implementation. In addition to a standard suite of Internet-like services, PLANet has two key programmability features: (1) all packets contain programs; and (2) router functionality may be extended dynamically. Packet programs are written in our special purpose programming language PLAN, the Packet Language for Active Networks, while dynamic router extensions are written in OCaml, a dialect of ML. Currently, PLANet routers run as byte-code-interpreted Linux user-space applications, and support Ethernet and IP as link layers. PLANet achieves respectable performance on standard networking operations: on 300 MHz Pentium-II{\textquoteright}s attached to 100 Mbps Ethernet, PLANet can route 48 Mbps and switch over 5000 packets per second. We demonstrate the utility of PLANet{\textquoteright}s activeness by showing experimentally how it can nontrivially improve application and aggregate network performance in congested conditions}, keywords = {100 Mbit/s, 300 MHz, 48 Mbit/s, active internetwork, active network architecture, active network implementation, byte-code-interpreted applications, Computer architecture, Computer languages, Computer networks, congested conditions, dynamic programming, dynamic router extensions, Ethernet, Ethernet networks, INFORMATION SCIENCE, Internet, Internet-like services, internetworking, IP, IP networks, link layers, Linux user-space applications, Local area networks, ML dialect, Network performance, networking operations, OCaml, Packet Language for Active Networks, packet programs, packet switching, Pentium-II, performance, performance evaluation, PLAN, PLANet, Planets, programmability features, programming languages, router functionality, special purpose programming language, Switches, telecommunication network routing, Transport protocols, Web and internet services}, isbn = {0-7803-5417-6}, doi = {10.1109/INFCOM.1999.751668}, author = {Hicks, Michael W. and Moore,J. T and Alexander,D. S and Gunter,C. A and Nettles,S. M} } @book {15334, title = {A Priori Test of SGS Models in Compressible Turbulence}, year = {1999}, month = {1999///}, publisher = {Army High Performance Computing Research Center}, organization = {Army High Performance Computing Research Center}, author = {Martin, M.P and Piomelli,U. and Candler,G. V and Center,Army High Performance Computing Research and Minnesota,University of} } @book {17339, title = {Readings in Information Visualization: Using Vision to Think}, year = {1999}, month = {1999/01/25/}, publisher = {Morgan Kaufmann}, organization = {Morgan Kaufmann}, abstract = {This groundbreaking book defines the emerging field of information visualization and offers the first-ever collection of the classic papers of the discipline, with introductions and analytical discussions of each topic and paper. The authors{\textquoteright} intention is to present papers that focus on the use of visualization to discover relationships, using interactive graphics to amplify thought. This book is intended for research professionals in academia and industry; new graduate students and professors who want to begin work in this burgeoning field; professionals involved in financial data analysis, statistics, and information design; scientific data managers; and professionals involved in medical, bioinformatics, and other areas.* Full-color reproduction throughout* Author power team - an exciting and timely collaboration between the field{\textquoteright}s pioneering, most-respected names* The only book on Information Visualization with the depth necessary for use as a text or as a reference for the information professional* Text includes the classic source papers as well as a collection of cutting edge work}, keywords = {Computer Graphics, Computers / Computer Engineering, Computers / Computer Graphics, Computers / Computer Graphics / General, Computers / Computer Science, Computers / General, Computers / Information Technology, Computers / Information Theory, Computers / Intelligence (AI) \& Semantics, Computers / Social Aspects / Human-Computer Interaction, IMAGE PROCESSING, Information display systems, Information Visualization, Psychology / General, Visualization}, isbn = {9781558605336}, author = {Card,Stuart K. and Mackinlay,Jock D. and Shneiderman, Ben} } @article {13465, title = {Reports on the AAAI Fall Symposia}, journal = {AI Magazine}, volume = {20}, year = {1999}, month = {1999/09/15/}, pages = {87 - 87}, abstract = {The Association for the Advancement of Artificial Intelligence (AAAI) held its 1998 Fall Symposium Series on 23 to 25 October at the Omni Rosen Hotel in Orlando, Florida. This article contains summaries of seven of the symposia that were conducted: (1) Cognitive Robotics; (2) Distributed, Continual Planning; (3) Emotional and Intelligent: The Tangled Knot of Cognition; (4) Integrated Planning for Autonomous Agent Architectures; (5) Planning with Partially Observable Markov Decision Processes; (6) Reasoning with Visual and Diagrammatic Representations; and (7) Robotics and Biology: Developing Connections.}, isbn = {0738-4602}, doi = {10.1609/aimag.v20i3.1470}, url = {http://www.aaai.org/ojs/index.php/aimagazine/article/viewArticle/1470}, author = {De Giacomo,Giuseppe and desJardins, Marie and Canamero,Dolores and Wasson,Glenn and Littman,Michael and Allwein,Gerard and Marriott,Kim and Meyer,Bernd and Webb,Barbara and Consi,Tom} } @book {19005, title = {The RNA World}, year = {1999}, month = {1999///}, publisher = {Cold Spring Harbor Laboratory Press}, organization = {Cold Spring Harbor Laboratory Press}, address = {Cold Spring Harbor, New York}, author = {Woodson,Sarah A. and Mount, Stephen M.}, editor = {Gesteland,Raymond F. and Cech,Thomas R. and Atkins,John F.} } @conference {18158, title = {A rotation, scale and translation resilient public watermark}, booktitle = {Acoustics, Speech, and Signal Processing, 1999. Proceedings., 1999 IEEE International Conference on}, volume = {4}, year = {1999}, month = {1999/03//}, pages = {2065 vol.4 - 2065 vol.4}, abstract = {Summary form only given. Watermarking algorithms that are robust to the common geometric transformations of rotation, scale and translation (RST) have been reported for cases in which the original unwatermarked content is available at the detector so as to allow the transformations to be inverted. However, for public watermarks the problem is significantly more difficult since there is no original content to register with. Two classes of solution have been proposed. The first embeds a registration pattern into the content while the second seeks to apply detection methods that are invariant to these geometric transformations. This paper describes a public watermarking method which is invariant (or bares a simple relation) to the common geometric transforms of rotation, scale, and translation. It is based on the Fourier-Mellin transform which has previously been suggested. We extend this work, using a variation based on the Radon transform. The watermark is inserted into a projection of the image. The properties of this projection are such that RST transforms produce simple or no effects on the projection waveform. When a watermark is inserted into a projection, the signal must eventually be back projected to the original image dimensions. This is a one to many mapping that allows for considerable flexibility in the watermark insertion process. We highlight some theoretical and practical issues that affect the implementation of an RST invariant watermark. Finally, we describe preliminary experimental results}, keywords = {algorithms;Fourier, coding;, coding;image, data;transform, dimensions;projection, Fourier-Mellin, image, invariant, methods;detector;experimental, of, pattern;rotation, projection;mapping;original, public, registration;security, resilient, results;geometric, transform;detection, transform;RST, transformations;image, transforms;image, transforms;Radon, watermark;RST, watermark;scale, watermark;translation, watermark;watermarking, waveform;registration}, doi = {10.1109/ICASSP.1999.758337}, author = {Wu,M. and Miller,M.L. and Bloom,J.A. and Cox,I.J.} } @article {18715, title = {Solution Structure of the Proapoptotic Molecule BID: A Structural Basis for Apoptotic Agonists and Antagonists}, journal = {Cell}, volume = {96}, year = {1999}, month = {1999/03/05/}, pages = {625 - 634}, abstract = {Members of the BCL2 family of proteins are key regulators of programmed cell death, acting either as apoptotic agonists or antagonists. Here we describe the solution structure of BID, presenting the structure of a proapoptotic BCL2 family member. An analysis of sequence/structure of BCL2 family members allows us to define a structural superfamily, which has implications for general mechanisms for regulating proapoptotic activity. It appears two criteria must be met for proapoptotic function within the BCL2 family: targeting of molecules to intracellular membranes, and exposure of the BH3 death domain. BID{\textquoteright}s activity is regulated by a Caspase 8{\textendash}mediated cleavage event, exposing the BH3 domain and significantly changing the surface charge and hydrophobicity, resulting in a change of cellular localization.}, isbn = {0092-8674}, doi = {10.1016/S0092-8674(00)80573-5}, url = {http://www.sciencedirect.com/science/article/pii/S0092867400805735}, author = {McDonnell,James M and Fushman, David and Milliman,Curt L. and Korsmeyer,Stanley J. and Cowburn,David} } @article {14735, title = {Specifying the PLAN Network Programming Langauge}, journal = {Electronic Notes in Theoretical Computer Science}, volume = {26}, year = {1999}, month = {1999///}, pages = {87 - 104}, abstract = {We discuss how the specification of the PLAN programming language supports the design objectives of the language. The specification aims to provide a mathematically precise operational semantics that can serve as a standard for implementing interpreters and portable programs. The semantics should also support proofs of key properties of PLAN that would hold of all conformant implementations. This paper discusses two such properties. (1) Type checking is required, but interpreters are given significant flexibility about when types are checked; the specification must support a clear description of the possible behaviors of a network of conformant implementations. (2) It is essential to have guarantees about how PLAN programs use global resources, but the specification must be flexible about extensions in the network service layer. We illustrate on of kind of issue that will arise in using to specification to prove properties of the network based on the choice of services.}, isbn = {1571-0661}, doi = {10.1016/S1571-0661(05)80285-3}, url = {http://www.sciencedirect.com/science/article/pii/S1571066105802853}, author = {Kakkar,Pankaj and Hicks, Michael W. and Moore,Jon and Gunter,Carl A.} } @article {15354, title = {Subgrid-scale model for the temperature fluctuations in reacting hypersonic turbulent flows}, journal = {Physics of Fluids}, volume = {11}, year = {1999}, month = {1999///}, pages = {2765 - 2765}, author = {Martin, M.P and Candler,G. V} } @article {12321, title = {Synthesis of embedded software from synchronous dataflow specifications}, journal = {The Journal of VLSI Signal Processing}, volume = {21}, year = {1999}, month = {1999///}, pages = {151 - 166}, author = {Bhattacharyya, Shuvra S. and Murthy,P. K and Lee,E. A} } @inbook {17399, title = {Text in 1D}, booktitle = {Readings in information visualizationReadings in information visualization}, year = {1999}, month = {1999///}, pages = {411 - 412}, publisher = {Morgan Kaufmann Publishers Inc.}, organization = {Morgan Kaufmann Publishers Inc.}, address = {San Francisco}, isbn = {1-55860-533-9}, author = {Card,S.K. and Mackinlay,J.D. and Shneiderman, Ben} } @inbook {17400, title = {Text in 2D}, booktitle = {Readings in information visualizationReadings in information visualization}, year = {1999}, month = {1999///}, pages = {431 - 431}, publisher = {Morgan Kaufmann Publishers Inc.}, organization = {Morgan Kaufmann Publishers Inc.}, address = {San Francisco}, isbn = {1-55860-533-9}, author = {Card,S.K. and Mackinlay,J.D. and Shneiderman, Ben} } @inbook {17401, title = {Text in 3D}, booktitle = {Readings in information visualizationReadings in information visualization}, year = {1999}, month = {1999///}, pages = {440 - 441}, publisher = {Morgan Kaufmann Publishers Inc.}, organization = {Morgan Kaufmann Publishers Inc.}, address = {San Francisco}, isbn = {1-55860-533-9}, author = {Card,S.K. and Mackinlay,J.D. and Shneiderman, Ben} } @inbook {17402, title = {Text in 3D+ time}, booktitle = {Readings in information visualizationReadings in information visualization}, year = {1999}, month = {1999///}, pages = {451 - 451}, publisher = {Morgan Kaufmann Publishers Inc.}, organization = {Morgan Kaufmann Publishers Inc.}, address = {San Francisco}, isbn = {1-55860-533-9}, author = {Card,S.K. and Mackinlay,J.D. and Shneiderman, Ben} } @article {18033, title = {Trade-offs between communication throughput and parallel time}, journal = {Journal of Complexity}, volume = {15}, year = {1999}, month = {1999///}, pages = {148 - 166}, author = {Mansour,Y. and Nisan,N. and Vishkin, Uzi} } @conference {14747, title = {Transparent communication for distributed objects in Java}, booktitle = {Proceedings of the ACM 1999 conference on Java Grande}, series = {JAVA {\textquoteright}99}, year = {1999}, month = {1999///}, pages = {160 - 170}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, isbn = {1-58113-161-5}, doi = {10.1145/304065.304119}, url = {http://doi.acm.org/10.1145/304065.304119}, author = {Hicks, Michael W. and Jagannathan,Suresh and Kelsey,Richard and Moore,Jonathan T. and Ungureanu,Cristian} } @conference {15467, title = {Using a goal-driven approach to generate test cases for GUIs}, booktitle = {Software Engineering, 1999. Proceedings of the 1999 International Conference on}, year = {1999}, month = {1999/05//}, pages = {257 - 266}, abstract = {The widespread use of GUIs for interacting with software is leading to the construction of more and more complex GUIs. With the growing complexity comes challenges in testing the correctness of a GUI and the underlying software. We present a new technique to automatically generate test cases for GUIs that exploits planning, a well developed and used technique in artificial intelligence. Given a set of operators, an initial state and a goal state, a planner produces a sequence of the operators that will change the initial state to the goal state. Our test case generation technique first analyzes a GUI and derives hierarchical planning operators from the actions in the GUI. The test designer determines the preconditions and effects of the hierarchical operators, which are then input into a planning system. With the knowledge of the GUI and the way in which the user will interact with the GUI, the test designer creates sets of initial and goal states. Given these initial and final states of the GUI, a hierarchical planner produces plans, or a set of test cases, that enable the goal state to be reached. Our technique has the additional benefit of putting verification commands into the test cases automatically. We implemented our technique by developing the GUI analyzer and extending a planner. We generated test cases for Microsoft{\textquoteright}s Word-Pad to demonstrate the viability and practicality of the approach.}, keywords = {Artificial intelligence, automatic test case generation, goal state, goal-driven approach, Graphical user interfaces, GUIs, hierarchical planning operators, initial state, Microsoft Word-Pad, operators, planning (artificial intelligence), program testing, software, verification commands}, author = {Memon, Atif M. and Pollack,M. E and Soffa,M. L} } @article {17482, title = {Using vision to think}, journal = {Readings in information visualization: using vision to think}, year = {1999}, month = {1999///}, pages = {579 - 581}, author = {Card,S.K. and Mackinlay,J.D. and Shneiderman, Ben} } @article {15660, title = {Vision geometry VIII(Denver CO, 19-20 July 1999)}, journal = {SPIE proceedings series}, year = {1999}, month = {1999///}, author = {Latecki,L.J. and Melter,R.A. and Mount, Dave and Wu,A. Y} } @conference {17504, title = {Visually enhanced objects}, booktitle = {Readings in information visualization}, year = {1999}, month = {1999///}, pages = {561 - 561}, publisher = {Morgan Kaufmann Publishers Inc.}, organization = {Morgan Kaufmann Publishers Inc.}, address = {San Francisco}, isbn = {1-55860-533-9}, author = {Card,S.K. and Mackinlay,J.D. and Shneiderman, Ben} } @article {15516, title = {The Workshop on Logic-Based Artificial Intelligence}, journal = {AI Magazine}, volume = {20}, year = {1999}, month = {1999/12/15/}, pages = {97 - 97}, abstract = {The Workshop on Logic-Based Artificial Intelligence}, isbn = {0738-4602}, doi = {10.1609/aimag.v20i4.1484}, url = {http://www.aaai.org/ojs/index.php/aimagazine/article/viewArticle/1484}, author = {Minker, Jack} } @article {15359, title = {3-D Device Simulation Using Intelligent Solution Method Control}, journal = {VLSI DESIGN}, volume = {6}, year = {1998}, month = {1998///}, pages = {267 - 272}, abstract = {In this paper, a hybrid solution method is implemented for solving the semiconductor trans-port equations. The hybrid "local Newton" method consists of a combination of the fixed- point iteration (FPI) and Newton{\textquoteright}s methods. The FPI technique is nearly ideally suitedto solving large, 3-D systems of semiconductor equations on machines of limited computer memory however,it has certain limitations. This motivates the local Newton method, which coordinates the use of both the FPI and Newton{\textquoteright}s methods, for convergence faster than either method alone. }, author = {Kerr,D. C. and Mayergoyz, Issak D} } @article {15683, title = {Access Policies for Distributed Video-on-Demand Systems}, journal = {Journal of the WAS, Special Issue on Communications, 85 (2)}, year = {1998}, month = {1998///}, author = {Simon,R. and Mundur, Padma and Sood,A.} } @article {15670, title = {ANN programming manual}, year = {1998}, month = {1998///}, institution = {Deptartment of Computer Science, University of Maryland, College Park}, author = {Mount, Dave} } @article {15651, title = {Approximating large convolutions in digital images}, journal = {PROCEEDINGS-SPIE THE INTERNATIONAL SOCIETY FOR OPTICAL ENGINEERING}, year = {1998}, month = {1998///}, pages = {216 - 227}, abstract = {Computing discrete two-dimensional convolutions is an important problem in image processing. In mathematicalmorphology, an important variant is that of computing binary convolutions, where the kernel of the convolution is a 0{1 valued function. This operation can be quite costly, especially when large kernels are involved. In this paper, we present an algorithm for computing convolutions of this form, where the kernel of the binary convolution is derived from a convex polygon. Because the kernel is a geometric object, we allow the algorithm some exibility in how it elects to digitize the convex kernel at each placement, as long as the digitization satis es certain reasonable requirements. We say that such a convolution is valid. Given this exibility we show that it is possible to compute binary convolutions more e ciently than would normally be possible for large kernels. Our main result is an algorithm, which given an m n image and a k-sided convex polygonal kernel, computes a valid convolution in time O(kmn) time. Unlike standard algorithms for computing correlations and convolutions, the running time is independent of the area or perimeter of K, and our techniques do not rely on computing fast Fourier transforms. Our algorithm is based on a novel use of Bresenham{\textquoteright}s line-drawing algorithm and pre x-sums to update the convolution e ciently as the kernel is moved from one position to another across the image. }, author = {Kanungo,T. and Mount, Dave and Netanyahu,N. S and Piatko,C. and Silverman,R. and Wu,A. Y} } @conference {15634, title = {Approximation algorithms for multiple-tool miling}, booktitle = {Proceedings of the fourteenth annual symposium on Computational geometry}, series = {SCG {\textquoteright}98}, year = {1998}, month = {1998///}, pages = {297 - 306}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, isbn = {0-89791-973-4}, doi = {10.1145/276884.276918}, url = {http://doi.acm.org/10.1145/276884.276918}, author = {Arya,Sunil and Cheng,Siu-Wing and Mount, Dave} } @article {15675, title = {On the Area of Overlap of Translated Polygons}, volume = {CS-TR-3201}, year = {1998}, month = {1998/10/15/}, institution = {Department of Computer Science, University of Maryland, College Park}, abstract = {(Also cross-referenced as CAR-TR-699) Given two simple polygons P and Q in the plane and a translation vector t E R2, the area-oJ-overlap function of P and Q is the function Ar(t) = Area(P n (t + Q)), where t + Q denotes Q translated by t. This function has a number of applications in areas such as motion planning and object recognition. We present a number of mathematical results regarding this function. We also provide efficient algorithms for computing a representation of this function, and for tracing contour curves of constant area of o verlap. }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu//handle/1903/403}, author = {Mount, Dave and Silverman,Ruth and Wu,Angela Y.} } @conference {16188, title = {Bringing treasures to the surface: previews and overviews in a prototype for the Library of Congress National Digital Library}, booktitle = {CHI 98 conference summary on Human factors in computing systems}, series = {CHI {\textquoteright}98}, year = {1998}, month = {1998///}, pages = {187 - 188}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, keywords = {Browsing, digital libraries, metadata, multimedia, overviews, previews, World Wide Web}, isbn = {1-58113-028-7}, doi = {10.1145/286498.286665}, url = {http://doi.acm.org/10.1145/286498.286665}, author = {Plaisant, Catherine and Marchionini,Gary and Komlodi,Anita} } @book {15364, title = {Computational Electromagnetism: Variational Formulations, Complementarity, Edge Elements.}, year = {1998}, month = {1998///}, publisher = {Elsevier Science \& Technology}, organization = {Elsevier Science \& Technology}, author = {Mayergoyz, Issak D} } @article {16026, title = {Defaults Denied}, volume = {UMIACS-TR-96-61}, year = {1998}, month = {1998/10/15/}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {We take a tour of various themes in default reasoning, examining new ideasas well as those of Brachman, Delgrande, Poole, and Schlechta. An underlying issue is that of stating that a potential default principle is not appropriate. We see this arise most dramatically as a problem in an attempt to formalize what are often loosely called "prototypes", although it also arises in other formal approaches to default reasoning. Some formalisms in the literature provide solutions but not without costs. We propose a formalism that appears to avoid these costs; it can be seen as a step toward a population-based set-theoretic modification of these approaches, that may ultimately provide a closer tie to recent work on statistical (quantitative) foundations of (qualitative) defaults([1]). Our analysis in particular indicates the need to resolve a conflation between use and mention in many default formalisms. Our treatment proposes such a resolution, and also explores the use of sets toward a more population-based notion of default. (Also cross-referenced as UMIACS-TR-96-61) }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu//handle/1903/841}, author = {Miller,Michael and Perlis, Don and Purang,Khemdut} } @article {17864, title = {The design and evaluation of a high-performance earth science database}, journal = {Parallel Computing}, volume = {24}, year = {1998}, month = {1998/01//}, pages = {65 - 89}, abstract = {Earth scientists have encountered two major obstacles in their attempts to use remotely sensed imagery to analyze the earth{\textquoteright}s land cover dynamics. First, the volume of data involved is very large and second, significant preprocessing is needed before the data can be used. This is particularly so for studies that analyze global trends using data sets that cover multiple years. In this paper, we present the design of an earth science database as well as our early experiences with it. The primary design goal of this database is to facilitate efficient access to and preprocessing of large volumes of satellite data. Our initial design assumed that the main bottleneck in the system would be retrieving data from the disks. However, experimental results show that precise identification of all the data values corresponding to a query can take a significant amount of time. The problem is even more pronounced in designing the system to attempt to minimize time spent performing I/O. We therefore discuss a major redesign of the system that includes a reworking of the indexing scheme and a reorganization of the data on disks. Experimental results show that the redesigned system performs significantly better than the original system, providing interactive response times for local queries.}, keywords = {Communication, High-performance I/O, load balancing, scalability, Scientific databases}, isbn = {0167-8191}, doi = {10.1016/S0167-8191(97)00117-8}, url = {http://www.sciencedirect.com/science/article/pii/S0167819197001178}, author = {Shock,Carter T. and Chang,Chialin and Moon,Bongki and Acharya,Anurag and Davis, Larry S. and Saltz,Joel and Sussman, Alan} } @conference {17832, title = {Digital dynamic telepathology{\textendash}the Virtual Microscope.}, booktitle = {Proceedings of the AMIA Symposium}, year = {1998}, month = {1998///}, pages = {912 - 912}, author = {Afework,A. and Beynon,M. D and Bustamante,F. and Cho,S. and Demarzo,A. and Ferreira,R. and Miller,R. and Silberman,M. and Saltz, J. and Sussman, Alan and others} } @article {17946, title = {Double quaternions for motion interpolation}, journal = {Proceedings of the ASME Design Engineering Technical Conference}, year = {1998}, month = {1998///}, abstract = {This paper describes the concept of double quaternions, anextension of quaternions, and shows how they can be used for ef- fective three-dimensional motion interpolation. Motion interpo- lation using double quaternions has several advantages over the method of interpolating rotation and translation independently and then combining the results. First, double quaternions pro- vide a conceptual framework that allows one to handle rotational and translational components in a unified manner. Second, re- sults obtained by using double quaternions are coordinate frame invariant. Third, double quaternions allow a natural way to trade- off robustness against accuracy. Fourth, double quaternions, be- ing a straightforward extension of quaternions, can be integrated into several existing systems that currently use quaternions with translational components, with a only small coding effort. }, author = {Ge,Q. J and Varshney, Amitabh and Menon,J. P and Chang,C. F} } @article {15551, title = {Efficient randomized algorithms for the repeated median line estimator}, journal = {Algorithmica}, volume = {20}, year = {1998}, month = {1998///}, pages = {136 - 150}, abstract = {The problem of fitting a straight line to a finite collection of points in the plane is an important problem in statistical estimation. Recently there has been a great deal of interest is robust estimators, because of their lack of sensitivity to outlying data points. The basic measure of the robustness of an estimator is its breakdown point, that is, the fraction (up to 50\%) of outlying data points that can corrupt the estimator. One problem with robust estimators is that achieving high breakdown points (near 50\%) has proved to be computationally demanding. In this paper we present the best known theoretical algorithm and a practical subquadratic algorithm for computing a 50\% breakdown point line estimator, the Siegel or repeated median line estimator. We first present an O(n\log n) randomized expected-time algorithm, where n is the number of given points. This algorithm relies, however, on sophisticated data structures. We also present a very simple O(n log 2 n) randomized algorithm for this problem, which uses no complex data structures. We provide empirical evidence that, for many realistic input distributions, the running time of this second algorithm is actually O(n log n) expected time.}, doi = {10.1007/PL00009190}, author = {Matou{\v s}ek,J. and Mount, Dave and Netanyahu,N. S} } @article {13767, title = {Evaluation of EuroWordNet-and LCS-based lexical resources for machine translation}, journal = {Proceedings from First International Conference on Language Resources \& Evaluation}, year = {1998}, month = {1998///}, pages = {393 - 398}, abstract = {We evaluate two types of lexical resources with respect to their applicability to interlingual machine translation: (1) a EuroWordNet-based database of bilingual links between Spanish and English words; and (2) a repository of semantically classified verbs with their corresponding Lexical Conceptual Structure (LCS) representations. We examine the utility of these two resources for the task of lexical selection in machine translation. Our approach uses a coarse-grained graph-matching scheme that selects target-language words based on their LCS representation. The final selection of target-language terms is based on a finer-grained linking into the EuroWordNet-based repository. }, author = {Dorr, Bonnie J and Marti,A. and Castellon,I.} } @article {15367, title = {Extension of Spherical Harmonic Method to RF Transient Regime}, journal = {Simulation of semiconductor processes and devices 1998: SISPAD 98}, year = {1998}, month = {1998///}, pages = {42 - 42}, abstract = {The space and time dependent electron Boltzmann transport equation (BTE)is solved sclf-consistently with the Poisson and transient hole current-continuity equation. A transient Spherical Harmonic expansion method is used to solve the BTE. By this method we can efficiently solve the BTE in the RF regime to observe how the complete distribution function responds to a rapid transient. Calculations on a BJT, which give the time dependent distribution function over a large energy range 0-3eV, throughout the device, as well as average quantities, require only 40 minutes CPU time on an Alpha workstation. }, author = {Lin,C. K. and Goldsman,N. and Chang,C. H. and Mayergoyz, Issak D and Aronowitz,S. and Dong,J. and Belova,N.} } @conference {18736, title = {Feature-recognition for MEMS extraction}, year = {1998}, month = {1998///}, pages = {13 - 16}, url = {http://www.ece.cmu.edu/~mems/pubs/pdfs/asme/detc/0029_baidya-1998.pdf}, author = {Baidya,B. and Gupta,S.K. and Mukherjee,T.} } @article {15362, title = {Hydrodynamic Device Simulation with New State Variables Specially Chosen a Block Gummel Iterative Approach}, journal = {VLSI DESIGN}, volume = {6}, year = {1998}, month = {1998///}, pages = {191 - 195}, abstract = {A new numerical formulation for solving the hydrodynamic model of semiconductor devicesis presented. Themethod is based on using new variables to transform the conventional hydrodynamic equations into forms which facilitatenumerical evaluation with a block Gum- mel approach. To demonstrate the new method, we apply it to model a 0.35 wn 2-D LDD MOSFET, where robust convergence properties are observed. }, author = {Liang,W. and Kerr,D. C. and Goldsman,N. and Mayergoyz, Issak D} } @article {12174, title = {Implementing a zooming User Interface: experience building Pad++}, journal = {Software: Practice and Experience}, volume = {28}, year = {1998}, month = {1998/08/01/}, pages = {1101 - 1135}, abstract = {We are investigating a novel user interface paradigm based on zooming, in which users are presented with a zooming view of a huge planar information surface. We have developed a system called Pad++ to explore this approach. The implementation of Pad++ is related to real-time 3D graphics systems and to 2D windowing systems. However, the zooming nature of Pad++ requires new approaches to rendering, screen management, and spatial indexing. In this paper, we describe the design and implementation of the Pad++ engine, focusing in particular on rendering and data structure issues. Our goal is to present useful techniques that can be adopted in other real-time graphical systems, and also to discuss how 2D zooming systems differ from other graphical systems. {\textcopyright} 1998 John Wiley \& Sons, Ltd.}, keywords = {3D graphics, animation, Pad++, real-time computer graphics, User Interface Management Systems (UIMS), windowing systems, zooming User Interfaces (ZUIs)}, isbn = {1097-024X}, doi = {10.1002/(SICI)1097-024X(199808)28:10<1101::AID-SPE190>3.0.CO;2-V}, url = {http://onlinelibrary.wiley.com/doi/10.1002/(SICI)1097-024X(199808)28:10<1101::AID-SPE190>3.0.CO;2-V/abstract}, author = {Bederson, Benjamin B. and Meyer,Jon} } @conference {15635, title = {Improved algorithms for robust point pattern matching and applications to image registration}, booktitle = {Proceedings of the fourteenth annual symposium on Computational geometry}, series = {SCG {\textquoteright}98}, year = {1998}, month = {1998///}, pages = {155 - 164}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, isbn = {0-89791-973-4}, doi = {10.1145/276884.276902}, url = {http://doi.acm.org/10.1145/276884.276902}, author = {Mount, Dave and Netanyahu,Nathan S. and LeMoigne,Jacqueline} } @article {16184, title = {An information architecture to support the visualization of personal histories}, journal = {Information Processing \& Management}, volume = {34}, year = {1998}, month = {1998/09//}, pages = {581 - 597}, abstract = {This paper proposes an information architecture for personal history data and describes how the data model can be extended to a runtime model for a compact visualization using graphical timelines. Our information architecture was developed for juvenile justice and medical patient records, but is usable in other application domains such as personal resumes, financial histories, or customer support. Our model groups personal history events into aggregates that are contained in facets (e.g., doctor visits, hospitalizations, or lab tests). Crosslinks enable representation of arbitrary relationships across events and aggregates. Data attributes, such as severity, can be mapped by data administrators to visual attributes such as color and line thickness. End-users have powerful controls over the display contents, and they can modify the mapping to fit their tasks.}, keywords = {Graphical user interfaces, Information Visualization, LifeLines, medical patient record, personal histories, temporal data, timelines}, isbn = {0306-4573}, doi = {10.1016/S0306-4573(98)00024-7}, url = {http://www.sciencedirect.com/science/article/pii/S0306457398000247}, author = {Plaisant, Catherine and Shneiderman, Ben and Mushlin,Rich} } @conference {14806, title = {Instrumentation and measurement}, booktitle = {The grid}, year = {1998}, month = {1998///}, pages = {339 - 365}, author = {Hollingsworth, Jeffrey K and Miller, B.} } @article {15522, title = {Integrity constraints: Semantics and applications}, journal = {Logics for databases and information systems}, year = {1998}, month = {1998///}, pages = {265 - 306}, abstract = {Integrity constraints axe introduced in a logical framework. Examples are given to illustrate the expressiveness of integrity constraints. Various definitions for the semantics of integrity constraints are defined and compared. Additional types of constraints are also mentioned. Techniques of reasoning with integrity constraints, including model elimination and the residue method, are explained. Applications of integrity constraints considered in detail, including semantic query optimization, cooperative answering, combining databases, and view updates. Additional applications to order optimization, query folding, object-oriented databases, and database security are sketched. The conclusion lists areas of integrity constraints that need to be investigated.}, doi = {10.1007/978-1-4615-5643-5_9}, author = {Godfrey,P. and Grant,J. and Gryz,J. and Minker, Jack} } @article {16185, title = {Interfaces and tools for the library of congress national digital library program}, journal = {Information Processing \& Management}, volume = {34}, year = {1998}, month = {1998/09//}, pages = {535 - 555}, abstract = {This paper describes a collaborative effort to explore user needs in a digital library, develop interface prototypes for a digital library and suggest and prototype tools for digital librarians and users at the Library of Congress (LC). Interfaces were guided by an assessment of user needs and aimed to maximize interaction with primary resources and support both browsing and analytical search strategies. Tools to aid users and librarians in overviewing collections, previewing objects and gathering results were created and serve as the beginnings of a digital librarian toolkit. The design process and results are described and suggestions for future work are offered.}, isbn = {0306-4573}, doi = {10.1016/S0306-4573(98)00020-X}, url = {http://www.sciencedirect.com/science/article/pii/S030645739800020X}, author = {Marchionini,Gary and Plaisant, Catherine and Komlodi,Anita} } @article {17281, title = {LifeLines: using visualization to enhance navigation and analysis of patient records.}, journal = {Proceedings of the AMIA Symposium}, year = {1998}, month = {1998///}, pages = {76 - 80}, abstract = {LifeLines provide a general visualization environment for personal histories. We explore its use for clinical patient records. A Java user interface is described, which presents a one-screen overview of a computerized patient record using timelines. Problems, diagnoses, test results or medications can be represented as dots or horizontal lines. Zooming provides more details; line color and thickness illustrate relationships or significance. The visual display acts as a giant menu, giving direct access to the data.}, isbn = {1531-605X}, author = {Plaisant, Catherine and Mushlin,R. and Snyder,A. and Li,J. and Heller,D. and Shneiderman, Ben} } @article {16190, title = {LifeLines: using visualization to enhance navigation and analysis of patient records}, journal = {In Proceedings of the 1998 American Medical Informatic Association Annual Fall SymposiumProc AMIA Symp}, year = {1998}, month = {1998///}, pages = {76 - 80}, abstract = {LifeLines provide a general visualization environment for personal histories. We explore its use for clinical patient records. A Java user interface is described, which presents a one-screen overview of a computerized patient record using timelines. Problems, diagnoses, test results or medications can be represented as dots or horizontal lines. Zooming provides more details; line color and thickness illustrate relationships or significance. The visual display acts as a giant menu, giving direct access to the data.}, isbn = {1531-605X}, author = {Plaisant, Catherine and Mushlin,R. and Snyder,A. and Li,J. and Heller,D. and Shneiderman, Ben} } @article {15519, title = {Logic knowledge bases with two default rules}, journal = {Annals of Mathematics and Artificial Intelligence}, volume = {22}, year = {1998}, month = {1998///}, pages = {333 - 361}, author = {Ruiz,C. and Minker, Jack} } @inbook {17618, title = {Low-bandwidth routing and electrical power networks}, booktitle = {Automata, Languages and ProgrammingAutomata, Languages and Programming}, series = {Lecture Notes in Computer Science}, volume = {1443}, year = {1998}, month = {1998///}, pages = {604 - 615}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {Given a graph G and a (multi-)set of pairs of vertices in it, the classical NP-hard maximum edge-disjoint-paths problem (MDP) is to connect as many of the given pairs as possible using pairwise edge-disjoint paths in G . We study a relative of this problem: we have a network with fixed link capacities that may have to service large demands when necessary. In particular, individual demands are allowed to exceed capacities, and thus flows for some request pairs necessarily have to be split into different flow-paths. This is the framework for computational problems arising from: (i) electrical power networks due to the proposed deregulation of the electric utility industry in the USA, and (ii) applications such as real-time Internet services (e.g., telephone, fax, video). We show that these problems come in a few variants, some efficiently solvable and many NP -hard; we also present approximation algorithms for many of the NP -hard variants presented. Some of our approximation algorithms benefit from certain improved tail estimates that we derive; the latter also yield improved approximations for a family of packing integer programs.}, isbn = {978-3-540-64781-2}, url = {http://dx.doi.org/10.1007/BFb0055088}, author = {Cook,Doug and Faber,Vance and Marathe,Madhav and Srinivasan, Aravind and Sussmann,Yoram}, editor = {Larsen,Kim and Skyum,Sven and Winskel,Glynn} } @article {15674, title = {Minimum Enclosures with Specified Angles}, volume = {CS-TR-3219}, year = {1998}, month = {1998/10/15/}, institution = {Department of Computer Science, University of Maryland, College Park}, abstract = {Given a convex polygon P, an m-envelope is a convex m-sidedpolygon that contains P. Given any convex polygon P, and any sequence of m > 3 angles A = ((11Xct2X@..ckm) we consider the problem of computing the minimum area m-envelope for P whose counte rclockwise sequence of exterior angles is given by A. We show that such envelopes can be computed in O(nm log m) time. The main result on which the correctness of the algorithm rests is a flushness condition stating that for any locally minimum enclosure with specified angles, one of its sides must be collinear with one of the sides of P. (Also cross-referenced as CAR-TR-701) }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu//handle/1903/405}, author = {Mount, Dave and Silverman,Ruth} } @article {15368, title = {A New Method to Recover Vectorial Electric Fields and Current Densities from Unstructured Meshes}, journal = {VLSI DESIGN}, volume = {6}, year = {1998}, month = {1998///}, pages = {117 - 122}, abstract = {In the context of 2-D and 3-D unstructured mixed-element meshes, a new method of recover-ing vectorial fields and currents in multidimensional simulation is introduced. The new method, called the method of edge elements, directly interpolates the projections of the vec- tors on the edges of an element into its interior. The new method is compared to two other recovery methods on the basis of resolution, consistency, and implementation ease. }, author = {Kerr,D. C. and Mayergoyz, Issak D} } @article {15611, title = {An optimal algorithm for approximate nearest neighbor searching fixed dimensions}, journal = {Journal of the ACM (JACM)}, volume = {45}, year = {1998}, month = {1998/11//}, pages = {891 - 923}, abstract = {Consider a set of S of n data points in real d-dimensional space, Rd, where distances are measured using any Minkowski metric. In nearest neighbor searching, we preprocess S into a data structure, so that given any query point q ∈ Rd, is the closest point of S to q can be reported quickly. Given any positive real \&egr;, data point p is a (1 +\&egr;)-approximate nearest neighbor of q if its distance from q is within a factor of (1 + \&egr;) of the distance to the true nearest neighbor. We show that it is possible to preprocess a set of n points in Rd in O(dn log n) time and O(dn) space, so that given a query point q ∈ Rd, and \&egr; > 0, a (1 + \&egr;)-approximate nearest neighbor of q can be computed in O(cd, \&egr; log n) time, where cd,\&egr;<=d 1 + 6d/e;d is a factor depending only on dimension and \&egr;. In general, we show that given an integer k >= 1, (1 + \&egr;)-approximations to the k nearest neighbors of q can be computed in additional O(kd log n) time.}, keywords = {Approximation algorithms, Box-decomposition trees, closet-point queries, nearest neighbor searching, post-office problem, priority search}, isbn = {0004-5411}, doi = {10.1145/293347.293348}, url = {http://doi.acm.org/10.1145/293347.293348}, author = {Arya,Sunil and Mount, Dave and Netanyahu,Nathan S. and Silverman,Ruth and Wu,Angela Y.} } @article {15520, title = {An overview of cooperative answering in databases}, journal = {Flexible Query Answering Systems}, year = {1998}, month = {1998///}, pages = {282 - 285}, abstract = {The field of cooperative answering goes back to work started by Joshi and Webber [12] in natural language processing in the early 1980s at the University of Pennsylvania. The work was applied to databases and information systems at the University of Pennsylvania by Kaplan [14, 15] and Mays [17]. Other early work at the University of Pennsylvania and at other universities is discussed in [25, 13, 26, 16, 18, 24]. Databases and knowledge base systems are often difficult to use because they do not attempt to cooperate with their users. A database or a knowledge base query system provides literal answers to queries posed to them. Such answers to queries may not always be the best answers. Instead, an answer with extra or alternative information may be more useful and less misleading to a user.This lecture surveys foundational work that has been done toward developing database and knowledge base systems with the ability to exhibit cooperative behavior. In the 1970s, Grice [11] proposed maxims of cooperative conversation. These maxims provide the starting point for the field of cooperative answering. }, doi = {DOI: 10.1007/BFb0056009}, author = {Minker, Jack} } @conference {14809, title = {Performance measurement using low perturbation and high precision hardware assists}, booktitle = {, The 19th IEEE Real-Time Systems Symposium, 1998. Proceedings}, year = {1998}, month = {1998/12/02/4}, pages = {379 - 388}, publisher = {IEEE}, organization = {IEEE}, abstract = {We present the design and implementation of MultiKron PCI, a hardware performance monitor that can be plugged into any computer with a free PCI bus slot. The monitor provides a series of high-resolution timers, and the ability to monitor the utilization of the PCI bus. We also demonstrate how the monitor can be integrated with online performance monitoring tools such as the Paradyn parallel performance measurement tools to improve the overhead of key timer operations by a factor of 25. In addition, we present a series of case studies using the MultiKron hardware performance monitor to measure and tune high-performance parallel completing applications. By using the monitor, we were able to find and correct a performance bug in a popular implementation of the MPI message passing library that caused some communication primitives to run at one half their potential speed}, keywords = {Clocks, Computerized monitoring, Counting circuits, Debugging, Hardware, hardware performance monitor, high precision hardware assists, low perturbation, measurement, MPI message passing library, MultiKron hardware performance monitor, MultiKron PCI, NIST, online performance monitoring tools, Paradyn parallel performance measurement tools, PCI bus slot, performance bug, performance evaluation, performance measurement, program debugging, program testing, real-time systems, Runtime, Timing}, isbn = {0-8186-9212-X}, doi = {10.1109/REAL.1998.739771}, author = {Mink, A. and Salamon, W. and Hollingsworth, Jeffrey K and Arunachalam, R.} } @article {14721, title = {PLAN: a packet language for active networks}, journal = {SIGPLAN Not.}, volume = {34}, year = {1998}, month = {1998/09//}, pages = {86 - 93}, abstract = {PLAN (Packet Language for Active Networks) is a new language for programs that form the packets of a programmable network. These programs replace the packet headers (which can be viewed as very rudimentary programs) used in current networks. As such, PLAN programs are lightweight and of restricted functionality. These limitations are mitigated by allowing PLAN code to call node-resident service routines written in other, more powerful languages. This two-level architecture, in which PLAN serves as a scripting or {\textquoteright}glue{\textquoteright} language for more general services, is the primary contribution of this paper. We have successfully applied the PLAN programming environment to implement an IP-free internetwork.PLAN is based on the simply typed lambda calculus and provides a restricted set of primitives and datatypes. PLAN defines a special construct called a chunk used to describe the remote execution of PLAN programs on other nodes. Primitive operations on chunks are used to provide basic data transport in the network and to support layering of protocols. Remote execution can make debugging difficult, so PLAN provides strong static guarantees to the programmer, such as type safety. A more novel property aimed at protecting network availability is a guarantee that PLAN programs use a bounded amount of network resources.}, isbn = {0362-1340}, doi = {10.1145/291251.289431}, url = {http://doi.acm.org/10.1145/291251.289431}, author = {Hicks, Michael W. and Kakkar,Pankaj and Moore,Jonathan T. and Gunter,Carl A. and Nettles,Scott} } @article {14742, title = {The PLAN system for building Active Networks}, journal = {University of Pennsylvania (February 27, 1998)}, year = {1998}, month = {1998///}, author = {Hicks, Michael W. and Kakkar,P. and Moore,J. T and Gunter,C. A and Alexander,D. S and Nettles,S.} } @article {15521, title = {Semantics for Disjunctive and Normal Disjunctive Logic Programs}, journal = {Handbook of logic in artificial intelligence and logic programming}, volume = {5}, year = {1998}, month = {1998///}, pages = {325 - 325}, author = {Lobo,J. and Minker, Jack and Rajasekar,A.} } @article {18714, title = {Solution structure and dynamics of the bioactive retroviral M domain from rous sarcoma virus}, journal = {Journal of Molecular Biology}, volume = {279}, year = {1998}, month = {1998/06/19/}, pages = {921 - 928}, abstract = {A biologically active construct of the retroviral M domain from the avian Rous sarcoma virus is defined and its solution structure described. This M domain is fully active in budding and infectivity without myristylation. In spite of a sequence homology level that suggests no relationship among M domains and the family of matrix proteins in mammalian retroviruses, the conserved structural elements of a central core allow an M domain sequence motif to be described for all retroviruses. The surface of the M domain has a highly clustered positive patch comprised of sequentially distant residues. An analysis of the backbone dynamics, incorporating rotational anisotropy, is used to estimate the thermodynamics of proposed domain oligomerization.}, keywords = {heteronuclear NMR spectroscopy, protein dynamics, RSV matrix protein, sequence homology, three-dimensional structure}, isbn = {0022-2836}, doi = {10.1006/jmbi.1998.1788}, url = {http://www.sciencedirect.com/science/article/pii/S0022283698917880}, author = {McDonnell,James M and Fushman, David and Cahill,Sean M. and Zhou,Wenjun and Wolven,Amy and Wilson,Carol B and Nelle,Timothy D and Resh,Marilyn D and Wills,John and Cowburn,David} } @article {15673, title = {Stabbing Orthogonal Objects in 3-Space}, volume = {UMIACS-TR-96-71}, year = {1998}, month = {1998/10/15/}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {We consider a problem that arises in the design of data structuresfor answering {\em visibility range queries}, that is, given a $3$-dimensional scene defined by a set of polygonal patches, we wish to preprocess the scene to answer queries involving the set of patches of the scene that are visible from a given range of points over a given range of viewing directions. These data structures recursively subdivide space into cells until some criterion is satisfied. One of the important problems that arise in the construction of such data structures is that of determining whether a cell represents a nonempty region of space, and more generally computing the size of a cell. In this paper we introduce a measure of the {\em size} of the subset of lines in 3-space that stab a given set of $n$ polygonal patches, based on the maximum angle and distance between any two lines in the set. Although the best known algorithm for computing this size measure runs in $O(n^2)$ time, we show that if the polygonal patches are orthogonal rectangles, then this measure can be approximated to within a constant factor in $O(n)$ time. (Also cross-referenced as UMIACS-TR-96-71) }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu//handle/1903/850}, author = {Mount, Dave and Pu,Fan-Tao} } @conference {14656, title = {A study of large object spaces}, booktitle = {Proceedings of the 1st international symposium on Memory management}, series = {ISMM {\textquoteright}98}, year = {1998}, month = {1998///}, pages = {138 - 145}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {This paper examines the design space for copying garbage collectors (GCs) in which "large objects" are managed in a separate, non-copy-collected space. We focus on two main issues:1. how to set the policy for classifying objects as "large"2. how to manage the large object spaceWe explore these issues experimentally using the Oscar GC testbed. In particular, we vary the threshold size of large objects and also whether the objects may contain pointers. Furthermore, we compare the performance of treadmill collection to that of mark-and-sweep collection for managing the large object space.We find that for some heaps there is a minimum cutoff size below which adding objects to the large object space does not result in a performance improvement, while for others no such cutoff exists. In general, including pointer-containing objects in the large object space seems beneficial. Finally, the exact method used to collect the large object space does not significantly influence overall performance.}, isbn = {1-58113-114-3}, doi = {10.1145/286860.286875}, url = {http://doi.acm.org/10.1145/286860.286875}, author = {Hicks, Michael W. and Hornof,Luke and Moore,Jonathan T. and Nettles,Scott M.} } @article {12079, title = {The SwitchWare active network architecture}, journal = {IEEE Network}, volume = {12}, year = {1998}, month = {1998/06//May}, pages = {29 - 36}, abstract = {Active networks must balance the flexibility of a programmable network infrastructure against the safety and security requirements inherent in sharing that infrastructure. Furthermore, this balance must be achieved while maintaining the usability of the network. The SwitchWare active network architecture is a novel approach to achieving this balance using three layers: active packets, which contain mobile programs that replace traditional packets; active extensions, which provide services on the network elements and can be dynamically loaded; and a secure active router infrastructure, which forms a high-integrity base on which the security of the other layers depends. In addition to integrity checking and cryptography-based authentication, security in our architecture depends heavily on verification techniques from programming languages, such as strong type checking}, keywords = {active extensions, active packets, Authentication, Computer languages, Computer networks, cryptography, cryptography-based authentication, high-integrity base, integrity checking, IP networks, LAN interconnection, mobile programs, network operating systems, packet switching, programmable network infrastructure, programming languages, Protocols, Safety, safety requirements, scalability, secure active router infrastructure, Security, security requirements, services, strong type checking, Switches, SwitchWare active network architecture, telecommunication network routing, Tin, usability, verification techniques}, isbn = {0890-8044}, doi = {10.1109/65.690959}, author = {Alexander,D. S and Arbaugh, William A. and Hicks, Michael W. and Kakkar,P. and Keromytis,A. D and Moore,J. T and Gunter,C. A and Nettles,S. M and Smith,J. M} } @article {14745, title = {The switchware active network implementation}, journal = {The ML Workshop, International Conference on Functional Programming (ICFP)}, year = {1998}, month = {1998///}, author = {Alexander,D. S and Hicks, Michael W. and Kakkar,P. and Keromytis,A. D and Shaw,M. and Moore,J. T and Gunter,C. A and Jim,T. and Nettles,S. M and Smith,J. M} } @article {15408, title = {Three-Dimensional Hydrodynamic Modeling of MOSFET Devices}, journal = {VLSI Design}, volume = {6}, year = {1998}, month = {1998///}, pages = {261 - 265}, abstract = {The hydrodynamic (HD) model of semiconductor devices is solved numerically inthree-dimensions (3-D) for the MOSFET device. The numerical instabilities of the HD model are analyzed to develop a stable discretization. The formulation is stabilized by using a new, higher-order discretization for the relaxation-time approximation (RTA) term of the energy-balance (EB) equation. The developed formulation is used to model the MOSFET. }, isbn = {1065-514X, 1563-5171}, doi = {10.1155/1998/60859}, url = {http://www.hindawi.com/journals/vlsi/1998/060859/abs/}, author = {Kerr,Daniel C. and Goldsman,Neil and Mayergoyz, Issak D} } @conference {15680, title = {Threshold-based admission control for multi-class video-on-demand systems}, booktitle = {Performance, Computing and Communications, 1998. IPCCC {\textquoteright}98., IEEE International}, year = {1998}, month = {1998/02/16/18}, pages = {154 - 160}, publisher = {IEEE}, organization = {IEEE}, abstract = {The next generation of distributed digital video-on-demand (VoD) systems will use admission control tests to ensure that users receive predictable and guaranteed service. If the system cannot support a new request then that request is blocked This paper presents an analytical model to evaluate unified admission control strategies for distributed VoD systems with multiple video classes. We prove that there exists a computationally efficient technique to determine the blocking probabilities for newly arriving requests. Through numerical analysis we show the effect of different admission control policies on overall system blocking rates}, keywords = {Admission control, admission control tests, analytical model, Analytical models, blocking probabilities, buffer storage, Computer architecture, distributed digital VoD systems, File servers, guaranteed service, High-speed networks, interactive video, Motion pictures, multi-class video-on-demand systems, multimedia systems, Network servers, newly arriving requests, numerical analysis, Predictive models, probability, recursive algorithm, system blocking rates, telecommunication congestion control, threshold-based admission control, unified admission control}, isbn = {0-7803-4468-5}, doi = {10.1109/PCCC.1998.659937}, author = {Mundur, Padma and Sood,A. and Simon,R.} } @book {13028, title = {Trends in the Early Careers of Life Scientists}, year = {1998}, month = {1998///}, publisher = {National Academy Press}, organization = {National Academy Press}, address = {Washington, DC}, author = {Tilghman,S and Astin,HS and Brinkley,W and Chilton,MD and Cummings, Michael P. and Ehrenberg,RG and Fox,MF and Glenn,K and Green,PJ and Hans,S and Kelman,A and LaPidus,J and Levin,B and McIntosh,JR and Riecken,H and Stephen,PE} } @article {13029, title = {Trends in the early careers of life scientists - Preface and executive summary}, journal = {Mol Biol Cell}, volume = {9}, year = {1998}, month = {1998/11//}, pages = {3007 - 3015}, author = {Tilghman,S and Astin,HS and Brinkley,W and Chilton,MD and Cummings, Michael P. and Ehrenberg,RG and Fox,MF and Glenn,K and Green,PJ and Hans,S and Kelman,A and LaPidus,J and Levin,B and McIntosh,JR and Riecken,H and Stephen,PE} } @inbook {14268, title = {The Video Yardstick}, booktitle = {Modelling and Motion Capture Techniques for Virtual EnvironmentsModelling and Motion Capture Techniques for Virtual Environments}, series = {Lecture Notes in Computer Science}, volume = {1537}, year = {1998}, month = {1998///}, pages = {144 - 158}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {Given uncalibrated video sequences, how can we recover rich descriptions of the scene content, beyond two-dimensional (2D) measurements such as color/texture or motion fields {\textemdash} descriptions of shape and three-dimensional (3D) motion? This is the well known structure from motion (SFM) problem. Up to now, SFM algorithms proceeded in two well defined steps, where the first and most important step is recovering the rigid transformation between two views, and the subsequent step is using this transformation to compute the structure of the scene in view. This paper introduces a novel approach to structure from motion in which both steps are accomplished in a synergistic manner. It deals with the classical structure from motion problem considering a calibrated camera as well as the extension to an uncalibrated optical device. Existing approaches to estimation of the viewing geometry are mostly based on the use of optic flow, which, however, poses a problem at the locations of depth discontinuities. If we knew where depth discontinuities were, we could (using a multitude of approaches based on smoothness constraints) accurately estimate flow values for image patches corresponding to smooth scene patches; but to know the discontinuities requires solving the structure from motion problem first. In the past this dilemma has been addressed by improving the estimation of flow through sophisticated optimization techniques, whose performance often depends on the scene in view. In this paper we follow a different approach. We directly utilize the image derivatives and employ constraints which involve the 3D motion and shape of the scene, leading to a geometric and statistical estimation problem. The main idea is based on the interaction between 3D motion and shape which allows us to estimate the 3D motion while at the same time segmenting the scene. If we use a wrong 3D motion estimate to compute depth, we obtain a distorted version of the depth function. The distortion, however, is such that the worse the motion estimate, the more likely we are to obtain depth estimates that are locally unsmooth, i.e., they vary more than the correct ones. Since local variability of depth is due either to the existence of a discontinuity or to a wrong 3D motion estimate, being able to differentiate between these two cases provides the correct motion, which yields the {\textquotedblleft}smoothest{\textquotedblright} estimated depth as well as the image locations of scene discontinuities. We analyze the new constraints introduced by our approach and show their relationship to the minimization of the epipolar constraint, which becomes a special case of our theory. Finally, we present a number of experimental results with real image sequences indicating the robustness of our method and the improvement over traditional methods. The resulting system is a video yardstick that can be applied to any video sequence to recover first the calibration parameters of the camera that captured the video and, subsequently, the structure of the scene.}, isbn = {978-3-540-65353-0}, url = {http://dx.doi.org/10.1007/3-540-49384-0_12}, author = {Brodsk{\'y},Tom{\'a}{\v s} and Ferm{\"u}ller, Cornelia and Aloimonos, J.}, editor = {Magnenat-Thalmann,Nadia and Thalmann,Daniel} } @conference {16189, title = {Visualizing medical records with LifeLines}, booktitle = {CHI 98 conference summary on Human factors in computing systems}, series = {CHI {\textquoteright}98}, year = {1998}, month = {1998///}, pages = {28 - 29}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, keywords = {healthcare, History, medical record, overview, timeline, Visualization}, isbn = {1-58113-028-7}, doi = {10.1145/286498.286513}, url = {http://doi.acm.org/10.1145/286498.286513}, author = {Plaisant, Catherine and Heller,Daniel and Li,Jia and Shneiderman, Ben and Mushlin,Rich and Karat,John} } @article {15369, title = {2-D MOSFET modeling including surface effects and impact ionization by self-consistent solution of the Boltzmann, Poisson, and hole-continuity equations}, journal = {Electron Devices, IEEE Transactions on}, volume = {44}, year = {1997}, month = {1997/02//}, pages = {257 - 267}, abstract = {We present a new two-dimensional (2-D) MOSFET simulation method achieved by directly solving the Boltzmann transport equation for electrons, the hole-current continuity equation, and the Poisson equation self-consistently. The spherical harmonic method is used for the solution of the Boltzmann equation. The solution directly gives the electron distribution function, electrostatic potential, and the hole concentration for the entire 2-D MOSFET. Average quantities such as electron concentration and electron temperature are obtained directly from the integration of the distribution function. The collision integral is formulated to arbitrarily high spherical harmonic order, and new collision terms are included that incorporate effects of surface scattering and electron-hole pair recombination/generation. I-V characteristics, which agree with experiment, are calculated directly from the distribution function for an LDD submicron MOSFET. Electron-hole pair generation due to impact ionization is also included by direct application of the collision integral. The calculations are efficient enough for day-to-day engineering design on workstation-type computers}, keywords = {2D, characteristics;LDD, concentration;electron, concentration;hole-continuity, density;electron-hole, density;impact, device, distribution, effects;surface, equation;collision, equation;I-V, equation;MOSFET;electron, equations;impact, equations;semiconductor, function;electron, generation;electron-hole, harmonic, integral;electron, ionisation;integral, ionization;self-consistent, method;Boltzmann, method;surface, modeling;Boltzmann, models;surface, MOSFET, MOSFET;Poisson, pair, potential;hole, recombination;electrostatic, recombination;hole, scattering;, scattering;two-dimensional, simulation, solution;spherical, submicron, temperature;electron-hole, transport}, isbn = {0018-9383}, doi = {10.1109/16.557713}, author = {Liang,Wenchao and Goldsman,N. and Mayergoyz, Issak D and Oldiges,P.J.} } @article {12771, title = {An algebraic theory of multiple clocks}, journal = {CONCUR{\textquoteright}97: Concurrency Theory}, year = {1997}, month = {1997///}, pages = {166 - 180}, author = {Cleaveland, Rance and L\{\"u}ttgen,G. and Mendler,M.} } @article {15561, title = {ANN: A library for approximate nearest neighbor searching}, journal = {CGC 2nd Annual Fall Workshop on Computational Geometry}, year = {1997}, month = {1997///}, author = {Mount, Dave and Arya,S.} } @article {12336, title = {APGAN and RPMC: Complementary heuristics for translating DSP block diagrams into efficient software implementations}, journal = {Design Automation for Embedded Systems}, volume = {2}, year = {1997}, month = {1997///}, pages = {33 - 60}, author = {Bhattacharyya, Shuvra S. and Murthy,P. K and Lee,E. A} } @conference {16195, title = {Bringing treasures to the surface: iterative design for the Library of Congress National Digital Library Program}, booktitle = {Proceedings of the SIGCHI conference on Human factors in computing systems}, series = {CHI {\textquoteright}97}, year = {1997}, month = {1997///}, pages = {518 - 525}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, keywords = {browse, design process, digital libraries, dynamic query, java, preview, search, web design}, isbn = {0-89791-802-9}, doi = {10.1145/258549.259009}, url = {http://doi.acm.org/10.1145/258549.259009}, author = {Plaisant, Catherine and Marchionini,Gary and Bruns,Tom and Komlodi,Anita and Campbell,Laura} } @conference {15693, title = {Challenges in sending large radiology images over military communications channels}, booktitle = {Proceedings of SPIE}, volume = {3035}, year = {1997}, month = {1997///}, pages = {230 - 230}, author = {Cleary,K.R. and Levine,B.A. and Norton,G.S. and Mundur,P.V.} } @conference {15526, title = {A characterization of the partial stable models for disjunctive deductive databases}, booktitle = {Logic programming: proceedings of the 1997 International Symposium}, year = {1997}, month = {1997///}, pages = {245 - 245}, author = {Minker, Jack} } @article {17949, title = {Collabcad: A toolkit for integrated synchronous and asynchronous sharing of cad applications}, journal = {Proceedings TeamCAD: GVU/NIST Workshop on Collaborative Design, Atlanta, GA, USA}, year = {1997}, month = {1997///}, pages = {131 - 137}, abstract = {We are developing CollabCAD, a novel software architecture and toolkit, that supports shar-ing of arbitrary user-defined objects or applications over intranets and the internet. Developers can use CollabCAD to rapidly re-engineer existing CAD applications to be collaboration-capable or build new collaboration-capable CAD applications. CollabCAD provides the following functionalities: 1. Support for fiexible forms of sharing in which users can interact with multiple presentations of CAD applications or objects. 2. asynchronous and synchronous sharing, as well as a mixture of both, 3. effective communication between users by supporting direct manipulation of user-defined objects, and a new form of sharing called para-synchronous sharing, 4. support for asymmetric collaborations between users with 1 different roles, or, 2 systems with different input-output, hardware and network capabilities. We plan to test and evaluate CollabCAD by building collaboration systems in several CAD- oriented application areas: these include virtual reality for mechanical, architectural and molec- ular CAD, and volume visualization and volume graphics for CAD applications. }, author = {Mishra,P. and Varshney, Amitabh and Kaufman,A.} } @article {15525, title = {Combining Closed World Assumptions with Stable Negation}, journal = {Fundamenta Informaticae}, volume = {32}, year = {1997}, month = {1997/01/01/}, pages = {163 - 181}, abstract = {We study the semantics of disjunctive logic programs that simultaneously contain multiple kinds of default negations. We introduce operators notG, notW, and notSTB in the language of logic programs to represent the Generalized Closed World Assumption, the Weak Generalized Closed World Assumption, and the stable negation, respectively. The notion of stratification involving different kinds of negations is defined and the meaning of stratified programs with multiple negations is described. The class of stratified programs is extended to the class of quasi-stratified programs and the semantics of the latest class is studied.}, doi = {10.3233/FI-1997-32205}, url = {http://dx.doi.org/10.3233/FI-1997-32205}, author = {Ruiz,Carolina and Minker, Jack} } @article {18377, title = {Comments on "Towards a framework for software measurement validation"}, journal = {Software Engineering, IEEE Transactions on}, volume = {23}, year = {1997}, month = {1997/03//}, pages = {187 - 189}, abstract = {A view of software measurement that disagrees with the model presented by Kitchenham, Pfleeger, and Fenton (1995), is given. Whereas Kitchenham et al. argue that properties used to define measures should not constrain the scale type of measures, the authors contend that that is an inappropriate restriction. In addition, a misinterpretation of Weyuker{\textquoteright}s (1988) properties is noted.}, keywords = {measurement, metrics;, software, testing;program, validation;program, verification;software}, isbn = {0098-5589}, doi = {10.1109/32.585506}, author = {Morasca,S. and Briand,L.C. and Basili, Victor R. and Weyuker,E.J. and Zelkowitz, Marvin V and Kitchenham,B. and Lawrence Pfleeger,S. and Fenton,N.} } @inbook {17027, title = {Comprehension and object recognition capabilities for presentations of simultaneous video key frame surrogates}, booktitle = {Research and Advanced Technology for Digital LibrariesResearch and Advanced Technology for Digital Libraries}, series = {Lecture Notes in Computer Science}, volume = {1324}, year = {1997}, month = {1997///}, pages = {41 - 54}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {The demand for more efficient browsing of video data is expected to increase as greater access to this type of data becomes available. This experiment looked at one technique for displaying video data using key frame surrogates that are presented as a ldquoslide showrdquo. Subjects viewed key frames for between one and four video clips simultaneously. Following this presentation, the subjects performed object recognition and gist comprehension tasks in order to determine human thresholds for divided attention between these multiple displays. It was our belief that subject performance would degrade as the number of slide shows shown simultaneously increased. For object recognition and gist comprehension tasks, a decrease in performance between the one slide show display and the two, three or four slide show displays was found. In the case of two or three video presentations, performance is about the same, and there remains adequate object recognition abilities and comprehension of the video clips. Performance drops off to unacceptable levels when four slide shows are displayed at once.}, isbn = {978-3-540-63554-3}, url = {http://dx.doi.org/10.1007/BFb0026720}, author = {Slaughters,Laura and Shneiderman, Ben and Marchionini,Gary}, editor = {Peters,Carol and Thanos,Costantino} } @conference {17070, title = {Designing interactive multimedia (panel)}, booktitle = {Proceedings of the fifth ACM international conference on Multimedia}, series = {MULTIMEDIA {\textquoteright}97}, year = {1997}, month = {1997///}, pages = {215 - 218}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, isbn = {0-89791-991-2}, doi = {10.1145/266180.266370}, url = {http://doi.acm.org/10.1145/266180.266370}, author = {Scarlatos,Lori L. and Darken,Rudolph P. and Harada,Komei and Heeter,Carrie and Muller,Richard and Shneiderman, Ben} } @article {17086, title = {Direct manipulation vs. interface agents}, journal = {Interactions}, volume = {4}, year = {1997}, month = {1997///}, pages = {42 - 61}, author = {Shneiderman, Ben and Maes,P.} } @conference {15598, title = {Efficient algorithms for robust feature matching}, booktitle = {Image Registration Workshop Proceedings}, year = {1997}, month = {1997///}, publisher = {NASA}, organization = {NASA}, abstract = {One of the basic building blocks in any point-based registration scheme involves matching feature points that are extracted from the sensed image to their counterparts in the reference image. This leads to the fundamental problem of point matching: given two sets of points, find the affine transformation that transforms one point set so that its distance from the other point set is minimized. Because of measurement errors and the presence of outlying data points, it is important that the distance measure between two point sets be robust to these effects. We measure distances using the generalized Hausdorff distance. Point matching can be a computationally intensive task, and there have been a number of algorithms and approaches proposed for solving this problem both theoretical and applied. We present two approaches to the point matching problem, in an attempt to reduce the computational complexity of the problem, while still providing guarantees on the quality of the final match. Our first method is an approximation algorithm, which is loosely based on a branch-and-bound approach due to Huttenlocher and Rucklidge. We show that by varying the approximation error bounds, it is possible to achieve a tradeoff between the quality of the match and the running time of the algorithm. Our second method involves a Monte Carlo method for accelerating the search process used in the first algorithm. With high probability this method succeeds in finding an approximately optimal match. We establish the efficiency of our approaches empirically.}, author = {Mount, Dave and Netanyahu,N. S and Le Moigne,J.} } @article {18977, title = {Genetic depletion reveals an essential role for an SR protein splicing factor in vertebrate cells}, journal = {BioEssays}, volume = {19}, year = {1997}, month = {1997///}, pages = {189 - 192}, abstract = {SR proteins are essential for the splicing of messenger RNA precursors in vitro, where they also alter splice site selection in a concentration-dependent manner. Although experiments involving overexpression or dominant mutations have confirmed that these proteins can influence RNA processing decisions in vivo, similar results with loss-of-function mutations have been lacking. Now, a system for genetic depletion of the chicken B cell line DT40 has revealed that the SR protein ASF/SF2 (alternative splicing factor/splicing factor 2) is essential for viability in these cells(1). This study opens the way for a complete functional dissection of this protein, and other SR proteins, in vivo.}, isbn = {1521-1878}, doi = {10.1002/bies.950190302}, url = {http://onlinelibrary.wiley.com/doi/10.1002/bies.950190302/abstract}, author = {Mount, Stephen M.} } @conference {15593, title = {Geometric intersection}, booktitle = {Handbook of Discrete and Computational Geometry, chapter 33}, year = {1997}, month = {1997///}, pages = {615 - 632}, publisher = {CRC Press LLC, Boca}, organization = {CRC Press LLC, Boca}, abstract = {Detecting whether two geometric objects intersect and computing the region of intersection are fundamental problems in computational geometry. Geometric intersection problems arise naturally in a number of applications. Examples include geometric packing and covering, wire and component layout in VLSI, map overlay}, author = {Mount, Dave} } @article {14571, title = {Hardness of flip-cut problems from optical mapping}, journal = {Journal of Computational Biology}, volume = {4}, year = {1997}, month = {1997///}, pages = {119 - 125}, author = {DAN{\v C}{\'I}K,V. and Hannenhalli, Sridhar and Muthukrishnan,S.} } @conference {14621, title = {Hardness of flip-cut problems from optical mapping [DNA molecules application]}, booktitle = {Compression and Complexity of Sequences 1997. Proceedings}, year = {1997}, month = {1997/06/11/13}, pages = {275 - 284}, publisher = {IEEE}, organization = {IEEE}, abstract = {Optical mapping is a new technology for constructing restriction maps. Associated computational problems include aligning multiple partial restriction maps into a single {\textquotedblleft}consensus{\textquotedblright} restriction map, and determining the correct orientation of each molecule, which was formalized as the exclusive binary flip cut (EBFC) problem by Muthukrishnan and Parida (see Proc. of the First ACM Conference on Computational Molecular Biology (RECOMB), Santa Fe, p.209-19, 1997). Here, the authors prove that the EBFC problem, as well as a number of its variants, are NP-complete. They also identify another problem formalized as binary shift cut (BSC) problem motivated by the fact that there might be missing fragments at the beginnings and/or the ends of the molecules, and prove it to be NP-complete. Therefore, they do not have efficient, that is, polynomial time solutions unless P=NP}, keywords = {binary shift cut, Biochemistry, Bioinformatics, biological techniques, Biology, biomedical optical imaging, combinatorial mathematics, combinatorial problem, computational complexity, computational problems, DNA, DNA molecule, exclusive binary flip cut, flip-cut problem hardness, Genetic engineering, Genomics, MATHEMATICS, molecular biology, molecular biophysics, molecule orientation, multiple partial restriction maps, NP-complete problem, optical mapping, polynomial time solutions, Polynomials, sequences}, isbn = {0-8186-8132-2}, doi = {10.1109/SEQUEN.1997.666922}, author = {Dancik,V. and Hannenhalli, Sridhar and Muthukrishnan,S.} } @article {15952, title = {How to (plan to) meet a deadline between now and then}, journal = {Journal of Logic and Computation}, volume = {7}, year = {1997}, month = {1997///}, pages = {109 - 109}, author = {Nirkhe,M. and Kraus,S. and Miller,M. and Perlis, Don} } @conference {17240, title = {Intelligent software agents vs. user-controlled direct manipulation: a debate}, booktitle = {CHI {\textquoteright}97 extended abstracts on Human factors in computing systems: looking to the future}, series = {CHI EA {\textquoteright}97}, year = {1997}, month = {1997///}, pages = {105 - 106}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Critical issues in human-computer interaction - in particular, the advantages and disadvantages of intelligent agents and direct manipulation - will be discussed, debated, and hotly contested. The intent of the participants is to strike an appropriate balance between a serious discussion of the issues and an entertaining debate.}, keywords = {agents, direct manipulation, graphical representation, intelligent interfaces}, isbn = {0-89791-926-2}, doi = {10.1145/1120212.1120281}, url = {http://doi.acm.org/10.1145/1120212.1120281}, author = {Maes,Pattie and Shneiderman, Ben and Miller,Jim} } @article {12385, title = {Joint minimization of code and data for synchronous dataflow programs}, journal = {Formal Methods in System Design}, volume = {11}, year = {1997}, month = {1997///}, pages = {41 - 70}, author = {Murthy,P. K and Bhattacharyya, Shuvra S. and Lee,E. A} } @article {14627, title = {Local Rules for Protein Folding on a Triangular Lattice and Generalized Hydrophobicity in the HP Model}, journal = {Journal of Computational Biology}, volume = {4}, year = {1997}, month = {1997/01//}, pages = {275 - 296}, abstract = {We consider the problem of determining the three-dimensional folding of a protein given its one-dimensional amino acid sequence. We use the HP model for protein folding proposed by Dill (1985), which models protein as a chain of amino acid residues that are either hydrophobic or polar, and hydrophobic interactions are the dominant initial driving force for the protein folding. Hart and Istrail (1996a) gave approximation algorithms for folding proteins on the cubic lattice under the HP model. In this paper, we examine the choice of a lattice by considering its algorithmic and geometric implications and argue that the triangular lattice is a more reasonable choice. We present a set of folding rules for a triangular lattice and analyze the approximation ratio they achieve. In addition, we introduce a generalization of the HP model to account for residues having different levels of hydrophobicity. After describing the biological foundation for this generalization, we show that in the new model we are able to achieve similar constant factor approximation guarantees on the triangular lattice as were achieved in the standard HP model. While the structures derived from our folding rules are probably still far from biological reality, we hope that having a set of folding rules with different properties will yield more interesting folds when combined.}, isbn = {1066-5277, 1557-8666}, doi = {10.1089/cmb.1997.4.275}, url = {http://www.liebertonline.com/doi/abs/10.1089/cmb.1997.4.275}, author = {Agarwala,Richa and Batzoglou,Serafim and Dan{\v c}{\'\i}K,Vlado and Decatur,Scott E. and Hannenhalli, Sridhar and Farach,Martin and Muthukrishnan,S. and Skiena,Steven} } @article {15527, title = {Logic and Databases Past, Present, and Future}, journal = {AI Magazine}, volume = {18}, year = {1997}, month = {1997///}, pages = {21 - 21}, author = {Minker, Jack} } @conference {14813, title = {MDL: a language and compiler for dynamic program instrumentation}, booktitle = {, 1997 International Conference on Parallel Architectures and Compilation Techniques., 1997. Proceedings}, year = {1997}, month = {1997/11/10/14}, pages = {201 - 212}, publisher = {IEEE}, organization = {IEEE}, abstract = {We use a form of dynamic code generation, called dynamic instrumentation, to collect data about the execution of an application program. Dynamic instrumentation allows us to instrument running programs to collect performance and other types of information. The instrumentation code is generated incrementally and can be inserted and removed at any time. Our instrumentation currently runs on the SPARC, PA-RISC, Power 2, Alpha, and x86 architectures. Specification of what data to collect are written in a specialized language called the Metric Description Language, that is part of the Paradyn Parallel Performance Tools. This language allows platform independent descriptions of how to collect performance data. It also provides a concise way to specify, how to constrain performance data to particular resources such as modules, procedures, nodes, files, or message channels (or combinations of these resources). We also describe the details of how we weave instrumentation into a running program}, keywords = {Alpha architecture, application program, application program interfaces, Application software, compiler generators, Computer science, dynamic code generation, Dynamic compiler, dynamic program instrumentation, Educational institutions, files, instrumentation code, Instruments, MDL, measurement, message channels, Message passing, Metric Description Language, modules, nodes, Operating systems, optimising compilers, PA-RISC, Paradyn Parallel Performance Tools, Parallel architectures, parallel programming, performance data, platform independent descriptions, Power 2 architecture, Power generation, procedures, program debugging, Program processors, running programs, Runtime, software metrics, SPARC, Specification languages, x86 architecture}, isbn = {0-8186-8090-3}, doi = {10.1109/PACT.1997.644016}, author = {Hollingsworth, Jeffrey K and Niam, O. and Miller, B. P and Zhichen Xu and Goncalves,M. J.R and Ling Zheng} } @article {14741, title = {The measured cost of copying garbage collection mechanisms}, journal = {SIGPLAN Not.}, volume = {32}, year = {1997}, month = {1997/08//}, pages = {292 - 305}, abstract = {We examine the costs and benefits of a variety of copying garbage collection (GC) mechanisms across multiple architectures and programming languages. Our study covers both low-level object representation and copying issues as well as the mechanisms needed to support more advanced techniques such as generational collection, large object spaces, and type segregated areas.Our experiments are made possible by a novel performance analysis tool, Oscar. Oscar allows us to capture snapshots of programming language heaps that may then be used to replay garbage collections. The replay program is self-contained and written in C, which makes it easy to port to other architectures and to analyze with standard performance analysis tools. Furthermore, it is possible to study additional programming languages simply by instrumenting existing implementations to capture heap snapshots.In general, we found that careful implementation of GC mechanisms can have a significant benefit. For a simple collector, we measured improvements of as much as 95\%. We then found that while the addition of advanced features can have a sizeable overhead (up to 15\%), the net benefit is quite positive, resulting in additional gains of up to 42\%. We also found that results varied depending upon the platform and language. Machine characteristics such as cache arrangements, instruction set (RISC/CISC), and register pool were important. For different languages, average object size seemed to be most important.The results of our experiments demonstrate the usefulness of a tool like Oscar for studying GC performance. Without much overhead, we can easily identify areas where programming language implementors could collaborate with GC implementors to improve GC performance.}, isbn = {0362-1340}, doi = {10.1145/258949.258976}, url = {http://doi.acm.org/10.1145/258949.258976}, author = {Hicks, Michael W. and Moore,Jonathan T. and Nettles,Scott M.} } @article {15523, title = {Model generation and state generation for disjunctive logic programs}, journal = {The Journal of Logic Programming}, volume = {32}, year = {1997}, month = {1997/07//}, pages = {49 - 69}, abstract = {This paper investigates two fixpoint approaches for minimal model reasoning with disjunctive logic programs P. The first one, called model generation, is based on an operator TPINT defined on sets of Herbrand interpretations whose least fixpoint is logically equivalent to the set of minimal Herbrand models of the program. The second approach, called state generation, uses a fixpoint operation TPs based on hyperresolution. It operates on disjunctive Herbrand states, and its least fixpoint is the set of logical consequences of P, the so-called minimal model state of the program. We establish a useful relationship between hyperresolution by PPs and model generation by TPINT. Then we investigate the problem of continuity of the two operators TPs and TPINT. It is known that the operator TPs is continuous, and so it reaches its least fixpoint in at most ω iterations. On the other hand, the question of whether TPINT is continuous has been open. We show by a counterexample that TPINT is not continuous. Nevertheless, we prove that it converges towards its least fixpoint in at most ω iterations, too, as follows from the relationship that we show exists between hyperresolution and model generation. We define an iterative version of TPINT that computes the perfect model semantics of stratified disjunctive logic programs. On each stratum of the program, this operator converges in at most ω iterations. Model generations for the stable semantics and the partial stable semantics are respectively achieved by using this iterative operator together with the evidential transformation and the 3-S transformation.}, isbn = {0743-1066}, doi = {10.1016/S0743-1066(96)00116-1}, url = {http://www.sciencedirect.com/science/article/pii/S0743106696001161}, author = {Seipel,Dietmar and Minker, Jack and Ruiz,Carolina} } @article {15608, title = {Parallelizing and algorithm for visibility on polyhedral terrain}, journal = {International Journal of Computational Geometry and Applications}, volume = {7}, year = {1997}, month = {1997///}, pages = {75 - 84}, abstract = {The best known output-sensitive sequential algorithm for computing the viewshedon a polyhedral terrain from a given viewpoint was proposed by Katz, Overmars, and Sharir 10, and achieves time complexity O((k + n(n)) logn) where n and k are the input and output sizes respectively, and () is the inverse Ackermann{\textquoteright}s function. In this paper, we present a parallel algorithm that is based on the work mentioned above, and achieves O(log2 n) time complexity, with work complexity O((k +n(n)) logn) in a CREW PRAM model. This improves on previous parallel complexity while maintaining work e ciency with respect to the best sequential complexity known. }, author = {Teng,Y. A and Mount, Dave and Puppo,E. and Davis, Larry S.} } @conference {15625, title = {A practical approximation algorithm for the LMS line estimator}, booktitle = {Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms}, series = {SODA {\textquoteright}97}, year = {1997}, month = {1997///}, pages = {473 - 482}, publisher = {Society for Industrial and Applied Mathematics}, organization = {Society for Industrial and Applied Mathematics}, address = {Philadelphia, PA, USA}, keywords = {Approximation algorithms, least median-of-squares regression, line arrangements, line fitting, randomized algorithms, robust estimation}, isbn = {0-89871-390-0}, url = {http://dl.acm.org/citation.cfm?id=314161.314349}, author = {Mount, Dave and Netanyahu,Nathan S. and Romanik,Kathleen and Silverman,Ruth and Wu,Angela Y.} } @conference {16464, title = {Semantic query optimization for object databases}, booktitle = {Data Engineering, 1997. Proceedings. 13th International Conference on}, year = {1997}, month = {1997///}, pages = {444 - 453}, author = {Grant,J. and Gryz,J. and Minker, Jack and Raschid, Louiqa} } @conference {15524, title = {Semantic query optimization for object databases}, booktitle = {Data Engineering, 1997. Proceedings. 13th International Conference on}, year = {1997}, month = {1997/04//}, pages = {444 - 453}, abstract = {Presents a technique for semantic query optimization (SQO) for object databases. We use the ODMG-93 (Object Data Management Group) standard ODL (Object Database Language) and OQL (Object Query Language) languages. The ODL object schema and the OQL object query are translated into a DATALOG representation. Semantic knowledge about the object model and the particular application is expressed as integrity constraints. This is an extension of the ODMG-93 standard. SQO is performed in the DATALOG representation, and an equivalent logic query and (subsequently) an equivalent OQL object query are obtained. SQO is based on the residue technique of Chakravarthy et al. (1990). We show that our technique generalizes previous research on SQO for object databases. It can be applied to queries with structure constructors and method application. It utilizes integrity constraints about keys, methods and knowledge of access support relations, to produce equivalent queries, which may have more efficient evaluation plans}, keywords = {application;object, constraints;keys;method, constructors;DATALOG;data, databases;object-oriented, databases;query, Datalog, Evaluation, integrity;data, languages;query, Logic, object, optimization;structure, plans;residue, processing;software, query, query;access, query;integrity, relations;equivalent, representation;ODL, schema;ODMG-93, standard;OQL, standards;, structures;object-oriented, Support, technique;semantic}, doi = {10.1109/ICDE.1997.581983}, author = {Grant,J. and Gryz,J. and Minker, Jack and Raschid, Louiqa} } @conference {16666, title = {Semi-automatic acquisition of domain-specific translation lexicons}, booktitle = {Proceedings of the fifth conference on Applied natural language processing}, year = {1997}, month = {1997///}, pages = {340 - 347}, author = {Resnik, Philip and Melamed,I.D.} } @article {14655, title = {A Service Layer Routing Protocol for PLAN}, journal = {PLAN documentation, September}, year = {1997}, month = {1997///}, author = {Moore,J. T and Hicks, Michael W.} } @conference {13862, title = {Spanish EuroWordNet and LCS-Based Interlingual MT}, booktitle = {IN PROCEEDINGS OF THE MT SUMMIT WORKSHOP ON INTERLINGUAS IN MT}, year = {1997}, month = {1997///}, abstract = {We present a machine translation framework in which the interlingua -- Lexical Conceptual Structure (LCS) -- is coupled with a definitional component that includes bilingual (EuroWordNet) links between words in the source and target languages. While the links between individual words are language-specific, the LCS is designed to be a language-independent, compositional representation. We take the view that the two types of information -- shallower, transfer-like knowledge as well as deeper, compositional knowledge -- can be reconciled in interlingual machine translation, the former for overcoming the intractability of LCS-based lexical selection, and the latter for relating the underlying semantics of two words cross-linguistically. We describe the acquisition process for these two information types and present results of hand-verification of the acquired lexicon. Finally, we demonstrate the utility of the two information types in interlingual MT.}, author = {Dorr, Bonnie J and Marti,M. Antonia and Castellon,Irene} } @article {15562, title = {Testing simple polygons}, journal = {Computational Geometry}, volume = {8}, year = {1997}, month = {1997/07//}, pages = {97 - 114}, abstract = {We consider the problem of verifying a simple polygon in the plane using {\textquotedblleft}test points{\textquotedblright}. A test point is a geometric probe that takes as input a point in Euclidean space, and returns {\textquotedblleft}+{\textquotedblright} if the point is inside the object being probed or {\textquotedblleft}-{\textquotedblright} if it is outside. A verification procedure takes as input a description of a target object, including its location and orientation, and it produces a set of test points that are used to verify whether a test object matches the description. We give a procedure for verifying an n-sided, non-degenerate, simple target polygon using 5n test points. This testing strategy works even if the test polygon has n + 1 vertices, and we show a lower bound of 3n + 1 test points for this case. We also give algorithms using O(n) test points for simple polygons that may be degenerate and for test polygons that may have up to n + 2 vertices. All of these algorithms work for polygons with holes. We also discuss extensions of our results to higher dimensions.}, keywords = {probing, Testing, Verifying}, isbn = {0925-7721}, doi = {10.1016/S0925-7721(96)00015-6}, url = {http://www.sciencedirect.com/science/article/pii/S0925772196000156}, author = {Arkin,Esther M. and Belleville,Patrice and Mitchell,Joseph S.B. and Mount, Dave and Romanik,Kathleen and Salzberg,Steven and Souvaine,Diane} } @conference {17856, title = {Titan: a High-Performance Remote-sensing Database}, booktitle = {In Proceedings of the 1997 International Conference on Data Engineering}, year = {1997}, month = {1997///}, author = {Bongki,C. C and Chang,C. and Moon,B. and Acharya, A. and Shock,C. and Sussman, Alan and Saltz, J.} } @article {14794, title = {Using content-derived names for configuration management}, journal = {ACM SIGSOFT Software Engineering Notes}, volume = {22}, year = {1997}, month = {1997///}, pages = {104 - 109}, author = {Hollingsworth, Jeffrey K and Miller, E. L} } @conference {17846, title = {The virtual microscope.}, booktitle = {Proceedings of the AMIA Annual Fall Symposium}, year = {1997}, month = {1997///}, pages = {449 - 449}, author = {Ferreira,R. and Moon,B. and Humphries,J. and Sussman, Alan and Saltz, J. and Miller,R. and Demarzo,A.} } @article {17485, title = {Visual and textual consistency checking tools for graphical user interfaces}, journal = {IEEE Transactions on Software Engineering}, volume = {23}, year = {1997}, month = {1997/11//}, pages = {722 - 735}, abstract = {Designing user interfaces with consistent visual and textual properties is difficult. To demonstrate the harmful effects of inconsistency, we conducted an experiment with 60 subjects. Inconsistent interface terminology slowed user performance by 10 to 25 percent. Unfortunately, contemporary software tools provide only modest support for consistency control. Therefore, we developed SHERLOCK, a family of consistency analysis tools, which evaluates visual and textual properties of user interfaces. It provides graphical analysis tools such as a dialog box summary table that presents a compact overview of visual properties of all dialog boxes. SHERLOCK provides terminology analysis tools including an interface concordance, an interface spellchecker, and terminology baskets to check for inconsistent use of familiar groups of terms. Button analysis tools include a button concordance and a button layout table to detect variant capitalization, distinct typefaces, distinct colors, variant button sizes, and inconsistent button placements. We describe the design, software architecture, and the use of SHERLOCK. We tested SHERLOCK with four commercial prototypes. The outputs, analysis, and feedback from designers of the applications are presented}, keywords = {button analysis tools, Color, dialog box summary table, experiment, graphical analysis tools, Graphical user interfaces, human factors, inconsistent interface terminology, interface color, interface spell checker, Output feedback, Prototypes, SHERLOCK, Software architecture, Software design, software metrics, software prototyping, software tools, Terminology, terminology analysis tools, Testing, textual consistency checking tools, user interface management systems, User interfaces, user performance, visual consistency checking tools}, isbn = {0098-5589}, doi = {10.1109/32.637386}, author = {Mahajan,R. and Shneiderman, Ben} } @article {15580, title = {Accounting for boundary effects in nearest-neighbor searching}, journal = {Discrete \& Computational Geometry}, volume = {16}, year = {1996}, month = {1996///}, pages = {155 - 176}, abstract = {Given n data points ind-dimensional space, nearest-neighbor searching involves determining the nearest of these data points to a given query point. Most averagecase analyses of nearest-neighbor searching algorithms are made under the simplifying assumption thatd is fixed and thatn is so large relative tod thatboundary effects can be ignored. This means that for any query point the statistical distribution of the data points surrounding it is independent of the location of the query point. However, in many applications of nearest-neighbor searching (such as data compression by vector quantization) this assumption is not met, since the number of data pointsn grows roughly as 2 d .Largely for this reason, the actual performances of many nearest-neighbor algorithms tend to be much better than their theoretical analyses would suggest. We present evidence of why this is the case. We provide an accurate analysis of the number of cells visited in nearest-neighbor searching by the bucketing andk-d tree algorithms. We assumem dpoints uniformly distributed in dimensiond, wherem is a fixed integer >=2. Further, we assume that distances are measured in theL $\infty$ metric. Our analysis is tight in the limit asd approaches infinity. Empirical evidence is presented showing that the analysis applies even in low dimensions.}, doi = {10.1007/BF02716805}, author = {Arya,S. and Mount, Dave and Narayan,O.} } @conference {14797, title = {An adaptive cost system for parallel program instrumentation}, booktitle = {Euro-Par{\textquoteright}96 Parallel Processing}, year = {1996}, month = {1996///}, pages = {88 - 97}, author = {Hollingsworth, Jeffrey K and Miller, B.} } @article {18968, title = {AT-AC Introns{\textemdash}An ATtACk on Dogma}, journal = {ScienceScience}, volume = {271}, year = {1996}, month = {1996/03/22/}, pages = {1690 - 1692}, abstract = {Messenger RNAs are initially made as long precursor molecules from which final, transcribable mRNAs are assembled. A specialized organelle, the spliceosome, contains small RNAs with pairs of dinucleotides that can pick out complementary pairs of nucleotides at the ends of the introns that are to be spliced together. It has been assumed that these pairs were always GU-AG (or GT-AG in the DNA), but in findings described in this week{\textquoteright}s issue of Science (p. 1716) and the current issue of Cell (vol. 84, p. 801) a minor class of intron is shown to be flanked by AU-AC (or AT-AC in the DNA). In his Perspective, Mount explains how these maverick introns were discovered and why their existence is so surprising.}, isbn = {0036-8075, 1095-9203}, doi = {10.1126/science.271.5256.1690}, url = {http://www.sciencemag.org/content/271/5256/1690}, author = {Mount, Stephen M.} } @article {15938, title = {Automated inference in active logics}, journal = {JOURNAL OF APPLIED NONCLASSICAL LOGICS}, volume = {6}, year = {1996}, month = {1996///}, pages = {9 - 28}, author = {Miller,M. and Perlis, Don} } @book {15378, title = {Basic Electric Circuit Theory: A One-Semester Text}, year = {1996}, month = {1996///}, publisher = {Academic Press}, organization = {Academic Press}, abstract = {This is the only book on the market that has been conceived and deliberately written as a one-semester text on basic electric circuit theory. As such, this book employs a novel approach to the exposition of the material in which phasors and ac steady-state analysis are introduced at the beginning. This allows one to use phasors in the discussion of transients excited by ac sources, which makes the presentation of transients more comprehensive and meaningful. Furthermore, the machinery of phasors paves the road to the introduction of transfer functions, which are then used in the analysis of transients and the discussion of Bode plots and filters. Another salient feature of the text is the consolidation into one chapter of the material concerned with dependent sources and operational amplifiers. Dependent sources are introduced as linear models for transistors on the basis of small signal analysis. In the text, PSpice simulations are prominently featured to reinforce the basic material and understanding of circuit analysis.Key Features* Designed as a comprehensive one-semester text in basic circuit theory* Features early introduction of phasors and ac steady-state analysis* Covers the application of phasors and ac steady-state analysis* Consolidates the material on dependent sources and operational amplifiers* Places emphasis on connections between circuit theory and other areas in electrical engineering* Includes PSpice tutorials and examples* Introduces the design of active filters* Includes problems at the end of every chapter* Priced well below similar books designed for year-long courses}, keywords = {Electric circuits, Technology \& Engineering / Electrical}, isbn = {9780124808652}, author = {Mayergoyz, Issak D and Lawson,Wes} } @article {14105, title = {Differential expression of the expression site-associated gene I family in African trypanosomes}, journal = {Journal of Biological Chemistry}, volume = {271}, year = {1996}, month = {1996///}, pages = {9771 - 9771}, author = {Morgan,R. W and El-Sayed, Najib M. and Kepa,J. K and Pedram,M. and Donelson,J. E} } @conference {15533, title = {Disjunctive deductive databases: Semantics, updates and architecture}, booktitle = {Proceedings of the 4th Bar-Ilan Symposium on Foundations of AI}, year = {1996}, month = {1996///}, pages = {256 - 274}, abstract = {The basic assumption in relational and deductive databases is that there are no gaps in our knowledge. That is, the database cannot store data that contain null values or data that is indefinite. In practical situations knowledge is not precise, and there are gaps in our knowledge. These gaps may be due to null values in the data, may arise when we combine several databases that lead to inconsistent theories, or may occur because information is indefinite in nature, such as in military or medical applications. In this paper we describe semantics for disjunctive deductive databases that extend the work in deductive databases, solve the view update problem, and permit indefinite data to be represented efficiently. Hierarchic, stratified, and normal stable models of disjunctive databases are described. An architecture is proposed for a disjunctive deductive database system and a class of theories for which the architecture will be effective is discussed.}, author = {Fernandez,J. A. and Gryz,J. and Minker, Jack} } @article {12991, title = {DNA sequence variation in the ribosomal internal transcribed spacer region of freshwater {\i}t Cladophora species (Chlorophyta)}, journal = {J Phycol}, volume = {32}, year = {1996}, month = {1996/12//}, pages = {1035 - 1042}, abstract = {Freshwater species of Cladophora (Chlorophyta) are globally distributed and occupy an unusually wide range of ecological habitats. Delineating species is difficult because most easily observed morphological traits are highly variable and because sexual reproduction has not been clearly documented. Synthesizing ecological data on freshwater Cladophora species is problematic because it is unclear whether freshwater Cladophora species comprise many genetically distinct species or a few ecologically and morphologically variable and / or plastic species. We determined nucleotide sequences of the internal transcribed spacer (ITS) region of the nuclear ribosomal cistron of freshwater Cladophora species from a wide range of habitats and geographic locations. We compared these sequences to those derived from culture collections of C. fracta and C. glomerata, the two most commonly reported freshwater Cladophora species. Cladophora fracta and C. glomerata had very similar ITS sequences (95.3\%). All other sequences were identical to those from the C. fracta or C. glomerata culture collections with the exception of one California sample that was similar to both C. fracta (95.6\%) and C. glomerata (92.4\%). ITS genotypes did not correlate with morphology or geography. This analysis shows that common freshwater Cladophora species comprise very few (possibly one) ecologically and morphologically variable species.}, keywords = {algae;, Chlorophyta;, Cladophora;, diversity;, freshwater, genetic, internal, spacer, transcribed}, author = {Marks,J. C and Cummings, Michael P.} } @conference {15346, title = {Effect of Chemical Reactions on Decaying Isotropic Turbulence}, booktitle = {APS Meeting Abstracts}, volume = {1}, year = {1996}, month = {1996///}, author = {Martin, M.P and Candler,G. V} } @conference {15355, title = {Effect of chemical reactions on the decay of isotropic homogeneous turbulence}, booktitle = {AIAA Fluid Dynamics Conference}, volume = {96}, year = {1996}, month = {1996///}, pages = {131 - 131}, address = {New Orleans, LA}, abstract = {Direct numerical simulations, (DNS), are usedto simulate the decay of an isotopic, turbulent, chemically-reacting flow at high temperatures. The independent parameters that govern the physical pro- cess are introduced. The different effects from each of the parameters in the flow are explained by using the results from the DNS. It is found that there is a feedback mechanism between the chemical reactions and the turbulent motion. This feedback is positive for exothermic reactions and negative for endother- mic reactions. }, author = {Aguirre,M and Candler,G. V and Martin, M.P} } @inbook {14610, title = {Fast sorting by reversal}, booktitle = {Combinatorial Pattern MatchingCombinatorial Pattern Matching}, series = {Lecture Notes in Computer Science}, volume = {1075}, year = {1996}, month = {1996///}, pages = {168 - 185}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {Analysis of genomes evolving by inversions leads to a combinatorial problem of sorting by reversals studied in detail recently. Following a series of work recently, Hannenhalli and Pevzner developed the first polynomial algorithm for the problem of sorting signed permutations by reversals and proposed an O(n 4 ) implementation of the algorithm. In this paper we exploit a few combinatorial properties of the cycle graph of a permutation and propose an O(n 2 (n)) implementation of the algorithm where is the inverse Ackerman function. Besides making this algorithm practical, our technique improves implementations of the other rearrangement distance problems.}, isbn = {978-3-540-61258-2}, url = {http://dx.doi.org/10.1007/3-540-61258-0_14}, author = {Berman,Piotr and Hannenhalli, Sridhar}, editor = {Hirschberg,Dan and Myers,Gene} } @inbook {13005, title = {Inferring phylogenies from DNA sequence data: The effects of sampling}, booktitle = {New Uses for New PhylogeniesNew Uses for New Phylogenies}, year = {1996}, month = {1996///}, pages = {103 - 115}, publisher = {Oxford University Press}, organization = {Oxford University Press}, author = {Otto,S. P and Cummings, Michael P. and Wakeley,J.}, editor = {Harvey,PH and Leigh Brown,AJ and Maynard Smith,J and Nee,S} } @conference {16203, title = {LifeLines: visualizing personal histories}, booktitle = {Proceedings of the SIGCHI conference on Human factors in computing systems: common ground}, series = {CHI {\textquoteright}96}, year = {1996}, month = {1996///}, pages = {221 - 227}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, keywords = {History, justice, medical record, overview, personal record, screen design, screen management, timeline, Visualization}, isbn = {0-89791-777-4}, doi = {10.1145/238386.238493}, url = {http://doi.acm.org/10.1145/238386.238493}, author = {Plaisant, Catherine and Milash,Brett and Rose,Anne and Widoff,Seth and Shneiderman, Ben} } @article {15531, title = {Logic and databases: A 20 year retrospective}, journal = {Logic in Databases}, year = {1996}, month = {1996///}, pages = {1 - 57}, author = {Minker, Jack} } @conference {15530, title = {Mixing a default rule with stable negation}, booktitle = {Proceedings of the Fourth International Symposium on Artificial Intelligence and Mathematics}, year = {1996}, month = {1996///}, pages = {122 - 125}, abstract = {Logic programs containing only at most one form ofdefault negation have been studied in the literature. We describe a class of logic programs containing multi- ple forms of default negation. We de ne a meaning for these programs based on the well{founded semantics and the stable semantics. We investigate properties of the new combined semantics and calculate the com- putational complexity of determining the existence of models, and of skeptical and credulous reasoning. An e ective procedure to construct the collection of mod- els characterizing the semantics of a program is given. Applications to knowledge representation and knowl- edge base merging are presented. }, author = {Minker, Jack and Ruiz,C.} } @article {15534, title = {Model theoretic approach to view updates in deductive databases}, journal = {Journal of Automated Reasoning}, volume = {17}, year = {1996}, month = {1996///}, pages = {171 - 197}, abstract = {The view update problem for deductive databases has been defined as the problem of accomplishing the update of an intensional predicate by modifying appropriately the extensional database. A previous paper by Grant, Horty, Lobo, and Minker developed algorithms for the insertion and the deletion of an intensional predicate in certain important classes of stratified disjunctive deductive databases. This paper introduces a model theoretic approach which encompasses a wide class of Herbrand semantics, including the perfect model and stable model semantics, for disjunctive databases including negation. This generalizes the earlier results: now the intensional database may contain disjunctive and denial rules, and the database may be required to satisfy integrity constraints. As in the previous paper, the algorithms are proved to be correct and best according to the criterion of causing minimal change to the database, where the first priority is to minimize deletions.}, doi = {10.1007/BF00244495}, author = {Fernandez,J. A. and Grant,J. and Minker, Jack} } @conference {18306, title = {Recognition of head gestures using hidden markov models}, booktitle = {Pattern Recognition, 1996., Proceedings of the 13th International Conference on}, volume = {3}, year = {1996}, month = {1996///}, pages = {461 - 465}, author = {Morimoto,C. and Yacoob,Yaser and Davis, Larry S.} } @article {18990, title = {Ribosomal RNA: Small nucleolar RNAs make their mark}, journal = {Current Biology}, volume = {6}, year = {1996}, month = {1996/11//}, pages = {1413 - 1415}, abstract = {Small nucleolar RNAs direct the location of certain methylations in ribosomal RNA by direct base pairing; although evolutionarily conserved, the physiological significance of these modifications remains unclear.}, isbn = {0960-9822}, doi = {10.1016/S0960-9822(96)00745-2}, url = {http://www.sciencedirect.com/science/article/pii/S0960982296007452}, author = {Peculis,Brenda A. and Mount, Stephen M.} } @article {15532, title = {Semantic query optimization for bottom-up evaluation}, journal = {Foundations of Intelligent Systems}, year = {1996}, month = {1996///}, pages = {561 - 571}, abstract = {Semantic query optimization uses semantic knowledge in databases (represented in the form of integrity constraints) to rewrite queries and logic programs to achieve efficient query evaluation. Much work has been done to develop various techniques for optimization. Most of it, however, is applicable to top-down query evaluation strategies. Moreover, little attention has been paid to the cost of the optimization. We address the issue of semantic query optimization for bottom-up query evaluation strategies with an emphasis on overall efficiency. We focus on a single optimization technique, join elimination. We discuss factors that influence the cost of semantic optimization, and present two different abstract algorithms for optimization. The first pre-processes a query statically before it is evaluated; the second combines query evaluation with semantic optimization using heuristics to achieve the largest possible savings.}, doi = {10.1007/3-540-61286-6_180}, author = {Godfrey,P. and Gryz,J. and Minker, Jack} } @mastersthesis {15528, title = {Semantics of knowledge-based systems with multiple forms of negation}, year = {1996}, month = {1996///}, school = {University of Maryland at College Park}, author = {Ruiz,C. and Minker, Jack} } @article {15443, title = {SEROS {\textendash} A SELF-ROUTING OPTICAL ATM SWITCH}, journal = {International Journal of Communication Systems}, volume = {9}, year = {1996}, month = {1996///}, pages = {115 - 125}, abstract = {A fault-tolerant high-performance SElf-Routing 2 {\texttimes} 2 Optical ATM Switch (SEROS) is proposed. The switch is designed using all-optical components which allows the exploitation of spatial parallelism. SEROS can be used with any multistage interconnection network such as Omega, Banyan, Shuffle or Benes. For the purpose of this study, SEROS has been incorporated into a generic self-routing multistage interconnection network that uses 2 {\texttimes} 2 switches and is not fault tolerant. Reliability analysis is carried out and the results are compared with two major fault-tolerant networks. They show that without redundant switches, better network survivability is achieved. All the switches in the network are 2 {\texttimes} 2, making it easier to mass produce.}, keywords = {2 {\texttimes} 2 ATM switch, fault-tolerant, MINs, photonic switching network, reliability, self-routing}, isbn = {1099-1131}, doi = {10.1002/(SICI)1099-1131(199603)9:2<115::AID-DAC301>3.0.CO;2-B}, url = {http://onlinelibrary.wiley.com/doi/10.1002/(SICI)1099-1131(199603)9:2<115::AID-DAC301>3.0.CO;2-B/abstract}, author = {Guizani,Mohsen and Memon, Atif M.} } @conference {17940, title = {Simplification envelopes}, booktitle = {Proceedings of the 23rd annual conference on Computer graphics and interactive techniques}, series = {SIGGRAPH {\textquoteright}96}, year = {1996}, month = {1996///}, pages = {119 - 128}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, keywords = {geometric modeling, hierarchical approximation, levels-of-detail generation, model simplification, offsets, shape approximation}, isbn = {0-89791-746-4}, doi = {10.1145/237170.237220}, url = {http://doi.acm.org/10.1145/237170.237220}, author = {Cohen,Jonathan and Varshney, Amitabh and Manocha,Dinesh and Turk,Greg and Weber,Hans and Agarwal,Pankaj and Brooks,Frederick and Wright,William} } @article {15404, title = {Simulation of the logic switching characteristics of hot-carrier-degraded ultra-thin SOI CMOS inverters}, journal = {Solid-State Electronics}, volume = {39}, year = {1996}, month = {1996/11//}, pages = {1669 - 1674}, abstract = {The switching characteristics of ultra-thin SOI CMOS inverters with hot-carrier-induced degradations are examined by using device simulations. The simulator employs a robust fixed-point iteration method to avoid conventional matrix solutions. Potential-dependent interface traps and oxide trapped charges are used to model the degradations. The effects of front and back channel degradations in an nMOS device of a CMOS inverter are investigated in steady-state and transient regimes. The nonlinear variation of interface charges cannot be simulated by using a single nMOS device alone since the transition of the inverter is also determined by the pMOS transistor. It is found that the stagnant holes generated by impact ionization have a much greater effect on the rate of the pull-down transient than that of interface charges.}, isbn = {0038-1101}, doi = {10.1016/0038-1101(96)00073-1}, url = {http://www.sciencedirect.com/science/article/pii/0038110196000731}, author = {Tai,Gwo-Chung and Korman,Can E. and Mayergoyz, Issak D} } @book {12332, title = {Software synthesis from dataflow graphs}, year = {1996}, month = {1996///}, publisher = {Springer}, organization = {Springer}, author = {Bhattacharyya, Shuvra S. and Murthy,P. K and Lee,E. A} } @article {15375, title = {A three-dimensional MOSFET solver implementing the fixed point iteration technique}, journal = {Solid-State Electronics}, volume = {39}, year = {1996}, month = {1996/01//}, pages = {147 - 157}, abstract = {Our implementation of a fixed-point iteration technique for the three-dimensional (3D) steady-state simulation of MOSFET devices is presented. The simulation program is employed to investigate narrow channel effects on the device current-voltage characteristics. Particularly, the effects of impact ionization and the effects of variations in channel width and the field oxide bird{\textquoteright}s beak angle are evaluated. The degree to which various field oxide configurations isolate the device from the gate contact over the oxide transition region is determined by comparing the current-voltage characteristics with those of an idealized device with perfect isolation. Perfect isolation is simulated by setting the normal component of the electric field to zero at the semiconductor-field oxide interface. Simulation results show that the 3D computations are essential to account for rapidly varying charge densities and generation rates near the channel edge. Moreover, it is observed that the isolation effects of field oxides increase for larger bird{\textquoteright}s beak angles.}, isbn = {0038-1101}, doi = {10.1016/0038-1101(95)00103-Z}, url = {http://www.sciencedirect.com/science/article/pii/003811019500103Z}, author = {Madabhushi,Rajiv and Korman,Can E. and Mayergoyz, Issak D} } @conference {14796, title = {Tuning the performance of I/O-intensive parallel applications}, booktitle = {Proceedings of the fourth workshop on I/O in parallel and distributed systems: part of the federated computing research conference}, year = {1996}, month = {1996///}, pages = {15 - 27}, author = {Acharya, A. and Uysal, M. and Bennett, R. and Mendelson, A. and Beynon, M. and Hollingsworth, Jeffrey K and Saltz, J. and Sussman, Alan} } @article {15529, title = {Using priorities to combine knowledge bases}, journal = {International Journal of Cooperative Information Systems}, volume = {5}, year = {1996}, month = {1996///}, pages = {333 - 333}, abstract = {Two or more companies, each with its own knowledge base, may merge. In that case one option is to merge the knowledge bases into one knowledge base. It can happen that some of the information contained in one or more knowledge bases may be in conflict with information in the other knowledge bases. There may be several such points of conflict and any information may be involved in several different such points of conflict. In that case, the integrator of the knowledge bases may prefer a certain claim to another in one conflict-point without necessarily preferring that claim in another conflict-point.Our work constructs a framework within which the consequences of a set of such preferences (expressed as priorities among sets of statements) can be computed. We give three types of semantics for priorities, two of which are shown to be equivalent to one another. The third type of semantics for priorities is shown to be more cautious than the other two. In terms of these semantics for priorities, we give a function for combining knowledge from different sources such that the combined knowledge is conflict-free and satisfies all the priorities. }, doi = {10.1142/S0218843096000130}, author = {Pradhan,S. and Minker, Jack} } @inbook {14272, title = {Video representations}, booktitle = {Recent Developments in Computer Vision}, series = {Lecture Notes in Computer Science}, volume = {1035}, year = {1996}, month = {1996///}, pages = {33 - 41}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, isbn = {978-3-540-60793-9}, url = {http://dx.doi.org/10.1007/3-540-60793-5_60}, author = {Bolle,Ruud and Aloimonos, J. and Ferm{\"u}ller, Cornelia}, editor = {Li,Stan and Mital,Dinesh and Teoh,Eam and Wang,Han} } @conference {17490, title = {Visual metaphor and the problem of complexity in the design of Web sites: techniques for generating, recognizing and visualizing structure}, booktitle = {Proceedings of the the seventh ACM conference on Hypertext}, series = {HYPERTEXT {\textquoteright}96}, year = {1996}, month = {1996///}, pages = {257{\textendash} - 257{\textendash}}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, isbn = {0-89791-778-2}, doi = {10.1145/234828.234854}, url = {http://doi.acm.org/10.1145/234828.234854}, author = {Joyce,Michael and Kolker,Robert and Moulthrop,Stuart and Shneiderman, Ben and Unsworth,John Merritt} } @conference {15629, title = {Approximate range searching}, booktitle = {Proceedings of the eleventh annual symposium on Computational geometry}, series = {SCG {\textquoteright}95}, year = {1995}, month = {1995///}, pages = {172 - 181}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, isbn = {0-89791-724-3}, doi = {10.1145/220279.220298}, url = {http://doi.acm.org/10.1145/220279.220298}, author = {Arya,Sunil and Mount, Dave} } @article {15539, title = {Bottom-up computation of perfect models for disjunctive theories}, journal = {The Journal of logic programming}, volume = {25}, year = {1995}, month = {1995///}, pages = {33 - 51}, author = {Fern{\'a}ndez,J. A. and Minker, Jack} } @article {15538, title = {Combining databases with prioritized information}, journal = {Journal of Intelligent Information Systems}, volume = {4}, year = {1995}, month = {1995///}, pages = {231 - 260}, abstract = {To solve a problem one may need to combine the knowledge of several different experts. It can happen that some of the claims of one or more experts may be in conflict with the claims of other experts. There may be several such points of conflict and any claim may be involved in several different such points of conflict. In that case, the user of the knowledge of experts may prefer a certain claim to another in one conflict-point without necessarily preferring that statement in another conflict-point.Our work constructs a framework within which the consequences of a set of such preferences (expressed as priorities among sets of statements) can be computed. We give four types of semantics for priorities, three of which are shown to be equivalent to one another. The fourth type of semantics for priorities is shown to be more cautious than the other three. In terms of these semantics for priorities, we give a function for combining knowledge from different sources such that the combined knowledge is conflict-free and satisfies all the priorities. }, doi = {10.1007/BF00961654}, author = {Pradhan,S. and Minker, Jack and V.S. Subrahmanian} } @article {15537, title = {Combining Datalog databases using priorities}, year = {1995}, month = {1995///}, institution = {University of Maryland at College Park}, address = {College Park, MD, USA}, author = {Pradhan,Shekhar and Minker, Jack} } @article {15536, title = {Computing stable and partial stable models of extended disjunctive logic programs}, journal = {Non-Monotonic Extensions of Logic Programming}, year = {1995}, month = {1995///}, pages = {205 - 229}, abstract = {n [Prz91], Przymusinski introduced the partial (or 3-valued) stable model semantics which extends the (2-valued) stable model semantics defined originally by Gelfond and Lifschitz [GL88]. In this paper we describe a procedure to compute the collection of all partial stable models of an extended disjunctive logic program. This procedure consists in transforming an extended disjunctive logic program into a constrained disjunctive program free of negation-by-default whose set of 2-valued minimal models corresponds to the set of partial stable models of the original program.}, doi = {10.1007/BFb0030666}, author = {Ruiz,C. and Minker, Jack} } @conference {17052, title = {Dealing with complexity: uniting agents and direct manipulation (panel session)}, booktitle = {Conference companion on Human factors in computing systems}, series = {CHI {\textquoteright}95}, year = {1995}, month = {1995///}, pages = {191 - 192}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, isbn = {0-89791-755-3}, doi = {10.1145/223355.223504}, url = {http://doi.acm.org/10.1145/223355.223504}, author = {Riecken,Doug and Maes,Pattie and Shneiderman, Ben and Smith,David Canfield} } @article {15535, title = {Deductive Databases and Knowledge Base Systems.}, year = {1995}, month = {1995/03/31/}, institution = {Department of Computer Science, University of Maryland, College Park}, abstract = {The following sections describe the research that has been accomplished during the entire grant period form September 1, 1991 to March 31, 1995, with partial support from the Air Force Office of Scientific Research and summarizes the papers, prototype systems and theses produced on the grant. Several major areas will be discussed. These are Cooperative Databases Systems, Combining Knowledge Base Systems, Disjunctive Deduction Databases, Extensions to the Semantics of Logic Programming and Parallel Logic Programming. During the first year of the grant we emphasized theoretical aspects of work in deductive databases and knowledge base systems. During the second year we stressed the development of tools and techniques to transfer the theory into practical systems. During the third year we developed prototype systems and experiments with them. Technological developments were made in Cooperative Database Systems and Disjunctive Deductive Databases. New theoretical developments were achieved in the Semantics of Logic Programming and in Combining Databases.}, keywords = {*DATA BASES, *KNOWLEDGE BASED SYSTEMS, *RESEARCH MANAGEMENT, *SYSTEMS ENGINEERING, AIR FORCE RESEARCH, COMPUTER LOGIC, COMPUTER PROGRAMMING, COMPUTER PROGRAMMING AND SOFTWARE, COMPUTER SYSTEMS, logic programming, PARALLEL LOGIC PROGRAMMING, PARALLEL PROCESSING, Prototypes, semantics, THESES, TRANSFER., WUAFOSR2304GS}, url = {http://stinet.dtic.mil/oai/oai?\&verb=getRecord\&metadataPrefix=html\&identifier=ADA295498}, author = {Minker, Jack} } @conference {17944, title = {Defining, Computing, and Visualizing Molecular Interfaces}, booktitle = {Proceedings of the 6th conference on Visualization {\textquoteright}95}, series = {VIS {\textquoteright}95}, year = {1995}, month = {1995///}, pages = {36{\textendash} - 36{\textendash}}, publisher = {IEEE Computer Society}, organization = {IEEE Computer Society}, address = {Washington, DC, USA}, abstract = {A parallel, analytic approach for defining and computing the inter- and intra-molecular interfaces in three dimensions is described. The "molecular interface surfaces" are derived from approximations to the power-diagrams over the participating molecular units. For a given molecular interface our approach can generate a family of interface surfaces parametrized by alpha and beta, where alpha is the radius of the solvent molecule (also known as the probe-radius) and beta is the interface radius that defines the size of the molecular interface. Molecular interface surfaces provide biochemists with a powerful tool to study surface complementarity and to efficiently characterize the interactions during a protein-substrate docking. The complexity of our algorithm for molecular environments is O(n k \log^2{k}), where n is the number of atoms in the participating molecular units and k is the average number of neighboring atoms -- a constant, given alpha and beta.}, keywords = {Computational Biochemistry Algorithms Molecular Graphics, Connolly Surfaces, Molecular Interfaces, Molecular Surfaces, Protein-Protein Recognition}, isbn = {0-8186-7187-4}, url = {http://dl.acm.org/citation.cfm?id=832271.833834}, author = {Varshney, Amitabh and Brooks Jr,Frederick P. and Manocha,Dinesh and Wright,William V. and Richardson,David C.} } @conference {15649, title = {Euclidean spanners: short, thin, and lanky}, booktitle = {Proceedings of the twenty-seventh annual ACM symposium on Theory of computing}, series = {STOC {\textquoteright}95}, year = {1995}, month = {1995///}, pages = {489 - 498}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, isbn = {0-89791-718-9}, doi = {10.1145/225058.225191}, url = {http://doi.acm.org/10.1145/225058.225191}, author = {Arya,Sunil and Das,Gautam and Mount, Dave and Salowe,Jeffrey S. and Smid,Michiel} } @conference {13769, title = {Experimental investigation of high performance cognitive and interactive text filtering}, booktitle = {, IEEE International Conference on Systems, Man and Cybernetics, 1995. Intelligent Systems for the 21st Century}, volume = {5}, year = {1995}, month = {1995/10/22/25}, pages = {4398-4403 vol.5 - 4398-4403 vol.5}, publisher = {IEEE}, organization = {IEEE}, abstract = {Text filtering has become increasingly important as the volume of networked information has exploded in recent years. This paper reviews recent progress in that field and reports on the development of a testbed for experimental investigation of cognitive and interactive text selection based on a history of user evaluations. An interactive filtering system model is presented and a new cognitive filtering technique which the authors call the Gaussian User Model is described. Because development of analytic measures of text selection effectiveness has proven intractable, the authors have modified the Cornell SMART text retrieval system to create a flexible text filtering testbed for experimental determination of filtering effectiveness. The paper concludes with a description of the design of this testbed system}, keywords = {Cause effect analysis, Computer science, Contracts, Cornell SMART text retrieval system, Educational institutions, Gaussian User Model, high performance cognitive interactive text filtering, History, Information filtering, Information filters, Information retrieval, information retrieval system evaluation, Libraries, Matched filters, online front-ends, Query processing, System testing, text selection effectiveness, user evaluations, User interfaces, user modelling}, isbn = {0-7803-2559-1}, doi = {10.1109/ICSMC.1995.538486}, author = {Oard, Douglas and DeClaris,N. and Dorr, Bonnie J and Faloutsos,C. and Marchionini,G.} } @article {16922, title = {A Family of User Interface Consistency Checking Tools}, journal = {Institute for Systems Research Technical Reports}, year = {1995}, month = {1995///}, abstract = {Incorporating evaluation metrics with GUI development tools will help designers create consistent interfaces in the future. Complexity in design of interfaces makes efficient evaluation impossible by a single consistency checking evaluation tool. Our focus is on developing a family of evaluation tools in order to make the evaluation process less cumbersome. We have developed a dialog box typeface and color table to facilitate detection of anomalies in color, font, font size, and font style. Concordance tools have been developed to spot variant capitalization and abbreviations globally in the interface and specifically in the button widgets. As buttons are frequently used widgets, a button layout table has been created to spot any inconsistencies in height, width and relative position between a given group of buttons if present. Finally, a terminology basket tool has been created to identify unwanted synonyms of computer related terms used in the interface which may be misleading to the end user.}, keywords = {automated metrics, concordance tools, consistency checking tools, Human-computer interaction, spatial, Systems Integration Methodology, textual evaluation tools, user interface}, url = {http://drum.lib.umd.edu/handle/1903/5640}, author = {Mahajan,Rohit and Shneiderman, Ben} } @article {16923, title = {A Family of User Interface Consistency Checking Tools: Design and Development of SHERLOCK}, journal = {Proceedings of the Twentieth Annual Software Engineering Workshop}, year = {1995}, month = {1995///}, abstract = {Incorporating evaluation metrics with GUI development tools will help designers create consistent interfaces in the future. Complexity in design of interfaces makes efficient evaluation infeasible by a single consistency checking evaluation tool. Our focus is on developing a family of consistency checking tools to evaluate spatial layout and terminology in user interfaces and make the evaluation process less cumbersome. We have Created a dialog box summary table to provide a compact overview of spatial and visual properties of dozens or hundreds of dialog boxes of the interface. Interface concordance tool has been developed to spot variant capitalization and abbreviations in interface terminology. As buttons are most frequent used widgets, a button concordance tool and a button layout table has been constructed. Button concordance identifies variant capitalization, distinct typefaces, distinct background colors and variant sizes in buttons. Button layout table spots any inconsistencies in height, width and relative position between a given group of buttons. A spell checking tools which detects spelling errors in interface terms has also been included in the tool set. Finally, a terminology basket tool has been created to identify unwanted synonyms of computer related terms used in the interface. These tools are integrated together as SHERLOCK, a family of six consistency checking tools to expedite the evaluation process and provide feedback to the designers plus aid Usability Testing.}, author = {Mahajan,R. and Shneiderman, Ben} } @article {12825, title = {A front-end generator for verification tools}, journal = {Tools and Algorithms for the Construction and Analysis of Systems}, year = {1995}, month = {1995///}, pages = {153 - 173}, author = {Cleaveland, Rance and Madelaine,E. and Sims,S.} } @article {18978, title = {Genetic enhancement of RNA-processing defects by a dominant mutation in B52, the Drosophila gene for an SR protein splicing factor.}, journal = {Molecular and Cellular BiologyMol. Cell. Biol.}, volume = {15}, year = {1995}, month = {1995/11/01/}, pages = {6273 - 6282}, abstract = {SR proteins are essential for pre-mRNA splicing in vitro, act early in the splicing pathway, and can influence alternative splice site choice. Here we describe the isolation of both dominant and loss-of-function alleles of B52, the gene for a Drosophila SR protein. The allele B52ED was identified as a dominant second-site enhancer of white-apricot (wa), a retrotransposon insertion in the second intron of the eye pigmentation gene white with a complex RNA-processing defect. B52ED also exaggerates the mutant phenotype of a distinct white allele carrying a 5{\textquoteright} splice site mutation (wDR18), and alters the pattern of sex-specific splicing at doublesex under sensitized conditions, so that the male-specific splice is favored. In addition to being a dominant enhancer of these RNA-processing defects, B52ED is a recessive lethal allele that fails to complement other lethal alleles of B52. Comparison of B52ED with the B52+ allele from which it was derived revealed a single change in a conserved amino acid in the beta 4 strand of the first RNA-binding domain of B52, which suggests that altered RNA binding is responsible for the dominant phenotype. Reversion of the B52ED dominant allele with X rays led to the isolation of a B52 null allele. Together, these results indicate a critical role for the SR protein B52 in pre-mRNA splicing in vivo.}, isbn = {0270-7306, 1098-5549}, url = {http://mcb.asm.org/content/15/11/6273}, author = {Peng,X. and Mount, Stephen M.} } @book {17211, title = {Human-Computer Interaction Laboratory 1995 Video Reports}, year = {1995}, month = {1995///}, publisher = {University of Maryland at College Park, Human/Computer Interaction Laboratory}, organization = {University of Maryland at College Park, Human/Computer Interaction Laboratory}, author = {Plaisant, Catherine and Morrison,S. and Skokowski,C. and Reesch,J. and Shneiderman, Ben and Laboratory,University of Maryland at College Park. Human/Computer Interaction and Channel,F.} } @article {18982, title = {Localization of Sequences Required for Size-specific Splicing of a SmallDrosophilaIntronin Vitro}, journal = {Journal of Molecular Biology}, volume = {253}, year = {1995}, month = {1995/10/27/}, pages = {426 - 437}, abstract = {Many introns inDrosophilaand other invertebrates are less than 80 nucleotides in length, too small to be recognized by the vertebrate splicing machinery. Comparison of nuclear splicing extracts from human HeLa andDrosophilaKc cells has revealed species-specificity, consistent with the observed size differences. Here we present additional results with the 68 nucleotide fifth intron of theDrosophilamyosin heavy chain gene. As observed with the 74 nucleotide second intron of theDrosophilawhite gene, the wild-type myosin intron is accurately spliced in a homologous extract, and increasing the size by 16 nucleotides both eliminates splicing in theDrosophilaextract and allows accurate splicing in the human extract. In contrast to previous results, however, an upstream cryptic 5' splice site is activated when the wild-type myosin intron is tested in a human HeLa cell nuclear extract, resulting in the removal of 98 nucleotide intron.The size dependence of splicing inDrosophilaextracts is also intron-specific; we noted that a naturally larger (150 nucleotide) intron from theftzgene is efficiently spliced in Kc cell extracts that do not splice enlarged introns (of 84, 90, 150 or 350 nucleotides) derived from the 74 nucleotidewhiteintron. Here, we have exploited that observation, using a series of hybrid introns to show that a region of 46 nucleotides at the 3' end of thewhiteintron is sufficient to confer the species-specific size effect. At least two sequence elements within this region, yet distinct from previously described branchpoint and pyrimidine tract signals, are required for efficient splicing of small splicing of small hybrid intronsin vitro. }, keywords = {Drosophila; pre-mRNA splicing; intron size; species specificity; in vitrosplicing}, isbn = {0022-2836}, doi = {10.1006/jmbi.1995.0564}, url = {http://www.sciencedirect.com/science/article/pii/S0022283685705645}, author = {Guo,Ming and Mount, Stephen M.} } @conference {15599, title = {M.H.M: Euclidean spanners: short, thin, and lanky}, booktitle = {In: 27th ACM Symposium on Theory of Computing}, year = {1995}, month = {1995///}, pages = {489 - 498}, publisher = {ACM press}, organization = {ACM press}, abstract = {Euclidean spanners are important data structures in geometric algorithm design, because they provide a means of approximating the complete Euclidean graph with only O(n) edges, so that the shortest path length between each pair of points is not more than a constant factor longer than the Euclidean distance between the points. In many applications of spanners, it is important that the spanner possess a number of additional properties: low tot al edge weight, bounded degree, and low diameter. Existing research on spanners has considered one property or the other. We show that it is possible to build spanners in optimal O (n log n) time and O(n) space that achieve optimal or near optimal tradeoffs between all combinations of these *Max-Planck-Institut fiir Informatik, D-66123 Saarbrucken,}, author = {Arya,Sunil and Dast,Gautam and Mount, Dave and Salowe,Jeffrey S. and Smid,Michiel} } @conference {18047, title = {A note on reducing parallel model simulations to integer sorting}, booktitle = {Parallel Processing Symposium, 1995. Proceedings., 9th International}, year = {1995}, month = {1995///}, pages = {208 - 212}, author = {Matias,E. and Vishkin, Uzi} } @article {14816, title = {The Paradyn parallel performance measurement tool}, journal = {Computer}, volume = {28}, year = {1995}, month = {1995/11//}, pages = {37 - 46}, abstract = {Paradyn is a tool for measuring the performance of large-scale parallel programs. Our goal in designing a new performance tool was to provide detailed, flexible performance information without incurring the space (and time) overhead typically associated with trace-based tools. Paradyn achieves this goal by dynamically instrumenting the application and automatically controlling this instrumentation in search of performance problems. Dynamic instrumentation lets us defer insertion until the moment it is needed (and remove it when it is no longer needed); Paradyn{\textquoteright}s Performance Consultant decides when and where to insert instrumentation}, keywords = {Aerodynamics, Automatic control, automatic instrumentation control, Debugging, dynamic instrumentation, flexible performance information, high level languages, insertion, Instruments, large-scale parallel program, Large-scale systems, measurement, Paradyn parallel performance measurement tool, Parallel machines, parallel programming, Performance Consultant, Programming profession, scalability, software performance evaluation, software tools}, isbn = {0018-9162}, doi = {10.1109/2.471178}, author = {Miller, B. P and Callaghan, M. D and Cargille, J. M and Hollingsworth, Jeffrey K and Irvin, R. B and Karavanic, K. L and Kunchithapadam, K. and Newhall, T.} } @article {18426, title = {SEL{\textquoteright}s software process improvement program}, journal = {Software, IEEE}, volume = {12}, year = {1995}, month = {1995/11//}, pages = {83 - 87}, abstract = {We select candidates for process change on the basis of quantified Software Engineering Laboratory (SEL) experiences and clearly defined goals for the software. After we select the changes, we provide training and formulate experiment plans. We then apply the new process to one or more production projects and take detailed measurements. We assess process success by comparing these measures with the continually evolving baseline. Based upon the results of the analysis, we adopt, discard, or revise the process}, keywords = {baseline;detailed, engineering, engineering;, evolving, improvement, Laboratory;continually, measurements;experiment, plans;production, process, program;software, projects;training;software, SEL, software}, isbn = {0740-7459}, doi = {10.1109/52.469763}, author = {Basili, Victor R. and Zelkowitz, Marvin V and McGarry,F. and Page,J. and Waligora,S. and Pajerski,R.} } @article {15215, title = {A simple randomized sieve algorithm for the closest-pair problem}, journal = {Information and Computation}, volume = {118}, year = {1995}, month = {1995///}, pages = {34 - 37}, abstract = {We present a linear time randomized sieve algorithm for the closest-pair problem. Thealgorithm as well as its analysis are simple. The algorithm is extended to obtain a randomized linear time approximation algorithm for the closest bichromatic pair problem. }, author = {Khuller, Samir and Matias,Y.} } @inbook {15821, title = {The SVD in Image Restoration}, booktitle = {SVD and Signal Processing III: Algorithms, Architectures, and ApplicationsSVD and Signal Processing III: Algorithms, Architectures, and Applications}, year = {1995}, month = {1995///}, pages = {315 - 322}, publisher = {Elsevier}, organization = {Elsevier}, address = {New York}, author = {O{\textquoteright}Leary, Dianne P.}, editor = {Moonen,Marc and DeMoor,Bart} } @article {15406, title = {Switching as an exit problem}, journal = {Magnetics, IEEE Transactions on}, volume = {31}, year = {1995}, month = {1995/11//}, pages = {3545 - 3547}, abstract = {Previously, it has been shown that Preisach type models driven by stochastic inputs can be employed to model aftereffect. In this model, the machinery of the ldquo;exit problem rdquo; is instrumental in computing the time evolutions of the expected value and the distributions of switching times. Here, for the first time, we present numerical simulation results of the aforementioned viscosity models and demonstrate that these models can be employed to compute switching times and time evolutions of the expected value of magnetization}, keywords = {aftereffect;magnetic, aftereffect;stochastic, analysis;, distribution;viscosity, force;fluctuations;magnetic, hysteresis;magnetic, inputs;switching, models;coercive, models;exit, Preisach, problem;expected, switching;numerical, times, type, value;magnetization;model}, isbn = {0018-9464}, doi = {10.1109/20.489564}, author = {Korman,C.E. and Mayergoyz, Issak D} } @article {14786, title = {Techniques for performance measurement of parallel programs}, journal = {Parallel computers: theory and practice}, year = {1995}, month = {1995///}, pages = {225 - 240}, author = {Hollingsworth, Jeffrey K and Lumpp, J. E and Miller, B. P} } @article {17483, title = {Vision, Graphic Design, and Visual Display}, journal = {Readings in human-computer interaction: toward the year 2000}, year = {1995}, month = {1995///}, pages = {411 - 411}, author = {Marcus,A. and Murch,G.M. and Baecker,R. and Small,I. and Mander,R. and Ahlberg,C. and Shneiderman, Ben} } @article {18964, title = {An Atlas of Drosophila Genes: Sequences and Molecular Features}, journal = {Journal of Heredity}, volume = {85}, year = {1994}, month = {1994///}, pages = {495 - 496}, author = {Maroni,G. and Mount, Stephen M. and Cavener,DR and Cavener,BA and Sharp,PM and Lloyd,AT and Schaeffer,SW} } @article {15379, title = {Calculation of head sensitivity function from 3-D magnetic fields}, journal = {Magnetics, IEEE Transactions on}, volume = {30}, year = {1994}, month = {1994/11//}, pages = {4278 - 4280}, abstract = {A head sensitivity function is calculated using 3-D magnetic fields. The 3-D magnetic fields are calculated for recorded tracks with finite widths. The magnetization in the medium is expressed in 2-D Fourier series in the plane of the film and is assumed uniform through the thickness of the film. The reproduce head is idealized. These techniques are applied to data found in the literature for very narrow tracks ( 0.5 mu;m). A surprising amount of the experimental data can be explained by the finite width of the tracks. The fine structure of the measurements can then be isolated and attributed to the particular features of the individual heads}, keywords = {3-D, fields;finite, fields;magnetic, function;magnetization;recorded, head;very, heads;magnetisation;sensitivity;, magnetic, narrow, Sensitivity, series;magnetic, tracks;Fourier, tracks;reproduce, widths;head}, isbn = {0018-9464}, doi = {10.1109/20.334060}, author = {Burke,E.R. and Gomez,R.D. and Madabhushi,R. and Mayergoyz, Issak D} } @article {15992, title = {Calibrating, Counting, Grounding, Grouping}, volume = {FS-94-03}, year = {1994}, month = {1994///}, institution = {Association for the Advancement of Artificial Intelligence}, author = {Elgot-drapkin,J. and Gordon,D. and Kraus,S. and Miller,M. and Nirkhe,M. and Perlis, Don} } @article {15576, title = {Computationally Efficient Algorithms for High-Dimensional Robust Estimators}, journal = {CVGIP: Graphical Models and Image Processing}, volume = {56}, year = {1994}, month = {1994/07//}, pages = {289 - 303}, abstract = {Given a set of n distinct points in d-dimensional space that are hypothesized to lie on a hyperplane, robust statistical estimators have been recently proposed for the parameters of the model that best fits these points. This paper presents efficient algorithms for computing median-based robust estimators (e.g., the Theil-Sen and repeated median (RM) estimators) in high-dimensional space. We briefly review basic computational geometry techniques that were used to achieve efficient algorithms in the 2-D case. Then generalization of these techniques to higher dimensions is introduced. Geometric observations are followed by a presentation of O(nd - 1 log n) expected time algorithms for the d-dimensional Theil-Sen and RM estimators. Both algorithms are space optimal; i.e., they require O(n) storage, for fixed d. Finally, an extension of the methodology to nonlinear domain(s) is demonstrated.}, isbn = {1049-9652}, doi = {10.1006/cgip.1994.1026}, url = {http://www.sciencedirect.com/science/article/pii/S1049965284710261}, author = {Mount, Dave and Netanyahu,N. S} } @conference {18746, title = {Design for manufacture in multi-enterprise partnerships: current status and future directions}, year = {1994}, month = {1994///}, pages = {117 - 125}, abstract = {To pursue market and technology opportunities effectively, US commercial and defense industries will be relying increasingly on multi-enterprise partnerships. Horizontal partnering combines the strengths of multiple firms in product design, manufacture, after sales support and customer service, in order to launch superior products in the global market. To support effective partnering, new approaches will be needed for integrating the activities of design, planning, and production. It is important to address both the fundamental modeling of design, process planning, and production planning in ways that account for the capabilities of potential manufacturing partners, and the development of optimization procedures to address the underlying decision problems. This paper elaborates on these issues and discusses approaches for addressing them.}, url = {http://www.csa.com/partners/viewrecord.php?requester=gs\&collection=TRD\&recid=0160471CI}, author = {Nau, Dana S. and Ball,M. O and Gupta,S.K. and Minis,I. E. and Zhang, G.} } @article {15569, title = {Dynamic algorithms for geometric spanners of small diameter: Randomized solutions}, journal = {Computational Geometry: Theory and Applications}, volume = {13}, year = {1994}, month = {1994///}, pages = {13 - 91}, abstract = {Let S be a set of n points in IR d and let t ? 1 be a real number. A t-spanner for S is a directed graph having the points of S as its vertices, such that for any pair p and q of points there is a path from p to q of length at most t times the Euclidean distance between p and q. Such a path is called a t-spanner path. The spanner diameter of such a spanner is defined as the smallest integer D such that for any pair p and q of points there is a t-spanner path from p to q containing at most D edges. A randomized algorithm is given for constructing a t-spanner that, with high probability, contains O(n) edges and has spanner diameter O(log n). A data structure of size O(n log d n) is given that maintains this t-spanner in O(log d n log log n) expected amortized time per insertion and deletion, in the model of random updates, as introduced by Mulmuley. Keywords: Computational geometry, proximity problems, skip lists, randomization, dynamic data structures. Preprint submitted to Els...}, author = {Arya,Sunil and Mount, Dave and Smid,Michiel} } @conference {14760, title = {Dynamic program instrumentation for scalable performance tools}, booktitle = {Scalable High-Performance Computing Conference, 1994., Proceedings of the}, year = {1994}, month = {1994/05//}, pages = {841 - 850}, publisher = {IEEE}, organization = {IEEE}, abstract = {Presents a new technique called {\textquoteleft}dynamic instrumentation{\textquoteright} that provides efficient, scalable, yet detailed data collection for large-scale parallel applications. Our approach is unique because it defers inserting any instrumentation until the application is in execution. We can insert or change instrumentation at any time during execution by modifying the application{\textquoteright}s binary image. Only the instrumentation required for the currently selected analysis or visualization is inserted. As a result, our technique collects several orders of magnitude less data than traditional data collection approaches. We have implemented a prototype of our dynamic instrumentation on the CM-5, and present results for several real applications. In addition, we include recommendations to operating system designers, compiler writers, and computer architects about the features necessary to permit efficient monitoring of large-scale parallel systems}, keywords = {Application software, binary image, compiler writing, Computer architecture, Computer displays, Computerized monitoring, Concurrent computing, data acquisition, data collection, data visualisation, Data visualization, dynamic program instrumentation, efficient monitoring, executing program, Instruments, large-scale parallel applications, Large-scale systems, operating system design, Operating systems, parallel programming, program analysis, program diagnostics, program visualization, Programming profession, Sampling methods, scalable performance tools, software tools}, isbn = {0-8186-5680-8}, doi = {10.1109/SHPCC.1994.296728}, author = {Hollingsworth, Jeffrey K and Miller, B. P and Cargille, J.} } @article {18319, title = {Human Emotion Recognition From Motion Using A Radial Basis Function Network Architecture}, journal = {University Of Maryland}, year = {1994}, month = {1994///}, author = {Mark,R. and Yaser,Y. and Larry,D.} } @article {15407, title = {The input dependent Preisach model with stochastic input as a model for aftereffect}, journal = {Magnetics, IEEE Transactions on}, volume = {30}, year = {1994}, month = {1994/11//}, pages = {4368 - 4370}, abstract = {In a previous work, it has been suggested to use the Preisach model driven by stochastic inputs as a model for aftereffect. Here, we further extend this approach by employing the more accurate nonlinear input dependent Preisach model. The time evolution of the expected value of the output (magnetization) is derived in terms of the stochastic description of the input. It is shown that the mathematical machinery of the ldquo;exit problem rdquo; is instrumental for calculations of time evolutions of the expected value of the output of the nonlinear input dependent Preisach model}, keywords = {aftereffect;input, aftereffect;magnetic, dependent, evolutions;magnetic, hysteresis;, input;time, model;stochastic, Preisach}, isbn = {0018-9464}, doi = {10.1109/20.334090}, author = {Korman,C.E. and Mayergoyz, Issak D} } @book {17244, title = {Interacting with virtual environments}, year = {1994}, month = {1994///}, publisher = {John Wiley \& Sons}, organization = {John Wiley \& Sons}, author = {MacDonald,L. and Vince,J. and Shneiderman, Ben} } @conference {18059, title = {Optimal parallel approximation for prefix sums and integer sorting}, booktitle = {Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms}, year = {1994}, month = {1994///}, pages = {241 - 250}, author = {Goodrich,M. T and Matias,Y. and Vishkin, Uzi} } @article {18984, title = {P element-mediated in vivo deletion analysis of white-apricot: deletions between direct repeats are strongly favored.}, journal = {GeneticsGenetics}, volume = {136}, year = {1994}, month = {1994/03/01/}, pages = {1001 - 1011}, abstract = {We have isolated and characterized deletions arising within a P transposon, P[hswa], in the presence of P transposase. P[hswa] carries white-apricot (wa) sequences, including a complete copia element, under the control of an hsp70 promoter, and resembles the original wa allele in eye color phenotype. In the presence of P transposase, P[hswa] shows a high overall rate (approximately 3\%) of germline mutations that result in increased eye pigmentation. Of 234 derivatives of P[hswa] with greatly increased eye pigmentation, at least 205 carried deletions within copia. Of these, 201 were precise deletions between the directly repeated 276-nucleotide copia long terminal repeats (LTRs), and four were unique deletions. High rates of transposase-induced precise deletion were observed within another P transposon carrying unrelated 599 nucleotide repeats (yeast 2 mu FLP; recombinase target sites) separated by 5.7 kb. Our observation that P element-mediated deletion formation occurs preferentially between direct repeats suggests general methods for controlling deletion formation.}, isbn = {0016-6731, 1943-2631}, url = {http://www.genetics.org/content/136/3/1001}, author = {Kurkulos,M. and Weinberg,J. M. and Roy,D. and Mount, Stephen M.} } @article {15374, title = {A parallel-in-time method for the transient simulation of SOI devices with drain current overshoots}, journal = {Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on}, volume = {13}, year = {1994}, month = {1994/08//}, pages = {1035 - 1044}, abstract = {This paper presents a new parallel-in-time algorithm for the two dimensional transient simulation of SOI devices. With this approach, simulation in both space and time domains is performed in parallel As a result, the CPU time is reduced significantly from the conventional serial-in-time method. This new approach fully exploits the inherent parallelism of the finite difference formulation of the basic semiconductor device equations and the massively parallel architecture of SIMD computers. The space domain computations are inherently parallel due to the nature of our technique of solving the finite-difference equations. Time domain parallelism is achieved by shifting the potentials from previous time points to subsequent points one-step forward along the time axis with each Gummel iteration. This algorithm employs a fixed-point iteration technique, therefore a direct solution of matrix equations is avoided. The algorithm is especially suitable for the transient simulation of SOI devices that exhibit transient drain current overshoot. Numerical experiments show that the new parallel-in-time method is up to eight times faster than the conventional serial-in-time method in SOI transient simulations. The program is coded in CM Fortran for the Connection Machine}, keywords = {2D, algorithms;semiconductor, analysis;transient, architecture;parallel-in-time, boundaries;silicon;time-domain, computations;time, computers;SOI, computing;finite, current, device, devices;drain, devices;parallel, difference, dimensional, domain, effect, engineering, equations;fixed-point, equations;space, field, Fortran;CPU, gate, iteration, iteration;SIMD, Machine;Gummel, method;semiconductor, methods;insulated, methods;metal-insulator-semiconductor, models;semiconductor-insulator, overshoots;finite-difference, Parallel, parallelism;transient, response;, simulation;CM, simulation;digital, simulation;electronic, simulation;two, technique;massively, time;Connection, transistors;iterative}, isbn = {0278-0070}, doi = {10.1109/43.298039}, author = {Tai,G.-C. and Korman,C.E. and Mayergoyz, Issak D} } @conference {15641, title = {Query-sensitive ray shooting}, booktitle = {Proceedings of the tenth annual symposium on Computational geometry}, series = {SCG {\textquoteright}94}, year = {1994}, month = {1994///}, pages = {359 - 368}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, isbn = {0-89791-648-4}, doi = {10.1145/177424.178094}, url = {http://doi.acm.org/10.1145/177424.178094}, author = {Mitchell,Joseph S.B. and Mount, Dave and Suri,Subhash} } @article {17337, title = {QUEST{\textemdash}Query Environment for Science Teaching}, journal = {Digital Libraries{\textquoteright} 94}, year = {1994}, month = {1994///}, abstract = {QUery Environment for Science Teaching (QUEST) is a proposed digital library implementation consisting of a set of research projects dealing with data capture and organization, content analysis, information seeking and visual interfaces.The QUEST team includes a large number of renown technical collaborators and prominent source collaborators, as well as a significant number of contributors in the University of Maryland, the central, co-ordinating agency.A large collection of multidisciplinary materials in visual and textual formats, made accessible to us by our source collaborators, will be organized to allow integrated access by users from the science education community, that is elementary school through college level teachers. QUEST will be structured so as to provide seamless access to widespread resources on disparate subjects. We intend to provide first-rate subject analysis and representation in order to provide ready access. QUEST will be accessible nationally by means of Mosaic. We propose to provide highly sophisticated querying, browsing and information investigation facilities which will handle integrated textual and visual materials without difficulty. They will be augmented by online reference and referral services, immediately accessible by the user. QUEST will provide a comprehensive information resource for science education accessible through a dynamic, visual user interface. }, author = {Shneiderman, Ben and Rosenfeld, A. and Marchioni,G. and Holliday,W. and Ricart, G. and Faloutsos,С. and Dick,J.} } @conference {15588, title = {Randomized and deterministic algorithms for geometric spanners of small diameter}, booktitle = {Foundations of Computer Science, 1994 Proceedings., 35th Annual Symposium on}, year = {1994}, month = {1994/11//}, pages = {703 - 712}, abstract = {Let S be a set of n points in IRd and let t gt;1 be a real number. A t-spanner for S is a directed graph having the points of S as its vertices, such that for any pair p and q of points there is a path from p to q of length at most t times the Euclidean distance between p and p. Such a path is called a t-spanner path. The spanner diameter of such a spanner is defined as the smallest integer D such that for any pair p and q of points there is a t-spanner path from p to q containing at most D edges. Randomized and deterministic algorithms are given for constructing t-spanners consisting of O(n) edges and having O(log n) diameter. Also, it is shown how to maintain the randomized t-spanner under random insertions and deletions. Previously, no results were known for spanners with low spanner diameter and for maintaining spanners under insertions and deletions}, keywords = {computational geometry, deletions, deterministic algorithms, directed graph, directed graphs, geometric spanners, insertions, randomised algorithms, randomized algorithms}, doi = {10.1109/SFCS.1994.365722}, author = {Arya,S. and Mount, Dave and Smid,M.} } @article {16365, title = {Simplifying polynomial constraints over integers to make dependence analysis more precise}, journal = {Parallel Processing: CONPAR 94{\textemdash}VAPP VI}, year = {1994}, month = {1994///}, pages = {737 - 748}, author = {Maslov,V. and Pugh, William} } @article {15405, title = {Simulation of the transient characteristics of partially- and fully-depleted SOI MOSFETs}, journal = {Solid-State Electronics}, volume = {37}, year = {1994}, month = {1994/07//}, pages = {1387 - 1394}, abstract = {We present a numerical technique which employs a local-in-time initial guess for the transient simulation of SOI MOSFETs. Specifically, the goal of this work is to compute the transient drain current which exhibits overshoot. A critical factor in such computations is the choice of the initial guess at each time point after the gate ramp. Our numerical simulations have shown that the use of the previous time point solution as an initial guess in the Gummel iterations fails to predict the decay in the drain current from its maximum overshoot value. This difficulty is circumvented when the steady-state solution is used as a local-in-time initial guess. We use the diagonally implicit Runge-Kutta method for the time domain discretization. A fixed-point iteration technique is employed for the space domain iterations. To demonstrate the usefulness of the local-in-time method, numerical results of the transient drain current for various device parameters, such as the silicon film doping, silicon film thickness and back-gate bias are presented.}, isbn = {0038-1101}, doi = {10.1016/0038-1101(94)90197-X}, url = {http://www.sciencedirect.com/science/article/pii/003811019490197X}, author = {Tai,Gwo-Chung and Korman,Can E. and Mayergoyz, Issak D} } @article {18432, title = {Software Process Improvement in the NASA Software Engineering Laboratory.}, year = {1994}, month = {1994/12//}, institution = {CARNEGIE-MELLON UNIV PITTSBURGH PA SOFTWARE ENGINEERING INSTITUTE}, abstract = {The Software Engineering Laboratory (SEL) was established in 1976 for the purpose of studying and measuring software processes with the intent of identifying improvements that could be applied to the production of ground support software within the Flight Dynamics Division (FDD) at the National Aeronautics and Space Administration (NASA)/Goddard Space Flight Center (GSFC). The SEL has three member organizations: NASA/GSFC, the University of Maryland, and Computer Sciences Corporation (CSC). The concept of process improvement within the SEL focuses on the continual understanding of both process and product as well as goal-driven experimentation and analysis of process change within a production environment.}, keywords = {*AWARDS, *SOFTWARE ENGINEERING, *SYSTEMS ANALYSIS, *WORK MEASUREMENT, ADMINISTRATION AND MANAGEMENT, COMPUTER PROGRAMMING AND SOFTWARE, COMPUTER PROGRAMS, COMPUTERS, data acquisition, ENVIRONMENTS, EXPERIMENTAL DATA, GROUND SUPPORT., measurement, Organizations, PE63756E, Production, SOFTWARE PROCESS IMPROVEMENT, SPI(SOFTWARE PROCESS IMPROVEMENT), SPN-19950120014}, url = {http://stinet.dtic.mil/oai/oai?\&verb=getRecord\&metadataPrefix=html\&identifier=ADA289912}, author = {McGarry,Frank and Pajerski,Rose and Page,Gerald and Waligora,Sharon and Basili, Victor R.} } @inbook {18691, title = {Software reliability analysis of three successive generations of a Switching System}, booktitle = {Dependable Computing {\textemdash} EDCC-1}, series = {Lecture Notes in Computer Science}, volume = {852}, year = {1994}, month = {1994///}, pages = {471 - 490}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {Most current approaches to software reliability evaluation are based on data collected on a single generation of products. However, many applications are developed through improvements of the existing software: to the families of products are added various generations as the need for new functionalities arises. Experimental studies dealing with the analysis of data collected on families of products are seldom reported. In this paper, we analyze the data (failure and correction reports) collected on the software of three successive generations of the Brazilian Switching System {\textemdash} TROPICO-R, during validation and operation. A comparative analysis of the three products is done and the main results are outlined. Emphasis is placed on the evolution of the software and the corresponding failures and corrected faults. The analysis addresses: i) the modifications introduced on system components, ii) the distribution of failures and corrected faults in the components and the functions fulfilled by the system, and iii) the evolution of the failure intensity functions.}, keywords = {Computer science}, isbn = {978-3-540-58426-1}, url = {http://www.springerlink.com/content/f71g30v177521471/abstract/}, author = {Ka{\^a}niche,M. and Kanoun,K. and Michel Cukier and Martini,M.}, editor = {Echtle,Klaus and Hammer,Dieter and Powell,David} } @article {19003, title = {Suppressor U1 snRNAs in Drosophila.}, journal = {GeneticsGenetics}, volume = {138}, year = {1994}, month = {1994/10/01/}, pages = {365 - 378}, abstract = {Although the role of U1 small nuclear RNAs (snRNAs) in 5{\textquoteright} splice site recognition is well established, suppressor U1 snRNAs active in intact multicellular animals have been lacking. Here we describe suppression of a 5{\textquoteright} splice site mutation in the Drosophila melanogaster white gene (w(DR18)) by compensatory changes in U1 snRNA. Mutation of positions -1 and +6 of the 5{\textquoteright} splice site of the second intron (ACG|GTGACT to ACC|GTGAGC) results in the accumulation of RNA retaining this 74-nucleotide intron in both transfected cells and transgenic flies. U1-3G, a suppressor U1 snRNA which restores basepairing at position +6 of the mutant intron, increases the ratio of spliced to unspliced w(DR18) RNA up to fivefold in transfected Schneider cells and increases eye pigmentation in w(DR18) flies. U1-9G, which targets position -1, suppresses w(DR18) in transfected cells less well. U1-3G,9G has the same effect as U1-3G although it accumulates to lower levels. Suppression of w(DR18) has revealed that the U1b embryonic variant (G134 to U) is active in Schneider cells and pupal eye discs. However, the combination of 9G with 134U leads to reduced accumulation of both U1b-9G and U1b-3G,9G, possibly because nucleotides 9 and 134 both participate in a potential long-range intramolecular base-pairing interaction. High levels of functional U1-3G suppressor reduce both viability and fertility in transformed flies. These results show that, despite the difficulties inherent in stably altering splice site selection in multicellular organisms, it is possible to obtain suppressor U1 snRNAs in flies.}, isbn = {0016-6731, 1943-2631}, url = {http://www.genetics.org/content/138/2/365}, author = {Lo,P. C. and Roy,D. and Mount, Stephen M.} } @conference {18054, title = {Trade-offs between communication throughput and parallel time}, booktitle = {Proceedings of the twenty-sixth annual ACM symposium on Theory of computing}, year = {1994}, month = {1994///}, pages = {372 - 381}, author = {Mansour,Y. and Nisan,N. and Vishkin, Uzi} } @conference {15967, title = {What Experts Deny, Novices Must Understand}, booktitle = {In 3rd International Workshop on Human and Machine Cognition}, year = {1994}, month = {1994///}, author = {Perlis, Don and Miller,M. and Perlis, Don} } @conference {15577, title = {Algorithms for fast vector quantization}, booktitle = {Data Compression Conference, 1993. DCC {\textquoteright}93.}, year = {1993}, month = {1993///}, pages = {381 - 390}, abstract = {This paper shows that if one is willing to relax the requirement of finding the true nearest neighbor, it is possible to achieve significant improvements in running time and at only a very small loss in the performance of the vector quantizer. The authors present three algorithms for nearest neighbor searching: standard and priority k -d tree search algorithms and a neighborhood graph search algorithm in which a directed graph is constructed for the point set and edges join neighboring points}, keywords = {algorithm;, algorithms;, directed, fast, graph, graph;, graphs;, Neighborhood, performance;, problems;, quantisation;, quantization;, running, search, time;, tree, vector}, doi = {10.1109/DCC.1993.253111}, author = {Arya,S. and Mount, Dave} } @conference {15636, title = {Approximate nearest neighbor queries in fixed dimensions}, booktitle = {Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms}, series = {SODA {\textquoteright}93}, year = {1993}, month = {1993///}, pages = {271 - 280}, publisher = {Society for Industrial and Applied Mathematics}, organization = {Society for Industrial and Applied Mathematics}, address = {Philadelphia, PA, USA}, isbn = {0-89871-313-7}, url = {http://dl.acm.org/citation.cfm?id=313559.313768}, author = {Arya,Sunil and Mount, Dave} } @article {15617, title = {Approximate nearest neighbor searching}, journal = {Proceedings of 4th Annual ACMSIAM Symposium on Discrete Algorithms (SODA{\textquoteright}93)}, year = {1993}, month = {1993///}, pages = {271 - 280}, author = {Arya,S. and Mount, Dave} } @conference {18066, title = {Approximate parallel prefix computation and its applications}, booktitle = {Parallel Processing Symposium, 1993., Proceedings of Seventh International}, year = {1993}, month = {1993///}, pages = {318 - 325}, author = {Goodrich,M. T and Matias,Y. and Vishkin, Uzi} } @article {15665, title = {On the area of overlap of translated polygons}, journal = {SPIE Vision Geometry II}, volume = {2060}, year = {1993}, month = {1993///}, pages = {254 - 264}, abstract = {Given two simple polygons P and Q in the plane and a translation vector t 2R2, the area-of-overlap function of P and Q is the function Ar(t) = Area(P \(t + Q)), where t + Q denotes Q translated by t. This function has a number of applications in areas such as motion planning and object recognition. We present a number of mathematical results regarding this function. We also provide e cient algorithms for computing a representation of this function, and for tracing contour curves of constant area-of-overlap. }, author = {Mount, Dave and Silverman,R. and Wu,A.} } @mastersthesis {15381, title = {Data parallel algorithms for the numerical modeling of semiconductor devices}, year = {1993}, month = {1993///}, school = {University of Maryland at College Park}, address = {College Park, MD, USA}, author = {Darling,James Paul}, editor = {Mayergoyz, Issak D} } @conference {14780, title = {Dynamic control of performance monitoring on large scale parallel systems}, booktitle = {Proceedings of the 7th international conference on Supercomputing - ICS {\textquoteright}93}, year = {1993}, month = {1993///}, pages = {185 - 194}, address = {Tokyo, Japan}, doi = {10.1145/165939.165969}, url = {http://dl.acm.org/citation.cfm?id=165969}, author = {Hollingsworth, Jeffrey K and Miller, Barton P.} } @conference {15631, title = {Efficient algorithms for robust circular arc estimators}, booktitle = {Proceedings of the Fifth Canadian Conference on Computational Geometry, Waterloo, Ontario, Canada}, year = {1993}, month = {1993///}, author = {Mount, Dave and Netanyahu,N. S} } @article {17953, title = {Evaluating surface intersections in lower dimensions}, journal = {Second International Conference on Curves and Surfaces}, year = {1993}, month = {1993///}, abstract = {We highlight a new algorithm for evaluating the sur-face intersection curve using a matrix formulation. The projection of the intersection curve is represented as the singular set of a bi- variate matrix polynomial. The resulting algorithm for evaluating the intersection curve is based on matrix computations like eigen- decomposition and singular value decomposition. Furthermore, at each stage of the algorithm we make use of inverse power iterations to march back to the curve. We also describe the performance of the resulting robust and accurate approach }, author = {Manocha,D. and Varshney, Amitabh and Weber,H.} } @conference {15659, title = {Fast search algorithms with applications to split and multi-stage vector quantization of speech lsp parameters}, booktitle = {Speech Coding for Telecommunications, 1993. Proceedings., IEEE Workshop on}, year = {1993}, month = {1993///}, pages = {65 - 66}, doi = {10.1109/SCFT.1993.762341}, author = {Arya,S. and Phamdo,N. and Farvardin,N. and Mount, Dave} } @article {17163, title = {Finding facts vs. browsing knowledge in hypertext systems}, journal = {Sparks of innovation in human-computer interaction}, year = {1993}, month = {1993///}, pages = {103 - 103}, author = {Marchionini,G. and Shneiderman, Ben} } @article {15208, title = {Geometric knapsack problems}, journal = {Algorithmica}, volume = {10}, year = {1993}, month = {1993///}, pages = {399 - 427}, abstract = {We study a variety of geometric versions of the classical knapsack problem. In particular, we consider the following ldquofence enclosurerdquo problem: given a setS ofn points in the plane with valuesv i ge 0, we wish to enclose a subset of the points with a fence (a simple closed curve) in order to maximize the ldquovaluerdquo of the enclosure. The value of the enclosure is defined to be the sum of the values of the enclosed points minus the cost of the fence. We consider various versions of the problem, such as allowingS to consist of points and/or simple polygons. Other versions of the problems are obtained by restricting the total amount of fence available and also allowing the enclosure to consist of at mostM connected components. When there is an upper bound on the length of fence available, we show that the problem is NP-complete. We also provide polynomial-time algorithms for many versions of the fence problem when an unrestricted amount of fence is available.}, doi = {10.1007/BF01769706}, author = {Arkin,E. M and Khuller, Samir and Mitchell,J. S.B} } @inbook {15764, title = {Iterative Methods for Finding the Stationary Vector for Markov Chains}, booktitle = {Linear Algebra, Markov Chains, and Queuing ModelsLinear Algebra, Markov Chains, and Queuing Models}, volume = {48}, year = {1993}, month = {1993///}, pages = {125 - 136}, publisher = {Springer-Verlag IMA Volumes in Math. and Its Applics.}, organization = {Springer-Verlag IMA Volumes in Math. and Its Applics.}, address = {New York}, author = {O{\textquoteright}Leary, Dianne P.}, editor = {Meyer,Carl and Plemmons,Robert} } @article {16556, title = {Local conditions for phase transitions in neural networks with variable connection strengths}, journal = {Neural networks}, volume = {6}, year = {1993}, month = {1993///}, pages = {667 - 676}, author = {McFadden,F. E and Peng,Y. and Reggia, James A.} } @article {15630, title = {On The Maximum Number of Intersections of Two Polyhedra in 2 and 3 Dimensions}, journal = {Proceedings of the Fifth Canadian Conference on Computational Geometry, Waterloo, Ontario}, year = {1993}, month = {1993///}, pages = {49 - 54}, abstract = {We obtain exact bounds on the maximum number of in-tersections between two polygons with prescribed edge counts. In three dimensions, we obtain exact bounds on the number of intersecting face-pairs of two polyhe- dra with prescribed face counts when the polyhedra are convex, and lower bounds in the general case. }, author = {Dillencourt,M. B and Mount, Dave and Saalfeld,A.J.} } @inbook {18963, title = {Messenger RNA splicing signals in Drosophila genes}, booktitle = {Atlas of Drosophila Genes}, year = {1993}, month = {1993///}, pages = {333 - 358}, publisher = {Oxford University Press, New York, NY}, organization = {Oxford University Press, New York, NY}, abstract = {This chapter provides a general description of introns in Drosophila genes, withemphasis on the genetic information responsible for the correct specification of boundaries between introns and exons. The problem of locating introns within unannotated DNA sequences is posed by any large genomic sequencing project, and provides a perspective for discussing the information that specifies their removal. I want to stress, however, that there may not be a single set of rules that can identify all introns in all tissues. Certainly, it has become clear that the rules for locating introns will differ between species, such as flies and humans, in different taxonomic classes. Here, I will attempt to describe in general terms both what is known about how introns are recognized by the splicing machinery, and how an investigator might go about identifying introns within the sequence of his favorite Drosophila gene. Ultimately, such searches will be carried out by computer. Most current software, however, is designed specifically or primarily for species other than Drosophila (one exception is the program GM (Fields and Soderlund 1990), which accepts organism-specific consensus matrices and codon asymmetry tables). I am currently developing computational applications of the ideas described here, and interested readers are encouraged to consult current releases of the electronic Drosophila Infor- mation Newsletter. }, author = {Mount, Stephen M.} } @conference {11926, title = {Multiple Resource Allocation for Multiprocessor Distributed Real-Time Systems}, booktitle = {In Workshop on Parallel and Distributed Real-Time Systems (PDRTS), IEEE IPPS{\textquoteright}93}, year = {1993}, month = {1993///}, abstract = {this report are those of the author(s) and should not be interpreted as representing the official policies, either expressed or implied, of the Defense Advanced Research Projects Agency, ONR, the U.S. Government or Honeywell. Computer facilities were provided in part by NSF grant CCR-8811954. Workshop on Parallel and Dist Real-Time Syst, IEEE IPPS{\textquoteright}93 April 1993 in the queue and tries to schedule it. If the task is successfully scheduled, it is removed from the queue and executed. Otherwise, the task is unlocked so that other processors may examine it in the same fashion. This scheme is convenient for a shared memory architecture, but becomes too expensive and cumbersome when such facility is not available in hardware (for example, in distributed systems). The goal of this paper is twofold: first, to study the problem of allocating multiple resources to a single task; and second, to provide a heuristic allocation policy for selecting a resource among multiple instances of identical resources. We consider a distributed system in which each site is a uniform memory access (UMA) multiprocessor, but the scheme is easily extensible to non-UMA models. For the first problem, a three-tiered resource allocation scheme is proposed. A hierarchy of the resources is defined to reduce the probability of allocation failure as the allocation progresses. To reduce the complexity of multiple resource allocation, we group the resources into schedulable sets of resources. Since the objective in real-time systems is to meet deadlines, this approach is acceptable so long as it meets a justifiable minimum level of resource utilization. It is shown that our approach allows modularity, flexibility, and potential concurrency in scheduling. Another contribution of this paper is in explicitly ide...}, author = {Mosse,Daniel and Noh,Sam H and Trinh,Bao and Agrawala, Ashok K.} } @article {15371, title = {A new point of view on the mathematical structure of Maxwell{\textquoteright}s equations}, journal = {Magnetics, IEEE Transactions on}, volume = {29}, year = {1993}, month = {1993/03//}, pages = {1315 - 1320}, abstract = {It is emphasized that the Maxwell equations have a peculiar mathematical structure which leads to boundary value problems with an overspecified number of partial differential equations and an underspecified number of boundary conditions. An attempt is made to reduce these boundary value problems to standard mathematical formulations with equal numbers of partial differential equations and boundary conditions. It is demonstrated that these formulations have some attractive features which appreciably facilitate their finite element discretizations. A numerical example involving scattering of plane electromagnetic waves from a perfect conducting thin plate illustrates the discussion}, keywords = {analysis;partial, conditions;boundary, conducting, differential, discretizations;mathematical, element, EM, equations;, equations;boundary, equations;boundary-value, equations;perfect, example;partial, Maxwell{\textquoteright}s, plate;plane, problems;electromagnetic, problems;finite, scattering;finite, scattering;Maxwell, structure;numerical, thin, value, wave}, isbn = {0018-9464}, doi = {10.1109/20.250640}, author = {Mayergoyz, Issak D and D{\textquoteright}Angelo,J.} } @article {15554, title = {Point probe decision trees for geometric concept classes}, journal = {Algorithms and Data Structures}, year = {1993}, month = {1993///}, pages = {95 - 106}, abstract = {A fundamental problem in model-based computer vision is that of identifying to which of a given set of concept classes of geometric models an observed model belongs. Considering a ldquoproberdquo to be an oracle that tells whether or not the observed model is present at a given point in an image, we study the problem of computing efficient strategies (ldquodecision treesrdquo) for probing an image, with the goal to minimize the number of probes necessary (in the worst case) to determine in which class the observed model belongs. We prove a hardness result and give strategies that obtain decision trees whose height is within a log factor of optimal.These results grew out of discussions that began in a series of workshops on Geometric Probing in Computer Vision, sponsored by the Center for Night Vision and Electro-Optics, Fort Belvoir, Virginia, and monitored by the U.S. Army Research Office. The views, opinions, and/or findings contained in this report are those of the authors and should not be construed as an official Department of the Army position, policy, or decision, unless so designated by other documentation. }, doi = {10.1007/3-540-57155-8_239}, author = {Arkin,E. and Goodrich,M. and Mitchell,J. and Mount, Dave and Piatko,C. and Skiena,S.} } @conference {17325, title = {Potentials and limitations of pen-based computers}, booktitle = {Proceedings of the 1993 ACM conference on Computer science}, series = {CSC {\textquoteright}93}, year = {1993}, month = {1993///}, pages = {536 - 539}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {There are four possible genres of input devices that can be attached to personal workstations; keyboard, mouse, pen, and voice. For investigating potentials and limitations of pen-based computers, we propose to compare those four categories as different types of man-machine communication channel.Even though arrow keys allow a limited scope of 2D capability in keyboard usage, the primary use of a keyboard is typing. Typing generates a linear sequence of discrete characters. The maximum speed of typing is roughly 10 characters per second, hence the bandwidth of 100 (10{\texttimes}10) bps. A mouse is used primarily for pointing (menu item/object selection) and then for dragging (moving and re-sizing objects). Mouse pointing generates a discrete information of a point location on a 2D (planer) plane with the maximum speed of 2 clicking per second. Each pointing may generate 20 bits of information with the bandwidth of 40 (2{\texttimes}20) bps. Mouse dragging generates a continuous geometric pattern in 2D. Assuming the maximum rate of 40 selections per second in the eight (3 bits) possible directions of dragging, the bandwidth of mouse dragging peaks at 120 (40{\texttimes}3) bps. The usage of pen on a planer flat surface of LCD unit can be divided into scribing and tapping. By scribing we mean a generation of continuous pen strokes forming a character, a gesture, or a picture. Scribing includes drawing and gesturing. Tapping corresponds to a mouse clicking. Tapping may be considered as a special kind of gesture as in the PenPoint operating system. The bandwidth of scribing can be calculated in the same manner as for mouse dragging. With the maximum rate of 100 selections of direction per second for pen, scribing may produce strokes with the speed of 300 (100{\texttimes}3) bps. The bandwidth of pen tapping is almost the same as that of a mouse clicking except that a selection of a point is easier by a pen (3 tappings per second) than by a mouse (2 clickings per second). Talking through a microphone generates a linear sequence of continuous speech with a high degree of redundancy. Using the CELP speech compression algorithm, the bandwidth of normal speech can be reduced to 4800 bps. By vocal signaling we mean a generation of a sequence of discrete messages each of which consists of different pitches and loudness levels. The maximum rate of signaling could be 5 messages per second with 10 differentiable pitches and 10 levels of loudness producing the bandwidth of 35 (5{\texttimes}7) bps. Note that mouse dragging, pen scribing, and voice talking, each produces continuous data objects. Only after quantization by sampling, the data objects can be represented by discrete data structure. By precision we mean the degree of ease in duplicating the identical information using the same input technology. Keyboard is a high precision device because there is no difficulty in generating the same character over and over again. Drawing by a mouse is more difficult than drawing by a pen, because pen is easier to control than mouse. Precision of voice is low because it is difficult to duplicate the sound of the same pitch and the same volume. By latency we mean the set-up time necessary to start generating a stream of information. The latency of using keyboard and mouse is larger than the latency of using pen and voice. By translation we mean a process of converting the information generated by the input device into a sequence of discrete symbols, i.e., a transduction of a continuous data type to a discrete data type. Translation for a keyboard is not necessary. Translation of a mouse click on a menu item requires a finite table look-up which is rather simple operation. Translation of pen scribing and mouse dragging involves a handwriting recognition algorithm which is still a difficult problem at present time. Voice recognition is a very difficult problem. With the assumption that real-time translation is feasible for handwriting recognition and speech recognition, the efficiency of input device for text entry can be measured by how many characters can be entered in a second (cps). A simulated keyboard on CRT is used for entering text by a mouse. Long handwriting on a pen computer is used for a pen. When personal workstations become down-sized, the physical dimension of an input/output device becomes a dominant factor for the mobility of workstations. Keyboard and mouse are portable but intrusive. Wireless pen is mobile and less intrusive. Voice can be ubiquitous but intrusive. One conclusion we can draw from the above analysis is that pen is mightier than mouse. A pen can replace a mouse any time any place. However, keyboard, pen, and voice have different strong points and weak points. They compensate with each other. Therefore, we predict that future workstations will carry multi-modal user-interface with any combination of keyboard, pen, and voice. }, isbn = {0-89791-558-5}, doi = {10.1145/170791.171171}, url = {http://doi.acm.org/10.1145/170791.171171}, author = {Citrin,Wayne and Halbert,Dan and Hewitt,Carl and Meyrowitz,Norm and Shneiderman, Ben} } @conference {16007, title = {Presentations and this and that: logic in action}, booktitle = {Proceedings of the 15th Annual Conference of the Cognitive Science Society, Boulder, Colorado}, volume = {251}, year = {1993}, month = {1993///}, author = {Miller,M. and Perlis, Don} } @article {12035, title = {Probabilistic analysis of some navigation strategies in a dynamic environment}, journal = {Systems, Man and Cybernetics, IEEE Transactions on}, volume = {23}, year = {1993}, month = {1993///}, pages = {1465 - 1474}, author = {Sharma, R. and Mount, Dave and Aloimonos, J.} } @article {15402, title = {RF scattering and radiation by using a decoupled Helmholtz equation approach}, journal = {Magnetics, IEEE Transactions on}, volume = {29}, year = {1993}, month = {1993/03//}, pages = {2040 - 2042}, abstract = {A novel finite-element formulation for the solution of 3-D RF scattering and radiation problems is presented. This formulation is based on the solution of a set of decoupled Helmholtz equations for the Cartesian components of the field vectors. This results in a robust, computer-efficient method that eliminates previous difficulties associated with {\textquoteleft}curl-curl{\textquoteright} type partial differential equations. Although it is presented in the frequency domain, the method is easily extendible to the time domain}, keywords = {3D, analysis;, approach;, computer-efficient, computing;, decoupled, domain;, electrical, electromagnetic, element, engineering, equation, finite, finite-element, formulation;, Frequency, frequency-domain, Helmholtz, method;, Physics, problems;, propagation;, radiation, radiowave, RF, scattering;, wave}, isbn = {0018-9464}, doi = {10.1109/20.250811}, author = {D{\textquoteright}Angelo,J. and Mayergoyz, Issak D} } @article {18997, title = {Species-specific signals for the splicing of a short Drosophila intron in vitro.}, journal = {Molecular and Cellular BiologyMol. Cell. Biol.}, volume = {13}, year = {1993}, month = {1993/02/01/}, pages = {1104 - 1118}, abstract = {The effects of branchpoint sequence, the pyrimidine stretch, and intron size on the splicing efficiency of the Drosophila white gene second intron were examined in nuclear extracts from Drosophila and human cells. This 74-nucleotide intron is typical of many Drosophila introns in that it lacks a significant pyrimidine stretch and is below the minimum size required for splicing in human nuclear extracts. Alteration of sequences of adjacent to the 3{\textquoteright} splice site to create a pyrimidine stretch was necessary for splicing in human, but not Drosophila, extracts. Increasing the size of this intron with insertions between the 5{\textquoteright} splice site and the branchpoint greatly reduced the efficiency of splicing of introns longer than 79 nucleotides in Drosophila extracts but had an opposite effect in human extracts, in which introns longer than 78 nucleotides were spliced with much greater efficiency. The white-apricot copia insertion is immediately adjacent to the branchpoint normally used in the splicing of this intron, and a copia long terminal repeat insertion prevents splicing in Drosophila, but not human, extracts. However, a consensus branchpoint does not restore the splicing of introns containing the copia long terminal repeat, and alteration of the wild-type branchpoint sequence alone does not eliminate splicing. These results demonstrate species specificity of splicing signals, particularly pyrimidine stretch and size requirements, and raise the possibility that variant mechanisms not found in mammals may operate in the splicing of small introns in Drosophila and possibly other species.}, isbn = {0270-7306, 1098-5549}, doi = {10.1128/MCB.13.2.1104}, url = {http://mcb.asm.org/content/13/2/1104}, author = {Guo,M. and Lo,P. C. and Mount, Stephen M.} } @article {16945, title = {A study of file manipulation by novices using commands vs, direct manipulation}, journal = {Sparks of innovation in human-computer interaction}, year = {1993}, month = {1993///}, pages = {39 - 39}, author = {Margono,S. and Shneiderman, Ben} } @book {13885, title = {Use of lexical conceptual structure for intelligent tutoring}, year = {1993}, month = {1993///}, publisher = {University of Maryland}, organization = {University of Maryland}, abstract = {We describe the use of an LCS-based semantics for question-answeringexercises in foreign language training. We start by reviewing the LCS model and show how this representation can be used to support a question answering lesson as well as a limited domain discourse. An authoring tool for entering the relevant semantic knowledge is also described. }, author = {Dorr, Bonnie J and Hendler,J. and Blanksteen,S. and Migdalof,B.} } @article {16782, title = {Using differential technlques to efficiently support transaction time}, journal = {The VLDB JournalVLDB Journal}, volume = {2}, year = {1993}, month = {1993/01//}, pages = {75 - 111}, isbn = {1066-8888}, doi = {10.1007/BF01231799}, url = {http://dl.acm.org/citation.cfm?id=615162}, author = {Jensen,Christian S. and Mark,Leo and Roussopoulos, Nick and Sells,Timos} } @conference {15977, title = {Vacuum-logic}, booktitle = {Proceedings of AAAI 1993 Fall Symposium Series: Instantiating Real-World Agents}, year = {1993}, month = {1993///}, pages = {51 - 54}, author = {Elgot-drapkin,J. and Kraus,S. and Miller,M. and Nirkhe,M. and Perlis, Don} } @article {15737, title = {Constrained Matrix Sylvester Equations}, journal = {SIAM Journal on Matrix Analysis and Applications}, volume = {13}, year = {1992}, month = {1992///}, pages = {1 - 9}, abstract = {The problem of finding matrices $L$ and $T$ satisfying $TA - FT = LC$ and $TB = 0$ is considered. Existence conditions for the solution are established and an algorithm for computing the solution is derived. Conditions under which the matrix $[C^T ,T^T ]$ is full rank are also discussed. The problem arises in control theory in the design of reduced-order observers that achieve loop transfer recovery.}, keywords = {loop transfer recovery, matrix Liapunov equation, Sylvester operator}, doi = {10.1137/0613002}, url = {http://link.aip.org/link/?SML/13/1/1}, author = {Barlow,Jewel B. and Monahemi,Moghen M. and O{\textquoteright}Leary, Dianne P.} } @article {15623, title = {Delaunay triangulation and computational fluid dynamics meshes}, journal = {Proceedings of the 4th Canadian Conference on Computational Geometry}, year = {1992}, month = {1992///}, pages = {316 - 321}, abstract = {In aerospace computational fluid dynamics (CFD) calculations, the Delaunay triangulation of suitable quadrilateral meshes can lead to unsuitable triangulated meshes. Here, we present case studies which illustrate the limitations of using structured grid generation methods which produce points in a curvilinear coordinate system for subsequent triangulations for CFD applications. We discuss conditions under which meshes of quadrilateral elements may not produce a Delaunay triangulation suitable for CFD calculations, particularly with regard to high aspect ratio, skewed quadrilateral elements.}, author = {Posenau,Mary-Anne K and Mount, Dave} } @article {15818, title = {The Design of Reduced Order Observers with Precise Loop Transfer Recovery}, journal = {AIAA Journal of Guidance, Control, and Dynamics}, volume = {15}, year = {1992}, month = {1992///}, pages = {1320 - 1326}, author = {Monahemi,Moghen M. and Barlow,Jewel B. and O{\textquoteright}Leary, Dianne P.} } @article {15622, title = {Incremental construction and dynamic maintenance of constrained Delaunay triangulations}, journal = {Proceedings of the 4th Canadian Conference on Computational Geometry}, year = {1992}, month = {1992///}, pages = {170 - 175}, author = {Kao,T.C. and Mount, Dave} } @article {16727, title = {Incrementally maintained network{\textrightarrow}relational database mapping}, journal = {Software: Practice and Experience}, volume = {22}, year = {1992}, month = {1992/12/01/}, pages = {1099 - 1131}, abstract = {An incrementally maintained mapping from a network to a relational database is presented. This mapping may be established either to support the efficient retrieval of data from a network database through a relational interface, or as the first step in a gradual conversion of data and applications from a network to a relational database system. After the mapping has been established, the only data mapped from the network to the relational database are the increments resulting from updates on the network database. The mapping is therefore an efficient alternative to mappings that repeatedly map the results of retrievals through the relational interface from the network database to the relational database. This is in particular the case when the two databases reside on different hosts. Applications on the network database may, under certain restrictions, gradually be moved to the relational database, while the mapping incrementally maintains the relational database for the applications that remain on the network database.}, keywords = {Database conversion, Database gateway, Database mapping, Incremental database mapping}, isbn = {1097-024X}, doi = {10.1002/spe.4380221205}, url = {http://onlinelibrary.wiley.com/doi/10.1002/spe.4380221205/abstract}, author = {Mark,Leo and Roussopoulos, Nick and Newsome,Tina and Laohapipattana,Piriya} } @conference {15626, title = {Intersection detection and separators for simple polygons}, booktitle = {Proceedings of the eighth annual symposium on Computational geometry}, series = {SCG {\textquoteright}92}, year = {1992}, month = {1992///}, pages = {303 - 311}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {A simple algorithm is presented for detecting whether two preprocessed simple polygons intersect one another. Given a simple polygon, A, in O(n log n) time and O(n) space we preprocess A constructing an enveloping triangulation called a scaffold. To determine whether two preprocessed polygons A and B overlap another, we start with these two envelopes and successively strip away overlapping triangles of the scaffolds until we either detect an intersection between the objects or until we have succeeded in separating them spatially. The running time of the intersection query depends on the complexity of the minimum link polygonal curve separating the two objects. Given two preprocessed simple polygons A and B, placed at arbitrary locations in the plane we can determine whether these polygons intersect one another in O(m log2n is the total number of vertices and m is the complexity of a minimum link polygonal curve separating A from B. We generalize this to the problem of computing arbitrary Boolean functions of two preprocessed polygons.}, isbn = {0-89791-517-8}, doi = {10.1145/142675.142737}, url = {http://doi.acm.org/10.1145/142675.142737}, author = {Mount, Dave} } @article {15603, title = {A parallel algorithm for enclosed and enclosing triangles}, journal = {International Journal of Computational Geometry and Applications}, volume = {2}, year = {1992}, month = {1992///}, pages = {191 - 214}, abstract = {We consider the problems of computing the largest area triangle enclosed within a given n-sided convex polygon and the smallest area triangle which encloses a given convex polygon. We show that these problems are closely related by presenting a single sequential linear time algorithm which essentially solves both problems simultaneously. We also present a cost-optimal parallel algorithm that solves both of these problems in O(log log n) time using n/log log n processors on a CRCW PRAM. In order to achieve these bounds we develop new techniques for the design of parallel algorithms for computational problems involving the rotating calipers method.}, doi = {10.1142/S0218195992000123}, author = {Chandran,S. and Mount, Dave} } @article {15549, title = {Parallel computational geometry of rectangles}, journal = {Algorithmica}, volume = {7}, year = {1992}, month = {1992///}, pages = {25 - 49}, abstract = {Rectangles in a plane provide a very useful abstraction for a number of problems in diverse fields. In this paper we consider the problem of computing geometric properties of a set of rectangles in the plane. We give parallel algorithms for a number of problems usingn processors wheren is the number of upright rectangles. Specifically, we present algorithms for computing the area, perimeter, eccentricity, and moment of inertia of the region covered by the rectangles inO(logn) time. We also present algorithms for computing the maximum clique and connected components of the rectangles inO(logn) time. Finally, we give algorithms for finding the entire contour of the rectangles and the medial axis representation of a givenn {\texttimes} n binary image inO(n) time. Our results are faster than previous results and optimal (to within a constant factor).}, doi = {10.1007/BF01758750}, author = {Chandran,S. and Kim,S. K and Mount, Dave} } @conference {14792, title = {Parallel program performance metrics: a comprison and validation}, booktitle = {Proceedings of the 1992 ACM/IEEE conference on Supercomputing}, year = {1992}, month = {1992///}, pages = {4 - 13}, author = {Hollingsworth, Jeffrey K and Miller, B. P} } @article {17830, title = {PARTI primitives for unstructured and block structured problems}, journal = {Computing Systems in Engineering}, volume = {3}, year = {1992}, month = {1992///}, pages = {73 - 86}, abstract = {This paper describes a set of primitives (PARTI) developed to efficiently execute unstructured and block structured problems on distributed memory parallel machines. We present experimental data from a three-dimensional unstructured Euler solver run on the Intel Touchstone Delta to demonstrate the usefulness of our methods.}, isbn = {0956-0521}, doi = {10.1016/0956-0521(92)90096-2}, url = {http://www.sciencedirect.com/science/article/pii/0956052192900962}, author = {Sussman, Alan and Saltz, J. and Das,R. and Gupta,S. and Mavriplis,D. and Ponnusamy,R. and Crowley,K.} } @inbook {15779, title = {On the Precise Loop Transfer Recovery and Transmission Zeroes}, booktitle = {First IEEE Conference on Control ApplicationsFirst IEEE Conference on Control Applications}, year = {1992}, month = {1992/09//}, address = {Dayton, Ohio}, author = {Monahemi,M. and Barlow,J. and O{\textquoteright}Leary, Dianne P.} } @article {15205, title = {Processor efficient parallel algorithms for the two disjoint paths problem and for finding a Kuratowski homeomorph}, journal = {SIAM Journal on Computing}, volume = {21}, year = {1992}, month = {1992///}, pages = {486 - 486}, author = {Khuller, Samir and Mitchell,S. G and Vazirani,V. V} } @article {15604, title = {A randomized algorithm for slope selection}, journal = {International Journal of Computational Geometry and Applications}, volume = {2}, year = {1992}, month = {1992///}, pages = {1 - 27}, author = {Dillencourt,M. B and Mount, Dave and Netanyahu,N. S} } @article {18074, title = {Randomized range-maxima in nearly-constant parallel time}, journal = {Computational Complexity}, volume = {2}, year = {1992}, month = {1992///}, pages = {350 - 373}, author = {Berkman,O. and Matias,Y. and Vishkin, Uzi} } @article {19000, title = {Splicing signals in Drosophila: intron size, information content, and consensus sequences}, journal = {Nucleic Acids ResearchNucl. Acids Res.}, volume = {20}, year = {1992}, month = {1992/08/25/}, pages = {4255 - 4262}, abstract = {A database of 209 Drosophila Introns was extracted from Genbank (release number 64.0) and examined by a number of methods in order to characterize features that might serve as signals for messenger RNA splicing. A tight distribution of sizes was observed: while the smallest introns in the database are 51 nucleotides, more than half are less than 80 nucleotides in length, and most of these have lengths in the range of 59 {\textendash} 67 nucleotides. Drosophila splice sites found in large and small introns differ in only minor ways from each other and from those found in vertebrate Introns. However, larger introns have greater pyrimidlne-richness in the region between 11 and 21 nucleotides upstream of 3' splice sites. The Drosophila branchpoint consensus matrix resembles C T A A T (in which branch formation occurs at the underlined A), and differs from the corresponding mammalian signal in the absence of G at the position immediately preceding the branchpoint. The distribution of occurrences of this sequence suggests a minimum distance between 5' splice shies and branchpoints of about 38 nucleotides, and a minimum distance between 3' splice sites and branchpoints of 15 nucleotides. The methods we have used detect no information in exon sequences other than in the few nucleotides immediately adjacent to the splice sites. However, Drosophila resembles many other species in that there is a discontinuity in A + T content between exons and introns, which are A + T rich.}, isbn = {0305-1048, 1362-4962}, doi = {10.1093/nar/20.16.4255}, url = {http://nar.oxfordjournals.org/content/20/16/4255}, author = {Mount, Stephen M. and Burks,Christian and Herts,Gerald and Stormo,Gary D. and White,Owen and Fields,Chris} } @article {15574, title = {Combinatorial and computational aspects of Minkowski decompositions}, journal = {Contemporary Mathematics}, volume = {119}, year = {1991}, month = {1991///}, pages = {107 - 124}, author = {Mount, Dave and Silverman,R.} } @article {15669, title = {Computing generalized Voronoi diagrams in improved time and space bounds}, year = {1991}, month = {1991///}, institution = {University of Maryland at College Park}, address = {College Park, MD, USA}, author = {Kao,Thomas C. and Mount, Dave} } @inbook {15736, title = {Considerations on Loop Transfer Recovery for Non-minimum Phase Plants}, booktitle = {Proceedings of the AIAA Aircraft Design Systems and Operations MeetingProceedings of the AIAA Aircraft Design Systems and Operations Meeting}, volume = {AIAA-91-3086}, year = {1991}, month = {1991/09//}, address = {Baltimore}, author = {Monahemi,M. and Barlow,J. and O{\textquoteright}Leary, Dianne P.} } @conference {18078, title = {Converting high probability into nearly-constant time{\textemdash}with applications to parallel hashing}, booktitle = {Proceedings of the twenty-third annual ACM symposium on Theory of computing}, year = {1991}, month = {1991///}, pages = {307 - 316}, author = {Matias,Y. and Vishkin, Uzi} } @conference {15357, title = {Data parallel algorithms for the numerical modeling of semiconductor devices}, booktitle = {Proceedings of the 5th SIAM Conference on Parallel Processing for Scientific Computing}, year = {1991}, month = {1991///}, pages = {394 - 400}, author = {Darling,J. P. and Mayergoyz, Issak D} } @conference {17054, title = {Demonstrational interfaces: Coming soon?}, booktitle = {Proceedings of the SIGCHI conference on Human factors in computing systems: Reaching through technology}, series = {CHI {\textquoteright}91}, year = {1991}, month = {1991///}, pages = {393 - 396}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, isbn = {0-89791-383-3}, doi = {10.1145/108844.108966}, url = {http://doi.acm.org/10.1145/108844.108966}, author = {Myers,Brad A. and Cypher,Allen and Maulsby,David and Smith,David C. and Shneiderman, Ben} } @article {15583, title = {The densest double-lattice packing of a convex polygon}, journal = {Discrete and Computational Geometry: Papers from the DIMACS Special Year}, volume = {6}, year = {1991}, month = {1991///}, pages = {245 - 262}, author = {Mount, Dave} } @inbook {15817, title = {The Design of Reduced Order Luenberger Observers with Precise LTR}, booktitle = {Proceedings of the AIAA Meeting on Guidance, Navigation and ControlProceedings of the AIAA Meeting on Guidance, Navigation and Control}, volume = {AIAA-91-2731}, year = {1991}, month = {1991/08//}, address = {New Orleans}, abstract = {This work concerns the design of reduced-order observers for controllable, observable, and regular systems in which the number of measurements is more than the number of controls. It uses eigenstructure assignment whereas other approaches use Kalman filter (LQG/LTR) methods. The advantages of this approach are: (1) precise LTR rather than approximate LTR, (2) no restriction to minimum phase systems, (3) finite observer gain rather than asymptotic observer gain, and (4) simpler and more efficient numerical calculation. Case studies are presented illustrating these features in aircraft control applications.}, author = {Monahemi,M. and Barlow,J. and O{\textquoteright}Leary, Dianne P.} } @article {17634, title = {On finding the minimum bandwidth of interval graphs}, journal = {Information and Computation}, volume = {95}, year = {1991}, month = {1991/12//}, pages = {218 - 224}, abstract = {Let G = (V, E) be an interval graph, with |V| = n, and |E| = m. An O(n2 log n) algorithm was proposed in Kratsch (Inform Comput. 74, 140{\textendash}158 (1987)) to find the bandwidth of G. We show that this algorithm is wrong, and provide a corrected version of the same. Also, it was observed in [4] that the bandwidth of a proper interval graph can be computed in O(n log n + m) time. We show how this idea can be modified slightly to yield an O(n = m) algorithm.}, isbn = {0890-5401}, doi = {10.1016/0890-5401(91)90045-4}, url = {http://www.sciencedirect.com/science/article/pii/0890540191900454}, author = {Mahesh,R. and Rangan,C.Pandu and Srinivasan, Aravind} } @article {16764, title = {Incremental implementation model for relational databases with transaction time}, journal = {IEEE Transactions on Knowledge and Data Engineering}, volume = {3}, year = {1991}, month = {1991/12//}, pages = {461 - 473}, abstract = {An implementation model for the standard relational data model extended with transaction time is presented. The implementation model integrates techniques of view materialization, differential computation, and deferred update into a coherent whole. It is capable of storing any view (reflecting past or present states) and subsequently using stored views as outsets for incremental and decremental computations of requested views, making it more flexible than previously proposed partitioned storage models. The working and the expressiveness of the model are demonstrated by sample queries that show how historical data are retrieved}, keywords = {Computational modeling, Computer science, Data models, data retrieval, Database languages, Database systems, database theory, decremental computations, deferred update, Degradation, differential computation, historical data, History, incremental computations, Information retrieval, partitioned storage models, queries, relational data model, Relational databases, stored views, Transaction databases, transaction time, view materialization}, isbn = {1041-4347}, doi = {10.1109/69.109107}, author = {Jensen,C. S and Mark,L. and Roussopoulos, Nick} } @conference {14769, title = {The integration of application and system based metrics in a parallel program performance tool}, booktitle = {ACM Sigplan Notices}, volume = {26}, year = {1991}, month = {1991///}, pages = {189 - 200}, author = {Hollingsworth, Jeffrey K and Irvin, R. B and Miller, B. P} } @article {15971, title = {Memory, reason and time: the Step-Logic approach}, journal = {Philosophy and AI: Essays at the Interface}, year = {1991}, month = {1991///}, pages = {79 - 103}, author = {Elgot-drapkin,J. and Miller,M. and Perlis, Don} } @article {18079, title = {On parallel hashing and integer sorting}, journal = {Journal of Algorithms}, volume = {12}, year = {1991}, month = {1991///}, pages = {573 - 606}, author = {Matias,Y. and Vishkin, Uzi} } @article {18986, title = {Polyadenylylation in copia requires unusually distant upstream sequences}, journal = {Proceedings of the National Academy of SciencesPNAS}, volume = {88}, year = {1991}, month = {1991/04/15/}, pages = {3038 - 3042}, abstract = {Retroviruses and related genetic elements generate terminally redundant RNA products by differential polyadenylylation within a long terminal repeat. Expression of the white-apricot (wa) allele of Drosophila melanogaster, which carries an insertion of the 5.1-kilobase retrovirus-like transposable element copia in a small intron, is influenced by signals within copia. By using this indicator, we have isolated a 518-base-pair deletion, 312 base pairs upstream of the copia polyadenylylation site, that is phenotypically like much larger deletions and eliminates RNA species polyadenylylated in copia. This requirement of distant upstream sequences for copia polyadenylylation has implications for the expression of many genetic elements bearing long terminal repeats.}, isbn = {0027-8424, 1091-6490}, url = {http://www.pnas.org/content/88/8/3038}, author = {Kurkulos,M. and Weinberg,J. M. and Pepling,M. E. and Mount, Stephen M.} } @article {15575, title = {Pyramid computation of neighbor distance statistics in dot patterns}, journal = {CVGIP: Graphical Models and Image Processing}, volume = {53}, year = {1991}, month = {1991/07//}, pages = {373 - 381}, abstract = {This paper describes an algorithm for computing statistics of Voronoi neighbor distances in a dot pattern, using a cellular pyramid computer, in a logarithmic number of computational steps. Given a set of dots in a square region of the digital plane, the algorithm determines with high probability the Voronoi neighbors of the dots in the interior of the region and then computes statistics of the neighbor distances. An algorithm of this type may account for the ability of humans to perceive at a glance whether the dots in a pattern are randomly or regularly spaced, i.e., their neighbor distances have high or low variance.}, isbn = {1049-9652}, doi = {10.1016/1049-9652(91)90040-Q}, url = {http://www.sciencedirect.com/science/article/pii/104996529190040Q}, author = {Banerjee,Saibal and Mount, Dave and Rosenfeld,Azriel} } @article {15980, title = {Stop the world{\textemdash}I want to think}, journal = {International Journal of Intelligent Systems}, volume = {6}, year = {1991}, month = {1991///}, pages = {443 - 456}, author = {Perlis, Don and Elgot-Drapkin,J. J and Miller,M.} } @conference {18145, title = {Towards a theory of nearly constant time parallel algorithms}, booktitle = {Foundations of Computer Science, 1991. Proceedings., 32nd Annual Symposium on}, year = {1991}, month = {1991/10//}, pages = {698 - 710}, abstract = {It is demonstrated that randomization is an extremely powerful tool for designing very fast and efficient parallel algorithms. Specifically, a running time of O(lg* n) (nearly-constant), with high probability, is achieved using n/lg* n (optimal speedup) processors for a wide range of fundamental problems. Also given is a constant time algorithm which, using n processors, approximates the sum of n positive numbers to within an error which is smaller than the sum by an order of magnitude. A variety of known and new techniques are used. New techniques, which are of independent interest, include estimation of the size of a set in constant time for several settings, and ways for deriving superfast optimal algorithms from superfast nonoptimal ones}, keywords = {computational complexity, Estimation, nearly constant time parallel algorithms, Parallel algorithms, positive numbers, randomization, running time, superfast optimal algorithms}, doi = {10.1109/SFCS.1991.185438}, author = {Gil,J. and Matias,Y. and Vishkin, Uzi} } @article {15936, title = {Typicality constants and range defaults: Some pros and cons of a cognitive model of default reasoning}, journal = {Methodologies for Intelligent Systems}, year = {1991}, month = {1991///}, pages = {560 - 569}, author = {Miller,M. and Perlis, Don} } @article {18969, title = {Characterization of enhancer-of-white-apricot in Drosophila melanogaster.}, journal = {GeneticsGenetics}, volume = {126}, year = {1990}, month = {1990/12/01/}, pages = {1061 - 1069}, abstract = {The white-apricot (w(a)) allele differs from the wild-type white gene by the presence of the retrovirus-like transposable element copia within the transcription unit. Most RNAs derived from w(a) have 3{\textquoteright} termini within this insertion, and only small amounts of structurally normal RNA are produced. The activity of w(a) is reduced in trans by a semidominant mutation in the gene Enhancer-of-white-apricot (E(w(a)). Flies that are w(a) and heterozygous for the enhancer have eyes which are much lighter than the orange-yellow of w(a) alone while E(w(a)) homozygotes have white eyes. This semidominant effect on pigmentation is correlated with a corresponding decrease in white RNA having wild type structure, and flies homozygous for E(w(a)) have increased levels of aberrant RNAs. Three revertant alleles of E(w(a)) generated by reversion of the dominant enhancer phenotype with gamma radiation are noncomplementing recessive lethals, with death occurring during the larval stage. The effects on w(a) eye pigmentation of varying doses of the original E(w(a)) allele, the wild type allele, and the revertant alleles suggest that the original E(w(a)) allele produces a product that interferes with the activity of the wild type gene and that the revertants are null alleles. We propose that the E(w(a)) gene product influences the activity of the downstream copia long terminal repeat in 3{\textquoteright} end formation.}, isbn = {0016-6731, 1943-2631}, url = {http://www.genetics.org/content/126/4/1061}, author = {Peng,X. B. and Mount, Stephen M.} } @conference {16568, title = {Competitive learning using competitive activation rules}, booktitle = {Neural Networks, 1990., 1990 IJCNN International Joint Conference on}, year = {1990}, month = {1990///}, pages = {285 - 291}, author = {Sutton III,G. G. and Reggia, James A. and Maisog,J. M} } @article {18972, title = {Drosophila melanogaster genes for U1 snRNA variants and their expression during development}, journal = {Nucleic Acids ResearchNucl. Acids Res.}, volume = {18}, year = {1990}, month = {1990/01/01/}, pages = {6971 - 6979}, abstract = {We have cloned and characterized a complete set of seven U1-related sequences from Drosophila melanogaster. These sequences are located at the three cytogenetic loci 21D, 82E, and 95C. Three of these sequences have been previously studied: one U1 gene at 21D which encodes the prototype U1 sequence (U1a), one U1 gene at 82E which encodes a U1 variant with a single nucleotide substitution (1Mb), and a pseudogene at 82E. The four previously uncharacterized genes are another U1b gene at 82E, two additional U1 a genes at 95C, and a U1 gene at 95C which encodes a new variant (U1c) with a distinct single nucleotide change relative to U1a. Three blocks of 5' flanking sequence similarity are common to all six full length genes. Using specific primer extension assays, we have observed that the 1Mb RNA is expressed in Drosophila Kc cells and is associated with snRNP proteins, suggesting that the U1b-contalning snRNP particles are able to participate in the process of premRNA splicing. We have also examined the expression throughout Drosophila development of the two U1 variants relative to the prototype sequence. The U1c variant is undetectable by our methods, while the U1b variant exhibits a primarily embryonic pattern reminiscent of the expression of certain U1 variants in sea urchin, Xenopus, and mouse.}, isbn = {0305-1048, 1362-4962}, doi = {10.1093/nar/18.23.6971}, url = {http://nar.oxfordjournals.org/content/18/23/6971}, author = {Lo,Partick C. H. and Mount, Stephen M.} } @article {17139, title = {EVALUATING HYPERMEDIA SYSTEMS}, journal = {Human factors in computing systems: CHI{\textquoteright}90 Conference proceedings, April 1-5, Seattle}, year = {1990}, month = {1990///}, pages = {387 - 387}, author = {Ehrlich,K. and Microsytems,S. and Marchionini,G. and Nielsen,J. and Shneiderman, Ben} } @article {16730, title = {Information interchange between self-describing databases}, journal = {Information Systems}, volume = {15}, year = {1990}, month = {1990///}, pages = {393 - 400}, abstract = {Within the framework of a self-describing database system we describe a set of data management tools and a data dictionary supporting information interchange. The concepts are based on our experience from a project on standardized information interchange in NASA.}, isbn = {0306-4379}, doi = {16/0306-4379(90)90043-O}, url = {http://www.sciencedirect.com/science/article/pii/030643799090043O}, author = {Mark,Leo and Roussopoulos, Nick} } @article {16783, title = {Interoperability of multiple autonomous databases}, journal = {ACM Computing SurveysACM Comput. Surv.}, volume = {22}, year = {1990}, month = {1990/09//}, pages = {267 - 293}, isbn = {03600300}, doi = {10.1145/96602.96608}, url = {http://dl.acm.org/citation.cfm?id=96608}, author = {Litwin,Witold and Mark,Leo and Roussopoulos, Nick} } @article {15388, title = {Investigation of the threshold voltage of MOSFETs with position and potential-dependent interface trap distributions using a fixed-point iteration method}, journal = {Electron Devices, IEEE Transactions on}, volume = {37}, year = {1990}, month = {1990/04//}, pages = {1031 - 1038}, abstract = {Simulation results are presented for a MOSFET with position- and energy- (potential-) dependent interface trap distributions that may be typical for devices subjected to interface-trap-producing processes such as hot-electron degradation. The interface-trap distribution is modeled as a Gaussian peak at a given position along the channel, and the energy dependence is derived from C-V measurements from an MOS capacitor exposed to ionizing radiation. A novel fixed-point technique is used to solve the two-dimensional boundary-value problem. The technique is shown to be globally convergent for arbitrary distributions of interface traps. A comparison of the convergence properties of the Newton and fixed-point methods is presented, and it is shown that for some important cases the Newton technique fails to converge while the fixed-point technique converges with a geometric convergence rate}, keywords = {boundary-value, C-V, carriers;insulated, characteristics;Gaussian, Convergence, convergence;hot-electron, degradation;position, dependence;fixed-point, dependent, device, distribution;potential-dependent, distributions;simulation;threshold, effect, electron, field, gate, interface, iteration, method;fixed-point, methods;hot, methods;semiconductor, models;, numerical, of, peak;MOSFET;energy, problem;boundary-value, problems;convergence, rate;global, states;iterative, technique;geometric, transistors;interface, trap, voltage;two-dimensional}, isbn = {0018-9383}, doi = {10.1109/16.52438}, author = {Gaitan,M. and Mayergoyz, Issak D and Korman,C.E.} } @article {14791, title = {IPS-2: the second generation of a parallel program measurement system}, journal = {IEEE Transactions on Parallel and Distributed Systems}, volume = {1}, year = {1990}, month = {1990/04//}, pages = {206 - 217}, abstract = {IPS, a performance measurement system for parallel and distributed programs, is currently running on its second implementation. IPS{\textquoteright}s model of parallel programs uses knowledge about the semantics of a program{\textquoteright}s structure to provide two important features. First, IPS provides a large amount of performance data about the execution of a parallel program, and this information is organized so that access to it is easy and intuitive. Secondly, IPS provides performance analysis techniques that help to guide the programmer automatically to the location of program bottlenecks. The first implementation of IPS was a testbed for the basic design concepts, providing experience with a hierarchical program and measurement model, interactive program analysis, and automatic guidance techniques. It was built on the Charlotte distributed operating system. The second implementation, IPS-2, extends the basic system with new instrumentation techniques, an interactive and graphical user interface, and new automatic guidance analysis techniques. This implementation runs on 4.3BSD UNIX systems, on the VAX, DECstation, Sun 4, and Sequent Symmetry multiprocessor}, keywords = {4.3BSD UNIX systems, automatic guidance techniques, Automatic testing, Charlotte distributed operating system, CPA, DECstation, design concepts, distributed programs, graphical user interface, Graphical user interfaces, Instruments, interactive program analysis, IPS-2, measurement, message systems, network operating systems, Operating systems, parallel program measurement system, parallel programming, parallel programs, Performance analysis, performance analysis techniques, performance evaluation, performance measurement system, Power system modeling, program bottlenecks, program diagnostics, Programming profession, semantics, Sequent Symmetry multiprocessor, shared-memory systems, software tools, Springs, Sun, Sun 4, Unix, VAX}, isbn = {1045-9219}, doi = {10.1109/71.80132}, author = {Miller, B. P and Clark, M. and Hollingsworth, Jeffrey K and Kierstead, S. and Lim,S. -S and Torzewski, T.} } @article {15654, title = {The number of shortest paths on the surface of a polyhedron}, journal = {SIAM Journal on Computing}, volume = {19}, year = {1990}, month = {1990///}, pages = {593 - 593}, author = {Mount, Dave} } @article {15200, title = {On-line algorithms for weighted matching and stable marriages}, volume = {TR90-1143}, year = {1990}, month = {1990///}, institution = {Cornell University}, abstract = {We give an on-line deterministic algorithm for the bipartite weighted matching problem that achieves a competitive ratio of $O(n)$. In fact, this algorithm is almost optimal - the lower bound on the performance ratio of any deterministic online algorithm is $\Omega (n/ \sqrt{log n})$. We also study the stable marriage problem, where we are interested in the number of unstable pairs produced. We show that the simple "first come, first served" deterministic algorithm yields on the average $O(n$ log $n$) unstable pairs, but in the worst case no deterministic or randomized on-line algorithm can do better that $\Omega(n^{2})$ unstable pairs.}, author = {Khuller, Samir and Mitchell,S. G and Vazirani,V. V} } @article {15609, title = {Packing and covering the plane with translates of a convex polygon}, journal = {Journal of Algorithms}, volume = {11}, year = {1990}, month = {1990/12//}, pages = {564 - 580}, abstract = {A covering of the Euclidean plane by a polygon P is a system of translated copies of P whose union is the plane, and a packing of P in the plane is a system of translated copies of P whose interiors are disjoint. A lattice covering is a covering in which the translates are defined by the points of a lattice, and a lattice packing is defined similarly. We show that, given a convex polygon P with n vertices, the densest lattice packing of P in the plane can be found in O(n) time. We also show that the sparsest lattice covering of the plane by a centrally symmetric convex polygon can be solved in O(n) time. Our approach utilizes results from classical geometry that reduce these packing and covering problems to the problems of finding certain extremal enclosed figures within the polygon.}, isbn = {0196-6774}, doi = {10.1016/0196-6774(90)90010-C}, url = {http://www.sciencedirect.com/science/article/pii/019667749090010C}, author = {Mount, Dave and Silverman,Ruth} } @article {15398, title = {Parallel algorithm for the solution of nonlinear poisson equation of semiconductor device theory and its implementation on the IVIPP}, journal = {Journal of Parallel and Distributed Computing}, volume = {8}, year = {1990}, month = {1990/02//}, pages = {161 - 168}, abstract = {The solution of the nonlinear Poisson equation of semiconductor device theory is important for the design of submicron devices used in VLSI circuits. The conventional technique applied for the solution of this equation is based on the application of Newton{\textquoteright}s method to simultaneous discretized equations. This technique requires large computational and storage capacities to handle the fine meshes associated with the modeling of submicron semiconductor devices. A new algorithm for the numerical solution of this equation has recently been developed. One advantage that this algorithm has over conventional techniques is that it is inherently parallel, and is thus well suited to implementation on a computer with large parallelism. This paper describes the initial implementation and testing of this algorithm on NASA{\textquoteright}s Massively Parallel Processor (MPP).}, isbn = {0743-7315}, doi = {10.1016/0743-7315(90)90090-C}, url = {http://www.sciencedirect.com/science/article/pii/074373159090090C}, author = {Darling,J. P. and Mayergoyz, Issak D} } @article {18992, title = {Sequence of a cDNA from the Drosophila melanogaster white gene.}, journal = {Nucleic Acids ResearchNucleic Acids Res}, volume = {18}, year = {1990}, month = {1990/03/25/}, pages = {1633 - 1633}, isbn = {0305-1048}, url = {http://www.ncbi.nlm.nih.gov/pmc/articles/PMC330539/}, author = {Pepling,M and Mount, Stephen M.} } @article {19001, title = {Structure and expression of the Drosophila melanogaster gene for the U1 small nuclear ribonucleoprotein particle 70K protein.}, journal = {Molecular and Cellular BiologyMol. Cell. Biol.}, volume = {10}, year = {1990}, month = {1990/06/01/}, pages = {2492 - 2502}, abstract = {A genomic clone encoding the Drosophila U1 small nuclear ribonucleoprotein particle 70K protein was isolated by hybridization with a human U1 small nuclear ribonucleoprotein particle 70K protein cDNA. Southern blot and in situ hybridizations showed that this U1 70K gene is unique in the Drosophila genome, residing at cytological position 27D1,2. Polyadenylated transcripts of 1.9 and 3.1 kilobases were observed. While the 1.9-kilobase mRNA is always more abundant, the ratio of these two transcripts is developmentally regulated. Analysis of cDNA and genomic sequences indicated that these two RNAs encode an identical protein with a predicted molecular weight of 52,879. Comparison of the U1 70K proteins predicted from Drosophila, human, and Xenopus cDNAs revealed 68\% amino acid identity in the most amino-terminal 214 amino acids, which include a sequence motif common to many proteins which bind RNA. The carboxy-terminal half is less well conserved but is highly charged and contains distinctive arginine-rich regions in all three species. These arginine-rich regions contain stretches of arginine-serine dipeptides like those found in transformer, transformer-2, and suppressor-of-white-apricot proteins, all of which have been identified as regulators of mRNA splicing in Drosophila melanogaster.}, isbn = {0270-7306, 1098-5549}, doi = {10.1128/MCB.10.6.2492}, url = {http://mcb.asm.org/content/10/6/2492}, author = {Mancebo,R. and Lo,P. C. and Mount, Stephen M.} } @conference {16575, title = {Supervised and reinforced competitive learning}, booktitle = {Neural Networks, 1990., 1990 IJCNN International Joint Conference on}, year = {1990}, month = {1990///}, pages = {563 - 567}, author = {Sutton III,G. G. and Reggia, James A. and Maisog,J. M} } @article {15202, title = {On a triangle counting problem}, journal = {Information Processing Letters}, volume = {33}, year = {1990}, month = {1990/02/10/}, pages = {319 - 321}, abstract = {We consider the following problem: given a set S of n points in the plane, we would like to compute for each point pϵS, how many triangles with corners at points in set S contain p. We give an O(n2) algorithm to solve the problem.}, keywords = {combinatorics, computational geometry, Range query}, isbn = {0020-0190}, doi = {10.1016/0020-0190(90)90217-L}, url = {http://www.sciencedirect.com/science/article/pii/002001909090217L}, author = {Khuller, Samir and Mitchell,Joseph S.B.} } @article {17115, title = {Dynamic versus static menus: an exploratory comparison}, journal = {ACM SIGCHI Bulletin}, volume = {20}, year = {1989}, month = {1989/04//}, pages = {33 - 37}, abstract = {Sixty-three subjects completed 24 tasks using a menu driven computer program. The menu items appeared in a fixed (static) order during 12 of the tasks. During the other 12 tasks the menu item order changed dynamically such that the most frequently selected items always appeared at the top of the menu. All the subjects tried both dynamic and static menus.The subjects that used adaptive dynamic menus for the first set of tasks were significantly slower than those who used static menus on the first set of tasks. Subjects{\textquoteright} performance during the second set of tasks was not affected by menu style. Eighty-one percent of the subjects preferred working with static menus to working with dynamic menus.}, isbn = {0736-6906}, doi = {10.1145/67243.67247}, url = {http://doi.acm.org/10.1145/67243.67247}, author = {Mitchell,J. and Shneiderman, Ben} } @article {15373, title = {A numerical analysis for the small-signal response of the MOS capacitor}, journal = {Solid-State Electronics}, volume = {32}, year = {1989}, month = {1989/03//}, pages = {207 - 213}, abstract = {Simulation results for the small-signal sinusoidal steady-state response of the MOS capacitor using time perturbation analysis of the basic semiconductor equations are presented. The effects of interface and bulk trap dynamics are included. The model uses Fermi-Dirac statistics and Shockley-Read-Hall recombination to describe the traps. This analysis is an improvement over previous techniques since it can simulate the effect of trap dynamics on the small-signal sinusoidal steady-state response of a semiconductor device with arbitrary geometry, doping and trap distributions.}, isbn = {0038-1101}, doi = {10.1016/0038-1101(89)90093-2}, url = {http://www.sciencedirect.com/science/article/pii/0038110189900932}, author = {Gaitan,Michael and Mayergoyz, Issak D} } @article {16517, title = {Competitive dynamics in a dual-route connectionist model of print-to-sound transformation}, journal = {Complex Systems}, volume = {2}, year = {1988}, month = {1988///}, pages = {509 - 547}, author = {Reggia, James A. and Marsland,P. M and Berndt,R. S} } @article {15653, title = {The decomposition of a rectangle into rectangles of minimal perimeter}, journal = {SIAM Journal on Computing}, volume = {17}, year = {1988}, month = {1988///}, pages = {1215 - 1215}, abstract = {This paper solves the problem of subdividing a unit square into p rectangles of area 1/p in such a way that the maximal perimeter of a rectangle is as small as possible. The correctness of the solution is proved using the well-known theorems of Menger and Dilworth.}, author = {Kong,T.Y and Mount, Dave and Roscoe,AW} } @article {16745, title = {Expert database systems: Efficient support for engineering environments}, journal = {Data \& Knowledge Engineering}, volume = {3}, year = {1988}, month = {1988/09//}, pages = {71 - 85}, abstract = {Manufacturing and Engineering processes use both large scale data and knowledge bases, and the use of expert systems in such environments has become a necessity. Expert Database Systems have evolved from conventional database systems to meet the requirements of current Artificial Intelligence applications. However, future Expert Database Systems will contain knowledge bases of significant size which makes main memory insufficient and the use of a database system a necessity. We propose an effective way of building High Performance Expert Database Systems to support manufacturing and engineering environments. These systems are based on Incremental Computation Models; such models utilize results of previous computations by merging them with newly derived results of computations on small increments representing changes in the database. Our system will be able to support very large knowledge bases by utilizing novel structures and access methods and by using a very sophisticated inference engine based on incremental computation models.}, keywords = {engineering databases, Expert database systems, high performance systems, incremental computation models}, isbn = {0169-023X}, doi = {16/0169-023X(88)90007-9}, url = {http://www.sciencedirect.com/science/article/pii/0169023X88900079}, author = {Sellis,T. and Roussopoulos, Nick and Mark,L. and Faloutsos,C.} } @article {18090, title = {On finding a minimum dominating set in a tournament}, journal = {Theoretical Computer Science}, volume = {61}, year = {1988}, month = {1988///}, pages = {307 - 316}, author = {Megiddo,N. and Vishkin, Uzi} } @article {17164, title = {Finding facts vs. browsing knowledge in hypertext systems}, journal = {Computer}, volume = {21}, year = {1988}, month = {1988/01//}, pages = {70 - 80}, abstract = {The authors discuss the role of information retrieval, interface design, and cognitive science in hypertext research. They present a user-centered framework for information-seeking that has been used in evaluating two hypertext systems. They apply the framework to key design issues related to information retrieval in hypertext systems.<>}, keywords = {browsing knowledge, Cognitive science, cognitive systems, Electronic publishing, hypertext research, hypertext systems, Information retrieval, information retrieval systems, information-seeking, interface design, User interfaces, word processing}, isbn = {0018-9162}, doi = {10.1109/2.222119}, author = {Marchionini,G. and Shneiderman, Ben} } @conference {15637, title = {Globally-Equiangular triangulations of co-circular points in 0(n log n) time}, booktitle = {Proceedings of the fourth annual symposium on Computational geometry}, series = {SCG {\textquoteright}88}, year = {1988}, month = {1988///}, pages = {143 - 152}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, isbn = {0-89791-270-5}, doi = {10.1145/73393.73408}, url = {http://doi.acm.org/10.1145/73393.73408}, author = {Mount, Dave and Saalfeld,A.} } @article {18985, title = {Partial Revertants of the Transposable Element-Associated Suppressible Allele White-Apricot in Drosophila Melanogaster: Structures and Responsiveness to Genetic Modifiers}, journal = {GeneticsGenetics}, volume = {118}, year = {1988}, month = {1988/02//}, pages = {221 - 234}, abstract = {The eye color phenotype of white-apricot (w(a)), a mutant allele of the white locus caused by the insertion of the transposable element copia into a small intron, is suppressed by the extragenic suppressor suppressor-of-white-apricot (su(w(a))) and enhanced by the extragenic enhancers suppressor-of-forked su(f)) and Enhancer-of-white-apricot (E(w(a))). Derivatives of w(a) have been analyzed molecularly and genetically in order to correlate the structure of these derivatives with their response to modifiers. Derivatives in which the copia element is replaced precisely by a solo long terminal repeat (sLTR) were generated in vitro and returned to the germline by P-element mediated transformation; flies carrying this allele within a P transposon show a nearly wild-type phenotype and no response to either su(f) or su(w(a)). In addition, eleven partial phenotypic revertants of w(a) were analyzed. Of these, one appears to be a duplication of a large region which includes w(a), three are new alleles of su(w(a)), two are sLTR derivatives whose properties confirm results obtained using transformation, and five are secondary insertions into the copia element within w(a). One of these, w(aR84h), differs from w(a) by the insertion of the most 3{\textquoteright} 83 nucleotides of the I factor. The five insertion derivatives show a variety of phenotypes and modes of interaction with su((f) and su(w(a)). The eye pigmentation of w(aR84h) is affected by su(f) and E(w(a)), but not su(w(a)). These results demonstrate that copia (as opposed to the interruption of white sequences) is essential for the w(a) phenotype and its response to genetic modifiers, and that there are multiple mechanisms for the alteration of the w(a) phenotype by modifiers.}, isbn = {0016-6731}, url = {http://www.ncbi.nlm.nih.gov/pmc/articles/PMC1203276/}, author = {Mount, Stephen M. and Green,M. M. and Rubin,G. M.} } @article {15615, title = {A united approach to finding enclosing and enclosed triangles}, journal = {Proceedings of 26th Allerton Conference on Communication, Control and Computing}, year = {1988}, month = {1988///}, author = {Mount, Dave and Chandran,S.} } @book {17471, title = {User interface strategies {\textquoteright}88 (videotape)}, year = {1988}, month = {1988///}, publisher = {University of Maryland at College Park}, organization = {University of Maryland at College Park}, address = {College Park, MD, USA}, author = {Shneiderman, Ben and Malone,Thomas and Norman,Donald and Foley,James} } @conference {15618, title = {Algorithms for covering and packing and applications to CAD/CAM (abstract only): preliminary results}, booktitle = {Proceedings of the 15th annual conference on Computer Science}, series = {CSC {\textquoteright}87}, year = {1987}, month = {1987///}, pages = {439{\textendash} - 439{\textendash}}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Computational geometry deals with the computational complexity of geometric problems within the framework of the analysis of algorithms. Numerous applications have been found to computer graphics, computer-aided design, pattern recognition and robotics.Among the geometric problems are bin packing problems. C.A. Roger {\textquotedblleft}Packing and Covering{\textquotedblright}, Cambridge University Press (1964) studied these problems. Many of these are hard problems, and very few have been solved. Some packing problems are the restriction of a very interesting problem in CAM (computer-aided manufacture). In the manufacture of clothing, certain parts, such as sleeves, are laid out as repeated polygonal copies and combinations on a bolt of cloth. This pattern layout is traditionally (and currently) done by hand. It{\textquoteright}s a candidate for automation. We propose some special cases of this problem whose solution can be extended to practical use. We are working on several geometric questions involving packing translations of objects. Classical results in mathematics demonstrate equivalence between certain packing problems and finding optimal enclosed figures. J. O{\textquoteright}Rourke et al [{\textquotedblleft}An optimal algorithm for finding minimal enclosing triangles{\textquotedblright}, J. of Algorithms 7, 258-264 (1986)], as well as V. Klee and M. Laskowski [{\textquotedblleft}Finding the smallest triangles containing a given convex polygon{\textquotedblright}, J. of Algorithms 6, 359-375 (1985)] have produced algorithms for finding a smallest area triangle containing (or enclosing) a given polygon. Smallest area convex polygons of a certain type, containing a given set, can be viewed as larger pieces of fabric containing pattern to be cut out. We have an optimal algorithm for finding largest enclosed polygons for a given set. We also have preliminary results for smallest enclosing polygons. These results have theoretical interest, and have applications to robotics and collision avoidance, as well as to manufacture. }, isbn = {0-89791-218-7}, doi = {10.1145/322917.323100}, url = {http://doi.acm.org/10.1145/322917.323100}, author = {Mount, Dave and Silverman,Ruth} } @conference {17029, title = {Computer-supported cooperative work (panel): is this REALLY a new field of research?}, booktitle = {Proceedings of the SIGCHI/GI conference on Human factors in computing systems and graphics interface}, series = {CHI {\textquoteright}87}, year = {1987}, month = {1987///}, pages = {227 - 228}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, isbn = {0-89791-213-6}, doi = {10.1145/29933.275634}, url = {http://doi.acm.org/10.1145/29933.275634}, author = {Greif,Irene and Curtis,Bill and Krasner,Herb and Malone,Thomas W. and Shneiderman, Ben} } @article {15584, title = {The decomposition of a square into rectangles of minimal perimeter}, journal = {Discrete Applied Mathematics}, volume = {16}, year = {1987}, month = {1987/03//}, pages = {239 - 243}, abstract = {This paper solves the problem of subdividing a unit square into p rectangles of area 1/p in such a way that the maximal perimeter of a rectangle is as small as possible. The correctness of the solution is proved using the well-known theorems of Menger and Dilworth.}, isbn = {0166-218X}, doi = {10.1016/0166-218X(87)90061-8}, url = {http://www.sciencedirect.com/science/article/pii/0166218X87900618}, author = {Kong,T.Y and Mount, Dave and Werman,Michael} } @article {15655, title = {THE DISCRETE GEODESIC PROBLEM}, journal = {SIAM Journal on Computing (SICOMP)}, volume = {16}, year = {1987}, month = {1987///}, abstract = {We presentan algorithm for determining the shortest path between a source and a destinationon an arbitrary (possibly nonconvex) polyhedralsurface. The path is constrained to lie on the surface, and distances are measured according to the Euclidean metric. Our algorithm runs in time O(n log n) and requires O(n2) space, where n is the number of edges of the surface. After we run our algorithm, the distance from the source to any other destination may be determined using standard techniques in time O(log n) by locating the destination in the subdivision created by the algorithm. The actual shortest path from the source to a destination can bereported in time O(k+log n), where k is the number of faces crossed by the path. The algorithm generalizes to the case of multiple source points to build the Voronoi diagram on the surface, where n is now the maximum of the number of vertices and the number of sources. }, author = {JOSEPH,SB and Mount, Dave and Papadimitriou,C. H} } @conference {15940, title = {Life on a desert island}, booktitle = {Proc. Workshop on The Frame Problem in Artificial Intelligence}, year = {1987}, month = {1987///}, pages = {349 - 357}, author = {Drapkin,J. and Miller,M. and Perlis, Don} } @article {16811, title = {Meta-Data Management.}, volume = {ISR-TR-1987-31}, year = {1987}, month = {1987///}, institution = {Institute for Systems Research, University of Maryland, College Park}, abstract = {A database system should support a rich variety of meta-data describing and controlling the management and use of data. Few present database systems provide even rudimentary integrated meta-data management facilities.}, keywords = {Technical Report}, url = {http://drum.lib.umd.edu//handle/1903/4540}, author = {Mark,Leo and Roussopoulos, Nick} } @conference {15587, title = {An output sensitive algorithm for computing visibility graphs}, booktitle = {Foundations of Computer Science, 1987., 28th Annual Symposium on}, year = {1987}, month = {1987/10//}, pages = {11 - 19}, abstract = {The visibility graph of a set of nonintersecting polygonal obstacles in the plane is an undirected graph whose vertices are the vertices of the obstacles and whose edges are pairs of vertices (u, v) such that the open line segment between u and v does not intersect any of the obstacles. The visibility graph is an important combinatorial structure in computational geometry and is used in applications such as solving visibility problems and computing shortest paths. An algorithm is presented that computes the visibility graph of s set of obstacles in time O(E + n log n), where E is the number of edges in the visibility graph and n is the total number of vertices in all the obstacles.}, doi = {10.1109/SFCS.1987.6}, author = {Ghosh,Subir Kumar and Mount, Dave} } @article {15999, title = {Proving self-utterances}, journal = {Journal of Automated Reasoning}, volume = {3}, year = {1987}, month = {1987///}, pages = {329 - 338}, author = {Miller,M. and Perlis, Don} } @article {18994, title = {Sequence similarity}, journal = {Nature}, volume = {325}, year = {1987}, month = {1987/02/05/}, pages = {487 - 487}, doi = {10.1038/325487c0}, url = {http://www.nature.com/nature/journal/v325/n6104/abs/325487c0.html}, author = {Mount, Stephen M.} } @article {15595, title = {Shared memory algorithms and the medial axis transform}, journal = {IEEE Workshop on Computer Architecture for PAMI}, year = {1987}, month = {1987///}, pages = {44 - 50}, author = {Chandran,S. and Mount, Dave} } @article {15582, title = {Storing the subdivision of a polyhedral surface}, journal = {Discrete \& Computational Geometry}, volume = {2}, year = {1987}, month = {1987///}, pages = {153 - 174}, abstract = {A common structure arising in computational geometry is the subdivision of a plane defined by the faces of a straight-line planar graph. We consider a natural generalization of this structure on a polyhedral surface. The regions of the subdivision are bounded by geodesics on the surface of the polyhedron. A method is given for representing such a subdivision that is efficient both with respect to space and the time required to answer a number of different queries involving the subdivision. For example, given a pointx on the surface of the polyhedron, the region of the subdivision containingx can be determined in logarithmic time. Ifn denotes the number of edges in the polyhedron,m denotes the number of geodesics in the subdivision, andK denotes the number of intersections between edges and geodesics, then the space required by the data structure isO((n +m) log(n +m)), and the structure can be built inO(K + (n +m) log(n +m)) time. Combined with existing algorithms for computing Voronoi diagrams on the surface of polyhedra, this structure provides an efficient solution to the nearest-neighbor query problem on polyhedral surfaces.}, doi = {10.1007/BF02187877}, author = {Mount, Dave} } @article {15409, title = {TIME PERTURBATION ANALYSIS FOR THE MOS SYSTEM}, journal = {COMPEL: The International Journal for Computation and Mathematics in Electrical and Electronic Engineering}, volume = {6}, year = {1987}, month = {1987/12/31/}, pages = {77 - 83}, abstract = {The development of a numerical implementation of the small signal response of the MOS (Metal-Oxide-Silicon) capacitor using time perturbation analysis is discussed. The effects of nonconstant doping profiles and interface and bulk traps are included. The model uses Fermi-Dirac statistics to describe the occupancy of the interface and bulk traps. The oxide region is considered to have no mobile carriers and any fixed oxide charge distribution is modeled as a charge sheet at the Si-SiO2 interface. This technique can be used to find the small signal response of the device from the static solution.}, isbn = {0332-1649}, doi = {10.1108/eb010305}, url = {http://www.emeraldinsight.com/journals.htm?issn=0332-1649\&volume=6\&issue=2\&articleid=1672728\&articletitle=TIME+PERTURBATION+ANALYSIS+FOR+THE+MOS+SYSTEM\&}, author = {Gaitan,Michael and Mayergoyz, Issak D} } @article {16015, title = {Completeness results for circumscription}, journal = {Artificial Intelligence}, volume = {28}, year = {1986}, month = {1986/02//}, pages = {29 - 42}, abstract = {We investigate the model theory of the notion of circumscription, and find completeness theorems that provide a partial converse to a result of McCarthy. We show that the circumscriptive theorems are precisely the truths of the minimal models, in the case of various classes of theories, and for various versions of circumscription. We also present an example of commonsense reasoning in which first-order circumscription does not achieve the intuitive and desired minimization.}, isbn = {0004-3702}, doi = {16/0004-3702(86)90029-9}, url = {http://www.sciencedirect.com/science/article/pii/0004370286900299}, author = {Perlis, Don and Minker, Jack} } @article {17057, title = {Design and research on the interactive encyclopedia system (TIES)}, journal = {Proc. 29th Conference of the Association for the Development of Computer Based Instructional Systems}, year = {1986}, month = {1986///}, pages = {19 - 21}, abstract = {Printed books were an enormous stimulus to science, culture, commerce, and entertainment. Electronic books and hypertext systems may produce a similar stimulus in the next century, but current designs are poor. Typical screens are too small, too slow, too complicated, and too hard to read. With careful attention to the user interface and the underlying technology, we have a chance to create a new medium that is potentially more attractive and effective than printed books in many situations.}, author = {Morariu,J. and Shneiderman, Ben} } @article {16967, title = {An experimental comparison of a mouse and arrow-jump keys for an interactive encyclopedia}, journal = {International Journal of Man-Machine Studies}, volume = {24}, year = {1986}, month = {1986/01//}, pages = {29 - 45}, abstract = {This paper reports on an experiment which was conducted to examine relative merits of using a mouse or arrow-jump keys to select text in an interactive encyclopedia. Timed path traversais were performed by subjects using each device, and were followed by subjective questions. Personality and background of the subjects were recorded to see if those attributes would affect device preference and performance. The arrow-jump keys were found to have the quickest traversal times for paths with either short or long target distances. The subjective responses indicated that the arrow-jump method was overwhelmingly preferred over the mouse method. Personality type was not found to play a critical role.}, isbn = {0020-7373}, doi = {10.1016/S0020-7373(86)80038-4}, url = {http://www.sciencedirect.com/science/article/pii/S0020737386800384}, author = {Ewing,John and Mehrabanzad,Simin and Sheck,Scott and Ostroff,Dan and Shneiderman, Ben} } @article {17274, title = {Learning disabled students{\textquoteright} difficulties in learning to use a word processor: implications for design}, journal = {ACM SIGCHI Bulletin}, volume = {17}, year = {1986}, month = {1986/01//}, pages = {41 - 46}, abstract = {Learning disabled students can derive great benefits from using work processors. The ability to produce a neat, printed copy can increase motivation and encourage writing for a wider audience. The editing power makes revision possible without tedious re-copying, thus freeing students and teachers to approach writing as a process involving repeated drafts. Specific problems with handwriting and spelling can also be circumvented. However, learning to use the editing capabilities often presents problems for students, especially those with learning difficulties. Word processors must be designed that are simple, easy to learn, and yet powerful. This study makes software design recommendations based on a study of learning disabled students learning to use word processing.Two groups of four LD students (4th-6th grade) were given twelve hours of word processing instruction using two word processors. Detailed records of progess and errors were made during learning and a final assessment task. Specific design problems are reported and recommendations are made for tasks such as cursor movement, insertion/deletion, use of nulls, blanks, and formatting characters, and overall organization.}, isbn = {0736-6906}, doi = {10.1145/15671.15675}, url = {http://doi.acm.org/10.1145/15671.15675}, author = {MacArthur,Charles A. and Shneiderman, Ben} } @article {17275, title = {Learning Disabled Students{\textquoteright} Difficulties in Learning to Use A Word Processor: Implications for Instruction and Software Evaluation}, journal = {Journal of Learning DisabilitiesJ Learn Disabil}, volume = {19}, year = {1986}, month = {1986/04/01/}, pages = {248 - 253}, abstract = {Learning disabled (LD) students can derive great benefits from using word processors. The ability to produce a neat, printed copy can increase motivation and encourage writing for a wider audience. The editing power makes revision possible without tedious recopying, thus freeing students and teachers to approach writing as a process involving repeated drafts. Specific problems with handwriting and spelling can also be circumvented. However, learning to use a word processor often presents problems. Based on a study of LD students learning to use word processing, this paper makes recommendations for evaluating word processing software and designing instruction that is sensitive to students difficulties.}, isbn = {0022-2194,}, doi = {10.1177/002221948601900414}, url = {http://ldx.sagepub.com/content/19/4/248}, author = {MacArthur,Charles A. and Shneiderman, Ben} } @article {18105, title = {Parallel ear decomposition search (EDS) and st-numbering in graphs}, journal = {Theoretical Computer Science}, volume = {47}, year = {1986}, month = {1986///}, pages = {277 - 298}, author = {Maon,Y. and Schieber,B. and Vishkin, Uzi} } @conference {16004, title = {A Parallel Self-Modifying Default Reasoning System}, booktitle = {AAAI}, year = {1986}, month = {1986///}, pages = {923 - 927}, author = {Minker, Jack and Perlis, Don and Subramanian,K.} } @article {18970, title = {Complete nucleotide sequence of the Drosophila transposable element copia: homology between copia and retroviral proteins.}, journal = {Molecular and Cellular BiologyMol. Cell. Biol.}, volume = {5}, year = {1985}, month = {1985/07/01/}, pages = {1630 - 1638}, abstract = {We have determined the complete nucleotide sequence of the copia element present at the white-apricot allele of the white locus in Drosophila melanogaster. This transposable element is 5,146 nucleotides long and contains a single long open reading frame of 4,227 nucleotides. Analysis of the coding potential of the large open reading frame, which appears to encode a polyprotein, revealed weak homology to a number of retroviral proteins, including a protease, nucleic acid-binding protein, and reverse transcriptase. Better homology existed between another part of the copia open reading frame and a region of the retroviral pol gene recently shown to be distinct from reverse transcriptase and required for the integration of circular DNA forms of the retroviral genome to form proviruses. Comparison of the copia sequence with those of the Saccharomyces cerevisiae transposable element Ty, several vertebrate retroviruses, and the D. melanogaster copia-like element 17.6 showed that Ty was most similar to copia, sharing amino acid sequence homology and organizational features not found in the other genetic elements.}, isbn = {0270-7306, 1098-5549}, doi = {10.1128/MCB.5.7.1630}, url = {http://mcb.asm.org/content/5/7/1630}, author = {Mount, Stephen M. and Rubin,G. M.} } @article {16011, title = {Computing protected circumscription}, journal = {The Journal of Logic Programming}, volume = {2}, year = {1985}, month = {1985///}, pages = {235 - 249}, author = {Minker, Jack and Perlis, Don} } @conference {18439, title = {The Engineering of an Environment on Small Machines}, booktitle = {Proceedings of the IEEE 1st International Conference on Computer Workstations}, year = {1985}, month = {1985///}, pages = {61 - 69}, author = {Zelkowitz, Marvin V and Elgot,J. and Itkin,D. and Kowalchack,B. and Maggio,M.} } @article {15671, title = {On Finding Shortest Paths on Convex Polyhedra.}, year = {1985}, month = {1985/05//}, institution = {CENTER FOR AUTOMATION RESEARCH, UNIVERSITY OF MARYLAND COLLEGE PARK}, abstract = {Applications in robotics and autonomous navigation have motivated the study of motion planning and obstacle avoidance algorithms. The special case considered here is that of moving a point (the object) along the surface of a convex polyhedron (the obstacle) with n vertices. Sharir and Schorr have developed an algorithm that, given a source point on the surface of a convex polyhedron, determines the shortest path from the source to any point on the polyhedron in linear time after O(n cubed log n) preprocessing time. The preprocessed output requires O(n squared) space. By using known algorithms for fast planar point location, the shortest path query time for Sharir and Schorr{\textquoteright}s algorithm is shown to be O(k + log n) where k is the number faces traversed by the path. We give an improved preprocessing algorithm that runs in O(n squared log n) time requiring the same query time and space. We also show how to store the output of the preprocessing algorithm in O(n log n) space while maintaining the same query time. (Author)}, keywords = {*ALGORITHMS, *POLYGONS, *Polyhedrons, *PREPROCESSING, AUTONOMOUS NAVIGATION, AVOIDANCE., BARRIERS, INTERROGATION, MOTION, output, PATHS, PE61102F, planning, POSITION(LOCATION), ROBOTICS, THEORETICAL MATHEMATICS, TIME}, url = {http://stinet.dtic.mil/oai/oai?\&verb=getRecord\&metadataPrefix=html\&identifier=ADA166246}, author = {Mount, Dave} } @article {16752, title = {Schema manipulation in self-describing and self-documenting data models}, journal = {International Journal of Parallel Programming}, volume = {14}, year = {1985}, month = {1985///}, pages = {1 - 28}, author = {Roussopoulos, Nick and Mark,L.} } @article {16786, title = {SELF-DESCRIBING AND SELF-DOCUMENTING DATABASE SYSTEMS}, journal = {Languages for automation}, year = {1985}, month = {1985///}, pages = {275 - 275}, author = {Roussopoulos, Nick and Mark,L.} } @article {15672, title = {Voronoi Diagrams on the Surface of a Polyhedron.}, year = {1985}, month = {1985/05//}, institution = {CENTER FOR AUTOMATION RESEARCH, UNIVERSITY OF MARYLAND COLLEGE PARK}, abstract = {This document presents an algorithm that computes the Voronol diagram of a set of point lying on the surface of a possibly nonconvex polyhedron. Distances are measured in the Euclidean metric along the surface of the polyhedron. The algorithm runs in O(n squared log n) time and requires O(n squared) space to store the final data structure, where n is the maximum of the number of edges and source points on the polyhedron. This algorithm generalizes or improves the running times of a number of shortest path problems both on polyhedra and in the plane amidst polygonal obstacles. By applying standard algorithms for point location, we can determine the distance from a query point to the nearest source in O(log n) time and can list the shortest path in O(k + log n) time, where k is the number of faces traversed by the path. The algorithm achieves its efficiency by a novel method of searching the polyhedron{\textquoteright}s surface. (Author)}, keywords = {*POLYGONS, *Polyhedrons, algorithms, DIAGRAMS., EDGES, INTERROGATION, PATHS, PE61102F, POSITION(LOCATION), SURFACES, THEORETICAL MATHEMATICS, WUAFOSR2304A7}, url = {http://stinet.dtic.mil/oai/oai?\&verb=getRecord\&metadataPrefix=html\&identifier=ADA166220}, author = {Mount, Dave} } @conference {16001, title = {Applications or Protected Circumscription}, booktitle = {7th International Conference on Automated Deduction, Napa, California, USA, May 14-16, 1984: proceedings}, volume = {170}, year = {1984}, month = {1984///}, pages = {414 - 414}, author = {Minter,J. and Perlis, Don} } @conference {16733, title = {A framework for self-describing and self-documenting database systems}, booktitle = {NBS Trends and Application Conference}, year = {1984}, month = {1984///}, author = {Roussopoulos, Nick and Mark,L.} } @conference {16813, title = {A Programming Environment Framework Based on Reusability}, booktitle = {Proceedings of the First International Conference on Data Engineering}, year = {1984}, month = {1984///}, pages = {277 - 280}, publisher = {IEEE Computer Society}, organization = {IEEE Computer Society}, address = {Washington, DC, USA}, isbn = {0-8186-0533-2}, url = {http://dl.acm.org/citation.cfm?id=645470.655219}, author = {Yeh,Raymond T. and Mittermeir,Roland and Roussopoulos, Nick and Reed,Joylyn} } @conference {15927, title = {Protected circumscription}, booktitle = {Proc. Workshop on Non-Monotonic Reasoning}, year = {1984}, month = {1984///}, pages = {337 - 343}, author = {Minker, Jack and Perlis, Don} } @article {18129, title = {Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories}, journal = {Acta Informatica}, volume = {21}, year = {1984}, month = {1984///}, pages = {339 - 374}, author = {Mehlhorn,K. and Vishkin, Uzi} } @article {18991, title = {RNA splicing and the involvement of small ribonucleoproteins}, journal = {Modern cell biology}, volume = {3}, year = {1984}, month = {1984///}, pages = {249 - 297}, keywords = {Article synth{\`e}se, Articulo sintesis, review, Ribonucleoprotein, Ribonucleoproteina, Ribonucl{\'e}oprot{\'e}ine, RNA, Sn-RNA, splicing}, isbn = {0745-3000}, url = {http://cat.inist.fr/?aModele=afficheN\&cpsidt=9051421}, author = {Mount, Stephen M. and Steitz,J. A.} } @article {16582, title = {SLIPS}, journal = {Journal of Medical Systems}, volume = {8}, year = {1984}, month = {1984///}, pages = {197 - 204}, author = {Morris,M. S and Reggia, James A. and Ahuja,S. B and Hart,J. and Watson,V.} } @article {16963, title = {An empirical comparison of two PLATO text editors.}, journal = {Journal of Computer-Based Instruction}, volume = {10}, year = {1983}, month = {1983///}, pages = {43 - 50}, abstract = {Two PLATO system text editors were evaluated with 14 nonprogrammers and 14 programmers who were either university staff or college students. Half of each group learned the "plain" editor, which had 8 commands and 3 screens of HELP material; while the other half of each group learned the "fancy" editor, which had 15 commands and 1 screen of HELP material. The fancy editor is a subset of the widely used TUTOR editor, but nonprogrammers preferred the plain editor. Faster learning, faster performance, fewer invocations of HELP material, and fewer requests for human assistance were characteristic of the plain editor.}, author = {Shneiderman, Ben and Hill,R. and Jacob,R. and Mah,W.} } @article {17328, title = {Program indentation and comprehensibility}, journal = {Communications of the ACM}, volume = {26}, year = {1983}, month = {1983/11//}, pages = {861 - 867}, keywords = {indentation, program format, program readability}, isbn = {0001-0782}, doi = {10.1145/182.358437}, url = {http://doi.acm.org/10.1145/182.358437}, author = {Miara,Richard J. and Musselman,Joyce A. and Navarro,Juan A. and Shneiderman, Ben} } @article {18988, title = {Pseudogenes for human small nuclear RNA U3 appear to arise by integration of self-primed reverse transcripts of the RNA into new chromosomal sites}, journal = {CellCell}, volume = {32}, year = {1983}, month = {1983/02//}, pages = {461 - 472}, abstract = {We find that both human and rat U3 snRNA can function as self-priming templates for AMV reverse transcriptase in vitro. The 74 base cDNA is primed by the 3{\textquoteright} end of intact U3 snRNA, and spans the characteristically truncated 69 or 70 base U3 sequence found in four different human U3 pseudogenes. The ability of human and rat U3 snRNA to self-prime is consistent with a U3 secondary structure model derived by a comparison between rat U3 snRNA and the homologous D2 snRNA from Dictyostelium discoideum. We propose that U3 pseudogenes are generated in vivo by integration of a self-primed cDNA copy of U3 snRNA at new chromosomal sites. We also consider the possibility that the same cDNA mediates gene conversion at the 5{\textquoteright} end of bona fide U3 genes where, over the entire region spanned by the U3 cDNA, the two rat U3 sequence variants U3A and U3B are identical.}, keywords = {Animals, Base Sequence, DNA, genes, HUMANS, Nucleic Acid Conformation, Rats, Recombination, Genetic, Repetitive Sequences, Nucleic Acid, RNA, RNA, Small Nuclear, RNA-Directed DNA Polymerase, Templates, Genetic, Transcription, Genetic}, isbn = {0092-8674}, url = {http://www.ncbi.nlm.nih.gov/pubmed/6186397}, author = {Bernstein,L B and Mount, Stephen M. and Weiner,A M} } @article {18981, title = {RNA processing: Lessons from mutant globins}, journal = {Nature}, volume = {303}, year = {1983}, month = {1983/06/02/}, pages = {380 - 381}, isbn = {0028-0836}, doi = {10.1038/303380a0}, url = {http://ukpmc.ac.uk/abstract/MED/6855891/reload=0;jsessionid=6LgsyNwDXt7LrUcZkgTq.12}, author = {Mount, Stephen M. and Steitz,Joan} } @article {18962, title = {RNA processing: Sequences that signal where to splice}, journal = {Nature}, volume = {304}, year = {1983}, month = {1983///}, pages = {309 - 310}, author = {Mount, Stephen M.} } @conference {16723, title = {A self-describing meta-schema for the RM/T data model}, booktitle = {IEEE Workshop On Languages for Automation, IEEE Computer Society Press}, year = {1983}, month = {1983///}, author = {Roussopoulos, Nick and Mark,L.} } @article {18996, title = {Small Ribonucleoproteins from Eukaryotes: Structures and Roles in RNA Biogenesis}, journal = {Cold Spring Harbor Symposia on Quantitative BiologyCold Spring Harb Symp Quant Biol}, volume = {47}, year = {1983}, month = {1983/01/01/}, pages = {893 - 900}, abstract = {Detailed reviews describing work presented at the annual Cold Spring Harbor Symposia on Quantitative Biology}, isbn = {0091-7451, 1943-4456}, doi = {10.1101/SQB.1983.047.01.103}, url = {http://symposium.cshlp.org/content/47/893}, author = {Steitz,J. A. and Wolin,S. L. and Rinke,J. and Pettersson,I. and Mount, Stephen M. and Lerner,E. A. and Hinterberger,M. and Gottlieb,E.} } @article {18999, title = {Splicing of messenger RNA precursors is inhibited by antisera to small nuclear ribonucleoprotein}, journal = {Cell}, volume = {35}, year = {1983}, month = {1983/11//}, pages = {101 - 107}, isbn = {00928674}, doi = {10.1016/0092-8674(83)90212-X}, url = {http://ukpmc.ac.uk/abstract/MED/6194895}, author = {Padgett,Richard A. and Mount, Stephen M. and Steitz,Joan A. and Sharp,Phillip A.} } @article {19006, title = {The U1 small nuclear RNA-protein complex selectively binds a 5' splice site in vitro}, journal = {Cell}, volume = {33}, year = {1983}, month = {1983/06//}, pages = {509 - 518}, abstract = {The ability of purified U1 small nuclear RNA-protein complexes (U1 snRNPs) to bind in vitro to two RNAs transcribed from recombinant DNA clones by bacteriophage T7 RNA polymerase has been studied. A transcript which contains sequences corresponding to the small intron and flanking exons of the major mouse beta-globin gene is bound in marked preference to an RNA devoid of splice site sequences. The site of U1 snRNP binding to the globin RNA has been defined by T1 ribonuclease digestion of the RNA-U1 snRNP complex. A 15-17-nucleotide region, including the 5{\textquoteright} splice site, remains undigested and complexed with the snRNP such that it can be co-precipitated by antibodies directed against the U1 snRNP. Partial proteinase K digestion of the U1 snRNP abolishes interaction with the globin RNA, indicating that the snRNP proteins contribute significantly to RNA binding. No RNA cleavage, splicing, or recognition of the 3{\textquoteright} splice site by U1 snRNPs has been detected. Our results are discussed in terms of the probable role of U1 snRNPs in the messenger RNA splicing of eucaryotic cell nuclei.}, isbn = {00928674}, doi = {10.1016/0092-8674(83)90432-4}, url = {http://ukpmc.ac.uk/abstract/MED/6190573}, author = {Mount, Stephen M. and Pettersson,Ingvar and Hinterberger,Monique and Karmas,Aavo and Steitz,Joan A.} } @article {18965, title = {A catalogue of splice junction sequences}, journal = {Nucleic Acids ResearchNucl. Acids Res.}, volume = {10}, year = {1982}, month = {1982/01/22/}, pages = {459 - 472}, abstract = {Splice junction sequences from a large number of nuclear and viral genes encoding protein have been collected. The sequence ACAG/GTGAAGT was found to be a consensus of 139 exon-intron boundaries (or donor sequences) and (CT)nNTCAG/G was found to be a consensus of 130 intron-exon boundaries (or acceptor sequences). The possible role of splice junction sequences as signals for processing is discussed.}, isbn = {0305-1048, 1362-4962}, doi = {10.1093/nar/10.2.459}, url = {http://nar.oxfordjournals.org/content/10/2/459}, author = {Mount, Stephen M.} } @conference {15633, title = {Isomorphism of graphs with bounded eigenvalue multiplicity}, booktitle = {Proceedings of the fourteenth annual ACM symposium on Theory of computing}, series = {STOC {\textquoteright}82}, year = {1982}, month = {1982///}, pages = {310 - 324}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {We investigate the connection between the spectrum of a graph, i.e. the eigenvalues of the adjacency matrix, and the complexity of testing isomorphism. In particular we describe two polynomial time algorithms which test isomorphism of undirected graphs whose eigenvalues have bounded multiplicity. If X and Y are graphs of eigenvalue multiplicity m, then the isomorphism of X and Y can be tested by an O(n4m+c) deterministic and by an O(n2m+c) Las Vegas algorithm, where n is the number of vertices of X and Y.}, isbn = {0-89791-070-2}, doi = {10.1145/800070.802206}, url = {http://doi.acm.org/10.1145/800070.802206}, author = {Babai,L{\'a}szl{\'o} and Grigoryev,D. Yu. and Mount, Dave} } @article {19002, title = {Structure and function of small ribonucleoproteins from eukaryotic cells}, journal = {Princess Takamatsu symposiaInt. Symp. Princess Takamatsu Cancer Res. Fund}, volume = {12}, year = {1982}, month = {1982///}, pages = {101 - 107}, abstract = {Autoantibodies from patients with systemic lupus erythematosus and other related diseases have been used to identify and study small RNA-protein complexes from mammalian cells. Properties of three previously described and several new classes of small ribonucleoproteins (RNPs) are reviewed. The sequence of Drosophila U1 RNA reveals that the region proposed to pair with 5{\textquoteright} splice junctions is conserved, while that proposed to interact with 3{\textquoteright} junctions diverges; this forces some revision of the model for U1 small nuclear (sn)RNP participation in hnRNA splicing. Further characterization of the Ro and La small RNPs has shown that the Ro small cytoplasmic (sc)RNPs are a subclass of La RNPs. Both tRNA and 5S rRNA precursors are at least transiently associated with the La protein. This raises the possibility that the La protein may be an RNA polymerase III transcription factor.}, keywords = {Antigen-Antibody Complex, Autoantibodies, HUMANS, Lupus Erythematosus, Systemic, Nucleoproteins, Ribonucleoproteins, RNA Polymerase III, Transcription, Genetic}, url = {http://www.ncbi.nlm.nih.gov/pubmed/7166547}, author = {Steitz,J. A. and Berg,C and Gottlieb,E. and Hardin,J A and Hashimoto,C and Hendrick,J P and Hinterberger,M. and Krikeles,M and Lerner,M R and Mount, Stephen M.} } @article {18993, title = {Sequence of U1 RNA from Drosophila melanogaster: implications for U1 secondary structure and possible involvement in splicing}, journal = {Nucleic Acids ResearchNucl. Acids Res.}, volume = {9}, year = {1981}, month = {1981/12/11/}, pages = {6351 - 6368}, abstract = {U1 RNA from cultured Drosophila melanogaster cells (Kc) was identified by its ability to be recognized, as an RNP, by anti-(U1)RNP antibodies from human lupus patients. Its sequence was deduced largely from direct analysis of the RNA molecule and then confirmed by DNA sequence determinations on a genomic clone isolated by hybridization to Drosophila U1 RNA. The Drosophila U1 RNA sequence exhibits 72\% agreement with human U1 RNA. Nucleotides 3-11, which are complementary to the entire consensus sequence for donor (5') splice junctions in hnRNA, and to part of the acceptor (3') consensus, are exactly conserved. However, nucleotides 14-21, postulated to interact only with acceptor junctions, differ. Comparison of the Drosophila U1 sequence with vertebrate U1 sequences allows a particular secondary structure model to be preferred over others. These results are consistent with the hypothesis that U1 snRNPs are involved in splicing, but suggest specific modifications of the model detailing molecular interactions between U1 RNA and hnRNA during the splicing reaction.}, isbn = {0305-1048, 1362-4962}, doi = {10.1093/nar/9.23.6351}, url = {http://nar.oxfordjournals.org/content/9/23/6351}, author = {Mount, Stephen M. and Steitz,Joan A.} } @article {19007, title = {Transcription of cloned tRNA and 5S RNA genes in a Drosophila cell free extract}, journal = {Nucleic Acids ResearchNucl. Acids Res.}, volume = {9}, year = {1981}, month = {1981/08/25/}, pages = {3907 - 3918}, abstract = {We describe the preparation of a cell-free extract from Drosophila Kc cells which allows transcription of a variety of cloned eukaryotic RNA polymerase III genes. The extract has low RNA-processing nuclease activity and thus the major products obtained are primary transcripts.}, isbn = {0305-1048, 1362-4962}, doi = {10.1093/nar/9.16.3907}, url = {http://nar.oxfordjournals.org/content/9/16/3907}, author = {Dingermann,Theodor and Sharp,Stephen and Appel,Bernd and DeFranco,Donald and Mount, Stephen M. and Heiermann,Reinhard and Pongs,Olaf and S{\"o}ll,Dieter} } @article {18967, title = {Are snRNPs involved in splicing?}, journal = {Nature}, volume = {283}, year = {1980}, month = {1980/01/10/}, pages = {220 - 224}, abstract = {Discrete, stable small RNA molecules are found in the nuclei of cells from a wide variety of eukaryotic organisms. Many of these small nuclear RNA (snRNA) species, which range in size from about 90 to 220 nucleotides, have been well-characterised biochemically, and some sequenced. However, their function has remained obscure. The most abundant snRNA species exist as a closely related set of RNA{\textendash}protein complexes called small nuclear ribonucleoproteins (snRNPs). snRNPs are the antigens recognised by antibodies from some patients with lupus erythematosus (LE), an autoimmune rheumatic disease. Anti-RNP antibodies from lupus sera selectively precipitate snRNP species containing Ula7 and Ulb9 RNAs from mouse Ehrlich ascites cell nuclei, whereas anti-Sm antibodies bind these snRNPs and four others containing U2, U4, US and U6 RNAs. Both antibody systems precipitate the same seven prominent nuclear proteins (molecular weight 12,000{\textendash}32,000). All molecules of the snRNAs U1, U2, U4, U5 and U6 appear to exist in the form of antigenic snRNPs9. The particles sediment at about 10S and each probably contains a single snRNA molecule. Indirect immunofluorescence studies using anti-RNP and anti-Sm sera confirm the nuclear (but non-nucleolar) location of the antigenic snRNPs. Here we present several lines of evidence that suggest a direct involvement of snRNPs in the splicing of hnRNA. Most intriguing is the observation that the nucleotide sequence at the 5' end of U1 RNA exhibits extensive complementarity to those across splice junctions in hnRNA molecules.}, doi = {10.1038/283220a0}, url = {http://www.nature.com/nature/journal/v283/n5743/abs/283220a0.html}, author = {Lerner,Michael R. and Boyle,John A. and Mount, Stephen M. and Wolin,Sandra L. and Steitz,Joan A.} } @article {17389, title = {Syntactic/semantic interactions in programmer behavior: A model and experimental results}, journal = {International Journal of Parallel Programming}, volume = {8}, year = {1979}, month = {1979///}, pages = {219 - 238}, abstract = {This paper presents a cognitive framework for describing behaviors involved in program composition, comprehension, debugging, modification, and the acquisition of new programming concepts, skills, and knowledge. An information processing model is presented which includes a long-term store of semantic and syntactic knowledge, and a working memory in which problem solutions are constructed. New experimental evidence is presented to support the model of syntactic/semantic interaction.}, isbn = {0885-7458}, url = {http://dx.doi.org/10.1007/BF00977789}, author = {Shneiderman, Ben and Mayer,Richard} } @book {11937, title = {A guide to major job accounting systems: the Logger system of the UNIVAC 1100 series operating system}, year = {1978}, month = {1978///}, publisher = {U.S. Dept. of Commerce, National Bureau of Standards : for sale by the Supt. of Docs., U.S. Govt. Print. Off.}, organization = {U.S. Dept. of Commerce, National Bureau of Standards : for sale by the Supt. of Docs., U.S. Govt. Print. Off.}, keywords = {Accounting, Business \& Economics / Accounting / General, Electronic digital computers, EXEC 8 (Electronic computer system), Reference / Questions \& Answers, Univac 1100 series (Computer), Univac computer}, author = {Mohr,Jeffrey Myron and Agrawala, Ashok K. and Flannagan,J. F.} } @article {17147, title = {Experimental investigations of the utility of detailed flowcharts in programming}, journal = {Communications of the ACM}, volume = {20}, year = {1977}, month = {1977/06//}, pages = {373 - 381}, abstract = {This paper describes previous research on flowcharts and a series of controlled experiments to test the utility of detailed flowcharts as an aid to program composition, comprehension, debugging, and modification. No statistically significant difference between flowchart and nonflowchart groups has been shown, thereby calling into question the utility of detailed flowcharting. A program of further research is suggested.}, keywords = {Debugging, experimental testing, flowcharts, human factors, modification, program composition, program comprehension}, isbn = {0001-0782}, doi = {10.1145/359605.359610}, url = {http://doi.acm.org/10.1145/359605.359610}, author = {Shneiderman, Ben and Mayer,Richard and McKay,Don and Heller,Peter} } @conference {11938, title = {The relationship between the pattern recognition problem and the workload characterization problem}, booktitle = {1977 CMG Conference}, year = {1977}, month = {1977///}, author = {Agrawala, Ashok K. and Mohr,J. M} } @article {15981, title = {Utility Functions, Public Goods, and Income Redistribution}, journal = {Public Finance Review}, volume = {5}, year = {1977}, month = {1977/01/01/}, pages = {9 - 22}, abstract = {The results of fiscal incidence studies depend upon the underlying utility functions pertinent to the distribution of public good benefits among income classes. Generally, the use of such functions is not explicitly recognized. By taking, in the first instance, an extended approach to utility based on an original Aaron-McGuire formulation and, in the second instance, a new approach, it is concluded that the income-equalizing tendencies of fiscal activities may be overstated when more conventional analysis is employed.}, doi = {10.1177/109114217700500102}, url = {http://pfr.sagepub.com/content/5/1/9.abstract}, author = {Mann,Arthur J. and Perlis, Don} } @conference {18387, title = {Error checking with pointer variables}, booktitle = {Proceedings of the 1976 annual conference}, series = {ACM {\textquoteright}76}, year = {1976}, month = {1976///}, pages = {391 - 395}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {The use of pointer variables in a programming language often results in a difficult class of errors to detect. Pointers may point to storage that no longer is allocated, or storage may be allocated as one data type and accessed as another. This report describes the implementation of pointers in the PLUM PL/1 compiler such that all error conditions are detected. In addition, preliminary tests with PLUM seem to indicate that the total checking of pointers is not as expensive an operation as it first appears.}, doi = {10.1145/800191.805623}, url = {http://doi.acm.org/10.1145/800191.805623}, author = {Zelkowitz, Marvin V and McMullin,Paul R. and Merkel,Keith R. and Larsen,Howard J.} } @book {11940, title = {The EXEC-8 Log System: Error Analysis}, year = {1976}, month = {1976///}, publisher = {University of Maryland, Dept. of Computer Science}, organization = {University of Maryland, Dept. of Computer Science}, author = {Mohr,J. M and Agrawala, Ashok K. and Flanagan,J. F. and Science,University of Maryland. Dept. of Computer} } @article {16724, title = {TORUS: A step towards bridging the gap between data bases and the casual user}, journal = {Information Systems}, volume = {2}, year = {1976}, month = {1976///}, pages = {49 - 64}, abstract = {This paper describes TORUS, a natural language understanding system that serves as a front end to a data base management system in order to facilitate communication with casual users. The system employs a semantic network to store knowledge about a data base of student files. This knowledge is used to find the meaning of each input statement, to decide what action to take with respect to the data base, and to select information that must be output in response to the input statement. A prototype version of TORUS has been implemented.}, isbn = {0306-4379}, doi = {16/0306-4379(76)90009-0}, url = {http://www.sciencedirect.com/science/article/pii/0306437976900090}, author = {Mylopoulos,J. and Borgida,A. and Cohen,P. and Roussopoulos, Nick and Tsotsos,J. and Wong,H.} } @conference {16721, title = {TORUS-a natural language understanding system for data management}, booktitle = {Proceedings of the Fourth International Conference on Artificial Intelligence}, year = {1975}, month = {1975///}, pages = {414 - 421}, author = {Mylopoulos,J. and Borgida,A. and Cohen,P. and Roussopoulos, Nick and Tsotsos,J. and Wong,H.} } @conference {16776, title = {Using semantic networks for data base management}, booktitle = {Proceedings of the 1st International Conference on Very Large Data Bases}, year = {1975}, month = {1975///}, pages = {144 - 172}, author = {Roussopoulos, Nick and Mylopoulos,J.} }