@article {20320, title = {Application of a paper based device containing a new culture medium to detect Vibrio cholerae in water samples collected in Haiti}, journal = {Journal of Microbiological Methods}, volume = {133}, year = {2017}, month = {Jan-02-2017}, pages = {23 - 31}, issn = {01677012}, doi = {10.1016/j.mimet.2016.12.014}, url = {https://www.sciencedirect.com/science/article/pii/S0167701216303578?via\%3Dihub}, author = {Briquaire, Romain and Rita R Colwell and Boncy, Jacques and Rossignol, Emmanuel and Dardy, Aline and Pandini, Isabelle and Villeval, Fran{\c c}ois and Machuron, Jean-Louis and Huq, Anwar and Rashed, Shah and Vandevelde, Thierry and Rozand, Christine} } @article {20315, title = {Assessment of Risk of Cholera in Haiti following Hurricane Matthew}, journal = {The American Journal of Tropical Medicine and Hygiene}, volume = {97}, year = {2017}, month = {Jul-09-2017}, pages = {896 - 903}, abstract = {Damage to the inferior and fragile water and sanitation infrastructure of Haiti after Hurricane Matthew has created an urgent public health emergency in terms of likelihood of cholera occurring in the human population. Using satellite-derived data on precipitation, gridded air temperature, and hurricane path and with information on water and sanitation (WASH) infrastructure, we tracked changing environmental conditions conducive for growth of pathogenic vibrios. Based on these data, we predicted and validated the likelihood of cholera cases occurring past hurricane. The risk of cholera in the southwestern part of Haiti remained relatively high since November 2016 to the present. Findings of this study provide a contemporary process for monitoring ground conditions that can guide public health intervention to control cholera in human population by providing access to vaccines, safe WASH facilities. Assuming current social and behavioral patterns remain constant, it is recommended that WASH infrastructure should be improved and considered a priority especially before 2017 rainy season.}, issn = {0002-9637}, doi = {10.4269/ajtmh.17-0048}, url = {http://www.ajtmh.org/content/journals/10.4269/ajtmh.17-0048}, author = {Huq, Anwar and Anwar, Rifat and Rita R Colwell and McDonald, Michael D. and Khan, Rakib and Jutla, Antarpreet and Akanda, Shafqat} } @article {20328, title = {Are natural reservoirs important for cholera surveillance? The case of an outbreak in a Brazilian estuary}, journal = {Letters in Applied Microbiology}, year = {2016}, month = {Jan-09-2016}, pages = {183 - 188}, abstract = {Paranagu{\'a} Bay is one of the largest estuarine systems on the Southern Brazilian coast. The only recorded cholera outbreak in this region since the early 20th century occurred in 1999 and resulted in 467 cases and at least three reported deaths in a population of approx. 150 000 people. This short communication reports historical, unpublished data related to that outbreak. Water, zooplankton and bivalve samples were collected and evaluated using direct fluorescence assay to determine whether Vibrio cholerae serogroups O1 and O139 were present in the estuarine system at that time. Most of the water (83\%) and zooplankton samples (75\%) were positive for V. cholerae O1, while V. cholerae O139 was not detected. Shellfish (Mytella sp.) were also positive for V. cholerae O1. These results indicate that the estuary, including biological vectors such as copepods and bivalves, comprise an important reservoir of V. cholerae O1 and a probable waterborne pathway for the disease, in addition to contamination with untreated sewage. }, doi = {10.1111/lam.12614}, url = {https://onlinelibrary.wiley.com/doi/10.1111/lam.12614}, author = {Martinelli Filho, J.E. and Lopes, R.M. and Rivera, I.N.G. and Rita R Colwell} } @inbook {19629, title = {Adaptive and Concurrent Secure Computation from New Adaptive, Non-malleable Commitments}, booktitle = {Advances in Cryptology - ASIACRYPT 2013}, series = {Lecture Notes in Computer Science}, year = {2013}, month = {2013/01/01/}, pages = {316 - 336}, publisher = {Springer Berlin Heidelberg}, organization = {Springer Berlin Heidelberg}, abstract = {We present a unified approach for obtaining general secure computation that achieves adaptive-Universally Composable (UC)-security. Using our approach we essentially obtain all previous results on adaptive concurrent secure computation, both in relaxed models (e.g., quasi-polynomial time simulation), as well as trusted setup models (e.g., the CRS model, the imperfect CRS model). This provides conceptual simplicity and insight into what is required for adaptive and concurrent security, as well as yielding improvements to set-up assumptions and/or computational assumptions in known models. Additionally, we provide the first constructions of concurrent secure computation protocols that are adaptively secure in the timing model, and the non-uniform simulation model. As a corollary we also obtain the first adaptively secure multiparty computation protocol in the plain model that is secure under bounded-concurrency. Conceptually, our approach can be viewed as an adaptive analogue to the recent work of Lin, Pass and Venkitasubramaniam [STOC {\textquoteleft}09], who considered only non-adaptive adversaries. Their main insight was that the non-malleability requirement could be decoupled from the simulation requirement to achieve UC-security. A main conceptual contribution of this work is, quite surprisingly, that it is still the case even when considering adaptive security. A key element in our construction is a commitment scheme that satisfies a strong definition of non-malleability. Our new primitive of concurrent equivocal non-malleable commitments, intuitively, guarantees that even when a man-in-the-middle adversary observes concurrent equivocal commitments and decommitments, the binding property of the commitments continues to hold for commitments made by the adversary. This definition is stronger than previous ones, and may be of independent interest. Previous constructions that satisfy our definition have been constructed in setup models, but either require existence of stronger encryption schemes such as CCA-secure encryption or require independent {\textquotedblleft}trapdoors{\textquotedblright} provided by the setup for every pair of parties to ensure non-malleability. A main technical contribution of this work is to provide a construction that eliminates these requirements and requires only a single trapdoor.}, keywords = {Algorithm Analysis and Problem Complexity, Applications of Mathematics, Data Encryption, Discrete Mathematics in Computer Science, Management of Computing and Information Systems, Systems and Data Security}, isbn = {978-3-642-42032-0, 978-3-642-42033-7}, url = {http://link.springer.com/chapter/10.1007/978-3-642-42033-7_17}, author = {Dana Dachman-Soled and Malkin, Tal and Raykova, Mariana and Venkitasubramaniam, Muthuramakrishnan}, editor = {Sako, Kazue and Sarkar, Palash} } @conference {19214, title = {Age-Related Differences in Performance with Touchscreens Compared to Traditional Mouse Input}, booktitle = {CHI 2013 To Appear}, year = {2013}, month = {2013}, abstract = {Despite the apparent popularity of touch screen for older adults, little is known about the psychomotor performance of these devices. We compare performance between older adults and younger adults in four desktop and touchscreen tasks: pointing, dragging, crossing and steering. On the touchscreen, we also examine pinch zoom. Our results show that while older adults were significantly slower than younger adults in general, the touchscreen reduced the performance gap relative to the desktop and mouse. Indeed, the touchscreen resulted in a significant movement time reduction of 35\% over the mouse for older adults, compared to only 16\% for younger adults. Error rates also decreased. }, author = {Findlater,L. and Jon Froehlich and Fattal, K. and Wobbrock,J.O. and Dastyar, T.} } @article {19684, title = {Argviz: Interactive Visualization of Topic Dynamics in Multi-party Conversations}, journal = {Human Language Technologies: The 2013 Annual Conference of the North American Chapter of the Association for Computational Linguistics}, year = {2013}, month = {2013/00/01}, abstract = {Abstract We introduce an efficient, interactive framework{\textemdash}Argviz{\textemdash}for experts to analyze the dynamic topical structure of multi-party conversations. Users inject their needs, expertise, and insights into models via iterative topic refinement. The refined topics feed into a ...}, url = {https://www.aclweb.org/anthology-new/N/N13/N13-3.pdf$\#$page=42}, author = {Nguyen, V A and Hu, Y and Jordan Boyd-Graber} } @article {20375, title = {An additional step in the transmission of Yersinia pestis?}, journal = {The ISME Journal}, year = {2012}, month = {Jan-02-2012}, pages = {231 - 236}, abstract = {Plague, caused by the bacterium Yersinia pestis, is a mammalian vector-borne disease, transmitted by fleas that serve as the vector between rodent hosts. For many pathogens, including Y. pestis, there are strong evolutionary pressures that lead to a reduction in {\textquoteleft}useless genes{\textquoteright}, with only those retained that reflect function in the specific environment inhabited by the pathogen. Genetic traits critical for survival and transmission between two environments, the rodent and the flea, are conserved in epizootic/epidemic plague strains. However, there are genes that remain conserved for which no function in the flea{\textendash}rodent cycle has yet been observed, indicating an additional environment may exist in the transmission cycle of plague. Here, we present evidence for highly conserved genes that suggests a role in the persistence of Y. pestis after death of its host. Furthermore, maintenance of these genes points to Y. pestis traversing a post-mortem path between, and possibly within, epizootic periods and offering insight into mechanisms that may allow Y. pestis an alternative route of transmission in the natural environment.}, issn = {1751-7362}, doi = {10.1038/ismej.2011.105}, url = {http://www.nature.com/articles/ismej2011105}, author = {Easterday, W Ryan and Kausrud, Kyrre L and Star, Bastiaan and Heier, Lise and Haley, Bradd J and Ageyev, Vladimir and Rita R Colwell and Stenseth, Nils Chr} } @book {15503, title = {Advances in Computers}, year = {2012}, month = {2012/05/01/}, publisher = {Academic Press}, organization = {Academic Press}, abstract = {Since its first volume in 1960, Advances in Computers has presented detailed coverage of innovations in computer hardware, software, theory, design, and applications. It has also provided contributors with a medium in which they can explore their subjects in greater depth and breadth than journal articles usually allow. As a result, many articles have become standard references that continue to be of sugnificant, lasting value in this rapidly expanding field. In-depth surveys and tutorials on new computer technologyWell-known authors and researchers in the fieldExtensive bibliographies with most chaptersMany of the volumes are devoted to single themes or subfields of computer science}, keywords = {Computers / Programming / General, Computers / Software Development \& Engineering / General, Mathematics / General}, isbn = {9780123964786}, author = {Memon, Atif M.} } @article {19130, title = {AGORA: Assembly Guided by Optical Restriction Alignment}, journal = {BMC bioinformatics}, volume = {13}, year = {2012}, month = {2012}, abstract = {Genome assembly is difficult due to repeated sequences within the genome, which create ambiguities and cause the final assembly to be broken up into many separate sequences (contigs). Long range linking information, such as mate-pairs or mapping data, is necessary to help assembly software resolve repeats, thereby leading to a more complete reconstruction of genomes. Prior work has used optical maps for validating assemblies and scaffolding contigs, after an initial assembly has been produced. However, optical maps have not previously been used within the genome assembly process. Here, we use optical map information within the popular de Bruijn graph assembly paradigm to eliminate paths in the de Bruijn graph which are not consistent with the optical map and help determine the correct reconstruction of the genome.We developed a new algorithm called AGORA: Assembly Guided by Optical Restriction Alignment. AGORA is the first algorithm to use optical map information directly within the de Bruijn graph framework to help produce an accurate assembly of a genome that is consistent with the optical map information provided. Our simulations on bacterial genomes show that AGORA is effective at producing assemblies closely matching the reference sequences. Additionally, we show that noise in the optical map can have a strong impact on the final assembly quality for some complex genomes, and we also measure how various characteristics of the starting de Bruijn graph may impact the quality of the final assembly. Lastly, we show that a proper choice of restriction enzyme for the optical map may substantially improve the quality of the final assembly. Our work shows that optical maps can be used effectively to assemble genomes within the de Bruijn graph assembly framework. Our experiments also provide insights into the characteristics of the mapping data that most affect the performance of our algorithm, indicating the potential benefit of more accurate optical mapping technologies, such as nano-coding. }, author = {Lin, H.C. and Goldstein, S. and Mendelowitz, L. and Zhou, S. and Wetzel, J. and Schwartz, D.C. and Pop, Mihai} } @article {19723, title = {Archaeosortases and exosortases are widely distributed systems linking membrane transit with posttranslational modification.}, journal = {J Bacteriol}, volume = {194}, year = {2012}, month = {2012 Jan}, pages = {36-48}, abstract = {

Multiple new prokaryotic C-terminal protein-sorting signals were found that reprise the tripartite architecture shared by LPXTG and PEP-CTERM: motif, TM helix, basic cluster. Defining hidden Markov models were constructed for all. PGF-CTERM occurs in 29 archaeal species, some of which have more than 50 proteins that share the domain. PGF-CTERM proteins include the major cell surface protein in Halobacterium, a glycoprotein with a partially characterized diphytanylglyceryl phosphate linkage near its C terminus. Comparative genomics identifies a distant exosortase homolog, designated archaeosortase A (ArtA), as the likely protein-processing enzyme for PGF-CTERM. Proteomics suggests that the PGF-CTERM region is removed. Additional systems include VPXXXP-CTERM/archeaosortase B in two of the same archaea and PEF-CTERM/archaeosortase C in four others. Bacterial exosortases often fall into subfamilies that partner with very different cohorts of extracellular polymeric substance biosynthesis proteins; several species have multiple systems. Variant systems include the VPDSG-CTERM/exosortase C system unique to certain members of the phylum Verrucomicrobia, VPLPA-CTERM/exosortase D in several alpha- and deltaproteobacterial species, and a dedicated (single-target) VPEID-CTERM/exosortase E system in alphaproteobacteria. Exosortase-related families XrtF in the class Flavobacteria and XrtG in Gram-positive bacteria mark distinctive conserved gene neighborhoods. A picture emerges of an ancient and now well-differentiated superfamily of deeply membrane-embedded protein-processing enzymes. Their target proteins are destined to transit cellular membranes during their biosynthesis, during which most undergo additional posttranslational modifications such as glycosylation.

}, keywords = {Amino Acid Sequence, Aminoacyltransferases, Archaeal Proteins, Bacterial Proteins, Cell Membrane, Cysteine Endopeptidases, Gene Expression Regulation, Archaeal, Gene Expression Regulation, Bacterial, Gene Expression Regulation, Enzymologic, Molecular Sequence Data, Protein Processing, Post-Translational}, issn = {1098-5530}, doi = {10.1128/JB.06026-11}, author = {Haft, Daniel H and Payne, Samuel H and Jeremy D Selengut} } @conference {19487, title = {Ask WINE: Are We Safer Today? Evaluating Operating System Security Through Big Data Analysis}, booktitle = {LEET{\textquoteright}12 Proceedings of the 5th USENIX conference on Large-Scale Exploits and Emergent Threats}, series = {LEET{\textquoteright}12}, year = {2012}, month = {2012/04/24/}, pages = {11 - 11}, publisher = {USENIX Association}, organization = {USENIX Association}, abstract = {The Internet can be a dangerous place: 800,000 new malware variants are detected each day, and this number is growing at an exponential rate--driven by the quest for economic gains. However, over the past ten years operating-system vendors have introduced a number of security technologies that aim to make exploits harder and to reduce the attack surface of the platform. Faced with these two conflicting trends, it is difficult for end-users to determine what techniques make them safer from Internet attacks. In this position paper, we argue that to answer this question conclusively we must analyze field data collected on real hosts that are targeted by attacks--e.g., the approximately 50 million records of anti-virus telemetry available through Symantec{\textquoteright}s WINE platform. Such studies can characterize the factors that drive the production of malware, can help us understand the impact of security technologies in the real world and can suggest new security metrics, derived from field observations rather than small lab experiments, indicating how susceptible to attacks a computing platform may be.}, url = {http://dl.acm.org/citation.cfm?id=2228340.2228356}, author = {Tudor Dumitras and Efstathopoulos, Petros} } @article {18820, title = {Automated synthesis of action selection policies for unmanned vehicles operating in adverse environments}, journal = {Autonomous Robots}, volume = {32}, year = {2012}, month = {2012///}, pages = {149 - 164}, abstract = {We address the problem of automated action selection policy synthesis for unmanned vehicles operating in adverse environments. We introduce a new evolutionary computation-based approach using which an initial version of the policy is automatically generated and then gradually refined by detecting and fixing its shortcomings. The synthesis technique consists of the automated extraction of the vehicle{\textquoteright}s exception states and Genetic Programming (GP) for automated composition and optimization of corrective sequences of commands in the form of macro-actions to be applied locally. The focus is specifically on automated synthesis of a policy for Unmanned Surface Vehicle (USV) to efficiently block the advancement of an intruder boat toward a valuable target. This task requires the USV to utilize reactive planning complemented by short-term forward planning to generate specific maneuvers for blocking. The intruder is human-competitive and exhibits a deceptive behavior so that the USV cannot exploit regularity in its attacking behavior. We compared the performance of a hand-coded blocking policy to the performance of a policy that was automatically synthesized. Our results show that the performance of the automatically generated policy exceeds the performance of the hand-coded policy and thus demonstrates the feasibility of the proposed approach.}, keywords = {Computer science}, isbn = {0929-5593}, doi = {10.1007/s10514-011-9268-6}, url = {http://www.springerlink.com/content/664k84x080868141/abstract/}, author = {Svec,Petr and Gupta, Satyandra K.} } @article {13505, title = {Automatic Authentication of Banknotes}, journal = {IEEE Transactions on Information Forensics \& Security}, year = {2012}, month = {2012///}, abstract = {In this paper, we address the problem of the automatic authentication of paper currency. Indian banknotes are used to show how a system can be developed for discriminating counterfeit notes from genuine notes. Image processing and pattern recognition techniques are designed to carefully analyze embedded security features. Experiments conducted on forensic samples show that a high precision low cost machine can be developed to address this problem. The analysis of current security features{\textquoteright} ability to protect against counterfeiting also suggest topics that should be considered in designing future currency notes.}, author = {Roy,Ankush and Halder,Biswaiit and Garain,Utpal and David Doermann} } @conference {17746, title = {Abduction in Annotated Probabilistic Temporal Logic}, booktitle = {Technical Communications of the 27th International Conference on Logic Programming (ICLP{\textquoteright}11)}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, volume = {11}, year = {2011}, month = {2011///}, pages = {240 - 250}, publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}, organization = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}, abstract = {Annotated Probabilistic Temporal (APT) logic programs are a form of logic programs that allow users to state (or systems to automatically learn)rules of the form {\textquoteleft}{\textquoteleft}formula G becomes true K time units after formula F became true with L to U\% probability.{\textquoteright}{\textquoteright} In this paper, we develop a theory of abduction for APT logic programs. Specifically, given an APT logic program Pi, a set of formulas H that can be {\textquoteleft}{\textquoteleft}added{\textquoteright}{\textquoteright} to Pi, and a goal G, is there a subset S of H such that Pi \cup S is consistent and entails the goal G? In this paper, we study the complexity of the Basic APT Abduction Problem (BAAP). We then leverage a geometric characterization of BAAP to suggest a set of pruning strategies when solving BAAP and use these intuitions to develop a sound and complete algorithm.}, isbn = {978-3-939897-31-6}, doi = {http://dx.doi.org/10.4230/LIPIcs.ICLP.2011.240}, author = {Molinaro,Cristian and Sliva,Amy and V.S. Subrahmanian} } @article {19181, title = {Ability-based design: Concept, principles and examples}, journal = {ACM Transactions on Accessible Computing (TACCESS)}, volume = {3}, year = {2011}, month = {2011}, author = {Wobbrock,J.O. and Kane,S.K. and Gajos,K.Z. and Harada,S. and Jon Froehlich} } @article {19583, title = {Abstracting Abstract Machines: A Systematic Approach to Higher-Order Program Analysis}, journal = {arXiv:1105.1743 [cs]}, year = {2011}, note = {Comment: Communications of the ACM, Research Highlight}, month = {2011/05/09/}, abstract = {Predictive models are fundamental to engineering reliable software systems. However, designing conservative, computable approximations for the behavior of programs (static analyses) remains a difficult and error-prone process for modern high-level programming languages. What analysis designers need is a principled method for navigating the gap between semantics and analytic models: analysis designers need a method that tames the interaction of complex languages features such as higher-order functions, recursion, exceptions, continuations, objects and dynamic allocation. We contribute a systematic approach to program analysis that yields novel and transparently sound static analyses. Our approach relies on existing derivational techniques to transform high-level language semantics into low-level deterministic state-transition systems (with potentially infinite state spaces). We then perform a series of simple machine refactorings to obtain a sound, computable approximation, which takes the form of a non-deterministic state-transition systems with finite state spaces. The approach scales up uniformly to enable program analysis of realistic language features, including higher-order functions, tail calls, conditionals, side effects, exceptions, first-class continuations, and even garbage collection.}, keywords = {Computer Science - Programming Languages, F.3.2, F.4.1}, url = {http://arxiv.org/abs/1105.1743}, author = {David Van Horn and Might, Matthew} } @article {14592, title = {Accelerated evolution of 3{\textquoteright}avian FOXE1 genes, and thyroid and feather specific expression of chicken FoxE1}, journal = {BMC Evolutionary Biology}, volume = {11}, year = {2011}, month = {2011/10/15/}, pages = {302 - 302}, abstract = {The forkhead transcription factor gene E1 (FOXE1) plays an important role in regulation of thyroid development, palate formation and hair morphogenesis in mammals. However, avian FOXE1 genes have not been characterized and as such, codon evolution of FOXE1 orthologs in a broader evolutionary context of mammals and birds is not known.}, isbn = {1471-2148}, doi = {10.1186/1471-2148-11-302}, url = {http://www.biomedcentral.com/1471-2148/11/302}, author = {Yaklichkin,Sergey Yu and Darnell,Diana K and Pier,Maricela V and Antin,Parker B and Hannenhalli, Sridhar} } @article {16241, title = {Accurate and fast estimation of taxonomic profiles from metagenomic shotgun sequences}, journal = {BMC Genomics}, volume = {12}, year = {2011}, month = {2011/07/27/}, pages = {S4 - S4}, abstract = {A major goal of metagenomics is to characterize the microbial composition of an environment. The most popular approach relies on 16S rRNA sequencing, however this approach can generate biased estimates due to differences in the copy number of the gene between even closely related organisms, and due to PCR artifacts. The taxonomic composition can also be determined from metagenomic shotgun sequencing data by matching individual reads against a database of reference sequences. One major limitation of prior computational methods used for this purpose is the use of a universal classification threshold for all genes at all taxonomic levels.}, isbn = {1471-2164}, doi = {10.1186/1471-2164-12-S2-S4}, url = {http://www.biomedcentral.com/1471-2164/12/S2/S4}, author = {Liu,Bo and Gibbons,Theodore and Ghodsi,Mohammad and Treangen,Todd and Pop, Mihai} } @article {19650, title = {Accurate proteome-wide protein quantification from high-resolution 15N mass spectra}, journal = {Genome Biology}, volume = {12}, year = {2011}, month = {2011/12/19/}, abstract = {In quantitative mass spectrometry-based proteomics, the metabolic incorporation of a single source of 15N-labeled nitrogen has many advantages over using stable isotope-labeled amino acids. However, the lack of a robust computational framework for analyzing the resulting spectra has impeded wide use of this approach. We have addressed this challenge by introducing a new computational methodology for analyzing 15N spectra in which quantification is integrated with identification. Application of this method to an Escherichia coli growth transition reveals significant improvement in quantification accuracy over previous methods.PMID: 22182234 }, isbn = {1465-6906}, url = {http://genomebiology.com/2011/12/12/R122/abstract}, author = {Zia Khan and Amini, Sasan and Bloom, Joshua S. and Ruse, Cristian and Caudy, Amy A. and Kruglyak, Leonid and Singh, Mona and Perlman, David H. and Tavazoie, Saeed} } @article {15158, title = {On Achieving the" Best of Both Worlds" in Secure Multiparty Computation}, journal = {SIAM Journal on Computing}, volume = {40}, year = {2011}, month = {2011///}, pages = {122 - 122}, abstract = {Two settings are traditionally considered for secure multiparty computation, de-pending on whether or not a majority of the parties are assumed to be honest. Existing protocols that assume an honest majority provide {\textquotedblleft}full security{\textquotedblright} (and, in particular, guarantee output delivery and fairness) when this assumption holds, but are completely insecure if this assumption is violated. On the other hand, known protocols tolerating an arbitrary number of corruptions do not guarantee fairness or output delivery even if only a single party is dishonest. It is natural to wonder whether it is possible to achieve the {\textquotedblleft}best of both worlds{\textquotedblright}: namely, a single protocol that simultaneously achieves the best possible security in both the above settings. Here, we rule out this possibility (at least for general functionalities) and show some positive results regarding what can be achieved. }, author = {Ishai,Y. and Katz, Jonathan and Kushilevitz,E. and Lindell,Y. and Petrank,E.} } @conference {13071, title = {Action recognition using Partial Least Squares and Support Vector Machines}, booktitle = {Image Processing (ICIP), 2011 18th IEEE International Conference on}, year = {2011}, month = {2011/09//}, pages = {533 - 536}, abstract = {We introduce an action recognition approach based on Partial Least Squares (PLS) and Support Vector Machines (SVM). We extract very high dimensional feature vectors representing spatio-temporal properties of actions and use multiple PLS regressors to find relevant features that distinguish amongst action classes. Finally, we use a multi-class SVM to learn and classify those relevant features. We applied our approach to INRIA{\textquoteright}s IXMAS dataset. Experimental results show that our method is superior to other methods applied to the IXMAS dataset.}, keywords = {analysis;support, approach;multiclass, approximations;regression, dataset;action, dimensional, extraction;feature, extraction;image, feature, high, INRIA, IXMAS, least, machines;, machines;very, partial, properties;support, recognition, recognition;least, regressors;spatiotemporal, squares, SVM;multiple, vector, vectors}, doi = {10.1109/ICIP.2011.6116399}, author = {Ramadan,S. and Davis, Larry S.} } @conference {14431, title = {Active inference for retrieval in camera networks}, booktitle = {Person-Oriented Vision (POV), 2011 IEEE Workshop on}, year = {2011}, month = {2011/01//}, pages = {13 - 20}, abstract = {We address the problem of searching camera network videos to retrieve frames containing specified individuals. We show the benefit of utilizing a learned probabilistic model that captures dependencies among the cameras. In addition, we develop an active inference framework that can request human input at inference time, directing human attention to the portions of the videos whose correct annotation would provide the biggest performance improvements. Our primary contribution is to show that by mapping video frames in a camera network onto a graphical model, we can apply collective classification and active inference algorithms to significantly increase the performance of the retrieval system, while minimizing the number of human annotations required.}, keywords = {active, annotation;probabilistic, frame;cameras;inference, inference;camera, mechanisms;probability;search, model;human, model;retrieval, network;graphical, problem;video, problems;video, processing;, retrieval;video, signal, system;searching}, doi = {10.1109/POV.2011.5712363}, author = {Daozheng Chen and Bilgic,M. and Getoor, Lise and Jacobs, David W. and Mihalkova,L. and Tom Yeh} } @conference {18330, title = {Active inference for retrieval in camera networks}, booktitle = {Person-Oriented Vision (POV), 2011 IEEE Workshop on}, year = {2011}, month = {2011/01//}, pages = {13 - 20}, publisher = {IEEE}, organization = {IEEE}, abstract = {We address the problem of searching camera network videos to retrieve frames containing specified individuals. We show the benefit of utilizing a learned probabilistic model that captures dependencies among the cameras. In addition, we develop an active inference framework that can request human input at inference time, directing human attention to the portions of the videos whose correct annotation would provide the biggest performance improvements. Our primary contribution is to show that by mapping video frames in a camera network onto a graphical model, we can apply collective classification and active inference algorithms to significantly increase the performance of the retrieval system, while minimizing the number of human annotations required.}, isbn = {978-1-61284-036-9}, doi = {10.1109/POV.2011.5712363}, url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=5712363\&tag=1}, author = {Daozheng Chen and Bilgic,Mustafa and Getoor, Lise and Jacobs, David W. and Mihalkova,Lilyana and Tom Yeh} } @conference {16042, title = {Active progress bars: facilitating the switch to temporary activities}, booktitle = {Proceedings of the 2011 annual conference extended abstracts on Human factors in computing systems}, series = {CHI EA {\textquoteright}11}, year = {2011}, month = {2011///}, pages = {1963 - 1968}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {In this paper, we seek to find a better way of effective task management when a progress bar interrupts user{\textquoteright}s primary activity. We propose to augment progress bars with user controlled functionalities facilitating the switch to temporary activities. We detail a taxonomy of waiting period contexts and possible temporary tasks, then report on 5 participatory design, and a follow-up survey of 96 respondents. Finally we describe an early prototype of active progress bars, and report on initial use.}, keywords = {Frustration, participatory design, progress bars, task switching}, isbn = {978-1-4503-0268-5}, doi = {10.1145/1979742.1979883}, url = {http://doi.acm.org/10.1145/1979742.1979883}, author = {Hurter,Christophe and Girouard,Audrey and Riche,Nathalie and Plaisant, Catherine} } @conference {14192, title = {Active scene recognition with vision and language}, booktitle = {2011 IEEE International Conference on Computer Vision (ICCV)}, year = {2011}, month = {2011/11/06/13}, pages = {810 - 817}, publisher = {IEEE}, organization = {IEEE}, abstract = {This paper presents a novel approach to utilizing high level knowledge for the problem of scene recognition in an active vision framework, which we call active scene recognition. In traditional approaches, high level knowledge is used in the post-processing to combine the outputs of the object detectors to achieve better classification performance. In contrast, the proposed approach employs high level knowledge actively by implementing an interaction between a reasoning module and a sensory module (Figure 1). Following this paradigm, we implemented an active scene recognizer and evaluated it with a dataset of 20 scenes and 100+ objects. We also extended it to the analysis of dynamic scenes for activity recognition with attributes. Experiments demonstrate the effectiveness of the active paradigm in introducing attention and additional constraints into the sensing process.}, keywords = {accuracy, active scene recognition, classification performance, Cognition, Computer vision, Detectors, Equations, high level knowledge utilization, HUMANS, image classification, inference mechanisms, object detectors, Object recognition, reasoning module, sensing process, sensory module, support vector machines, Training}, isbn = {978-1-4577-1101-5}, doi = {10.1109/ICCV.2011.6126320}, author = {Yu,Xiaodong and Ferm{\"u}ller, Cornelia and Ching Lik Teo and Yezhou Yang and Aloimonos, J.} } @conference {14496, title = {Active Surveying: A Probabilistic Approach for Identifying Key Opinion Leaders}, booktitle = {Twenty-Second International Joint Conference on Artificial Intelligence}, year = {2011}, month = {2011///}, abstract = {Opinion leaders play an important role in influenc- ing people{\textquoteright}s beliefs, actions and behaviors. Al- though a number of methods have been proposed for identifying influentials using secondary sources of information, the use of primary sources, such as surveys, is still favored in many domains. In this work we present a new surveying method which combines secondary data with partial knowl- edge from primary sources to guide the information gathering process. We apply our proposed active surveying method to the problem of identifying key opinion leaders in the medical field, and show how we are able to accurately identify the opinion lead- ers while minimizing the amount of primary data required, which results in significant cost reduction in data acquisition without sacrificing its integrity.}, author = {Sharara,H. and Getoor, Lise and Norton,M.} } @conference {16815, title = {Adapting a map query interface for a gesturing touch screen interface}, booktitle = {Proceedings of the 20th international conference companion on World wide web}, series = {WWW {\textquoteright}11}, year = {2011}, month = {2011///}, pages = {257 - 260}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {NewsStand is an example application of a general framework that we are developing to enable searching for information using a map query interface, where the information results from monitoring the output of over 8,000 RSS news sources and is available for retrieval within minutes of publication. The user interface of NewsStand was recently adapted so that NewsStand can execute on mobile and tablet devices with a gesturing touch screen interface such as the iPhone, iPod Touch, and iPad. This action led to a discovery of some shortcomings of current mapping APIs as well as devising some interesting new widgets. These issues are discussed, and the realization can be seen by a demo at http://newsstand.umiacs.umd.edu on any of the above Apple devices as well as other devices that support gestures such as an Android phone.}, keywords = {map query interface, newsstand, touch screen gesturing interface}, isbn = {978-1-4503-0637-9}, doi = {10.1145/1963192.1963303}, url = {http://doi.acm.org/10.1145/1963192.1963303}, author = {Samet, Hanan and Teitler,Benjamin E. and Adelfio,Marco D. and Lieberman,Michael D.} } @article {15142, title = {Adaptively secure broadcast, revisited}, journal = {Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing}, year = {2011}, month = {2011///}, abstract = {We consider the classical problem of synchronous broadcast with dishonest majority, whena public-key infrastructure and digital signatures are available. In a surprising result, Hirt and Zikas (Eurocrypt 2010) recently observed that all existing protocols for this task are insecure against an adaptive adversary who can choose which parties to corrupt as the protocol progresses. Moreover, they prove an impossibility result for adaptively secure broadcast in their setting. We argue that the communication model adopted by Hirt and Zikas is unrealistically pes- simistic. We revisit the problem of adaptively secure broadcast in a more natural synchronous model (with rushing), and show that broadcast is possible in this setting for an arbitrary num- ber of corruptions. Our positive result holds under a strong, simulation-based definition in the universal-composability framework. We also study the impact of adaptive attacks on protocols for secure multi-party computation where broadcast is used as a sub-routine. }, author = {Garay,J. A and Katz, Jonathan and Kumaresan,R. and Zhou,H.S.} } @article {12461, title = {Advances in Video-Based Biometrics}, journal = {Advances in Imaging and Electron Physics}, volume = {83}, year = {2011}, month = {2011///}, pages = {183 - 203}, author = {Chellapa, Rama and Turaga,P.} } @article {16400, title = {Agent-based modeling in marketing: Guidelines for rigor}, journal = {International Journal of Research in Marketing}, volume = {28}, year = {2011}, month = {2011/09//}, pages = {181 - 193}, abstract = {Agent-based modeling can illuminate how complex marketing phenomena emerge from simple decision rules. Marketing phenomena that are too complex for conventional analytical or empirical approaches can often be modeled using this approach. Agent-based modeling investigates aggregate phenomena by simulating the behavior of individual {\textquotedblleft}agents,{\textquotedblright} such as consumers or organizations. Some useful examples of agent-based modeling have been published in marketing journals, but widespread acceptance of the agent-based modeling method and publication of this method in the highest-level marketing journals have been slowed by the lack of widely accepted standards of how to do agent-based modeling rigorously. We address this need by proposing guidelines for rigorous agent-based modeling. We demonstrate these guidelines, and the value of agent-based modeling for marketing research, through the use of an example. We use an agent-based modeling approach to replicate the Bass model of the diffusion of innovations, illustrating the use of the proposed guidelines to ensure the rigor of the analysis. We also show how extensions of the Bass model that would be difficult to carry out using traditional marketing research techniques are possible to implement using a rigorous agent-based approach.}, isbn = {0167-8116}, doi = {10.1016/j.ijresmar.2011.04.002}, url = {http://www.sciencedirect.com/science/article/pii/S0167811611000504}, author = {Rand, William and Rust,Roland T.} } @article {19279, title = {Analysis of SystemC actor networks for efficient synthesis}, journal = {ACM Trans. Embed. Comput. Syst.}, volume = {10}, year = {2011}, month = {2011}, pages = {18:1 - 18:34}, abstract = {Applications in the signal processing domain are often modeled by dataflow graphs. Due to heterogeneous complexity requirements, these graphs contain both dynamic and static dataflow actors. In previous work, we presented a generalized clustering approach for these heterogeneous dataflow graphs in the presence of unbounded buffers. This clustering approach allows the application of static scheduling methodologies for static parts of an application during embedded software generation for multiprocessor systems. It systematically exploits the predictability and efficiency of the static dataflow model to obtain latency and throughput improvements. In this article, we present a generalization of this clustering technique to dataflow graphs with bounded buffers, therefore enabling synthesis for embedded systems without dynamic memory allocation. Furthermore, a case study is given to demonstrate the performance benefits of the approach.}, keywords = {actor-oriented design, clustering, Dataflow analysis, scheduling}, isbn = {1539-9087}, url = {http://doi.acm.org/10.1145/1880050.1880054}, author = {Falk, Joachim and Zebelein, Christian and Keinert, Joachim and Haubelt, Christian and Teich, Juergen and Bhattacharyya, Shuvra S.} } @article {16044, title = {Analyzing Incident Management Event Sequences with Interactive Visualization}, journal = {Transportation Research Board 90th Annual Meeting Compendium of Papers}, year = {2011}, month = {2011///}, abstract = {While traditional safety and incident analysis has mostly focused on incident attributesdata, such as the location and time of the incident, there are other aspects in incident response that are temporal in nature and are more difficult to analyze. We describe a visual analytics tool for temporal data exploration, called LifeFlow, used for the analysis of incident response data. LifeFlow provides user-controlled overviews of event sequences (e.g. notification, arrival, clearance etc). It allows analysts to interactively explore temporal patterns, find anomalies in sequences and compare management practices. This type of analysis can potentially lead to process improvements and save human lives. We used NCHRP traffic incident data with more than 200,000 incidents are reported by 8 different agencies in a period of about 28 months. Our experience suggest that even non expert analysts can spot many anomalies in the data using the LifeFlow overviews, and are able to rapidly ask many questions and find differences between agencies. }, author = {Guerra G{\'o}mez,J. and Wongsuphasawat,K. and Wang,T. D and Pack,M. and Plaisant, Catherine} } @article {17745, title = {Annotated probabilistic temporal logic}, journal = {ACM Trans. Comput. Logic}, volume = {12}, year = {2011}, month = {2011/01//}, pages = {14:1{\textendash}14:44 - 14:1{\textendash}14:44}, abstract = {The semantics of most logics of time and probability is given via a probability distribution over threads, where a thread is a structure specifying what will be true at different points in time (in the future). When assessing the probabilities of statements such as {\textquotedblleft}Event a will occur within 5 units of time of event b,{\textquotedblright} there are many different semantics possible, even when assessing the truth of this statement within a single thread. We introduce the syntax of annotated probabilistic temporal (APT) logic programs and axiomatically introduce the key notion of a frequency function (for the first time) to capture different types of intrathread reasoning, and then provide a semantics for intrathread and interthread reasoning in APT logic programs parameterized by such frequency functions. We develop a comprehensive set of complexity results for consistency checking and entailment in APT logic programs, together with sound and complete algorithms to check consistency and entailment. The basic algorithms use linear programming, but we then show how to substantially and correctly reduce the sizes of these linear programs to yield better computational properties. We describe a real world application we are developing using APT logic programs.}, keywords = {frequency functions, imprecise probabilities, Probabilistic and temporal reasoning, threads}, isbn = {1529-3785}, doi = {10.1145/1877714.1877720}, url = {http://doi.acm.org/10.1145/1877714.1877720}, author = {Shakarian,Paulo and Parker,Austin and Simari,Gerardo and V.S. Subrahmanian} } @conference {13423, title = {Ant Colony Optimization in a Changing Environment}, booktitle = {2011 AAAI Fall Symposium Series}, year = {2011}, month = {2011/03/11/}, abstract = {Ant colony optimization (ACO) algorithms are computational problem-solving methods that are inspired by the complex behaviors of ant colonies; specifically, the ways in which ants interact with each other and their environment to optimize the overall performance of the ant colony. Our eventual goal is to develop and experiment with ACO methods that can more effectively adapt to dynamically changing environments and problems. We describe biological ant systems and the dynamics of their environments and behaviors. We then introduce a family of dynamic ACO algorithms that can handle dynamic modifications of their inputs. We report empirical results, showing that dynamic ACO algorithms can effectively adapt to time-varying environments.}, url = {http://www.aaai.org/ocs/index.php/FSS/FSS11/paper/viewPaper/4223}, author = {Seymour,John Jefferson and Tuzo,Joseph and desJardins, Marie} } @conference {19269, title = {Applying graphics processor acceleration in a software defined radio prototyping environment}, booktitle = {2011 22nd IEEE International Symposium on Rapid System Prototyping (RSP)}, year = {2011}, month = {2011}, pages = {67 - 73}, abstract = {With higher bandwidth requirements and more complex protocols, software defined radio (SDR) has ever growing computational demands. SDR applications have different levels of parallelism that can be exploited on multicore platforms, but design and programming difficulties have inhibited the adoption of specialized multicore platforms like graphics processors (GPUs). In this work we propose a new design flow that augments a popular existing SDR development environment (GNU Radio), with a dataflow foundation and a stand-alone GPU accelerated library. The approach gives an SDR developer the ability to prototype a GPU accelerated application and explore its design space fast and effectively. We demonstrate this design flow on a standard SDR benchmark and show that deciding how to utilize a GPU can be non-trivial for even relatively simple applications.}, keywords = {Acceleration, coprocessors, dataflow foundation, GNU radio, Graphics processing unit, graphics processor acceleration, Kernel, Libraries, multicore platforms, Multicore processing, PARALLEL PROCESSING, Pipelines, Protocols, software defined radio prototyping environment, software radio, stand-alone GPU accelerated library}, author = {Plishker,W. and Zaki, G.F. and Bhattacharyya, Shuvra S. and Clancy, C. and Kuykendall, J.} } @article {15616, title = {Approximate polytope membership queries}, journal = {Proceedings of 43rd Annual ACM Symposium on Theory of Computing}, year = {2011}, month = {2011///}, pages = {579 - 586}, abstract = {We consider an approximate version of a fundamental geo-metric search problem, polytope membership queries. Given a convex polytope P in Rd, presented as the intersection of halfspaces, the objective is to preprocess P so that, given a query point q, it is possible to determine efficiently whether q lies inside P subject to an error bound ε. Previous solutions to this problem were based on straight- forward applications of classic polytope approximation tech- niques by Dudley (1974) and Bentley et al. (1982). The former yields minimum storage, and the latter yields con- stant query time. A space-time tradeoff can be obtained by interpolating between the two. We present the first sig- nificant improvements to this tradeoff. For example, using the same storage as Dudley, we reduce the query time from O(1/ε (d-1)/2 ) to O(1/ε (d-1)/4 ). Our approach is based on a very simple algorithm. Both lower bounds and upper bounds on the performance of the algorithm are presented. To establish the relevance of our results, we introduce a reduction from approximate nearest neighbor searching to approximate polytope membership queries. We show that our tradeoff provides significant improvements to the best known space-time tradeoffs for approximate nearest neigh- bor searching. Furthermore, this is achieved with construc- tions that are much simpler than existing methods }, author = {Arya,S. and da Fonseca,G. D and Mount, Dave} } @conference {17564, title = {Approximation algorithms for throughput maximization in wireless networks with delay constraints}, booktitle = {2011 Proceedings IEEE INFOCOM}, year = {2011}, month = {2011/04/10/15}, pages = {1116 - 1124}, publisher = {IEEE}, organization = {IEEE}, abstract = {We study the problem of throughput maximization in multi-hop wireless networks with end-to-end delay constraints for each session. This problem has received much attention starting with the work of Grossglauser and Tse (2002), and it has been shown that there is a significant tradeoff between the end-to-end delays and the total achievable rate. We develop algorithms to compute such tradeoffs with provable performance guarantees for arbitrary instances, with general interference models. Given a target delay-bound Δ(c) for each session c, our algorithm gives a stable flow vector with a total throughput within a factor of O (logΔm/log log Δm) of the maximum, so that the per-session (end-to-end) delay is O ((logΔm/log log Δm Δ(c))2), where Δm = maxc{Δ(c)}; note that these bounds depend only on the delays, and not on the network size, and this is the first such result, to our knowledge.}, keywords = {Approximation algorithms, Approximation methods, approximation theory, Delay, delay constraints, delays, general interference model, Interference, multihop wireless networks, optimisation, Optimized production technology, radio networks, radiofrequency interference, target delay bound, Throughput, throughput maximization, Wireless networks}, isbn = {978-1-4244-9919-9}, doi = {10.1109/INFCOM.2011.5934887}, author = {Guanhong Pei and Anil Kumar,V. S and Parthasarathy,S. and Srinivasan, Aravind} } @article {12868, title = {Aquatic Realm and Cholera}, journal = {Epidemiological and Molecular Aspects on Cholera}, year = {2011}, month = {2011///}, pages = {311 - 339}, abstract = {Cholera is an ancient disease that can be severe and life threatening. It occurs predominantly in areas of the world where populations lack safe drinking water. Epidemics of cholera are linked with malnutrition, poor sanitation, and conditions resulting from natural disasters such as severe flooding. According to a report published by WHO in 2000 [1], cholera remains a major public health problem and is becoming increasingly important since the number of countries in which cholera is endemic continues to increase. Unfortunately, outbreaks of the disease continue into the twenty-first century with ominous portent in the wake of global climate change [1]. Yet cholera is a preventable disease if people have access to safe drinking water and are properly educated how to protect themselves from the risk of infection with vibrios. Cholera also is an easily treatable disease. Oral rehydration therapy, a solution containing glucose and appropriate salts, has proven to be effective for treatment of most cholera victims [2]. Nevertheless, each year, tens of thousands of people are victims of the disease, bringing this {\textquotedblleft}curse of humankind{\textquotedblright} to modern civilization. Present understanding of cholera is based on studies conducted over the past three decades and significant new information has been gained concerning environmental factors associated with this disease, especially how to detect the bacterium and where it lives in the natural environment, outside the human gut, and what triggers the annual outbreaks that occur with remarkable regularity. Environmental research on Vibrio cholerae and cholera has provided insights for prediction and prevention of the disease it causes, while the race for effective vaccines against cholera continues.}, doi = {10.1007/978-1-60327-265-0_18}, author = {Huq,A. and Grim,C. J. and Rita R Colwell} } @article {18547, title = {Architecting for innovation}, journal = {SIGCOMM Comput. Commun. Rev.}, volume = {41}, year = {2011}, month = {2011///}, pages = {24 - 36}, abstract = {We argue that the biggest problem with the current Internet architecture is not a particular functional deficiency, but its inability to accommodate innovation. To address this problem we propose a minimal architectural "framework" in which comprehensive architectures can reside. The proposed Framework for Internet Innovation (FII) --- which is derived from the simple observation that network interfaces should be extensible and abstract --- allows for a diversity of architectures to coexist, communicate, and evolve. We demonstrate FII{\textquoteright}s ability to accommodate diversity and evolution with a detailed examination of how information flows through the architecture and with a skeleton implementation of the relevant interfaces.}, keywords = {diversity, Evolution, innovation, internet architecture}, isbn = {0146-4833}, doi = {10.1145/2002250.2002256}, url = {http://doi.acm.org/10.1145/2002250.2002256}, author = {Koponen,Teemu and Shenker,Scott and Balakrishnan,Hari and Feamster, Nick and Ganichev,Igor and Ghodsi,Ali and Godfrey,P. Brighten and McKeown,Nick and Parulkar,Guru and Raghavan,Barath and Rexford,Jennifer and Arianfar,Somaya and Kuptsov,Dmitriy} } @article {17566, title = {Article 28 (28 pages)-New Constructive Aspects of the Lov{\'a}sz Local Lemma}, journal = {Journal of the ACM-Association for ComputingMachinery}, volume = {58}, year = {2011}, month = {2011///}, author = {Haeupler,B. and Saha,B. and Srinivasan, Aravind} } @article {16246, title = {Assessing the benefits of using mate-pairs to resolve repeats in de novo short-read prokaryotic assemblies}, journal = {BMC Bioinformatics}, volume = {12}, year = {2011}, month = {2011/04/13/}, pages = {95 - 95}, abstract = {Next-generation sequencing technologies allow genomes to be sequenced more quickly and less expensively than ever before. However, as sequencing technology has improved, the difficulty of de novo genome assembly has increased, due in large part to the shorter reads generated by the new technologies. The use of mated sequences (referred to as mate-pairs) is a standard means of disambiguating assemblies to obtain a more complete picture of the genome without resorting to manual finishing. Here, we examine the effectiveness of mate-pair information in resolving repeated sequences in the DNA (a paramount issue to overcome). While it has been empirically accepted that mate-pairs improve assemblies, and a variety of assemblers use mate-pairs in the context of repeat resolution, the effectiveness of mate-pairs in this context has not been systematically evaluated in previous literature.}, isbn = {1471-2105}, doi = {10.1186/1471-2105-12-95}, url = {http://www.biomedcentral.com/1471-2105/12/95}, author = {Wetzel,Joshua and Kingsford, Carl and Pop, Mihai} } @article {12114, title = {An assessment of systems and software engineering scholars and institutions (2003{\textendash}2007 and 2004{\textendash}2008)}, journal = {Journal of Systems and Software}, volume = {84}, year = {2011}, month = {2011/01//}, pages = {162 - 168}, abstract = {An ongoing, annual survey of publications in systems and software engineering identifies the top 15 scholars and institutions in the field over a 5-year period. Each ranking is based on the weighted scores of the number of papers published in TSE, TOSEM, JSS, SPE, EMSE, IST, and Software of the corresponding period. This report summarizes the results for 2003{\textendash}2007 and 2004{\textendash}2008. The top-ranked institution is Korea Advanced Institute of Science and Technology, Korea for 2003{\textendash}2007, and Simula Research Laboratory, Norway for 2004{\textendash}2008, while Magne J{\o}rgensen is the top-ranked scholar for both periods.}, keywords = {Research publications, Systems and software engineering, Top institutions, Top scholars}, isbn = {0164-1212}, doi = {10.1016/j.jss.2010.09.036}, url = {http://www.sciencedirect.com/science/article/pii/S0164121210002682}, author = {Wong,W. Eric and Tse,T.H. and Glass,Robert L. and Basili, Victor R. and Chen,T.Y.} } @conference {18333, title = {Associating the visual representation of user interfaces with their internal structures and metadata}, booktitle = {Proceedings of the 24th annual ACM symposium on User interface software and technology}, series = {UIST {\textquoteright}11}, year = {2011}, month = {2011///}, pages = {245 - 256}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Pixel-based methods are emerging as a new and promising way to develop new interaction techniques on top of existing user interfaces. However, in order to maintain platform independence, other available low-level information about GUI widgets, such as accessibility metadata, was neglected intentionally. In this paper, we present a hybrid framework, PAX, which associates the visual representation of user interfaces (i.e. the pixels) and their internal hierarchical metadata (i.e. the content, role, and value). We identify challenges to building such a framework. We also develop and evaluate two new algorithms for detecting text at arbitrary places on the screen, and for segmenting a text image into individual word blobs. Finally, we validate our framework in implementations of three applications. We enhance an existing pixel-based system, Sikuli Script, and preserve the readability of its script code at the same time. Further, we create two novel applications, Screen Search and Screen Copy, to demonstrate how PAX can be applied to development of desktop-level interactive systems.}, keywords = {accessibility api, Graphical user interfaces, Pixel, text detection, text segmentation}, isbn = {978-1-4503-0716-1}, doi = {10.1145/2047196.2047228}, url = {http://doi.acm.org/10.1145/2047196.2047228}, author = {Chang,Tsung-Hsiang and Tom Yeh and Miller,Rob} } @inbook {18819, title = {Automated Planning Logic Synthesis for Autonomous Unmanned Vehicles in Competitive Environments with Deceptive Adversaries}, booktitle = {New Horizons in Evolutionary Robotics}, series = {Studies in Computational Intelligence}, volume = {341}, year = {2011}, month = {2011///}, pages = {171 - 193}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {We developed a new approach for automated synthesis of a planning logic for autonomous unmanned vehicles. This new approach can be viewed as an automated iterative process during which an initial version of a logic is synthesized and then gradually improved by detecting and fixing its shortcomings. This is achieved by combining data mining for extraction of vehicle{\textquoteright}s states of failure and Genetic Programming (GP) technique for synthesis of corresponding navigation code. We verified the feasibility of the approach using unmanned surface vehicles (USVs) simulation. Our focus was specifically on the generation of a planning logic used for blocking the advancement of an intruder boat towards a valuable target. Developing autonomy logic for this behavior is challenging as the intruder{\textquoteright}s attacking logic is human-competitive with deceptive behavior so the USV is required to learn specific maneuvers for specific situations to do successful blocking. We compared the performance of the generated blocking logic to the performance of logic that was manually implemented. Our results show that the new approach was able to synthesize a blocking logic with performance closely approaching the performance of the logic coded by hand.}, keywords = {engineering}, isbn = {978-3-642-18271-6}, url = {http://www.springerlink.com/content/f454477212518671/abstract/}, author = {Svec,Petr and Gupta, Satyandra K.}, editor = {Doncieux,St{\'e}phane and Bred{\`e}che,Nicolas and Mouret,Jean-Baptiste} } @conference {13069, title = {AVSS 2011 demo session: A large-scale benchmark dataset for event recognition in surveillance video}, booktitle = {Advanced Video and Signal-Based Surveillance (AVSS), 2011 8th IEEE International Conference on}, year = {2011}, month = {2011/09/30/2}, pages = {527 - 528}, abstract = {We introduce to the surveillance community the VIRAT Video Dataset[1], which is a new large-scale surveillance video dataset designed to assess the performance of event recognition algorithms in realistic scenes1.}, doi = {10.1109/AVSS.2011.6027400}, author = {Oh,Sangmin and Hoogs,Anthony and Perera,Amitha and Cuntoor,Naresh and Chen,Chia-Chih and Lee,Jong Taek and Mukherjee,Saurajit and Aggarwal, JK and Lee,Hyungtae and Davis, Larry S. and Swears,Eran and Wang,Xiaoyang and Ji,Qiang and Reddy,Kishore and Shah,Mubarak and Vondrick,Carl and Pirsiavash,Hamed and Ramanan,Deva and Yuen,Jenny and Torralba,Antonio and Song,Bi and Fong,Anesco and Roy-Chowdhury,Amit and Desai,Mita} } @article {19582, title = {Abstracting Abstract Machines}, journal = {arXiv:1007.4446 [cs]}, year = {2010}, note = {Comment: The 15th ACM SIGPLAN International Conference on Functional Programming (ICFP{\textquoteright}10), Baltimore, Maryland, September, 2010}, month = {2010/07/26/}, abstract = {We describe a derivational approach to abstract interpretation that yields novel and transparently sound static analyses when applied to well-established abstract machines. To demonstrate the technique and support our claim, we transform the CEK machine of Felleisen and Friedman, a lazy variant of Krivine{\textquoteright}s machine, and the stack-inspecting CM machine of Clements and Felleisen into abstract interpretations of themselves. The resulting analyses bound temporal ordering of program events; predict return-flow and stack-inspection behavior; and approximate the flow and evaluation of by-need parameters. For all of these machines, we find that a series of well-known concrete machine refactorings, plus a technique we call store-allocated continuations, leads to machines that abstract into static analyses simply by bounding their stores. We demonstrate that the technique scales up uniformly to allow static analysis of realistic language features, including tail calls, conditionals, side effects, exceptions, first-class continuations, and even garbage collection.}, keywords = {Computer Science - Programming Languages, F.3.2, F.4.1}, url = {http://arxiv.org/abs/1007.4446}, author = {David Van Horn and Might, Matthew} } @article {15262, title = {Achieving anonymity via clustering}, journal = {ACM Trans. Algorithms}, volume = {6}, year = {2010}, month = {2010/07//}, pages = {49:1{\textendash}49:19 - 49:1{\textendash}49:19}, abstract = {Publishing data for analysis from a table containing personal records, while maintaining individual privacy, is a problem of increasing importance today. The traditional approach of deidentifying records is to remove identifying fields such as social security number, name, etc. However, recent research has shown that a large fraction of the U.S. population can be identified using nonkey attributes (called quasi-identifiers) such as date of birth, gender, and zip code. The k-anonymity model protects privacy via requiring that nonkey attributes that leak information are suppressed or generalized so that, for every record in the modified table, there are at least k-1 other records having exactly the same values for quasi-identifiers. We propose a new method for anonymizing data records, where quasi-identifiers of data records are first clustered and then cluster centers are published. To ensure privacy of the data records, we impose the constraint that each cluster must contain no fewer than a prespecified number of data records. This technique is more general since we have a much larger choice for cluster centers than k-anonymity. In many cases, it lets us release a lot more information without compromising privacy. We also provide constant factor approximation algorithms to come up with such a clustering. This is the first set of algorithms for the anonymization problem where the performance is independent of the anonymity parameter k. We further observe that a few outlier points can significantly increase the cost of anonymization. Hence, we extend our algorithms to allow an ε fraction of points to remain unclustered, that is, deleted from the anonymized publication. Thus, by not releasing a small fraction of the database records, we can ensure that the data published for analysis has less distortion and hence is more useful. Our approximation algorithms for new clustering objectives are of independent interest and could be applicable in other clustering scenarios as well.}, keywords = {anonymity, Approximation algorithms, clustering, privacy}, isbn = {1549-6325}, doi = {10.1145/1798596.1798602}, url = {http://doi.acm.org/10.1145/1798596.1798602}, author = {Aggarwal,Gagan and Panigrahy,Rina and Feder,Tom{\'a}s and Thomas,Dilys and Kenthapadi,Krishnaram and Khuller, Samir and Zhu,An} } @article {14355, title = {Active inference for collective classification}, journal = {AAAI{\textquoteright}10}, year = {2010}, month = {2010///}, abstract = {Labeling nodes in a network is an important problem that has seen a growing interest. A number of methods that exploit both local and relational information have been developed for this task. Acquiring the labels for a few nodes at inference time can greatly improve the ac- curacy, however the question of figuring out which node labels to acquire is challenging. Previous approaches have been based on simple structural properties. Here, we present a novel technique, which we refer to as re- flect and correct, that can learn and predict when the un- derlying classification system is likely to make mistakes and it suggests acquisitions to correct those mistakes.}, author = {Bilgic,M. and Getoor, Lise} } @article {14396, title = {Active learning for networked data}, journal = {ICML{\textquoteright}10}, year = {2010}, month = {2010///}, abstract = {We introduce a novel active learning algo-rithm for classification of network data. In this setting, training instances are connected by a set of links to form a network, the labels of linked nodes are correlated, and the goal is to exploit these dependencies and accu- rately label the nodes. This problem arises in many domains, including social and biologi- cal network analysis and document classifica- tion, and there has been much recent interest in methods that collectively classify the nodes in the network. While in many cases labeled examples are expensive, often network infor- mation is available. We show how an active learning algorithm can take advantage of net- work structure. Our algorithm effectively ex- ploits the links between instances and the in- teraction between the local and collective as- pects of a classifier to improve the accuracy of learning from fewer labeled examples. We ex- periment with two real-world benchmark col- lective classification domains, and show that we are able to achieve extremely accurate re- sults even when only a small fraction of the data is labeled. }, author = {Bilgic,M. and Mihalkova,L. and Getoor, Lise} } @article {14660, title = {Adapting Scrum to Managing a Research Group}, journal = {Technical Reports of the Computer Science Department}, year = {2010}, month = {2010/09/18/undef}, abstract = {Score is an adaptation of the Scrum agile software development methodology to the task of managing Ph.D. students in an academic research group. This paper describes Score, conceived in October 2006, and our experience using it. We have found that Score enables us---faculty and students---to be more efficient and thereby more productive, and enhances the cohesion of our research group.}, author = {Hicks, Michael W. and Foster, Jeffrey S.} } @article {15707, title = {Adaptive Constraint Reduction for Convex Quadratic Programming}, journal = {Computational Optimization and Applications}, year = {2010}, month = {2010/03//}, abstract = {We propose an adaptive, constraint-reduced, primal-dual interior-point algorithm for convex quadratic programming with many more inequality constraints than variables. We reduce the computational effort by assembling, instead of the exact normal-equation matrix, an approximate matrix from a well chosen index set which includes indices of constraints that seem to be most critical. Starting with a large portion of the constraints, our proposed scheme excludes more unnecessary constraints at later iterations. We provide proofs for the global convergence and the quadratic local convergence rate of an affine-scaling variant. Numerical experiments on random problems, on a data-fitting problem, and on a problem in array pattern synthesis show the effectiveness of the constraint reduction in decreasing the time per iteration without significantly affecting the number of iterations. We note that a similar constraint-reduction approach can be applied to algorithms of Mehrotra{\textquoteright}s predictor-corrector type, although no convergence theory is supplied.}, doi = {DOI:10.1007/s10589-010-9324-8}, author = {Jung,Jin Hyuk and O{\textquoteright}Leary, Dianne P. and Tits,Andre{\textquoteright} L.} } @article {12495, title = {Adaptive Threshold Estimation via Extreme Value Theory}, journal = {Signal Processing, IEEE Transactions on}, volume = {58}, year = {2010}, month = {2010/02//}, pages = {490 - 500}, abstract = {Determining a detection threshold to automatically maintain a low false alarm rate is a challenging problem. In a number of different applications, the underlying parametric assumptions of most automatic target detection algorithms are invalid. Therefore, thresholds derived using these incorrect distribution assumptions do not produce desirable results when applied to real sensor data. Monte Carlo methods for threshold determination work well but tend to perform poorly when targets are present. In order to mitigate these effects, we propose an algorithm using extreme value theory through the use of the generalized Pareto distribution (GPD) and a Kolmogorov-Smirnov statistical test. Unlike previous work based on GPD estimates, this algorithm incorporates a way to adaptively maintain low false alarm rates in the presence of targets. Both synthetic and real-world detection results demonstrate the usefulness of this algorithm.}, keywords = {detection;, detection;Pareto, distribution;adaptive, distribution;signal, estimation;extreme, estimation;signal, Kolmogorov-Smirnov, Pareto, statistical, test;adaptive, theory;generalized, threshold, value}, isbn = {1053-587X}, doi = {10.1109/TSP.2009.2031285}, author = {Broadwater, J.B. and Chellapa, Rama} } @article {13094, title = {Advanced tracking systems: computational approaches to be introduced to new series}, journal = {Augmented vision \& reality}, volume = {1}, year = {2010}, month = {2010///}, abstract = {Modern visual tracking systems implement a computational process that is often divided into several modules such as localization, tracking, recognition, behavior analysis and classification of events. This book will focus on recent advances in computational approaches for detection and tracking of human body, road boundaries and lane markers as well as on recognition of human activities, drowsiness and distraction state. This book is composed of seven distinct parts. Part I covers people localization algorithms in video sequences. Part II describes successful approaches for tracking people and bodyparts. The third part focuses on tracking of pedestrian and vehicles in outdoor images. Part IV describes recent methods to track lane markers and road boundaries. In part V, methods to track head, hand and facial features are reviewed. The last two parts cover the topics of automatic recognition and classification of activity, gesture, behavior, drowsiness and visual distraction state of humans.}, author = {HAMMOUD,R. and Porikli, F. and Davis, Larry S.} } @inbook {15424, title = {Advances in Automated Model-Based System Testing of Software Applications with a GUI Front-End}, booktitle = {Advances in ComputersAdvances in Computers}, volume = {Volume 80}, year = {2010}, month = {2010///}, pages = {121 - 162}, publisher = {Elsevier}, organization = {Elsevier}, abstract = {Despite the ubiquity of software applications that employ a graphical-user interface (GUI) front-end, functional system testing of these applications has remained, until recently, an understudied research area. During {\textquotedblleft}GUI testing,{\textquotedblright} test cases, modeled as sequences of user input events, are created and executed on the software by exercising the GUI{\textquoteright}s widgets. Because each possible sequence of user events may potentially be a test case and today{\textquoteright}s GUIs offer enormous flexibility to end-users, in principle, GUI testing requires a prohibitively large number of test cases. Any practical test-case generation technique must sample the vast GUI input space. Existing techniques are largely manual, and hence extremely resource intensive. Several new automated model-based techniques have been developed in the past decade. All these techniques develop, either manually or automatically, a model of the GUI and employ it to generate test cases. This chapter presents the first detailed taxonomy of these techniques. A small GUI application is used as a running example to demonstrate each technique and illustrate its relative strengths and weaknesses.}, isbn = {0065-2458}, url = {http://www.sciencedirect.com/science/article/pii/S0065245810800038}, author = {Memon, Atif M. and Nguyen,Bao N.}, editor = {Zelkowitz, Marvin V} } @inbook {12498, title = {Advances in Video-Based Human Activity Analysis: Challenges and Approaches}, booktitle = {Advances in ComputersAdvances in Computers}, volume = {Volume 80}, year = {2010}, month = {2010///}, pages = {237 - 290}, publisher = {Elsevier}, organization = {Elsevier}, abstract = {Videos play an ever increasing role in our everyday lives with applications ranging from news, entertainment, scientific research, security, and surveillance. Coupled with the fact that cameras and storage media are becoming less expensive, it has resulted in people producing more video content than ever before. Analysis of human activities in video is important for several important applications. Interpretation and identification of human activities requires approaches that address the following questions (a) what are the appropriate atomic primitives for human activities, (b) how to combine primitives to produce complex activities, (c) what are the required invariances for inference algorithms, and (d) how to build computational models for each of these. In this chapter, we provide a broad overview and discussion of these issues. We shall review state-of-the-art computer vision algorithms that address these issues and then provide a unified perspective from which specific algorithms can be derived. We will then present supporting experimental results.}, isbn = {0065-2458}, url = {http://www.sciencedirect.com/science/article/pii/S0065245810800075}, author = {Turaga,Pavan and Chellapa, Rama and Veeraraghavan,Ashok}, editor = {Zelkowitz, Marvin V} } @article {14374, title = {AI Theory and Practice: A Discussion on Hard Challenges and Opportunities Ahead}, journal = {AI Magazine}, volume = {31}, year = {2010}, month = {2010/07/28/}, pages = {103 - 114}, abstract = {AI Theory and Practice: A Discussion on Hard Challenges and Opportunities Ahead}, isbn = {0738-4602}, doi = {10.1609/aimag.v31i3.2293}, url = {http://www.aaai.org/ojs/index.php/aimagazine/article/viewArticle/2293}, author = {Horvitz,Eric and Getoor, Lise and Guestrin,Carlos and Hendler,James and Konstan,Joseph and Subramanian,Devika and Wellman,Michael and Kautz,Henry} } @inbook {12503, title = {Aligning Spatio-Temporal Signals on a Special Manifold}, booktitle = {Computer Vision {\textendash} ECCV 2010Computer Vision {\textendash} ECCV 2010}, series = {Lecture Notes in Computer Science}, volume = {6315}, year = {2010}, month = {2010///}, pages = {547 - 560}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {We investigate the spatio-temporal alignment of videos or features/signals extracted from them. Specifically, we formally define an alignment manifold and formulate the alignment problem as an optimization procedure on this non-linear space by exploiting its intrinsic geometry. We focus our attention on semantically meaningful videos or signals, e.g., those describing or capturing human motion or activities, and propose a new formalism for temporal alignment accounting for executing rate variations among realizations of the same video event. By construction, we address this static and deterministic alignment task in a dynamic and stochastic manner: we regard the search for optimal alignment parameters as a recursive state estimation problem for a particular dynamic system evolving on the alignment manifold. Consequently, a Sequential Importance Sampling iteration on the alignment manifold is designed for effective and efficient alignment. We demonstrate the performance on several types of input data that arise in vision problems.}, isbn = {978-3-642-15554-3}, url = {http://dx.doi.org/10.1007/978-3-642-15555-0_40}, author = {Ruonan Li and Chellapa, Rama}, editor = {Daniilidis,Kostas and Maragos,Petros and Paragios,Nikos} } @article {16242, title = {Alignment and clustering of phylogenetic markers - implications for microbial diversity studies}, journal = {BMC Bioinformatics}, volume = {11}, year = {2010}, month = {2010/03/24/}, pages = {152 - 152}, abstract = {Molecular studies of microbial diversity have provided many insights into the bacterial communities inhabiting the human body and the environment. A common first step in such studies is a survey of conserved marker genes (primarily 16S rRNA) to characterize the taxonomic composition and diversity of these communities. To date, however, there exists significant variability in analysis methods employed in these studies.}, isbn = {1471-2105}, doi = {10.1186/1471-2105-11-152}, url = {http://www.biomedcentral.com/1471-2105/11/152}, author = {White,James R and Navlakha,Saket and Nagarajan,Niranjan and Ghodsi,Mohammad-Reza and Kingsford, Carl and Pop, Mihai} } @book {16975, title = {Analyzing Social Media Networks with NodeXL}, year = {2010}, month = {2010/08/27/}, publisher = {Morgan Kaufmann}, organization = {Morgan Kaufmann}, abstract = {"Analyzing Social Media Networks with NodeXL provides a much needed resource for the social media research community, as it describes network theory, provides compelling examples using data sources like Twitter and Flickr, and highlights how to use a free sophisticated tool for analysis. This is the perfect book for anyone trying to analyze the behavior of online social networks and beyond." ---Adam Perer, Research Scientist, IBM Research "This book provides a basic introduction to social network analysis, followed by practical instruction and examples on gathering data from online sources, importing into Excel, and then analyzing the data through Excel. The book will be important for promoting research in the area for those in information science, sociology, cultural studies, virtual community, and e-commerce."---Caroline Haythornthwaite, PhD, Professor, Graduate School of Library and Information Science, University of Illinois at Urbana-Champaign Businesses, entrepreneurs, individuals, and government agencies alike are looking to social network analysis (SNA) tools for insight into trends, connections, and fluctuations in social media. Microsoft{\textquoteright}s NodeXL is a free, open-source SNA plug-in for use with Excel. It provides instant graphical representation of relationships of complex networked data. But it goes further than other SNA tools - NodeXL was developed by a multidisciplinary team of experts that bring together information studies, computer science, sociology, human-computer interaction, and over 20 years of visual analytic theory and information visualization into a simple tool anyone can use. This makes NodeXL of interest not only to end-users but also to researchers and students studying visual and network analytics and their application in the real world.}, keywords = {Business \& Economics / Marketing / Research, Computers / Computer Science, Computers / Data Processing, Computers / Database Management / Data Mining, Computers / General, Computers / Information Theory, Computers / Interactive \& Multimedia, Computers / Social Aspects / General, Computers / Social Aspects / Human-Computer Interaction, Computers / User Interfaces, data mining, Data mining - Computer programs, Data mining/ Computer programs, Information Visualization, Information visualization - Computer programs, Information visualization/ Computer programs, NodeXL, online social networks, Social Science / General, Social Science / Reference, Social Science / Sociology / General, Technology \& Engineering / General, Technology \& Engineering / Social Aspects, Webometrics, Webometrics - Computer programs, Webometrics/ Computer programs}, isbn = {9780123822291}, author = {Hansen,Derek and Shneiderman, Ben and Smith,Marc A.} } @book {19357, title = {Analyzing Social Media Networks with NodeXL: Insights from a Connected World}, year = {2010}, month = {2010}, pages = {302}, publisher = {Morgan Kaufmann}, organization = {Morgan Kaufmann}, abstract = {Businesses, entrepreneurs, individuals, and government agencies alike are looking to social network analysis (SNA) tools for insight into trends, connections, and fluctuations in social media. Microsoft{\textquoteright}s NodeXL is a free, open-source SNA plug-in for use with Excel. It provides instant graphical representation of relationships of complex networked data. But it goes further than other SNA tools -- NodeXL was developed by a multidisciplinary team of experts that bring together information studies, computer science, sociology, human-computer interaction, and over 20 years of visual analytic theory and information visualization into a simple tool anyone can use. This makes NodeXL of interest not only to end-users but also to researchers and students studying visual and network analytics and their application in the real world. In Analyzing Social Media Networks with NodeXL, members of the NodeXL development team up to provide readers with a thorough and practical guide for using the tool while also explaining the development behind each feature. Blending the theoretical with the practical, this book applies specific SNA instructions directly to NodeXL, but the theory behind the implementation can be applied to any SNA. To learn more about Analyzing Social Media Networks and NodeXL, visit the companion site at www.mkp.com/nodexl*Walks you through NodeXL, while explaining the theory and development behind each step, providing takeaways that can apply to any SNA *Demonstrates how visual analytics research can be applied to SNA tools for the mass market *Includes case studies from researchers who use NodeXL on popular networks like email, Facebook, Twitter, and wikis}, keywords = {Computers / Computer Science, Computers / General, Computers / Social Aspects / General, Computers / Social Aspects / Human-Computer Interaction, Computers / User Interfaces}, isbn = {9780123822307}, author = {Hansen,Derek and Shneiderman, Ben and Smith,Marc A.} } @conference {13422, title = {An animated multivariate visualization for physiological and clinical data in the ICU}, booktitle = {Proceedings of the 1st ACM International Health Informatics Symposium}, series = {IHI {\textquoteright}10}, year = {2010}, month = {2010///}, pages = {771 - 779}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Current visualizations of electronic medical data in the Intensive Care Unit (ICU) consist of stacked univariate plots of variables over time and a tabular display of the current numeric values for the corresponding variables and occasionally an alarm limit. The value of information is dependent upon knowledge of historic values to determine a change in state. With the ability to acquire more historic information, providers need more sophisticated visualization tools to assist them in analyzing the data in a multivariate fashion over time. We present a multivariate time series visualization that is interactive and animated, and has proven to be as effective as current methods in the ICU for predicting an episode of acute hypotension in terms of accuracy, confidence, and efficiency with only 30-60 minutes of training.}, keywords = {computational physiology, Information Visualization, multivariate, time series}, isbn = {978-1-4503-0030-8}, doi = {10.1145/1882992.1883109}, url = {http://doi.acm.org/10.1145/1882992.1883109}, author = {Ord{\'o}{\~n}ez,Patricia and desJardins, Marie and Lombardi,Michael and Lehmann,Christoph U. and Fackler,Jim} } @article {17748, title = {Annotated RDF}, journal = {ACM Trans. Comput. Logic}, volume = {11}, year = {2010}, month = {2010/01//}, pages = {10:1{\textendash}10:41 - 10:1{\textendash}10:41}, abstract = {Real-world use of RDF requires the ability to transparently represent and explain metadata associated with RDF triples. For example, when RDF triples are extracted automatically by information extraction programs, there is a need to represent where the triples came from, what their temporal validity is, and how certain we are that the triple is correct. Today, there is no theoretically clean and practically scalable mechanism that spans these different needs - reification is the only solution propose to date, and its implementations have been ugly. In this paper, we present Annotated RDF (or aRDF for short) in which RDF triples are annotated by members of a partially ordered set (with bottom element) that can be selected in any way desired by the user. We present a formal declarative semantics (model theory) for annotated RDF and develop algorithms to check consistency of aRDF theories and to answer queries to aRDF theories. We show that annotated RDF supports users who need to think about the uncertainty, temporal aspects, and provenance of the RDF triples in an RDF database. We develop a prototype aRDF implementation and show that our algorithms work efficiently even on real world data sets containing over 10 million triples.}, keywords = {annotated RDF, Query processing, view maintenance}, isbn = {1529-3785}, doi = {10.1145/1656242.1656245}, url = {http://doi.acm.org/10.1145/1656242.1656245}, author = {Udrea,Octavian and Recupero,Diego Reforgiato and V.S. Subrahmanian} } @article {12474, title = {Applications of a Simple Characterization of Human Gait in Surveillance}, journal = {Systems, Man, and Cybernetics, Part B: Cybernetics, IEEE Transactions on}, volume = {40}, year = {2010}, month = {2010/08//}, pages = {1009 - 1020}, abstract = {Applications of a simple spatiotemporal characterization of human gait in the surveillance domain are presented. The approach is based on decomposing a video sequence into x-t slices, which generate periodic patterns referred to as double helical signatures (DHSs). The features of DHS are given as follows: 1) they naturally encode the appearance and kinematics of human motion and reveal geometric symmetries and 2) they are effective and efficient for recovering gait parameters and detecting simple events. We present an iterative local curve embedding algorithm to extract the DHS from video sequences. Two applications are then considered. First, the DHS is used for simultaneous segmentation and labeling of body parts in cluttered scenes. Experimental results showed that the algorithm is robust to size, viewing angles, camera motion, and severe occlusion. Then, the DHS is used to classify load-carrying conditions. By examining various symmetries in DHS, activities such as carrying, holding, and walking with objects that are attached to legs are detected. Our approach possesses several advantages: a compact representation that can be computed in real time is used; furthermore, it does not depend on silhouettes or landmark tracking, which are sensitive to errors in background subtraction stage.}, keywords = {algorithms, Artificial intelligence, Automated;Photography;Reproducibility of Results;Sensitivity and Specificity;Video Recording;, Biometry, Computer-Assisted;Pattern Recognition, double helical signatures, Gait, gait analysis, human gait, human motion kinematics, HUMANS, Image Enhancement, Image Interpretation, Image motion analysis, iterative local curve embedding algorithm, Object detection, simple spatiotemporal characterization, video sequence, Video surveillance}, isbn = {1083-4419}, doi = {10.1109/TSMCB.2010.2044173}, author = {Yang Ran and Qinfen Zheng and Chellapa, Rama and Strat, T.M.} } @article {19627, title = {Applications of Parameterized st-Orientations}, journal = {Journal of Graph Algorithms and Applications}, volume = {14}, year = {2010}, month = {2010///}, pages = {337 - 365}, isbn = {1526-1719}, url = {http://emis.um.ac.ir/journals/JGAA/getPaper-96.html?id=212}, author = {Charalampos Papamanthou and Tollis, Ioannis G.} } @article {15564, title = {Approximate range searching: The absolute model}, journal = {Computational Geometry}, volume = {43}, year = {2010}, month = {2010/05//}, pages = {434 - 444}, abstract = {Range searching is a well known problem in the area of geometric data structures. We consider this problem in the context of approximation, where an approximation parameter ε \> 0 is provided. Most prior work on this problem has focused on the case of relative errors, where each range shape R is bounded, and points within distance ε . diam ( R ) of the range{\textquoteright}s boundary may or may not be included. We consider a different approximation model, called the absolute model, in which points within distance ε of the range{\textquoteright}s boundary may or may not be included, regardless of the diameter of the range. We consider range spaces consisting of halfspaces, Euclidean balls, simplices, axis-aligned rectangles, and general convex bodies. We consider a variety of problem formulations, including range searching under general commutative semigroups, idempotent semigroups, groups, and range emptiness. We show how idempotence can be used to improve not only approximate, but also exact halfspace range searching. Our data structures are much simpler than both their exact and relative model counterparts, and so are amenable to efficient implementation.}, keywords = {Absolute model, approximation, Halfbox quadtree, Idempotence, Range searching}, isbn = {0925-7721}, doi = {10.1016/j.comgeo.2008.09.009}, url = {http://www.sciencedirect.com/science/article/pii/S0925772109000844}, author = {da Fonseca,Guilherme D. and Mount, Dave} } @article {15566, title = {Approximation algorithm for the kinetic robust K-center problem}, journal = {Computational Geometry}, volume = {43}, year = {2010}, month = {2010/08//}, pages = {572 - 586}, abstract = {Two complications frequently arise in real-world applications, motion and the contamination of data by outliers. We consider a fundamental clustering problem, the k-center problem, within the context of these two issues. We are given a finite point set S of size n and an integer k. In the standard k-center problem, the objective is to compute a set of k center points to minimize the maximum distance from any point of S to its closest center, or equivalently, the smallest radius such that S can be covered by k disks of this radius. In the discrete k-center problem the disk centers are drawn from the points of S, and in the absolute k-center problem the disk centers are unrestricted.We generalize this problem in two ways. First, we assume that points are in continuous motion, and the objective is to maintain a solution over time. Second, we assume that some given robustness parameter 0 \< t ⩽ 1 is given, and the objective is to compute the smallest radius such that there exist k disks of this radius that cover at least ⌈ t n ⌉ points of S. We present a kinetic data structure (in the KDS framework) that maintains a ( 3 + ε ) -approximation for the robust discrete k-center problem and a ( 4 + ε ) -approximation for the robust absolute k-center problem, both under the assumption that k is a constant. We also improve on a previous 8-approximation for the non-robust discrete kinetic k-center problem, for arbitrary k, and show that our data structure achieves a ( 4 + ε ) -approximation. All these results hold in any metric space of constant doubling dimension, which includes Euclidean space of constant dimension. }, keywords = {Approximation algorithms, clustering, kinetic data structures, robust statistics}, isbn = {0925-7721}, doi = {10.1016/j.comgeo.2010.01.001}, url = {http://www.sciencedirect.com/science/article/pii/S0925772110000027}, author = {Friedler,Sorelle A. and Mount, Dave} } @article {14548, title = {Approximation Algorithms for Non-Uniform Buy-at-Bulk Network Design}, journal = {SIAM Journal on Computing}, volume = {39}, year = {2010}, month = {2010///}, pages = {1772 - 1798}, author = {Chekuri,C. and Hajiaghayi, Mohammad T. and Kortsarz,G. and Salavatipour,M. R} } @conference {12122, title = {Are developers complying with the process: an XP study}, booktitle = {Proceedings of the 2010 ACM-IEEE International Symposium on Empirical Software Engineering and Measurement}, series = {ESEM {\textquoteright}10}, year = {2010}, month = {2010///}, pages = {14:1{\textendash}14:10 - 14:1{\textendash}14:10}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Adapting new software processes and practices in organizational and academic environments requires training the developers and validating the applicability of the newly introduced activities. Investigating process conformance during training and understanding if programmers are able and willing to follow the specific steps are crucial to evaluating whether the process improves various software product quality factors. In this paper we present a process model independent approach to detect process non-conformance. Our approach is based on non-intrusively collected data captured by a version control system and provides the project manager with timely updates. Further, we provide evidence of the applicability of our approach by investigating process conformance in a five day training class on eXtreme Programming (XP) practices at the Leibniz Universit{\"a}t Hannover. Our results show that the approach enabled researchers to formulate minimal intrusive methods to check for conformance and that for the majority of the investigated XP practices violations could be detected.}, keywords = {process conformance, process improvement, XP programming}, isbn = {978-1-4503-0039-1}, doi = {10.1145/1852786.1852805}, url = {http://doi.acm.org/10.1145/1852786.1852805}, author = {Zazworka, Nico and Stapel,Kai and Knauss,Eric and Shull, Forrest and Basili, Victor R. and Schneider,Kurt} } @inbook {12504, title = {Articulation-Invariant Representation of Non-planar Shapes}, booktitle = {Computer Vision {\textendash} ECCV 2010Computer Vision {\textendash} ECCV 2010}, series = {Lecture Notes in Computer Science}, volume = {6313}, year = {2010}, month = {2010///}, pages = {286 - 299}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {Given a set of points corresponding to a 2D projection of a non-planar shape, we would like to obtain a representation invariant to articulations (under no self-occlusions). It is a challenging problem since we need to account for the changes in 2D shape due to 3D articulations, viewpoint variations, as well as the varying effects of imaging process on different regions of the shape due to its non-planarity. By modeling an articulating shape as a combination of approximate convex parts connected by non-convex junctions, we propose to preserve distances between a pair of points by (i) estimating the parts of the shape through approximate convex decomposition, by introducing a robust measure of convexity and (ii) performing part-wise affine normalization by assuming a weak perspective camera model, and then relating the points using the inner distance which is insensitive to planar articulations. We demonstrate the effectiveness of our representation on a dataset with non-planar articulations, and on standard shape retrieval datasets like MPEG-7.}, isbn = {978-3-642-15557-4}, url = {http://dx.doi.org/10.1007/978-3-642-15558-1_21}, author = {Gopalan,Raghuraman and Turaga,Pavan and Chellapa, Rama}, editor = {Daniilidis,Kostas and Maragos,Petros and Paragios,Nikos} } @article {16245, title = {Assembly complexity of prokaryotic genomes using short reads}, journal = {BMC Bioinformatics}, volume = {11}, year = {2010}, month = {2010/01/12/}, pages = {21 - 21}, abstract = {De Bruijn graphs are a theoretical framework underlying several modern genome assembly programs, especially those that deal with very short reads. We describe an application of de Bruijn graphs to analyze the global repeat structure of prokaryotic genomes.}, isbn = {1471-2105}, doi = {10.1186/1471-2105-11-21}, url = {http://www.biomedcentral.com/1471-2105/11/21}, author = {Kingsford, Carl and Schatz,Michael C and Pop, Mihai} } @conference {15849, title = {Assessor error in stratified evaluation}, booktitle = {Proceedings of the 19th ACM international conference on Information and knowledge management}, year = {2010}, month = {2010///}, pages = {539 - 548}, author = {Webber,W. and Oard, Douglas and Scholer,F. and Hedin,B.} } @article {13962, title = {Audio visual scene analysis using spherical arrays and cameras.}, journal = {The Journal of the Acoustical Society of America}, volume = {127}, year = {2010}, month = {2010///}, pages = {1979 - 1979}, abstract = {While audition and vision are used together by living beings to make sense of the world, the observation of the world using machines in applications such as surveillance and robotics has proceeded largely separately. We describe the use of spherical microphone arrays as {\textquotedblleft}audio cameras{\textquotedblright} and spherical array of video cameras as a tool to perform multi-modal scene analysis that attempts to answer questions such as {\textquotedblleft}Who?,{\textquotedblright}, {\textquotedblleft}What?,{\textquotedblright} {\textquotedblleft}Where?,{\textquotedblright} and {\textquotedblleft}Why?.{\textquotedblright} Signal processing algorithms to identify the number of people and their identities and to isolate and dereverberate their speech using multi-modal processing will be described. The use of graphics processor based signal processing allows for real-time implementation of these algorithms. [Work supported by ONR.]}, doi = {10.1121/1.3385079}, url = {http://link.aip.org/link/?JAS/127/1979/3}, author = {O{\textquoteright}donovan,Adam and Duraiswami, Ramani and Zotkin,Dmitry N and Gumerov, Nail A.} } @article {15164, title = {Authenticated broadcast with a partially compromised public-key infrastructure}, journal = {Stabilization, Safety, and Security of Distributed Systems}, year = {2010}, month = {2010///}, pages = {144 - 158}, abstract = {Given a public-key infrastructure (PKI) and digital signatures, it is possible to construct broadcast protocols tolerating any number of corrupted parties. Almost all existing protocols, however, do not distinguish between corrupted parties (who do not follow the protocol), and honest parties whose secret (signing) keys have been compromised (but who continue to behave honestly). We explore conditions under which it is possible to construct broadcast protocols that still provide the usual guarantees (i.e., validity/agreement) to the latter.Consider a network of n parties, where an adversary has compromised the secret keys of up to t c honest parties and, in addition, fully controls the behavior of up to t a other parties. We show that for any fixed t c > 0, and any fixed t a , there exists an efficient protocol for broadcast if and only if 2t a + min (t a , t c ) < n. (When t c = 0, standard results imply feasibility.) We also show that if t c , t a are not fixed, but are only guaranteed to satisfy the bound above, then broadcast is impossible to achieve except for a few specific values of n; for these {\textquotedblleft}exceptional{\textquotedblright} values of n, we demonstrate a broadcast protocol. Taken together, our results give a complete characterization of this problem. }, doi = {10.1007/978-3-642-16023-3_14}, author = {Gordon,S. and Katz, Jonathan and Kumaresan,R. and Yerukhimovich,A.} } @conference {19026, title = {Authentication in the clouds: a framework and its application to mobile users}, series = {CCSW {\textquoteright}10}, year = {2010}, month = {2010}, pages = {1 - 6}, publisher = {ACM}, organization = {ACM}, abstract = {Cloud computing is a natural fit for mobile security. Typical handsets have input constraints and practical computational and power limitations, which must be respected by mobile security technologies in order to be effective. We describe how cloud computing can address these issues. Our approach is based on a flexible framework for supporting authentication decisions we call TrustCube (to manage the authentication infrastructure) and on a behavioral authentication approach referred to as implicit authentication (to translate user behavior into authentication scores). The combination results in a new authentication paradigm for users of mobile technologies, one where an appropriate balance between usability and trust can be managed through flexible policies and dynamic tuning.}, keywords = {Authentication, Cloud computing, Mobile computing}, isbn = {978-1-4503-0089-6}, url = {http://doi.acm.org/10.1145/1866835.1866837}, author = {Chow, Richard and Jakobsson, Markus and Masuoka, Ryusuke and Molina,Jesus and Niu, Yuan and Elaine Shi and Song,Zhexuan} } @conference {19284, title = {Automated generation of an efficient MPEG-4 Reconfigurable Video Coding decoder implementation}, booktitle = {2010 Conference on Design and Architectures for Signal and Image Processing (DASIP)}, year = {2010}, month = {2010}, pages = {265 - 272}, abstract = {This paper proposes an automatic design flow from user-friendly design to efficient implementation of video processing systems. This design flow starts with the use of coarse-grain dataflow representations based on the CAL language, which is a complete language for dataflow programming of embedded systems. Our approach integrates previously developed techniques for detecting synchronous dataflow (SDF) regions within larger CAL networks, and exploiting the static structure of such regions using analysis tools in The Dataflow interchange format Package (TDP). Using a new XML format that we have developed to exchange dataflow information between different dataflow tools, we explore systematic implementation of signal processing systems using CAL, SDF-like region detection, TDP-based static scheduling, and CAL-to-C (CAL2C) translation. Our approach, which is a novel integration of three complementary dataflow tools - the CAL parser, TDP, and CAL2C - is demonstrated on an MPEG Reconfigurable Video Coding (RVC) decoder.}, keywords = {automated generation, automatic design flow, CAL language, CAL networks, CAL-to-C translation, CAL2C translation, coarse-grain dataflow representations, Computational modeling, data flow computing, dataflow information, Dataflow programming, decoding, Digital signal processing, Libraries, MPEG-4 reconfigurable video coding decoder implementation, parallel languages, SDF detection, synchronous dataflow detection, TDP, TDP-based static scheduling, The Dataflow interchange format Package, Transform coding, user-friendly design, video coding, video processing systems, XML, XML format}, author = {Gu, Ruirui and Piat, J. and Raulet, M. and Janneck, J.W. and Bhattacharyya, Shuvra S.} } @conference {13953, title = {Automatic matched filter recovery via the audio camera}, booktitle = {Acoustics Speech and Signal Processing (ICASSP), 2010 IEEE International Conference on}, year = {2010}, month = {2010/03//}, pages = {2826 - 2829}, abstract = {The sound reaching the acoustic sensor in a realistic environment contains not only the part arriving directly from the sound source but also a number of environmental reflections. The effect of those on the sound is equivalent to a convolution with the room impulse response and can be undone via deconvolution - a technique known as matched filter processing. However, the filter is usually pre-computed in advance using known room geometry and source/receiver positions, and any deviations from those cause the performance to degrade significantly. In this work, an algorithm is proposed to compute the matched filter automatically using an audio camera - a microphone array based system that provides real-time audio images (essentially plots of steered response power in various directions) of environment. Acoustic sources, as well as their significant reflections, are revealed as peaks in the audio image. The reflections are associated with sound source(s) using an acoustic similarity metric, and an approximate matched filter is computed to align the reflections in time with the direct arrival. Preliminary experimental evaluation of the method is performed. It is shown that in case of two sources the reflections are identified correctly, the time delays recovered agree well with those computed from geometric constraints, and that the output SNR improves when the reflections are added coherently to the signal obtained by beamforming directly at the source.}, keywords = {acoustic, array;real-time, arrays;transient, audio, camera;automatic, constraints;microphone, filter, filters;microphone, images;room, impulse, Matched, positions;acoustic, processing;cameras;matched, radiators;array, recovery;beamforming;geometric, response;, response;sound, sensor;acoustic, signal, source;source/receiver, sources;audio}, doi = {10.1109/ICASSP.2010.5496187}, author = {O{\textquoteright}Donovan,A.E. and Duraiswami, Ramani and Zotkin,Dmitry N} } @conference {12471, title = {Automatic target recognition based on simultaneous sparse representation}, booktitle = {Image Processing (ICIP), 2010 17th IEEE International Conference on}, year = {2010}, month = {2010/09//}, pages = {1377 - 1380}, abstract = {In this paper, an automatic target recognition algorithm is presented based on a framework for learning dictionaries for simultaneous sparse signal representation and feature extraction. The dictionary learning algorithm is based on class supervised simultaneous orthogonal matching pursuit while a matching pursuit-based similarity measure is used for classification. We show how the proposed framework can be helpful for efficient utilization of data, with the possibility of developing real-time, robust target classification. We verify the efficacy of the proposed algorithm using confusion matrices on the well known Comanche forward-looking infrared data set consisting of ten different military targets at different orientations.}, keywords = {(artificial, algorithm;feature, based, classification;iterative, classification;learning, Comanche, data, dictionary;matching, extraction;image, forward-looking, infrared, intelligence);military, learning, MATCHING, matrix;dictionary, measure;military, methods;learning, orthogonal, pursuit, pursuit;confusion, recognition;class, recognition;target, representation;feature, representation;sparse, set;automatic, signal, similarity, simultaneous, sparse, supervised, systems;object, target, target;simultaneous, tracking;}, doi = {10.1109/ICIP.2010.5652306}, author = {Patel, Vishal M. and Nasrabadi,N.M. and Chellapa, Rama} } @article {18536, title = {Autonomous Traffic Engineering using Self-Configuring Link Weights}, volume = {GT-CS-10-16}, year = {2010}, month = {2010///}, institution = {School of Computer Science, Georgia Tech}, abstract = {Network operators use traffic engineering to control the flow of traffic across their networks. Existing TE methods establish static topologies offline, either by setting link weights or by configuring paths a priori. These methods require manual configuration and may not be robust in the face of failures. Some methods also require knowledge about traffic demands and may not be able to handle traffic fluctuations. Even when changes in demand are expected, operators must manually tune network configurations to prepare for them. Because adjusting configurations is difficult to get right, we start from an extreme design point, asking instead whether it is possible to perform traffic engineering online without having to perform any a priori configuration. Our traffic engineering technique, SculpTE, adapts to changing traffic demands by automatically configuring link weights in a stable manner. SculpTE balances load across the network by continually adjusting link weights to expose lightly-loaded paths. We evaluate SculpTE using a simple analytical model and simulations on realistic ISP network topologies. Our results show that SculpTE achieves excellent load balancing, responsiveness, and stability compared to state-of-the-art TE schemes, without requiring network operators to perform any offline configuration.}, url = {http://hdl.handle.net/1853/35011}, author = {Sundaresan,S. and Lumezanu,C. and Feamster, Nick and Fran{\c c}ois,P.} } @article {18549, title = {Autonomous traffic engineering with self-configuring topologies}, journal = {SIGCOMM Comput. Commun. Rev.}, volume = {41}, year = {2010}, month = {2010/08//}, pages = {{\textendash} - {\textendash}}, abstract = {Network operators use traffic engineering (TE) to control the flow of traffic across their networks. Existing TE methods require manual configuration of link weights or tunnels, which is difficult to get right, or prior knowledge of traffic demands and hence may not be robust to link failures or traffic fluctuations. We present a self-configuring TE scheme, SculpTE, which automatically adapts the network-layer topology to changing traffic demands. SculpTE is responsive, stable, and achieves excellent load balancing.}, keywords = {multi-path routing, online, sculpte, self-configuring, traffic engineering}, isbn = {0146-4833}, url = {http://dl.acm.org/citation.cfm?id=2043164.1851239}, author = {Sundaresan,Srikanth and Lumezanu,Cristian and Feamster, Nick and Francois,Pierre} } @conference {13096, title = {Action recognition based on human movement characteristics}, booktitle = {Motion and Video Computing, 2009. WMVC {\textquoteright}09. Workshop on}, year = {2009}, month = {2009/12//}, pages = {1 - 8}, abstract = {We present a motion descriptor for human action recognition where appearance and shape information are unreliable. Unlike other motion-based approaches, we leverage image characteristics specific to human movement to achieve better robustness and lower computational cost. Drawing on recent work on motion recognition with ballistic dynamics, an action is modeled as a series of short correlated linear movements and represented with a probability density function over motion vector data. We are targeting common human actions composed of ballistic movements, and our descriptor can handle both short actions (e.g. reaching with the hand) and long actions with events at relatively stable time offsets (e.g. walking). The proposed descriptor is used for both classification and detection of action instances, in a nearest-neighbor framework. We evaluate the descriptor on the KTH action database and obtain a recognition rate of 90\% in a relevant test setting, comparable to the state-of-the-art approaches that use other cues in addition to motion. We also acquired a database of actions with slight occlusion and a human actor manipulating objects of various shapes and appearances. This database makes the use of appearance and shape information problematic, but we obtain a recognition rate of 95\%. Our work demonstrates that human movement has distinctive patterns, and that these patterns can be used effectively for action recognition.}, keywords = {action, ballistic, characteristics;motion, correlated, cost;human, data;probability, databases;, density, descriptor;motion, dynamics;computational, function;robustness;shape, information;short, linear, Movement, movements;computer, recognition;human, recognition;stability;visual, vector, vision;pattern}, doi = {10.1109/WMVC.2009.5399233}, author = {Dondera,R. and David Doermann and Davis, Larry S.} } @conference {14193, title = {Active segmentation for robotics}, booktitle = {IEEE/RSJ International Conference on Intelligent Robots and Systems, 2009. IROS 2009}, year = {2009}, month = {2009/10/10/15}, pages = {3133 - 3139}, publisher = {IEEE}, organization = {IEEE}, abstract = {The semantic robots of the immediate future are robots that will be able to find and recognize objects in any environment. They need the capability of segmenting objects in their visual field. In this paper, we propose a novel approach to segmentation based on the operation of fixation by an active observer. Our approach is different from current approaches: while existing works attempt to segment the whole scene at once into many areas, we segment only one image region, specifically the one containing the fixation point. Furthermore, our solution integrates monocular cues (color, texture) with binocular cues (stereo disparities and optical flow). Experiments with real imagery collected by our active robot and from the known databases demonstrate the promise of the approach.}, keywords = {binocular cues, image colour analysis, Image segmentation, Image texture, Intelligent robots, Layout, Machine vision, monocular cues, Navigation, optical flow, Orbital robotics, Robot sensing systems, robot vision, Robot vision systems, robotics active segmentation, Robotics and automation, semantic robot, Simultaneous localization and mapping, stereo disparity, stereo image processing}, isbn = {978-1-4244-3803-7}, doi = {10.1109/IROS.2009.5354325}, author = {Mishra,A. and Aloimonos, J. and Ferm{\"u}ller, Cornelia} } @article {12528, title = {Advanced Technologies for Touchless Fingerprint Recognition}, journal = {Handbook of Remote Biometrics}, year = {2009}, month = {2009///}, pages = {83 - 109}, author = {Tistarelli,M. and Li, S.Z. and Chellapa, Rama} } @inbook {15431, title = {Advances in Web Testing}, booktitle = {Computer Performance IssuesComputer Performance Issues}, volume = {Volume 75}, year = {2009}, month = {2009///}, pages = {281 - 306}, publisher = {Elsevier}, organization = {Elsevier}, abstract = {AbstractDemand for high-quality Web applications continues to escalate as reliance on Web-based software increases and Web systems become increasingly complex. Given the importance of quality and its impact on the user experience, a significant research effort has been invested in developing tools and methodologies that facilitate effective quality assurance for Web applications. Testing, in particular, provides a critical inroad toward meeting the quality demand by enabling developers to discover failures and anomalies in applications before they are released. In this survey, we discuss advances in Web testing and begin by exploring the peculiarities of Web applications that makes evaluating their correctness a challenge and the direct translation of conventional software engineering principles impractical in some cases. We then provide an overview of research contributions in three critical aspects of Web testing: deriving adequate Web application models, defining appropriate Web testing strategies, and conducting Web portability analysis. In short, models are used to capture Web application components, their attributes, and interconnections; testing strategies use the models to generate test cases; and portability analysis enables Web developers to ensure that their applications remain correct as they are launched in highly diverse configurations. }, isbn = {0065-2458}, url = {http://www.sciencedirect.com/science/article/pii/S006524580800805X}, author = {Eaton,Cyntrica and Memon, Atif M.}, editor = {Zelkowitz, Marvin V} } @article {16059, title = {Advancing User-Centered Evaluation of Visual Analytic Environments Through Contests}, journal = {Information VisualizationInformation Visualization}, volume = {8}, year = {2009}, month = {2009/09/21/}, pages = {230 - 238}, abstract = {In this paper, the authors describe the Visual Analytics Science and Technology (VAST) Symposium contests run in 2006 and 2007 and the VAST 2008 and 2009 challenges. These contests were designed to provide researchers with a better understanding of the tasks and data that face potential end users. Access to these end users is limited because of time constraints and the classified nature of the tasks and data. In that respect, the contests serve as an intermediary, with the metrics and feedback serving as measures of utility to the end users. The authors summarize the lessons learned and the future directions for VAST Challenges.}, keywords = {metrics, synthetic data, user-centered evaluation, visual analytics}, isbn = {1473-8716, 1473-8724}, doi = {10.1057/ivs.2009.16}, url = {http://ivi.sagepub.com/content/8/3/230}, author = {Costello,Loura and Grinstein,Georges and Plaisant, Catherine and Scholtz,Jean} } @article {12533, title = {Age progression in human faces: A survey}, journal = {Journal of Visual Languages and Computing}, volume = {15}, year = {2009}, month = {2009///}, pages = {3349 - 3361}, abstract = {Facial aging, a new dimension that has recently beenadded to the problem of face recognition, poses interesting theo- retical and practical challenges to the research community. The problem which originally generated interest in the psychophysics and human perception community, has recently found enhanced interest in the computer vision community. How do humans perceive age ? What constitutes an age-invariant signature that can be derived from faces ? How compactly can the facial growth event be described ? How does facial aging impact recognition performance ? In this paper, we give a thorough analysis on the problem of facial aging and further provide a complete account of the many interesting studies that have been performed on this topic from different fields. We offer a comparative analysis of various approaches that have been proposed for problems such as age estimation, appearance prediction, face verification etc. and offer insights into future research on this topic. }, author = {Ramanathan,N. and Chellapa, Rama and Biswas,S.} } @conference {17752, title = {Aggregate Query Answering under Uncertain Schema Mappings}, booktitle = {Data Engineering, 2009. ICDE {\textquoteright}09. IEEE 25th International Conference on}, year = {2009}, month = {2009/04/29/2}, pages = {940 - 951}, abstract = {Recent interest in managing uncertainty in data integration has led to the introduction of probabilistic schema mappings and the use of probabilistic methods to answer queries across multiple databases using two semantics: by-table and by-tuple. In this paper, we develop three possible semantics for aggregate queries: the range, distribution, and expected value semantics, and show that these three semantics combine with the by-table and by-tuple semantics in six ways. We present algorithms to process COUNT, AVG, SUM, MIN, and MAX queries under all six semantics and develop results on the complexity of processing such queries under all six semantics. We show that computing COUNT is in PTIME for all six semantics and computing SUM is in PTIME for all but the by-tuple/distribution semantics. Finally, we show that AVG, MIN, and MAX are PTIME computable for all by-table semantics and for the by-tuple/range semantics.We developed a prototype implementation and experimented with both real-world traces and simulated data. We show that, as expected, naive processing of aggregates does not scale beyond small databases with a small number of mappings. The results also show that the polynomial time algorithms are scalable up to several million tuples as well as with a large number of mappings.}, keywords = {aggregate, algorithm;probabilistic, answering;by-table, complexity;data, complexity;distributed, database;polynomial, databases;, databases;probability;query, integration;distribution, mapping;computational, mapping;query, processing;range, processing;statistical, query, schema, semantics;by-tuple, semantics;computational, semantics;expected, semantics;multiple, semantics;uncertain, TIME, value}, doi = {10.1109/ICDE.2009.55}, author = {Gal,A. and Martinez,M. V and Simari,G. I and V.S. Subrahmanian} } @conference {17989, title = {Algorithmic approach to designing an easy-to-program system: Can it lead to a HW-enhanced programmer{\textquoteright}s workflow add-on?}, booktitle = {Computer Design, 2009. ICCD 2009. IEEE International Conference on}, year = {2009}, month = {2009/10//}, pages = {60 - 63}, abstract = {Our earlier parallel algorithmics work on the parallel random-access-machine/model (PRAM) computation model led us to a PRAM-On-Chip vision: a comprehensive many-core system that can look to the programmer like the abstract PRAM model. We introduced the eXplicit MultiThreaded (XMT) design and prototyped it in hardware and software. XMT comprises a programmer{\textquoteright}s workflow that advances from work-depth, a standard PRAM theory abstraction, to an XMT program, and, if desired, to its performance tuning. XMT provides strong performance for programs developed this way due to its hardware support of very fine-grained threads and the overhead of handling them. XMT has also shown unique promise when it comes to ease-of-programming, the biggest problem that has limited the impact of all parallel systems to date. For example, teachability of XMT programming has been demonstrated at various levels from rising 6th graders to graduate students, and students in a freshman class were able to program 3 parallel sorting algorithms. The main purpose of the current paper is to stimulate discussion on the following somewhat open-ended question. Now that we made significant progress on a system devoted to supporting PRAM-like programming, is it possible to incorporate our hardware support as an add-on into other current and future many-core systems? The paper considers a concrete proposal for doing that: recasting our work as a hardware-enhanced programmer{\textquoteright}s workflow {\^A}{\textquestiondown}module{\^A}{\textquestiondown} that can then be essentially imported into the other systems.}, keywords = {abstraction;PRAM-On-Chip;easy-to-program, algorithms;parallel, algorithms;sorting;, designing;explicit, multi-threading;fine-grained, PRAM, random-access-machine/model;parallel, sorting, system, system;parallel, systems;concurrency, THEORY, theory;multi-threading;parallel, threads;many-core}, doi = {10.1109/ICCD.2009.5413174}, author = {Vishkin, Uzi} } @article {13355, title = {Algorithms for distributional and adversarial pipelined filter ordering problems}, journal = {ACM Trans. Algorithms}, volume = {5}, year = {2009}, month = {2009/03//}, pages = {24:1{\textendash}24:34 - 24:1{\textendash}24:34}, abstract = {Pipelined filter ordering is a central problem in database query optimization. The problem is to determine the optimal order in which to apply a given set of commutative filters (predicates) to a set of elements (the tuples of a relation), so as to find, as efficiently as possible, the tuples that satisfy all of the filters. Optimization of pipelined filter ordering has recently received renewed attention in the context of environments such as the Web, continuous high-speed data streams, and sensor networks. Pipelined filter ordering problems are also studied in areas such as fault detection and machine learning under names such as learning with attribute costs, minimum-sum set cover, and satisficing search. We present algorithms for two natural extensions of the classical pipelined filter ordering problem: (1) a distributional-type problem where the filters run in parallel and the goal is to maximize throughput, and (2) an adversarial-type problem where the goal is to minimize the expected value of multiplicative regret. We present two related algorithms for solving (1), both running in time O(n2), which improve on the O(n3 log n) algorithm of Kodialam. We use techniques from our algorithms for (1) to obtain an algorithm for (2).}, keywords = {flow algorithms, Pipelined filter ordering, Query optimization, selection ordering}, isbn = {1549-6325}, doi = {10.1145/1497290.1497300}, url = {http://doi.acm.org/10.1145/1497290.1497300}, author = {Condon,Anne and Deshpande, Amol and Hellerstein,Lisa and Wu,Ning} } @article {18784, title = {Algorithms for extraction of nanowire lengths and positions from optical section microscopy image sequence}, journal = {Journal of Computing and Information Science in Engineering}, volume = {9}, year = {2009}, month = {2009///}, pages = {041007 - 041007}, author = {Peng,T. and Balijepalli,A. and Gupta,S.K. and LeBrun,T. W.} } @article {18811, title = {Algorithms for generating multi-stage molding plans for articulated assemblies}, journal = {Robotics and Computer-Integrated Manufacturing}, volume = {25}, year = {2009}, month = {2009/02//}, pages = {91 - 106}, abstract = {Multi-stage molding is capable of producing better-quality articulated products at a lower cost. During the multi-stage molding process, assembly operations are performed along with the molding operations. Hence, it gives rise to a new type of planning problem. It is difficult to perform the planning manually because it involves evaluating large number of combinations and solving complex geometric reasoning problems. This paper investigates the problem of generating multi-stage molding plans for articulated assemblies. We present a planning framework that allows us to utilize constraints from experimentally proven molding plans. As a part of the planning problem, we determine the molding sequence and intermediate assembly configurations. We present algorithms for all the steps in the planning problem and characterize their computational complexities. Finally, we illustrate our approach with representative examples.}, keywords = {In-mold assembly, mold design, Process planning}, isbn = {0736-5845}, doi = {10.1016/j.rcim.2007.10.002}, url = {http://www.sciencedirect.com/science/article/pii/S0736584507001044}, author = {Priyadarshi,Alok K. and Gupta, Satyandra K.} } @conference {12229, title = {All Bits Are Not Equal - A Study of IEEE 802.11 Communication Bit Errors}, booktitle = {INFOCOM 2009, IEEE}, year = {2009}, month = {2009/04//}, pages = {1602 - 1610}, abstract = {In IEEE 802.11 Wireless LAN (WLAN) systems, techniques such as acknowledgement, retransmission, and transmission rate adaptation, are frame-level mechanisms designed for combating transmission errors. Recently sub-frame level mechanisms such as frame combining have been proposed by the research community. In this paper, we present results obtained from our bit error study for identifying sub-frame error patterns because we believe that identifiable bit error patterns can potentially introduce new opportunities in channel coding, network coding, forward error correction (FEC), and frame combining mechanisms. We have constructed a number of IEEE 802.11 wireless LAN testbeds and conducted extensive experiments to study the characteristics of bit errors and their location distribution. Conventional wisdom dictates that bit error probability is the result of channel condition and ought to follow corresponding distribution. However our measurement results identify three repeatable bit error patterns that are not induced by channel conditions. We have verified that such error patterns are present in WLAN transmissions in different physical environments and across different wireless LAN hardware platforms. We also discuss our current hypotheses for the reasons behind these bit error probability patterns and how identifying these patterns may help improving WLAN transmission robustness.}, keywords = {802.11, bit, coding;error, coding;forward, coding;subframe, combining, Communication, correction;frame, correction;wireless, error, errors;channel, errors;wireless, IEEE, LAN;, LAN;channel, mechanisms;network, patterns;transmission, statistics;forward}, doi = {10.1109/INFCOM.2009.5062078}, author = {Han,Bo and Ji,Lusheng and Lee,Seungjoon and Bhattacharjee, Bobby and Miller,R.R.} } @article {12886, title = {Analysis of clonally related environmental Vibrio cholerae O1 El Tor isolated before 1992 from Varanasi, India reveals origin of SXT-ICEs belonging to O139 and O1 serogroups}, journal = {Environmental Microbiology Reports}, volume = {2}, year = {2009}, month = {2009/07/21/}, pages = {50 - 57}, abstract = {In this study, we report the presence of SXT in environmental Vibrio cholerae O1 El Tor strains isolated before 1992 from Varanasi, India. All isolates, except one, were resistant to Tm, and/or Sul, Sm, Fr, Na and Am. None contained plasmids. PCR and DNA sequencing revealed the presence of SXT containing dfrA1 and/or sulII, strAB in six isolates and dfr18, sulII and strAB in five isolates. Three clinical V. cholerae O1 isolated during 1992 contained the antibiotic resistance gene cassette aadA1 in the class 1 integron. Conjugation experiments, followed by PCR analysis of transconjugants, provided evidence of the transferable nature of SXT and associated antibiotic resistance genes, and its integration into the prfC site. Results of phylogenetic analysis of the intSXT gene of clonally similar V. cholerae showed a clear difference between dfr18+ and dfrA1+V. cholerae O1 isolates. This is the first report of the occurrence of SXT harbouring sulII, strAB, dfr18 and/or dfrA1 genes in environmental V. cholerae O1 isolated prior to 1992 from Varanasi, India, and suggests emergence of SXT+ antibiotic-resistant V. cholerae O139 and O1 from an environmental V. cholerae progenitor by acquisition of SXT and antibiotic-resistant gene clusters.}, isbn = {1758-2229}, doi = {10.1111/j.1758-2229.2009.00051.x}, url = {http://onlinelibrary.wiley.com/doi/10.1111/j.1758-2229.2009.00051.x/abstract?userIsAuthenticated=false\&deniedAccessCustomisedMessage=}, author = {Mohapatra,Saswat S. and Mantri,Chinmay K. and Mohapatra,Harapriya and Rita R Colwell and Singh,Durg V.} } @article {15377, title = {Analytical Description of Quasi-Random Magnetization Relaxation to Equilibrium}, journal = {Magnetics, IEEE Transactions on}, volume = {45}, year = {2009}, month = {2009/11//}, pages = {5224 - 5227}, abstract = {The Landau-Lifshitz (LL) dynamics of a uniformly magnetized particle is considered. The LL equation is written in the form of a Hamiltonian perturbed dynamical system. By using suitable averaging technique, the equation for the slow dynamics of the energy is derived. The averaging technique breaks up in the case of separatrix crossing. It is shown that, in the limit of small damping, the separatrix crossing can be described by using a probabilistic approach.}, keywords = {approach;quasirandom, crossing;uniformly, dynamical, dynamics;averaging, Hamiltonian, magnetization, magnetized, particle;magnetic, particles;magnetic, perturbed, relaxation;magnetisation;probability;, relaxation;separatrix, system;Landau-Lifshitz, technique;damping;probabilistic}, isbn = {0018-9464}, doi = {10.1109/TMAG.2009.2031067}, author = {Serpico,C. and d{\textquoteright}Aquino,M. and Bertotti,G. and Mayergoyz, Issak D} } @conference {16974, title = {Analyzing (social media) networks with NodeXL}, booktitle = {Proceedings of the fourth international conference on Communities and technologies}, series = {C\&$\#$38;T {\textquoteright}09}, year = {2009}, month = {2009///}, pages = {255 - 264}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {We present NodeXL, an extendible toolkit for network overview, discovery and exploration implemented as an add-in to the Microsoft Excel 2007 spreadsheet software. We demonstrate NodeXL data analysis and visualization features with a social media data sample drawn from an enterprise intranet social network. A sequence of NodeXL operations from data import to computation of network statistics and refinement of network visualization through sorting, filtering, and clustering functions is described. These operations reveal sociologically relevant differences in the patterns of interconnection among employee participants in the social media space. The tool and method can be broadly applied.}, keywords = {excel, network analysis, social media, social network, spreadsheet, Visualization}, isbn = {978-1-60558-713-4}, doi = {10.1145/1556460.1556497}, url = {http://doi.acm.org/10.1145/1556460.1556497}, author = {Smith,Marc A. and Shneiderman, Ben and Milic-Frayling,Natasa and Mendes Rodrigues,Eduarda and Barash,Vladimir and Dunne,Cody and Capone,Tony and Perer,Adam and Gleave,Eric} } @conference {18659, title = {Analyzing the process of installing rogue software}, year = {2009}, month = {2009/07/29/2}, pages = {560 - 565}, abstract = {This practical experience report presents the results of an experiment aimed at understanding the sequence of malicious actions following a remote compromise. The type of rogue software installed during attacks was used to classify and understand sequences of malicious actions. For this experiment, we used four Linux target computers running SSH with simple passwords. During the eight-month data collection period, we recorded a total of 1,171 attack sessions. In these sessions, attackers typed a total of 20,335 commands that we categorized into 24 specific actions. These actions were analyzed based on the type of rogue software installed by attackers.}, keywords = {Linux, Linux target computers, malicious actions, rogue software installation, security of data}, doi = {10.1109/DSN.2009.5270293}, author = {Berthier,R. and Arjona,J. and Michel Cukier} } @article {12522, title = {Appearance Modeling Using a Geometric Transform}, journal = {Image Processing, IEEE Transactions on}, volume = {18}, year = {2009}, month = {2009/04//}, pages = {889 - 902}, abstract = {A general transform, called the geometric transform (GeT), that models the appearance inside a closed contour is proposed. The proposed GeT is a functional of an image intensity function and a region indicator function derived from a closed contour. It can be designed to combine the shape and appearance information at different resolutions and to generate models invariant to deformation, articulation, or occlusion. By choosing appropriate functionals and region indicator functions, the GeT unifies Radon transform, trace transform, and a class of image warpings. By varying the region indicator and the types of features used for appearance modeling, five novel types of GeTs are introduced and applied to fingerprinting the appearance inside a contour. They include the GeTs based on a level set, shape matching, feature curves, and the GeT invariant to occlusion, and a multiresolution GeT (MRGeT). Applications of GeT to pedestrian identity recognition, human body part segmentation, and image synthesis are illustrated. The proposed approach produces promising results when applied to fingerprinting the appearance of a human and body parts despite the presence of nonrigid deformations and articulated motion.}, keywords = {body, contour;feature, curve;fingerprinting;geometric, function;image, function;shape, geometry;image, identity, indicator, INTENSITY, matching;trace, method;pedestrian, modeling;closed, part, Radon, recognition;region, resolution;image, segmentation;, segmentation;image, set, synthesis;image, transform;appearance, transform;human, transform;Radon, transforms;computational, warping;level}, isbn = {1057-7149}, doi = {10.1109/TIP.2008.2011381}, author = {Li,Jian and Zhou,S. K and Chellapa, Rama} } @conference {11902, title = {Approximate kernel matrix computation on GPUs forlarge scale learning applications}, booktitle = {Proceedings of the 23rd international conference on Supercomputing}, series = {ICS {\textquoteright}09}, year = {2009}, month = {2009///}, pages = {511 - 512}, publisher = {ACM}, organization = {ACM}, address = {Yorktown Heights, NY, USA}, abstract = {Kernel-based learning methods require quadratic space and time complexities to compute the kernel matrix. These complexities limit the applicability of kernel methods to large scale problems with millions of data points. In this paper, we introduce a novel representation of kernel matrices on Graphics Processing Units (GPU). The novel representation exploits the sparseness of the kernel matrix to address the space complexity problem. It also respects the guidelines for memory access on GPUs, which are critical for good performance, to address the time complexity problem. Our representation utilizes the locality preserving properties of space filling curves to obtain a band approximation of the kernel matrix. To prove the validity of the representation, we use Affinity Propagation, an unsupervised clustering algorithm, as an example of kernel methods. Experimental results show a 40x speedup of AP using our representation without degradation in clustering performance.}, keywords = {affinity propagation, algorithms, arrays, gpu, kernel methods, parallel programming, performance, space filling curves, sparse matrices}, isbn = {978-1-60558-498-0}, doi = {10.1145/1542275.1542355}, author = {Hussein,Mohamed E and Abd-Almageed, Wael} } @conference {16470, title = {ApproxRank: Estimating Rank for a Subgraph}, booktitle = {IEEE 25th International Conference on Data Engineering, 2009. ICDE {\textquoteright}09}, year = {2009}, month = {2009/04/29/March}, pages = {54 - 65}, publisher = {IEEE}, organization = {IEEE}, abstract = {Customized semantic query answering, personalized search, focused crawlers and localized search engines frequently focus on ranking the pages contained within a subgraph of the global Web graph. The challenge for these applications is to compute PageRank-style scores efficiently on the subgraph, i.e., the ranking must reflect the global link structure of the Web graph but it must do so without paying the high overhead associated with a global computation. We propose a framework of an exact solution and an approximate solution for computing ranking on a subgraph. The IdealRank algorithm is an exact solution with the assumption that the scores of external pages are known. We prove that the IdealRank scores for pages in the subgraph converge. Since the PageRank-style scores of external pages may not typically be available, we propose the ApproxRank algorithm to estimate scores for the subgraph. Both IdealRank and ApproxRank represent the set of external pages with an external node L1 and extend the subgraph with links to L1. They also modify the PageRank-style transition matrix with respect to L1. We analyze the L1 distance between IdealRank scores and ApproxRank scores of the subgraph and show that it is within a constant factor of the L1 distance of the external pages (e.g., the true PageRank scores and uniform scores assumed by ApproxRank). We compare ApproxRank and a stochastic complementation approach (SC), a current best solution for this problem, on different types of subgraphs. ApproxRank has similar or superior performance to SC and typically improves on the runtime performance of SC by an order of magnitude or better. We demonstrate that ApproxRank provides a good approximation to PageRank for a variety of subgraphs.}, keywords = {Application software, ApproxRank, Computer applications, Crawlers, customized semantic query answering, Data engineering, Educational institutions, Explosions, focused crawlers, global Web graph, graph theory, IdealRank algorithm, Internet, localized search engines, PageRank-style, personalized search, Query processing, Runtime, Search engines, Stochastic processes, Web pages}, isbn = {978-1-4244-3422-0}, doi = {10.1109/ICDE.2009.108}, author = {Yao Wu and Raschid, Louiqa} } @conference {15855, title = {Arabic Cross-Document Coreference Resolution}, booktitle = {Proceedings of the ACL-IJCNLP 2009 Conference Short Papers$}$}, year = {2009}, month = {2009///}, pages = {357 - 360}, author = {Sayeed,A. and Elsayed,T. and Garera,N. and Alexander,D. and Xu,T. and Oard, Douglas and Yarowsky,D. and Piatko,C.} } @article {12531, title = {An architectural level design methodology for smart camera applications}, journal = {International Journal of Embedded Systems}, volume = {4}, year = {2009}, month = {2009///}, pages = {83 - 97}, abstract = {Today{\textquoteright}s embedded computing applications are characterised by increased functionality, and hence increased design complexity and processing requirements. The resulting design spaces are vast and designers are typically able to evaluate only small subsets of solutions due to lack of efficient design tools. In this paper, we propose an architectural level design methodology that provides a means for a comprehensive design space exploration for smart camera applications and enable designers to select higher quality solutions and provides substantial savings on the overall cost of the system. We present efficient, accurate and intuitive models for performance estimation and validate them with experiments.}, author = {Saha,S. and Kianzad,V. and Schlessman,J. and Aggarwal,G. and Bhattacharyya, Shuvra S. and Chellapa, Rama and Wolf,W.} } @article {16244, title = {ARDB-Antibiotic Resistance Genes Database}, journal = {Nucleic Acids Research}, volume = {37}, year = {2009}, month = {2009/01/01/}, pages = {D443-D447 - D443-D447}, abstract = {The treatment of infections is increasingly compromised by the ability of bacteria to develop resistance to antibiotics through mutations or through the acquisition of resistance genes. Antibiotic resistance genes also have the potential to be used for bio-terror purposes through genetically modified organisms. In order to facilitate the identification and characterization of these genes, we have created a manually curated database{\textemdash}the Antibiotic Resistance Genes Database (ARDB){\textemdash}unifying most of the publicly available information on antibiotic resistance. Each gene and resistance type is annotated with rich information, including resistance profile, mechanism of action, ontology, COG and CDD annotations, as well as external links to sequence and protein databases. Our database also supports sequence similarity searches and implements an initial version of a tool for characterizing common mutations that confer antibiotic resistance. The information we provide can be used as compendium of antibiotic resistance factors as well as to identify the resistance genes of newly sequenced genes, genomes, or metagenomes. Currently, ARDB contains resistance information for 13 293 genes, 377 types, 257 antibiotics, 632 genomes, 933 species and 124 genera. ARDB is available at http://ardb.cbcb.umd.edu/.}, isbn = {0305-1048, 1362-4962}, doi = {10.1093/nar/gkn656}, url = {http://nar.oxfordjournals.org/content/37/suppl_1/D443.short}, author = {Liu,B. and Pop, Mihai} } @inbook {18894, title = {Artificial Intelligence and Automation}, booktitle = {Springer Handbook of Automation}, year = {2009}, month = {2009///}, pages = {249 - 268}, publisher = {Springer Berlin Heidelberg}, organization = {Springer Berlin Heidelberg}, abstract = {Artificial intelligence (AI) focuses on getting machines to do things that we would call intelligent behavior. Intelligence {\textendash} whether artificial or otherwise {\textendash} does not have a precise definition, but there are many activities and behaviors that are considered intelligent when exhibited by humans and animals. Examples include seeing, learning, using tools, understanding human speech, reasoning, making good guesses, playing games, and formulating plans and objectives. AI focuses on how to get machines or computers to perform these same kinds of activities, though not necessarily in the same way that humans or animals might do them.}, keywords = {engineering}, isbn = {978-3-540-78831-7}, url = {http://www.springerlink.com/content/q7051r251p38p51h/abstract/}, author = {Nau, Dana S.}, editor = {Nof,Shimon Y.} } @article {12113, title = {An assessment of systems and software engineering scholars and institutions (2002{\textendash}2006)}, journal = {Journal of Systems and Software}, volume = {82}, year = {2009}, month = {2009/08//}, pages = {1370 - 1373}, abstract = {This paper summarizes a survey of publications in the field of systems and software engineering from 2002 to 2006. The survey is an ongoing, annual event that identifies the top 15 scholars and institutions over a 5-year period. The rankings are calculated based on the number of papers published in TSE, TOSEM, JSS, SPE, EMSE, IST, and Software. The top-ranked institution is Korea Advanced Institute of Science and Technology, Korea, and the top-ranked scholar is Magne J{\o}rgensen of Simula Research Laboratory, Norway.}, keywords = {Research publications, Systems and software engineering, Top institutions, Top scholars}, isbn = {0164-1212}, doi = {10.1016/j.jss.2009.06.018}, url = {http://www.sciencedirect.com/science/article/pii/S0164121209001265}, author = {Wong,W. Eric and Tse,T.H. and Glass,Robert L. and Basili, Victor R. and Chen,T.Y.} } @conference {13108, title = {Assigning cameras to subjects in video surveillance systems}, booktitle = {Robotics and Automation, 2009. ICRA {\textquoteright}09. IEEE International Conference on}, year = {2009}, month = {2009/05//}, pages = {837 - 843}, abstract = {We consider the problem of tracking multiple agents moving amongst obstacles, using multiple cameras. Given an environment with obstacles, and many people moving through it, we construct a separate narrow field of view video for as many people as possible, by stitching together video segments from multiple cameras over time. We employ a novel approach to assign cameras to people as a function of time, with camera switches when needed. The problem is modeled as a bipartite graph and the solution corresponds to a maximum matching. As people move, the solution is efficiently updated by computing an augmenting path rather than by solving for a new matching. This reduces computation time by an order of magnitude. In addition, solving for the shortest augmenting path minimizes the number of camera switches at each update. When not all people can be covered by the available cameras, we cluster as many people as possible into small groups, then assign cameras to groups using a minimum cost matching algorithm. We test our method using numerous runs from different simulators.}, keywords = {agent, algorithm;multiple, assignment;computation, augmenting, cameras;video, cost, detection;video, graph;camera, MATCHING, matching;minimum, matching;target, path;bipartite, reduction;maximum, segment;video, Surveillance, surveillance;, system;graph, theory;image, TIME, tracking;obstacle, tracking;video, video}, doi = {10.1109/ROBOT.2009.5152753}, author = {El-Alfy,H. and Jacobs, David W. and Davis, Larry S.} } @conference {15136, title = {Attacking cryptographic schemes based on "perturbation polynomials"}, booktitle = {Proceedings of the 16th ACM conference on Computer and communications security}, series = {CCS {\textquoteright}09}, year = {2009}, month = {2009///}, pages = {1 - 10}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {We show attacks on several cryptographic schemes that have recently been proposed for achieving various security goals in sensor networks. Roughly speaking, these schemes all use "perturbation polynomials" to add "noise" to polynomialbased systems that offer information-theoretic security, in an attempt to increase the resilience threshold while maintaining efficiency. We show that the heuristic security arguments given for these modified schemes do not hold, and that they can be completely broken once we allow even a slight extension of the parameters beyond those achieved by the underlying information-theoretic schemes. Our attacks apply to the key predistribution scheme of Zhang et al. (MobiHoc 2007), the access-control schemes of Subramanian et al. (PerCom 2007), and the authentication schemes of Zhang et al. (INFOCOM 2008). Our results cast doubt on the viability of using "perturbation polynomials" for designing secure cryptographic schemes.}, keywords = {pairwise key establishment, random perturbation polynomial, sensor network security}, isbn = {978-1-60558-894-0}, doi = {10.1145/1653662.1653664}, url = {http://doi.acm.org/10.1145/1653662.1653664}, author = {Albrecht,Martin and Gentry,Craig and Halevi,Shai and Katz, Jonathan} } @article {15876, title = {Automatic classification of human values: Applying computational thinking to information ethics}, journal = {Proceedings of the American Society for Information Science and Technology}, volume = {46}, year = {2009}, month = {2009///}, pages = {1 - 4}, author = {Fleischmann,K.R. and Oard, Douglas and Cheng,A.S. and Wang,P. and Ishita,E.} } @article {18695, title = {Avid interactions underlie the Lys63-linked polyubiquitin binding specificities observed for UBA domains}, journal = {Nature Structural \& Molecular Biology}, volume = {16}, year = {2009}, month = {2009///}, pages = {883 - 889}, abstract = {Ubiquitin (denoted Ub) receptor proteins as a group must contain a diverse set of binding specificities to distinguish the many forms of polyubiquitin (polyUb) signals. Previous studies suggested that the large class of ubiquitin-associated (UBA) domains contains members with intrinsic specificity for Lys63-linked polyUb or Lys48-linked polyUb, thus explaining how UBA-containing proteins can mediate diverse signaling events. Here we show that previously observed Lys63-polyUb selectivity in UBA domains is the result of an artifact in which the dimeric fusion partner, glutathione S-transferase (GST), positions two UBAs for higher affinity, avid interactions with Lys63-polyUb, but not with Lys48-polyUb. Freed from GST, these UBAs are either nonselective or prefer Lys48-polyUb. Accordingly, NMR experiments reveal no Lys63-polyUb{\textendash}specific binding epitopes for these UBAs. We reexamine previous conclusions based on GST-UBAs and present an alternative model for how UBAs achieve a diverse range of linkage specificities.}, keywords = {apoptosis, basic cellular processes, Biochemistry, biophysics, cell biology, cell cycle, cell surface proteins, cell-cell interactions, checkpoints, chromatin, chromatin remodeling, chromatin structure, content, DNA recombination, DNA repair, DNA replication, Gene expression, Genetics, intracellular signaling, journal, macromolecules, mechanism, membrane processes, molecular, molecular basis of disease, molecular biology, molecular interactions, multi-component complexes, nature publishing group, nature structural molecular biology, nucleic acids, protein degradation, protein folding, protein processing, Proteins, regulation of transcription, regulation of translation, RNA, RNA processing, RNAi, signal transduction, single molecule studies, structure and function of proteins, transcription, translation}, isbn = {1545-9993}, doi = {10.1038/nsmb.1637}, url = {http://www.nature.com/nsmb/journal/v16/n8/abs/nsmb.1637.html}, author = {Sims,Joshua J. and Haririnia,Aydin and Dickinson,Bryan C. and Fushman, David and Cohen,Robert E.} } @conference {13484, title = {ACamera Phone Based Currency Reader for the Visually Impaired}, booktitle = {The Tenth International ACMSIG ACCESS Conference on Computers and Accessibility}, year = {2008}, month = {2008/10//}, pages = {305 - 306}, abstract = {In this paper we present a camera phone-based currency reader for the visually impaired to denominate face values of the U.S. paper dollars. Currently, they can only be identified visually and this situation will continue in foreseeable future. Our solution harvests the imaging and computational power on camera phones to read bills. Considering it is impractical for the visually impaired to capture high quality image, our currency reader performs real time processing for each captured frame as the camera approaches the bill. We develop efficient background subtraction and perspective correction algorithms and train our currency reader using the Ada-boost framework, which is efficient. Our currency reader processes 10 frames/second and achieves a false positive rate of 10^-4. Major smart phone platforms, including Symbian and Windows Mobile, are supported.}, author = {Liu,Xu and David Doermann} } @conference {13485, title = {ACamera-based Mobile Data Channel: Capacity and Analysis}, booktitle = {ACM International Conference on Multimedia}, year = {2008}, month = {2008///}, pages = {359 - 368}, abstract = {In this paper we propose a novel application, color Video Code (V-Code) and analyze its data transmission capacity through camera-based mobile data channels. Users can use the camera on a mobile device (PDA or camera phone) as a passive and pervasive data channel to download data encoded as a sequence of color visual patterns. The color V-Code is animated on a display, acquired by the camera and decoded by the pre-embedded software in the mobile device. One interesting question is what is the data transmission capacity it can achieve, theoretically and practically. To answer this question we build a camera channel model to measure color degradation using information theory and show that the capacity of the camera channel can be improved with the optimized color selection through color calibration. After initialization color models are learned automatically as downloading proceeds. We address the problem of precise registration, and implemented a fast perspective correction method to accelerate the decoder in real-time on a resource constrained device. With the optimized color set and efficient implementation we achieve a transmission bit rate of 15.4kbps on a common iMate Jamin phone (200MHz CPU). This speed is faster than the average GPRS bit rate (12kbps).}, author = {Liu,Xu and David Doermann and Li,H.} } @article {15838, title = {Access to recorded interviews}, journal = {Journal on Computing and Cultural Heritage}, volume = {1}, year = {2008}, month = {2008/06/01/}, pages = {1 - 27}, isbn = {15564673}, doi = {10.1145/1367080.1367083}, url = {http://dl.acm.org/citation.cfm?id=1367083}, author = {Jong,Franciska De and Oard, Douglas and Heeren,Willemijn and Ordelman,Roeland} } @article {18544, title = {Accountable internet protocol (aip)}, journal = {SIGCOMM Comput. Commun. Rev.}, volume = {38}, year = {2008}, month = {2008/08//}, pages = {339 - 350}, abstract = {This paper presents AIP (Accountable Internet Protocol), a network architecture that provides accountability as a first-order property. AIP uses a hierarchy of self-certifying addresses, in which each component is derived from the public key of the corresponding entity. We discuss how AIP enables simple solutions to source spoofing, denial-of-service, route hijacking, and route forgery. We also discuss how AIP{\textquoteright}s design meets the challenges of scaling, key management, and traffic engineering.}, keywords = {accountability, address, internet architecture, scalability, Security}, isbn = {0146-4833}, doi = {10.1145/1402946.1402997}, url = {http://doi.acm.org/10.1145/1402946.1402997}, author = {Andersen,David G. and Balakrishnan,Hari and Feamster, Nick and Koponen,Teemu and Moon,Daekyeong and Shenker,Scott} } @article {13874, title = {The acl anthology reference corpus: A reference dataset for bibliographic research in computational linguistics}, journal = {Proc. of the 6th International Conference on Language Resources and Evaluation Conference (LREC{\textquoteright}08)}, year = {2008}, month = {2008///}, pages = {1755 - 1759}, abstract = {The ACL Anthology is a digital archive of conference and journal papers in natural language processing and computational linguistics.Its primary purpose is to serve as a reference repository of research results, but we believe that it can also be an object of study and a platform for research in its own right. We describe an enriched and standardized reference corpus derived from the ACL Anthology that can be used for research in scholarly document processing. This corpus, which we call the ACL Anthology Reference Corpus (ACL ARC), brings together the recent activities of a number of research groups around the world. Our goal is to make the corpus widely available, and to encourage other researchers to use it as a standard testbed for experiments in both bibliographic and bibliometric research. }, author = {Bird,S. and Dale,R. and Dorr, Bonnie J and Gibson,B. and Joseph,M.T. and Kan,M.Y. and Lee,D. and Powley,B. and Radev,D.R. and Tan,Y.F.} } @conference {13121, title = {Action recognition using ballistic dynamics}, booktitle = {Computer Vision and Pattern Recognition, 2008. CVPR 2008. IEEE Conference on}, year = {2008}, month = {2008/06//}, pages = {1 - 8}, abstract = {We present a Bayesian framework for action recognition through ballistic dynamics. Psycho-kinesiological studies indicate that ballistic movements form the natural units for human movement planning. The framework leads to an efficient and robust algorithm for temporally segmenting videos into atomic movements. Individual movements are annotated with person-centric morphological labels called ballistic verbs. This is tested on a dataset of interactive movements, achieving high recognition rates. The approach is also applied on a gesture recognition task, improving a previously reported recognition rate from 84\% to 92\%. Consideration of ballistic dynamics enhances the performance of the popular Motion History Image feature. We also illustrate the approachpsilas general utility on real-world videos. Experiments indicate that the method is robust to view, style and appearance variations.}, keywords = {analysis;image, Bayesian, dynamics;gesture, feature;person-centric, framework;action, History, image, labels;psycho-kinesiological, morphological, MOTION, Movement, movements;motion, planning;interactive, processing;, recognition, recognition;ballistic, recognition;image, segmentation;video, signal, studies;image, task;human}, doi = {10.1109/CVPR.2008.4587806}, author = {Vitaladevuni,S.N. and Kellokumpu,V. and Davis, Larry S.} } @article {15954, title = {Active logic semantics for a single agent in a static world}, journal = {Artificial Intelligence}, volume = {172}, year = {2008}, month = {2008/05//}, pages = {1045 - 1063}, abstract = {For some time we have been developing, and have had significant practical success with, a time-sensitive, contradiction-tolerant logical reasoning engine called the active logic machine (ALMA). The current paper details a semantics for a general version of the underlying logical formalism, active logic. Central to active logic are special rules controlling the inheritance of beliefs in general (and of beliefs about the current time in particular), very tight controls on what can be derived from direct contradictions (P\&{\textlnot}P), and mechanisms allowing an agent to represent and reason about its own beliefs and past reasoning. Furthermore, inspired by the notion that until an agent notices that a set of beliefs is contradictory, that set seems consistent (and the agent therefore reasons with it as if it were consistent), we introduce an "apperception function" that represents an agent{\textquoteright}s limited awareness of its own beliefs, and serves to modify inconsistent belief sets so as to yield consistent sets. Using these ideas, we introduce a new definition of logical consequence in the context of active logic, as well as a new definition of soundness such that, when reasoning with consistent premises, all classically sound rules remain sound in our new sense. However, not everything that is classically sound remains sound in our sense, for by classical definitions, all rules with contradictory premises are vacuously sound, whereas in active logic not everything follows from a contradiction.}, keywords = {Active logic, Autonomous agents, Brittleness, Logic, Nonmonotonic logic, Paraconsistent logic, semantics, Soundness, TIME}, isbn = {0004-3702}, doi = {16/j.artint.2007.11.005}, url = {http://www.sciencedirect.com/science/article/pii/S0004370207001993}, author = {Anderson,Michael L. and Gomaa,Walid and Grant,John and Perlis, Don} } @article {12558, title = {Activity Modeling Using Event Probability Sequences}, journal = {Image Processing, IEEE Transactions on}, volume = {17}, year = {2008}, month = {2008/04//}, pages = {594 - 607}, abstract = {Changes in motion properties of trajectories provide useful cues for modeling and recognizing human activities. We associate an event with significant changes that are localized in time and space, and represent activities as a sequence of such events. The localized nature of events allows for detection of subtle changes or anomalies in activities. In this paper, we present a probabilistic approach for representing events using the hidden Markov model (HMM) framework. Using trained HMMs for activities, an event probability sequence is computed for every motion trajectory in the training set. It reflects the probability of an event occurring at every time instant. Though the parameters of the trained HMMs depend on viewing direction, the event probability sequences are robust to changes in viewing direction. We describe sufficient conditions for the existence of view invariance. The usefulness of the proposed event representation is illustrated using activity recognition and anomaly detection. Experiments using the indoor University of Central Florida human action dataset, the Carnegie Mellon University Credo Intelligence, Inc., Motion Capture dataset, and the outdoor Transportation Security Administration airport tarmac surveillance dataset show encouraging results.}, keywords = {Automated;Reproducibility of Results;Sensitivity and Specificity;Video Recording;, Biological;Models, Carnegie Mellon University;Credo Intelligence, Computer-Assisted;Models, Inc.;Motion Capture dataset;Transportation Security Administration;University Central Florida;airport tarmac surveillance dataset;anomaly detection;event probability sequence;event representation;hidden Markov model;human action dataset;human activity rec, Statistical;Motor Activity;Movement;Pattern Recognition}, isbn = {1057-7149}, doi = {10.1109/TIP.2008.916991}, author = {Cuntoor, N.P. and Yegnanarayana,B. and Chellapa, Rama} } @article {12562, title = {Activity representation using 3D shape models}, journal = {J. Image Video Process.}, volume = {2008}, year = {2008}, month = {2008/01//}, pages = {5:1{\textendash}5:16 - 5:1{\textendash}5:16}, abstract = {We present a method for characterizing human activities using 3D deformable shape models. The motion trajectories of points extracted from objects involved in the activity are used to build models for each activity, and these models are used for classification and detection of unusual activities. The deformable models are learnt using the factorization theorem for nonrigid 3D models. We present a theory for characterizing the degree of deformation in the 3D models from a sequence of tracked observations. This degree, termed as deformation index (DI), is used as an input to the 3D model estimation process. We study the special case of ground plane activities in detail because of its importance in video surveillance applications. We present results of our activity modeling approach using videos of both high-resolution single individual activities and ground plane surveillance activities.}, isbn = {1687-5176}, doi = {10.1155/2008/347050}, url = {http://dx.doi.org/10.1155/2008/347050}, author = {Abdelkader,Mohamed F. and Roy-Chowdhury,Amit K. and Chellapa, Rama and Akdemir,Umut} } @conference {14323, title = {Activity sensing in the wild: a field trial of ubifit garden}, booktitle = {Proceeding of the twenty-sixth annual SIGCHI conference on Human factors in computing systems}, year = {2008}, month = {2008///}, pages = {1797 - 1806}, author = {Consolvo,S. and McDonald,D.W. and Toscos,T. and Chen,M.Y. and Jon Froehlich and Harrison,B. and Klasnja,P. and LaMarca,A. and LeGrand,L. and Libby,R. and others} } @article {15708, title = {Adaptive Constraint Reduction for Training Support Vector Machines}, journal = {Electronic Transactions on Numerical Analysis}, volume = {31}, year = {2008}, month = {2008///}, pages = {156 - 177}, url = {http://etna.mcs.kent.edu/vol.31.2008/pp156-177.dir/pp156-177.pdfhttp://etna.mcs.kent.edu/vol.31.2008/pp156-177.dir/pp156-177.pdf}, author = {Jung,Jin Hyuk and O{\textquoteright}Leary, Dianne P. and Tits,Andre{\textquoteright} L.} } @article {15815, title = {The Adiabatic Theorem in the Presence of Noise}, journal = {Physical Review A}, volume = {77}, year = {2008}, month = {2008///}, pages = {042319, 20 pages - 042319, 20 pages}, doi = {DOI: 10.1103/PhysRevA.77.042319}, url = {http://link.aps.org/abstract/PRA/v77/e042319http://link.aps.org/abstract/PRA/v77/e042319}, author = {O{\textquoteright}Hara,Michael J. and O{\textquoteright}Leary, Dianne P.} } @conference {12111, title = {Adopting Curvilinear Component Analysis to Improve Software Cost Estimation Accuracy. Model, Application Strategy, and an Experimental Verification}, booktitle = {In G. Visaggio (Ed.), 12 th International Conference on Evaluation and Assessment in Software Engineering. BCS eWIC}, year = {2008}, month = {2008///}, abstract = {Cost estimation is a critical issue for software organizations. Good estimates can help us make more informed decisions (controlling and planning software risks), if they are reliable (correct) and valid (stable). In this study, we apply a variable reduction technique (based on auto-associative feed--forward neural networks {\textendash} called Curvilinear component analysis) to log-linear regression functions calibrated with ordinary least squares. Based on a COCOMO 81 data set, we show that Curvilinear component analysis can improve the estimation model accuracy by turning the initial input variables into an equivalent and more compact representation. We show that, the models obtained by applying Curvilinear component analysis are more parsimonious, correct, and reliable.}, author = {Sarcia,Salvatore A. and Cantone,Giovanni and Basili, Victor R.} } @article {15835, title = {Advances in multilingual and multimodal information retrieval}, journal = {Lecture Notes in Computer Science}, volume = {5152}, year = {2008}, month = {2008///}, author = {Peters,C. and Jijkoun,V. and Mandl,T. and M{\"u}ller,H. and Oard, Douglas and Pe{\~n}as,A. and Santos,D.} } @article {15857, title = {Advancing social science research by applying computational linguistics}, journal = {Proceedings of the American Society for Information Science and Technology}, volume = {45}, year = {2008}, month = {2008///}, pages = {1 - 12}, author = {Cheng,A.S. and Fleischmann,K.R. and Wang,P. and Oard, Douglas} } @article {18694, title = {Affinity Makes the Difference: Nonselective Interaction of the UBA Domain of Ubiquilin-1 with Monomeric Ubiquitin and Polyubiquitin Chains}, journal = {Journal of Molecular Biology}, volume = {377}, year = {2008}, month = {2008/03/14/}, pages = {162 - 180}, abstract = {Ubiquilin/PLIC proteins belong to the family of UBL{\textendash}UBA proteins implicated in the regulation of the ubiquitin-dependent proteasomal degradation of cellular proteins. A human presenilin-interacting protein, ubiquilin-1, has been suggested as potential therapeutic target for treating Huntington{\textquoteright}s disease. Ubiquilin{\textquoteright}s interactions with mono- and polyubiquitins are mediated by its UBA domain, which is one of the tightest ubiquitin binders among known ubiquitin-binding domains. Here we report the three-dimensional structure of the UBA domain of ubiquilin-1 (UQ1-UBA) free in solution and in complex with ubiquitin. UQ1-UBA forms a compact three-helix bundle structurally similar to other known UBAs, and binds to the hydrophobic patch on ubiquitin with a Kd of 20~μM. To gain structural insights into UQ1-UBA{\textquoteright}s interactions with polyubiquitin chains, we have mapped the binding interface between UQ1-UBA and Lys48- and Lys63-linked di-ubiquitins and characterized the strength of UQ1-UBA binding to these chains. Our NMR data show that UQ1-UBA interacts with the individual ubiquitin units in both chains in a mode similar to its interaction with mono-ubiquitin, although with an improved binding affinity for the chains. Our results indicate that, in contrast to UBA2 of hHR23A that has strong binding preference for Lys48-linked chains, UQ1-UBA shows little or no binding selectivity toward a particular chain linkage or between the two ubiquitin moieties in the same chain. The structural data obtained in this study provide insights into the possible structural reasons for the diversity of polyubiquitin chain recognition by UBA domains.}, keywords = {polyubiquitin, protein{\textendash}protein interaction, UBA domain, ubiquilin, ubiquitin}, isbn = {0022-2836}, doi = {10.1016/j.jmb.2007.12.029}, url = {http://www.sciencedirect.com/science/article/pii/S0022283607016452}, author = {Zhang,Daoning and Raasi,Shahri and Fushman, David} } @article {15181, title = {Aggregate message authentication codes}, journal = {Topics in Cryptology{\textendash}CT-RSA 2008}, year = {2008}, month = {2008///}, pages = {155 - 169}, abstract = {We propose and investigate the notion of aggregate message authentication codes (MACs) which have the property that multiple MAC tags, computed by (possibly) different senders on multiple (possibly different) messages, can be aggregated into a shorter tag that can still be verified by a recipient who shares a distinct key with each sender. We suggest aggregate MACs as an appropriate tool for authenticated communication in mobile ad-hoc networks or other settings where resource-constrained devices share distinct keys with a single entity (such as a base station), and communication is an expensive resource.}, doi = {10.1007/978-3-540-79263-5_10}, author = {Katz, Jonathan and Lindell,A.} } @conference {17763, title = {An AGM-based belief revision mechanism for probabilistic spatio-temporal logics}, booktitle = {Proceedings of the 23rd national conference on Artificial intelligence}, year = {2008}, month = {2008///}, pages = {511 - 516}, author = {Parker,A. and Infantes,G. and V.S. Subrahmanian and Grant,J.} } @article {17684, title = {Algorithm 879: EIGENTEST{\textemdash}a test matrix generator for large-scale eigenproblems}, journal = {ACM Trans. Math. Softw.}, volume = {35}, year = {2008}, month = {2008/07//}, pages = {7:1{\textendash}7:11 - 7:1{\textendash}7:11}, abstract = {Eigentest is a package that produces real test matrices with known eigensystems. 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)Tb, (A - sI)-1 b, and (A - sI)-T 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 article introduces the eigenmat and describes implementations in Fortran 77, Fortran 95, C, and Matlab.}, keywords = {Eigensystem, test matrix generation}, isbn = {0098-3500}, doi = {10.1145/1377603.1377610}, url = {http://doi.acm.org/10.1145/1377603.1377610}, author = {Lee,Che-Rung and Stewart, G.W.} } @article {12552, title = {Algorithmic and Architectural Optimizations for Computationally Efficient Particle Filtering}, journal = {Image Processing, IEEE Transactions on}, volume = {17}, year = {2008}, month = {2008/05//}, pages = {737 - 748}, abstract = {In this paper, we analyze the computational challenges in implementing particle filtering, especially to video sequences. Particle filtering is a technique used for filtering nonlinear dynamical systems driven by non-Gaussian noise processes. It has found widespread applications in detection, navigation, and tracking problems. Although, in general, particle filtering methods yield improved results, it is difficult to achieve real time performance. In this paper, we analyze the computational drawbacks of traditional particle filtering algorithms, and present a method for implementing the particle filter using the Independent Metropolis Hastings sampler, that is highly amenable to pipelined implementations and parallelization. We analyze the implementations of the proposed algorithm, and, in particular, concentrate on implementations that have minimum processing times. It is shown that the design parameters for the fastest implementation can be chosen by solving a set of convex programs. The proposed computational methodology was verified using a cluster of PCs for the application of visual tracking. We demonstrate a linear speedup of the algorithm using the methodology proposed in the paper.}, keywords = {Automated;Reproducibility of Results;Sensitivity and Specificity;Signal Processing, Computer-Assisted;Models, Computer-Assisted;Video Recording;, convex program;independent Metropolis Hastings sampler;nonGaussian noise process;nonlinear dynamical system filtering;particle filtering algorithm;pipelined architectural optimization;video sequences;visual tracking;convex programming;image sequences;opti, Statistical;Pattern Recognition}, isbn = {1057-7149}, doi = {10.1109/TIP.2008.920760}, author = {Sankaranarayanan,A. C and Srivastava, A. and Chellapa, Rama} } @article {19608, title = {Algorithms for computing a parameterized st-orientation}, journal = {Theoretical Computer Science}, volume = {408}, year = {2008}, month = {2008/11/28/}, pages = {224 - 240}, abstract = {s t -orientations ( s t -numberings) or bipolar orientations of undirected graphs are central to many graph algorithms and applications. Several algorithms have been proposed in the past to compute an s t -orientation of a biconnected graph. In this paper, we present new algorithms that compute such orientations with certain (parameterized) characteristics in the final s t -oriented graph, such as the length of the longest path. This work has many applications, including Graph Drawing and Network Routing, where the length of the longest path is vital in deciding certain features of the final solution. This work applies to other difficult problems as well, such as graph coloring and of course longest path. We present extended theoretical and experimental results which show that our technique is efficient and performs well in practice.}, keywords = {Graph algorithms, Longest path, Planar graphs, s t -numberings}, isbn = {0304-3975}, url = {http://www.sciencedirect.com/science/article/pii/S0304397508005653}, author = {Charalampos Papamanthou and Tollis, Ioannis G.} } @article {18782, title = {Algorithms for Generating Adaptive Projection Patterns for 3D Shape Measurement}, journal = {Journal of Computing and Information Science in Engineering}, volume = {8}, year = {2008}, month = {2008///}, pages = {031009 - 031009}, author = {Peng,T. and Gupta,S.K.} } @inbook {19602, title = {Algorithms for Location Estimation Based on RSSI Sampling}, booktitle = {Algorithmic Aspects of Wireless Sensor Networks}, series = {Lecture Notes in Computer Science}, year = {2008}, month = {2008/01/01/}, pages = {72 - 86}, publisher = {Springer Berlin Heidelberg}, organization = {Springer Berlin Heidelberg}, abstract = {In this paper, we re-examine the RSSI measurement model for location estimation and provide the first detailed formulation of the probability distribution of the position of a sensor node. We also show how to use this probabilistic model to efficiently compute a good estimation of the position of the sensor node by sampling multiple readings from the beacons (where we do not merely use the mean of the samples) and then minimizing a function with an acceptable computational effort. The results of the simulation of our method in TOSSIM indicate that the location of the sensor node can be computed in a small amount of time and that the quality of the solution is competitive with previous approaches.}, keywords = {Algorithm Analysis and Problem Complexity, Computer Communication Networks, Data structures, Discrete Mathematics in Computer Science, Information Systems and Communication Service}, isbn = {978-3-540-92861-4, 978-3-540-92862-1}, url = {http://link.springer.com/chapter/10.1007/978-3-540-92862-1_7}, author = {Charalampos Papamanthou and Preparata, Franco P. and Tamassia, Roberto}, editor = {Fekete, S{\'a}ndor P.} } @conference {16069, title = {Aligning temporal data by sentinel events: discovering patterns in electronic health records}, booktitle = {Proceedings of the twenty-sixth annual SIGCHI conference on Human factors in computing systems}, series = {CHI {\textquoteright}08}, year = {2008}, month = {2008///}, pages = {457 - 466}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Electronic Health Records (EHRs) and other temporal databases contain hidden patterns that reveal important cause-and-effect phenomena. Finding these patterns is a challenge when using traditional query languages and tabular displays. We present an interactive visual tool that complements query formulation by providing operations to align, rank and filter the results, and to visualize estimates of the intervals of validity of the data. Display of patient histories aligned on sentinel events (such as a first heart attack) enables users to spot precursor, co-occurring, and aftereffect events. A controlled study demonstrates the benefits of providing alignment (with a 61\% speed improvement for complex tasks). A qualitative study and interviews with medical professionals demonstrates that the interface can be learned quickly and seems to address their needs.}, keywords = {electronic health record, Evaluation, Information Visualization, search, temporal data, Uncertainty}, isbn = {978-1-60558-011-1}, doi = {10.1145/1357054.1357129}, url = {http://doi.acm.org/10.1145/1357054.1357129}, author = {Wang,Taowei David and Plaisant, Catherine and Quinn,Alexander J. and Stanchak,Roman and Murphy,Shawn and Shneiderman, Ben} } @conference {15447, title = {Alternating GUI Test Generation and Execution}, booktitle = {Practice and Research Techniques, 2008. TAIC PART {\textquoteright}08. Testing: Academic Industrial Conference}, year = {2008}, month = {2008///}, pages = {23 - 32}, abstract = {Users of today{\textquoteright}s software perform tasks by interacting with a graphical user interface (GUI) front-end via sequences of input events. Due to the flexibility offered by most GUIs, the number of event sequences grows exponentially with length. One ubiquitous challenge of GUI testing is to selectively generate those sequences that lead to potentially problematic states. This paper presents ALT, a new technique that generates GUI test cases in batches, by leveraging GUI run-time information from a previously run batch to obtain the next batch. Each successive batch consists of "longer" test cases that expand the state space to be explored, yet prune the "unimportant" states. The "alternating" nature of ALT allows it to enhance the next batch by leveraging certain relationships between GUI events (e.g., one enables the other, one alters the other{\textquoteright}s execution) that are revealed only at run-time and non-trivial to infer statically. An empirical study on four fielded GUI-based applications demonstrates that ALT is successful at identifying complex failure-causing interactions between GUI events.}, keywords = {ALT, complex failure-causing interactions, event sequences, graphical user interface, Graphical user interfaces, GUI test generation, Testing}, doi = {10.1109/TAIC-PART.2008.10}, author = {Xun Yuan and Memon, Atif M.} } @conference {18658, title = {Analysis of Computer Security Incident Data Using Time Series Models}, year = {2008}, month = {2008/11//}, pages = {77 - 86}, abstract = {Organizations face increasing challenges in addressing and preventing computer and network security incidents. There are financial consequences from security incidents. These include lost time and resources used during recovery, possible theft of personal and/or proprietary information, and reputational damage that may negatively impact stock prices or reduce consumer confidence in a company. Being able to understand and predict trends in computer and network security incidents can aid an organization with resource allocation for prevention of such incidents, as well as evaluation of mitigation strategies. We look at using time series models with a large set of security incident data. We examine appropriateness of the data for modeling and consider needed transformations. Parameter search and model selection criteria are discussed. Then, forecasts from time series models are compared to forecasts from Non-Homogeneous Poisson Process (NHPP) software reliability growth (SRG) models.}, keywords = {Computer networks, computer security incident data, NETWORK SECURITY, resource allocation, security of data, telecommunication security, time series, time series model}, doi = {10.1109/ISSRE.2008.39}, author = {Condon,E. and He,A. and Michel Cukier} } @conference {18546, title = {Answering what-if deployment and configuration questions with wise}, booktitle = {Proceedings of the ACM SIGCOMM 2008 conference on Data communication}, series = {SIGCOMM {\textquoteright}08}, year = {2008}, month = {2008///}, pages = {99 - 110}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Designers of content distribution networks often need to determine how changes to infrastructure deployment and configuration affect service response times when they deploy a new data center, change ISP peering, or change the mapping of clients to servers. Today, the designers use coarse, back-of-the-envelope calculations, or costly field deployments; they need better ways to evaluate the effects of such hypothetical "what-if" questions before the actual deployments. This paper presents What-If Scenario Evaluator (WISE), a tool that predicts the effects of possible configuration and deployment changes in content distribution networks. WISE makes three contributions: (1) an algorithm that uses traces from existing deployments to learn causality among factors that affect service response-time distributions; (2) an algorithm that uses the learned causal structure to estimate a dataset that is representative of the hypothetical scenario that a designer may wish to evaluate, and uses these datasets to predict future response-time distributions; (3) a scenario specification language that allows a network designer to easily express hypothetical deployment scenarios without being cognizant of the dependencies between variables that affect service response times. Our evaluation, both in a controlled setting and in a real-world field deployment at a large, global CDN, shows that WISE can quickly and accurately predict service response-time distributions for many practical What-If scenarios.}, keywords = {content distribution networks, performance modeling, what-if scenario evaluation}, isbn = {978-1-60558-175-0}, doi = {10.1145/1402958.1402971}, url = {http://doi.acm.org/10.1145/1402958.1402971}, author = {Tariq,Mukarram and Zeitoun,Amgad and Valancius,Vytautas and Feamster, Nick and Ammar,Mostafa} } @article {13724, title = {Applying automatically generated semantic knowledge: A case study in machine translation}, journal = {NSF Symposium on Semantic Knowledge Discovery, Organization and Use}, year = {2008}, month = {2008///}, abstract = {In this paper, we discuss how we apply automatically generated semantic knowledge to benefit statisticalmachine translation (SMT). Currently, almost all statistical machine translation systems rely heavily on memorizing translations of phrases. Some systems attempt to go further and generalize these learned phrase translations into templates using empirically derived information about word alignments and a small amount of syntactic information, if at all. There are several issues in a SMT pipeline that could be addressed by the application of semantic knowledge, if such knowledge were easily available. One such issue, an important one, is that of reference sparsity. The fundamental problem that translation systems have to face is that there is no such thing as the correct translation for any sentence. In fact, any given source sentence can often be translated into the target language in many valid ways. Since there can be many {\textquotedblleft}correct answers,{\textquotedblright} almost all models employed by SMT systems require, in addition to a large bitext, a held-out development set comprised of multiple high-quality, human-authored reference translations in the target language in order to tune their parameters relative to a translation quality metric.1 There are several reasons that this requirement is not an easy one to satisfy. First, with a few exceptions{\textemdash}notably NIST{\textquoteright}s annual MT evaluations{\textemdash}most new MT research data sets are provided with only a single reference translation. Second, obtaining multiple reference translations in rapid development, low-density source language scenarios (e.g. (Oard, 2003)) is likely to be severely limited (or made entirely impractical) by limitations of time, cost, and ready availability of qualified translators. }, author = {Madnani,N. and Resnik, Philip and Dorr, Bonnie J and Schwartz,R.} } @conference {14848, title = {Approximate earth mover{\textquoteright}s distance in linear time}, booktitle = {Computer Vision and Pattern Recognition, 2008. CVPR 2008. IEEE Conference on}, year = {2008}, month = {2008/06//}, pages = {1 - 8}, abstract = {The earth moverpsilas distance (EMD) is an important perceptually meaningful metric for comparing histograms, but it suffers from high (O(N3 logN)) computational complexity. We present a novel linear time algorithm for approximating the EMD for low dimensional histograms using the sum of absolute values of the weighted wavelet coefficients of the difference histogram. EMD computation is a special case of the Kantorovich-Rubinstein transshipment problem, and we exploit the Holder continuity constraint in its dual form to convert it into a simple optimization problem with an explicit solution in the wavelet domain. We prove that the resulting wavelet EMD metric is equivalent to EMD, i.e. the ratio of the two is bounded. We also provide estimates for the bounds. The weighted wavelet transform can be computed in time linear in the number of histogram bins, while the comparison is about as fast as for normal Euclidean distance or chi2 statistic. We experimentally show that wavelet EMD is a good approximation to EMD, has similar performance, but requires much less computation.}, keywords = {algorithm;normal, complexity;earth, complexity;image, constraint;Kantorovich-Rubinstein, continuity, distance;histograms;linear, distance;weighted, Euclidean, Holder, matching;wavelet, movers, problem;computational, TIME, transform;computational, transforms;, transshipment, wavelet}, doi = {10.1109/CVPR.2008.4587662}, author = {Shirdhonkar,S. and Jacobs, David W.} } @conference {17559, title = {Approximation Algorithms for Computing Capacity of Wireless Networks with SINR Constraints}, booktitle = {IEEE INFOCOM 2008. The 27th Conference on Computer Communications}, year = {2008}, month = {2008/04/13/18}, pages = {1166 - 1174}, publisher = {IEEE}, organization = {IEEE}, abstract = {A fundamental problem in wireless networks is to estimate its throughput capacity - given a set of wireless nodes, and a set of connections, what is the maximum rate at which data can be sent on these connections. Most of the research in this direction has focused on either random distributions of points, or has assumed simple graph-based models for wireless interference. In this paper, we study capacity estimation problem using the more general Signal to Interference Plus Noise Ratio (SINR) model for interference, on arbitrary wireless networks. The problem becomes much harder in this setting, because of the non-locality of the SINR model. Recent work by Moscibroda et al. (2006) has shown that the throughput in this model can differ from graph based models significantly. We develop polynomial time algorithms to provably approximate the total throughput in this setting.}, keywords = {Algorithm design and analysis, approximation algorithm, Approximation algorithms, approximation theory, Computer networks, Computer science, graph theory, graph-based model, Interference constraints, polynomial time algorithm, Propagation losses, Protocols, radio networks, radiofrequency interference, signal to interference plus noise ratio, Signal to noise ratio, Throughput, wireless interference, wireless network, Wireless networks}, isbn = {978-1-4244-2025-4}, doi = {10.1109/INFOCOM.2008.172}, author = {Chafekar,D. and Kumart,V. S.A and Marathe,M. V and Parthasarathy,S. and Srinivasan, Aravind} } @inbook {15716, title = {Arabic/English Multi-document Summarization with CLASSYThe Past and the Future}, booktitle = {Computational Linguistics and Intelligent Text Processing, Lecture Notes in Computer Science Volume 4919Computational Linguistics and Intelligent Text Processing, Lecture Notes in Computer Science Volume 4919}, year = {2008}, month = {2008///}, pages = {568 - 581}, publisher = {Springer Berlin}, organization = {Springer Berlin}, url = {http://dx.doi.org/10.1007/978-3-540-78135-6_49http://dx.doi.org/10.1007/978-3-540-78135-6_49}, author = {Schlesinger,Judith D. and O{\textquoteright}Leary, Dianne P. and Conroy,John M.} } @article {14949, title = {Archiving Temporal Web Information: Organization of Web Contents for Fast Access and Compact Storage}, volume = {UMIACS-TR-2008-08}, year = {2008}, month = {2008/04/07/}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {We address the problem of archiving dynamic web contents oversignificant time spans. Current schemes crawl the web contents at regular time intervals and archive the contents after each crawl regardless of whether or not the contents have changed between consecutive crawls. Our goal is to store newly crawled web contents only when they are different than the previous crawl, while ensuring accurate and quick retrieval of archived contents based on arbitrary temporal queries over the archived time period. In this paper, we develop a scheme that stores unique temporal web contents in containers following the widely used ARC/WARC format, and that provides quick access to the archived contents for arbitrary temporal queries. A novel component of our scheme is the use of a new indexing structure based on the concept of persistent or multi-version data structures. Our scheme can be shown to be asymptotically optimal both in storage utilization and insert/retrieval time. We illustrate the performance of our method on two very different data sets from the Stanford WebBase project, the first reflecting very dynamic web contents and the second relatively static web contents. The experimental results clearly illustrate the substantial storage savings achieved by eliminating duplicate contents detected between consecutive crawls, as well as the speed at which our method can find the archived contents specified through arbitrary temporal queries. }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/7569}, author = {Song,Sangchul and JaJa, Joseph F.} } @article {13725, title = {Are multiple reference translations necessary? investigating the value of paraphrased reference translations in parameter optimization}, journal = {Proceedings of the Eighth Conference of the Association for Machine Translation in the Americas, October}, year = {2008}, month = {2008///}, abstract = {Most state-of-the-art statistical machine trans-lation systems use log-linear models, which are defined in terms of hypothesis features and weights for those features. It is standard to tune the feature weights in order to maxi- mize a translation quality metric, using held- out test sentences and their corresponding ref- erence translations. However, obtaining refer- ence translations is expensive. In our earlier work (Madnani et al., 2007), we introduced a new full-sentence paraphrase technique, based on English-to-English decoding with an MT system, and demonstrated that the resulting paraphrases can be used to cut the number of human reference translations needed in half. In this paper, we take the idea a step further, asking how far it is possible to get with just a single good reference translation for each item in the development set. Our analysis suggests that it is necessary to invest in four or more hu- man translations in order to significantly im- prove on a single translation augmented by monolingual paraphrases. }, author = {Madnani,N. and Resnik, Philip and Dorr, Bonnie J and Schwartz,R.} } @conference {17998, title = {An area-efficient high-throughput hybrid interconnection network for single-chip parallel processing}, booktitle = {Proceedings of the 45th annual Design Automation Conference}, series = {DAC {\textquoteright}08}, year = {2008}, month = {2008///}, pages = {435 - 440}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Single-chip parallel processing requires high bandwidth between processors and on-chip memory modules. A recently proposed Mesh-of-Trees (MoT) network provides high throughput and low latency at relatively high area cost. In this paper, we introduce a hybrid MoT-BF network that combines MoT network with the area efficient butterfly network. We prove that the hybrid network reduces MoT network{\textquoteright}s area cost. Cycle-accurate simulation and post-layout results all show that significant area reduction can be achieved with negligible performance degradation, when operating at same clock rate.}, keywords = {hybrid networks, mesh-of-trees, on-chip networks}, isbn = {978-1-60558-115-6}, doi = {10.1145/1391469.1391583}, url = {http://doi.acm.org/10.1145/1391469.1391583}, author = {Balkan,Aydin O. and Gang Qu and Vishkin, Uzi} } @article {12158, title = {The ASC-Alliance Projects: A Case Study of Large-Scale Parallel Scientific Code Development}, journal = {Computer}, volume = {41}, year = {2008}, month = {2008/03//}, pages = {50 - 58}, abstract = {Computational scientists face many challenges when developing software that runs on large-scale parallel machines. However, software-engineering researchers haven{\textquoteright}t studied their software development processes in much detail. To better understand the nature of software development in this context, the authors examined five large-scale computational science software projects operated at the five ASC-Alliance centers.}, keywords = {ASC-Alliance, code, development;large-scale, development;parallel, engineering;, machines;software, Parallel, projects;computational, scale, Science, scientific, scientists;large, software, systems;parallel}, isbn = {0018-9162}, doi = {10.1109/MC.2008.101}, author = {Hochstein, L. and Basili, Victor R.} } @article {12112, title = {An assessment of systems and software engineering scholars and institutions (2001{\textendash}2005)}, journal = {Journal of Systems and Software}, volume = {81}, year = {2008}, month = {2008/06//}, pages = {1059 - 1062}, abstract = {This paper presents the findings of a five-year study of the top scholars and institutions in the systems and software engineering field, as measured by the quantity of papers published in the journals of the field in 2001{\textendash}2005. The top scholar is Magne J{\o}rgensen of Simula Research Laboratory, Norway, and the top institution is Korea Advanced Institute of Science and Technology, Korea.This paper is part of an ongoing study, conducted annually, that identifies the top 15 scholars and institutions in the most recent five-year period. }, keywords = {Research publications, Systems and software engineering, Top institutions, Top scholars}, isbn = {0164-1212}, doi = {10.1016/j.jss.2007.09.018}, url = {http://www.sciencedirect.com/science/article/pii/S0164121207002300}, author = {Wong,W. Eric and Tse,T.H. and Glass,Robert L. and Basili, Victor R. and Chen,T.Y.} } @article {19619, title = {Athos: Efficient Authentication of Outsourced File Systems: Information Security}, journal = {Lecture Notes in Computer Science}, year = {2008}, month = {2008///}, pages = {80 - 96}, isbn = {03029743}, author = {Triandopoulos, Nikolaos and Goodrich, Michael T. and Charalampos Papamanthou and Tamassia, Roberto} } @article {13979, title = {Audio Camera Using Microphone Arrays for Real Time Capture of Audio Images ...}, volume = {12/127,451}, year = {2008}, month = {2008/05//}, abstract = {Spherical microphone arrays provide an ability to compute the acoustical intensity corresponding to different spatial directions in a given frame of audio data. These intensities may be exhibited as an image and these images are generated at a high frame rate to achieve a video image if the data capture and intensity computations can be performed sufficiently quickly, thereby creating a frame-rate audio camera. A description is provided herein regarding how such a camera is built and the processing done sufficiently quickly using graphics processors. The joint processing of and captured frame-rate audio and video images enables applications such as visual identification of noise sources, beamforming and noise-suppression in video conferenceing and others, by accounting for the spatial differences in the location of the audio and the video cameras. Based on the recognition that the spherical array can be viewed as a central projection camera, such joint analysis can be performed.}, url = {http://www.google.com/patents?id=gWKzAAAAEBAJ}, author = {Duraiswami, Ramani and O{\textquoteright}donovan,Adam and Neumann, Jan and Gumerov, Nail A.} } @conference {16837, title = {Augmenting spatio-textual search with an infectious disease ontology}, booktitle = {Data Engineering Workshop, 2008. ICDEW 2008. IEEE 24th International Conference on}, year = {2008}, month = {2008/04//}, pages = {266 - 269}, abstract = {A system is described that automatically categorizes and classifies infectious disease incidence reports by type and geographic location, to aid analysis by domain experts. It identifies references to infectious diseases by using a disease ontology. The system leverages the textual and spatial search capabilities of the STEWARD system to enable queries such as reports on "influenza" near "Hong Kong", possibly within a particular time period. Documents from the U.S. National Library of Medicine (http://www.pubmed.gov) and the World Health Organization (http://www.who.int) are tagged so that spatial relationships to specific disease occurrences can be presented graphically via a map interface. In addition, newspaper articles can be tagged and indexed to bolster the surveillance of ongoing epidemics. Examining past epidemics using this system may lead to improved understanding of the cause and spread of infectious diseases.}, keywords = {(artificial, article;ontology;spatio-textual, disease;map, engines;, information, intelligence);search, interface;newspaper, search;classification;diseases;indexing;medical, STEWARD, system;classification;epidemics;indexing;infectious, systems;ontologies}, doi = {10.1109/ICDEW.2008.4498330}, author = {Lieberman,M.D. and Sankaranarayanan,J. and Samet, Hanan and Sperling,J.} } @conference {19598, title = {Authenticated Hash Tables}, booktitle = {CCS {\textquoteright}08 Proceedings of the 15th ACM Conference on Computer and Communications Security }, series = {CCS {\textquoteright}08}, year = {2008}, month = {2008///}, pages = {437 - 448}, publisher = {ACM}, organization = {ACM}, abstract = {Hash tables are fundamental data structures that optimally answer membership queries. Suppose a client stores n elements in a hash table that is outsourced at a remote server so that the client can save space or achieve load balancing. Authenticating the hash table functionality, i.e., verifying the correctness of queries answered by the server and ensuring the integrity of the stored data, is crucial because the server, lying outside the administrative control of the client, can be malicious. We design efficient and secure protocols for optimally authenticating membership queries on hash tables: for any fixed constants 0 < ε < 1 and κ > 1/ε, the server can provide a proof of integrity of the answer to a (non-)membership query in constant time, requiring O(nε/logκε--1 n) time to treat updates, yet keeping the communication and verification costs constant. This is the first construction for authenticating a hash table with constant query cost and sublinear update cost. Our solution employs the RSA accumulator in a nested way over the stored data, strictly improving upon previous accumulator-based solutions. Our construction applies to two concrete data authentication models and lends itself to a scheme that achieves different trade-offs---namely, constant update time and O(nε/logκε n) query time for fixed ε > 0 and κ > 0. An experimental evaluation of our solution shows very good scalability.}, keywords = {Authentication, hash tables, rsa accumulator, verification}, isbn = {978-1-59593-810-7}, url = {http://doi.acm.org/10.1145/1455770.1455826}, author = {Charalampos Papamanthou and Tamassia, Roberto and Triandopoulos, Nikos} } @conference {18548, title = {Authenticated out-of-band communication over social links}, booktitle = {Proceedings of the first workshop on Online social networks}, series = {WOSN {\textquoteright}08}, year = {2008}, month = {2008///}, pages = {61 - 66}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Many existing host-based applications rely on their own authentication mechanisms and peer discovery services. Although social networking sites already provide mechanisms for users both to discover other users (e.g., by logging on to the social network Web site) and to communicate securely with each other (e.g., using instant messages within the social networking site), today{\textquoteright}s applications have no way to exploit the relationships and trust that are inherent in these networks. This paper proposes Authenticatr, a framework that allows applications to use the authentication and peer discovery mechanisms inherent in social networking sites to bootstrap their own authenticated communication channels. We describe motivating applications, detail the interface that Authenticatr exposes to applications, and discuss practical considerations and security threats.}, keywords = {Authentication, Security, social networks}, isbn = {978-1-60558-182-8}, doi = {10.1145/1397735.1397749}, url = {http://doi.acm.org/10.1145/1397735.1397749}, author = {Ramachandran,Anirudh V. and Feamster, Nick} } @article {16543, title = {Automated design of distributed control rules for the self-assembly of prespecified artificial structures}, journal = {Robotics and Autonomous Systems}, volume = {56}, year = {2008}, month = {2008/04/30/}, pages = {334 - 359}, abstract = {The self-assembly problem involves the design of agent-level control rules that will cause the agents to form some desired, target structure, subject to environmental constraints. This paper describes a fully automated rule generation procedure that allows structures to successfully self-assemble in a simulated environment with constrained, continuous motion. This environment implicitly imposes ordering constraints on the self-assembly process, where certain parts of the target structure must be assembled before others, and where it may be necessary to assemble (and subsequently disassemble) temporary structures such as staircases. A provably correct methodology is presented for computing a partial order on the self-assembly process, and for generating rules that enforce this order at runtime. The assembly and disassembly of structures is achieved by generating another set of rules, which are inspired by construction behavior among certain species of social insects. Computational experiments verify the effectiveness of the approach on a diverse set of target structures.}, keywords = {Collective problem solving, Coordination, Self-assembly, Stigmergy, Swarm intelligence}, isbn = {0921-8890}, doi = {10.1016/j.robot.2007.08.006}, url = {http://www.sciencedirect.com/science/article/pii/S092188900700111X}, author = {Grushin,Alexander and Reggia, James A.} } @article {13129, title = {Automatic online tuning for fast Gaussian summation}, journal = {Advances in Neural Information Processing Systems}, year = {2008}, month = {2008///}, abstract = {Many machine learning algorithms require the summation of Gaussian kernelfunctions, an expensive operation if implemented straightforwardly. Several meth- ods have been proposed to reduce the computational complexity of evaluating such sums, including tree and analysis based methods. These achieve varying speedups depending on the bandwidth, dimension, and prescribed error, making the choice between methods difficult for machine learning tasks. We provide an algorithm that combines tree methods with the Improved Fast Gauss Transform (IFGT). As originally proposed the IFGT suffers from two problems: (1) the Taylor series expansion does not perform well for very low bandwidths, and (2) parameter se- lection is not trivial and can drastically affect performance and ease of use. We address the first problem by employing a tree data structure, resulting in four eval- uation methods whose performance varies based on the distribution of sources and targets and input parameters such as desired accuracy and bandwidth. To solve the second problem, we present an online tuning approach that results in a black box method that automatically chooses the evaluation method and its parameters to yield the best performance for the input data, desired accuracy, and bandwidth. In addition, the new IFGT parameter selection approach allows for tighter error bounds. Our approach chooses the fastest method at negligible additional cost, and has superior performance in comparisons with previous approaches. }, author = {Morariu,V. and Srinivasan,B.V. and Raykar,V.C. and Duraiswami, Ramani and Davis, Larry S.} } @article {15412, title = {Automatically repairing event sequence-based GUI test suites for regression testing}, journal = {ACM Transactions on Software Engineering and Methodology (TOSEM)}, volume = {18}, year = {2008}, month = {2008/11//}, pages = {4:1{\textendash}4:36 - 4:1{\textendash}4:36}, abstract = {Although graphical user interfaces (GUIs) constitute a large part of the software being developed today and are typically created using rapid prototyping, there are no effective regression testing techniques for GUIs. The needs of GUI regression testing differ from those of traditional software. When the structure of a GUI is modified, test cases from the original GUI{\textquoteright}s suite are either reusable or unusable on the modified GUI. Because GUI test case generation is expensive, our goal is to make the unusable test cases usable, thereby helping to retain the suite{\textquoteright}s event coverage. The idea of reusing these unusable (obsolete) test cases has not been explored before. This article shows that a large number of test cases become unusable for GUIs. It presents a new GUI regression testing technique that first automatically determines the usable and unusable test cases from a test suite after a GUI modification, then determines the unusable test cases that can be repaired so that they can execute on the modified GUI, and finally uses repairing transformations to repair the test cases. This regression testing technique along with four repairing transformations has been implemented. An empirical study for four open-source applications demonstrates that (1) this approach is effective in that many of the test cases can be repaired, and is practical in terms of its time performance, (2) certain types of test cases are more prone to becoming unusable, and (3) certain types of {\textquotedblleft}dominator{\textquotedblright} events, when modified, make a large number of test cases unusable.}, keywords = {Graphical user interfaces, regression testing, repairing test cases, test case management, test maintenance}, isbn = {1049-331X}, doi = {10.1145/1416563.1416564}, url = {http://doi.acm.org/10.1145/1416563.1416564}, author = {Memon, Atif M.} } @article {17757, title = {AVA: Adjective-Verb-Adverb Combinations for Sentiment Analysis}, journal = {Intelligent Systems, IEEE}, volume = {23}, year = {2008}, month = {2008/08//july}, pages = {43 - 50}, abstract = {Most research on determining the strength of subjective expressions in a sentence or document uses single, specific parts of speech such as adjectives, adverbs, or verbs. To date, almost no research covers the development of a single comprehensive framework in which we can analyze sentiment that takes all three into account. The authors propose the AVA (adjective verb adverb) framework for identifying opinions on any given topic. In AVA, a user can select any topic t of interest and any document d. AVA will return a score that d expresses topic t. The score is expressed on a $\#$x02013;1 (maximally negative) to +1 (maximally positive) scale.}, isbn = {1541-1672}, doi = {10.1109/MIS.2008.57}, author = {V.S. Subrahmanian and Reforgiato,Diego} } @conference {12263, title = {Accountability as a service}, booktitle = {Proceedings of the 3rd USENIX workshop on Steps to reducing unwanted traffic on the internet}, series = {SRUTI{\textquoteright}07}, year = {2007}, month = {2007///}, pages = {5:1{\textendash}5:6 - 5:1{\textendash}5:6}, publisher = {USENIX Association}, organization = {USENIX Association}, address = {Berkeley, CA, USA}, abstract = {We propose that accountability be a first-class network service, independent of addressing and routing. We design a scheme for allowing accountability services, rather than connectivity-providing ISPs, to vouch for traffic, allowing victims to report abuse, filter abusive traffic, and isolate malicious senders. We discuss how accountability services may evolve, how they may facilitate new applications, and the implications of shifting the burden of network policing to a dedicated service.}, url = {http://dl.acm.org/citation.cfm?id=1361436.1361441}, author = {Bender,Adam and Spring, Neil and Levin,Dave and Bhattacharjee, Bobby} } @article {14937, title = {ACE: A Novel Software Platform to Ensure the Integrity of Long Term Archives}, volume = {UMIACS-TR-2007-07}, year = {2007}, month = {2007/01/31/}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {We develop a new methodology to address the integrity of long term archives using rigorous cryptographic techniques. A prototype system called ACE (Auditing Control Environment) was designed and developed based on this methodology. ACE creates a small-size integrity token for each digital object and some cryptographic summary information based on all the objects handled within a dynamic time period. ACE continuously audits the contents of the various objects according to the policy set by the archive, and provides mechanisms for an independent third-party auditor to certify the integrity of any object. In fact, our approach will allow an independent auditor to verify the integrity of every version of an archived digital object as well as link the current version to the original form of the object when it was ingested into the archive. We show that ACE is very cost effective and scalable while making no assumptions about the archive architecture. We include in this paper some preliminary results on the validation and performance of ACE on a large image collection.}, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/4047}, author = {Song,Sangchul and JaJa, Joseph F.} } @conference {15147, title = {On achieving the "best of both worlds" in secure multiparty computation}, booktitle = {Proceedings of the thirty-ninth annual ACM symposium on Theory of computing}, series = {STOC {\textquoteright}07}, year = {2007}, month = {2007///}, pages = {11 - 20}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Two settings are typically considered for secure multipartycomputation, depending on whether or not a majority of the partiesare assumed to be honest. Protocols designed under this assumptionprovide "full security" (and, in particular, guarantee outputdelivery and fairness) when this assumption is correct; however, if half or more of the parties are dishonest then security iscompletely compromised. On the other hand, protocols toleratingarbitrarily-many faults do not provide fairness or guaranteed output delivery even if only a single party is dishonest. It isnatural to wonder whether it is possible to achieve the "best ofboth worlds" : namely, a single protocol that simultaneouslyachieves the best possible security in both the above settings. Ishai, et al. (Crypto 2006) recently addressed this question, andruled out constant-round protocols of this type. As our main result, we completely settle the question by ruling outprotocols using any (expected) polynomial number of rounds. Given this stark negative result, we then ask what can be achieved if we are willing to assume simultaneous message transmission (or, equivalently, a non-rushing adversary). In this setting, we show that impossibility still holdsfor logarithmic-round protocols. We also show, for any polynomialp, a protocol (whose round complexity depends on p) that can be simulated to within closeness O(1/p).}, keywords = {COMPUTATION, secure}, isbn = {978-1-59593-631-8}, doi = {10.1145/1250790.1250793}, url = {http://doi.acm.org/10.1145/1250790.1250793}, author = {Katz, Jonathan} } @article {17870, title = {Active semantic caching to optimize multidimensional data analysis in parallel and distributed environments}, journal = {Parallel Computing}, volume = {33}, year = {2007}, month = {2007/08//}, pages = {497 - 520}, abstract = {In this paper, we present a multi-query optimization framework based on the concept of active semantic caching. The framework permits the identification and transparent reuse of data and computation in the presence of multiple queries (or query batches) that specify user-defined operators and aggregations originating from scientific data-analysis applications. We show how query scheduling techniques, coupled with intelligent cache replacement policies, can further improve the performance of query processing by leveraging the active semantic caching operators. We also propose a methodology for functionally decomposing complex queries in terms of primitives so that multiple reuse sites are exposed to the query optimizer, to increase the amount of reuse. The optimization framework and the database system implemented with it are designed to be efficient irrespective of the underlying parallel and/or distributed machine configuration. We present experimental results highlighting the performance improvements obtained by our methods using real scientific data-analysis applications on multiple parallel and distributed processing configurations (e.g., single symmetric multiprocessor (SMP) machine, cluster of SMP nodes, and a Grid computing configuration).}, keywords = {Active semantic caching, Parallel databases, Query optimization, Scientific data analysis}, isbn = {0167-8191}, doi = {10.1016/j.parco.2007.03.001}, url = {http://www.sciencedirect.com/science/article/pii/S0167819107000506}, author = {Andrade,Henrique and Kurc,Tahsin and Sussman, Alan and Saltz,Joel} } @article {18161, title = {Adaptive Detection for Group-Based Multimedia Fingerprinting}, journal = {Signal Processing Letters, IEEE}, volume = {14}, year = {2007}, month = {2007/12//}, pages = {964 - 967}, abstract = {Grouping strategy has been proposed recently to leverage the prior knowledge on collusion pattern to improve collusion resistance in multimedia fingerprinting. However, the improvement is not consistent, as reduced performance of the existing group-based fingerprinting schemes than the non-grouped ones is observed when the grouping does not match the true collusion pattern well. In this letter, we propose a new adaptive detection method, where the threshold for the group detection can be adjusted automatically according to the detection statistics that reflect the underlying collusion pattern. Experimental results show that the proposed adaptive detection outperforms nonadaptive detection and provides consistent performance improvement over non-grouped orthogonal fingerprinting schemes under various collusion scenarios.}, keywords = {adaptive, computing;security, data;, detection;collusion, detection;group-based, fingerprinting;copy, fingerprinting;grouping, multimedia, of, orthogonal, pattern;detection, protection;multimedia, statistics;group, strategy;nongrouped}, isbn = {1070-9908}, doi = {10.1109/LSP.2007.907992}, author = {He,Shan and M. Wu} } @conference {15063, title = {An adaptive mean shift tracking method using multiscale images}, booktitle = {Wavelet Analysis and Pattern Recognition, 2007. ICWAPR {\textquoteright}07. International Conference on}, volume = {3}, year = {2007}, month = {2007/11//}, pages = {1060 - 1066}, abstract = {An adaptive mean shift tracking method for object tracking using multiscale images is presented in this paper. A bandwidth matrix and a Gaussian kernel are used to extend the definition of target model. The method can exactly estimate the position of the tracked object using multiscale images from Gaussian pyramid. The tracking method determines the parameters of kernel bandwidth by maximizing the lower bound of a log-likelihood function, which is derived from a kernel density estimate with the bandwidth matrix and the modified weight function. The experimental results show that it can averagely converge in 2.55 iterations per frame.}, keywords = {adaptive mean shift tracking method, bandwidth matrix, Gaussian kernel, Gaussian processes, Image sequences, log-likelihood function, matrix algebra, maximum likelihood estimation, multiscale image, Object detection, object tracking}, doi = {10.1109/ICWAPR.2007.4421589}, author = {Zhuolin Jiang and Li,Shao-Fa and Gao,Dong-Fa} } @article {13352, title = {Adaptive query processing}, journal = {Foundations and Trends in Databases}, volume = {1}, year = {2007}, month = {2007/01//}, pages = {1 - 140}, abstract = {As the data management field has diversified to consider settings in which queries are increasingly complex, statistics are less available, or data is stored remotely, there has been an acknowledgment that the traditional optimize-then-execute paradigm is insufficient. This has led to a plethora of new techniques, generally placed under the common banner of adaptive query processing, that focus on using runtime feed-back to modify query processing in a way that provides better response time or more efficient CPU utilization.In this survey paper, we identify many of the common issues, themes, and approaches that pervade this work, and the settings in which each piece of work is most appropriate. Our goal with this paper is to be a "value-add" over the existing papers on the material, providing not only a brief overview of each technique, but also a basic framework for understanding the field of adaptive query processing in general. We focus primarily on intra-query adaptivity of long-running, but not full-fledged streaming, queries. We conclude with a discussion of open research problems that are of high importance. }, isbn = {1931-7883}, doi = {10.1561/1900000001}, url = {http://dx.doi.org/10.1561/1900000001}, author = {Deshpande, Amol and Ives,Zachary and Vijayshankar Raman} } @conference {13354, title = {Adaptive query processing: why, how, when, what next?}, booktitle = {Proceedings of the 33rd international conference on Very large data bases}, series = {VLDB {\textquoteright}07}, year = {2007}, month = {2007///}, pages = {1426 - 1427}, publisher = {VLDB Endowment}, organization = {VLDB Endowment}, abstract = {Adaptive query processing has been the subject of a great deal of recent work, particularly in emerging data management environments such as data integration and data streams. We provide an overview of the work in this area, identifying its common themes, laying out the space of query plans, and discussing open research problems. We discuss why adaptive query processing is needed, how it is being implemented, where it is most appropriately used, and finally, what next, i.e., open research problems.}, isbn = {978-1-59593-649-3}, url = {http://dl.acm.org/citation.cfm?id=1325851.1326033}, author = {Deshpande, Amol and Ives,Zachary and Vijayshankar Raman} } @conference {18331, title = {Adaptive Vocabulary Forests br Dynamic Indexing and Category Learning}, booktitle = {Computer Vision, 2007. ICCV 2007. IEEE 11th International Conference on}, year = {2007}, month = {2007/10/14/21}, pages = {1 - 8}, publisher = {IEEE}, organization = {IEEE}, abstract = {Histogram pyramid representations computed from a vocabulary tree of visual words have proven valuable for a range of image indexing and recognition tasks; however, they have only used a single, fixed partition of feature space. We present a new efficient algorithm to incrementally compute set-of-trees (forest) vocabulary representations, and show that they improve recognition and indexing performance in methods which use histogram pyramids. Our algorithm incrementally adapts a vocabulary forest with an Inverted file system at the leaf nodes and automatically keeps existing histogram pyramid database entries up-to-date in a forward filesystem. It is possible not only to apply vocabulary tree indexing algorithms directly, but also to compute pyramid match kernel values efficiently. On dynamic recognition tasks where categories or objects under consideration may change over time, we show that adaptive vocabularies offer significant performance advantages in comparison to a single, fixed vocabulary.}, isbn = {978-1-4244-1630-1}, doi = {10.1109/ICCV.2007.4409053}, url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4409053}, author = {Tom Yeh and Lee,John and Darrell,Trevor} } @inbook {17770, title = {Aggregates in Generalized Temporally Indeterminate Databases}, booktitle = {Scalable Uncertainty ManagementScalable Uncertainty Management}, series = {Lecture Notes in Computer Science}, volume = {4772}, year = {2007}, month = {2007///}, pages = {171 - 186}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {Dyreson and Snodgrass as well as Dekhtyar et. al. have provided a probabilistic model (as well as compelling example applications) for why there may be temporal indeterminacy in databases. In this paper, we first propose a formal model for aggregate computation in such databases when there is uncertainty not just in the temporal attribute, but also in the ordinary (non-temporal) attributes. We identify two types of aggregates: event correlated aggregates, and non event correlated aggregations, and provide efficient algorithms for both of them. We prove that our algorithms are correct, and we present experimental results showing that the algorithms work well in practice.}, keywords = {Computer, Science}, isbn = {978-3-540-75407-7}, url = {http://dx.doi.org/10.1007/978-3-540-75410-7_13}, author = {Udrea,Octavian and Majki{\'c},Zoran and Subrahmanian,V.}, editor = {Prade,Henri and Subrahmanian,V.} } @inbook {15425, title = {Agile Quality Assurance Techniques for GUI-Based Applications}, booktitle = {Agile software development quality assuranceAgile software development quality assurance}, year = {2007}, month = {2007///}, pages = {114 - 114}, publisher = {Idea Group Inc (IGI)}, organization = {Idea Group Inc (IGI)}, isbn = {1599042169, 9781599042169}, author = {Memon, Atif M. and Xie,Q.} } @article {18734, title = {Algorithms for on-line monitoring of micro spheres in an optical tweezers-based assembly cell}, journal = {Journal of Computing and Information Science in Engineering}, volume = {7}, year = {2007}, month = {2007///}, pages = {330 - 330}, abstract = {Optical tweezers have emerged as a powerful tool for microand nanomanipulation. Using optical tweezers to perform auto- mated assembly requires on-line monitoring of components in the assembly workspace. This paper presents algorithms for estimat- ing positions and orientations of microscale and nanoscale com- ponents in the 3-Dimensional assembly workspace. Algorithms presented in this paper use images obtained by optical section microscopy. The images are first segmented to locate areas of in- terest and then image gradient information from the areas of in- terest is used to generate probable locations and orientations of components in the XY-plane. Finally, signature curves are com- puted and utilized to obtain component locations and orienta- tions in 3-D space. We have tested these algorithms with silica micro-spheres as well as metallic nanowires. We believe that the algorithms described in this paper will provide the foundation for realizing automated assembly operations in optical tweezers- based assembly cells. }, author = {Peng,T. and Balijepalli,A. and Gupta,S.K. and LeBrun,T.} } @article {13421, title = {Amino acid quantitative structure property relationship database: a web-based platform for quantitative investigations of amino acids}, journal = {Protein Engineering Design and SelectionProtein Engineering, Design and Selection}, volume = {20}, year = {2007}, month = {2007/07/01/}, pages = {347 - 351}, abstract = {Here, we present the AA-QSPR Db (Amino Acid Quantitative Structure Property Relationship Database): a novel, freely available web-resource of data pertaining to amino acids, both engineered and naturally occurring. In addition to presenting fundamental molecular descriptors of size, charge and hydrophobicity, it also includes online visualization tools for users to perform instant, interactive analyses of amino acid sub-sets in which they are interested. The database has been designed with extensible markup language technology to provide a flexible structure, suitable for future development. In addition to providing easy access for queries by external computers, it also offers a user-friendly web-based interface that facilitates human interactions (submission, storage and retrieval of amino acid data) and an associated e-forum that encourages users to question and discuss current and future database contents.}, keywords = {Amino acids, database, QSPR, XML}, isbn = {1741-0126, 1741-0134}, doi = {10.1093/protein/gzm027}, url = {http://peds.oxfordjournals.org/content/20/7/347}, author = {Lu,Yi and Bulka,Blazej and desJardins, Marie and Freeland,Stephen J} } @conference {18165, title = {Analysis of Nonlinear Collusion Attacks on Fingerprinting Systems for Compressed Multimedia}, booktitle = {Image Processing, 2007. ICIP 2007. IEEE International Conference on}, volume = {2}, year = {2007}, month = {2007/10/16/19}, pages = {II -133 -II -136 - II -133 -II -136}, abstract = {In this paper, we analyze the effect of various collusion attacks on fingerprinting systems for compressed multimedia. We evaluate the effectiveness of the collusion attacks in terms of the probability of detection and accuracy in estimating the host signal. Our analysis shows that applying averaging collusion on copies of moderately compressed content gives a highly accurate estimation of the host, and can effectively remove the embedded fingerprints. Averaging is thus the best choice for an attacker as the probability of detection and the distortion introduced are the lowest.}, keywords = {attacks;data, coding;multimedia, coding;security, collusion, compressed, compression;image, data;watermarking;, fingerprinting, multimedia;data, of, systems;nonlinear}, doi = {10.1109/ICIP.2007.4379110}, author = {Varna,A.L. and He,Shan and Swaminathan,A. and M. Wu} } @article {17690, title = {Analysis of the Residual Arnoldi Method}, volume = {UMIACS-TR-2007-45}, year = {2007}, month = {2007/10/15/}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {The Arnoldi method generates a nested squences of orthonormal bases$U_{1},U_{2}, \ldots$ by orthonormalizing $Au_{k}$ against $U_{k}$. Frequently these bases contain increasingly accurate approximations of eigenparis from the periphery of the spectrum of $A$. However, the convergence of these approximations stagnates if $u_{k}$ is contaminated by error. It has been observed that if one chooses a Rayleigh--Ritz approximation $(\mu_{k}, z_{k})$ to a chosen target eigenpair $(\lambda, x)$ and orthonormalizes the residual $Az_{k - }\mu_{k} z_{k}$, the approximations to $x$ (but not the other eigenvectors) continue to converge, even when the residual is contaminated by error. The same is true of the shift-invert variant of Arnoldi{\textquoteright}s method. In this paper we give a mathematical analysis of these new methods. }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/7428}, author = {Lee,Che-Rung and Stewart, G.W.} } @article {14662, title = {Analyzing information flow}, journal = {Conference on Programming Language Design and Implementation: Proceedings of the 2007 workshop on Programming languages and analysis for security}, year = {2007}, month = {2007///}, author = {Hicks, Michael W.} } @article {15284, title = {Answering Clinical Questions with Knowledge-Based and Statistical Techniques}, journal = {Computational Linguistics}, volume = {33}, year = {2007}, month = {2007///}, pages = {63 - 103}, abstract = {The combination of recent developments in question-answering research and the availability of unparalleled resources developed specifically for automatic semantic processing of text in the medical domain provides a unique opportunity to explore complex question answering in the domain of clinical medicine. This article presents a system designed to satisfy the information needs of physicians practicing evidence-based medicine. We have developed a series of knowledge extractors, which employ a combination of knowledge-based and statistical techniques, for automatically identifying clinically relevant aspects of MEDLINE abstracts. These extracted elements serve as the input to an algorithm that scores the relevance of citations with respect to structured representations of information needs, in accordance with the principles of evidence-based medicine. Starting with an initial list of citations retrieved by PubMed, our system can bring relevant abstracts into higher ranking positions, and from these abstracts generate responses that directly answer physicians{\textquoteright} questions. We describe three separate evaluations: one focused on the accuracy of the knowledge extractors, one conceptualized as a document reranking task, and finally, an evaluation of answers by two physicians. Experiments on a collection of real-world clinical questions show that our approach significantly outperforms the already competitive PubMed baseline.}, isbn = {0891-2017}, doi = {i: 10.1162/coli.2007.33.1.63}, url = {http://dx.doi.org/10.1162/coli.2007.33.1.63}, author = {Demner-Fushman,Dina and Jimmy Lin} } @article {14894, title = {Appearance Characterization of Linear Lambertian Objects, Generalized Photometric Stereo, and Illumination-Invariant Face Recognition}, journal = {Pattern Analysis and Machine Intelligence, IEEE Transactions on}, volume = {29}, year = {2007}, month = {2007/02//}, pages = {230 - 245}, abstract = {Traditional photometric stereo algorithms employ a Lambertian reflectance model with a varying albedo field and involve the appearance of only one object. In this paper, we generalize photometric stereo algorithms to handle all appearances of all objects in a class, in particular the human face class, by making use of the linear Lambertian property. A linear Lambertian object is one which is linearly spanned by a set of basis objects and has a Lambertian surface. The linear property leads to a rank constraint and, consequently, a factorization of an observation matrix that consists of exemplar images of different objects (e.g., faces of different subjects) under different, unknown illuminations. Integrability and symmetry constraints are used to fully recover the subspace bases using a novel linearized algorithm that takes the varying albedo field into account. The effectiveness of the linear Lambertian property is further investigated by using it for the problem of illumination-invariant face recognition using just one image. Attached shadows are incorporated in the model by a careful treatment of the inherent nonlinearity in Lambert{\textquoteright}s law. This enables us to extend our algorithm to perform face recognition in the presence of multiple illumination sources. Experimental results using standard data sets are presented}, keywords = {albedo field;appearance characterization;generalized photometric stereo algorithms;illumination-invariant face recognition;linear Lambertian objects;observation matrix factorization;face recognition;matrix decomposition;Algorithms;Artificial Intelligence;, Automated;Photogrammetry;Reproducibility of Results;Sensitivity and Specificity;, Computer-Assisted;Information Storage and Retrieval;Lighting;Linear Models;Pattern Recognition}, isbn = {0162-8828}, doi = {10.1109/TPAMI.2007.25}, author = {Zhou,S. K and Aggarwal,G. and Chellapa, Rama and Jacobs, David W.} } @article {14663, title = {Appendix to CMod: Modular Information Hiding and Type-Safe Linking for C}, journal = {Technical Reports of the Computer Science Department}, year = {2007}, month = {2007/06/30/undef}, abstract = {This brief note is an appendix to the paper "CMod: Modular Information Hiding and Type-Safe Linking for C." It consists of the proof of soundness for the formal language presented in that paper.}, author = {Srivastava,S. and Hicks, Michael W. and Foster, Jeffrey S.} } @conference {16019, title = {Application of MCL in a dialog agent}, booktitle = {Third Language and Technology Conference}, year = {2007}, month = {2007///}, author = {Josyula,D. P and Fults,S. and Anderson,M. L and Wilson,S. and Perlis, Don} } @book {15194, title = {Applied cryptography and network security: 5th international conference, ACNS 2007, Zhuhai, China, June 5-8, 2007: proceedings}, volume = {4521}, year = {2007}, month = {2007///}, publisher = {Springer-Verlag New York Inc}, organization = {Springer-Verlag New York Inc}, author = {Katz, Jonathan and Yung,M.} } @conference {18660, title = {Applying Software Reliability Models on Security Incidents}, year = {2007}, month = {2007/11//}, pages = {159 - 168}, abstract = {Computer and network security incidents have increasing financial consequences as demand for network accessibility and connectivity to resources continues to rise. These security incidents can lead to direct financial losses either through data theft of personal and/or proprietary information as well as a reputational damage which may negatively impact stock prices or consumer confidence in a company. This paper examines a large set of security incident data using tools from the software reliability community. We look at applying Non-Homogenous Poisson Process (NHPP) models as a method for describing the reliability growth process. We examine the full set of incidents as well as subsets of the data based on incident types. We look at using the Laplace test to guide selection of the appropriate models. Then, based on the trend results, we apply various NHPP models (i.e., Goel-Okumutu, S-Shaped, Duane, and K-Stage Curve) to illustrate the relevance of using these models to fit the incident data and to predict future incidents.}, keywords = {computer security incidents, consumer confidence, data theft, network security incidents, nonhomogenous Poisson process, reliability growth process, reputational damage, security of data, software reliability, stock prices}, doi = {10.1109/ISSRE.2007.29}, author = {Condon,E. and Michel Cukier and He,Tao} } @conference {17562, title = {Approximation algorithms for stochastic and risk-averse optimization}, booktitle = {Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms}, series = {SODA {\textquoteright}07}, year = {2007}, month = {2007///}, pages = {1305 - 1313}, publisher = {Society for Industrial and Applied Mathematics}, organization = {Society for Industrial and Applied Mathematics}, address = {Philadelphia, PA, USA}, abstract = {We present improved approximation algorithms in stochastic optimization. We prove that the multi-stage stochastic versions of covering integer programs (such as set cover and vertex cover) admit essentially the same approximation algorithms as their standard (non-stochastic) counterparts; this improves upon work of Swamy \& Shmoys that shows an approximability which depends multiplicatively on the number of stages. We also present approximation algorithms for facility location and some of its variants in the 2-stage recourse model, improving on previous approximation guarantees.}, isbn = {978-0-898716-24-5}, url = {http://dl.acm.org/citation.cfm?id=1283383.1283523}, author = {Srinivasan, Aravind} } @article {18663, title = {Archetypal behavior in computer security}, journal = {Journal of Systems and Software}, volume = {80}, year = {2007}, month = {2007/10//}, pages = {1594 - 1606}, abstract = {The purpose of this study is to understand observed behavior and to diagnose and find solutions to issues encountered in organizational computer security using a systemic approach, namely system archetypes. In this paper we show the feasibility of archetypes application and the benefits of simulation. We developed a model and simulation of some aspects of security based on system dynamics principles. The system dynamics simulation model can be used in support of decision-making, training, and teaching regarding the mitigation of computer security risks. In this paper, we combine two archetypes and show the computer security relevance of such combinations. Presented are instances of the archetypes {\textquotedblleft}Escalation{\textquotedblright}, in which an organization must continuously increase its efforts to counter additional attacker effort; and {\textquotedblleft}Limits to Growth{\textquotedblright}, in which the gains from an organization{\textquoteright}s security efforts plateau or decline due to its limited capacity for security-related tasks. We describe a scenario where these archetypes (individually and combined) can help in diagnosis and understanding, and present simulation of {\textquotedblleft}what-if{\textquotedblright} scenarios suggesting how an organization might remedy these problems and maximize its gains from security efforts.}, keywords = {Attacks and countermeasures, Escalation, Limits to Growth, Organization computer security, System archetypes, System dynamics, System dynamics modeling and simulation}, isbn = {0164-1212}, doi = {10.1016/j.jss.2007.01.046}, url = {http://www.sciencedirect.com/science/article/pii/S0164121207000155}, author = {Rosenfeld,Shalom N. and Rus,Ioana and Michel Cukier} } @article {15350, title = {Assessment of WENO methods with shock-confining filtering for LES of compressible turbulence}, journal = {AIAA Paper 2007}, volume = {4198}, year = {2007}, month = {2007///}, author = {Grube,N. E and Taylor,E. M and Martin, M.P} } @article {12916, title = {Association of Vibrio Cholerae O1 El Tor and O139 Bengal with the Copepods Acartia Tonsa and Eurytemora Affinis}, journal = {Applied and Environmental MicrobiologyAppl. Environ. Microbiol.}, volume = {73}, year = {2007}, month = {2007/12/15/}, pages = {7926 - 7933}, abstract = {The association of Vibrio cholerae with zooplankton has been suggested as an important factor in transmission of human epidemic cholera, and the ability to colonize zooplankton surfaces may play a role in the temporal variation and predominance of the two different serogroups (V. cholerae O1 El Tor and O139) in the aquatic environment. To date, interactions between specific serogroups and species of plankton remain poorly understood. Laboratory microcosm experiments were carried out to compare quantitatively the colonization of two copepod species, Acartia tonsa and Eurytemora affinis, by each of the epidemic serogroups. V. cholerae O1 consistently achieved higher abundances than V. cholerae O139 in colonizing adults of each copepod species as well as the multiple life stages of E. affinis. This difference in colonization may be significant in the general predominance of V. cholerae O1 in cholera epidemics in rural Bangladesh where water supplies are taken directly from the environment.}, isbn = {0099-2240, 1098-5336}, doi = {10.1128/AEM.01238-07}, url = {http://aem.asm.org/content/73/24/7926}, author = {Rawlings,Tonya K. and Ruiz,Gregory M. and Rita R Colwell} } @conference {14664, title = {Automated detection of persistent kernel control-flow attacks}, booktitle = {Proceedings of the 14th ACM conference on Computer and communications security}, series = {CCS {\textquoteright}07}, year = {2007}, month = {2007///}, pages = {103 - 115}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {This paper presents a new approach to dynamically monitoring operating system kernel integrity, based on a property called state-based control-flow integrity (SBCFI). Violations of SBCFI signal a persistent, unexpected modification of the kernel{\textquoteright}s control-flow graph. We performed a thorough analysis of 25 Linux rootkits and found that 24 (96\%) employ persistent control-flow modifications; an informal study of Windows rootkits yielded similar results. We have implemented SBCFI enforcement as part of the Xen and VMware virtual machine monitors. Our implementation detected all the control-flow modifying rootkits we could install, while imposing unnoticeable overhead for both a typical web server workload and CPU-intensive workloads when operating at 10 second intervals.}, keywords = {CFI, integrity, Kernel, rootkit, virtualization}, isbn = {978-1-59593-703-2}, doi = {10.1145/1315245.1315260}, url = {http://doi.acm.org/10.1145/1315245.1315260}, author = {Petroni,Jr.,Nick L. and Hicks, Michael W.} } @conference {15460, title = {Automated gui testing guided by usage profiles}, booktitle = {Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering}, series = {ASE {\textquoteright}07}, year = {2007}, month = {2007///}, pages = {333 - 342}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Most software developed in recent years has a graphical userinterface (GUI). The only way for the end-user to interact with the software application is through the GUI. Hence, acceptance and system testing of the software requires GUI testing. This paper presents a new technique for testing of GUI applications. Information on the actual usage of the application, in the form of "usage profiles," is used to ensure that a new version of the application will function correctly. Usage profiles, sequences of events that end-users execute on a GUI, are used to develop a probabilistic usage model of the application. An algorithm uses the model to generate test cases that represent events the user is most likely to execute. Reverse engineering methods are used to extract the underlying structure of the application. An empirical study on four open source GUI applications reveals that test suites generated from the probabilistic model are 0.2-22\% of the size of test suites produced directly from usage profiles. Furthermore, the test suites generated from the model detect more faults per test case than those detected directly from the usage profiles, and detect faults not detected by the original profiles}, keywords = {event-driven software, GUI testing, usage profiles}, isbn = {978-1-59593-882-4}, doi = {10.1145/1321631.1321681}, url = {http://doi.acm.org/10.1145/1321631.1321681}, author = {Brooks,Penelope A. and Memon, Atif M.} } @conference {13506, title = {Automatic Document Logo Detection}, booktitle = {The 9th International Conference on Document Analysis and Recognition (ICDAR 2007)}, year = {2007}, month = {2007///}, pages = {864 - 868}, address = {Curitiba, Brazil}, abstract = {Automatic logo detection and recognition continues to be of great interest to the document retrieval community as it enables effective identification of the source of a document. In this paper, we propose a new approach to logo detection and extraction in document images that robustly classifiesand precisely localizes logos using a boosting strategy across multiple image scales. At a coarse scale, a trained Fisher classifier performs initial classification using features from document context and connected components. Each logo candidate region is further classified at successively finer scales by a cascade of simple classifiers, which allows false alarms to be discarded and the detected region to be refined. Our approach is segmentation free and layout independent. We define a meaningful evaluation metric to measure the quality of logo detection using labeled groundtruth. We demonstrate the effectiveness of our approach using a large collection of real-world documents.}, author = {Zhu,Guangyu and David Doermann} } @conference {14808, title = {Automatic software interference detection in parallel applications}, booktitle = {Proceedings of the 2007 ACM/IEEE conference on Supercomputing}, series = {SC {\textquoteright}07}, year = {2007}, month = {2007///}, pages = {14:1{\textendash}14:12 - 14:1{\textendash}14:12}, publisher = {ACM}, organization = {ACM}, address = {Reno, Nevada}, abstract = {We present an automated software interference detection methodology for Single Program, Multiple Data (SPMD) parallel applications. Interference comes from the system and unexpected processes. If not detected and corrected such interference may result in performance degradation. Our goal is to provide a reliable metric for software interference that can be used in soft-failure protection and recovery systems. A unique feature of our algorithm is that we measure the relative timing of application events (i.e. time between MPI calls) rather than system level events such as CPU utilization. This approach lets our system automatically accommodate natural variations in an application{\textquoteright}s utilization of resources. We use performance irregularities and degradation as signs of software interference. However, instead of relying on temporal changes in performance, our system detects spatial performance degradation across multiple processors. We also include a case study that demonstrates our technique{\textquoteright}s effectiveness, resilience and robustness.}, isbn = {978-1-59593-764-3}, doi = {10.1145/1362622.1362642}, author = {Tabatabaee, Vahid and Hollingsworth, Jeffrey K} } @article {16862, title = {Autonomic computing}, journal = {IEEE internet computing}, volume = {11}, year = {2007}, month = {2007///}, pages = {52 - 59}, author = {Brabec,F. and Samet, Hanan} } @conference {18880, title = {Accident or intention: That is the question (in the noisy iterated prisoner{\textquoteright}s dilemma)}, year = {2006}, month = {2006///}, pages = {561 - 568}, abstract = {This paper focuses on the Noisy Iterated Prisoner{\textquoteright}sDilemma, a version of the Iterated Prisoner{\textquoteright}s Dilemma (IPD) in which there is a nonzero probability that a {\textquotedblleft}co- operate{\textquotedblright} action will accidentally be changed into a {\textquotedblleft}defect{\textquotedblright} action and vice versa. Tit-For-Tat and other strategies that do quite well in the ordinary (non-noisy) IPD can do quite badly in the Noisy IPD. This paper presents a technique called symbolic noise de- tection, for detecting whether anomalies in player{\textquoteright}s behavior are deliberate or accidental. The key idea is to construct a model of the other agent{\textquoteright}s behavior, and watch for any de- viation from this model. If the other agent{\textquoteright}s next action is inconsistent with this model, the inconsistency can be due either to noise or to a genuine change in their behavior; and we can often distinguish between two cases by waiting to see whether this inconsistency persists in next few moves. We entered several different versions of our strategy in the 2005 Iterated Prisoner{\textquoteright}s Dilemma competition, in Cat- egory 2 (noisy environments). Out of the 165 contestants in this category, our programs consistently ranked among top ten. The best of our programs ranked third, and it was beaten only by two {\textquotedblleft}master-slave strategy{\textquotedblright} programs that each had a large number of {\textquotedblleft}slave{\textquotedblright} programs feeding points to them. }, url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.120.7640\&rep=rep1\&type=pdf}, author = {Au,T. C and Nau, Dana S.} } @conference {15244, title = {Achieving anonymity via clustering}, booktitle = {Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems}, series = {PODS {\textquoteright}06}, year = {2006}, month = {2006///}, pages = {153 - 162}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Publishing data for analysis from a table containing personal records, while maintaining individual privacy, is a problem of increasing importance today. The traditional approach of de-identifying records is to remove identifying fields such as social security number, name etc. However, recent research has shown that a large fraction of the US population can be identified using non-key attributes (called quasi-identifiers) such as date of birth, gender, and zip code [15]. Sweeney [16] proposed the k-anonymity model for privacy where non-key attributes that leak information are suppressed or generalized so that, for every record in the modified table, there are at least k-1 other records having exactly the same values for quasi-identifiers. We propose a new method for anonymizing data records, where quasi-identifiers of data records are first clustered and then cluster centers are published. To ensure privacy of the data records, we impose the constraint that each cluster must contain no fewer than a pre-specified number of data records. This technique is more general since we have a much larger choice for cluster centers than k-Anonymity. In many cases, it lets us release a lot more information without compromising privacy. We also provide constant-factor approximation algorithms to come up with such a clustering. This is the first set of algorithms for the anonymization problem where the performance is independent of the anonymity parameter k. We further observe that a few outlier points can significantly increase the cost of anonymization. Hence, we extend our algorithms to allow an ε fraction of points to remain unclustered, i.e., deleted from the anonymized publication. Thus, by not releasing a small fraction of the database records, we can ensure that the data published for analysis has less distortion and hence is more useful. Our approximation algorithms for new clustering objectives are of independent interest and could be applicable in other clustering scenarios as well.}, keywords = {anonymity, Approximation algorithms, clustering, privacy}, isbn = {1-59593-318-2}, doi = {10.1145/1142351.1142374}, url = {http://doi.acm.org/10.1145/1142351.1142374}, author = {Aggarwal,Gagan and Feder,Tom{\'a}s and Kenthapadi,Krishnaram and Khuller, Samir and Panigrahy,Rina and Thomas,Dilys and Zhu,An} } @inbook {12623, title = {Acquisition of Articulated Human Body Models Using Multiple Cameras}, booktitle = {Articulated Motion and Deformable ObjectsArticulated Motion and Deformable Objects}, series = {Lecture Notes in Computer Science}, volume = {4069}, year = {2006}, month = {2006///}, pages = {78 - 89}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {Motion capture is an important application in different areas such as biomechanics, computer animation, and human-computer interaction. Current motion capture methods typically use human body models in order to guide pose estimation and tracking. We model the human body as a set of tapered super-quadrics connected in an articulated structure and propose an algorithm to automatically estimate the parameters of the model using video sequences obtained from multiple calibrated cameras. Our method is based on the fact that the human body is constructed of several articulated chains that can be visualised as essentially 1-D segments embedded in 3-D space and connected at specific joint locations. The proposed method first computes a voxel representation from the images and maps the voxels to a high dimensional space in order to extract the 1-D structure. A bottom-up approach is then suggested in order to build a parametric (spline-based) representation of a general articulated body in the high dimensional space followed by a top-down probabilistic approach that registers the segments to the known human body model. We then present an algorithm to estimate the parameters of our model using the segmented and registered voxels.}, isbn = {978-3-540-36031-5}, url = {http://dx.doi.org/10.1007/11789239_9}, author = {Sundaresan,Aravind and Chellapa, Rama}, editor = {Perales,Francisco and Fisher,Robert} } @article {16731, title = {An adaptive probabilistic replication method for unstructured p2p networks}, journal = {On the Move to Meaningful Internet Systems 2006: CoopIS, DOA, GADA, and ODBASE}, year = {2006}, month = {2006///}, pages = {480 - 497}, author = {Tsoumakos,D. and Roussopoulos, Nick} } @article {16492, title = {Adaptive pull-based policies for wide area data delivery}, journal = {ACM Transactions on Database Systems (TODS)}, volume = {31}, year = {2006}, month = {2006///}, pages = {631 - 671}, author = {Bright,L. and Gal,A. and Raschid, Louiqa} } @conference {12617, title = {An Adaptive Threshold Method for Hyperspectral Target Detection}, booktitle = {Acoustics, Speech and Signal Processing, 2006. ICASSP 2006 Proceedings. 2006 IEEE International Conference on}, volume = {5}, year = {2006}, month = {2006/05//}, pages = {V - V}, abstract = {In this paper, we present a new approach to automatically determine a detector threshold. This research problem is especially important in hyperspectral target detection as targets are typically very similar to the background. While a number of methods exist to determine the threshold, these methods require either large amounts of data or make simplifying assumptions about the background distribution. We use a method called inverse blind importance sampling which requires few samples and makes no a-priori assumptions about the background statistics. Results show the promise of this algorithm to determine thresholds for fixed false alarm densities in hyperspectral detectors}, keywords = {adaptive, blind, detection;, detection;inverse, importance, method;background, processing;importance, sampling;geophysical, sampling;object, signal, statistics;hyperspectral, target, threshold}, doi = {10.1109/ICASSP.2006.1661497}, author = {Broadwater, J. and Chellapa, Rama} } @conference {13491, title = {Adaptive Transformation-based Learning for Improving Dictionary Tagging}, booktitle = {Proceedings of the 11th Conference on European Chapter of the Association for Computational Linguistics}, year = {2006}, month = {2006/04//}, pages = {257 - 264}, address = {Trento, Italy}, abstract = {We present an adaptive technique that enables users to produce a high quality dictionary parsed into its lexicographic components (headwords, parts of speech, translations, etc.) using an extremely small amount of user provided training data. We use transformation-based learning (TBL) as a postprocessor at two points in the system to improve performance. The results show that the tagging accuracy is increased from 83\% and 91\% to 93\% and 94\% for individual words or tokens , and from 64\% and 83\% to 90\% and 93\% for contiguous phrases such as definitions or examples of usage.}, author = {Karagol-Ayan,Burcu and Doermann, David and Weinberg, Amy} } @article {12396, title = {Adding dense, weighted connections to wordnet}, journal = {Proceedings of the Third International WordNet Conference}, year = {2006}, month = {2006///}, pages = {29 - 36}, abstract = {WORDNET, a ubiquitous tool for natural language processing, suffers from sparsity of connectionsbetween its component concepts (synsets). Through the use of human annotators, a subset of the connections between 1000 hand-chosen synsets was assigned a value of {\textquotedblleft}evocation{\textquotedblright} representing how much the first concept brings to mind the second. These data, along with existing similarity measures, constitute the basis of a method for predicting evocation between previously unrated pairs. }, author = {Jordan Boyd-Graber and Fellbaum,C. and Osherson,D. and Schapire,R.} } @book {18365, title = {Advances in Computers: Computational Biology and Bioinformatics}, year = {2006}, month = {2006/11/22/}, publisher = {Academic Press}, organization = {Academic Press}, abstract = {The field of bioinformatics and computational biology arose due to the need to apply techniques from computer science, statistics, informatics, and applied mathematics to solve biological problems. Scientists have been trying to study biology at a molecular level using techniques derived from biochemistry, biophysics, and genetics. Progress has greatly accelerated with the discovery of fast and inexpensive automated DNA sequencing techniques. As the genomes of more and more organisms are sequenced and assembled, scientists are discovering many useful facts by tracing the evolution of organisms by measuring changes in their DNA, rather than through physical characteristics alone. This has led to rapid growth in the related fields of phylogenetics, the study of evolutionary relatedness among various groups of organisms, and comparative genomics, the study of the correspondence between genes and other genomic features in different organisms. Comparing the genomes of organisms has allowed researchers to better understand the features and functions of DNA in individual organisms, as well as provide insights into how organisms evolve over time. The first four chapters of this book focus on algorithms for comparing the genomes of different organisms. Possible concrete applications include identifying the basis for genetic diseases and tracking the development and spread of different forms of Avian flu. As researchers begin to better understand the function of DNA, attention has begun shifting towards the actual proteins produced by DNA. The final two chapters explore proteomic techniques for analyzing proteins directly to identify their presence and understand their physical structure.- Written by active PhD researchers in computational biology and bioinformatics}, keywords = {Bioinformatics, Computational Biology, Computers / Bioinformatics, Computers / Computer Science, Computers / Data Processing, Computers / Information Theory, Computers / Interactive \& Multimedia, Computers / Programming / General, Computers / Reference, Computers / Software Development \& Engineering / General, Mathematics / Applied, Science / Life Sciences / Biology}, isbn = {9780120121687}, author = {Zelkowitz, Marvin V and Tseng,Chau-Wen} } @article {15253, title = {Algorithms for non-uniform size data placement on parallel disks}, journal = {Journal of Algorithms}, volume = {60}, year = {2006}, month = {2006/08//}, pages = {144 - 167}, abstract = {We study an optimization problem that arises in the context of data placement in a multimedia storage system. We are given a collection of M multimedia objects (data items) that need to be assigned to a storage system consisting of N disks d 1 , d 2 , {\textellipsis} , d N . We are also given sets U 1 , U 2 , {\textellipsis} , U M such that U i is the set of clients seeking the ith data item. Data item i has size s i . Each disk d j is characterized by two parameters, namely, its storage capacity C j which indicates the maximum total size of data items that may be assigned to it, and a load capacity L j which indicates the maximum number of clients that it can serve. The goal is to find a placement of data items to disks and an assignment of clients to disks so as to maximize the total number of clients served, subject to the capacity constraints of the storage system.We study this data placement problem for homogeneous storage systems where all the disks are identical. We assume that all disks have a storage capacity of k and a load capacity of L. Previous work on this problem has assumed that all data items have unit size, in other words s i = 1 for all i. Even for this case, the problem is NP-hard. For the case where s i ∈ { 1 , {\textellipsis} , Δ } for some constant Δ, we develop a polynomial time approximation scheme (PTAS). This result is obtained by developing two algorithms, one that works for constant k and one that works for arbitrary k. The algorithm for arbitrary k guarantees that a solution where at least ( ( k - Δ ) ( k + Δ ) ) ( 1 - 1 ( 1 + k ( 2 Δ ) ) 2 ) -fraction of all clients are assigned to a disk (under certain assumptions). In addition we develop an algorithm for which we can prove tight bounds when s i ∈ { 1 , 2 } . In fact, we can show that a ( 1 - 1 ( 1 + ⌊ k / 2 ⌋ ) 2 ) -fraction of all clients can be assigned (under certain natural assumptions), regardless of the input distribution. }, isbn = {0196-6774}, doi = {10.1016/j.jalgor.2004.06.007}, url = {http://www.sciencedirect.com/science/article/pii/S0196677404001063}, author = {Kashyap,Srinivas and Khuller, Samir} } @conference {18758, title = {Algorithms for on-line monitoring of components in an optical tweezers-based assembly cell}, year = {2006}, month = {2006///}, pages = {1 - 13}, abstract = {Optical tweezers have emerged as a powerful tool for microand nanomanipulation. Using optical tweezers to perform auto- mated assembly requires on-line monitoring of components in the assembly workspace. This paper presents algorithms for estimat- ing positions and orientations of microscale and nanoscale com- ponents in the 3-Dimensional assembly workspace. Algorithms presented in this paper use images obtained by optical section microscopy. The images are first segmented to locate areas of in- terest and then image gradient information from the areas of in- terest is used to generate probable locations and orientations of components in the XY-plane. Finally, signature curves are com- puted and utilized to obtain component locations and orienta- tions in 3-D space. We have tested these algorithms with silica micro-spheres as well as metallic nanowires. We believe that the algorithms described in this paper will provide the foundation for realizing automated assembly operations in optical tweezers- based assembly cells. }, url = {http://www.glue.umd.edu/~skgupta/Publication/CIE06_Peng1.pdf}, author = {Peng,T. and Balijepalli,A. and Gupta,S.K. and LeBrun,T. W.} } @article {15712, title = {Algorithms for Structured Total Least Squares Problems with Applications to Blind Image Deblurring}, journal = {Journal of Research of the National Institute of Standards and Technology}, volume = {111}, year = {2006}, month = {2006///}, pages = {113 - 119}, abstract = {Mastronardi, Lemmerling, and van Huel presented an algorithm for solving a total least squares problem when the matrix and its perturbations are Toeplitz. A Toeplitz matrix is a special kind of matrix with small displacement rank. Here we generalize the fast algorithm to any matrix with small displacement rank. In particular, we show how to efficiently construct the generators whenever M has small displacement rank and show that in many important cases the Cholesky factorization of the matrix M M can also be determined fast. We further extend this problem to Tikhonov regularization of ill-posed problems and illustrate the use of the algorithm on an image deblurring problem.}, url = {http://nvl.nist.gov/pub/nistpubs/jres/111/2/V111.N02.A06.pdfhttp://nvl.nist.gov/pub/nistpubs/jres/111/2/V111.N02.A06.pdf}, author = {Kalsi,Anoop and O{\textquoteright}Leary, Dianne P.} } @conference {15689, title = {Alternative custodians for congestion control in delay tolerant networks}, booktitle = {Proceedings of the 2006 SIGCOMM workshop on Challenged networks}, series = {CHANTS {\textquoteright}06}, year = {2006}, month = {2006///}, pages = {229 - 236}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, keywords = {delay tolerant network, Routing}, isbn = {1-59593-572-X}, doi = {10.1145/1162654.1162660}, url = {http://doi.acm.org/10.1145/1162654.1162660}, author = {Seligman,Matthew and Fall,Kevin and Mundur, Padma} } @article {14125, title = {Analysis and comparison of geometric and algebraic multigrid for convection-diffusion equations}, journal = {ANALYSIS}, volume = {28}, year = {2006}, month = {2006///}, pages = {2208 - 2228}, author = {Wu, C. T and Elman, Howard} } @article {15341, title = {Analysis of Shock Motion in a Compression Ramp Configuration using DNS data}, journal = {Bulletin of the American Physical Society}, year = {2006}, month = {2006///}, author = {Wu,M. and Martin, M.P} } @article {15107, title = {Analyzing the HB and HB+ protocols in the {\textquotedblleft}large error{\textquotedblright} case}, journal = {IACR ePrint report}, volume = {326}, year = {2006}, month = {2006///}, pages = {2006 - 2006}, abstract = {HB and HB+ are two shared-key, unidirectional authentication protocols whose extremelylow computational cost makes them potentially well-suited for severely resource-constrained devices. Security of these protocols is based on the conjectured hardness of learning parity with noise; that is, learning a secret s given {\textquotedblleft}noisy{\textquotedblright} dot products of s that are incorrect with probability ε. Although the problem of learning parity with noise is meaningful for any constant ε < 1/2, existing proofs of security for HB and HB+ only imply security when ε < 1/4. In this note, we show how to extend these proofs to the case of arbitrary ε < 1/2. }, author = {Katz, Jonathan and Smith,A.} } @conference {13496, title = {ANew Algorithm for Detecting Text Line in Handwritten Documents}, booktitle = {10th International Workshop on Frontiers in Handwriting Recognition}, year = {2006}, month = {2006///}, pages = {35 - 40}, address = {La Baule, France}, abstract = {Curvilinear text line detection and segmentation in handwritten documents is a significant challenge for handwriting recognition. Given no prior knowledge of script, we model text line detection as an image segmentation problem by enhancing text line structure using a Gaussian window, and adopting the level set method to evolve text line boundaries. Experiments show that the proposed method achieves high accuracy for detecting text lines in both handwritten and machine printed documents with many scripts.}, author = {Li,Yi and Yefeng Zheng and David Doermann and Jaeger,Stefan} } @article {17784, title = {Annotated rdf}, journal = {The Semantic Web: Research and Applications}, volume = {4011}, year = {2006}, month = {2006///}, pages = {487 - 501}, abstract = {There are numerous extensions of RDF that support temporal reasoning, reasoning about pedigree, reasoning about uncertainty, and so on. In this paper, we present Annotated RDF (or aRDF for short) in which RDF triples are annotated by members of a partially ordered set (with bottom element) that can be selected in any way desired by the user. We present a formal declarative semantics (model theory) for annotated RDF and develop algorithms to check consistency of aRDF theories and to answer queries to aRDF theories. We show that annotated RDF captures versions of all the forms of reasoning mentioned above within a single unified framework. We develop a prototype aRDF implementation and show that our algorithms work very fast indeed {\textendash} in fact, in just a matter of seconds for theories with over 100,000 nodes.}, doi = {10.1007/11762256_36}, author = {Udrea,O. and Recupero,D. and V.S. Subrahmanian} } @conference {13723, title = {Annotation compatibility working group report}, booktitle = {Proceedings of the Workshop on Frontiers in Linguistically Annotated Corpora 2006}, series = {LAC {\textquoteright}06}, year = {2006}, month = {2006///}, pages = {38 - 53}, publisher = {Association for Computational Linguistics}, organization = {Association for Computational Linguistics}, address = {Stroudsburg, PA, USA}, abstract = {This report explores the question of compatibility between annotation projects including translating annotation formalisms to each other or to common forms. Compatibility issues are crucial for systems that use the results of multiple annotation projects. We hope that this report will begin a concerted effort in the field to track the compatibility of annotation schemes for part of speech tagging, time annotation, treebanking, role labeling and other phenomena.}, isbn = {1-932432-78-7}, url = {http://dl.acm.org/citation.cfm?id=1641991.1641997}, author = {Meyers,A. and Fang,A. C. and Ferro,L. and K{\"u}bler,S. and Jia-Lin,T. and Palmer,M. and Poesio,M. and Dolbey,A. and Schuler,K. K. and Loper,E. and Zinsmeister,H. and Penn,G. and Xue,N. and Hinrichs,E. and Wiebe,J. and Pustejovsky,J. and Farwell,D. and Hajicova,E. and Dorr, Bonnie J and Hovy,E. and Onyshkevych,B. A. and Levin,L.} } @article {19020, title = {Anonymous multi-attribute encryption with range query and conditional decryption}, year = {2006}, month = {2006}, institution = {Carnegie Mellon University}, abstract = {We introduce the concept of Anonymous Multi-Attribute Encryption with Range Query and Con-ditional Decryption (AMERQCD). In AMERQCD, a plaintext is encrypted under a point in multi- dimensional space. To a computationally bounded adversary, the ciphertext hides both the plaintext and the point under which it is encrypted. In a range query, a master key owner releases the decryp- tion key for an arbitrary hyper-rectangle in space, thus allowing decryption of ciphertexts previ- ously encrypted under any point within the hyper-rectangle. However, a computationally bounded adversary cannot learn any information on ciphertexts outside the range covered by the decryption key (except the fact that they do not lie within this range). We give an efficient construction based on the Decision Bilinear Diffie-Hellman (D-BDH) and Decision Linear (D-Linear) assumption. }, isbn = {CMU-CS-06-135}, doi = {Technical Report}, url = {http://reports-archive.adm.cs.cmu.edu/anon/anon/home/ftp/2006/CMU-CS-06-135.pdf}, author = {Bethencourt, J. and Chan, H. and Perrig, A. and Elaine Shi and Song,D.} } @article {13170, title = {Appearance-based person recognition using color/path-length profile}, journal = {Journal of Visual Communication and Image Representation}, volume = {17}, year = {2006}, month = {2006///}, pages = {605 - 622}, author = {Yoon,K. and Harwood,D. and Davis, Larry S.} } @inbook {19624, title = {Applications of Parameterized st-Orientations in Graph Drawing Algorithms}, booktitle = {Graph Drawing}, series = {Lecture Notes in Computer Science}, year = {2006}, month = {2006/01/01/}, pages = {355 - 367}, publisher = {Springer Berlin Heidelberg}, organization = {Springer Berlin Heidelberg}, abstract = {Many graph drawing algorithms use st-numberings (st-orien-tations or bipolar orientations) as a first step. An st-numbering of a biconnected undirected graph defines a directed graph with no cycles, one single source s and one single sink t. As there exist exponentially many st-numberings that correspond to a certain undirected graph G, using different st-numberings in various graph drawing algorithms can result in aesthetically different drawings with different area bounds. In this paper, we present results concerning new algorithms for parameterized st-orientations, their impact on graph drawing algorithms and especially in visibility representations.}, keywords = {Algorithm Analysis and Problem Complexity, Computer Graphics, Data structures, Discrete Mathematics in Computer Science}, isbn = {978-3-540-31425-7, 978-3-540-31667-1}, url = {http://link.springer.com/chapter/10.1007/11618058_32}, author = {Charalampos Papamanthou and Tollis, Ioannis G.}, editor = {Healy, Patrick and Nikolov, Nikola S.} } @conference {12093, title = {Applying flow-sensitive CQUAL to verify MINIX authorization check placement}, booktitle = {Proceedings of the 2006 workshop on Programming languages and analysis for security}, series = {PLAS {\textquoteright}06}, year = {2006}, month = {2006///}, pages = {3 - 6}, publisher = {ACM}, organization = {ACM}, address = {Ottawa, Ontario, Canada}, abstract = {We present the first use of flow-sensitive CQUAL to verify the placement of operating system authorization checks. Our analysis of MINIX 3 system servers and discovery of a non-exploitable Time-Of-Check/Time-Of-Use bug demonstrate the effectiveness of flow sensitive CQUAL and its advantage over earlier flow-insensitive versions. We also identify and suggest alternatives to current CQUAL usability features that encourage analysts to make omissions that cause the otherwise sound tool to produce false-negative results.}, keywords = {access controls, cqual, minix}, isbn = {1-59593-374-3}, doi = {10.1145/1134744.1134747}, author = {Fraser,Timothy and Petroni,Jr. and Arbaugh, William A.} } @conference {13357, title = {Approximate Data Collection in Sensor Networks using Probabilistic Models}, booktitle = {Proceedings of the 22nd International Conference on Data Engineering, 2006. ICDE {\textquoteright}06}, year = {2006}, month = {2006/04/03/07}, pages = {48 - 48}, publisher = {IEEE}, organization = {IEEE}, abstract = {Wireless sensor networks are proving to be useful in a variety of settings. A core challenge in these networks is to minimize energy consumption. Prior database research has proposed to achieve this by pushing data-reducing operators like aggregation and selection down into the network. This approach has proven unpopular with early adopters of sensor network technology, who typically want to extract complete "dumps" of the sensor readings, i.e., to run "SELECT *" queries. Unfortunately, because these queries do no data reduction, they consume significant energy in current sensornet query processors. In this paper we attack the "SELECT " problem for sensor networks. We propose a robust approximate technique called Ken that uses replicated dynamic probabilistic models to minimize communication from sensor nodes to the network{\textquoteright}s PC base station. In addition to data collection, we show that Ken is well suited to anomaly- and event-detection applications. A key challenge in this work is to intelligently exploit spatial correlations across sensor nodes without imposing undue sensor-to-sensor communication burdens to maintain the models. Using traces from two real-world sensor network deployments, we demonstrate that relatively simple models can provide significant communication (and hence energy) savings without undue sacrifice in result quality or frequency. Choosing optimally among even our simple models is NPhard, but our experiments show that a greedy heuristic performs nearly as well as an exhaustive algorithm.}, keywords = {Batteries, Biological system modeling, Biosensors, data mining, Databases, Energy consumption, Intelligent networks, Intelligent sensors, Robustness, Wireless sensor networks}, isbn = {0-7695-2570-9}, doi = {10.1109/ICDE.2006.21}, author = {Chu,D. and Deshpande, Amol and Hellerstein,J. M and Wei Hong} } @article {15248, title = {Approximating the minimal sensor selection for supervisory control}, journal = {Discrete Event Dynamic Systems}, volume = {16}, year = {2006}, month = {2006///}, pages = {143 - 170}, abstract = {This paper discusses the problem of selecting a set of sensors of minimum cost that can be used for the synthesis of a supervisory controller. It is shown how this sensor selection problem is related to a type of directed graph st-cut problem that has not been previously discussed in the literature. Approximation algorithms to solve the sensor selection problem can be used to solve the graph cutting problem and vice-versa. Polynomial time algorithms to find good approximate solutions to either problem most likely do not exist (under certain complexity assumptions), but a time efficient approximation algorithm is shown that solves a special case of these problems. It is also shown how to convert the sensor selection problem into an integer programming problem.}, doi = {10.1007/s10626-006-6187-3}, author = {Rohloff,K. R and Khuller, Samir and Kortsarz,G.} } @article {15250, title = {Approximation algorithms for channel allocation problems in broadcast networks}, journal = {Networks}, volume = {47}, year = {2006}, month = {2006/03/09/}, pages = {225 - 236}, abstract = {We study two packing problems that arise in the area of dissemination-based information systems; a second theme is the study of distributed approximation algorithms. The problems considered have the property that the space occupied by a collection of objects together could be significantly less than the sum of the sizes of the individual objects. In the Channel Allocation Problem, there are requests that are subsets of topics. There are a fixed number of channels that can carry an arbitrary number of topics. All the topics of each request must be broadcast on some channel. The load on any channel is the number of topics that are broadcast on that channel; the objective is to minimize the maximum load on any channel. We present approximation algorithms for this problem, and also show that the problem is MAX-SNP hard. The second problem is the Edge Partitioning Problem addressed by Goldschmidt, Hochbaum, Levin, and Olinick (Networks, 41:13{\textendash}23, 2003). Each channel here can deliver topics for at most k requests, and we aim to minimize the total load on all channels. We present an O(n1/3){\textendash}approximation algorithm, and also show that the algorithm can be made fully distributed with the same approximation guarantee; we also generalize the (nondistributed) Edge Partitioning Problem of graphs to the case of hypergraphs. {\textcopyright} 2006 Wiley Periodicals, Inc. NETWORKS, Vol. 47(4), 225{\textendash}236 2006}, keywords = {channel allocation problem, distributed approximation algorithm, edge partitioning problem}, isbn = {1097-0037}, doi = {10.1002/net.20111}, url = {http://onlinelibrary.wiley.com/doi/10.1002/net.20111/abstract}, author = {Gandhi,Rajiv and Khuller, Samir and Srinivasan, Aravind and Wang,Nan} } @conference {16868, title = {Archimedes, an archive of medical images}, booktitle = {American Medical Informatics Association 2006 Annual Symposium Proceedings Biomedical and Health Informatics: From Foundations to Applications to Policy, Washington, DC, DW Bates, JH Holmes, and G. Kuperman, editors}, year = {2006}, month = {2006///}, abstract = {We present a medical image and medical recorddatabase for the storage, research, transmission, and evaluation of medical images. Medical images from any source that supports the DICOM standard can be stored and accessed, as well as associated analysis and annotations. Retrieval is based on patient info, date, doctor{\textquoteright}s annotations, features in the images, or a spatial combination. This database supports the secure transmission of sensitive data for tele-medicine and follows all HIPPA regulations. }, author = {Tahmoush,D. and Samet, Hanan} } @article {18653, title = {An architecture for adaptive intrusion-tolerant applications}, journal = {Software: Practice and Experience}, volume = {36}, year = {2006}, month = {2006///}, pages = {1331 - 1354}, abstract = {Applications that are part of a mission-critical information system need to maintain a usable level of key services through ongoing cyber-attacks. In addition to the well-publicized denial of service (DoS) attacks, these networked and distributed applications are increasingly threatened by sophisticated attacks that attempt to corrupt system components and violate service integrity. While various approaches have been explored to deal with DoS attacks, corruption-inducing attacks remain largely unaddressed. We have developed a collection of mechanisms based on redundancy, Byzantine fault tolerance, and adaptive middleware that help distributed, object-based applications tolerate corruption-inducing attacks. In this paper, we present the ITUA architecture, which integrates these mechanisms in a framework for auto-adaptive intrusion-tolerant systems, and we describe our experience in using the technology to defend a critical application that is part of a larger avionics system as an example. We also motivate the adaptive responses that are key to intrusion tolerance, and explain the use of the ITUA architecture to support them in an architectural framework. Copyright {\textcopyright} 2006 John Wiley \& Sons, Ltd.}, keywords = {adaptive defense, adaptive middleware, Byzantine fault tolerance, intrusion tolerance, redundancy, survivability architecture}, isbn = {1097-024X}, doi = {10.1002/spe.747}, url = {http://onlinelibrary.wiley.com/doi/10.1002/spe.747/abstract}, author = {Pal,Partha and Rubel,Paul and Atighetchi,Michael and Webber,Franklin and Sanders,William H. and Seri,Mouna and Ramasamy,HariGovind and Lyons,James and Courtney,Tod and Agbaria,Adnan and Michel Cukier and Gossett,Jeanna and Keidar,Idit} } @conference {12085, title = {An architecture for specification-based detection of semantic integrity violations in kernel dynamic data}, booktitle = {Proceedings of the 15th conference on USENIX Security Symposium}, year = {2006}, month = {2006///}, pages = {20 - 20}, author = {Petroni Jr,N. L and Fraser,T. and Walters,A. A and Arbaugh, William A.} } @conference {13502, title = {ARobust Stamp Detection Framework on Degraded Documents}, booktitle = {International Conference on Document Recognition and Retrieval XIII}, year = {2006}, month = {2006///}, pages = {1 - 9}, publisher = {San Jose, CA}, organization = {San Jose, CA}, abstract = {In this paper, we present a novel stamp detection framework based on parameter estimation of connected edge features. Using robust basic shape detectors, the approach is effective for stamps with analytically shaped contours. For elliptic/circular stamps, it efficiently makes use of the orientation information from pairs of edge points to determine its center position and area without computing all the five parameters of ellipse. When linking connected edges, we introduce an effective template-based junction removal technique to specifically address the problem that stamps often spatially overlap with background contents. These give our approach significant advantage in terms of computation complexity over traditional Hough transform methods. Experimental results on real degraded documents demonstrated the robustness of this retrieval approach on large document database, which consists of both printed text and handwritten notes. This enables us to reliably retrieve documents from a specific source by detecting its official stamps with analytically-shape contours when only limited samples are available.}, author = {Zhu,Guangyu and Jaeger,Stefan and David Doermann} } @conference {18664, title = {Assessing the Attack Threat due to IRC Channels}, year = {2006}, month = {2006/06//}, pages = {467 - 472}, abstract = {This practical experience report presents the results of an investigation into the threat of attacks associated with the chat medium IRC. A combination of simulated users (i.e., bots), some configured with scripts that simulated conversations, and regular users were used. The average number of attacks per day a user on IRC can expect, the effect of channel activity, gender based on the name, and network type on the number of attacks were determined. The social structure of IRC channels and the types of users that use it were analyzed. The results indicate that attacks through IRC channels come from human users selecting targets rather than automated scripts targeting every user in a channel}, keywords = {attack threat assessment, channel activity, client-server systems, computer crime, intrusion-resilient channels, IRC channels, IRC protocols, Protocols, telecommunication channels, telecommunication security}, doi = {10.1109/DSN.2006.12}, author = {Meyer,R. and Michel Cukier} } @article {16352, title = {Atomic instructions in java}, journal = {ECOOP 2002{\textemdash}Object-Oriented Programming}, year = {2006}, month = {2006///}, pages = {5 - 16}, author = {Hovemeyer,D. and Pugh, William and Spacco,J.} } @conference {12615, title = {Attribute Grammar-Based Event Recognition and Anomaly Detection}, booktitle = {Computer Vision and Pattern Recognition Workshop, 2006. CVPRW {\textquoteright}06. Conference on}, year = {2006}, month = {2006/06//}, pages = {107 - 107}, abstract = {We propose to use attribute grammars for recognizing normal events and detecting abnormal events in a video. Attribute grammars can describe constraints on features (attributes) in addition to the syntactic structure of the input. Events are recognized using an extension of the Earley parser that handles attributes and concurrent event threads. Abnormal events are detected when the input does not follow syntax of the grammar or the attributes do not satisfy the constraints in the attribute grammar to some degree. We demonstrate the effectiveness of our method for the task of recognizing normal events and detecting anomalies in a parking lot.}, doi = {10.1109/CVPRW.2006.32}, author = {Joo,Seong-Wook and Chellapa, Rama} } @article {13728, title = {Automatic identification of confusable drug names}, journal = {Artificial Intelligence in Medicine}, volume = {36}, year = {2006}, month = {2006/01//}, pages = {29 - 42}, abstract = {SummaryObjectiveMany hundreds of drugs have names that either look or sound so much alike that doctors, nurses and pharmacists can get them confused, dispensing the wrong one in errors that can injure or even kill patients. Methods and material We propose to address the problem through the application of two new methods{\textemdash}one based on orthographic similarity ({\textquotedblleft}look-alike{\textquotedblright}), and the other based on phonetic similarity ({\textquotedblleft}sound-alike{\textquotedblright}). In order to compare the effectiveness of the new methods for identifying confusable drug names with other known similarity measures, we developed a novel evaluation methodology. Results We show that the new orthographic measure (BI-SIM) outperforms other commonly used measures of similarity on a set containing both look-alike and sound-alike pairs, and that a new feature-based phonetic approach (ALINE) outperforms orthographic approaches on a test set containing solely sound-alike pairs. However, an approach that combines several different measures achieves the best results on two test sets. Conclusion Our system is currently used as the basis of a system developed for the U.S. Food and Drug Administration for detection of confusable drug names. }, keywords = {Drug names, Evaluation methodology, Lexical similarity, Medical errors}, isbn = {0933-3657}, doi = {10.1016/j.artmed.2005.07.005}, url = {http://www.sciencedirect.com/science/article/pii/S0933365705001004}, author = {Kondrak,Grzegorz and Dorr, Bonnie J} } @article {18874, title = {Automatic web services composition using Shop2}, year = {2006}, month = {2006///}, institution = {Department of Computer Science, University of Maryland, College Park}, abstract = {Semantic markup of Web services will enable the automation of various kinds of tasks, including discovery, composition, and execution of Web services. We describe how an AI planning system (SHOP2) can be used with DAML-S Web service descriptions to automatically compose Web services.}, url = {http://www.stormingmedia.us/96/9697/A969744.html}, author = {Hendler,J. and Nau, Dana S. and Parsia,B. and Sirin,E. and Wu,D.} } @article {15553, title = {The ABCs of AVDs: Geometric Retrieval Made Simple}, journal = {Algorithms and Computation}, year = {2005}, month = {2005///}, pages = {819 - 826}, abstract = {One of the best known structures in computational geometry is the Voronoi diagram. Given a set of n points in space, called sites, this is a subdivision that partitions space into n convex cells according which site is closest. The Voronoi diagram and its dual, the Delaunay triangulation are among the most fundamental proximity structures known, and have numerous uses in science. For example, applying point location to the subdivision defined by a Voronoi diagram answers nearest neighbor queries. Although they are popular in low dimensional spaces, there are various reasons why Voronoi diagrams are rarely used higher dimensions. First, the combinatorial complexity of the diagram grows rapidly, as fast as Ω(nd/2) in d-dimensional space. Second, the diagram does not admit a straightforward search structure in higher dimensions.}, doi = {10.1007/978-3-540-30551-4_2}, author = {Mount, Dave} } @inbook {13416, title = {Active Constrained Clustering by Examining Spectral Eigenvectors}, booktitle = {Discovery ScienceDiscovery Science}, series = {Lecture Notes in Computer Science}, volume = {3735}, year = {2005}, month = {2005///}, pages = {294 - 307}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {This work focuses on the active selection of pairwise constraints for spectral clustering. We develop and analyze a technique for Active Constrained Clustering by Examining Spectral eigenvectorS (ACCESS) derived from a similarity matrix. The ACCESS method uses an analysis based on the theoretical properties of spectral decomposition to identify data items that are likely to be located on the boundaries of clusters, and for which providing constraints can resolve ambiguity in the cluster descriptions. Empirical results on three synthetic and five real data sets show that ACCESS significantly outperforms constrained spectral clustering using randomly selected constraints.}, isbn = {978-3-540-29230-2}, url = {http://dx.doi.org/10.1007/11563983_25}, author = {Xu,Qianjun and desJardins, Marie and Wagstaff,Kiri}, editor = {Hoffmann,Achim and Motoda,Hiroshi and Scheffer,Tobias} } @conference {13490, title = {Adaptive OCR with Limited User Feedback}, booktitle = {8th Int. Conf. on Document Analysis and Recognition (ICDAR{\textquoteright}05)}, year = {2005}, month = {2005/08//}, pages = {814 - 818}, abstract = {A methodology is proposed for processing noisy printed documents with limited user feedback. Without the support of ground truth, a specific collection of scanned documents can be processed to extract character templates. The adaptiveness of this approach lies in that the extracted templates are used to train an OCR classifier quickly and with limited user feedback. Experimental results show that this approach is extremely useful for the processing of noisy documents with many touching characters.}, author = {Ma,Huanfeng and David Doermann} } @article {15168, title = {Adaptively-secure, non-interactive public-key encryption}, journal = {Theory of Cryptography}, year = {2005}, month = {2005///}, pages = {150 - 168}, abstract = {Adaptively-secure encryption schemes ensure secrecy even in the presence of an adversary who can corrupt parties in an adaptive manner based on public keys, ciphertexts, and secret data of already-corrupted parties. Ideally, an adaptively-secure encryption scheme should, like standard public-key encryption, allow arbitrarily-many parties to use a single encryption key to securely encrypt arbitrarily-many messages to a given receiver who maintains only a single short decryption key. However, it is known that these requirements are impossible to achieve: no non-interactive encryption scheme that supports encryption of an unbounded number of messages and uses a single, unchanging decryption key can be adaptively secure. Impossibility holds even if secure data erasure is possible.We show that this limitation can be overcome by updating the decryption key over time and making some mild assumptions about the frequency of communication between parties. Using this approach, we construct adaptively-secure, completely non-interactive encryption schemes supporting secure encryption of arbitrarily-many messages from arbitrarily-many senders. Our schemes additionally provide forward security and security against chosen-ciphertext attacks. }, doi = {10.1007/978-3-540-30576-7_9}, author = {Canetti,R. and Halevi,S. and Katz, Jonathan} } @conference {13419, title = {Agent-organized networks for dynamic team formation}, booktitle = {Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems}, series = {AAMAS {\textquoteright}05}, year = {2005}, month = {2005///}, pages = {230 - 237}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Many multi-agent systems consist of a complex network of autonomous yet interdependent agents. Examples of such networked multi-agent systems include supply chains and sensor networks. In these systems, agents have a select set of other agents with whom they interact based on environmental knowledge, cognitive capabilities, resource limitations, and communications constraints. Previous findings have demonstrated that the structure of the artificial social network governing the agent interactions is strongly correlated with organizational performance. As multi-agent systems are typically embedded in dynamic environments, we wish to develop distributed, on-line network adaptation mechanisms for discovering effective network structures. Therefore, within the context of dynamic team formation, we propose several strategies for agent-organized networks (AONs) and evaluate their effectiveness for increasing organizational performance.}, keywords = {multi-agent systems, organizational learning, team formation}, isbn = {1-59593-093-0}, doi = {10.1145/1082473.1082508}, url = {http://doi.acm.org/10.1145/1082473.1082508}, author = {Gaston,Matthew E. and desJardins, Marie} } @conference {13420, title = {Agent-organized networks for multi-agent production and exchange}, booktitle = {Proceedings of the 20th national conference on Artificial intelligence - Volume 1}, series = {AAAI{\textquoteright}05}, year = {2005}, month = {2005///}, pages = {77 - 82}, publisher = {AAAI Press}, organization = {AAAI Press}, abstract = {As multi-agent systems grow in size and complexity, social networks that govern the interactions among the agents will directly impact system behavior at the individual and collective levels. Examples of such large-scale, networked multi-agent systems include peer-to-peer networks, distributed information retrieval, and agent-based supply chains. One way of dealing with the uncertain and dynamic nature of such environments is to endow agents with the ability to modify the agent social network by autonomously adapting their local connectivity structure. In this paper, we present a framework for agent-organized networks (AONs) in the context of multi-agent production and exchange, and experimentally evaluate the feasibility and efficiency of specific AON strategies. We find that decentralized network adaptation can significantly improve organizational performance. Additionally, we analyze several properties of the resulting network structures and consider their relationship to the observed increase in organizational performance.}, isbn = {1-57735-236-x}, url = {http://dl.acm.org/citation.cfm?id=1619332.1619347}, author = {Gaston,Matthew E. and desJardins, Marie} } @article {17791, title = {Aggregate operators in probabilistic databases}, journal = {J. ACM}, volume = {52}, year = {2005}, month = {2005/01//}, pages = {54 - 101}, abstract = {Though extensions to the relational data model have been proposed in order to handle probabilistic information, there has been very little work to date on handling aggregate operators in such databases. In this article, we present a very general notion of an aggregate operator and show how classical aggregation operators (such as COUNT, SUM, etc.) as well as statistical operators (such as percentiles, variance, etc.) are special cases of this general definition. We devise a formal linear programming based semantics for computing aggregates over probabilistic DBMSs, develop algorithms that satisfy this semantics, analyze their complexity, and introduce several families of approximation algorithms that run in polynomial time. We implemented all of these algorithms and tested them on a large set of data to help determine when each one is preferable.}, keywords = {Aggregates, probabilistic relational databases}, isbn = {0004-5411}, doi = {10.1145/1044731.1044734}, url = {http://doi.acm.org/10.1145/1044731.1044734}, author = {Ross,Robert and V.S. Subrahmanian and Grant,John} } @conference {12650, title = {An algebraic approach to surface reconstruction from gradient fields}, booktitle = {Computer Vision, 2005. ICCV 2005. Tenth IEEE International Conference on}, volume = {1}, year = {2005}, month = {2005/10//}, pages = {174 - 181 Vol. 1 - 174 - 181 Vol. 1}, abstract = {Several important problems in computer vision such as shape from shading (SFS) and photometric stereo (PS) require reconstructing a surface from an estimated gradient field, which is usually non-integrable, i.e. have non-zero curl. We propose a purely algebraic approach to enforce integrability in discrete domain. We first show that enforcing integrability can be formulated as solving a single linear system Ax =b over the image. In general, this system is under-determined. We show conditions under which the system can be solved and a method to get to those conditions based on graph theory. The proposed approach is non-iterative, has the important property of local error confinement and can be applied to several problems. Results on SFS and PS demonstrate the applicability of our method.}, keywords = {algebra;, algebraic, approach;, Computer, confinement;, discrete, domain, error, field;, from, gradient, graph, image, integrability;, linear, local, methods;, photometric, reconstruction;, shading;, SHAPE, stereo;, surface, system;, theory;, vision;}, doi = {10.1109/ICCV.2005.31}, author = {Agrawal,A. and Chellapa, Rama and Raskar, R.} } @article {12813, title = {An Algebraic Theory Of Boundary Crossing Transitions}, journal = {Electronic Notes in Theoretical Computer Science}, volume = {115}, year = {2005}, month = {2005/01/18/}, pages = {69 - 88}, abstract = {This paper gives a process-algebraic semantics for the hierarchical state machine (HSM) fragment of Statecharts, in which state transitions are permitted to cross state boundaries. Although frowned upon by researchers as promoting unstructured modeling, such transitions are used extensively in practice to model parameterized start states and conditional exit states. The purpose of this work is to develop a compositional semantics for HSMs that may be fit together with compositional semantic accounts for Statecharts without boundary-crossing transitions in order to arrive at a compositional theory for virtually the whole Statecharts language. Our technical development consists of a process algebra for HSMs that is equipped with an operational semantics, an argument that bisimulation is a congruence for the algebra, a syntax-directed translation procedure for HSMs into the process algebra, and an equational axiomatization of the algebra.}, keywords = {Compositional Semantics, Formal Methods, Process algebra, Statecharts}, isbn = {1571-0661}, doi = {10.1016/j.entcs.2004.09.029}, url = {http://www.sciencedirect.com/science/article/pii/S1571066104053186}, author = {Ray,Arnab and Cleaveland, Rance and Skou,Arne} } @article {17683, title = {Algorithm 844: Computing sparse reduced-rank approximations to sparse matrices}, journal = {ACM Transactions on Mathematical Software-TOMS}, volume = {31}, year = {2005}, month = {2005///}, pages = {252 - 269}, author = {Berry,M. W and Pulatova,S. A and Stewart, G.W.} } @conference {12648, title = {Algorithmic and architectural design methodology for particle filters in hardware}, booktitle = {Computer Design: VLSI in Computers and Processors, 2005. ICCD 2005. Proceedings. 2005 IEEE International Conference on}, year = {2005}, month = {2005/10//}, pages = {275 - 280}, abstract = {In this paper, we present algorithmic and architectural methodology for building particle filters in hardware. Particle filtering is a new paradigm for filtering in presence of nonGaussian nonlinear state evolution and observation models. This technique has found wide-spread application in tracking, navigation, detection problems especially in a sensing environment. So far most particle filtering implementations are not lucrative for real time problems due to excessive computational complexity involved. In this paper, we re-derive the particle filtering theory to make it more amenable to simplified VLSI implementations. Furthermore, we present and analyze pipelined architectural methodology for designing these computational blocks. Finally, we present an application using the bearing only tracking problem and evaluate the proposed architecture and algorithmic methodology.}, keywords = {(numerical, algorithmic, architectural, architectures;, bearing, complexity;, computational, design, digital, evolution;, Filtering, filtering;, filters;, implementation;, methodology;, methods);, nonGaussian, nonlinear, only, Parallel, particle, pipeline, pipelined, problem;, processing;, state, tracking, VLSI, VLSI;}, doi = {10.1109/ICCD.2005.20}, author = {Sankaranarayanan,A. C and Chellapa, Rama and Srivastava, A.} } @conference {17550, title = {Algorithmic aspects of capacity in wireless networks}, booktitle = {Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems}, series = {SIGMETRICS {\textquoteright}05}, year = {2005}, month = {2005///}, pages = {133 - 144}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {This paper considers two inter-related questions: (i) Given a wireless ad-hoc network and a collection of source-destination pairs {(si,ti)}, what is the maximum throughput capacity of the network, i.e. the rate at which data from the sources to their corresponding destinations can be transferred in the network? (ii) Can network protocols be designed that jointly route the packets and schedule transmissions at rates close to the maximum throughput capacity? Much of the earlier work focused on random instances and proved analytical lower and upper bounds on the maximum throughput capacity. Here, in contrast, we consider arbitrary wireless networks. Further, we study the algorithmic aspects of the above questions: the goal is to design provably good algorithms for arbitrary instances. We develop analytical performance evaluation models and distributed algorithms for routing and scheduling which incorporate fairness, energy and dilation (path-length) requirements and provide a unified framework for utilizing the network close to its maximum throughput capacity.Motivated by certain popular wireless protocols used in practice, we also explore "shortest-path like" path selection strategies which maximize the network throughput. The theoretical results naturally suggest an interesting class of congestion aware link metrics which can be directly plugged into several existing routing protocols such as AODV, DSR, etc. We complement the theoretical analysis with extensive simulations. The results indicate that routes obtained using our congestion aware link metrics consistently yield higher throughput than hop-count based shortest path metrics.}, keywords = {capacity modeling, end-to-end scheduling, Linear programming, Wireless networks}, isbn = {1-59593-022-1}, doi = {10.1145/1064212.1064228}, url = {http://doi.acm.org/10.1145/1064212.1064228}, author = {Kumar,V. S. Anil and Marathe,Madhav V. and Parthasarathy,Srinivasan and Srinivasan, Aravind} } @conference {14563, title = {Algorithmic graph minor theory: Decomposition, approximation, and coloring}, booktitle = {Foundations of Computer Science, 2005. FOCS 2005. 46th Annual IEEE Symposium on}, year = {2005}, month = {2005///}, pages = {637 - 646}, abstract = {At the core of the seminal graph minor theory of Robertson and Seymour is a powerful structural theorem capturing the structure of graphs excluding a fixed minor. This result is used throughout graph theory and graph algorithms, but is existential. We develop a polynomial-time algorithm using topological graph theory to decompose a graph into the structure guaranteed by the theorem: a clique-sum of pieces almost-embeddable into bounded-genus surfaces. This result has many applications. In particular we show applications to developing many approximation algorithms, including a 2-approximation to graph coloring, constant-factor approximations to treewidth and the largest grid minor, combinatorial polylogarithmic approximation to half-integral multicommodity flow, subexponential fixed-parameter algorithms, and PTASs for many minimization and maximization problems, on graphs excluding a fixed minor.}, keywords = {algorithmic graph minor theory, approximation algorithm, combinatorial polylogarithmic approximation, computational complexity, constant-factor approximation, graph algorithm, graph coloring, graph colouring, half-integral multicommodity flow, largest grid minor, maximization problem, minimization problem, polynomial-time algorithm, subexponential fixed-parameter algorithm, topological graph theory, treewidth}, doi = {10.1109/SFCS.2005.14}, author = {Demaine,E. D and Hajiaghayi, Mohammad T. and Kawarabayashi,K.} } @article {18752, title = {Algorithms for constructing 3-D point clouds using multiple digital fringe projection patterns}, journal = {Computer-Aided Design and Applications}, volume = {2}, year = {2005}, month = {2005///}, pages = {737 - 746}, abstract = {This paper describes algorithms for generating 3-D point clouds from a set of digital imagesobtained from projecting phase-shifted sinusoidal fringe patterns onto object. In this paper, a mathematical model is introduced for describing the geometric relationship between the fringe patterns being projected, the image captured and the shape of the object being measured. This model allows considerable flexibility in the spatial configuration of shape measurement system. The algorithms for point cloud construction described in this paper present an improvement over the existing algorithms in terms of accuracy, ease of system calibration, and sensitivity to parameter errors. These algorithms have been incorporated in a shape measurement system and shown to have a very good performance. }, url = {http://cadanda.homestead.com/V2No6_04.pdf}, author = {Peng,T. and Gupta,S.K. and Lau,K.} } @conference {13722, title = {Alignment link projection using transformation-based learning}, booktitle = {Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing}, series = {HLT {\textquoteright}05}, year = {2005}, month = {2005///}, pages = {185 - 192}, publisher = {Association for Computational Linguistics}, organization = {Association for Computational Linguistics}, address = {Stroudsburg, PA, USA}, abstract = {We present a new word-alignment approach that learns errors made by existing word alignment systems and corrects them. By adapting transformation-based learning to the problem of word alignment, we project new alignment links from already existing links, using features such as POS tags. We show that our alignment link projection approach yields a significantly lower alignment error rate than that of the best performing alignment system (22.6\% relative reduction on English-Spanish data and 23.2\% relative reduction on English-Chinese data).}, doi = {10.3115/1220575.1220599}, url = {http://dx.doi.org/10.3115/1220575.1220599}, author = {Ayan,Necip Fazil and Dorr, Bonnie J and Monz,Christof} } @conference {17895, title = {And away we go: understanding the complexity of launching complex HPC applications}, booktitle = {Proceedings of the second international workshop on Software engineering for high performance computing system applications}, series = {SE-HPCS {\textquoteright}05}, year = {2005}, month = {2005///}, pages = {45 - 49}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Although not well-studied, launching HPC applications is extremely complex. To better understand the launching process, we conducted a simple case study. Based in part on this study and an examination of existing toolkits, we have begun to develop a prototype environment to support HPC application launching.}, keywords = {development, high-performance, Productivity, software}, isbn = {1-59593-117-1}, doi = {10.1145/1145319.1145333}, url = {http://doi.acm.org/10.1145/1145319.1145333}, author = {Yoon,Il-Chul and Sussman, Alan and Porter, Adam} } @article {14240, title = {On the Anisotropy in the Perception of Stereoscopic Slant}, journal = {Journal of VisionJ Vis}, volume = {5}, year = {2005}, month = {2005/09/23/}, pages = {516 - 516}, abstract = {Many visual processes computationally amount to estimation problems. It has been shown that noise in the image data causes consistent errors in the estimation, that is statistical bias [1]. Here we analyze the effects of bias on 3D shape estimation, and we found that it predicts the perceived underestimation of slant for many settings found in experiments.In particular, we concentrate on the problem of shape estimation from stereo using orientation disparity. We found that bias predicts the anisotropy in the perception of stereoscopic slant, an effect that has not been explained before. It has been found that a surface slanted about the horizontal axis is estimated much easier and more accurately than a surface slanted about the vertical axis [2,3]. In both cases there is an underestimation of slant, but it is much larger for slant about the vertical. Cagnello and Rogers [2] argued that this effect is due to orientation disparity, which when the texture on the plane is made up of mostly horizontal and vertical lines, is smaller for surfaces slanting about the vertical. However as shown in [3], the effect also exists, even though in weaker form, when the texture is made up of lines oriented at 45 degrees. For such a configuration the orientation disparity in the two configurations is about the same. Thus orientation disparity by itself cannot be the cause. But errors in the estimated position and orientation of edgels cause bias, which predicts all the above findings and other parametric studies that we performed. [1]. C. Fermuller, H. Malm. Uncertainty in visual processes predicts geometrical optical illusions, Vision Research, 44, 727-749, 2004. [2]. R. Cagnello, B.J.Rogers. Anisotropies in the perception of stereoscopic surfaces: the role of orientation disparity. Vision Research, 33>(16): 2189-2201, 1993. [3]. G.J. Mitchison. S.P. McKee. Mechannisms underlying the anisotropy of stereoscopic tilt perception. Vision Research, 30:1781-1791, 1990. }, isbn = {, 1534-7362}, doi = {10.1167/5.8.516}, url = {http://www.journalofvision.org/content/5/8/516}, author = {Ferm{\"u}ller, Cornelia and Hui Ji} } @article {18168, title = {Anti-collusion forensics of multimedia fingerprinting using orthogonal modulation}, journal = {Image Processing, IEEE Transactions on}, volume = {14}, year = {2005}, month = {2005/06//}, pages = {804 - 821}, abstract = {Digital fingerprinting is a method for protecting digital data in which fingerprints that are embedded in multimedia are capable of identifying unauthorized use of digital content. A powerful attack that can be employed to reduce this tracing capability is collusion, where several users combine their copies of the same content to attenuate/remove the original fingerprints. In this paper, we study the collusion resistance of a fingerprinting system employing Gaussian distributed fingerprints and orthogonal modulation. We introduce the maximum detector and the thresholding detector for colluder identification. We then analyze the collusion resistance of a system to the averaging collusion attack for the performance criteria represented by the probability of a false negative and the probability of a false positive. Lower and upper bounds for the maximum number of colluders Kmax are derived. We then show that the detectors are robust to different collusion attacks. We further study different sets of performance criteria, and our results indicate that attacks based on a few dozen independent copies can confound such a fingerprinting system. We also propose a likelihood-based approach to estimate the number of colluders. Finally, we demonstrate the performance for detecting colluders through experiments using real images.}, keywords = {Automated;Product Labeling;Signal Processing, Computer-Assisted;, Computer-Assisted;Multimedia;Patents as Topic;Pattern Recognition, Gaussian distribution;anticollusion forensic;colluder identification;collusion resistance;digital fingerprinting;false probability;likelihood-based approach;multimedia fingerprinting;orthogonal modulation;spread spectrum embedding;Gaussian distribution;fi}, isbn = {1057-7149}, doi = {10.1109/TIP.2005.847284}, author = {Wang,Z.J. and M. Wu and Zhao,H.V. and Trappe,W. and Liu,K. J.R} } @article {13498, title = {AParallel-Line Detection Algorithm Based on HMMDecoding}, journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {27}, year = {2005}, month = {2005/05//}, pages = {777 - 792}, abstract = {The detection of groups of parallel lines is important in applications such as form processing and text (handwriting) extraction from rule lined paper. These tasks can be very challenging in degraded documents where the lines are severely broken. In this paper we propose a novel model-based method which incorporates high level context to detect these lines. After preprocessing (such as skew correction and text filtering), we use trained Hidden Markov Models (HMM) to locate the optimal positions of all lines simultaneously on the horizontal or vertical projection profiles, based on the Viterbi decoding. The algorithm is trainable so it can be easily adapted to different application scenarios. The experiments conducted on known form processing and rule line detection show our method is robust, and achieves better results than other widely used line detection methods.}, author = {Yefeng Zheng and Huiping Li and David Doermann} } @conference {12649, title = {Appearance modeling under geometric context}, booktitle = {Computer Vision, 2005. ICCV 2005. Tenth IEEE International Conference on}, volume = {2}, year = {2005}, month = {2005/10//}, pages = {1252 -1259 Vol. 2 - 1252 -1259 Vol. 2}, abstract = {We propose a unified framework based on a general definition of geometric transform (GeT) for modeling appearance. GeT represents the appearance by applying designed functionals over certain geometric sets. We show that image warping, Radon transform, trace transform, etc. are special cases of our definition. Moreover, three different types of GeTs are designed to handle deformation, articulation and occlusion and applied to fingerprinting the appearance inside a contour. They include the contour-driven GeT, the feature curve based GeT and selecting functionals to model the appearance inside the convex hull of the contour. A multi-resolution representation that combines both shape and appearance information is also proposed. We apply our approach to image synthesis and object recognition. The proposed approach produces promising results when applied to fingerprinting the appearance of human and body parts despite the challenges due to articulated motion and deformations}, keywords = {based, curve, geometry;image, GeT;convex, GeT;fingerprinting;geometric, hull;feature, information;trace, modeling;contour-driven, Radon, recognition;, recognition;shape, representation;object, synthesis;image, transform;appearance, transform;image, transform;Radon, transforms;computational, warping;multi-resolution}, doi = {10.1109/ICCV.2005.38}, author = {Li,Jian and Zhou,S. K and Chellapa, Rama} } @article {18893, title = {Applications of SHOP and SHOP2}, journal = {Intelligent Systems, IEEE}, volume = {20}, year = {2005}, month = {2005/04//march}, pages = {34 - 41}, abstract = {We design the simple hierarchical ordered planner (SHOP) and its successor, SHOP2, with two goals in mind: to investigate research issues in automated planning and to provide some simple, practical planning tools. SHOP and SHOP2 are based on a planning formalism called hierarchical task network planning. SHOP and SHOP2 use a search-control strategy called ordered task decomposition, which breaks tasks into subtasks and generates the plan{\textquoteright}s actions in the same order that the plan executor executes them. So, throughout the planning process, the planner can tell what the state of the world at each step of the plan.}, keywords = {automated planning, hierarchical task network planning, ordered task decomposition, planning (artificial intelligence), problem solving, search-control strategy, simple hierarchical ordered planner, trees (mathematics), uncertainty handling}, isbn = {1541-1672}, doi = {10.1109/MIS.2005.20}, author = {Nau, Dana S. and Au,T.-C. and Ilghami,O. and Kuter,U. and Wu,D. and Yaman,F. and Munoz-Avila,H. and Murdock,J. W.} } @conference {14024, title = {Approximate expressions for the mean and the covariance of the maximum likelihood estimator for acoustic source localization}, booktitle = {Acoustics, Speech, and Signal Processing, 2005. Proceedings. (ICASSP {\textquoteright}05). IEEE International Conference on}, volume = {3}, year = {2005}, month = {2005/03//}, pages = {iii/73 - iii/76 Vol. 3 - iii/73 - iii/76 Vol. 3}, abstract = {Acoustic source localization using multiple microphones can be formulated as a maximum likelihood estimation problem. The estimator is implicitly defined as the minimum of a certain objective function. As a result, we cannot get explicit expressions for the mean and the covariance of the estimator. We derive approximate expressions for the mean vector and covariance matrix of the estimator using Taylor{\textquoteright}s series expansion of the implicitly defined estimator. The validity of our expressions is verified by Monte-Carlo simulations. We also study the performance of the estimator for different microphone array configurations.}, keywords = {(mathematics);, acoustic, approximate, approximation, array, array;, covariance, estimation;, expansion;, expressions;, function;, likelihood, localization;, matrices;, matrix;, maximum, mean, microphone, objective, processing;, series, signal, source, Taylor, theory;, vector;, vectors;}, doi = {10.1109/ICASSP.2005.1415649}, author = {Raykar,V.C. and Duraiswami, Ramani} } @conference {17789, title = {Approximation results for probabilistic survivability}, booktitle = {Multi-Agent Security and Survivability, 2005 IEEE 2nd Symposium on}, year = {2005}, month = {2005/08//}, pages = {1 - 10}, abstract = {As multiagent systems (MASs) are increasingly used in industrial applications, the need to make them more robust and resilient against disruption increases dramatically. The author has developed a probabilistic model (assuming complete ignorance of dependencies between node failures) of survivability based on deploying each agent in a MAS on one or more nodes. Finding a deployment that maximizes survivability is highly intractable for two reasons: firstly, computing the survivability of any deployment is intractable, and secondly, going through an exponential number of deployments to find the best one adds another layer of intractability. In this paper, we study what happens when node failures are independent. We show that computing survivability in this environment is still intractable. We propose various heuristics to compute the survivability of a given deployment. We have implemented and tested all these heuristics. We report on the advantages and disadvantages of different heuristics in different environmental settings.}, keywords = {application;, computing;, failure;, fault, heuristic, heuristics, industrial, model;, multi-agent, multiagent, node, probabilistic, probability;, programming;, survivability;, system;, systems;, testing;, tolerant}, doi = {10.1109/MASSUR.2005.1507042}, author = {Zhang,Y. and Manister,E. and Kraus,S. and V.S. Subrahmanian} } @inbook {19486, title = {Architecting and Implementing Versatile Dependability}, booktitle = {Architecting Dependable Systems III}, series = {Lecture Notes in Computer Science}, year = {2005}, month = {2005/01/01/}, pages = {212 - 231}, publisher = {Springer Berlin Heidelberg}, organization = {Springer Berlin Heidelberg}, abstract = {Distributed applications must often consider and select the appropriate trade-offs among three important aspects {\textendash} fault-tolerance, performance and resources. We introduce a novel concept, called versatile dependability, that provides a framework for analyzing and reasoning about these trade-offs in dependable software architectures. We present the architecture of a middleware framework that implements versatile dependability by providing the appropriate {\textquotedblright}knobs{\textquotedblright} to tune and re-calibrate the trade-offs. Our framework can adjust the properties and the behavior of the system at development-time, at deployment-time, and throughout the application{\textquoteright}s life-cycle. This renders the versatile dependability approach useful both to applications that require static fault-tolerance configurations supporting the loss/addition of resources and changing workloads, as well as to applications that evolve in terms of their dependability requirements. Through a couple of specific examples, one on adapting the replication style at runtime and the other on tuning the system scalability under given constraints, we demonstrate concretely how versatile dependability can provide an extended coverage of the design space of dependable distributed systems.}, keywords = {Operating systems, software engineering}, isbn = {978-3-540-28968-5, 978-3-540-31648-0}, url = {http://link.springer.com/chapter/10.1007/11556169_10}, author = {Tudor Dumitras and Srivastava, Deepti and Narasimhan, Priya}, editor = {Lemos, Rog{\'e}rio de and Gacek, Cristina and Romanovsky, Alexander} } @conference {12673, title = {An architectural level design methodology for embedded face detection}, booktitle = {Proceedings of the 3rd IEEE/ACM/IFIP international conference on Hardware/software codesign and system synthesis}, series = {CODES+ISSS {\textquoteright}05}, year = {2005}, month = {2005///}, pages = {136 - 141}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Face detection and recognition research has attracted great attention in recent years. Automatic face detection has great potential in a large array of application areas, including banking and security system access control, video surveillance, and multimedia information retrieval. In this paper, we discuss an architectural level design methodology for implementation of an embedded face detection system on a reconfigurable system on chip. We present models for performance estimation and validate these models with experimental values obtained from implementing our system on an FPGA platform. This modeling approach is shown to be efficient, accurate, and intuitive for designers to work with. Using this approach, we present several design options that trade-off various architectural features.}, keywords = {design space exploration, Face detection, platforms, reconfigurable, system-level models}, isbn = {1-59593-161-9}, doi = {10.1145/1084834.1084872}, url = {http://doi.acm.org/10.1145/1084834.1084872}, author = {Kianzad,V. and Saha,S. and Schlessman,J. and Aggarwal,G. and Bhattacharyya, Shuvra S. and Wolf,W. and Chellapa, Rama} } @conference {14325, title = {Are GSM phones THE solution for localization?}, booktitle = {Mobile Computing Systems and Applications, 2006. WMCSA{\textquoteright}06. Proceedings. 7th IEEE Workshop on}, year = {2005}, month = {2005///}, pages = {34 - 42}, author = {Varshavsky,A. and Chen,M.Y. and de Lara,E. and Jon Froehlich and Haehnel,D. and Hightower,J. and LaMarca,A. and Potter,F. and Sohn,T. and Tang,K. and others} } @article {15331, title = {Assessment of STBLI DNS data and comparison against experiments}, journal = {AIAA paper}, year = {2005}, month = {2005///}, author = {Wu,M. and Taylor,E. M and Martin, M.P} } @article {15718, title = {Asymptotically Optimal Quantum Circuits for d-Level Systems}, journal = {Physical Review LettersPhys. Rev. Lett.}, volume = {94}, year = {2005}, month = {2005/06/14/}, pages = {230502 - 230502}, abstract = {Scalability of a quantum computation requires that the information be processed on multiple subsystems. However, it is unclear how the complexity of a quantum algorithm, quantified by the number of entangling gates, depends on the subsystem size. We examine the quantum circuit complexity for exactly universal computation on many d-level systems (qudits). Both a lower bound and a constructive upper bound on the number of two-qudit gates result, proving a sharp asymptotic of Θ(d2n) gates. This closes the complexity question for all d-level systems (d finite). The optimal asymptotic applies to systems with locality constraints, e.g., nearest neighbor interactions.}, doi = {10.1103/PhysRevLett.94.230502}, url = {http://link.aps.org/doi/10.1103/PhysRevLett.94.230502}, author = {Bullock,Stephen S. and O{\textquoteright}Leary,Dianne P. and Brennen,Gavin K.} } @article {16961, title = {An Augmented Visual Query Mechanism for Finding Patterns in Time Series Data (2002)}, journal = {Institute for Systems Research Technical Reports}, year = {2005}, month = {2005///}, abstract = {Relatively few query tools exist for data exploration and pattern identification in time series data sets. In previous work we introduced Timeboxes. Timeboxes are rectangular, direct-manipulation queries for studying time-series datasets. We demonstrated how Timeboxes can be used to support interactive exploration via dynamic queries, along with overviews of query results and drag-and-drop support for query-by-example. In this paper, we extend our work by introducing Variable Time Timeboxes (VTT). VTTs are a natural generalization of Timeboxes, which permit the specification of queries that allow a degree of uncertainty in the time axis. We carefully motivate the need for these more expressive queries, and demonstrate the utility of our approach on several data sets.}, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/6495}, author = {Keogh,Eamonn and Hochheiser,Harry and Shneiderman, Ben} } @conference {18665, title = {Automated checking for Windows host vulnerabilities}, year = {2005}, month = {2005/11//}, pages = {10 pp. -148 - 10 pp. -148}, abstract = {Evaluation of computing system security requires knowledge of the vulnerabilities present in the system and of potential attacks against the system. Vulnerabilities can be classified based on their location as application vulnerabilities, network vulnerabilities, or host vulnerabilities. This paper describes Ferret-Windows, a new software tool for checking host vulnerabilities on the Windows platforms. This tool helps system administrators by quickly finding vulnerabilities that are present on a host. It is designed and implemented in a modular way: a plug-in module is used for each vulnerability checked, and each possible output format is specified by a plug-in module. Moreover, several vulnerability fixing plug-in modules exist to help users remove specific vulnerabilities. As a result, Ferret-Windows is extensible, and can easily be kept up-to-date through the addition of checks for new vulnerabilities as they are identified. Finally, Ferret-Windows is a freely available open-source software}, keywords = {application vulnerabilities, computing system security, Ferret-Windows software tool, host vulnerabilities, network vulnerabilities, open-source software, operating systems (computers), plug-in module, program diagnostics, security of data, software reliability, software tools, system attacks, Windows host vulnerability checking, Windows platforms}, doi = {10.1109/ISSRE.2005.11}, author = {Tamizi,M. and Weinstein,M. and Michel Cukier} } @article {14798, title = {Automatic Mining of Source Code Repositories to Improve Bug Finding Techniques}, journal = {IEEE Transactions on Software Engineering}, volume = {31}, year = {2005}, month = {2005///}, pages = {466 - 480}, abstract = {We describe a method to use the source code change history of a software project to drive and help to refine the search for bugs. Based on the data retrieved from the source code repository, we implement a static source code checker that searches for a commonly fixed bug and uses information automatically mined from the source code repository to refine its results. By applying our tool, we have identified a total of 178 warnings that are likely bugs in the Apache Web server source code and a total of 546 warnings that are likely bugs in Wine, an open-source implementation of the Windows API. We show that our technique is more effective than the same static analysis that does not use historical data from the source code repository.}, keywords = {configuration control, debugging aids., index terms- testing tools, version control}, isbn = {0098-5589}, doi = {http://doi.ieeecomputersociety.org/10.1109/TSE.2005.63}, author = {Williams, Chadd C and Hollingsworth, Jeffrey K} } @article {15445, title = {Automating regression testing for evolving GUI software}, journal = {Journal of Software Maintenance and Evolution: Research and Practice}, volume = {17}, year = {2005}, month = {2005///}, pages = {27 - 64}, abstract = {With the widespread deployment of broadband connections worldwide, software development and maintenance are increasingly being performed by multiple engineers, often working around-the-clock to maximize code churn rates. To ensure rapid quality assurance of such software, techniques such as {\textquoteleft}nightly/daily building and smoke testing{\textquoteright} have become widespread since they often reveal bugs early in the software development process. During these builds, a development version of the software is checked out from the source code repository tree, compiled, linked, and (re)tested with the goal of (re)validating its basic functionality. Although successful for conventional software, smoke tests are difficult to develop and automatically re-run for software that has a graphical user interface (GUI). In this paper, we describe a framework called DART (Daily Automated Regression Tester) that addresses the needs of frequent and automated re-testing of GUI software. The key to our success is automation: DART automates everything from structural GUI analysis, smoke-test-case generation, test-oracle creation, to code instrumentation, test execution, coverage evaluation, regeneration of test cases, and their re-execution. Together with the operating system{\textquoteright}s task scheduler, DART can execute frequently with little input from the developer/tester to re-test the GUI software. We provide results of experiments showing the time taken and memory required for GUI analysis, test case and test oracle generation, and test execution. We empirically compare the relative costs of employing different levels of detail in the GUI test oracle. We also show the events and statements covered by the smoke test cases. Copyright {\textcopyright} 2005 John Wiley \& Sons, Ltd.}, keywords = {daily/nightly builds, event-flow graphs, Graphical user interfaces, GUI regression testing, GUI testing, smoke testing, Software quality}, isbn = {1532-0618}, doi = {10.1002/smr.305}, url = {http://onlinelibrary.wiley.com/doi/10.1002/smr.305/abstract}, author = {Memon, Atif M. and Nagarajan,Adithya and Xie,Qing} } @conference {12655, title = {Average relative radiance transform for subpixel detection}, booktitle = {Geoscience and Remote Sensing Symposium, 2005. IGARSS {\textquoteright}05. Proceedings. 2005 IEEE International}, volume = {5}, year = {2005}, month = {2005/07//}, pages = {3565 - 3568}, doi = {10.1109/IGARSS.2005.1526617}, author = {Broadwater, J. and Meth, R. and Chellapa, Rama} } @conference {12978, title = {Abstracting workflows: unifying bioinformatics task conceptualization and specification through Semantic Web services}, booktitle = {W3C Workshop on Semantic Web for Life Sciences}, year = {2004}, month = {2004///}, address = {Cambridge, Massachusetts USA}, author = {Hashmi,N. and Lee,S. and Cummings, Michael P.} } @article {18460, title = {Accelerated speech source localization via a hierarchical search of steered response power}, journal = {IEEE Transactions on Speech and Audio Processing}, volume = {12}, year = {2004}, month = {2004/09//}, pages = {499 - 508}, abstract = {Accurate and fast localization of multiple speech sound sources is a problem that is of significant interest in applications such as conferencing systems. Recently, approaches that are based on search for local peaks of the steered response power are becoming popular, despite their known computational expense. Based on the observation that the wavelengths of the sound from a speech source are comparable to the dimensions of the space being searched and that the source is broadband, we have developed an efficient search algorithm. Significant speedups are achieved by using coarse-to-fine strategies in both space and frequency. We present applications of the search algorithm to speed up simple delay-and-sum beamforming and steered response power phase-transform weighted (SRP-PHAT) source localization algorithms. A systematic series of comparisons with previous algorithms are made that show that the technique is much faster, robust, and accurate. The performance of the algorithm can be further improved by using constraints from computer vision.}, keywords = {accelerated speech source localization, Acceleration, array signal processing, conferencing system, Delay, delay-and-sum beamforming, direction-of-arrival estimation, Frequency, hierarchical search algorithm, Inverse problems, multimedia applications, Multimedia communication, multiple speech sound source, Position measurement, Robustness, search problems, Sensor arrays, Signal processing algorithms, speech, speech enhancement, Speech processing, steered response power, steered response power phase-transform weighted source localization algorithm, transducer arrays, User interfaces}, isbn = {1063-6676}, doi = {10.1109/TSA.2004.832990}, author = {Zotkin,Dmitry N and Duraiswami, Ramani} } @conference {12086, title = {Achieving packet-level quality of service through scheduling in multirate WLANs}, booktitle = {Vehicular Technology Conference, 2004. VTC2004-Fall. 2004 IEEE 60th}, volume = {4}, year = {2004}, month = {2004/09/26/29}, pages = {2730- 2734 Vol. 4 - 2730- 2734 Vol. 4}, publisher = {IEEE}, organization = {IEEE}, abstract = {Wireless packet scheduling has been a popular paradigm to achieve packet-level QoS in terms of fairness and throughput in the presence of channel errors. However, the current design does not anticipate the multi-rate capability offered by the IEEE 802.11a/b/g physical layer, thus suffering significant performance degradation in 802.11 WLANs. In this paper, we propose multirate wireless fair scheduling (WMFS). In MWFS, each flow is granted a temporal fair share of the channel, in contrast to the throughput fair share adopted by existing algorithms. Therefore, each flow receives services in proportion to its perceived transmission rate, and high-rate flows are able to opportunistically exploit their good channel conditions and receive more services. MWFS also renovates the compensation model in order to allow for error-prone flows to catch up, thus ensuring fairness for all flows over error-prone channels. We demonstrate the effectiveness of MWFS through both simulations and analysis. Especially, WMFS achieves system throughput 159\% of state-of-the-art scheduling algorithms in simulated scenarios.}, keywords = {Analytical models, channel conditions, channel errors, channel temporal fair share, compensation, Computer science, Delay, error-prone flow compensation, IEEE 802.11a/b/g physical layer, multirate wireless fair scheduling, multirate WLAN, packet radio networks, packet-level quality of service, Physical layer, Processor scheduling, QoS, quality of service, radio access networks, Scheduling algorithm, Throughput, throughput fairness, USA Councils, Wireless LAN, wireless packet scheduling, WMFS}, isbn = {0-7803-8521-7}, doi = {10.1109/VETECF.2004.1400554}, author = {Yuan Yuan and Daqing Gu and Arbaugh, William A. and Jinyun Zhang} } @article {12941, title = {Acinetobacter lipases: molecular biology, biochemical properties and biotechnological potential}, journal = {Journal of industrial microbiology \& biotechnology}, volume = {31}, year = {2004}, month = {2004///}, pages = {391 - 400}, abstract = {Lipases (EC 3.1.1.3) have received increased attention recently, evidenced by the increasing amount of information about lipases in the current literature. The renewed interest in this enzyme class is due primarily to investigations of their role in pathogenesis and their increasing use in biotechnological applications [38]. Also, many microbial lipases are available as commercial products, the majority of which are used in detergents, cosmetic production, food flavoring, and organic synthesis. Lipases are valued biocatalysts because they act under mild conditions, are highly stable in organic solvents, show broad substrate specificity, and usually show high regio- and/or stereo-selectivity in catalysis. A number of lipolytic strains of Acinetobacter have been isolated from a variety of sources and their lipases possess many biochemical properties similar to those that have been developed for biotechnological applications. This review discusses the biology of lipase expression in Acinetobacter, with emphasis on those aspects relevant to potential biotechnology applications.}, doi = {10.1007/s10295-004-0167-0}, author = {Snellman,E. A. and Rita R Colwell} } @article {11898, title = {Active deformable models using density estimation}, journal = {International Journal of Image and Graphics}, volume = {4}, year = {2004}, month = {2004///}, pages = {343 - 362}, author = {Abd-Almageed, Wael and Smith,C.E.} } @conference {16003, title = {Active logic for more effective human-computer interaction and other commonsense applications}, booktitle = {Proceedings of the Workshop Empirically Successful First-Order Reasoning, International Joint Conference on Automated Reasoning}, year = {2004}, month = {2004///}, author = {Anderson,M. L and Josyula,D. and Perlis, Don and Purang,K.} } @article {13417, title = {Adapting network structure for efficient team formation}, journal = {Proceedings of the AAAI 2004 Fall Symposium on Artificial Multi-agent Learning}, year = {2004}, month = {2004///}, author = {Gaston,M. and Simmons,J. and desJardins, Marie} } @article {13489, title = {Adaptive Hindi OCRUsing Generalized Hausdorff Image Comparison}, journal = {ACMTransactions on Asian Language Information Processing}, volume = {26}, year = {2004}, month = {2004///}, pages = {198 - 213}, author = {Ma,Huanfeng and David Doermann} } @conference {14559, title = {Adaptive limited-supply online auctions}, booktitle = {Proceedings of the 5th ACM Conference on Electronic Commerce}, year = {2004}, month = {2004///}, pages = {71 - 80}, author = {Hajiaghayi, Mohammad T. and Kleinberg,R. and Parkes,D. C} } @conference {12296, title = {Adaptive replication in peer-to-peer systems}, booktitle = {Distributed Computing Systems, 2004. Proceedings. 24th International Conference on}, year = {2004}, month = {2004///}, pages = {360 - 369}, abstract = {Peer-to-peer systems can be used to form a low-latency decentralized data delivery system. Structured peer-to-peer systems provide both low latency and excellent load balance with uniform query and data distributions. Under the more common skewed access distributions, however, individual nodes are easily overloaded, resulting in poor global performance and lost messages. This paper describes a lightweight, adaptive, and system-neutral replication protocol, called LAR, that maintains low access latencies and good load balance even under highly skewed demand. We apply LAR to Chord and show that it has lower overhead and better performance than existing replication strategies.}, keywords = {adaptive, allocation;, data, databases;, decentralized, delivery, distributed, LAR, low-latency, peer-to-peer, processing;, protocol;, replicated, replication, resource, strategies;, structured, system-neutral, system;, systems;}, doi = {10.1109/ICDCS.2004.1281601}, author = {Gopalakrishnan,V. and Silaghi,B. and Bhattacharjee, Bobby and Keleher,P.} } @inbook {15129, title = {Adaptively-Secure, Non-Interactive Public-Key Encryption}, booktitle = {Model reduction methods for vector autoregressive processes}, year = {2004}, month = {2004///}, pages = {150 - 150}, author = {Canetti,R. and Halevi,S. and Katz, Jonathan} } @article {14075, title = {Advances in schistosome genomics}, journal = {Trends in Parasitology}, volume = {20}, year = {2004}, month = {2004/04/01/}, pages = {154 - 157}, abstract = {In Spring 2004, the first draft of the 270~Mb genome of Schistosoma mansoni will be released. This sequence is based on the assembly and annotation of a >7.5-fold coverage, shotgun sequencing project. The key stages involved in the international collaborative efforts that have led to the generation of these sequencing data for the parasite S. mansoni are discussed here.}, isbn = {1471-4922}, doi = {16/j.pt.2004.02.002}, url = {http://www.sciencedirect.com/science/article/pii/S1471492204000480}, author = {El-Sayed, Najib M. and Bartholomeu,Daniella and Ivens,Alasdair and Johnston,David A. and LoVerde,Philip T.} } @article {16392, title = {Agent-based and analytical modeling to evaluate the effectiveness of greenbelts}, journal = {Environmental Modelling \& Software}, volume = {19}, year = {2004}, month = {2004/12//}, pages = {1097 - 1109}, abstract = {We present several models of residential development at the rural{\textendash}urban fringe to evaluate the effectiveness of a greenbelt located beside a developed area, for delaying development outside the greenbelt. First, we develop a mathematical model, under two assumptions about the distributions of service centers, that represents the trade-off between greenbelt placement and width, their effects on the rate of development beyond the greenbelt, and how these interact with spatial patterns of aesthetic quality and the locations of services. Next, we present three agent-based models (ABMs) that include agents with the potential for heterogeneous preferences and a landscape with the potential for heterogeneous attributes. Results from experiments run with a one-dimensional ABM agree with the starkest of the results from the mathematical model, strengthening the support for both models. Further, we present two different two-dimensional ABMs and conduct a series of experiments to supplement our mathematical analysis. These include examining the effects of heterogeneous agent preferences, multiple landscape patterns, incomplete or imperfect information available to agents, and a positive aesthetic quality impact of the greenbelt on neighboring locations. These results suggest how width and location of the greenbelt could help determine the effectiveness of greenbelts for slowing sprawl, but that these relationships are sensitive to the patterns of landscape aesthetic quality and assumptions about service center locations.}, keywords = {Agent-based modeling, Land-use change, Landscape ecology, Urban sprawl}, isbn = {1364-8152}, doi = {10.1016/j.envsoft.2003.11.012}, url = {http://www.sciencedirect.com/science/article/pii/S1364815203002664}, author = {Brown,Daniel G. and Page,Scott E. and Riolo,Rick and Rand, William} } @article {17803, title = {An algebra for powerpoint sources}, journal = {Multimedia Tools and Applications}, volume = {24}, year = {2004}, month = {2004///}, pages = {273 - 301}, abstract = {There are now millions of PowerPoint documents available within corporate intranets and/or over the Internet. In this paper, we develop a formal model of PowerPoint databases. We propose a relational style algebra called pptA (PowerPoint Algebra) to query PowerPoint databases. The algebra contains some new operators (such as the APPLY operator that changes properties of objects, slides and presentations) as well as interesting twists on relational operators (e.g. join and cartesian product allow different entities being joined together to share attributes whose values may be merged). We prove a set of equivalence results within this algebra. We have implemented a version of pptA{\textemdash}the paper provides a cost model and experimental results on the conditions under which these equivalences are useful.}, doi = {10.1023/B:MTAP.0000039422.87260.52}, author = {Fayzullin,M. and V.S. Subrahmanian} } @conference {18792, title = {Algorithmic Foundations for Consistency-Checking of Interaction-States of Mechatronic Systems}, year = {2004}, month = {2004///}, address = {Salt Lake City, Utah, USA}, abstract = {In order to reduce product development time, we needsoftware tools that can perform automated validation of the proposed design concepts. These tools will ensure that only valid design concepts are transferred to the detailed design stage for further development. This paper provides a step towards the automated validation of proposed design concepts. We define the problem of consistency-checking of interaction- states as a key step in the design concept validation. We present a polynomial time algorithm for solving the interaction consistency-checking problem. We also present an algorithm for analyzing inconsistent interaction-states and identifying the inconsistent interactions. We believe that the framework described in this paper will provide the underlying foundations for constructing the next generation software tools for conceptual design of complex mechatronic systems. }, url = {ftp://ftp.eng.umd.edu/:/home/glue/s/k/skgupta/pub/Publication/DETC04_Xu.pdf}, author = {Xu,C. and Gupta,S.K.} } @article {12361, title = {Analysis of dataflow programs with interval-limited data-rates}, journal = {Computer Systems: Architectures, Modeling, and Simulation}, year = {2004}, month = {2004///}, pages = {507 - 518}, author = {Teich,J. and Bhattacharyya, Shuvra S.} } @inbook {15666, title = {Analyzing the number of samples required for an approximate Monte-Carlo LMS line estimator}, booktitle = {Theory and Applications of Recent Robust MethodsTheory and Applications of Recent Robust Methods}, year = {2004}, month = {2004///}, pages = {207 - 219}, publisher = {Birkh{\"a}user}, organization = {Birkh{\"a}user}, isbn = {3764370602, 9783764370602}, author = {Mount, Dave and Netanyahu,N. S and Zuck,E.} } @article {12710, title = {Appearance tracking using adaptive models in a particle filter}, journal = {Proc. of 6th Asian Conference on Computer Vision (ACCV)}, year = {2004}, month = {2004///}, abstract = {The particle filter is a popular tool for visual tracking. Usually, the appearance model is eitherfixed or rapidly changing and the motion model is simply a random walk with fixed noise vari- ance. Also, the number of particles used is typically fixed. All these factors make the visual tracker unstable. To stabilize the tracker, we propose the following measures: an observation model arising from an adaptive noise variance, and adaptive number of particles. The adaptive- velocity is computed via a first-order linear predictor using the previous particle configuration. Tracking under occlusion is accomplished using robust statistics. Experimental results on track- ing visual objects in long video sequences such as vehicles, tank, and human faces demonstrate the effectiveness and robustness of our algorithm. }, author = {Zhou, S. and Chellapa, Rama and Moghaddam, B.} } @article {13495, title = {An Appearance-based Approach for Consistent Labeling of Humans and Objects in Video}, journal = {Pattern Analysis and Applications}, year = {2004}, month = {2004/11//}, pages = {1433 - 7541}, abstract = {We present an approach for consistently labeling people and for detecting human-object interactions using mono-camera surveillance video. The approach is based on a robust appearance based correlogram model which is combined with histogram information to model color distributions of people and objects in the scene. The models are dynamically built from non-stationary objects which are the outputs of background subtraction, and are used to identify objects on a frame-by-frame basis. We are able to detect when people merge into groups and to segment them even during partial occlusion. We can also detect when a person deposits or removes an object. The models persist when a person or object leaves the scene and are used to identify them when they reappear. Experiments show that the models are able to accommodate perspective foreshortening that occurs with overhead camera angles, as well as partial occlusion. The results show that this is an effective approach able to provide important information to algorithms performing higher-level analysis such as activity recognition, where human-object interactions play an important role.}, author = {Balcells-Capellades,M. and DeMenthon,D. and David Doermann} } @conference {12703, title = {Appearance-based tracking and recognition using the 3D trilinear tensor}, booktitle = {Acoustics, Speech, and Signal Processing, 2004. Proceedings. (ICASSP {\textquoteright}04). IEEE International Conference on}, volume = {3}, year = {2004}, month = {2004/05//}, pages = {iii - 613-16 vol.3 - iii - 613-16 vol.3}, abstract = {The paper presents an appearance-based adaptive algorithm for simultaneous tracking and recognition by generalizing the transformation model to 3D perspective transformation. A trilinear tensor operator is used to represent the 3D geometrical structure. The tensor is estimated by predicting the corresponding points using the existing affine-transformation based algorithm. The estimated tensor is used to synthesize novel views to update the appearance templates. Some experimental results using airborne video are presented.}, keywords = {3D, adaptive, affine-transformation, airborne, algorithm;, appearance, appearance-based, based, estimation;, geometrical, image, mathematical, novel, object, operator;, operators;, perspective, prediction;, processing;, recognition;, representation;, signal, structure, synthesis;, template, tensor, tensor;, tensors;, tracking;, transformation;, trilinear, updating;, video, video-based, video;, view}, doi = {10.1109/ICASSP.2004.1326619}, author = {Jie Shao and Zhou,S. K and Chellapa, Rama} } @article {15439, title = {Applying Model-based Distributed Continuous Quality Assurance Processes to Enhance Persistent Software Attributes}, journal = {IEEE Software}, volume = {21}, year = {2004}, month = {2004///}, pages = {32 - 40}, abstract = {Time and resource constraints often force developers of highlyconfigurable quality of service (QoS)-intensive software sys- tems to guarantee their system{\textquoteright}s persistent software attributes (PSAs) (e.g., functional correctness, portability, efficiency, and QoS) on very few platform configurations and to extrapolate from these configurations to the entire configuration space, which allows many sources of degradation to escape detec- tion until systems are fielded. This article illustrates how distributed continuous quality assurance (DCQA) processes help improve the assessment of these PSAs across large QoS- intensive software system configuration spaces. We also il- lustrate how model-based DCQA processes enable developers to run formally-designed screening experiments that isolate the most significant configuration options, such as different workload parameters, operating system, compiler flags, fea- ture sets, and/or run-time optimization controls. Our empir- ical results show that DCQA processes can be used monitor, safeguard, and enforce PSAs at an acceptable level of cost and effort. }, author = {Krishna,A. S and Yilmaz,C. and Memon, Atif M. and Porter, Adam and Schmidt,D. C and Gokhale,A. and Natarajan,B.} } @article {12979, title = {Applying permutation tests to tree-based statistical models: extending the R package rpart}, volume = {2004-24}, year = {2004}, month = {2004///}, institution = {University of Maryland Institute for Advanced Computer Studies}, abstract = {Tree-based statistical models are useful for evaluating relationships between predictor and response variables and for generating predictions when the response is unknown. However, current methods of constructing tree-based models do not provide a probabilistic assessment of the models produced. Here we describe our work to use permutation tests to quantitatively estimate the probability of tree-based statistical models. We have extended the rpart (recursive partitioning) package of the R system for statistical data analysis. This extension, rpart.permutation, executes the permutations in parallel, using MPI (Message Passing Interface) to greatly decrease the time necessary to complete the analysis.}, author = {Cummings, Michael P. and Myers,D. S and Mangelson,M} } @article {17561, title = {Approximation algorithms for partial covering problems}, journal = {Journal of Algorithms}, volume = {53}, year = {2004}, month = {2004/10//}, pages = {55 - 84}, abstract = {We study a generalization of covering problems called partial covering. Here we wish to cover only a desired number of elements, rather than covering all elements as in standard covering problems. For example, in k-partial set cover, we wish to choose a minimum number of sets to cover at least k elements. For k-partial set cover, if each element occurs in at most f sets, then we derive a primal-dual f-approximation algorithm (thus implying a 2-approximation for k-partial vertex cover) in polynomial time. Without making any assumption about the number of sets an element is in, for instances where each set has cardinality at most three, we obtain an approximation of 4/3. We also present better-than-2-approximation algorithms for k-partial vertex cover on bounded degree graphs, and for vertex cover on expanders of bounded average degree. We obtain a polynomial-time approximation scheme for k-partial vertex cover on planar graphs, and for covering k points in Rd by disks.}, keywords = {Approximation algorithms, Partial covering, Primal-dual methods, Randomized rounding, Set cover, Vertex cover}, isbn = {0196-6774}, doi = {10.1016/j.jalgor.2004.04.002}, url = {http://www.sciencedirect.com/science/article/pii/S0196677404000689}, author = {Gandhi,Rajiv and Khuller, Samir and Srinivasan, Aravind} } @conference {18017, title = {Arbitrate-and-move primitives for high throughput on-chip interconnection networks}, booktitle = {Circuits and Systems, 2004. ISCAS {\textquoteright}04. Proceedings of the 2004 International Symposium on}, volume = {2}, year = {2004}, month = {2004/05//}, pages = {II - 441-4 Vol.2 - II - 441-4 Vol.2}, abstract = {An n-leaf pipelined balanced binary tree is used for arbitration of order and movement of data from n input ports to one output port. A novel arbitrate-and-move primitive circuit for every node of the tree, which is based on a concept of reduced synchrony that benefits from attractive features of both asynchronous and synchronous designs, is presented. The design objective of the pipelined binary tree is to provide a key building block in a high-throughput mesh-of-trees interconnection network for Explicit Multi Threading (XMT) architecture, a recently introduced parallel computation framework. The proposed reduced synchrony circuit was compared with asynchronous and synchronous designs of arbitrate-and-move primitives. Simulations with 0.18 mu;m technology show that compared to an asynchronous design, the proposed reduced synchrony implementation achieves a higher throughput, up to 2 Giga-Requests per second on an 8-leaf binary tree. Our circuit also consumes less power than the synchronous design, and requires less silicon area than both the synchronous and asynchronous designs.}, keywords = {8, arbiter, arbitrate-and-move, architecture;, asynchronous, balanced, binary, circuit, circuit;, circuits;, consumption;, data, explicit, interconnection, interconnections;, leaf, mesh-of-trees, multi-threading;, Multithreading, n-leaf, network;, pipeline, pipelined, power, primitive, processing;, reduced, simulation;, structures;, synchronous, synchrony, system-on-chip;, tree, tree;}, doi = {10.1109/ISCAS.2004.1329303}, author = {Balkan,A.O. and Gang Qu and Vishkin, Uzi} } @article {14263, title = {The Argus eye: a new imaging system designed to facilitate robotic tasks of motion}, journal = {IEEE Robotics \& Automation Magazine}, volume = {11}, year = {2004}, month = {2004/12//}, pages = {31 - 38}, abstract = {This article describes an imaging system that has been designed to facilitate robotic tasks of motion. The system consists of a number of cameras in a network, arranged so that they sample different parts of the visual sphere. This geometric configuration has provable advantages compared to small field of view cameras for the estimation of the system{\textquoteright}s own motion and, consequently, the estimation of shape models from the individual cameras. The reason is, inherent ambiguities of confusion between translation and rotation disappear. Pairs of cameras may also be arranged in multiple stereo configurations, which provide additional advantages for segmentation. Algorithms for the calibration of the system and the three-dimensional (3-D) motion estimation are provided.}, keywords = {Argus eye, Calibration, CAMERAS, computational geometry, Design automation, Eyes, image formation, imaging system, Information geometry, Layout, Motion estimation, multiple stereo configurations, panoramic robots, robot vision, Robot vision systems, robotic motion tasks, Robotics and automation, SHAPE, shape model estimation, system calibration}, isbn = {1070-9932}, doi = {10.1109/MRA.2004.1371606}, author = {Baker, P. and Ogale, A. S and Ferm{\"u}ller, Cornelia} } @article {14167, title = {The Argus eye, a new tool for robotics}, journal = {IEEE Robotics and Automation Magazine}, volume = {11}, year = {2004}, month = {2004///}, pages = {31 - 38}, author = {Baker, P. and Ogale, A. S and Ferm{\"u}ller, Cornelia and Aloimonos, J.} } @conference {15466, title = {ASPIRE: automated systematic protocol implementation robustness evaluation}, booktitle = {Software Engineering Conference, 2004. Proceedings. 2004 Australian}, year = {2004}, month = {2004///}, pages = {241 - 250}, abstract = {Network protocol implementations are susceptible to problems caused by their lack of ability to handle invalid inputs. We present ASPIRE: automated systematic protocol implementation robustness evaluation, an automated approach to pro-actively test protocol implementations by observing their responses to faulty protocol data units (PDUs) or messages. In contrast to existing approaches, we sample the faulty PDU space in a systematic manner, thus allowing us to evaluate protocol implementations in the face of a wider variety of faulty PDUs. We use a pruning strategy to reduce, from exponential, the size of the faulty PDU set to polynomial in the number of fields of a PDU. We have implemented the ASPIRE algorithms and evaluated them on implementations of HTTP (Apache, Google Web Server (GWS), and Microsoft IIS) and SMTP (Sendmail and Microsoft Exchange) protocols. Our results show that Apache, GWS, and IIS, although implementing the same protocol specification, behave differently on faulty HTTP PDUs; Sendmail and exchange are different in handling our faulty SMTP PDUs.}, keywords = {algorithm, ASPIRE, automated systematic protocol, automated testing, fault tolerant computing, faulty PDU, formal specification, HTTP, implementation robustness evaluation, Internet, network protocol, protocol data unit, protocol specification, robustness testing, SMTP protocol, stateful protocols, stateless protocols, Transport protocols}, doi = {10.1109/ASWEC.2004.1290477}, author = {Vasan,Arunchandar and Memon, Atif M.} } @article {15342, title = {Assessment of inflow boundary conditions for compressible turbulent boundary layers}, journal = {Physics of Fluids}, volume = {16}, year = {2004}, month = {2004///}, pages = {2623 - 2623}, author = {Xu,S. and Martin, M.P} } @conference {14811, title = {Automated cluster-based Web service performance tuning}, booktitle = {13th IEEE International Symposium on High performance Distributed Computing, 2004. Proceedings}, year = {2004}, month = {2004/06/04/6}, pages = {36 - 44}, publisher = {IEEE}, organization = {IEEE}, abstract = {Active harmony provides a way to automate performance tuning. We apply the Active Harmony system to improve the performance of a cluster-based web service system. The performance improvement cannot easily be achieved by tuning individual components for such a system. The experimental results show that there is no single configuration for the system that performs well for all kinds of workloads. By tuning the parameters, Active Harmony helps the system adapt to different workloads and improve the performance up to 16\%. For scalability, we demonstrate how to reduce the time when tuning a large system with many tunable parameters. Finally an algorithm is proposed to automatically adjust the structure of cluster-based web systems, and the system throughput is improved up to 70\% using this technique.}, keywords = {Active Harmony system, automated performance tuning, business, cluster-based Web service system, Clustering algorithms, Computer science, Educational institutions, electronic commerce, Internet, Middleware, performance evaluation, scalability, Throughput, Transaction databases, Web server, Web services, workstation clusters}, isbn = {0-7695-2175-4}, doi = {10.1109/HPDC.2004.1323484}, author = {Chung,I. -H and Hollingsworth, Jeffrey K} } @inbook {15426, title = {Automated GUI regression testing using AI planning}, booktitle = {Artificial Intelligence Methods in Software TestingArtificial Intelligence Methods in Software Testing}, year = {2004}, month = {2004///}, pages = {51 - 99}, publisher = {World Scientific}, organization = {World Scientific}, isbn = {9812388540, 9789812388544}, author = {Memon, Atif M.} } @book {18895, title = {Automated Planning: Theory and Practice}, year = {2004}, month = {2004/05/03/}, publisher = {Elsevier}, organization = {Elsevier}, abstract = {Automated planning technology now plays a significant role in a variety of demanding applications, ranging from controlling space vehicles and robots to playing the game of bridge. These real-world applications create new opportunities for synergy between theory and practice: observing what works well in practice leads to better theories of planning, and better theories lead to better performance of practical applications. Automated Planning mirrors this dialogue by offering a comprehensive, up-to-date resource on both the theory and practice of automated planning. The book goes well beyond classical planning, to include temporal planning, resource scheduling, planning under uncertainty, and modern techniques for plan generation, such as task decomposition, propositional satisfiability, constraint satisfaction, and model checking. The authors combine over 30 years experience in planning research and development to offer an invaluable text to researchers, professionals, and graduate students. *Comprehensively explains paradigms for automated planning. *Provides a thorough understanding of theory and planning practice, and how they relate to each other. *Presents case studies of applications in space, robotics, CAD/CAM, process control, emergency operations, and games.*Provides a thorough understanding of AI planning theory and practice, and how they relate to each other. *Covers all the contemporary topics of planning, as well as important practical applications of planning, such as model checking and game playing. *Presents case studies and applications in planning engineering, space, robotics, CAD/CAM, process control, emergency operations, and games.*Provides lecture notes, examples of programming assignments, pointers to downloadable planning systems and related information online.}, keywords = {Business \& Economics / Management, Computers / Intelligence (AI) \& Semantics, Production planning, Production planning/ Data processing, Technology \& Engineering / Robotics}, isbn = {9781558608566}, author = {Ghallab,Malik and Nau, Dana S. and Traverso,Paolo} } @conference {14035, title = {Automatic position calibration of multiple microphones}, booktitle = {Acoustics, Speech, and Signal Processing, 2004. Proceedings. (ICASSP {\textquoteright}04). IEEE International Conference on}, volume = {4}, year = {2004}, month = {2004/05//}, pages = {iv-69 - iv-72 vol.4 - iv-69 - iv-72 vol.4}, abstract = {We describe a method to determine automatically the relative three dimensional positions of multiple microphones using at least five loudspeakers in unknown positions. The only assumption we make is that there is a microphone which is very close to a loudspeaker. In our experimental setup, we attach one microphone to each loudspeaker. We derive the maximum likelihood estimator and the solution turns out to be a non-linear least squares problem. A closed form solution which can be used as the initial guess for the minimization routine is derived. We also derive an approximate expression for the covariance of the estimator using the implicit function theorem. Using this, we analyze the performance of the estimator with respect to the positions of the loudspeakers. The algorithm is validated using both Monte-Carlo simulations and a real-time experimental setup.}, keywords = {approximations;, array, audio, AUTOMATIC, calibration;, closed, covariance;, dimensional, estimation;, form, function, implicit, least, likelihood, loudspeakers;, maximum, microphone, microphones;, minimisation;, minimization;, multiple, nonlinear, position, positions;, problem;, processing;, signal, solution;, squares, theorem;, three}, doi = {10.1109/ICASSP.2004.1326765}, author = {Raykar,V.C. and Duraiswami, Ramani} } @article {13508, title = {Automatic recognition of spontaneous speech for access to multilingual oral history archives}, journal = {IEEE Transactions on Speech and Audio Processing, Special Issue on Spontaneous Speech Processing}, volume = {12}, year = {2004}, month = {2004/07//}, pages = {420 - 435}, abstract = {The MALACH project has the goal of developing the technologies needed to facilitate access to large collections of spontaneous speech. Its aim is to dramatically improve the state of the art in key Automatic Speech Recognition (ASR), Natural Language Processing (NLP) technologies for use in large-scale retrieval systems. The project leverages a unique collection of oral history interviews with survivors of the Holocaust that has been assembled and extensively annotated by the Survivors of the Shoah Visual History Foundation. This paper describes the collection, 116,000 hours of interviews in 32 languages, and the way in which system requirements have been discerned through user studies. It discusses ASR methods for very difficult speech (heavily accented, emotional, and elderly spontaneous speech), including transcription to create training data and methods for language modeling and speaker adaptation. Results are presented for for English and Czech. NLP results are presented for named entity tagging, topic segmentation, and supervised topic classification, and the architecture of an integrated search system that uses these results is described.}, author = {Byrne,W. and David Doermann and Franz,M. and Gustman,S. and Hajic,J. and Oard, Douglas and Picheny,M. and Psutka,J. and Ramabhadran,B.} } @conference {15690, title = {Automatic video summarization for wireless and mobile environments}, booktitle = {2004 IEEE International Conference on Communications}, volume = {3}, year = {2004}, month = {2004/06/20/24}, pages = {1532- 1536 Vol.3 - 1532- 1536 Vol.3}, publisher = {IEEE}, organization = {IEEE}, abstract = {In this paper, we propose a novel video summarization technique using which we can automatically generate high quality video summaries suitable for wireless and mobile environments. The significant contribution of this paper lies in the proposed clustering scheme. We use Delaunay diagrams to cluster multidimensional point data corresponding to the frame contents of the video. In contrast to the existing clustering techniques used for summarization, our clustering algorithm is fully automatic and well suited for batch processing. We illustrate the quality of our clustering and summarization scheme in an experiment using several video clips.}, keywords = {automatic video summarization, batch processing, batch processing (computers), Clustering algorithms, Clustering methods, clustering scheme, Computer science, Delaunay diagram, graph theory, Gunshot detection systems, Image sequences, mesh generation, Mobile computing, mobile radio, multidimensional point data cluster, Multidimensional systems, Multimedia communication, video clip, video frame content, Video sequences, video signal processing, wireless mobile environment}, isbn = {0-7803-8533-0}, doi = {10.1109/ICC.2004.1312767}, author = {Yong Rao and Mundur, Padma and Yesha,Y.} } @conference {16901, title = {Accessing diverse geo-referenced data sources with the SAND spatial DBMS}, booktitle = {Proceedings of the 2003 annual national conference on Digital government research}, series = {dg.o {\textquoteright}03}, year = {2003}, month = {2003///}, pages = {1 - 4}, publisher = {Digital Government Society of North America}, organization = {Digital Government Society of North America}, abstract = {The Internet has become the most frequently accessed medium for obtaining various types of data. In particular, government agencies, academic institutions, and private enterprises have published gigabytes of geo-referenced data on the Web. However, to obtain geo-referenced data from the Web successfully, systems must be designed to be capable of understanding the data sets published in different data formats. Also, even if the data sets are available in a simple known format, they often have poorly defined structures. With these issues in mind, we have developed an Internet-enabled data collection and conversion utility that interfaces with our prototype spatial database system, SAND. Using this utility, data can be retrieved from many different sources on the Web and converted into a format understandable by the SAND spatial database management system. Our collection and conversion utility is able to import the most popular data formats; namely, ESRI Shapefiles, Microsoft Excel files, HTML files, and GML files. Data in unstructured formats are verified for correct selection of the data types and handling of missing tuples before the insertion operation into the database. Moreover, our utility makes it possible to download any nonspatial data set and combine it internally with a relevant spatial data set. These features are accessible through a spreadsheet-like interface for online editing and structuring of data.}, url = {http://dl.acm.org/citation.cfm?id=1123196.1123206}, author = {Sankaranarayanan,Jagan and Tanin,Egemen and Samet, Hanan and Brabec,Frantisek} } @article {13923, title = {Accuracy, Target Reentry and Fitts{\textquoteright} Law Performance of Preschool Children Using Mice}, journal = {University of Maryland Technical Report, HCIL-2003}, volume = {16}, year = {2003}, month = {2003///}, author = {Hourcade,J. P and Bederson, Benjamin B. and Druin, Allison and Guimbretiere,F.} } @article {12719, title = {Accurate dense optical flow estimation using adaptive structure tensors and a parametric model}, journal = {Image Processing, IEEE Transactions on}, volume = {12}, year = {2003}, month = {2003/10//}, pages = {1170 - 1180}, abstract = {An accurate optical flow estimation algorithm is proposed in this paper. By combining the three-dimensional (3D) structure tensor with a parametric flow model, the optical flow estimation problem is converted to a generalized eigenvalue problem. The optical flow can be accurately estimated from the generalized eigenvectors. The confidence measure derived from the generalized eigenvalues is used to adaptively adjust the coherent motion region to further improve the accuracy. Experiments using both synthetic sequences with ground truth and real sequences illustrate our method. Comparisons with classical and recently published methods are also given to demonstrate the accuracy of our algorithm.}, keywords = {3D, accuracy;, adaptive, and, coherent, confidence, dense, eigenfunctions;, eigenvalue, eigenvalues, eigenvectors;, estimation;, flow, generalized, ground, image, measure;, model;, MOTION, optical, parameter, parametric, problem;, real, region;, sequences;, structure, synthetic, tensor;, tensors;, three-dimensional, truth;}, isbn = {1057-7149}, doi = {10.1109/TIP.2003.815296}, author = {Liu,Haiying and Chellapa, Rama and Rosenfeld, A.} } @article {14062, title = {Acoustical scattering from N spheres using a multilevel fast multipole method}, journal = {The Journal of the Acoustical Society of America}, volume = {113}, year = {2003}, month = {2003///}, pages = {2334 - 2334}, abstract = {We develop an efficient computational method for wave scattering from a large number of spherical objects that are characterized by their radii, locations, and complex acoustical impedances of the surfaces. The direct T-matrix method for solution of the problem that was developed and tested in [Gumerov and Duraiswami, J. Acoust. Soc. Am. 112, 2688{\textendash}2701 (2002)] is inefficient for computations involving a large number of scatterers. Here, we implement and test a multilevel fast multipole method for speeding up the solution and achieving better memory complexity. The method is based on hierarchical space subdivision with oct-trees using optimal space-partitioning, on a theory for fast translation and re-expansion of multipole solutions of the Helmholtz equation, and employs an iterative technique for the solution of large dense systems of linear equations with reflection-based iterations. For N scatterers the method provides O(NlogN) asymptotic complexity opposed to O(N3) complexity of the direct T-matrix approach. The results of computations were tested against solutions obtained by other methods, such as the boundary element method and the direct T-matrix method tested in our early study, and show the computational efficiency and accuracy of the solution technique. [Work supported by NSF Awards 0086075 and 0219681 is gratefully acknowledged.]}, url = {http://link.aip.org/link/?JAS/113/2334/2}, author = {Gumerov, Nail A. and Duraiswami, Ramani} } @article {13720, title = {Acquisition of bilingual MT lexicons from OCRed dictionaries}, journal = {Proceedings of the 9th MT Summit}, year = {2003}, month = {2003///}, pages = {208 - 215}, abstract = {This paper describes an approach to analyzing the lexical structure of OCRed bilingual dictionaries to construct re-sources suited for machine translation of low-density languages, where online resources are limited. A rule-based, an HMM-based, and a post-processed HMM-based method are used for rapid construction of MT lexicons based on sys- tematic structural clues provided in the original dictionary. We evaluate the effectiveness of our techniques, concluding that: (1) the rule-based method performs better with dictionaries where the font is not an important distinguishing fea- ture for determining information types; (2) the post-processed stochastic method improves the results of the stochastic method for phrasal entries; and (3) Our resulting bilingual lexicons are comprehensive enough to provide the basis for reasonable translation results when compared to human translations. }, author = {Karagol-Ayan,B. and David Doermann and Dorr, Bonnie J} } @conference {13486, title = {Acquisition of Bilingual MTLexicons from OCRed Dictionaries}, booktitle = {Proceedings of the Ninth Machine Translation Summit}, year = {2003}, month = {2003///}, pages = {208 - 215}, address = {New Orleans, LA}, author = {Karagol-Ayan,B. and David Doermann and Dorr, Bonnie J} } @article {12745, title = {Activity modeling and recognition using shape theory}, journal = {Behavior Representation in Modeling and Simulation}, year = {2003}, month = {2003///}, abstract = {Understanding activities arising out of the interactions of aconfiguration of moving objects is an important problem in video understanding, with applications in surveillance and monitoring, animation, medicine, etc. In this paper, we in- troduce a novel method for activity modeling based on the observation that that every activity has with it an associated structure characterized by a non-rigid shape and a dynamic model that characterizes the variations in the structure as the activity unfolds. We propose two mathematical models to characterize the non-rigid shape and its dynamics. In our first approach, we propose to model an activity by the polygonal shape formed by joining the locations of these point masses at any time , and its deformation over time. This uses the statistical shape theory of Kendall. The second approach models the trajectories of each separate class of moving objects in 3D shape space, and thus can identify dif- ferent kinds of activities. It is based on the factorization the- orem for matrices, which has been used before in computer vision for structure estimation. Deviations from the learned normal shape for each activity is used to identify abnormal ones. We demonstrate the applicability of our algorithms using real-life video sequences in an airport surveillance environment. We are able to identify the major activities that take place in that setting and detect abnormal ones. }, author = {Chellapa, Rama and Vaswani, N. and Chowdhury, A.K.R.} } @conference {12729, title = {Activity recognition using the dynamics of the configuration of interacting objects}, booktitle = {Computer Vision and Pattern Recognition, 2003. Proceedings. 2003 IEEE Computer Society Conference on}, volume = {2}, year = {2003}, month = {2003/06//}, pages = {II - 633-40 vol.2 - II - 633-40 vol.2}, abstract = {Monitoring activities using video data is an important surveillance problem. A special scenario is to learn the pattern of normal activities and detect abnormal events from a very low resolution video where the moving objects are small enough to be modeled as point objects in a 2D plane. Instead of tracking each point separately, we propose to model an activity by the polygonal {\textquoteright}shape{\textquoteright} of the configuration of these point masses at any time t, and its deformation over time. We learn the mean shape and the dynamics of the shape change using hand-picked location data (no observation noise) and define an abnormality detection statistic for the simple case of a test sequence with negligible observation noise. For the more practical case where observation (point locations) noise is large and cannot be ignored, we use a particle filter to estimate the probability distribution of the shape given the noisy observations up to the current time. Abnormality detection in this case is formulated as a change detection problem. We propose a detection strategy that can detect both {\textquoteright}drastic{\textquoteright} and {\textquoteright}slow{\textquoteright} abnormalities. Our framework can be directly applied for object location data obtained using any type of sensors - visible, radar, infrared or acoustic.}, keywords = {2D, abnormal, abnormality, abnormality;, acoustic, activity, analysis;, change;, Computer, configuration, configuration;, data;, DETECTION, detection;, distribution;, drastic, dynamics;, event;, filter;, hand-picked, image, infrared, interacting, learning;, location, low, mean, model;, monitoring;, MOTION, moving, noise;, noisy, object, object;, observation, observation;, particle, pattern, plane;, point, polygonal, probability, probability;, problem;, processing;, radar, recognition;, resolution, sensor;, sensors;, sequence;, SHAPE, shape;, signal, slow, statistic;, strategy;, Surveillance, surveillance;, target, test, tracking;, video, video;, visible, vision;}, doi = {10.1109/CVPR.2003.1211526}, author = {Vaswani, N. and RoyChowdhury, A. and Chellapa, Rama} } @article {13488, title = {Adaptive Hindi OCRUsing Generalized Hausdorff Image Comparison}, volume = {LAMP-TR-105,CFAR-TR-987,CS-TR-4519,UMIACS-TR-2003-87}, year = {2003}, month = {2003/08//}, institution = {University of Maryland, College Park}, abstract = {In this paper, we present an adaptive Hindi OCR using generalized Hausdor image comparison implemented as part of a rapidly retargetable language tool effort. The system includes: script identification, character segmentation, training sample creation and character recognition. The OCR design (completed in one month) was applied to a complete Hindi-English bilingual dictionary (with 1083 pages) and a collection of ideal images extracted from Hindi documents in PDF format. Experimental results show the recognition accuracy can reach 88\&$\#$x0025; for noisy images and 95\&$\#$x0025; for ideal images, both at the character level. The presented method can also be extended to design OCR systems for different scripts.}, author = {Ma,Huanfeng and David Doermann} } @conference {16754, title = {Adaptive Probabilistic Search for Peer-to-Peer Networks}, booktitle = {Peer-to-Peer Computing, IEEE International Conference on}, year = {2003}, month = {2003///}, pages = {102 - 102}, publisher = {IEEE Computer Society}, organization = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, abstract = {Peer-to-Peer networks are gaining increasing attention from both the scientific and the large Internet user community. Popular applications utilizing this new technology offer many attractive features to a growing number of users. At the heart of such networks lies the search algorithm. Proposed methods either depend on the network-disastrous flooding and its variations or utilize various indices too expensive to maintain. In this paper, we describe an adaptive, bandwidth-efficient algorithm for search in unstructured Peer-to-Peer networks, the Adaptive Probabilistic Search method (APS). Our scheme utilizes feedback from previous searches to probabilistically guide future ones. It performs efficient object discovery while inducing zero overhead over dynamic network operations. Extensive simulation results show that APS achieves high success rates, increased number of discovered objects, very low bandwidth consumption and adaptation to changing topologies.}, isbn = {0-7695-2023-5}, doi = {http://doi.ieeecomputersociety.org/10.1109/PTP.2003.1231509}, author = {Tsoumakos,Dimitrios and Roussopoulos, Nick} } @article {18652, title = {An adaptive quality of service aware middleware for replicated services}, journal = {Parallel and Distributed Systems, IEEE Transactions on}, volume = {14}, year = {2003}, month = {2003/11//}, pages = {1112 - 1125}, abstract = {A dependable middleware should be able to adaptively share the distributed resources it manages in order to meet diverse application requirements, even when the quality of service (QoS) is degraded due to uncertain variations in load and unanticipated failures. We have addressed this issue in the context of a dependable middleware that adaptively manages replicated servers to deliver a timely and consistent response to time-sensitive client applications. These applications have specific temporal and consistency requirements, and can tolerate a certain degree of relaxed consistency in exchange for better response time. We propose a flexible QoS model that allows clients to specify their timeliness and consistency constraints. We also propose an adaptive framework that dynamically selects replicas to service a client{\textquoteright}s request based on the prediction made by probabilistic models. These models use the feedback from online performance monitoring of the replicas to provide probabilistic guarantees for meeting a client{\textquoteright}s QoS specification. The experimental results we have obtained demonstrate the role of feedback and the efficacy of simple analytical models for adaptively sharing the available replicas among the users under different workload scenarios.}, keywords = {distributed resource sharing, Middleware, online performance monitoring, probabilistic modeling, QoS specification, quality of service, replica consistency, replicated services, resource allocation, time-sensitive client applications, timeliness constraints}, isbn = {1045-9219}, doi = {10.1109/TPDS.2003.1247672}, author = {Krishnamurthy,Sudha and Sanders,W. H. and Michel Cukier} } @conference {12723, title = {Adaptive visual tracking and recognition using particle filters}, booktitle = {Multimedia and Expo, 2003. ICME {\textquoteright}03. Proceedings. 2003 International Conference on}, volume = {2}, year = {2003}, month = {2003/07//}, pages = {II - 349-52 vol.2 - II - 349-52 vol.2}, abstract = {This paper presents an improved method for simultaneous tracking and recognition of human faces from video, where a time series model is used to resolve the uncertainties in tracking and recognition. The improvements mainly arise from three aspects: (i) modeling the inter-frame appearance changes within the video sequence using an adaptive appearance model and an adaptive-velocity motion model; (ii) modeling the appearance changes between the video frames and gallery images by constructing intra- and extra-personal spaces; and (iii) utilization of the fact that the gallery images are in frontal views. By embedding them in a particle filter, we are able to achieve a stabilized tracker and an accurate recognizer when confronted by pose and illumination variations.}, keywords = {adaptive, adaptive-velocity, appearance, extra-personal, Filtering, filters;, image, intra-personal, model;, MOTION, particle, processing;, recognition;, sequence;, sequences;, series, signal, spaces;, theory;, TIME, tracking;, video, visual}, doi = {10.1109/ICME.2003.1221625}, author = {Zhou,Shaohua and Chellapa, Rama and Moghaddam, B.} } @inbook {15423, title = {Advances in GUI Testing}, booktitle = {Advances in ComputersAdvances in Computers}, volume = {Volume 58}, year = {2003}, month = {2003///}, pages = {149 - 201}, publisher = {Elsevier}, organization = {Elsevier}, abstract = {Graphical user interfaces are by far the most popular means used to interact with software today. Unfortunately, the state-of-the-practice in GUI testing has not kept pace with the rapidly evolving GUI technology. In practice, GUI testing is largely manual, often resulting in inadequate testing. There have been several research efforts to improve GUI testing. This chapter presents some of the recent advances in GUI testing and provides guidelines on how to combine them.}, isbn = {0065-2458}, url = {http://www.sciencedirect.com/science/article/pii/S0065245803580044}, author = {Memon, Atif M.} } @article {15420, title = {Advances in GUI Testing-10 Summary}, journal = {Advances in Computers}, volume = {58}, year = {2003}, month = {2003///}, pages = {195 - 196}, author = {Memon, Atif M.} } @article {15419, title = {Advances in GUI Testing-2 GUI Testing Steps}, journal = {Advances in Computers}, volume = {58}, year = {2003}, month = {2003///}, pages = {155 - 156}, author = {Memon, Atif M.} } @article {15422, title = {Advances in GUI Testing-3 Record/Playback Tools}, journal = {Advances in Computers}, volume = {58}, year = {2003}, month = {2003///}, pages = {157 - 158}, author = {Memon, Atif M.} } @article {15418, title = {Advances in GUI Testing-4 Challenges}, journal = {Advances in Computers}, volume = {58}, year = {2003}, month = {2003///}, pages = {159 - 161}, author = {Memon, Atif M.} } @article {15416, title = {Advances in GUI Testing-5 State Machine Models}, journal = {Advances in Computers}, volume = {58}, year = {2003}, month = {2003///}, pages = {162 - 167}, author = {Memon, Atif M.} } @article {15417, title = {Advances in GUI Testing-6 Behavioral Models}, journal = {Advances in Computers}, volume = {58}, year = {2003}, month = {2003///}, pages = {168 - 169}, author = {Memon, Atif M.} } @article {15415, title = {Advances in GUI Testing-7 Statistical Methods}, journal = {Advances in Computers}, volume = {58}, year = {2003}, month = {2003///}, pages = {170 - 171}, author = {Memon, Atif M.} } @article {15414, title = {Advances in GUI Testing-8 Hierarchical Techniques}, journal = {Advances in Computers}, volume = {58}, year = {2003}, month = {2003///}, pages = {172 - 193}, author = {Memon, Atif M.} } @article {15421, title = {Advances in GUI Testing-9 Discussion}, journal = {Advances in Computers}, volume = {58}, year = {2003}, month = {2003///}, pages = {194 - 194}, author = {Memon, Atif M.} } @inbook {12738, title = {Airborne Video Registration for Activity Monitoring}, booktitle = {Video RegistrationVideo Registration}, series = {The Kluwer International Series in Video Computing}, volume = {5}, year = {2003}, month = {2003///}, pages = {130 - 143}, publisher = {Springer US}, organization = {Springer US}, abstract = {The analysis of ground activities involving vehicles and humans is of interest in airborne surveillance applications. The high spatiotemporal resolution of a video camera makes it the sensor of choice for such applications. In the past, video sensors were not preferred, precisely because of the high volume of data generated, which had to be processed manually for the most part. Further, the moving platform gives rise to numerous false alarms.}, isbn = {978-1-4615-0459-7}, url = {http://dx.doi.org/10.1007/978-1-4615-0459-7_6}, author = {Shekhar,Chandra and Chellapa, Rama}, editor = {Shah,Mubarak and Kumar,Rakesh and Shah,Mubarak} } @article {18730, title = {Algorithms for computing global accessibility cones}, journal = {Journal of Computing and Information Science in Engineering}, volume = {3}, year = {2003}, month = {2003///}, pages = {200 - 200}, author = {Dhaliwal,S. and Gupta,S.K. and Huang,J. and Priyadarshini,A.} } @article {18812, title = {Algorithms for selecting cutters in multi-part milling problems}, journal = {Computer-Aided Design}, volume = {35}, year = {2003}, month = {2003/08//}, pages = {825 - 839}, abstract = {This paper describes geometric algorithms for automatically selecting an optimal sequence of cutters for machining a set of 2.5-D parts. In milling operations, cutter size affects the machining time significantly. Meanwhile, if the batch size is small, it is also important to shorten the time spent on loading tools into the tool magazine and establishing z-length compensation values. Therefore, in small-batch manufacturing, if we can select a set of milling tools that will produce good machining time on more than one type of parts, then several unnecessary machine-tool reconfiguration operations can be eliminated. In selecting milling cutters we consider both the tool loading time and the machining time and generate solutions that allow us to minimize the total machining time. In this paper we first present algorithms for finding the area that can be cut by a given cutter. Then we describe a graph search formulation for the tool selection problem. Finally, the optimal sequence of cutters is selected by using Dijkstra{\textquoteright}s shortest path planning algorithm.}, keywords = {2.5-D Milling, cutter selection, Geometric Algorithms}, isbn = {0010-4485}, doi = {10.1016/S0010-4485(02)00110-0}, url = {http://www.sciencedirect.com/science/article/pii/S0010448502001100}, author = {Yao,Zhiyang and Gupta, Satyandra K. and Nau, Dana S.} } @conference {13493, title = {AModel-based Line Detection Algorithm in Documents}, booktitle = {ICDAR}, year = {2003}, month = {2003///}, pages = {44 - 48}, author = {Zheng,Y. and Li,H. and David Doermann} } @article {14058, title = {Analysis of particular phononic structures using single integral equations}, journal = {The Journal of the Acoustical Society of America}, volume = {113}, year = {2003}, month = {2003///}, pages = {2284 - 2284}, abstract = {A fast method for determining phononic (and photonic) bandgaps in composite materials is developed. It is known that in the propagation of waves in a 3D medium containing N scatterers arranged periodically, there exist refractive indices for which such structures have bandgaps, i.e., frequencies for which no waves can propagate inside. Our task is to find the frequencies that generate these prohibited waves. This requires the solution of an eigenvalue problem for the Helmholtz operator. To solve this problem we choose an alternate route which uses boundary integral equations. We derive a single integral equation on each of the interfaces between the outer region and the scatterers, considering a general transmission boundary condition, by using a hybrid method using layer potentials and Green{\textquoteright}s formula. This approach reduces the number of unknowns considerably in comparison to other methods, but requires the treatment of large dense matrices and many matrix vector multiplications. To remedy this, we use the Fast Multipole Method. For solving the eigenvalue problem we discuss two methods: the Newton method and a method based on the Cauchy formula. Details of the numerical implementation, and results will be presented for different cases: sound hard, sound soft, impedance and transmission boundary conditions. [Work partially supported by NSF Award 0219681 is gratefully acknowledged.]}, url = {http://link.aip.org/link/?JAS/113/2284/1}, author = {Seydou,Fadoulourahmane and Duraiswami, Ramani and Gumerov, Nail A.} } @article {14108, title = {An Analysis of Smoothing Effects of Upwinding Strategies for the Convection-Diffusion Equation}, journal = {SIAM Journal on Numerical Analysis}, volume = {40}, year = {2003}, month = {2003/01/01/}, pages = {254 - 281}, abstract = {Using a technique for constructing analytic expressions for discrete solutions to the convection-diffusion equation, we examine and characterize the effects of upwinding strategies on solution quality. In particular, for grid-aligned flow and discretization based on bilinear finite elements with streamline upwinding, we show precisely how the amount of upwinding included in the discrete operator affects solution oscillations and accuracy when different types of boundary layers are present. This analysis provides a basis for choosing a streamline upwinding parameter which also gives accurate solutions for problems with non-grid-aligned and variable speed flows. In addition, we show that the same analytic techniques provide insight into other discretizations, such as a finite difference method that incorporates streamline diffusion and the isotropic artificial diffusion method.}, isbn = {0036-1429}, url = {http://www.jstor.org/stable/4100953}, author = {Elman, Howard and Alison Ramage} } @article {12091, title = {An Analysis of the Layer 2 Handoff costs in Wireless Local Area Networks}, journal = {ACM Computer Communications Review}, volume = {33}, year = {2003}, month = {2003///}, author = {Mishra,A. and Shin,M. H. and Arbaugh, William A.} } @article {12956, title = {ANNUAL REVIEW \& FORECAST REPORTS-THE OCEANS: TO PROTECT AND TO PLOW}, journal = {Sea Technology}, volume = {44}, year = {2003}, month = {2003///}, pages = {33 - 34}, author = {Rita R Colwell} } @article {18167, title = {Anti-collusion fingerprinting for multimedia}, journal = {Signal Processing, IEEE Transactions on}, volume = {51}, year = {2003}, month = {2003/04//}, pages = {1069 - 1087}, abstract = {Digital fingerprinting is a technique for identifying users who use multimedia content for unintended purposes, such as redistribution. These fingerprints are typically embedded into the content using watermarking techniques that are designed to be robust to a variety of attacks. A cost-effective attack against such digital fingerprints is collusion, where several differently marked copies of the same content are combined to disrupt the underlying fingerprints. We investigate the problem of designing fingerprints that can withstand collusion and allow for the identification of colluders. We begin by introducing the collusion problem for additive embedding. We then study the effect that averaging collusion has on orthogonal modulation. We introduce a tree-structured detection algorithm for identifying the fingerprints associated with K colluders that requires O(Klog(n/K)) correlations for a group of n users. We next develop a fingerprinting scheme based on code modulation that does not require as many basis signals as orthogonal modulation. We propose a new class of codes, called anti-collusion codes (ACCs), which have the property that the composition of any subset of K or fewer codevectors is unique. Using this property, we can therefore identify groups of K or fewer colluders. We present a construction of binary-valued ACC under the logical AND operation that uses the theory of combinatorial designs and is suitable for both the on-off keying and antipodal form of binary code modulation. In order to accommodate n users, our code construction requires only O( radic;n) orthogonal signals for a given number of colluders. We introduce three different detection strategies that can be used with our ACC for identifying a suspect set of colluders. We demonstrate the performance of our ACC for fingerprinting multimedia and identifying colluders through experiments using Gaussian signals and real images.}, keywords = {(mathematics);, additive, algorithm;, and, anti-collusion, attack;, averaging, binary, code, codes;, codevectors;, coding;, colluders, collusion;, combinatorial, communication;, compression;, correlation;, cost-effective, data, data;, design, DETECTION, detection;, digital, embedding;, fingerprinting;, Gaussian, identification;, image, images;, keying;, logical, mathematics;, Modulation, modulation;, multimedia, multimedia;, of, on-off, operation;, orthogonal, processes;, real, redistribution;, Security, signal, signals;, theory;, tree-structured, TREES, watermarking;}, isbn = {1053-587X}, doi = {10.1109/TSP.2003.809378}, author = {Trappe,W. and M. Wu and Wang,Z.J. and Liu,K. J.R} } @conference {18169, title = {Anti-collusion of group-oriented fingerprinting}, booktitle = {Multimedia and Expo, 2003. ICME {\textquoteright}03. Proceedings. 2003 International Conference on}, volume = {2}, year = {2003}, month = {2003/07//}, pages = {II - 217-20 vol.2 - II - 217-20 vol.2}, abstract = {Digital fingerprinting of multimedia data involves embedding information in the content, and offers protection to the digital rights of the content by allowing illegitimate usage of the content to be identified by authorized parties. One potential threat to fingerprints is collusion, whereby a group of adversaries combine their individual copies in an attempt to remove the underlying fingerprints. Former studies indicate that collusion attacks based on a few dozen independent copies can confound a fingerprinting system that employs orthogonal modulation. However, since an adversary is more likely to collude with some users than other users, we propose a group-based fingerprinting scheme where users likely to collude with each other are assigned correlated fingerprints. We evaluate the performance of our group-based fingerprints by studying the collusion resistance of a fingerprinting system employing Gaussian distributed fingerprints. We compare the results to those of fingerprinting systems employing orthogonal modulation.}, keywords = {anticollusion, attacks;, collusion, communication;, data;, digital, distributed, distribution;, fingerprinting;, fingerprints;, Gaussian, group-oriented, Internet;, method;, modulation;, multimedia, orthogonal, security;, Telecommunication, watermarking;}, doi = {10.1109/ICME.2003.1221592}, author = {Wang,Z.J. and M. Wu and Trappe,W. and Liu,K. J.R} } @article {13497, title = {AParallel Line Detection Algorithm Based on HMMDecoding}, volume = {LAMP-TR-109,CAR-TR-994,CS-TR-4545,UMIACS-TR-2003-1113}, year = {2003}, month = {2003/12//}, institution = {University of Maryland, College Park}, abstract = {The detection of groups of parallel lines is important in applications such as form processing and text (handwriting) extraciton in rule lined paper. These tasks can be very challenging in degraded documents where the lines are severely broken. In this paper we propose a novel model-based method which incorporates high level context to detect these lines. After preprocessing and skew correction, we use trained Hidden Markov Models (HMM) to locate the optimal positions of all lines simultaneously, based on the Viterbi decoding. The algorithm is trainable, therefore, it can easily be adapted to different application scenarios. The experiments conducted on known form processing and rule line detection show our method is robust, and achieved better results than other widely used line detection methods, such as the Hough transform, projection or vectorization-based methods.}, author = {Yefeng Zheng and Huiping Li and David Doermann} } @conference {12721, title = {An appearance based approach for human and object tracking}, booktitle = {Image Processing, 2003. ICIP 2003. Proceedings. 2003 International Conference on}, volume = {2}, year = {2003}, month = {2003/09//}, pages = {II - 85-8 vol.3 - II - 85-8 vol.3}, abstract = {A system for tracking humans and detecting human-object interactions in indoor environments is described. A combination of correlogram and histogram information is used to model object and human color distributions. Humans and objects are detected using a background subtraction algorithm. The models are built on the fly and used to track them on a frame by frame basis. The system is able to detect when people merge into groups and segment them during occlusion. Identities are preserved during the sequence, even if a person enters and leaves the scene. The system is also able to detect when a person deposits or removes an object from the scene. In the first case the models are used to track the object retroactively in time. In the second case the objects are tracked for the rest of the sequence. Experimental results using indoor video sequences are presented.}, keywords = {algorithm;, analysis;, background, basis;, by, Color, colour, correlogram, detection;, distributions;, frame, histogram, human, image, information;, object, processing;, segmentation;, sequences;, signal, subtraction, tracking;, video}, doi = {10.1109/ICIP.2003.1246622}, author = {Capellades,M. B and David Doermann and DeMenthon,D. and Chellapa, Rama} } @article {17637, title = {On the approximability of clique and related maximization problems}, journal = {Journal of Computer and System Sciences}, volume = {67}, year = {2003}, month = {2003/11//}, pages = {633 - 651}, abstract = {We consider approximations of the form n1-o(1) for the Maximum Clique problem, where n is the number of vertices in the input graph and where the {\textquotedblleft}o(1){\textquotedblright} term goes to zero as n increases. We show that sufficiently strong negative results for such problems, which we call strong inapproximability results, have interesting consequences for exact computation. A simple sampling method underlies most of our results.}, keywords = {Approximation algorithms, Clique, Inapproximability, Independent set, Packing integer programs, random sampling}, isbn = {0022-0000}, doi = {10.1016/S0022-0000(03)00110-7}, url = {http://www.sciencedirect.com/science/article/pii/S0022000003001107}, author = {Srinivasan, Aravind} } @article {17556, title = {Approximating the domatic number}, journal = {SIAM Journal on Computing}, volume = {32}, year = {2003}, month = {2003///}, pages = {172 - 195}, abstract = {A set of vertices in a graph is a dominating set if every vertex outside the set hasa neighbor in the set. The domatic number problem is that of partitioning the vertices of a graph into the maximum number of disjoint dominating sets. Let n denote the number of vertices, δ the minimum degree, and ∆ the maximum degree. We show that every graph has a domatic partition with (1 - o(1))(δ + 1)/ ln n dominating sets and, moreover, that such a domatic partition can be found in polynomial-time. This implies a (1 + o(1)) ln n-approximation algorithm for domatic number, since the domatic number is always at most δ+1. We also show this to be essentially best possible. Namely, extending the approximation hardness of set cover by combining multiprover protocols with zero-knowledge techniques, we show that for every ϵ > 0, a (1 - ϵ) ln n-approximation implies that NP ⊆ DTIME(nO(log log n)). This makes domatic number the first natural maximization problem (known to the authors) that is provably approximable to within polylogarithmic factors but no better. We also show that every graph has a domatic partition with (1 - o(1))(δ + 1)/ ln ∆ dominating sets, where the {\textquotedblleft}o(1){\textquotedblright} term goes to zero as ∆ increases. This can be turned into an efficient algorithm that produces a domatic partition of {\textohm}(δ/ ln ∆) sets. }, author = {Feige,U. and Halld{\'o}rsson,M.M. and Kortsarz,G. and Srinivasan, Aravind} } @inbook {17558, title = {Approximation Algorithms for Channel Allocation Problems in Broadcast Networks}, booktitle = {Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques}, series = {Lecture Notes in Computer Science}, volume = {2764}, year = {2003}, month = {2003///}, pages = {821 - 826}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {We study two packing problems that arise in the area of dissemination-based information systems; a second theme is the study of distributed approximation algorithms. The problems considered have the property that the space occupied by a collection of objects together could be significantly less than the sum of the sizes of the individual objects. In the Channel Allocation Problem , there are users who request subsets of items. There are a fixed number of channels that can carry an arbitrary amount of information. Each user must get all of the requested items from one channel, i.e., all the data items of each request must be broadcast on some channel. The load on any channel is the number of items that are broadcast on that channel; the objective is to minimize the maximum load on any channel. We present approximation algorithms for this problem and also show that the problem is MAX-SNP hard. The second problem is the Edge Partitioning Problem addressed by Goldschmidt, Hochbaum, Levin, and Olinick ( Networks, 41:13-23, 2003 ). Each channel here can deliver information to at most k users, and we aim to minimize the total load on all channels. We present an O ( n 1/3 ){\textendash}approximation algorithm and also show that the algorithm can be made fully distributed with the same approximation guarantee; we also generalize to the case of hypergraphs.}, isbn = {978-3-540-40770-6}, url = {http://dx.doi.org/10.1007/978-3-540-45198-3_5}, author = {Gandhi,Rajiv and Khuller, Samir and Srinivasan, Aravind and Wang,Nan}, editor = {Arora,Sanjeev and Jansen,Klaus and Rolim,Jos{\'e} and Sahai,Amit} } @article {18661, title = {AQuA: an adaptive architecture that provides dependable distributed objects}, journal = {Computers, IEEE Transactions on}, volume = {52}, year = {2003}, month = {2003/01//}, pages = {31 - 50}, abstract = {Building dependable distributed systems from commercial off-the-shelf components is of growing practical importance. For both cost and production reasons, there is interest in approaches and architectures that facilitate building such systems. The AQuA architecture is one such approach; its goal is to provide adaptive fault tolerance to CORBA applications by replicating objects. The AQuA architecture allows application programmers to request desired levels of dependability during applications{\textquoteright} runtimes. It provides fault tolerance mechanisms to ensure that a CORBA client can always obtain reliable services, even if the CORBA server object that provides the desired services suffers from crash failures and value faults. AQuA includes a replicated dependability manager that provides dependability management by configuring the system in response to applications{\textquoteright} requests and changes in system resources due to faults. It uses Maestro/Ensemble to provide group communication services. It contains a gateway to intercept standard CORBA IIOP messages to allow any standard CORBA application to use AQuA. It provides different types of replication schemes to forward messages reliably to the remote replicated objects. All of the replication schemes ensure strong, data consistency among replicas. This paper describes the AQuA architecture and presents, in detail, the active replication pass-first scheme. In addition, the interface to the dependability manager and the design of the dependability manager replication are also described. Finally, we describe performance measurements that were conducted for the active replication pass-first scheme, and we present results from our study of fault detection, recovery, and blocking times.}, keywords = {active replication pass-first scheme, adaptive architecture, adaptive fault tolerance, AQuA, CORBA, data consistency, data integrity, dependable distributed objects, distributed object management, performance measurements, quality of service, replicated dependability manager, replication schemes, software fault tolerance, system resources}, isbn = {0018-9340}, doi = {10.1109/TC.2003.1159752}, author = {Ren,Yansong and Bakken,D. E. and Courtney,T. and Michel Cukier and Karr,D. A. and Rubel,P. and Sabnis,C. and Sanders,W. H. and Schantz,R.E. and Seri,M.} } @conference {12801, title = {Architectural Interaction Diagrams: AIDs for System Modeling}, booktitle = {Software Engineering, International Conference on}, year = {2003}, month = {2003///}, pages = {396 - 396}, publisher = {IEEE Computer Society}, organization = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, abstract = {This paper develops a modeling paradigm called Architectural Interaction Diagrams, or AIDs, for the high-level design of systems containing concurrent, interacting components. The novelty of AIDs is that they introduce interaction mechanisms, or buses, as first-class entities into the modeling vocabulary. Users then have the capability, in their modeling, of using buses whose behavior captures interaction at a higher level of abstraction than that afforded by modeling notations such as Message Sequence Charts or process algebra, which typically provide only one fixed interaction mechanism. This paper defines AIDs formally by giving them an operational semantics that describes how buses combine subsystem transitions into system-level transitions. This semantics enables AIDs to be simulated; to incorporate subsystems given in different modeling notations into a single system model; and to use testing, debugging and model checking early in the system design cycle in order to catch design errors before they are implemented.}, doi = {http://doi.ieeecomputersociety.org/10.1109/ICSE.2003.1201218}, author = {Ray,Arnab and Cleaveland, Rance} } @article {13250, title = {AUDIO-P2. 1: PITCH AND TIMBRE MANIPULATIONS USING CORTICAL REPRESENTATION OF SOUND}, journal = {IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS SPEECH AND SIGNAL PROCESSING}, volume = {5}, year = {2003}, month = {2003///}, author = {Zotkin,Dmitry N and Shamma,S.A. and Ru,P. and Duraiswami, Ramani and Davis, Larry S.} } @article {14061, title = {Augmented intelligibility in simultaneous multi-talker environments}, journal = {Proc. International Conference on Auditory Display (ICAD{\textquoteright}03)}, year = {2003}, month = {2003///}, pages = {71 - 74}, abstract = {Speech intelligibility can be severely compromised inenvironments where there are several competing speakers. It may be possible, however, to improve speech intelligibility in such environments by manipulating certain acoustic parameters known to facilitate the segregation of competing signals. The first step in designing such a feature-rich audio display is to understand the significant elements of human auditory perception that affect information transmission capacity. We review a series of experiments to examine the impact of different audio-display design parameters on overall intelligibility of simultaneous speech messages and show how using these features may improve intelligibility. }, author = {Mesgarani,N. and Shamma,S. and Grant,K.W. and Duraiswami, Ramani} } @article {12397, title = {Automatic classification of multi-word expressions in print dictionaries}, journal = {Lingvisticae Investigationes}, volume = {26}, year = {2003}, month = {2003/01/01/}, pages = {187 - 202}, abstract = {SummaryThis work demonstrates the assignment of multi-word expressions in print dictionaries to POS classes with minimal linguistic resources. In this application, 32,000 entries from the W{\"o}rterbuch der deutschen Idiomatik (H. Schemann 1993) were classified using an inductive description of POS sequences in conjunction with a Brill Tagger trained on manually tagged idiomatic entries. This process assigned categories to 86\% of entries with 88\% accuracy. This classification supplies a meaningful preprocessing step for further applications: the resulting POS-sequences for all idiomatic entries might be used for the automatic recognition of multi-word lexemes in unrestricted text.}, isbn = {03784169}, doi = {10.1075/li.26.2.03gey}, url = {http://umd.library.ingentaconnect.com/content/jbp/li/2003/00000026/00000002/art00002}, author = {Geyken,Alexander and Jordan Boyd-Graber} } @conference {12191, title = {Automatic thumbnail cropping and its effectiveness}, booktitle = {Proceedings of the 16th annual ACM symposium on User interface software and technology}, year = {2003}, month = {2003///}, pages = {95 - 104}, author = {Suh,B. and Ling,H. and Bederson, Benjamin B. and Jacobs, David W.} } @conference {14904, title = {Automatic thumbnail cropping and its effectiveness}, booktitle = {Proceedings of the 16th annual ACM symposium on User interface software and technology}, series = {UIST {\textquoteright}03}, year = {2003}, month = {2003///}, pages = {95 - 104}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Thumbnail images provide users of image retrieval and browsing systems with a method for quickly scanning large numbers of images. Recognizing the objects in an image is important in many retrieval tasks, but thumbnails generated by shrinking the original image often render objects illegible. We study the ability of computer vision systems to detect key components of images so that automated cropping, prior to shrinking, can render objects more recognizable. We evaluate automatic cropping techniques 1) based on a general method that detects salient portions of images, and 2) based on automatic face detection. Our user study shows that these methods result in small thumbnails that are substantially more recognizable and easier to find in the context of visual search.}, keywords = {Face detection, image cropping, saliency map, thumbnail, usability study, visual search, zoomable user interfaces}, isbn = {1-58113-636-6}, doi = {10.1145/964696.964707}, url = {http://doi.acm.org/10.1145/964696.964707}, author = {Suh,Bongwon and Ling,Haibin and Bederson, Benjamin B. and Jacobs, David W.} } @inbook {18896, title = {Automating DAML-S Web Services Composition Using SHOP2}, booktitle = {The Semantic Web - ISWC 2003}, series = {Lecture Notes in Computer Science}, volume = {2870}, year = {2003}, month = {2003///}, pages = {195 - 210}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {The DAML-S Process Model is designed to support the application of AI planning techniques to the automated composition of Web services. SHOP2 is an Hierarchical Task Network (HTN) planner well-suited for working with the Process Model. We have proven the correspondence between the semantics of SHOP2 and the situation calculus semantics of the Process Model. We have also implemented a system which soundly and completely plans over sets of DAML-S descriptions using a SHOP2 planner, and then executes the resulting plans over the Web. We discuss the challenges and difficulties of using SHOP2 in the information-rich and human-oriented context of Web services.}, keywords = {Computer science}, isbn = {978-3-540-20362-9}, url = {http://www.springerlink.com/content/rm5ejwlmbw0mdv97/abstract/}, author = {Wu,Dan and Parsia,Bijan and Sirin,Evren and Hendler,James and Nau, Dana S.}, editor = {Fensel,Dieter and Sycara,Katia and Mylopoulos,John} } @article {13414, title = {AAAI 2002 Workshops}, journal = {AI Magazine}, volume = {23}, year = {2002}, month = {2002/12/15/}, pages = {113 - 113}, isbn = {0738-4602}, doi = {10.1609/aimag.v23i4.1678}, url = {http://www.aaai.org/ojs/index.php/aimagazine/article/viewArticle/1678}, author = {Blake,Brian and Haigh,Karen and Hexmoor,Henry and Falcone,Rino and Soh,Leen-Kiat and Baral,Chitta and McIlraith,Sheila and Gmytrasiewicz,Piotr and Parsons,Simon and Malaka,Rainer and Krueger,Antonio and Bouquet,Paolo and Smart,Bill and Kurumantani,Koichi and Pease,Adam and Brenner,Michael and desJardins, Marie and Junker,Ulrich and Delgrande,Jim and Doyle,Jon and Rossi,Francesca and Schaub,Torsten and Gomes,Carla and Walsh,Toby and Guo,Haipeng and Horvitz,Eric J and Ide,Nancy and Welty,Chris and Anger,Frank D and Guegen,Hans W and Ligozat,Gerald} } @article {16952, title = {ACM{\textquoteright}s computing professionals face new challenges}, journal = {Communications of the ACM}, volume = {45}, year = {2002}, month = {2002/02//}, pages = {31 - 34}, abstract = {Technologists can make a difference on so many critical fronts.}, isbn = {0001-0782}, doi = {10.1145/503124.503142}, url = {http://doi.acm.org/10.1145/503124.503142}, author = {Shneiderman, Ben} } @conference {14795, title = {Active Harmony: Towards Automated Performance Tuning}, booktitle = {Supercomputing, ACM/IEEE 2002 Conference}, year = {2002}, month = {2002/11//}, pages = {44 - 44}, publisher = {IEEE}, organization = {IEEE}, abstract = {In this paper, we present the Active Harmony automated runtime tuning system. We describe the interface used by programs to make applications tunable. We present the Library Specification Layer which helps program library developers expose multiple variations of the same API using different algorithms.The Library Specification Language helps to select the most appropriate program library to tune the overall performance. We also present the optimization algorithm used to adjust parameters in the application and the libraries. Finally, we present results that show how the system is able to tune several real applications. The automated tuning system is able to tune the application parameers to within a few percent of the best value after evaluating only 11 out of over 1,700 possible configurations.}, keywords = {Application software, Automatic control, Computational modeling, Computer science, Computerized monitoring, Control systems, grid computing, Runtime library, software libraries, Specification languages}, isbn = {0-7695-1524-X}, doi = {10.1109/SC.2002.10062}, author = {Tapus, C. and I-Hsin Chung and Hollingsworth, Jeffrey K} } @conference {17883, title = {Active Proxy-G: Optimizing the query execution process in the Grid}, booktitle = {Proceedings of the 2002 ACM/IEEE conference on Supercomputing}, year = {2002}, month = {2002///}, pages = {1 - 15}, author = {Andrade,H. and Kurc, T. and Sussman, Alan and Saltz, J.} } @article {11915, title = {AD (Attacker Defender) Game}, journal = {Technical Reports from UMIACS, UMIACS-TR-2001-45}, year = {2002}, month = {2002/01/31/}, abstract = {Information Dynamics is a framework for agent-based systems that givesa central position to the role of information, time, and the value of information. We illustrate system design in the Information Dynamics Framework by developing an intelligence game called AD involving attackers, defenders and targets operating in some space of locations. The goal of the attackers is to destroy all targets. Target destruction takes place when the number of attackers in the target{\textquoteright}s neighborhood exceeds the number of defenders in this neighborhood by a value WINNING_DIFFERENCE. The goal of defenders is to prevent attackers from achieving their goal. (Also UMIACS-TR-2001-45) }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/1142}, author = {Kochut,Andrzej and Agrawala, Ashok K. and Larsen,Ronald L and A. Udaya Shankar} } @conference {18651, title = {An adaptive framework for tunable consistency and timeliness using replication}, year = {2002}, month = {2002///}, pages = {17 - 26}, abstract = {One well-known challenge in using replication to service multiple clients concurrently is that of delivering a timely and consistent response to the clients. In this paper, we address this problem in the context of client applications that have specific temporal and consistency requirements. These applications can tolerate a certain degree of relaxed consistency, in exchange for better response time. We propose a flexible QoS model that allows these clients to specify their temporal and consistency constraints. In order to select replicas to serve these clients, we need to control of the inconsistency of the replicas, so that we have a large enough pool of replicas with the appropriate state to meet a client{\textquoteright}s timeliness, consistency, and dependability requirements. We describe an adaptive framework that uses lazy update propagation to control the replica inconsistency and employs a probabilistic approach to select replicas dynamically to service a client, based on its QoS specification. The probabilistic approach predicts the ability of a replica to meet a client{\textquoteright}s QoS specification by using the performance history collected by monitoring the replicas at runtime. We conclude with experimental results based on our implementation.}, keywords = {adaptive framework, concurrent multiple client service, consistency requirements, dependability requirements, distributed object management, flexible QoS model, lazy update propagation, performance history, probabilistic approach, Protocols, quality of service, replication, temporal requirements, timely consistent response, tunable consistency, tunable timeliness}, doi = {10.1109/DSN.2002.1028882}, author = {Krishnamurthy, S. and Sanders,W. H. and Michel Cukier} } @article {15685, title = {Adaptive Multimedia System Architecture for Improving QoS inWireless Networks}, journal = {Advances in Multimedia Information Processing{\textemdash}PCM 2002}, year = {2002}, month = {2002///}, pages = {37 - 47}, author = {Mahajan,A. and Mundur, Padma and Joshi,A.} } @article {17680, title = {Addendum to "A Krylov--Schur Algorithm for Large Eigenproblems"}, volume = {UMIACS-TR-2001-90}, year = {2002}, month = {2002/01/31/}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {In this addendum to an earlier paper by the author, it is shown how tocompute a Krylov decomposition corresponding to an arbitrary Rayleigh-Quotient. This decomposition can be used to restart an Arnoldi process, with a selection of the Ritz vectors corresponding to the Rayleigh quotient. (Also UMIACS-TR-2001-90) }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/1171}, author = {Stewart, G.W.} } @conference {17819, title = {Agents dealing with time and uncertainty}, booktitle = {Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 2}, series = {AAMAS {\textquoteright}02}, year = {2002}, month = {2002///}, pages = {912 - 919}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Situated agents in the real world need to handle the fact that events occur frequently, as well as the fact that the agent typically has uncertain knowledge about what is true in the world. The ability to reason about both time and uncertainty is therefore very important. In this paper, we develop a formal theory of agents that can reason about both time and uncertainty. The theory extends the notion of agents described in [10, 21] and proposes the notion of temporal probabilistic (or TP) agents. A formal semantics for TP-agents is proposed - this semantics is described via structures called feasible TP-status interpretations (FTPSI{\textquoteright}s). TP-agents continuously evaluate changes (in the state of the environment they are situated in) and compute appropriate FTPSI{\textquoteright}s. For a class of TP-agents called positive TP-agents, we develop a provably sound and complete procedure to compute FTPSI{\textquoteright}s.}, keywords = {formalisms and logics, logic programming, probabilistic/uncertain reasoning, temporal reasoning, theories of agency}, isbn = {1-58113-480-0}, doi = {10.1145/544862.544953}, url = {http://doi.acm.org/10.1145/544862.544953}, author = {Dix,J{\"u}rgen and Kraus,Sarit and V.S. Subrahmanian} } @book {15676, title = {Algorithm Engineering and Experiments: 4th International Workshop, Alenex 2002, San Francisco, Ca, Usa, January 4-5. 2002 : Revised Papers}, year = {2002}, month = {2002/09/17/}, publisher = {Springer}, organization = {Springer}, abstract = {This book constitutes the thoroughly refereed post-proceedings of the 4th International Workshop on Algorithm Engineering and Experiments, ALENEX 2002, held in San Francisico, CA, USA in January 2002.The 15 revised full papers presented were carefully reviewed and selected from 34 submissions. Among the topics addressed are hewistics for algorithms, combinatorial optimization, searching, graph computation, network optimization, scheduling, computational geometry, sorting, and clustering algorithms.}, keywords = {Architecture / General, Artificial intelligence, Computer algorithms, Computer algorithms/ Congresses, COMPUTERS, Computers / Computer Graphics, Computers / Computer Science, Computers / Data Modeling \& Design, Computers / Data Processing, Computers / General, Computers / Programming / Algorithms, Electronic books, Mathematics / Discrete Mathematics, Medical / General}, isbn = {9783540439776}, author = {Mount, Dave and Stein,Clifford} } @article {15541, title = {Algorithmic issues in modeling motion}, journal = {ACM Comput. Surv.}, volume = {34}, year = {2002}, month = {2002/12//}, pages = {550 - 572}, abstract = {This article is a survey of research areas in which motion plays a pivotal role. The aim of the article is to review current approaches to modeling motion together with related data structures and algorithms, and to summarize the challenges that lie ahead in producing a more unified theory of motion representation that would be useful across several disciplines.}, keywords = {computational geometry, Computer vision, mobile networks, modeling, molecular biology, motion modeling, physical simulation, robotoics, spatio-temporal databases}, isbn = {0360-0300}, doi = {10.1145/592642.592647}, url = {http://doi.acm.org/10.1145/592642.592647}, author = {Agarwal,Pankaj K. and Guibas,Leonidas J. and Edelsbrunner,Herbert and Erickson,Jeff and Isard,Michael and Har-Peled,Sariel and Hershberger,John and Jensen,Christian and Kavraki,Lydia and Koehl,Patrice and Lin,Ming and Manocha,Dinesh and Metaxas,Dimitris and Mirtich,Brian and Mount, Dave and Muthukrishnan,S. and Pai,Dinesh and Sacks,Elisha and Snoeyink,Jack and Suri,Subhash and Wolefson,Ouri} } @conference {16002, title = {ALLI: An Information Integration System Based on Active Logic Framework}, booktitle = {Proceedings of the Third International Conference on Management Information Systems, Greece}, year = {2002}, month = {2002///}, pages = {339 - 348}, author = {Barfourosh,A. A. and Nezhad,H. R.M and Anderson,M. and Perlis, Don} } @article {15682, title = {The Analysis and Performance of Multi-Rate Service in Distributed Video-on-Demand Systems}, journal = {Multimedia Tools and Applications}, volume = {17}, year = {2002}, month = {2002///}, pages = {51 - 75}, author = {Mundur, Padma and Simon,R. and Sood,A.} } @article {12966, title = {Analysis of 16S-23S rRNA intergenic spacer of Vibrio cholerae and Vibrio mimicus for detection of these species}, journal = {METHODS IN MOLECULAR BIOLOGY}, volume = {179}, year = {2002}, month = {2002///}, pages = {171 - 178}, doi = {10.1385/1-59259-238-4:171}, author = {Chun,J. and Rivera,I. N. G. and Rita R Colwell} } @inbook {15578, title = {Analysis of approximate nearest neighbor searching with clustered point sets}, booktitle = {Data Structures, Near Neighbor Searches, and MethodologyData Structures, Near Neighbor Searches, and Methodology}, volume = {59}, year = {2002}, month = {2002///}, pages = {105 - 123}, publisher = {American Mathematical Society}, organization = {American Mathematical Society}, isbn = {0821828924, 9780821828922}, author = {Maneewongvatana,S. and Mount, Dave} } @article {14097, title = {Analysis of stage-specific gene expression in the bloodstream and the procyclic form of Trypanosoma brucei using a genomic DNA-microarray}, journal = {Molecular and Biochemical Parasitology}, volume = {123}, year = {2002}, month = {2002/08/28/}, pages = {115 - 123}, abstract = {A microarray comprising 21[punctuation space]024 different PCR products spotted on glass slides was constructed for gene expression studies on Trypanosoma brucei. The arrayed fragments were generated from a T. brucei shotgun clone library, which had been prepared from randomly sheared and size-fractionated genomic DNA. For the identification of stage-specific gene activity, total RNA from in vitro cultures of the human, long slender form and the insect, procyclic form of the parasite was labelled and hybridised to the microarray. Approximately 75\% of the genomic fragments produced a signal and about 2\% exhibited significant differences between the transcript levels in the bloodstream and procyclic forms. A few results were confirmed by Northern blot analysis or reverse-transcription and PCR. Three hundred differentially regulated clones have been selected for sequencing. So far, of 33 clones that showed about 2-fold or more over-expression in bloodstream forms, 15 contained sequences similar to those of VSG expression sites and at least six others appeared non-protein-coding. Of 29 procyclic-specific clones, at least eight appeared not to be protein-coding. A surprisingly large proportion of known regulated genes was already identified in this small sample, and some new ones were found, illustrating the utility of genomic arrays.}, keywords = {Expression, Gene, Microarray, Regulation, Trypanosoma brucei}, isbn = {0166-6851}, doi = {16/S0166-6851(02)00138-X}, url = {http://www.sciencedirect.com/science/article/pii/S016668510200138X}, author = {Diehl,Susanne and Diehl,Frank and El-Sayed, Najib M. and Clayton,Christine and Hoheisel,J{\"o}rg D.} } @article {12308, title = {Analysis of the NICE Application Layer Multicast Protocol}, journal = {Technical Reports from UMIACS, UMIACS-TR-2002-60}, year = {2002}, month = {2002/08/01/}, abstract = {Application layer multicast protocols organize a set of hosts intoan overlay tree for data delivery. Each host on the overlay peers with a subset of other hosts. Since application layer multicast relies only on an underlying unicast architecture, multiple copies of the same packet can be carried by a single physical link or node on the overlay. The stress at a link or node is defined as the number of identical copies of a packet carried by that link or node. Stretch is another important metric in application layer multicast, which measures the relative increase in delay incurred by the overlay path between pairs of members with respect to the direct unicast path. In this paper we study the NICE application layer multicast protocol to quantify and study the tradeoff between these two important metrics --- stress and stretch in scalably building application layer multicast paths. Also UMIACS-TR-2002-60 }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/1212}, author = {Banerjee,Suman and Bhattacharjee, Bobby} } @conference {15307, title = {Annotating the semantic web using natural language}, booktitle = {Proceedings of the 2nd workshop on NLP and XML - Volume 17}, series = {NLPXML {\textquoteright}02}, year = {2002}, month = {2002///}, pages = {1 - 8}, publisher = {Association for Computational Linguistics}, organization = {Association for Computational Linguistics}, address = {Stroudsburg, PA, USA}, abstract = {Because the ultimate purpose of the Semantic Web is to help users better locate, organize, and process content, we believe that it should be grounded in the information access method humans are most comfortable with---natural language. However, the Resource Description Framework (RDF), the foundation of the Semantic Web, was designed to be easily processed by computers, not humans. To render RDF more friendly to humans, we propose to augment it with natural language annotations, or metadata written in everyday language. We argue that natural language annotations, parsed into computer-readable representations, are not only intuitive and effective, but can also accelerate the pace with which the Semantic Web is being adopted. We believe that our technology can facilitate a happy marriage between natural language technology and the Semantic Web vision.}, doi = {10.3115/1118808.1118816}, url = {http://dx.doi.org/10.3115/1118808.1118816}, author = {Katz,Boris and Jimmy Lin} } @conference {18166, title = {Anti-collusion codes: multi-user and multimedia perspectives}, booktitle = {Image Processing. 2002. Proceedings. 2002 International Conference on}, volume = {2}, year = {2002}, month = {2002///}, pages = {II-149 - II-152 vol.2 - II-149 - II-152 vol.2}, abstract = {Digital fingerprinting is an effective method to identify users who might try to redistribute multimedia content, such as images and video. These fingerprints are typically embedded into the content using watermarking techniques that are designed to be robust to a variety of attacks. A cheap and effective attack against such digital fingerprints is collusion, where several differently marked copies of the same content are averaged or combined to disrupt the underlying fingerprint. We present a construction of collusion-resistant fingerprints based upon anti-collusion codes (ACC) and binary code modulation. ACC have the property that the composition of any subset of K or fewer codevectors is unique. Using this property, we build fingerprints that allow for the identification of groups of K or less colluders. We present a construction of binary-valued ACC under the logical AND operation using the theory of combinatorial designs. Our code construction requires only Oscr;( radic;n) orthogonal signals to accommodate n users. We demonstrate the performance of our ACC for fingerprinting multimedia by identifying colluders through experiments using real images.}, keywords = {and, anti-collusion, authentication;, binary, code, codes;, coding;, combinatorial, computing;, content;, data, designs;, digital, embedding;, encapsulation;, fingerprinting;, image, images;, logical, mathematics;, message, Modulation, modulation;, multimedia, operation;, performance;, watermarking;}, doi = {10.1109/ICIP.2002.1039909}, author = {Trappe,W. and M. Wu and Liu,K. J.R} } @conference {16909, title = {APPOINT: an Approach for Peer-to-Peer Offloading the INTernet}, booktitle = {Proceedings of the 2002 annual national conference on Digital government research}, series = {dg.o {\textquoteright}02}, year = {2002}, month = {2002///}, pages = {1 - 7}, publisher = {Digital Government Society of North America}, organization = {Digital Government Society of North America}, abstract = {The Internet has recently become the medium of interaction with large volumes of online data. Enterprises in the public and private sectors made their data archives available over the Internet. Working with such large volumes of online data is a challenging task. APPOINT (an Approach for Peer-to-Peer Offloading the INTernet), a centralized peer-to-peer approach that helps users of the Internet transfer large volumes of online data efficiently, is introduced with this paper. In APPOINT, active clients of a client-server architecture act on the server{\textquoteright}s behalf and communicate with each other to decrease network latency, improve service bandwidth, and resolve server congestions. In essence, a server is enabled to appoint alternatives when needed and create a scalable collaborative virtual mirror from the active clients. Multiple parameters such as locality and availability to decide on how to best forward a download request are considered. The problems that can arise in symmetric upload requests are also addressed. APPOINT is an ongoing project and it is being built as an add-on to existing client-server systems. A library of functions, with a simple application programming interface (API) that can be used within an existing client-server system to improve the service, is currently being developed.}, url = {http://dl.acm.org/citation.cfm?id=1123098.1123102}, author = {Tanin,Egemen and Samet, Hanan} } @article {14538, title = {Approximating the head-related transfer function using simple geometric models of the head and torso}, journal = {The Journal of the Acoustical Society of America}, volume = {112}, year = {2002}, month = {2002///}, pages = {2053 - 2053}, author = {Algazi,V. R and Duda,R. O and Duraiswami, Ramani and Gumerov, Nail A. and Tang,Z.} } @article {17563, title = {Approximation algorithms for the covering Steiner problem}, journal = {Random Structures \& Algorithms}, volume = {20}, year = {2002}, month = {2002/05/01/}, pages = {465 - 482}, abstract = {The covering Steiner problem is a generalization of both the k-MST and the group Steiner problems: given an edge-weighted graph, with subsets of vertices called the groups, and a nonnegative integer value (called the requirement) for each group, the problem is to find a minimum-weight tree spanning at least the required number of vertices of every group. When all requirements are equal to 1, this becomes the group Steiner problem, while if there is only one group which contains all vertices of the graph the problem reduces to k-MST with k equal to the requirement of this unique group. We discuss two different (but equivalent) linear relaxations of the problem for the case when the given graph is a tree and construct polylogarithmic approximation algorithms based on randomized LP rounding of these relaxations. By using a probabilistic approximation of general metrics by tree metrics due to Bartal, our algorithms also solve the covering Steiner problem on general graphs with a further polylogarithmic worsening in the approximation ratio. {\textcopyright} 2002 Wiley Periodicals, Inc. Random Struct. Alg., 20:465{\textendash}483, 2002}, isbn = {1098-2418}, doi = {10.1002/rsa.10038}, url = {http://onlinelibrary.wiley.com/doi/10.1002/rsa.10038/abstract?systemMessage=Wiley+Online+Library+will+be+disrupted+17+March+from+10-14+GMT+\%2806-10+EDT\%29+for+essential+maintenance}, author = {Konjevod,Goran and Ravi,R. and Srinivasan, Aravind} } @article {12312, title = {Are virtualized overlay networks too much of a good thing?}, journal = {Peer-to-Peer Systems}, year = {2002}, month = {2002///}, pages = {225 - 231}, abstract = {The majority of recent high-profile work in peer-to-peer networks has approached the problem of location by abstracting over object lookup services. Namespace virtualization in the overlay layer provides load balance and provable bounds on latency at low costs.We contend that namespace virtualization comes at a significant cost for applications that naturally describe their data sets in a hierarchical manner. Opportunities for enhancing browsing, prefetching and efficient attribute-based searches are lost. A hierarchy exposes relationships between items near to each other in the topology; virtualization of the namespace discards this information even if present at client, higherlevel protocols. We advocate encoding application hierarchies directly into the structure of the overlay network, and revisit this argument through a newly proposed distributed directory service. }, author = {Keleher,P. and Bhattacharjee, Bobby and Silaghi,B.} } @conference {18933, title = {Argument structure saturation in a constraint based model}, year = {2002}, month = {2002///}, url = {http://cognet.mit.edu/library/conferences/paper?paper_id=55048}, author = {Drury,J. and Resnik, Philip and Weinberg, Amy and Gennari,S. and Aoshima,S.} } @inbook {16960, title = {An Augmented Visual Query Mechanism for Finding Patterns in Time Series Data}, booktitle = {Flexible Query Answering SystemsFlexible Query Answering Systems}, series = {Lecture Notes in Computer Science}, volume = {2522}, year = {2002}, month = {2002///}, pages = {240 - 250}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {Relatively few query tools exist for data exploration and pattern identification in time series data sets. In previous work we introduced Timeboxes . Timeboxes are rectangular, direct-manipulation queries for studying time-series datasets. We demonstrated how Timeboxes can be used to support interactive exploration via dynamic queries, along with overviews of query results and drag-and-drop support for query-by-example. In this paper, we extend our work by introducing Variable Time Timeboxes (VTT). VTTs are a natural generalization of Timeboxes, which permit the specification of queries that allow a degree of uncertainty in the time axis. We carefully motivate the need for these more expressive queries, and demonstrate the utility of our approach on several data sets.}, isbn = {978-3-540-00074-7}, url = {http://dx.doi.org/10.1007/3-540-36109-X_19}, author = {Keogh,Eamonn and Hochheiser,Harry and Shneiderman, Ben}, editor = {Carbonell,Jaime and Siekmann,J{\"o}rg and Andreasen,Troels and Christiansen,Henning and Motro,Amihai and Legind Larsen,Henrik} } @article {18737, title = {Automated design of multi-stage molds for manufacturing multi-material objects}, journal = {Journal of Mechanical Design}, volume = {124}, year = {2002}, month = {2002///}, pages = {399 - 399}, author = {Kumar,M. and Gupta,S.K.} } @article {13727, title = {Automatic headline generation for newspaper stories}, journal = {Proceedings of the ACL-2002 Workshop on Text Summarization}, year = {2002}, month = {2002///}, abstract = {In this paper we propose a novelapplication of Hidden Markov Models to automatic generation of informative headlines for English texts. We propose four decoding parameters to make the headlines appear more like Headlinese, the language of informative newspaper headlines. We also allow for morphological variation in words between headline and story English. Informal and formal evaluations indicate that our approach produces informative headlines, mimicking a Headlinese style generated by humans. }, author = {Zajic, David and Dorr, Bonnie J and Schwartz,R.} } @conference {13729, title = {Automatic transcription of Czech language oral history in the MALACH project: resources and initial experiments}, booktitle = {Proceedings of the The 5th International Conference on Text, Speech and Dialogue}, year = {2002}, month = {2002///}, pages = {57 - 64}, author = {Oard, Douglas and Demner-Fushman,D. and Hajic,J. and Ramabhadran,B. and Gustman,S. and Byrne,WJ and Soergel,D. and Dorr, Bonnie J and Resnik, Philip and Picheny,M.} } @article {14783, title = {Achieving Efficiency and Accuracy in Simulation for I/O-Intensive Applications}, journal = {Journal of Parallel and Distributed Computing}, volume = {61}, year = {2001}, month = {2001/12//}, pages = {1732 - 1750}, abstract = {This paper presents a family of simulators for data-intensive applications, and a methodology to select the most efficient simulator based on a user-supplied requirement for accuracy. The methodology consists of a series of tests that select an appropriate simulation based on the attributes of the application. In addition, each simulator provides two estimates of application execution time: one for the minimum expected time and the other for the maximum. We present the results of applying the strategy to existing applications and show that we can accurately simulate applications tens to hundreds of times faster than application execution time.}, keywords = {simulation; I/O-intensive applications; parallel or distributed applications; performance prediction; discrete-event simulation}, isbn = {0743-7315}, doi = {06/jpdc.2001.1769}, url = {http://www.sciencedirect.com/science/article/pii/S0743731501917691}, author = {Eom, Hyeonsang and Hollingsworth, Jeffrey K} } @conference {18466, title = {Active speech source localization by a dual coarse-to-fine search}, booktitle = {2001 IEEE International Conference on Acoustics, Speech, and Signal Processing, 2001. Proceedings. (ICASSP {\textquoteright}01)}, volume = {5}, year = {2001}, month = {2001///}, pages = {3309-3312 vol.5 - 3309-3312 vol.5}, publisher = {IEEE}, organization = {IEEE}, abstract = {Accurate and fast localization of multiple speech sound sources is a significant problem in videoconferencing systems. Based on the observation that the wavelengths of the sound from a speech source are comparable to the dimensions of the space being searched, and that the source is broadband, we develop an efficient search strategy that finds the source(s) in a given space. The search is made efficient by using coarse-to-fine strategies in both space and frequency. The algorithm is shown to be robust compared to typical delay-based estimators and fast enough for real-time implementation. Its performance can be further improved by using constraints from computer vision}, keywords = {active speech source localization, array signal processing, Computer interfaces, Delay effects, delay estimation, delay-based estimators, dual coarse-to-fine search, Frequency, Inverse problems, Laboratories, multiple speech sound sources, Position measurement, real-time implementation, Sensor arrays, Signal processing algorithms, space, speech, Speech processing, Teleconferencing, videoconferencing systems}, isbn = {0-7803-7041-4}, doi = {10.1109/ICASSP.2001.940366}, author = {Duraiswami, Ramani and Zotkin,Dmitry N and Davis, Larry S.} } @article {18650, title = {An adaptive algorithm for tolerating value faults and crash failures}, journal = {Parallel and Distributed Systems, IEEE Transactions on}, volume = {12}, year = {2001}, month = {2001/02//}, pages = {173 - 192}, abstract = {The AQuA architecture provides adaptive fault tolerance to CORBA applications by replicating objects and providing a high-level method that an application can use to specify its desired level of dependability. This paper presents the algorithms that AQUA uses, when an application{\textquoteright}s dependability requirements can change at runtime, to tolerate both value faults in applications and crash failures simultaneously. In particular, we provide an active replication communication scheme that maintains data consistency among replicas, detects crash failures, collates the messages generated by replicated objects, and delivers the result of each vote. We also present an adaptive majority voting algorithm that enables the correct ongoing vote while both the number of replicas and the majority size dynamically change. Together, these two algorithms form the basis of the mechanism for tolerating and recovering from value faults and crash failures in AQuA}, keywords = {active replication communication, adaptive algorithm, adaptive fault tolerance, adaptive majority voting algorithm, AQuA architecture, client-server systems, CORBA, crash failures, data consistency, data integrity, Dependability, distributed object management, fault tolerant computing, objects replication, value faults}, isbn = {1045-9219}, doi = {10.1109/71.910872}, author = {Ren,Yansong and Michel Cukier and Sanders,W. H.} } @conference {12335, title = {Adaptive negative cycle detection in dynamic graphs}, booktitle = {Circuits and Systems, 2001. ISCAS 2001. The 2001 IEEE International Symposium on}, volume = {5}, year = {2001}, month = {2001///}, pages = {163 - 166}, author = {Chandrachoodan,N. and Bhattacharyya, Shuvra S. and Liu,K. J.R} } @article {17681, title = {Adjusting the Rayleigh Quotient in Semiorthogonal Lanczos Methods}, volume = {UMIACS-TR-2001-31}, year = {2001}, month = {2001/05/10/}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {In a semiorthogonal Lanczos algorithm, the orthogonality of theLanczos vectors is allowed to deteriorate to roughly the square root of the rounding unit, after which the current vectors are reorthogonalized. A theorem of Simon \cite{simo:84} shows that the Rayleigh quotient\,---\,i.e., the tridiagonal matrix produced by the Lanczos recursion\,---\,contains fully accurate approximations to the Ritz values in spite of the lack of orthogonality. Unfortunately, the same lack of orthogonality can cause the Ritz vectors to fail to converge. It also makes the classical estimate for the residual norm misleadingly small. In this note we show how to adjust the Rayleigh quotient to overcome this problem. (Cross-referenced as UMIACS-TR-2001-31) }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/1132}, author = {Stewart, G.W.} } @conference {15646, title = {Algorithms for facility location problems with outliers}, booktitle = {Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms}, series = {SODA {\textquoteright}01}, year = {2001}, month = {2001///}, pages = {642 - 651}, publisher = {Society for Industrial and Applied Mathematics}, organization = {Society for Industrial and Applied Mathematics}, address = {Philadelphia, PA, USA}, abstract = {Facility location problems are traditionally investigated with the assumption that all the clients are to be provided service. A significant shortcoming of this formulation is that a few very distant clients, called outliers, can exert a disproportionately strong influence over the final solution. In this paper we explore a generalization of various facility location problems (K-center, K-median, uncapacitated facility location etc) to the case when only a specified fraction of the customers are to be served. What makes the problems harder is that we have to also select the subset that should get service. We provide generalizations of various approximation algorithms to deal with this added constraint.}, isbn = {0-89871-490-7}, url = {http://dl.acm.org/citation.cfm?id=365411.365555}, author = {Charikar,Moses and Khuller, Samir and Mount, Dave and Narasimhan,Giri} } @article {14595, title = {Analysis and prediction of protein functional sub-types from protein sequence alignments}, volume = {EP20000203764}, year = {2001}, month = {2001/05/02/}, abstract = {Here we present a method for analysis and prediction of functional sub-types from multiple protein sequence alignments. Given an alignment and set of proteins grouped into sub-types according to some definition of function, such as enzymatic specificity, the method identifies positions that are indicative of functional differences by subtraction of sequence profiles, and analysis of positional entropy in the alignment.}, url = {http://www.freepatentsonline.com/EP1096411.html}, author = {Hannenhalli, Sridhar and Russell,Robert B.}, editor = {SMITHKLINE BEECHAM CORP (US) SMITHKLINE BEECHAM PLC (GB)} } @article {14067, title = {Analysis of a donor gene region for a variant surface glycoprotein and its expression site in African trypanosomes}, journal = {Nucleic acids research}, volume = {29}, year = {2001}, month = {2001///}, pages = {2012 - 2012}, author = {LaCount,D. J and El-Sayed, Najib M. and Kaul,S. and Wanless,D. and Turner,C. M.R and Donelson,J. E} } @article {15556, title = {The analysis of a probabilistic approach to nearest neighbor searching}, journal = {Algorithms and Data Structures}, year = {2001}, month = {2001///}, pages = {276 - 286}, abstract = {Given a set S of n data points in some metric space. Given a query point q in this space, a nearest neighbor query asks for the nearest point of S to q. Throughout we will assume that the space is real d-dimensional space Rd, and the metric is Euclidean distance. The goal is to preprocess S into a data structure so that such queries can be answered efficiently. Nearest neighbor searching has applications in many areas, including data mining [7], pattern classification [5], data compression [10].}, doi = {10.1007/3-540-44634-6_26}, author = {Maneewongvatana,S. and Mount, Dave} } @conference {18164, title = {Analysis of attacks on SDMI audio watermarks}, booktitle = {Acoustics, Speech, and Signal Processing, 2001. Proceedings. (ICASSP {\textquoteright}01). 2001 IEEE International Conference on}, volume = {3}, year = {2001}, month = {2001///}, pages = {1369 -1372 vol.3 - 1369 -1372 vol.3}, abstract = {This paper explains and analyzes the successful attacks submitted by the authors on four audio watermark proposals during a 3-week SDMI public challenge. Our analysis points out some weaknesses in the watermark techniques currently under SDMI consideration and suggests directions for further improvement. The paper also discusses the framework and strategies for analyzing the robustness and security of watermarking systems as well as the difficulty, uniqueness, and unrealistic expectations of the attack setup}, keywords = {attacks;watermark, audio, coding;copy, digital, encapsulation;, Initiative;attack, Music, protection;data, SDMI, setup;robustness;security;successful, watermarks;Secure, weaknesses;audio}, doi = {10.1109/ICASSP.2001.941183}, author = {M. Wu and Craver,S. and Felten,E.W. and Liu,B.} } @article {14198, title = {Animated heads: From 3d motion fields to action descriptions}, journal = {Proceedings of the IFIP TC5/WG5}, volume = {10}, year = {2001}, month = {2001///}, pages = {1 - 11}, author = {Neumann, J. and Ferm{\"u}ller, Cornelia and Aloimonos, J.} } @article {15596, title = {Approximating large convolutions in digital images}, journal = {Image Processing, IEEE Transactions on}, volume = {10}, year = {2001}, month = {2001/12//}, pages = {1826 - 1835}, abstract = {Computing discrete two-dimensional (2-D) convolutions is an important problem in image processing. In mathematical morphology, an important variant is that of computing binary convolutions, where the kernel of the convolution is a 0-1 valued function. This operation can be quite costly, especially when large kernels are involved. We present an algorithm for computing convolutions of this form, where the kernel of the binary convolution is derived from a convex polygon. Because the kernel is a geometric object, we allow the algorithm some flexibility in how it elects to digitize the convex kernel at each placement, as long as the digitization satisfies certain reasonable requirements. We say that such a convolution is valid. Given this flexibility we show that it is possible to compute binary convolutions more efficiently than would normally be possible for large kernels. Our main result is an algorithm which, given an m times;n image and a k-sided convex polygonal kernel K, computes a valid convolution in O(kmn) time. Unlike standard algorithms for computing correlations and convolutions, the running time is independent of the area or perimeter of K, and our techniques do not rely on computing fast Fourier transforms. Our algorithm is based on a novel use of Bresenham{\textquoteright}s (1965) line-drawing algorithm and prefix-sums to update the convolution incrementally as the kernel is moved from one position to another across the image}, keywords = {2D, algorithm;binary, approximation;mathematical, convolution, convolution;binary, convolutions;Bresenham{\textquoteright}s, convolutions;convex, convolutions;geometric, images;discrete, kernel;convex, kernel;digital, line-drawing, morphology;, morphology;approximation, object;image, polygonal, processing;large, processing;mathematical, theory;convolution;image, two-dimensional}, isbn = {1057-7149}, doi = {10.1109/83.974567}, author = {Mount, Dave and Kanungo,T. and Netanyahu,N. S and Piatko,C. and Silverman,R. and Wu,A. Y} } @article {15236, title = {Approximation algorithms for partial covering problems}, journal = {Automata, Languages and Programming}, year = {2001}, month = {2001///}, pages = {225 - 236}, abstract = {We study the generalization of covering problems to partial covering. Here we wish to cover only a desired number of elements, rather than covering all elements as in standard covering problems. For example, in k-set cover, we wish to choose a minimum number of sets to cover at least k elements. For k-set cover, if each element occurs in at most f sets, then we derive a primal-dual f-approximation algorithm (thus implying a 2-approximation for k-vertex cover) in polynomial time. In addition to its simplicity, this algorithm has the advantage of being parallelizable. For instances where each set has cardinality at most three, we obtain an approximation of 4/3. We also present better-than-2-approximation algorithms for k-vertex cover on bounded degree graphs, and for vertex cover on expanders of bounded average degree. We obtain a polynomial-time approximation scheme for k-vertex cover on planar graphs, and for covering points in R d by disks.}, doi = {10.1007/3-540-48224-5_19}, author = {Gandhi,R. and Khuller, Samir and Srinivasan, Aravind} } @conference {15353, title = {Assessment of the k-epsilon turbulence model for compressible flows using direct simulation data}, booktitle = {39th AIAA Aerospace Sciences Meeting and Exhibit}, year = {2001}, month = {2001///}, address = {Reno, NV}, abstract = {We evaluate the k-epsilon turbulence model using direct numerical simulation (DNS) data of a Mach 4 boundary layer. We find that the low Reynolds number damping functions for the Reynolds stress must be corrected by the density ratio to match the DNS data. We present the budget of the k equation and assess the modeling of the various source terms. The models for all the source terms, except for the production and dilatational dissipation terms, are found to be adequate. Finally, we present the solenoidal dissipation rate equation and compute its budget using the boundary layer data. We compare this equation with the dissipation rate equation in an incompressible flow to show the equivalence between the two equations. This is the basis for modeling the solenoidal dissipation equation. However, an additional term in the equation due to variation of fluid viscosity needs to be modeled.}, author = {Sinha,K. and Candler,G. V and Martin, M.P} } @conference {18318, title = {Attentive toys}, booktitle = {International Conference on Multimedia and Expo}, volume = {22}, year = {2001}, month = {2001///}, pages = {25 - 25}, author = {Haritaoglu,I. and Cozzi,A. and Koons,D. and Flickner,M. and Zotkin,Dmitry N and Yacoob,Yaser} } @article {18815, title = {Automated design of sheet metal punches for bending multiple parts in a single setup}, journal = {Robotics and Computer-Integrated Manufacturing}, volume = {17}, year = {2001}, month = {2001/02//}, pages = {33 - 47}, abstract = {Sheet metal bending is a process in which bends are formed using a combination of a punch and a die. A very large number of mechanical products such as furniture panels, shelves, cabinets, housing for electro-mechanical devices, etc. are created by using the sheet metal bending process. Bending tools need to satisfy the following two criteria: (1) tools should be able to withstand bending forces, and (2) tool shapes should be such that there is no tool-part interference. In this paper, we describe a methodology for automatically designing shapes of bending punches for bending multiple parts in a single setup. We create parametric geometric models of punches. These parametric models describe the family of possible punch shapes. Using the part geometry and parametric punch shape models, we automatically generated constraints on tool parameters that eliminate the possibility of part-tool interference. We use mixed-integer techniques to identify parameters of punch shapes that result in the maximum punch strength. Finally, we perform strength analysis of the designed punch shape using finite element analysis methods, to verify that the designed punch shape is capable of withstanding the bending forces.}, keywords = {Praess planning, Punch design, Sheet metal bending}, isbn = {0736-5845}, doi = {10.1016/S0736-5845(00)00035-1}, url = {http://www.sciencedirect.com/science/article/pii/S0736584500000351}, author = {Alva,Ujval and Gupta, Satyandra K.} } @conference {12823, title = {Automated Validation of Software Models}, booktitle = {Automated Software Engineering, International Conference on}, year = {2001}, month = {2001///}, pages = {91 - 91}, publisher = {IEEE Computer Society}, organization = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, abstract = {This paper describes the application of an automated verification tool to a software model developed at Ford. Ford already has in place an advanced model-based software development framework that employs the Matlab?, Simulink?, and Stateflow? modeling tools. During this project we applied the invariant checker Salsa to a Simulink?/ Stateflow? model of automotive software to check for nondeterminism, missing cases, dead code, and redundant code. During the analysis, a number of anomalies were detected that had not been found during manual review. We argue that the detection and correction of these problems demonstrates a cost-effective application of formal verification that elevates our level of confidence in the model.}, isbn = {0-7695-1426-X}, doi = {http://doi.ieeecomputersociety.org/10.1109/ASE.2001.989794}, author = {Sims,Steve and Cleaveland, Rance and Butts,Ken and Ranville,Scott} } @conference {19653, title = {Automatically Tracking and Analyzing the Behavior of Live Insect Colonies}, booktitle = {AGENTS {\textquoteright}01 Proceedings of the Fifth International Conference on Autonomous Agents }, series = {AGENTS {\textquoteright}01}, year = {2001}, month = {2001///}, pages = {521 - 528}, publisher = {ACM}, organization = {ACM}, abstract = {We introduce the study of {\it live} social insect colonies as a relevant and exciting domain for the development and application of multi-agent systems modeling tools. Social insects provide a rich source of {\it traceable} social behavior for testing multi-agent tracking, prediction and modeling algorithms. An additional benefit of this research is the potential for contributions to experimental biology --- the principled techniques developed for analyzing artificial multi-agent systems can be applied to advance the state of knowledge of insect behavior. We contribute a novel machine vision system that addresses the challenge of tracking hundreds of small animals simultaneously. Fast color-based tracking is combined with movement-based tracking to locate ants in a real-time video stream. We also introduce new methods for analyzing the spatial activity of ant colonies. The system was validated in experiments with laboratory colonies of {\it Camponotus festinatus} and several example analyses of the colonies{\textquoteright} spatial behavior are provided.}, isbn = {1-58113-326-X}, url = {http://doi.acm.org/10.1145/375735.376434}, author = {Balch, Tucker and Zia Khan and Veloso, Manuela} } @inbook {14659, title = {Active Networking Means Evolution (or Enhanced Extensibility Required)}, booktitle = {Active NetworksActive Networks}, series = {Lecture Notes in Computer Science}, volume = {1942}, year = {2000}, month = {2000///}, pages = {16 - 32}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {A primary goal of active networking is to increase the pace of network evolution. Evolution is typically achieved via extensibility; that is, typical active network implementations provide an interface to extend network nodes withdyna mically loaded code. Most implementations employ plug-in extensibility , a technique for loading code characterized by a concrete, pre-defined abstraction of future change. While flexible and convenient, we argue that plug-in extensibility alone is not sufficient for true network evolution. Instead, we propose dynamic software updating , a technique that reduces the a priori assumptions of plug-in extensibility, improving flexibility and eliminating the need to pre-plan extensions. However, this additional flexibility creates issues involving validity and security. We discuss these issues, and describe the state-of-the-art in systems that support dynamic software updating, thus framing the problem for researchers developing next-generation active networks.}, isbn = {978-3-540-41179-6}, url = {http://dx.doi.org/10.1007/3-540-40057-5_2}, author = {Hicks, Michael W. and Nettles,Scott}, editor = {Yasuda,Hiroshi} } @article {18475, title = {Active source location and beamforming}, journal = {The Journal of the Acoustical Society of America}, volume = {107}, year = {2000}, month = {2000///}, pages = {2790 - 2790}, isbn = {00014966}, doi = {10.1121/1.428978}, url = {http://asadl.org/jasa/resource/1/jasman/v107/i5/p2790_s4}, author = {Duraiswami, Ramani and Zotkin,Dmitry N and Borovikov,Eugene A. and Davis, Larry S.} } @article {13353, title = {Adaptive query processing: Technology in evolution}, journal = {IEEE Data Engineering Bulletin}, volume = {23}, year = {2000}, month = {2000///}, pages = {7 - 18}, abstract = {As query engines are scaled and federated, they must cope with highly unpredictable and changeableenvironments. In the Telegraph project, we are attempting to architect and implement a continuously adaptive query engine suitable for global-area systems, massive parallelism, and sensor networks. To set the stage for our research, we present a survey of prior work on adaptive query processing, focusing on three characterizations of adaptivity: the frequency of adaptivity, the effects of adaptivity, and the extent of adaptivity. Given this survey, we sketch directions for research in the Telegraph project. }, author = {Hellerstein,J. M and Franklin,M.J. and Chandrasekaran,S. and Deshpande, Amol and Hildrum,K. and Madden,S. and Raman,V. and Shah,M. A} } @article {15709, title = {Adaptive Use of Iterative Methods in Predictor-Corrector Interior Point Methods for Linear Programming}, journal = {Numerical Algorithms}, volume = {25}, year = {2000}, month = {2000///}, pages = {387 - 406}, abstract = {In this work we devise efficient algorithms for finding the search directions for interior point methods applied to linear programming problems. There are two innovations. The first is the use of updating of preconditioners computed for previous barrier parameters. The second is an adaptive automated procedure for determining whether to use a direct or iterative solver, whether to reinitialize or update the preconditioner, and how many updates to apply. These decisions are based on predictions of the cost of using the different solvers to determine the next search direction, given costs in determining earlier directions. We summarize earlier results using a modified version of the OB1-R code of Lustig, Marsten, and Shanno, and we present results from a predictor{\textendash}corrector code PCx modified to use adaptive iteration. If a direct method is appropriate for the problem, then our procedure chooses it, but when an iterative procedure is helpful, substantial gains in efficiency can be obtained.}, author = {Wang,Weichung and O{\textquoteright}Leary, Dianne P.} } @article {14089, title = {The African trypanosome genome}, journal = {International Journal for Parasitology}, volume = {30}, year = {2000}, month = {2000/04//}, pages = {329 - 345}, abstract = {The haploid nuclear genome of the African trypanosome, Trypanosoma brucei, is about 35 Mb and varies in size among different trypanosome isolates by as much as 25\%. The nuclear DNA of this diploid organism is distributed among three size classes of chromosomes: the megabase chromosomes of which there are at least 11 pairs ranging from 1 Mb to more than 6 Mb (numbered I-XI from smallest to largest); several intermediate chromosomes of 200-900 kb and uncertain ploidy; and about 100 linear minichromosomes of 50-150 kb. Size differences of as much as four-fold can occur, both between the two homologues of a megabase chromosome pair in a specific trypanosome isolate and among chromosome pairs in different isolates. The genomic DNA sequences determined to date indicated that about 50\% of the genome is coding sequence. The chromosomal telomeres possess TTAGGG repeats and many, if not all, of the telomeres of the megabase and intermediate chromosomes are linked to expression sites for genes encoding variant surface glycoproteins (VSGs). The minichromosomes serve as repositories for VSG genes since some but not all of their telomeres are linked to unexpressed VSG genes. A gene discovery program, based on sequencing the ends of cloned genomic DNA fragments, has generated more than 20 Mb of discontinuous single-pass genomic sequence data during the past year, and the complete sequences of chromosomes I and II (about 1 Mb each) in T. brucei GUTat 10.1 are currently being determined. It is anticipated that the entire genomic sequence of this organism will be known in a few years. Analysis of a test microarray of 400 cDNAs and small random genomic DNA fragments probed with RNAs from two developmental stages of T. brucei demonstrates that the microarray technology can be used to identify batteries of genes differentially expressed during the various life cycle stages of this parasite.}, isbn = {0020-7519}, doi = {16/S0020-7519(00)00015-1}, url = {http://www.sciencedirect.com/science/article/pii/S0020751900000151}, author = {El-Sayed, Najib M. and Hegde,Priti and Quackenbush,John and Melville,Sara E. and Donelson,John E.} } @article {14661, title = {Agents in Network Management}, journal = {Technical Reports (CIS)}, year = {2000}, month = {2000/02/26/}, abstract = {The ubiquity and complexity of modern networks require automated management and control. With increases in scale, automated solutions based on simple data access models such as SNMP will give way to more distributed and algorithmic techniques. This article outlines present and near-term solutions based on the ideas of active networks and mobile agents, which permit sophisticated programmable control and management of ultra large scale networks.}, url = {http://repository.upenn.edu/cis_reports/138}, author = {Ertugay,Osman and Hicks, Michael W. and Smith,Jonathan and Kornblum,Jessica} } @article {15711, title = {Algorithm 805: computation and uses of the semidiscrete matrix decomposition}, journal = {ACM Trans. Math. Softw.}, volume = {26}, year = {2000}, month = {2000/09//}, pages = {415 - 435}, abstract = {We present algorithms for computing a semidiscrete approximation to a matrix in a weighted norm, with the Frobenius norm as a special case. The approximation is formed as a weighted sum of outer products of vectors whose elements are {\textpm}1 or 0, so the storage required by the approximation is quite small. We also present a related algorithm for approximation of a tensor. Applications of the algorithms are presented to data compression, filtering, and information retrieval; software is provided in C and in Matlab.}, keywords = {compression, latent semantic indexing, Matrix decomposition, semidiscrete decompositin, singular value decomposition}, isbn = {0098-3500}, doi = {10.1145/358407.358424}, url = {http://doi.acm.org/10.1145/358407.358424}, author = {Kolda,Tamara G. and O{\textquoteright}Leary, Dianne P.} } @article {14594, title = {Analysis and prediction of functional sub-types from protein sequence alignments}, journal = {Journal of Molecular Biology}, volume = {303}, year = {2000}, month = {2000/10/13/}, pages = {61 - 76}, abstract = {The increasing number and diversity of protein sequence families requires new methods to define and predict details regarding function. Here, we present a method for analysis and prediction of functional sub-types from multiple protein sequence alignments. Given an alignment and set of proteins grouped into sub-types according to some definition of function, such as enzymatic specificity, the method identifies positions that are indicative of functional differences by comparison of sub-type specific sequence profiles, and analysis of positional entropy in the alignment. Alignment positions with significantly high positional relative entropy correlate with those known to be involved in defining sub-types for nucleotidyl cyclases, protein kinases, lactate/malate dehydrogenases and trypsin-like serine proteases. We highlight new positions for these proteins that suggest additional experiments to elucidate the basis of specificity. The method is also able to predict sub-type for unclassified sequences. We assess several variations on a prediction method, and compare them to simple sequence comparisons. For assessment, we remove close homologues to the sequence for which a prediction is to be made (by a sequence identity above a threshold). This simulates situations where a protein is known to belong to a protein family, but is not a close relative of another protein of known sub-type. Considering the four families above, and a sequence identity threshold of 30 \%, our best method gives an accuracy of 96 \% compared to 80 \% obtained for sequence similarity and 74 \% for BLAST. We describe the derivation of a set of sub-type groupings derived from an automated parsing of alignments from PFAM and the SWISSPROT database, and use this to perform a large-scale assessment. The best method gives an average accuracy of 94 \% compared to 68 \% for sequence similarity and 79 \% for BLAST. We discuss implications for experimental design, genome annotation and the prediction of protein function and protein intra-residue distances.}, keywords = {prediction, protein function, protein structure, sequence alignment}, isbn = {0022-2836}, doi = {10.1006/jmbi.2000.4036}, url = {http://www.sciencedirect.com/science/article/pii/S0022283600940361}, author = {Hannenhalli, Sridhar and Russell,Robert B.} } @conference {15639, title = {The analysis of a simple k-means clustering algorithm}, booktitle = {Proceedings of the sixteenth annual symposium on Computational geometry}, series = {SCG {\textquoteright}00}, year = {2000}, month = {2000///}, pages = {100 - 109}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, isbn = {1-58113-224-7}, doi = {10.1145/336154.336189}, url = {http://doi.acm.org/10.1145/336154.336189}, author = {Kanungo,Tapas and Mount, Dave and Netanyahu,Nathan S. and Piatko,Christine and Silverman,Ruth and Wu,Angela Y.} } @inbook {14197, title = {Analyzing Action Representations}, booktitle = {Algebraic Frames for the Perception-Action CycleAlgebraic Frames for the Perception-Action Cycle}, series = {Lecture Notes in Computer Science}, volume = {1888}, year = {2000}, month = {2000///}, pages = {1 - 21}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {We argue that actions represent the basic seed of intelligence underlying perception of the environment, and the representations encoding actions should be the starting point upon which further studies of cognition are built. In this paper we make a first effort in characterizing these action representations. In particular, from the study of simple actions related to 3D rigid motion interpretation, we deduce a number of principles for the possible computations responsible for the interpretation of space-time geometry. Using these principles, we then discuss possible avenues on how to proceed in analyzing the representations of more complex human actions.}, isbn = {978-3-540-41013-3}, url = {http://dx.doi.org/10.1007/10722492_1}, author = {Aloimonos, J. and Ferm{\"u}ller, Cornelia}, editor = {Sommer,Gerald and Zeevi,Yehoshua} } @article {14802, title = {An API for Runtime Code Patching}, journal = {International Journal of High Performance Computing Applications}, volume = {14}, year = {2000}, month = {2000///}, pages = {317 - 329}, abstract = {The authors present a postcompiler program manipulation tool called Dyninst, which provides a C++ class library for program instrumentation. Using this library, it is possible to instrument and modify application programs during execution. A unique feature of this library is that it permits machine-independent binary instrumentation programs to be written. The authors describe the interface that a tool sees when using this library. They also discuss three simple tools built using this interface: a utility to count the number of times a function is called, a program to capture the output of an already running program to a file, and an implementation of conditional breakpoints. For the conditional breakpoint example, the authors show that by using their interface compared with gdb, they are able to execute a program with conditional breakpoints up to 900 times faster.}, doi = {10.1177/109434200001400404}, url = {http://hpc.sagepub.com/content/14/4/317.abstract}, author = {Buck, Bryan and Hollingsworth, Jeffrey K} } @article {15563, title = {Approximate range searching}, journal = {Computational Geometry}, volume = {17}, year = {2000}, month = {2000/12//}, pages = {135 - 152}, abstract = {The range searching problem is a fundamental problem in computational geometry, with numerous important applications. Most research has focused on solving this problem exactly, but lower bounds show that if linear space is assumed, the problem cannot be solved in polylogarithmic time, except for the case of orthogonal ranges. In this paper we show that if one is willing to allow approximate ranges, then it is possible to do much better. In particular, given a bounded range Q of diameter w and ε\>0, an approximate range query treats the range as a fuzzy object, meaning that points lying within distance εw of the boundary of Q either may or may not be counted. We show that in any fixed dimension d, a set of n points in Rd can be preprocessed in O(n+logn) time and O(n) space, such that approximate queries can be answered in O(logn(1/ε)d) time. The only assumption we make about ranges is that the intersection of a range and a d-dimensional cube can be answered in constant time (depending on dimension). For convex ranges, we tighten this to O(logn+(1/ε)d-1) time. We also present a lower bound for approximate range searching based on partition trees of Ω(logn+(1/ε)d-1), which implies optimality for convex ranges (assuming fixed dimensions). Finally, we give empirical evidence showing that allowing small relative errors can significantly improve query execution times.}, keywords = {Approximation algorithms, Box-decomposition trees, Partition trees, Range searching}, isbn = {0925-7721}, doi = {10.1016/S0925-7721(00)00022-5}, url = {http://www.sciencedirect.com/science/article/pii/S0925772100000225}, author = {Arya,Sunil and Mount, Dave} } @article {17555, title = {Approximating low-congestion routing and column-restricted packing problems}, journal = {Information Processing Letters}, volume = {74}, year = {2000}, month = {2000/04//}, pages = {19 - 25}, abstract = {We contribute to a body of research asserting that the fractional and integral optima of column-sparse integer programs are {\textquotedblleft}nearby{\textquotedblright}. This yields improved approximation algorithms for some generalizations of the knapsack problem, with applications to low-congestion routing in networks, file replication in distributed databases, and other packing problems.}, keywords = {algorithms, Approximation algorithms, integer programming, Packing, Routing}, isbn = {0020-0190}, doi = {10.1016/S0020-0190(00)00033-8}, url = {http://www.sciencedirect.com/science/article/pii/S0020019000000338}, author = {Baveja,Alok and Srinivasan, Aravind} } @article {17560, title = {Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems}, journal = {Mathematics of Operations ResearchMathematics of Operations Research}, volume = {25}, year = {2000}, month = {2000/05/01/}, pages = {255 - 280}, abstract = {Given a network and a set of connection requests on it, we consider the maximum edge-disjoint paths and related generalizations and routing problems that arise in assigning paths for these requests. We present improved approximation algorithms and/or integrality gaps for all problems considered; the central theme of this work is the underlying multicommodity flow relaxation. Applications of these techniques to approximating families of packing integer programs are also presented.}, keywords = {Approximation algorithms, Disjoint paths, integer programming, Linear programming, multicommodity flow, Packing, randomized algorithms, rounding, Routing, unsplittable flow}, isbn = {0364-765X, 1526-5471}, doi = {10.1287/moor.25.2.255.12228}, url = {http://mor.journal.informs.org/content/25/2/255}, author = {Baveja,Alok and Srinivasan, Aravind} } @article {15230, title = {Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem}, journal = {Algorithmica}, volume = {28}, year = {2000}, month = {2000///}, pages = {422 - 437}, abstract = {Let G=(V,E) be a complete undirected graph with vertex set V , edge set E , and edge weights l(e) satisfying triangle inequality. The vertex set V is partitioned into clusters V 1 , . . ., V k . The clustered traveling salesman problem is to compute a shortest Hamiltonian cycle (tour) that visits all the vertices, and in which the vertices of each cluster are visited consecutively. Since this problem is a generalization of the traveling salesman problem, it is NP-hard. In this paper we consider several variants of this basic problem and provide polynomial time approximation algorithms for them.}, doi = {10.1007/s004530010045}, author = {Guttmann-Beck,N. and Hassin,R. and Khuller, Samir and Raghavachari,B.} } @article {17686, title = {An Arnoldi--Schur Algorithm for Large Eigenproblems}, volume = {UMIACS-TR-2000-21}, year = {2000}, month = {2000/04/25/}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {Sorensen{\textquoteright}s iteratively restarted Arnoldi algorithm is one of the mostsuccessful and flexible methods for finding a few eigenpairs of a large matrix. However, the need to preserve structure of the Arnoldi decomposition, on which the algorithm is based, restricts the range of transformations that can be performed on it. In consequence, it is difficult to deflate converged Ritz vectors from the decomposition. Moreover, the potential forward instability of the implicit QR algorithm can cause unwanted Ritz vectors to persist in the computation. In this paper we introduce a generalized Arnoldi decomposition that solves both problems in a natural and efficient manner. (Also cross-referenced as UMIACS-TR-2000-21) }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/1066}, author = {Stewart, G.W.} } @conference {15336, title = {Assessment of Temperature Fluctuation Models for RANS Simulations of Hypersonic Reacting Flows}, booktitle = {38th AIAA Aerospace Sciences Meeting and Exhibit}, year = {2000}, month = {2000///}, address = {Reno, NV}, abstract = {Turbulence-chemistry interactions play an important role in various fluid flow problems. In a hypersonic boundary layer, these interactions can alter the surface heating rate of the vehicle by modifying the temperature profile across the layer. The effect of these interactions is accounted for in a Reynolds-averaged Navier Stokes (RANS) simulation using a probability density function (PDF) of the temperature distribution. In this paper, two presumed PDF models are considered, namely, the Martin and Candler model and the Gaffney et al. model, and their accuracy is assessed by comparing to direct numerical simulation (DNS) of homogeneous isotropic turbulence. TheMartin and Candler model reproduces the turbulence-chemistry interactions in the flow correctly whereas the Gaffney model overpredicts the temperature fluctuations.}, author = {Sinha,K. and Martin, M.P and Candler,G. V} } @conference {18332, title = {An assumptive logic programming methodology for parsing}, booktitle = {Tools with Artificial Intelligence, 2000. ICTAI 2000. Proceedings. 12th IEEE International Conference on}, year = {2000}, month = {2000///}, pages = {11 - 18}, publisher = {IEEE Comput. Soc}, organization = {IEEE Comput. Soc}, abstract = {We show how several novel tools in logic programming for AI (namely, continuation based linear and timeless assumptions, and datalog grammars) can assist us in producing terse treatments of difficult language processing phenomena. As a proof of concept, we present a concise parser for datalog grammars (logic grammars where strings are represented with numbered word boundaries rather than as lists of words), that uses assumptions and a combination of left-corner parsing and charting. We then study two test cases of this parser{\textquoteright}s application: complete constituent coordination, and error diagnosis and correction}, isbn = {0-7695-0909-6}, doi = {10.1109/TAI.2000.889840}, url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=889840}, author = {Voll,K. and Tom Yeh and Dahl,V.} } @conference {18479, title = {Attacking the bottlenecks of backfilling schedulers}, booktitle = {Cluster Computing}, year = {2000}, month = {2000///}, author = {Zotkin,Dmitry N and Keleher,P. J and Perkovic,D.} } @conference {18463, title = {An audio-video front-end for multimedia applications}, booktitle = {2000 IEEE International Conference on Systems, Man, and Cybernetics}, volume = {2}, year = {2000}, month = {2000///}, pages = {786-791 vol.2 - 786-791 vol.2}, publisher = {IEEE}, organization = {IEEE}, abstract = {Applications such as video gaming, virtual reality, multimodal user interfaces and videoconferencing, require systems that can locate and track persons in a room through a combination of visual and audio cues, enhance the sound that they produce, and perform identification. We describe the development of a particular multimodal sensor fusion system that is portable, runs in real time and achieves these objectives. The system employs novel algorithms for acoustical source location, video-based person tracking and overall system control, which are also described}, keywords = {Acoustic noise, acoustical source location, Application software, audio cues, audio-video front-end, CAMERAS, Computer vision, Microphones, multimedia applications, multimedia systems, multimodal sensor fusion system, multimodal user interfaces, Position measurement, REAL TIME, Real time systems, real-time systems, sensor fusion, sound, Speech recognition, User interfaces, video cameras, video gaming, video-based person tracking, Videoconference, videoconferencing, Virtual reality, visual cues, Working environment noise}, isbn = {0-7803-6583-6}, doi = {10.1109/ICSMC.2000.885945}, author = {Zotkin,Dmitry N and Duraiswami, Ramani and Davis, Larry S. and Haritaoglu,I.} } @conference {18789, title = {Automated design of sheet metal bending tools}, year = {2000}, month = {2000///}, abstract = {Sheet metal bending is a process in which bends are formed using a combination of apunch and a die. Bending tools need to satisfy the following two criteria: (1) tools should be able to withstand bending forces, and (2) tool shapes should be such that there is no tool-part interference. In this paper, we describe a systematic methodology for automatically synthesizing a punch shape that can be used to produce more than one type of part. We create a parametric geometric model of possible punches. This parametric model describes a family of possible punch shapes. Using the geometric models of various given part types and a parametric punch model, we automatically generate constraints on punch parameters that eliminate the possibility of part-tool interference. We use mixed integer programming techniques to solve these constraints and identify parameters of a punch shape that can work for the given set of parts. Finally, we perform strength analysis of the designed punch to verify that the designed punch is capable of withstanding the bending forces. }, url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.34.5031\&rep=rep1\&type=pdf}, author = {Alva,U. and Gupta,S.K. and Gupta,R. K.} } @article {15464, title = {Automated test oracles for GUIs}, journal = {SIGSOFT Softw. Eng. Notes}, volume = {25}, year = {2000}, month = {2000/11//}, pages = {30 - 39}, abstract = {Graphical User Interfaces (GUIs) are critical components of today{\textquoteright}s software. Because GUIs have different characteristics than traditional software, conventional testing techniques do not apply to GUI software. In previous work, we presented an approach to generate GUI test cases, which take the form of sequences of actions. In this paper we develop a test oracle technique to determine if a GUI behaves as expected for a given test case. Our oracle uses a formal model of a GUI, expressed as sets of objects, object properties, and actions. Given the formal model and a test case, our oracle automatically derives the expected state for every action in the test case. We represent the actual state of an executing GUI in terms of objects and their properties derived from the GUI{\textquoteright}s execution. Using the actual state acquired from an execution monitor, our oracle automatically compares the expected and actual states after each action to verify the correctness of the GUI for the test case. We implemented the oracle as a component in our GUI testing system, called Planning Assisted Tester for grapHical user interface Systems (PATHS), which is based on AI planning. We experimentally evaluated the practicality and effectiveness of our oracle technique and report on the results of experiments to test and verify the behavior of our version of the Microsoft WordPad{\textquoteright}s GUI.}, keywords = {automated oracles, GUI test oracles, GUI testing}, isbn = {0163-5948}, doi = {10.1145/357474.355050}, url = {http://doi.acm.org/10.1145/357474.355050}, author = {Memon, Atif M. and Pollack,Martha E. and Soffa,Mary Lou} } @article {16725, title = {Automatic deployment of application-specific metadata and code in MOCHA}, journal = {Advances in Database Technology{\textemdash}EDBT 2000}, year = {2000}, month = {2000///}, pages = {69 - 85}, author = {Rodriguez-Martinez,M. and Roussopoulos, Nick} } @article {13510, title = {Automatic Text Detection and Tracking in Digital Video}, journal = {IEEE Transactions on Image Processing - Special Issue on Image and Video Processing for Digital Libraries}, volume = {9}, year = {2000}, month = {2000/01//}, pages = {147 - 156}, abstract = {Text that appears in a scene or is graphically added to video can provide an important supplemental source of index information as well as clues for decoding the video{\textquoteright}s structure and for classification. In this work, we present algorithms for detecting and tracking text in digital video. Our system implements a scale-space feature extractor that feeds an artificial neural processor to detect text blocks. Our text tracking scheme consists of two modules: a sum of squared difference (SSD) based module to find the initial position and a contour-based module to refine the position. Experiments conducted with a variety of video sources show that our scheme can detect and track text robustly.}, author = {Li,H. and David Doermann and Kia,O.} } @conference {13512, title = {AVideo Text Detection System Based on Automated Training}, booktitle = {ICPR}, volume = {2}, year = {2000}, month = {2000///}, pages = {223 - 226}, author = {Li,H. and David Doermann} } @article {13721, title = {ACQUISITION OF SEMANTIC LEXICONS}, journal = {Breadth and depth of semantic lexicons}, volume = {10}, year = {1999}, month = {1999///}, pages = {79 - 79}, abstract = {This paper addresses the problem oflarge-scale acquisition of computational-semantic lexicons from machine-readable resources. We describe semantic filters designed to reduce the number ofincorrect assignments (i.e., improve precision) made by a purely syntactic technique. We demonstrate that it is possible to use these filters to build broad-coverage lexicons with minimal effort, at a depth of knowledge that lies at the syntax-semantics interface. We report on our results of disambiguating the verbs in the semantic filters by adding WordNet sense annotations. We then show the results of our classification on unknown words and we evaluate these results. }, author = {Dorr, Bonnie J and Jones,D.} } @article {16762, title = {The active MultiSync controller of the cubetree storage organization}, journal = {ACM SIGMOD Record}, volume = {28}, year = {1999}, month = {1999///}, pages = {582 - 583}, author = {Roussopoulos, Nick and Kotidis,Y. and Sismanis,Y.} } @inbook {14191, title = {Active Perception}, booktitle = {Wiley Encyclopedia of Electrical and Electronics EngineeringWiley Encyclopedia of Electrical and Electronics Engineering}, year = {1999}, month = {1999/12/27/}, publisher = {John Wiley \& Sons, Inc.}, organization = {John Wiley \& Sons, Inc.}, isbn = {9780471346081}, url = {http://onlinelibrary.wiley.com/doi/10.1002/047134608X.W5515/abstract?systemMessage=Wiley+Online+Library+will+be+disrupted+17+March+from+10-14+GMT+\%2806-10+EDT\%29+for+essential+maintenance\&userIsAuthenticated=false\&deniedAccessCustomisedMessage=}, author = {Ferm{\"u}ller, Cornelia and Aloimonos, J.} } @conference {15376, title = {Advances in spherical harmonic device modeling: calibration and nanoscale electron dynamics}, booktitle = {Simulation of Semiconductor Processes and Devices, 1999. SISPAD {\textquoteright}99. 1999 International Conference on}, year = {1999}, month = {1999///}, pages = {167 - 170}, abstract = {Improvements in the Spherical Harmonic (SH) method for solving Boltzmann Transport Equation (BTE) are presented. The simulation results provide the same physical detail as analytical band Monte Carlo (MC) calculations, and are obtained approximately a thousand times faster. A new physical model for surface scattering has also been developed. As a result, the SHBTE model achieves calibration for a complete process of I-V characteristics and substrate current consistently for the first time}, keywords = {Boltzmann, characteristics;SHBTE, current;surface, device, dynamics;spherical, electron, equation;calibration;semiconductor, equation;I-V, harmonic, model;substrate, models;surface, scattering;, scattering;Boltzmann, simulation;calibration;nanoscale, transport}, doi = {10.1109/SISPAD.1999.799287}, author = {Lin,Chung-Kai and Goldsman,N. and Mayergoyz, Issak D and Aronowitz,S. and Belova,N.} } @article {16954, title = {Agents vs. direct manipulation: what{\textquoteright}s best to disentangle the Web?}, journal = {Computer Networks: The International Journal of Computer and Telecommunications Networking}, volume = {31}, year = {1999}, month = {1999/05//}, pages = {1765 - 1767}, isbn = {1389-1286}, url = {http://dl.acm.org/citation.cfm?id=313009.313142}, author = {S{\'a}nchez,J. Alfredo and Etzioni,Oren and Kautz,Henry and Lieberman,Henry and Shneiderman, Ben} } @conference {16955, title = {Agents vs. direct manipulation: what{\textquoteright}s best to disentangle the Web?}, booktitle = {Proceedings of the eighth international conference on World Wide Web}, year = {1999}, month = {1999///}, author = {S{\'a}nchez,J.A. and Etzioni,O. and Kautz,H. and Lieberman,H. and Shneiderman, Ben} } @article {16958, title = {Alternate geometry}, journal = {Readings in information visualization}, year = {1999}, month = {1999///}, pages = {381 - 381}, author = {Card,S.K. and Mackinlay,J.D. and Shneiderman, Ben} } @article {17685, title = {An analysis of the Rayleigh-Ritz method for approximating eigenspaces}, year = {1999}, month = {1999///}, institution = {Math. Comp}, abstract = {Abstract. This paper concerns the Rayleigh{\textendash}Ritz method for computing an approximation to an eigenspace X of a general matrix A from a subspace W that contains an approximation to X. The method produces a pair (N, \~{} X) that purports to approximate a pair (L, X), where X is a basis for X and AX = XL. In this paper we consider the convergence of (N, \~{} X) as the sine ɛ of the angle between X and W approaches zero. It is shown that under a natural hypothesis {\textemdash} called the uniform separation condition {\textemdash} the Ritz pairs (N, \~{} X) converge to the eigenpair (L, X). When one is concerned with eigenvalues and eigenvectors, one can compute certain refined Ritz vectors whose convergence is guaranteed, even when the uniform separation condition is not satisfied. An attractive feature of the analysis is that it does not assume that A has distinct eigenvalues or is diagonalizable. 1.}, author = {Jia,Zhongxiao and Stewart, G.W.} } @conference {17553, title = {Application-layer broker for scalable Internet services with resource reservation}, booktitle = {Proceedings of the seventh ACM international conference on Multimedia (Part 2)}, series = {MULTIMEDIA {\textquoteright}99}, year = {1999}, month = {1999///}, pages = {103 - 106}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, isbn = {1-58113-239-5}, doi = {10.1145/319878.319906}, url = {http://doi.acm.org/10.1145/319878.319906}, author = {Bai,Ping and Prabhakaran,B. and Srinivasan, Aravind} } @article {16977, title = {Applications and implications}, journal = {Readings in information visualization}, year = {1999}, month = {1999///}, pages = {625 - 635}, author = {Card,S.K. and Mackinlay,J.D. and Shneiderman, Ben} } @article {17565, title = {Approximation algorithms via randomized rounding: a survey}, journal = {Lectures on Approximation and Randomized Algorithms (M. Karonski and HJ Promel, editors), Series in Advanced Topics in Mathematics, Polish Scientific Publishers PWN}, year = {1999}, month = {1999///}, pages = {9 - 71}, abstract = {Approximation algorithms provide a natural way to approach computationally hardproblems. There are currently many known paradigms in this area, including greedy al- gorithms, primal-dual methods, methods based on mathematical programming (linear and semide nite programming in particular), local improvement, and \low distortion" embeddings of general metric spaces into special families of metric spaces. Random- ization is a useful ingredient in many of these approaches, and particularly so in the form of randomized rounding of a suitable relaxation of a given problem. We survey this technique here, with a focus on correlation inequalities and their applications. }, author = {Srinivasan, Aravind} } @mastersthesis {15518, title = {An architecture and implementation for a cooperative database system}, year = {1999}, month = {1999///}, school = {University of Maryland at College Park}, author = {Godfrey,P. and Minker, Jack} } @conference {13501, title = {ARobust Method for Unknown Forms Analysis}, booktitle = {ICDAR}, year = {1999}, month = {1999///}, pages = {531 - 534}, author = {Xingyuan,L. and David Doermann and Oh,W. and Gao,W.} } @conference {18170, title = {Attacks on digital watermarks}, booktitle = {Signals, Systems, and Computers, 1999. Conference Record of the Thirty-Third Asilomar Conference on}, volume = {2}, year = {1999}, month = {1999/10//}, pages = {1508 -1512 vol.2 - 1508 -1512 vol.2}, abstract = {Two methods for attacking watermarks in images and videos have been proposed. The first attack is to remove robust watermarks by iterative block dropping and concealment. Our study suggests that the block size chosen by a robust watermark embedding system should be large enough to circumventing concealment based attacks. The second attacking method is to forge valid watermarks for authentication systems based on fragile-watermarking. Double watermarking is then proposed as one possible countermeasure.}, keywords = {attacks;copy, Authentication, authentication;video, based, block, coding;, coding;iterative, control;digital, countermeasure;fragile-watermarking;images;iterative, dropping;ownership, EMBEDDING, forging;copyright;image, methods;message, protection;robust, removal;videos;watermarks, size;concealment, system;robust, systems;block, watermark, watermarking, watermarks, watermarks;double}, doi = {10.1109/ACSSC.1999.832001}, author = {M. Wu and Liu,Bede} } @conference {18776, title = {Automated punch shape synthesis for sheet metal bending operations}, year = {1999}, month = {1999///}, author = {Alva,U. and Gupta,S.K.} } @article {15683, title = {Access Policies for Distributed Video-on-Demand Systems}, journal = {Journal of the WAS, Special Issue on Communications, 85 (2)}, year = {1998}, month = {1998///}, author = {Simon,R. and Mundur, Padma and Sood,A.} } @article {17717, title = {On the adjugate matrix}, journal = {Linear Algebra and its Applications}, volume = {283}, year = {1998}, month = {1998/11/01/}, pages = {151 - 164}, abstract = {The adjugate AA of a matrix A is the transpose of the matrix of the co-factors of the elements of A. The computation of the adjugate from its definition involves the computation of n2 determinants of order (n-1){\textemdash}a prohibitively expensive O(n4) process. On the other hand, the computation from the formula AA = det (A)A-1 breaks down when A is singular and is potentially unstable when A is ill-conditioned with respect to inversion. In this paper we first show that the adjugate can be perfectly conditioned, even when A is ill-conditioned. We then show that if due care is taken the adjugate can be accurately computed from the inverse, even when the latter has been inaccurately computed. In Appendix A we give a formal derivation of an observation of Wilkinson on the accuracy of computed inverses.}, isbn = {0024-3795}, doi = {10.1016/S0024-3795(98)10098-8}, url = {http://www.sciencedirect.com/science/article/pii/S0024379598100988}, author = {Stewart, G.W.} } @conference {18162, title = {An algorithm for wipe detection}, booktitle = {Image Processing, 1998. ICIP 98. Proceedings. 1998 International Conference on}, volume = {1}, year = {1998}, month = {1998/10//}, pages = {893 -897 vol.1 - 893 -897 vol.1}, abstract = {The detection of transitions between shots in video programs is an important first step in analyzing video content. The wipe is a frequently used transitional form between shots. Wipe detection is more involved than the detection of abrupt and other gradual transitions because a wipe may take various patterns and because of the difficulty in discriminating a wipe from object and camera motion. In this paper, we propose an algorithm for detecting wipes using both structural and statistical information. The algorithm can effectively detect most wipes used in current TV programs. It uses the DC sequence which can be easily extracted from the MPEG stream without full decompression}, keywords = {algorithm;image, analysis;video, content;video, DC, DETECTION, detection;statistical, domain;object, information;structural, information;video, motion;compressed, motion;shot, processing;, programs;camera, programs;wipe, sequence;MPEG, sequences;signal, signal, stream;TV, transitions}, doi = {10.1109/ICIP.1998.723664}, author = {M. Wu and Wolf,W. and Liu,B.} } @conference {16803, title = {An alternative storage organization for ROLAP aggregate views based on cubetrees}, booktitle = {ACM Sigmod Record}, volume = {27}, year = {1998}, month = {1998///}, pages = {249 - 258}, author = {Kotidis,Y. and Roussopoulos, Nick} } @article {14195, title = {Ambiguity in Structure from Motion: Sphere versus Plane}, journal = {International Journal of Computer Vision}, volume = {28}, year = {1998}, month = {1998///}, pages = {137 - 154}, abstract = {If 3D rigid motion can be correctly estimated from image sequences, the structure of the scene can be correctly derived using the equations for image formation. However, an error in the estimation of 3D motion will result in the computation of a distorted version of the scene structure. Of computational interest are these regions in space where the distortions are such that the depths become negative, because in order for the scene to be visible it has to lie in front of the image, and thus the corresponding depth estimates have to be positive. The stability analysis for the structure from motion problem presented in this paper investigates the optimal relationship between the errors in the estimated translational and rotational parameters of a rigid motion that results in the estimation of a minimum number of negative depth values. The input used is the value of the flow along some direction, which is more general than optic flow or correspondence. For a planar retina it is shown that the optimal configuration is achieved when the projections of the translational and rotational errors on the image plane are perpendicular. Furthermore, the projection of the actual and the estimated translation lie on a line through the center. For a spherical retina, given a rotational error, the optimal translation is the correct one; given a translational error, the optimal rotational negative deptherror depends both in direction and value on the actual and estimated translation as well as the scene in view. The proofs, besides illuminating the confounding of translation and rotation in structure from motion, have an important application to ecological optics. The same analysis provides a computational explanation of why it is easier to estimate self-motion in the case of a spherical retina and why shape can be estimated easily in the case of a planar retina, thus suggesting that nature{\textquoteright}s design of compound eyes (or panoramic vision) for flying systems and camera-type eyes for primates (and other systems that perform manipulation) is optimal.}, isbn = {0920-5691}, url = {http://dx.doi.org/10.1023/A:1008063000586}, author = {Ferm{\"u}ller, Cornelia and Aloimonos, J.} } @article {15670, title = {ANN programming manual}, year = {1998}, month = {1998///}, institution = {Deptartment of Computer Science, University of Maryland, College Park}, author = {Mount, Dave} } @conference {17525, title = {Application level scheduling of gene sequence comparison on metacomputers}, booktitle = {Proceedings of the 12th international conference on Supercomputing}, year = {1998}, month = {1998///}, pages = {141 - 148}, author = {Spring, Neil and Wolski,R.} } @article {15651, title = {Approximating large convolutions in digital images}, journal = {PROCEEDINGS-SPIE THE INTERNATIONAL SOCIETY FOR OPTICAL ENGINEERING}, year = {1998}, month = {1998///}, pages = {216 - 227}, abstract = {Computing discrete two-dimensional convolutions is an important problem in image processing. In mathematicalmorphology, an important variant is that of computing binary convolutions, where the kernel of the convolution is a 0{1 valued function. This operation can be quite costly, especially when large kernels are involved. In this paper, we present an algorithm for computing convolutions of this form, where the kernel of the binary convolution is derived from a convex polygon. Because the kernel is a geometric object, we allow the algorithm some exibility in how it elects to digitize the convex kernel at each placement, as long as the digitization satis es certain reasonable requirements. We say that such a convolution is valid. Given this exibility we show that it is possible to compute binary convolutions more e ciently than would normally be possible for large kernels. Our main result is an algorithm, which given an m n image and a k-sided convex polygonal kernel, computes a valid convolution in time O(kmn) time. Unlike standard algorithms for computing correlations and convolutions, the running time is independent of the area or perimeter of K, and our techniques do not rely on computing fast Fourier transforms. Our algorithm is based on a novel use of Bresenham{\textquoteright}s line-drawing algorithm and pre x-sums to update the convolution e ciently as the kernel is moved from one position to another across the image. }, author = {Kanungo,T. and Mount, Dave and Netanyahu,N. S and Piatko,C. and Silverman,R. and Wu,A. Y} } @article {15224, title = {Approximation algorithms for connected dominating sets}, journal = {Algorithmica}, volume = {20}, year = {1998}, month = {1998///}, pages = {374 - 387}, abstract = {The dominating set problem in graphs asks for a minimum size subset of vertices with the following property: each vertex is required to be either in the dominating set, or adjacent to some vertex in the dominating set. We focus on the related question of finding a connected dominating set of minimum size, where the graph induced by vertices in the dominating set is required to be connected as well. This problem arises in network testing, as well as in wireless communication.Two polynomial time algorithms that achieve approximation factors of 2H(Δ)+2 and H(Δ)+2 are presented, where Δ is the maximum degree and H is the harmonic function. This question also arises in relation to the traveling tourist problem, where one is looking for the shortest tour such that each vertex is either visited or has at least one of its neighbors visited. We also consider a generalization of the problem to the weighted case, and give an algorithm with an approximation factor of (c n +1) \ln n where c n ln k is the approximation factor for the node weighted Steiner tree problem (currently c n = 1.6103 ). We also consider the more general problem of finding a connected dominating set of a specified subset of vertices and provide a polynomial time algorithm with a (c+1) H(Δ) +c-1 approximation factor, where c is the Steiner approximation ratio for graphs (currently c = 1.644 ). }, doi = {10.1007/PL00009201}, author = {Guha,S. and Khuller, Samir} } @conference {15634, title = {Approximation algorithms for multiple-tool miling}, booktitle = {Proceedings of the fourteenth annual symposium on Computational geometry}, series = {SCG {\textquoteright}98}, year = {1998}, month = {1998///}, pages = {297 - 306}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, isbn = {0-89791-973-4}, doi = {10.1145/276884.276918}, url = {http://doi.acm.org/10.1145/276884.276918}, author = {Arya,Sunil and Cheng,Siu-Wing and Mount, Dave} } @conference {18662, title = {AQuA: an adaptive architecture that provides dependable distributed objects}, booktitle = {Seventeenth IEEE Symposium on Reliable Distributed Systems}, year = {1998}, month = {1998/10//}, pages = {245 - 253}, abstract = {Dependable distributed systems are difficult to build. This is particularly true if they have dependability requirements that change during the execution of an application, and are built with commercial off-the-shelf hardware. In that case, fault tolerance must be achieved using middleware software, and mechanisms must be provided to communicate the dependability requirements of a distributed application to the system and to adapt the system{\textquoteright}s configuration to try to achieve the desired dependability. The AQuA architecture allows distributed applications to request a desired level of availability using the Quality Objects (QuO) framework and includes a dependability manager that attempts to meet requested availability levels by configuring the system in response to outside requests and changes in system resources due to faults. The AQuA architecture uses the QuO runtime to process and invoke availability requests, the Proteus dependability manager to configure the system in response to faults and availability requests, and the Ensemble protocol stack to provide group communication services. Furthermore, a CORBA interface is provided to application objects using the AQuA gateway. The gateway provides a mechanism to translate between process-level communication, as supported by Ensemble, and IIOP messages, understood by Object Request Brokers. Both active and passive replication are supported, and the replication type to use is chosen based on the performance and dependability requirements of particular distributed applications}, keywords = {adaptive architecture, AQuA, availability requests, client-server systems, commercial off-the-shelf hardware, CORBA, dependability manager, dependability requirements, dependable distributed objects, distributed object management, Ensemble protocol stack, Fault tolerance, group communication services, middleware software, Object Request Brokers, process-level communication, proteus, Quality Objects, replication, software fault tolerance, Software quality}, doi = {10.1109/RELDIS.1998.740506}, author = {Cukier, Michel and Ren,J. and Sabnis,C. and Henke,D. and Pistole,J. and Sanders,W. H. and Bakken,D. E. and Berman,M.E. and Karr,D. A. and Schantz,R.E.} } @article {15675, title = {On the Area of Overlap of Translated Polygons}, volume = {CS-TR-3201}, year = {1998}, month = {1998/10/15/}, institution = {Department of Computer Science, University of Maryland, College Park}, abstract = {(Also cross-referenced as CAR-TR-699) Given two simple polygons P and Q in the plane and a translation vector t E R2, the area-oJ-overlap function of P and Q is the function Ar(t) = Area(P n (t + Q)), where t + Q denotes Q translated by t. This function has a number of applications in areas such as motion planning and object recognition. We present a number of mathematical results regarding this function. We also provide efficient algorithms for computing a representation of this function, and for tracing contour curves of constant area of o verlap. }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu//handle/1903/403}, author = {Mount, Dave and Silverman,Ruth and Wu,Angela Y.} } @article {16979, title = {Assessing users{\textquoteright} subjective satisfaction with the Information System for Youth Services (ISYS)}, journal = {Institute for Systems Research Technical Reports}, year = {1998}, month = {1998/10/15/}, abstract = {In this investigation, the Questionnaire for User Interaction Satisfaction(QUIS 5.5), a tool for assessing users{\textquoteright} subjective satisfaction with specific aspects of the human/computer interface was used to assess the strengths and weaknesses of the Info rmation System for Youth Services (ISYS). ISYS is used by over 600 employees of the Maryland State Department of Juvenile Services (DJS) as a tracking device for juvenile offenders. Ratings and comments were collected from 254 DJS employees who use ISYS. The overall mean rating across all questions was 5.1 on a one to nine scale. The ten highest and lowest rated questions were identified. The QUIS allowed us to isolate subgroups which were compared with mean ratings from four measures of specific interfac e factors. The comments obtained from users provided suggestions, complaints and endorsements of the system. Also cross-referenced as CAR-TR-768 }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/431}, author = {Slaughter,Laura and Norman,Kent L and Shneiderman, Ben} } @conference {12102, title = {Automated recovery in a secure bootstrap process}, booktitle = {Proceedings of the Symposium on Network and Distributed Systems Security (NDSS{\textquoteright}98)}, year = {1998}, month = {1998///}, pages = {155 - 167}, author = {Arbaugh, William A. and Keromytis,A. D and Farber,D. J and Smith,J. M} } @conference {13507, title = {Automatic Identification of Text In Digital Video Key Frames}, booktitle = {Proceedings of International Conference on Pattern Recognition}, year = {1998}, month = {1998///}, pages = {129 - 132}, abstract = {Scene and graphic text can provide important supplemental index information in video sequences. In this paper we address the problem automatically identifying text regions in digital video key frames. The text contained in video frames is typically very noisy because it is aliased and/or digitized at a much lower resolution than typical document images, making identification, extraction and recognition difficult. The proposed method is based on the use of a hybrid wavelet/neural network segmenter on a series of overlapping small windows to classify regions which contain text. To detect text over a wide range of font sizes, the method is applied to a pyramid of images and the regions identified at each level are integrated.}, author = {Li,H. and David Doermann} } @article {13509, title = {Automatic Text Detection and Tracking in Digital Video}, volume = {LAMP-TR-028,CFAR-TR-900,CS-TR-3962}, year = {1998}, month = {1998/12//}, institution = {University of Maryland, College Park}, abstract = {Text which either appears in a scene or is graphically added to video can provide an important supplemental source of index information as well as clues for decoding the video{\textquoteright}s structure and for classification. In this paper we present algorithms for detecting and tracking text components that appear within digital video frames. Our system implements a scale-space feature extractor that feeds an artificial neural processor to extract textual regions and track their movement over time. The extracted regions can then be used as input to an appropriate Optical Character Recognition system which produces indexible keywords.}, author = {Li,H. and David Doermann and Kia,O.} } @conference {13511, title = {Automatic Text Tracking In Digital Videos}, booktitle = {Proceedings of IEEE 1998 Workshop on Multimedia Signal Processing}, year = {1998}, month = {1998///}, pages = {21 - 26}, abstract = {We address the problem of automatically tracking moving text in digital videos. Our scheme consists of two separate processes: monitoring which detects the new text line entering a frame, and tracking which uses prediction techniques to reconcile the text from frame to frame. Temporal consistency allows one to monitor periodically and reduce the computation complexity. The tracking process uses a rapid prediction/search scheme to update the position of the text blocks between frames. We provide details of the implementation and results for text moving in the scene and text which moves as a result of camera motion.}, author = {Li,H. and David Doermann} } @article {17679, title = {Accuracy and Stability of Numerical Algorithms}, journal = {SIAM Review}, volume = {39}, year = {1997}, month = {1997///}, pages = {164 - 165}, author = {Higham,N. J and Stewart, G.W.} } @conference {15870, title = {Adaptive filtering of multilingual document streams}, booktitle = {Fifth RIAO Conference on Computer Assisted Information Searching on the Internet, June}, year = {1997}, month = {1997///}, author = {Oard, Douglas} } @article {17969, title = {Adaptive real-time level-of-detail based rendering for polygonal models}, journal = {Visualization and Computer Graphics, IEEE Transactions on}, volume = {3}, year = {1997}, month = {1997/06//apr}, pages = {171 - 183}, abstract = {We present an algorithm for performing adaptive real-time level-of-detail-based rendering for triangulated polygonal models. The simplifications are dependent on viewing direction, lighting, and visibility and are performed by taking advantage of image-space, object-space, and frame-to-frame coherences. In contrast to the traditional approaches of precomputing a fixed number of level-of-detail representations for a given object, our approach involves statically generating a continuous level-of-detail representation for the object. This representation is then used at run time to guide the selection of appropriate triangles for display. The list of displayed triangles is updated incrementally from one frame to the next. Our approach is more effective than the current level-of-detail-based rendering approaches for most scientific visualization applications, where there are a limited number of highly complex objects that stay relatively close to the viewer. Our approach is applicable for scalar (such as distance from the viewer) as well as vector (such as normal direction) attributes}, keywords = {(computer, adaptive, attributes;scientific, attributes;view-dependent, coherence;image-space;lighting;multiresolution, direction;visibility;computational, geometry;data, graphics);, hierarchies;object-space;run, hierarchies;triangulated, level-of-detail, models;vector, polygonal, real-time, refinement;triangle, rendering;displayed, simplifications;viewing, systems;rendering, time;scalar, triangles;frame-to-frame, visualisation;real-time, visualization;selective}, isbn = {1077-2626}, doi = {10.1109/2945.597799}, author = {Xia,J. C and El-Sana,J. and Varshney, Amitabh} } @conference {13492, title = {ADistributed Management System for Testing Document Image Database Analysis Algorithms}, booktitle = {ICDAR}, year = {1997}, month = {1997///}, pages = {989 - 995}, author = {David Doermann and Sauvola,J. and Haapakoski,S. and Kauniskangas,H. and Seppanen,T. and Pietikainen,M.} } @article {14096, title = {African trypanosomes have differentially expressed genes encoding homologues of the Leishmania GP63 surface protease}, journal = {Journal of Biological Chemistry}, volume = {272}, year = {1997}, month = {1997///}, pages = {26742 - 26742}, author = {El-Sayed, Najib M. and Donelson,J. E} } @article {12771, title = {An algebraic theory of multiple clocks}, journal = {CONCUR{\textquoteright}97: Concurrency Theory}, year = {1997}, month = {1997///}, pages = {166 - 180}, author = {Cleaveland, Rance and L\{\"u}ttgen,G. and Mendler,M.} } @article {17682, title = {Algorithm 776: SRRIT: a Fortran subroutine to calculate the dominant invariant subspace of a nonsymmetric matrix}, journal = {ACM Trans. Math. Softw.}, volume = {23}, year = {1997}, month = {1997/12//}, pages = {494 - 513}, abstract = {SRRT is a Fortran program to calculate an approximate orthonomral basis fr a dominant invariant subspace of a real matrix A by the method of simultaneous iteration. Specifically, given an integer m, SRRIT computes a matrix Q with m orthonormal columns and real quasi-triangular matrix T or order m such that the equation AQ = QT is satisfied up to a tolerance specified by the user. The eigenvalues of T are approximations to the m eigenvalues of largest absolute magnitude of A and the columns of Q span the invariant subspace corresponding to those eigenvalues. SRRIT references A only through a user-provided subroutine to form the product AQ; hence it is suitable for large sparse problems.}, keywords = {invariant subspace, nonsymmetric eigenvalue problem, project method}, isbn = {0098-3500}, doi = {10.1145/279232.279234}, url = {http://doi.acm.org/10.1145/279232.279234}, author = {Bai,Z. and Stewart, G.W.} } @article {15561, title = {ANN: A library for approximate nearest neighbor searching}, journal = {CGC 2nd Annual Fall Workshop on Computational Geometry}, year = {1997}, month = {1997///}, author = {Mount, Dave and Arya,S.} } @conference {16296, title = {Anywhere, Anytime Code Inspections: Using the Web to Remove Inspection Bottlenecks in Large-Scale Software Development}, booktitle = {Software Engineering, International Conference on}, year = {1997}, month = {1997///}, pages = {14 - 14}, publisher = {IEEE Computer Society}, organization = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, abstract = {The dissemination of critical information and the synchronization of coordinated activities are critical problems in geographically separated, large-scale, software development. While these problems are not insurmountable, their solutions have varying trade-offs in terms of time, cost and effectiveness. Our previous studies have shown that the inspection interval is typically lengthened because of schedule conflicts among inspectors which delay the (usually) required inspection collection meeting.We present and justify a solution using an intranet web that is both timely in its dissemination of information and effective in its coordination of distributed inspectors. First, exploiting a naturally occurring experiment (reported here), we conclude that the asynchronous collection of inspection results is at least as effective as the synchronous collection of those results. Second, exploiting the information dissemination qualities and the on-demand nature of information retrieval of the web, and the platform independence of browsers, we built an inexpensive tool that integrates seamlessly into the current development process. By seamless we mean an identical paper flow that results in an almost identical inspection process.The acceptance of the inspection tool has been excellent. The cost savings just from the reduction in paper work and the time savings from the reduction in distribution interval of the inspection package (sometimes involving international mailings) have been substantial. These savings together with the seamless integration into the existing environment are the major factors for this acceptance. From our viewpoint as experimentalists, the acceptance came too readily. Therefore we lost our op portunity to explore this tool using a series of controlled experiments to isolate the underlying factors or its effectiveness. Nevertheless, by using historical data we can show that the new process is less expensive in terms of cost and at least as effective in terms of quality (defect detection effectiveness).}, keywords = {asynchronous; natural occurring inspection experiment; automated support for inspections, code inspections: web-based, meetingless}, doi = {http://doi.ieeecomputersociety.org/10.1109/ICSE.1997.610188}, author = {Perpich,J. M. and Perry,D. E. and Porter, Adam and Votta,L. G. and Wade,M. W.} } @article {12336, title = {APGAN and RPMC: Complementary heuristics for translating DSP block diagrams into efficient software implementations}, journal = {Design Automation for Embedded Systems}, volume = {2}, year = {1997}, month = {1997///}, pages = {33 - 60}, author = {Bhattacharyya, Shuvra S. and Murthy,P. K and Lee,E. A} } @conference {17554, title = {Approximating hyper-rectangles: learning and pseudo-random sets}, booktitle = {Proceedings of the twenty-ninth annual ACM symposium on Theory of computing}, series = {STOC {\textquoteright}97}, year = {1997}, month = {1997///}, pages = {314 - 323}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, keywords = {approximations of distributions, derandomization, explicit constructions, machine learning, multiple-instance learning, PAC learning, pseudorandomness, Ramsey graphs, random graphs, rectangles, sample complexity}, isbn = {0-89791-888-6}, doi = {10.1145/258533.258611}, url = {http://doi.acm.org/10.1145/258533.258611}, author = {Auer,Peter and Long,Philip M. and Srinivasan, Aravind} } @article {13726, title = {Aspectual Modifications to a LCS Database for NLP Applications}, year = {1997}, month = {1997///}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {Verbal and compositional lexical aspect provide the underlying temporal structure ofevents. Knowledge of lexical aspect, e.g., (a)telicity, is therefore required for interpret- ing event sequences in discourse (Dowty, 1986: Moens and Steedman, 1988; Passoneau, 1988), interfacing to temporal databases (Androutsopoulos, 1996), processing temporal modifiers (Antonisse, 1994), describing allowable alternations and their semantic effects (Resnik, 1996; Tenny, 1994), and selecting tense and lexical items for natural language generation ((Dorr and Olsen, 1996; Klavans and Chodorow, 1992), cf. (Slobin and Bo- caz, 1988)). We show that it is possible to represent lexical aspect{\textemdash}both verbal and compositional{\textemdash}on a large scale, using Lexical Conceptual Structure (LCS) representa- tions of verbs in the classes cataloged by Levin (1993). We show how proper consideration of these universal pieces of verb meaning may be used to refine lexical representations and derive a range of meanings from combinations of LCS representations. A single al- gorithm may therefore be used to determine lexical aspect classes and features at both verbal and sentence levels. Finally, we illustrate how knowledge of lexical aspect facili- tates the interpretation of events in NLP applications. }, author = {Dorr, Bonnie J and Olsen,M.B.} } @article {16305, title = {Assessing software review meetings: results of a comparative analysis of two experimental studies}, journal = {IEEE Transactions on Software Engineering}, volume = {23}, year = {1997}, month = {1997/03//}, pages = {129 - 145}, abstract = {Software review is a fundamental tool for software quality assurance. Nevertheless, there are significant controversies as to the most efficient and effective review method. One of the most important questions currently being debated is the utility of meetings. Although almost all industrial review methods are centered around the inspection meeting, recent findings call their value into question. In prior research the authors separately and independently conducted controlled experimental studies to explore this issue. The paper presents new research to understand the broader implications of these two studies. To do this, they designed and carried out a process of {\textquotedblleft}reconciliation{\textquotedblright} in which they established a common framework for the comparison of the two experimental studies, reanalyzed the experimental data with respect to this common framework, and compared the results. Through this process they found many striking similarities between the results of the two studies, strengthening their individual conclusions. It also revealed interesting differences between the two experiments, suggesting important avenues for future research}, keywords = {Aggregates, Collaborative work, Computer Society, Costs, Helium, Inspection, inspection meeting, Job shop scheduling, Programming, reconciliation, Software development management, Software quality, software quality assurance, software review meeting assessment, Software reviews}, isbn = {0098-5589}, doi = {10.1109/32.585501}, author = {Porter, Adam and Johnson,P. M} } @article {18817, title = {Automated manufacturability analysis: A survey}, journal = {Research in Engineering Design}, volume = {9}, year = {1997}, month = {1997///}, pages = {168 - 190}, abstract = {In the market-place of the 21st century, there is no place for traditional {\textquoteleft}over-the-wall{\textquoteright} communications between design and manufacturing. In order to {\textquoteleft}design it right the very first time{\textquoteright}, designers must ensure that their products are both functional and easy to manufacture. Software tools have had some successes in reducing the barriers between design and manufacturing. Manufacturability analysis systems are emerging as one such tool {\textemdash} enabling identification of potential manufacturing problems during the design phase and providing suggestions to designers on how to eliminate them.}, keywords = {engineering}, isbn = {0934-9839}, doi = {10.1007/BF01596601}, url = {http://www.springerlink.com/content/p8p5516251023777/abstract/}, author = {Gupta, Satyandra K. and Regli,William C. and Das,Diganta and Nau, Dana S.} } @article {16584, title = {Automatic discovery of self-replicating structures in cellular automata}, journal = {Evolutionary Computation, IEEE Transactions on}, volume = {1}, year = {1997}, month = {1997///}, pages = {165 - 178}, author = {Lohn,J. D and Reggia, James A.} } @article {15580, title = {Accounting for boundary effects in nearest-neighbor searching}, journal = {Discrete \& Computational Geometry}, volume = {16}, year = {1996}, month = {1996///}, pages = {155 - 176}, abstract = {Given n data points ind-dimensional space, nearest-neighbor searching involves determining the nearest of these data points to a given query point. Most averagecase analyses of nearest-neighbor searching algorithms are made under the simplifying assumption thatd is fixed and thatn is so large relative tod thatboundary effects can be ignored. This means that for any query point the statistical distribution of the data points surrounding it is independent of the location of the query point. However, in many applications of nearest-neighbor searching (such as data compression by vector quantization) this assumption is not met, since the number of data pointsn grows roughly as 2 d .Largely for this reason, the actual performances of many nearest-neighbor algorithms tend to be much better than their theoretical analyses would suggest. We present evidence of why this is the case. We provide an accurate analysis of the number of cells visited in nearest-neighbor searching by the bucketing andk-d tree algorithms. We assumem dpoints uniformly distributed in dimensiond, wherem is a fixed integer >=2. Further, we assume that distances are measured in theL $\infty$ metric. Our analysis is tight in the limit asd approaches infinity. Empirical evidence is presented showing that the analysis applies even in low dimensions.}, doi = {10.1007/BF02716805}, author = {Arya,S. and Mount, Dave and Narayan,O.} } @conference {14797, title = {An adaptive cost system for parallel program instrumentation}, booktitle = {Euro-Par{\textquoteright}96 Parallel Processing}, year = {1996}, month = {1996///}, pages = {88 - 97}, author = {Hollingsworth, Jeffrey K and Miller, B.} } @article {16953, title = {Advanced graphic user interfaces: elastic and tightly coupled windows}, journal = {ACM Comput. Surv.}, volume = {28}, year = {1996}, month = {1996/12//}, isbn = {0360-0300}, doi = {10.1145/242224.242409}, url = {http://doi.acm.org/10.1145/242224.242409}, author = {Shneiderman, Ben} } @conference {12802, title = {An algebraic theory of process efficiency}, booktitle = {, Eleventh Annual IEEE Symposium on Logic in Computer Science, 1996. LICS {\textquoteright}96. Proceedings}, year = {1996}, month = {1996/07/27/30}, pages = {63 - 72}, publisher = {IEEE}, organization = {IEEE}, abstract = {This paper presents a testing-based semantic theory for reasoning about the efficiency of concurrent systems as measured in terms of the amount of their internal activity. The semantic preorders are given an algebraic characterization, and their optimality is established by means of a full abstractness result. They are also shown to subsume existing bisimulation-based efficiency preorders. An example is provided to illustrate the utility of this approach}, keywords = {algebraic characterization, algebraic specification, algebraic theory, bisimulation-based efficiency preorders, Calculus, calculus of communicating systems, Carbon capture and storage, Computer science, concurrent systems, formal logic, formal specification, full abstractness result, internal activity, optimality, process efficiency, reasoning, semantic preorders, System testing, testing-based semantic theory}, isbn = {0-8186-7463-6}, doi = {10.1109/LICS.1996.561304}, author = {Natarajan,V. and Cleaveland, Rance} } @article {14194, title = {Algorithm-Independent Stability Analysis of Structure from Motion.}, year = {1996}, month = {1996///}, institution = {Computer Vision Lab, University of Maryland College Park}, abstract = {The stability analysis for the structure from motion problem presented in this paper investigates the optimal relationship between the errors in the estimated translational and rotational parameters of a rigid motion that results in the estimation of a minimum number of negative depth values. No particular estimators are used and no specific assumptions about the scene are made. The input used is the value of the flow along some direction, which is more general than optic flow or correspondence. For a planar retina it is shown that the optimal configuration is achieved when the projections of the translational and rotational errors on the image plane are perpendicular. For a spherical retina, given a rotational error, the optimal translation is the correct one, while given a translational error the optimal rotational error is normal to the translational one at an equal distance from the real and estimated translations. The proofs, besides illuminating the confounding of translation and rotation in structure from motion, have an important application to ecological optics. The same analysis provides a computational explanation of why it is much easier to estimate self-motion in the case of a spherical retina and why it is much easier to estimate shape in the case of a planar retina, thus suggesting that nature{\textquoteright}s design of compound eyes (or panoramic vision) for flying systems and camera-type eyes for primates (and other systems that perform manipulation) is optimal.}, author = {Ferm{\"u}ller, Cornelia} } @article {16562, title = {Alignment of coexisting cortical maps in a motor control model}, journal = {Neural computation}, volume = {8}, year = {1996}, month = {1996///}, pages = {731 - 755}, author = {Chen,Y. and Reggia, James A.} } @conference {16460, title = {Answering queries using OQL view expressions}, booktitle = {In Workshop on Materialized Views, in cooperation with ACM SIGMOD}, year = {1996}, month = {1996///}, author = {Florescu,D. and Raschid, Louiqa and Valduriez,P.} } @article {13499, title = {Applying algebraic and differential invariants for logo recognition}, journal = {Machine Vision and Applications}, volume = {9}, year = {1996}, month = {1996///}, pages = {73 - 86}, abstract = {The problem of logo recognition is of great interest in the document domain, especially for document databases. By recognizing the logo we obtain semantic information about the document which may be useful in deciding whether or not to analyze the textual components. Given a logo block candidate from a document image and alogo database, we would like to determine whether the region corresponds to a logo in the database. Similarly, if we are given a logo block candidate and adocumentdatabase, we wish to determine whether there are any documents in the database of similar origin. Both problems require indexing into a possibly large model space.In this contribution, we present a novel application of algebraic and differential invariants to the problem of logo recognition. By using invariants we have shape descriptors for matching that are unique and independent of the point of view. The algebraic invariants handle cases in which the whole shape of the logo is given and it is easy to describe. The differential invariants cover complex arbitrary logo shape and handle situations in which only part of the logo is recovered. We outline a hierarchical approach to logo recognition and define methods for page segmentation, feature extraction, and indexing. We demonstrate our approach and present results on a database of approximately 100 logos. }, author = {David Doermann and Rivlin,E. and Weiss, I.} } @conference {13500, title = {Archiving, indexing, and retrieval of video in compressed domain}, booktitle = {SPIEConference on Multimedia Storage and Archiving Systems}, volume = {2916}, year = {1996}, month = {1996///}, pages = {78 - 89}, author = {Kobla,V. and David Doermann and Lin,K-I.} } @article {18968, title = {AT-AC Introns{\textemdash}An ATtACk on Dogma}, journal = {ScienceScience}, volume = {271}, year = {1996}, month = {1996/03/22/}, pages = {1690 - 1692}, abstract = {Messenger RNAs are initially made as long precursor molecules from which final, transcribable mRNAs are assembled. A specialized organelle, the spliceosome, contains small RNAs with pairs of dinucleotides that can pick out complementary pairs of nucleotides at the ends of the introns that are to be spliced together. It has been assumed that these pairs were always GU-AG (or GT-AG in the DNA), but in findings described in this week{\textquoteright}s issue of Science (p. 1716) and the current issue of Cell (vol. 84, p. 801) a minor class of intron is shown to be flanked by AU-AC (or AT-AC in the DNA). In his Perspective, Mount explains how these maverick introns were discovered and why their existence is so surprising.}, isbn = {0036-8075, 1095-9203}, doi = {10.1126/science.271.5256.1690}, url = {http://www.sciencemag.org/content/271/5256/1690}, author = {Mount, Stephen M.} } @article {15938, title = {Automated inference in active logics}, journal = {JOURNAL OF APPLIED NONCLASSICAL LOGICS}, volume = {6}, year = {1996}, month = {1996///}, pages = {9 - 28}, author = {Miller,M. and Perlis, Don} } @article {18368, title = {Algebra and models (and reality)}, journal = {SIGSOFT Softw. Eng. Notes}, volume = {20}, year = {1995}, month = {1995/04//}, pages = {55 - 57}, isbn = {0163-5948}, doi = {10.1145/224155.224159}, url = {http://doi.acm.org/10.1145/224155.224159}, author = {Zelkowitz, Marvin V} } @article {14119, title = {Algebraic Analysis of the Hierarchical Basis Preconditioner}, journal = {SIAM Journal on Matrix Analysis and ApplicationsSIAM. J. Matrix Anal. \& Appl.}, volume = {16}, year = {1995}, month = {1995///}, pages = {192 - 192}, isbn = {08954798}, doi = {10.1137/S0895479892236933}, url = {http://epubs.siam.org/sima/resource/1/sjmael/v16/i1/p192_s1}, author = {Elman, Howard and Zhang, Xuejun} } @article {18048, title = {Almost fully-parallel parentheses matching}, journal = {Discrete applied mathematics}, volume = {57}, year = {1995}, month = {1995///}, pages = {11 - 28}, author = {Berkman,O. and Vishkin, Uzi} } @conference {16211, title = {An applied ethnographic method for redesigning user interfaces}, booktitle = {Proceedings of the 1st conference on Designing interactive systems: processes, practices, methods, \& techniques}, series = {DIS {\textquoteright}95}, year = {1995}, month = {1995///}, pages = {115 - 122}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, isbn = {0-89791-673-5}, doi = {10.1145/225434.225447}, url = {http://doi.acm.org/10.1145/225434.225447}, author = {Rose,Anne and Shneiderman, Ben and Plaisant, Catherine} } @conference {15629, title = {Approximate range searching}, booktitle = {Proceedings of the eleventh annual symposium on Computational geometry}, series = {SCG {\textquoteright}95}, year = {1995}, month = {1995///}, pages = {172 - 181}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, isbn = {0-89791-724-3}, doi = {10.1145/220279.220298}, url = {http://doi.acm.org/10.1145/220279.220298}, author = {Arya,Sunil and Mount, Dave} } @article {15216, title = {Approximating the minimum equivalent digraph}, journal = {SIAM Journal on Computing (SICOMP)}, volume = {24}, year = {1995}, month = {1995///}, pages = {859 - 872}, author = {Khuller, Samir and Raghavachari,B. and Young,N.} } @book {19358, title = {Artificial Intelligence: Theory and Practice}, year = {1995}, month = {1995}, pages = {604}, publisher = {Benjamin/Cummings Pub.}, organization = {Benjamin/Cummings Pub.}, abstract = {This book provides a detailed understanding of the broad issues in artificial intelligence and a useful survey of current AI technology. The author delivers broad coverage of innovative representational techniques, including neural networks, image processing, and probabilistic reasoning, alongside the traditional methods of symbolic reasoning. AI algorithms are described in detailed prose in the text and fully implemented in LISP at the ends of chapters. A stand-alone LISP chapter makes an excellent reference and refresher. Each chapter includes a detailed description of an AI application.}, keywords = {Computers / Expert Systems, Computers / Intelligence (AI) \& Semantics}, isbn = {9780805325478}, author = {Dean, Thomas L. and ALLEN, JAMES AUTOR and Aloimonos, J.} } @article {18818, title = {Automated Manufacturability Analysis: A Survey}, volume = {ISR; TR 1995-14}, year = {1995}, month = {1995///}, institution = {Institute for Systems Research, University of Maryland, College Park}, abstract = {In the marketplace of the 21st century, there is no place for traditional {\textquoteleft}{\textquoteleft}over-the-wall{\textquoteright}{\textquoteright} communications between design and manufacturing. In order to {\textquoteleft}{\textquoteleft}design it right the very first time,{\textquoteright}{\textquoteright} designers must ensure that their products are both functional and easy to manufacture. Software tools have had some successes in reducing the barriers between design and manufacturing. Manufacturability analysis systems are emerging as one such tool---enabling identification of potential manufacturing problems during the design phase and providing suggestions to designers on how to eliminate them.

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

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

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

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

It is anticipated that this research will help in speeding up the evaluation of new product designs in order to decide how or whether to manufacture them. Such a capability will be useful in responding quickly to changing demands and opportunities in the marketplace.}, keywords = {Automation, computer aided manufacturing, computer integrated manufacturing, Feature extraction, flexible manufacturing, manufacturability, Manufacturing, Solid modeling}, url = {http://drum.lib.umd.edu//handle/1903/5693}, author = {Gupta, Satyandra K.} } @article {17918, title = {Automatic generation of multiresolution for polygonal models}, journal = {First Workshop on Simulation and Interaction in Virtual Environments}, year = {1995}, month = {1995///}, author = {Varshney, Amitabh and Agarwal,P. and Brooks,F. and Wright,W. and Weber,H.} } @article {13413, title = {AAAI 1994 Spring Symposium Series Reports}, journal = {AI Magazine}, volume = {15}, year = {1994}, month = {1994/09/15/}, pages = {22 - 22}, isbn = {0738-4602}, doi = {10.1609/aimag.v15i3.1101}, url = {http://www.aaai.org/ojs/index.php/aimagazine/article/viewArticle/1101}, author = {Woods,William and Uckun,Sendar and Kohane,Isaac and Bates,Joseph and Hulthage,Ingemar and Gasser,Les and Hanks,Steve and Gini,Maria and Ram,Ashwin and desJardins, Marie and Johnson,Peter and Etzioni,Oren and Coombs,David and Whitehead,Steven} } @article {16643, title = {Adaptation of noncompetitive and competitive neural networks to focal lesions}, journal = {Journal of Artificial Neural Networks}, volume = {1}, year = {1994}, month = {1994///}, pages = {51 - 60}, author = {Weinrich,M. and Sutton,G. G and Reggia, James A. and D{\textquoteright}Autrechy,C. L} } @article {18367, title = {Algebra and models (and reality)}, journal = {SIGSOFT Softw. Eng. Notes}, volume = {19}, year = {1994}, month = {1994/10//}, pages = {79 - 81}, isbn = {0163-5948}, doi = {10.1145/190679.190688}, url = {http://doi.acm.org/10.1145/190679.190688}, author = {Zelkowitz, Marvin V} } @conference {17404, title = {The alphaslider: a compact and rapid selector}, booktitle = {Proceedings of the SIGCHI conference on Human factors in computing systems: celebrating interdependence}, series = {CHI {\textquoteright}94}, year = {1994}, month = {1994///}, pages = {365 - 371}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, keywords = {Alphaslider, dynamic queries, menus, selection technology, widget}, isbn = {0-89791-650-6}, doi = {10.1145/191666.191790}, url = {http://doi.acm.org/10.1145/191666.191790}, author = {Ahlberg,Christopher and Shneiderman, Ben} } @article {18813, title = {An Application of Distributed Solid Modeling: Feature Recognition}, volume = {ISR; TR 1994-82}, year = {1994}, month = {1994///}, institution = {Institute for Systems Research, University of Maryland, College Park}, abstract = {The availability of low-cost computational power is a driving force behind the growing sophistication of CAD software. Tools designed to reduce time-consuming build-test-redesign iterations are essential for increasing engineering quality and productivity. However, automation of the design process poses many difficult computational problems. As more downstream engineering activities are being considered during the design phase, guaranteeing reasonable response times within design systems becomes problematic. Design is an interactive process and speed is a critical factor in systems that enable designers to explore and experiment with alternative ideas during the design phase. Achieving interactivity requires an increasingly sophisticated allocation of computational resources in order to perform realistic design analyses and generate feedback in real time.

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

This has been implemented on a network of SUN workstations using the ACIS solid modeler and the NIH C++ class library; inter-processor communication is handled with TCP/IP- based network communication tools.}, keywords = {Distributed computing, feature recognition, feature- based modeling, multiprocessor solid modeling, Systems Integration Methodology}, url = {http://drum.lib.umd.edu//handle/1903/5552}, author = {Regli,W. C. and Gupta, Satyandra K. and Nau, Dana S.} } @article {18964, title = {An Atlas of Drosophila Genes: Sequences and Molecular Features}, journal = {Journal of Heredity}, volume = {85}, year = {1994}, month = {1994///}, pages = {495 - 496}, author = {Maroni,G. and Mount, Stephen M. and Cavener,DR and Cavener,BA and Sharp,PM and Lloyd,AT and Schaeffer,SW} } @conference {13837, title = {On automatic filtering of multilingual texts}, booktitle = {, 1994 IEEE International Conference on Systems, Man, and Cybernetics, 1994. {\textquoteright}Humans, Information and Technology{\textquoteright}}, volume = {2}, year = {1994}, month = {1994/10/02/5}, pages = {1645-1650 vol.2 - 1645-1650 vol.2}, publisher = {IEEE}, organization = {IEEE}, abstract = {An emerging requirement to sift through the increasing flood of text information has led to the rapid development of information filtering technology in the past five years. This study introduces novel approaches for filtering texts regardless of their source language. We begin with a brief description of related developments in text filtering and multilingual information retrieval. We then present three alternative approaches to selecting texts from a multilingual information stream which represent a logical evolution from existing techniques in related disciplines. Finally, a practical automated performance evaluation technique is proposed}, keywords = {automated performance evaluation, Business communication, Computer science, Discussion forums, Displays, Educational institutions, Floods, Government, Information filtering, Information filters, Information retrieval, multilingual information retrieval, multilingual text filtering, natural languages, performance evaluation}, isbn = {0-7803-2129-4}, doi = {10.1109/ICSMC.1994.400083}, author = {Oard, Douglas and DeClaris,N. and Dorr, Bonnie J and Faloutsos,C.} } @article {16982, title = {AVI {\textquoteright}94: An International Workshop}, journal = {ACM SIGCHI Bulletin}, volume = {26}, year = {1994}, month = {1994/10//}, pages = {54 - 55}, abstract = {The fresh Mediterranean breezes of innovation enlivened the workshop conversations at Advanced Visual Interfaces {\textquoteright}94 (Bari, Italy June 1--4, 1994). More than 100 participants met on the flower-gardened grounds of the Grande Albergo di Villa Romanazzi Carducci, whose modern hotel plus conference center complemented the beautifully restored old villa and the marble-lined swimming pool. Being together with active professionals from Europe and America for 4 days gave us an in-depth chance to learn about each other{\textquoteright}s professional and personal outlooks. The ancient Roman architecture and the traditional Italian surroundings reminded us that the impact of our work could also last for two thousand years and shape many people{\textquoteright}s daily lives.}, isbn = {0736-6906}, doi = {10.1145/191642.1047934}, url = {http://doi.acm.org/10.1145/191642.1047934}, author = {Shneiderman, Ben and Badre,AI and Santos,Paulo} } @book {12028, title = {Active perception.}, year = {1993}, month = {1993///}, publisher = {Lawrence Erlbaum Associates, Inc}, organization = {Lawrence Erlbaum Associates, Inc}, author = {Aloimonos, J.} } @book {11948, title = {Active Perception, Vol. I of Advances in Computer Vision series}, year = {1993}, month = {1993///}, publisher = {Lawrence Erlbaum Associates}, organization = {Lawrence Erlbaum Associates}, author = {Aloimonos, J.} } @article {11963, title = {Active vision revisited}, journal = {Active Perception}, year = {1993}, month = {1993///}, author = {Aloimonos, J.} } @conference {15713, title = {An adaptive ESPRIT based on URV decomposition}, booktitle = {Acoustics, Speech, and Signal Processing, 1993. ICASSP-93., 1993 IEEE International Conference on}, volume = {4}, year = {1993}, month = {1993/04//}, pages = {37 -40 vol.4 - 37 -40 vol.4}, abstract = {ESPRIT is an algorithm for determining the fixed directions of arrival of a set of narrowband signals at an array of sensors. Its computational burden makes it unsuitable for real-time processing of signals with time-varying directions of arrival. The authors develop a new implementation of ESPRIT that has potential for real-time processing. It is based on a rank-revealing URV decomposition, rather than the eigendecomposition or singular value decomposition (SVD) used in previous ESPRIT algorithms. Its performance is demonstrated on simulated data representing both constant and time-varying signals. It is shown that the URV-based ESPRIT algorithm is effective for estimating time-varying directions-of-arrival at considerable computational savings over the SVD-based algorithm.<>}, keywords = {algorithm;array, complexity;parameter, decomposition;real-time, ESPRIT, estimation;real-time, filters;array, of, processing;adaptive, processing;computational, savings;performance;rank-revealing, sensors;computational, signal, systems;, systems;time-varying, URV, URV-based}, doi = {10.1109/ICASSP.1993.319588}, author = {Liu,K. J.R and O{\textquoteright}Leary, Dianne P. and Stewart, G.W. and Wu,Y.-J.J.} } @article {16740, title = {ADMS: a testbed for incremental access methods}, journal = {IEEE Transactions on Knowledge and Data Engineering}, volume = {5}, year = {1993}, month = {1993/10//}, pages = {762 - 774}, abstract = {ADMS is an advanced database management system developed-to experiment with incremental access methods for large and distributed databases. It has been developed over the past eight years at the University of Maryland. The paper provides an overview of ADMS, and describes its capabilities and the performance attained by its incremental access methods. This paper also describes an enhanced client-server architecture that allows an incremental gateway access to multiple heterogeneous commercial database management systems}, keywords = {Add-drop multiplexers, ADMS, advanced database management system, client-server architecture, commercial database management systems, Computational modeling, Database systems, distributed databases, heterogeneous DBMS, incremental access methods, incremental gateway, Information retrieval, interoperability, join index, large databases, Navigation, network operating systems, Object oriented databases, Object oriented modeling, Query processing, System testing, very large databases, view index, Workstations}, isbn = {1041-4347}, doi = {10.1109/69.243508}, author = {Roussopoulos, Nick and Economou,N. and Stamenas,A.} } @article {18063, title = {Advanced parallel prefix-sums, list ranking and connectivity}, journal = {Synthesis of Parallel Algorithms}, year = {1993}, month = {1993///}, pages = {215 - 257}, author = {Vishkin, Uzi} } @conference {15577, title = {Algorithms for fast vector quantization}, booktitle = {Data Compression Conference, 1993. DCC {\textquoteright}93.}, year = {1993}, month = {1993///}, pages = {381 - 390}, abstract = {This paper shows that if one is willing to relax the requirement of finding the true nearest neighbor, it is possible to achieve significant improvements in running time and at only a very small loss in the performance of the vector quantizer. The authors present three algorithms for nearest neighbor searching: standard and priority k -d tree search algorithms and a neighborhood graph search algorithm in which a directed graph is constructed for the point set and edges join neighboring points}, keywords = {algorithm;, algorithms;, directed, fast, graph, graph;, graphs;, Neighborhood, performance;, problems;, quantisation;, quantization;, running, search, time;, tree, vector}, doi = {10.1109/DCC.1993.253111}, author = {Arya,S. and Mount, Dave} } @article {16956, title = {Alpha Slider: Searching Textual Lists with Sliders}, journal = {Institute for Systems Research Technical Reports}, year = {1993}, month = {1993///}, abstract = {AlphaSlider is a query interface that uses a direct manipulation slider to select words, phrases, or names from an existing list. This paper introduces a prototype of AlphaSlider, describes the design issues, reports on an experimental evaluation, and offers directions for further research. The experiment tested 24 subjects selecting items from lists of 40, 80, 160, and 320 entries. Mean selection times only doubled with the 8-fold increase in list length. Users quickly accommodated to this selection method.}, keywords = {direct manipulation, Human-computer interaction, keyboard data entry, sliders, Systems Integration, touchscreen}, url = {http://drum.lib.umd.edu/handle/1903/5397}, author = {Osada,M. and Liao,Holmes and Shneiderman, Ben} } @article {16957, title = {Alphaslider: Development and Evaluation of Text Retrieval Methods Using Sliders}, journal = {Ninth Symposium on Human Interface}, year = {1993}, month = {1993///}, pages = {91 - 94}, abstract = {AlphaSlider is a query interface that uses a direct manipulation slider to select words, phrases, or names from an existing list. This paper introduces a prototype of AlphaSlider, describes the design issues, reports on an experimental evaluation, and offers directions for further research. The experiment tested 24 subjects selecting items from lists of 40, 80, 160, and 320 entries. Mean selection times only doubled with the 8-fold increase in list length. Users quickly accommodated to this selection method.}, author = {Osada,M. and Liao,H. and Shneiderman, Ben} } @conference {12811, title = {Analyzing concurrent systems using the Concurrency Workbench}, booktitle = {Functional Programming, Concurrency, Simulation and Automated Reasoning}, year = {1993}, month = {1993///}, pages = {129 - 144}, author = {Cleaveland, Rance} } @conference {17884, title = {Applying the CHAOS/PARTI library to irregular problems in computational chemistry and computational aerodynamics}, booktitle = {Scalable Parallel Libraries Conference, 1993., Proceedings of the}, year = {1993}, month = {1993///}, pages = {45 - 56}, author = {Das,R. and Hwang,Y. S and Uysal, M. and Saltz, J. and Sussman, Alan} } @conference {15636, title = {Approximate nearest neighbor queries in fixed dimensions}, booktitle = {Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms}, series = {SODA {\textquoteright}93}, year = {1993}, month = {1993///}, pages = {271 - 280}, publisher = {Society for Industrial and Applied Mathematics}, organization = {Society for Industrial and Applied Mathematics}, address = {Philadelphia, PA, USA}, isbn = {0-89871-313-7}, url = {http://dl.acm.org/citation.cfm?id=313559.313768}, author = {Arya,Sunil and Mount, Dave} } @article {15617, title = {Approximate nearest neighbor searching}, journal = {Proceedings of 4th Annual ACMSIAM Symposium on Discrete Algorithms (SODA{\textquoteright}93)}, year = {1993}, month = {1993///}, pages = {271 - 280}, author = {Arya,S. and Mount, Dave} } @conference {18066, title = {Approximate parallel prefix computation and its applications}, booktitle = {Parallel Processing Symposium, 1993., Proceedings of Seventh International}, year = {1993}, month = {1993///}, pages = {318 - 325}, author = {Goodrich,M. T and Matias,Y. and Vishkin, Uzi} } @article {15210, title = {Approximation Algorithms for Graph Augmentation}, journal = {Journal of Algorithms}, volume = {14}, year = {1993}, month = {1993/03//}, pages = {214 - 225}, abstract = {The problem of increasing both edge and vertex connectivity of a graph at an optimal cost is studied. Since the general problem is NP-hard, we focus on efficient approximation schemes that come within a constant factor from the optima]. Previous algorithms either do not take edge costs into consideration, or they run slower than our algorithm. Our algorithm takes as input an undirected graph G0 = (V, E0) on n vertices, that is not necessarily connected, and a set Feasible of m weighted edges on V, and outputs a subset Aug of edges which when added to G0 make it two-connected. The weight of Aug, when G0 is initially connected, is no more than twice the weight of the least weight subset of edges of Feasible that increases the connectivity to two. The running time of our algorithm is O(m + n log n). As a consequence of our results, we can find an approximation to the least-weight two-connected spanning subgraph of a two-connected weighted graph.}, isbn = {0196-6774}, doi = {10.1006/jagm.1993.1010}, url = {http://www.sciencedirect.com/science/article/pii/S0196677483710102}, author = {Khuller, Samir and Thurimella,R.} } @article {15665, title = {On the area of overlap of translated polygons}, journal = {SPIE Vision Geometry II}, volume = {2060}, year = {1993}, month = {1993///}, pages = {254 - 264}, abstract = {Given two simple polygons P and Q in the plane and a translation vector t 2R2, the area-of-overlap function of P and Q is the function Ar(t) = Area(P \(t + Q)), where t + Q denotes Q translated by t. This function has a number of applications in areas such as motion planning and object recognition. We present a number of mathematical results regarding this function. We also provide e cient algorithms for computing a representation of this function, and for tracing contour curves of constant area-of-overlap. }, author = {Mount, Dave and Silverman,R. and Wu,A.} } @conference {11978, title = {Active egomotion estimation: a qualitative approach}, booktitle = {Computer Vision{\textemdash}ECCV{\textquoteright}92}, year = {1992}, month = {1992///}, pages = {497 - 510}, author = {Aloimonos, J. and Duric, Z.} } @conference {16976, title = {Anthropomorphism: from Eliza to Terminator 2}, booktitle = {Proceedings of the SIGCHI conference on Human factors in computing systems}, series = {CHI {\textquoteright}92}, year = {1992}, month = {1992///}, pages = {67 - 70}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, isbn = {0-89791-513-5}, doi = {10.1145/142750.142760}, url = {http://doi.acm.org/10.1145/142750.142760}, author = {Don,Abbe and Brennan,Susan and Laurel,Brenda and Shneiderman, Ben} } @article {18369, title = {An application of decision theory for the evaluation of software prototypes}, journal = {Journal of Systems and Software}, volume = {19}, year = {1992}, month = {1992///}, pages = {27 - 39}, author = {C{\'a}rdenas,S. R and Tian,J. and Zelkowitz, Marvin V} } @conference {16781, title = {An algebra and calculus for relational multidatabase systems}, booktitle = {, First International Workshop on Interoperability in Multidatabase Systems, 1991. IMS {\textquoteright}91. Proceedings}, year = {1991}, month = {1991/04//}, pages = {118 - 124}, publisher = {IEEE}, organization = {IEEE}, abstract = {With the existence of many autonomous databases widely accessible through computer networks, users will require the capability to jointly manipulate data in different databases. A multidatabase system provides such a capability through a multidatabase manipulation language. The authors propose a theoretical foundation for such languages by presenting a multirelational algebra and calculus based on the relational algebra and calculus. The proposal is illustrated by various queries on an example multidatabase}, keywords = {Algebra, autonomous databases, Calculus, Computer networks, Computer science, Data models, Data structures, Database systems, database theory, distributed databases, Military computing, multidatabase manipulation language, multidatabase system, multirelational algebra, query languages, relational algebra, Relational databases, Spatial databases, theoretical foundation}, isbn = {0-8186-2205-9}, doi = {10.1109/IMS.1991.153694}, author = {Grant,J. and Litwin,W. and Roussopoulos, Nick and Sellis,T.} } @article {18080, title = {Approximate parallel scheduling. II. Applications to logarithmic-time optimal parallel graph algorithms}, journal = {Information and Computation}, volume = {92}, year = {1991}, month = {1991///}, pages = {1 - 47}, author = {Cole,R. and Vishkin, Uzi} } @book {16577, title = {Abductive Inference Models for Diagnostic Problem-Solving}, year = {1990}, month = {1990///}, publisher = {Springer-Verlag, New York}, organization = {Springer-Verlag, New York}, author = {Yun,P. and Reggia, James A.} } @article {17403, title = {The advantages of hypertext for large information spaces; where are the big systems?}, journal = {Hypertext: concepts, systems and applications: proceedings of the First European Conference on Hypertext, INRIA, France, November 1990}, year = {1990}, month = {1990///}, pages = {343 - 343}, author = {Shneiderman, Ben and Deter,R.} } @conference {12832, title = {On automatically distinguishing inequivalent processes}, booktitle = {Workshop on Computer-Aided Verification}, year = {1990}, month = {1990///}, author = {Cleaveland, Rance} } @article {14124, title = {Approximate Schur Complement Preconditioners on Serial and Parallel Computers}, journal = {SIAM Journal on Scientific and Statistical ComputingSIAM J. Sci. and Stat. Comput.}, volume = {10}, year = {1989}, month = {1989///}, pages = {581 - 581}, isbn = {01965204}, doi = {10.1137/0910037}, url = {http://link.aip.org/link/SJOCE3/v10/i3/p581/s1\&Agg=doi}, author = {Elman, Howard} } @conference {15957, title = {Assessing others{\textquoteright} knowledge and ignorance}, booktitle = {Proceedings of the 4th International Symposium on Methodologies for Intelligent Systems}, year = {1989}, month = {1989///}, author = {Kraus,S. and Perlis, Don} } @article {16234, title = {Automatically transforming regularly structured linear documents into hypertext.}, journal = {Electronic Publishing}, volume = {2}, year = {1989}, month = {1989///}, pages = {211 - 229}, abstract = {Fully automatic conversion of a paper-based document into hypertext can be achieved in manycases if the original document is naturally partitioned into a collection of small-sized pieces that are unambiguously and consistently structured. We describe the methodology that we have used successfully to design and implement several straightforward conversions from the original document{\textquoteright}s machine-readable markup. }, author = {Furuta,R. and Plaisant, Catherine and Shneiderman, Ben} } @article {18097, title = {The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time}, journal = {Algorithmica}, volume = {3}, year = {1988}, month = {1988///}, pages = {329 - 346}, author = {Cole,R. and Vishkin, Uzi} } @article {12005, title = {Active vision}, journal = {International Journal of Computer Vision}, volume = {1}, year = {1988}, month = {1988///}, pages = {333 - 356}, author = {Aloimonos, J. and Weiss, I. and Bandyopadhyay, A.} } @article {16236, title = {The American Voice and Robotics" Guardian" System: A Case Study in User Interface Usability Evaluation}, year = {1988}, month = {1988///}, institution = {University of Maryland}, abstract = {American Voice and Robotics (AVR), in conjunction with the Maryland Industrial Partnerships(MIPS) program, contracted the Human-Computer Interaction Laboratory (HCIL) to evaluate the user interface of AVR{\textquoteright}s "Guardian"home automation system. Among their goals for the system were:Ease of use and learning of the system (intuitiveness), Aesthetic appeal, Unintimidating, Impressive, High Functionality, Fast and accurate input of useraction, Clear feedback, Forgiving to errors, and Fun to use. Researchers found that users were initially impressed with the system, but that they were not fully satisfied with it. Specific initial recommendations, theoretical and methodological concerns, procedures, results, and direction of future research will be discussed. }, author = {Wallace,D.F. and Norman,K. L and Plaisant, Catherine} } @article {16537, title = {Analysis of competition-based spreading activation in connectionist models}, journal = {International journal of man-machine studies}, volume = {28}, year = {1988}, month = {1988///}, pages = {77 - 97}, author = {Wang,P. Y and Seidman,S. B and Reggia, James A.} } @article {18095, title = {Approximate parallel scheduling. Part I: The basic technique with applications to optimal parallel list ranking in logarithmic time}, journal = {SIAM Journal on Computing}, volume = {17}, year = {1988}, month = {1988///}, pages = {128 - 128}, author = {Cole,R. and Vishkin, Uzi} } @article {16599, title = {Artificial neural systems in medical science and practice.}, journal = {MD computing: computers in medical practice}, volume = {5}, year = {1988}, month = {1988///}, pages = {4 - 4}, author = {Reggia, James A.} } @article {15978, title = {Autocircumscription}, journal = {Artificial Intelligence}, volume = {36}, year = {1988}, month = {1988/09//}, pages = {223 - 236}, abstract = {Reasoning can be used to select among various possible interpretations of events. But how are these possibilities determined? We isolate two key technical features of circumscription (consistency and minimization), and use the first as the basis for a reformulation of the circumscription principle in a way related to possibility, self-knowledge, and negative introspection. The second (minimization) then can be separately expressed on its own. Conceptual clarity and a kind of validity are results of this separation, as well as a computational means to determine (sometimes) when a wff is not among a reasoner{\textquoteright}s conclusions.}, isbn = {0004-3702}, doi = {16/0004-3702(88)90003-3}, url = {http://www.sciencedirect.com/science/article/pii/0004370288900033}, author = {Perlis, Don} } @article {16370, title = {ALEX-an Alexical Programming Language}, volume = {TR87-835}, year = {1987}, month = {1987///}, institution = {Cornell University}, abstract = {ALEX is an experimental language for high-level parallel programming. It is a testbed for exploring various non-traditional ways of expressing algorithmic ideas, making extensive use of high-resolution color graphics. The language itself is not a programming language in the traditional sense, since there is no lexical syntax. This paper discusses the basic design of the ALEX user interface.}, url = {http://hdl.handle.net/1813/6675}, author = {Kozen,D. and Teitelbaum,T. and Chen,W. Z and Field,J. H and Pugh, William and Vander Zanden,B. T} } @conference {15618, title = {Algorithms for covering and packing and applications to CAD/CAM (abstract only): preliminary results}, booktitle = {Proceedings of the 15th annual conference on Computer Science}, series = {CSC {\textquoteright}87}, year = {1987}, month = {1987///}, pages = {439{\textendash} - 439{\textendash}}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Computational geometry deals with the computational complexity of geometric problems within the framework of the analysis of algorithms. Numerous applications have been found to computer graphics, computer-aided design, pattern recognition and robotics.Among the geometric problems are bin packing problems. C.A. Roger {\textquotedblleft}Packing and Covering{\textquotedblright}, Cambridge University Press (1964) studied these problems. Many of these are hard problems, and very few have been solved. Some packing problems are the restriction of a very interesting problem in CAM (computer-aided manufacture). In the manufacture of clothing, certain parts, such as sleeves, are laid out as repeated polygonal copies and combinations on a bolt of cloth. This pattern layout is traditionally (and currently) done by hand. It{\textquoteright}s a candidate for automation. We propose some special cases of this problem whose solution can be extended to practical use. We are working on several geometric questions involving packing translations of objects. Classical results in mathematics demonstrate equivalence between certain packing problems and finding optimal enclosed figures. J. O{\textquoteright}Rourke et al [{\textquotedblleft}An optimal algorithm for finding minimal enclosing triangles{\textquotedblright}, J. of Algorithms 7, 258-264 (1986)], as well as V. Klee and M. Laskowski [{\textquotedblleft}Finding the smallest triangles containing a given convex polygon{\textquotedblright}, J. of Algorithms 6, 359-375 (1985)] have produced algorithms for finding a smallest area triangle containing (or enclosing) a given polygon. Smallest area convex polygons of a certain type, containing a given set, can be viewed as larger pieces of fabric containing pattern to be cut out. We have an optimal algorithm for finding largest enclosed polygons for a given set. We also have preliminary results for smallest enclosing polygons. These results have theoretical interest, and have applications to robotics and collision avoidance, as well as to manufacture. }, isbn = {0-89791-218-7}, doi = {10.1145/322917.323100}, url = {http://doi.acm.org/10.1145/322917.323100}, author = {Mount, Dave and Silverman,Ruth} } @article {16757, title = {Analysis of object oriented spatial access methods}, journal = {ACM SIGMOD Record}, volume = {16}, year = {1987}, month = {1987///}, pages = {426 - 439}, author = {Faloutsos,C. and Sellis,T. and Roussopoulos, Nick} } @article {18115, title = {The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time, Ultracomputer Note-108}, year = {1986}, month = {1986///}, institution = {TR-242, Department of Computer Science, Courant Institute NYU}, author = {Cole,R. and Vishkin, Uzi} } @article {11933, title = {Algorithm for concurrency control in replicated databases.}, journal = {COMP. SYST. SCI. ENG.}, volume = {1}, year = {1986}, month = {1986///}, pages = {75 - 81}, abstract = {A replicated database system is a distributed database system in which some data objects are stored redundantly at multiple sites to improve the reliability of the system. Without proper control mechanisms, the consistency of a replicated database system could be violated. A new scheme to increase the reliability as well as the degree of concurrency is described. It allows transactions to operate on a data object so long as one or more token copies are available. The scheme also exploits the fact that, for recovery reasons, there are two values for one data object. It is proved that transactions executed according to this scheme preserve consistency.}, author = {Son,S. H and Agrawala, Ashok K.} } @article {16978, title = {Applying direct manipulation concepts: direct manipulation dik operating system (DMDOS)}, journal = {SIGSOFT Softw. Eng. Notes}, volume = {11}, year = {1986}, month = {1986/04//}, pages = {22 - 26}, abstract = {Software engineers are often called upon to design user interfaces, but strategies and guidelines are only beginning to emerge. Shneiderman (1983) introduced the term "Direct Manipulation" to describe user interfaces which have:1) continuous representation of the objects of interest.2) physical actions (movement and selection by mouse, joystick, touch screen, etc.) or labeled button presses instead of complex Syntax.3) rapid, incremental, reversible operations whose impact on the object of interest is immediately visible.4) layered or spiral approach to learning that permits usage with minimal knowledge.The concepts of direct manipulation has been applied in some distinctive systems such as XEROX STAR and APPLE Macintosh, and many application software products such as spread sheets, word processors, drawing tools, desk-top managers, etc.However, the basic software of personal computers, the operating system, is still often based on command language concepts. This paper describes DMDOS (Direct Manipulation Disk Operating System), that we designed by applying the concepts of direct manipulation. to MS-DOS on the IBM PC.}, isbn = {0163-5948}, doi = {10.1145/382248.382815}, url = {http://doi.acm.org/10.1145/382248.382815}, author = {Iseki,Osamu and Shneiderman, Ben} } @conference {18112, title = {Approximate and exact parallel scheduling with applications to list, tree and graph problems}, booktitle = {27th Annual Symposium on Foundations of Computer Science}, year = {1986}, month = {1986///}, pages = {478 - 491}, author = {Cole,R. and Vishkin, Uzi} } @conference {18113, title = {Approximate scheduling, exact scheduling, and applications to parallel algorithms}, booktitle = {Proceedings Symposium on Foundations of Computer Science}, year = {1986}, month = {1986///}, pages = {478 - 491}, author = {Cole,R. and Vishkin, Uzi} } @article {15717, title = {Assignment and scheduling in parallel matrix factorization}, journal = {Linear Algebra and its Applications}, volume = {77}, year = {1986}, month = {1986/05//}, pages = {275 - 299}, abstract = {We consider the problem of factoring a dense n{\texttimes}n matrix on a network consisting of P MIMD processors, with no shared memory, when the network is smaller than the number of elements in the matrix (P\<n2). The specific example analyzed is a computational network that arises in computing the LU, QR, or Cholesky factorizations. We prove that if the nodes of the network are evenly distributed among processors and if computations are scheduled by a round-robin or a least-recently-executed scheduling algorithm, then optimal order of speedup is achieved. However, such speedup is not necessarily achieved for other scheduling algorithms or if the computation for the nodes is inappropriately split across processors, and we give examples of these phenomena. Lower bounds on execution time for the algorithm are established for two important node-assignment strategies.}, isbn = {0024-3795}, doi = {10.1016/0024-3795(86)90172-2}, url = {http://www.sciencedirect.com/science/article/pii/0024379586901722}, author = {O{\textquoteright}Leary, Dianne P. and Stewart, G.W.} } @conference {16531, title = {Abductive inference}, booktitle = {Proceedigns of the Expert Systems in Government Symposium}, year = {1985}, month = {1985///}, pages = {484 - 489}, author = {Reggia, James A.} } @article {16580, title = {Answer justification in abductive expert systems for diagnostic problem solving}, journal = {IEEE Transactions on Biomedical Engineering}, year = {1985}, month = {1985///}, author = {Reggia, James A. and Perricone,B. and Nau, Dana S. and Peng,Y.} } @article {16624, title = {Answer Justification in Diagnostic Expert Systems-Part II: Supporting Plausible Justifications}, journal = {Biomedical Engineering, IEEE Transactions on}, year = {1985}, month = {1985///}, pages = {268 - 272}, author = {Reggia, James A. and Perricone,B. T. and Nau, Dana S. and Peng,Y.} } @conference {16519, title = {An abductive non-monotonic logic}, booktitle = {Workshop on Nonmonotonic Reasoning}, year = {1984}, month = {1984///}, author = {Reggia, James A. and Nau, Dana S.} } @conference {16001, title = {Applications or Protected Circumscription}, booktitle = {7th International Conference on Automated Deduction, Napa, California, USA, May 14-16, 1984: proceedings}, volume = {170}, year = {1984}, month = {1984///}, pages = {414 - 414}, author = {Minter,J. and Perlis, Don} } @book {19123, title = {Achievements and Prospects with Regard to Energy Recycling in Textile Finishing Shops}, year = {1983}, month = {1983}, publisher = {UN}, organization = {UN}, author = {Pop, Mihai and Romas, D. and Romania} } @article {15715, title = {Analysis of Relaxation Processes: the Two Node, Two Label Case}, journal = {IEEE Transactions on Systems, Man, and Cybernetics}, volume = {SMC-13}, year = {1983}, month = {1983///}, pages = {618 - 623}, author = {O{\textquoteright}Leary, Dianne P. and Peleg,Shmuel} } @article {16959, title = {An architecture for automatic relational database sytem conversion}, journal = {ACM Trans. Database Syst.}, volume = {7}, year = {1982}, month = {1982/06//}, pages = {235 - 257}, abstract = {Changes in requirements for database systems necessitate schema restructuring, database translation, and application or query program conversion. An alternative to the lengthy manual revision process is proposed by offering a set of 15 transformations keyed to the relational model of data and the relational algebra. Motivations, examples, and detailed descriptions are provided.}, keywords = {automatic conversion, Database systems, relational model, transformations}, isbn = {0362-5915}, doi = {10.1145/319702.319724}, url = {http://doi.acm.org/10.1145/319702.319724}, author = {Shneiderman, Ben and Thomas,Glenn} } @conference {16981, title = {Automatic database system conversion: schema revision, data translation, and source-to-source program transformation}, booktitle = {Proceedings of the June 7-10, 1982, national computer conference}, series = {AFIPS {\textquoteright}82}, year = {1982}, month = {1982///}, pages = {579 - 587}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Changing data requirements present database administrators with a difficult problem: the revision of the schema, the translation of the stored database, and the conversion of the numerous application programs. This paper describes an automatic database system conversion facility which provides one approach for coping with this problem. The Pure Definition Language and the Pure Manipulation Language have been designed to facilitate the conversions specified in the Pure Transformation Language. Two conversions and their effect on retrievals are demonstrated.}, isbn = {0-88283-035-X}, doi = {10.1145/1500774.1500849}, url = {http://doi.acm.org/10.1145/1500774.1500849}, author = {Shneiderman, Ben and Thomas,Glenn} } @article {15710, title = {Algorithm 572: Solution of the Helmholtz Equation for the Dirichlet Problem on General Bounded Three-Dimensional Regions [D3]}, journal = {ACM Transactions on Mathematical Software}, volume = {7}, year = {1981}, month = {1981/06//}, pages = {239 - 246}, isbn = {0098-3500}, doi = {10.1145/355945.355954}, url = {http://doi.acm.org/10.1145/355945.355954}, author = {O{\textquoteright}Leary, Dianne P. and Widlund,Olof} } @article {18366, title = {Advances in software engineering resource estimation}, journal = {Advances in computer programming management}, volume = {1}, year = {1980}, month = {1980///}, pages = {206 - 225}, author = {Zelkowitz, Marvin V} } @article {11935, title = {An Algorithm for Mutual Exclusion in Computer Networks.}, year = {1980}, month = {1980///}, institution = {Department of Computer Science, University of Maryland, College Park}, abstract = {An algorithm is proposed which creates mutual exclusion in a computer network whose nodes can communicate only by messages and do not share memory. The algorithm sends only 2*(N-1) Messages, where N is the number of nodes in the network, per critical section invocation. This number of messages is a minimum if parallel, distributed, symmetric control is used; hence, the algorithm is optimal in this minimal under some general assumptions. Like Lamport{\textquoteright}s {\textquoteright}bakery algorithm,{\textquoteright} unbounded sequence numbers are used to provide first-come first-served priority into the critical section. It is shown that the number can be contained in a fixed amount of memory by storing it as the residue of a modulus. The number of messages required to implement the exclusion can be reduced by using sequential node-by-node processing, by using broadcast message techniques or by sending information through timing channels. The readers and writers problem is solved by a simple modification of the algorithm. The modifications necessary to make the algorithm robust are described.}, author = {Agrawala, Ashok K. and Ricart, G.} } @article {16775, title = {Approximate pattern matching in a pattern database system}, journal = {Information Systems}, volume = {5}, year = {1980}, month = {1980///}, pages = {107 - 119}, abstract = {This work is concerned with the organization of a large database of binary pictures (normalized for size, rotation and position) and with the efficient "inexact match" of an input pattern against the whole database. Current techniques in pattern analysis use matching algorithms without any regard to the global organization of the storage representations of the models they are to match. Consequently, the algorithms are only practical for small databases. This paper discusses the design of a pattern database system and the economy that it provides for the matching problem. The database organization is based on the quad-tree representation of binary patterns. Given an arbitrary decomposition D (or partition) of a pattern P and an arbitrary function f on the pattern, we repeatedly apply f on D(P), D(D(P))P, ... to obtain higher and higher levels of abstraction f(D)(P)), f(D(D(P))), ... of the pattern. The computed values obtained after the jth application of f are used to label the ith level of the pyramid. The specific representation used in this paper is called the sum-quad-tree, in which each level of the tree stores the sum of the labels of its sons. The lowest level of the sum-quad-tree corresponds to the individual pixels and is the nth level (i.e. node m at level n implies v(m) = 0 or v(m) = 1). Nodes at the jth level of the sum-quad-tree correspond to sums of 2n-j {\texttimes} 2n-j picture points, so that the 0th level contains the number of 1{\textquoteright}s in the pattern. The pyramid representation is used as a hierarchical (n-level) indexing scheme of the database. The advantage of this organization is that the matching algorithms presented reject most of the patterns in the database by utilizing the relatively small in size index tables and thus avoid the overhead of unnecessary CPU time and operation between main memory and secondary storage.}, isbn = {0306-4379}, doi = {16/0306-4379(80)90002-2}, url = {http://www.sciencedirect.com/science/article/pii/0306437980900022}, author = {Davis, Larry S. and Roussopoulos, Nick} } @article {18967, title = {Are snRNPs involved in splicing?}, journal = {Nature}, volume = {283}, year = {1980}, month = {1980/01/10/}, pages = {220 - 224}, abstract = {Discrete, stable small RNA molecules are found in the nuclei of cells from a wide variety of eukaryotic organisms. Many of these small nuclear RNA (snRNA) species, which range in size from about 90 to 220 nucleotides, have been well-characterised biochemically, and some sequenced. However, their function has remained obscure. The most abundant snRNA species exist as a closely related set of RNA{\textendash}protein complexes called small nuclear ribonucleoproteins (snRNPs). snRNPs are the antigens recognised by antibodies from some patients with lupus erythematosus (LE), an autoimmune rheumatic disease. Anti-RNP antibodies from lupus sera selectively precipitate snRNP species containing Ula7 and Ulb9 RNAs from mouse Ehrlich ascites cell nuclei, whereas anti-Sm antibodies bind these snRNPs and four others containing U2, U4, US and U6 RNAs. Both antibody systems precipitate the same seven prominent nuclear proteins (molecular weight 12,000{\textendash}32,000). All molecules of the snRNAs U1, U2, U4, U5 and U6 appear to exist in the form of antigenic snRNPs9. The particles sediment at about 10S and each probably contains a single snRNA molecule. Indirect immunofluorescence studies using anti-RNP and anti-Sm sera confirm the nuclear (but non-nucleolar) location of the antigenic snRNPs. Here we present several lines of evidence that suggest a direct involvement of snRNPs in the splicing of hnRNA. Most intriguing is the observation that the nucleotide sequence at the 5' end of U1 RNA exhibits extensive complementarity to those across splice junctions in hnRNA molecules.}, doi = {10.1038/283220a0}, url = {http://www.nature.com/nature/journal/v283/n5743/abs/283220a0.html}, author = {Lerner,Michael R. and Boyle,John A. and Mount, Stephen M. and Wolin,Sandra L. and Steitz,Joan A.} } @article {16980, title = {Automatic database system conversion: A transformation language approach to sub-schema implementation}, journal = {IEEE Computer Software and Applications Conference}, year = {1980}, month = {1980///}, pages = {80 - 88}, author = {Thomas,G. and Shneiderman, Ben} } @conference {18375, title = {Analyzing medium-scale software development}, booktitle = {Proceedings of the 3rd international conference on Software engineering}, series = {ICSE {\textquoteright}78}, year = {1978}, month = {1978///}, pages = {116 - 123}, publisher = {IEEE Press}, organization = {IEEE Press}, address = {Piscataway, NJ, USA}, abstract = {The collection and analysis of data from programming projects is necessary for the appropriate evaluation of software engineering methodologies. Towards this end, the Software Engineering Laboratory was organized between the University of Maryland and NASA Goddard Space Flight Center. This paper describes the structure of the Laboratory and provides some data on project evaluation from some of the early projects that have been monitored. The analysis relates to resource forecasting using a model of the project life cycle based upon the Rayleigh equation and to error rates applying ideas developed by Belady and Lehman.}, url = {http://dl.acm.org/citation.cfm?id=800099.803200}, author = {Basili, Victor R. and Zelkowitz, Marvin V} } @article {15973, title = {An application of compiler simulation at the source language level}, journal = {The Computer Journal}, volume = {19}, year = {1976}, month = {1976///}, pages = {90 - 90}, author = {Perlis, Don} } @conference {18376, title = {Automatic program analysis and evaluation}, booktitle = {Proceedings of the 2nd international conference on Software engineering}, series = {ICSE {\textquoteright}76}, year = {1976}, month = {1976///}, pages = {158 - 163}, publisher = {IEEE Computer Society Press}, organization = {IEEE Computer Society Press}, address = {Los Alamitos, CA, USA}, abstract = {There is currently considerable interest in the computing community in the evaluation of computer programming. However, in order to objectively evaluate such concepts, it is necessary to undertake a thorough evaluation of the programming process itself. Most previous studies of this type have analyzed, by hand usually, a few instances of programs. This has led to some general conjectures; however, the amount of information that must be processed precludes any large scale analysis. In order to avoid this problem, an automatic data collection facility has been implemented as part of a PL/1 compiler at the University of Maryland. This system automatically collects information on each program that has been compiled - at almost no additional cost to the user of the compiler. This paper will describe the system and will evaluate some of the characteristics of some of the 25,000 programs that have been run since July, 1975.}, keywords = {ERRORS, Evaluation, Program complexity, Program measurement, Static and dynamic analysis}, url = {http://dl.acm.org/citation.cfm?id=800253.807668}, author = {Zelkowitz, Marvin V} }