@article {19692, title = {Evaluating Regularized Anchor Words}, journal = {mimno.infosci.cornell.edu}, year = {Submitted}, abstract = {Abstract We perform a comprehensive examination of the recently proposed anchor method for topic model inference using topic interpretability and held-out likelihood measures. After measuring the sensitivity to the anchor selection process, we incorporate L2 and Beta ...}, url = {http://mimno.infosci.cornell.edu/nips2013ws/nips2013tm_submission_27.pdf}, author = {Nguyen, T and Hu, Y and Jordan Boyd-Graber} } @article {20289, title = {Environmental and hydroclimatic factors influencing Vibrio populations in the estuarine zone of the Bengal delta}, journal = {Environmental Monitoring and Assessment}, year = {2018}, month = {Jan-10-2018}, abstract = {The objective of this study was to determine environmental parameters driving Vibrio populations in the estuarine zone of the Bengal delta. Spatio-temporal data were collected at river estuary, mangrove, beach, pond, and canal sites. Effects of salinity, tidal amplitude, and a cyclone and tsunami were included in the study. Vibrio population shifts were found to be correlated with tide-driven salinity and suspended particulate matter (SPM). Increased abundance of Vibrio spp. in surface water was observed after a cyclone, attributed to re-suspension of benthic particulate organic carbon (POC), and increased availability of chitin and dissolved organic carbon (DOC). Approximately a two log10 increase in the (p < 0.05) number of Vibrio spp. was observed in < 20 μm particulates, compared with microphytoplankton (20{\textendash}60 μm) and zooplankton > 60 μm fractions. Benthic and suspended sediment comprised a major reservoir of Vibrio spp. Results of microcosm experiments showed enhanced growth of vibrios was related to concentration of organic matter in SPM. It is concluded that SPM, POC, chitin, and salinity significantly influence abundance and distribution of vibrios in the Bengal delta estuarine zone. Keywords Vibrio Salinity Cyclone Tide Chitin Sediment dynamics }, issn = {0167-6369}, doi = {10.1007/s10661-018-6925-7}, url = {https://link.springer.com/article/10.1007\%2Fs10661-018-6925-7}, author = {Neogi, Sucharit and Rubin, Lara and Alam, Munirul and Harder, Jens and Yamasaki, Shinji and Rita R Colwell} } @article {20325, title = {Enrichment dynamics of Listeria monocytogenes and the associated microbiome from naturally contaminated ice cream linked to a listeriosis outbreak}, journal = {BMC Microbiology}, year = {2016}, month = {Jan-12-2016}, doi = {10.1186/s12866-016-0894-1}, url = {http://bmcmicrobiol.biomedcentral.com/articles/10.1186/s12866-016-0894-1}, author = {Ottesen, Andrea and Ramachandran, Padmini and Reed, Elizabeth and White, James R. and Hasan, Nur and Subramanian, Poorani and Ryan, Gina and Jarvis, Karen and Grim, Christopher and Daquiqan, Ninalynn and Hanes, Darcy and Allard, Marc and Rita R Colwell and Brown, Eric and Chen, Yi} } @article {20337, title = {Environmental Surveillance for Toxigenic Vibrio cholerae in Surface Waters of Haiti}, journal = {The American Journal of Tropical Medicine and Hygiene}, volume = {92}, year = {2015}, month = {Jul-01-2015}, pages = {118 - 125}, abstract = {Epidemic cholera was reported in Haiti in 2010, with no information available on the occurrence or geographic distribution of toxigenic Vibrio cholerae in Haitian waters. In a series of field visits conducted in Haiti between 2011 and 2013, water and plankton samples were collected at 19 sites. Vibrio cholerae was detected using culture, polymerase chain reaction, and direct viable count methods (DFA-DVC). Cholera toxin genes were detected by polymerase chain reaction in broth enrichments of samples collected in all visits except March 2012. Toxigenic V. cholerae was isolated from river water in 2011 and 2013. Whole genome sequencing revealed that these isolates were a match to the outbreak strain. The DFA-DVC tests were positive for V. cholerae O1 in plankton samples collected from multiple sites. Results of this survey show that toxigenic V. cholerae could be recovered from surface waters in Haiti more than 2 years after the onset of the epidemic.}, issn = {0002-9637}, doi = {10.4269/ajtmh.13-0601}, url = {http://www.ajtmh.org/content/journals/10.4269/ajtmh.13-0601}, author = {Hill, Vincent R. and Humphrys, Michael S. and Kahler, Amy M. and Boncy, Jacques and Tarr, Cheryl L. and Huq, Anwar and Chen, Arlene and Katz, Lee S. and Mull, Bonnie J. and Derado, Gordana and Haley, Bradd J. and Freeman, Nicole and Rita R Colwell and Turnsek, Maryann} } @conference {20066, title = {Estimating Actin Fiber Orientation using Interpolation-Based Grey-Level Co-Occurrence Matrix Computation}, booktitle = {BioImage Informatics Conference }, year = {2015}, month = {10/2015}, author = {Cardone, Antonio and Brady, Mary and Kociolek, Marcin and Bajcsy, Peter} } @article {20363, title = {Engaging Actively with Issues in the Responsible Conduct of Science: Lessons from International Efforts Are Relevant for Undergraduate Education in the United States}, journal = {CBE{\textemdash}Life Sciences Education}, year = {2013}, month = {Jan-12-2013}, pages = {596 - 603}, abstract = {Numerous studies are demonstrating that engaging undergraduate students in original research can improve their achievement in the science, technology, engineering, and mathematics (STEM) fields and increase the likelihood that some of them will decide to pursue careers in these disciplines. Associated with this increased prominence of research in the undergraduate curriculum are greater expectations from funders, colleges, and universities that faculty mentors will help those students, along with their graduate students and postdoctoral fellows, develop an understanding and sense of personal and collective obligation for responsible conduct of science (RCS). This Feature describes an ongoing National Research Council (NRC) project and a recent report about educating faculty members in culturally diverse settings (Middle East/North Africa and Asia) to employ active-learning strategies to engage their students and colleagues deeply in issues related to RCS. The NRC report describes the first phase of this project, which took place in Aqaba and Amman, Jordan, in September 2012 and April 2013, respectively. Here we highlight the findings from that report and our subsequent experience with a similar interactive institute in Kuala Lumpur, Malaysia. Our work provides insights and perspectives for faculty members in the United States as they engage undergraduate and graduate students, as well as postdoctoral fellows, to help them better understand the intricacies of and connections among various components of RCS. Further, our experiences can provide insights for those who may wish to establish {\textquotedblleft}train-the-trainer{\textquotedblright} programs at their home institutions.}, doi = {10.1187/cbe.13-09-0184}, url = {https://www.lifescied.org/doi/10.1187/cbe.13-09-0184}, author = {Clements, John D. and Connell, Nancy D. and Dirks, Clarissa and El-Faham, Mohamed and Hay, Alastair and Heitman, Elizabeth and Stith, James H. and Bond, Enriqueta C. and Rita R Colwell and Anestidou, Lida and Husbands, Jo L. and Labov, Jay B.} } @article {20372, title = {Environmental Factors Influencing Epidemic Cholera}, journal = {The American Journal of Tropical Medicine and Hygiene}, volume = {89}, year = {2013}, month = {Apr-09-2013}, pages = {597 - 607}, abstract = {Cholera outbreak following the earthquake of 2010 in Haiti has reaffirmed that the disease is a major public health threat. Vibrio cholerae is autochthonous to aquatic environment, hence, it cannot be eradicated but hydroclimatology-based prediction and prevention is an achievable goal. Using data from the 1800s, we describe uniqueness in seasonality and mechanism of occurrence of cholera in the epidemic regions of Asia and Latin America. Epidemic regions are located near regional rivers and are characterized by sporadic outbreaks, which are likely to be initiated during episodes of prevailing warm air temperature with low river flows, creating favorable environmental conditions for growth of cholera bacteria. Heavy rainfall, through inundation or breakdown of sanitary infrastructure, accelerates interaction between contaminated water and human activities, resulting in an epidemic. This causal mechanism is markedly different from endemic cholera where tidal intrusion of seawater carrying bacteria from estuary to inland regions, results in outbreaks.}, issn = {0002-9637}, doi = {10.4269/ajtmh.12-0721}, url = {http://www.ajtmh.org/content/journals/10.4269/ajtmh.12-0721}, author = {Huq, Anwar and Hasan, Nur and Akanda, Ali and Whitcombe, Elizabeth and Rita R Colwell and Haley, Bradd and Alam, Munir and Jutla, Antarpreet and Sack, R. Bradley} } @article {19701, title = {Exploring early designs for teaching anatomy and physiology to children using wearable e-textiles}, journal = {IDC {\textquoteright}13 Proceedings of the 12th International Conference on Interaction Design and Children}, year = {2013}, month = {2013/00/24}, pages = {577 - 580}, publisher = {The New SchoolACM}, address = {New York, New York, USA}, abstract = {Abstract Unlike external body parts, organs are invisible and untouchable, making it difficult for children to learn their size, position, and function. Traditionally, human anatomy (body form) and physiology (body function) are taught using a mixture of techniques from ...}, isbn = {9781450319188}, doi = {10.1145/2485760.2485869}, url = {http://dl.acm.org/citation.cfm?doid=2485760.2485869}, author = {Norooz, Leyla and Jon Froehlich} } @article {19705, title = {Exploring Early Solutions for Automatically Identifying Inaccessible Sidewalks in the Physical World Using Google Street View}, journal = {HCIC 2013}, year = {2013}, month = {2013/00/01}, abstract = {Abstract Poorly maintained sidewalks , missing curb ramps, and other obstacles pose considerable accessibility challenges. Although pedestrian-and bicycle-oriented maps and associated routing algorithms continue to improve, there has been a lack of work focusing ...}, url = {http://www.cs.umd.edu/~jonf/publications/Hara_ExploringEarlySolutionsForAutomaticallyIdentifyingInaccessibleSidewalksInThePhysicalWorldUsingGoogleStreetView_HCIC2013.pdf}, author = {Hara, K and Le, V and Sun, J and Jacobs, D and Jon Froehlich} } @article {20387, title = {Ecology of Vibrio parahaemolyticus and Vibrio vulnificus in the Coastal and Estuarine Waters of Louisiana, Maryland, Mississippi, and Washington (United States)}, journal = {Applied and Environmental Microbiology}, year = {2012}, month = {Mar-10-2013}, pages = {7249 - 7257}, abstract = {Vibrio parahaemolyticus and Vibrio vulnificus, which are native to estuaries globally, are agents of seafood-borne or wound infections, both potentially fatal. Like all vibrios autochthonous to coastal regions, their abundance varies with changes in environmental parameters. Sea surface temperature (SST), sea surface height (SSH), and chlorophyll have been shown to be predictors of zooplankton and thus factors linked to vibrio populations. The contribution of salinity, conductivity, turbidity, and dissolved organic carbon to the incidence and distribution of Vibrio spp. has also been reported. Here, a multicoastal, 21-month study was conducted to determine relationships between environmental parameters and V. parahaemolyticus and V. vulnificus populations in water, oysters, and sediment in three coastal areas of the United States. Because ecologically unique sites were included in the study, it was possible to analyze individual parameters over wide ranges. Molecular methods were used to detect genes for thermolabile hemolysin (tlh), thermostable direct hemolysin (tdh), and tdh-related hemolysin (trh) as indicators of V. parahaemolyticus and the hemolysin gene vvhA for V. vulnificus. SST and suspended particulate matter were found to be strong predictors of total and potentially pathogenic V. parahaemolyticus and V. vulnificus. Other predictors included chlorophyll a, salinity, and dissolved organic carbon. For the ecologically unique sites included in the study, SST was confirmed as an effective predictor of annual variation in vibrio abundance, with other parameters explaining a portion of the variation not attributable to SST.}, issn = {0099-2240}, doi = {10.1128/AEM.01296-12}, url = {http://aem.asm.org/lookup/doi/10.1128/AEM.01296-12}, author = {Johnson, Crystal N. and Bowers, John C. and Griffitt, Kimberly J. and Molina, Vanessa and Clostio, Rachel W. and Pei, Shaofeng and Laws, Edward and Paranjpye, Rohinee N. and Strom, Mark S. and Chen, Arlene and Hasan, Nur A. and Huq, Anwar and Noriea, Nicholas F. and Grimes, D. Jay and Rita R Colwell} } @article {13939, title = {Efficient FMM accelerated vortex methods in three dimensions via the Lamb-Helmholtz decomposition}, journal = {arXiv:1201.5430}, year = {2012}, month = {2012/01/25/}, abstract = {Vortex element methods are often used to efficiently simulate incompressible flows using Lagrangian techniques. Use of the FMM (Fast Multipole Method) allows considerable speed up of both velocity evaluation and vorticity evolution terms in these methods. Both equations require field evaluation of constrained (divergence free) vector valued quantities (velocity, vorticity) and cross terms from these. These are usually evaluated by performing several FMM accelerated sums of scalar harmonic functions. We present a formulation of the vortex methods based on the Lamb-Helmholtz decomposition of the velocity in terms of two scalar potentials. In its original form, this decomposition is not invariant with respect to translation, violating a key requirement for the FMM. One of the key contributions of this paper is a theory for translation for this representation. The translation theory is developed by introducing "conversion" operators, which enable the representation to be restored in an arbitrary reference frame. Using this form, extremely efficient vortex element computations can be made, which need evaluation of just two scalar harmonic FMM sums for evaluating the velocity and vorticity evolution terms. Details of the decomposition, translation and conversion formulae, and sample numerical results are presented.}, keywords = {Computer Science - Numerical Analysis, Mathematical Physics, Physics - Computational Physics, Physics - Fluid Dynamics}, url = {http://arxiv.org/abs/1201.5430}, author = {Gumerov, Nail A. and Duraiswami, Ramani} } @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 {12422, title = {Efficient Tree-Based Topic Modeling}, journal = {Association for Computational Linguistics}, year = {2012}, month = {2012///}, abstract = {Topic modeling with a tree-based prior has been used for a variety of applications be- cause it can encode correlations between words that traditional topic modeling cannot. How- ever, its expressive power comes at the cost of more complicated inference. We extend the SPARSELDA (Yao et al., 2009) inference scheme for latent Dirichlet allocation (LDA) to tree-based topic models. This sampling scheme computes the exact conditional distri- bution for Gibbs sampling much more quickly than enumerating all possible latent variable assignments. We further improve performance by iteratively refining the sampling distribution only when needed. Experiments show that the proposed techniques dramatically improve the computation time.}, author = {Hu,Yuening and Jordan Boyd-Graber} } @article {19612, title = {Efficient Verification of Web-content Searching Through Authenticated Web Crawlers}, journal = {Proc. VLDB Endow.}, volume = {5}, year = {2012}, month = {2012/06//}, pages = {920 - 931}, abstract = {We consider the problem of verifying the correctness and completeness of the result of a keyword search. We introduce the concept of an authenticated web crawler and present its design and prototype implementation. An authenticated web crawler is a trusted program that computes a specially-crafted signature over the web contents it visits. This signature enables (i) the verification of common Internet queries on web pages, such as conjunctive keyword searches---this guarantees that the output of a conjunctive keyword search is correct and complete; (ii) the verification of the content returned by such Internet queries---this guarantees that web data is authentic and has not been maliciously altered since the computation of the signature by the crawler. In our solution, the search engine returns a cryptographic proof of the query result. Both the proof size and the verification time are proportional only to the sizes of the query description and the query result, but do not depend on the number or sizes of the web pages over which the search is performed. As we experimentally demonstrate, the prototype implementation of our system provides a low communication overhead between the search engine and the user, and fast verification of the returned results by the user.}, isbn = {2150-8097}, url = {http://dl.acm.org/citation.cfm?id=2336664.2336666}, author = {Goodrich, Michael T. and Charalampos Papamanthou and Nguyen, Duy and Tamassia, Roberto and Lopes, Cristina Videira and Ohrimenko, Olga and Triandopoulos, Nikos} } @conference {Ture:2012:ECT:2382029.2382088, title = {Encouraging consistent translation choices}, booktitle = {Proceedings of the 2012 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies}, series = {NAACL HLT {\textquoteright}12}, year = {2012}, pages = {417{\textendash}426}, publisher = {Association for Computational Linguistics}, organization = {Association for Computational Linguistics}, address = {Stroudsburg, PA, USA}, isbn = {978-1-937284-20-6}, url = {http://dl.acm.org/citation.cfm?id=2382029.2382088}, author = {Ture, Ferhan and Oard, Douglas and Resnik, Philip} } @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 {13432, title = {EAAI-10: The First Symposium on Educational Advances in Artificial Intelligence}, journal = {AI Magazine}, volume = {32}, year = {2011}, month = {2011/04/18/}, pages = {91 - 91}, keywords = {education, AI, symposium}, isbn = {0738-4602}, doi = {10.1609/aimag.v32i1.2323}, url = {http://www.aaai.org/ojs/index.php/aimagazine/article/view/2323}, author = {desJardins, Marie and Sahami,Mehran and Wagstaff,Kiri} } @conference {13433, title = {Educational advances in artificial intelligence}, booktitle = {Proceedings of the 42nd ACM technical symposium on Computer science education}, series = {SIGCSE {\textquoteright}11}, year = {2011}, month = {2011///}, pages = {81 - 82}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {In 2010 a new annual symposium on Educational Advances in Artificial Intelligence (EAAI) was launched as part of the AAAI annual meeting. The event was held in cooperation with ACM SIGCSE and has many similar goals related to broadening and disseminating work in computer science education. EAAI has a particular focus, however, as the event is specific to educational work in Artificial Intelligence and collocated with a major research conference (AAAI) to promote more interaction between researchers and educators in that domain. This panel seeks to introduce participants to EAAI as a way of fostering more interaction between educational communities in computing. Specifically, the panel will discuss the goals of EAAI, provide an overview of the kinds of work presented at the symposium, and identify potential synergies between that EAAI and SIGCSE as a way of better linking the two communities going forward.}, keywords = {artificial intelligence education, model AI assignments}, isbn = {978-1-4503-0500-6}, doi = {10.1145/1953163.1953189}, url = {http://doi.acm.org/10.1145/1953163.1953189}, author = {Sahami,Mehran and desJardins, Marie and Dodds,Zachary and Neller,Todd} } @conference {19022, title = {Efficient and secure threshold-based event validation for vanets}, year = {2011}, month = {2011}, abstract = {Determining whether the number of vehicles reporting anevent is above a threshold is an important mechanism for VANETs, because many applications rely on a threshold number of notifications to reach agreement among vehicles, to determine the validity of an event, or to prevent the abuse of emergency alarms. We present the first efficient and se- cure threshold-based event validation protocol for VANETs. Quite counter-intuitively, we found that the z-smallest ap- proach offers the best tradeoff between security and effi- ciency since other approaches perform better for probabilis- tic counting. Analysis and simulation shows that our pro- tocol provides > 99\% accuracy despite the presence of at- tackers, collection and distribution of alerts in less than 1 second, and negligible impact on network performance. }, url = {http://www.eecs.berkeley.edu/~elaines/docs/hsiao_wisec2011.pdf}, author = {Hsiao, H. C. and Studer, A. and Dubey, R. and Elaine Shi and Perrig, A.} } @article {13948, title = {EFFICIENT PARALLEL NON-NEGATIVE LEAST SQUARES ON MULTI-CORE ARCHITECTURES}, journal = {SIAM Journal on Scientific Computing}, volume = {33}, year = {2011}, month = {2011///}, pages = {2848 - 2863}, abstract = {We parallelize a version of the active-set iterative algorithm derived from the originalworks of Lawson and Hanson [Solving Least Squares Problems, Prentice-Hall, 1974] on multicore architectures. This algorithm requires the solution of an unconstrained least squares problem in every step of the iteration for a matrix composed of the passive columns of the original system matrix. To achieve improved performance, we use parallelizable procedures to efficiently update and downdate the QR factorization of the matrix at each iteration, to account for inserted and removed columns. We use a reordering strategy of the columns in the decomposition to reduce computation and memory access costs. We consider graphics processing units (GPUs) as a new mode for efficient parallel computations and compare our implementations to that of multicore CPUs. Both synthetic and nonsynthetic data are used in the experiments. }, author = {Luo,Y. and Duraiswami, Ramani} } @article {15130, title = {Efficient privacy-preserving biometric identification}, journal = {Network and Distributed System Security Symposium}, year = {2011}, month = {2011///}, abstract = {We present an efficient matching protocol that can be usedin many privacy-preserving biometric identification systems in the semi-honest setting. Our most general technical con- tribution is a new backtracking protocol that uses the by- product of evaluating a garbled circuit to enable efficient oblivious information retrieval. We also present a more ef- ficient protocol for computing the Euclidean distances of vectors, and optimized circuits for finding the closest match between a point held by one party and a set of points held by another. We evaluate our protocols by implementing a practical privacy-preserving fingerprint matching system. }, author = {Huang,Y. and Malka,L. and Evans,D. and Katz, Jonathan} } @article {15113, title = {Efficient Secure Computation with Garbled Circuits}, journal = {Information Systems Security}, year = {2011}, month = {2011///}, pages = {28 - 48}, abstract = {Secure two-party computation enables applications in which participants compute the output of a function that depends on their private inputs, without revealing those inputs or relying on any trusted third party. In this paper, we show the potential of building privacy-preserving applications using garbled circuits, a generic technique that until recently was believed to be too inefficient to scale to realistic problems. We present a Java-based framework that uses pipelining and circuit-level optimizations to build efficient and scalable privacy-preserving applications. Although the standard garbled circuit protocol assumes a very week, honest-but-curious adversary, techniques are available for converting such protocols to resist stronger adversaries, including fully malicious adversaries. We summarize approaches to producing malicious-resistant secure computations that reduce the costs of transforming a protocol to be secure against stronger adversaries. In addition, we summarize results on ensuring fairness, the property that either both parties receive the result or neither party does. Several open problems remain, but as theory and pragmatism advance, secure computation is approaching the point where it offers practical solutions for a wide variety of important problems.}, doi = {10.1007/978-3-642-25560-1_2}, author = {Huang,Y. and Shen,C. and Evans,D. and Katz, Jonathan and Shelat,A.} } @article {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 {17128, title = {Electronic medical records: usability challenges and opportunities}, journal = {Interactions}, volume = {18}, year = {2011}, month = {2011///}, pages = {48 - 49}, author = {Hochheiser,H. and Shneiderman, Ben} } @article {16040, title = {Empirical Studies in Information Visualization: Seven Scenarios}, journal = {Visualization and Computer Graphics, IEEE Transactions on}, volume = {PP}, year = {2011}, month = {2011///}, pages = {1 - 1}, abstract = {We take a new, scenario based look at evaluation in information visualization. Our seven scenarios, evaluating visual data analysis and reasoning, evaluating user performance, evaluating user experience, evaluating environments and work practices, evaluating communication through visualization, evaluating visualization algorithms, and evaluating collaborative data analysis were derived through an extensive literature review of over 800 visualization publications. These scenarios distinguish different study goals and types of research questions and are illustrated through example studies. Through this broad survey and the distillation of these scenarios we make two contributions. One, we encapsulate the current practices in the information visualization research community and, two, we provide a different approach to reaching decisions about what might be the most effective evaluation of a given information visualization. Scenarios can be used to choose appropriate research questions and goals and the provided examples can be consulted for guidance on how to design one{\textquoteright}s own study.}, isbn = {1077-2626}, doi = {10.1109/TVCG.2011.279}, author = {Lam,H. and Bertini,E. and Isenberg,P. and Plaisant, Catherine and Carpendale,S.} } @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 {12450, title = {Entropy rate superpixel segmentation}, booktitle = {2011 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)}, year = {2011}, month = {2011/06/20/25}, pages = {2097 - 2104}, publisher = {IEEE}, organization = {IEEE}, abstract = {We propose a new objective function for superpixel segmentation. This objective function consists of two components: entropy rate of a random walk on a graph and a balancing term. The entropy rate favors formation of compact and homogeneous clusters, while the balancing function encourages clusters with similar sizes. We present a novel graph construction for images and show that this construction induces a matroid - a combinatorial structure that generalizes the concept of linear independence in vector spaces. The segmentation is then given by the graph topology that maximizes the objective function under the matroid constraint. By exploiting submodular and mono-tonic properties of the objective function, we develop an efficient greedy algorithm. Furthermore, we prove an approximation bound of {\textonehalf} for the optimality of the solution. Extensive experiments on the Berkeley segmentation benchmark show that the proposed algorithm outperforms the state of the art in all the standard evaluation metrics.}, keywords = {balancing function, Berkeley segmentation benchmark, Complexity theory, Entropy, entropy rate, graph construction, graph theory, graph topology, greedy algorithm, Greedy algorithms, homogeneous clusters, Image edge detection, Image segmentation, matrix algebra, matroid constraint, measurement, pattern clustering, Random variables, standard evaluation metrics, superpixel segmentation, vector spaces}, isbn = {978-1-4577-0394-2}, doi = {10.1109/CVPR.2011.5995323}, author = {Ming-Yu Liu and Tuzel, O. and Ramalingam, S. and Chellapa, Rama} } @article {14608, title = {Epigenomic and RNA structural correlates of polyadenylation}, journal = {RNA Biology}, volume = {8}, year = {2011}, month = {2011/05/01/}, pages = {529 - 537}, abstract = {Polyadenylation (poly(A)) of mRNA plays a critical role in regulating gene expression. Identifying the sequence, structural, and epigenomic determinants of poly(A) site usage is an important long term goal. Several cis elements that mediate poly(A) regulation have been identified. Highly used poly(A) sites are also known to have a greater nucleosome occupancy in the immediate downstream. However, a detailed exploration of additional epigenomic and mRNA structural correlates of poly(A) site usage has not been reported. Importantly, functional interaction between sequence, structure, and the epigenome in determining the poly(A) site usage is not known. We show that highly used poly(A) sites are positively associated with an mRNA structure that is energetically more favorable and one that better exposes a critical polyadenylation cis element. In exploring potential interplay between RNA and chromatin structure, we found that a stronger nucleosome occupancy downstream of poly(A) site strongly correlated with (1) a more favorable mRNA structure, and (2) a greater accumulation of RNA Polymerase II (PolII) at the poly(A) site. Further analysis suggested a causal relationship pointing from PolII accumulation to a stable RNA structure. Additionally, we found that distinct patterns of histone modifications characterize poly(A) sites and these epigenetic patterns alone can distinguish true poly(A) sites with ~76\% accuracy and also discriminate between high and low usage poly(A) sites with ~74\% accuracy. Our results suggest a causative link between chromatin structure and mRNA structure whereby a compacted chromatin downstream of the poly(A) site slows down the elongating transcript, thus facilitating the folding of nascent mRNA in a favorable structure at poly(A) site during transcription. Additionally we report hitherto unknown epigenomic correlates for poly(A) site usage.}, isbn = {1547-6286}, doi = {10.4161/rna.8.3.15194}, url = {http://www.landesbioscience.com/journals/rnabiology/article/15194/}, author = {Khaladkar,Mugdha and Smyda,Mark and Hannenhalli, Sridhar} } @article {16431, title = {Estimating Functional Agent-Based Models: An Application to Bid Shading in Online Markets Format}, journal = {Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2011)}, year = {2011}, month = {2011///}, abstract = {Bid shading is a common strategy in online auctions to avoid the "winner{\textquoteright}s curse". While almost all bidders shade their bids, at least to some degree, it is impossible to infer the degree and volume of shaded bids directly from observed bidding data. In fact, most bidding data only allows us to observe the resulting price process, i.e. whether prices increase fast (due to little shading) or whether they slow down (when all bidders shade their bids). In this work, we propose an agent-based model that simulates bidders with different bidding strategies and their interaction with one another. We calibrate that model (and hence estimate properties about the propensity and degree of shaded bids) by matching the emerging simulated price process with that of the observed auction data using genetic algorithms. From a statistical point of view, this is challenging because we match functional draws from simulated and real price processes. We propose several competing fitness functions and explore how the choice alters the resulting ABM calibration. We apply our model to the context of eBay auctions for digital cameras and show that a balanced fitness function yields the best results.}, keywords = {Agent-based modeling, business, Calibration, Genetic algorithms, internet auctions, simulation}, url = {http://papers.ssrn.com/sol3/papers.cfm?abstract_id=1846639}, author = {Guo,Wei and Jank,Wolfgang and Rand, William} } @article {12448, title = {ON THE ESTIMATION OF 3D HUMAN BODY MODELS AND POSE FROM MULTIPLE CAMERAS}, journal = {EMERGING TOPICS IN COMPUTER VISION AND ITS APPLICATIONS}, year = {2011}, month = {2011/09//undefin}, pages = {3 - 25}, abstract = {We present a completely automatic algorithm for initializing and tracking the articulated motion of humans using image sequences obtained from multiple cameras. We discuss the challenges in solving this problem and compare our work to some of the state of the art techniques today. We use a detailed articulated human body model composed of sixteen rigid segments that allows both translation and rotation at joints. Voxel data of the subject obtained from the images is segmented into the different articulated chains using Laplacian Eigenmaps. The segmented chains are registered in a subset of the frames using a single-frame registration technique and subsequently used to initialize the pose in the sequence. A temporal registration method is then used to identify the partially segmented or unregistered articulated chains in the remaining frames in the sequence. The tracker uses motion cues such as pixel displacement as well as 2D and 3D shape cues such as silhouettes, motion residues and skeleton curves. The use of complementary cues in the tracking algorithm alleviates the twin problems of drift and convergence to incorrect solutions. The use of multiple cameras also allows us to deal with the problems due to self-occlusion and kinematic singularity. We present tracking results on sequences with different kinds of motion to illustrate the effectiveness of our approach.}, author = {Sundaresan, A. and Chellapa, Rama} } @article {15751, title = {Euclidean distance matrix completion problems}, journal = {Optimization Methods and Software}, year = {2011}, month = {2011///}, pages = {1 - 23}, abstract = {A Euclidean distance matrix (EDM) is one in which the (i, j) entry specifies the squared distance between particle i and particle j. Given a partially specified symmetric matrix A with zero diagonal, the Euclidean distance matrix completion problem (EDMCP) is to determine the unspecified entries to make A an EDM. We survey three different approaches to solving the EDMCP. We advocate expressing the EDMCP as a non-convex optimization problem using the particle positions as variables and solving using a modified Newton or quasi-Newton method. To avoid local minima, we develop a randomized initialization technique that involves a nonlinear version of the classical multidimensional scaling, and a dimensionality relaxation scheme with optional weighting. Our experiments show that the method easily solves the artificial problems introduced by Mor{\'e} and Wu. It also solves the 12 much more difficult protein fragment problems introduced by Hendrickson, and the six larger protein problems introduced by Grooms, Lewis and Trosset.A Euclidean distance matrix (EDM) is one in which the (i, j) entry specifies the squared distance between particle i and particle j. Given a partially specified symmetric matrix A with zero diagonal, the Euclidean distance matrix completion problem (EDMCP) is to determine the unspecified entries to make A an EDM. We survey three different approaches to solving the EDMCP. We advocate expressing the EDMCP as a non-convex optimization problem using the particle positions as variables and solving using a modified Newton or quasi-Newton method. To avoid local minima, we develop a randomized initialization technique that involves a nonlinear version of the classical multidimensional scaling, and a dimensionality relaxation scheme with optional weighting. Our experiments show that the method easily solves the artificial problems introduced by Mor{\'e} and Wu. It also solves the 12 much more difficult protein fragment problems introduced by Hendrickson, and the six larger protein problems introduced by Grooms, Lewis and Trosset. }, isbn = {1055-6788}, doi = {10.1080/10556788.2011.643888}, url = {http://www.tandfonline.com/doi/abs/10.1080/10556788.2011.643888}, author = {Fang,Haw-ren and O{\textquoteright}Leary, Dianne P.} } @article {14690, title = {Evaluating Dynamic Software Update Safety Using Systematic Testing}, journal = {IEEE Transactions on Software Engineering}, volume = {PP}, year = {2011}, pages = {1 - 1}, abstract = {Dynamic software updating (DSU) systems patch programs on the fly without incurring downtime. To avoid failures due to the updating process itself, many DSU systems employ timing restrictions. However, timing restrictions are theoretically imperfect, and their practical effectiveness is an open question. This paper presents the first significant empirical evaluation of three popular timing restrictions: activeness safety (AS), which prevents updates to active functions; con-freeness safety (CFS), which only allows modifications to active functions when doing so is provably type-safe; and manual identification of the event-handling loops during which an update may occur. We evaluated these timing restrictions using a series of DSU patches to three programs: OpenSSH, vsftpd, and ngIRCd. We systematically applied updates at each distinct update point reached during execution of a suite of system tests for these programs to determine which updates pass and which fail. We found that all three timing restrictions prevented most failures, but only manual identification allowed none. Further, although CFS and AS allowed many more update points, manual identification still supported updates with minimal delay. Finally, we found that manual identification required the least developer effort. Overall, we conclude that manual identification is most effective.}, keywords = {and serviceability, Availability, Computer Systems Organization, Delay, Manuals, Performance of Systems, reliability, Safety, servers, software, software engineering, Test execution, Testing and Debugging}, isbn = {0098-5589}, doi = {10.1109/TSE.2011.101}, author = {Hayden,C. and Smith,E. and Hardisty,E. and Hicks, Michael W. and Foster, Jeffrey S.} } @conference {13766, title = {Evaluating visual and statistical exploration of scientific literature networks}, booktitle = {2011 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC)}, year = {2011}, month = {2011/09/18/22}, pages = {217 - 224}, publisher = {IEEE}, organization = {IEEE}, abstract = {Action Science Explorer (ASE) is a tool designed to support users in rapidly generating readily consumable summaries of academic literature. It uses citation network visualization, ranking and filtering papers by network statistics, and automatic clustering and summarization techniques. We describe how early formative evaluations of ASE led to a mature system evaluation, consisting of an in-depth empirical evaluation with four domain experts. The evaluation tasks were of two types: predefined tasks to test system performance in common scenarios, and user-defined tasks to test the system{\textquoteright}s usefulness for custom exploration goals. The primary contribution of this paper is a validation of the ASE design and recommendations to provide: easy-to-understand metrics for ranking and filtering documents, user control over which document sets to explore, and overviews of the document set in coordinated views along with details-on-demand of specific papers. We contribute a taxonomy of features for literature search and exploration tools and describe exploration goals identified by our participants.}, keywords = {abstracting, academic literature, action science explorer, automatic clustering, citation analysis, citation network visualization, Communities, Context, custom exploration goal, Data visualization, Databases, Document filtering, document handling, document ranking, easy-to-understand metrics, empirical evaluation, Google, Graphical user interfaces, Information filtering, Information Visualization, Libraries, literature exploration, network statistics, paper filtering, paper ranking, scientific literature network, statistical exploration, summarization technique, user-defined tasks, visual exploration, Visualization}, isbn = {978-1-4577-1246-3}, doi = {10.1109/VLHCC.2011.6070403}, author = {Gove,R. and Dunne,C. and Shneiderman, Ben and Klavans,J. and Dorr, Bonnie J} } @conference {17144, title = {EventGraphs: Charting Collections of Conference Connections}, booktitle = {2011 44th Hawaii International Conference on System Sciences (HICSS)}, year = {2011}, month = {2011/01/04/7}, pages = {1 - 10}, publisher = {IEEE}, organization = {IEEE}, abstract = {EventGraphs are social media network diagrams of conversations related to events, such as conferences. Many conferences now communicate a common "hashtag" or keyword to identify messages related to the event. EventGraphs help make sense of the collections of connections that form when people follow, reply or mention one another and a keyword. This paper defines EventGraphs, characterizes different types, and shows how the social media network analysis add-in NodeXL supports their creation and analysis. The structural patterns to look for in EventGraphs are highlighted and design ideas for their improvement are discussed.}, keywords = {conference connections, Conferences, Data visualization, EventGraphs, hashtag, measurement, Media, message identification, multimedia computing, NodeXL, Real time systems, social media network diagrams, social networking (online), Twitter}, isbn = {978-1-4244-9618-1}, doi = {10.1109/HICSS.2011.196}, author = {Hansen,D. and Smith,M. A and Shneiderman, Ben} } @article {19191, title = {Every bit has a cost}, journal = {XRDS}, volume = {17}, year = {2011}, month = {2011}, pages = {5 - 5}, isbn = {1528-4972}, url = {http://doi.acm.org/10.1145/1961678.1961695}, author = {Jon Froehlich} } @article {14329, title = {Every bit has a cost}, journal = {XRDS}, volume = {17}, year = {2011}, month = {2011/06//}, pages = {5 - 5}, isbn = {1528-4972}, doi = {10.1145/1961678.1961695}, url = {http://doi.acm.org/10.1145/1961678.1961695}, author = {Jon Froehlich} } @article {14691, title = {Evolution in Action: Using Active Networking to Evolve Network Support for Mobility}, journal = {IFIP Lecture Notes in Computer Science (LNCS)}, volume = {2546}, year = {2011}, month = {2011///}, pages = {146 - 161}, abstract = {key early objective of Active Networking (AN) was to support on-the-fly network evolution. Although AN has been used relatively extensively to build application-customized protocols and even whole networking systems, demonstrations of evolution have been limited.}, author = {Hicks, Michael W. and Nettles,S. and Seong-Kyu,S. and Shannon,S.} } @article {18526, title = {The Evolution of Network Configuration: A Tale of Two Campuses}, journal = {Networks}, volume = {7}, year = {2011}, month = {2011///}, pages = {18 - 18}, abstract = {Studying network configuration evolution can improve our under- standing of the evolving complexity of networks and can be helpful in making network configuration less error-prone. Unfortunately, the nature of changes that operators make to network configuration is poorly understood. Towards improving our understanding, we examine and analyze five years of router, switch, and firewall con- figurations from two large campus networks using the logs from version control systems used to store the configurations. We study how network configuration is distributed across different network operations tasks and how the configuration for each task evolves over time, for different types of devices and for different loca- tions in the network. To understand the trends of how configura- tion evolves over time, we study the extent to which configuration for various tasks are added, modified, or deleted. We also study whether certain devices experience configuration changes more fre- quently than others, as well as whether configuration changes tend to focus on specific portions of the configuration (or on specific tasks). We also investigate when network operators make configu- ration changes of various types. Our results concerning configura- tion changes can help the designers of configuration languages un- derstand which aspects of configuration might be more automated or tested more rigorously and may ultimately help improve config- uration languages.}, author = {Kim,H. and Benson,T. and Akella,A. and Feamster, Nick} } @conference {12438, title = {The evolution of stochastic grammars for representation and recognition of activities in videos}, booktitle = {2011 IEEE International Conference on Computer Vision Workshops (ICCV Workshops)}, year = {2011}, month = {2011/11/06/13}, pages = {688 - 688}, publisher = {IEEE}, organization = {IEEE}, abstract = {The speaker is one of the privileged many to have been taught syntactic pattern recognition methods by the Late Prof. K.S. Fu. In this talk, I will discuss the evolution of stochastic image grammars from the early seventies to now with a focus on image and video understanding applications.}, keywords = {activity recognition, activity representation, Conferences, Educational institutions, Grammar, Image analysis, image recognition, image representation, image understanding, pattern recognition, stochastic image grammars, syntactic pattern recognition methods, video signal processing, video understanding, Videos}, isbn = {978-1-4673-0062-9}, doi = {10.1109/ICCVW.2011.6130309}, author = {Chellapa, Rama} } @article {12440, title = {Example-Driven Manifold Priors for Image Deconvolution}, journal = {Image Processing, IEEE Transactions on}, volume = {20}, year = {2011}, month = {2011/11//}, pages = {3086 - 3096}, abstract = {Image restoration methods that exploit prior information about images to be estimated have been extensively studied, typically using the Bayesian framework. In this paper, we consider the role of prior knowledge of the object class in the form of a patch manifold to address the deconvolution problem. Specifically, we incorporate unlabeled image data of the object class, say natural images, in the form of a patch-manifold prior for the object class. The manifold prior is implicitly estimated from the given unlabeled data. We show how the patch-manifold prior effectively exploits the available sample class data for regularizing the deblurring problem. Furthermore, we derive a generalized cross-validation (GCV) function to automatically determine the regularization parameter at each iteration without explicitly knowing the noise variance. Extensive experiments show that this method performs better than many competitive image deconvolution methods.}, keywords = {Bayesian, cross-validation, data;Bayes, deconvolution;image, determination;deblurring, estimation;, framework;GCV, function;automatic, function;image, image, image;patch-manifold, manifold, method;iteration, method;natural, methods;deconvolution;image, methods;natural, parameter, prior;generalized, prior;unlabeled, problem, regularization, regularization;example-driven, restoration, restoration;iterative, scenes;parameter}, isbn = {1057-7149}, doi = {10.1109/TIP.2011.2145386}, author = {Ni,Jie and Turaga,P. and Patel, Vishal M. and Chellapa, Rama} } @article {19272, title = {Exploiting Statically Schedulable Regions in Dataflow Programs}, journal = {Journal of Signal Processing Systems}, volume = {63}, year = {2011}, month = {2011}, pages = {129 - 142}, abstract = {Dataflow descriptions have been used in a wide range of Digital Signal Processing (DSP) applications, such as multi-media processing, and wireless communications. Among various forms of dataflow modeling, Synchronous Dataflow (SDF) is geared towards static scheduling of computational modules, which improves system performance and predictability. However, many DSP applications do not fully conform to the restrictions of SDF modeling. More general dataflow models, such as CAL (Eker and Janneck 2003), have been developed to describe dynamically-structured DSP applications. Such generalized models can express dynamically changing functionality, but lose the powerful static scheduling capabilities provided by SDF. This paper focuses on the detection of SDF-like regions in dynamic dataflow descriptions{\textemdash}in particular, in the generalized specification framework of CAL. This is an important step for applying static scheduling techniques within a dynamic dataflow framework. Our techniques combine the advantages of different dataflow languages and tools, including CAL (Eker and Janneck 2003), DIF (Hsu et al. 2005) and CAL2C (Roquier et al. 2008). In addition to detecting SDF-like regions, we apply existing SDF scheduling techniques to exploit the static properties of these regions within enclosing dynamic dataflow models. Furthermore, we propose an optimized approach for mapping SDF-like regions onto parallel processing platforms such as multi-core processors.}, keywords = {Cal, Circuits and Systems, Computer Imaging, Vision, Pattern Recognition and Graphics, Dataflow, DIF, Electrical Engineering, Image Processing and Computer Vision, multicore processors, pattern recognition, Quasi-static scheduling, Signal, Image and Speech Processing}, isbn = {1939-8018, 1939-8115}, url = {http://link.springer.com/article/10.1007/s11265-009-0445-1}, author = {Gu, Ruirui and Janneck, J{\"o}rn W. and Raulet, Micka{\"e}l and Bhattacharyya, Shuvra S.} } @conference {14469, title = {Exploiting statistical and relational information on the web and in social media}, booktitle = {Proceedings of the fourth ACM international conference on Web search and data mining}, series = {WSDM {\textquoteright}11}, year = {2011}, month = {2011///}, pages = {9 - 10}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {The popularity of Web 2.0, characterized by a proliferation of social media sites, and Web 3.0, with more richly semantically annotated objects and relationships, brings to light a variety of important prediction, ranking, and extraction tasks. The input to these tasks is often best seen as a (noisy) multi-relational graph, such as the click graph, defined by user interactions with Web sites; and the social graph, defined by friendships and affiliations on social media sites. This tutorial will provide an overview of statistical relational learning and inference techniques, motivating and illustrating them using web and social media applications. We will start by briefly surveying some of the sources of statistical and relational information on the web and in social media and will then dedicate most of the tutorial time to an introduction to representations and techniques for learning and reasoning with multi-relational information, viewing them through the lens of web and social media domains. We will end with a discussion of current trends and related fields, such as privacy in social networks.}, keywords = {graph analysis, probabilistic inference, query log data, social media, statistical relational learning}, isbn = {978-1-4503-0493-1}, doi = {10.1145/1935826.1935834}, url = {http://doi.acm.org/10.1145/1935826.1935834}, author = {Getoor, Lise and Mihalkova,Lilyana} } @conference {18210, title = {Exploring compression effects for improved source camera identification using strongly compressed video}, booktitle = {Image Processing (ICIP), 2011 18th IEEE International Conference on}, year = {2011}, month = {2011/09//}, pages = {1953 - 1956}, abstract = {This paper presents a study of the video compression effect on source camera identification based on the Photo-Response Non-Uniformity (PRNU). Specifically, the reliability of different types of frames in a compressed video is first investigated, which shows quantitatively that I-frames are more reliable than P-frames for PRNU estimation. Motivated by this observation, a new mechanism for estimating the reference PRNU and two mechanisms for estimating the test-video PRNU are proposed to achieve higher accuracy with fewer frames used. Experiments are performed to validate the effectiveness of the proposed mechanisms.}, keywords = {camera, cameras;video, coding;, compression;computer, compression;video, estimation;photoresponse, forensics;data, identification;video, non-uniformity;reliability;source, PRNU}, doi = {10.1109/ICIP.2011.6115855}, author = {Chuang,Wei-Hong and Su,Hui and M. Wu} } @article {15265, title = {Extracting Between-Pathway Models from E-MAP Interactions Using Expected Graph Compression}, journal = {Journal of Computational Biology}, volume = {18}, year = {2011}, month = {2011///}, pages = {379 - 390}, author = {Kelley,D. R and Kingsford, Carl} } @article {16037, title = {Extracting Insights from Electronic Health Records: Case Studies, a Visual Analytics Process Model, and Design Recommendations}, journal = {Journal of Medical Systems}, volume = {35}, year = {2011}, month = {2011///}, pages = {1135 - 1152}, abstract = {Current electronic health record (EHR) systems facilitate the storage, retrieval, persistence, and sharing of patient data. However, the way physicians interact with EHRs has not changed much. More specifically, support for temporal analysis of a large number of EHRs has been lacking. A number of information visualization techniques have been proposed to alleviate this problem. Unfortunately, due to their limited application to a single case study, the results are often difficult to generalize across medical scenarios. We present the usage data of Lifelines2 (Wang et al. 2008 ), our information visualization system, and user comments, both collected over eight different medical case studies. We generalize our experience into a visual analytics process model for multiple EHRs. Based on our analysis, we make seven design recommendations to information visualization tools to explore EHR systems.}, isbn = {0148-5598}, url = {http://dx.doi.org/10.1007/s10916-011-9718-x}, author = {Wang,Taowei and Wongsuphasawat,Krist and Plaisant, Catherine and Shneiderman, Ben} } @conference {12222, title = {The effect of packet loss on redundancy elimination in cellular wireless networks}, booktitle = {Proceedings of the 10th annual conference on Internet measurement}, series = {IMC {\textquoteright}10}, year = {2010}, month = {2010///}, pages = {294 - 300}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Network-level redundancy elimination (RE) algorithms reduce traffic volume on bandwidth-constrained network paths by avoiding the transmission of repeated byte sequences. Previous work shows that RE can suppress the transmission of 20-50\% bytes when deployed at ISP access links or between routers. In this paper, we focus on the challenges of deploying RE in cellular networks. The potential benefifit is substantial, since cellular networks have a growing subscriber base and network links, including wired backhaul, are often oversubscribed. Using three large traces captured at two North American and one European wireless network providers, we show that RE can reduce the bandwidth consumption of the majority of mobile users by at least 10\%. However, cellular links have much higher packet loss rates than their wired counterparts, which makes applying RE much more difficult. Our experiments also show that the loss of only a few packets can disrupt RE and eliminate the bandwidth savings. We propose informed marking, a lightweight scheme that detects lost packets and prevents RE algorithms from using them for future encodings. We implement RE with informed marking and deploy it in a real-world cellular network. Our results show that with informed marking, more than 60\% of the bandwidth savings of RE are preserved, even when packet loss rates are high.}, keywords = {cellular networks, loss, redundancy elimination}, isbn = {978-1-4503-0483-2}, doi = {10.1145/1879141.1879179}, url = {http://doi.acm.org/10.1145/1879141.1879179}, author = {Lumezanu,Cristian and Guo,Katherine and Spring, Neil and Bhattacharjee, Bobby} } @article {12872, title = {Effect on Human Cells of Environmental Vibrio Parahaemolyticus Strains Carrying Type III Secretion System 2}, journal = {Infection and ImmunityInfect. Immun.}, volume = {78}, year = {2010}, month = {2010/07/01/}, pages = {3280 - 3287}, abstract = {Vibrio parahaemolyticus is an inhabitant of estuarine and marine environments that causes seafood-borne gastroenteritis worldwide. Recently, a type 3 secretion system (T3SS2) able to secrete and translocate virulence factors into the eukaryotic cell has been identified in a pathogenicity island (VP-PAI) located on the smaller chromosome. These virulence-related genes have previously been detected only in clinical strains. Classical virulence genes for this species (tdh, trh) are rarely detected in environmental strains, which are usually considered to lack virulence potential. However, during screening of a collection of environmental V. parahaemolyticus isolates obtained in the North Adriatic Sea in Italy, a number of marine strains carrying virulence-related genes, including genes involved in the T3SS2, were detected. In this study, we investigated the pathogenic potential of these marine V. parahaemolyticus strains by studying their adherence ability, their cytotoxicity, their effect on zonula occludin protein 1 (ZO-1) of the tight junctions, and their effect on transepithelial resistance (TER) in infected Caco-2 cells. By performing a reverse transcription-PCR, we also tested the expression of the T3SS2 genes vopT and vopB2, encoding an effector and a translocon protein, respectively. Our results indicate that, similarly to clinical strains, marine V. parahaemolyticus strains carrying vopT and vopB2 and that other genes included in the VP-PAI are capable of adhering to human cells and of causing cytoskeletal disruption and loss of membrane integrity in infected cells. On the basis of data presented here, environmental V. parahaemolyticus strains should be included in coastal water surveillance plans, as they may represent a risk for human health.}, isbn = {0019-9567, 1098-5522}, doi = {10.1128/IAI.00050-10}, url = {http://iai.asm.org/content/78/7/3280}, author = {Caburlotto,Greta and Lle{\`o},Maria M. and Hilton,Tamara and Huq,Anwar and Rita R Colwell and Kaper,James B.} } @article {12477, title = {An Efficient and Robust Algorithm for Shape Indexing and Retrieval}, journal = {Multimedia, IEEE Transactions on}, volume = {12}, year = {2010}, month = {2010/08//}, pages = {372 - 385}, abstract = {Many shape matching methods are either fast but too simplistic to give the desired performance or promising as far as performance is concerned but computationally demanding. In this paper, we present a very simple and efficient approach that not only performs almost as good as many state-of-the-art techniques but also scales up to large databases. In the proposed approach, each shape is indexed based on a variety of simple and easily computable features which are invariant to articulations, rigid transformations, etc. The features characterize pairwise geometric relationships between interest points on the shape. The fact that each shape is represented using a number of distributed features instead of a single global feature that captures the shape in its entirety provides robustness to the approach. Shapes in the database are ordered according to their similarity with the query shape and similar shapes are retrieved using an efficient scheme which does not involve costly operations like shape-wise alignment or establishing correspondences. Depending on the application, the approach can be used directly for matching or as a first step for obtaining a short list of candidate shapes for more rigorous matching. We show that the features proposed to perform shape indexing can be used to perform the rigorous matching as well, to further improve the retrieval performance.}, keywords = {activity, algorithm;shape, classification;human, databases;robust, estimation;large, indexing;shape, MATCHING, matching;image, methods;shape, pose, recognition;, retrieval;image, retrieval;indexing;shape}, isbn = {1520-9210}, doi = {10.1109/TMM.2010.2050735}, author = {Biswas,S. and Aggarwal,G. and Chellapa, Rama} } @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 {15171, title = {Efficient rational secret sharing in standard communication networks}, journal = {Theory of Cryptography}, year = {2010}, month = {2010///}, pages = {419 - 436}, abstract = {We propose a new methodology for rational secret sharing leading to various instantiations (in both the two-party and multi-party settings) that are simple and efficient in terms of computation, share size, and round complexity. Our protocols do not require physical assumptions or simultaneous channels, and can even be run over asynchronous, point-to-point networks.We also propose new equilibrium notions (namely, computational versions of strict Nash equilibrium and stability with respect to trembles) and prove that our protocols satisfy them. These notions guarantee, roughly speaking, that at each point in the protocol there is a unique legal message a party can send. This, in turn, ensures that protocol messages cannot be used as subliminal channels, something achieved in prior work only by making strong assumptions on the communication network. }, doi = {10.1007/978-3-642-11799-2_25}, author = {Fuchsbauer,G. and Katz, Jonathan and Naccache,D.} } @conference {19289, title = {Efficient static buffering to guarantee throughput-optimal FPGA implementation of synchronous dataflow graphs}, booktitle = {2010 International Conference on Embedded Computer Systems (SAMOS)}, year = {2010}, month = {2010}, pages = {136 - 143}, abstract = {When designing DSP applications for implementation on field programmable gate arrays (FPGAs), it is often important to minimize consumption of limited FPGA resources while satisfying real-time performance constraints. In this paper, we develop efficient techniques to determine dataflow graph buffer sizes that guarantee throughput-optimal execution when mapping synchronous dataflow (SDF) representations of DSP applications onto FPGAs. Our techniques are based on a novel two-actor SDF graph Model (TASM), which efficiently captures the behavior and costs associated with SDF graph edges (flow-graph connections). With our proposed techniques, designers can automatically generate upper bounds on SDF graph buffer distributions that realize maximum achievable throughput performance for the corresponding applications. Furthermore, our proposed technique is characterized by low polynomial time complexity, which is useful for rapid prototyping in DSP system design.}, keywords = {buffer memory, circuit complexity, Complexity theory, Computational modeling, data flow graphs, Digital signal processing, digital signal processing chips, DSP system design, efficient static buffering, Field programmable gate arrays, FPGA, graph buffer distributions, integrated circuit design, low polynomial time complexity, Random access memory, Schedules, SDF graph edges, Signal processing systems, Synchronous dataflow, synchronous dataflow graph mapping, Throughput, throughput-optimal execution, throughput-optimal FPGA implementation, two-actor SDF graph model, upper bounds}, author = {Kee, Hojin and Bhattacharyya, Shuvra S. and Kornerup, J.} } @article {15383, title = {Electromagnetic Modeling of Ethernet Transformers}, journal = {Magnetics, IEEE Transactions on}, volume = {46}, year = {2010}, month = {2010/02//}, pages = {563 - 569}, abstract = {The unique features of Ethernet transformers are reviewed, and novel testing techniques for identification of lumped parameters of equivalent circuits are presented. To account for the distributed nature of the cross-winding and intrawinding capacitances, novel distributed models for electromagnetic analysis of Ethernet transformers are presented.}, keywords = {analysis;electromagnetic, area, capacitances;lumped, circuits;ethernet, circuits;local, cross-winding;distributed, modeling;equivalent, models;electromagnetic, networks;lumped, networks;transformer, parameter, parameters;novel, techniques;capacitance;equivalent, Testing, transformers;intrawinding, windings;transformers;}, isbn = {0018-9464}, doi = {10.1109/TMAG.2009.2033203}, author = {Bowen,D. and Mayergoyz, Issak D and Krafft,C.} } @conference {18902, title = {Emergence of cooperative societies in evolutionary games}, series = {GECCO {\textquoteright}10}, year = {2010}, month = {2010///}, pages = {1793 - 1800}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {We utilize evolutionary game theory to study the evolution of cooperative societies and the behaviors of individual agents (i.e., players) in it. We present a novel player model based upon empirical evidence from the social and behavioral sciences, stating that: (1) an individual{\textquoteright}s behavior may often be motivated not only by self-interest but also by the consequences for the others, and (2) individuals vary in their interpersonal social tendencies, which reflect stable personal orientations that influence their choices. Alongside the formal player model we provide an analysis that considers possible interactions between different types of individuals. We present series of evolutionary simulations that ratify previous findings on evolution of cooperation, and provide new insights on the evolutionary process of cooperative behavior in a society as well as on the emergence of cooperative societies. Our main experimental result demonstrate that in contrast to previous common knowledge, increasing the value of mutual Reward or increasing mutual Punishment in the Prisoner{\textquoteright}s dilemma game do not result in the same type of cooperative society: while increasing R does result in a more cooperative society, increasing P does not.}, keywords = {evolutionary game theory, social orientations}, isbn = {978-1-4503-0073-5}, doi = {10.1145/1830761.1830805}, url = {http://doi.acm.org/10.1145/1830761.1830805}, author = {Cheng,Kan-Leung and Zuckerman,Inon and Kuter,Ugur and Nau, Dana S.} } @conference {15260, title = {Energy efficient scheduling via partial shutdown}, booktitle = {Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms}, series = {SODA {\textquoteright}10}, year = {2010}, month = {2010///}, pages = {1360 - 1372}, publisher = {Society for Industrial and Applied Mathematics}, organization = {Society for Industrial and Applied Mathematics}, address = {Philadelphia, PA, USA}, abstract = {Motivated by issues of saving energy in data centers we define a collection of new problems referred to as "machine activation" problems. The central framework we introduce considers a collection of m machines (unrelated or related) with each machine i having an activation cost of ai. There is also a collection of n jobs that need to be performed, and pi, j is the processing time of job j on machine i. Standard scheduling models assume that the set of machines is fixed and all machines are available. However, in our setting, we assume that there is an activation cost budget of A - we would like to select a subset S of the machines to activate with total cost a(S) <= A and find a schedule for the n jobs on the machines in S minimizing the makespan (or any other metric). We consider both the unrelated machines setting, as well as the setting of scheduling uniformly related parallel machines, where machine i has activation cost ai and speed si, and the processing time of job j on machine i is pi, j = pjsi, where pj is the processing requirement of job j. For the general unrelated machine activation problem, our main results are that if there is a schedule with makespan T and activation cost A then we can obtain a schedule with makespan (2 + ε)T and activation cost 2(1 + 1/ε)(ln n/OPT + 1)A, for any ε > 0. We also consider assignment costs for jobs as in the generalized assignment problem, and using our framework, provide algorithms that minimize the machine activation and the assignment cost simultaneously. In addition, we present a greedy algorithm which only works for the basic version and yields a makespan of 2T and an activation cost A(1 + ln n). For the uniformly related parallel machine sceduling problem, we develop a polynomial time approximation scheme that outputs a schedule with the property that the activation cost of the subset of machines is at most A and the makespan is at most (1 + ε)T for any ε > 0. For the special case of m identical speed machines, the machine activation problem is trivial, since the cheapest subset of k machines is always the best choice if the optimal solution activates k machines. In addition, we consider the case whem some jobs can be dropped (and are treated as outliers).}, isbn = {978-0-898716-98-6}, url = {http://dl.acm.org/citation.cfm?id=1873601.1873711}, author = {Khuller, Samir and Li,Jian and Saha,Barna} } @article {19293, title = {Energy-driven distribution of signal processing applications across wireless sensor networks}, journal = {ACM Trans. Sen. Netw.}, volume = {6}, year = {2010}, month = {2010}, pages = {24:1 - 24:32}, abstract = {Wireless sensor network (WSN) applications have been studied extensively in recent years. Such applications involve resource-limited embedded sensor nodes that have small size and low power requirements. Based on the need for extended network lifetimes in WSNs in terms of energy use, the energy efficiency of computation and communication operations in the sensor nodes becomes critical. Digital Signal Processing (DSP) applications typically require intensive data processing operations and as a result are difficult to implement directly in resource-limited WSNs. In this article, we present a novel design methodology for modeling and implementing computationally intensive DSP applications applied to wireless sensor networks. This methodology explores efficient modeling techniques for DSP applications, including data sensing and processing; derives formulations of Energy-Driven Partitioning (EDP) for distributing such applications across wireless sensor networks; and develops efficient heuristic algorithms for finding partitioning results that maximize the network lifetime. To address such an energy-driven partitioning problem, this article provides a new way of aggregating data and reducing communication traffic among nodes based on application analysis. By considering low data token delivery points and the distribution of computation in the application, our approach finds energy-efficient trade-offs between data communication and computation.}, keywords = {DSP, Energy efficiency, network lifetime, Speech recognition, Wireless sensor networks}, isbn = {1550-4859}, url = {http://doi.acm.org/10.1145/1754414.1754420}, author = {Chung-Ching Shen and Plishker, William L. and Ko,Dong-Ik and Bhattacharyya, Shuvra S. and Goldsman,Neil} } @article {12880, title = {Environmental reservoirs of Vibrio cholerae and their role in cholera}, journal = {Environmental Microbiology Reports}, volume = {2}, year = {2010}, month = {2010/01/15/}, pages = {27 - 33}, abstract = {In the aquatic environment, Vibrio cholerae has been reported to be associated with a variety of living organisms, including animals with an exoskeleton of chitin, aquatic plants, protozoa, bivalves, waterbirds, as well as abiotic substrates (e.g. sediments). Most of these are well-known or putative environmental reservoirs for the bacterium, defined as places where the pathogen lives over time, with the potential to be released and to cause human infection. Environmental reservoirs also serve as V. cholerae disseminators and vectors. They can be responsible for the start of an epidemic, may be critical to cholera endemicity, and affect the evolution of pathogen virulence. To date, in addition to the generally recognized role of zooplankton as the largest environmental reservoir for V. cholerae, other environmental reservoirs play some role in cholera epidemiology by favouring persistence of the pathogen during inter-epidemic periods. Little is known about the ecological factors affecting V. cholerae survival in association with aquatic substrates. Studies aimed at these aspects, i.e. understanding how environmental reservoirs interact, are affected by climate, and contribute to disease epidemiology, will be useful for understanding global implications of V. cholerae and the disease cholera.}, isbn = {1758-2229}, doi = {10.1111/j.1758-2229.2009.00128.x}, url = {http://onlinelibrary.wiley.com/doi/10.1111/j.1758-2229.2009.00128.x/abstract?userIsAuthenticated=false\&deniedAccessCustomisedMessage=}, author = {Vezzulli,Luigi and Pruzzo,Carla and Huq,Anwar and Rita R Colwell} } @conference {16685, title = {Error driven paraphrase annotation using Mechanical Turk}, booktitle = {Proceedings of the NAACL HLT 2010 Workshop on Creating Speech and Language Data with Amazon{\textquoteright}s Mechanical Turk}, year = {2010}, month = {2010///}, pages = {217 - 221}, author = {Buzek,O. and Resnik, Philip and Bederson, Benjamin B.} } @article {19585, title = {Evaluating Call-By-Need on the Control Stack}, journal = {arXiv:1009.3174 [cs]}, year = {2010}, note = {Comment: Symposium on Trends in Functional Programming (TFP 2010), Norman, Oklahoma, May 2010}, month = {2010/09/16/}, abstract = {Ariola and Felleisen{\textquoteright}s call-by-need {\lambda}-calculus replaces a variable occurrence with its value at the last possible moment. To support this gradual notion of substitution, function applications-once established-are never discharged. In this paper we show how to translate this notion of reduction into an abstract machine that resolves variable references via the control stack. In particular, the machine uses the static address of a variable occurrence to extract its current value from the dynamic control stack.}, keywords = {Computer Science - Programming Languages, D.3.1}, url = {http://arxiv.org/abs/1009.3174}, author = {Chang, Stephen and David Van Horn and Felleisen, Matthias} } @article {15882, title = {Evaluation of information retrieval for E-discovery}, journal = {Artificial Intelligence and Law}, volume = {18}, year = {2010}, month = {2010/08/10/}, pages = {347 - 386}, isbn = {0924-8463, 1572-8382}, doi = {10.1007/s10506-010-9093-9}, url = {http://www.springerlink.com/content/m700w2k26n264u01/}, author = {Oard, Douglas and Baron,Jason R. and Hedin,Bruce and Lewis,David D. and Tomlinson,Stephen} } @conference {12472, title = {Evaluation of state-of-the-art algorithms for remote face recognition}, booktitle = {Image Processing (ICIP), 2010 17th IEEE International Conference on}, year = {2010}, month = {2010/09//}, pages = {1581 - 1584}, abstract = {In this paper, we describe a remote face database which has been acquired in an unconstrained outdoor environment. The face images in this database suffer from variations due to blur, poor illumination, pose, and occlusion. It is well known that many state-of-the-art still image-based face recognition algorithms work well, when constrained (frontal, well illuminated, high-resolution, sharp, and complete) face images are presented. In this paper, we evaluate the effectiveness of a subset of existing still image-based face recognition algorithms for the remote face data set. We demonstrate that in addition to applying a good classification algorithm, consistent detection of faces with fewer false alarms and finding features that are robust to variations mentioned above are very important for remote face recognition. Also setting up a comprehensive metric to evaluate the quality of face images is necessary in order to reject images that are of low quality.}, keywords = {alarm;feature, algorithm;still, classification;image, classification;visual, database;remote, databases;, extraction;hidden, extraction;image, Face, feature, image-based, image;false, quality;occlusion;remote, recognition;face, recognition;feature, recognition;state-of-the-art, removal;image}, doi = {10.1109/ICIP.2010.5652608}, author = {Ni,Jie and Chellapa, Rama} } @article {12426, title = {Evaluation of the Interaction of Cyclin-Dependent Kinase 5 with Activator p25 and with p25-Derived Inhibitor CIP}, journal = {Journal of Computational Biology}, volume = {17}, year = {2010}, month = {2010///}, pages = {707 - 721}, author = {Cardone, Antonio and Albers,R.W. and Sriram,R.D. and Pant,H.C.} } @article {18903, title = {Evolution of state-dependent risk preferences}, journal = {ACM Transactions on Intelligent Systems and Technology (TIST)}, volume = {1}, year = {2010}, month = {2010/10//}, pages = {6:1{\textendash}6:21 - 6:1{\textendash}6:21}, abstract = {Researchers have invested much effort in constructing models of the state-dependent (sometimes risk-averse and sometimes risk-prone) nature of human decision making. An important open question is how state-dependent risk behavior can arise and remain prominent in populations. We believe that one part of the answer is the interplay between risk-taking and sequentiality of choices in populations subject to evolutionary population dynamics. To support this hypothesis, we provide simulation and analytical results for evolutionary lottery games, including results on evolutionary stability. We consider a parameterized class of imitation dynamics in which the parameter 0 <= α <= 1 yields the replicator dynamic with α = 1 and the imitate-the-better dynamic with α = 0. Our results demonstrate that for every population dynamic in this class except for the replicator dynamic, the interplay between risk-taking and sequentiality of choices allows state-dependent risk behavior to have an evolutionary advantage over expected-value maximization.}, keywords = {decision theory, Evolutionary games, Population Dynamics, risk}, isbn = {2157-6904}, doi = {10.1145/1858948.1858954}, url = {http://doi.acm.org/10.1145/1858948.1858954}, author = {Roos,Patrick and Carr,J. Ryan and Nau, Dana S.} } @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} } @conference {16416, title = {Evolving viral marketing strategies}, booktitle = {Proceedings of the 12th annual conference on Genetic and evolutionary computation}, series = {GECCO {\textquoteright}10}, year = {2010}, month = {2010///}, pages = {1195 - 1202}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {One method of viral marketing involves seeding certain consumers within a population to encourage faster adoption of the product throughout the entire population. However, determining how many and which consumers within a particular social network should be seeded to maximize adoption is challenging. We define a strategy space for consumer seeding by weighting a combination of network characteristics such as average path length, clustering coefficient, and degree. We measure strategy effectiveness by simulating adoption on a Bass-like agent-based model, with five different social network structures: four classic theoretical models (random, lattice, small-world, and preferential attachment) and one empirical (extracted from Twitter friendship data). To discover good seeding strategies, we have developed a new tool, called BehaviorSearch, which uses genetic algorithms to search through the parameter-space of agent-based models. This evolutionary search also provides insight into the interaction between strategies and network structure. Our results show that one simple strategy (ranking by node degree) is near-optimal for the four theoretical networks, but that a more nuanced strategy performs significantly better on the empirical Twitter-based network. We also find a correlation between the optimal seeding budget for a network, and the inequality of the degree distribution.}, keywords = {Agent-based modeling, business, diffusion, Genetic algorithms, simulation, social networks, viral marketing}, isbn = {978-1-4503-0072-8}, doi = {10.1145/1830483.1830701}, url = {http://doi.acm.org/10.1145/1830483.1830701}, author = {Stonedahl,Forrest and Rand, William and Wilensky,Uri} } @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 {15267, title = {Exploring Biological Network Dynamics with Ensembles of Graph Partitions}, booktitle = {Proceedings of the PSB Pacific Symposium on Biocomputing}, volume = {15}, year = {2010}, month = {2010///}, pages = {166 - 177}, author = {Navlakha,S. and Kingsford, Carl} } @article {17152, title = {Exploring distributions: design and evaluation}, journal = {University of Maryland, Human-Computer Interaction Lab Tech Report HCIL-2010-01}, year = {2010}, month = {2010///}, abstract = {Visual overviews of tables of numerical and categorical data have been proposed for tables with a single value per cell.In this paper we address the problem of exploring tables including columns consisting of distributions, e.g. the distributions of movie ratings or trust ratings in recommender systems, age distributions in demographic data, usage distributions in logs of telephone calls etc. We propose a novel way of displaying and interacting with distribution data, and present the results of a usability study that demonstrates the benefits of the interface in providing an overview of the data and facilitating the discovery of interesting clusters, patterns, outliers and relationships between columns. }, author = {Sopan,A. and Freire,M. and Taieb-Maimon,M. and Golbeck,J. and Shneiderman, Ben} } @conference {16054, title = {Exploring temporal patterns with information visualization: keynote}, booktitle = {Proceedings of Graphics Interface 2010}, series = {GI {\textquoteright}10}, year = {2010}, month = {2010///}, pages = {1 - 2}, publisher = {Canadian Information Processing Society}, organization = {Canadian Information Processing Society}, address = {Toronto, Ont., Canada, Canada}, abstract = {After an overview of visualizations to explore temporal patterns, we will focus on interfaces for discovering temporal event patterns in electronic health records. Specifying event sequence queries is challenging even for skilled computer professionals familiar with SQL. Our novel interactive search strategies allow for aligning records on important events, ranking, and filtering combined with grouping of results to find common or rare events. A second approach is to use query-by-example, in which users specify a pattern and see a similarity-ranked list of results, but the similarity measure needs to be customized for different needs. Temporal summaries allow comparisons between groups. We will discuss the methods we use to evaluate the usefulness of our interfaces through collaborations with clinicians and hospital administrators on case studies. Finally, application of the techniques to other domains will be discussed.}, keywords = {electronic health records, search interfaces}, isbn = {978-1-56881-712-5}, url = {http://dl.acm.org/citation.cfm?id=1839214.1839216}, author = {Plaisant, Catherine} } @article {18702, title = {Exploring the Linkage Dependence of Polyubiquitin Conformations Using Molecular Modeling}, journal = {Journal of Molecular Biology}, volume = {395}, year = {2010}, month = {2010/01/29/}, pages = {803 - 814}, abstract = {Posttranslational modification of proteins by covalent attachment of a small protein ubiquitin (Ub) or a polymeric chain of Ub molecules (called polyubiquitin) is involved in controlling a vast variety of processes in eukaryotic cells. The question of how different polyubiquitin signals are recognized is central to understanding the specificity of various types of polyubiquitination. In polyubiquitin, monomers are linked to each other via an isopeptide bond between the C-terminal glycine of one Ub and a lysine of the other. The functional outcome of polyubiquitination depends on the particular lysine involved in chain formation and appears to rely on linkage-dependent conformation of polyubiquitin. Thus, K48-linked chains, a universal signal for proteasomal degradation, under physiological conditions adopt a closed conformation where functionally important residues L8, I44, and V70 are sequestered at the interface between two adjacent Ub monomers. By contrast, K63-linked chains, which act as a nonproteolytic regulatory signal, adopt an extended conformation that lacks hydrophobic interubiquitin contact. Little is known about the functional roles of the so-called {\textquotedblleft}noncanonical{\textquotedblright} chains (linked via K6, K11, K27, K29, or K33, or linked head-to-tail), and no structural information on these chains is available, except for information on the crystal structure of the head-to-tail-linked diubiquitin (Ub2). In this study, we use molecular modeling to examine whether any of the noncanonical chains can adopt a closed conformation similar to that in K48-linked polyubiquitin. Our results show that the eight possible Ub2 chains can be divided into two groups: chains linked via K6, K11, K27, or K48 are predicted to form a closed conformation, whereas chains linked via K29, K33, or K63, or linked head-to-tail are unable to form such a contact due to steric occlusion. These predictions are validated by the known structures of K48-, K63-, and head-to-tail-linked chains. Our study also predicts structural models for Ub2 chains linked via K6, K11, or K27. The implications of these findings for linkage-selective recognition of noncanonical polyubiquitin signals by various receptors are discussed.}, keywords = {head-to-tail, isopeptide linkage, modeling, noncanonical linkage, polyubiquitin}, isbn = {0022-2836}, doi = {10.1016/j.jmb.2009.10.039}, url = {http://www.sciencedirect.com/science/article/pii/S0022283609012790}, author = {Fushman, David and Walker,Olivier} } @conference {15874, title = {Exploring the Relationships among ICTs: A Scalable Computational Approach Using KL Divergence and Hierarchical Clustering}, booktitle = {Hawaii International Conference on System Sciences}, year = {2010}, month = {2010///}, pages = {1 - 10}, publisher = {IEEE Computer Society}, organization = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, abstract = {Different information and communication technologies (ICTs) are related in complex ways and, accordingly, their diffusion trajectories are related, too. How can the relationships among multiple ICTs be described and analyzed in a scalable way? In this study, we offer a scalable methodology, based on computational analysis of discourse, to examine the relationships among ICTs. Specifically, we employed Kullback-Leibler (KL) divergence to compare the semantic similarity of forty-seven ICTs discussed in the trade magazine InformationWeek over a decade. Using hierarchical clustering, we have found that the similarity of the technologies can be mapped in a hierarchy and similar technologies demonstrated similar discourses. The results establish the validity of our approach and demonstrate its scalability and richness. This analytical approach not only enables diffusion researchers to undertake multi-innovation, multi-source, and multi-period studies, but also helps practitioners effectively adopt and efficiently use new ICTs in their organizations.}, isbn = {978-0-7695-3869-3}, doi = {http://doi.ieeecomputersociety.org/10.1109/HICSS.2010.203}, author = {Tsui,Chia-jung and Wang,Ping and Fleischmann,Kenneth R. and Oard, Douglas and Sayeed,Asad B.} } @conference {18943, title = {Expresses-an-opinion-about: using corpus statistics in an information extraction approach to opinion mining}, series = {COLING {\textquoteright}10}, year = {2010}, month = {2010///}, pages = {1095 - 1103}, publisher = {Association for Computational Linguistics}, organization = {Association for Computational Linguistics}, address = {Stroudsburg, PA, USA}, abstract = {We present a technique for identifying the sources and targets of opinions without actually identifying the opinions themselves. We are able to use an information extraction approach that treats opinion mining as relation mining; we identify instances of a binary "expresses-an-opinion-about" relation. We find that we can classify source-target pairs as belonging to the relation at a performance level significantly higher than two relevant baselines. This technique is particularly suited to emerging approaches in corpus-based social science which focus on aggregating interactions between sources to determine their effects on socio-economically significant targets. Our application is the analysis of information technology (IT) innovations. This is an example of a more general problem where opinion is expressed using either sub- or supersets of expressive words found in newswire. We present an annotation scheme and an SVM-based technique that uses the local context as well as the corpus-wide frequency of a source-target pair as data to determine membership in "expresses-an-opinion-about". While the presence of conventional subjectivity keywords appears significant in the success of this technique, we are able to find the most domain-relevant keywords without sacrificing recall.}, url = {http://dl.acm.org/citation.cfm?id=1944566.1944692}, author = {Sayeed,Asad B. and Nguyen,Hieu C. and Meyer,Timothy J. and Weinberg, Amy} } @conference {13364, title = {Ef?cient Query Evaluation over Temporally Correlated Probabilistic Streams}, booktitle = {IEEE 25th International Conference on Data Engineering, 2009. ICDE {\textquoteright}09}, year = {2009}, month = {2009/04/29/March}, pages = {1315 - 1318}, publisher = {IEEE}, organization = {IEEE}, abstract = {In this paper, we address the problem of efficient query evaluation over highly correlated probabilistic streams. We observe that although probabilistic streams tend to be strongly correlated in space and time, the correlations are usually quite structured (i.e., the same set of dependencies and independences repeat across time) and Markovian (i.e., the state at time "t+1" is independent of the states at previous times given the state at time "t"). We exploit this observation to compactly encode probabilistic streams by decoupling the correlation structure (the set of dependencies) from the actual probability values. We develop novel stream processing operators that can efficiently and incrementally process new data items; our operators are based on the previously proposed framework of viewing probabilistic query evaluation as inference over probabilistic graphical models (PGMs) [P. Sen and A. Deshpande, 2007]. We develop a query planning algorithm that constructs efficient query plans that are executable in polynomial-time whenever possible, and we characterize queries for which such plans are not possible. Finally we conduct an extensive experimental evaluation that illustrates the advantages of exploiting the structured nature of correlations in probabilistic streams.}, keywords = {Birds, Computerized monitoring, correlated probabilistic streams, correlation structure, Data engineering, data mining, Databases, Event detection, Graphical models, inference mechanisms, Markov processes, polynomial time, probabilistic database, probabilistic graphical model, probabilistic query evaluation, query evaluation, query planning algorithm, query plans, Query processing, Random variables, stream processing operator, Streaming media}, isbn = {978-1-4244-3422-0}, doi = {10.1109/ICDE.2009.229}, author = {Kanagal,B. and Deshpande, Amol} } @article {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} } @article {15127, title = {Efficient and secure authenticated key exchange using weak passwords}, journal = {Journal of the ACM (JACM)}, volume = {57}, year = {2009}, month = {2009/11//}, pages = {3:1{\textendash}3:39 - 3:1{\textendash}3:39}, abstract = {Mutual authentication and authenticated key exchange are fundamental techniques for enabling secure communication over public, insecure networks. It is well known how to design secure protocols for achieving these goals when parties share high-entropy cryptographic keys in advance of the authentication stage. Unfortunately, it is much more common for users to share weak, low-entropy passwords which furthermore may be chosen from a known space of possibilities (say, a dictionary of English words). In this case, the problem becomes much more difficult as one must ensure that protocols are immune to off-line dictionary attacks in which an adversary exhaustively enumerates all possible passwords in an attempt to determine the correct one. We propose a 3-round protocol for password-only authenticated key exchange, and provide a rigorous proof of security for our protocol based on the decisional Diffie-Hellman assumption. The protocol assumes only public parameters{\textemdash}specifically, a {\textquotedblleft}common reference string{\textquotedblright}{\textemdash}which can be {\textquotedblleft}hard-coded{\textquotedblright} into an implementation of the protocol; in particular, and in contrast to some previous work, our protocol does not require either party to pre-share a public key. The protocol is also remarkably efficient, requiring computation only (roughly) 4 times greater than {\textquotedblleft}classical{\textquotedblright} Diffie-Hellman key exchange that provides no authentication at all. Ours is the first protocol for password-only authentication that is both practical and provably-secure using standard cryptographic assumptions.}, keywords = {Authentication, cryptography, passwords}, isbn = {0004-5411}, doi = {10.1145/1613676.1613679}, url = {http://doi.acm.org/10.1145/1613676.1613679}, author = {Katz, Jonathan and Ostrovsky,Rafail and Yung,Moti} } @conference {11907, title = {Efficient band approximation of Gram matrices for large scale kernel methods on GPUs}, booktitle = {Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis}, series = {SC {\textquoteright}09}, year = {2009}, month = {2009///}, pages = {31:1{\textendash}31:10 - 31:1{\textendash}31:10}, publisher = {ACM}, organization = {ACM}, address = {Portland, Oregon}, abstract = {Kernel-based methods require O(N2) time and space complexities to compute and store non-sparse Gram matrices, which is prohibitively expensive for large scale problems. We introduce a novel method to approximate a Gram matrix with a band matrix. Our method relies on the locality preserving properties of space filling curves, and the special structure of Gram matrices. Our approach has several important merits. First, it computes only those elements of the Gram matrix that lie within the projected band. Second, it is simple to parallelize. Third, using the special band matrix structure makes it space efficient and GPU-friendly. We developed GPU implementations for the Affinity Propagation (AP) clustering algorithm using both our method and the COO sparse representation. Our band approximation is about 5 times more space efficient and faster to construct than COO. AP gains up to 6x speedup using our method without any degradation in its clustering performance.}, keywords = {affinity propagation, algorithms, gpu}, isbn = {978-1-60558-744-8}, doi = {10.1145/1654059.1654091}, author = {Hussein,Mohamed and Abd-Almageed, Wael} } @article {12095, title = {Efficient peer-to-Peer lookup in multi-hop wireless networks}, journal = {KSII Trans. Internet and Information Systems}, volume = {3}, year = {2009}, month = {2009///}, pages = {5 - 25}, author = {Shin,M. and Arbaugh, William A.} } @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} } @conference {13972, title = {Efficient subset selection via the kernelized R{\'e}nyi distance}, booktitle = {Computer Vision, 2009 IEEE 12th International Conference on}, year = {2009}, month = {2009///}, pages = {1081 - 1088}, abstract = {With improved sensors, the amount of data available in many vision problems has increased dramatically and allows the use of sophisticated learning algorithms to perform inference on the data. However, since these algorithms scale with data size, pruning the data is sometimes necessary. The pruning procedure must be statistically valid and a representative subset of the data must be selected without introducing selection bias. Information theoretic measures have been used for sampling the data, retaining its original information content. We propose an efficient Rényi entropy based subset selection algorithm. The algorithm is first validated and then applied to two sample applications where machine learning and data pruning are used. In the first application, Gaussian process regression is used to learn object pose. Here it is shown that the algorithm combined with the subset selection is significantly more efficient. In the second application, our subset selection approach is used to replace vector quantization in a standard object recognition algorithm, and improvements are shown.}, author = {Srinivasan,B.V. and Duraiswami, Ramani} } @conference {14278, title = {Efficient systematic testing for dynamically updatable software}, booktitle = {Proceedings of the 2nd International Workshop on Hot Topics in Software Upgrades}, year = {2009}, month = {2009///}, pages = {9 - 9}, author = {Hayden,C.M. and Hardisty,E.A. and Hicks, Michael W. and Foster, Jeffrey S.} } @conference {14689, title = {Efficient systematic testing for dynamically updatable software}, booktitle = {Proceedings of the 2nd International Workshop on Hot Topics in Software Upgrades}, series = {HotSWUp {\textquoteright}09}, year = {2009}, month = {2009///}, pages = {9:1{\textendash}9:5 - 9:1{\textendash}9:5}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Recent years have seen significant advances in dynamic software updating (DSU) systems, which allow programs to be patched on the fly. However, a significant challenge remains: How can we ensure the act of applying a patch does not itself introduce errors? In this paper, we address this problem by presenting a new systematic testing methodology for updatable programs. Our idea is to transform standard system tests into update tests that execute as before, but each transformed test applies a patch at a different update point during execution. To mitigate the increase in the number of tests, we developed an algorithm for test suite minimization that finds a subset of update points that, if fully tested, yields the equivalent to full update point coverage. We implemented our approach and evaluated it on OpenSSH and vsftpd, two widely used server applications. We found that minimization is highly effective, reducing the number of update tests required for full coverage by 93\%.}, isbn = {978-1-60558-723-3}, doi = {10.1145/1656437.1656449}, url = {http://doi.acm.org/10.1145/1656437.1656449}, author = {Hayden,Christopher M and Hardisty,Eric A. and Hicks, Michael W. and Foster, Jeffrey S.} } @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.} } @article {16404, title = {The emergence of zoning policy games in exurban jurisdictions: Informing collective action theory}, journal = {Land Use Policy}, volume = {26}, year = {2009}, month = {2009/04//}, pages = {356 - 367}, abstract = {Theoretical urban policy literature predicts the likelihood of free riding in the management of common goods such as forested open space; such outcome is often characterized as a Prisoner{\textquoteright}s Dilemma game. Numerous cases exist in which neighboring jurisdictions cooperate to maintain public goods, challenging the expected results, yet theoretical explanations of these cases have not been fully developed. In this paper, we use an agent-based model to explore how underlying micro-behaviors affect the payoffs obtained by two neighboring municipalities in a hypothetical exurban area. Payoffs are measured in terms of regional forested space and of local tax revenue at the end of the agent-based simulations; the municipalities affect these payoffs through their choice of residential zoning policies and the spillover effect between the neighboring jurisdictions. Zoning restrictions influence the conversion of farmland into residential subdivisions of different types, and consequently the location of heterogeneous residential households in the region. Developers and residents respond to the changing landscape characteristics, thus establishing a feedback between early and future land-use patterns. The structure of the simulated payoffs is analyzed using standard game theory. Our analysis shows that a variety of games, in addition to Prisoner{\textquoteright}s Dilemma, can emerge between the neighboring jurisdictions. Other games encourage coordination or subsidization, offering some explanations for the unexpected observations. The game realized in any given context depends on the initial characteristics of the landscape, the value given to the objectives each township seeks to maximize, and the income distribution of the population.}, keywords = {Agent-based modeling, game theory, Land-use policy, Local government cooperation, Scale interaction}, isbn = {0264-8377}, doi = {10.1016/j.landusepol.2008.04.004}, url = {http://www.sciencedirect.com/science/article/pii/S0264837708000604}, author = {Zellner,Moira L. and Page,Scott E. and Rand, William and Brown,Daniel G. and Robinson,Derek T. and Nassauer,Joan and Low,Bobbi} } @article {18209, title = {Enabling search over encrypted multimedia databases}, journal = {SPIE/IS\&T Media Forensics and Security}, year = {2009}, month = {2009///}, pages = {7254 - 18}, abstract = {Performing information retrieval tasks while preserving data confidentiality is a desirable capability when adatabase is stored on a server maintained by a third-party service provider. This paper addresses the problem of enabling content-based retrieval over encrypted multimedia databases. Search indexes, along with multimedia documents, are first encrypted by the content owner and then stored onto the server. Through jointly apply- ing cryptographic techniques, such as order preserving encryption and randomized hash functions, with image processing and information retrieval techniques, secure indexing schemes are designed to provide both privacy protection and rank-ordered search capability. Retrieval results on an encrypted color image database and se- curity analysis of the secure indexing schemes under different attack models show that data confidentiality can be preserved while retaining very good retrieval performance. This work has promising applications in secure multimedia management. }, author = {Lu,W. and Swaminathan,A. and Varna,A.L. and Wu,M.} } @article {15057, title = {Encryption Algorithm Based on Circle Property}, journal = {Jisuanji Gongcheng/ Computer Engineering}, volume = {35}, year = {2009}, month = {2009///}, pages = {180 - 182}, author = {Ge,L.N. and He,Z.H. and Zhuolin Jiang} } @conference {18941, title = {Energy loss in MEMS resonators and the impact on inertial and RF devices}, year = {2009}, month = {2009/06//}, pages = {688 - 695}, abstract = {In this paper, we review the current understanding of energy loss mechanisms in micromachined (MEMS and NEMS) devices. We describe the importance of high quality factor (Q) to the performance of MEMS gyros and MEMS resonators used in radio-frequency applications.}, keywords = {energy loss, gyroscopes, inertial devices, MEMS gyros, MEMS resonators, micromachined devices, micromechanical resonators, NEMS devices, Q-factor, quality factor, radiofrequency applications, RF devices}, doi = {10.1109/SENSOR.2009.5285418}, author = {Weinberg,M. and Candler,R. and Chandorkar,S. and Varsanik,J. and Kenny,T. and Duwel,A.} } @conference {12517, title = {Enforcing integrability by error correction using l1-minimization}, booktitle = {Computer Vision and Pattern Recognition, 2009. CVPR 2009. IEEE Conference on}, year = {2009}, month = {2009/06//}, pages = {2350 - 2357}, abstract = {Surface reconstruction from gradient fields is an important final step in several applications involving gradient manipulations and estimation. Typically, the resulting gradient field is non-integrable due to linear/non-linear gradient manipulations, or due to presence of noise/outliers in gradient estimation. In this paper, we analyze integrability as error correction, inspired from recent work in compressed sensing, particulary lscr0 - lscr1 equivalence. We propose to obtain the surface by finding the gradient field which best fits the corrupted gradient field in lscr1 sense. We present an exhaustive analysis of the properties of lscr1 solution for gradient field integration using linear algebra and graph analogy. We consider three cases: (a) noise, but no outliers (b) no-noise but outliers and (c) presence of both noise and outliers in the given gradient field. We show that lscr1 solution performs as well as least squares in the absence of outliers. While previous lscr0 - lscr1 equivalence work has focused on the number of errors (outliers), we show that the location of errors is equally important for gradient field integration. We characterize the lscr1 solution both in terms of location and number of outliers, and outline scenarios where lscr1 solution is equivalent to lscr0 solution. We also show that when lscr1 solution is not able to remove outliers, the property of local error confinement holds: i.e., the errors do not propagate to the entire surface as in least squares. We compare with previous techniques and show that lscr1 solution performs well across all scenarios without the need for any tunable parameter adjustments.}, keywords = {-, algebra;lscr0, algebra;minimisation;, analogy;integrability;least, compressed, correction;gradient, equivalence;lscr1-minimization;noise-outlier;surface, estimation;gradient, field, integration;gradient, lscr1, manipulation;graph, methods;graph, reconstruction;error, reconstruction;linear, sensing;error, squares;linear, theory;image}, doi = {10.1109/CVPR.2009.5206603}, author = {Reddy, D. and Agrawal,A. and Chellapa, Rama} } @conference {18829, title = {Enhanced force measurement techniques to extend optical trapping towards nanoscale manipulation}, year = {2009}, month = {2009/07//}, pages = {13 - 16}, abstract = {We have developed a new force measurement technique based on the random thermal motion of a nanoparticle in an optical trap. We demonstrate this method, in one-dimension, through numerical simulations and laboratory experiments. We show that computer simulations successfully recover the profile of the optical trapping force, beyond the inflection point of the trapping potential for a range of particle sizes. We show, through laboratory experiments, that this technique is effective in recovering higher order terms, in a power series expansion of the trapping force, beyond the widely reported linear trap stiffness. We also show that the first order (stiffness) term in our series expansion is consistent with values reported in the literature.}, keywords = {Brownian motion, extend optical trapping, Fokker-Planck equation, force measurement, inflection point, linear trap stiffness, nanoparticle, nanoparticles, nanoscale manipulation, nanotechnology, optical trapping force, power series expansion, radiation pressure, random thermal motion}, author = {Balijepalli,A. and LeBrun,T. W. and Gorman,J. J. and Gupta,S.K.} } @conference {12511, title = {Enhancing sparsity using gradients for compressive sensing}, booktitle = {Image Processing (ICIP), 2009 16th IEEE International Conference on}, year = {2009}, month = {2009/11//}, pages = {3033 - 3036}, abstract = {In this paper, we propose a reconstruction method that recovers images assumed to have a sparse representation in a gradient domain by using partial measurement samples that are collected in the Fourier domain. A key improvement of this technique is that it makes use of a robust generalized Poisson solver that greatly aids in achieving a significantly improved performance over similar proposed methods. Experiments provided also demonstrate that this new technique is more flexible to work with either random or restricted sampling scenarios better than its competitors.}, keywords = {analysis;gradient, domain;compressive, domain;image, Fourier, generalized, measurement, methods;, methods;image, Poisson, reconstruction;image, reconstruction;partial, representation;Fourier, representation;sampling, samples;robust, scenarios;sparse, sensing;enhancing, solver;sampling, sparsity;gradient}, doi = {10.1109/ICIP.2009.5414411}, author = {Patel, Vishal M. and Easley,G. R and Chellapa, Rama and Healy,D. M} } @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 {18655, title = {An evaluation of connection characteristics for separating network attacks}, journal = {International Journal of Security and Networks}, volume = {4}, year = {2009}, month = {2009/01/01/}, pages = {110 - 124}, abstract = {The goal of this paper is to evaluate the efficiency of connection characteristics to separate different attack families that target a single TCP port. Identifying the most relevant characteristics might allow statistically separating attack families without systematically using forensics. This study is based on a dataset collected over 117 days using a test-bed of two high interaction honeypots. The results indicated that to separate unsuccessful from successful attacks in malicious traffic: the number of bytes is a relevant characteristic; time-based characteristics are poor characteristics; using combinations of characteristics does not improve the efficiency of separating attacks.}, doi = {10.1504/IJSN.2009.02343}, url = {http://dx.doi.org/10.1504/IJSN.2009.02343}, author = {Berthier,Robin and Michel Cukier} } @article {18701, title = {Evidence for Bidentate Substrate Binding as the Basis for the K48 Linkage Specificity of Otubain 1}, journal = {Journal of Molecular Biology}, volume = {386}, year = {2009}, month = {2009/03/06/}, pages = {1011 - 1023}, abstract = {Otubain 1 belongs to the ovarian tumor (OTU) domain class of cysteine protease deubiquitinating enzymes. We show here that human otubain 1 (hOtu1) is highly linkage-specific, cleaving Lys48 (K48)-linked polyubiquitin but not K63-, K29-, K6-, or K11-linked polyubiquitin, or linear α-linked polyubiquitin. Cleavage is not limited to either end of a polyubiquitin chain, and both free and substrate-linked polyubiquitin are disassembled. Intriguingly, cleavage of K48-diubiquitin by hOtu1 can be inhibited by diubiquitins of various linkage types, as well as by monoubiquitin. NMR studies and activity assays suggest that both the proximal and distal units of K48-diubiquitin bind to hOtu1. Reaction of Cys23 with ubiquitin-vinylsulfone identified a ubiquitin binding site that is distinct from the active site, which includes Cys91. Occupancy of the active site is needed to enable tight binding to the second site. We propose that distinct binding sites for the ubiquitins on either side of the scissile bond allow hOtu1 to discriminate among different isopeptide linkages in polyubiquitin substrates. Bidentate binding may be a general strategy used to achieve linkage-specific deubiquitination.}, keywords = {deubiquitination, isopeptide, linkage specificity, otubain, polyubiquitin}, isbn = {0022-2836}, doi = {10.1016/j.jmb.2008.12.085}, url = {http://www.sciencedirect.com/science/article/pii/S0022283608016124}, author = {Wang,Tao and Yin,Luming and Cooper,Eric M. and Lai,Ming-Yih and Dickey,Seth and Pickart,Cecile M. and Fushman, David and Wilkinson,Keith D. and Cohen,Robert E. and Wolberger,Cynthia} } @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.} } @article {14577, title = {The evolution of Fox genes and their role in development and disease}, journal = {Nature reviews. GeneticsNat Rev Genet}, volume = {10}, year = {2009}, month = {2009/04//}, pages = {233 - 240}, abstract = {The forkhead box (Fox) family of transcription factors, which originated in unicellular eukaryotes, has expanded over time through multiple duplication events, and sometimes through gene loss, to over 40 members in mammals. Fox genes have evolved to acquire a specialized function in many key biological processes. Mutations in Fox genes have a profound effect on human disease, causing phenotypes as varied as cancer, glaucoma and language disorders. We summarize the salient features of the evolution of the Fox gene family and highlight the diverse contribution of various Fox subfamilies to developmental processes, from organogenesis to speech acquisition.}, isbn = {1471-0056}, doi = {10.1038/nrg2523}, author = {Hannenhalli, Sridhar and Kaestner,Klaus H.} } @article {15114, title = {On expected constant-round protocols for Byzantine agreement}, journal = {Journal of Computer and System Sciences}, volume = {75}, year = {2009}, month = {2009/02//}, pages = {91 - 112}, abstract = {In a seminal paper, Feldman and Micali show an n-party Byzantine agreement protocol in the plain model that tolerates t \< n / 3 malicious parties and runs in expected constant rounds. Here, resolving a question that had been open since their work, we show an expected constant-round protocol for authenticated Byzantine agreement assuming honest majority (i.e., t \< n / 2 ), and relying only on the existence of signature schemes and a public-key infrastructure. Combined with existing results, this gives the first expected constant-round protocol for secure computation with honest majority in a point-to-point network under the same assumptions. Our key technical tool {\textemdash} a new primitive we introduce called moderated VSS {\textemdash} also yields a simpler proof of the Feldman{\textendash}Micali result.In addition, we show a simple technique for sequential composition of Byzantine agreement protocols that do not achieve simultaneous termination, something that is inherent for protocols using o ( t ) rounds. }, keywords = {broadcast, cryptography, Distributed computing, secure computation}, isbn = {0022-0000}, doi = {10.1016/j.jcss.2008.08.001}, url = {http://www.sciencedirect.com/science/article/pii/S0022000008000718}, author = {Katz, Jonathan and Koo,Chiu-Yuen} } @conference {13054, title = {Exponential family hybrid semi-supervised learning}, booktitle = {Proceedings of the 21st International Joint Conference on Artifical Intelligence (IJCAI-09)}, year = {2009}, month = {2009///}, pages = {974 - 979}, author = {Agarwal,A. and Daum{\'e}, Hal} } @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.} } @article {12997, title = {Extreme polymorphism in a vaccine antigen and risk of clinical malaria: implications for vaccine development}, journal = {Sci Transl Med}, volume = {1}, year = {2009}, month = {2009/10//}, pages = {2ra5 - 2ra5}, abstract = {Vaccines directed against the blood stages of Plasmodium falciparum malaria are intended to prevent the parasite from invading and replicating within host cells. No blood-stage malaria vaccine has shown clinical efficacy in humans. Most malaria vaccine antigens are parasite surface proteins that have evolved extensive genetic diversity, and this diversity could allow malaria parasites to escape vaccine-induced immunity. We examined the extent and within-host dynamics of genetic diversity in the blood-stage malaria vaccine antigen apical membrane antigen-1 in a longitudinal study in Mali. Two hundred and fourteen unique apical membrane antigen-1 haplotypes were identified among 506 human infections, and amino acid changes near a putative invasion machinery binding site were strongly associated with the development of clinical symptoms, suggesting that these residues may be important to consider in designing polyvalent apical membrane antigen-1 vaccines and in assessing vaccine efficacy in field trials. This extreme diversity may pose a serious obstacle to an effective polyvalent recombinant subunit apical membrane antigen-1 vaccine.}, doi = {10.1126/scitranslmed.3000257}, author = {Takala,S. L and Coulibaly,D. and Thera,M. A and Batchelor,A. H and Cummings, Michael P. and Escalante,A. A and Ouattara,A. and Traor{\'e},K. and Niangaly,A. and Djimd{\'e},A. A and Doumbo,OK and Plowe,CV} } @article {13472, title = {THE EFFECT OF NETWORK STRUCTURE ON DYNAMIC TEAM FORMATION IN MULTI-AGENT SYSTEMS}, journal = {Computational Intelligence}, volume = {24}, year = {2008}, month = {2008/05/01/}, pages = {122 - 157}, abstract = {Previous studies of team formation in multi-agent systems have typically assumed that the agent social network underlying the agent organization is either not explicitly described or the social network is assumed to take on some regular structure such as a fully connected network or a hierarchy. However, recent studies have shown that real-world networks have a rich and purposeful structure, with common properties being observed in many different types of networks. As multi-agent systems continue to grow in size and complexity, the network structure of such systems will become increasing important for designing efficient, effective agent communities.We present a simple agent-based computational model of team formation, and analyze the theoretical performance of team formation in two simple classes of networks (ring and star topologies). We then give empirical results for team formation in more complex networks under a variety of conditions. From these experiments, we conclude that a key factor in effective team formation is the underlying agent interaction topology that determines the direct interconnections among agents. Specifically, we identify the property of diversity support as a key factor in the effectiveness of network structures for team formation. Scale-free networks, which were developed as a way to model real-world networks, exhibit short average path lengths and hub-like structures. We show that these properties, in turn, result in higher diversity support; as a result, scale-free networks yield higher organizational efficiency than the other classes of networks we have studied. }, keywords = {dynamics of networked systems, multi-agent systems, network structure, team formation}, isbn = {1467-8640}, doi = {10.1111/j.1467-8640.2008.00325.x}, url = {http://onlinelibrary.wiley.com/doi/10.1111/j.1467-8640.2008.00325.x/abstract}, author = {Gaston,Matthew E. and desJardins, Marie} } @conference {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} } @conference {14443, title = {Effective label acquisition for collective classification}, booktitle = {Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining}, series = {KDD {\textquoteright}08}, year = {2008}, month = {2008///}, pages = {43 - 51}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Information diffusion, viral marketing, and collective classification all attempt to model and exploit the relationships in a network to make inferences about the labels of nodes. A variety of techniques have been introduced and methods that combine attribute information and neighboring label information have been shown to be effective for collective labeling of the nodes in a network. However, in part because of the correlation between node labels that the techniques exploit, it is easy to find cases in which, once a misclassification is made, incorrect information propagates throughout the network. This problem can be mitigated if the system is allowed to judiciously acquire the labels for a small number of nodes. Unfortunately, under relatively general assumptions, determining the optimal set of labels to acquire is intractable. Here we propose an acquisition method that learns the cases when a given collective classification algorithm makes mistakes, and suggests acquisitions to correct those mistakes. We empirically show on both real and synthetic datasets that this method significantly outperforms a greedy approximate inference approach, a viral marketing approach, and approaches based on network structural measures such as node degree and network clustering. In addition to significantly improving accuracy with just a small amount of labeled data, our method is tractable on large networks.}, keywords = {active inference, collective classification, label acquisition}, isbn = {978-1-60558-193-4}, doi = {10.1145/1401890.1401901}, url = {http://doi.acm.org/10.1145/1401890.1401901}, author = {Bilgic,Mustafa and Getoor, Lise} } @inbook {19607, title = {Effective Visualization of File System Access-Control}, booktitle = {Visualization for Computer Security}, series = {Lecture Notes in Computer Science}, year = {2008}, month = {2008/01/01/}, pages = {18 - 25}, publisher = {Springer Berlin Heidelberg}, organization = {Springer Berlin Heidelberg}, abstract = {In this paper, we present a visual representation of access control permissions in a standard hierarchical file system. Our visualization of file permissions leverages treemaps, a popular graphical representation of hierarchical data. In particular, we present a visualization of access control for the NTFS file system that can help a non-expert user understand and manipulate file system permissions in a simple and effective way. While our examples are based on NTFS, our approach can be used for many other hierarchical file systems as well.}, keywords = {Computer Communication Networks, Computer Imaging, Vision, Pattern Recognition and Graphics, data mining and knowledge discovery, Data Structures, Cryptology and Information Theory, Visualization}, isbn = {978-3-540-85931-4, 978-3-540-85933-8}, url = {http://link.springer.com/chapter/10.1007/978-3-540-85933-8_2}, author = {Heitzmann, Alexander and Palazzi, Bernardo and Charalampos Papamanthou and Tamassia, Roberto}, editor = {Goodall, John R. and Conti, Gregory and Ma, Kwan-Liu} } @article {12239, title = {Efficient and Resilient Backbones for Multihop Wireless Networks}, journal = {Mobile Computing, IEEE Transactions on}, volume = {7}, year = {2008}, month = {2008/11//}, pages = {1349 - 1362}, abstract = {We consider the problem of finding "backbones" in multihop wireless networks. The backbone provides end-to-end connectivity, allowing nonbackbone nodes to save energy since they do not have to route nonlocal data or participate in the routing protocol. Ideally, such a backbone would be small, consist primarily of high capacity nodes, and remain connected even when nodes are mobile or fail. Unfortunately, it is often infeasible to construct a backbone that has all of these properties; e.g., a small optimal backbone is often too sparse to handle node failures or high mobility. We present a parameterized backbone construction algorithm that permits explicit trade-offs between backbone size, resilience to node movement and failure, energy consumption, and path lengths. We prove that our scheme can construct essentially best possible backbones (with respect to energy consumption and backbone size) when the network is relatively static. We generalize our scheme to build more robust structures better suited to networks with higher mobility. We present a distributed protocol based upon our algorithm and show that this protocol builds and maintains a connected backbone in dynamic networks. Finally, we present detailed packet-level simulation results to evaluate and compare our scheme with existing energy-saving techniques. Our results show that, depending on the network environment, our scheme increases network lifetimes by 20 percent to 220 percent without adversely affecting delivery ratio or end-to-end latency.}, keywords = {algorithm;protocols;wireless, backbone, channels;, CONSTRUCTION, distributed, networks;parameterized, protocol;multihop, wireless}, isbn = {1536-1233}, doi = {10.1109/TMC.2008.69}, author = {Lee,Seungjoon and Bhattacharjee, Bobby and Srinivasan, Aravind and Khuller, Samir} } @conference {19601, title = {Efficient Integrity Checking of Untrusted Network Storage}, booktitle = {StorageSS {\textquoteright}08 Proceedings of the 4th ACM International Workshop on Storage Security and Survivability }, series = {StorageSS {\textquoteright}08}, year = {2008}, month = {2008///}, pages = {43 - 54}, publisher = {ACM}, organization = {ACM}, abstract = {Outsourced storage has become more and more practical in recent years. Users can now store large amounts of data in multiple servers at a relatively low price. An important issue for outsourced storage systems is to design an efficient scheme to assure users that their data stored at remote servers has not been tampered with. This paper presents a general method and a practical prototype application for verifying the integrity of files in an untrusted network storage service. The verification process is managed by an application running in a trusted environment (typically on the client) that stores just one cryptographic hash value of constant size, corresponding to the "digest" of an authenticated data structure. The proposed integrity verification service can work with any storage service since it is transparent to the storage technology used. Experimental results show that our integrity verification method is efficient and practical for network storage systems.}, keywords = {authenticated data structures, data integrity, Security, untrusted outsourced storage}, isbn = {978-1-60558-299-3}, url = {http://doi.acm.org/10.1145/1456469.1456479}, author = {Heitzmann, Alexander and Palazzi, Bernardo and Charalampos Papamanthou and Tamassia, Roberto} } @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 {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} } @article {17129, title = {Embedded menus: selecting items in context}, journal = {Sparks of innovation in human-computer interaction}, year = {2008}, month = {2008///}, author = {Koved,L. and Shneiderman, Ben} } @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} } @article {17132, title = {Enabling teachers to explore grade patterns to identify individual needs and promote fairer student assessment}, journal = {Computers \& Education}, volume = {51}, year = {2008}, month = {2008/12//}, pages = {1467 - 1485}, abstract = {Exploring student test, homework, and other assessment scores is a challenge for most teachers, especially when attempting to identify cross-assessment weaknesses and produce final course grades. During the course, teachers need to identify subject weaknesses in order to help students who are struggling with a particular topic. This identification often needs to happen across multiple assessment data points and should be considered in comparison to the class{\textquoteright}s progress as a whole. When determining grades, fairness to all is essential, but there are special needs for students who did poorly on one exam or had a steadily increasing grasp of the subject. We present eduViz, a visualization tool designed to help teachers explore and assign grades. Teachers can see the trajectory of student scores, the relationship of a particular student to the class, and use categories they have defined in order to filter their assessment information. Query response is immediate and all logical comparisons are possible. Teachers can easily compare their query to the class or per student average as well as view scores by raw point total or percentage. Additionally, eduViz provides a grade assignment interface which allows teachers to view sorted student scores in a scatterplot. This scatterplot is coupled with a unique partition slider which allows users to move color coordinated bands on the scatterplot to indicate grade ranges. As these grade ranges are set, a histogram is updated to show the number of students assigned to each grade range. These features give teachers new and powerful ways to explore and assign grades so that they can better understand student strengths and weaknesses and make the most of the time they have available. Interviews with 16 expert teachers indicate that eduViz is a success across fields, provides teachers with a useful tool to understand and help their classes, and encourages reflective practice.}, keywords = {Evaluation methodologies, Human{\textendash}computer interface, Improving classroom teaching, Pedagogical issues, Teaching/learning strategies}, isbn = {0360-1315}, doi = {10.1016/j.compedu.2008.01.005}, url = {http://www.sciencedirect.com/science/article/pii/S0360131508000353}, author = {Friedler,Sorelle A. and Tan,Yee Lin and Peer,Nir J. and Shneiderman, Ben} } @inbook {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 {16063, title = {Enhancing In-Car Navigation Systems with Personal Experience}, journal = {Transportation Research Record: Journal of the Transportation Research Board}, volume = {2064}, year = {2008}, month = {2008/12/01/}, pages = {33 - 42}, abstract = {Computers are extremely powerful for data processing but less adept at handling problems that involve subjective reasoning. People, on the other hand, are good at such tasks. A framework is presented for adding subjective human experience to in-car navigation systems. People often rely on personal experience when planning trips, choosing the route that is fastest, prettiest, or recommended by a friend. A set of methods was developed to help people record personal driving history, add textual annotations describing subjective experiences, and share data with friends and family or even the broader community. Users can then learn from personal data or harness the multiplicity of individual experiences to enjoy new routes. This approach can be used in conjunction with traditional in-car navigation systems.}, doi = {10.3141/2064-06}, url = {http://dx.doi.org/10.3141/2064-06}, author = {Bederson, Benjamin B. and Clamage,Aaron and Plaisant, Catherine} } @inbook {12117, title = {An Environment for Conducting Families of Software Engineering Experiments}, booktitle = {Software Development}, volume = {Volume 74}, year = {2008}, month = {2008///}, pages = {175 - 200}, publisher = {Elsevier}, organization = {Elsevier}, abstract = {The classroom is a valuable resource for conducting software engineering experiments. However, coordinating a family of experiments in classroom environments presents a number of challenges to researchers. Understanding how to run such experiments, developing procedures to collect accurate data, and collecting data that is consistent across multiple studies are major problems. This paper describes an environment, the Experiment Manager that simplifies the process of collecting, managing, and sanitizing data from classroom experiments, while minimizing disruption to natural subject behavior. We have successfully used this environment to study the impact of parallel programming languages in the high-performance computing domain on programmer productivity at multiple universities across the United States.}, isbn = {0065-2458}, url = {http://www.sciencedirect.com/science/article/pii/S0065245808006050}, author = {Hochstein, Lorin and Nakamura,Taiga and Shull, Forrest and Zazworka, Nico and Basili, Victor R. and Zelkowitz, Marvin V}, editor = {Zelkowitz, Marvin V} } @article {12913, title = {Environmental signatures associated with cholera epidemics}, journal = {Proceedings of the National Academy of Sciences}, volume = {105}, year = {2008}, month = {2008///}, pages = {17676 - 17676}, abstract = {The causative agent of cholera, Vibrio cholerae, has been shown to be autochthonous to riverine, estuarine, and coastal waters along with its host, the copepod, a significant member of the zooplankton community. Temperature, salinity, rainfall and plankton have proven to be important factors in the ecology of V. cholerae, influencing the transmission of the disease in those regions of the world where the human population relies on untreated water as a source of drinking water. In this study, the pattern of cholera outbreaks during 1998{\textendash}2006 in Kolkata, India, and Matlab, Bangladesh, and the earth observation data were analyzed with the objective of developing a prediction model for cholera. Satellite sensors were used to measure chlorophyll a concentration (CHL) and sea surface temperature (SST). In addition, rainfall data were obtained from both satellite and in situ gauge measurements. From the analyses, a statistically significant relationship between the time series for cholera in Kolkata, India, and CHL and rainfall anomalies was determined. A statistically significant one month lag was observed between CHL anomaly and number of cholera cases in Matlab, Bangladesh. From the results of the study, it is concluded that ocean and climate patterns are useful predictors of cholera epidemics, with the dynamics of endemic cholera being related to climate and/or changes in the aquatic ecosystem. When the ecology of V. cholerae is considered in predictive models, a robust early warning system for cholera in endemic regions of the world can be developed for public health planning and decision making.ecology epidemiology microbiology remote sensing }, isbn = {0027-8424, 1091-6490}, doi = {10.1073/pnas.0809654105}, url = {http://www.pnas.org/content/105/46/17676}, author = {Constantin de Magny,G. and Murtugudde,R. and Sapiano,M. R. P. and Nizam,A. and Brown,C. W. and Busalacchi,A. J. and Yunus,M. and Nair,G. B. and Gil,A. I. and Lanata,C. F. and Rita R Colwell} } @article {12908, title = {Environmental Vibrio spp., isolated in Mozambique, contain a polymorphic group of integrative conjugative elements and class 1 integrons}, journal = {FEMS Microbiology Ecology}, volume = {64}, year = {2008}, month = {2008/04/01/}, pages = {45 - 54}, abstract = {Circulation of mobile genetic elements linked to drug resistance spread was studied in Vibrio strains isolated from surface urban water (river and sea) and shellfish samples in 2002{\textendash}2003 in Maputo, Mozambique. Class 1 integrons and integrating conjugative elements (ICE) were investigated by PCR and mating experiments in strains of major health interest: 10 Vibrio cholerae, six Vibrio parahaemolyticus, two Vibrio alginolyticus and one Vibrio fluvialis. Resistance to at least two antibiotics (predominantly β-lactams) was detected in all the strains, with additional resistances to sulfamethoxazole, spectinomycin, streptomycin and/or trimethoprim. Class 1 integrons contributed partially to the expression of drug resistance and were found in five isolates: four V. cholerae (blaP1 cassette, one strain also contained the dfrA15 cassette) and one V. alginolyticus (aadA2 cassette). ICEs, apparently devoid of resistance genes, were found in eight V. cholerae, three V. parahaemolyticus and one V. fluvialis isolates. A wide variability was observed by molecular characterization of ICEs. Five ICEs were included in the SXT/R391 family and seven ICEs were not classified. Our results indicate that the SXT/R391 family and related ICEs comprise a large class of polymorphic genetic elements widely circulating in environmental Vibrio strains in Africa, beside those evidently linked to drug resistance in clinical isolates.}, keywords = {ICE, integron, Mozambique, Vibrio}, isbn = {1574-6941}, doi = {10.1111/j.1574-6941.2008.00455.x}, url = {http://onlinelibrary.wiley.com/doi/10.1111/j.1574-6941.2008.00455.x/full}, author = {Taviani,Elisa and Ceccarelli,Daniela and Lazaro,Nivalda and Bani,Stefania and Cappuccinelli,Piero and Rita R Colwell and Colombo,Mauro M.} } @article {12971, title = {Estimating Tree-Structured Covariance Matrices via Mixed-Integer Programming with an Application to Phylogenetic Analysis of Gene Expression}, volume = {1142}, year = {2008}, month = {2008///}, institution = {Department of Statistics, University of Wisconsin}, abstract = {We present a novel method for estimating tree-structured covariance matrices directly fromobserved continuous data. A representation of these classes of matrices as linear combinations of rank-one matrices indicating object partitions is used to formulate estimation as instances of well-studied numerical optimization problems. In particular, we present estimation based on projection where the covariance estimate is the nearest tree-structured covariance matrix to an observed sample covariance matrix. The problem is posed as a linear or quadratic mixed-integer program (MIP) where a setting of the integer variables in the MIP specifies a set of tree topologies of the structured covariance matrix. We solve these problems to optimality using efficient and robust existing MIP solvers. We also show that the least squares distance method of Fitch and Margoliash (1967) can be formulated as a quadratic MIP and thus solved exactly using existing, robust branch-and-bound MIP solvers. Our motivation for this method is the discovery of phylogenetic structure directly from gene expression data. Recent studies have adapted traditional phylogenetic comparative anal- ysis methods to expression data. Typically, these methods first estimate a phylogenetic tree from genomic sequence data and subsequently analyze expression data. A covariance matrix constructed from the sequence-derived tree is used to correct for the lack of independence in phy- logenetically related taxa. However, recent results have shown that the hierarchical structure of sequence-derived tree estimates are highly sensitive to the genomic region chosen to build them. To circumvent this difficulty, we propose a stable method for deriving tree-structured covariance matrices directly from gene expression as an exploratory step that can guide investigators in their modelling choices for these types of comparative analysis. We present a case study in phylogenetic analysis of expression in yeast gene families. Our method is able to corroborate the presence of phylogenetic structure in the response of expression in a subset of the gene families under particular experimental conditions. Additionally, when used in conjunction with transcription factor occupancy data, our methods show that alternative modelling choices should be considered when creating sequence-derived trees for this comparative analysis. }, author = {Corrada Bravo, Hector and Eng,K. H and Keles,S. and Wahba,G. and Wright,S.} } @article {14609, title = {Eukaryotic Transcription Factor Binding Sites{\textemdash}modeling and Integrative Search Methods}, journal = {BioinformaticsBioinformatics}, volume = {24}, year = {2008}, month = {2008/06/01/}, pages = {1325 - 1331}, abstract = {A comprehensive knowledge of transcription factor binding sites (TFBS) is important for a mechanistic understanding of transcriptional regulation as well as for inferring gene regulatory networks. Because the DNA motif recognized by a transcription factor is typically short and degenerate, computational approaches for identifying binding sites based only on the sequence motif inevitably suffer from high error rates. Current state-of-the-art techniques for improving computational identification of binding sites can be broadly categorized into two classes: (1) approaches that aim to improve binding motif models by extracting maximal sequence information from experimentally determined binding sites and (2) approaches that supplement binding motif models with additional genomic or other attributes (such as evolutionary conservation). In this review we will discuss recent attempts to improve computational identification of TFBS through these two types of approaches and conclude with thoughts on future development.Contact: sridharh@pcbi.upenn.edu }, isbn = {1367-4803, 1460-2059}, doi = {10.1093/bioinformatics/btn198}, url = {http://bioinformatics.oxfordjournals.org/content/24/11/1325}, author = {Hannenhalli, Sridhar} } @article {17138, title = {Evaluating Exploratory Search Systems}, journal = {Information processing \& management}, volume = {44}, year = {2008}, month = {2008///}, pages = {463 - 484}, author = {Kules,B. and Shneiderman, Ben} } @mastersthesis {19021, title = {Evaluating predicates over encrypted data}, year = {2008}, month = {2008}, school = {Carnegie Mellon University}, abstract = {The high-level goal of this thesis is to build predicate encryption systems that are efficient, support expressive queries and rich operations. Our contributions are summarized below: (1) We propose a predicate encryption scheme supporting multi-dimensional range queries. Prior to this work, researchers have constructed schemes support equality tests. Hence, our scheme supports more expressive queries than before. At the core of this construction is a technique to support conjunctive queries without leaking the outcome of each individual clause. (2) We study how to delegate capabilities in predicate encryption schemes. To demonstrate why delegation may be interesting, imagine that Alice has a capability, and she wishes to delegate to Bob a more restrictive capability allowing him to decrypt a subset of the information Alice can learn about the plaintext encrypted. We propose a security definition for delegation, and build a scheme supporting delegation and conjunctive queries. (3) Most prior work focuses on hiding the plaintext (encoded in the ciphertext), but does not provide guarantees about the secrecy of the queries (encoded in the capabilities). In other words, given a capability, one might be able to infer from it what the query predicate is. We study how to hide the query predicates, and propose a scheme supporting inner-product queries that hides the query predicates in addition to the plaintext.}, doi = {Doctoral Dissertation}, url = {http://books.google.com/books?hl=en\&lr=\&id=jBOgjMdBeHAC\&oi=fnd\&pg=PA1\&dq=+Elaine+Shi\&ots=W3nTBSxa3H\&sig=76cmlidxiCTBXbaFhfkl9zVOm6s}, author = {Elaine Shi} } @article {16066, title = {Evaluating Visual Analytics at the 2007 VAST Symposium Contest}, journal = {Computer Graphics and Applications, IEEE}, volume = {28}, year = {2008}, month = {2008/04//march}, pages = {12 - 21}, abstract = {In this article, we report on the contest{\textquoteright}s data set and tasks, the judging criteria, the winning tools, and the overall lessons learned in the competition. We believe that by organizing these contests, we{\textquoteright}re creating useful resources for researchers and are beginning to understand how to better evaluate VA tools. Competitions encourage the community to work on difficult problems, improve their tools, and develop baselines for others to build or improve upon. We continue to evolve a collection of data sets, scenarios, and evaluation methodologies that reflect the richness of the many VA tasks and applications.}, keywords = {2007, analytics, analytics;data, and, Contest;Visual, Science, Symposium, Technology;data, VAST, visualisation;, visualization;visual}, isbn = {0272-1716}, doi = {10.1109/MCG.2008.27}, author = {Plaisant, Catherine and Grinstein,G. and Scholtz,J. and Whiting,M. and O{\textquoteright}Connell,T. and Laskowski,S. and Chien,L. and Tat,A. and Wright,W. and Gorg,C. and Zhicheng Liu and Parekh,N. and Singhal,K. and Stasko,J.} } @article {13128, title = {Event modeling and recognition using markov logic networks}, journal = {Computer Vision{\textendash}ECCV 2008}, year = {2008}, month = {2008///}, pages = {610 - 623}, abstract = {We address the problem of visual event recognition in surveillance where noise and missing observations are serious problems. Common sense domain knowledge is exploited to overcome them. The knowledge is represented as first-order logic production rules with associated weights to indicate their confidence. These rules are used in combination with a relaxed deduction algorithm to construct a network of grounded atoms, the Markov Logic Network. The network is used to perform probabilistic inference for input queries about events of interest. The system{\textquoteright}s performance is demonstrated on a number of videos from a parking lot domain that contains complex interactions of people and vehicles.}, author = {Tran,S. and Davis, Larry S.} } @article {12834, title = {Executable Specifications for Real-Time Distributed Systems}, journal = {Electronic Notes in Theoretical Computer Science}, volume = {203}, year = {2008}, month = {2008/06/05/}, pages = {3 - 17}, abstract = {One of the challenges in designing distributed, embedded systems is the paucity of formal, executable specification notations that provide support for both real-time and asynchronous communication. This paper describes a timed architecture design language (Timed Architecture Interaction Diagrams or TAID) that, by virtue of its formal, executable semantics, combines the benefits of synchronous specification notations with the advantages of traditional architecture description languages. In addition, TAID provides support for a variety of temporal inter-process communication (IPC) primitives as a native feature of the language, so that the encapsulated communication behavior (captured by real-time {\^a}{\texteuro}{\oe}buses{\^a}{\texteuro} in TAID) may be re-used across designs and serve as specifications for more detailed model implementations.}, keywords = {distributed systems, Formal Methods, real-time, Simulations, Software architecture}, isbn = {1571-0661}, doi = {10.1016/j.entcs.2008.05.007}, url = {http://www.sciencedirect.com/science/article/pii/S1571066108003216}, author = {Ray,Arnab and Cleaveland, Rance} } @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 {18670, title = {Experiences with building an intrusion-tolerant group communication system}, journal = {Software: Practice and Experience}, volume = {38}, year = {2008}, month = {2008///}, pages = {639 - 666}, abstract = {There are many group communication systems (GCSs) that provide consistent group membership and reliable, ordered multicast properties in the presence of crash faults. However, relatively few GCS implementations are able to provide these properties in the presence of malicious faults resulting from intrusions. We describe the systematic transformation of a crash-tolerant GCS, namely C-Ensemble, into an intrusion-tolerant GCS, the ITUA GCS. To perform the transformation, we devised intrusion-tolerant versions of key group communication protocols. We then inserted implementations of the protocols into C-Ensemble and made significant changes to the rest of the C-Ensemble protocol stack to make the stack intrusion tolerant. We quantify the cost of providing intrusion-tolerant group communication in two ways. First, we quantify the implementation effort by presenting a detailed analysis of the amount of change required to the original C-Ensemble system. In doing so, we provide insight into the choice of building an intrusion-tolerant GCS from scratch versus building one by leveraging a crash-tolerant implementation. Second, we quantify the run-time performance cost of tolerating intrusions by presenting results from an experimental evaluation of the main intrusion-tolerant microprotocols. The results are analyzed to identify the parts that contribute the most overhead while providing intrusion tolerance during both normal operation and recovery from intrusions. Copyright {\textcopyright} 2007 John Wiley \& Sons, Ltd.}, keywords = {distributed protocols, experimental evaluation, Fault tolerance, Group communication, intrusion tolerance}, isbn = {1097-024X}, doi = {10.1002/spe.848}, url = {http://onlinelibrary.wiley.com/doi/10.1002/spe.848/abstract}, author = {Ramasamy,HariGovind V. and Pandey,Prashant and Michel Cukier and Sanders,William H.} } @conference {16496, title = {Exploiting ontology structure and patterns of annotation to mine significant associations between pairs of controlled vocabulary terms}, booktitle = {Data Integration in the Life Sciences}, year = {2008}, month = {2008///}, pages = {44 - 60}, author = {Lee,W. J and Raschid, Louiqa and Sayyadi,H. and Srinivasan,P.} } @article {14432, title = {Exploiting Prior Knowledge in Intelligent Assistants: Combining Relational Models with Hierarchies}, journal = {Probabilistic, Logical and Relational Learning - A Further Synthesis}, year = {2008}, month = {2008///}, abstract = {Statitsical relational models have been successfully used to model static probabilistic relationships between the entities of the domain. In this talk, we illustrate their use in a dynamic decison-theoretic setting where the task is to assist a user by inferring his intentional structure and taking appropriate assistive actions. We show that the statistical relational models can be used to succintly express the system{\textquoteright}s prior knowledge about the user{\textquoteright}s goal-subgoal structure and tune it with experience. As the system is better able to predict the user{\textquoteright}s goals, it improves the effectiveness of its assistance. We show through experiments that both the hierarchical structure of the goals and the parameter sharing facilitated by relational models significantly improve the learning speed.}, author = {Natarajan,S. and Tadepalli,P. and Fern,A. and De Raedt,L. and Dietterich,T. and Getoor, Lise and Kersting,K. and Muggleton,S. H} } @article {13368, title = {Exploiting shared correlations in probabilistic databases}, journal = {Proceedings of the VLDB Endowment}, volume = {1}, year = {2008}, month = {2008/08//}, pages = {809 - 820}, abstract = {There has been a recent surge in work in probabilistic databases, propelled in large part by the huge increase in noisy data sources --- from sensor data, experimental data, data from uncurated sources, and many others. There is a growing need for database management systems that can efficiently represent and query such data. In this work, we show how data characteristics can be leveraged to make the query evaluation process more efficient. In particular, we exploit what we refer to as shared correlations where the same uncertainties and correlations occur repeatedly in the data. Shared correlations occur mainly due to two reasons: (1) Uncertainty and correlations usually come from general statistics and rarely vary on a tuple-to-tuple basis; (2) The query evaluation procedure itself tends to re-introduce the same correlations. Prior work has shown that the query evaluation problem on probabilistic databases is equivalent to a probabilistic inference problem on an appropriately constructed probabilistic graphical model (PGM). We leverage this by introducing a new data structure, called the random variable elimination graph (rv-elim graph) that can be built from the PGM obtained from query evaluation. We develop techniques based on bisimulation that can be used to compress the rv-elim graph exploiting the presence of shared correlations in the PGM, the compressed rv-elim graph can then be used to run inference. We validate our methods by evaluating them empirically and show that even with a few shared correlations significant speed-ups are possible.}, isbn = {2150-8097}, doi = {10.1145/1453856.1453944}, url = {http://dx.doi.org/10.1145/1453856.1453944}, author = {Sen,Prithviraj and Deshpande, Amol and Getoor, Lise} } @conference {18212, title = {Extended abstract: A hardware-assisted data hiding based approach in building high performance secure execution systems}, booktitle = {Hardware-Oriented Security and Trust, 2008. HOST 2008. IEEE International Workshop on}, year = {2008}, month = {2008/06//}, pages = {93 - 96}, abstract = {Recently, a novel data hiding technique was proposed to embed information into compiled binary codes in order to enhance system performance. Using this technique as a vehicle, we propose a framework to build high-performance secure execution systems by embedding data for security and trust purposes. We illustrate this approach in a mobile computing environment by an instruction-block level data hiding technique, which can be used to defend against malicious attacks (such as Trojan injection). This improves the trustworthiness of mobile codes. It also protects the code providerpsilas intellectual property because the code can be executed only on the designated device. When combined with the existing approach in [4], the proposed data hiding framework can provide trust and high-performance simultaneously. Finally, we conduct a proof-of-the-concept FPGA prototyping to validate the data hiding technique and evaluate the hardware cost in terms of gate count, power consumption, and gate delay.}, keywords = {arrays;invasive, attacks;mobile, codes;data, codes;mobile, computing;, computing;power, consumption;proof-of-the-concept, count;gate, data, delay;hardware-assisted, embedding;gate, embedding;instruction-block, encapsulation;distributed, execution, FPGA, gate, hiding;information, injection;binary, level;malicious, programmable, programming;field, prototyping;secure, software;mobile, systems;binary, Trojan}, doi = {10.1109/HST.2008.4559062}, author = {Taylor,M. and Yin,Chi-En and M. Wu and Gang Qu} } @article {15866, title = {Extending sense-making models with ideas from cognition and learning theories}, journal = {Proceedings of the American Society for Information Science and Technology}, volume = {45}, year = {2008}, month = {2008///}, pages = {23 - 23}, author = {Zhang,P. and Soergel,D. and Klavans,J. L and Oard, Douglas} } @article {17158, title = {Extreme visualization: squeezing a billion records into a million pixels}, journal = {SIGMOD Conference}, year = {2008}, month = {2008///}, pages = {3 - 12}, abstract = {Database searches are usually performed with querylanguages and form fill in templates, with results displayed in tabular lists. However, excitement is building around dynamic queries sliders and other graphical selectors for query specification, with results displayed by information visualization techniques. These filtering techniques have proven to be effective for many tasks in which visual presentations enable discovery of relationships, clusters, outliers, gaps, and other patterns. Scaling visual presentations from millions to billions of records will require collaborative research efforts in information visualization and database management to enable rapid aggregation, meaningful coordinated windows, and effective summary graphics. This paper describes current and proposed solutions (atomic, aggregated, and density plots) that facilitate sense-making for interactive visual exploration of billion record data sets. }, author = {Shneiderman, Ben} } @article {16396, title = {Exurbia from the bottom-up: Confronting empirical challenges to characterizing a complex system}, journal = {Geoforum}, volume = {39}, year = {2008}, month = {2008/03//}, pages = {805 - 818}, abstract = {We describe empirical results from a multi-disciplinary project that support modeling complex processes of land-use and land-cover change in exurban parts of Southeastern Michigan. Based on two different conceptual models, one describing the evolution of urban form as a consequence of residential preferences and the other describing land-cover changes in an exurban township as a consequence of residential preferences, local policies, and a diversity of development types, we describe a variety of empirical data collected to support the mechanisms that we encoded in computational agent-based models. We used multiple methods, including social surveys, remote sensing, and statistical analysis of spatial data, to collect data that could be used to validate the structure of our models, calibrate their specific parameters, and evaluate their output. The data were used to investigate this system in the context of several themes from complexity science, including have (a) macro-level patterns; (b) autonomous decision making entities (i.e., agents); (c) heterogeneity among those entities; (d) social and spatial interactions that operate across multiple scales and (e) nonlinear feedback mechanisms. The results point to the importance of collecting data on agents and their interactions when producing agent-based models, the general validity of our conceptual models, and some changes that we needed to make to these models following data analysis. The calibrated models have been and are being used to evaluate landscape dynamics and the effects of various policy interventions on urban land-cover patterns.}, keywords = {Ecological effects, Land-cover change, Land-use change, spatial modeling, Urban sprawl}, isbn = {0016-7185}, doi = {10.1016/j.geoforum.2007.02.010}, url = {http://www.sciencedirect.com/science/article/pii/S0016718507000371}, author = {Brown,Daniel G. and Robinson,Derek T. and An,Li and Nassauer,Joan I. and Zellner,Moira and Rand, William and Riolo,Rick and Page,Scott E. and Low,Bobbi and Wang,Zhifang} } @article {13155, title = {An ease-of-use stereo-based particle filter for tracking under occlusion}, journal = {Human Motion{\textendash}Understanding, Modeling, Capture and Animation}, year = {2007}, month = {2007///}, pages = {225 - 239}, abstract = {We describe a tracker that handles occlusion by clustering foreground pixels based on their disparity values. Stereo-matched foreground pixels, mapped from multiple views to a reference view, allow the tracker to recover occluded foreground regions in the reference view. The stereo algorithm utilizes a common plan view into which foreground regions from multiple views are projected and intersected to construct polygons that contain the ground plane locations of objects, followed by constraining the epipolar search to only those pixels with ground plane locations lying within these polygons. Consequently, a stereo-matched foreground pixel is easily mapped between views by first mapping its ground plane location using pre-computed homography, followed by intersecting the vertical axis passing through the mapped location with the epipolar line. Finally, tracking in a reference view allows a particle filter to be {\textquotedblleft}seamlessly{\textquotedblright} integrated, so that uncertainties can be effectively dealt with. Experimental results illustrate the effectiveness of our algorithm.}, author = {Lim,S.N. and Davis, Larry S.} } @article {12186, title = {EcoLens: Integration and interactive visualization of ecological datasets}, journal = {Ecological Informatics}, volume = {2}, year = {2007}, month = {2007/01/01/}, pages = {61 - 69}, abstract = {Complex multi-dimensional datasets are now pervasive in science and elsewhere in society. Better interactive tools are needed for visual data exploration so that patterns in such data may be easily discovered, data can be proofread, and subsets of data can be chosen for algorithmic analysis. In particular, synthetic research such as ecological interaction research demands effective ways to examine multiple datasets. This paper describes our integration of hundreds of food-web datasets into a common platform, and the visualization software, EcoLens, we developed for exploring this information. This publicly-available application and integrated dataset have been useful for our research predicting large complex food webs, and EcoLens is favorably reviewed by other researchers. Many habitats are not well represented in our large database. We confirm earlier results about the small size and lack of taxonomic resolution in early food webs but find that they and a non-food-web source provide trophic information about a large number of taxa absent from more modern studies. Corroboration of Tuesday Lake trophic links across studies is usually possible, but lack of links among congeners may have several explanations. While EcoLens does not provide all kinds of analytical support, its label- and item-based approach is effective at addressing concerns about the comparability and taxonomic resolution of food-web data.}, keywords = {Data integration, Food webs, Taxonomy, Visualization}, isbn = {1574-9541}, doi = {10.1016/j.ecoinf.2007.03.005}, url = {http://www.sciencedirect.com/science/article/pii/S1574954107000118}, author = {Parr,Cynthia Sims and Lee,Bongshin and Bederson, Benjamin B.} } @inbook {19491, title = {Ecotopia: An Ecological Framework for Change Management in Distributed Systems}, booktitle = {Architecting Dependable Systems IV}, series = {Lecture Notes in Computer Science}, year = {2007}, month = {2007/01/01/}, pages = {262 - 286}, publisher = {Springer Berlin Heidelberg}, organization = {Springer Berlin Heidelberg}, abstract = {Dynamic change management in an autonomic, service-oriented infrastructure is likely to disrupt the critical services delivered by the infrastructure. Furthermore, change management must accommodate complex real-world systems, where dependability and performance objectives are managed across multiple distributed service components and have specific criticality/value models. In this paper, we present Ecotopia, a framework for change management in complex service-oriented architectures (SOA) that is ecological in its intent: it schedules change operations with the goal of minimizing the service-delivery disruptions by accounting for their impact on the SOA environment. The change-planning functionality of Ecotopia is split between multiple objective-advisors and a system-level change-orchestrator component. The objective advisors assess the change-impact on service delivery by estimating the expected values of the Key Performance Indicators (KPIs), during and after change. The orchestrator uses the KPI estimations to assess the per-objective and overall business-value changes over a long time-horizon and to identify the scheduling plan that maximizes the overall business value. Ecotopia handles both external change requests, like software upgrades, and internal changes requests, like fault-recovery actions. We evaluate the Ecotopia framework using two realistic change-management scenarios in distributed enterprise systems.}, keywords = {Autonomic Computing, Dynamic Change Management, Fault-Tolerant Architecture, Operating systems, Performability, Service Orchestration, software engineering}, isbn = {978-3-540-74033-9, 978-3-540-74035-3}, url = {http://link.springer.com/chapter/10.1007/978-3-540-74035-3_12}, author = {Tudor Dumitras and Ro{\c s}u, Daniela and Dan, Asit and Narasimhan, Priya}, editor = {Lemos, Rog{\'e}rio de and Gacek, Cristina and Romanovsky, Alexander} } @article {18700, title = {Effects of cyclization on conformational dynamics and binding properties of Lys48-linked di-ubiquitin}, journal = {Protein Science}, volume = {16}, year = {2007}, month = {2007///}, pages = {369 - 378}, abstract = {In solution, Lys48-linked di-ubiquitin exists in dynamic equilibrium between closed and open conformations. To understand the effect of interdomain motion in polyubiquitin chains on their ability to bind ligands, we cyclized di-ubiquitin by cross-linking the free C terminus of the proximal ubiquitin with the side chain of residue 48 in the distal ubiquitin, using a chemical cross-linker, 1,6-Hexane-bis-vinylsulfone. Our NMR studies confirm that the cyclization affects conformational dynamics in di-ubiquitin by restricting opening of the interface and shifting the conformational equilibrium toward closed conformations. The cyclization, however, did not rigidly lock di-ubiquitin in a single closed conformation: The chain undergoes slow exchange between at least two closed conformations, characterized by interdomain contacts involving the same hydrophobic patch residues (Leu8-Ile44-Val70) as in the uncyclized di-ubiquitin. Lowering the pH changes the relative populations of these conformations, but in contrast with the uncyclized di-ubiquitin, does not lead to opening of the interface. This restriction of domain motions inhibits direct access of protein molecules to the hydrophobic patch residues located at the very center of the interdomain interface in di-ubiquitin, although the residual motions are sufficient to allow access of small molecules to the interface. This renders di-ubiquitin unable to bind protein molecules (e.g., UBA2 domain) in the normal manner, and thus could interfere with Ub2 recognition by various downstream effectors. These results emphasize the importance of the opening/closing domain motions for the recognition and function of di-ubiquitin and possibly longer polyubiquitin chains.}, keywords = {cyclization, di-ubiquitin, interdomain dynamics, Lys48-linked ubiquitin chain, UBA domain}, isbn = {1469-896X}, doi = {10.1110/ps.062508007}, url = {http://onlinelibrary.wiley.com/doi/10.1110/ps.062508007/abstract}, author = {Dickinson,Bryan C. and Varadan,Ranjani and Fushman, David} } @article {14938, title = {An efficient and scalable parallel algorithm for out-of-core isosurface extraction and rendering}, journal = {Journal of Parallel and Distributed Computing}, volume = {67}, year = {2007}, month = {2007/05//}, pages = {592 - 603}, abstract = {We consider the problem of isosurface extraction and rendering for large scale time-varying data. Such data sets have been appearing at an increasing rate especially from physics-based simulations, and can range in size from hundreds of gigabytes to tens of terabytes. Isosurface extraction and rendering is one of the most widely used visualization techniques to explore and analyze such data sets. A common strategy for isosurface extraction involves the determination of the so-called active cells followed by a triangulation of these cells based on linear interpolation, and ending with a rendering of the triangular mesh. We develop a new simple indexing scheme for out-of-core processing of large scale data sets, which enables the identification of the active cells extremely quickly, using more compact indexing structure and more effective bulk data movement than previous schemes. Moreover, our scheme leads to an efficient and scalable implementation on multiprocessor environments in which each processor has access to its own local disk. In particular, our parallel algorithm provably achieves load balancing across the processors independent of the isovalue, with almost no overhead in the total amount of work relative to the sequential algorithm. We conduct a large number of experimental tests on the University of Maryland Visualization Cluster using the Richtmyer{\textendash}Meshkov instability data set, and obtain results that consistently validate the efficiency and the scalability of our algorithm.}, keywords = {Parallel isosurface extraction, scientific visualization}, isbn = {0743-7315}, doi = {10.1016/j.jpdc.2006.12.007}, url = {http://www.sciencedirect.com/science/article/pii/S0743731506002450}, author = {Wang,Qin and JaJa, Joseph F. and Varshney, Amitabh} } @conference {14516, title = {Efficient Conversion of X.Y Surround Sound Content to Binaural Head-Tracked Form for HRTF-Enabled Playback}, booktitle = {IEEE International Conference on Acoustics, Speech and Signal Processing, 2007. ICASSP 2007}, volume = {1}, year = {2007}, month = {2007/04//}, pages = {I-21-I-24 - I-21-I-24}, publisher = {IEEE}, organization = {IEEE}, abstract = {Binaural presentation of X.Y sound is usually performed using virtual audio principles - that is, by attempting to virtually reproduce the setup of the X+Y loudspeakers in the reference room configuration. The computational cost of such playback is linear in the number of channels in the X.Y setup. We present a novel scheme that computes, offline, a spatio-temporal representation of the sound field in the listening area and store it as a multipole expansion. During head-tracked playback, the binaural signal is obtained by evaluating the multipole expansion at the ear position corresponding to the current user pose, resulting in a fixed playback cost. The representation is further extended to incorporate individualized HRTFs at no additional cost. Simulation results are presented.}, keywords = {Acoustic fields, Acoustic scattering, acoustic signal processing, audio acoustics, Audio systems, binaural head-tracked, binaural presentation, Computational efficiency, Costs, Ear, head-related transfer function, Headphones, HRTF-enabled playback, Loudspeakers, Music, reverberation, sound field, spatio-temporal representation, surround sound, surround sound content, Transfer functions, virtual audio principles}, isbn = {1-4244-0727-3}, doi = {10.1109/ICASSP.2007.366606}, author = {Zotkin,Dmitry N and Duraiswami, Ramani and Gumerov, Nail A.} } @conference {15134, title = {Efficient cryptographic protocols based on the hardness of learning parity with noise}, booktitle = {Proceedings of the 11th IMA international conference on Cryptography and coding}, series = {Cryptography and Coding{\textquoteright}07}, year = {2007}, month = {2007///}, pages = {1 - 15}, publisher = {Springer-Verlag}, organization = {Springer-Verlag}, address = {Berlin, Heidelberg}, abstract = {The problem of learning parity with noise (The LPN problem), which can be re-cast as the problem of decoding a random linear code, has attracted attention recently as a possible tool for developing highly-efficient cryptographic primitives suitable for resource-constrained devices such as RFID tags. This article surveys recent work aimed at designing efficient authentication protocols based on the conjectured hardness of this problem.}, isbn = {3-540-77271-5, 978-3-540-77271-2}, url = {http://dl.acm.org/citation.cfm?id=1782574.1782576}, author = {Katz, Jonathan} } @article {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} } @conference {12588, title = {Efficient Indexing For Articulation Invariant Shape Matching And Retrieval}, booktitle = {Computer Vision and Pattern Recognition, 2007. CVPR {\textquoteright}07. IEEE Conference on}, year = {2007}, month = {2007/06//}, pages = {1 - 8}, abstract = {Most shape matching methods are either fast but too simplistic to give the desired performance or promising as far as performance is concerned but computationally demanding. In this paper, we present a very simple and efficient approach that not only performs almost as good as many state-of-the-art techniques but also scales up to large databases. In the proposed approach, each shape is indexed based on a variety of simple and easily computable features which are invariant to articulations and rigid transformations. The features characterize pairwise geometric relationships between interest points on the shape, thereby providing robustness to the approach. Shapes are retrieved using an efficient scheme which does not involve costly operations like shape-wise alignment or establishing correspondences. Even for a moderate size database of 1000 shapes, the retrieval process is several times faster than most techniques with similar performance. Extensive experimental results are presented to illustrate the advantages of our approach as compared to the best in the field.}, keywords = {alignment;image, articulation, geometric, invariant, matching;image, matching;indexing;invariant, relationships;shape-wise, retrieval;indexing;, retrieval;pairwise, SHAPE}, doi = {10.1109/CVPR.2007.383227}, author = {Biswas,S. and Aggarwal,G. and Chellapa, Rama} } @article {17591, title = {Efficient lookup on unstructured topologies}, journal = {IEEE Journal on Selected Areas in Communications}, volume = {25}, year = {2007}, month = {2007/01//}, pages = {62 - 72}, abstract = {We present LMS, a protocol for efficient lookup on unstructured networks. Our protocol uses a virtual namespace without imposing specific topologies. It is more efficient than existing lookup protocols for unstructured networks, and thus is an attractive alternative for applications in which the topology cannot be structured as a Distributed Hash Table (DHT). We present analytic bounds for the worst-case performance of LMS. Through detailed simulations (with up to 100,000 nodes), we show that the actual performance on realistic topologies is significantly better. We also show in both simulations and a complete implementation (which includes over five hundred nodes) that our protocol is inherently robust against multiple node failures and can adapt its replication strategy to optimize searches according to a specific heuristic. Moreover, the simulation demonstrates the resilience of LMS to high node turnover rates, and that it can easily adapt to orders of magnitude changes in network size. The overhead incurred by LMS is small, and its performance approaches that of DHTs on networks of similar size}, keywords = {Computer science, DHT, distributed algorithms, Distributed computing, distributed hash table, Least squares approximation, LMS, local minima search, lookup protocol, Network topology, node failures, Peer to peer computing, Performance analysis, Protocols, replication strategy, Resilience, Robustness, table lookup, telecommunication network topology, unstructured network topology}, isbn = {0733-8716}, doi = {10.1109/JSAC.2007.07007}, author = {Morselli,R. and Bhattacharjee, Bobby and Marsh,M.A. and Srinivasan, Aravind} } @article {12346, title = {Efficient parallel memory organization for turbo decoders}, journal = {Red}, volume = {5}, year = {2007}, month = {2007///}, author = {Salmela,P. and Gu,R. and Bhattacharyya, Shuvra S. and Takala,J.} } @article {15121, title = {Efficient signature schemes with tight reductions to the Diffie-Hellman problems}, journal = {Journal of Cryptology}, volume = {20}, year = {2007}, month = {2007///}, pages = {493 - 514}, abstract = {We propose and analyze two efficient signature schemes whose security is tightly related to the Diffie-Hellman problems in the random oracle model. The security of our first scheme relies on the hardness of the computational Diffie-Hellman problem; the security of our second scheme - which is more efficient than the first-is based on the hardness of the decisional Diffie-Hellman problem, a stronger assumption. Given the current state of the art, it is as difficult to solve the Diffie-Hellman problems as it is to solve the discrete logarithm problem in many groups of cryptographic interest. Thus, the signature schemes shown here can currently offer substantially better efficiency (for a given level of provable security) than existing schemes based on the discrete logarithm assumption. The techniques we introduce can also be applied in a wide variety of settings to yield more efficient cryptographic schemes (based on various number-theoretic assumptions) with tight security reductions.}, doi = {10.1007/s00145-007-0549-3}, author = {Goh,E. J and Jarecki,S. and Katz, Jonathan and Wang,N.} } @article {12357, title = {Efficient simulation of critical synchronous dataflow graphs}, journal = {ACM Transactions on Design Automation of Electronic Systems (TODAES)}, volume = {12}, year = {2007}, month = {2007///}, pages = {1 - 28}, author = {Hsu,C. J and Ko,M. Y and Bhattacharyya, Shuvra S. and Ramasubbu,S. and Pino,J. L} } @conference {14847, title = {Efficiently Determining Silhouette Consistency}, booktitle = {Computer Vision and Pattern Recognition, 2007. CVPR {\textquoteright}07. IEEE Conference on}, year = {2007}, month = {2007/06//}, pages = {1 - 8}, abstract = {Volume intersection is a frequently used technique to solve the Shape-From-Silhouette problem, which constructs a 3D object estimate from a set of silhouettes taken with calibrated cameras. It is natural to develop an efficient algorithm to determine the consistency of a set of silhouettes before performing time-consuming reconstruction, so that inaccurate silhouettes can be omitted. In this paper we first present a fast algorithm to determine the consistency of three silhouettes from known (but arbitrary) viewing directions, assuming the projection is scaled orthographic. The temporal complexity of the algorithm is linear in the number of points of the silhouette boundaries. We further prove that a set of more than three convex silhouettes are consistent if and only if any three of them are consistent. Another possible application of our approach is to determine the miscalibrated cameras in a large camera system. A consistent subset of cameras can be determined on the fly and miscalibrated cameras can also be recalibrated at a coarse scale. Real and synthesized data are used to demonstrate our results.}, keywords = {camera;scaled, consistency;image, miscalibrated, orthographic, problem;silhouette, projection;shape-from-silhouette, reconstruction;}, doi = {10.1109/CVPR.2007.383161}, author = {Li Yi and Jacobs, David W.} } @article {17123, title = {eHealth Research from the User{\textquoteright}s Perspective}, journal = {American Journal of Preventive Medicine}, volume = {32}, year = {2007}, month = {2007/05//}, pages = {S97-S103 - S97-S103}, abstract = {The application of information technology (IT) to issues of healthcare delivery has had a long and tortuous history in the United States. Within the field of eHealth, vanguard applications of advanced computing techniques, such as applications in artificial intelligence or expert systems, have languished in spite of a track record of scholarly publication and decisional accuracy. The problem is one of purpose, of asking the right questions for the science to solve. Historically, many computer science pioneers have been tempted to ask {\textquotedblleft}what can the computer do?{\textquotedblright} New advances in eHealth are prompting developers to ask {\textquotedblleft}what can people do?{\textquotedblright} How can eHealth take part in national goals for healthcare reform to empower relationships between healthcare professionals and patients, healthcare teams and families, and hospitals and communities to improve health equitably throughout the population? To do this, eHealth researchers must combine best evidence from the user sciences (human factors engineering, human{\textendash}computer interaction, psychology, and usability) with best evidence in medicine to create transformational improvements in the quality of care that medicine offers. These improvements should follow recommendations from the Institute of Medicine to create a healthcare system that is (1) safe, (2) effective (evidence based), (3) patient centered, and (4) timely. Relying on the eHealth researcher{\textquoteright}s intuitive grasp of systems issues, improvements should be made with considerations of users and beneficiaries at the individual (patient{\textendash}physician), group (family{\textendash}staff), community, and broad environmental levels.}, isbn = {0749-3797}, doi = {10.1016/j.amepre.2007.01.019}, url = {http://www.sciencedirect.com/science/article/pii/S0749379707000487}, author = {Hesse,Bradford W. and Shneiderman, Ben} } @article {18006, title = {Electron beam and optical proximity effect reduction for nanolithography: New results}, journal = {Journal of Vacuum Science \& Technology B}, volume = {25}, year = {2007}, month = {2007///}, pages = {2288 - 2294}, abstract = {Proximity effect correction by dose modulation is widely practiced in electron-beam lithography. Optical proximity control is also possible using a combination of shape adjustment and phase control. Assigning {\textquotedblleft}the right{\textquotedblright} dose (or fill factor and phase for optics) is a well known mathematical inverse problem. Linear programming, by definition, is the appropriate method for determining dose. In the past, the technique was too slow for full-scale implementation in mask making. Here, the authors discuss how recent developments in computer speed and architecture have improved the prospects for full-scale implementation. In addition, the authors discuss some numerical techniques, analogous to gridding and relaxation, that make linear programming more attractive in mask making.}, keywords = {electron beam lithography, Linear programming, masks, nanolithography, proximity effect (lithography)}, doi = {10.1116/1.2806967}, url = {http://link.aip.org/link/?JVB/25/2288/1}, author = {Peckerar,Martin and Sander,David and Srivastava,Ankur and Foli,Adakou and Vishkin, Uzi} } @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.} } @article {12130, title = {Empirical studies to build a science of computer science}, journal = {Communications of the ACM}, volume = {50}, year = {2007}, month = {2007/11//}, pages = {33 - 37}, abstract = {We learn to develop software by building, testing, and evolving models.}, isbn = {0001-0782}, doi = {10.1145/1297797.1297819}, url = {http://doi.acm.org/10.1145/1297797.1297819}, author = {Basili, Victor R. and Zelkowitz, Marvin V} } @conference {18654, title = {An empirical study of filesystem activity following a SSH compromise}, year = {2007}, month = {2007/12//}, pages = {1 - 5}, abstract = {Monitoring filesystem data is a common method used to detect attacks. Once a computer is compromised, attackers will likely alter files, add new files or delete existing files. The changes that attackers make may target any part of the filesystem, including metadata along with files (e.g., permissions, ownerships and inodes). In this paper, we describe an empirical study that focused on SSH compromised attacks. First statistical data on the number of files targeted and the associated activity (e.g., read, write, delete, ownership and rights) is reported. Then, we refine the analysis to identify and understand patterns in the attack activity.}, keywords = {attack activity, filesystem activity, filesystem data monitoring, intrusion detection systems evaluation, meta data, metadata, security of data, SSH compromised attacks}, doi = {10.1109/ICICS.2007.4449675}, author = {Molina,J. and Gordon,J. and Chorin,X. and Michel Cukier} } @conference {12330, title = {Energy-aware data compression for wireless sensor networks}, booktitle = {Acoustics, Speech and Signal Processing, 2007. ICASSP 2007. IEEE International Conference on}, volume = {2}, year = {2007}, month = {2007///}, pages = {II{\textendash}45 - II{\textendash}45}, author = {Puthenpurayil,S. and Gu,R. and Bhattacharyya, Shuvra S.} } @conference {12382, title = {An energy-driven design methodology for distributing DSP applications across wireless sensor networks}, booktitle = {Proceedings of RTSS}, year = {2007}, month = {2007///}, pages = {214 - 226}, author = {Shen,C. C and Plishker,W. and Bhattacharyya, Shuvra S. and Goldsman,N.} } @article {12118, title = {An Environment of Conducting Families of Software Engineering Experiments}, year = {2007}, month = {2007/05//}, institution = {University of Maryland, College Park}, abstract = {The classroom is a valuable resource for conducting software engineering experiments. However, coordinating a family of experiments in classroom environments presents a number of challenges to researchers. This paper describes an environment that simplifies the process of collecting, managing and sanitizing data from classroom experiments, while minimizing disruption to natural subject behavior. We have successfully used this environment to study the impact of parallel programming languages on programmer productivity at multiple universities across the United States.}, keywords = {collecting data, managing data, parallel programming languages, sanitizing data, software engineering experiments, universities}, url = {http://drum.lib.umd.edu/handle/1903/7545}, author = {Hochstein, Lorin and Nakamura,Taiga and Shull, Forrest and Zazworka, Nico and Voelp,Martin and Zelkowitz, Marvin V and Basili, Victor R.} } @conference {12584, title = {Epitomic Representation of Human Activities}, booktitle = {Computer Vision and Pattern Recognition, 2007. CVPR {\textquoteright}07. IEEE Conference on}, year = {2007}, month = {2007/06//}, pages = {1 - 8}, abstract = {We introduce an epitomic representation for modeling human activities in video sequences. A video sequence is divided into segments within which the dynamics of objects is assumed to be linear and modeled using linear dynamical systems. The tuple consisting of the estimated system matrix, statistics of the input signal and the initial state value is said to form an epitome. The system matrices are decomposed using the Iwasawa matrix decomposition to isolate the effect of rotation, scaling and projective action on the state vector. "We demonstrate the usefulness of the proposed representation and decomposition for activity recognition using the TSA airport surveillance dataset and the UCF indoor human action dataset.}, keywords = {action, activities, airport, dataset;epitomic, dataset;UCF, decomposition;modelling;statistics;video, decomposition;TSA, dynamical, human, indoor, Iwasawa, matrix, matrix;human, modeling;input, processing;, representation;estimated, sequences;image, sequences;matrix, signal, statistics;linear, Surveillance, system, systems;video}, doi = {10.1109/CVPR.2007.383135}, author = {Cuntoor, N.P. and Chellapa, Rama} } @article {12600, title = {Estimation of contour motion and deformation for nonrigid object tracking}, journal = {Journal of the Optical Society of America AJ. Opt. Soc. Am. A}, volume = {24}, year = {2007}, month = {2007///}, pages = {2109 - 2121}, abstract = {We present an algorithm for nonrigid contour tracking in heavily cluttered background scenes. Based on the properties of nonrigid contour movements, a sequential framework for estimating contour motion and deformation is proposed. We solve the nonrigid contour tracking problem by decomposing it into three subproblems: motion estimation, deformation estimation, and shape regulation. First, we employ a particle filter to estimate the global motion parameters of the affine transform between successive frames. Then we generate a probabilistic deformation map to deform the contour. To improve robustness, multiple cues are used for deformation probability estimation. Finally, we use a shape prior model to constrain the deformed contour. This enables us to retrieve the occluded parts of the contours and accurately track them while allowing shape changes specific to the given object types. Our experiments show that the proposed algorithm significantly improves the tracker performance.}, keywords = {Motion detection, VISION}, doi = {10.1364/JOSAA.24.002109}, url = {http://josaa.osa.org/abstract.cfm?URI=josaa-24-8-2109}, author = {Jie Shao and Porikli,Fatih and Chellapa, Rama} } @article {14570, title = {Eukaryotic Transcriptional Regulation: Signals, Interactions, and Modules}, journal = {Computational genomics: current methods}, year = {2007}, month = {2007///}, pages = {21 - 21}, author = {Hannenhalli, Sridhar} } @article {16670, title = {Evaluating a cross-cultural children{\textquoteright}s online book community: Lessons learned for sociability, usability, and cultural exchange}, journal = {Interacting with Computers}, volume = {19}, year = {2007}, month = {2007/07//}, pages = {494 - 511}, abstract = {The use of computers for human-to-human communication among adults has been studied for many years, but using computer technology to enable children from all over the world to talk to each other has rarely been discussed by researchers. The goal of our research is to fill this gap and explore the design and evaluation of children{\textquoteright}s cross-language online communities via a case study of the International Children{\textquoteright}s Digital Library Communities (ICDLCommunities). This project supports the development of communities for children (ages 7{\textendash}11) that form around the International Digital Children{\textquoteright}s Library (ICDL) book collection. In this community the children can learn about each others{\textquoteright} cultures and make friends even if they do not speak the same language. They can also read and create stories and ask and answer questions about these. From this evaluation study we learned that: (i) children are very interested in their counterparts in other countries and a remarkable amount of communication takes place even when they do not share a common language; (ii) representing their identity online in many different forms is particularly important to children when communicating in an online community; (iii) children enjoy drawing but representing stories in a sequence of diagrams is challenging and needs support; and (iv) asking and answering questions without language is possible using graphical templates. In this paper we present our findings and make recommendations for designing children{\textquoteright}s cross-cultural online communities.}, keywords = {children, Cross-cultural, Evaluation and design, International Children{\textquoteright}s Digital Library, Online communities}, isbn = {0953-5438}, doi = {10.1016/j.intcom.2007.03.001}, url = {http://www.sciencedirect.com/science/article/pii/S0953543807000240}, author = {Komlodi,Anita and Hou,Weimin and Preece,Jenny and Druin, Allison and Golub,Evan and Alburo,Jade and Liao,Sabrina and Elkiss,Aaron and Resnik, Philip} } @conference {15327, title = {Evaluation of Traditional and Shock-Confining LES Filters using DNS Data of Compressible Turbulence}, booktitle = {Proceedings of 18th AIAA Computational Fluid Dynamics Conference}, year = {2007}, month = {2007///}, abstract = {Uniformly high-order-accurate filtering of fluid flow properties in the presence of shocksand shocklets is theoretically susceptible to the same problem that afflicts uniformly high- order-accurate numerical methods for approximating the convective terms of the Navier- Stokes equations: the introduction of new, non-physical extrema near discontinuities. Ex- tensive investigations have been conducted into myriad types of shock-capturing methods, which adaptively decrease their order of accuracy within shock-containing regions in order to maintain accuracy and stability over time. Inspired by such work, Grube et al. (AIAA 2007-4198) have proposed the conceptually similar idea of {\textquotedblleft}shock-confining{\textquotedblright} filtering (SCF) for compressible large-eddy simulations (LES), in which a class of linear filters is subject to adaptive adjustments based on smoothness information provided by a weighted essen- tially non-oscillatory (WENO) method. In the current work, we utilize the turbulent flow fields produced by direct numerical simulations (DNS) of shock/isotropic-turbulence inter- action to perform preliminary a priori testing of these shock-confining filters against the corresponding linear filters. Although additional study, both a priori and a posteriori, is required to verify the necessity and suitability of SCF for LES, we conclude that linear filtering can indeed create serious qualitative discrepancies in global flow characteristics, discrepancies that are avoided by the use of SCF. }, author = {Taylor,E. M and Grube,N. E and Martin, M.P} } @article {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} } @conference {16427, title = {Evolution of non-uniform cellular automata using a genetic algorithm: diversity and computation}, booktitle = {Proceedings of the 9th annual conference on Genetic and evolutionary computation}, series = {GECCO {\textquoteright}07}, year = {2007}, month = {2007///}, pages = {1531 - 1531}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {We used a genetic algorithm to evaluate the cost / benefit of diversity in evolving sets of rules for non-uniform cellular automata solving the density classification problem.}, keywords = {diversity, Genetic algorithms, non-uniform cellular automata, search spaces}, isbn = {978-1-59593-697-4}, doi = {10.1145/1276958.1277260}, url = {http://doi.acm.org/10.1145/1276958.1277260}, author = {Sondahl,Forrest and Rand, William} } @article {16408, title = {Examining Group Behavior and Collaboration using ABM and Robots}, journal = {Proc. of Agent}, year = {2007}, month = {2007///}, abstract = {Agent-based modeling has been extensively used by scientists to study complex systems.Participatory simulations are similar to agent-based models except that humans play the role of the virtual agents. The Bifocal modeling approach uses sensors to gather data about the real-world phenomena being modeled and uses that information to affect the model. In this work, we are interested in automatically extracting, analyzing and modeling group behaviors in problem solving. Combining these three systems into one unified platform would be useful for those purposes, since it would facilitate a synthesis of their main affordances: understanding the role of locality, mapping human action to emergent behaviors, and controlling embedded physical objects in noisy environments while receiving sensory feedback. We will demonstrate a technological platform based on the NetLogo/HubNet architecture that supports simulated agents, participatory agents and physical agents. We place this platform within a more general framework that we call Human, Embedded and Virtual agents in Mediation (HEV-M). We have run several studies using an instantiation of this platform that consists of a robot-car with four users who navigate a maze. We believe that this tool has potential for three main reasons (1) it facilitates logging of participant{\textquoteright}s actions, so as to identify patterns, (2) it offers researchers in the field of computer-supported collaborative learning an easy-to-use tool to design engaging collaborative learning activities and, (3) it foregrounds the role of individual actions within the accomplishment of a collective goal, highlighting the connections between simple individual actions and the resultant macroscopic behaviors of the system. }, author = {Blikstein,P. and Rand, William and Wilensky,Uri} } @article {16850, title = {Execution time analysis of a top-down R-tree construction algorithm}, journal = {Information Processing Letters}, volume = {101}, year = {2007}, month = {2007/01/16/}, pages = {6 - 12}, abstract = {A detailed CPU execution-time analysis and implementation are given for a bulk loading algorithm to construct R-trees due to Garc{\'\i}a et al. [Y.J. Garc{\'\i}a, M.A. L{\'o}pez, S.T. Leutenegger, A greedy algorithm for bulk loading R-trees, in: GIS{\textquoteright}98: Proc. of the 6th ACM Intl. Symp. on Advances in Geographic Information Systems, Washington, DC, 1998, pp. 163{\textendash}164] which is known as the top-down greedy split (TGS) bulk loading algorithm. The TGS algorithm makes use of a classical bottom-up packing approach. In addition, an alternative packing approach termed top-down packing is introduced which may lead to improved query performance, and it is shown how to incorporate it into the TGS algorithm. A discussion is also presented of the tradeoffs of using the bottom-up and top-down packing approaches.}, keywords = {Bulk loading, Data structures, Packing, R-trees, Spatial databases}, isbn = {0020-0190}, doi = {10.1016/j.ipl.2006.07.010}, url = {http://www.sciencedirect.com/science/article/pii/S002001900600233X}, author = {Alborzi,Houman and Samet, Hanan} } @article {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 {13770, title = {Exploiting aspectual features and connecting words for summarization-inspired temporal-relation extraction}, journal = {Information Processing \& Management}, volume = {43}, year = {2007}, month = {2007/11//}, pages = {1681 - 1704}, abstract = {This paper presents a model that incorporates contemporary theories of tense and aspect and develops a new framework for extracting temporal relations between two sentence-internal events, given their tense, aspect, and a temporal connecting word relating the two events. A linguistic constraint on event combination has been implemented to detect incorrect parser analyses and potentially apply syntactic reanalysis or semantic reinterpretation{\textemdash}in preparation for subsequent processing for multi-document summarization. An important contribution of this work is the extension of two different existing theoretical frameworks{\textemdash}Hornstein{\textquoteright}s 1990 theory of tense analysis and Allen{\textquoteright}s 1984 theory on event ordering{\textemdash}and the combination of both into a unified system for representing and constraining combinations of different event types (points, closed intervals, and open-ended intervals). We show that our theoretical results have been verified in a large-scale corpus analysis. The framework is designed to inform a temporally motivated sentence-ordering module in an implemented multi-document summarization system.}, keywords = {Parsing and corpus analysis, Summarization, temporal ordering, Temporal-relation extraction, Tense, aspect and connecting words}, isbn = {0306-4573}, doi = {10.1016/j.ipm.2007.01.008}, url = {http://www.sciencedirect.com/science/article/pii/S0306457307000271}, author = {Dorr, Bonnie J and Gaasterland,Terry} } @article {15281, title = {An exploration of the principles underlying redundancy-based factoid question answering}, journal = {ACM Transactions on Information Systems}, volume = {25}, year = {2007}, month = {2007/04//}, abstract = {The so-called {\textquotedblleft}redundancy-based{\textquotedblright} approach to question answering represents a successful strategy for mining answers to factoid questions such as {\textquotedblleft}Who shot Abraham Lincoln?{\textquotedblright} from the World Wide Web. Through contrastive and ablation experiments with Aranea, a system that has performed well in several TREC QA evaluations, this work examines the underlying assumptions and principles behind redundancy-based techniques. Specifically, we develop two theses: that stable characteristics of data redundancy allow factoid systems to rely on external {\textquotedblleft}black box{\textquotedblright} components, and that despite embodying a data-driven approach, redundancy-based methods encode a substantial amount of knowledge in the form of heuristics. Overall, this work attempts to address the broader question of {\textquotedblleft}what really matters{\textquotedblright} and to provide guidance for future researchers.}, keywords = {Data redundancy, Web search}, isbn = {1046-8188}, doi = {10.1145/1229179.1229180}, url = {http://doi.acm.org/10.1145/1229179.1229180}, author = {Jimmy Lin} } @article {14086, title = {The Expression of a Plant-type Ferredoxin Redox System provides Molecular Evidence for a Plastid in the Early Dinoflagellate Perkinsus marinus}, journal = {Protist}, volume = {158}, year = {2007}, month = {2007/01/22/}, pages = {119 - 130}, abstract = {Perkinsus marinus is a parasitic protozoan with a phylogenetic positioning between Apicomplexa and dinoflagellates. It is thus of interest for reconstructing the early evolution of eukaryotes, especially with regard to the acquisition of secondary plastids in these organisms. It is also an important pathogen of oysters, and the definition of parasite-specific metabolic pathways would be beneficial for the identification of efficient treatments for infected mollusks. Although these different scientific interests have resulted in the start of a genome project for this organism, it is still unknown whether P. marinus contains a plastid or plastid-like organelle like the related dinoflagellates and Apicomplexa. Here, we show that in vitro-cultivated parasites contain transcripts of the plant-type ferredoxin and its associated reductase. Both proteins are nuclear-encoded and possess N-terminal targeting sequences similar to those characterized in dinoflagellates. Since this redox pair is exclusively found in cyanobacteria and plastid-harboring organisms its presence also in P. marinus is highly indicative of a plastid. We also provide additional evidence for such an organelle by demonstrating pharmacological sensitivity to inhibitors of plastid-localized enzymes involved in fatty acid biosynthesis (e.g. acetyl-CoA carboxylase) and by detection of genes for three enzymes of plastid-localized isoprenoid biosynthesis (1-deoxy-D-xylulose 5-phosphate reductoisomerase, (E)-4-hydroxy-3-methyl-but-2-enyl diphosphate reductase, and (E)-4-hydroxy-3-methyl-but-2-enyl diphosphate synthase).}, keywords = {Apicomplexa, ferredoxin, Perkinsozoa, plastid, transit peptide}, isbn = {1434-4610}, doi = {16/j.protis.2006.09.003}, url = {http://www.sciencedirect.com/science/article/pii/S1434461006001015}, author = {Stelter,Kathrin and El-Sayed, Najib M. and Seeber,Frank} } @article {16738, title = {Extended wavelets for multiple measures}, journal = {ACM Transactions on Database SystemsACM Trans. Database Syst.}, volume = {32}, year = {2007}, month = {2007/06//}, pages = {10-es - 10-es}, isbn = {03625915}, doi = {10.1145/1242524.1242527}, url = {http://dl.acm.org/citation.cfm?id=1242527}, author = {Deligiannakis,Antonios and Garofalakis,Minos and Roussopoulos, Nick} } @inbook {12634, title = {Early Recognition Approaches}, booktitle = {Human Identification Based on GaitHuman Identification Based on Gait}, year = {2006}, month = {2006///}, pages = {35 - 43}, abstract = {The earliest approaches concerned recognition within small populations, with the volume of data limited largely by the computational resources available then. As illustrated by Fig. 4.1, many sought to derive a human silhouette from an image and, as common in pattern recognition, and then to derive a description which can be associated with the identity of the subject. This gives a {\textquoteleft}statistical{\textquoteright} approach to automatic gait recognition wherein the image sequence is described as a whole, and neither by a model- nor by a motion-based approach, but one which describes the motion content. Given that techniques to separate a moving object from its background have been developed for many years (especially in surveillance) there existed a selection of approaches to derive the silhouette of the moving subject, an example silhouette extraction from the image of Fig. 4.1(a) is shown in Fig. 4.1(b). What was then needed was approaches to process the sequence of silhouettes so as to derive a gait signature {\textemdash} a set of numbers to represent a subject{\textquoteright}s identity. A selection of signatures is shown in Fig. 4.1(c) which are displayed in a 3-dimensional space for visualization purposes only (the signature usually has more dimensions than this). These signatures represent ten of walking subjects with four instances of each subject. In this case the signatures derived from the four instances mostly cluster well, representing a good recognition rate. Accordingly, the target of the early approaches was to process video data of the form of Fig. 4.1(a) to obtain silhouettes of the form of Fig. 4.1(b) so as to derive signatures for recognition performance analysis.}, author = {Nixon, M.S. and Tan, T. and Chellapa, Rama} } @article {13160, title = {Edge affinity for pose-contour matching}, journal = {Computer Vision and Image Understanding}, volume = {104}, year = {2006}, month = {2006/10//}, pages = {36 - 47}, abstract = {We present an approach for whole-body pose-contour matching. Contour matching in natural images in the absence of foreground{\textendash}background segmentation is difficult. Usually an asymmetric approach is adopted, where a contour is said to match well if it aligns with a subset of the image{\textquoteright}s gradients. This leads to problems as the contour can match with a portion of an object{\textquoteright}s outline and ignore the remainder. We present a model for using edge continuity to address this issue. Pairs of edge elements in the image are linked with affinities if they are likely to belong to the same object. A contour that matches with a set of image gradients is constrained to also match with other gradients having high affinities with the chosen ones. Experimental results show that this improves matching performance.}, keywords = {Contour matching, Edge continuity}, isbn = {1077-3142}, doi = {10.1016/j.cviu.2006.06.008}, url = {http://www.sciencedirect.com/science/article/pii/S1077314206000737}, author = {Prasad,V. S.N and Davis, Larry S. and Tran,Son Dinh and Elgammal,Ahmed} } @conference {12643, title = {Edge Suppression by Gradient Field Transformation Using Cross-Projection Tensors}, booktitle = {Computer Vision and Pattern Recognition, 2006 IEEE Computer Society Conference on}, volume = {2}, year = {2006}, month = {2006///}, pages = {2301 - 2308}, abstract = {We propose a new technique for edge-suppressing operations on images. We introduce cross projection tensors to achieve affine transformations of gradient fields. We use these tensors, for example, to remove edges in one image based on the edge-information in a second image. Traditionally, edge suppression is achieved by setting image gradients to zero based on thresholds. A common application is in the Retinex problem, where the illumination map is recovered by suppressing the reflectance edges, assuming it is slowly varying. We present a class of problems where edge-suppression can be a useful tool. These problems involve analyzing images of the same scene under variable illumination. Instead of resetting gradients, the key idea in our approach is to derive local tensors using one image and to transform the gradient field of another image using them. Reconstructed image from the modified gradient field shows suppressed edges or textures at the corresponding locations. All operations are local and our approach does not require any global analysis. We demonstrate the algorithm in the context of several applications such as (a) recovering the foreground layer under varying illumination, (b) estimating intrinsic images in non-Lambertian scenes, (c) removing shadows from color images and obtaining the illumination map, and (d) removing glass reflections.}, doi = {10.1109/CVPR.2006.106}, author = {Agrawal,A. and Raskar, R. and Chellapa, Rama} } @article {16388, title = {The effect of building block construction on the behavior of the ga in dynamic environments: A case study using the shaky ladder hyperplane-defined functions}, journal = {Applications of Evolutionary Computing}, year = {2006}, month = {2006///}, pages = {776 - 787}, abstract = {The shaky ladder hyperplane-defined functions (sl-hdf{\textquoteright}s) are a test suite utilized for exploring the behavior of the genetic algorithm (GA) in dynamic environments. We present three ways of constructing the sl-hdf{\textquoteright}s by manipulating the way building blocks are constructed, combined, and changed. We examine the effect of the length of elementary building blocks used to create higher building blocks, and the way in which those building blocks are combined. We show that the effects of building block construction on the behavior of the GA are complex. Our results suggest that construction routines which increase the roughness of the changes in the environment allow the GA to perform better by preventing premature convergence. Moreover, short length elementary building blocks permit early rapid progress.}, doi = {10.1007/11732242_75}, author = {Rand, William and Riolo,R} } @conference {16423, title = {The effect of crossover on the behavior of the GA in dynamic environments: a case study using the shaky ladder hyperplane-defined functions}, booktitle = {Proceedings of the 8th annual conference on Genetic and evolutionary computation}, series = {GECCO {\textquoteright}06}, year = {2006}, month = {2006///}, pages = {1289 - 1296}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {One argument as to why the hyperplane-defined functions (hdf{\textquoteright}s) are a good testbed for the genetic algorithm (GA) is that the hdf{\textquoteright}s are built in the same way that the GA works. In this paper we test that hypothesis in a new setting by exploring the GA on a subset of the hdf{\textquoteright}s which are dynamic---the shaky ladder hyperplane-defined functions (sl-hdf{\textquoteright}s). In doing so we gain insight into how the GA makes use of crossover during its traversal of the sl-hdf search space. We begin this paper by explaining the sl-hdf{\textquoteright}s. We then conduct a series of experiments with various crossover rates and various rates of environmental change. Our results show that the GA performs better with than without crossover in dynamic environments. Though these results have been shown on some static functions in the past, they are re-confirmed and expanded here for a new type of function (the hdf) and a new type of environment (dynamic environments). Moreover we show that crossover is even more beneficial in dynamic environments than it is in static environments. We discuss how these results can be used to develop a richer knowledge about the use of building blocks by the GA.}, keywords = {crossover, dynamic environments, Genetic algorithms, hyperplane-defined functions, search}, isbn = {1-59593-186-4}, doi = {10.1145/1143997.1144198}, url = {http://doi.acm.org/10.1145/1143997.1144198}, author = {Rand, William and Riolo,Rick and Holland,John H.} } @article {12930, title = {Effect of transport at ambient temperature on detection and isolation of Vibrio cholerae from environmental samples}, journal = {Applied and environmental microbiology}, volume = {72}, year = {2006}, month = {2006///}, pages = {2185 - 2190}, abstract = {It has long been assumed that prolonged holding of environmental samples at the ambient air temperature prior to bacteriological analysis is detrimental to isolation and detection of Vibrio cholerae, the causative agent of pandemic cholera. The present study was aimed at understanding the effect of transporting environmental samples at the ambient air temperature on isolation and enumeration of V. cholerae. For water and plankton samples held at ambient temperatures ranging from 31{\textdegree}C to 35{\textdegree}C for 20 h, the total counts did not increase significantly but the number of culturable V. cholerae increased significantly compared to samples processed within 1 h of collection, as measured by culture, acridine orange direct count, direct fluorescent-antibody-direct viable count (DFA-DVC), and multiplex PCR analyses. For total coliform counts, total bacterial counts, and DFA-DVC counts, the numbers did not increase significantly, but the culturable plate counts for V. cholerae increased significantly after samples were held at the ambient temperature during transport to the laboratory for analysis. An increase in the recovery of V. cholerae O1 and improved detection of V. cholerae O1 rfb and ctxA also occurred when samples were enriched after they were kept for 20 h at the ambient temperature during transport. Improved detection and isolation of toxigenic V. cholerae from freshwater ecosystems can be achieved by holding samples at the ambient temperature, an observation that has significant implications for tracking this pathogen in diverse aquatic environments.}, author = {Alam,M. and Sadique,A. and Bhuiyan,N. A. and Nair,G. B. and Siddique,A. K. and Sack,D. A. and Ahsan,S. and Huq,A. and Sack,R. B. and Rita R Colwell and others} } @article {15744, title = {Efficient Circuits for Exact-Universal Computation with Qudits}, journal = {Quantum Information and Computation}, volume = {6}, year = {2006}, month = {2006///}, pages = {436 - 454}, author = {Brennen,Gavin K. and Bullock,Stephen S. and O{\textquoteright}Leary, Dianne P.} } @article {14013, title = {Efficient computation of 3-D acoustical scattering from multiple arbitrarily shaped objects using the boundary element method/fast multipole method (BEM/FMM)}, journal = {The Journal of the Acoustical Society of America}, volume = {120}, year = {2006}, month = {2006///}, pages = {3282 - 3282}, abstract = {Many applications require computation of acoustic fields in systems consisting of a large number of scatterers, which may have complex shape. Despite the boundary element method being a well-known technique for solution of the boundary value problems for the Helmholtz equation, its capabilities are usually limited by the memory and speed of computers, and conventional methods can be applicable to relatively small (up to order of 10000 boundary elements) problems. We developed and implemented an efficient computational technique, based on an iterative solver employing generalized minimal residual method in combination with matrix-vector multiplication speeded up with the fast multipole method. We demonstrate that this technique has O(N) memory and computational complexity and enables solution of problems with thousands of scatterers (millions of boundary elements) on a desktop PC. The test problems solved are of moderate frequency (up to kD<=150, where k is the wavenumber and D is the size of the computational domain). Solution of large scale scattering problems was tested by comparison with the FMM-based T-matrix method applicable for simple shape objects reported earlier [Gumerov and Duraiswami, J. Acoust. Soc. Am., 117(4), 1744{\textendash}1761 (2005)], visualization, and physical interpretation of the results.}, url = {http://link.aip.org/link/?JAS/120/3282/2}, author = {Gumerov, Nail A. and Duraiswami, Ramani} } @article {17931, title = {An Efficient Computational Method for Predicting Rotational Diffusion Tensors of Globular Proteins Using an Ellipsoid Representation}, journal = {Journal of the American Chemical Society}, volume = {128}, year = {2006}, month = {2006///}, pages = {15432 - 15444}, abstract = {We propose a new computational method for predicting rotational diffusion properties of proteins in solution. The method is based on the idea of representing protein surface as an ellipsoid shell. In contrast to other existing approaches this method uses principal component analysis of protein surface coordinates, which results in a substantial increase in the computational efficiency of the method. Direct comparison with the experimental data as well as with the recent computational approach (Garcia de la Torre; et al. J. Magn. Reson. 2000, B147, 138?146), based on representation of protein surface as a set of small spherical friction elements, shows that the method proposed here reproduces experimental data with at least the same level of accuracy and precision as the other approach, while being approximately 500 times faster. Using the new method we investigated the effect of hydration layer and protein surface topography on the rotational diffusion properties of a protein. We found that a hydration layer constructed of approximately one monolayer of water molecules smoothens the protein surface and effectively doubles the overall tumbling time. We also calculated the rotational diffusion tensors for a set of 841 protein structures representing the known protein folds. Our analysis suggests that an anisotropic rotational diffusion model is generally required for NMR relaxation data analysis in single-domain proteins, and that the axially symmetric model could be sufficient for these purposes in approximately half of the proteins.We propose a new computational method for predicting rotational diffusion properties of proteins in solution. The method is based on the idea of representing protein surface as an ellipsoid shell. In contrast to other existing approaches this method uses principal component analysis of protein surface coordinates, which results in a substantial increase in the computational efficiency of the method. Direct comparison with the experimental data as well as with the recent computational approach (Garcia de la Torre; et al. J. Magn. Reson. 2000, B147, 138?146), based on representation of protein surface as a set of small spherical friction elements, shows that the method proposed here reproduces experimental data with at least the same level of accuracy and precision as the other approach, while being approximately 500 times faster. Using the new method we investigated the effect of hydration layer and protein surface topography on the rotational diffusion properties of a protein. We found that a hydration layer constructed of approximately one monolayer of water molecules smoothens the protein surface and effectively doubles the overall tumbling time. We also calculated the rotational diffusion tensors for a set of 841 protein structures representing the known protein folds. Our analysis suggests that an anisotropic rotational diffusion model is generally required for NMR relaxation data analysis in single-domain proteins, and that the axially symmetric model could be sufficient for these purposes in approximately half of the proteins. }, isbn = {0002-7863}, doi = {10.1021/ja062715t}, url = {http://dx.doi.org/10.1021/ja062715t}, author = {Ryabov,Yaroslav E. and Geraghty,Charles and Varshney, Amitabh and Fushman, David} } @article {14959, title = {Efficient Isosurface Extraction for Large Scale Time-Varying Data Using the Persistent Hyperoctree (PHOT)}, volume = {UMIACS-TR-2006-01}, year = {2006}, month = {2006/01/13/T20:3}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {We introduce the Persistent HyperOcTree (PHOT) to handle the4D isocontouring problem for large scale time-varying data sets. This novel data structure is provably space efficient and optimal in retrieving active cells. More importantly, the set of active cells for any possible isovalue are already organized in a Compact Hyperoctree, which enables very efficient slicing of the isocontour along spatial and temporal dimensions. Experimental results based on the very large Richtmyer-Meshkov instability data set demonstrate the effectiveness of our approach. This technique can also be used for other isosurfacing schemes such as view-dependent isosurfacing and ray-tracing, which will benefit from the inherent hierarchical structure associated with the active cells. }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/3035}, author = {Shi,Qingmin and JaJa, Joseph F.} } @conference {16876, title = {Efficient position-independent iconic search using an R-theta index}, booktitle = {Proceedings of the 14th annual ACM international symposium on Advances in geographic information systems}, series = {GIS {\textquoteright}06}, year = {2006}, month = {2006///}, pages = {27 - 34}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {An iconic image database is a collection of symbolic images where each image is a collection of labeled point features called icons. A method is presented to support fast position-independent similarity search in an iconic database for symbolic images where the similarity condition involves finding icon pairs that satisfy a specific spatial relationship. This is achieved by introducing an index data structure based on r-θ space, which corresponds to the Cartesian product of separation (i.e., inter-icon distance) and (some representation of) relative spatial orientation. In this space, each pairing of two icons is represented by a single point, and all pairs with the same separation and relative orientation (regardless of absolute position) map to the same point. Similarly, all icon pairs with the same separation but different relative orientations map to points on a line parallel to the θ axis, while all pairs with different separations but the same relative orientation map to points on a line parallel to the r axis. Using such an index, database search for icon pairs with a given spatial relationship or range is accomplished by examining the subarea of the index space into which desired pairs would map. This r-θ index space can be organized using well-known spatial database techniques, such as quadtrees or R-trees. Although the size of such an index grows only linearly with respect to the number of images in the collection, it grows quadratically with the average number of icons in an image. A scheme is described to reduce the size of the index by pruning away a subset of the pairs, at the cost of incurring additional work when searching the database. This pruning is governed by a parameter φ, whose variation provides a continuous range of trade-offs between index size and search time.}, keywords = {iconic database, position-independent, spatial indexing}, isbn = {1-59593-529-0}, doi = {10.1145/1183471.1183478}, url = {http://doi.acm.org/10.1145/1183471.1183478}, author = {Cranston,Charles B. and Samet, Hanan} } @conference {12348, title = {Efficient simulation of critical synchronous dataflow graphs}, booktitle = {Proceedings of the 43rd annual Design Automation Conference}, year = {2006}, month = {2006///}, pages = {893 - 898}, author = {Hsu,C. J and Ramasubbu,S. and Ko,M. Y and Pino,J. L and Bhattacharyya, Shuvra S.} } @article {12373, title = {Efficient techniques for clustering and scheduling onto embedded multiprocessors}, journal = {IEEE Transactions on Parallel and Distributed Systems}, year = {2006}, month = {2006///}, pages = {667 - 680}, author = {Kianzad,V. and Bhattacharyya, Shuvra S.} } @article {17696, title = {EIGENTEST: A Test Matrix Generator for Large-Scale Eigenproblems}, volume = {UMIACS-TR-2006-07}, year = {2006}, month = {2006/02/13/T19:4}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {Eigentest is a package that produces real test matrices with knowneigensystems. A test matrix, called an eigenmat, is generated in a factored form, in which the user can specify the eigenvalues and has some control over the condition of the eigenvalues and eigenvectors. An eigenmat A of order n requires only O(n) storage for its representation. Auxiliary programs permit the computation of (A - sI)*b, (A - sI){\textquoteright}*b, inv(A - sI)*b, and inv(A - sI)*b in O(n) operations. A special routine computes specified eigenvectors of an eigenmat and the condition of its eigenvalue. Thus eigenmats are suitable for testing algorithms based on Krylov sequences, as well as others based on matrix-vector products. This paper introduces the eigenmat and describes implementations in Fortran~77, Fortran~95, C, and Matlab. }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/3328}, author = {Lee,Che Rung and Stewart, G.W.} } @article {14429, title = {Empirical comparison of approximate inference algorithms for networked data}, journal = {Open Problems in Statistical Relational Learning: Papers from the ICML Workshop. Pittsburgh, PA: www. cs. umd. edu/projects/srl2006}, year = {2006}, month = {2006///}, abstract = {Over the past few years, a number of approx-imate inference algorithms for networked data have been put forth. We empirically compare the performance of three of the popular algorithms: loopy belief propagation, mean field relaxation labeling and iterative classification. We rate each algorithm in terms of its robustness to noise, both in attribute values and correlations across links. A novel observation from our experiments is that loopy belief propagation faces difficulty when in- ferring over data with homophily, a common type of link correlation observed in relational data. }, author = {Sen,P. and Getoor, Lise} } @conference {12115, title = {An empirical study to compare two parallel programming models}, booktitle = {Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures}, series = {SPAA {\textquoteright}06}, year = {2006}, month = {2006///}, pages = {114 - 114}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {While there are strong beliefs within the community about whether one particular parallel programming model is easier to use than another, there has been little research to analyze these claims empirically. Currently, the most popular paradigm is message-passing, as implemented by the MPI library [1]. However, MPI is considered to be difficult for developing programs, because it forces the programmer to work at a very low level of abstraction. One alternative parallel programming model is the PRAM model, which supports fine-grained parallelism and has a substantial history of algorithmic theory [2]. It is not possible to program current parallel machines using the PRAM model because modern architectures are not designed to support such a model efficiently. However, current trends towards multicore chips suggest that large-scale, fine-grained uniform-memory access parallel machines may soon be feasible. XMT-C is an extension of the C language that supports parallel directives to provide a PRAM-like model to the programmer. A prototype compiler exists that generates code which runs on a simulator for an XMT architecture [3].To better understand how much benefit a PRAM-like model could provide over a message-passing model, we conducted a feasibility study in an academic setting to compare the effort required to solve a particular problem. The questions under study were: can we measure the effort in developing a program using these two programming models and can we differentiate the amount of effort for each model?.The subjects participating in the study were divided up into two groups. One group solved a problem using the MPI library in either C,C++, or Fortran, and the other group solved the problem using XMT-C. The task was to write a function to multiply a sparse matrix with a dense vector. To obtain subjects, we leveraged existing graduate-level parallel programming courses at two different universities: University of California, Santa Barbara (UCSB), and University of Maryland (UMD). At UCSB, the students solved the problem in MPI, and at UMD, the students solved the same problem in XMT-C. The focus of the UCSB class was on developing parallel programs to run on the current generation of architectures, and the students were taught MPI, as well as other models. The focus of the UMD class was parallel algorithms in the PRAM model, and the students were taught XMT-C. The students were assigned to treatment groups by class. The study was integrated into each class, as the problem was a required assignment in each class.Subjects kept track of their effort with a self-reported effort log. We also collected automatic effort data by instrumenting the compilers, which recorded data at each compile. We computed three effort measures: self-reported, instrumented, and combined. Self-reported effort measures are based entirely on effort logs, instrumented effort measures are based entirely on timestamps from the instrumented compilers, and combined effort measures are based on compiler timestamps when the subject is working on the instrumented machine, and self-reported effort when the subject is working off the instrumented machine.The results of this preliminary study answer both of our questions in the positive. In this case, on average, students required less effort to solve the problem using XMT-C compared to MPI. The reduction in mean effort was approximately 50\% for all three measures, which was statistically significant at the level of p < .05 using a t-test.This study demonstrates that the effect of programming model on effort can be directly measured through empirical studies with human subjects. While no single study can conclusively demonstrate the advantage of one programming model over another, a series of studies examining different models and different problems can provide insights into the relative strengths of parallel programming models in different contexts. The study described above is one of a series of such studies that we are currently conducting.}, keywords = {effort, empirical study, HPC, Message-passing, MPI, parallel programming, PRAM, Productivity, XMT}, isbn = {1-59593-452-9}, doi = {10.1145/1148109.1148127}, url = {http://doi.acm.org/10.1145/1148109.1148127}, author = {Hochstein, Lorin and Basili, Victor R.} } @article {18300, title = {Employing the hand as an interface device}, journal = {Journal of Multimedia}, volume = {1}, year = {2006}, month = {2006///}, pages = {18 - 29}, author = {Sepehri,A. and Yacoob,Yaser and Davis, Larry S.} } @article {13159, title = {Employing the Hand as an Interface Device}, journal = {Journal of Multimedia}, volume = {1}, year = {2006}, month = {2006/11/01/}, abstract = {We propose algorithms and applications for using the hand as an interface device in virtual and physical spaces. In virtual drawing, by tracking the hand in 3-D and estimating a virtual plane in space, the intended drawing of user is recognized. In a virtual marble game, the instantaneous orientation of the hand is simulated to render a graphical scene of the game board. Real-time visual feedback allows the user to navigate a virtual ball in a maze. In 3-D model construction, the system tracks the hand motion in space while the user is traversing edges of a physical object. The object is then rendered virtually by the computer. These applications involve estimating the 3-D absolute position and/or orientation of the hand in space. We propose parametric modelling of the central region of the hand to extract this information. A stereo camera is used to first build a preliminary disparity map of the hand. Then, the best fitting plane to the disparity points is computed using robust estimation. The 3-D hand plane is calculated based on the disparity plane and the position and orientation parameters of the hand. Tracking the hand region over a sequence of frames and coping with noise using robust modelling of the hand motion enables estimating the trajectory of the hand in space. The algorithms are real-time and experiments are presented to demonstrate the proposed applications of using the hand as an interface device.}, isbn = {1796-2048}, doi = {10.4304/jmm.1.7.18-29}, url = {http://www.ojs.academypublisher.com/index.php/jmm/article/viewArticle/01071829}, author = {Sepehri,Afshin and Yacoob,Yaser and Davis, Larry S.} } @article {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 {16865, title = {Enabling Query Processing on Spatial Networks}, booktitle = {Data Engineering, 2006. ICDE {\textquoteright}06. Proceedings of the 22nd International Conference on}, year = {2006}, month = {2006/04//}, pages = {163 - 163}, abstract = {A system that enables real time query processing on large spatial networks is demonstrated. The system provides functionality for processing a wide range of spatial queries such as nearest neighbor searches and spatial joins on spatial networks of sufficiently large sizes.}, doi = {10.1109/ICDE.2006.60}, author = {Sankaranarayanan,J. and Alborzi,H. and Samet, Hanan} } @article {12355, title = {Energy-efficient embedded software implementation on multiprocessor system-on-chip with multiple voltages}, journal = {ACM Transactions on Embedded Computing Systems (TECS)}, volume = {5}, year = {2006}, month = {2006///}, pages = {321 - 341}, author = {Hua,S. and Qu,G. and Bhattacharyya, Shuvra S.} } @article {15932, title = {Enhancing reinforcement learning with metacognitive monitoring and control for improved perturbation tolerance}, journal = {Journal of Experimental and Theoretical Artificial Intelligence}, volume = {18}, year = {2006}, month = {2006///}, pages = {387 - 411}, author = {Anderson,M. L and Oates,T. and Chong,W. and Perlis, Don} } @article {14395, title = {Entity and relationship labeling in affiliation networks}, journal = {ICML Workshop on Statistical Network Analysis}, year = {2006}, month = {2006///}, abstract = {Many domains are best characterized as anaffiliation network describing a set of actors and a set of events interlinked together in a variety of relationships. Relational clas- sification in these domains requires the col- lective classification of both entities (actors and events) and relationships. We investigate the use of relational Markov networks (RMN) for relational classification in affiliation net- works. In this paper, we introduce a novel dataset, Profile in Terror (PIT) knowledge base, that provides a rich source of various af- filiation networks. We study two tasks, entity labeling and relationship labeling. We high- light several important issues concerning the effectiveness of relational classification. Our results show that the PIT dataset has a rich source of relational structure and therefore it is a useful dataset for statisical relational network learning community. }, author = {Zhao,B. and Sen,P. and Getoor, Lise} } @conference {14444, title = {Entity resolution in geospatial data integration}, booktitle = {Proceedings of the 14th annual ACM international symposium on Advances in geographic information systems}, series = {GIS {\textquoteright}06}, year = {2006}, month = {2006///}, pages = {83 - 90}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Due to the growing availability of geospatial data from a wide variety of sources, there is a pressing need for robust, accurate and automatic merging and matching techniques. Geospatial Entity Resolution is the process of determining, from a collection of database sources referring to geospatial locations, a single consolidated collection of {\textquoteright}true{\textquoteright} locations. At the heart of this process is the problem of determining when two locations references match---i.e., when they refer to the same underlying location. In this paper, we introduce a novel method for resolving location entities in geospatial data. A typical geospatial database contains heterogeneous features such as location name, spatial coordinates, location type and demographic information. We investigate the use of all of these features in algorithms for geospatial entity resolution. Entity resolution is further complicated by the fact that the different sources may use different vocabularies for describing the location types and a semantic mapping is required. We propose a novel approach which learns how to combine the different features to perform accurate resolutions. We present experimental results showing that methods combining spatial and non-spatial features (e.g., location-name, location-type, etc.) together outperform methods based on spatial or name information alone.}, isbn = {1-59593-529-0}, doi = {10.1145/1183471.1183486}, url = {http://doi.acm.org/10.1145/1183471.1183486}, author = {Sehgal,Vivek and Getoor, Lise and Viechnicki,Peter D} } @inbook {14424, title = {Entity Resolution in Graphs}, booktitle = {Mining Graph DataMining Graph Data}, year = {2006}, month = {2006/04/10/}, pages = {311 - 344}, publisher = {John Wiley \& Sons, Inc.}, organization = {John Wiley \& Sons, Inc.}, abstract = {This chapter contains sections titled:Introduction Related Work Motivating Example for Graph-Based Entity Resolution Graph-Based Entity Resolution: Problem Formulation Similarity Measures for Entity Resolution Graph-Based Clustering for Entity Resolution Experimental Evaluation Conclusion References }, keywords = {entity resolution in graphs, graph-based clustering for entity resolution, graph-based entity resolution problem}, isbn = {9780470073049}, url = {http://onlinelibrary.wiley.com/doi/10.1002/9780470073049.ch13/summary}, author = {Bhattacharya,Indrajit and Getoor, Lise}, editor = {Cook,Diane J. and Holder,Lawrence B.} } @conference {13165, title = {Estimation of Anthropomeasures from a Single Calibrated Camera}, booktitle = {Automatic Face and Gesture Recognition, 2006. FGR 2006. 7th International Conference on}, year = {2006}, month = {2006/04//}, pages = {499 - 504}, abstract = {We are interested in the recovery of anthropometric dimensions of the human body from calibrated monocular sequences, and their use in multi-target tracking across multiple cameras and identification of individual people. In this paper, we focus on two specific anthropomeasures that are relatively easy to estimate from low-resolution images: stature and shoulder breadth. Precise average estimates are obtained for each anthropomeasure by combining measurements from multiple frames in the sequence. Our contribution is two-fold: (i) a novel technique for automatic and passive estimation of shoulder breadth, that is based on modelling the shoulders as an ellipse, and (U) a novel method for increasing the accuracy of the mean estimates of both anthropomeasures. The latter is based on the observation that major sources of error in the measurements are landmark localization the 2D image and 3D modelling error, and that both of these are correlated with gait phase and body orientation with respect to the camera. Consequently, estimation error can be significantly reduced via appropriate selection or control of these two variables}, keywords = {anthropomeasures, calibrated, camera;anthropometry;error, estimation;error, estimation;gait, identification;image, phase;image, recovery;image, resolution;image, resolution;monocular, restoration;image, sensors;image, sequences;, sequences;single, statistics;image}, doi = {10.1109/FGR.2006.37}, author = {BenAbdelkader,C. and Davis, Larry S.} } @conference {15852, title = {Evaluation of Multilingual and Multi-modal Information Retrieval-Seventh Workshop of the Cross-Language Evaluation Forum, CLEF 2006, Alicante, Spain, September 19-21, 2006, Revised Selected Papers}, booktitle = {Seventh Workshop of the Cross-Language Evaluation Forum, CLEF 2006}, year = {2006}, month = {2006///}, address = {Alicante, Spain}, author = {Peters,C. and Clough,P. and Gey,F. and Karlgren,J. and Magnini,B. and Oard, Douglas and De Rijke,M. and Stempfhuber,M.} } @article {14479, title = {Event classification and relationship labeling in affiliation networks}, journal = {Proceedings of the Workshop on Statistical Network Analysis (SNA) at the 23rd International Conference on Machine Learning (ICML)}, year = {2006}, month = {2006///}, abstract = {Many domains are best described as an affiliation network in which there are entities such as actors, events and organizations linked together in a variety of relationships. Relational classification in these domains requires the collective classification of both entities and relationships. In this paper, we investigate the use of relational Markov networks (RMN) for relational classification in affiliation networks. We study two tasks, event classification and relationship labeling, and discuss general issues in constructing an appropriate RMN from an affiliation network. We evaluate our methods on a novel dataset describing terrorist affiliation networks which includes data about actors (terrorists), events (terrorist attacks) and organizations (terrorist organizations). Our results highlight several important issues concerning the effectiveness of relational classification and our experiments show that the relational structure significantly helps relationship labeling.}, author = {Zhao,B. and Sen,P. and Getoor, Lise} } @article {14068, title = {Evolution of non-LTR retrotransposons in the trypanosomatid genomes: Leishmania major has lost the active elements}, journal = {Molecular and Biochemical Parasitology}, volume = {145}, year = {2006}, month = {2006/02//}, pages = {158 - 170}, abstract = {The ingi and L1Tc non-LTR retrotransposons - which constitute the ingi clade - are abundant in the genome of the trypanosomatid species Trypanosoma brucei and Trypanosoma cruzi, respectively. The corresponding retroelements, however, are not present in the genome of a closely related trypanosomatid, Leishmania major. To study the evolution of non-LTR retrotransposons in trypanosomatids, we have analyzed all ingi/L1Tc elements and highly degenerate ingi/L1Tc-related sequences identified in the recently completed T. brucei, T. cruzi and L. major genomes. The coding sequences of 242 degenerate ingi/L1Tc-related elements (DIREs) in all three genomes were reconstituted by removing the numerous frame shifts. Three independent phylogenetic analyses conducted on the conserved domains encoded by these elements show that all DIREs, including the 52 L. major DIREs, form a monophyletic group belonging to the ingi clade. This indicates that the trypanosomatid ancestor contained active mobile elements that have been retained in the Trypanosoma species, but were lost from L. major genome, where only remnants (DIRE) are detectable. All 242 DIREs analyzed group together according to their species origin with the exception of 11 T. cruzi DIREs which are close to the T. brucei ingi/DIRE families. Considering the absence of known horizontal transfer between the African T. brucei and the South-American T. cruzi, this suggests that this group of elements evolved at a lower rate when compared to the other trypanosomatid elements. Interestingly, the only nucleotide sequence conserved between ingi and L1Tc (the first 79 residues) is also present at the 5{\textquoteright}-extremity of all the full length DIREs and suggests a possible role for this conserved motif, as well as for DIREs.}, keywords = {Degenerate retroelement, Evolution, Ingi, L1Tc, Leishmania major, Non-LTR retrotransposon, Retroposon, Trypanosoma brucei, Trypanosoma cruzi}, isbn = {0166-6851}, doi = {16/j.molbiopara.2005.09.017}, url = {http://www.sciencedirect.com/science/article/pii/S0166685105002963}, author = {Bringaud,Fr{\'e}d{\'e}ric and Ghedin,Elodie and Blandin,Ga{\"e}lle and Bartholomeu,Daniella C. and Caler,Elisabet and Levin,Mariano J. and Baltz,Th{\'e}o and El-Sayed, Najib M.} } @conference {12182, title = {The evolution of the international children{\textquoteright}s digital library searching and browsing interface}, booktitle = {Proceedings of the 2006 conference on Interaction design and children}, year = {2006}, month = {2006///}, pages = {105 - 112}, author = {Hutchinson,H.B. and Bederson, Benjamin B. and Druin, Allison} } @article {16578, title = {Evolutionary design of neural network architectures using a descriptive encoding language}, journal = {Evolutionary Computation, IEEE Transactions on}, volume = {10}, year = {2006}, month = {2006///}, pages = {676 - 688}, author = {Jung,J. Y and Reggia, James A.} } @inbook {14693, title = {Existential Label Flow Inference Via CFL Reachability}, booktitle = {Static AnalysisStatic Analysis}, series = {Lecture Notes in Computer Science}, volume = {4134}, year = {2006}, month = {2006///}, pages = {88 - 106}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {In programming languages, existential quantification is useful for describing relationships among members of a structured type. For example, we may have a list in which there exists some mutual exclusion lock l in each list element such that l protects the data stored in that element. With this information, a static analysis can reason about the relationship between locks and locations in the list even when the precise identity of the lock and/or location is unknown. To facilitate the construction of such static analyses, this paper presents a context-sensitive label flow analysis algorithm with support for existential quantification. Label flow analysis is a core part of many static analysis systems. Following Rehof et al, we use context-free language (CFL) reachability to develop an efficient O(n 3) label flow inference algorithm. We prove the algorithm sound by reducing its derivations to those in a system based on polymorphically-constrained types, in the style of Mossin. We have implemented a variant of our analysis as part of a data race detection tool for C programs.}, isbn = {978-3-540-37756-6}, url = {http://dx.doi.org/10.1007/11823230_7}, author = {Pratikakis,Polyvios and Foster, Jeffrey S. and Hicks, Michael W.}, editor = {Yi,Kwangkeun} } @article {15076, title = {On expected constant-round protocols for Byzantine agreement}, journal = {Advances in Cryptology-CRYPTO 2006}, year = {2006}, month = {2006///}, pages = {445 - 462}, abstract = {In a seminal paper, Feldman and Micali (STOC {\textquoteright}88) show an n-party Byzantine agreement protocol tolerating t < n/3 malicious parties that runs in expected constant rounds. Here, we show an expected constant-round protocol for authenticated Byzantine agreement assuming honest majority (i.e., t < n/2), and relying only on the existence of a secure signature scheme and a public-key infrastructure (PKI). Combined with existing results, this gives the first expected constant-round protocol for secure computation with honest majority in a point-to-point network assuming only one-way functions and a PKI. Our key technical tool {\textemdash} a new primitive we introduce called moderated VSS {\textemdash} also yields a simpler proof of the Feldman-Micali result.We also show a simple technique for sequential composition of protocols without simultaneous termination (something that is inherent for Byzantine agreement protocols using o(n) rounds) for the case of t0.05 in any population ) and expected heterozygosity are represented when different numbers of populations are conserved. We determined sampling distributions for these three measures of genetic diversity using Monte Carlo methods. We assessed the proportion of alleles included in the number of populations considered adequate for conservation, needed to capture all alleles, and needed to meet an accepted standard of genetic-diversity conservation of having a 90-95\% probability of including all common alleles. We also assessed the number of populations necessary to obtain values of heterozygosity within +/-10\% of the value obtained from all populations. Numbers of alleles were strongly affected by the number of populations sampled. Heterozygosity was only slightly less sensitive to numbers of populations than were alleles. On average, currently advocated conservation intensities represented 67-83\% of all alleles and 85-93\% of common alleles. The smallest number of populations to include all alleles ranged from 6 to 17 ( 42-57\% ), but <0.2\% of 1000 samples of these numbers of populations included them all. It was necessary to conserve 16-29 ( 53-93\% ) of the sampled populations to meet the standard for common alleles. Between 20\% and 64\% of populations were needed to reliably represent species-level heterozygosity. Thus, higher percentages of populations are needed than are currently considered adequate to conserve genetic diversity if populations are selected without genetic data.}, author = {Neel,M. C and Cummings, Michael P.} } @conference {15133, title = {Efficiency improvements for signature schemes with tight security reductions}, booktitle = {Proceedings of the 10th ACM conference on Computer and communications security}, series = {CCS {\textquoteright}03}, year = {2003}, month = {2003///}, pages = {155 - 164}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Much recent work has focused on constructing efficient digital signature schemes whose security is tightly related to the hardness of some underlying cryptographic assumption. With this motivation in mind, we show here two approaches which improve both the computational efficiency and signature length of some recently-proposed schemes:Diffie-Hellman signatures. Goh and Jarecki [18] recently analyzed a signature scheme which has a tight security reduction to the computational Diffie-Hellman problem. Unfortunately, their scheme is less efficient in both computation and bandwidth than previous schemes relying on the (related) discrete logarithm assumption. We present a modification of their scheme in which signing is 33\% more efficient and signatures are 75\% shorter; the security of this scheme is tightly related to the decisional Diffie-Hellman problem.PSS. The probabilistic signature scheme (PSS) designed by Bellare and Rogaway [3] uses a random salt to enable a tight security reduction to, e.g., the RSA problem. Coron [12] subsequently showed that a shorter random salt can be used without impacting the security of the scheme. We show a variant of PSS which avoids the random salt altogether yet has an equally-tight security reduction. This furthermore yields a version of PSS-R (PSS with message recovery) with optimal message length. Our technique may also be used to improve the efficiency of a number of other schemes.}, keywords = {digital, SIGNATURES}, isbn = {1-58113-738-9}, doi = {10.1145/948109.948132}, url = {http://doi.acm.org/10.1145/948109.948132}, author = {Katz, Jonathan and Wang,Nan} } @conference {15139, title = {Efficient and non-malleable proofs of plaintext knowledge and applications}, booktitle = {Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques}, series = {EUROCRYPT{\textquoteright}03}, year = {2003}, month = {2003///}, pages = {211 - 228}, publisher = {Springer-Verlag}, organization = {Springer-Verlag}, address = {Berlin, Heidelberg}, abstract = {We describe efficient protocols for non-malleable (interactive) proofs of plaintext knowledge for the RSA, Rabin, Paillier, and El Gamal encryption schemes. We also highlight some important applications of these protocols: - Chosen-ciphertext-secure, interactive encryption. In settings where both parties are on-line, an interactive encryption protocol may be used. We construct chosen-ciphertext-secure interactive encryption schemes based on any of the schemes above. In each case, the improved scheme requires only a small overhead beyond the original, semantically-secure scheme. - Password-based authenticated key exchange. We derive efficient protocols for password-based key exchange in the public-key model [28, 5] whose security may be based on any of the cryptosystems mentioned above. - Deniable authentication. Our techniques give the first efficient constructions of deniable authentication protocols based on, e.g., the RSA or computational Diffie-Hellman assumption. Of independent interest, we consider the concurrent composition of proofs of knowledge; this is essential to prove security of our protocols when run in an asynchronous, concurrent environment.}, isbn = {3-540-14039-5}, url = {http://dl.acm.org/citation.cfm?id=1766171.1766189}, author = {Katz, Jonathan} } @conference {16772, title = {Efficient dissemination of aggregate data over the wireless web}, booktitle = {International Workshop on the Web and Databases (WebDB)}, year = {2003}, month = {2003///}, pages = {93 - 98}, author = {Sharaf,M. A and Sismanis,Y. and Labrinidis,A. and Chrysanthis,P. and Roussopoulos, Nick} } @article {14064, title = {Efficient kernel density estimation using the fast gauss transform with applications to color modeling and tracking}, journal = {Pattern Analysis and Machine Intelligence, IEEE Transactions on}, volume = {25}, year = {2003}, month = {2003///}, pages = {1499 - 1504}, author = {Elgammal,A. and Duraiswami, Ramani and Davis, Larry S.} } @article {13235, title = {Efficient kernel density estimation using the fast gauss transform with applications to color modeling and tracking}, journal = {Pattern Analysis and Machine Intelligence, IEEE Transactions on}, volume = {25}, year = {2003}, month = {2003/11//}, pages = {1499 - 1504}, abstract = {Many vision algorithms depend on the estimation of a probability density function from observations. Kernel density estimation techniques are quite general and powerful methods for this problem, but have a significant disadvantage in that they are computationally intensive. In this paper, we explore the use of kernel density estimation with the fast Gauss transform (FGT) for problems in vision. The FGT allows the summation of a mixture of ill Gaussians at N evaluation points in O(M+N) time, as opposed to O(MN) time for a naive evaluation and can be used to considerably speed up kernel density estimation. We present applications of the technique to problems from image segmentation and tracking and show that the algorithm allows application of advanced statistical techniques to solve practical vision problems in real-time with today{\textquoteright}s computers.}, keywords = {algorithms;, Color, Computer, density, estimation;, fast, function;, Gauss, image, Kernel, modeling;, segmentation;, tracking;, transform;, transforms;, VISION, vision;}, isbn = {0162-8828}, doi = {10.1109/TPAMI.2003.1240123}, author = {Elgammal,A. and Duraiswami, Ramani and Davis, Larry S.} } @conference {19659, title = {Efficient particle filter-based tracking of multiple interacting targets using an MRF-based motion model}, booktitle = {2003 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2003. (IROS 2003). Proceedings}, volume = {1}, year = {2003}, month = {2003/10//}, pages = {254 - 259 vol.1}, abstract = {We describe a multiple hypothesis particle filter for tracking targets that are influenced by the proximity and/or behavior of other targets. Our contribution is to show how a Markov random field motion prior, built on the fly at each time step, can model these interactions to enable more accurate tracking. We present results for a social insect tracking application, where we model the domain knowledge that two targets cannot occupy the same space, and targets actively avoid collisions. We show that using this model improves track quality and efficiency. Unfortunately, the joint particle tracker we propose suffers from exponential complexity in the number of tracked targets. An approximation to the joint filter, however, consisting of multiple nearly independent particle filters can provide similar track quality at substantially lower computational cost.}, keywords = {collision avoidance, computational cost, Computational efficiency, Educational institutions, exponential complexity, Filtering, filtering theory, Insects, joint particle tracker, Markov processes, Markov random field motion, Markov random fields, multiple interacting targets, particle filter-based tracking, Particle filters, Particle tracking, Radar tracking, social insect tracking application, target tracking, Trajectory}, author = {Zia Khan and Balch, T. and Dellaert, F.} } @article {12305, title = {Efficient peer-to-peer searches using result-caching}, journal = {Peer-to-Peer Systems II}, year = {2003}, month = {2003///}, pages = {225 - 236}, abstract = {Existing peer-to-peer systems implement a single function well: data lookup. There is now a wealth of research describing how to reliably disseminate, and to later retrieve, data in a scalable and load-balanced manner.}, author = {Bhattacharjee, Bobby and Chawathe,S. and Gopalakrishnan,V. and Keleher,P. and Silaghi,B.} } @article {12129, title = {Eight lessons learned during COTS-based systems maintenance}, journal = {Software, IEEE}, volume = {20}, year = {2003}, month = {2003/10//sept}, pages = {94 - 96}, abstract = {To make better decisions relative to CBSs, we need empirical knowledge. To gain this knowledge, we must more fully understand the lifecycle processes people use when harnessing COTS packages. The initial findings reported here are but the first step in our attempts to capture this empirical knowledge. We plan to continue collecting data and investigating the phenomenology of COTS-based systems.}, keywords = {COTS, COTS-based, cycle, life, lifecycle, Maintenance, maintenance;, object-oriented, packages;, phase;, processes;, programming;, reusability;, software, systems}, isbn = {0740-7459}, doi = {10.1109/MS.2003.1231161}, author = {Reifer,D.J. and Basili, Victor R. and Boehm,B.W. and Clark,B.} } @conference {14051, title = {Electromagnetic scattering from a multilayered cylindrical waveguide}, booktitle = {Antennas and Propagation Society International Symposium, 2003. IEEE}, volume = {3}, year = {2003}, month = {2003/06//}, pages = {332 - 335 vol.3 - 332 - 335 vol.3}, abstract = {This paper is devoted to electromagnetic scattering from an N multilayered circular cylinder. We consider waveguides in the z direction; that is, we look for the solution of Maxwell equations along the z direction. We assume a dielectric core and derive a mode matching approach for solving the problem. A numerical result is presented that illustrates the algorithm.}, keywords = {circular, core;, cylinder;, cylindrical, dielectric, dielectric-loaded, electromagnetic, EM, equations;, matching;, Maxwell, mode, multilayered, scattering;, theory;, wave, waveguide, waveguide;, waveguides;}, doi = {10.1109/APS.2003.1219855}, author = {Seydou,F. and Duraiswami, Ramani and Seppanen,T.} } @conference {12200, title = {Electronic voting system usability issues}, booktitle = {Proceedings of the SIGCHI conference on Human factors in computing systems}, year = {2003}, month = {2003///}, pages = {145 - 152}, author = {Bederson, Benjamin B. and Lee,B. and Sherman,R.M. and Herrnson,P.S. and Niemi,R.G.} } @article {12952, title = {Emergence and Evolution of Vibrio Cholerae O139}, journal = {Proceedings of the National Academy of SciencesPNAS}, volume = {100}, year = {2003}, month = {2003/02/04/}, pages = {1304 - 1309}, abstract = {The emergence of Vibrio cholerae O139 Bengal during 1992{\textendash}1993 was associated with large epidemics of cholera in India and Bangladesh and, initially, with a total displacement of the existing V. cholerae O1 strains. However, the O1 strains reemerged in 1994 and initiated a series of disappearance and reemergence of either of the two serogroups that was associated with temporal genetic and phenotypic changes sustained by the strains. Since the initial emergence of the O139 vibrios, new variants of the pathogen derived from multiple progenitors have been isolated and characterized. The clinical and epidemiological characteristics of these strains have been studied. Rapid genetic reassortment in O139 strains appears to be a response to the changing epidemiology of V. cholerae O1 and also a strategy for persistence in competition with strains of the O1 serogroup. The emergence of V. cholerae O139 has provided a unique opportunity to witness genetic changes in V. cholerae that may be associated with displacement of an existing serogroup by a newly emerging one and, thus, provide new insights into the epidemiology of cholera. The genetic changes and natural selection involving both environmental and host factors are likely to influence profoundly the genetics, epidemiology, and evolution of toxigenic V. cholerae, not only in the Ganges Delta region of India and Bangladesh, but also in other areas of endemic and epidemic cholera.}, isbn = {0027-8424, 1091-6490}, doi = {10.1073/pnas.0337468100}, url = {http://www.pnas.org/content/100/3/1304}, author = {Faruque,Shah M. and Sack,David A. and Sack,R. Bradley and Rita R Colwell and Takeda,Yoshifumi and Nair,G. Balakrish} } @conference {12322, title = {Energy reduction techniques for multimedia applications with tolerance to deadline misses}, booktitle = {Proceedings of the 40th annual Design Automation Conference}, year = {2003}, month = {2003///}, pages = {131 - 136}, author = {Hua,S. and Qu,G. and Bhattacharyya, Shuvra S.} } @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.} } @inbook {17136, title = {Errors}, booktitle = {Encyclopedia of Computer ScienceEncyclopedia of Computer Science}, year = {2003}, month = {2003///}, pages = {677 - 680}, publisher = {John Wiley and Sons Ltd.}, organization = {John Wiley and Sons Ltd.}, address = {Chichester, UK}, abstract = {The indignant customer who receives an incorrect bill from a department store probably does not care what the source of the error was or even that, almost certainly, the fault was not a computer{\textquoteright}s but rather that of its data entry personnel or programmers. Neither is the astronaut who is descending toward the surface of the Moon very concerned about the precise source of the error that caused the onboard computer to fail. But an understanding of the sources of errors in computers is important to anyone who wishes to use or comprehend digital computers.}, isbn = {0-470-86412-5}, url = {http://dl.acm.org/citation.cfm?id=1074100.1074382}, author = {Ralston,Anthony and Shneiderman, Ben} } @article {18938, title = {Evaluating Translational Correspondence using Annotation Projection}, volume = {UMIACS-TR-2003-25}, year = {2003}, month = {2003///}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {Recently, statistical machine translation models have begun to take advantage of higherlevel linguistic structures such as syntactic dependencies. Underlying these models is an assumption about the directness of translational correspondence between sentences in the two languages; however, the extent to which this assumption is valid and useful is not well understood. In this paper, we present an empirical study that quantifies the degree to which syntactic dependencies are preserved when parses are projected directly from En- glish to Chinese. Our results show that although the direct correspondence assumption is often too restrictive, a small set of principled, elementary linguistic transformations can boost the quality of the projected Chinese parses by 76\% relative to the unimproved baseline. }, url = {http://lampsrv02.umiacs.umd.edu/pubs/TechReports/LAMP_100/LAMP_100.pdf}, author = {Hwa,R. and Resnik, Philip and Weinberg, Amy and Kolak,O.} } @article {13768, title = {Evaluation Techniques Applied to Domain Tuning of MT Lexicons}, journal = {Proceedings of the Workshop {\textquotedblleft}Towards Systematizing MT Evaluation}, volume = {27}, year = {2003}, month = {2003///}, pages = {3 - 11}, abstract = {We describe a set of evaluation techniques applied to domain tuning of bilingual lexicons for machine translation.Our overall objective is to translate a domain-specific document in a foreign language (in this case, Chinese) to En- glish. First, we perform an intrinsic evaluation of the effectiveness of our domain-tuning techniques by comparing our domain-tuned lexicon to a manually constructed domain-specific bilingual termlist. Our results indicate that we achieve 66\% recall and 95\% precision with respect to a human-derived gold standard. Next, an extrinsic evaluation demonstrates that our domain-tuned lexicon improves the Bleu scores 50\% over a statistical system{\textemdash}with a smaller improvement when the system is trained on a uniformly-weighted dictionary. }, author = {Ayan,N.F. and Dorr, Bonnie J and Kolak,O.} } @conference {13240, title = {Exemplar-based tracking and recognition of arm gestures}, booktitle = {Image and Signal Processing and Analysis, 2003. ISPA 2003. Proceedings of the 3rd International Symposium on}, volume = {2}, year = {2003}, month = {2003/09//}, pages = {656 - 661 Vol.2 - 656 - 661 Vol.2}, abstract = {This paper presents a probabilistic exemplar-based framework for recognizing gestures. The approach is based on representing each gesture as a sequence of learned body poses. The gestures are recognized through a probabilistic framework for matching these body poses and for imposing temporal constrains between different poses. Matching individual poses to image data is performed using a probabilistic formulation for edge matching to obtain a likelihood measurement for each individual pose. The paper introduces a correspondence-free weighted matching scheme for edge templates that emphasize discriminating features in the matching. The weighting does not require establishing correspondences between the different pose models. The probabilistic framework also imposes temporal constrains between different pose through a learned hidden Markov model (HMM) of each gesture.}, keywords = {arm, constrains;, correspondence-free, edge, exemplar-based, framework;, gesture, hidden, HMM;, image, logic;, Markov, MATCHING, matching;, model;, models;, probabilistic, recognition;, scheme;, segmentation;, temporal, tracking;, weighted}, doi = {10.1109/ISPA.2003.1296358}, author = {Elgammal,A. and Shet,V. and Yacoob,Yaser and Davis, Larry S.} } @conference {18656, title = {An experimental evaluation of correlated network partitions in the Coda distributed file system}, year = {2003}, month = {2003/10//}, pages = {273 - 282}, abstract = {Experimental evaluation is an important way to assess distributed systems, and fault injection is the dominant technique in this area for the evaluation of a system{\textquoteright}s dependability. For distributed systems, network failure is an important fault model. Physical network failures often have far-reaching effects, giving rise to multiple correlated failures as seen by higher-level protocols. This paper presents an experimental evaluation, using the Loki fault injector, which provides insight into the impact that correlated network partitions have on the Coda distributed file system. In this evaluation, Loki created a network partition between two Coda file servers, during which updates were made at each server to the same replicated data volume. Upon repair of the partition, a client requested directory resolution to converge the diverging replicas. At various stages of the resolution, Loki invoked a second correlated network partition, thus allowing us to evaluate its impact on the system{\textquoteright}s correctness, performance, and availability.}, keywords = {client-server systems, Coda distributed file system, correlated network partitions, distributed file systems, experimental evaluation, fault model, Loki fault injector, multiple correlated failures, network failure, Network topology, performance evaluation, replicated data, replicated databases, software fault tolerance, system performance evaluation}, doi = {10.1109/RELDIS.2003.1238077}, author = {Lefever,R.M. and Michel Cukier and Sanders,W. H.} } @article {18393, title = {Experimental validation of new software technology}, journal = {SERIES ON SOFTWARE ENGINEERING AND KNOWLEDGE ENGINEERING}, volume = {12}, year = {2003}, month = {2003///}, pages = {229 - 263}, abstract = {When to apply a new technology in an organization is acritical decision for every software development organization. Earlier work defines a set of methods that the research community uses when a new technology is developed. This chapter presents a discussion of the set of methods that industrial organizations use before adopting a new technology. First there is a brief definition of the earlier research methods and then a definition of the set of industrial methods. A comparison of the two sets leads into the perspectives of these methods of experts in the research and industrial community via surveys made to those communities. }, author = {Zelkowitz, Marvin V and Wallace,D. R and Binkley,D. W} } @conference {17834, title = {Exploiting Functional Decomposition for Efficient Parallel Processing of Multiple Data Analysis Queries}, booktitle = {Parallel and Distributed Processing Symposium, International}, year = {2003}, month = {2003///}, pages = {81a - 81a}, publisher = {IEEE Computer Society}, organization = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, abstract = {Reuse is a powerful method for increasing system performance. In this paper, we examine functional decomposition for improving data and computation reuse and, therefore, overall query execution performance in the context of data analysis applications. Additionally, we look at the performance effects of using various projection primitives that make it possible to transform intermediate results generated by a query so that they can be reused by a new query. A satellite data analysis application is used to experimentally show the performance benefits achieved using functional decomposition and projection primitives.}, doi = {http://doi.ieeecomputersociety.org/10.1109/IPDPS.2003.1213184}, author = {Andrade,Henrique and Kurc,Tahsin and Sussman, Alan and Saltz,Joel} } @conference {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} } @conference {12381, title = {Exploring the probabilistic design space of multimedia systems}, booktitle = {14th IEEE International Workshop on Rapid Systems Prototyping, 2003. Proceedings}, year = {2003}, month = {2003/06/09/11}, pages = {233 - 240}, publisher = {IEEE}, organization = {IEEE}, abstract = {In this paper, we propose the novel concept of probabilistic design for multimedia systems and a methodology to quickly explore such design space at an early design stage. The probabilistic design is motivated by the challenge of how to design, but not over-design, multimedia embedded systems while systematically incorporating such application{\textquoteright}s performance requirements, uncertainties in execution time, and tolerance for reasonable execution failures. Our goal is to bridge the gap between real-time analysis and embedded software implementation for rapid and economic (multimedia) system prototyping. Our method takes advantage of multimedia system{\textquoteright}s unique features mentioned above to relax the rigid hardware requirements for software implementation and eventually avoid over-designing the system.}, keywords = {economic system prototyping, embedded software implementation, Embedded system, Energy consumption, execution time uncertainties, Hardware, multimedia embedded systems, multimedia system prototyping, multimedia systems, performance requirements, probabilistic design space, rapid system prototyping, Real time systems, real-time analysis, reasonable execution failure tolerance, Resource management, software prototyping, Space exploration, Streaming media, systems analysis, Timing, Uncertainty}, isbn = {0-7695-1943-1}, doi = {10.1109/IWRSP.2003.1207053}, author = {Shaoxiong Hua and Gang Qu and Bhattacharyya, Shuvra S.} } @article {13251, title = {Extracting significant features from the hrtf}, journal = {Proceedings of the 2003 International Conference on Auditory Display}, year = {2003}, month = {2003///}, abstract = {The Head Related Transfer Function (HRTF) characterizes the au-ditory cues created by scattering of sound off a person{\textquoteright}s anatomy. While it is known that features in the HRTF can be associated with various phenomena, such as head diffraction, head and torso re- flection, knee reflection and pinna resonances and anti resonances, identification of these phenomena are usually qualitative and/or heuristic. The objective of this paper is to attempt to decompose the HRTF and extract significant features that are perceptually im- portant for source localization. Some of the significant features that have been identified are the pinna resonances and the notches in the spectrum caused by various parts of the body. We develop signal processing algorithms to decompose the HRTF into compo- nents, and extract the features corresponding to each component. The support of NSF award ITR-0086075 is gratefully acknowl- edged }, author = {Raykar,V.C. and Duraiswami, Ramani and Davis, Larry S. and Yegnanarayana,B.} } @article {14060, title = {Extracting significant features from the HRTF}, journal = {Proceedings of the 2003 International Conference on Auditory Display}, year = {2003}, month = {2003///}, abstract = {The Head Related Transfer Function (HRTF) characterizes the au-ditory cues created by scattering of sound off a person{\textquoteright}s anatomy. While it is known that features in the HRTF can be associated with various phenomena, such as head diffraction, head and torso re- flection, knee reflection and pinna resonances and anti resonances, identification of these phenomena are usually qualitative and/or heuristic. The objective of this paper is to attempt to decompose the HRTF and extract significant features that are perceptually im- portant for source localization. Some of the significant features that have been identified are the pinna resonances and the notches in the spectrum caused by various parts of the body. We develop signal processing algorithms to decompose the HRTF into compo- nents, and extract the features corresponding to each component. The support of NSF award ITR-0086075 is gratefully acknowl- edged }, author = {Raykar,V.C. and Duraiswami, Ramani and Davis, Larry S. and Yegnanarayana,B.} } @conference {15316, title = {Extracting structural paraphrases from aligned monolingual corpora}, booktitle = {Proceedings of the second international workshop on Paraphrasing - Volume 16}, series = {PARAPHRASE {\textquoteright}03}, year = {2003}, month = {2003///}, pages = {57 - 64}, publisher = {Association for Computational Linguistics}, organization = {Association for Computational Linguistics}, address = {Stroudsburg, PA, USA}, abstract = {We present an approach for automatically learning paraphrases from aligned monolingual corpora. Our algorithm works by generalizing the syntactic paths between corresponding anchors in aligned sentence pairs. Compared to previous work, structural paraphrases generated by our algorithm tend to be much longer on average, and are capable of capturing long-distance dependencies. In addition to a standalone evaluation of our paraphrases, we also describe a question answering application currently under development that could immensely benefit from automatically-learned structural paraphrases.}, doi = {10.3115/1118984.1118992}, url = {http://dx.doi.org/10.3115/1118984.1118992}, author = {Ibrahim,Ali and Katz,Boris and Jimmy Lin} } @conference {12000, title = {Eye design in the plenoptic space of light rays}, booktitle = {Ninth IEEE International Conference on Computer Vision, 2003. Proceedings}, year = {2003}, month = {2003/10/13/16}, pages = {1160-1167 vol.2 - 1160-1167 vol.2}, publisher = {IEEE}, organization = {IEEE}, abstract = {Natural eye designs are optimized with regard to the tasks the eye-carrying organism has to perform for survival. This optimization has been performed by the process of natural evolution over many millions of years. Every eye captures a subset of the space of light rays. The information contained in this subset and the accuracy to which the eye can extract the necessary information determines an upper limit on how well an organism can perform a given task. In this work we propose a new methodology for camera design. By interpreting eyes as sample patterns in light ray space we can phrase the problem of eye design in a signal processing framework. This allows us to develop mathematical criteria for optimal eye design, which in turn enables us to build the best eye for a given task without the trial and error phase of natural evolution. The principle is evaluated on the task of 3D ego-motion estimation.}, keywords = {3D ego-motion estimation, Assembly, B-splines, Camera design, CAMERAS, captured image, compound eyes, Computer vision, data mining, eye, eye-carrying organism, Eyes, filter optimization, image representation, image resolution, Information geometry, Laboratories, light field reconstruction, light gathering power, light rays, mixed spherical-Cartesian coordinate system, Motion estimation, natural evolution process, natural eye designs, natural image statistics, optical nanotechnology, Optical signal processing, optimal eye design mathematical criteria, Organisms, plenoptic image formation, plenoptic space, plenoptic video geometry, sampling operators, sensory ecology, Signal design, Signal processing, signal processing framework, signal processing tool, square-summable sequences, visual acuity}, isbn = {0-7695-1950-4}, doi = {10.1109/ICCV.2003.1238623}, author = {Neumann, J. and Ferm{\"u}ller, Cornelia and Aloimonos, J.} } @article {16512, title = {Effects of callosal lesions in a model of letter perception}, journal = {Cognitive, Affective, \& Behavioral Neuroscience}, volume = {2}, year = {2002}, month = {2002///}, pages = {37 - 37}, author = {Shevtsova,N. and Reggia, James A.} } @article {12959, title = {Effects of Global Climate on Infectious Disease: The Cholera Model}, journal = {Clinical Microbiology ReviewsClin. Microbiol. Rev.}, volume = {15}, year = {2002}, month = {2002/10/01/}, pages = {757 - 770}, abstract = {Recently, the role of the environment and climate in disease dynamics has become a subject of increasing interest to microbiologists, clinicians, epidemiologists, and ecologists. Much of the interest has been stimulated by the growing problems of antibiotic resistance among pathogens, emergence and/or reemergence of infectious diseases worldwide, the potential of bioterrorism, and the debate concerning climate change. Cholera, caused by Vibrio cholerae, lends itself to analyses of the role of climate in infectious disease, coupled to population dynamics of pathogenic microorganisms, for several reasons. First, the disease has a historical context linking it to specific seasons and biogeographical zones. In addition, the population dynamics of V. cholerae in the environment are strongly controlled by environmental factors, such as water temperature, salinity, and the presence of copepods, which are, in turn, controlled by larger-scale climate variability. In this review, the association between plankton and V. cholerae that has been documented over the last 20 years is discussed in support of the hypothesis that cholera shares properties of a vector-borne disease. In addition, a model for environmental transmission of cholera to humans in the context of climate variability is presented. The cholera model provides a template for future research on climate-sensitive diseases, allowing definition of critical parameters and offering a means of developing more sophisticated methods for prediction of disease outbreaks.}, isbn = {0893-8512, 1098-6618}, doi = {10.1128/CMR.15.4.757-770.2002}, url = {http://cmr.asm.org/content/15/4/757}, author = {Lipp,Erin K. and Huq,Anwar and Rita R Colwell} } @mastersthesis {15192, title = {Efficient Cryptographic Protocols Preventing {\textquotedblleft}Man-in-the-Middle{\textquotedblright} Attacks}, year = {2002}, month = {2002///}, school = {Columbia University}, abstract = {In the analysis of many cryptographic protocols, it is useful to distinguish two classes of attacks:passive attacks in which an adversary eavesdrops on messages sent between honest users and active attacks (i.e., {\textquotedblleft}man-in-the-middle{\textquotedblright} attacks) in which {\textemdash} in addition to eavesdropping {\textemdash} the adversary inserts, deletes, or arbitrarily modifies messages sent from one user to another. Passive attacks are well characterized (the adversary{\textquoteright}s choices are inherently limited) and techniques for achieving security against passive attacks are relatively well understood. Indeed, cryptographers have long focused on methods for countering passive eavesdropping attacks, and much work in the 1970{\textquoteright}s and 1980{\textquoteright}s has dealt with formalizing notions of security and providing provably-secure solutions for this setting. On the other hand, active attacks are not well characterized and precise modeling has been difficult. Few techniques exist for dealing with active attacks, and designing practical protocols secure against such attacks remains a challenge. This dissertation considers active attacks in a variety of settings and provides new, provably- secure protocols preventing such attacks. Proofs of security are in the standard cryptographic model and rely on well-known cryptographic assumptions. The protocols presented here are efficient and practical, and may find application in real-world systems. }, author = {Katz, Jonathan} } @article {11912, title = {Efficient Data Processing using Cross Layer Hints}, journal = {Technical Reports from UMIACS, UMIACS-TR-2002-59}, year = {2002}, month = {2002/12/19/}, abstract = {Conventional network stacks define a layered architecture, whereeach layer implements a set of services and exports a well-defined interface to be used by its immediate upper layer. A key design choice of the layered architecture has been to provide isolation between the functional modules of distinct layers. While such an architecture provides an useful abstraction for system development, the strict isolation of this layered architecture limits the flexibility of tailoring the behavior of the lower layers of the stack to the needs of the application. In this paper we define a new architecture, called X-Tags, which allows flexible interaction between layers for cooperative data processing without impacting the isolation property. In this architecture, applications use special tags to provide semantic hints for data processing to lower layers. We motivate the usefulness of this architecture by describing ts applicability to some emerging applications. UMIACS-TR-2002-59 }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/1211}, author = {Banerjee,Suman and Agrawala, Ashok K. and Kramer,Michael J} } @conference {14800, title = {Efficient instrumentation for code coverage testing}, booktitle = {ACM SIGSOFT Software Engineering Notes}, volume = {27}, year = {2002}, month = {2002///}, pages = {86 - 96}, author = {Tikir, M. M and Hollingsworth, Jeffrey K} } @article {15613, title = {An efficient k-means clustering algorithm: analysis and implementation}, journal = {Pattern Analysis and Machine Intelligence, IEEE Transactions on}, volume = {24}, year = {2002}, month = {2002/07//}, pages = {881 - 892}, abstract = {In k-means clustering, we are given a set of n data points in d-dimensional space Rd and an integer k and the problem is to determine a set of k points in Rd, called centers, so as to minimize the mean squared distance from each data point to its nearest center. A popular heuristic for k-means clustering is Lloyd{\textquoteright}s (1982) algorithm. We present a simple and efficient implementation of Lloyd{\textquoteright}s k-means clustering algorithm, which we call the filtering algorithm. This algorithm is easy to implement, requiring a kd-tree as the only major data structure. We establish the practical efficiency of the filtering algorithm in two ways. First, we present a data-sensitive analysis of the algorithm{\textquoteright}s running time, which shows that the algorithm runs faster as the separation between clusters increases. Second, we present a number of empirical studies both on synthetically generated data and on real data sets from applications in color quantization, data compression, and image segmentation}, keywords = {algorithm;color, algorithm;image, algorithm;kd-tree;mean, analysis;filtering, clustering, clustering;, compression;data, distance;covariance, Lloyd, matrices;filtering, quantization;data, segmentation;k-means, squared, structure;data-sensitive, theory;pattern}, isbn = {0162-8828}, doi = {10.1109/TPAMI.2002.1017616}, author = {Kanungo,T. and Mount, Dave and Netanyahu,N. S and Piatko,C. D and Silverman,R. and Wu,A. Y} } @conference {17838, title = {Efficient Manipulation of Large Datasets on Heterogeneous Storage Systems}, booktitle = {Parallel and Distributed Processing Symposium, International}, volume = {2}, year = {2002}, month = {2002///}, pages = {0084 - 0084}, publisher = {IEEE Computer Society}, organization = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, abstract = {In this paper we are concerned with the efficient use of a collection of disk-based storage systems and computing platforms in a heterogeneous setting for retrieving and processing large scientific datasets. We demonstrate, in the context of a data-intensive visualization application, how heterogeneity affects performance and show a set of optimization techniques that can be used to improve performance in a component-based framework. In particular, we examine the application of parallelism via transparent copies of application components in the pipelined processing of data.}, keywords = {component-based frameworks, data-intensive computing, load balancing}, isbn = {0-7695-1573-8}, doi = {http://doi.ieeecomputersociety.org/10.1109/IPDPS.2002.1015655}, author = {Beynon,Michael D. and Sussman, Alan and Kurc,Tahsin and Catalyurek,Umit and Saltz,Joel} } @conference {14961, title = {Efficient techniques for range search queries on earth science data}, booktitle = {Scientific and Statistical Database Management, 2002. Proceedings. 14th International Conference on}, year = {2002}, month = {2002///}, pages = {142 - 151}, abstract = {We consider the problem of organizing large scale earth science raster data to efficiently handle queries for identifying regions whose parameters fall within certain range values specified by the queries. This problem seems to be critical to enabling basic data mining tasks such as determining associations between physical phenomena and spatial factors, detecting changes and trends, and content based retrieval. We assume that the input is too large to fit in internal memory and hence focus on data structures and algorithms that minimize the I/O bounds. A new data structure, called a tree-of-regions (ToR), is introduced and involves a combination of an R-tree and efficient representation of regions. It is shown that such a data structure enables the handling of range queries in an optimal I/O time, under certain reasonable assumptions. We also show that updates to the ToR can be handled efficiently. Experimental results for a variety of multi-valued earth science data illustrate the fast execution times of a wide range of queries, as predicted by our theoretical analysis.}, keywords = {based, computing;, content, data, data;, databases;, Earth, factors;, large, mining, mining;, natural, processing;, queries;, query, range, raster, retrieval;, scale, Science, sciences, search, spatial, structures;, tasks;, temporal, tree, tree-of-regions;, visual}, doi = {10.1109/SSDM.2002.1029714}, author = {Shi,Qingmin and JaJa, Joseph F.} } @article {18326, title = {Embedded grammar tags: advancing natural language interaction on the Web}, journal = {Intelligent Systems, IEEE}, volume = {17}, year = {2002}, month = {2002///}, pages = {48 - 53}, abstract = {Embedded grammar tags (EGTs) reflect Web page content by anticipating queries users might launch to retrieve that content. The grammars provide a unifying component for speech recognition engines, semantic Web page representation, and speech output generation. We propose a new framework that lets intelligent agents discover accurate, concise responses to natural language queries. This framework{\textquoteright}s backbone consists of embedded grammar tags that capture natural language queries. EGTs reflect information content in Web pages by anticipating the queries that users might launch to retrieve particular content.}, keywords = {embedded grammar tags, grammars, information content, information resources, intelligent agents, Internet, natural language interaction, natural language queries, natural languages, Search engines, semantic Web page representation, software agents, speech output generation, Speech recognition, speech recognition engines, Web page content}, isbn = {1541-1672}, doi = {10.1109/5254.988450}, author = {Dorai,G. K and Yacoob,Yaser} } @conference {18384, title = {Empirical evaluation of techniques and methods used for achieving and assessing software high dependability}, booktitle = {Proc. DSN Workshop on Dependability Benchmarking}, year = {2002}, month = {2002///}, author = {Rus,I. and Basili, Victor R. and Zelkowitz, Marvin V and Boehm,B.} } @article {18385, title = {Empirical findings in agile methods}, journal = {Extreme Programming and Agile Methods{\textemdash}XP/Agile Universe 2002}, year = {2002}, month = {2002///}, pages = {81 - 92}, abstract = {In recent years, the use of, interest in, and controversy about Agile methodologies have realized dramatic growth. Anecdotal evidence is rising regarding the effectiveness of agile methodologies in certain environments and for specified projects. However, collection and analysis of empirical evidence of this effectiveness and classification of appropriate environments for Agile projects has not been conducted. Researchers from four institutions organized an eWorkshop to synchronously and virtually discuss and gather experiences and knowledge from eighteen Agile experts spread across the globe. These experts characterized Agile Methods and communicated experiences using these methods on small to very large teams. They discussed the importance of staffing Agile teams with highly skilled developers. They shared common success factors and identified warning signs of problems in Agile projects. These and other findings and heuristics gathered through this valuable exchange can be useful to researchers and to practitioners as they establish an experience base for better decision making.}, doi = {10.1007/3-540-45672-4_19}, author = {Lindvall,M. and Basili, Victor R. and Boehm,B. and Costa,P. and Dangle,K. and Shull, F. and Tesoriero,R. and Williams,L. and Zelkowitz, Marvin V} } @inbook {17817, title = {Error-Tolerant Agents}, booktitle = {Computational Logic: Logic Programming and BeyondComputational Logic: Logic Programming and Beyond}, series = {Lecture Notes in Computer Science}, volume = {2407}, year = {2002}, month = {2002///}, pages = {83 - 104}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {The use of agents in today{\textquoteright}s Internet world is expanding rapidly. Yet, agent developers proceed largely under the optimistic assumption that agents will be error-free. Errors may arise in agents for numerous reasons {\textemdash} agents may share a workspace with other agents or humans and updates made by these other entities may cause an agent to face a situation that it was not explicitly programmed to deal with. Likewise, errors in coding agents may lead to inconsistent situations where it is unclear how the agent should act. In this paper, we define an agent execution model that allows agents to continue acting {\textquotedblleft}reasonably{\textquotedblright} even when some errors of the above types occur. More importantly, in our framework, agents take {\textquotedblleft}repair{\textquotedblright} actions automatically when confronted with such situations, but while taking such repair actions, they can often continue to engage in work and/or interactions with other agents that are unaffected by repairs.}, keywords = {Computer, Science}, isbn = {978-3-540-43959-2}, url = {http://dx.doi.org/10.1007/3-540-45628-7_22}, author = {Eiter,Thomas and Mascardi,Viviana and Subrahmanian,V.}, editor = {Kakas,Antonis and Sadri,Fariba} } @conference {18747, title = {Estimating the Optimal Number of Alternatives to Be Explored in Large Design Spaces: A Step Towards Incorporating Decision Making}, year = {2002}, month = {2002///}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.129.2905}, author = {Gupta,S.K.} } @article {13764, title = {Evaluating Arabic Retrieval from English or French Queries: The TREC-2001 Cross-Language Information Retrieval Track}, journal = {Proceedings of the Post Workshop of LREC}, year = {2002}, month = {2002///}, abstract = {The Cross-language information retrieval track at the 2001 Text Retrieval Conference (TREC-2001) produced the first large informationretrieval test collection for Arabic. The collection contains 383,872 Arabic news stories, 25 topic descriptions in Arabic, English and French from which queries can be formed, and manual (ground truth) relevance judgments for a useful subset of the topic-document combinations. This paper describes the way in which the collection was created, explains the evaluation measures that the collection is designed to support, and provides an overview of the results from the first set of experiments with the collection. The results make it possible to draw some inferences regarding the utility of the collection for post hoc evaluations. }, author = {Oard, Douglas and Gey,F.C. and Dorr, Bonnie J} } @conference {16669, title = {Evaluating translational correspondence using annotation projection}, booktitle = {Proceedings of the 40th Annual Meeting on Association for Computational Linguistics}, year = {2002}, month = {2002///}, pages = {392 - 399}, author = {Hwa,R. and Resnik, Philip and Weinberg, Amy and Kolak,O.} } @conference {18942, title = {Evaluating translational correspondence using annotation projection}, series = {ACL {\textquoteright}02}, year = {2002}, month = {2002///}, pages = {392 - 399}, publisher = {Association for Computational Linguistics}, organization = {Association for Computational Linguistics}, address = {Stroudsburg, PA, USA}, abstract = {Recently, statistical machine translation models have begun to take advantage of higher level linguistic structures such as syntactic dependencies. Underlying these models is an assumption about the directness of translational correspondence between sentences in the two languages; however, the extent to which this assumption is valid and useful is not well understood. In this paper, we present an empirical study that quantifies the degree to which syntactic dependencies are preserved when parses are projected directly from English to Chinese. Our results show that although the direct correspondence assumption is often too restrictive, a small set of principled, elementary linguistic transformations can boost the quality of the projected Chinese parses by 76\% relative to the unimproved baseline.}, doi = {10.3115/1073083.1073149}, url = {http://dx.doi.org/10.3115/1073083.1073149}, author = {Hwa,Rebecca and Resnik, Philip and Weinberg, Amy and Kolak,Okan} } @article {16915, title = {Evaluation of the SoftPOSIT Model-to-Image Registration Algorithm}, journal = {Technical Reports from UMIACS, UMIACS-TR-2002-22}, year = {2002}, month = {2002///}, abstract = {The problem of pose estimation arises in many areas of computer vision, including object recognition,object tracking, site inspection and updating, and autonomous navigation when scene models are avail- able. We present a new algorithm, called SoftPOSIT, for determining the pose of a 3D object from a single 2D image when correspondences between model points and image points are not known. The algorithm combines Gold{\textquoteright}s iterative softassign algorithm [20, 21] for computing correspondences and DeMenthon{\textquoteright}s iterative POSIT algorithm [14] for computing object pose under a full-perspective camera model. Our algorithm, unlike most previous algorithms for pose determination, does not have to hypoth- esize small sets of matches and then verify the remaining image points. Instead, all possible matches are treated identically throughout the search for an optimal pose. The performance of the algorithm is extensively evaluated in Monte Carlo simulations on synthetic data under a variety of levels of clutter, occlusion, and image noise. These tests show that the algorithm performs well in a variety of difficult sce- narios, and empirical evidence suggests that the algorithm has an asymptotic run-time complexity that is better than previous methods by a factor of the number of image points. The algorithm is being applied to a number of practical autonomous vehicle navigation problems including the registration of 3D archi- tectural models of a city to images, and the docking of small robots onto larger robots. }, author = {David,P. and DeMenthon,D. and Duraiswami, Ramani and Samet, Hanan} } @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 {12843, title = {Evidence-based model checking}, booktitle = {Computer Aided Verification}, year = {2002}, month = {2002///}, pages = {641 - 680}, author = {Tan,L. and Cleaveland, Rance} } @inbook {14692, title = {Evolution in Action: Using Active Networking to Evolve Network Support for Mobility}, booktitle = {Active NetworksActive Networks}, series = {Lecture Notes in Computer Science}, volume = {2546}, year = {2002}, month = {2002///}, pages = {146 - 161}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {A key early objective of Active Networking (AN) was to support on-the-fly network evolution. Although AN has been used relatively extensively to build application-customized protocols and even whole networking systems, demonstrations of evolution have been limited. This paper examines three AN mechanisms and how they enable evolution: active packets and plug-in extensions, well-known to the AN community, and update extensions, which are novel to AN. We devote our presentation to a series of demonstrations of how each type of evolution can be applied to the problem of adding support for mobility to a network. This represents the most large-scale demonstration of AN evolution to date. These demonstrations show what previous AN research has not: that AN technology can, in fact, support very significant changes to the network, even while the network is operational.}, isbn = {978-3-540-00223-9}, url = {http://dx.doi.org/10.1007/3-540-36199-5_12}, author = {Seong-Kyu,Song and Shannon,Stephen and Hicks, Michael W. and Nettles,Scott}, editor = {Sterbenz,James and Takada,Osamu and Tschudin,Christian and Plattner,Bernhard} } @conference {17889, title = {Executing Multiple Pipelined Data Analysis Operations in the Grid}, booktitle = {SC Conference}, year = {2002}, month = {2002///}, pages = {54 - 54}, publisher = {IEEE Computer Society}, organization = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, abstract = {Processing of data in many data analysis applications can be represented as an acyclic, coarse grain data flow, from data sources to the client. This paper is concerned with scheduling of multiple data analysis operations, each of which is represented as a pipelined chain of processing on data. We define the scheduling problem for effectively placing components onto Grid resources, and propose two scheduling algorithms. Experimental results are presented using a visualization application.}, doi = {http://doi.ieeecomputersociety.org/10.1109/SC.2002.10015}, author = {Spencer,Matthew and Ferreira,Renato and Beynon,Michael and Kurc,Tahsin and Catalyurek,Umit and Sussman, Alan and Saltz,Joel} } @article {17146, title = {Expandable indexes vs. sequential menus for searching hierarchies on the World Wide Web}, journal = {Behaviour \& Information Technology}, volume = {21}, year = {2002}, month = {2002///}, pages = {201 - 207}, abstract = {An experiment is reported that compared expandable indexes providing full menu context with sequential menus providing only partial context. Menu depth was varied using hierarchies of two, three and four levels deep in an asymmetric structure of 457 root level items. Menus were presented on the World Wide Web within a browser. Participants searched for specific targets. Results suggest that reducing the depth of hierarchies improves performance in terms of speed and search efficiency. Surprisingly, expandable indexes resulted in poorer performance with deeper hierarchies than did sequential menus.An experiment is reported that compared expandable indexes providing full menu context with sequential menus providing only partial context. Menu depth was varied using hierarchies of two, three and four levels deep in an asymmetric structure of 457 root level items. Menus were presented on the World Wide Web within a browser. Participants searched for specific targets. Results suggest that reducing the depth of hierarchies improves performance in terms of speed and search efficiency. Surprisingly, expandable indexes resulted in poorer performance with deeper hierarchies than did sequential menus. }, isbn = {0144-929X}, doi = {10.1080/0144929021000009045}, url = {http://www.tandfonline.com/doi/abs/10.1080/0144929021000009045}, author = {Zaphiris,Panayiotis and Shneiderman, Ben and Norman,Kent L} } @article {12159, title = {The Experience factory organization}, journal = {IEEE Software}, volume = {19}, year = {2002}, month = {2002///}, pages = {30 - 31}, author = {Basili, Victor R. and Seaman,C.} } @article {12133, title = {Experience in implementing a learning software organization}, journal = {Software, IEEE}, volume = {19}, year = {2002}, month = {2002/06//may}, pages = {46 - 49}, abstract = {In an effort to improve software development and acquisition processes and explicitly reuse knowledge from previous software projects, DaimlerChrysler created a software experience center (SEC). The authors report on challenges the company faced in creating the SEC}, keywords = {ACQUISITION, center;software, centres;project, DaimlerChrysler;explicit, development, experience, improvement;, improvement;automobile, industry;computer, knowledge, management;software, organization;previous, process, processes;software, projects;software, reuse;learning, software}, isbn = {0740-7459}, doi = {10.1109/MS.2002.1003453}, author = {Schneider,K. and von Hunnius,J.-P. and Basili, Victor R.} } @conference {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 {15268, title = {Experimental Construction of Very Large Scale DNA Databases with Associative Search}, booktitle = {DNA computing: 7th International Workshop on DNA-Based Computers, DNA 7, Tampa, FL, USA, June 10-13, 2001: revised papers}, volume = {7}, year = {2002}, month = {2002///}, pages = {231 - 231}, author = {Reif,J. H and LaBean,T. H and Pirrung,M. and Rana,V. S and Guo,B. and Kingsford, Carl and Wickham,G. S} } @conference {12763, title = {An experimental evaluation of linear and kernel-based methods for face recognition}, booktitle = {Applications of Computer Vision, 2002. (WACV 2002). Proceedings. Sixth IEEE Workshop on}, year = {2002}, month = {2002///}, pages = {13 - 18}, abstract = {In this paper we present the results of a comparative study of linear and kernel-based methods for face recognition. The methods used for dimensionality reduction are Principal Component Analysis (PCA), Kernel Principal Component Analysis (KPCA), Linear Discriminant Analysis (LDA) and Kernel Discriminant Analysis (KDA). The methods used for classification are Nearest Neighbor (NN) and Support Vector Machine (SVM). In addition, these classification methods are applied on raw images to gauge the performance of these dimensionality reduction techniques. All experiments have been performed on images from UMIST Face Database.}, keywords = {analysis;, classification;, component, discriminant, Face, image, Kernel, linear, Machine;, nearest, neighbor;, principal, recognition;, Support, vector}, doi = {10.1109/ACV.2002.1182137}, author = {Gupta, H. and Agrawala, Ashok K. and Pruthi, T. and Shekhar, C. and Chellapa, Rama} } @inbook {18671, title = {Experimental Evaluation of the Unavailability Induced by a Group Membership Protocol}, booktitle = {Dependable Computing EDCC-4}, series = {Lecture Notes in Computer Science}, volume = {2485}, year = {2002}, month = {2002///}, pages = {644 - 648}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {Group communication is an important paradigm for building highly available distributed systems. However, group membership operations often require the system to block message traffic, causing system services to become unavailable. This makes it important to quantify the unavailability induced by membership operations. This paper experimentally evaluates the blocking behavior of the group membership protocol of the Ensemble group communication system using a novel global-state-based fault injection technique. In doing so, we demonstrate how a layered distributed protocol such as the Ensemble group membership protocol can be modeled in terms of a state machine abstraction, and show how the resulting global state space can be used to specify fault triggers and define important measures on the system. Using this approach, we evaluate the cost associated with important states of the protocol under varying workload and group size. We also evaluate the sensitivity of the protocol to the occurrence of a second correlated crash failure during its operation.}, keywords = {Computer science}, isbn = {978-3-540-00012-9}, url = {http://www.springerlink.com/content/mnkd4upqr14w2r7e/abstract/}, author = {Joshi,Kaustubh and Michel Cukier and Sanders,William}, editor = {Bondavalli,Andrea and Thevenod-Fosse,Pascale} } @article {14551, title = {Exponential speedup of fixed-parameter algorithms on K 3, 3-minor-free or K 5-minor-free graphs}, journal = {Algorithms and Computation}, year = {2002}, month = {2002///}, pages = {277 - 287}, author = {Demaine,E. and Hajiaghayi, Mohammad T. and Thilikos,D.} } @article {18762, title = {Extracting articulation models from CAD models of parts with curved surfaces}, journal = {TRANSACTIONS-AMERICAN SOCIETY OF MECHANICAL ENGINEERS JOURNAL OF MECHANICAL DESIGN}, volume = {124}, year = {2002}, month = {2002///}, pages = {106 - 114}, abstract = {Degrees of freedom in an assembly are realized by creating mating features that permit relativemotion between parts. In complex assemblies, interactions between individual degrees of freedom may result in a behavior different from the intended behavior. In addition, current methods perform assembly reasoning by approximating curved surfaces as piecewise linear surfaces. Therefore, it is important to be able to: reason about assemblies using exact representations of curved surfaces; verify global motion behavior of parts in the assembly; and create motion simulations of the assembly by examination of the geometry. In this paper, we present a linear algebraic constraint method to automatically construct the space of allowed instantaneous motions of an assembly from the geometry of its constituent parts. Our work builds on previous work on linear contact mechanics and on our previous work on curved surface contact mechanics. We enumerate the conditions under which general curved surfaces can be represented using a finite number of constraints linear in the instantaneous velocities. We compose such constraints to build a space of allowed instantaneous velocities for the assembly. The space is then described as a set-theoretic sum of contact-preserving and contact-breaking motion sub-spaces. Analysis of each subspace provides feedback to the designer, which we demonstrate through the use of an example assembly {\textendash} a 4-part arm. Finally, the results of the analysis of a 4-bar linkage are compared to those from mechanism theory. }, url = {http://www-2.cs.cmu.edu/afs/cs.cmu.edu/user/cjp/www/pubs/MechDes02.pdf}, author = {Sinha,R. and Gupta,S.K. and Paredis,C. J. J. and Khosla,P. K.} } @conference {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 {11893, title = {Eye tracking using active deformable models}, booktitle = {Proc. of the IIIrd Indian Conference on Computer Vision, Graphics and Image Processing}, year = {2002}, month = {2002///}, author = {Ramadan,S. and Abd-Almageed, Wael and Smith,C.E.} } @conference {12037, title = {Eyes form eyes: New cameras for structure from motion}, booktitle = {Proceedings Workshop on Omnidirectional Vision (OMNIVIS)}, year = {2002}, month = {2002///}, author = {Neumann, J. and Ferm{\"u}ller, Cornelia and Aloimonos, J.} } @conference {14219, title = {Eyes from eyes: new cameras for structure from motion}, booktitle = {Third Workshop on Omnidirectional Vision, 2002. Proceedings}, year = {2002}, month = {2002///}, pages = {19 - 26}, publisher = {IEEE}, organization = {IEEE}, abstract = {We investigate the relationship between camera design and the problem of recovering the motion and structure of a scene from video data. The visual information that could possibly be obtained is described by the plenoptic function. A camera can be viewed as a device that captures a subset of this function, that is, it measures some of the light rays in some part of the space. The information contained in the subset determines how difficult it is to solve subsequent interpretation processes. By examining the differential structure of the time varying plenoptic function we relate different known and new camera models to the spatiotemporal structure of the observed scene. This allows us to define a hierarchy of camera designs, where the order is determined by the stability and complexity of the computations necessary to estimate structure and motion. At the low end of this hierarchy is the standard planar pinhole camera for which the structure from motion problem is non-linear and ill-posed. At the high end is a new camera, which we call the full field of view polydioptric camera, for which the problem is linear and stable. In between are multiple-view cameras with large fields of view which we have built, as well as catadioptric panoramic sensors and other omni-directional cameras. We develop design suggestions for the polydioptric camera, and based upon this new design we propose a linear algorithm for ego-motion estimation, which in essence combines differential motion estimation with differential stereo.}, keywords = {Algorithm design and analysis, Camera design, CAMERAS, Design automation, differential stereo, Educational institutions, ego-motion estimation, Eyes, Geometrical optics, IMAGE PROCESSING, Layout, Motion estimation, observed scene, Optical films, polydioptric camera, RETINA}, isbn = {0-7695-1629-7}, doi = {10.1109/OMNVIS.2002.1044486}, author = {Neumann, J. and Ferm{\"u}ller, Cornelia and Aloimonos, J.} } @article {12128, title = {Editorial: Open source and empirical software engineering}, journal = {Empirical Software Engineering}, volume = {6}, year = {2001}, month = {2001///}, pages = {193 - 194}, author = {Basili, Victor R.} } @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} } @conference {17588, title = {Efficient algorithms for location and sizing problems in network design}, booktitle = {IEEE Global Telecommunications Conference, 2001. GLOBECOM {\textquoteright}01}, volume = {4}, year = {2001}, month = {2001///}, pages = {2586-2590 vol.4 - 2586-2590 vol.4}, publisher = {IEEE}, organization = {IEEE}, abstract = {Large-scale location, sizing and homing problems of distributed network elements, have received much attention recently due to the massive deployment of broadband communication networks for services like Internet telephony and Web caching. Key considerations in designing these networks include modularity of capacity, economies of scale in cost, and reliability. We formulate a general class of such network design problems as Mixed-Integer Programs. These problems are computationally intractable in general; under various asymptotic conditions, we show how to compute near-optimal solutions. To deal with arbitrary instances, we develop new algorithms based on linear programming, as well as greedy randomized adaptive search. These algorithms achieved near-optimal solutions with reasonable computation time for our experiments}, keywords = {Algorithm design and analysis, Broadband communication, broadband communication networks, broadband networks, capacity modularity, Communication networks, computer network reliability, distributed network elements, Economies of scale, greedy randomized adaptive search, homing, integer programming, Intelligent networks, Internet telephony, large-scale location problems, Large-scale systems, Linear programming, mixed-integer programs, near-optimal solutions, network design, Optical switches, randomised algorithms, reliability, search problems, sizing, Technological innovation, telecommunication network planning, Web caching}, isbn = {0-7803-7206-9}, doi = {10.1109/GLOCOM.2001.966243}, author = {Kumaran,K. and Srinivasan, Aravind and Qiong Wang and Lanning,S. and Ramakrishnan,K. G} } @inbook {15072, title = {Efficient and Non-interactive Non-malleable Commitment}, booktitle = {Advances in Cryptology {\textemdash} EUROCRYPT 2001Advances in Cryptology {\textemdash} EUROCRYPT 2001}, series = {Lecture Notes in Computer Science}, volume = {2045}, year = {2001}, month = {2001///}, pages = {40 - 59}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {We present new constructions of non-malleable commitment schemes, in the public parameter model (where a trusted party makes parameters available to all parties), based on the discrete logarithm or RSA assumptions. The main features of our schemes are: they achieve near-optimal communication for arbitrarily-large messages and are non-interactive . Previous schemes either required (several rounds of) interaction or focused on achieving non-malleable commitment based on general assumptions and were thus efficient only when committing to a single bit. Although our main constructions are for the case of perfectly-hiding commitment, we also present a communication-efficient, non-interactive commitment scheme (based on general assumptions) that is perfectly binding.}, keywords = {Computer science}, isbn = {978-3-540-42070-5}, url = {http://www.springerlink.com/content/nhbj60a9da101w0r/abstract/}, author = {Di Crescenzo,Giovanni and Katz, Jonathan and Ostrovsky,Rafail and Smith,Adam}, editor = {Pfitzmann,Birgit} } @conference {18461, title = {Efficient evaluation of reverberant sound fields}, booktitle = {Applications of Signal Processing to Audio and Acoustics, 2001 IEEE Workshop on the}, year = {2001}, month = {2001///}, pages = {203 - 206}, publisher = {IEEE}, organization = {IEEE}, abstract = {An image method due to Allen and Berkley (1979) is often used to simulate the effect of reverberation in rooms. This method is relatively expensive computationally. We present a fast method for conducting such simulations using multipole expansions. For M real and image sources and N evaluation points, while the image method requires O(MN) operations, our method achieves the calculations in O(M + N) operations, resulting in a substantial speedup. Applications of our technique are also expected in simulation of virtual audio}, keywords = {AB algorithm, acoustic signal processing, architectural acoustics, audio signal processing, Computational modeling, Computer interfaces, Computer simulation, Educational institutions, image method, image sources, Impedance, Laboratories, microphone arrays, multipole expansions, Nails, performance evaluation, reverberant sound fields, reverberation, room reverberation, simulation, Simulations, speedup, virtual audio}, isbn = {0-7803-7126-7}, doi = {10.1109/ASPAA.2001.969578}, author = {Duraiswami, Ramani and Gumerov, Nail A. and Zotkin,Dmitry N and Davis, Larry S.} } @article {13761, title = {Efficient Language Independent Generation from Lexical Conceptual Structure}, year = {2001}, month = {2001/09//}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {This paper describes a system for generating natural-language sentences from an interlingual representation, Lexical Conceptual Structure (LCS). The system has been developed as part of a Chinese-English Machine Translation system; however, it is designed to be used for many other MT language pairs and Natural Language applications. The contributions of this work include: (1) Development of a language-independent generation system that maximizes efficiency through the use of a hybrid rule-based/statistical module; (2) Enhancements to an interlingual representation and associated algorithms for interpretation of multiply ambiguous input sentences; (3) Development of an efficient reusable language-independent linearization module with a grammar description language that can be used with other systems; (4) Improvements to an earlier algorithm for hierarchically mapping thematic roles to surface positions; (5) Development of a diagnostic tool for lexicon coverage and correctness and use of the tool for verification of English, Spanish, and Chinese lexicons. An evaluation of translation quality shows comparable performance with commercial translation system. The generation system can also be straightforwardly extended to their languages and this is demonstrated and evaluated for Spanish.}, keywords = {*LEXICAL CONCEPTUAL STRUCTURE, *LEXICOGRAPHY, *MACHINE TRANSLATION, *VOCABULARY, *WORDS(LANGUAGE), algorithms, CHINA, COMMERCE, DIAGNOSTIC EQUIPMENT, efficiency, English language, grammars, INPUT, INTERLINGUAL, LANGUAGE, LANGUAGE-INDEPENDENT NLP., linguistics, MAPPING, natural language, QUALITY, SPANISH LANGUAGE, verification}, url = {http://stinet.dtic.mil/oai/oai?\&verb=getRecord\&metadataPrefix=html\&identifier=ADA458756}, author = {Habash,Nizar and Dorr, Bonnie J and Traum,David} } @conference {12828, title = {Efficient Model Checking Via Buchi Tableau Automata*}, booktitle = {Computer aided verification: 13th International conference, CAV 2001, Paris, France, July 18-22, 2001: proceedings}, volume = {2102}, year = {2001}, month = {2001///}, pages = {38 - 38}, author = {Bhat,G. S and Cleaveland, Rance and Groce,A.} } @conference {14766, title = {Efficient network and I/O throttling for fine-grain cycle stealing}, booktitle = {Proceedings of the 2001 ACM/IEEE conference on Supercomputing (CDROM) - Supercomputing {\textquoteright}01}, year = {2001}, month = {2001///}, pages = {3 - 3}, address = {Denver, Colorado}, doi = {10.1145/582034.582037}, url = {http://dl.acm.org/citation.cfm?id=582037}, author = {Ryu, Kyung D. and Hollingsworth, Jeffrey K and Keleher, Peter J.} } @article {15093, title = {Efficient password-authenticated key exchange using human-memorable passwords}, journal = {Advances in Cryptology{\textemdash}EUROCRYPT 2001}, year = {2001}, month = {2001///}, pages = {475 - 494}, abstract = {There has been much interest in password-authenticated keyexchange protocols which remain secure even when users choose passwords from a very small space of possible passwords (say, a dictionary of English words). Under this assumption, one must be careful to design protocols which cannot be broken using off-line dictionary attacks in which an adversary enumerates all possible passwords in an attempt to determine the correct one. Many heuristic protocols have been proposed to solve this important problem. Only recently have formal validations of security (namely, proofs in the idealized random oracle and ideal cipher models) been given for specific constructions [3,10,22].Very recently, a construction based on general assumptions, secure in the standard model with human-memorable passwords, has been proposed by Goldreich and Lindell [17]. Their protocol requires no public parameters; unfortunately, it requires techniques from general multi-party computation which make it impractical. Thus, [17] only proves that solutions are possible {\textquotedblleft}in principal{\textquotedblright}. The main question left open by their work was finding an efficient solution to this fundamental problem. We showan efficient, 3-round, password-authenticated key exchange protocol with human-memorable passwords which is provably secure under the Decisional Diffie-Hellman assumption, yet requires only (roughly) 8 times more computation than {\textquotedblleft}standard{\textquotedblright} Diffie-Hellman key exchange [14] (which provides no authentication at all). We assume public parameters available to all parties. We stress that we work in the standard model only, and do not require a {\textquotedblleft}random oracle{\textquotedblright} assumption. }, doi = {10.1007/3-540-44987-6_29}, author = {Katz, Jonathan and Ostrovsky,R. and Yung,M.} } @conference {16260, title = {Efficient perspective-accurate silhouette computation and applications}, booktitle = {Proceedings of the seventeenth annual symposium on Computational geometry}, series = {SCG {\textquoteright}01}, year = {2001}, month = {2001///}, pages = {60 - 68}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Silhouettes are perceptually and geometrically salient features of geo metric models. Hence a number of graphics and visualization applications need to find them to aid further processing. The efficient computation of silhouettes, especially in the context of perspective projection, is known to be difficult. This paper presents a novel efficient and practical algorithm to compute silhouettes from a sequence of viewpoints under perspective projection. Parallel projection is a special case of this algorithm. Our approach is based on a point-plane duality in three dimensions, which allows an efficient computation of the \emph{changes} in the silhouette of a polygonal model between consecutive frames. In addition, we present several applications of our technique to problems from computer graphics and medical visualization. We also provide experimental data that show the efficiency of our approach. million vertices on an SGI Onyx workstation.}, keywords = {rendering, silhouette, simplification}, isbn = {1-58113-357-X}, doi = {10.1145/378583.378618}, url = {http://doi.acm.org/10.1145/378583.378618}, author = {Pop, Mihai and Duncan,Christian and Barequet,Gill and Goodrich,Michael and Huang,Wenjing and Kumar,Subodh} } @article {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.} } @conference {13347, title = {Efficient stepwise selection in decomposable models}, booktitle = {Proc. UAI}, year = {2001}, month = {2001///}, pages = {128 - 135}, author = {Deshpande, Amol and Garofalakis,M. N and Jordan,M. I} } @conference {17851, title = {An efficient system for multi-perspective imaging and volumetric shape analysis}, booktitle = {Proceedings of the 2001 Workshop on Parallel and Distributed Computing in Imaging Processing, Video Processing, and Multimedia}, year = {2001}, month = {2001///}, author = {Borovikov,E. and Sussman, Alan and Davis, Larry S.} } @article {17719, title = {On the eigensystems of graded matrices}, journal = {Numerische Mathematik}, volume = {90}, year = {2001}, month = {2001///}, pages = {349 - 370}, doi = {10.1007/s002110100290}, author = {Stewart, G.W.} } @article {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} } @article {16324, title = {An empirical study of regression test selection techniques}, journal = {ACM Transactions on Software Engineering and MethodologyACM Trans. Softw. Eng. Methodol.}, volume = {10}, year = {2001}, month = {2001/04//}, pages = {184 - 208}, isbn = {1049331X}, doi = {10.1145/367008.367020}, url = {http://dl.acm.org/citation.cfm?id=367020}, author = {Graves,Todd L. and Harrold,Mary Jean and Kim,Jung-Min and Porter, Adam and Rothermel,Gregg} } @article {16157, title = {Enabling Commuters to Find the Best Route: An Interface for Analyzing Driving History Logs}, journal = {Proceedings of the IFIP Conference on Human-Computer Interaction (Interact2001)}, year = {2001}, month = {2001///}, pages = {799 - 800}, abstract = {This paper describes a prototype interface design for an automobile driving history log. It allows drivers to choose the best route among several alternatives for their common trips. Recorded data includes time to complete the travel, fuel consumption, and number of stops.}, author = {Konishi,M. and Plaisant, Catherine and Shneiderman, Ben} } @article {14607, title = {Enrichment of Regulatory Signals in Conserved Non-Coding Genomic Sequence}, journal = {BioinformaticsBioinformatics}, volume = {17}, year = {2001}, month = {2001/10/01/}, pages = {871 - 877}, abstract = {Motivation: Whole genome shotgun sequencing strategies generate sequence data prior to the application of assembly methodologies that result in contiguous sequence. Sequence reads can be employed to indicate regions of conservation between closely related species for which only one genome has been assembled. Consequently, by using pairwise sequence alignments methods it is possible to identify novel, non-repetitive, conserved segments in non-coding sequence that exist between the assembled human genome and mouse whole genome shotgun sequencing fragments. Conserved non-coding regions identify potentially functional DNA that could be involved in transcriptional regulation.Results: Local sequence alignment methods were applied employing mouse fragments and the assembled human genome. In addition, transcription factor binding sites were detected by aligning their corresponding positional weight matrices to the sequence regions. These methods were applied to a set of transcripts corresponding to 502 genes associated with a variety of different human diseases taken from the Online Mendelian Inheritance in Man database. Using statistical arguments we have shown that conserved non-coding segments contain an enrichment of transcription factor binding sites when compared to the sequence background in which the conserved segments are located. This enrichment of binding sites was not observed in coding sequence. Conserved non-coding segments are not extensively repeated in the genome and therefore their identification provides a rapid means of finding genes with related conserved regions, and consequently potentially related regulatory mechanism. Conserved segments in upstream regions are found to contain binding sites that are co-localized in a manner consistent with experimentally known transcription factor pairwise co-occurrences and afford the identification of novel co-occurring Transcription Factor (TF) pairs. This study provides a methodology and more evidence to suggest that conserved non-coding regions are biologically significant since they contain a statistical enrichment of regulatory signals and pairs of signals that enable the construction of regulatory models for human genes. Contact: samuel.levy@celera.com }, isbn = {1367-4803, 1460-2059}, doi = {10.1093/bioinformatics/17.10.871}, url = {http://bioinformatics.oxfordjournals.org/content/17/10/871}, author = {Levy,Samuel and Hannenhalli, Sridhar and Workman,Christopher} } @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 {12847, title = {Equivalence and preorder checking for finite-state systems}, journal = {Handbook of Process Algebra}, year = {2001}, month = {2001///}, pages = {391 - 424}, author = {Cleaveland, Rance and Sokolsky,O.} } @article {17116, title = {E-tables: Non-specialist use and understanding of statistical data}, journal = {SURFACE, the Syracuse University Research Facility And Collaborative Environment}, year = {2001}, month = {2001///}, pages = {33 - 33}, abstract = {This paper provides a progress report on a project that aims to understand how people think about and understand statistical data presented in tables. The focus is on people who are not statistical specialists. To this end, studies of various user populations were conducted, underlying data enrichment and explanation was investigated, and interactive user interface prototypes were developed and tested.}, author = {Marchionini,G. and Hert,C. and Shneiderman, Ben and Liddy,L.} } @article {18027, title = {Evaluating the XMT parallel programming model}, journal = {High-Level Parallel Programming Models and Supportive Environments}, year = {2001}, month = {2001///}, pages = {95 - 108}, abstract = {Explicit-multithreading (XMT) is a parallel programming model designed for exploiting on-chip parallelism. Its features include a simple thread execution model and an efficient prefix-sum instruction for synchronizing shared data accesses. By taking advantage of low-overhead parallel threads and high on-chip memory bandwidth, the XMT model tries to reduce the burden on programmers by obviating the need for explicit task assignment and thread coarsening. This paper presents features of the XMT programming model, and evaluates their utility through experiments on a prototype XMT compiler and architecture simulator. We find the lack of explicit task assignment has slight effects on performance for the XMT architecture. Despite low thread overhead, thread coarsening is still necessary to some extent, but can usually be automatically applied by the XMT compiler. The prefix-sum instruction provides more scalable synchronization than traditional locks, and the simple run-untilcompletion thread execution model (no busy-waits) does not impair performance. Finally, the combination of features in XMT can encourage simpler parallel algorithms that may be more efficient than more traditional complex approaches.}, author = {Naishlos,D. and Nuzman,J. and Tseng,C. W and Vishkin, Uzi} } @conference {16647, title = {Evolving columnar circuitry for lateral cortical inhibition}, booktitle = {Neural Networks, 2001. Proceedings. IJCNN{\textquoteright}01. International Joint Conference on}, volume = {1}, year = {2001}, month = {2001///}, pages = {278 - 283}, author = {Ayers,D. and Reggia, James A.} } @conference {12120, title = {An experience management system for a software engineering research organization}, booktitle = {Software Engineering Workshop, 2001. Proceedings. 26th Annual NASA Goddard}, year = {2001}, month = {2001///}, pages = {29 - 35}, abstract = {Most businesses rely on the fact that their employees possess relevant knowledge and that they can apply it to the task at hand. The problem is that this knowledge is not owned by the organization. It is owned and controlled by its employees. Maintaining an appropriate level of knowledge in the organization is a very important issue. It is, however, not an easy task for most organizations, and it is particularly problematic for software organizations, which are human- and knowledge-intensive. Knowledge management is a relatively new area that has attempted to address these problems. This paper introduces an approach called the "knowledge dust-to-pearls" approach. This approach addresses some of the issues with knowledge management by providing low-barrier mechanisms to "jump start" the experience base. This approach allows the experience base to become more useful more quickly than traditional approaches. This paper describes the approach and gives an example of its use at the Fraunhofer Center for Experimental Software Engineering, Maryland, USA}, keywords = {and, approach;knowledge, base;experience, Center, control;knowledge, data, development, dust-to-pearls, engineering, Engineering;business, engineering;software, experimental, for, Fraunhofer, houses;, knowledge;employee, knowledge;experience, level, maintenance;knowledge, management, management;knowledge, management;software, mechanisms;software, organization;software, organizational, organizations;administrative, organizations;knowledge, organizations;low-barrier, ownership;knowledge-intensive, processing;personnel;research, research, software, system;human-intensive}, doi = {10.1109/SEW.2001.992652}, author = {Basili, Victor R. and Costa,P. and Lindvall,M. and Mendonca,M. and Seaman,C. and Tesoriero,R. and Zelkowitz, Marvin V} } @inbook {17594, title = {Experimental Analysis of Algorithms for Bilateral-Contract Clearing Mechanisms Arising in Deregulated Power Industry}, booktitle = {Algorithm EngineeringAlgorithm Engineering}, series = {Lecture Notes in Computer Science}, volume = {2141}, year = {2001}, month = {2001///}, pages = {172 - 184}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {We consider the bilateral contract satisfaction problem arising from electrical power networks due to the proposed deregulation of the electric utility industry in the USA. Given a network and a (multi)set of pairs of vertices (contracts) with associated demands, the goal is to find the maximum number of simultaneously satisfiable contracts. We study how four different algorithms perform in fairly realistic settings; we use an approximate electrical power network from Colorado. Our experiments show that three heuristics outperform a theoretically better algorithm. We also test the algorithms on four types of scenarios that are likely to occur in a deregulated marketplace. Our results show that the networks that are adequate in a regulated marketplace might be inadequate for satisfying all the bilateral contracts in a deregulated industry.}, isbn = {978-3-540-42500-7}, url = {http://dx.doi.org/10.1007/3-540-44688-5_14}, author = {Barrett,Chris and Cook,Doug and Hicks,Gregory and Faber,Vance and Marathe,Achla and Marathe,Madhav and Srinivasan, Aravind and Sussmann,Yoram and Thornquist,Heidi}, editor = {Brodal,Gerth and Frigioni,Daniele and Marchetti-Spaccamela,Alberto} } @article {17149, title = {Exploration of Large Online Data Tables Using Generalized Query Previews}, journal = {University of Maryland Computer Science Technical Report (June 2001)}, year = {2001}, month = {2001///}, abstract = {Companies, government agencies, and other organizations are making their data available to the world over the Internet. These organizations often store their data as large online relational database tables. Users query these databases with front-ends that mostly use menus or form fillin interfaces, but these interfaces rarely give users information about the contents and distribution of the data. This situation leads users to waste time and network resources posing queries that have zero-hit or mega-hit results. Generalized query previews form a user interface architecture for efficient browsing of large online databases by supplying data distribution information to the users. The data distribution information provides an overview of the data. Generalized query previews give continuous feedback about the size of the results as the query is being formed. This provides a preview of the results. This paper presents the generalized query previews user interface architecture and our experimental findings. Our user study shows that for exploratory querying tasks, generalized query previews speed user performance and reduce network load. Categories and Subject Descriptors: H.5.2 [Information Interfaces and Presentation]: User Interfaces - Graphical user interfaces (GUI), H.3.5 [Information Storage and Retrieval]: Online Information Services - Web-based services. General Terms: Design, Human Factors, Experimentation. Keywords: Visual Data Mining, Information Visualization, Graphical User Interfaces, Relational Databases, Database Querying, Online Databases, Dynamic Queries, Previews and Overviews.}, author = {Tanin,E. and Shneiderman, Ben} } @inbook {14217, title = {Eyes from Eyes}, booktitle = {3D Structure from Images {\textemdash} SMILE 20003D Structure from Images {\textemdash} SMILE 2000}, series = {Lecture Notes in Computer Science}, volume = {2018}, year = {2001}, month = {2001///}, pages = {204 - 217}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {We describe a family of new imaging systems, called Argus eyes, that consist of common video cameras arranged in some network. The system we built consists of six cameras arranged so that they sample different parts of the visual sphere. This system has the capability of very accurately estimating its own 3D motion and consequently estimating shape models from the individual videos. The reason is that inherent ambiguities of confusion between translation and rotation disappear in this case. We provide an algorithm and several experiments using real outdoor or indoor images demonstrating the superiority of the new sensor with regard to 3D motion estimation.}, isbn = {978-3-540-41845-0}, url = {http://dx.doi.org/10.1007/3-540-45296-6_14}, author = {Baker,Patrick and Pless,Robert and Ferm{\"u}ller, Cornelia and Aloimonos, J.}, editor = {Pollefeys,Marc and Van Gool,Luc and Zisserman,Andrew and Fitzgibbon,Andrew} } @book {14218, title = {Eyes from Eyes: Analysis of Camera Design Using Plenoptic Video Geometry}, year = {2001}, month = {2001///}, publisher = {Computer Vision Laboratory, Center for Automation Research, University of Maryland}, organization = {Computer Vision Laboratory, Center for Automation Research, University of Maryland}, abstract = {We investigate the relationship between camera design and the problem of recovering the motion andstructure of a scene from video data. The visual information that could possibly be obtained is described by the plenoptic function. A camera can be viewed as a device that captures a subset of this function, that is, it measures some of the light rays in some part of the space. The information contained in the subset determines how difficult it is to solve subsequent interpretation processes. By examining the differential structure of the time varying plenoptic function we relate different known and new camera models to the spatio-temporal structure of the observed scene. This allows us to define a hierarchy of camera designs, where the order is determined by the stability and complexity of the computations necessary to estimate structure and motion. At the low end of this hierarchy is the standard planar pinhole camera for which the structure from motion problem is non-linear and ill-posed. At the high end is a camera, which we call the full field of view polydioptric camera, for which the problem is linear and stable. In between are multiple-view cameras with large fields of view which we have built, as well as catadioptric panoramic sensors and other omni-directional cameras. We develop design suggestions for the polydioptric camera, and based upon this new design we propose a linear algorithm for ego- motion estimation, which in essence combines differential motion estimation with differential stereo. }, author = {Neumann, J. and Ferm{\"u}ller, Cornelia and Aloimonos, J. and University of Maryland (College Park, Md.). Center for Automation Research} } @conference {15148, title = {On the efficiency of local decoding procedures for error-correcting codes}, booktitle = {Proceedings of the thirty-second annual ACM symposium on Theory of computing}, series = {STOC {\textquoteright}00}, year = {2000}, month = {2000///}, pages = {80 - 86}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, isbn = {1-58113-184-4}, doi = {10.1145/335305.335315}, url = {http://doi.acm.org/10.1145/335305.335315}, author = {Katz, Jonathan and Trevisan,Luca} } @article {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 {14764, title = {Efficient performance prediction for large-scale, data-intensive applications}, journal = {International Journal of High Performance Computing Applications}, volume = {14}, year = {2000}, month = {2000///}, pages = {216 - 216}, author = {Kurc, T. and Uysal, M. and Eom, H. and Hollingsworth, Jeffrey K and Saltz, J. and Sussman, Alan} } @conference {16444, title = {Efficient remote data access in a mobile computing environment}, booktitle = {ICPP}, year = {2000}, month = {2000///}, pages = {57 - 57}, author = {Bright,L. and Raschid, Louiqa} } @article {17907, title = {Efficiently computing and updating triangle strips for real-time rendering}, journal = {Computer Aided Design}, volume = {32}, year = {2000}, month = {2000///}, pages = {753 - 772}, abstract = {Triangle strips are a widely used hardware-supported data-structure to compactly represent and efficiently render polygonal meshes. In thispaper we survey the efficient generation of triangle strips as well as their variants. We present efficient algorithms for partitioning polygonal meshes into triangle strips. Triangle strips have traditionally used a buffer size of two vertices. In this paper we also study the impact of larger buffer sizes and various queuing disciplines on the effectiveness of triangle strips. View-dependent simplification has emerged as a powerful tool for graphics acceleration in visualization of complex environments. However, in a view-dependent framework the triangle mesh connectivity changes at every frame making it difficult to use triangle strips. In this paper we present a novel data-structure, Skip Strip, that efficiently maintains triangle strips during such view-dependent changes. A Skip Strip stores the vertex hierarchy nodes in a skip-list-like manner with path compression. We anticipate that Skip Strips will provide a road-map to combine rendering acceleration techniques for static datasets, typical of retained-mode graphics applications, with those for dynamic datasets found in immediate-mode applications. }, author = {El-Sana,J. and Evans,F. and Kalaiah,A. and Varshney, Amitabh and Skiena,S. and Azanli,E.} } @book {12383, title = {Embedded multiprocessors: Scheduling and synchronization}, volume = {3}, year = {2000}, month = {2000///}, publisher = {CRC}, organization = {CRC}, author = {Sriram,S. and Bhattacharyya, Shuvra S.} } @conference {16339, title = {Empirical studies of software engineering: a roadmap}, booktitle = {Proceedings of the conference on The future of Software engineering}, year = {2000}, month = {2000///}, pages = {345 - 355}, author = {Perry,D. E. and Porter, Adam and Votta,L. G.} } @conference {16341, title = {An empirical study of regression test application frequency}, booktitle = {Proceedings of the 22nd international conference on Software engineering - ICSE {\textquoteright}00}, year = {2000}, month = {2000///}, pages = {126 - 135}, address = {Limerick, Ireland}, doi = {10.1145/337180.337196}, url = {http://dl.acm.org/citation.cfm?id=337196}, author = {Kim,Jung-Min and Porter, Adam and Rothermel,Gregg} } @conference {18031, title = {Evaluating multi-threading in the prototype XMT environment}, booktitle = {Proc. 4th Workshop on Multi-Threaded Execution, Architecture and Compliation (MTEAC2000)}, year = {2000}, month = {2000///}, abstract = {XMT is a multi-threaded programming model designed toexploit explicit specification of parallel threads. Its main features are a simple thread execution model and an efficient prefix-sum instruction for synchronizing shared data accesses. This paper presents and evaluates the performance of multi- threading in the XMT programming environment. A prototype XMT compiler converts parallel regions into procedure calls, which are then executed efficiently in XMT hardware. An architecture simulator similar to SimpleScalar is used to evaluate the performance of the XMT system for twelve benchmark codes. Results show the XMT architecture generally succeeds in providing low-overhead parallel threads and uniform access times on-chip. However, compiler optimizations to cluster (coarsen) threads are still needed for very fine-grained threads. }, author = {Naishlos,D. and Nuzman,J. and Tseng,C. W and Vishkin, Uzi} } @conference {16164, title = {Evaluation challenges for a Federation of heterogeneous information providers: the case of NASA{\textquoteright}s Earth Science Information Partnerships}, booktitle = {Enabling Technologies: Infrastructure for Collaborative Enterprises, 2000. (WET ICE 2000). Proeedings. IEEE 9th International Workshops on}, year = {2000}, month = {2000///}, pages = {130 - 135}, abstract = {NASA{\textquoteright}s Earth Science Information Partnership Federation is an experiment funded to assess the ability of a group of widely heterogeneous earth science data or service providers to self organize and provide improved and affordable access to an expanding earth science user community. As it is self-organizing, the Federation is mandated to set in place an evaluation methodology and collect metrics reflecting the outcomes and benefits of the Federation. This paper describes the challenges of organizing such a federated partnership self-evaluation and discusses the issues encountered during the metrics definition phase of the early data collection. Our experience indicates that a large number of metrics will be needed to fully represent the activities and strengths of all partners, but because of the heterogeneity of the ESIPs the qualitative data (comments accompanying the metric data and success stories) becomes the most useful information. Other lessons learned included the absolute need for online browsing tools to accompany data collection tools. Finally, our experience confirms the effect of evaluation as an agent of change, the best example being the high level of collaboration among the ESIPs which can be in part attributed to the initial identification of collaboration as one of the important evaluation factors of the Federation}, keywords = {Browsing, collection;heterogeneous, computing;groupware;, data;online, Earth, Federation;data, information, NASA{\textquoteright}s, Partnership, Science, systems;geophysics, tools;geographic}, doi = {10.1109/ENABL.2000.883717}, author = {Plaisant, Catherine and Komlodi,A. and Lindsay,F.} } @article {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 {13551, title = {Event Detection from MPEGVideo in the Compressed Domain}, booktitle = {ICPR}, year = {2000}, month = {2000///}, pages = {819 - 822}, abstract = {The use of information in the compressed domain allows for the rapid analysis of video content using standard hardware. This paper describes two techniques for detecting dynamic events using the motion vectors obtained from the MPEG video encoding. In the first technique, feature vectors from motion information form a high dimensional curve for a video clip and curve simplication allows us to browse the clip along portions where interesting events are likely to happen. In the second technique, the camera motion, pan, tilt, and zoom are computed from the motion vectors, and the residual vectors which are not explained by the camera motion are regarded as generated by moving blobs. Events are detected from these moving blobs.}, author = {Yoon,K. and DeMenthon,D. and David Doermann} } @article {18440, title = {The experimental validation and packaging of software technologies}, journal = {ACM SIGSOFT Software Engineering Notes}, volume = {25}, year = {2000}, month = {2000/01//}, pages = {82 - 83}, isbn = {0163-5948}, doi = {10.1145/340855.341021}, url = {http://doi.acm.org/10.1145/340855.341021}, author = {Shull, Forrest and Basili, Victor R. and Zelkowitz, Marvin V} } @article {18028, title = {Experiments with list ranking for explicit multi-threaded (XMT) instruction parallelism}, journal = {J. Exp. Algorithmics}, volume = {5}, year = {2000}, month = {2000/12//}, abstract = {Algorithms for the problem of list ranking are empiricallystudied with respect to the Explicit Multi-Threaded (XMT) platform for instruction-level parallelism (ILP). The main goal of this study is to understand the differences between XMT and more traditional parallel computing implementation platforms/models as they pertain to the well studied list ranking problem. The main two findings are: (i) good speedups for much smaller inputs are possible and (ii) in part, the first finding is based on a new variant of a 1984 algorithm, called the No-Cut algorithm. The paper incorporates analytic (non-asymptotic) performance analysis into experimental performance analysis for relatively small inputs. This provides an interesting example where experimental research and theoretical analysis complement one another. Explicit Multi-Threading (XMT) is a fine-grained computation framework introduced in our SPAA{\textquoteright}98 paper. Building on some key ideas of parallel computing, XMT covers the spectrum from algorithms through architecture to implementation; the main implementation related innovation in XMT was through the incorporation of low-overhead hardware and software mechanisms (for more effective fine-grained parallelism). The reader is referred to that paper for detail on these mechanisms. The XMT platform aims at faster single-task completion time by way of ILP. }, isbn = {1084-6654}, doi = {10.1145/351827.384252}, url = {http://doi.acm.org/10.1145/351827.384252}, author = {Vishkin,Dascal and Vishkin, Uzi} } @conference {16453, title = {Exploiting concurrency in a DBMS implementation for production systems}, booktitle = {Proceedings of the first international symposium on Databases in parallel and distributed systems}, year = {2000}, month = {2000///}, pages = {34 - 45}, author = {Raschid, Louiqa and Sellis,T. and Lin,C. C} } @article {14775, title = {Exploiting fine-grained idle periods in networks of workstations}, journal = {IEEE Transactions on Parallel and Distributed Systems}, volume = {11}, year = {2000}, month = {2000/07//}, pages = {683 - 698}, abstract = {Studies have shown that for a significant fraction of the time, workstations are idle. In this paper, we present a new scheduling policy called Linger-Longer that exploits the fine-grained availability of workstations to run sequential and parallel jobs. We present a two-level workload characterization study and use it to simulate a cluster of workstations running our new policy. We compare two variations of our policy to two previous policies: Immediate-Eviction and Pause-and-Migrate. Our study shows that the Linger-Longer policy can improve the throughput of foreign jobs on a cluster by 60 percent with only a 0.5 percent slowdown of local jobs. For parallel computing, we show that the Linger-Longer policy outperforms reconfiguration strategies when the processor utilization by the local process is 20 percent or less in both synthetic bulk synchronous and real data-parallel applications}, keywords = {cluster of workstations, Computer networks, Concurrent computing, Contracts, Delay, fine-grained availability, Intelligent networks, Linger-Longer, networks of workstations, PARALLEL PROCESSING, Predictive models, Processor scheduling, Resumes, scheduling policy, Throughput, workload characterization, workstation clusters, Workstations}, isbn = {1045-9219}, doi = {10.1109/71.877793}, author = {Kyung Dong Ryu and Hollingsworth, Jeffrey K} } @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} } @conference {15889, title = {Effects of term segmentation on Chinese/English cross-language information retrieval}, booktitle = {String Processing and Information Retrieval Symposium, 1999 and International Workshop on Groupware}, year = {1999}, month = {1999///}, pages = {149 - 157}, publisher = {IEEE}, organization = {IEEE}, abstract = {The majority of recent Cross-Language Information Retrieval (CLIR) research has focused on European languages. CLIR problems that involve East Asian languages such as Chinese introduce additional challenges, because written Chinese texts lack boundaries between terms. The paper examines three Chinese segmentation techniques in combination with two variants of dictionary-based Chinese to English query translation. The results indicate that failure to segment terms, particularly technical terms and names, can have a cascading effect that reduces retrieval effectiveness. Task-tuned segmentation algorithms and alternative term weighting strategies are suggested as productive directions for future work}, keywords = {alternative term weighting strategies, cascading effect, Chinese segmentation techniques, Chinese/English cross-language information retrieval, Chromium, CLIR problems, Cross-Language Information Retrieval research, data mining, Dictionaries, dictionary-based Chinese, East Asian languages, English query translation, European languages, future work, Information retrieval, language translation, linguistics, natural language processing, natural languages, productive directions, Reactive power, retrieval effectiveness, task-tuned segmentation algorithms, technical terms, term segmentation, text analysis, written Chinese texts}, isbn = {0-7695-0268-7}, doi = {10.1109/SPIRE.1999.796590}, author = {Oard, Douglas and Wang,Jianqiang} } @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 {14463, title = {Efficient learning using constrained sufficient statistics}, journal = {Proceedings of the 7th International Workshop on Artificial Intelligence and Statistics (AISTATS-99)}, year = {1999}, month = {1999///}, abstract = {Learning Bayesian networks is a central prob-lem for pattern recognition, density estima- tion and classification. In this paper, we propose a new method for speeding up the computational process of learning Bayesian network structure. This approach uses con- straints imposed by the statistics already col- lected from the data to guide the learning al- gorithm. This allows us to reduce the num- ber of statistics collected during learning and thus speed up the learning time. We show that our method is capable of learning struc- ture from data more efficiently than tradi- tional approaches. Our technique is of partic- ular importance when the size of the datasets is large or when learning from incomplete data. The basic technique that we introduce is general and can be used to improve learn- ing performance in many settings where suf- ficient statistics must be computed. In ad- dition, our technique may be useful for al- ternate search strategies such as branch and bound algorithms. }, author = {Friedman,N. and Getoor, Lise} } @conference {16259, title = {Efficient perspective-accurate silhouette computation}, booktitle = {Proceedings of the fifteenth annual symposium on Computational geometry}, series = {SCG {\textquoteright}99}, year = {1999}, month = {1999///}, pages = {417 - 418}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, isbn = {1-58113-068-6}, doi = {10.1145/304893.304999}, url = {http://doi.acm.org/10.1145/304893.304999}, author = {Barequet,G. and Duncan,C. A and Goodrich,M. T and Kumar,S. and Pop, Mihai} } @book {14149, title = {Efficient preconditioning of the linearized Navier-Stokes equations}, year = {1999}, month = {1999///}, publisher = {Citeseer}, organization = {Citeseer}, author = {Silvester, D. and Elman, Howard and Kay, D. and Wathen, A.} } @article {15747, title = {Eigenanalysis of Some Preconditioned Helmholtz Problems}, journal = {Numerische Mathematik}, volume = {83}, year = {1999}, month = {1999///}, pages = {231 - 257}, abstract = {In this work we calculate the eigenvalues obtained by preconditioning the discrete Helmholtz operator with Sommerfeld-like boundary conditions on a rectilinear domain, by a related operator with boundary conditions that permit the use of fast solvers. The main innovation is that the eigenvalues for two and three-dimensional domains can be calculated exactly by solving a set of one-dimensional eigenvalue problems. This permits analysis of quite large problems. For grids fine enough to resolve the solution for a given wave number, preconditioning using Neumann boundary conditions yields eigenvalues that are uniformly bounded, located in the first quadrant, and outside the unit circle. In contrast, Dirichlet boundary conditions yield eigenvalues that approach zero as the product of wave number with the mesh size is decreased. These eigenvalue properties yield the first insight into the behavior of iterative methods such as GMRES applied to these preconditioned problems.}, author = {Elman, Howard and O{\textquoteright}Leary, Dianne P.} } @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.} } @conference {18311, title = {Estimation of composite object and camera image motion}, booktitle = {The Proceedings of the Seventh IEEE International Conference on Computer Vision, 1999}, volume = {1}, year = {1999}, month = {1999///}, pages = {190-197 vol.1 - 190-197 vol.1}, publisher = {IEEE}, organization = {IEEE}, abstract = {An approach for estimating composite independent object and camera image motions is proposed. The approach employs spatio-temporal flow models learned through observing typical movements of the object, to decompose image motion into independent object and camera motions. The spatio-temporal flow models of the object motion are represented as a set of orthogonal flow bases that are learned using principal component analysis of instantaneous flow measurements from a stationary camera. These models are then employed in scenes with a moving camera to extract motion trajectories relative to those learned. The performance of the algorithm is demonstrated on several image sequences of rigid and articulated bodies in motion}, keywords = {articulated bodies, camera image motion, camera image motions, CAMERAS, composite independent object, composite object estimation, Computer vision, Educational institutions, Image sequences, instantaneous flow measurements, Laboratories, Layout, Motion analysis, Motion estimation, motion trajectories, orthogonal flow bases, Principal component analysis, spatio-temporal flow models, tracking, Vehicles}, isbn = {0-7695-0164-8}, doi = {10.1109/ICCV.1999.791217}, author = {Yacoob,Yaser and Davis, Larry S.} } @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 {18478, title = {Exact solutions for the problem of source location from measured time differences of arrival}, journal = {The Journal of the Acoustical Society of America}, volume = {106}, year = {1999}, month = {1999///}, pages = {2277 - 2277}, author = {Duraiswami, Ramani and Zotkin,Dmitry N and Davis, Larry S.} } @conference {16174, title = {Excentric labeling: dynamic neighborhood labeling for data visualization}, 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 = {512 - 519}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {The widespread use of information visualization is hampered bythe lack of effective labeling techniques. An informal taxonomy of labeling methods is proposed. We then describe excentric labeling, a new dynamic technique to label a neighborhood of objects located around the cursor. This technique does not intrude into the existing interaction, it is not computationally intensive, and was easily applied to several visualization applications. A pilot study with eight subjects indicates a strong speed benefit over a zoom interface for tasks that involve the exploration of large numbers of objects. Observations and comments from users are presented. }, keywords = {dynamic labeling, Evaluation, label, Visualization}, isbn = {0-201-48559-1}, doi = {10.1145/302979.303148}, url = {http://doi.acm.org/10.1145/302979.303148}, author = {Fekete,Jean-Daniel and Plaisant, Catherine} } @article {18034, title = {Experiments with list ranking for Explicit Multi-Threaded (XMT) instruction parallelism}, journal = {Algorithm Engineering}, year = {1999}, month = {1999///}, pages = {43 - 59}, author = {Dascal,S. and Vishkin, Uzi} } @article {16971, title = {An Exploratory Study of Video Browsing, User Interface Designs and Research Methodologies: Effectiveness in Information Seeking Tasks}, journal = {PROCEEDINGS OF THE ANNUAL MEETING-AMERICAN SOCIETY FOR INFORMATION SCIENCE}, volume = {36}, year = {1999}, month = {1999///}, pages = {681 - 692}, abstract = {The purpose of this exploratory study is to develop research methods to compare the effectiveness of two video browsing interface designs, or surrogates one static (storyboard) and one dynamic (slide show) on two distinct information seeking tasks (gist determination and object recognition). Although video data is multimodal, potentially consisting of images, speech, sound, and text, the surrogates tested depend on image data only and use key frames or stills extracted from source video. A test system was developed to determine the effects of different key frame displays on user performance in specified information seeking tasks. The independent variables were interface display and task type. The dependent variables were task accuracy and subjective satisfaction. Covariates included spatial visual ability and time-to-completion. The study used a repeated block factorial 2x2 design; each of 20 participants interacted with all four interface-task combinations. No statistically significant results for task accuracy were found. Statistically significant differences were found, however, for user satisfaction with the display types: users assessed the static display to be "easier" to use than the dynamic display for both task types, even though there were no performance differences. This methodological approach provides a useful way to learn about the relationship between surrogate types and user tasks during video browsing.}, author = {Tse,T. and Vegh,S. and Shneiderman, Ben and Marchionini,G.} } @conference {14778, title = {Exposing Application Alternatives}, booktitle = {Distributed Computing Systems, International Conference on}, year = {1999}, month = {1999///}, pages = {0384 - 0384}, publisher = {IEEE Computer Society}, organization = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, abstract = {We present the design of an interface to allow applications to export tuning alternatives to a higher-level system. By exposing different parameters that can be changed at runtime, applications can be made to adapt to changes in their execution environment due to other programs, or the addition or deletion of nodes, communication links etc. An integral part of this interface is that an application not only expose its options, but also the resource utilization of each option and the effect that the option will have on the application{\textquoteright}s performance. We discuss how these options can be evaluated to tune the overall performance of a collection of applications in the system. Finally, we show preliminary results from a database application that is automatically reconfigured by the system from query shipping to data shipping based on the number of active clients.}, keywords = {computational grids, metacomputing, scheduling}, isbn = {0-7695-0222-9}, doi = {http://doi.ieeecomputersociety.org/10.1109/ICDCS.1999.776540}, author = {Keleher, Peter J. and Hollingsworth, Jeffrey K and Perkovic, Dejan} } @article {17122, title = {Educational Journeys on the Web Frontier}, journal = {Educom Review}, volume = {33}, year = {1998}, month = {1998///}, pages = {10 - 14}, author = {Shneiderman, Ben} } @article {14518, title = {Effect of acoustic radiation on the stability of spherical bubble oscillations}, journal = {Physics of Fluids}, volume = {10}, year = {1998}, month = {1998///}, pages = {1767 - 1767}, author = {Gumerov, Nail A.} } @article {14215, title = {Effects of Errors in the Viewing Geometry on Shape Estimation}, journal = {Computer Vision and Image Understanding}, volume = {71}, year = {1998}, month = {1998/09//}, pages = {356 - 372}, abstract = {A sequence of images acquired by a moving sensor contains information about the three-dimensional motion of the sensor and the shape of the imaged scene. Interesting research during the past few years has attempted to characterize the errors that arise in computing 3D motion (egomotion estimation) as well as the errors that result in the estimation of the scene{\textquoteright}s structure (structure from motion). Previous research is characterized by the use of optic flow or correspondence of features in the analysis as well as by the employment of particular algorithms and models of the scene in recovering expressions for the resulting errors. This paper presents a geometric framework that characterizes the relationship between 3D motion and shape in the presence of errors. We examine how the three-dimensional space recovered by a moving monocular observer, whose 3D motion is estimated with some error, is distorted. We characterize the space of distortions by its level sets, that is, we characterize the systematic distortion via a family of iso-distortion surfaces, which describes the locus over which the depths of points in the scene in view are distorted by the same multiplicative factor. The framework introduced in this way has a number of applications: Since the visible surfaces have positive depth (visibility constraint), by analyzing the geometry of the regions where the distortion factor is negative, that is, where the visibility constraint is violated, we make explicit situations which are likely to give rise to ambiguities in motion estimation, independent of the algorithm used. We provide a uniqueness analysis for 3D motion analysis from normal flow. We study the constraints on egomotion, object motion, and depth for an independently moving object to be detectable by a moving observer, and we offer a quantitative account of the precision needed in an inertial sensor for accurate estimation of 3D motion.}, isbn = {1077-3142}, doi = {10.1006/cviu.1997.0649}, url = {http://www.sciencedirect.com/science/article/pii/S1077314297906494}, author = {LoongFah Cheong and Ferm{\"u}ller, Cornelia and Aloimonos, J.} } @article {11952, title = {Effects of Errors in the Viewing Geometry on Shape Estimation* 1,* 2}, journal = {Computer Vision and Image Understanding}, volume = {71}, year = {1998}, month = {1998///}, pages = {356 - 372}, author = {Cheong, L. F and Ferm{\"u}ller, Cornelia and Aloimonos, J.} } @article {14895, title = {EFFICIENT DETERMINATION OF SHAPE FROM MULTIPLE IMAGES CONTAINING PARTIAL INFORMATION}, journal = {Pattern Recognition}, volume = {31}, year = {1998}, month = {1998/11//}, pages = {1691 - 1703}, abstract = {We consider the problem of reconstructing the shape of a 2-D object from multiple partial images related by scaled translations, in the presence of occlusion. Lindenbaum and Bruckstein have considered this problem in the specific case of a translating object seen by small sensors, for application to the understanding of insect vision. Their solution is limited by the fact that its run time is exponential in the number of images and sensors. We generalize the problem to allow for arbitrary types of occlusion of objects that translate and change scale. We show that this more general version of the problem can be solved in time that is polynomial in the number of sensors, but that even the original problem posed by Lindenbaum and Bruckstein is, in fact, NP-hard when the number of images is unbounded. Finally, we consider the case where the object is known to be convex. We show that Lindenbaum and Bruckstein{\textquoteright}s version of the problem is then efficiently solvable even when many images are used, as is the general problem in certain more restricted cases.}, keywords = {2-D shape recovery from multiple images, NP-complete, Shape recovery with occlusion}, isbn = {0031-3203}, doi = {10.1016/S0031-3203(98)00050-8}, url = {http://www.sciencedirect.com/science/article/pii/S0031320398000508}, author = {Basri,Ronen and GROVE,ADAM J. and Jacobs, David W.} } @article {15746, title = {Efficient Iterative Solution of the Three-Dimensional Helmholtz Equation}, journal = {Journal of Computational Physics}, volume = {142}, year = {1998}, month = {1998/05/01/}, pages = {163 - 181}, abstract = {We examine preconditioners for the discrete indefinite Helmholtz equation on a three-dimensional box-shaped domain with Sommerfeld-like boundary conditions. The preconditioners are of two types. The first is derived by discretization of a related continuous operator that differs from the original only in its boundary conditions. The second is derived by a block Toeplitz approximation to the descretized problem. The resulting preconditioning matrices allow the use of fast transform methods and differ from the discrete Helmholtz operator by an operator of low rank. We present experimental results demonstrating that when these methods are combined with Krylov subspace iteration, convergence rates depend only mildly on both the wave number and discretization mesh size. In addition, the methods display high efficiencies in an implementation on an IBM SP-2 parallel computer.}, isbn = {0021-9991}, doi = {10.1006/jcph.1998.5939}, url = {http://www.sciencedirect.com/science/article/pii/S0021999198959393}, author = {Elman, Howard and O{\textquoteright}Leary, Dianne P.} } @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 {17125, title = {Elastic windows: design, implementation, and evaluation of multi-window operations}, journal = {Software: Practice and Experience}, volume = {28}, year = {1998}, month = {1998/03/01/}, pages = {225 - 248}, abstract = {Most windowing systems follow the independent overlapping windows approach, which emerged as an answer to the needs of early computer users. Due to advances in computers, display technology, and increased information needs, modern users demand more functionality from window management systems. We propose Elastic Windows with improved spatial layout and rapid multi-window operations as an alternative to current window management strategies. In this approach, multi-window operations are achieved by issuing operations on window groups hierarchically organized in a space-filling tiled layout similar to TreeMaps.1 Sophisticated multi-window operations have been developed to handle fast task-switching and to structure the work environment of users to their rapidly changing needs. We claim that these multi-window operations and the tiled spatial layout dynamics decrease the cognitive load on users by decreasing the number of window operations. This paper describes the Elastic Windows interface in detail and then presents a user study conducted to compare the performance of 12 users with Elastic Windows and traditional Independent Overlapping Windows. User performance was measured in terms of task environment setup, switching, and task execution for 2, 6, and 12 window situations. Elastic Windows users had statistically significantly faster performance for all tasks in 6 and 12 window situations. These results suggest promising possibilities for multiple window operations and hierarchical nesting, which can be applied to the next generation of tiled as well as overlapped window managers. {\textcopyright} 1998 John Wiley \& Sons, Ltd.}, keywords = {hierarchical windows, multi-window operations, personal role management, window management, windowing system evaluation, World Wide Web}, isbn = {1097-024X}, doi = {10.1002/(SICI)1097-024X(199803)28:3<225::AID-SPE151>3.0.CO;2-D}, url = {http://onlinelibrary.wiley.com/doi/10.1002/(SICI)1097-024X(199803)28:3\%3C225::AID-SPE151\%3E3.0.CO;2-D/abstract}, author = {Kandogan,Eser and Shneiderman, Ben} } @article {17130, title = {Emergent patterns of teaching/learning in electronic classrooms}, journal = {Educational Technology Research and Development}, volume = {46}, year = {1998}, month = {1998///}, pages = {23 - 42}, abstract = {Novel patterns of teaching/learning have emerged from faculty and students who use our three teaching/learning theaters at the University of Maryland, College Park. These fully-equipped electronic classrooms have been used by 74 faculty in 264 semester-long courses since the fall of 1991 with largely enthusiastic reception by both faculty and students. The designers of the teaching/learning theaters sought to provide a technologically rich environment and a support staff so that faculty could concentrate on changing the traditional lecture from its unidirectional information flow to a more collaborative activity. As faculty have evolved their personal styles in using the electronic classrooms, novel patterns of teaching/learning have emerged. In addition to enhanced lectures, we identified three common patterns: (a) active individual learning, (b) small-group collaborative learning, and (c) entire-class collaborative learning.}, isbn = {1042-1629}, url = {http://dx.doi.org/10.1007/BF02299671}, author = {Shneiderman, Ben and Borkowski,Ellen and Alavi,Maryam and Norman,Kent} } @article {16964, title = {An Empirical Study of Perspective-Based Usability Inspection}, journal = {Proceedings of the Human Factors and Ergonomics Society Annual MeetingProceedings of the Human Factors and Ergonomics Society Annual Meeting}, volume = {42}, year = {1998}, month = {1998/10/01/}, pages = {1346 - 1350}, abstract = {Inspection is a fundamental means of achieving software usability. Past research showed that during usability inspection the success rate (percentage of problems detected) of each individual inspector was rather low. We developed perspective-based usability inspection, which divides the large variety of usability issues along different perspectives and focuses each inspection session on one perspective. We conducted a controlled experiment to study its effectiveness, using a post-test only control group experimental design, with 24 professionals as subjects. The control group used heuristic evaluation, which is the most popular technique for usability inspection. The experimental results are that 1) for usability problems covered by each perspective, the inspectors using that perspective had higher success rate than others; 2) for all usability problems, perspective inspectors had higher average success rate than heuristic inspectors; 3) for all usability problems, the union of three perspective inspectors (with one from each perspective) had higher average success rate than the union of three heuristic inspectors.}, isbn = {1071-1813,}, doi = {10.1177/154193129804201904}, url = {http://pro.sagepub.com/content/42/19/1346}, author = {Zhang,Zhijun and Basili, Victor R. and Shneiderman, Ben} } @article {17134, title = {Engagement Theory: A Framework for Technology-Based Teaching and Learning.}, journal = {Educational TechnologyEducational Technology}, volume = {38}, year = {1998}, month = {1998///}, pages = {20 - 23}, abstract = {Discusses engagement theory (students meaningfully engaged in learning activities through interaction with others and worthwhile tasks) and the three components, collaboration, project orientation, and authentic focus, and outlines research questions to establish its efficacy. (PEN)}, keywords = {Computer Uses in Education, Cooperation, Educational Technology, Educational Theories, Instructional Effectiveness, interaction, Learning Activities, Research Needs, Student Motivation, Student Projects, Teaching Methods}, isbn = {ISSN-0013-1962}, url = {http://www.eric.ed.gov/ERICWebPortal/detail?accno=EJ573955}, author = {Kearsley,Greg and Shneiderman, Ben} } @inbook {13763, title = {Enhancing Automatic Acquisition of Thematic Structure in a Large-Scale Lexicon for Mandarin Chinese}, booktitle = {Machine Translation and the Information SoupMachine Translation and the Information Soup}, series = {Lecture Notes in Computer Science}, volume = {1529}, year = {1998}, month = {1998///}, pages = {41 - 50}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {This paper describes a refinement to our procedure for porting lexical conceptual structure (LCS) into new languages. Specifically we describe a two-step process for creating candidate thematic grids for Mandarin Chinese verbs, using the English verb heading the VP in the subde_nitions to separate senses, and roughly parsing the verb complement structure to match thematic structure templates. We accomplished a substantial reduction in manual effort, without substantive loss. The procedure is part of a larger process of creating a usable lexicon for interlingual machine translation from a large on-line resource with both too much and too little information.}, isbn = {978-3-540-65259-5}, url = {http://dx.doi.org/10.1007/3-540-49478-2_4}, author = {Olsen,Mari and Dorr, Bonnie J and Thomas,Scott}, editor = {Farwell,David and Gerber,Laurie and Hovy,Eduard} } @article {16446, title = {Equal Time for Data on the Internet with WebSemantics}, journal = {Advances in Database Technology{\textemdash}EDBT{\textquoteright}98}, year = {1998}, month = {1998///}, pages = {87 - 87}, author = {Raschid,G. A.M.L and Tomasic,A.} } @conference {13765, title = {Evaluating Resources for Query Translation in Cross-Language Information Retrieval}, booktitle = {In Proceedings of the First International Conference on Language Resources and Evaluation}, year = {1998}, month = {1998///}, pages = {759 - 763}, abstract = {Our goal is to evaluate the utility of a lexical resource containing Lexical Conceptual Structures (LCS) for use in cross-language information retrieval. Our evaluation makes use of a combination of techniques from interlingual machine translation with conventional information retrieval techniques. Given a query in one language, we transform the query into the corresponding terms in a second language. Our focus is on the construction of disambiguated targetlanguage queries by using verb-based entries in our lexicon to construct Lexical Conceptual Structures. The main innovation of LCS-based query translation is that it provides a principled framework for controlling translation ambiguity in cross-language information retrieval applications. We evaluate this approach by comparing the resulting retrieval effectiveness with alternative techniques based that use offthe -shelf machine translation or translation knowledge extracted from machine readable dictionaries. We view this work as an important demonstration of techniques for evaluating the utility of alternative structures for multilingual lexicons in cross-language IR applications. In addition, this work provides a basis for measuring the extent to which disambiguation can enhance cross-language information retrieval effectiveness.}, author = {Dorr, Bonnie J and Oard, Douglas} } @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 {18391, title = {Experimental models for validating technology}, journal = {Computer}, volume = {31}, year = {1998}, month = {1998/05//}, pages = {23 - 31}, abstract = {Experimentation helps determine the effectiveness of proposed theories and methods. However, computer science has not developed a concise taxonomy of methods for demonstrating the validity of new techniques. Experimentation is a crucial part of attribute evaluation and can help determine whether methods used in accordance with some theory during product development will result in software being as effective as necessary. By looking at multiple examples of technology validation, the authors develop a taxonomy for software engineering experimentation that describes twelve different experimental approaches}, keywords = {attribute, development;software, engineering, engineering;, evaluation;computer, experimentation;technology, models;product, science;experimental, validation;product}, isbn = {0018-9162}, doi = {10.1109/2.675630}, author = {Zelkowitz, Marvin V and Wallace,D. R} } @conference {18036, title = {Explicit Multi-Threading (XMT) bridging models for instruction parallelism (extended abstract)}, booktitle = {Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures}, year = {1998}, month = {1998///}, pages = {140 - 151}, author = {Vishkin, Uzi and Dascal,S. and Berkovich,E. and Nuzman,J.} } @article {17595, title = {Explicit OR-dispersers with polylogarithmic degree}, journal = {Journal of the ACM (JACM)}, volume = {45}, year = {1998}, month = {1998/01//}, pages = {123 - 154}, abstract = {An (N, M, T)-OR-disperser is a bipartite multigraph G=(V, W, E) with |V| = N, and |W| = M, having the following expansion property: any subset of V having at least T vertices has a neighbor set of size at least M/2. For any pair of constants \&xgr;, \&lgr;, 1 >= \&xgr; > \&lgr; >= 0, any sufficiently large N, and for any T >= 2(logN) M <= 2(log N)\&lgr;, we give an explicit elementary construction of an (N, M, T)-OR-disperser such that the out-degree of any vertex in V is at most polylogarithmic in N. Using this with known applications of OR-dispersers yields several results. First, our construction implies that the complexity class Strong-RP defined by Sipser, equals RP. Second, for any fixed \&eegr; > 0, we give the first polynomial-time simulation of RP algorithms using the output of any {\textquotedblleft}\&eegr;-minimally random{\textquotedblright} source. For any integral R > 0, such a source accepts a single request for an R-bit string and generates the string according to a distribution that assigns probability at most 2-R\&eegr; to any string. It is minimally random in the sense that any weaker source is insufficient to do a black-box polynomial-time simulation of RP algorithms.}, keywords = {derandomization, expander graphs, explicit constructions, hardness of approximation, hashing lemmas, imperfect sources of randomness, measures of information, pseudo-random generators, randomized computation, time-space tradeoffs}, isbn = {0004-5411}, doi = {10.1145/273865.273915}, url = {http://doi.acm.org/10.1145/273865.273915}, author = {Saks,Michael and Srinivasan, Aravind and Zhou,Shiyu} } @article {16181, title = {Exploring LifeLines to Visualize Patient Records}, journal = {Technical Reports of the Computer Science Department}, year = {1998}, month = {1998/10/15/}, abstract = {LifeLines provide a general visualization environment for personalhistories. We explored its use for medical patient records. A one screen overview of the record using timelines provides direct access to the data. Problems, hospitalization and medications can be represented as horizontal lines, while icons represent discrete events such as physician consultations (and progress notes) or tests. Line color and thickness can illustrate relationships or significance. Techniques are described to display large records. Rescaling tools and filters allow users to focus on part of the information, revealing more details. Computerized medical records pose tremendous problems to system developers. Infrastructure and privacy issues need to be resolved before physicians can even start using the records. Non-intrusive hardware is required for physicians to do their work (i.e. interview patients) away from their desk and cumbersome workstations. But all the efforts to solve those problems will only succeed if appropriate attention is also given to the user interface design [1][8]. Long lists to scroll, clumsy search, endless menus and lengthy dialogs will lead to user rejection. But techniques are being developed to summarize, filter and present large amount of information, leading us to believe that rapid access to needed data is possible with careful design. While more attention is now put on developing standards for gathering medical records we found that very little effort had been made to design appropriate visualization and navigation techniques to present and explore personal history records. An intuitive approach to visualizing histories is to use graphical time series. The consistent, linear time scale allows comparisons and relations between the quantities displayed. Data can be graphed on the timeline to show time series of quantitative data. Highly interactive interfaces turn the display into a meaningfully structured menu with direct access to the data needed to review a problem or conduct the diagnosis. Also cross-referenced as CAR-TR-819 }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/455}, author = {Plaisant, Catherine and Rose,Anne} } @article {15367, title = {Extension of Spherical Harmonic Method to RF Transient Regime}, journal = {Simulation of semiconductor processes and devices 1998: SISPAD 98}, year = {1998}, month = {1998///}, pages = {42 - 42}, abstract = {The space and time dependent electron Boltzmann transport equation (BTE)is solved sclf-consistently with the Poisson and transient hole current-continuity equation. A transient Spherical Harmonic expansion method is used to solve the BTE. By this method we can efficiently solve the BTE in the RF regime to observe how the complete distribution function responds to a rapid transient. Calculations on a BJT, which give the time dependent distribution function over a large energy range 0-3eV, throughout the device, as well as average quantities, require only 40 minutes CPU time on an Alpha workstation. }, author = {Lin,C. K. and Goldsman,N. and Chang,C. H. and Mayergoyz, Issak D and Aronowitz,S. and Dong,J. and Belova,N.} } @article {17413, title = {The Eyes Have It: User Interfaces for Information Visualization}, journal = {Information Visualization}, volume = {1452}, year = {1998}, month = {1998///}, pages = {1519 - 1519}, author = {Shneiderman, Ben} } @article {18382, title = {Editorial: Evaluation and assessment in software engineering}, journal = {Information and Software Technology}, volume = {39}, year = {1997}, month = {1997///}, author = {Kitchenham,B. and Brereton,P. and Budgen,D. and Linkman,S. and Almstrum,V. L and Pfleeger,S. L and Zelkowitz, Marvin V and Wallace,D.} } @article {14473, title = {Effective redundant constraints for online scheduling}, journal = {PROCEEDINGS OF THE NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE}, year = {1997}, month = {1997///}, pages = {302 - 307}, abstract = {The use of heuristics as a means to improve constraint solverperformance has been researched widely. However, most work has been on problem-independent heuristics (e.g., vari- able and value ordering), and has focused on offline prob- lems (e.g., one-shot constraint satisfaction). In this paper, we present an online scheduling problem for which we are developing a real-time scheduling algorithm. While we can and do use generic heuristics in the scheduler, here we fo- cus on the use of domain-specific redundant constraints to ef- fectively approximate optimal offline solutions. We present a taxonomy of redundant domain constraints, and examine their impact on the effectiveness of the scheduler. We also describe several techniques for generating redundant con- straints, which can be applied to a large class of job shop scheduling problems. }, author = {Getoor, Lise and Ottosson,G. and Fromherz,M. and Carlson,B.} } @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 {17901, title = {Efficient triangle strips for fast rendering}, journal = {ACM Transactions on Graphics}, year = {1997}, month = {1997///}, author = {Evans,F. and Skiena,S. and Varshney, Amitabh} } @conference {17124, title = {Elastic Windows: a hierarchical multi-window World-Wide Web browser}, booktitle = {Proceedings of the 10th annual ACM symposium on User interface software and technology}, year = {1997}, month = {1997///}, pages = {169 - 177}, author = {Kandogan,E. and Shneiderman, Ben} } @conference {17126, title = {Elastic Windows: evaluation of multi-window operations}, booktitle = {Proceedings of the SIGCHI conference on Human factors in computing systems}, year = {1997}, month = {1997///}, pages = {250 - 257}, author = {Kandogan,E. and Shneiderman, Ben} } @article {16569, title = {Emergence of self-replicating structures in cellular automata space}, journal = {Physica D}, volume = {110}, year = {1997}, month = {1997///}, pages = {252 - 276}, author = {Reggia, James A. and Chou,H. H.} } @article {17934, title = {Enabling virtual reality for large-scale mechanical CAD datasets}, journal = {Proceedings of ASME Design Engineering Technical Conferences, Sept}, volume = {14}, year = {1997}, month = {1997///}, pages = {17 - 17}, abstract = {Reconciling scene realism with interactivity has emerged asone of the most important areas in making virtual reality fea- sible for large-scale mechanical CAD datasets consisting of sev- eral millions of primitives. This paper surveys our research and related work for achieving interactivity without sacrificing real- ism in virtual reality walkthroughs and flythroughs of polygonal CAD datasets. We outline our recent work on efficient genera- tion of triangle strips from polygonal models that takes advan- tage of compression of connectivity information. This results in substantial savings in rendering, transmission, and storage. We outline our work on genus-reducing simplifications as well as real-time view-dependent simplifications that allow on-the-fly selection amongst multiple levels of detail, based upon lighting and viewing parameters. Our method allows multiple levels of detail to coexist on the same object at different regions and to merge seamlessly without any cracks or shading artifacts. We also present an overview of our work on hardware-assisted image- based rendering that allows interactive exploration of computer- generated scenes. }, author = {Varshney, Amitabh and El-Sana,J. and Evans,F. and Darsa,L. and Costa,B. and Skiena,S.} } @article {16701, title = {Evaluating multilingual gisting of Web pages}, volume = {SS-97-02}, year = {1997}, month = {1997///}, institution = {Association for the Advancement of Artificial Intelligence}, author = {Resnik, Philip} } @article {13023, title = {The evolution of plant nuclear genes}, journal = {Proc Natl Acad Sci USA}, volume = {94}, year = {1997}, month = {1997/07//}, pages = {7791 - 7798}, abstract = {We analyze the evolutionary dynamics of three of the best-studied plant nuclear multigene families. The data analyzed derive from the genes that encode the small subunit of ribulose-1,5-bisphosphate carboxylase (rbcS), the gene family that encodes the enzyme chalcone synthase (Chs), and the gene family that encodes alcohol dehydrogenases (Adh). In addition, we consider the limited evolutionary data available on plant transposable elements. New Chs and rbcS genes appear to be recruited at about 10 times the rate estimated for Adh genes, and this is correlated with a much smaller average gene family size for Adh genes. In addition, duplication and divergence in function appears to be relatively common for Chs genes in flowering plant evolution. Analyses of synonymous nucleotide substitution rates for Adh genes in monocots reject a linear relationship with clock time. Replacement substitution rates vary with time in a complex fashion, which suggests that adaptive evolution has played an important role in driving divergence following gene duplication events. Molecular population genetic studies of Adh and Chs genes reveal high levels of molecular diversity within species. These studies also reveal that inter- and intralocus recombination are important forces in the generation allelic novelties. Moreover, illegitimate recombination events appear to be an important factor in transposable element loss in plants. When we consider the recruitment and loss of new gene copies, the generation of allelic diversity within plant species, and ectopic exchange among transposable elements, we conclude that recombination is a pervasive force at all levels of plant evolution.}, author = {Clegg,M. T and Cummings, Michael P. and Durbin,M. L} } @article {16297, title = {An experiment to assess the cost-benefits of code inspections in large scale software development}, journal = {IEEE Transactions on Software Engineering}, volume = {23}, year = {1997}, month = {1997/06//}, pages = {329 - 346}, abstract = {We conducted a long term experiment to compare the costs and benefits of several different software inspection methods. These methods were applied by professional developers to a commercial software product they were creating. Because the laboratory for this experiment was a live development effort, we took special care to minimize cost and risk to the project, while maximizing our ability to gather useful data. The article has several goals: (1) to describe the experiment{\textquoteright}s design and show how we used simulation techniques to optimize it; (2) to present our results and discuss their implications for both software practitioners and researchers; and (3) to discuss several new questions raised by our findings. For each inspection, we randomly assigned three independent variables: (1) the number of reviewers on each inspection team (1, 2, or 4); (2) the number of teams inspecting the code unit (1 or 2); and (3) the requirement that defects be repaired between the first and second team{\textquoteright}s inspections. The reviewers for each inspection were randomly selected without replacement from a pool of 11 experienced software developers. The dependent variables for each inspection included inspection interval (elapsed time), total effort, and the defect detection rate. Our results showed that these treatments did not significantly influence the defect detection effectiveness, but that certain combinations of changes dramatically increased the inspection interval}, keywords = {Analysis of variance, code inspection cost benefits, code unit, commercial software product, Computer Society, cost-benefit analysis, Costs, defect detection effectiveness, defect detection rate, Design optimization, experienced software developers, experiment design, independent variables, Inspection, inspection interval, inspection team, Laboratories, large scale software development, Large-scale systems, live development effort, long term experiment, professional aspects, professional developers, Programming, reviewers, simulation techniques, software cost estimation, software inspection methods, software practitioners, Software quality, Switches}, isbn = {0098-5589}, doi = {10.1109/32.601071}, author = {Porter, Adam and Siy,H. P and Toman,C. A and Votta,L. G.} } @article {18392, title = {Experimental validation in software engineering}, journal = {Information and Software Technology}, volume = {39}, year = {1997}, month = {1997///}, pages = {735 - 743}, abstract = {Although experimentation is an accepted approach toward scientific validation in most scientific disciplines, it only recently has gained acceptance within the software development community. In this paper we discuss a 12-model classification scheme for performing experimentation within the software development domain. We evaluate over 600 published papers in the computer science literature and over one hundred papers from other scientific disciplines in order to determine: (1) how well the computer science community is succeeding at validating its theories, and (2) how computer science compares to other scientific disciplines.}, keywords = {data collection, Evaluation, experimentation, measurement}, isbn = {0950-5849}, doi = {10.1016/S0950-5849(97)00025-6}, url = {http://www.sciencedirect.com/science/article/pii/S0950584997000256}, author = {Zelkowitz, Marvin V and Wallace,Dolores} } @conference {13552, title = {Extracting Features for Indexing MPEG-Compressed Video}, booktitle = {Proceedings of the IEEEFirst Workshop on Multimedia Signal Processing}, year = {1997}, month = {1997///}, pages = {337 - 342}, author = {Kobla,V. and David Doermann} } @article {12066, title = {Early detection of independent motion from active control of normal image flow patterns}, journal = {Systems, Man, and Cybernetics, Part B: Cybernetics, IEEE Transactions on}, volume = {26}, year = {1996}, month = {1996///}, pages = {42 - 52}, author = {Sharma, R. and Aloimonos, J.} } @conference {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} } @article {16546, title = {Effects of varying parameters on properties of self-organizing feature maps}, journal = {Neural Processing Letters}, volume = {4}, year = {1996}, month = {1996///}, pages = {53 - 59}, author = {Cho,S. and Jang,M. and Reggia, James A.} } @conference {14956, title = {Efficient algorithms for estimating atmospheric parameters for surface reflectance retrieval}, booktitle = {Parallel Processing, 1996., Proceedings of the 1996 International Conference on}, volume = {2}, year = {1996}, month = {1996/08//}, pages = {132 -141 vol.2 - 132 -141 vol.2}, abstract = {The objective of atmospheric correction is to retrieve the surface reflectance from remotely sensed imagery by removing the atmospheric effects. We introduce an efficient algorithm to estimate the optical characteristics of the TM imagery and to remove the atmospheric effects from it. Our algorithm introduces a set of techniques to significantly improve the quality of the retrieved images. We pay a particular attention to the computational efficiency of the algorithm thereby allowing us to correct large TM images quite fast. We also provide a parallel implementation of our algorithm and show its portability and scalability on several parallel machines}, keywords = {Atmospheric, correction;atmospheric, effects;atmospheric, imagery;scalability;surface, parameters;portability;remotely, reconstruction;photoreflectance;remote, reflectance, reflectance;surface, retrieval;image, sensed, sensing;}, doi = {10.1109/ICPP.1996.537392}, author = {Fallah-Adl,H. and JaJa, Joseph F. and Liang,Shunlin} } @conference {18038, title = {Efficient approximate and dynamic matching of patterns using a labeling paradigm}, booktitle = {Foundations of Computer Science, 1996. Proceedings., 37th Annual Symposium on}, year = {1996}, month = {1996/10//}, pages = {320 - 328}, abstract = {A key approach in string processing algorithmics has been the labeling paradigm which is based on assigning labels to some of the substrings of a given string. If these labels are chosen consistently, they can enable fast comparisons of substrings. Until the first optimal parallel algorithm for suffix tree construction was given by the authors in 1994 the labeling paradigm was considered not to be competitive with other approaches. They show that this general method is also useful for several central problems in the area of string processing: approximate string matching, dynamic dictionary matching, and dynamic text indexing. The approximate string matching problem deals with finding all substrings of a text which match a pattern ldquo;approximately rdquo;, i.e., with at most m differences. The differences can be in the form of inserted, deleted, or replaced characters. The text indexing problem deals with finding all occurrences of a pattern in a text, after the text is preprocessed. In the dynamic text indexing problem, updates to the text in the form of insertions and deletions of substrings are permitted. The dictionary matching problem deals with finding all occurrences of each pattern set of a set of patterns in a text, after the pattern set is preprocessed. In the dynamic dictionary matching problem, insertions and deletions of patterns to the pattern set are permitted}, keywords = {algorithm;replaced, algorithmics;substrings;suffix, algorithms;pattern, approximate, characters;dynamic, characters;labeling, characters;string, complexity;indexing;parallel, construction;computational, data, dictionary, dynamic, indexing;efficient, matching;deleted, matching;dynamic, matching;efficient, matching;inserted, matching;string, matching;tree, paradigm;optimal, Parallel, pattern, PROCESSING, string, structures;, text, tree}, doi = {10.1109/SFCS.1996.548491}, author = {Sahinalp,S. C and Vishkin, Uzi} } @article {16379, title = {Efficient distribution analysis via graph contraction}, journal = {Languages and Compilers for Parallel Computing}, year = {1996}, month = {1996///}, pages = {377 - 391}, author = {Sheffler,T. and Schreiber,R. and Pugh, William and Gilbert,J. and Chatterjee,S.} } @article {12831, title = {Efficient local model-checking for fragments of the modal $\mu$-calculus}, journal = {Tools and Algorithms for the Construction and Analysis of Systems}, year = {1996}, month = {1996///}, pages = {107 - 126}, author = {Bhat,G. and Cleaveland, Rance} } @conference {12799, title = {Efficient model checking via the equational μ-calculus}, booktitle = {, Eleventh Annual IEEE Symposium on Logic in Computer Science, 1996. LICS {\textquoteright}96. Proceedings}, year = {1996}, month = {1996/07/27/30}, pages = {304 - 312}, publisher = {IEEE}, organization = {IEEE}, abstract = {This paper studies the use of an equational variant of the modal μ-calculus as a unified framework for efficient temporal logic model checking. In particular we show how an expressive temporal logic, CTL*, may be efficiently translated into the μ-calculus. Using this translation, one may then employ μ-calculus model-checking techniques, including on-the-fly procedures, BDD-based algorithms and compositional model-checking approaches, to determine if systems satisfy formulas in CTL*}, keywords = {Automata, BDD-based algorithms, Boolean functions, Calculus, compositional model-checking approaches, computational complexity, Computer science, CTL*, Data structures, Encoding, equational variant, equational μ-calculus, Equations, expressive temporal logic, Logic, Maintenance, modal μ-calculus, Model checking, on-the-fly procedures, Surges, temporal logic, temporal logic model checking, unified framework}, isbn = {0-8186-7463-6}, doi = {10.1109/LICS.1996.561358}, author = {Bhat,G. and Cleaveland, Rance} } @conference {17127, title = {Elastic windows: improved spatial layout and rapid multiple window operations}, booktitle = {Proceedings of the workshop on Advanced visual interfaces}, series = {AVI {\textquoteright}96}, year = {1996}, month = {1996///}, pages = {29 - 38}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Most windowing systems follow the independent overlapping windows approach, which emerged as an answer to the needs of the 80s{\textquoteright} application and technology. Advances in computers, display technology, and the applications demand more functionality from window management systems. Based on these changes and the problems of current windowing appraoches, we have updated the requirements for multiwindow systems to guide new methods of window management. We propose elastic windows with improved spatial layout and rapid multi-window operations. Multi-window operations are achieved by issuing operations on window groups hierachically organized in a space-filling tiled layout. Sophisticated multi-window operations and spatial layout dynamics helps users to handle fast task-switching and to structure thier work environment to their rapidly changing needs. We claim that these multi-window operations and the improved spatial layout decrease the cognitive load on users. Users found our prototype system to be comprehensible and enjoyable as they playfully explored the way multiple windows are reshaped.}, keywords = {CAD, elastic windows, multi-window operations, personal role manager, programming environment, task switching, window manager}, isbn = {0-89791-834-7}, doi = {10.1145/948449.948454}, url = {http://doi.acm.org/10.1145/948449.948454}, author = {Kandogan,Eser and Shneiderman, Ben} } @conference {16319, title = {An empirical exploration of code evolution}, booktitle = {International Workshop on Empirical Studies of Software Maintenance}, year = {1996}, month = {1996///}, author = {Karr,A. and Porter, Adam and Votta,L.} } @article {18438, title = {The empirical investigation of Perspective-Based Reading}, journal = {Empirical Software Engineering}, volume = {1}, year = {1996}, month = {1996///}, pages = {133 - 164}, abstract = {We consider reading techniques a fundamental means of achieving high quality software. Due to the lack of research in this area, we are experimenting with the application and comparison of various reading techniques. This paper deals with our experiences with a family of reading techniques known as Perspective-Based Reading (PBR), and its application to requirements documents. The goal of PBR is to provide operational scenarios where members of a review team read a document from a particular perspective, e.g., tester, developer, user. Our assumption is that the combination of different perspectives provides better coverage of the document, i.e., uncovers a wider range of defects, than the same number of readers using their usual technique.}, keywords = {Computer, Science}, isbn = {1382-3256}, url = {http://dx.doi.org/10.1007/BF00368702}, author = {Basili, Victor R. and Green,Scott and Laitenberger,Oliver and Lanubile,Filippo and Shull, Forrest and S{\o}rumg{\r a}rd,Sivert and Zelkowitz, Marvin V} } @article {18644, title = {Estimation of time-dependent coverage}, volume = {96466}, year = {1996}, month = {1996///}, institution = {LAAS-CNRS: Laboratory for analysis and architecture of systems}, address = {Toulouse, France}, abstract = {It is well-known that the dependability that can be achieved by a fault-tolerant systemis particularly sensitive to both the asymptotic value of coverage and to the time distribution of coverage. However, most previous work on coverage evaluation by statistical processing of the results of fault-injection experiments has only been concerned with estimating asymptotic coverage. In this paper, we tackle the problem of estimating the parameters of models that also account for coverage latency. After discussing some data sets resulting from fault-injection experiments on practical systems, we propose a series of coverage latency models that might be considered to account for the observed phenomena in a system dependability evaluation. We consider both exponential and non-exponential models, and assess their pertinence by means of a sensitivity study. We confirm previous results that latency can have an extremely important effect on the achievable dependability. We also show that the shape of the latency distribution has only a minor impact in the practical case of systems with high asymptotic coverage. A simple action model based on an exponential latency distribution is therefore proposed. We show how worst-case confidence limits can be obtained for the parameters of this action model and study the effects of data truncation that are unavoidable in any practical measurements of latency. We conclude by a critical assessment of the proposed estimation technique and a demonstration of its application to practical data sets. }, url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.48.8253\&rep=rep1\&type=pdf}, author = {Arlat,D. P. M. C. J. and Crouzet,Y.} } @article {16310, title = {Evaluating workflow and process automation in wide-area software development}, journal = {Software Process Technology}, year = {1996}, month = {1996///}, pages = {188 - 193}, author = {Perry,D. and Porter, Adam and Votta,L. and Wade,M.} } @article {12994, title = {Evolutionary biology of parasitic platyhelminths: The role of molecular phylogenetics}, journal = {Parasitol Today}, volume = {12}, year = {1996}, month = {1996/02//}, pages = {66 - 71}, abstract = {As our appreciation of the diversity within the flatworms has grown, so too has our curiosity about the ways in which these varied creatures are related to one another. In particular, the parasitic groups (trematodes, cestodes and monogeneans have been the focus of enquiry. Until recently, morphology, anatomy and life histories have provided the raw data for building hypotheses on relationships. Now, ultrastructural evidence, and most recently, molecular data from nucleic acid sequences, have been brought to bear on the topic. Here, David Blair, Andr{\'e}s Campos, Michael Cummings and Juan Pedro Laclette discuss the ways in which molecular data, in particular, are helping us recognize the various lineages of flatworms.}, author = {Blair,D and Campos,A. and Cummings, Michael P. and Laclette,J. P} } @article {18390, title = {Experimental models for software diagnosis}, journal = {NIST IR}, volume = {5889}, year = {1996}, month = {1996///}, abstract = {Experimentation and data collection are becoming accepted practices within the software en-gineering community to determine the e ectiveness of various software development practices. However, there is wide disagreement as to exactly what the term \experimentation" means in this domain. It is important that we understand this concept and identify how we can best collect data needed to validate software methods that are e ective. This understanding will provide a basis for improved technical exchange of information between scientists and engineers within the software community. }, author = {Zelkowitz, Marvin V and Wallace,D.} } @article {14216, title = {Explaining Human Visual Space Distortion.}, year = {1996}, month = {1996///}, institution = {Computer Vision Lab, University of Maryland College Park}, abstract = {A number of experiments have recently been conducted to compare aspects of depth judgment due to stereoscopic and monocular motion perception. In these experiments, it has been shown that from stereo vision humans over-estimate depth (relative to fronto-parallel size) at near fixations and under-estimate it at far fixations, whereas human depth estimates from visual motion are not affected by the fixation point. On the other hand, the orientation of an object in space does not affect depth judgment in stereo vision while it has a strong effect in motion vision, for the class of motions tested. This paper develops a computational geometric model that explains why such distortion might take place. The basic idea is that, both in stereo and motion, we perceive the world from multiple views. Given the rigid transformation between the views and the properties of the image correspondence, the depth of the scene can be obtained. Even a slight error in the rigid transformation parameters causes distortion of the computed depth of the scene. The unified framework introduced here describes this distortion in computational terms, in order to explain a number of recent psychophysical experiments on the perception of depth from motion or stereo.}, author = {Ferm{\"u}ller, Cornelia} } @conference {17551, title = {An extension of the Lov{\'a}sz Local Lemma, and its applications to integer programming}, booktitle = {Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms}, series = {SODA {\textquoteright}96}, year = {1996}, month = {1996///}, pages = {6 - 15}, publisher = {Society for Industrial and Applied Mathematics}, organization = {Society for Industrial and Applied Mathematics}, address = {Philadelphia, PA, USA}, isbn = {0-89871-366-8}, url = {http://dl.acm.org/citation.cfm?id=313852.313866}, author = {Srinivasan, Aravind} } @conference {17412, title = {The eyes have it: a task by data type taxonomy for information visualizations}, booktitle = {, IEEE Symposium on Visual Languages, 1996. Proceedings}, year = {1996}, month = {1996/09/03/6}, pages = {336 - 343}, publisher = {IEEE}, organization = {IEEE}, abstract = {A useful starting point for designing advanced graphical user interfaces is the visual information seeking Mantra: overview first, zoom and filter, then details on demand. But this is only a starting point in trying to understand the rich and varied set of information visualizations that have been proposed in recent years. The paper offers a task by data type taxonomy with seven data types (one, two, three dimensional data, temporal and multi dimensional data, and tree and network data) and seven tasks (overview, zoom, filter, details-on-demand, relate, history, and extracts)}, keywords = {advanced graphical user interface design, Art, data mining, data type taxonomy, data visualisation, Data visualization, Displays, Eyes, Graphical user interfaces, Information filtering, Information filters, information visualizations, multi dimensional data, Multimedia databases, network data, Taxonomy, visual databases, visual information seeking, visual programming}, isbn = {0-8186-7508-X}, doi = {10.1109/VL.1996.545307}, author = {Shneiderman, Ben} } @conference {14955, title = {Efficient Algorithms for Atmospheric Correction of Remotely Sensed Data}, booktitle = {Supercomputing, 1995. Proceedings of the IEEE/ACM SC95 Conference}, year = {1995}, month = {1995///}, pages = {12 - 12}, abstract = {Remotely sensed imagery has been used for developing and validating various studies regarding land cover dynamics. However, the large amounts of imagery collected by the satellites are largely contaminated by the effects of atmospheric particles. The objective of atmospheric correction is to retrieve the surface reflectance from remotely sensed imagery by removing the atmospheric effects. We introduce a number of computational techniques that lead to a substantial speedup of an atmospheric correction algorithm based on using look-up tables. Excluding I/O time, the previous known implementation processes one pixel at a time and requires about 2.63 seconds per pixel on a SPARC-10 machine, while our implementation is based on processing the whole image and takes about 4-20 microseconds per pixel on the same machine. We also develop a parallel version of our algorithm that is scalable in terms of both computation and I/O. Experimental results obtained show that a Thematic Mapper (TM) image (36 MB per band, 5 bands need to be corrected) can be handled in less than 4.3 minutes on a 32-node CM-5 machine, including I/O time.}, keywords = {Atmospheric, AVHRR;, computing;, correction;, high, I/O;, Parallel, performance, processing;, remote, scalable, sensing;, TM;}, doi = {10.1109/SUPERC.1995.242453}, author = {Fallah-Adl,H. and JaJa, Joseph F. and Liang,Shunlin and Kaufman,Y.J. and Townshend,J.} } @article {14958, title = {Efficient image processing algorithms on the scan line array processor}, journal = {Pattern Analysis and Machine Intelligence, IEEE Transactions on}, volume = {17}, year = {1995}, month = {1995/01//}, pages = {47 - 56}, abstract = {Develops efficient algorithms for low and intermediate level image processing on the scan line array processor, a SIMD machine consisting of a linear array of cells that processes images in a scan line fashion. For low level processing, the authors present algorithms for block DFT, block DCT, convolution, template matching, shrinking, and expanding which run in real-time. By real-time, the authors mean that, if the required processing is based on neighborhoods of size m times;m, then the output lines are generated at a rate of O(m) operations per line and a latency of O(m) scan lines, which is the best that can be achieved on this model. The authors also develop an algorithm for median filtering which runs in almost real-time at a cost of O(m log m) time per scan line and a latency of [m/2] scan lines. For intermediate level processing, the authors present optimal algorithms for translation, histogram computation, scaling, and rotation. The authors also develop efficient algorithms for labelling the connected components and determining the convex hulls of multiple figures which run in O(n log n) and O(n log2n) time, respectively. The latter algorithms are significantly simpler and easier to implement than those already reported in the literature for linear arrays}, keywords = {algorithms;, algorithms;intermediate, algorithms;rotation;scaling;scan, array, computation;image, DCT;block, DFT;convex, filtering;optimal, hulls;convolution;expanding;histogram, level, line, machine;block, matching;translation;convolution;image, PROCESSING, processing;labelling;low, processing;median, processing;parallel, processor;shrinking;template, SIMD}, isbn = {0162-8828}, doi = {10.1109/34.368153}, author = {Helman,D. and JaJa, Joseph F.} } @conference {12787, title = {Efficient on-the-fly model checking for CTL}, booktitle = {, Tenth Annual IEEE Symposium on Logic in Computer Science, 1995. LICS {\textquoteright}95. Proceedings}, year = {1995}, month = {1995/06/26/29}, pages = {388 - 397}, publisher = {IEEE}, organization = {IEEE}, abstract = {This paper gives an on-the-fly algorithm for determining whether a finite-state system satisfies a formula in the temporal logic CTL. The time complexity of our algorithm matches that of the best existing {\textquotedblleft}global algorithm{\textquotedblright} for model checking in this logic, and it performs as well as the best known global algorithms for the sublogics CTL and LTL. In contrast with these approaches, however, our routine constructs the state space of the system under consideration in a need-driven fashion and will therefore perform better in practice}, keywords = {Algorithm design and analysis, Automata, computational complexity, Computer science, CTL, Encoding, finite automata, finite-state system, global algorithm, Logic, LTL, on-the-fly model checking, Performance analysis, Safety, State-space methods, sublogic, temporal logic, time complexity}, isbn = {0-8186-7050-9}, doi = {10.1109/LICS.1995.523273}, author = {Bhat,G. and Cleaveland, Rance and Grumberg,O.} } @article {13762, title = {Efficient parsing for Korean and English: A parameterized message-passing approach}, journal = {Computational Linguistics}, volume = {21}, year = {1995}, month = {1995///}, pages = {255 - 263}, author = {Dorr, Bonnie J and Lee,J. and Lin,D. and Suh,S.} } @article {14963, title = {Enhancing LZW Coding Using a Variable-Length Binary Encoding}, volume = {ISR-TR-1995-70}, year = {1995}, month = {1995///}, institution = {Institute for Systems Research, University of Maryland, College Park}, abstract = {We present here a methodology to enhance the LZW coding for text compression using a variable-length binary encoding scheme. The basic principle of this encoding is based on allocating a set of prefix codes to a set of integers growing dynamically. The prefix property enables unique decoding of a string of elements from this set. We presented the experimental results to show the effectiveness of this variable-length binary encoding scheme.}, keywords = {algorithms, data compression, Systems Integration Methodology}, url = {http://drum.lib.umd.edu/handle/1903/5654}, author = {Acharya,Tinku and JaJa, Joseph F.} } @article {18745, title = {Estimation of setup time for machined parts: accounting for work-holding constraints using a vise}, journal = {COMPUTERS IN ENGINEERING}, year = {1995}, month = {1995///}, pages = {619 - 632}, abstract = {For machined parts, setup time is a major component ofthe total time required to manufacture a machined part from a stock. If the number of setups and hence setup time can be reduced, this will not only decrease the manufacturing time, but will also ensure better machining accuracy, require fewer work-holding devices and increase machine usage time. To achieve any improvement in setup time, rst we need to estimate the setup time accurately. In this paper we pro- pose a methodology to estimate the setup time for machin- ing prismatic parts in a three axis vertical machining center. We concurrently consider three major factors for estimating the number of setups, namely|the precedence constraints among machining operations, the feasibility of work holding using vise clamping, and the availability of datum faces for locating the workpiece on the machine table during machin- ing on a 3 axis vertical machining center. }, url = {http://www.cs.umd.edu/~nau/papers/das1995estimation.pdf}, author = {Das,D. and Gupta,S.K. and Nau, Dana S.} } @conference {15649, title = {Euclidean spanners: short, thin, and lanky}, booktitle = {Proceedings of the twenty-seventh annual ACM symposium on Theory of computing}, series = {STOC {\textquoteright}95}, year = {1995}, month = {1995///}, pages = {489 - 498}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, isbn = {0-89791-718-9}, doi = {10.1145/225058.225191}, url = {http://doi.acm.org/10.1145/225058.225191}, author = {Arya,Sunil and Das,Gautam and Mount, Dave and Salowe,Jeffrey S. and Smid,Michiel} } @article {17142, title = {Evaluating Spatial and Textual Style of Displays}, journal = {Institute for Systems Research Technical Reports}, year = {1995}, month = {1995///}, abstract = {The next generation of Graphic User Interfaces (GUIs) will offer rapid access to perceptually-rich, information abundant, and cognitively consistent interfaces. These new GUIs will be subjected to usability tests and expert reviews, plus new analysis methods and novel metrics to help guide designers. We have developed and tested first generation concordance tools to help developers to review terminology, capitalization, and abbreviation. We have also developed a dialog box summary table to help developers spot patterns and identify possible inconsistencies in layout, color fonts, font size, font style, and ordering of widgets. In this study we also explored the use of metrics such as widget counts, balance, alignment, density, and aspect ratios to provide further clues about where redesigns might be appropriate. Preliminary experience with several commercial projects is encouraging.}, keywords = {human-computer interaction, Systems Integration Methodology}, url = {http://drum.lib.umd.edu/handle/1903/5639}, author = {Shneiderman, Ben and Chimera,Richard and Jog,Ninog and Stimart,Ren and White,David} } @article {13434, title = {Evaluation and selection of biases in machine learning}, journal = {Machine Learning}, volume = {20}, year = {1995}, month = {1995///}, pages = {5 - 22}, abstract = {In this introduction, we define the term bias as it is used in machine learning systems. We motivate the importance of automated methods for evaluating and selecting biases using a framework of bias selection as search in bias and meta-bias spaces. Recent research in the field of machine learning bias is summarized.}, isbn = {0885-6125}, url = {http://dx.doi.org/10.1007/BF00993472}, author = {Gordon,Diana F. and desJardins, Marie} } @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.} } @conference {16318, title = {Experimental software engineering: A report on the state of the art}, booktitle = {INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING}, volume = {17}, year = {1995}, month = {1995///}, pages = {277 - 277}, author = {Votta,L. G. and Porter, Adam and Perry,D.} } @article {15926, title = {Explicitly Biased Generalization}, journal = {Goal-Driven Learning}, year = {1995}, month = {1995///}, pages = {321 - 354}, author = {Gordon,D. and Perlis, Don} } @article {18831, title = {Extracting alternative machining features: An algorithmic approach}, journal = {Research in Engineering Design}, volume = {7}, year = {1995}, month = {1995///}, pages = {173 - 192}, abstract = {Automated recognition of features from CAD models has been attempted for a wide range of application domains. In this article we address the problem of representing and recognizing a complete class of features in alternative interpretation for a given design.}, keywords = {engineering}, isbn = {0934-9839}, doi = {10.1007/BF01638098}, url = {http://www.springerlink.com/content/t271m7t670m36484/abstract/}, author = {Regli,William C. and Gupta, Satyandra K. and Nau, Dana S.} } @article {17120, title = {Education by engagement and construction: Can distance learning be better than face-to-face}, journal = {Unpublished manuscript, University of Maryland, College Park}, year = {1994}, month = {1994///}, abstract = {This essay describes an emerging theory of "education by engagement and construction," in which students work in teams to create ambitious projects with results that are presented to someone other than the professor. The video shows how a distance learning Graduate Computer Science Seminar titled "Virtual Reality, Telepresence and Beyond" was conducted according to this theory. The intense interactions by satellite TV and electronic mail may have created a greater sense of interaction and intimacy among the students than many face-to-face courses. (Video available as part of the HCIL 1994 Video Reports, contact hcil-info@cs.umd.edu for ordering information)}, author = {Shneiderman, Ben} } @article {16553, title = {Effects of normalization constraints on competitive learning}, journal = {Neural Networks, IEEE Transactions on}, volume = {5}, year = {1994}, month = {1994///}, pages = {502 - 504}, author = {Sutton,G. G and Reggia, James A.} } @article {14940, title = {An efficient parallel algorithm for the single function coarsest partition problem}, journal = {Theoretical computer science}, volume = {129}, year = {1994}, month = {1994///}, pages = {293 - 307}, abstract = {We describe an efficient parallel algorithm to solve the single function coarsest partition problem. The algorithm runs in O(log n) time using O(n log log n) operations on the arbitrary CRCW PRAM. The previous best-known algorithms run in O(log2 n) time using O(n log2 n) operations on the CREW PRAM, and O(log n) time using O(n log n) operations on the arbitrary CRCW PRAM. Our solution is based on efficient algorithms for solving several subproblems that are of independent interest. In particular, we present efficient parallel algorithms to find a minimal starting point of a circular string with respect to lexicographic ordering and to sort lexicographically a list of strings of different lengths}, author = {JaJa, Joseph F. and Ryu,K. W.} } @conference {17896, title = {Efficient runtime support for parallelizing block structured applications}, booktitle = {Scalable High-Performance Computing Conference, 1994., Proceedings of the}, year = {1994}, month = {1994/05//}, pages = {158 - 167}, abstract = {Scientific and engineering applications often involve structured meshes. These meshes may be nested (for multigrid codes) and/or irregularly coupled (called multiblock or irregularly coupled regular mesh problems). We describe a runtime library for parallelizing these applications on distributed memory parallel machines in an efficient and machine-independent fashion. This runtime library is implemented on several different systems. This library can be used by application programmers to port applications by hand and can also be used by a compiler to handle communication for these applications. Our experimental results show that our primitives have low runtime communication overheads. We have used this library to port a multiblock template and a multigrid code. Effort is also underway to port a complete multiblock computational fluid dynamics code using our library}, keywords = {application programmers, block structured applications, distributed memory parallel machines, distributed memory systems, engineering applications, irregularly coupled regular mesh problems, machine-independent, multiblock, multiblock computational fluid dynamics code, multiblock template, multigrid codes, Parallel machines, parallel programming, Physics computing, runtime communication overhead, Runtime library, runtime support, scientific applications, software reusability, structured meshes}, doi = {10.1109/SHPCC.1994.296639}, author = {Agrawal,G. and Sussman, Alan and Saltz, J.} } @article {14907, title = {Error propagation in 3D-from-2D recognition: Scaled-orthographic and perspective projections}, journal = {Proceedings: ARPA Image Understanding Workshop, Monterey, California}, year = {1994}, month = {1994///}, abstract = {Robust recognition systems require a careful under-standing of the e ects of error in sensed features. Error in these image features results in uncertainty in the possible image location of each additional model feature. We present an accurate, analytic ap- proximation for this uncertainty when model poses are based on matching three image and model points. This result applies to objects that are fully three- dimensional, where past results considered only two- dimensional objects. Further, we introduce a lin- ear programming algorithm to compute this uncer- tainty when poses are based on any number of initial matches. }, author = {Alter,T. D. and Jacobs, David W.} } @conference {14839, title = {Error propagation in full 3D-from-2D object recognition}, booktitle = {Computer Vision and Pattern Recognition, 1994. Proceedings CVPR {\textquoteright}94., 1994 IEEE Computer Society Conference on}, year = {1994}, month = {1994/06//}, pages = {892 - 898}, abstract = {Robust recognition systems require a careful understanding of the effects of error in sensed features. Error in these image features results in uncertainty in the possible image location of each additional model feature. We present an accurate, analytic approximation for this uncertainty when model poses are based on matching three image and model points. This result applies to objects that are fully three-dimensional, where past results considered only two-dimensional objects. Further, we introduce a linear programming algorithm to compute this uncertainty when poses are based on any number of initial matches}, keywords = {3D-from-2D, algorithm;, error, extraction;, feature, features;, handling;, image, initial, linear, matches;, object, Programming, programming;, propagation;, recognition, recognition;, robust, sequences;, systems;, Uncertainty, uncertainty;}, doi = {10.1109/CVPR.1994.323920}, author = {Alter,T. D. and Jacobs, David W.} } @conference {15941, title = {An Error-Theory of Consciousness}, booktitle = {MARYLAND COMPUTER SCIENCE}, year = {1994}, month = {1994///}, author = {Perlis, Don} } @article {12061, title = {Estimating the heading direction using normal flow}, journal = {International Journal of Computer Vision}, volume = {13}, year = {1994}, month = {1994///}, pages = {33 - 56}, author = {Aloimonos, J. and Duric, Z.} } @conference {13435, title = {Evaluation of learning biases using probabilistic domain knowledge}, booktitle = {Proceedings of the workshop on Computational learning theory and natural learning systems (vol. 2) : intersections between theory and experiment: intersections between theory and experiment}, year = {1994}, month = {1994///}, pages = {97 - 112}, publisher = {MIT Press}, organization = {MIT Press}, address = {Cambridge, MA, USA}, isbn = {0-262-58133-7}, url = {http://dl.acm.org/citation.cfm?id=190786.190800}, author = {desJardins, Marie} } @conference {16381, title = {Experiences with Constraint-based Array Dependence Analysis}, booktitle = {Principles and practice of constraint programming: second international workshop, PPCP{\textquoteright}94, Rosario, Orcas Island, WA, USA, May 2-4, 1994: proceedings}, year = {1994}, month = {1994///}, pages = {312 - 312}, author = {Wonnacott,W. P.D} } @conference {16335, title = {An experiment to assess different defect detection methods for software requirements inspections}, booktitle = {Proceedings of the 16th international conference on Software engineering}, year = {1994}, month = {1994///}, pages = {103 - 112}, author = {Porter, Adam and Votta,L. G.} } @article {16970, title = {An exploratory evaluation of three interfaces for browsing large hierarchical tables of contents}, journal = {ACM Trans. Inf. Syst.}, volume = {12}, year = {1994}, month = {1994/10//}, pages = {383 - 406}, abstract = {Three different interfaces were used to browse a large (1296 items) table of contents. A fully expanded stable interface, expand/contract interface, and multipane interface were studied in a between-groups experiment with 41 novice participants. Nine timed fact retrieval tasks were performed; each task is analyzed and discussed separately. We found that both the expand/contract and multipane interfaces produced significantly faster times than the stable interface for many tasks using this large hierarchy; other advantages of the expand/contract and multipane interfaces over the stable interface are discussed. The animation characteristics of the expand/contract interface appear to play a major role. Refinements to the multipane and expand/contract interfaces are suggested. A predictive model for measuring navigation effort of each interface is presented.}, keywords = {Browsing, hierarchies, table of contents, User interfaces}, isbn = {1046-8188}, doi = {10.1145/185462.185483}, url = {http://doi.acm.org/10.1145/185462.185483}, author = {Chimera,Richard and Shneiderman, Ben} } @article {16595, title = {An extended cellular space method for simulating autocatalytic oligonucleotides}, journal = {Computers \& chemistry}, volume = {18}, year = {1994}, month = {1994///}, pages = {33 - 43}, author = {Chou,H. H. and Reggia, James A. and Navarro-Gonzalez,R. and Wu,J.} } @conference {18297, title = {Early vision processing using a multi-stage diffusion process}, booktitle = {1993 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 1993. Proceedings CVPR {\textquoteright}93}, year = {1993}, month = {1993/06//}, pages = {41 - 46}, publisher = {IEEE}, organization = {IEEE}, abstract = {The use of a multistage diffusion process in the early processing of range data is examined. The input range data are interpreted as occupying a volume in 3-D space. Each diffusion stage simulates the process of diffusing part of the boundary of the volume into the volume. The outcome of the process can be used for both discontinuity detection and segmentation into shape homogeneous regions. The process is applied to synthetic noise-free and noisy step, roof, and valley edges as well as to real range images}, keywords = {3-D space, Computational modeling, Computer vision, Diffusion processes, discontinuity detection, early vision processing, Educational institutions, Image edge detection, Image segmentation, Laboratories, multistage diffusion process, Noise shaping, noise-free edges, noisy edges, Performance analysis, roof edges, segmentation, SHAPE, shape homogeneous regions, step edges, valley edges}, isbn = {0-8186-3880-X}, doi = {10.1109/CVPR.1993.341003}, author = {Yacoob,Yaser and Davis, Larry S.} } @article {17121, title = {Education by engagement and construction: Experiences in the AT\&T teaching theater}, journal = {Educational Multimedia and Hypermedia Annual. Association for the Advancement of Computing in Education, Charlottesville, Virg}, year = {1993}, month = {1993///}, pages = {471 - 479}, author = {Shneiderman, Ben} } @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 {17133, title = {Engagement and construction: Educational strategies for the post-TV era}, journal = {Journal of Computing in Higher Education}, volume = {4}, year = {1993}, month = {1993///}, pages = {106 - 116}, abstract = {THE POST-TV MEDIA of computers (hypermedia, graphic user interfaces, word processors, spreadsheets, databases, sound, music, animation, etc.) and communications (electronic mail, bulletin boards, groupware, fax, video, etc.) enables teachers, students, and parents to creatively develop education by engagement and construction. Students should be given the chance to engage with each other in team projects, preferably situated in the world outside the classroom, with the goal of constructing a product that is useful or interesting to someone other than the teacher. Challenges remain such as scaling up from small class projects to lecture sections with hundreds of students, covering the curriculum that is currently required by many school districts, and evaluating performance. However, there seems to be no turning back and, anyway, the children of the Nintendo and Video Age are eager to press fast forward.}, isbn = {1042-1726}, url = {http://dx.doi.org/10.1007/BF02941067}, author = {Shneiderman, Ben} } @article {18830, title = {Estimation of Achievable Tolerances}, volume = {ISR; TR 1993-44}, year = {1993}, month = {1993///}, institution = {Institute for Systems Research, University of Maryland, College Park}, abstract = {This report presents a new and systematic approach to assist decision-making in selecting machining operation plans. We present a methodology to estimate achievable tolerances of operations plan. Given an operation plan, we use variety of empirical and mathematical models to evaluate process capabilities of various machining operations and compute achievable tolerances using tolerance charting techniques.}, keywords = {Automation, computer aided manufacturing, Manufacturing, Manufacturing Systems}, url = {http://drum.lib.umd.edu//handle/1903/5389}, author = {Gupta, Satyandra K. and Nau, Dana S. and Zhang,G. M.} } @article {18744, title = {Evaluating product machinability for concurrent engineering}, journal = {Concurrent Engineering: Contemporary Issues and Modern Design Tools}, year = {1993}, month = {1993///}, pages = {264 - 279}, url = {http://books.google.com/books?hl=en\&lr=\&id=S5rjzPSsM5EC\&oi=fnd\&pg=PA264\&dq=Satyandra+Gupta\&ots=Ldu80IZ66F\&sig=xZN6yo6NsLi2y3CZskweXchossg}, author = {Nau, Dana S. and Zhang, G. and Gupta,S.K. and Karinthi,R. R.} } @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.} } @inbook {16218, title = {Evaluating three museum installations of a hypertext system}, booktitle = {Sparks of innovation in human-computer interaction}, volume = {40}, year = {1993}, month = {1993///}, pages = {404 - 404}, publisher = {Intellect Books}, organization = {Intellect Books}, isbn = {9781567500783}, author = {Shneiderman, Ben and Brethauer,D. and Plaisant, Catherine and Potter,R.} } @article {16471, title = {An Experimental Study of Three Dataflow Paradigms in Multithreaded Database Transitive Closure Algorithms on Shared Memory Multiprocessors}, journal = {Journal of Parallel and Distributed Computing}, volume = {18}, year = {1993}, month = {1993/07//}, pages = {371 - 389}, abstract = {This paper describes an experimental study of three dataflow paradigms, namely, no dataflow, pipelined dataflow, and network dataflow, in multithreaded database transitive closure algorithms on shared memory multiprocessors. This study shows that dataflow paradigm directly influences performance parameters such as the amount of interthread communication, how data are partitioned among the threads, whether access to each page of data is exclusive or shared, whether locks are needed for concurrency control, and how calculation termination is detected. The algorithm designed with no dataflow outperforms the algorithms with dataflow. Approximately linear speedup is achieved by the no dataflow algorithm with sufficient workload and primary memory. An exclusive access working set model and a shared access working set model describe the interactions between two or more threads' working sets when access to each page of data is exclusive or shared among the threads, respectively. These models are experimentally verified.}, isbn = {0743-7315}, doi = {10.1006/jpdc.1993.1071}, url = {http://www.sciencedirect.com/science/article/pii/S0743731583710713}, author = {Youngmyers,H. and Raschid, Louiqa} } @conference {16220, title = {Exploring remote images: a telepathology workstation}, booktitle = {Proceedings of the INTERACT {\textquoteright}93 and CHI {\textquoteright}93 conference on Human factors in computing systems}, series = {CHI {\textquoteright}93}, year = {1993}, month = {1993///}, pages = {518{\textendash} - 518{\textendash}}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, isbn = {0-89791-575-5}, doi = {10.1145/169059.169488}, url = {http://doi.acm.org/10.1145/169059.169488}, author = {Plaisant, Catherine and Carr,David A and Hasegawa,Hiroaki} } @inbook {17119, title = {Education by engagement and construction: a strategic education initiative for a multimedia renewal of American education}, booktitle = {Sociomedia: Hypermedia, Multimedia and the Social Creation of KnowledgeSociomedia: Hypermedia, Multimedia and the Social Creation of Knowledge}, year = {1992}, month = {1992///}, pages = {13 - 26}, author = {Shneiderman, Ben} } @article {16231, title = {The effects of time delays on a telepathology user interface.}, journal = {Proceedings of the Annual Symposium on Computer Application in Medical CareProc Annu Symp Comput Appl Med Care}, year = {1992}, month = {1992///}, pages = {256 - 260}, abstract = {Telepathology enables a pathologist to examine physically distant tissue samples by microscope operation over a communication link. Communication links can impose time delays which cause difficulties in controlling the remote device. Such difficulties were found in a microscope teleoperation system. Since the user interface is critical to pathologist{\textquoteright}s acceptance of telepathology, we redesigned the user interface for this system, built two different versions (a keypad whose movement commands operated by specifying a start command followed by a stop command and a trackball interface whose movement commands were incremental and directly proportional to the rotation of the trackball). We then conducted a pilot study to determine the effect of time delays on the new user interfaces. In our experiment, the keypad was the faster interface when the time delay is short. There was no evidence to favor either the keypad or trackball when the time delay was longer. Inexperienced participants benefitted by allowing them to move long distances over the microscope slide by dragging the field-of-view indicator on the touchscreen control panel. The experiment suggests that changes could be made to the trackball interface which would improve its performance.}, isbn = {0195-4210}, author = {Carr,D. and Hasegawa,H. and Lemmon,D. and Plaisant, Catherine} } @conference {14587, title = {Efficient algorithms for computing matching and chromatic polynomials on series-parallel graphs}, booktitle = {, Fourth International Conference on Computing and Information, 1992. Proceedings. ICCI {\textquoteright}92}, year = {1992}, month = {1992/05/28/30}, pages = {42 - 45}, publisher = {IEEE}, organization = {IEEE}, abstract = {The authors present efficient algorithms for computing the matching polynomial and chromatic polynomial of a series-parallel graph in O(n3) and O(n2) time respectively. Their algorithm for computing the matching polynomial generalizes an existing result from Lovasz, Plummer (1986) and the chromatic polynomial algorithm improves the result given by Hunt, Ravi, Stearn (1988) from O(n4) time}, keywords = {chromatic polynomials, computational complexity, Computer science, graph colouring, graph theory, matching polynomial, Polynomials, series-parallel graphs, Terminology, Tree data structures, Tree graphs}, isbn = {0-8186-2812-X}, doi = {10.1109/ICCI.1992.227709}, author = {Chandrasekharan,N. and Hannenhalli, Sridhar} } @conference {15207, title = {Efficient minimum cost matching using quadrangle inequality}, booktitle = {Foundations of Computer Science, 1992. Proceedings., 33rd Annual Symposium on}, year = {1992}, month = {1992/10//}, pages = {583 - 592}, abstract = {The authors present efficient algorithms for finding a minimum cost perfect matching, and for solving the transportation problem in bipartite graphs, G = (Red cup; Blue, Red times; Blue), where |Red| = n, |Blue| = m, n les; m, and the cost function obeys the quadrangle inequality. The first results assume that all the red points and all the blue points lie on a curve that is homeomorphic to either a line or a circle and the cost function is given by the Euclidean distance along the curve. They present a linear time algorithm for the matching problem. They generalize the method to solve the corresponding transportation problem in O((m+n)log(m+n)) time. The next result is an O(n log m) algorithm for minimum cost matching when the cost array is a bitonic Monge array. An example of this is when the red points lie on one straight line and the blue points lie on another straight line (that is not necessarily parallel to the first one). Finally, they provide a weakly polynomial algorithm for the transportation problem in which the associated cost array is a bitonic Monge array}, keywords = {algorithm;, array;, bipartite, bitonic, blue, complexity;, computational, cost, distance;, Euclidean, function;, geometry;, graph, graphs;, inequality;, linear, MATCHING, matching;, minimisation;, minimum, Monge, perfect, points;, polynomial, problem;, quadrangle, red, theory;, TIME, transportation, transportation;, weakly}, doi = {10.1109/SFCS.1992.267793}, author = {Aggarwal,A. and Bar-Noy,A. and Khuller, Samir and Kravets,D. and Schieber,B.} } @article {18075, title = {Efficient pattern matching with scaling}, journal = {Journal of Algorithms}, volume = {13}, year = {1992}, month = {1992///}, pages = {2 - 32}, author = {Amir, A. and Landau,G. M and Vishkin, Uzi} } @conference {16360, title = {Eliminating false data dependences using the Omega test}, booktitle = {Proceedings of the ACM SIGPLAN 1992 conference on Programming language design and implementation}, year = {1992}, month = {1992///}, pages = {140 - 151}, author = {Pugh, William and Wonnacott,D.} } @article {17956, title = {An environment projection approach to radiosity for meshconnected computers}, journal = {Third Eurographics Workshop on Rendering}, year = {1992}, month = {1992///}, pages = {271 - 281}, author = {Varshney, Amitabh and Prins,J. F} } @conference {16502, title = {Experiments on the concurrent rule execution in database systems}, booktitle = {Tools with Artificial Intelligence, 1992. TAI{\textquoteright}92, Proceedings., Fourth International Conference on}, year = {1992}, month = {1992///}, pages = {405 - 412}, author = {Delis,A. and Raschid, Louiqa and Sellis,T.} } @conference {12020, title = {Exploratory active vision: theory}, booktitle = {Proceedings of 1992 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 1992}, year = {1992}, month = {1992/06/15/18}, pages = {10 - 15}, publisher = {IEEE}, organization = {IEEE}, abstract = {An active approach to the integration of shape from x modules-here shape from shading and shape from texture-is proposed. The question of what constitutes a good motion for the active observer is addressed. Generally, the role of the visual system is to provide depth information to an autonomous robot; a trajectory module will then interpret it to determine a motion for the robot, which in turn will affect the visual information received. It is suggested that the motion can also be chosen so as to improve the performance of the visual system}, keywords = {active observer, Active shape model, active vision, Automation, autonomous robot, CAMERAS, Computer science, Computer vision, depth information, Laboratories, Layout, Mobile robots, Motion analysis, optical flow, Robots, shape from shading, shape from texture, shape from x modules, trajectory module, Visual system}, isbn = {0-8186-2855-3}, doi = {10.1109/CVPR.1992.223234}, author = {Herve,J. -Y and Aloimonos, J.} } @inbook {17118, title = {Editing to structure a reader{\textquoteright}s experience}, booktitle = {Hypertext/hypermedia handbookHypertext/hypermedia handbook}, year = {1991}, month = {1991///}, pages = {143 - 164}, author = {Shneiderman, Ben and Kreitzberg,C. and Berk,E.} } @article {17589, title = {Efficient algorithms for the minimum weighted dominating clique problem on permutation graphs}, journal = {Theoretical Computer Science}, volume = {91}, year = {1991}, month = {1991/12/09/}, pages = {1 - 21}, abstract = {Given a graph G=(V, E) with real weights assigned to its vertices, a clique of G that also dominates its vertex set V, is called a dominating clique (DC) of G. Given a permutation graph G with all its vertices having nonnegative weights, and its permutation representation, the problem addressed in this paper is that of finding any minimum weight DC of G. We improve the existing O(|V|2) algorithm for this problem to O(|V|log|V|). The space complexity of our algorithm is O(|V|). We also present a |V| processor, O(log|V|) time, O(|V|log|V|) space parallel EREW PRAM algorithm for this problem.}, isbn = {0304-3975}, doi = {10.1016/0304-3975(91)90265-4}, url = {http://www.sciencedirect.com/science/article/pii/0304397591902654}, author = {Srinivasan, Aravind and Pandu Rangan,C.} } @article {17137, title = {ESP{\textquoteright}91 Panel on The Best of ESP}, journal = {Empirical studies of programmers: fourth workshop}, year = {1991}, month = {1991///}, pages = {1 - 1}, author = {Zweben,S. and Curtis,B. and Shneiderman, Ben} } @article {16534, title = {An experimental study of criteria for hypothesis plausibility}, journal = {Journal of Experimental \& Theoretical Artificial Intelligence}, volume = {3}, year = {1991}, month = {1991///}, pages = {129 - 144}, author = {Tuhrim,S. and Reggia, James A. and Goodall,S.} } @article {14957, title = {Efficient algorithms for list ranking and for solving graph problems on the hypercube}, journal = {Parallel and Distributed Systems, IEEE Transactions on}, volume = {1}, year = {1990}, month = {1990/01//}, pages = {83 - 90}, abstract = {A hypercube algorithm to solve the list ranking problem is presented. Let n be the length of the list, and let p be the number of processors of the hypercube. The algorithm described runs in time O(n/p) when n= Omega;(p 1+ epsi;) for any constant epsi; gt;0, and in time O(n log n/p+log3 p) otherwise. This clearly attains a linear speedup when n= Omega;(p 1+ epsi;). Efficient balancing and routing schemes had to be used to achieve the linear speedup. The authors use these techniques to obtain efficient hypercube algorithms for many basic graph problems such as tree expression evaluation, connected and biconnected components, ear decomposition, and st-numbering. These problems are also addressed in the restricted model of one-port communication}, keywords = {algorithm;hypercube, algorithms;graph, algorithms;linear, algorithms;sorting;, balancing;one-port, basic, communication;sorting;st-numbering;tree, complexity;graph, components;ear, decomposition;graph, evaluation;computational, Expression, graph, problems;biconnected, problems;hypercube, ranking;load, speedup;list, theory;parallel}, isbn = {1045-9219}, doi = {10.1109/71.80127}, author = {Ryu,K. W. and JaJa, Joseph F.} } @article {16805, title = {Efficient compilation of large rule bases using logical access paths}, journal = {Information Systems}, volume = {15}, year = {1990}, month = {1990///}, pages = {73 - 84}, abstract = {This paper presents an efficient way to compile and store large deductive databases. Deductive rules are modeled through logical access paths and then integrated into a global structure, the Rule-base Access Path Schema (RAP Schema). The RAP Schema stores information on the interrelationships that exist among the computations required for rule executions. Ground data as well as data derived through some rule executions and cached for later reuse are also modeled in the RAP Schema. Some of the advantages of using this rule base organization scheme include the automatic detection of shared computations, the inclusion of cached results of rule executions and query results in the knowledge base. The details of the compilation and query processing phases are the focus of the paper.}, isbn = {0306-4379}, doi = {16/0306-4379(90)90017-J}, url = {http://www.sciencedirect.com/science/article/pii/030643799090017J}, author = {Sellis,Timos K. and Roussopoulos, Nick and Ng,Raymond T.} } @conference {14939, title = {An efficient parallel algorithm for channel routing}, booktitle = {Computer Design: VLSI in Computers and Processors, 1990. ICCD {\textquoteright}90. Proceedings., 1990 IEEE International Conference on}, year = {1990}, month = {1990/09//}, pages = {400 - 403}, abstract = {The channel-routing of a set of multiterminal nets in the standard two-layer model is considered. The sequential algorithms based on the greedy strategy do not seem to be easily parallelizable. Proposed is an efficient parallel algorithm for routing channels with cyclic constraints. The algorithm runs in time O(n2/p+log2p), with p processors, on a shared memory parallel random access machine (PRAM) model where 1 les;p les;n2 radic; and n is the size of the input. An efficient adaptation of this algorithm on a Sequent Balance 21000 multiprocessor system is reported}, keywords = {21000;channel, access, algorithm;sequential, algorithms;, algorithms;shared, balance, CAD;computational, complexity;parallel, Layout, machine;standard, memory, model;circuit, nets;parallel, Parallel, PRAM;Sequent, random, routing;multiprocessor, system;multiterminal, two-layer}, doi = {10.1109/ICCD.1990.130261}, author = {Krishnamurthy, S. and JaJa, Joseph F.} } @article {16330, title = {Empirically guided software development using metric-based classification trees}, journal = {IEEE Software}, volume = {7}, year = {1990}, month = {1990/03//}, pages = {46 - 54}, abstract = {The identification of high-risk components early in the life cycle is addressed. A solution that casts this as a classification problem is examined. The proposed approach derives models of problematic components, based on their measurable attributes and those of their development processes. The models provide a basis for forecasting which components are likely to share the same high-risk properties, such as being error-prone or having a high development cost. Developers can use these classification techniques to localize the troublesome 20\% of the system. The method for generating the models, called automatic generation of metric-based classification trees, uses metrics from previous releases or projects to identify components that are historically high-risk.}, keywords = {Application software, Area measurement, automatic generation, classification problem, Classification tree analysis, Costs, empirically guided software development, Error correction, life cycle, measurable attributes, metric-based classification trees, Predictive models, Programming, software engineering, Software measurement, software metrics, Software systems}, isbn = {0740-7459}, doi = {10.1109/52.50773}, author = {Porter, Adam and Selby,R. W} } @article {17139, title = {EVALUATING HYPERMEDIA SYSTEMS}, journal = {Human factors in computing systems: CHI{\textquoteright}90 Conference proceedings, April 1-5, Seattle}, year = {1990}, month = {1990///}, pages = {387 - 387}, author = {Ehrlich,K. and Microsytems,S. and Marchionini,G. and Nielsen,J. and Shneiderman, Ben} } @article {16342, title = {Evaluating techniques for generating metric-based classification trees}, journal = {Journal of Systems and Software}, volume = {12}, year = {1990}, month = {1990/07//}, pages = {209 - 218}, abstract = {Metric-based classification trees provide an approach for identifying user-specified classes of high-risk software components throughout the software lifecycle. Based on measurable attributes of software components and processors, this empirically guided approach derives models of problematic software components. These models, which are represented as classification trees, are used on future systems to identify components likely to share the same high-risk properties. Example high-risk component properties include being fault-prone, change-prone, or effort-prone, or containing certain types of faults. Identifying these components allows developers to focus the application of specialized techniques and tools for analyzing, testing, and constructing software. A validation study using metric data from 16 NASA systems showed that the trees had an average classification accuracy of 79.3\% for fault-prone and effort-prone components in that environment.One fundamental feature of the classification tree generation algorithm is the method used for partitioning the metric data values into mutually exclusive and exhaustive ranges. This study compares the accuracy and the complexity of trees resulting from five techniques for partitioning metric data values. The techniques are quartiles, octiles, and three methods based on least weight subsequence (LWS-[chi]) analysis, where [chi] is the upper bound on the number of partitions. The LWS-3 and LWS-5 partition techniques resulted in trees with higher accuracy (in terms of completeness and consistency) than did quartiles and octiles. LWS-3 and LWS-5 trees were not statistically different in terms of accuracy, but LWS-3 trees had lower complexity than all other methods in terms of the number of unique metrics required. The trees from the three LWS methods (LWS-3, LWS-5, and LWS-8) had lower complexity than did the trees from quartiles and octiles. In general, the results indicate that distribution-sensitive partition techniques that use only relatively few partitions, such as the least weight subsequence techniques LWS-3 and LWS-5, can increase accuracy and decrease complexity in classification trees. Classification analysis techniques, along with other empirically based analysis techniques for large-scale software, will be supported in the Amadeus measurement and empirical analysis system. }, isbn = {0164-1212}, doi = {16/0164-1212(90)90041-J}, url = {http://www.sciencedirect.com/science/article/pii/016412129090041J}, author = {Porter, Adam and Selby,Richard W.} } @conference {18388, title = {Evaluation criteria for functional specifications}, booktitle = {Proceedings of the 12th international conference on Software engineering}, series = {ICSE {\textquoteright}90}, year = {1990}, month = {1990///}, pages = {26 - 33}, publisher = {IEEE Computer Society Press}, organization = {IEEE Computer Society Press}, address = {Los Alamitos, CA, USA}, isbn = {0-89791-349-3}, url = {http://dl.acm.org/citation.cfm?id=100296.100299}, author = {Cardenas,S. and Zelkowitz, Marvin V} } @article {12993, title = {Evolution of avocados as revealed by DNA restriction fragment variation}, journal = {J Hered}, volume = {81}, year = {1990}, month = {1990/06//May}, pages = {183 - 188}, abstract = {Individuals representing the genus {\i}t Persea, subgenus {\i}t Persea were assayed for restriction fragment length polymorphisms in their chloroplast genome, nuclear ribosomal DNA, and the genes coding for the enzyme cellulase. The subgenus {\i}t Persea appears to consist of {\i}t P. schiedeana and a separate taxon containing the remaining species. {\i}t P. americana does not appear to be a monophyletic group. If {\i}t P. americana is to be maintained as a species containing var. {\i}t americana, var. {\i}t drymifolia, and var. {\i}t guatemalensis, then our data suggest that it should also contain varieties corresponding to {\i}t P. floccosa, {\i}t P. nubigena, and {\i}t P. steyermarkii. {\i}t P. americana var. {\i}t guatemalensis appears to have originated as a hybrid between {\i}t P. steyermarkii and {\i}t P. nubigena. The root-rot-resistant cultivar G755A is a hybrid progeny of {\i}t P. schiedeana and {\i}t P. americana var. guatemalensis. The three varieties of {\i}t P. americana were all distinguished by mutations.}, author = {Furnier,GR and Cummings, Michael P. and Clegg,M. T} } @article {17145, title = {Examining usability for a training-oriented hypertext: Can hyper-activity be good?}, journal = {Electronic Publishing}, volume = {3}, year = {1990}, month = {1990///}, pages = {207 - 225}, abstract = {We describe the design and evaluation of a hypertext-based tutorial for hypertext authors. This85-article tutorial represents an innovative application of hypertext to procedural learning. The work has been influenced by Carroll{\textquoteright}s minimalist model, and by the syntactic/semantic semantic model of user behavior. The usability study involved eight subjects who studied the Hyperties Author Tutorial (HAT) for approximately one hour and then performed a set of authoring tasks in an average of 21 minutes. All users successfully completed the tasks. As a result of the study, we provide a characterization of appropriate uses of hypertext for training, and describe the meaning of a hyper-active environment. }, author = {Jones,T. and Shneiderman, Ben} } @article {15201, title = {Extending planar graph algorithms to K3,3-free graphs}, journal = {Information and Computation}, volume = {84}, year = {1990}, month = {1990/01//}, pages = {13 - 25}, abstract = {For several problems, restricting attention to special classes of graphs has yielded better algorithms. In particular, restricting to planar graphs yields efficient parallel algorithms for several graph problems. In this paper we extend these algorithms to K3,3-free graphs, showing that the restriction of planarity is not important. The three problems dealt with are: graph coloring, depth first search, and maximal independent sets. As a corollary we show that K3,3-free graphs are five colorable (this bound is tight).}, isbn = {0890-5401}, doi = {10.1016/0890-5401(90)90031-C}, url = {http://www.sciencedirect.com/science/article/pii/089054019090031C}, author = {Khuller, Samir} } @conference {15199, title = {Efficient parallel algorithms for testing connectivity and finding disjoint s-t paths in graphs}, booktitle = {Foundations of Computer Science, 1989., 30th Annual Symposium on}, year = {1989}, month = {1989/11/01/oct}, pages = {288 - 293}, abstract = {An efficient parallel algorithm for testing whether a graph G is K-vertex connected, for any fixed k, is presented. The algorithm runs in O(log n) time and uses nC(n,m) processors on a concurrent-read, concurrent-write parallel random-access machine (CRCW PRAM), where n and m are the number of vertices and edges of G and C(n,m) is the number of processors required to compute the connected components of G in logarithmic time. An optimal speedup algorithm for computing connected components would induce an optimal speedup algorithm for testing k -vertex connectivity, for any k gt;4. To develop the algorithm, an efficient parallel algorithm is designed for the following disjoint s-t paths problem: Given a graph G and two specified vertices s and t, find k-vertex disjoint paths between s and t, if they exist. If no such paths exist, find a set of at most k-1 vertices whose removal disconnects s and t. The parallel algorithm for this problem runs in O(log n) time using C(n,m) processors. It is shown how to modify the algorithm to find k-edge disjoint paths, if they exist. This yields an efficient parallel algorithm for testing whether a graph G is k-edge connected, for any fixed k. The algorithm runs in O(log n) time and uses nC (n,n) processors on a CRCW PRAM. Again, an optimal speedup algorithm for computing connected components would induce an optimal speedup algorithm for testing k-edge connectivity}, keywords = {algorithm;parallel, algorithms;random-access, algorithms;testing, complexity;graph, connectivity;computational, connectivity;optimal, CRCW, disjoint, paths;graphs;k-edge, paths;k-vertex, PRAM;disjoint, s-t, speedup, storage;, theory;parallel}, doi = {10.1109/SFCS.1989.63492}, author = {Khuller, Samir and Schieber,B.} } @book {14962, title = {Efficient Techniques for Routing and for Solving Graph Problems on the Hypercube}, year = {1989}, month = {1989///}, publisher = {University of Maryland}, organization = {University of Maryland}, author = {JaJa, Joseph F. and Ryu,K. W.} } @article {18389, title = {Experiences building a syntax-directed editor}, journal = {Software Engineering Journal}, volume = {4}, year = {1989}, month = {1989/11//}, pages = {294 - 294}, abstract = {The paper presents a set of techniques for building robust software using the development of a microprocessor SUPPORT programming environment as an example. It discusses some of the attributes built into the system to best handle the concerns of portability, functionality, and effectiveness that had to be dealt with for the system to be reliable on a small machine, and it describes some of the choices made to obtain the best use of available hardware}, keywords = {applications;, editing;, editor;, engineering;, environment;, environments;, microcomputer, microprocessor;, portability;, Programming, robust, software, software;, Support, syntax-directed, text}, isbn = {0268-6961}, author = {Zelkowitz, Marvin V and Kowalchack,B. and Itkin,D. and Herman,L.} } @article {16969, title = {An experimental evaluation of three touch screen strategies within a hypertext database}, journal = {International Journal of Human-Computer Interaction}, volume = {1}, year = {1989}, month = {1989///}, pages = {41 - 52}, abstract = {High resolution touch screens and novel usage strategies have overcome earlier problems with parallax and inaccurate pointing. A study testing the utility of three touch screen strategies within the Hyperties hypertext environment was performed. This provided a replication and extension of an earlier touch screen strategy comparison that focused on small closely?spaced targets. The experiment compared three touch screen strategies in three experimental tasks that reflect hypertext usage. The results showed that a strategy that only uses the initial impact with the touch screen causes the user to miss the target more than other touch strategies. A statistically significant difference in errors was found. Our results should encourage system implementers and touch screen hardware designers to support ?touch mouse? strategies that enable cursor dragging on the touch screen surface.High resolution touch screens and novel usage strategies have overcome earlier problems with parallax and inaccurate pointing. A study testing the utility of three touch screen strategies within the Hyperties hypertext environment was performed. This provided a replication and extension of an earlier touch screen strategy comparison that focused on small closely?spaced targets. The experiment compared three touch screen strategies in three experimental tasks that reflect hypertext usage. The results showed that a strategy that only uses the initial impact with the touch screen causes the user to miss the target more than other touch strategies. A statistically significant difference in errors was found. Our results should encourage system implementers and touch screen hardware designers to support ?touch mouse? strategies that enable cursor dragging on the touch screen surface. }, isbn = {1044-7318}, doi = {10.1080/10447318909525956}, url = {http://www.tandfonline.com/doi/abs/10.1080/10447318909525956}, author = {Potter,Richard and Berman,Mitchell and Shneiderman, Ben} } @article {16016, title = {Explicitly biased generalization}, journal = {Computational Intelligence}, volume = {5}, year = {1989}, month = {1989///}, pages = {67 - 81}, author = {Gordon,D. and Perlis, Don} } @article {17117, title = {Ecological studies of professional programmers}, journal = {Commun. ACM}, volume = {31}, year = {1988}, month = {1988/11//}, pages = {1256 - 1258}, abstract = {For over two decades, software psychology researchers have been developing insights to software productivity and quality by investigating builders and users of software. This research has been diverse in both its approach and its impacts. It has introduced systematic behavioral measurement into the software development process and into research on new software techniques and technologies, and has also opened up new social and cognitive interpretations of software processes [5, 12].We now see evidence of a new thrust in software psychology coming to the fore, one in which usability researchers are direct participants in the definition and creation of new software artifacts. We call this paradigm Ecological Design, to emphasize (1) that realistic software situations are being confronted on their own terms, and (2) that the work is directed toward design results, not merely toward evaluation and description in the service of design goals. The reorientation towards studying teamwork was prompted in 1971 by Weinberg and followed by a few researchers at that time, but the movement has accelerated with the recent and intense interest in computer supported collaborative work [15]. This was apparent in the papers presented at the two workshops on Empirical Studies of Programmers [10, 13]. An accompanying shift has also occurred in the software engineering community. The traditional waterfall model of software development with the precise specification of a provable topdown design is giving way to newer exploratory styles of program development that emphasize rapid prototyping and iterative refinement. The shift from product to process also puts greater emphasis on team organization, group processes, management policies, reusability, development tools, design methods, debugging strategies, and maintenance [6]. The three papers in this special section exemplify this new paradigm. Rosson, Maass, and Kellogg and Curtis, Krasner, and Iscoe describe highly qualitative studies of professional designers that produced specific technical proposals for improving software tools and the coordination of project management, an assessment of major bottlenecks, and a new framework for thinking about software design as a learning and communication process. Soloway, Pinto, Letovsky, Littman, and Lampert describe the design and exploration of software documentation that grew out of similarly qualitative studies of program maintenance. We caution that this research paradigm is still in its infancy: setting design requirements and developing prototypes are not traditional activities of psychological researchers. These roles are still emerging, still being reconciled with the earlier paradigms. The particular projects highlighted here are only the beginning; the field continues to evolve, as more researchers are attracted, as more topics are explored, as more methods are developed. Thus, despite the shortcomings of any particular project, the trajectory of this paradigm seems clear to us: it is the development of ideas that directly impact productivity and quality in software. Indeed, part of our intention in presenting this special section is to encourage more and more rapid development of the new paradigm. }, isbn = {0001-0782}, doi = {10.1145/50087.214900}, url = {http://doi.acm.org/10.1145/50087.214900}, author = {Shneiderman, Ben and Carroll,John M.} } @conference {18089, title = {Efficient parallel triconnectivity in logarithmic time}, booktitle = {VLSI Algorithms and Architectures}, year = {1988}, month = {1988///}, pages = {33 - 42}, author = {Ramachandran,V. and Vishkin, Uzi} } @article {16791, title = {An efficient pictorial database system for PSQL}, journal = {IEEE Transactions on Software Engineering}, volume = {14}, year = {1988}, month = {1988/05//}, pages = {639 - 650}, abstract = {Pictorial databases require efficient and direct spatial search based on the analog form of spatial objects and relationships instead of search based on some cumbersome alphanumeric encodings of the pictures. A description is given of PSQL, a query language that allows pictorial domains to be presented to the user in their analog form and allows him or her to do direct manipulation on the objects found on those domains. Direct spatial search and computation on the pictures is done using efficient data structures, R- and R+-trees (multidimensional B-trees), which are excellent devices for searching spatial objects and relationships found on pictures}, keywords = {alphanumeric encodings, Computer science, Data structures, Database languages, database management systems, Database systems, Encoding, Image coding, Image databases, multidimensional B-trees, Object oriented databases, pictorial database system, PSQL, query language, query languages, R+-trees, Relational databases, Spatial databases, spatial objects, spatial search, User interfaces}, isbn = {0098-5589}, doi = {10.1109/32.6141}, author = {Roussopoulos, Nick and Faloutsos,C. and Sellis,T.} } @conference {16962, title = {An empirical comparison of pie vs. linear menus}, booktitle = {Proceedings of the SIGCHI conference on Human factors in computing systems}, series = {CHI {\textquoteright}88}, year = {1988}, month = {1988///}, pages = {95 - 100}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Menus are largely formatted in a linear fashion listing items from the top to bottom of the screen or window. Pull down menus are a common example of this format. Bitmapped computer displays, however, allow greater freedom in the placement, font, and general presentation of menus. A pie menu is a format where the items are placed along the circumference of a circle at equal radial distances from the center. Pie menus gain over traditional linear menus by reducing target seek time, lowering error rates by fixing the distance factor and increasing the target size in Fitts{\textquoteright}s Law, minimizing the drift distance after target selection, and are, in general, subjectively equivalent to the linear style.}, isbn = {0-201-14237-6}, doi = {10.1145/57167.57182}, url = {http://doi.acm.org/10.1145/57167.57182}, author = {Callahan,J. and Hopkins,D. and Weiser,M. and Shneiderman, Ben} } @article {16745, title = {Expert database systems: Efficient support for engineering environments}, journal = {Data \& Knowledge Engineering}, volume = {3}, year = {1988}, month = {1988/09//}, pages = {71 - 85}, abstract = {Manufacturing and Engineering processes use both large scale data and knowledge bases, and the use of expert systems in such environments has become a necessity. Expert Database Systems have evolved from conventional database systems to meet the requirements of current Artificial Intelligence applications. However, future Expert Database Systems will contain knowledge bases of significant size which makes main memory insufficient and the use of a database system a necessity. We propose an effective way of building High Performance Expert Database Systems to support manufacturing and engineering environments. These systems are based on Incremental Computation Models; such models utilize results of previous computations by merging them with newly derived results of computations on small increments representing changes in the database. Our system will be able to support very large knowledge bases by utilizing novel structures and access methods and by using a very sophisticated inference engine based on incremental computation models.}, keywords = {engineering databases, Expert database systems, high performance systems, incremental computation models}, isbn = {0169-023X}, doi = {16/0169-023X(88)90007-9}, url = {http://www.sciencedirect.com/science/article/pii/0169023X88900079}, author = {Sellis,T. and Roussopoulos, Nick and Mark,L. and Faloutsos,C.} } @article {16527, title = {Expert system development: letting the domain specialist directly author knowledge bases}, journal = {Expert systems: the user interface}, year = {1988}, month = {1988///}, pages = {37 - 56}, author = {Tuhrim,S. and Reggia, James A. and Floor,M.} } @article {18101, title = {An efficient string matching algorithm with K substitutions for nucleotide and amino acid sequences*}, journal = {Journal of theoretical biology}, volume = {126}, year = {1987}, month = {1987///}, pages = {483 - 490}, author = {Landau,G. M and Vishkin, Uzi and Nussinov,R.} } @article {16965, title = {An evaluation of jump-ahead techniques in menu selection}, journal = {Behaviour \& Information Technology}, volume = {6}, year = {1987}, month = {1987///}, pages = {97 - 108}, abstract = {Menu selection systems provide a means of selecting operations and retrieving information which requires little training and reduces the need for memorizing complex command sequences. However, a major disadvantage of many menu selection systems is that experienced users cannot traverse the menu tree significantly faster than novices. A common solution to this problem is to provide the menu selection system with a jump-ahead capability.The purpose of this research was to evaluate two jump-ahead methods (type-ahead and direct-access). In the type-ahead method the user anticipates a selection on each of several successive menus and enters as many selections at one time as desired. In the direct-access method, each menu frame is assigned a unique name which the user must enter to locate it. Thirty-two students were given training on an information retrieval system for college course information and were required to learn the two jump-ahead methods in a counterbalanced design. The direct-access method resulted in fewer traversals to learn the system, lower error rates, and reduced learning time. The subjective impressions, obtained from post-experiment questionnaires and oral comments, indicated that the direct-access jump-ahead method was also preferred in a frequently used menu selection system. }, isbn = {0144-929X}, doi = {10.1080/01449298708901820}, url = {http://www.tandfonline.com/doi/abs/10.1080/01449298708901820}, author = {Laverson,Alan and Norman,Kent and Shneiderman, Ben} } @article {18108, title = {Efficient Parallel and Serial String Matching}, journal = {Computer Science Department Technical Report}, volume = {221}, year = {1986}, month = {1986///}, author = {Landau,G. M and Vishkin, Uzi} } @article {18107, title = {An efficient string matching algorithm with k differences for nudeotide and amino acid sequences}, journal = {Nucleic acids research}, volume = {14}, year = {1986}, month = {1986///}, pages = {31 - 31}, author = {Landau,G. M and Vishkin, Uzi and Nussinov,R.} } @article {18109, title = {Efficient string matching with k mismatches}, journal = {Theoretical Computer Science}, volume = {43}, year = {1986}, month = {1986///}, pages = {239 - 249}, author = {Landau,G. M and Vishkin, Uzi} } @article {17131, title = {Empirical studies of programmers: The territory, paths, and destinations}, journal = {Empirical studies of programmers}, year = {1986}, month = {1986///}, pages = {1 - 12}, abstract = {This paper attempts to describe the varied intellectual territory thatprogrammers work in. It offers several paths for researchers who wish to explore this territory: controlled experiments, observational or field studies, surveys, and cognitive theories. Finally, this paper suggests several important destinations for researchers: refining the use of current languages, improving present and future languages, developing special purpose languages, and improving tools and methods. }, author = {Shneiderman, Ben} } @conference {16728, title = {Engineering Information Systems: Builders and Designers Perspective}, booktitle = {SIGMOD Conference}, year = {1986}, month = {1986///}, pages = {1 - 3}, author = {Roussopoulos, Nick} } @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 {18120, title = {Efficient implementation of a shifting algorithm}, journal = {Discrete applied mathematics}, volume = {12}, year = {1985}, month = {1985///}, pages = {71 - 80}, author = {Perl,Y. and Vishkin, Uzi} } @article {18119, title = {An efficient parallel biconnectivity algorithm}, journal = {SIAM Journal on Computing}, volume = {14}, year = {1985}, month = {1985///}, pages = {862 - 862}, author = {Tarjan,R. E and Vishkin, Uzi} } @article {18117, title = {On efficient parallel strong orientation}, journal = {Information Processing Letters}, volume = {20}, year = {1985}, month = {1985///}, pages = {235 - 240}, author = {Vishkin, Uzi} } @conference {18121, title = {Efficient string matching in the presence of errors}, booktitle = {Foundations of Computer Science, 1985., 26th Annual Symposium on}, year = {1985}, month = {1985///}, pages = {126 - 136}, author = {Landau,G. M and Vishkin, Uzi} } @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.} } @conference {16576, title = {Evaluation of Medical Expert Systems: A Case Study in Performance Analysis}, booktitle = {Proceedings of the Ninth Annual Symposium on Computer Applications in Medical Care}, year = {1985}, month = {1985///}, pages = {287 - 291}, author = {Reggia, James A.} } @article {16968, title = {An experimental comparison of tabular and graphic data presentation}, journal = {International Journal of Man-Machine Studies}, volume = {20}, year = {1984}, month = {1984/06//}, pages = {545 - 566}, abstract = {We present the results of our experiment designed to test the hypothesis that more usable information can be conveyed using a combination of graphical and tabular data then by using either form alone. Our independent variables were memory (recall and non-recall) and form (tables, graphs, or both). Comprehension was measured with a multiple choice exam consisting of three types of questions (retrieve, compare, or compare/calculate answers). Both non-recall and tabular treatments significantly increased comprehension. Combinations of graphs and tables produced slower but more accurate performance. An executive should use the form with which he/she is most familiar and comfortable.}, isbn = {0020-7373}, doi = {10.1016/S0020-7373(84)80029-2}, url = {http://www.sciencedirect.com/science/article/pii/S0020737384800292}, author = {Powers,Matthew and Lashley,Conda and Sanchez,Pamela and Shneiderman, Ben} } @article {17410, title = {The effect of scope delimiters on program comprehension}, journal = {Software: Practice and Experience}, volume = {13}, year = {1983}, month = {1983/09/01/}, pages = {817 - 824}, abstract = {Scope delimiters, such as BEGIN-END or DO-END, are used in many programming languages, but they can lengthen and clutter a program listing. This paper provides experimental evidence that ENDIF or ENDWHILE statement terminators make for easier to comprehend programs than BEGIN-END pairs surrounding compound statements.}, keywords = {Programming language design, Scope delimiters, Software psychology}, isbn = {1097-024X}, doi = {10.1002/spe.4380130908}, url = {http://onlinelibrary.wiley.com/doi/10.1002/spe.4380130908/abstract}, author = {Sykes,Floyd and Tillman,Raymond T and Shneiderman, Ben} } @article {18136, title = {Efficient distributed orientation algorithm.}, journal = {IEEE TRANS. INFO. THEORY.}, volume = {29}, year = {1983}, month = {1983///}, pages = {624 - 628}, author = {Vishkin, Uzi} } @article {16963, title = {An empirical comparison of two PLATO text editors.}, journal = {Journal of Computer-Based Instruction}, volume = {10}, year = {1983}, month = {1983///}, pages = {43 - 50}, abstract = {Two PLATO system text editors were evaluated with 14 nonprogrammers and 14 programmers who were either university staff or college students. Half of each group learned the "plain" editor, which had 8 commands and 3 screens of HELP material; while the other half of each group learned the "fancy" editor, which had 15 commands and 1 screen of HELP material. The fancy editor is a subset of the widely used TUTOR editor, but nonprogrammers preferred the plain editor. Faster learning, faster performance, fewer invocations of HELP material, and fewer requests for human assistance were characteristic of the plain editor.}, author = {Shneiderman, Ben and Hill,R. and Jacob,R. and Mah,W.} } @article {17141, title = {Evaluating multiple coordinated windows for programming workstations}, journal = {NASA. Goddard Space Flight Center Proc. of the Eighth Ann. Software Eng. Workshop 11 p(SEE N 84-23137 13-61)}, year = {1983}, month = {1983///}, abstract = {Programmers might benefit from larger screens with multiple windows or multiple screens, especially if convenient coordination among screens are arranged. Uses for multiple coordinated displays in a programmers workstation are explored. Initial efforts focus on the potential applications, a command language for coordinating the displays, and the psychological basis for effective utilization so as to avoid information overload. Subsequent efforts will be devoted to implementing the concepts and performing controlled psychologically oriented experiments to validate the hypotheses.}, author = {Shneiderman, Ben and GRANTHAM,C. and Norman,K. and ROGERS,J. and Roussopoulos, Nick} } @article {16528, title = {Expert systems based on set covering model}, journal = {International Journal on Man-Machine Studies}, volume = {19}, year = {1983}, month = {1983///}, pages = {443 - 460}, author = {Reggia, James A. and Dana,S. N. and Pearl,Y. W.} } @article {17151, title = {Exploratory research on training aids for naive users of interactive systems}, journal = {Proceedings of the 44th ASIS Annual Meeting}, volume = {18}, year = {1981}, month = {1981///}, pages = {65 - 67}, author = {Stevens,P. and Shneiderman, Ben} } @article {11936, title = {The Effect of the Future in Work Distribution.}, year = {1980}, month = {1980///}, institution = {COMPUTER SCIENCE CENTER, UNIVERSITY OF MARYLAND COLLEGE PARK}, abstract = {A controller is considered which routes arrivals among several servers of different speeds. A decision which sends work to the server which will complete it soonest does not optimize the average completion time (mean flow time) because it doesn{\textquoteright}t take into account the impact of the decision on future arrivals. This impact on future arrivals, the {\textquoteright}future effect{\textquoteright}, can be significant at high arrival rates. An estimate of the size of the future effect is derived and controllers which take it into account in routing decisions can reduce the average completion time to near optimum. The effect is most pronounced when the service requirements for arrivals are nearly constant, server speeds are markedly different, and the arrival rate is close to the system{\textquoteright}s capacity. A controller considering the future effect will more heavily weigh a potential server{\textquoteright}s backlog than the arrival{\textquoteright}s service time when making a routing decision}, author = {Agrawala, Ashok K. and Ricart, G.} } @article {15749, title = {Estimating Matrix Condition Numbers}, journal = {SIAM Journal on Scientific and Statistical Computing}, volume = {1}, year = {1980}, month = {1980///}, pages = {205 - 209}, author = {O{\textquoteright}Leary, Dianne P.} } @article {16966, title = {An experiment using memorization/reconstruction as a measure of programmer ability}, journal = {International Journal of Man-Machine Studies}, volume = {13}, year = {1980}, month = {1980/10//}, pages = {339 - 354}, abstract = {Measuring the abilities of programmers in a classroom or organizational setting is not a trivial task. Current approaches are not always accurate or reliable. This paper describes an experiment which provides evidence that performance on a memorization/recon- struction test can be used as a measure or predictor of programmer ability. The contribution of indentation in program comprehension is also examined.}, isbn = {0020-7373}, doi = {10.1016/S0020-7373(80)80047-2}, url = {http://www.sciencedirect.com/science/article/pii/S0020737380800472}, author = {Di Persio,Tom and Isbister,Dan and Shneiderman, Ben} } @article {15750, title = {Estimating the Largest Eigenvalue of a Positive Definite Matrix}, journal = {Mathematics of Computation}, volume = {33}, year = {1979}, month = {1979///}, pages = {1289 - 1292}, author = {O{\textquoteright}Leary, Dianne P. and Stewart, G.W. and Vandergraft,James S.} } @article {15748, title = {Elastoplastic torsion by quadratic programming}, journal = {Computer Methods in Applied Mechanics and Engineering}, volume = {16}, year = {1978}, month = {1978/12//}, pages = {361 - 368}, abstract = {A finite element scheme (together with a conjugate gradient algorithm) is demonstrated to be a very effective method for analyzing general elastoplastic torsion of prismatic bars posed as quadratic programming problems. Solutions for bars with elliptical and Sokolovsky{\textquoteright}s oval cross-sections are presented. The solutions for the elliptical bars agree with the existing elastic and limit plastic solutions at the two extremes of the elastic-plastic range. The algorithm also reproduces accurately the Sokolovsky solution and extends it beyond its limitations.}, isbn = {0045-7825}, doi = {10.1016/0045-7825(78)90107-X}, url = {http://www.sciencedirect.com/science/article/pii/004578257890107X}, author = {O{\textquoteright}Leary, Dianne P. and Yang,Wei H.} } @article {18383, title = {Effects of structured programming on PL/I programmers}, journal = {Software: Practice and Experience}, volume = {7}, year = {1977}, month = {1977///}, pages = {793 - 795}, abstract = {A PL/I system has been implemented which automatically collects and saves information on every program compiled and executed. This note describes some of the analysis that has been performed on approximately 9,000 of these collected programs.}, doi = {10.1002/spe.4380070613}, author = {Zelkowitz, Marvin V} } @conference {17140, title = {Evaluating introductory programming textbooks: A guide for students, instructors, authors and publishers}, booktitle = {SIGCSE {\textquoteright}77 Proceedings of the eighth SIGCSE technical symposium on Computer science education}, volume = {9}, year = {1977}, month = {1977/02//}, pages = {56 - 58}, abstract = {My father counseled me not to give advice to others. Inspite of that admonition, I have an irrepressible desire to make some highly subjective, potentially pompous remarks about introductory programming language textbooks. During the past nine years I have evaluated dozens of manuscripts for eight publishers and hundreds of books for teaching term-length introductory courses in FORTRAN, BASIC, PL/I, PASCAL, COBOL and assembly languages. I have co-authored two FORTRAN texts and developed two independent study guides to programming. Each time I see a text, I make judgments by reacting to the material, rather than by comparing the material to a pre-determined set of criteria. In order to provide a {\textquotedblleft}structured{\textquotedblright} review process (no computer-science oriented paper is complete without a reference to {\textquotedblleft}structure{\textquotedblright}), I offer the following criteria for evaluating texts. This list is far from complete, but it is a beginning.}, doi = {10.1145/382175.803434}, url = {http://doi.acm.org/10.1145/382175.803434}, author = {Shneiderman, Ben} } @article {17147, title = {Experimental investigations of the utility of detailed flowcharts in programming}, journal = {Communications of the ACM}, volume = {20}, year = {1977}, month = {1977/06//}, pages = {373 - 381}, abstract = {This paper describes previous research on flowcharts and a series of controlled experiments to test the utility of detailed flowcharts as an aid to program composition, comprehension, debugging, and modification. No statistically significant difference between flowchart and nonflowchart groups has been shown, thereby calling into question the utility of detailed flowcharting. A program of further research is suggested.}, keywords = {Debugging, experimental testing, flowcharts, human factors, modification, program composition, program comprehension}, isbn = {0001-0782}, doi = {10.1145/359605.359610}, url = {http://doi.acm.org/10.1145/359605.359610}, author = {Shneiderman, Ben and Mayer,Richard and McKay,Don and Heller,Peter} } @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 {17150, title = {Exploratory experiments in programmer behavior}, journal = {International Journal of Parallel Programming}, volume = {5}, year = {1976}, month = {1976///}, pages = {123 - 143}, abstract = {The techniques of cognitive psychological experimentation can help resolve specific issues in programming and explore the broader issues of programmer behavior. This paper describes the methodological questions of such experimentation and presents two exploratory experiments: a memorization task and a comparison of the arithmetic and logical IF statements infortran.}, isbn = {0885-7458}, url = {http://dx.doi.org/10.1007/BF00975629}, author = {Shneiderman, Ben} } @conference {17148, title = {Experimental testing in programming languages, stylistic considerations and design techniques}, booktitle = {Proceedings of the May 19-22, 1975, national computer conference and exposition}, series = {AFIPS {\textquoteright}75}, year = {1975}, month = {1975///}, pages = {653 - 656}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {In the early stages of the development of high-level languages, radically differing alternatives were often promulgated. Each language had a dedicated corps of adherents who advocated the primacy of their facility. Turbulent debates among the protagonists were a common affair at conferences and in the trade journals. Now as the field matures, the vehement discussions have subsided and there is a widespread recognition of the usefulness of a variety of languages. Even the proponents of a single universal language have softened their tone and have accepted the multiple language condition.}, doi = {10.1145/1499949.1500087}, url = {http://doi.acm.org/10.1145/1499949.1500087}, author = {Shneiderman, Ben} } @book {17411, title = {The Elements of FORTRAN Style: Techniques for Effective Programming}, year = {1972}, month = {1972///}, publisher = {Harcourt Brace College Publishers}, organization = {Harcourt Brace College Publishers}, isbn = {0155221566}, author = {Kreitzberg,Charles B and Shneiderman, Ben} } @article {15931, title = {An extension of Ackermann{\textquoteright}s set theory}, journal = {Journal of Symbolic Logic}, volume = {37}, year = {1972}, month = {1972///}, pages = {703 - 704}, author = {Perlis, Don} }