@booklet {19504, title = {Testing Run-time Evolving Systems}, howpublished = {DROPS-IDN/2106}, year = {Submitted}, keywords = {004, Dynamically Evolving Systems, Software testing}, doi = {InProceedings}, url = {http://drops.dagstuhl.de/opus/volltexte/2009/2106/} } @article {19690, title = {Topic Models for Translation Domain Adaptation}, journal = {mimno.infosci.cornell.edu}, year = {Submitted}, abstract = {Abstract Topic models have been successfully applied in domain adaptation for translation models. However, previous works applied topic models only on source side and ignored the relations between source and target languages in machine translation. This paper ...}, url = {http://mimno.infosci.cornell.edu/nips2013ws/nips2013tm_submission_19.pdf}, author = {Hu, Y and Zhai, K and Edelman, V and Jordan Boyd-Graber} } @article {19693, title = {Tree-based Label Dependency Topic Models}, journal = {cs.umd.edu}, year = {Submitted}, abstract = {Abstract Multi-labeled corpora, where each document is tagged with a set of labels, are ubiquitous. When the number of unique labels in the dataset is large, there are naturally some dependencies among the labels. In this paper, we propose TREELAD{\textemdash}a ...}, url = {http://www.cs.umd.edu/~vietan/2013_l2h.pdf}, author = {Nguyen, V A and Jordan Boyd-Graber and Chang, J and Resnik, P} } @article {19716, title = {TIGRFAMs and Genome Properties in 2013.}, journal = {Nucleic Acids Res}, volume = {41}, year = {2013}, month = {2013 Jan}, pages = {D387-95}, abstract = {

TIGRFAMs, available online at http://www.jcvi.org/tigrfams is a database of protein family definitions. Each entry features a seed alignment of trusted representative sequences, a hidden Markov model (HMM) built from that alignment, cutoff scores that let automated annotation pipelines decide which proteins are members, and annotations for transfer onto member proteins. Most TIGRFAMs models are designated equivalog, meaning they assign a specific name to proteins conserved in function from a common ancestral sequence. Models describing more functionally heterogeneous families are designated subfamily or domain, and assign less specific but more widely applicable annotations. The Genome Properties database, available at http://www.jcvi.org/genome-properties, specifies how computed evidence, including TIGRFAMs HMM results, should be used to judge whether an enzymatic pathway, a protein complex or another type of molecular subsystem is encoded in a genome. TIGRFAMs and Genome Properties content are developed in concert because subsystems reconstruction for large numbers of genomes guides selection of seed alignment sequences and cutoff values during protein family construction. Both databases specialize heavily in bacterial and archaeal subsystems. At present, 4284 models appear in TIGRFAMs, while 628 systems are described by Genome Properties. Content derives both from subsystem discovery work and from biocuration of the scientific literature.

}, keywords = {Databases, Protein, Genome, Archaeal, Genome, Bacterial, Genomics, Internet, Markov chains, Molecular Sequence Annotation, Proteins, sequence alignment}, issn = {1362-4962}, doi = {10.1093/nar/gks1234}, author = {Haft, Daniel H and Jeremy D Selengut and Richter, Roland A and Harkins, Derek and Basu, Malay K and Beck, Erin} } @article {14398, title = {TACI: Taxonomy-Aware Catalog Integration}, journal = {IEEE Transactions on Knowledge and Data Engineering (TKDE)}, year = {2012}, month = {2012///}, abstract = {A fundamental data integration task faced by online commercial portals and commerce search engines is the integration of products coming from multiple providers to their product catalogs. In this scenario, the commercial portal has its own taxonomy (the {\textquotedblleft}master taxonomy{\textquotedblright}), while each data provider organizes its products into a different taxonomy (the {\textquotedblleft}provider taxonomy{\textquotedblright}). In this paper, we consider the problem of categorizing products from the data providers into the master taxonomy, while making use of the provider taxonomy information. Our approach is based on a taxonomy-aware processing step that adjusts the results of a text-based classifier to ensure that products that are close together in the provider taxonomy remain close in the master taxonomy. We formulate this intuition as a structured prediction optimization problem. To the best of our knowledge, this is the first approach that leverages the structure of taxonomies in order to enhance catalog integration. We propose algorithms that are scalable and thus applicable to the large datasets that are typical on the Web. We evaluate our algorithms on real-world data and we show that taxonomy-aware classification provides a significant improvement over existing approaches.}, author = {Papadimitriou,P. and Tsaparas,P. and Fuxman,A. and Getoor, Lise} } @article {12858, title = {Temporal and Spatial Variability in the Distribution of Vibrio vulnificus in the Chesapeake Bay: A Hindcast Study}, journal = {EcoHealth}, year = {2012}, month = {2012///}, pages = {1 - 12}, abstract = {Vibrio vulnificus, an estuarine bacterium, is the causative agent of seafood-related gastroenteritis, primary septicemia, and wound infections worldwide. It occurs as part of the normal microflora of coastal marine environments and can be isolated from water, sediment, and oysters. Hindcast prediction was undertaken to determine spatial and temporal variability in the likelihood of occurrence of V. vulnificus in surface waters of the Chesapeake Bay. Hindcast predictions were achieved by forcing a multivariate habitat suitability model with simulated sea surface temperature and salinity in the Bay for the period between 1991 and 2005 and the potential hotspots of occurrence of V. vulnificus in the Chesapeake Bay were identified. The likelihood of occurrence of V. vulnificus during high and low rainfall years was analyzed. From results of the study, it is concluded that hindcast prediction yields an improved understanding of environmental conditions associated with occurrence of V. vulnificus in the Chesapeake Bay.}, doi = {10.1007/s10393-011-0736-4}, author = {Banakar,V. and Constantin de Magny,G. and Jacobs,J. and Murtugudde,R. and Huq,A. and J. Wood,R. and Rita R Colwell} } @article {17515, title = {A Temporal Pattern Search Algorithm for Personal History Event Visualization}, journal = {Knowledge and Data Engineering, IEEE Transactions on}, volume = {24}, year = {2012}, month = {2012/05//}, pages = {799 - 812}, abstract = {We present Temporal Pattern Search (TPS), a novel algorithm for searching for temporal patterns of events in historical personal histories. The traditional method of searching for such patterns uses an automaton-based approach over a single array of events, sorted by time stamps. Instead, TPS operates on a set of arrays, where each array contains all events of the same type, sorted by time stamps. TPS searches for a particular item in the pattern using a binary search over the appropriate arrays. Although binary search is considerably more expensive per item, it allows TPS to skip many unnecessary events in personal histories. We show that TPS{\textquoteright}s running time is bounded by O(m2n lg(n)), where m is the length of (number of events) a search pattern, and n is the number of events in a record (history). Although the asymptotic running time of TPS is inferior to that of a nondeterministic finite automaton (NFA) approach (O(mn)), TPS performs better than NFA under our experimental conditions. We also show TPS is very competitive with Shift-And, a bit-parallel approach, with real data. Since the experimental conditions we describe here subsume the conditions under which analysts would typically use TPS (i.e., within an interactive visualization program), we argue that TPS is an appropriate design choice for us.}, keywords = {automaton-based approach, binary search, bit-parallel approach, data visualisation, electronic health records, event array, finite automata, interactive visualization program, Lifelines2 visualization tool, medical information systems, NFA approach, nondeterministic finite automaton, O(m2n lg(n)) problem, pattern matching, personal history event visualization, Shift-And approach, temporal pattern search algorithm, time stamp}, isbn = {1041-4347}, doi = {10.1109/TKDE.2010.257}, author = {Wang,T. D and Deshpande, Amol and Shneiderman, Ben} } @article {12420, title = {Topic Models for Dynamic Translation Model Adaptation}, journal = {Association for Computational Linguistics}, year = {2012}, month = {2012///}, abstract = {We propose an approach that biases machine translation systems toward relevant transla- tions based on topic-specific contexts, where topics are induced in an unsupervised way using topic models; this can be thought of as inducing subcorpora for adaptation with- out any human annotation. We use these topic distributions to compute topic-dependent lex- ical weighting probabilities and directly in- corporate them into our translation model as features. Conditioning lexical probabilities on the topic biases translations toward topic- relevant output, resulting in significant im- provements of up to 1 BLEU and 3 TER on Chinese to English translation over a strong baseline.}, author = {Vladimir Eidelman and Jordan Boyd-Graber and Resnik, Philip} } @article {18605, title = {Towards a cost model for network traffic}, journal = {SIGCOMM Comput. Commun. Rev.}, volume = {42}, year = {2012}, month = {2012///}, pages = {54 - 60}, abstract = {We develop a holistic cost model that operators can use to help evaluate the costs of various routing and peering decisions. Using real traffic data from a large carrier network, we show how network operators can use this cost model to significantly reduce the cost of carrying traffic in their networks. We find that adjusting the routing for a small fraction of total flows (and total traffic volume) significantly reduces cost in many cases. We also show how operators can use the cost model both to evaluate potential peering arrangements and for other network operations problems.}, keywords = {cost optimization, traffic cost model}, isbn = {0146-4833}, doi = {10.1145/2096149.2096157}, url = {http://doi.acm.org/10.1145/2096149.2096157}, author = {Motiwala,Murtaza and Dhamdhere,Amogh and Feamster, Nick and Lakhina,Anukool} } @conference {16031, title = {Towards event sequence representation, reasoning and visualization for EHR data}, booktitle = {Proceedings of the 2nd ACM SIGHIT International Health Informatics Symposium}, series = {IHI {\textquoteright}12}, year = {2012}, month = {2012///}, pages = {801 - 806}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Efficient analysis of event sequences and the ability to answer time-related, clinically important questions can accelerate clinical research in several areas such as causality assessments, decision support systems, and retrospective studies. The Clinical Narrative Temporal Reasoning Ontology (CNTRO)-based system is designed for semantically representing, annotating, and inferring temporal relations and constraints for clinical events in Electronic Health Records (EHR) represented in both structured and unstructured ways. The LifeFlow system is designed to support an interactive exploration of event sequences using visualization techniques. The combination of the two systems will provide a comprehensive environment for users to visualize inferred temporal relationships from EHR data. This paper discusses our preliminary efforts on connecting the two systems and the benefits we envision from such an environment.}, keywords = {ehr, semantic web, temporal relation reasoning, time trend visualization}, isbn = {978-1-4503-0781-9}, doi = {10.1145/2110363.2110461}, url = {http://doi.acm.org/10.1145/2110363.2110461}, author = {Tao,Cui and Wongsuphasawat,Krist and Clark,Kimberly and Plaisant, Catherine and Shneiderman, Ben and Chute,Christopher G.} } @article {15115, title = {Two-server password-only authenticated key exchange}, journal = {Journal of Computer and System Sciences}, volume = {78}, year = {2012}, month = {2012/03//}, pages = {651 - 669}, abstract = {Typical protocols for password-based authentication assume a single server that stores all the information (e.g., the password) necessary to authenticate a user. An inherent limitation of this approach, assuming low-entropy passwords are used, is that the user's password is exposed if this server is ever compromised. To address this issue, it has been suggested to share a user's password information among multiple servers, and to have these servers cooperate (possibly in a threshold manner) when the user wants to authenticate. We show here a two-server version of the password-only key-exchange protocol of Katz, Ostrovsky, and Yung (the KOY protocol). Our work gives the first secure two-server protocol for the password-only setting (in which the user need remember only a password, and not the servers' public keys), and is the first two-server protocol (in any setting) with a proof of security in the standard model. Our work thus fills a gap left by the work of MacKenzie et al. (2006) [31] and Di Raimondo and Gennaro (2006) [16]. As an additional benefit of our work, we show modifications that improve the efficiency of the original KOY protocol.}, keywords = {Key-exchange protocols, passwords}, isbn = {0022-0000}, doi = {10.1016/j.jcss.2011.09.005}, url = {http://www.sciencedirect.com/science/article/pii/S0022000011001048}, author = {Katz, Jonathan and MacKenzie,Philip and Taban,Gelareh and Gligor,Virgil} } @article {16045, title = {A task taxonomy of network evolution analysis}, journal = {University of Maryland, Human-Computer Interaction Lab Tech Report HCIL-2011-09}, year = {2011}, month = {2011///}, abstract = {Visualization is a useful tool for understanding the nature of networks. The recent growth of social media requires morepowerful visualization techniques beyond static network diagrams. One of the most important challenges is the visualization of temporal network evolution. In order to provide strong temporal visualization methods, we need to understand what tasks users accomplish. This study provides a taxonomy of the temporal network visualization tasks. We identify (1) the entities, (2) the properties to be visualized, and (3) the hierarchy of temporal features, which were extracted by surveying existing temporal network visualization systems. By building and examining the task taxonomy, we report which tasks have been covered so far and suggest additions for designing the future visualizations. We also present example visualizations constructed using the task taxonomy for a social networking site in order to validate the quality of the taxonomy. }, author = {Ahn,JW and Plaisant, Catherine and Shneiderman, Ben} } @conference {19258, title = {Teaching cross-platform design and testing methods for embedded systems using DICE}, series = {WESE {\textquoteright}11}, year = {2011}, month = {2011}, pages = {38 - 45}, publisher = {ACM}, organization = {ACM}, abstract = {DICE (the DSPCAD Integrative Command Line Environment) is a package of utilities that facilitates efficient management of software projects. Key areas of emphasis in DICE are cross-platform operation, support for projects that integrate heterogeneous programming languages, and support for applying and integrating different kinds of design and testing methodologies. The package is being developed at the University of Maryland to facilitate the research and teaching of methods for implementation, testing, evolution, and revision of engineering software. The platform- and language-independent focus of DICE makes it an effective vehicle for teaching high-productivity, high-reliability methods for design and implementation of embedded systems for a variety of courses. In this paper, we provide an overview of features of DICE --- particularly as they relate to testing driven design practices --- that are useful in embedded systems education, and discuss examples and experiences of applying the tool in courses at the University of Maryland aimed at diverse groups of students --- undergraduate programming concepts for engineers, graduate VLSI architectures (aimed at research-oriented students), and graduate FPGA system design (aimed at professional Master{\textquoteright}s students).}, isbn = {978-1-4503-1046-8}, url = {http://doi.acm.org/10.1145/2077370.2077376}, author = {Bhattacharyya, Shuvra S. and Plishker,William and Gupta, Ayush and Chung-Ching Shen} } @article {17396, title = {Technology-mediated social participation: the next 25 years of HCI challenges}, journal = {Human-Computer Interaction. Design and Development Approaches}, year = {2011}, month = {2011///}, pages = {3 - 14}, abstract = {The dramatic success of social media such as Facebook, Twitter, YouTube, blogs, and traditional discussion groups empowers individuals to become active in local and global communities. Some enthusiasts believe that with modest redesign, these technologies can be harnessed to support national priorities such as healthcare/wellness, disaster response, community safety, energy sustainability, etc. However, accomplishing these ambitious goals will require long-term research to develop validated scientific theories and reliable, secure, and scalable technology strategies. The enduring questions of how to motivate participation, increase social trust, and promote collaboration remain grand challenges even as the technology rapidly evolves. This talk invites researchers across multiple disciplines to participate in redefining our discipline of Human-Computer Interaction (HCI) along more social lines to answer vital research questions while creating inspirational prototypes, conducting innovative evaluations, and developing robust technologies. By placing greater emphasis on social media, the HCI community could constructively influence these historic changes.}, author = {Shneiderman, Ben} } @article {12860, title = {Temperature regulation of virulence factors in the pathogen Vibrio coralliilyticus}, journal = {The ISME Journal}, volume = {6}, year = {2011}, month = {2011/12/08/}, pages = {835 - 846}, abstract = {Sea surface temperatures (SST) are rising because of global climate change. As a result, pathogenic Vibrio species that infect humans and marine organisms during warmer summer months are of growing concern. Coral reefs, in particular, are already experiencing unprecedented degradation worldwide due in part to infectious disease outbreaks and bleaching episodes that are exacerbated by increasing SST. For example, Vibrio coralliilyticus, a globally distributed bacterium associated with multiple coral diseases, infects corals at temperatures above 27 {\textdegree}C. The mechanisms underlying this temperature-dependent pathogenicity, however, are unknown. In this study, we identify potential virulence mechanisms using whole genome sequencing of V. coralliilyticus ATCC (American Type Culture Collection) BAA-450. Furthermore, we demonstrate direct temperature regulation of numerous virulence factors using proteomic analysis and bioassays. Virulence factors involved in motility, host degradation, secretion, antimicrobial resistance and transcriptional regulation are upregulated at the higher virulent temperature of 27 {\textdegree}C, concurrent with phenotypic changes in motility, antibiotic resistance, hemolysis, cytotoxicity and bioluminescence. These results provide evidence that temperature regulates multiple virulence mechanisms in V. coralliilyticus, independent of abundance. The ecological and biological significance of this temperature-dependent virulence response is reinforced by climate change models that predict tropical SST to consistently exceed 27 {\textdegree}C during the spring, summer and fall seasons. We propose V. coralliilyticus as a model Gram-negative bacterium to study temperature-dependent pathogenicity in Vibrio-related diseases.}, keywords = {ecophysiology, ecosystems, environmental biotechnology, geomicrobiology, ISME J, microbe interactions, microbial communities, microbial ecology, microbial engineering, microbial epidemiology, microbial genomics, microorganisms}, isbn = {1751-7362}, doi = {10.1038/ismej.2011.154}, url = {http://www.nature.com/ismej/journal/v6/n4/full/ismej2011154a.html}, author = {Kimes,Nikole E. and Grim,Christopher J. and Johnson,Wesley R. and Hasan,Nur A. and Tall,Ben D. and Kothary,Mahendra H. and Kiss,Hajnalka and Munk,A. Christine and Tapia,Roxanne and Green,Lance and Detter,Chris and Bruce,David C. and Brettin,Thomas S. and Rita R Colwell and Morris,Pamela J.} } @conference {13659, title = {Template based Segmentation of Touching Components in Handwritten Text Lines}, booktitle = {11th Intl. Conf. on Document Analysis and Recognition (ICDAR{\textquoteright}11)}, year = {2011}, month = {2011///}, pages = {569 - 573}, abstract = {In this paper, we present a template based approach to the segmentation of touching components in handwritten text lines. Local patches around touching components are identified and a dictionary is created consisting of template patches together with correct segmentations. We use two shape context based methods to compute similarity between input patches and dictionary templates to find the best match. The template{\textquoteright}s known segmentation is then transformed to segment the input patch. Experiments are carried on a dataset of touching text lines.}, author = {Kang,Le and David Doermann} } @inbook {16046, title = {Temporal Visualization of Social Network Dynamics: Prototypes for Nation of Neighbors}, booktitle = {Social Computing, Behavioral-Cultural Modeling and PredictionSocial Computing, Behavioral-Cultural Modeling and Prediction}, series = {Lecture Notes in Computer Science}, volume = {6589}, year = {2011}, month = {2011///}, pages = {309 - 316}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {Information visualization is a powerful tool for analyzing the dynamic nature of social communities. Using Nation of Neighbors community network as a testbed, we propose five principles of implementing temporal visualizations for social networks and present two research prototypes: NodeXL and TempoVis. Three different states are defined in order to visualize the temporal changes of social networks. We designed the prototypes to show the benefits of the proposed ideas by letting users interactively explore temporal changes of social networks.}, isbn = {978-3-642-19655-3}, url = {http://dx.doi.org/10.1007/978-3-642-19656-0_43}, author = {Ahn,Jae-wook and Taieb-Maimon,Meirav and Sopan,Awalin and Plaisant, Catherine and Shneiderman, Ben}, editor = {Salerno,John and Yang,Shanchieh and Nau, Dana S. and Chai,Sun-Ki} } @article {11903, title = {Threat-Aware Clustering in Wireless Sensor Networks}, journal = {IFIP Advances in Information and Communication Technology (AICT)}, volume = {264}, year = {2011}, month = {2011///}, pages = {1 - 12}, author = {Abd-Almageed, Wael and Blace,R.E. and Eltoweissy,M.} } @conference {17979, title = {Toolchain for Programming, Simulating and Studying the XMT Many-Core Architecture}, booktitle = {Parallel and Distributed Processing Workshops and Phd Forum (IPDPSW), 2011 IEEE International Symposium on}, year = {2011}, month = {2011/05//}, pages = {1282 - 1291}, abstract = {The Explicit Multi-Threading (XMT) is a general-purpose many-core computing platform, with the vision of a 1000-core chip that is easy to program but does not compromise on performance. This paper presents a publicly available tool chain for XMT, complete with a highly configurable cycle-accurate simulator and an optimizing compiler. The XMT tool chain has matured and has been validated to a point where its description merits publication. In particular, research and experimentation enabled by the tool chain played a central role in supporting the ease-of-programming and performance aspects of the XMT architecture. The compiler and the simulator are also important milestones for an efficient programmer{\textquoteright}s workflow from PRAM algorithms to programs that run on the shared memory XMT hardware. This workflow is a key component in accomplishing the dual goal of ease-of-programming and performance. The applicability of our tool chain extends beyond specific XMT choices. It can be used to explore the much greater design space of shared memory many-cores by system researchers or by programmers. As the tool chain can practically run on any computer, it provides a supportive environment for teaching parallel algorithmic thinking with a programming component. Unobstructed by techniques such as decomposition-first and programming for locality, this environment may be useful in deferring the teaching of these techniques, when desired, to more advanced or platform-specific courses.}, keywords = {algorithm;XMT, architecture;XMT, architectures;shared, chain;cycle-accurate, compiler;programmer, compilers;parallel, component;shared, computing;optimizing, hardware;shared, many-core, many-core;concurrency, memory, multithreading;general-purpose, PRAM, simulator;ease-of-programming;explicit, systems;, theory;multi-threading;optimising, tool, workflow;programming, XMT}, doi = {10.1109/IPDPS.2011.270}, author = {Keceli,F. and Tzannes,A. and Caragea,G.C. and Barua,R. and Vishkin, Uzi} } @article {19256, title = {Topological Patterns for Scalable Representation and Analysis of Dataflow Graphs}, journal = {Journal of Signal Processing Systems}, volume = {65}, year = {2011}, month = {2011}, pages = {229 - 244}, abstract = {Tools for designing signal processing systems with their semantic foundation in dataflow modeling often use high-level graphical user interfaces (GUIs) or text based languages that allow specifying applications as directed graphs. Such graphical representations serve as an initial reference point for further analysis and optimizations that lead to platform-specific implementations. For large-scale applications, the underlying graphs often consist of smaller substructures that repeat multiple times. To enable more concise representation and direct analysis of such substructures in the context of high level DSP specification languages and design tools, we develop the modeling concept of topological patterns, and propose ways for supporting this concept in a high-level language. We augment the dataflow interchange format (DIF) language{\textemdash}a language for specifying DSP-oriented dataflow graphs{\textemdash}with constructs for supporting topological patterns, and we show how topological patterns can be effective in various aspects of embedded signal processing design flows using specific application examples.}, keywords = {Circuits and Systems, Computer Imaging, Vision, Pattern Recognition and Graphics, Dataflow graphs, Electrical Engineering, High-level languages, Image Processing and Computer Vision, model-based design, pattern recognition, Signal processing systems, Signal, Image and Speech Processing, Topological patterns}, isbn = {1939-8018, 1939-8115}, url = {http://link.springer.com/article/10.1007/s11265-011-0610-1}, author = {Sane, Nimish and Kee, Hojin and Seetharaman, Gunasekaran and Bhattacharyya, Shuvra S.} } @conference {19507, title = {Toward a Standard Benchmark for Computer Security Research: The Worldwide Intelligence Network Environment (WINE)}, booktitle = {BADGERS {\textquoteright}11 Proceedings of the First Workshop on Building Analysis Datasets and Gathering Experience Returns for Security}, series = {BADGERS {\textquoteright}11}, year = {2011}, month = {2011///}, pages = {89 - 96}, publisher = {ACM}, organization = {ACM}, abstract = {Unlike benchmarks that focus on performance or reliability evaluations, a benchmark for computer security must necessarily include sensitive code and data. Because these artifacts could damage systems or reveal personally identifiable information about the users affected by cyber attacks, publicly disseminating such a benchmark raises several scientific, ethical and legal challenges. We propose the Worldwide Intelligence Network Environment (WINE), a security-benchmarking approach based on rigorous experimental methods. WINE includes representative field data, collected worldwide from 240,000 sensors, for new empirical studies, and it will enable the validation of research on all the phases in the lifecycle of security threats. We tackle the key challenges for security benchmarking by designing a platform for repeatable experimentation on the WINE data sets and by collecting the metadata required for understanding the results. In this paper, we review the unique characteristics of the WINE data, we discuss why rigorous benchmarking will provide fresh insights on the security arms race and we propose a research agenda for this area.}, isbn = {978-1-4503-0768-0}, url = {http://doi.acm.org/10.1145/1978672.1978683}, author = {Tudor Dumitras and Shou, Darren} } @article {13949, title = {Toward improved aeromechanics simulations using recent advancements in scientific computing}, journal = {Proceedings 67th Annual Forum of the American Helicopter Society}, year = {2011}, month = {2011///}, pages = {3 - 5}, author = {Hu,Q. and Syal,M. and Gumerov, Nail A. and Duraiswami, Ramani and Leishman,J.G.} } @article {15450, title = {Towards incremental component compatibility testing}, journal = {Proceedings of the 14th international ACM Sigsoft symposium on Component based software engineering, CBSE}, volume = {11}, year = {2011}, month = {2011///}, pages = {119 - 128}, abstract = {Software components are increasingly assembled from othercomponents. Each component may further depend on oth- ers, and each may have multiple active versions. The to- tal number of configurations{\textemdash}combinations of components and their versions{\textemdash}deployed by end users can be very large. Component developers, therefore, spend considerable time and effort doing compatibility testing {\textendash} determining whether their components can be built correctly for all deployed con- figurations. In previous work we developed Rachet to sup- port large-scale compatibility testing of components. In this paper, we describe and evaluate methods to enable Rachet to perform incremental compatibility testing. We de- scribe algorithms to compute differences in component com- patibilities between current and previous component builds, a formal test adequacy criterion based on covering the differ- ences, and cache-aware configuration sampling and testing methods that attempt to reuse effort from previous testing sessions. We evaluate our approach using the 5-year evo- lution history of a scientific middleware component. Our results show significant performance improvements over Ra- chet{\textquoteright}s previous retest-all approach, making the process of compatibility testing practical for evolving components. }, author = {Yoon,I. and Sussman, Alan and Memon, Atif M. and Porter, Adam} } @article {19047, title = {Towards Practical Oblivious RAM}, journal = {arXiv:1106.3652}, year = {2011}, month = {2011}, abstract = {We take an important step forward in making Oblivious RAM (O-RAM) practical. We propose an O-RAM construction achieving an amortized overhead of 20X-35X (for an O-RAM roughly 1 terabyte in size), about 63 times faster than the best existing scheme. On the theoretic front, we propose a fundamentally novel technique for constructing Oblivious RAMs: specifically, we partition a bigger O-RAM into smaller O-RAMs, and employ a background eviction technique to obliviously evict blocks from the client-side cache into a randomly assigned server-side partition. This novel technique is the key to achieving the gains in practical performance.}, keywords = {Computer Science - Cryptography and Security}, url = {http://arxiv.org/abs/1106.3652}, author = {Stefanov, Emil and Elaine Shi and Song, Dawn} } @conference {12452, title = {Towards view-invariant expression analysis using analytic shape manifolds}, booktitle = {2011 IEEE International Conference on Automatic Face \& Gesture Recognition and Workshops (FG 2011)}, year = {2011}, month = {2011/03/21/25}, pages = {306 - 313}, publisher = {IEEE}, organization = {IEEE}, abstract = {Facial expression analysis is one of the important components for effective human-computer interaction. However, to develop robust and generalizable models for expression analysis one needs to break the dependence of the models on the choice of the coordinate frame of the camera i.e. expression models should generalize across facial poses. To perform this systematically, one needs to understand the space of observed images subject to projective transformations. However, since the projective shape-space is cumbersome to work with, we address this problem by deriving models for expressions on the affine shape-space as an approximation to the projective shape-space by using a Riemannian interpretation of deformations that facial expressions cause on different parts of the face. We use landmark configurations to represent facial deformations and exploit the fact that the affine shape-space can be studied using the Grassmann manifold. This representation enables us to perform various expression analysis and recognition algorithms without the need for the normalization as a preprocessing step. We extend some of the available approaches for expression analysis to the Grassmann manifold and experimentally show promising results, paving the way for a more general theory of view-invariant expression analysis.}, keywords = {Databases, Deformable models, Face, face recognition, facial expression analysis, Geometry, Gold, Human-computer interaction, Manifolds, projective transformation, Riemannian interpretation, SHAPE, view invariant expression analysis}, isbn = {978-1-4244-9140-7}, doi = {10.1109/FG.2011.5771415}, author = {Taheri, S. and Turaga,P. and Chellapa, Rama} } @inbook {12458, title = {Tracking and Identification via Object Reflectance Using a Hyperspectral Video Camera}, booktitle = {Machine Vision Beyond Visible SpectrumMachine Vision Beyond Visible Spectrum}, series = {Augmented Vision and Reality}, volume = {1}, year = {2011}, month = {2011///}, pages = {201 - 219}, publisher = {Springer Berlin Heidelberg}, organization = {Springer Berlin Heidelberg}, abstract = {Recent advances in electronics and sensor design have enabled the development of a hyperspectral video camera that can capture hyperspectral datacubes at near video rates. The sensor offers the potential for novel and robust methods for surveillance by combining methods from computer vision and hyperspectral image analysis. Here, we focus on the problem of tracking objects through challenging conditions, such as rapid illumination and pose changes, occlusions, and in the presence of confusers. A new framework that incorporates radiative transfer theory to estimate object reflectance and particle filters to simultaneously track and identify an object based on its reflectance spectra is proposed. By exploiting high-resolution spectral features in the visible and near-infrared regimes, the framework is able to track objects that appear featureless to the human eye. For example, we demonstrate that near-IR spectra of human skin can also be used to distinguish different people in a video sequence. These capabilities are illustrated using experiments conducted on real hyperspectral video data.}, isbn = {978-3-642-11568-4}, url = {http://dx.doi.org/10.1007/978-3-642-11568-4_9}, author = {Nguyen,Hien Van and Banerjee,Amit and Burlina,Philippe and Broadwater,Joshua and Chellapa, Rama}, editor = {Hammoud,Riad and Fan,Guoliang and McMillan,Robert W. W. and Ikeuchi,Katsushi and Hammoud,Riad I. and Wolff,Lawrence B.} } @article {17435, title = {Tragic errors: usability and electronic health records}, journal = {Interactions}, volume = {18}, year = {2011}, month = {2011/11//}, pages = {60 - 63}, isbn = {1072-5520}, doi = {10.1145/2029976.2029992}, url = {http://doi.acm.org/10.1145/2029976.2029992}, author = {Shneiderman, Ben} } @conference {14850, title = {Trainable 3D recognition using stereo matching}, booktitle = {Computer Vision Workshops (ICCV Workshops), 2011 IEEE International Conference on}, year = {2011}, month = {2011///}, pages = {625 - 631}, abstract = {Stereo matching has been used for face recognition in the presence of pose variation. In this approach, stereo matching is used to compare two 2-D images based on correspondences that reflect the effects of viewpoint variation and allow for occlusion. We show how to use stereo matching to derive image descriptors that can be used to train a classifier. This improves face recognition performance, producing the best published results on the CMU PIE dataset. We also demonstrate that classification based on stereo matching can be used for general object classification in the presence of pose variation. In preliminary experiments we show promising results on the 3D object class dataset, a standard, challenging 3D classification data set.}, keywords = {2D, 3D, class, classification, classification;image, data, dataset;CMU, dataset;face, descriptor;occlusion;pose, estimation;solid, image, image;3D, matching;pose, matching;trainable, modelling;stereo, object, PIE, processing;, recognition;face, recognition;image, set;3D, variation;stereo}, doi = {10.1109/ICCVW.2011.6130301}, author = {Castillo,C. D and Jacobs, David W.} } @conference {18794, title = {Trajectory planning with look-ahead for Unmanned Sea Surface Vehicles to handle environmental disturbances}, year = {2011}, month = {2011///}, pages = {1154 - 1159}, url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=6048670}, author = {Svec,P. and Schwartz,M. and Thakur,A. and Gupta,S.K.} } @article {14646, title = {Transcriptional Regulation Via TF-Modifying Enzymes: An Integrative Model-Based Analysis}, journal = {Nucleic Acids ResearchNucl. Acids Res.}, volume = {39}, year = {2011}, month = {2011/07/01/}, pages = {e78-e78 - e78-e78}, abstract = {Transcription factor activity is largely regulated through post-translational modification. Here, we report the first integrative model of transcription that includes both interactions between transcription factors and promoters, and between transcription factors and modifying enzymes. Simulations indicate that our method is robust against noise. We validated our tool on a well-studied stress response network in yeast and on a STAT1-mediated regulatory network in human B cells. Our work represents a significant step toward a comprehensive model of gene transcription.}, isbn = {0305-1048, 1362-4962}, doi = {10.1093/nar/gkr172}, url = {http://nar.oxfordjournals.org/content/39/12/e78}, author = {Everett,Logan J and Jensen,Shane T and Hannenhalli, Sridhar} } @article {17439, title = {TreeCovery: Coordinated dual treemap visualization for exploring the Recovery Act}, journal = {Government Information Quarterly}, year = {2011}, month = {2011///}, abstract = {The American Recovery and Reinvestment Act dedicated $787 billion to stimulate the U.S. economy and mandated the release of the data describing the exact distribution of that money. The dataset is a large and complex one; one of its distinguishing features is its bi-hierarchical structure, arising from the distribution of money through agencies to specific projects and the natural aggregation of awards based on location. To offer a comprehensive overview of the data, a visualization must incorporate both these hierarchies. We present TreeCovery, a tool that accomplishes this through the use of two coordinated treemaps. The tool includes a number of innovative features, including coordinated zooming and filtering and a proportional highlighting technique across the two trees. TreeCovery was designed to facilitate data exploration, and initial user studies suggest that it will be helpful in insight generation. RATB (Recovery Accountability and Transparency Board) has tested TreeCovery and is considering including the concept in their visual analytics.}, keywords = {Recovery Act, user interface, Visual analytic}, isbn = {0740-624X}, doi = {10.1016/j.giq.2011.07.004}, url = {http://www.sciencedirect.com/science/article/pii/S0740624X11001055}, author = {Rios-Berrios,Miguel and Sharma,Puneet and Lee,Tak Yeon and Schwartz,Rachel and Shneiderman, Ben} } @conference {16034, title = {TreeVersity: Comparing tree structures by topology and node{\textquoteright}s attributes differences}, booktitle = {Visual Analytics Science and Technology (VAST), 2011 IEEE Conference on}, year = {2011}, month = {2011/10//}, pages = {275 - 276}, abstract = {It is common to classify data in hierarchies, they provide a comprehensible way of understanding big amounts of data. From budgets to organizational charts or even the stock market, trees are everywhere and people find them easy to use. However when analysts need to compare two versions of the same tree structure, or two related taxonomies, the task is not so easy. Much work has been done on this topic, but almost all of it has been restricted to either compare the trees by topology, or by the node attribute values. With this project we are proposing TreeVersity, a framework for comparing tree structures, both by structural changes and by differences in the node attributes. This paper is based on our previous work on comparing traffic agencies using LifeFlow [1, 2] and on a first prototype of TreeVersity.}, keywords = {(mathematics);, agencies;tree, attributes, changes;topology, classification;hierarchy;node, classification;trees, comparison;pattern, differences;structural, differences;traffic, LifeFlow;TreeVersity;data, STRUCTURES}, doi = {10.1109/VAST.2011.6102471}, author = {Gomez,J.A.G. and Buck-Coleman,A. and Plaisant, Catherine and Shneiderman, Ben} } @conference {17442, title = {TreeVersity: Comparing tree structures by topology and node{\textquoteright}s attributes differences}, booktitle = {2011 IEEE Conference on Visual Analytics Science and Technology (VAST)}, year = {2011}, month = {2011/10/23/28}, pages = {275 - 276}, publisher = {IEEE}, organization = {IEEE}, abstract = {It is common to classify data in hierarchies, they provide a comprehensible way of understanding big amounts of data. From budgets to organizational charts or even the stock market, trees are everywhere and people find them easy to use. However when analysts need to compare two versions of the same tree structure, or two related taxonomies, the task is not so easy. Much work has been done on this topic, but almost all of it has been restricted to either compare the trees by topology, or by the node attribute values. With this project we are proposing TreeVersity, a framework for comparing tree structures, both by structural changes and by differences in the node attributes. This paper is based on our previous work on comparing traffic agencies using LifeFlow [1, 2] and on a first prototype of TreeVersity.}, keywords = {Computer science, data classification, Data visualization, Educational institutions, hierarchy, Image color analysis, LifeFlow, node attributes differences, Pattern classification, structural changes, Topology, topology attributes differences, traffic agencies, tree structures comparison, trees (mathematics), TreeVersity, Vegetation, Visualization}, isbn = {978-1-4673-0015-5}, doi = {10.1109/VAST.2011.6102471}, author = {Gomez,J.A.G. and Buck-Coleman,A. and Plaisant, Catherine and Shneiderman, Ben} } @conference {13412, title = {A trust model for supply chain management}, booktitle = {The 10th International Conference on Autonomous Agents and Multiagent Systems-Volume 3}, year = {2011}, month = {2011///}, pages = {1375 - 1376}, author = {Haghpanah,Y. and desJardins, Marie and others} } @article {17445, title = {Tutorial-Graph Analytics {\textemdash} Lessons Learned and Challenges Ahead}, journal = {IEEE Computer Graphics and Applications}, volume = {31}, year = {2011}, month = {2011///}, pages = {18 - 18}, author = {Wong,P.C. and Chen,C. and G{\"o}rg,C. and Shneiderman, Ben and Stasko,J. and Thomas,J.} } @conference {18810, title = {A Two Degree of Freedom Nanopositioner With Electrothermal Actuator for Decoupled Motion}, year = {2011}, month = {2011///}, pages = {447 - 457}, publisher = {ASME}, organization = {ASME}, abstract = {Building a two degree-of-freedom (2 DOF) MEMS nanopositioner with decoupled X-Y motion has been a challenge in nanopositioner design. In this paper a novel design concept on making the decoupled motion of the MEMS nanopositioner is suggested. The suggested nanopositioner has two electrothermal actuators and employs a fully nested motion platform with suspended anchors. The suggested MEMS nanopositioner is capable of delivering displacement from the electrothermal actuator to the motion platform without coupled motion between the two X-Y axes. The design concept, finite element analysis (FEA) results, fabrication procedures and the performance of the 2 DOF nanopositioner is presented. In order to test the nanopositioner moving platform decoupled motion, one actuator moves the platform by 60 {\textmu}m, while the other actuator is kept at the same position. The platform position cross talk error was measured to be less than 1 {\textmu}m standard deviation.}, isbn = {978-0-7918-5484-6}, doi = {10.1115/DETC2011-48619}, url = {http://link.aip.org/link/ASMECP/v2011/i54846/p447/s1\&Agg=doi}, author = {Kim,Yong-Sik and Dagalakis,Nicholas G. and Gupta, Satyandra K.} } @conference {17987, title = {Is teaching parallel algorithmic thinking to high school students possible?: one teacher{\textquoteright}s experience}, booktitle = {Proceedings of the 41st ACM technical symposium on Computer science education}, series = {SIGCSE {\textquoteright}10}, year = {2010}, month = {2010///}, pages = {290 - 294}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {All students at our high school are required to take at least one course in Computer Science prior to their junior year. They are also required to complete a year-long senior project associated with a specific in-house laboratory, one of which is the Computer Systems Lab. To prepare students for this experience the lab offers elective courses at the post-AP Computer Science level. Since the early 1990s one of these electives has focused on parallel computing. The course enrolls approximately 40 students each year for two semesters of instruction. The lead programming language is C and topics include a wide array of industry-standard and experimental tools. Since the 2007-2008 school year we have included a unit on parallel algorithmic thinking (PAT) using the Explicit Multi-Threading (XMT) system. We describe our experiences using this system after self-studying the approach from a publicly available tutorial. Overall, this article provides significant evidence regarding the unique teachability of the XMT PAT approach, and advocates using it broadly in Computer Science education.}, keywords = {high school, parallel algorithmic thinking, pram algorithms, XMT}, isbn = {978-1-4503-0006-3}, doi = {10.1145/1734263.1734363}, url = {http://doi.acm.org/10.1145/1734263.1734363}, author = {Torbert,Shane and Vishkin, Uzi and Tzur,Ron and Ellison,David J.} } @article {16816, title = {Techniques for similarity searching in multimedia databases}, journal = {Proc. VLDB Endow.}, volume = {3}, year = {2010}, month = {2010/09//}, pages = {1649 - 1650}, abstract = {Techniques for similarity searching in multimedia databases are reviewed. This includes a discussion of the curse of dimensionality, as well as multidimensional indexing, distance-based indexing, and the actual search process which is realized by nearest neighbor finding.}, isbn = {2150-8097}, url = {http://dl.acm.org/citation.cfm?id=1920841.1921064}, author = {Samet, Hanan} } @inbook {17395, title = {Technology-Mediated Social Participation: Deep Science and Extreme Technology}, booktitle = {Active Media TechnologyActive Media Technology}, series = {Lecture Notes in Computer Science}, volume = {6335}, year = {2010}, month = {2010///}, pages = {1 - 4}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {The dramatic success of social media such as Facebook, Twitter, YouTube, Flickr, blogs, and traditional discussion groups empowers individuals to become active in local and global communities. With modest redesign, these technologies can be harnessed to support national priorities such as healthcare/wellness, disaster response, community safety, energy sustainability, etc. This talk describes a research agenda for these topics that develops deep science questions and extreme technology challenges.}, isbn = {978-3-642-15469-0}, url = {http://dx.doi.org/10.1007/978-3-642-15470-6_1}, author = {Shneiderman, Ben}, editor = {An,Aijun and Lingras,Pawan and Petty,Sheila and Huang,Runhe} } @conference {15620, title = {Tight lower bounds for halfspace range searching}, booktitle = {Proceedings of the 2010 annual symposium on Computational geometry}, series = {SoCG {\textquoteright}10}, year = {2010}, month = {2010///}, pages = {29 - 37}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {We establish two new lower bounds for the halfspace range searching problem: Given a set of n points in ℜd, where each point is associated with a weight from a commutative semigroup, compute the semigroup sum of the weights of the points lying within any query halfspace. Letting $m$ denote the space requirements, we prove a lower bound for general semigroups of Ω(n1-1/(d+1)/m1/(d+1)) and for integral semigroups of Ω(n/m1/d). Our lower bounds are proved in the semigroup arithmetic model. Neglecting logarithmic factors, our result for integral semigroups matches the best known upper bound due to Matou{\v s}ek. Our result for general semigroups improves upon the best known lower bound due to Br{\"o}nnimann, Chazelle, and Pach. Moreover, Fonseca and Mount have recently shown that, given uniformly distributed points, halfspace range queries over idempotent semigroups can be answered in O(n1-1/(d+1)/m1/(d+1)) time in the semigroup arithmetic model. As our lower bounds are established for uniformly distributed point sets, it follows that they also resolve the computational complexity of halfspace range searching over idempotent semigroups in this important special case.}, keywords = {Idempotence, lower bounds, Range searching}, isbn = {978-1-4503-0016-2}, doi = {10.1145/1810959.1810964}, url = {http://doi.acm.org/10.1145/1810959.1810964}, author = {Arya,Sunil and Mount, Dave and Xia,Jian} } @conference {19506, title = {To Upgrade or Not to Upgrade: Impact of Online Upgrades Across Multiple Administrative Domains}, booktitle = {OOPSLA{\textquoteright}10 Proceedings of the ACM International Conference on Object Oriented Programming Systems Languages and Applications}, series = {OOPSLA {\textquoteright}10}, year = {2010}, month = {2010///}, pages = {865 - 876}, publisher = {ACM}, organization = {ACM}, abstract = {Online software upgrades are often plagued by runtime behaviors that are poorly understood and difficult to ascertain. For example, the interactions among multiple versions of the software expose the system to race conditions that can introduce latent errors or data corruption. Moreover, industry trends suggest that online upgrades are currently needed in large-scale enterprise systems, which often span multiple administrative domains (e.g., Web 2.0 applications that rely on AJAX client-side code or systems that lease cloud-computing resources). In such systems, the enterprise does not control all the tiers of the system and cannot coordinate the upgrade process, making existing techniques inadequate to prevent mixed-version races. In this paper, we present an analytical framework for impact assessment, which allows system administrators to directly compare the risk of following an online-upgrade plan with the risk of delaying or canceling the upgrade. We also describe an executable model that implements our formal impact assessment and enables a systematic approach for deciding whether an online upgrade is appropriate. Our model provides a method of last resort for avoiding undesirable program behaviors, in situations where mixed-version races cannot be avoided through other technical means.}, keywords = {mixed-version race, multiple administrative domains, online upgrade, risk assessment}, isbn = {978-1-4503-0203-6}, url = {http://doi.acm.org/10.1145/1869459.1869530}, author = {Tudor Dumitras and Narasimhan, Priya and Tilevich, Eli} } @conference {13925, title = {Toque: designing a cooking-based programming language for and with children}, booktitle = {Proceedings of the 28th international conference on Human factors in computing systems}, year = {2010}, month = {2010///}, pages = {2417 - 2426}, author = {Tarkan,S. and Sazawal,V. and Druin, Allison and Golub,E. and Bonsignore,E. M and Walsh,G. and Atrash,Z.} } @conference {12480, title = {Tracking via object reflectance using a hyperspectral video camera}, booktitle = {2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)}, year = {2010}, month = {2010/06/13/18}, pages = {44 - 51}, publisher = {IEEE}, organization = {IEEE}, abstract = {Recent advances in electronics and sensor design have enabled the development of a hyperspectral video camera that can capture hyperspectral datacubes at near video rates. The sensor offers the potential for novel and robust methods for surveillance by combining methods from computer vision and hyperspectral image analysis. Here, we focus on the problem of tracking objects through challenging conditions, such as rapid illumination and pose changes, occlusions, and in the presence of confusers. A new framework that incorporates radiative transfer theory to estimate object reflectance and the mean shift algorithm to simultaneously track the object based on its reflectance spectra is proposed. The combination of spectral detection and motion prediction enables the tracker to be robust against abrupt motions, and facilitate fast convergence of the mean shift tracker. In addition, the system achieves good computational efficiency by using random projection to reduce spectral dimension. The tracker has been evaluated on real hyperspectral video data.}, keywords = {Computer vision, electronic design, hyperspectral datacubes, hyperspectral image analysis, Hyperspectral imaging, Hyperspectral sensors, hyperspectral video camera, Image motion analysis, Image sensors, lighting, Motion estimation, motion prediction, Object detection, object reflectance tracking, random projection, Reflectivity, robust methods, Robustness, sensor design, spectral detection, Surveillance, tracking, Video surveillance}, isbn = {978-1-4244-7029-7}, doi = {10.1109/CVPRW.2010.5543780}, author = {Nguyen,Hien Van and Banerjee, A. and Chellapa, Rama} } @conference {16504, title = {On trade-offs in event delivery systems}, booktitle = {Proceedings of the Fourth ACM International Conference on Distributed Event-Based Systems}, year = {2010}, month = {2010///}, pages = {116 - 127}, author = {Roitman,H. and Gal,A. and Raschid, Louiqa} } @article {18607, title = {Transit portal: BGP connectivity as a service}, journal = {ACM SIGCOMM Computer Communication Review}, volume = {40}, year = {2010}, month = {2010/08//}, pages = {463 - 464}, keywords = {bgp-mux, transit portal}, isbn = {0146-4833}, doi = {10.1145/1851275.1851265}, url = {http://doi.acm.org/10.1145/1851275.1851265}, author = {Valancius,Vytautas and Kim,Hyojoon and Feamster, Nick} } @article {15054, title = {A tree-based approach to integrated action localization, recognition and segmentation}, journal = {ECCV Workshops}, year = {2010}, month = {2010///}, abstract = {A tree-based approach to integrated action segmentation,localization and recognition is proposed. An action is represented as a sequence of joint hog-flow descriptors extracted independently from each frame. During training, a set of action prototypes is first learned based on a k-means clustering, and then a binary tree model is constructed from the set of action prototypes based on hierarchical k-means cluster- ing. Each tree node is characterized by a shape-motion descriptor and a rejection threshold, and an action segmentation mask is defined for leaf nodes (corresponding to a prototype). During testing, an action is local- ized by mapping each test frame to a nearest neighbor prototype using a fast matching method to search the learned tree, followed by global fil- tering refinement. An action is recognized by maximizing the sum of the joint probabilities of the action category and action prototype over test frames. Our approach does not explicitly rely on human tracking and background subtraction, and enables action localization and recognition in realistic and challenging conditions (such as crowded backgrounds). Experimental results show that our approach can achieve recognition rates of 100\% on the CMU action dataset and 100\% on the Weizmann dataset. }, author = {Zhuolin Jiang and Lin,Z. and Davis, Larry S.} } @conference {19045, title = {TACKing Together Efficient Authentication, Revocation, and Privacy in VANETs}, year = {2009}, month = {2009}, pages = {1 - 9}, abstract = {Vehicular ad hoc networks (VANETs) require a mechanism to help authenticate messages, identify valid vehicles, and remove malevolent vehicles. A public key infrastructure (PKI) can provide this functionality using certificates and fixed public keys. However, fixed keys allow an eavesdropper to associate a key with a vehicle and a location, violating drivers{\textquoteright} privacy. In this work we propose a VANET key management scheme based on temporary anonymous certified keys (TACKs). Our scheme efficiently prevents eavesdroppers from linking a vehicle{\textquoteright}s different keys and provides timely revocation of misbehaving participants while maintaining the same or less overhead for vehicle-to-vehicle communication as the current IEEE 1609.2 standard for VANET security.}, keywords = {ad hoc networks, data privacy, eavesdropper, IEEE 1609.2 standard, Message authentication, mobile radio, public key cryptography, public key infrastructure, remove malevolent vehicle, telecommunication security, temporary anonymous certified key, valid vehicle identification, VANET key management, VANET security, vehicle-to-vehicle communication, Vehicles, vehicular ad hoc network}, author = {Studer, A. and Elaine Shi and Bai, Fan and Perrig, A.} } @conference {18285, title = {Tampering identification using Empirical Frequency Response}, booktitle = {Acoustics, Speech and Signal Processing, 2009. ICASSP 2009. IEEE International Conference on}, year = {2009}, month = {2009/04//}, pages = {1517 - 1520}, abstract = {With the widespread popularity of digital images and the presence of easy-to-use image editing software, content integrity can no longer be taken for granted, and there is a strong need for techniques that not only detect the presence of tampering but also identify its type. This paper focusses on tampering-type identification and introduces a new approach based on the empirical frequency response (EFR) to address this problem. We show that several types of tampering operations, both linear shift invariant (LSI) and non-LSI, can be characterized consistently and distinctly by their EFRs. We then extend the approach to estimate the EFR for scenarios where only the final image is available. Theoretical reasoning supported by experimental results verify the effectiveness of this method for identifying the type of a tampering operation.}, keywords = {aproach;JPEG, coding;multimedia, compression;frequency, compression;LSI, computing;security, data;, editing, EFR, forensics;tampering-type, Frequency, identification;data, image, invariant;multimedia, of, response;image, response;linear, shift, software;empirical, system;digital}, doi = {10.1109/ICASSP.2009.4959884}, author = {Chuang,Wei-Hong and Swaminathan,A. and M. Wu} } @article {15058, title = {Target Tracking Based on Nonparametric Clustering and Multi-Scale Images}, journal = {JSCUT (Natural Science Edition)}, volume = {37}, year = {2009}, month = {2009///}, pages = {34 - 41}, abstract = {In order to track a target in space and scale in a complex background,a target tracking algorithm based on the nonparametric clustering and multi-scale images is presented.In this algorithm,first,a modified nonparame-tric color-clustering method is employed to adaptively partition the color space of a tracked object,and the Gaussian function is used to model the spatial information of each bin of the color histogram.Next,the Bhattacharyya coefficient is adopted to derive a function describing the similarity between the target model and the target candidate.Then,a coarse-to-fine approach of multi-scale images is employed to implement the spatial location of the tracked object.Finally,the derived automatic bandwidth selection method of kernel function is applied to obtain the scale of the tracked object.Experimental results show that the proposed algorithm outperforms the classical mean shift tracker.}, author = {Shao-fa,J.Z.L. and Hong-li,J.X.Z.} } @article {18921, title = {Task decomposition on abstract states, for planning under nondeterminism}, journal = {Artificial Intelligence}, volume = {173}, year = {2009}, month = {2009/04//}, pages = {669 - 695}, abstract = {Although several approaches have been developed for planning in nondeterministic domains, solving large planning problems is still quite difficult. In this work, we present a new planning algorithm, called Yoyo, for solving planning problems in fully observable nondeterministic domains. Yoyo combines an HTN-based mechanism for constraining its search and a Binary Decision Diagram (BDD) representation for reasoning about sets of states and state transitions.We provide correctness theorems for Yoyo, and an experimental comparison of it with MBP and ND-SHOP2, the two previously-best algorithms for planning in nondeterministic domains. In our experiments, Yoyo could easily deal with problem sizes that neither MBP nor ND-SHOP2 could scale up to, and could solve problems about 100 to 1000 times faster than MBP and ND-SHOP2. }, keywords = {Binary decision diagrams, Hierarchical task-network (HTN) planning, Planning in nondeterministic domains}, isbn = {0004-3702}, doi = {10.1016/j.artint.2008.11.012}, url = {http://www.sciencedirect.com/science/article/pii/S0004370208001987}, author = {Kuter,Ugur and Nau, Dana S. and Pistore,Marco and Traverso,Paolo} } @article {15035, title = {Techniques to audit and certify the long-term integrity of digital archives}, journal = {International Journal on Digital Libraries}, volume = {10}, year = {2009}, month = {2009///}, pages = {123 - 131}, abstract = {A fundamental requirement for a digital archive is to set up mechanisms that will ensure the authenticity of its holdings in the long term. In this article, we develop a new methodology to address the long-term integrity of digital archives using rigorous cryptographic techniques. Our approach involves the generation of a small-size integrity token for each object, some cryptographic summary information, and a framework that enables cost-effective regular and periodic auditing of the archive{\textquoteright}s holdings depending on the policy set by the archive. Our scheme is very general, architecture and platform independent, and can detect with high probability any alteration to an object, including malicious alterations introduced by the archive or by an external intruder. The scheme can be shown to be mathematically correct as long as a small amount of cryptographic information, in the order of 100 KB/year, can be kept intact. Using this approach, a prototype system called ACE (Auditing Control Environment) has been built and tested in an operational large scale archiving environment.}, keywords = {Computer science}, isbn = {1432-5012}, doi = {10.1007/s00799-009-0056-2}, url = {http://www.springerlink.com/content/y52815g805h96334/abstract/}, author = {Song,Sangchul and JaJa, Joseph F.} } @article {17397, title = {Temporal Summaries: Supporting Temporal Categorical Searching, Aggregation and Comparison}, journal = {IEEE Transactions on Visualization and Computer Graphics}, volume = {15}, year = {2009}, month = {2009/12//Nov}, pages = {1049 - 1056}, abstract = {When analyzing thousands of event histories, analysts often want to see the events as an aggregate to detect insights and generate new hypotheses about the data. An analysis tool must emphasize both the prevalence and the temporal ordering of these events. Additionally, the analysis tool must also support flexible comparisons to allow analysts to gather visual evidence. In a previous work, we introduced align, rank, and filter (ARF) to accentuate temporal ordering. In this paper, we present temporal summaries, an interactive visualization technique that highlights the prevalence of event occurrences. Temporal summaries dynamically aggregate events in multiple granularities (year, month, week, day, hour, etc.) for the purpose of spotting trends over time and comparing several groups of records. They provide affordances for analysts to perform temporal range filters. We demonstrate the applicability of this approach in two extensive case studies with analysts who applied temporal summaries to search, filter, and look for patterns in electronic health records and academic records.}, keywords = {Aggregates, Collaborative work, Computational Biology, Computer Graphics, Data analysis, data visualisation, Data visualization, Databases, Factual, Displays, Event detection, Filters, Heparin, History, Human computer interaction, Human-computer interaction, HUMANS, Information Visualization, Interaction design, interactive visualization technique, Medical Records Systems, Computerized, Pattern Recognition, Automated, Performance analysis, Springs, temporal categorical data visualization, temporal categorical searching, temporal ordering, temporal summaries, Thrombocytopenia, Time factors}, isbn = {1077-2626}, doi = {10.1109/TVCG.2009.187}, author = {Wang,T. D and Plaisant, Catherine and Shneiderman, Ben and Spring, Neil and Roseman,D. and Marchand,G. and Mukherjee,V. and Smith,M.} } @article {16056, title = {Temporal Summaries: Supporting Temporal Categorical Searching, Aggregation and Comparison}, journal = {Visualization and Computer Graphics, IEEE Transactions on}, volume = {15}, year = {2009}, month = {2009/12//nov}, pages = {1049 - 1056}, abstract = {When analyzing thousands of event histories, analysts often want to see the events as an aggregate to detect insights and generate new hypotheses about the data. An analysis tool must emphasize both the prevalence and the temporal ordering of these events. Additionally, the analysis tool must also support flexible comparisons to allow analysts to gather visual evidence. In a previous work, we introduced align, rank, and filter (ARF) to accentuate temporal ordering. In this paper, we present temporal summaries, an interactive visualization technique that highlights the prevalence of event occurrences. Temporal summaries dynamically aggregate events in multiple granularities (year, month, week, day, hour, etc.) for the purpose of spotting trends over time and comparing several groups of records. They provide affordances for analysts to perform temporal range filters. We demonstrate the applicability of this approach in two extensive case studies with analysts who applied temporal summaries to search, filter, and look for patterns in electronic health records and academic records.}, keywords = {Automated;Thrombocytopenia;Time Factors;, Computerized;Pattern Recognition, Factual;Heparin;Humans;Medical Records Systems, interactive visualization technique;temporal categorical searching;temporal ordering;temporal summaries;data visualisation;human computer interaction;Computational Biology;Computer Graphics;Databases}, isbn = {1077-2626}, doi = {10.1109/TVCG.2009.187}, author = {Wang,T. D and Plaisant, Catherine and Shneiderman, Ben and Spring, Neil and Roseman,D. and Marchand,G. and Mukherjee,V. and Smith,M.} } @article {13872, title = {TER-Plus: paraphrase, semantic, and alignment enhancements to Translation Edit Rate}, journal = {Machine Translation}, volume = {23}, year = {2009}, month = {2009///}, pages = {117 - 127}, abstract = {This paper describes a new evaluation metric, TER-Plus (TERp) for automatic evaluation of machine translation (MT). TERp is an extension of Translation Edit Rate (TER). It builds on the success of TER as an evaluation metric and alignment tool and addresses several of its weaknesses through the use of paraphrases, stemming, synonyms, as well as edit costs that can be automatically optimized to correlate better with various types of human judgments. We present a correlation study comparing TERp to BLEU, METEOR and TER, and illustrate that TERp can better evaluate translation adequacy.}, isbn = {0922-6567}, url = {http://dx.doi.org/10.1007/s10590-009-9062-9}, author = {Snover,Matthew and Madnani,Nitin and Dorr, Bonnie J and Schwartz,Richard} } @article {14657, title = {A Testing Based Empirical Study of Dynamic Software Update Safety Restrictions}, journal = {Technical Reports of the Computer Science Department}, year = {2009}, month = {2009/10/16/}, abstract = {Recent years have seen significant advances in dynamic softwareupdating (DSU) systems, which allow programs to be patched on the fly. Most DSU systems employ automatic safety checks to avoid applying a patch if doing so may lead to incorrect behavior. This paper presents what we believe is the first comprehensive empirical evaluation of the two most significant DSU safety checks: activeness safety (AS), which disallows patches that modify functions on the stack, and con-freeness safety (CFS), which allows modifications to active functions, but only when doing so will be type safe. To measure the checks{\textquoteright} effectiveness, we tested them against three years of updates to Open-SSH and vsftpd. We performed this testing using a novel DSU testing methodology that systematically applies updates throughout the execution of a test suite. After testing updates to both applications in this way, we tracked how often the safety checks allow updates and which updates result in test failures. We found that updating without safety checks produced many failures, and that both AS and CFS dramatically reduced, but did not fully eliminate, these failures. CFS yielded more failures than AS, but AS was more restrictive than CFS, disallowing far more successful updates. Our results suggest that neither AS nor CFS is likely suitable for general-purpose DSU on its own. Indeed, we found that selecting update points manually could avoid all failures while still permitting sufficient updates. Our results present a challenge and important insights for future work: to discover safe and sufficient update points fully automatically. }, url = {http://drum.lib.umd.edu/handle/1903/9802}, author = {Hayden,Christopher M and Hardisty,Eric A. and Hicks, Michael W. and Foster, Jeffrey S.} } @inbook {15465, title = {TESTING EVENT-DRIVEN SOFTWARE{\textendash}THE NEXT QA CHALLENGE?}, booktitle = {Software Engineering and DevelopmentSoftware Engineering and Development}, year = {2009}, month = {2009///}, pages = {187 - 187}, publisher = {Nova Science Publishers, Inc.}, organization = {Nova Science Publishers, Inc.}, abstract = {A particular class of software that is fast becoming ubiquitous is event-driven software(EDS). All EDS share a common event-driven model{\textendash}they take sequences of events (eg, messages, mouse-clicks) as input, change their state, and (sometimes) output an event sequence. Examples include web applications, graphical user interfaces (GUIs), network protocols, device drivers, and embedded software. Quality assurance tasks such as testing have become important for EDS since they are being used in critical applications. Numerous researchers have shown that existing testing techniques do not apply directly to EDS because of the new challenges that EDS offer. This column lists some of these challenges and emphasizes on the need to develop new techniques (or enhance existing ones) to test EDS. }, isbn = {978-1-60692-146-3}, author = {Memon, Atif M.} } @article {15433, title = {Testing graphical user interfaces}, journal = {Encyclopedia of Information Science and Technology}, year = {2009}, month = {2009///}, author = {Strecker,J. and Memon, Atif M.} } @conference {14740, title = {Tests to the left of me, types to the right: how not to get stuck in the middle of a ruby execution}, booktitle = {Proceedings for the 1st workshop on Script to Program Evolution}, series = {STOP {\textquoteright}09}, year = {2009}, month = {2009///}, pages = {14 - 16}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Ruby is a popular dynamic scripting language that permits terse, expressive code, but provides no static checks to detect errors before running the program. To address this, we have developed Diamond-back Ruby (DRuby), a tool that blends the benefits of static and dynamic typing. This paper briefly describes the main features of DRuby, which we will present in a tool demonstration. The presentation will concentrate on the development of a small, statically typed Ruby program, illustrating how DRuby might be used in practice. The audience will learn about some of the practical design decisions that went into DRuby, and how to use it to develop a type-safe Ruby program.}, isbn = {978-1-60558-543-7}, doi = {10.1145/1570506.1570508}, url = {http://doi.acm.org/10.1145/1570506.1570508}, author = {Furr,Michael and An,Jong-hoon (David) and Foster, Jeffrey S. and Hicks, Michael W.} } @conference {14658, title = {A theory of typed coercions and its applications}, booktitle = {Proceedings of the 14th ACM SIGPLAN international conference on Functional programming}, series = {ICFP {\textquoteright}09}, year = {2009}, month = {2009///}, pages = {329 - 340}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {A number of important program rewriting scenarios can be recast as type-directed coercion insertion. These range from more theoretical applications such as coercive subtyping and supporting overloading in type theories, to more practical applications such as integrating static and dynamically typed code using gradual typing, and inlining code to enforce security policies such as access control and provenance tracking. In this paper we give a general theory of type-directed coercion insertion. We specifically explore the inherent tradeoff between expressiveness and ambiguity--the more powerful the strategy for generating coercions, the greater the possibility of several, semantically distinct rewritings for a given program. We consider increasingly powerful coercion generation strategies, work out example applications supported by the increased power (including those mentioned above), and identify the inherent ambiguity problems of each setting, along with various techniques to tame the ambiguities.}, keywords = {coercion insertion, gradual typing, nonambiguity, provenance, type-directed translation}, isbn = {978-1-60558-332-7}, doi = {10.1145/1596550.1596598}, url = {http://doi.acm.org/10.1145/1596550.1596598}, author = {Swamy,Nikhil and Hicks, Michael W. and Bierman,Gavin M.} } @article {19726, title = {Three genomes from the phylum Acidobacteria provide insight into the lifestyles of these microorganisms in soils.}, journal = {Appl Environ Microbiol}, volume = {75}, year = {2009}, month = {2009 Apr}, pages = {2046-56}, abstract = {

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

}, keywords = {Anti-Bacterial Agents, bacteria, Biological Transport, Carbohydrate Metabolism, Cyanobacteria, DNA, Bacterial, Fungi, Genome, Bacterial, Macrolides, Molecular Sequence Data, Nitrogen, Phylogeny, Proteobacteria, Sequence Analysis, DNA, sequence homology, Soil Microbiology}, issn = {1098-5336}, doi = {10.1128/AEM.02294-08}, author = {Ward, Naomi L and Challacombe, Jean F and Janssen, Peter H and Henrissat, Bernard and Coutinho, Pedro M and Wu, Martin and Xie, Gary and Haft, Daniel H and Sait, Michelle and Badger, Jonathan and Barabote, Ravi D and Bradley, Brent and Brettin, Thomas S and Brinkac, Lauren M and Bruce, David and Creasy, Todd and Daugherty, Sean C and Davidsen, Tanja M and DeBoy, Robert T and Detter, J Chris and Dodson, Robert J and Durkin, A Scott and Ganapathy, Anuradha and Gwinn-Giglio, Michelle and Han, Cliff S and Khouri, Hoda and Kiss, Hajnalka and Kothari, Sagar P and Madupu, Ramana and Nelson, Karen E and Nelson, William C and Paulsen, Ian and Penn, Kevin and Ren, Qinghu and Rosovitz, M J and Jeremy D Selengut and Shrivastava, Susmita and Sullivan, Steven A and Tapia, Roxanne and Thompson, L Sue and Watkins, Kisha L and Yang, Qi and Yu, Chunhui and Zafar, Nikhat and Zhou, Liwei and Kuske, Cheryl R} } @conference {14448, title = {To join or not to join: the illusion of privacy in social networks with mixed public and private user profiles}, booktitle = {Proceedings of the 18th international conference on World wide web}, series = {WWW {\textquoteright}09}, year = {2009}, month = {2009///}, pages = {531 - 540}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {In order to address privacy concerns, many social media websites allow users to hide their personal profiles from the public. In this work, we show how an adversary can exploit an online social network with a mixture of public and private user profiles to predict the private attributes of users. We map this problem to a relational classification problem and we propose practical models that use friendship and group membership information (which is often not hidden) to infer sensitive attributes. The key novel idea is that in addition to friendship links, groups can be carriers of significant information. We show that on several well-known social media sites, we can easily and accurately recover the information of private-profile users. To the best of our knowledge, this is the first work that uses link-based and group-based classification to study privacy implications in social networks with mixed public and private user profiles.}, keywords = {attribute inference, groups, privacy, social networks}, isbn = {978-1-60558-487-4}, doi = {10.1145/1526709.1526781}, url = {http://doi.acm.org/10.1145/1526709.1526781}, author = {Zheleva,Elena and Getoor, Lise} } @article {18724, title = {Together, Rpn10 and Dsk2 Can Serve as a Polyubiquitin Chain-Length Sensor}, journal = {Molecular Cell}, volume = {36}, year = {2009}, month = {2009/12/24/}, pages = {1018 - 1033}, abstract = {SummaryAs a signal for substrate targeting, polyubiquitin meets various layers of receptors upstream to the 26S proteasome. We obtained structural information on two receptors, Rpn10 and Dsk2, alone and in complex with (poly)ubiquitin or with each other. A~hierarchy of affinities emerges with Dsk2 binding monoubiquitin tighter than Rpn10 does, whereas Rpn10 prefers the ubiquitin-like domain of Dsk2 to monoubiquitin, with increasing affinities for longer polyubiquitin chains. We demonstrated the formation of ternary complexes of both receptors simultaneously with (poly)ubiquitin and found that, depending on the ubiquitin chain length, the orientation of the resulting complex is entirely different, providing for alternate signals. Dynamic rearrangement provides a chain-length sensor, possibly explaining how accessibility of Dsk2 to the proteasome is limited unless it carries a properly tagged cargo. We propose a mechanism for a malleable ubiquitin signal that depends both on chain length and combination of receptors to produce tetraubiquitin as an efficient signal threshold. }, keywords = {Proteins, signaling}, isbn = {1097-2765}, doi = {10.1016/j.molcel.2009.11.012}, url = {http://www.sciencedirect.com/science/article/pii/S1097276509008260}, author = {Zhang,Daoning and Chen,Tony and Ziv,Inbal and Rosenzweig,Rina and Matiuhin,Yulia and Bronner,Vered and Glickman,Michael H. and Fushman, David} } @conference {12163, title = {Tool supported detection and judgment of nonconformance in process execution}, booktitle = {Empirical Software Engineering and Measurement, 2009. ESEM 2009. 3rd International Symposium on}, year = {2009}, month = {2009/10//}, pages = {312 - 323}, abstract = {In the past decades the software engineering community has proposed a large collection of software development life cycles, models, and processes. The goal of a major set of these processes is to assure that the product is finished within time and budget, and that a predefined set of functional and nonfunctional requirements (e.g. quality goals) are satisfied at delivery time. Based upon the assumption that there is a real relationship between the process applied and the characteristics of the product developed from that process, we developed a tool supported approach that uses process nonconformance detection to identify potential risks in achieving the required process characteristics. In this paper we present the approach and a feasibility study that demonstrates its use on a large-scale software development project in the aerospace domain. We demonstrate that our approach, in addition to meeting the criteria above, can be applied to a real system of reasonable size; can represent a useful and adequate set of rules of relevance in such an environment; and can detect relevant examples of process nonconformance that provide useful insight to the project manager.}, keywords = {aerospace, community;tool, cycle;software, detection;software, development, domain;large-scale, engineering, execution;process, life, management;software, nonconformance, project;nonfunctional, requirement;process, software, supported, tools;}, doi = {10.1109/ESEM.2009.5315983}, author = {Zazworka, N. and Basili, Victor R. and Shull, F.} } @conference {15041, title = {Tools and Services for Long-Term Preservation of Digital Archives}, booktitle = {Indo-US Workshop on International Trends in Digital Preservation}, year = {2009}, month = {2009///}, abstract = {We have been working on a technology model to support thepreservation and reliable access of long term digital archives. The model is built around a layered object architecture involving modular, extensible components that can gracefully adapt to the evolving technology, standards, and protocols. This has led to the development of methodologies, tools and services to handle a number of core requirements of long term digital archives. Specifically, we have built flexible tools for implementing general ingestion workflows, active monitoring and auditing of the archive{\textquoteright}s collections to ensure their long-term availability and integrity, storage organization and indexing to optimize access. These tools are platform and architecture independent, and have been tested using a wide variety of collections on heterogeneous computing platforms. In this paper, we will primarily focus on describing the underpinnings of our software called ACE (Auditing Control Environment), and report on its performance on a large scale distributed environment called Chronopolis. Built on top of rigorous cryptographic techniques, ACE provides a policy- driven, scalable environment to monitor and audit the archive{\textquoteright}s contents in a cost effective way. In addition, we will briefly introduce some our recent efforts to deal with storage organization and access of web archives. Long term preservation is a process that must begin before an object is ingested into the archive and must remain active throughout the lifetime of the archive. The ACE tool provides a very flexible environment to actively monitor and audit the contents of a digital archive throughout its lifetime, so as to ensure the availability and integrity of the archive{\textquoteright}s holdings with extremely high probability. ACE is based on rigorous cryptographic techniques, and enables periodic auditing of the archive{\textquoteright}s holdings at the granularity and frequency set by the manager of the archive. The scheme is cost effective and very general, does not depend on the archive{\textquoteright}s architecture, and can detect any alterations, including alterations made by a malicious user. ACE can gracefully adapt to format migrations and changes to the archive{\textquoteright}s policies. }, author = {JaJa, Joseph F. and Smorul,M. and Song,S.} } @conference {16677, title = {Topological ordering of function words in hierarchical phrase-based translation}, booktitle = {Proceedings of the Joint Conference of the 47th Annual Meeting of the ACL and the 4th International Joint Conference on Natural Language Processing of the AFNLP: Volume 1-Volume 1}, year = {2009}, month = {2009///}, pages = {324 - 332}, author = {Setiawan,H. and Kan,M.Y. and Li,H. and Resnik, Philip} } @article {13026, title = {Toward reconstructing the evolution of advanced moths and butterflies (Lepidoptera: Ditrysia): an initial molecular study}, journal = {BMC Evol Biol}, volume = {9}, year = {2009}, month = {2009///}, pages = {280 - 280}, abstract = {BACKGROUND: In the mega-diverse insect order Lepidoptera (butterflies and moths; 165,000 described species), deeper relationships are little understood within the clade Ditrysia, to which 98\% of the species belong. To begin addressing this problem, we tested the ability of five protein-coding nuclear genes (6.7 kb total), and character subsets therein, to resolve relationships among 123 species representing 27 (of 33) superfamilies and 55 (of 100) families of Ditrysia under maximum likelihood analysis. RESULTS: Our trees show broad concordance with previous morphological hypotheses of ditrysian phylogeny, although most relationships among superfamilies are weakly supported. There are also notable surprises, such as a consistently closer relationship of Pyraloidea than of butterflies to most Macrolepidoptera. Monophyly is significantly rejected by one or more character sets for the putative clades Macrolepidoptera as currently defined (P < 0.05) and Macrolepidoptera excluding Noctuoidea and Bombycoidea sensu lato (P < or = 0.005), and nearly so for the superfamily Drepanoidea as currently defined (P < 0.08). Superfamilies are typically recovered or nearly so, but usually without strong support. Relationships within superfamilies and families, however, are often robustly resolved. We provide some of the first strong molecular evidence on deeper splits within Pyraloidea, Tortricoidea, Geometroidea, Noctuoidea and others.Separate analyses of mostly synonymous versus non-synonymous character sets revealed notable differences (though not strong conflict), including a marked influence of compositional heterogeneity on apparent signal in the third codon position (nt3). As available model partitioning methods cannot correct for this variation, we assessed overall phylogeny resolution through separate examination of trees from each character set. Exploration of "tree space" with GARLI, using grid computing, showed that hundreds of searches are typically needed to find the best-feasible phylogeny estimate for these data. CONCLUSION: Our results (a) corroborate the broad outlines of the current working phylogenetic hypothesis for Ditrysia, (b) demonstrate that some prominent features of that hypothesis, including the position of the butterflies, need revision, and (c) resolve the majority of family and subfamily relationships within superfamilies as thus far sampled. Much further gene and taxon sampling will be needed, however, to strongly resolve individual deeper nodes.}, doi = {10.1186/1471-2148-9-280}, author = {Regier,J. C and Zwick,A. and Cummings, Michael P. and Kawahara,A. Y and Cho,S. and Weller,S. and Roe,A. and Baixeras,J. and Brown,J. W and Parr,C. and Davis,DR and Epstein,M and Hallwachs,W and Hausmann,A and Janzen,DH and Kitching,IJ and Solis,MA and Yen,S-H and Bazinet,A. L and Mitter,C} } @conference {19508, title = {Toward Upgrades-as-a-service in Distributed Systems}, booktitle = {Middleware{\textquoteright}09 Proceedings of the 10th ACM/IFIP/USENIX International Conference on Middleware}, series = {Middleware {\textquoteright}09}, year = {2009}, month = {2009///}, pages = {29:1 - 29:2}, publisher = {Springer-Verlag New York, Inc.}, organization = {Springer-Verlag New York, Inc.}, abstract = {Unavailability in distributed enterprise systems is usually the result of planned events, such as upgrades, rather than failures. Major system upgrades entail complex data conversions that are difficult to perform on the fly, in the face of live workloads. Minimizing the downtime imposed by such conversions is a time-intensive and error-prone manual process. We propose upgrades-as-a-service, a novel approach that can eliminate all the causes of planned downtime recorded during the upgrade history of one of the ten most popular websites. Building on the lessons learned from past research on live upgrades in middleware systems, upgrades-as-a-service trade off a need for additional hardware resources during the upgrade for the ability to perform end-to-end upgrades online, with minimal application-specific knowledge.}, url = {http://dl.acm.org/citation.cfm?id=1656980.1657019}, author = {Tudor Dumitras and Narasimhan, Priya} } @article {18529, title = {Towards an Internet Connectivity Market}, volume = {GT-CS-09-01}, year = {2009}, month = {2009///}, institution = {Georgia Institute of Technology}, abstract = {Today{\textquoteright}s Internet achieves end-to-end connectivity through bilateral contracts between neighboring networks; unfortunately, this {\textquotedblleft}one size fits all{\textquotedblright} connectivity results in less efficient paths, unsold capacity and unmet demand, and sometimes catastrophic market failures that result in global disconnectivity. This paper presents the design and evaluation of MINT, a Market for Internet Transit. MINT is a connectivity market and corresponding set of protocols that allows ISPs to offer path segments on an open market. Edge networks bid for end-to-end paths, and a mediator matches bids for paths to collections of path segments that form end-to-end paths. MINT can be deployed using protocols that are present in today{\textquoteright}s routers, and it operates in parallel with the existing routing infrastructure and connectivity market. We present MINT{\textquoteright}s market model and protocol design; evaluate how MINT improves efficiency, the utility of edge networks, and the profits of transit networks; and how MINT can operate at Internet scale.}, url = {http://hdl.handle.net/1853/30622}, author = {Feamster, Nick and Hassan,U. and Sundaresan,S. and Valancius,V. and Johari,R. and Vazirani,V.} } @conference {15495, title = {Towards Dynamic Adaptive Automated Test Generation for Graphical User Interfaces}, booktitle = {Software Testing, Verification and Validation Workshops, 2009. ICSTW {\textquoteright}09. International Conference on}, year = {2009}, month = {2009/04//}, pages = {263 - 266}, abstract = {Graphical user interfaces (GUIs) present an enormous number of potential event sequences to users. During testing it is necessary to cover this space, however the complexity of modern GUIs has made this an increasingly difficult task. Our past work has demonstrated that it is important to incorporate "context{\textquotedblright} into GUI test cases, in terms of event combinations, event sequence length, and by considering all possible starting and ending positions for each event. Despite the use of our most refined modeling techniques, many of the generated test cases remain unexecutable. In this paper, we posit that due to the dynamic state-based nature of GUIs, it is important to incorporate feedback from the execution of tests into test case generation algorithms. We propose the use of an evolutionary algorithm to generate test suites with fewer unexecutable test cases and higher event interaction coverage.}, keywords = {adaptive automated test generation, computational complexity, event sequence length, evolutionary algorithm, evolutionary computation, graphical user interface, Graphical user interfaces, GUI test case, program testing}, doi = {10.1109/ICSTW.2009.26}, author = {Xun Yuan and Cohen,M. B and Memon, Atif M.} } @conference {18884, title = {Translating HTNs to PDDL: A small amount of domain knowledge can go a long way}, year = {2009}, month = {2009///}, pages = {1629 - 1634}, abstract = {We show how to translate HTN domain descrip- tions (if they satisfy certain restrictions) into PDDL so that they can be used by classical planners. We provide correctness results for our translation al- gorithm, and show that it runs in linear time and space. We also show that even small and incom- plete amounts of HTN knowledge, when translated into PDDL using our algorithm, can greatly im- prove a classical planner{\textquoteright}s performance. In ex- periments on several thousand randomly gener- ated problems in three different planning domains, such knowledge speeded up the well-known Fast- Forward planner by several orders of magnitude, and enabled it to solve much larger problems than it could otherwise solve.}, url = {https://www.aaai.org/ocs/index.php/IJCAI/IJCAI-09/paper/download/573/853}, author = {Alford,R. and Kuter,U. and Nau, Dana S.} } @article {13341, title = {Tree-Based Encoding for Cancellations on Morse Complexes}, journal = {Combinatorial Image Analysis}, year = {2009}, month = {2009///}, pages = {330 - 343}, abstract = {A scalar function f, defined on a manifold M, can be simplified by applying a sequence of removal and contraction operators, which eliminate its critical points in pairs, and simplify the topological representation of M, provided by Morse complexes of f. The inverse refinement operators, together with a dependency relation between them, enable a construction of a multi-resolution representation of such complexes. Here, we encode a sequence of simplification operators in a data structure called an augmented cancellation forest, which will enable procedural encoding of the inverse refinement operators, and reduce the dependency relation between modifications of the Morse complexes. In this way, this representation will induce a high flexibility of the hierarchical representation of the Morse complexes, producing a large number of Morse complexes at different resolutions that can be obtained from the hierarchy.}, doi = {10.1007/978-3-642-10210-3_26}, author = {{\v C}omi{\'c},L. and De Floriani, Leila} } @article {14301, title = {Triaging Checklists: a Substitute for a PhD in Static Analysis}, journal = {Evaluation and Usability of Programming Languages and Tools (PLATEAU) PLATEAU 2009}, year = {2009}, month = {2009///}, abstract = {Static analysis tools have achieved great success in recentyears in automating the process of detecting defects in soft- ware. However, these sophisticated tools have yet to gain widespread adoption, since many of these tools remain too difficult to understand and use. In previous work, we dis- covered that even with an effective code visualization tool, users still found it hard to determine if warnings reported by these tools were true errors or false warnings. The fun- damental problem users face is to understand enough of the underlying algorithm to determine if a warning is caused by imprecision in the algorithm, a challenge that even experts with PhDs may take a while to achieve. In our current work, we propose to use triaging checklists to provide users with systematic guidance to identify false warnings by taking into account specific sources of imprecision in the particular tool. Additionally, we plan to provide checklist assistants, which is a library of simple analyses designed to aid users in an- swering checklist questions. }, author = {Phang,K.Y. and Foster, Jeffrey S. and Hicks, Michael W. and Sazawal,V.} } @inbook {12235, title = {Triangle Inequality and Routing Policy Violations in the Internet}, booktitle = {Passive and Active Network MeasurementPassive and Active Network Measurement}, series = {Lecture Notes in Computer Science}, volume = {5448}, year = {2009}, month = {2009///}, pages = {45 - 54}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {Triangle inequality violations (TIVs) are the effect of packets between two nodes being routed on the longer direct path between them when a shorter detour path through an intermediary is available. TIVs are a natural, widespread and persistent consequence of Internet routing policies. By exposing opportunities to improve the delay between two nodes, TIVs can help myriad applications that seek to minimize end-to-end latency. However, sending traffic along the detour paths revealed by TIVs may influence Internet routing negatively. In this paper we study the interaction between triangle inequality violations and policy routing in the Internet. We use measured and predicted AS paths between Internet nodes to show that 25\% of the detour paths exposed by TIVs are in fact available to BGP but are simply deemed {\textquotedblleft}less efficient{\textquotedblright}. We also compare the AS paths of detours and direct paths and find that detours use AS edges that are rarely followed by default Internet paths, while avoiding others that BGP seems to prefer. Our study is important both for understanding the various interactions that occur at the routing layer as well as their effects on applications that seek to use TIVs to minimize latency.}, keywords = {Computer, Science}, isbn = {978-3-642-00974-7}, url = {http://dx.doi.org/10.1007/978-3-642-00975-4_5}, author = {Lumezanu,Cristian and Baden,Randy and Spring, Neil and Bhattacharjee, Bobby}, editor = {Moon,Sue and Teixeira,Renata and Uhlig,Steve} } @conference {12234, title = {Triangle inequality variations in the internet}, booktitle = {Proceedings of the 9th ACM SIGCOMM conference on Internet measurement conference}, series = {IMC {\textquoteright}09}, year = {2009}, month = {2009///}, pages = {177 - 183}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Triangle inequality violations (TIVs) are important for latency sensitive distributed applications. On one hand, they can expose opportunities to improve network routing by finding shorter paths between nodes. On the other hand, TIVs can frustrate network embedding or positioning systems that treat the Internet as a metric space where the triangle inequality holds. Even though triangle inequality violations are both significant and curious, their study has been limited to aggregate data sets that combine measurements taken over long periods of time. The limitations of these data sets open crucial questions in the design of systems that exploit (or avoid) TIVs: are TIVs stable or transient? Or are they illusions caused by aggregating measurements taken at different times? We collect latency matrices at varying sizes and time granularities and study dynamic properties of triangle inequality violations in the Internet. We show that TIVs are not results of measurement error and that their number varies with time. We examine how latency aggregates of data measured over longer periods of time preserve TIVs. Using medians to compute violations eliminates most of the TIVs that appear sporadically during the measurement but it misses many of the ones that are present for more than five hours.}, keywords = {latency, tiv, triangle inequality violation, variation}, isbn = {978-1-60558-771-4}, doi = {10.1145/1644893.1644914}, url = {http://doi.acm.org/10.1145/1644893.1644914}, author = {Lumezanu,Cristian and Baden,Randy and Spring, Neil and Bhattacharjee, Bobby} } @conference {16830, title = {TwitterStand: news in tweets}, booktitle = {Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems}, series = {GIS {\textquoteright}09}, year = {2009}, month = {2009///}, pages = {42 - 51}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Twitter is an electronic medium that allows a large user populace to communicate with each other simultaneously. Inherent to Twitter is an asymmetrical relationship between friends and followers that provides an interesting social network like structure among the users of Twitter. Twitter messages, called tweets, are restricted to 140 characters and thus are usually very focused. We investigate the use of Twitter to build a news processing system, called TwitterStand, from Twitter tweets. The idea is to capture tweets that correspond to late breaking news. The result is analogous to a distributed news wire service. The difference is that the identities of the contributors/reporters are not known in advance and there may be many of them. Furthermore, tweets are not sent according to a schedule: they occur as news is happening, and tend to be noisy while usually arriving at a high throughput rate. Some of the issues addressed include removing the noise, determining tweet clusters of interest bearing in mind that the methods must be online, and determining the relevant locations associated with the tweets.}, keywords = {geotagging, news, online clustering, Twitter}, isbn = {978-1-60558-649-6}, doi = {10.1145/1653771.1653781}, url = {http://doi.acm.org/10.1145/1653771.1653781}, author = {Sankaranarayanan,Jagan and Samet, Hanan and Teitler,Benjamin E. and Lieberman,Michael D. and Sperling,Jon} } @article {19008, title = {Two Alternatively Spliced Isoforms of the Arabidopsis SR45 Protein Have Distinct Roles during Normal Plant Development}, journal = {Plant PhysiologyPlant Physiol.}, volume = {150}, year = {2009}, month = {2009/07/01/}, pages = {1450 - 1458}, abstract = {The serine-arginine-rich (SR) proteins constitute a conserved family of pre-mRNA splicing factors. In Arabidopsis (Arabidopsis thaliana), they are encoded by 19 genes, most of which are themselves alternatively spliced. In the case of SR45, the use of alternative 3' splice sites 21 nucleotides apart generates two alternatively spliced isoforms. Isoform 1 (SR45.1) has an insertion relative to isoform 2 (SR45.2) that replaces a single arginine with eight amino acids (TSPQRKTG). The biological implications of SR45 alternative splicing have been unclear. A previously described loss-of-function mutant affecting both isoforms, sr45-1, shows several developmental defects, including defects in petal development and root growth. We found that the SR45 promoter is highly active in regions with actively growing and dividing cells. We also tested the ability of each SR45 isoform to complement the sr45-1 mutant by overexpression of isoform-specific green fluorescent protein (GFP) fusion proteins. As expected, transgenic plants overexpressing either isoform displayed both nuclear speckles and GFP fluorescence throughout the nucleoplasm. We found that SR45.1-GFP complements the flower petal phenotype, but not the root growth phenotype. Conversely, SR45.2-GFP complements root growth but not floral morphology. Mutation of a predicted phosphorylation site within the alternatively spliced segment, SR45.1-S219A-GFP, does not affect complementation. However, a double mutation affecting both serine-219 and the adjacent threonine-218 (SR45.1-T218A + S219A-GFP) behaves like isoform 2, complementing the root but not the floral phenotype. In conclusion, our study provides evidence that the two alternatively spliced isoforms of SR45 have distinct biological functions.}, isbn = {0032-0889, 1532-2548}, doi = {10.1104/pp.109.138180}, url = {http://www.plantphysiol.org/content/150/3/1450}, author = {Zhang,Xiao-Ning and Mount, Stephen M.} } @article {13873, title = {TERp system description}, journal = {MetricsMATR workshop at AMTA}, year = {2008}, month = {2008///}, abstract = {This paper describes TER-Plus (TERp) the University of Maryland / BBN Technologies submission for the NIST Metric MATR 2008 workshop on automatic machine translation evaluation metrics. TERp is an extension of Translation Edit Rate (TER) that builds off of the success of TER as an evaluation metric and alignment tool while addressing several of its weaknesses through the use of paraphrases, morphological stemming, and synonyms, as well as edit costs that are optimized to correlate better with various types of human judgments.}, author = {Snover,M. and Madnani,N. and Dorr, Bonnie J and Schwartz,R.} } @conference {15430, title = {Test case generator for GUITAR}, booktitle = {Companion of the 30th international conference on Software engineering}, series = {ICSE Companion {\textquoteright}08}, year = {2008}, month = {2008///}, pages = {959 - 960}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {As GUIs become more popular, the need for GUI testing tools becomes greater. Many current GUI test generation techniques require proprietary tools and can be hard to use to their fullest potential. This paper outlines a new test case generation strategy, which enables testers to automatically produce cases in a widely used format. We hope that this strategy will encourage more complete GUI testing.}, keywords = {code coverage, event-flow, Graphical user interfaces, gui ripping, integration tree, jfcunit, junit, Test Case Generation}, isbn = {978-1-60558-079-1}, doi = {10.1145/1370175.1370207}, url = {http://doi.acm.org/10.1145/1370175.1370207}, author = {Hackner,Daniel R. and Memon, Atif M.} } @conference {15062, title = {A topic-based Document Correlation Model}, booktitle = {Machine Learning and Cybernetics, 2008 International Conference on}, volume = {5}, year = {2008}, month = {2008/07//}, pages = {2487 - 2491}, abstract = {Document correlation analysis is now a focus of study in text mining. This paper proposed a Document Correlation Model to capture the correlation between documents from topic level. The model represents the document correlation as the Optimal Matching of a bipartite graph, of which each partition is a document, each node is a topic, and each edge is the similarity between two topics. The topics of each document are retrieved by the Latent Dirichlet Allocation model and Gibbs sampling. Experiments on correlated document search show that the Document Correlation Model outperforms the Vector Space Model on two aspects: 1) it has higher average retrieval precision; 2) it needs less space to store a documentpsilas information.}, keywords = {bipartite graph optimal matching, data mining, document correlation analysis, document retrieval, Gibbs sampling, Information retrieval, latent Dirichlet allocation model, text analysis, text mining, topic-based document correlation model}, doi = {10.1109/ICMLC.2008.4620826}, author = {Jia,Xi-Ping and Peng,Hong and Zheng,Qi-Lun and Zhuolin Jiang and Li,Zhao} } @article {15282, title = {Toward automatic facet analysis and need negotiation: Lessons from mediated search}, journal = {ACM Transactions on Information Systems (TOIS)}, volume = {27}, year = {2008}, month = {2008/12//}, pages = {6:1{\textendash}6:42 - 6:1{\textendash}6:42}, abstract = {This work explores the hypothesis that interactions between a trained human search intermediary and an information seeker can inform the design of interactive IR systems. We discuss results from a controlled Wizard-of-Oz case study, set in the context of the TREC 2005 HARD track evaluation, in which a trained intermediary executed an integrated search and interaction strategy based on conceptual facet analysis and informed by need negotiation techniques common in reference interviews. Having a human {\textquotedblleft}in the loop{\textquotedblright} yielded large improvements over fully automated systems as measured by standard ranked-retrieval metrics, demonstrating the value of mediated search. We present a detailed analysis of the intermediary{\textquoteright}s actions to gain a deeper understanding of what worked and why. One contribution is a taxonomy of clarification types informed both by empirical results and existing theories in library and information science. We discuss how these findings can guide the development of future systems. Overall, this work illustrates how studying human information-seeking processes can lead to better information retrieval applications.}, keywords = {interactive information retrieval, Reference interview}, isbn = {1046-8188}, doi = {10.1145/1416950.1416956}, url = {http://doi.acm.org/10.1145/1416950.1416956}, author = {Jimmy Lin and Wu,Philip and Abels,Eileen} } @article {17997, title = {Toward Realizing a PRAM-on-a-Chip Vision}, journal = {Lecture Notes in Computer Science}, volume = {4854}, year = {2008}, month = {2008///}, pages = {5 - 6}, abstract = {Serial computing has become largely irrelevant for growth in computing performance at around 2003. Having already concluded that to maintain past performance growth rates, general-purpose computing must be overhauled to incorporate parallel computing at all levels of a computer system {\textendash} including the programming mode {\textendash} all processor vendors put forward many-core roadmaps. They all expect exponential increase in the number of cores over at least a decade. This welcome development is also a cause for apprehension. The whole world of computing is now facing the same general-purpose parallel computing challenge that eluded computer science for so many years and the clock is ticking. It is becoming common knowledge that if you want your program to run faster you will have to program for parallelism, but the vendors who set up the rules have not yet provided clear and effective means (e.g., programming models and languages) for doing that. How can application software vendors be expected to make a large investment in new software developments, when they know that in a few years they are likely to have a whole new set of options for getting much better performance?! Namely, we are already in a problematic transition stage that slows down performance growth, and may cause a recession if it lasts too long. Unfortunately, some industry leaders are already predicting that the transition period can last a full decade.}, author = {Vishkin, Uzi} } @conference {18867, title = {Towards Design and Fabrication of a Miniature MRI-Compatible Robot for Applications in Neurosurgery}, year = {2008}, month = {2008///}, pages = {747 - 754}, publisher = {ASME}, organization = {ASME}, abstract = {Brain tumors are among the most feared complications of cancer and they occur in 20{\textendash}40\% of adult cancer patients. Despite numerous advances in treatment, the prognosis for these patients is poor, with a median survival of 4{\textendash}8 months. The primary reasons for poor survival rate are the lack of good continuous imaging modality for intraoperative intracranial procedures and the inability to remove the complete tumor tissue due to its placement in the brain and the corresponding space constraints to reach it. Intraoperative magnetic resonance imaging (MRI) supplements the surgeon{\textquoteright}s visual and tactile senses in a way that no other imaging device can achieve resulting in less trauma to surrounding healthy brain tissue during surgery. To minimize the trauma to surrounding healthy brain tissue, it would be beneficial to operate through a narrow surgical corridor dissected by the neurosurgeon. Facilitating tumor removal by accessing regions outside the direct {\textquotedblleft}line-of-sight{\textquotedblright} of the neurosurgical corridor will require a highly dexterous, small cross section, and MRI-compatible robot. Developing such a robot is extremely challenging task. In this paper we report a preliminary design of 6-DOF robot for possible application in neurosurgery. The robot actuators and body parts are constructed from MRI compatible materials. The current prototype is 0.36{\textquotedblright} in diameter and weighs only 0.0289 N (2.95 grams). The device was actuated using Flexinol{\textregistered} which is a shape memory alloy manufactured by Dynalloy, Inc. The end-effector forces ranged from 12 mN to 50 mN depending on the robot configuration. The end-effector force to robot weight ratio varied from 0.41 to 1.73. During trials the robot motion was repeatable and the range of motion of the robot was about 90 degrees for the end-effector when one side shape memory alloy (SMA) channel was actuated. The actuation time from the start to finish was about 2.5 s.}, isbn = {978-0-7918-4326-0}, doi = {10.1115/DETC2008-49587}, url = {http://link.aip.org/link/ASMECP/v2008/i43260/p747/s1\&Agg=doi}, author = {Pappafotis,Nicholas and Bejgerowski,Wojciech and Gullapalli,Rao and Simard,J. Marc and Gupta, Satyandra K. and Desai,Jaydev P.} } @conference {13126, title = {Tracking Down Under: Following the Satin Bowerbird}, booktitle = {Applications of Computer Vision, 2008. WACV 2008. IEEE Workshop on}, year = {2008}, month = {2008/01//}, pages = {1 - 7}, abstract = {Socio biologists collect huge volumes of video to study animal behavior (our collaborators work with 30,000 hours of video). The scale of these datasets demands the development of automated video analysis tools. Detecting and tracking animals is a critical first step in this process. However, off-the-shelf methods prove incapable of handling videos characterized by poor quality, drastic illumination changes, non-stationary scenery and foreground objects that become motionless for long stretches of time. We improve on existing approaches by taking advantage of specific aspects of this problem: by using information from the entire video we are able to find animals that become motionless for long intervals of time; we make robust decisions based on regional features; for different parts of the image, we tailor the selection of model features, choosing the features most helpful in differentiating the target animal from the background in that part of the image. We evaluate our method, achieving almost 83\% tracking accuracy on a more than 200,000 frame dataset of Satin Bowerbird courtship videos.}, keywords = {analysis, behavior;animal, Bowerbird;animal, computing;feature, detection;animal, extraction;tracking;video, processing;zoology;, Satin, sciences, selection;behavioural, signal, tool;feature, tracking;automated, video}, doi = {10.1109/WACV.2008.4544004}, author = {Kembhavi,A. and Farrell,R. and Luo,Yuancheng and Jacobs, David W. and Duraiswami, Ramani and Davis, Larry S.} } @conference {15573, title = {Tradeoffs in Approximate Range Searching Made Simpler}, booktitle = {Computer Graphics and Image Processing, 2008. SIBGRAPI {\textquoteright}08. XXI Brazilian Symposium on}, year = {2008}, month = {2008/10//}, pages = {237 - 244}, abstract = {Range searching is a fundamental problem in computational geometry. The problem involves preprocessing a set of n points in R^d into a data structure, so that it is possible to determine the subset of points lying within a given query range. In approximate range searching, a parameter eps epsiv gt; 0 is given, and for a given query range R the points lying within distance eps diam(R) of the range{\textquoteright}s boundary may be counted or not. In this paper we present three results related to the issue of tradeoffs in approximate range searching. First, we introduce the range sketching problem. Next, we present a space-time tradeoff for smooth convex ranges, which generalize spherical ranges. Finally, we show how to modify the previous data structure to obtain a space-time tradeoff for simplex ranges. In contrast to existing results, which are based on relatively complex data structures, all three of our results are based on simple, practical data structures.}, keywords = {approximate range searching, computational geometry, data structure, Data structures, query range}, doi = {10.1109/SIBGRAPI.2008.24}, author = {Arya,S. and Fonseca,G. and Mount, Dave} } @article {12243, title = {Trade-offs in matching jobs and balancing load for distributed desktop grids}, journal = {Future Generation Computer Systems}, volume = {24}, year = {2008}, month = {2008/05//}, pages = {415 - 424}, abstract = {Desktop grids~can achieve tremendous computing power at low cost through opportunistic sharing of resources. However, traditional client{\textendash}server Grid architectures do not deal with all types of failures, and do not always cope well with very dynamic environments. This paper describes the design of a desktop grid implemented over a modified Peer-to-Peer (P2P) architecture. The underlying P2P system is decentralized and inherently adaptable, giving the Grid robustness, scalability, and the ability to cope with dynamic environments, while still efficiently mapping application instances to available resources throughout the system.We use simulation to compare three different types of matching algorithms under differing workloads. Overall, the P2P approach produces significantly lower wait times than prior approaches, while adapting efficiently to the dynamic environment. }, keywords = {Desktop grid, load balancing, Matchmaking, peer-to-peer computing, Resource discovery}, isbn = {0167-739X}, doi = {10.1016/j.future.2007.07.007}, url = {http://www.sciencedirect.com/science/article/pii/S0167739X07001240}, author = {Kim,Jik-Soo and Nam,Beomseok and Keleher,Peter and Marsh,Michael and Bhattacharjee, Bobby and Sussman, Alan} } @article {12912, title = {Transesterification activity of a novel lipase from Acinetobacter venetianus RAG-1}, journal = {Antonie van Leeuwenhoek}, volume = {94}, year = {2008}, month = {2008///}, pages = {621 - 625}, abstract = {Transesterification activity and the industrial potential of a novel lipase prepared from Acinetobacter ventiatus RAG-1 were evaluated. Purified lipase samples were dialyzed against pH 9.0 buffer in a single optimization step prior to lyophilization. The enzyme and organic phase were pre-equilibrated (separately) to the same thermodynamic water activities (a w) ranging from a w 0.33 to 0.97. Production of 1-octyl butyrate by lipase-catalyzed transesterification of vinyl butyrate with 1-octanol in hexane was monitored by gas chromatography. Production of 1-octyl butyrate and initial rate of reaction depended on water activity. Product synthesis and rate of transesterification increased sharply with increase from a w 0.33 to 0.55. Highest product concentration (218 mM) and rate of reaction (18.7 μmol h-1 {\textperiodcentered} 10 μg protein) were measured at a w 0.86. Transesterification activity in hexane represented 32\% of comparable hydrolytic activity in aqueous buffer.}, doi = {10.1007/s10482-008-9276-5}, author = {Snellman,E. A. and Rita R Colwell} } @conference {18608, title = {Trellis: a platform for building flexible, fast virtual networks on commodity hardware}, booktitle = {Proceedings of the 2008 ACM CoNEXT Conference}, series = {CoNEXT {\textquoteright}08}, year = {2008}, month = {2008///}, pages = {72:1{\textendash}72:6 - 72:1{\textendash}72:6}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {We describe Trellis, a platform for hosting virtual networks on shared commodity hardware. Trellis allows each virtual network to define its own topology, control protocols, and forwarding tables, while amortizing costs by sharing the physical infrastructure. Trellis synthesizes two container-based virtualization technologies, VServer and NetNS, as well as a new tunneling mechanism, EGRE, into a coherent platform that enables high-speed virtual networks. We describe the design and implementation of Trellis and evaluate its packet-forwarding rates relative to other virtualization technologies and native kernel forwarding performance.}, isbn = {978-1-60558-210-8}, doi = {10.1145/1544012.1544084}, url = {http://doi.acm.org/10.1145/1544012.1544084}, author = {Bhatia,Sapan and Motiwala,Murtaza and Muhlbauer,Wolfgang and Mundada,Yogesh and Valancius,Vytautas and Bavier,Andy and Feamster, Nick and Peterson,Larry and Rexford,Jennifer} } @article {14367, title = {Trusting spam reporters: A reporter-based reputation system for email filtering}, journal = {ACM Transactions on Information Systems (TOIS)}, volume = {27}, year = {2008}, month = {2008/12//}, pages = {3:1{\textendash}3:27 - 3:1{\textendash}3:27}, abstract = {Spam is a growing problem; it interferes with valid email and burdens both email users and service providers. In this work, we propose a reactive spam-filtering system based on reporter reputation for use in conjunction with existing spam-filtering techniques. The system has a trust-maintenance component for users, based on their spam-reporting behavior. The challenge that we consider is that of maintaining a reliable system, not vulnerable to malicious users, that will provide early spam-campaign detection to reduce the costs incurred by users and systems. We report on the utility of a reputation system for spam filtering that makes use of the feedback of trustworthy users. We evaluate our proposed framework, using actual complaint feedback from a large population of users, and validate its spam-filtering performance on a collection of real email traffic over several weeks. To test the broader implication of the system, we create a model of the behavior of malicious reporters, and we simulate the system under various assumptions using a synthetic dataset.}, keywords = {reputation systems, Spam filtering, trust}, isbn = {1046-8188}, doi = {10.1145/1416950.1416953}, url = {http://doi.acm.org/10.1145/1416950.1416953}, author = {Zheleva,Elena and Kolcz,Aleksander and Getoor, Lise} } @article {14591, title = {A Tutorial of the Poisson Random Field Model in Population Genetics}, journal = {Advances in Bioinformatics}, volume = {2008}, year = {2008}, month = {2008///}, pages = {1 - 9}, abstract = {Population genetics is the study of allele frequency changes driven by various evolutionary forces such as mutation, natural selection, and random genetic drift. Although natural selection is widely recognized as a bona-fide phenomenon, the extent to which it drives evolution continues to remain unclear and controversial. Various qualitative techniques, or so-called {\textquotedblleft}tests of neutrality{\textquotedblright}, have been introduced to detect signatures of natural selection. A decade and a half ago, Stanley Sawyer and Daniel Hartl provided a mathematical framework, referred to as the Poisson random field (PRF), with which to determine quantitatively the intensity of selection on a particular gene or genomic region. The recent availability of large-scale genetic polymorphism data has sparked widespread interest in genome-wide investigations of natural selection. To that end, the original PRF model is of particular interest for geneticists and evolutionary genomicists. In this article, we will provide a tutorial of the mathematical derivation of the original Sawyer and Hartl PRF model.}, isbn = {1687-8027, 1687-8035}, doi = {10.1155/2008/257864}, url = {http://www.hindawi.com/journals/abi/2008/257864/}, author = {Sethupathy,Praveen and Hannenhalli, Sridhar} } @conference {17869, title = {Taking Advantage of Collective Operation Semantics for Loosely Coupled Simulations}, booktitle = {Parallel and Distributed Processing Symposium, International}, year = {2007}, month = {2007///}, pages = {128 - 128}, publisher = {IEEE Computer Society}, organization = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, abstract = {Although a loosely coupled component-based framework offers flexibility and versatility for building and deploying large-scale multi-physics simulation systems, the performance of such a system can suffer from excessive buffering of data objects which may or may not be transferred between components. By taking advantages of the collective properties of parallel simulation components, which is common for data-parallel scientific applications, an optimization method, which we call buddy-help, can greatly enhance overall performance. Buddy-Help can reduce the time taken for buffering operations in an exporting component, when there are timing differences across processes in the exporting component. The optimization enables skipping unnecessary buffering operations, once another process, which has already performed the collective export operation, has determined that the buffered data will never be needed. Because an analytical study would be very difficult due to the complexity of the overall coupled simulation system, the performance improvement enabled by buddy-help is investigated via a micro-benchmark specifically designed to illustrate the behavior of coupled simulation scenarios under which buddy-help can provide performance gains.}, isbn = {1-4244-0909-8}, doi = {http://doi.ieeecomputersociety.org/10.1109/IPDPS.2007.370318}, author = {Wu,Joe Shang-Chieh and Sussman, Alan} } @article {12587, title = {Target Tracking Using a Joint Acoustic Video System}, journal = {Multimedia, IEEE Transactions on}, volume = {9}, year = {2007}, month = {2007/06//}, pages = {715 - 727}, abstract = {In this paper, a multitarget tracking system for collocated video and acoustic sensors is presented. We formulate the tracking problem using a particle filter based on a state-space approach. We first discuss the acoustic state-space formulation whose observations use a sliding window of direction-of-arrival estimates. We then present the video state space that tracks a target{\textquoteright}s position on the image plane based on online adaptive appearance models. For the joint operation of the filter, we combine the state vectors of the individual modalities and also introduce a time-delay variable to handle the acoustic-video data synchronization issue, caused by acoustic propagation delays. A novel particle filter proposal strategy for joint state-space tracking is introduced, which places the random support of the joint filter where the final posterior is likely to lie. By using the Kullback-Leibler divergence measure, it is shown that the joint operation of the filter decreases the worst case divergence of the individual modalities. The resulting joint tracking filter is quite robust against video and acoustic occlusions due to our proposal strategy. Computer simulations are presented with synthetic and field data to demonstrate the filter{\textquoteright}s performance}, keywords = {(numerical, acoustic, adaptive, appearance, approach;synchronization;time-delay, data, delay;acoustic, divergence;acoustic, estimate;joint, estimation;hidden, feature, filter;sliding, Filtering, fusion;multitarget, fusion;synchronisation;target, highways;direction-of-arrival, Kullback-Leibler, methods);sensor, model;particle, processing;, processing;automated, propagation, removal;optical, signal, system;multimodal, tracking;acoustic, tracking;direction-of-arrival, tracking;occlusion;online, tracking;particle, tracking;video, variable;visual, video, window;state-space}, isbn = {1520-9210}, doi = {10.1109/TMM.2007.893340}, author = {Cevher, V. and Sankaranarayanan,A. C and McClellan, J.H. and Chellapa, Rama} } @article {13154, title = {Task scheduling in large camera networks}, journal = {Computer Vision{\textendash}ACCV 2007}, year = {2007}, month = {2007///}, pages = {397 - 407}, abstract = {Visibility in architectural layouts affects humannavigation, so a suitable representation of visibility context is useful in understanding human activity. Motivated by studies of spatial behavior, we use a set of features from visibility analysis to represent spatial context in the interpretation of human activity. An agent{\textquoteright}s goal, belief about the world, trajectory and visible layout are considered to be random variables that evolve with time during the agent{\textquoteright}s movement, and are modeled in a Bayesian framework. We design a search-based task in a sprite-world, and compare the results of our framework to those of human subject experiments. Our findings confirm that knowledge of spatial layout improves human interpretations of the trajectories (implying that visibility context is useful in this task). Since our framework demonstrates performance close to that of human subjects with knowledge of spatial layout, our findings confirm that our model makes adequate use of visibility context. In addition, the representation we use for visibility context allows our model to generalize well when presented with new scenes. }, author = {Lim,S.N. and Davis, Larry S. and Mittal,A.} } @article {13870, title = {Task-based evaluation of text summarization using Relevance Prediction}, journal = {Information Processing \& Management}, volume = {43}, year = {2007}, month = {2007/11//}, pages = {1482 - 1499}, abstract = {This article introduces a new task-based evaluation measure called Relevance Prediction that is a more intuitive measure of an individual{\textquoteright}s performance on a real-world task than interannotator agreement. Relevance Prediction parallels what a user does in the real world task of browsing a set of documents using standard search tools, i.e., the user judges relevance based on a short summary and then that same user{\textemdash}not an independent user{\textemdash}decides whether to open (and judge) the corresponding document. This measure is shown to be a more reliable measure of task performance than LDC Agreement, a current gold-standard based measure used in the summarization evaluation community. Our goal is to provide a stable framework within which developers of new automatic measures may make stronger statistical statements about the effectiveness of their measures in predicting summary usefulness. We demonstrate{\textemdash}as a proof-of-concept methodology for automatic metric developers{\textemdash}that a current automatic evaluation measure has a better correlation with Relevance Prediction than with LDC Agreement and that the significance level for detected differences is higher for the former than for the latter.}, keywords = {Relevance prediction, Summarization evaluation, Summary usefulness}, isbn = {0306-4573}, doi = {10.1016/j.ipm.2007.01.002}, url = {http://www.sciencedirect.com/science/article/pii/S0306457307000234}, author = {Hobson,Stacy President and Dorr, Bonnie J and Monz,Christof and Schwartz,Richard} } @conference {15906, title = {Task-based interaction with an integrated multilingual, multimedia information system: a formative evaluation}, booktitle = {Proceedings of the 7th ACM/IEEE-CS joint conference on Digital libraries}, series = {JCDL {\textquoteright}07}, year = {2007}, month = {2007///}, pages = {117 - 126}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {This paper describes a formative evaluation of an integrated multilingual, multimedia information system, a series of user studies designed to guide system development. The system includes automatic speech recognition for English, Chinese, and Arabic, automatic translation from Chinese and Arabic into English, and query-based and profile-based search options. The study design emphasizes repeated evaluation with the same (increasingly experienced) participants, exploration of alternative task designs, rich qualitative and quantitative data collection, and rapid analysis to provide the timely feedback needed to support iterative and responsive development. Results indicate that users presented with materials in a language that they do not know can generate remarkably useful work products, but that integration of transcription, translation, search and profile management poses challenges that would be less evident were each technology to be evaluated in isolation.}, keywords = {Cross-language information retrieval, multimedia, User studies}, isbn = {978-1-59593-644-8}, doi = {10.1145/1255175.1255199}, url = {http://doi.acm.org/10.1145/1255175.1255199}, author = {Zhang,Pengyi and Plettenberg,Lynne and Klavans,Judith L. and Oard, Douglas and Soergel,Dagobert} } @conference {12368, title = {A taxonomy for medical image registration acceleration techniques}, booktitle = {Life Science Systems and Applications Workshop, 2007. LISA 2007. IEEE/NIH}, year = {2007}, month = {2007///}, pages = {160 - 163}, author = {Plishker,W. and Dandekar,O. and Bhattacharyya, Shuvra S. and Shekhar,R.} } @article {16322, title = {Techniques for Classifying Executions of Deployed Software to Support Software Engineering Tasks}, journal = {IEEE Transactions on Software Engineering}, volume = {33}, year = {2007}, month = {2007///}, pages = {287 - 304}, abstract = {There is an increasing interest in techniques that support analysis and measurement of fielded software systems. These techniques typically deploy numerous instrumented instances of a software system, collect execution data when the instances run in the field, and analyze the remotely collected data to better understand the system{\textquoteright}s in-the-field behavior. One common need for these techniques is the ability to distinguish execution outcomes (e.g., to collect only data corresponding to some behavior or to determine how often and under which condition a specific behavior occurs). Most current approaches, however, do not perform any kind of classification of remote executions and either focus on easily observable behaviors (e.g., crashes) or assume that outcomes{\textquoteright} classifications are externally provided (e.g., by the users). To address the limitations of existing approaches, we have developed three techniques for automatically classifying execution data as belonging to one of several classes. In this paper, we introduce our techniques and apply them to the binary classification of passing and failing behaviors. Our three techniques impose different overheads on program instances and, thus, each is appropriate for different application scenarios. We performed several empirical studies to evaluate and refine our techniques and to investigate the trade-offs among them. Our results show that 1) the first technique can build very accurate models, but requires a complete set of execution data; 2) the second technique produces slightly less accurate models, but needs only a small fraction of the total execution data; and 3) the third technique allows for even further cost reductions by building the models incrementally, but requires some sequential ordering of the software instances{\textquoteright} instrumentation.}, keywords = {execution classification, remote analysis/measurement.}, isbn = {0098-5589}, doi = {http://doi.ieeecomputersociety.org/10.1109/TSE.2007.1004}, author = {Haran,Murali and Karr,Alan and Last,Michael and Orso,Alessandro and Porter, Adam and Sanil,Ashish and Fouch?,Sandro} } @conference {15500, title = {Test suite prioritization by interaction coverage}, booktitle = {Workshop on Domain specific approaches to software test automation: in conjunction with the 6th ESEC/FSE joint meeting}, series = {DOSTA {\textquoteright}07}, year = {2007}, month = {2007///}, pages = {1 - 7}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Event-driven software (EDS) is a widely used class of software that takes sequences of events as input, changes state, and outputs new event sequences. Managing the size of tests suites for EDS is difficult as the number of event combinations and sequences grow exponentially with the number of events. We propose a new testing technique that extends software interaction testing. Traditional software interaction testing systematically examines all t-way interactions of parameters for a program. This paper extends the notion to t-way interactions over sequences of events. The technique applies to many classes of software; we focus on that of EDS. As a proof-of-concept, we prioritize existing test suites for four GUI-based programs by t-way interaction coverage. We compare the rate of fault detection with that of several other prioritization criteria. Results show that prioritization by interaction coverage has the fastest rate of fault detection in half of our experiments, making the most impact when tests have high interaction coverage.}, keywords = {t-way interaction coverage, combinatorial interaction testing, covering arrays, event driven software, test suite prioritization}, isbn = {978-1-59593-726-1}, doi = {10.1145/1294921.1294922}, url = {http://doi.acm.org/10.1145/1294921.1294922}, author = {Bryce,Ren{\'e}e C. and Memon, Atif M.} } @article {13918, title = {A theoretical model of children{\textquoteright}s storytelling using physically-oriented technologies (SPOT)}, journal = {Journal of Educational Multimedia and Hypermedia}, volume = {16}, year = {2007}, month = {2007///}, pages = {389 - 389}, author = {Guha,M.L. and Druin, Allison and Montemayor,J. and Chipman,G. and Farber,A.} } @article {18005, title = {Thinking in parallel: Some basic data-parallel algorithms and techniques}, journal = {UMIACS, University of Maryland, College Park}, volume = {1993}, year = {2007}, month = {2007///}, author = {Vishkin, Uzi} } @conference {12212, title = {Thumbspace: Generalized one-handed input for touchscreen-based mobile devices}, booktitle = {Proceedings of the 11th IFIP TC 13 international conference on Human-computer interaction}, year = {2007}, month = {2007///}, pages = {324 - 338}, author = {Karlson,A.K. and Bederson, Benjamin B.} } @inbook {19622, title = {Time and Space Efficient Algorithms for Two-Party Authenticated Data Structures}, booktitle = {Information and Communications Security}, series = {Lecture Notes in Computer Science}, year = {2007}, month = {2007/01/01/}, pages = {1 - 15}, publisher = {Springer Berlin Heidelberg}, organization = {Springer Berlin Heidelberg}, abstract = {Authentication is increasingly relevant to data management. Data is being outsourced to untrusted servers and clients want to securely update and query their data. For example, in database outsourcing, a client{\textquoteright}s database is stored and maintained by an untrusted server. Also, in simple storage systems, clients can store very large amounts of data but at the same time, they want to assure their integrity when they retrieve them. In this paper, we present a model and protocol for two-party authentication of data structures. Namely, a client outsources its data structure and verifies that the answers to the queries have not been tampered with. We provide efficient algorithms to securely outsource a skip list with logarithmic time overhead at the server and client and logarithmic communication cost, thus providing an efficient authentication primitive for outsourced data, both structured (e.g., relational databases) and semi-structured (e.g., XML documents). In our technique, the client stores only a constant amount of space, which is optimal. Our two-party authentication framework can be deployed on top of existing storage applications, thus providing an efficient authentication service. Finally, we present experimental results that demonstrate the practical efficiency and scalability of our scheme.}, keywords = {Algorithm Analysis and Problem Complexity, Computer Communication Networks, computers and society, Data Encryption, Management of Computing and Information Systems, Systems and Data Security}, isbn = {978-3-540-77047-3, 978-3-540-77048-0}, url = {http://link.springer.com/chapter/10.1007/978-3-540-77048-0_1}, author = {Charalampos Papamanthou and Tamassia, Roberto}, editor = {Qing, Sihan and Imai, Hideki and Wang, Guilin} } @article {15254, title = {To fill or not to fill: the gas station problem}, journal = {Algorithms{\textendash}ESA 2007}, year = {2007}, month = {2007///}, pages = {534 - 545}, abstract = {In this paper we study several routing problems that generalize shortest paths and the Traveling Salesman Problem. We consider a more general model that incorporates the actual cost in terms of gas prices. We have a vehicle with a given tank capacity. We assume that at each vertex gas may be purchased at a certain price. The objective is to find the cheapest route to go from s to t, or the cheapest tour visiting a given set of locations. Surprisingly, the problem of find the cheapest way to go from s to t can be solved in polynomial time and is not NP-complete. For most other versions however, the problem is NP-complete and we develop polynomial time approximation algorithms for these versions.}, doi = {10.1007/978-3-540-75520-3_48}, author = {Khuller, Samir and Malekian,A. and Mestre,J.} } @conference {12395, title = {A topic model for word sense disambiguation}, booktitle = {Proceedings of the 2007 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning (EMNLP-CoNLL)}, year = {2007}, month = {2007///}, pages = {1024 - 1033}, author = {Jordan Boyd-Graber and Blei,D. and Zhu,X.} } @article {13338, title = {Topological Decompositions for 3D Non-manifold Simplicial Shapes}, volume = {CS-TR-4855}, year = {2007}, month = {2007/02/06/}, institution = {Department of Computer Science, University of Maryland, College Park}, abstract = {Modeling and understanding complex non-manifold shapes is a key issue in several applications including form-feature identification in CAD/CAE, and shape recognition for Web searching. Geometric shapes are commonly discretized as simplicial 2- or 3-complexes embedded in the 3D Euclidean space. The topological structure of a non-manifold simplicial shape can be analyzed through its decomposition into a collection of components with simpler topology. The granularity of the decomposition depends on the combinatorial complexity of the components. In this paper, we present topological tools for structural analysis of three-dimensional non-manifold shapes. This analysis is based on a topological decomposition at two different levels. We discuss the topological properties of the components at each level, and we present algorithms for computing such decompositions. We investigate the relations among the components, and propose a graph-based representation for such relations.}, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/7429}, author = {Hui,Annie and De Floriani, Leila} } @conference {16008, title = {Toward domain-neutral human-level metacognition}, booktitle = {AAAI Spring Symposium on Logical Formalizations of Commonsense Reasoning}, year = {2007}, month = {2007///}, author = {Anderson,M. L and Schmill,M. and Oates,T. and Perlis, Don and Josyula,D. and Wright,D. and Wilson,S.} } @article {14746, title = {Toward Specifying and Validating Cross-Domain Policies}, journal = {Technical Reports from UMIACS}, year = {2007}, month = {2007/04/17/undef}, abstract = {Formal security policies are extremely useful for two related reasons. First, they allow a policy to be considered in isolation, separate from programs under the purview of the policy and separate from the implementation of the policy{\textquoteright}s enforcement. Second, policies can be checked for compliance against higher-level security goals by using automated analyses. By contrast, ad hoc enforcement mechanisms (for which no separate policies are specified) enjoy neither benefit, and non-formal policies enjoy the first but not the second. We would like to understand how best to define (and enforce) multi-level security policies when information must be shared across domains that have varying levels of trust (the so-called "cross domain" problem). Because we wish to show such policies meet higher-level security goals with high assurance, we are interested in specifying cross domain policies formally, and then reasoning about them using automated tools. In this report, we briefly survey work that presents formal security policies with cross-domain concerns, in particular with respect to the problem of downgrading. We also describe correctness properties for such policies, all based on noninterference. Finally, we briefly discuss recently-developed tools for analyzing formal security policies; though no existing tools focus on the analysis of downgrading-oriented policies, existing research points the way to providing such support.}, author = {Hicks, Michael W. and Swamy,N. and Tsang,S.} } @conference {12331, title = {Towards a heterogeneous medical image registration acceleration platform}, booktitle = {Biomedical Circuits and Systems Conference, 2007. BIOCAS 2007. IEEE}, year = {2007}, month = {2007///}, pages = {231 - 234}, author = {Plishker,W. and Dandekar,O. and Bhattacharyya, Shuvra S. and Shekhar,R.} } @conference {13340, title = {Towards a semantic web system for understanding real world representations}, booktitle = {Proceedings of the Tenth International Conference on Computer Graphics and Artificial Intelligence}, year = {2007}, month = {2007///}, abstract = {As the volume of multimedia content available on the Web continues to increase, there is a clearneed for more advanced techniques for effective retrieval and management of such data. In this context, we see a growing interest in exploiting the potential of the Semantic Web in different research fields. But, on the other hand, there is a general lack of tools able to analyse, organize and understand digital shape models (especially 3D models) for easily populating repositories with complete and well-detailed metadata. Several steps are necessary to create and associate semantics with a shape and some of them are clearly context-dependent. In this paper, we present the design details of our new system, that we call be-SMART, for inspecting digital 3D shapes by extracting geometrical and topological information from them and for structuring and annotating these shapes using ontology-driven metadata. In particular, we describe the general structure of the system, the different modules and their mutual relations. We then concentrate on the first two modules of the system showing how the 3D models are annotated following ontology-driven metadata. We also provide motivations for further work in developing new techniques for both annotating and managing 3D models on the Web. }, author = {Papaleo,L. and De Floriani, Leila and Hendler,J. and Hui,A.} } @conference {18004, title = {Towards Realizing a PRAM-On-Chip Vision}, booktitle = {Workshop on Highly Parallel Processing on a Chip (HPPC)}, volume = {28}, year = {2007}, month = {2007///}, abstract = {Serial computing has become largely irrelevant for growth in computing performance at around 2003.Having already concluded that to maintain past performance growth rates, general-purpose computing must be overhauled to incorporate parallel computing at all levels of a computer system--including the programming model{\textemdash}all processor vendors put forward many-core roadmaps. They all expect exponential increase in the num- ber of cores over at least a decade. This welcome development is also a cause for apprehension. The whole world of computing is now facing the same general-purpose parallel computing challenge that eluded computer science for so many years and the clock is ticking. It is becoming common knowledge that if you want your program to run faster you will have to program for parallelism, but the vendors who set up the rules have not yet provided clear and effective means (eg, programming models and languages) for doing that. How can application software ven- dors be expected to make a large investment in new software developments, when they know that in a few years they are likely to have a whole new set of options for getting much better performance?! Namely, we are already in a problematic transition stage that slows down performance growth, and may cause a recession if it lasts too long. Unfortunately, some industry leaders are already predicting that the transition period can last a full decade. }, author = {Vishkin, Uzi} } @article {18869, title = {Towards the development of a virtual environment-based training system for mechanical assembly operations}, journal = {Virtual Reality}, volume = {11}, year = {2007}, month = {2007///}, pages = {189 - 206}, abstract = {In this paper, we discuss the development of Virtual Training Studio (VTS), a virtual environment-based training system that allows training supervisors to create training instructions and allows trainees to learn assembly operations in a virtual environment. Our system is mainly focused on the cognitive side of training so that trainees can learn to recognize parts, remember assembly sequences, and correctly orient the parts during assembly operations. Our system enables users to train using the following three training modes: (1) Interactive Simulation, (2) 3D Animation, and (3) Video. Implementing these training modes required us to develop several new system features. This paper presents an overview of the VTS system and describes a few main features of the system. We also report user test results that show how people train using our system. The user test results indicate that the system is able to support a wide variety of training preferences and works well to support training for assembly operations.}, keywords = {Computer science}, isbn = {1359-4338}, doi = {10.1007/s10055-007-0076-4}, url = {http://www.springerlink.com/content/g7760422m13l83x1/abstract/}, author = {Brough,John and Schwartz,Maxim and Gupta, Satyandra K. and Anand,Davinder and Kavetsky,Robert and Pettersen,Ralph} } @article {18286, title = {Tracing malicious relays in cooperative wireless communications}, journal = {Information Forensics and Security, IEEE Transactions on}, volume = {2}, year = {2007}, month = {2007///}, pages = {198 - 212}, author = {Mao,Y. and Wu,M.} } @article {13880, title = {TREC 2007 ciQA Task: University of Maryland}, journal = {Proceedings of TREC}, year = {2007}, month = {2007///}, author = {Madnani,N. and Jimmy Lin and Dorr, Bonnie J} } @article {14567, title = {TREMOR{\textemdash}a tool for retrieving transcriptional modules by incorporating motif covariance}, journal = {Nucleic Acids Research}, volume = {35}, year = {2007}, month = {2007/12/01/}, pages = {7360 - 7371}, abstract = {A transcriptional module (TM) is a collection of transcription factors (TF) that as a group, co-regulate multiple, functionally related genes. The task of identifying TMs poses an important biological challenge. Since TFs belong to evolutionarily and structurally related families, TF family members often bind to similar DNA motifs and can confound sequence-based approaches to TM identification. A previous approach to TM detection addresses this issue by pre-selecting a single representative from each TF family. One problem with this approach is that closely related transcription factors can still target sufficiently distinct genes in a biologically meaningful way, and thus, pre-selecting a single family representative may in principle miss certain TMs. Here we report a method{\textemdash}TREMOR (Transcriptional Regulatory Module Retriever). This method uses the Mahalanobis distance to assess the validity of a TM and automatically incorporates the inter-TF binding similarity without resorting to pre-selecting family representatives. The application of TREMOR on human muscle-specific, liver-specific and cell-cycle-related genes reveals TFs and TMs that were validated from literature and also reveals additional related genes.}, doi = {10.1093/nar/gkm885}, url = {http://nar.oxfordjournals.org/content/35/21/7360.abstract}, author = {Singh,Larry N. and Wang,Li-San and Hannenhalli, Sridhar} } @conference {17781, title = {T-rex: A domain-independent system for automated cultural information extraction}, booktitle = {Proceedings of the First International Conference on Computational Cultural Dynamics (ICCCD 2007)}, year = {2007}, month = {2007///}, abstract = {RDF (Resource Description Framework) is a web standarddefined by the World Wide Web Consortium. In RDF, we can define schemas of interest. For example, we can define a schema about tribes on the Pakistan-Afghanistan borderland, or a schema about violent events. An RDF instance is a set of facts that are compatible with the schema. The principal contribution of this paper is the development of a scalable system called T-REX (short for {\textquotedblleft}The RDF EXtractor{\textquotedblright}) that allows us to extract instances associated with a user-specified schema, independently of the domain about which we wish to extract data. Using T-REX, we have successfully extracted information about various aspects of about 20 tribes living in the Pakistan-Afghanistan border. Moreover, we have used T-REX to successfully extract occurrences of violent events from a set of 80 news sites in approximately 50 countries. T-REX scales well {\textendash} it has processed approximately 45,000 web pages per day for the last 6 months. }, author = {Albanese, M. and V.S. Subrahmanian} } @conference {13273, title = {A two-level topological decomposition for non-manifold simplicial shapes}, booktitle = {Proceedings of the 2007 ACM symposium on Solid and physical modeling}, series = {SPM {\textquoteright}07}, year = {2007}, month = {2007///}, pages = {355 - 360}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Modeling and understanding complex non-manifold shapes is a key issue in shape analysis. Geometric shapes are commonly discretized as two- or three-dimensional simplicial complexes embedded in the 3D Euclidean space. The topological structure of a nonmanifold simplicial shape can be analyzed through its decomposition into a collection of components with a simpler topology. Here, we present a topological decomposition of a shape at two different levels, with different degrees of granularity. We discuss the topological properties of the components at each level, and we present algorithms for computing such decompositions. We investigate the relations among the components, and propose a graph-based representation for such relations.}, keywords = {Non-manifold modeling, shape decomposition, shape modeling, simplicial complexes}, isbn = {978-1-59593-666-0}, doi = {10.1145/1236246.1236297}, url = {http://doi.acm.org/10.1145/1236246.1236297}, author = {Hui,Annie and De Floriani, Leila} } @conference {14283, title = {Type qualifier inference for Java}, booktitle = {ACM SIGPLAN Notices}, volume = {42}, year = {2007}, month = {2007///}, pages = {321 - 336}, author = {Greenfieldboyce,D. and Foster, Jeffrey S.} } @conference {12181, title = {Target size study for one-handed thumb use on small touchscreen devices}, booktitle = {Proceedings of the 8th conference on Human-computer interaction with mobile devices and services}, year = {2006}, month = {2006///}, pages = {203 - 210}, author = {Parhi,P. and Karlson,A.K. and Bederson, Benjamin B.} } @conference {16089, title = {Task taxonomy for graph visualization}, booktitle = {Proceedings of the 2006 AVI workshop on BEyond time and errors: novel evaluation methods for information visualization}, series = {BELIV {\textquoteright}06}, year = {2006}, month = {2006///}, pages = {1 - 5}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Our goal is to define a list of tasks for graph visualization that has enough detail and specificity to be useful to: 1) designers who want to improve their system and 2) to evaluators who want to compare graph visualization systems. In this paper, we suggest a list of tasks we believe are commonly encountered while analyzing graph data. We define graph specific objects and demonstrate how all complex tasks could be seen as a series of low-level tasks performed on those objects. We believe that our taxonomy, associated with benchmark datasets and specific tasks, would help evaluators generalize results collected through a series of controlled experiments.}, keywords = {Evaluation, graph visualization, task taxonomy}, isbn = {1-59593-562-2}, doi = {10.1145/1168149.1168168}, url = {http://doi.acm.org/10.1145/1168149.1168168}, author = {Lee,Bongshin and Plaisant, Catherine and Parr,Cynthia Sims and Fekete,Jean-Daniel and Henry,Nathalie} } @article {13167, title = {Task-Driven Video Collection}, journal = {Technical Reports from UMIACS}, year = {2006}, month = {2006/01/23/T17:1}, abstract = {Vision systems are increasingly being deployed to perform complexsurveillance tasks. While improved algorithms are being developed to perform these tasks, it is also important that data suitable for these algorithms be acquired - a non-trivial task in a dynamic and crowded scene viewed by multiple PTZ cameras. In this paper, we describe a multi-camera system that collects images and videos of moving objects in such scenes, subject to task constraints. The system constructs "task visibility intervals" that contain information about what can be sensed in future time intervals. Constructing these intervals requires prediction of future object motion and consideration of several factors such as object occlusion and camera control parameters. Using a plane-sweep algorithm, these atomic intervals can be combined to form multi-task intervals, during which a single camera can collect videos suitable for multiple tasks simultaneously. Although cameras can then be scheduled based on the constructed intervals, finding an optimal schedule is a typical NP-hard problem. Due to this, and the lack of exact future information in a dynamic environment, we propose several methods for fast camera scheduling that yield solutions within a small constant factor of optimal. Experimental results illustrate system capabilities for both real and more complicated simulated scenarios. }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/3042}, author = {Lim,Ser-Nam and Mittal,Anuarg and Davis, Larry S.} } @article {15487, title = {Techniques and processes for improving the quality and performance of open-source software}, journal = {Software Process: Improvement and Practice}, volume = {11}, year = {2006}, month = {2006///}, pages = {163 - 176}, abstract = {Open-source development processes have emerged as an effective approach to reduce cycle-time and decrease design, implementation, and quality assurance (QA) costs for certain types of software, particularly systems infrastructure software, such as operating systems (OS), compilers and language processing tools, text and drawing editors, and middleware. This article presents two contributions to the study of open-source software processes. First, we describe key challenges of open-source software and illustrate how QA processes{\textemdash}specifically those tailored to open-source development{\textemdash}help mitigate these challenges better than traditional closed-source processes do. Second, we summarize results of empirical studies that evaluate how our Skoll distributed continuous quality assurance (DCQA) techniques and processes help to resolve key challenges in developing and validating open-source software. Our results show that: (a) using models to configure and guide the DCQA process improves developer understanding of open-source software, (b) improving the diversity of platform configurations helps QA engineers find defects missed during conventional testing, and (c) centralizing control of QA activities helps to eliminate redundant work. Copyright {\textcopyright} 2006 John Wiley \& Sons, Ltd.}, keywords = {distributed continuous quality assurance, open-source software development and testing}, isbn = {1099-1670}, doi = {10.1002/spip.260}, url = {http://onlinelibrary.wiley.com/doi/10.1002/spip.260/abstract}, author = {Porter, Adam and Yilmaz,Cemal and Memon, Atif M. and Krishna,Arvind S. and Schmidt,Douglas C. and Gokhale,Aniruddha} } @article {16949, title = {A telescope for high-dimensional data}, journal = {Computing in Science \& Engineering}, volume = {8}, year = {2006}, month = {2006/04//March}, pages = {48 - 53}, abstract = {Muscular dystrophy is a degenerative disease that destroys muscles and ultimately kills its victims. Researchers worldwide are racing to find a cure by trying to uncover the genetic processes that cause it. Given that a key process is muscle development, researchers at a consortium of 10 institutions are studying 1,000 men and women, ages 18 to 40 years, to see how their muscles enlarge with exercise. The 150 variables collected for each participant will make this data analysis task challenging for users of traditional statistical software tools. However, a new approach to visual data analysis is helping these researchers speed up their work. At the University of Maryland{\textquoteright}s Human-Computer Interaction Library, we developed an interactive approach to let researchers explore high-dimensional data in an orderly manner, focusing on specific features one at a time. The rank-by-feature framework lets them adjust controls to specify what they{\textquoteright}re looking for, and then, with only a glance, they can spot strong relationships among variables, find tight data clusters, or identify unexpected gaps. Sometimes surprising outliers invite further study as to whether they represent errors or an unusual outcome. Similar data analysis problems come up in meteorology, finance, chemistry, and other sciences in which complex relationships among many variables govern outcomes. The rank-by-feature framework could be helpful to many researchers, engineers, and managers because they can then steer their analyses toward the action}, keywords = {Chemistry, Data analysis, data mining, data visualisation, degenerative disease, Degenerative diseases, diseases, Finance, genetic process, Genetics, high-dimensional data, interactive data analysis, medical computing, Meteorology, muscle, muscle development, Muscles, muscular dystrophy, Rank-by-feature framework, software, software libraries, software tools, Telescopes, visual data, visual data analysis}, isbn = {1521-9615}, doi = {10.1109/MCSE.2006.21}, author = {Shneiderman, Ben} } @article {16022, title = {Theory and Application of Self-Reference: Logic and Beyond}, journal = {Self-reference}, volume = {178}, year = {2006}, month = {2006///}, pages = {121 - 121}, author = {Perlis, Don} } @conference {14442, title = {Is there a grand challenge or X-prize for data mining?}, booktitle = {Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining}, series = {KDD {\textquoteright}06}, year = {2006}, month = {2006///}, pages = {954 - 956}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {This panel will discuss possible exciting and motivating Grand Challenge problems for Data Mining, focusing on bioinformatics, multimedia mining, link mining, text mining, and web mining.}, keywords = {Bioinformatics, data mining, grand challenge, image mining, link mining, multimedia mining, text mining, video mining, web mining, X-prize}, isbn = {1-59593-339-5}, doi = {10.1145/1150402.1150535}, url = {http://doi.acm.org/10.1145/1150402.1150535}, author = {Piatetsky-Shapiro,Gregory and Grossman,Robert and Djeraba,Chabane and Feldman,Ronen and Getoor, Lise and Zaki,Mohammed} } @conference {15061, title = {A Time Saving Method for Human Detection in Wide Angle Camera Images}, booktitle = {Machine Learning and Cybernetics, 2006 International Conference on}, year = {2006}, month = {2006/08//}, pages = {4029 - 4034}, abstract = {A time-saving method for human detection in an indoor environment in wide angle camera images is presented in this paper, without using time-consuming template operations such as edge detection and morphological operations. It excludes other objects in motion to detect humans including cases of the partial occlusion of humans, rotation of the head and variation of skin colors. This algorithm is applicable where the memory space is limited and the time requirements are strict, such as in an embedded system. The experimental results show that it took about 0.35 seconds to process the algorithm after the scene study time}, keywords = {CAMERAS, Embedded system, human detection, image recognition, Image segmentation, indoor environment, Motion estimation, time-saving method, wide angle camera images}, doi = {10.1109/ICMLC.2006.258804}, author = {Zhuolin Jiang and Li,Shao-Fa and Gao,Dong-Fa} } @conference {13173, title = {Top-down, bottom-up multivalued default reasoning for identity maintenance}, booktitle = {Proceedings of the 4th ACM international workshop on Video surveillance and sensor networks}, series = {VSSN {\textquoteright}06}, year = {2006}, month = {2006///}, pages = {79 - 86}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Persistent tracking systems require the capacity to track individuals by maintaining identity across visibility gaps caused by occlusion events. In traditional computer vision systems, the flow of information is typically bottom-up. The low level image processing modules take video input, perform early vision tasks such as background subtraction and object detection,and pass this information to the high level reasoning module. This paper describes the architecture of a system that uses top-down information flow to perform identity maintenance across occlusion events. This system uses the high level reasoning module to provide control feedback to the low level image processing module to perform forensic analysis of archival video and actively acquire information required to arrive at identity decisions. This functionality is in addition to traditional bottom-up reasoning about identity, employing contextual cues and appearance matching, within the multivalued default logic framework proposed in [18]. This framework, in addition to bestowing upon the system the property of nonmonotonicity, also allows for it to qualitatively encode its confidence in the identity decisions it takes.}, keywords = {default logic, identity maintenance, nonmonotonic reasoning, tracking, visual surveillance}, isbn = {1-59593-496-0}, doi = {10.1145/1178782.1178795}, url = {http://doi.acm.org/10.1145/1178782.1178795}, author = {Shet,Vinay D. and Harwood,David and Davis, Larry S.} } @conference {15825, title = {Topic-focused multi-document summarization using an approximate oracle score}, booktitle = {Proceedings of the COLING/ACL on Main conference poster sessions}, series = {COLING-ACL {\textquoteright}06}, year = {2006}, month = {2006///}, pages = {152 - 159}, publisher = {Association for Computational Linguistics}, organization = {Association for Computational Linguistics}, address = {Stroudsburg, PA, USA}, abstract = {We consider the problem of producing a multi-document summary given a collection of documents. Since most successful methods of multi-document summarization are still largely extractive, in this paper, we explore just how well an extractive method can perform. We introduce an "oracle" score, based on the probability distribution of unigrams in human summaries. We then demonstrate that with the oracle score, we can generate extracts which score, on average, better than the human summaries, when evaluated with ROUGE. In addition, we introduce an approximation to the oracle score which produces a system with the best known performance for the 2005 Document Understanding Conference (DUC) evaluation.}, url = {http://dl.acm.org/citation.cfm?id=1273073.1273093}, author = {Conroy,John M. and Schlesinger,Judith D. and O{\textquoteright}Leary, Dianne P.} } @conference {13339, title = {Topology-based reasoning on non-manifold shapes}, booktitle = {Proceedings of the 1st International Symposium on Shapes and Semantics, Matsushima, Japan}, year = {2006}, month = {2006///}, abstract = {Topological information is a promising resource to research in shape-understanding as it provides a high-level description of the characteristics of a shape, and such high-level description often has strong association with the semantics of an object. The Shape Acquisition and Processing (SAP) ontology has been designed to maintain useful information of a model. We propose here an extension to the SAP ontology, that addresses the non-manifold properties of a model. Useful information about the connectivity of an object can be obtained based on an analysis of its non- manifold properties, because the structure of a non-manifold object can be considered as a graph of manifold parts connected together at non-manifold joints. The manifold parts are often pieces that have strong semantic associations. In this work, we describe the type of non-manifold properties, the various types of connected components in a non-manifold object and their semantical significance. We address how the Euler{\textquoteright} characteristics of a non-manifold object can be found based on such information. All such information are extractable from a model using TopMesh, a tool that we have developed. In this work, we also describe the features of TopMesh, namely, all the topological properties it extracts. }, author = {De Floriani, Leila and Hui,A. and Papaleo,L.} } @conference {17540, title = {Touring the internet in a TCP sidecar}, booktitle = {Proceedings of the 6th ACM SIGCOMM conference on Internet measurement}, series = {IMC {\textquoteright}06}, year = {2006}, month = {2006///}, pages = {339 - 344}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {An accurate router-level topology of the Internet would benefit many research areas, including network diagnosis, inter-domain traffic engineering, and overlay construction. We present TCP Sidecar and Passenger, two elements of a system for router-level Internet topology discovery. Sidecar transparently injects measurement probes into non-measurement TCP streams, while Passenger combines TTL-limited probes with the often-ignored IP record route option. The combined approach mitigates problems associated with traceroute-based topology discovery, including abuse reports, spurious edge inference from multi-path routing, unresolved IP aliases, long network timeouts, and link discovery behind NATs and firewalls. We believe that we are the first mapping project to measure MPLS use with ICMP extensions and record route behavior when the TTL is not decremented. We are able to discover NATs when monitoring TCP connections that tunnel through them. In this paper, we present preliminary results for TCP Sidecar and Passenger on PlanetLab. Our experiments inject measurement probes into traffic generated both from the CoDeeN Web proxy project and from a custom web crawler to 166,745 web sites.}, keywords = {network topology discovery, passenger, record route, sidecar}, isbn = {1-59593-561-4}, doi = {10.1145/1177080.1177093}, url = {http://doi.acm.org/10.1145/1177080.1177093}, author = {Sherwood,Rob and Spring, Neil} } @article {17434, title = {Toward an enriched (and revitalized) sense of help: Summary of an ASIS\&T 2005 panel session}, journal = {Bulletin of the American Society for Information Science and Technology}, volume = {32}, year = {2006}, month = {2006/06/01/}, pages = {23 - 26}, isbn = {1550-8366}, doi = {10.1002/bult.2006.1720320509}, url = {http://onlinelibrary.wiley.com/doi/10.1002/bult.2006.1720320509/abstract}, author = {Haas,Stephanie W and Denn,Sheila and Locke,David and Shneiderman, Ben and Brown,Laurie} } @conference {11996, title = {Towards a sensorimotor WordNet SM: Closing the semantic gap}, booktitle = {Proc. of the International WordNet Conference (GWC)}, year = {2006}, month = {2006///}, author = {Guerra-Filho,G. and Aloimonos, J.} } @conference {16327, title = {Towards Dependability in Everyday Software Using Software Telemetry}, booktitle = {Engineering of Autonomic and Autonomous Systems, IEEE International Workshop on}, year = {2006}, month = {2006///}, pages = {9 - 18}, publisher = {IEEE Computer Society}, organization = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, abstract = {Application-level software dependability is difficult to ensure. Thus it?s typically used only in custom systems and is achieved using one-of-a-kind, handcrafted solutions. We are interested in understanding whether and how these techniques can be applied to more common, lower-end systems. To this end, we have adapted a condition-based maintenance (CBM) approach called the Multivariate State Estimation Technique (MSET). This approach automatically creates sophisticated statistical models that predict system failure well before failures occur, leading to simpler and more successful recoveries. We have packaged this approach in the Software Dependability Framework (SDF). The SDF consists of instrumentation and data management libraries, a CBM module, performance visualization tools, and a software architecture that supports system designers. Finally, we evaluated our framework on a simple video game application. Our results suggest that we can cheaply and reliably predict impending runtime failures and respond to them in time to improve the system?s dependability.}, isbn = {0-7695-2544-X}, doi = {http://doi.ieeecomputersociety.org/10.1109/EASE.2006.21}, author = {Gross,Kenny C. and Urmanov,Aleksey and Votta,Lawrence G. and McMaster,Scott and Porter, Adam} } @article {12927, title = {Toxigenic Vibrio Cholerae in the Aquatic Environment of Mathbaria, Bangladesh}, journal = {Applied and Environmental MicrobiologyAppl. Environ. Microbiol.}, volume = {72}, year = {2006}, month = {2006/04/01/}, pages = {2849 - 2855}, abstract = {Toxigenic Vibrio cholerae, rarely isolated from the aquatic environment between cholera epidemics, can be detected in what is now understood to be a dormant stage, i.e., viable but nonculturable when standard bacteriological methods are used. In the research reported here, biofilms have proved to be a source of culturable V. cholerae, even in nonepidemic periods. Biweekly environmental surveillance for V. cholerae was carried out in Mathbaria, an area of cholera endemicity adjacent to the Bay of Bengal, with the focus on V. cholerae O1 and O139 Bengal. A total of 297 samples of water, phytoplankton, and zooplankton were collected between March and December 2004, yielding eight V. cholerae O1 and four O139 Bengal isolates. A combination of culture methods, multiplex-PCR, and direct fluorescent antibody (DFA) counting revealed the Mathbaria aquatic environment to be a reservoir for V. cholerae O1 and O139 Bengal. DFA results showed significant clumping of the bacteria during the interepidemic period for cholera, and the fluorescent micrographs revealed large numbers of V. cholerae O1 in thin films of exopolysaccharides (biofilm). A similar clumping of V. cholerae O1 was also observed in samples collected from Matlab, Bangladesh, where cholera also is endemic. Thus, the results of the study provided in situ evidence for V. cholerae O1 and O139 in the aquatic environment, predominantly as viable but nonculturable cells and culturable cells in biofilm consortia. The biofilm community is concluded to be an additional reservoir of cholera bacteria in the aquatic environment between seasonal epidemics of cholera in Bangladesh.}, isbn = {0099-2240, 1098-5336}, doi = {10.1128/AEM.72.4.2849-2855.2006}, url = {http://aem.asm.org/content/72/4/2849}, author = {Alam,Munirul and Sultana,Marzia and Nair,G. Balakrish and Sack,R. Bradley and Sack,David A. and Siddique,A. K. and Ali,Afsar and Huq,Anwar and Rita R Colwell} } @conference {13161, title = {Tracking Articulating Objects from Ground Vehicles using Mixtures of Mixtures}, booktitle = {Intelligent Robots and Systems, 2006 IEEE/RSJ International Conference on}, year = {2006}, month = {2006/10//}, pages = {1230 - 1236}, abstract = {An algorithm for tracking articulating objects from moving camera platforms is presented. Mixtures of mixtures are used to model the appearance of the object and the background. The state of the object is tracked using a particle filter. Egomotion information are estimated and used to set the state variance of the particle filter. Results of tracking human objects from an unmanned ground vehicle are used to evaluate the tracking algorithm}, keywords = {articulating, filter;unmanned, ground, information;mixtures, mixtures;particle, objects, of, operated, tracking;egomotion, vehicle;remotely, vehicles;robot, vision;}, doi = {10.1109/IROS.2006.281881}, author = {Abd-Almageed, Wael and Hussein,M. and Davis, Larry S.} } @article {14585, title = {Transcriptional Genomics Associates FOX Transcription Factors With Human Heart Failure}, journal = {Circulation}, volume = {114}, year = {2006}, month = {2006///}, pages = {1269 - 1276}, abstract = {Background{\textemdash} Specific transcription factors (TFs) modulate cardiac gene expression in murine models of heart failure, but their relevance in human subjects remains untested. We developed and applied a computational approach called transcriptional genomics to test the hypothesis that a discrete set of cardiac TFs is associated with human heart failure.Methods and Results{\textemdash} RNA isolates from failing (n=196) and nonfailing (n=16) human hearts were hybridized with Affymetrix HU133A arrays, and differentially expressed heart failure genes were determined. TF binding sites overrepresented in the -5-kb promoter sequences of these heart failure genes were then determined with the use of public genome sequence databases. Binding sites for TFs identified in murine heart failure models (MEF2, NKX, NF-AT, and GATA) were significantly overrepresented in promoters of human heart failure genes (P<0.002; false discovery rate 2\% to 4\%). In addition, binding sites for FOX TFs showed substantial overrepresentation in both advanced human and early murine heart failure (P<0.002 and false discovery rate <4\% for each). A role for FOX TFs was supported further by expression of FOXC1, C2, P1, P4, and O1A in failing human cardiac myocytes at levels similar to established hypertrophic TFs and by abundant FOXP1 protein in failing human cardiac myocyte nuclei.Conclusions{\textemdash} Our results provide the first evidence that specific TFs identified in murine models (MEF2, NKX, NFAT, and GATA) are associated with human heart failure. Moreover, these data implicate specific members of the FOX family of TFs (FOXC1, C2, P1, P4, and O1A) not previously suggested in heart failure pathogenesis. These findings provide a crucial link between animal models and human disease and suggest a specific role for FOX signaling in modulating the hypertrophic response of the heart to stress in humans.}, doi = {10.1161/CIRCULATIONAHA.106.632430}, url = {http://circ.ahajournals.org/content/114/12/1269.abstract}, author = {Hannenhalli, Sridhar and Putt,Mary E. and Gilmore,Joan M. and Wang,Junwen and Parmacek,Michael S. and Epstein,Jonathan A. and Morrisey,Edward E. and Margulies,Kenneth B. and Cappola,Thomas P.} } @article {16082, title = {TreePlus: Interactive Exploration of Networks with Enhanced Tree Layouts}, journal = {Visualization and Computer Graphics, IEEE Transactions on}, volume = {12}, year = {2006}, month = {2006/12//nov}, pages = {1414 - 1426}, abstract = {Despite extensive research, it is still difficult to produce effective interactive layouts for large graphs. Dense layout and occlusion make food Webs, ontologies and social networks difficult to understand and interact with. We propose a new interactive visual analytics component called TreePlus that is based on a tree-style layout. TreePlus reveals the missing graph structure with visualization and interaction while maintaining good readability. To support exploration of the local structure of the graph and gathering of information from the extensive reading of labels, we use a guiding metaphor of "plant a seed and watch it grow." It allows users to start with a node and expand the graph as needed, which complements the classic overview techniques that can be effective at (but often limited to) revealing clusters. We describe our design goals, describe the interface and report on a controlled user study with 28 participants comparing TreePlus with a traditional graph interface for six tasks. In general, the advantage of TreePlus over the traditional interface increased as the density of the displayed data increased. Participants also reported higher levels of confidence in their answers with TreePlus and most of them preferred TreePlus}, keywords = {Automated;Software;User-Computer Interface;, Biological;Pattern Recognition, data visualization;graph structure;graphical user interface;interactive visual analytics;occlusion;tree-style layout;data visualisation;graphical user interfaces;hidden feature removal;interactive systems;trees (mathematics);Algorithms;Computer Graphics;C}, isbn = {1077-2626}, doi = {10.1109/TVCG.2006.106}, author = {Lee,B. and Parr,C.S. and Plaisant, Catherine and Bederson, Benjamin B. and Veksler,V.D. and Gray,W.D. and Kotfila,C.} } @conference {14750, title = {Trusted declassification:: high-level policy for a security-typed language}, booktitle = {Proceedings of the 2006 workshop on Programming languages and analysis for security}, series = {PLAS {\textquoteright}06}, year = {2006}, month = {2006///}, pages = {65 - 74}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Security-typed languages promise to be a powerful tool with which provably secure software applications may be developed. Programs written in these languages enforce a strong, global policy of noninterferencewhich ensures that high-security data will not be observable on low-security channels. Because noninterference is typically too strong a property, most programs use some form of declassification to selectively leak high security information, e.g. when performing a password check or data encryption. Unfortunately, such a declassification is often expressed as an operation within a given program, rather than as part of a global policy, making reasoning about the security implications of a policy more difficult.In this paper, we propose a simple idea we call trusted declassification in which special declassifier functions are specified as part of the global policy. In particular, individual principals declaratively specify which declassifiers they trust so that all information flows implied by the policy can be reasoned about in absence of a particular program. We formalize our approach for a Java-like language and prove a modified form of noninterference which we call noninterference modulo trusted methods. We have implemented our approach as an extension to Jif and provide some of our experience using it to build a secure e-mail client.}, keywords = {noninterference modolo trusted methods, declassification, FJifP, information-flow control, Jif, security policy, security-typed languages, trusted declassification}, isbn = {1-59593-374-3}, doi = {10.1145/1134744.1134757}, url = {http://doi.acm.org/10.1145/1134744.1134757}, author = {Hicks,Boniface and King,Dave and McDaniel,Patrick and Hicks, Michael W.} } @article {14079, title = {The Trypanosoma cruzi L1Tc and NARTc non-LTR retrotransposons show relative site specificity for insertion}, journal = {Molecular biology and evolution}, volume = {23}, year = {2006}, month = {2006///}, pages = {411 - 411}, author = {Bringaud,F. and Bartholomeu,D. C and Blandin,G. and Delcher,A. and Baltz,T. and El-Sayed, Najib M. and Ghedin,E.} } @article {14085, title = {Trypanosoma cruzi mitochondrial maxicircles display species- and strain-specific variation and a conserved element in the non-coding region}, journal = {BMC Genomics}, volume = {7}, year = {2006}, month = {2006///}, pages = {60 - 60}, abstract = {BACKGROUND:The mitochondrial DNA of kinetoplastid flagellates is distinctive in the eukaryotic world due to its massive size, complex form and large sequence content. Comprised of catenated maxicircles that contain rRNA and protein-coding genes and thousands of heterogeneous minicircles encoding small guide RNAs, the kinetoplast network has evolved along with an extreme form of mRNA processing in the form of uridine insertion and deletion RNA editing. Many maxicircle-encoded mRNAs cannot be translated without this post-transcriptional sequence modification.RESULTS:We present the complete sequence and annotation of the Trypanosoma cruzi maxicircles for the CL Brener and Esmeraldo strains. Gene order is syntenic with Trypanosoma brucei and Leishmania tarentolae maxicircles. The non-coding components have strain-specific repetitive regions and a variable region that is unique for each strain with the exception of a conserved sequence element that may serve as an origin of replication, but shows no sequence identity with L. tarentolae or T. brucei. Alternative assemblies of the variable region demonstrate intra-strain heterogeneity of the maxicircle population. The extent of mRNA editing required for particular genes approximates that seen in T. brucei. Extensively edited genes were more divergent among the genera than non-edited and rRNA genes. Esmeraldo contains a unique 236-bp deletion that removes the 5{\textquoteright}-ends of ND4 and CR4 and the intergenic region. Esmeraldo shows additional insertions and deletions outside of areas edited in other species in ND5, MURF1, and MURF2, while CL Brener has a distinct insertion in MURF2.CONCLUSION:The CL Brener and Esmeraldo maxicircles represent two of three previously defined maxicircle clades and promise utility as taxonomic markers. Restoration of the disrupted reading frames might be accomplished by strain-specific RNA editing. Elements in the non-coding region may be important for replication, transcription, and anchoring of the maxicircle within the kinetoplast network.}, isbn = {1471-2164}, doi = {10.1186/1471-2164-7-60}, url = {http://www.biomedcentral.com/1471-2164/7/60}, author = {Westenberger,Scott and Cerqueira,Gustavo and El-Sayed, Najib M. and Zingales,Bianca and Campbell,David and Sturm,Nancy} } @conference {15343, title = {The turbulence structure of shockwave and boundary layer interaction in a compression corner}, booktitle = {44th AIAA Aerospace Meeting and Exhibit}, volume = {2006}, year = {2006}, month = {2006///}, address = {Reno, NV}, abstract = {Shockwave and turbulent boundary layer interactions (STBLI) result in intense localizedheating rates and pressure loads, making them extremely important flow features that must be identified for engineering design. The absence of detailed and complete experimental and numerical data at the same flow and boundary conditions is one of the major stumbling blocks in the development of accurate turbulence models for the prediction of STBLI. We use a set of direct numerical simulation data (Wu \& Martin, 2006) that has been validated against experiments (Bookey et al., 2005) at the same conditions to present detailed flow features of the STBLI over a compression corner at Mach 3 and low Reynolds number with Reθ=2100. Details regarding the evolution of the turbulence structure angle, characteristic streamwise length scales, and hairpin packets through the interaction are presented. The three-dimensionality of the turbulence field and main shock are illustrated and the strength of shocks and shocklets through the interaction are considered. }, author = {Martin, M.P and Smits,A. and Wu,M. and Ringuette,M.} } @inbook {14739, title = {Tagged Sets: A Secure and Transparent Coordination Medium}, booktitle = {Coordination Models and LanguagesCoordination Models and Languages}, series = {Lecture Notes in Computer Science}, volume = {3454}, year = {2005}, month = {2005///}, pages = {193 - 205}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {A simple and effective way of coordinating distributed, mobile, and parallel applications is to use a virtual shared memory (VSM), such as a Linda tuple-space. In this paper, we propose a new kind of VSM, called a tagged set . Each element in the VSM is a value with an associated tag, and values are read or removed from the VSM by matching the tag. Tagged sets exhibit three properties useful for VSMs: 1 Ease of use . A tagged value naturally corresponds to the notion that data has certain attributes, expressed by the tag, which can be used for later retrieval. 2 Flexibility . Tags are implemented as propositional logic formulae, and selection as logical implication, so the resulting system is quite powerful. Tagged sets naturally support a variety of applications, such as shared data repositories (e.g., for media or e-mail), message passing, and publish/subscribe algorithms; they are powerful enough to encode existing VSMs, such as Linda spaces. 3 Security . Our notion of tags naturally corresponds to keys, or capabilities: a user may not select data in the set unless she presents a legal key or keys. Normal tags correspond to symmetric keys, and we introduce asymmetric tags that correspond to public and private key pairs. Treating tags as keys permits users to easily specify protection criteria for data at a fine granularity. This paper motivates our approach, sketches its basic theory, and places it in the context of other data management strategies.}, isbn = {978-3-540-25630-4}, url = {http://dx.doi.org/10.1007/11417019_17}, author = {Oriol,Manuel and Hicks, Michael W.}, editor = {Jacquet,Jean-Marie and Picco,Gian} } @article {15034, title = {Techniques for indexing and querying temporal observations for a collection of objects}, journal = {Algorithms and Computation}, year = {2005}, month = {2005///}, pages = {822 - 834}, abstract = {We consider the problem of dynamically indexing temporal observations about a collection of objects, each observation consisting of a key identifying the object, a list of attribute values and a timestamp indicating the time at which these values were recorded. We make no assumptions about the rates at which these observations are collected, nor do we assume that the various objects have about the same number of observations. We develop indexing structures that are almost linear in the total number of observations available at any given time instance, and that support dynamic additions of new observations in polylogarithmic time. Moreover, these structures allow the quick handling of queries to identify objects whose attribute values fall within a certain range at every time instance of a specified time interval. Provably good bounds are established.}, doi = {10.1007/978-3-540-30551-4_70}, author = {Shi,Q. and JaJa, Joseph F.} } @article {12932, title = {Temperature-Driven Campylobacter Seasonality in England and Wales}, journal = {Applied and Environmental MicrobiologyAppl. Environ. Microbiol.}, volume = {71}, year = {2005}, month = {2005/01/01/}, pages = {85 - 92}, abstract = {Campylobacter incidence in England and Wales between 1990 and 1999 was examined in conjunction with weather conditions. Over the 10-year interval, the average annual rate was determined to be 78.4 {\textpm} 15.0 cases per 100,000, with an upward trend. Rates were higher in males than in females, regardless of age, and highest in children less than 5 years old. Major regional differences were detected, with the highest rates in Wales and the southwest and the lowest in the southeast. The disease displayed a seasonal pattern, and increased campylobacter rates were found to be correlated with temperature. The most marked seasonal effect was observed for children under the age of 5. The seasonal pattern of campylobacter infections indicated a linkage with environmental factors rather than food sources. Therefore, public health interventions should not be restricted to food-borne approaches, and the epidemiology of the seasonal peak in human campylobacter infections may best be understood through studies in young children.}, isbn = {0099-2240, 1098-5336}, doi = {10.1128/AEM.71.1.85-92.2005}, url = {http://aem.asm.org/content/71/1/85}, author = {Louis,Val{\'e}rie R. and Gillespie,Iain A. and O{\textquoteright}Brien,Sarah J. and Russek-Cohen,Estelle and Pearson,Andrew D. and Rita R Colwell} } @conference {13471, title = {Temporal visualization of planning polygons for e~cient partitioning of geo-spatial data}, booktitle = {Information Visualization, 2005. INFOVIS 2005. IEEE Symposium on}, year = {2005}, month = {2005///}, pages = {211 - 218}, publisher = {IEEE}, organization = {IEEE}, abstract = {Partitioning of geo-spatial data for efficient allocation of resources such as schools and emergency health care services is driven by a need to provide better and more effective services. Partitioning of spatial data is a complex process that depends on numerous factors such as population, costs incurred in deploying or utilizing resources and target capacity of a resource. Moreover, complex data such as population distributions are dynamic i.e. they may change over time. Simple animation may not effectively show temporal changes in spatial data. We propose the use of three temporal visualization techniques -wedges, rings and time slices - to display the nature of change in temporal data in a single view. Along with maximizing resource utilization and minimizing utilization costs, a partition should also ensure the long term effectiveness of the plan. We use multi-attribute visualization techniques to highlight the strengths and identify the weaknesses of a partition. Comparative visualization techniques allow multiple partitions to be viewed simultaneously. Users can make informed decisions about how to partition geo spatial data by using a combination of our techniques for multi-attribute visualization, temporal visualization and comparative visualization.}, isbn = {0-7803-9464-X}, doi = {10.1109/INFVIS.2005.1532149}, url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1532149}, author = {Shanbhag,P. and Rheingans,P. and desJardins, Marie} } @article {15824, title = {Time reversal and n-qubit canonical decompositions}, journal = {Journal of Mathematical Physics}, volume = {46}, year = {2005}, month = {2005/05/17/}, pages = {062104-062104-19 - 062104-062104-19}, abstract = {On pure states of n quantum bits, the concurrence entanglement monotone returns the norm of the inner product of a pure state with its spin-flip. The monotone vanishes for n odd, but for n even there is an explicit formula for its value on mixed states, i.e., a closed-form expression computes the minimum over all ensemble decompositions of a given density. For n even a matrix decomposition ν = k1ak2 of the unitary group is explicitly computable and allows for study of the monotone{\textquoteright}s dynamics. The side factors k1 and k2 of this concurrence canonical decomposition (CCD) are concurrence symmetries, so the dynamics reduce to consideration of the a factor. This unitary a phases a basis of entangled states, and the concurrence dynamics of u are determined by these relative phases. In this work, we provide an explicit numerical algorithm computing ν = k1ak2 for n odd. Further, in the odd case we lift the monotone to a two-argument function. The concurrence capacity of ν according to the double argument lift may be nontrivial for n odd and reduces to the usual concurrence capacity in the literature for n even. The generalization may also be studied using the CCD, leading again to maximal capacity for most unitaries. The capacity of ν(x)I2 is at least that of ν, so odd-qubit capacities have implications for even-qubit entanglement. The generalizations require considering the spin-flip as a time reversal symmetry operator in Wigner{\textquoteright}s axiomatization, and the original Lie algebra homomorphism defining the CCD may be restated entirely in terms of this time reversal. The polar decomposition related to the CCD then writes any unitary evolution as the product of a time-symmetric and time-antisymmetric evolution with respect to the spin-flip. En route we observe a Kramers{\textquoteright} nondegeneracy: the existence of a nondegenerate eigenstate of any time reversal symmetric n-qubit Hamiltonian demands (i) n even and (ii) maximal concurrence of said eigenstate. We provide examples of how to apply this work to study the kinematics and dynamics of entanglement in spin chain Hamiltonians.}, isbn = {00222488}, doi = {doi:10.1063/1.1900293}, url = {http://jmp.aip.org/resource/1/jmapaq/v46/i6/p062104_s1}, author = {Bullock,Stephen S. and Brennen,Gavin K. and O{\textquoteright}Leary,Dianne P.} } @article {14923, title = {Torrance-sparrow off-specular reflection and linear subspaces for object recognition}, volume = {10/230,888}, year = {2005}, month = {2005/05/31/}, abstract = {The Torrance-Sparrow model of off-specular reflection is recast in a significantly simpler and more transparent form in order to render a spherical-harmonic decomposition more feasible. By assuming that a physical surface consists of small, reflecting facets whose surface normals satisfy a normal distribution, the model captures the off-specular enhancement of the reflected intensity distribution often observed at large angles of incidence and reflection, features beyond the reach of the phenomenological broadening models usually employed. In passing we remove a physical inconsistency in the original treatment, restoring reciprocity and correcting the dependence of reflectance on angle near grazing incidence. It is noted that the results predicted by the model are relatively insensitive to values of its one parameter, the width of the distribution of surface normals.}, url = {http://www.google.com/patents?id=LI4VAAAAEBAJ}, author = {Thornber,Karvel K and Jacobs, David W.}, editor = {NEC Laboratories America, Inc.} } @article {16412, title = {Toward a graphical ABM toolkit with GIS integration}, journal = {Proceedings of Agent2005}, year = {2005}, month = {2005///}, abstract = {Agent-based modeling (ABM) has proved useful in a number of fields. Many of theearly successes of ABM were due to its ability to represent the processes of a phenomenon. However, less emphasis has been placed in ABM on developing its ability to replicate spatial patterns of phenomena. In order to do that, more powerful spatial modeling techniques, like those within geographical information systems (GIS), are necessary. The integration of these two tool sets into a cohesive package would allow for elegant modeling of both process and pattern. One problem with an integrated toolkit is that most GIS users are not programmers, but most GIS users are familiar with the use of detailed graphical user interfaces (GUIs) in order to create complex visualizations of data. Thus providing a detailed GUI to access an integrated ABM-GIS toolkit would vastly expand the number of users for such a toolkit. This paper is a first step toward that goal. We first outline several design principles for an ABM-GIS toolkit and then describe a survey of extant toolkits (RepastPy, NetLogo, and MobiDyc) that were selected based on the design principles. The toolkits were surveyed to see how well they fulfill some of the design principles. This survey is not meant to be a comparative review of these toolkits but rather it was conducted to determine what useful design principles can be gathered from them that might inform a new {\textquotedblleft}ideal{\textquotedblright} ABM-GIS toolkit. Finally, the paper concludes with some design recommendations for such a toolkit. }, author = {Rand, William and Brown,D and Riolo,R and Robinson,D} } @article {16104, title = {Toward a Statistical Knowledge Network (2004)}, journal = {Institute for Systems Research Technical Reports}, year = {2005}, month = {2005///}, abstract = {Statistics support planning and decision making and enormous efforts are made to collect data and produce statistics at all levels of governance. An important principle of democratic societies is that government statistics should be accessible to the broadest possible constituencies to empower better plans and decisions in all aspects of life. Given the potential of near-ubiquitous Internet access in homes and workplaces and efforts by government agencies to mount websites, physical access to large volumes of government is close to a fait accompli. What remains a significant challenge is enabling access to the right statistical information at the right time and in the right form.}, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/6522}, author = {Marchionini,Gary and Haas,Stephanie and Plaisant, Catherine and Shneiderman, Ben and Hert,Carol} } @article {13406, title = {Toward on-line schema evolution for non-stop systems}, journal = {11th High Performance Transaction Systems Workshop}, year = {2005}, month = {2005///}, author = {Deshpande, Amol and Hicks, Michael W.} } @conference {12099, title = {Toward resilient security in wireless sensor networks}, booktitle = {Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing}, year = {2005}, month = {2005///}, pages = {34 - 45}, author = {Yang,H. and Ye,F. and Yuan,Y. and Lu,S. and Arbaugh, William A.} } @article {12671, title = {Tracking Algorithm Using Background-Foreground Motion Models and Multiple Cues}, journal = {ICASSP apos}, year = {2005}, month = {2005///}, pages = {233 - 236}, abstract = {We present a stochastic tracking algorithm for surveillance videoswhere targets are dim and of low resolution. Our tracker is mainly based on the particle filter algorithm. Two important novel fea- tures of the tracker include: A motion model consisting of both background and foreground motion parameters is built. Multiple cues are adaptively integrated in a system observation model when estimating the likelihood functions. Based on these features, the accuracy and robustness of the tracker has been improved, which is very important for surveillance problems. We present the results of applying the proposed algorithm to many videos. }, author = {Shao, J. and Zhou,S. K and Chellapa, Rama} } @conference {12652, title = {Tracking objects in video using motion and appearance models}, booktitle = {Image Processing, 2005. ICIP 2005. IEEE International Conference on}, volume = {2}, year = {2005}, month = {2005/09//}, pages = {II - 394-7 - II - 394-7}, abstract = {This paper proposes a visual tracking algorithm that combines motion and appearance in a statistical framework. It is assumed that image observations are generated simultaneously from a background model and a target appearance model. This is different from conventional appearance-based tracking, that does not use motion information. The proposed algorithm attempts to maximize the likelihood ratio of the tracked region, derived from appearance and background models. Incorporation of motion in appearance based tracking provides robust tracking, even when the target violates the appearance model. We show that the proposed algorithm performs well in tracking targets efficiently over long time intervals.}, keywords = {algorithm;, analysis;, appearance, background, estimation;, image, likelihood, maximum, model;, models;, MOTION, object, processing;, signal, target, tracking, tracking;, video, visual}, doi = {10.1109/ICIP.2005.1530075}, author = {Sankaranarayanan,A. C and Chellapa, Rama and Qinfen Zheng} } @article {14072, title = {Transcriptional profiling of the hyperthermophilic methanarchaeon Methanococcus jannaschii in response to lethal heat and non-lethal cold shock}, journal = {Environmental Microbiology}, volume = {7}, year = {2005}, month = {2005/06/01/}, pages = {789 - 797}, abstract = {Temperature shock of the hyperthermophilic methanarchaeon Methanococcus jannaschii from its optimal growth temperature of 85{\textdegree}C to 65{\textdegree}C and 95{\textdegree}C resulted in different transcriptional responses characteristic of both the direction of shock (heat or cold shock) and whether the shock was lethal. Specific outcomes of lethal heat shock to 95{\textdegree}C included upregulation of genes encoding chaperones, and downregulation of genes encoding subunits of the H+ transporting ATP synthase. A gene encoding an α subunit of a putative prefoldin was also upregulated, which may comprise a novel element in the protein processing pathway in M. jannaschii. Very different responses were observed upon cold shock to 65{\textdegree}C. These included upregulation of a gene encoding an RNA helicase and other genes involved in transcription and translation, and upregulation of genes coding for proteases and transport proteins. Also upregulated was a gene that codes for an 18~kDa FKBP-type PPIase, which may facilitate protein folding at low temperatures. Transcriptional profiling also revealed several hypothetical proteins that respond to temperature stress conditions.}, isbn = {1462-2920}, doi = {10.1111/j.1462-2920.2005.00751.x}, url = {http://onlinelibrary.wiley.com/doi/10.1111/j.1462-2920.2005.00751.x/abstract}, author = {Boonyaratanakornkit,Boonchai B and Simpson,Anjana J. and Whitehead,Timothy A and Fraser,Claire M. and El-Sayed, Najib M. and Clark,Douglas S} } @conference {17444, title = {Turning information visualization innovations into commercial products: lessons to guide the next success}, booktitle = {IEEE Symposium on Information Visualization, 2005. INFOVIS 2005}, year = {2005}, month = {2005/10/23/25}, pages = {241 - 244}, publisher = {IEEE}, organization = {IEEE}, abstract = {As information visualization matures as an academic research field, commercial spinoffs are proliferating, but success stories are harder to find. This is the normal process of emergence for new technologies, but the panel organizers believe that there are certain strategies that facilitate success. To teach these lessons, we have invited several key figures who are seeking to commercialize information visualization tools. The panelists make short presentations, engage in a moderated discussion, and respond to audience questions.}, keywords = {Books, commercial development, commercial product, Computer interfaces, Computer science, data visualisation, Data visualization, Educational institutions, exploratory data analysis, information visualization innovation, information visualization tool, innovation management, Laboratories, Management training, new technology emergence, Technological innovation, technology transfer, Turning, User interfaces}, isbn = {0-7803-9464-X}, doi = {10.1109/INFVIS.2005.1532153}, author = {Shneiderman, Ben and Rao,R. and Andrews,K. and Ahlberg,C. and Brodbeck,D. and Jewitt,T. and Mackinlay,J.} } @article {14403, title = {Tutorial on statistical relational learning}, journal = {Inductive Logic Programming}, year = {2005}, month = {2005///}, pages = {415 - 415}, abstract = {Statistical machine learning is in the midst of a {\textquotedblleft}relational revolution{\textquotedblright}. After many decades of focusing on independent and identically-distributed (iid) examples, many researchers are now studying problems in which the examples are linked together into complex networks. These networks ca be a simple as sequences and 2-D meshes (such as those arising in part-of-speech tagging and remote sensing) or as complex as citation graphs, the world wide web, and relational data bases.Statistical relational learning raises many new challenges and opportunities. Because the statistical model depends on the domain{\textquoteright}s relational structure, parameters in the model are often tied. This has advantages for making parameter estimation feasible, but complicates the model search. Because the {\textquotedblleft}features{\textquotedblright} involve relationships among multiple objects, there is often a need to intelligently construct aggregates and other relational features. Problems that arise from linkage and autocorrelation among objects must be taken into account. Because instances are linked together, classification typically involves complex inference to arrive at {\textquotedblleft}collective classification{\textquotedblright} in which the labels predicted for the test instances are determined jointly rather than individually. Unlike iid problems, where the result of learning is a single classifier, relational learning often involves instances that are heterogeneous, where the result of learning is a set of multiple components (classifiers, probability distributions, etc.) that predict labels of objects and logical relationships between objects. }, doi = {10.1007/11536314_26}, author = {Getoor, Lise} } @article {15098, title = {Two-server password-only authenticated key exchange}, journal = {Applied Cryptography and Network Security}, year = {2005}, month = {2005///}, pages = {175 - 206}, abstract = {Typical protocols for password-based authentication assume a single server which stores all the information (e.g.), the password necessary to authenticate a user. Unfortunately, an inherent limitation of this approach (assuming low-entropy passwords are used) is that the user{\textquoteright}s password is exposed if this server is ever compromised. To address this issue, a number of schemes have been proposed in which a user{\textquoteright}s password information is shared among multiple servers, and these servers cooperate in a threshold manner when the user wants to authenticate.We show here a two-server protocol for this task assuming public parameters available to everyone in the system (as well as the adversary). Ours is the first provably-secure two-server protocol for the important password-only setting (in which the user need remember only a password, and not the servers{\textquoteright} public keys), and is the first two-server protocol (in any setting) with a proof of security in the standard model. }, doi = {10.1007/11496137_1}, author = {Katz, Jonathan and MacKenzie,P. and Taban,G. and Gligor,V.} } @article {19581, title = {A Type and Effect System for Flexible Abstract Interpretation of Java: (Extended Abstract)}, journal = {Electronic Notes in Theoretical Computer Science}, volume = {131}, year = {2005}, month = {2005/05/24/}, pages = {111 - 124}, abstract = {This paper describes a flexible type and effect inference system for Featherweight Java (FJ). The effect terms generated by static type and effect inference embody the abstract interpretation of pro- gram event sequences. Flexibility in the analysis is obtained by post-processing of inferred effects, allowing a modular adaptation to extensions of the language. Several example transformations are discussed, including how inferred effects can be transformed to reflect the impact of exceptions on FJ control flow.}, keywords = {language security, object oriented languages, Type analysis}, isbn = {1571-0661}, url = {http://www.sciencedirect.com/science/article/pii/S1571066105002628}, author = {Skalka, Christian and Smith, Scott and David Van Horn} } @inbook {12944, title = {A Tangled Bank: Reflections on the Tree of Life and Human Health}, booktitle = {Assembling the Tree of LifeAssembling the Tree of Life}, year = {2004}, month = {2004///}, pages = {18 - 18}, publisher = {Oxford University Press}, organization = {Oxford University Press}, isbn = {9780195172348}, author = {Rita R Colwell} } @article {16480, title = {Techniques for optimization of queries on integrated biological resources}, journal = {Journal of bioinformatics and computational biology}, volume = {2}, year = {2004}, month = {2004///}, pages = {375 - 412}, author = {Lacroix,Z. and Raschid, Louiqa and Eckman,B. A} } @conference {15036, title = {Temporal range exploration of large scale multidimensional time series data}, booktitle = {Proceedings of SSDBM}, year = {2004}, month = {2004///}, pages = {95 - 106}, abstract = {We consider the problem of querying largescale multidimensional time series data to discover events of interest, test and validate hypotheses, or to associate temporal patterns with specific events. This type of data currently dominate most other types of available data, and will very likely become even more prevalent in the future given the current trends in collecting time series of business, scientific, demographic, and simulation data. The ability to explore such collections interactively, even at a coarse level, will be critical in discovering the information and knowledge embedded in such collections. We develop indexing techniques and search algorithms to efficiently handle temporal range value querying of multidimensional time series data. Our indexing uses linear space data structures that enable the handling of queries in I/O time that is essentially the same as that of handling a single time slice, assuming the availability of a logarithmic number of processors as a function of size of the temporal window. A data structure with provably good bounds is also presented for the case when the number of multidimensional objects is relatively small. These techniques improve significantly over standard techniques for either serial or parallel processing, and are evaluated by extensive experimental results that confirm their superior performance. }, author = {JaJa, Joseph F. and Kim,J. and Wang,Q.} } @article {16566, title = {Temporally asymmetric learning supports sequence processing in multi-winner self-organizing maps}, journal = {Neural Computation}, volume = {16}, year = {2004}, month = {2004///}, pages = {535 - 561}, author = {Schulz,R. and Reggia, James A.} } @conference {17891, title = {Time and space optimization for processing groups of multi-dimensional scientific queries}, booktitle = {Proceedings of the 18th annual international conference on Supercomputing}, series = {ICS {\textquoteright}04}, year = {2004}, month = {2004///}, pages = {95 - 105}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Data analysis applications in areas as diverse as remote sensing and telepathology require operating on and processing very large datasets. For such applications to execute efficiently, careful attention must be paid to the storage, retrieval, and manipulation of the datasets. This paper addresses the optimizations performed by a high performance database system that processes groups of data analysis requests for these applications, which we call queries. The system performs end-to-end processing of the requests, formulated as PostgreSQL declarative queries. The queries are converted into imperative descriptions, multiple imperative descriptions are merged into a single execution plan, the plan is optimized to decrease execution time via common compiler optimization techniques, and, finally, the plan is optimized to decrease memory consumption. The last two steps are experimentally shown to effectively reduc the amount of time required while conserving memory space as a group of queries is processed by the database.}, keywords = {multi-query optimization, Scientific databases}, isbn = {1-58113-839-3}, doi = {10.1145/1006209.1006224}, url = {http://doi.acm.org/10.1145/1006209.1006224}, author = {Aryangat,Suresh and Andrade,Henrique and Sussman, Alan} } @article {14048, title = {TM Electromagnetic Scattering from 2D Multilayered Dielectric Bodies-Numerical Solution}, journal = {Applied Computational Electromagnetics Society journal}, year = {2004}, month = {2004///}, pages = {100 - 107}, abstract = {An integral equation approach is derived for an electromagnetic scattering from an M arbitrary multilayereddielectric domain. The integral equation is valid for the 2D and 3D Helmholtz equation. Here we show the numerical solution for the 2D case by using the Nystr{\"o}m method. For validating the method we develop a mode matching method for the case when the domains are multilayered circular cylinders and give numerical results for illustrating the algorithm. }, author = {Duraiswami, Ramani and Seydou,F. and Gumerov, Nail A.} } @article {12169, title = {Toolkit design for interactive structured graphics}, journal = {Software Engineering, IEEE Transactions on}, volume = {30}, year = {2004}, month = {2004///}, pages = {535 - 546}, author = {Bederson, Benjamin B. and Grosjean,J. and Meyer,J.} } @article {13909, title = {Tools for children to create physical interactive storyrooms}, journal = {Computers in Entertainment (CIE)}, volume = {2}, year = {2004}, month = {2004///}, pages = {12 - 12}, author = {Montemayor,J. and Druin, Allison and Chipman,G. and Farber,A. and Guha,M.L.} } @conference {17801, title = {TOSS: an extension of TAX with ontologies and similarity queries}, booktitle = {Proceedings of the 2004 ACM SIGMOD international conference on Management of data}, series = {SIGMOD {\textquoteright}04}, year = {2004}, month = {2004///}, pages = {719 - 730}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {TAX is perhaps the best known extension of the relational algebra to handle queries to XML databases. One problem with TAX (as with many existing relational DBMSs) is that the semantics of terms in a TAX DB are not taken into account when answering queries. Thus, even though TAX answers queries with 100\% precision, the recall of TAX is relatively low. Our TOSS system improves the recall of TAX via the concept of a similarity enhanced ontology (SEO). Intuitively, an ontology is a set of graphs describing relationships (such as isa, partof, etc.) between terms in a DB. An SEO also evaluates how similarities between terms (e.g. "J. Ullman", "Jeff Ullman", and "Jeffrey Ullman") affect ontologies. Finally, we show how the algebra proposed in TAX can be extended to take SEOs into account. The result is a system that provides a much higher answer quality than TAX does alone (quality is defined as the square root of the product of precision and recall). We experimentally evaluate the TOSS system on the DBLP and SIGMOD bibliographic databases and show that TOSS has acceptable performance.}, keywords = {ontologies, semantic integration of heterogeneous data, similarity enhancement, XML databases}, isbn = {1-58113-859-8}, doi = {10.1145/1007568.1007649}, url = {http://doi.acm.org/10.1145/1007568.1007649}, author = {Hung,Edward and Deng,Yu and V.S. Subrahmanian} } @conference {15877, title = {Transforming access to the spoken word}, booktitle = {Proceedings of the International Symposium on Large-scale Knowledge Resources}, year = {2004}, month = {2004///}, pages = {57 - 59}, author = {Oard, Douglas} } @conference {14749, title = {Transparent proxies for java futures}, booktitle = {Proceedings of the 19th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications}, series = {OOPSLA {\textquoteright}04}, year = {2004}, month = {2004///}, pages = {206 - 223}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {A proxy object is a surrogate or placeholder that controls access to another target object. Proxies can be used to support distributed programming, lazy or parallel evaluation, access control, and other simple forms of behavioral reflection. However, wrapper proxies (like futures or suspensions> for yet-to-be-computed results) can require significant code changes to be used in statically-typed languages, while proxies more generally can inadvertently violate assumptions of transparency, resulting in subtle bugs. To solve these problems, we have designed and implemented a simple framework for proxy programming that employs a static analysis based on qualifier inference, but with additional novelties. Code for using wrapper proxies is automatically introduced via a classfile-to-classfile transformation, and potential violations of transparency are signaled to the programmer. We have formalized our analysis and proven it sound. Our framework has a variety of applications, including support for asynchronous method calls returning futures. Experimental results demonstrate the benefits of our framework: programmers are relieved of managing and/or checking proxy usage, analysis times are reasonably fast, overheads introduced by added dynamic checks are negligible, and performance improvements can be significant. For example, changing two lines in a simple RMI-based peer-to-peer application and then using our framework resulted in a large performance gain.}, keywords = {future, java, proxy, Type inference, type qualifier}, isbn = {1-58113-831-8}, doi = {10.1145/1028976.1028994}, url = {http://doi.acm.org/10.1145/1028976.1028994}, author = {Pratikakis,Polyvios and Spacco,Jaime and Hicks, Michael W.} } @conference {13039, title = {A tree-position kernel for document compression}, booktitle = {Proceedings of the Fourth Document Understanding Conference (DUC 2004)}, year = {2004}, month = {2004///}, pages = {6 - 7}, author = {Daum{\'e}, Hal and Marcu,D.} } @conference {12289, title = {Trust-preserving set operations}, booktitle = {INFOCOM 2004. Twenty-third AnnualJoint Conference of the IEEE Computer and Communications Societies}, volume = {4}, year = {2004}, month = {2004/03//}, pages = {2231 - 2241 vol.4 - 2231 - 2241 vol.4}, abstract = {We describe a method for performing trust-preserving set operations by untrusted parties. Our motivation for this is the problem of securely reusing content-based search results in peer-to-peer networks. We model search results and indexes as data sets. Such sets have value for answering a new query only if they are trusted. In the absence of any system-wide security mechanism, a data set is trusted by a node a only if it was generated by some node which is trusted by a. Our main contributions are a formal definition of the problem as well as an efficient scheme that solves this problem by allowing untrusted peers to perform set operations on trusted data sets while also producing unforgeable proofs of correctness. This is accomplished by requiring trusted nodes to sign appropriately-defined digests of generated sets; each such digest consists of an RSA accumulator and a Bloom filter. The scheme is general, and has other applications as well. We give an analysis demonstrating the low overhead of the scheme, and we include experimental data which confirm the analysis.}, keywords = {accumulator;, Bloom, computing;, filter;, mechanism;, network;, operation;, peer-to-peer, RSA, Security, security;, set, system-wide, Telecommunication, theory;, trust-preserving}, doi = {10.1109/INFCOM.2004.1354646}, author = {Morselli,R. and Bhattacharjee, Bobby and Katz, Jonathan and Keleher,P.} } @article {13657, title = {Tagging and Parsing of Bilingual Dictionary}, volume = {LAMP-TR-106,CFAR-TR-991,CS-TR-4529,UMIACS-TR-2003-97}, year = {2003}, month = {2003/09//}, institution = {University of Maryland, College Park}, abstract = {Bilingual dictionaries hold great potential as a source of lexical resources for training and testing automated systems for optical character recognition, machine translation, and cross-language information retrieval. In this paper, we describe a system for extracting term lexicons from printed bilingual dictionaries. Our work was divided into three phases - dictionary segmentation, entry tagging, and generation. In segmentation, pages are divided into logical entries based on structural features learned from selected examples. The extracted entries are associated with functional labels and passed to a tagging module which associates linguistic labels with each word or phrase in the entry. The output of the system is a structure that represents the entries from the dictionary. We have used this approach to parse a variety of dictionaries with both Latin and non-Latin alphabets, and demonstrate the results of term lexicon generation for retrieval from a collection of French news stories using English queries.}, author = {Ma,Huanfeng and Karagol-Ayan,Burcu and David Doermann and Oard, Douglas and Wang,Jianqiang} } @article {13470, title = {Team formation in complex networks}, journal = {Proceedings of the 1st NAACSOS Conference}, year = {2003}, month = {2003///}, abstract = {The concept of team formation, or joint action, is central to a wide variety of disciplines includingorganizational design, computational organization theory, planning and learning in multi-agent systems, and distributed artificial intelligence. One key feature of team formation is the under- lying social network topology which determines the direct interactions among the individuals of the organization. Traditional models of social phenomena have been restricted to regular lattice, or fully-connected, network topologies, but recent results have shown that real-world networks have much different and much richer structure. Using a simple agent-based computational model of team formation, various virtual experiments are conducted to examine the impact of complex network structures on the dynamics of team formation. }, author = {Gaston,M. and desJardins, Marie} } @article {18505, title = {Techniques for interdomain traffic engineering}, journal = {Computer Communications Review}, volume = {33}, year = {2003}, month = {2003///}, abstract = {Network operators must have control over the flow of traffic into,out of, and across their networks. However, the Border Gateway Protocol (BGP) does not facilitate common traffic engineering tasks, such as balancing load across multiple links to a neighboring AS or directing traffic to a different neighbor. Solving these problems is difficult because the number of possible changes to routing policies is too large to exhaustively test all possibilities, some changes in routing policy can have an unpredictable effect on the flow of traf- fic, and the BGP decision process implemented by router vendors limits an operator{\textquoteright}s control over path selection. We analyze routing and traffic data from the AT\&T backbone to identify ways to use BGP policy for traffic engineering tasks. First, we show how cer- tain BGP policy changes can move traffic in a predictable fashion, despite limited knowledge about the routing policies in neighboring AS{\textquoteright}s. Then, we show how operators can gain greater flexibility by relaxing some steps in the BGP decision process and ensuring that neighboring AS{\textquoteright}s send consistent advertisements at each peering location. Finally, we show that an operator can manipulate traffic efficiently by changing the routes for a small number of prefixes (or groups of related prefixes) that consistently receive a large amount of traffic. These results can help operators accomplish common traffic engineering tasks using existing BGP features. }, author = {Feamster, Nick and Borkenhagen,J. and Rexford,J.} } @conference {16139, title = {Technology probes: inspiring design for and with families}, booktitle = {Proceedings of the SIGCHI conference on Human factors in computing systems}, series = {CHI {\textquoteright}03}, year = {2003}, month = {2003///}, pages = {17 - 24}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {We describe a new method for use in the process of co-designing technologies with users called technology probes. Technology probes are simple, flexible, adaptable technologies with three interdisciplinary goals: the social science goal of understanding the needs and desires of users in a real-world setting, the engineering goal of field-testing the technology, and the design goal of inspiring users and researchers to think about new technologies. We present the results of designing and deploying two technology probes, the messageProbe and the videoProbe, with diverse families in France, Sweden, and the U.S. We conclude with our plans for creating new technologies for and with families based on our experiences.}, keywords = {computer mediated communication, ethnography, Home, participatory design and cooperative design}, isbn = {1-58113-630-7}, doi = {10.1145/642611.642616}, url = {http://doi.acm.org/10.1145/642611.642616}, author = {Hutchinson,Hilary and Mackay,Wendy and Westerlund,Bo and Bederson, Benjamin B. and Druin, Allison and Plaisant, Catherine and Beaudouin-Lafon,Michel and Conversy,St{\'e}phane and Evans,Helen and Hansen,Heiko and Roussel,Nicolas and Eiderb{\"a}ck,Bj{\"o}rn} } @article {13344, title = {TelegraphCQ: An architectural status report}, journal = {IEEE Data Engineering Bulletin}, volume = {26}, year = {2003}, month = {2003///}, pages = {11 - 18}, author = {Krishnamurthy, S. and Chandrasekaran,S. and Cooper,O. and Deshpande, Amol and Franklin,M.J. and Hellerstein,J. M and Hong,W. and Madden,S. and Reiss,F. and Shah,M. A} } @conference {13405, title = {TelegraphCQ: continuous dataflow processing}, booktitle = {Proceedings of the 2003 ACM SIGMOD international conference on Management of data}, series = {SIGMOD {\textquoteright}03}, year = {2003}, month = {2003///}, pages = {668 - 668}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, isbn = {1-58113-634-X}, doi = {10.1145/872757.872857}, url = {http://doi.acm.org/10.1145/872757.872857}, author = {Chandrasekaran,Sirish and Cooper,Owen and Deshpande, Amol and Franklin,Michael J. and Hellerstein,Joseph M. and Wei Hong and Krishnamurthy,Sailesh and Madden,Samuel R. and Reiss,Fred and Shah,Mehul A.} } @article {17809, title = {Temporal probabilistic object bases}, journal = {Knowledge and Data Engineering, IEEE Transactions on}, volume = {15}, year = {2003}, month = {2003/08//july}, pages = {921 - 939}, abstract = {There are numerous applications where we have to deal with temporal uncertainty associated with objects. The ability to automatically store and manipulate time, probabilities, and objects is important. We propose a data model and algebra for temporal probabilistic object bases (TPOBs), which allows us to specify the probability with which an event occurs at a given time point. In explicit TPOB-instances, the sets of time points along with their probability intervals are explicitly enumerated. In implicit TPOB-instances, sets of time points are expressed by constraints and their probability intervals by probability distribution functions. Thus, implicit object base instances are succinct representations of explicit ones; they allow for an efficient implementation of algebraic operations, while their explicit counterparts make defining algebraic operations easy. We extend the relational algebra to both explicit and implicit instances and prove that the operations on implicit instances correctly implement their counterpart on explicit instances.}, keywords = {algebra;, algebraic, bases;, constraints;, data, database, database;, databases;, distribution, explicit, functions;, handling;, implicit, instances;, integrity;, intervals;, management;, model;, models;, object, object-oriented, operations;, probabilistic, probability, probability;, relational, temporal, theory;, Uncertainty, uncertainty;}, isbn = {1041-4347}, doi = {10.1109/TKDE.2003.1209009}, author = {Biazzo,V. and Giugno,R. and Lukasiewicz,T. and V.S. Subrahmanian} } @conference {13666, title = {Text Identification in Noisy Document Images Using Markov Random Field}, booktitle = {ICDAR}, year = {2003}, month = {2003///}, pages = {599 - 603}, author = {Zheng,Y. and Li,H. and David Doermann} } @article {17427, title = {Theories for Understanding Information Visualization}, journal = {The craft of information visualization: readings and reflections}, year = {2003}, month = {2003///}, pages = {349 - 349}, author = {Shneiderman, Ben} } @conference {14052, title = {Three dimensional acoustic scattering from an M multilayered domain via an integral equation approach}, booktitle = {Antennas and Propagation Society International Symposium, 2003. IEEE}, volume = {1}, year = {2003}, month = {2003/06//}, pages = {669 - 672 vol.1 - 669 - 672 vol.1}, abstract = {An integral equation approach is derived for three dimensional acoustic scattering from an M multilayered domain. The integral equation is solved using the collocation method. To validate the method, we compare the exact and approximate results. The numerous matrix vector multiplications of our method may be thought a disadvantage. This problem can be overcome by using fast multiple methods where these operations are done very quickly.}, keywords = {acoustic, collocation, dimensional, domain;, equation;, equations;, fast, inhomogeneous, integral, matrix, media;, method;, methods;, multilayered, multilayers;, multiple, multiplication;, multiplications;, scattering;, three, vector, wave}, doi = {10.1109/APS.2003.1217547}, author = {Seydou,F. and Duraiswami, Ramani and Seppanen,T.} } @inbook {18603, title = {Thwarting Web Censorship with Untrusted Messenger Discovery}, booktitle = {Privacy Enhancing TechnologiesPrivacy Enhancing Technologies}, series = {Lecture Notes in Computer Science}, volume = {2760}, year = {2003}, month = {2003///}, pages = {125 - 140}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {All existing anti-censorship systems for the Web rely on proxies to grant clients access to censored information. Therefore, they face the proxy discovery problem : how can clients discover the proxies without having the censor discover and block these proxies? To avoid widespread discovery and blocking, proxies must not be widely published and should be discovered in-band. In this paper, we present a proxy discovery mechanism called keyspace hopping that meets this goal. Similar in spirit to frequency hopping in wireless networks, keyspace hopping ensures that each client discovers only a small fraction of the total number of proxies. However, requiring clients to independently discover proxies from a large set makes it practically impossible to verify the trustworthiness of every proxy and creates the possibility of having untrusted proxies. To address this, we propose separating the proxy into two distinct components{\textemdash}the messenger , which the client discovers using keyspace hopping and which simply acts as a gateway to the Internet; and the portal , whose identity is widely-published and whose responsibility it is to interpret and serve the client{\textquoteright}s requests for censored content. We show how this separation, as well as in-band proxy discovery, can be applied to a variety of anti-censorship systems.}, keywords = {Computer science}, isbn = {978-3-540-20610-1}, url = {http://www.springerlink.com/content/1gg8p94deqek968t/abstract/}, author = {Feamster, Nick and Balazinska,Magdalena and Wang,Winston and Balakrishnan,Hari and Karger,David}, editor = {Dingledine,Roger} } @article {13337, title = {Topological analysis and characterization of discrete scalar fields}, journal = {Geometry, Morphology, and Computational Imaging}, year = {2003}, month = {2003///}, pages = {65 - 85}, abstract = {In this paper, we address the problem of analyzing the topology of discrete scalar fields defined on triangulated domains. To this aim, we introduce the notions of discrete gradient vector field and of Smalelike decomposition for the domain of a d-dimensional scalar field. We use such notions to extract the most relevant features representing the topology of the field. We describe a decomposition algorithm, which is independent of the dimension of the scalar field, and, based on it, methods for extracting the critical net of a scalar field. A complete classification of the critical points of a 2-dimensional field that corresponds to a piecewise differentiable field is also presented.}, doi = {10.1007/3-540-36586-9_25}, author = {Danovaro,E. and De Floriani, Leila and Mesmoudi,M.} } @conference {16133, title = {Toward a statistical knowledge network}, booktitle = {Proceedings of the 2003 annual national conference on Digital government research}, series = {dg.o {\textquoteright}03}, year = {2003}, month = {2003///}, pages = {1 - 6}, publisher = {Digital Government Society of North America}, organization = {Digital Government Society of North America}, abstract = {This paper describes an architecture for a statistical knowledge network that depends on user interfaces as the glue among the components. These interfaces aim to serve non-expert users with diverse needs and statistical and computing experiences. Such interfaces are crucially dependent on different indexing schemes and good metadata.}, url = {http://dl.acm.org/citation.cfm?id=1123196.1123312}, author = {Marchionini,Gary and Haas,Stephanie and Plaisant, Catherine and Shneiderman, Ben and Hert,Carol} } @conference {15096, title = {Toward secure key distribution in truly ad-hoc networks}, booktitle = {Applications and the Internet Workshops, 2003. Proceedings. 2003 Symposium on}, year = {2003}, month = {2003/01//}, pages = {342 - 346}, abstract = {Ad-hoc networks - and in particular wireless mobile ad-hoc networks $have unique characteristics and constraints that make traditional cryptographic mechanisms and assumptions inappropriate. In particular it may not be warranted to assume pre-existing shared secrets between members of the network or the presence of a common PKI. Thus, the issue of key distribution in ad-hoc networks represents an important problem. Unfortunately, this issue has been largely ignored; as an example, most protocols for secure ad-hoc routing assume that key distribution has already taken place. Traditional key distribution schemes either do not apply in an ad-hoc scenario or are not efficient enough for small, resource-constrained devices. We propose to combine efficient techniques from identity-based (ID-based) and threshold cryptography to provide a mechanism that enables flexible and efficient key distribution while respecting the constraints of ad-hoc networks. We also discuss the available mechanisms and their suitability for the proposed task.}, keywords = {ad, ad-hoc, cryptography;, distribution;, hoc, identity-based, key, mobile, network, networks;, routing;, secure, security;, Telecommunication, threshold, wireless}, doi = {10.1109/SAINTW.2003.1210183}, author = {Khalili,A. and Katz, Jonathan and Arbaugh, William A.} } @article {18022, title = {Towards a first vertical prototyping of an extremely fine-grained parallel programming approach}, journal = {Theory of Computing Systems}, volume = {36}, year = {2003}, month = {2003///}, pages = {521 - 552}, abstract = {Explicit multithreading (XMT) is a parallel programming approach for exploiting on-chip parallelism. XMT introduces a computational framework with (1) a simple programming style that relies on fine-grained PRAM-style algorithms; (2) hardware support for low-overhead parallel threads, scalable load balancing, and efficient synchronization. The missing link between the algorithmic-programming level and the architecture level is provided by the first prototype XMT compiler. This paper also takes this new opportunity to evaluate the overall effectiveness of the interaction between the programming model and the hardware, and enhance its performance where needed, incorporating new optimizations into the XMT compiler. We present a wide range of applications, which written in XMT obtain significant speedups relative to the best serial programs. We show that XMT is especially useful for more advanced applications with dynamic, irregular access patterns, where for regular computations we demonstrate performance gains that scale up to much higher levels than have been demonstrated before for on-chip systems.}, author = {Naishlos,D. and Nuzman,J. and Tseng,C. W and Vishkin, Uzi} } @article {18606, title = {Towards a logic for wide-area Internet routing}, journal = {SIGCOMM Comput. Commun. Rev.}, volume = {33}, year = {2003}, month = {2003/08//}, pages = {289 - 300}, abstract = {Interdomain routing is a massive distributed computing task that propagates topological information for global reachability. Today{\textquoteright}s interdomain routing protocol, BGP4, is exceedingly complex because the wide variety of goals that it must meet---including fast convergence, failure resilience, scalability, policy expression, and global reachability---are accomplished by mechanisms that have complicated interactions and unintended side effects. The complexity of wide-area routing configuration and protocol dynamics requires mechanisms for expressing wide-area routing that adhere to a set of logical rules. We propose a set of rules, called the routing logic, which can be used to determine whether a routing protocol satisfies various properties. We demonstrate how this logic can aid in analyzing the behavior of BGP4 under various configurations. We also speculate on how the logic can be used to analyze existing configuration in real-world networks, synthesize network-wide router configuration from a high-level policy language, and assist protocol designers in reasoning about new routing protocols.}, isbn = {0146-4833}, doi = {10.1145/972426.944767}, url = {http://doi.acm.org/10.1145/972426.944767}, author = {Feamster, Nick and Balakrishnan,Hari} } @conference {12728, title = {Towards a view invariant gait recognition algorithm}, booktitle = {Proceedings. IEEE Conference on Advanced Video and Signal Based Surveillance, 2003.}, year = {2003}, month = {2003/07//}, pages = {143 - 150}, abstract = {Human gait is a spatio-temporal phenomenon and typifies the motion characteristics of an individual. The gait of a person is easily recognizable when extracted from a side-view of the person. Accordingly, gait-recognition algorithms work best when presented with images where the person walks parallel to the camera image plane. However, it is not realistic to expect this assumption to be valid in most real-life scenarios. Hence, it is important to develop methods whereby the side-view can be generated from any other arbitrary view in a simple, yet accurate, manner. This is the main theme of the paper. We show that if the person is far enough from the camera, it is possible to synthesize a side view (referred to as canonical view) from any other arbitrary view using a single camera. Two methods are proposed for doing this: (i) using the perspective projection model; (ii) using the optical flow based structure from motion equations. A simple camera calibration scheme for this method is also proposed. Examples of synthesized views are presented. Preliminary testing with gait recognition algorithms gives encouraging results. A by-product of this method is a simple algorithm for synthesizing novel views of a planar scene.}, keywords = {(access, algorithm;, analysis;, Biometrics, biometrics;, Calibration, calibration;, camera, canonical, control);, equations;, flow;, Gait, gait;, human, image, invariant, model;, MOTION, optical, perspective, phenomenon;, projection, recognition, scheme;, sequences;, spatio-temporal, view, view;}, doi = {10.1109/AVSS.2003.1217914}, author = {Kale, A. and Chowdhury, A.K.R. and Chellapa, Rama} } @conference {15930, title = {Towards domain-independent, task-oriented, conversational adequacy}, booktitle = {INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE}, volume = {18}, year = {2003}, month = {2003///}, pages = {1637 - 1638}, author = {Josyula,D. P and Anderson,M. L and Perlis, Don} } @conference {12840, title = {Towards formal but flexible scenarios}, booktitle = {2nd International Workshop on Scenarios and State Machines: Models, Algorithms and Tools}, year = {2003}, month = {2003///}, author = {Sengupta,B. and Cleaveland, Rance} } @conference {19509, title = {Towards On-chip Fault-tolerant Communication}, booktitle = {ASP-DAC {\textquoteright}03 Proceedings of the 2003 Asia and South Pacific Design Automation Conference}, series = {ASP-DAC {\textquoteright}03}, year = {2003}, month = {2003///}, pages = {225 - 232}, publisher = {ACM}, organization = {ACM}, abstract = {As CMOS technology scales down into the deep-submicron (DSM) domain, devices and interconnects are subject to new types of malfunctions and failures that are harder to predict and avoid with the current system-on-chip (SoC) design methodologies. Relaxing the requirement of 100\% correctness in operation drastically reduces the costs of design but, at the same time, requires SoCs be designed with some degree of system-level fault-tolerance. In this paper, we introduce a high-level model of DSM failure patterns and propose a new communication paradigm for SoCs, namely stochastic communication. Specifically, for a generic tile-based architecture, we propose a randomized algorithm which not only separates computation from communication, but also provides the required fault-tolerance to on-chip failures. This new technique is easy and cheap to implement in SoCs that integrate a large number of communicating IP cores.}, isbn = {0-7803-7660-9}, url = {http://doi.acm.org/10.1145/1119772.1119817}, author = {Tudor Dumitras and Kerner, Sam and M\uarculescu, Radu} } @conference {14059, title = {Tracking a moving speaker using excitation source information}, booktitle = {Eighth European Conference on Speech Communication and Technology}, year = {2003}, month = {2003///}, abstract = {Microphone arrays are widely used to detect, locate, and track a stationary or moving speaker. The first step is to estimate the time delay, between the speech signals received by a pair of microphones. Conventional methods like generalized cross-correlation are based on the spectral content of the vocal tract system in the speech signal. The spectral content of the speech signal is affected due to degradations in the speech signal caused by noise and reverberation. However, features corresponding to the excitation source of speech are less affected by such degradations. This paper proposes a novel method to estimate the time delays using the excitation source information in speech. The estimated delays are used to get the position of the moving speaker. The proposed method is compared with the spectrum-based approach using real data from a microphone array setup.}, author = {Raykar,V.C. and Duraiswami, Ramani and Yegnanarayana,B. and Prasanna,S. R.M} } @article {14645, title = {Transcriptional regulation of protein complexes and biological pathways}, journal = {Mammalian Genome}, volume = {14}, year = {2003}, month = {2003///}, pages = {611 - 619}, abstract = {The cis-element profile (or cis-profile) of a gene refers to the collection of transcription factor binding sites (TFBS) regulating the transcription of the gene. Underlying the various published studies that attempt to discover cis-elements in the vicinity of co-expressed genes via pattern detection algorithms, there is an implicit assumption that a correlation exists between co-expressed genes and their cis-profiles. In this study, we show that the cis-similarity, defined as the proportion of shared TFBS between two cis-element profiles, is higher for functionally linked interacting proteins as well as for members of a signal transduction pathway. A similar analysis of the enzymes catalyzing the conversion of adjacent substrates to products in a collection of metabolic pathways, did not reveal higher cis-similarity. The analysis is based on three distinct sources of publicly available data, namely, 1) the BIND database of interacting proteins, 2) known interactions in NMDAR protein complex, 3) the apoptosis pathway and nine pathways related to metabolism of cofactors and vitamins all from KEGG. Additionally, we analyze the cis-element profiles of all the genes in the glutamate receptor (GR) sub-complex of NMDAR complex to detect a set of cis-elements that occur adjacent to a majority of the genes. We show that most of the corresponding transcription factors are known to be involved in GR regulation by comparing our findings with the published biomedical literature. In addition, we were able to detect transcripts whose gene products associate with GR by searching for transcripts that share the same regulatory signals as those detected for GR. This suggests a novel computational methodology for constructing high-order gene regulatory models and detecting co-regulated gene products.}, isbn = {0938-8990}, url = {http://dx.doi.org/10.1007/s00335-002-2260-x}, author = {Hannenhalli, Sridhar and Levy,Samuel} } @conference {12839, title = {TRIM: A tool for triggered message sequence charts}, booktitle = {Computer Aided Verification}, year = {2003}, month = {2003///}, pages = {106 - 109}, author = {Sengupta,B. and Cleaveland, Rance} } @article {14057, title = {Two methods for solving a 3D acoustic inverse scattering problem}, journal = {The Journal of the Acoustical Society of America}, volume = {113}, year = {2003}, month = {2003///}, pages = {2191 - 2191}, abstract = {We consider the problem of finding the refractive index of a buried object by using far-field measurements in an inhomogeneous medium. We describe two methods for solving the inverse problem. Both methods are implemented in two steps in order to better deal with the ill-posedness of the problem. In the first method an integral equation of the first kind is derived for the far-field operator which is solved via least-squares and Tikhonov regularization. We then use the solution of the integral equation to derive an over-posed boundary value problem, i.e., the Helmholtz equation in a bounded domain with Cauchy data on the boundary. The index that satisfies this over-posed problem most closely is obtained via the Levenberg{\textendash}Marquardt algorithm. The second method is an iterative method and is based on the Lippmann{\textendash}Schwinger equation. It is implemented via the Newton method. The first step consists, as for the other method. Here we use a Fourier integral approach and regularization via discretization. The second step is to obtain the index by iterating the Lippmann{\textendash}Schwinger equation starting with the Born approximation.}, url = {http://link.aip.org/link/?JAS/113/2191/5}, author = {Seydou,Fadoulourahmane and Gumerov, Nail A. and Duraiswami, Ramani} } @conference {16149, title = {Technologies for families}, booktitle = {CHI {\textquoteright}02 extended abstracts on Human factors in computing systems}, series = {CHI EA {\textquoteright}02}, year = {2002}, month = {2002///}, pages = {938 - 939}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {In this workshop, we propose to bring together researchers from industry and academia to discuss the design of new technologies for families. We will focus on both design techniques and the technologies themselves. Through discussions and brainstorming we hope to discover new ideas, which can be disseminated more broadly.}, keywords = {cooperative design, disappearing computer, family, Home, participatory design, probe, user interface}, isbn = {1-58113-454-1}, doi = {10.1145/506443.506669}, url = {http://doi.acm.org/10.1145/506443.506669}, author = {Plaisant, Catherine and Druin, Allison and Hutchinson,Hilary} } @conference {13661, title = {Temporal Color Correlograms in Video Retrieval}, booktitle = {International Conference on Pattern Recognition}, year = {2002}, month = {2002///}, pages = {267 - 270}, author = {Rautiainen,M. and David Doermann} } @conference {15893, title = {Term selection for searching printed Arabic}, booktitle = {Proceedings of the 25th annual international ACM SIGIR conference on Research and development in information retrieval}, series = {SIGIR {\textquoteright}02}, year = {2002}, month = {2002///}, pages = {261 - 268}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Since many Arabic documents are available only in print, automating retrieval from collections of scanned Arabic document images using Optical Character Recognition (OCR) is an interesting problem. Arabic combines rich morphology with a writing system that presents unique challenges to OCR systems. These factors must be considered when selecting terms for automatic indexing. In this paper, alternative choices of indexing terms are explored using both an existing electronic text collection and a newly developed collection built from images of actual printed Arabic documents. Character n-grams or lightly stemmed words were found to typically yield near-optimal retrieval effectiveness, and combining both types of terms resulted in robust performance across a broad range of conditions.}, keywords = {arabic, Information retrieval, OCR, term selection}, isbn = {1-58113-561-0}, doi = {10.1145/564376.564423}, url = {http://doi.acm.org/10.1145/564376.564423}, author = {Darwish,Kareem and Oard, Douglas} } @conference {13667, title = {Text Quality Estimation in Digital Video}, booktitle = {SPIE Conf. on Document Recognition and Information Retrieval}, year = {2002}, month = {2002///}, pages = {232 - 243}, author = {Li,H. and David Doermann} } @inbook {18923, title = {Theoretical and Empirical Aspects of a Planner in a Multi-agent Environment}, booktitle = {Logics in Artificial Intelligence}, series = {Lecture Notes in Computer Science}, volume = {2424}, year = {2002}, month = {2002///}, pages = {173 - 185}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {We give the theoretical foundations and empirical evaluation of a planning agent, ashop, performing HTN planning in a multi-agent environment. ashop is based on ASHOP , an agentised version of the original SHOP HTN planning algorithm, and is integrated in the IMPACT multi-agent environment. We ran several experiments involving accessing various distributed, heterogeneous information sources, based on simplified versions of noncombatant evacuation operations, NEO{\textquoteright}s. As a result, we noticed that in such realistic settings the time spent on communication (including network time) is orders of magnitude higher than the actual inference process. This has important consequences for optimisations of such planners. Our main results are: (1) using NEO{\textquoteright}s as new, more realistic benchmarks for planners acting in an agent environment, and (2) a memoization mechanism implemented on top of shop, which improves the overall performance considerably.}, keywords = {Computer science}, isbn = {978-3-540-44190-8}, url = {http://www.springerlink.com/content/10lxp56u3e9k0bdd/abstract/}, author = {Dix,J{\"u}rgen and Munoz-Avila,Hector and Nau, Dana S. and Zhang,Lingling}, editor = {Flesca,Sergio and Greco,Sergio and Ianni,Giovambattista and Leone,Nicola} } @conference {13474, title = {Three-dimensional visualization of hierarchical task network plans}, booktitle = {In Proceedings of the 3rd International NASA Workshop on Planning and Scheduling for}, year = {2002}, month = {2002///}, abstract = {Artificial Intelligence (AI) planning techniques, particularly hierarchical task network (HTN) planners, can produce very complex plans, with many sequential and parallel actions decomposed into multiple levels of abstraction.}, author = {Kundu,K. and Sessions,C. and desJardins, Marie and Rheingans,P.} } @article {15091, title = {Threshold cryptosystems based on factoring}, journal = {Advances in Cryptology{\textemdash}ASIACRYPT 2002}, year = {2002}, month = {2002///}, pages = {139 - 147}, abstract = {We consider threshold cryptosystems over a composite modulus N where the factors of N are shared among the participants as the secret key. This is a new paradigm for threshold cryptosystems based on a composite modulus, differing from the typical treatment of RSA-based systems where a {\textquotedblleft}decryption exponent{\textquotedblright} is shared among the participants. Our approach yields solutions to some open problems in threshold cryptography; in particular, we obtain the following:1 Threshold Homomorphic Encryption. A number of applications (e.g., electronic voting or efficient multi-party computation) require threshold homomorphic encryption schemes. We present a protocol for threshold decryption of the homomorphic Goldwasser-Micali encryption scheme [34], answering an open question of [21]. 2 Threshold Cryptosystems as Secure as Factoring. We describe a threshold version of a variant of the signature standards ISO 9796-2 and PKCS$\#$1 v1.5 (cf. [39, Section 11.3.4]), thus giving the first threshold signature scheme whose security (in the random oracle model) is equivalent to the hardness of factoring [12]. Our techniques may be adapted to distribute the Rabin encryption scheme [44] whose semantic security may be reduced to the hardness of factoring. 3 Efficient Threshold Schemes without a Trusted Dealer. Because our schemes only require sharing of N - which furthermore need not be a product of strong primes - our schemes are very efficient (compared to previous schemes) when a trusted dealer is not assumed and key generation is done in a distributed manner. Extensions to achieve robustness and proactivation are also possible with our schemes. Work done while at Columbia University and Telcordia Technologies }, doi = {10.1007/3-540-36178-2_12}, author = {Katz, Jonathan and Yung,M.} } @conference {15972, title = {Time-situated agency: Active logic and intention formation}, booktitle = {in: Workshop on Cognitive Agents, 25th German Conference on Artificial Intelligence}, year = {2002}, month = {2002///}, author = {Anderson,M. L and Josyula,D. P and Okamoto,Y. A and Perlis, Don} } @conference {18604, title = {Topology inference from BGP routing dynamics}, booktitle = {Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment}, series = {IMW {\textquoteright}02}, year = {2002}, month = {2002///}, pages = {243 - 248}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {This paper describes a method of inferring logical relationships between network prefixes within an Autonomous System (AS) using only passive monitoring of BGP messages. By clustering these prefixes based upon similarities between their update times, we create a hierarchy linking the prefixes within the larger AS. We can frequently identify groups of prefixes routed to the same ISP Point of Presence (POP), despite the lack of identifying information in the BGP messages. Similarly, we observe disparate prefixes under common organizational control, or with long shared network paths. In addition to discovering interesting network characteristics, our passive method facilitates topology discovery by potentially reducing the number of active probes required in traditional traceroute-based Internet mapping mechanisms.}, isbn = {1-58113-603-X}, doi = {10.1145/637201.637239}, url = {http://doi.acm.org/10.1145/637201.637239}, author = {Andersen,David G. and Feamster, Nick and Bauer,Steve and Balakrishnan,Hari} } @conference {12750, title = {Towards a criterion for evaluating the quality of 3D reconstructions}, booktitle = {Acoustics, Speech, and Signal Processing (ICASSP), 2002 IEEE International Conference on}, volume = {4}, year = {2002}, month = {2002/05//}, pages = {IV-3321 -IV-3324 - IV-3321 -IV-3324}, abstract = {Even though numerous algorithms exist for estimating the structure of a scene from its video, the solutions obtained are often of unacceptable quality. To overcome some of the deficiencies, many application systems rely on processing more information than necessary with the hope that the redundancy will help improve the quality. This raises the question about how the accuracy of the solution is related to the amount of information processed by the algorithm. Can we define the accuracy of the solution precisely enough that we automatically recognize situations where the quality of the data is so bad that even a large number of additional observations will not yield the desired solution? This paper proposes an information theoretic criterion for evaluating the quality of a 3D reconstruction in terms of the statistics of the observed parameters (i.e. the image correspondences). The accuracy of the reconstruction is judged by considering the change in mutual information (or equivalently the conditional differential entropy) between a scene and its reconstructions and its effectiveness is shown through simulations.}, doi = {10.1109/ICASSP.2002.5745364}, author = {Roy Chowdhury,Amit K. and Chellapa, Rama} } @article {15884, title = {Translation-based indexing for cross-language retrieval}, journal = {Advances in Information Retrieval}, year = {2002}, month = {2002///}, pages = {425 - 447}, author = {Oard, Douglas and Ertunc,F.} } @article {12827, title = {Triggered message sequence charts}, journal = {ACM SIGSOFT Software Engineering Notes}, volume = {27}, year = {2002}, month = {2002/11/01/}, pages = {167 - 167}, isbn = {01635948}, doi = {10.1145/605466.605492}, url = {http://dl.acm.org/citation.cfm?id=605492}, author = {Sengupta,Bikram and Cleaveland, Rance} } @article {14101, title = {Trypanosoma cruzi: RNA structure and post-transcriptional control of tubulin gene expression}, journal = {Experimental Parasitology}, volume = {102}, year = {2002}, month = {2002/11//}, pages = {123 - 133}, abstract = {Changes in tubulin expression are among the biochemical and morphological adaptations that occur during the life cycle of Trypanosomatids. To investigate the mechanism responsible for the differential accumulation of tubulin mRNAs in Trypanosoma cruzi, we determine the sequences of [alpha]- and [beta]-tubulin transcripts and analyzed their expression during the life cycle of the parasite. Two [beta]-tubulin mRNAs of 1.9 and 2.3~kb were found to differ mainly by an additional 369 nucleotides at the end of the 3{\textquoteright} untranslated region (UTR). Although their transcription rates are similar in epimastigotes and amastigotes, [alpha]- and [beta]-tubulin transcripts are 3- to 6-fold more abundant in epimastigotes than in trypomastigotes and amastigotes. Accordingly, the half-lives of [alpha]- and [beta]-tubulin mRNAs are significantly higher in epimastigotes than in amastigotes. Transient transfection experiments indicated that positive regulatory elements occur in the 3{\textquoteright} UTR plus downstream intergenic region of the [alpha]-tubulin gene and that both positive and negative elements occur in the equivalent regions of the [beta]-tubulin gene.Index Descriptions and Abbreviations: Kinetoplastida; Trypanosoma cruzi; tubulin; gene regulation; PCR, polymerase chain reaction; UTR, untranslated region; IR, intergenic region; SL, spliced leader; BAC, bacterial artificial chromosome.}, isbn = {0014-4894}, doi = {16/S0014-4894(03)00034-1}, url = {http://www.sciencedirect.com/science/article/pii/S0014489403000341}, author = {Bartholomeu,Daniella C. and Silva,Rosiane A. and Galv{\~a}o,Lucia M. C. and El-Sayed, Najib M. and Donelson,John E. and Teixeira,Santuza M.R.} } @conference {18025, title = {Two techniques for reconciling algorithm parallelism with memory constraints}, booktitle = {Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures}, series = {SPAA {\textquoteright}02}, year = {2002}, month = {2002///}, pages = {95 - 98}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {The utility of algorithm parallelism for coping with increased processor to memory latencies using "latency hiding" is part of the folklore of parallel computing. Latency hiding techniques increase the traffic to memory and therefore may "hit another wall": limited bandwidth to memory. The current paper attempts to stimulate research in the following general direction: show that algorithm parallelism need not conflict with limited bandwidth.A general technique for using parallel algorithms to enhance serial implementation in the face of processor-memory latency problems is revisited. Two techniques for alleviating memory bandwidth constraints are presented. Both techniques can be incorporated in a compiler.There is often considerable parallelism in many of the algorithms which are known as useful serial algorithms. Interestingly enough, all the examples provided for the use of the two techniques come from such serial algorithms.}, keywords = {memory systems constraints, Parallel algorithms, prefetching}, isbn = {1-58113-529-7}, doi = {10.1145/564870.564884}, url = {http://doi.acm.org/10.1145/564870.564884}, author = {Vishkin, Uzi} } @conference {12751, title = {Two-frame multi-scale optical flow estimation using wavelet decomposition}, booktitle = {Acoustics, Speech, and Signal Processing (ICASSP), 2002 IEEE International Conference on}, volume = {4}, year = {2002}, month = {2002/05//}, pages = {IV-3588 -IV-3591 - IV-3588 -IV-3591}, abstract = {A multi-scale algorithm using wavelet decomposition is proposed to estimate dense optical flow using only two frames. Hierarchical image representation by wavelet decomposition is used to exploit the assumption of local rigid motion in a new multi-scale framework. It is shown that if a wavelet basis with one vanishing moment is carefully selected, we can get hierarchical images, edges, and comers from the wavelet decomposition. Based on this result, all the components of the wavelet decomposition are used to estimate relatively accurate optical flow even under the inadequate image sampling condition, and overcome the $\#$x201C;flattening-out $\#$x201D; problem in traditional pyramid methods, which produce high errors when low-texture regions become flat at coarse levels due to blurring. Local affine transforms are also used to speed up flow estimation. Experiments on different types of image sequences together with quantitative and qualitative comparisons with several other optical flow methods are given to demonstrate the effectiveness and robustness of our algorithm.}, doi = {10.1109/ICASSP.2002.5745431}, author = {Liu,Haiying and Rosenfeld,Azriel and Chellapa, Rama} } @article {17822, title = {Temporal agent programs}, journal = {Artificial Intelligence}, volume = {127}, year = {2001}, month = {2001/03//}, pages = {87 - 135}, abstract = {The {\textquotedblleft}agent program{\textquotedblright} framework introduced by Eiter, Subrahmanian and Pick [Artificial Intelligence 108 (1{\textendash}2) (1999) 179], supports developing agents on top of arbitrary legacy code. Such agents are continuously engaged in an {\textquotedblleft}event\&$\#$xa0;occurs{\textrightarrow}think{\textrightarrow}act{\textrightarrow}event\&$\#$xa0;occurs{\textellipsis}{\textquotedblright} cycle. However, this framework has two major limitations: (1)all actions are assumed to have no duration, and (2) all actions are taken now, but cannot be scheduled for the future. In this paper, we present the concept of a {\textquotedblleft}temporal agent program{\textquotedblright} (tap for short) and show that using taps, it is possible to build agents on top of legacy code that can reason about the past and about the future, and that can make temporal commitments for the future now. We develop a formal semantics for such agents, extending the concept of a status set proposed by Eiter et al., and develop algorithms to compute the status sets associated with temporal agent programs. Last, but not least, we show how taps support the decision making of collaborative agents. }, keywords = {agents, Heterogenous systems, Information integration, logic programming, temporal reasoning}, isbn = {0004-3702}, doi = {10.1016/S0004-3702(01)00052-2}, url = {http://www.sciencedirect.com/science/article/pii/S0004370201000522}, author = {Dix,J{\"u}rgen and Kraus,Sarit and V.S. Subrahmanian} } @conference {16156, title = {Therapeutic play with a storytelling robot}, booktitle = {CHI {\textquoteright}01 extended abstracts on Human factors in computing systems}, series = {CHI EA {\textquoteright}01}, year = {2001}, month = {2001///}, pages = {27 - 28}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {We are developing a prototype storytelling robot for use with children in rehabilitation. Children can remotely control a furry robot by using a variety of body sensors adapted to their disability or rehabilitation goal. We believe this robot can motivate children and help them reach their therapy goals through therapeutic play, either by exercising muscles or joints (e.g. for physically challenged children) or by reflecting on the stories (e.g. for children with developmental disabilities). To develop this technology we use an innovative design methodology involving children as design partners.}, keywords = {children, design process, rehabilitation, robot, therapeutic play, user interface}, isbn = {1-58113-340-5}, doi = {10.1145/634067.634088}, url = {http://doi.acm.org/10.1145/634067.634088}, author = {Lathan,Corinna and Vice,Jack Maxwell and Tracey,Michael and Plaisant, Catherine and Druin, Allison and Edward,Kris and Montemayor,Jaime} } @article {14805, title = {A tool to help tune where computation is performed}, journal = {IEEE Transactions on Software Engineering}, volume = {27}, year = {2001}, month = {2001/07//}, pages = {618 - 629}, abstract = {We introduce a new performance metric, called load balancing factor (LBF), to assist programmers when evaluating different tuning alternatives. The LBF metric differs from traditional performance metrics since it is intended to measure the performance implications of a specific tuning alternative rather than quantifying where time is spent in the current version of the program. A second unique aspect of the metric is that it provides guidance about moving work within a distributed or parallel program rather than reducing it. A variation of the LBF metric can also be used to predict the performance impact of changing the underlying network. The LBF metric is computed incrementally and online during the execution of the program to be tuned. We also present a case study that shows that our metric can accurately predict the actual performance gains for a test suite of six programs}, keywords = {Computational modeling, Current measurement, Distributed computing, distributed program, distributed programming, load balancing factor, Load management, parallel program, parallel programming, Performance analysis, performance evaluation, Performance gain, performance metric, Programming profession, software metrics, software performance evaluation, Testing, Time measurement, tuning}, isbn = {0098-5589}, doi = {10.1109/32.935854}, author = {Eom, Hyeonsang and Hollingsworth, Jeffrey K} } @conference {12021, title = {Towards the ultimate motion capture technology}, booktitle = {Deformable avatars: IFIP TC5/WG5. 10 DEFORM{\textquoteright}2000 Workshop, November 29-30, 2000, Geneva, Switzerland and AVATARS{\textquoteright}2000 Workshop, November 30-December 1, 2000, Lausanne, Switzerland}, volume = {68}, year = {2001}, month = {2001///}, pages = {143 - 143}, author = {Stuart, B. and Baker, P. and Aloimonos, J.} } @conference {15836, title = {Translation lexicon acquisition from bilingual dictionaries}, booktitle = {Proceedings of SPIE}, volume = {4670}, year = {2001}, month = {2001///}, pages = {37 - 37}, author = {David Doermann and Ma,H. and Karagol-Ayan,B. and Oard, Douglas} } @book {15363, title = {Transmission Lines and Lumped Circuits. Academic Press Series in Electromagnetism}, year = {2001}, month = {2001///}, publisher = {Elsevier Science \& Technology}, organization = {Elsevier Science \& Technology}, author = {Maffucci,A. and Mayergoyz, Issak D} } @conference {12098, title = {A trend analysis of exploitations}, booktitle = {2001 IEEE Symposium on Security and Privacy, 2001. S\&P 2001. Proceedings}, year = {2001}, month = {2001///}, pages = {214 - 229}, publisher = {IEEE}, organization = {IEEE}, abstract = {We have conducted an empirical study of a number of computer security exploits and determined that the rates at which incidents involving the exploit are reported to CERT can be modeled using a common mathematical framework. Data associated with three significant exploits involving vulnerabilities in phf, imap, and bind can all be modeled using the formula C=I+S{\texttimes}√M where C is the cumulative count of reported incidents, M is the time since the start of the exploit cycle, and I and S are the regression coefficients determined by analysis of the incident report data. Further analysis of two additional exploits involving vulnerabilities in mountd and statd confirm the model. We believe that the models will aid in predicting the severity of subsequent vulnerability exploitations, based on the rate of early incident reports}, keywords = {Computer science, computer security exploits, Data analysis, data mining, Educational institutions, exploitations, Performance analysis, Predictive models, Regression analysis, Risk management, security of data, software engineering, system intrusions, System software, trend analysis, vulnerabilities, vulnerability exploitation}, isbn = {0-7695-1046-9}, doi = {10.1109/SECPRI.2001.924300}, author = {Browne,H. K and Arbaugh, William A. and McHugh,J. and Fithen,W. L} } @conference {18947, title = {Telicity as a cue to temporal and discourse structure in Chinese-English machine translation}, series = {NAACL-ANLP-Interlinguas {\textquoteright}00}, year = {2000}, month = {2000///}, pages = {34 - 41}, publisher = {Association for Computational Linguistics}, organization = {Association for Computational Linguistics}, address = {Stroudsburg, PA, USA}, abstract = {Machine translation between any two languages requires the generation of information that is implicit in the source language. In translating from Chinese to English, tense and other temporal information must be inferred from other grammatical and lexical cues. Moreover, Chinese multiple-clause sentences may contain inter-clausal relations (temporal or otherwise) that must be explicit in English (e.g., by means of a discourse marker). Perfective and imperfective grammatical aspect markers can provide cues to temporal structure, but such information is not present in every sentence. We report on a project to use the lexical aspect features of (a)telicity reflected in the Lexical Conceptual Structure of the input text to suggest tense and discourse structure in the English translation of a Chinese newspaper corpus.}, doi = {10.3115/1117554.1117559}, url = {http://dx.doi.org/10.3115/1117554.1117559}, author = {Olsen,Mari and Traum,David and Van Ess-Dykema,Carol and Weinberg, Amy and Dolan,Ron} } @article {16633, title = {The temporal correlation hypothesis for self-organizing feature maps}, journal = {International Journal of Systems Science}, volume = {31}, year = {2000}, month = {2000///}, pages = {911 - 921}, author = {Chen,Y. and Reggia, James A.} } @article {15858, title = {Textual data mining to support science and technology management}, journal = {Journal of Intelligent Information Systems}, volume = {15}, year = {2000}, month = {2000///}, pages = {99 - 119}, author = {Losiewicz,P. and Oard, Douglas and Kostoff,R.N.} } @conference {13682, title = {Tools and Techniques for Video Performances Evaluation}, booktitle = {ICPR}, volume = {4}, year = {2000}, month = {2000///}, pages = {167 - 170}, author = {David Doermann and Mihalcik,D.} } @article {15351, title = {Toward the large-eddy simulation over a hypersonic elliptical cross-section cone}, journal = {AIAA Paper No. 00-2311}, year = {2000}, month = {2000///}, author = {Martin, M.P and Weirs,G. and Candler,G. V and Piomelli,U. and Johnson,H. and Nompelis,I.} } @article {16950, title = {A Trip Report on Creativity and Cognition 1999: An Insider{\textquoteright}s Report on a Far Out Conference}, journal = {SIGCHI BULLETIN}, volume = {32}, year = {2000}, month = {2000///}, pages = {43 - 46}, author = {Shneiderman, Ben and Hewett,T.} } @conference {16173, title = {Temporal, geographical and categorical aggregations viewed through coordinated displays: a case study with highway incident data}, booktitle = {Proceedings of the 1999 workshop on new paradigms in information visualization and manipulation in conjunction with the eighth ACM internation conference on Information and knowledge management}, series = {NPIVM {\textquoteright}99}, year = {1999}, month = {1999///}, pages = {26 - 34}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Information visualization displays can hold a limited number of data points, typically a few thousand, before they get crowded. One way to solve this problem with larger data sets is to create aggregates. Aggregations were used together with the Snap-Together Visualization system to coordinate the visual displays of aggregates and their content. If two displays each hold one thousand items then rapid access and visibility can be maintained for a million points. This paper presents examples based on a database of highway incident data.}, isbn = {1-58113-254-9}, doi = {10.1145/331770.331780}, url = {http://doi.acm.org/10.1145/331770.331780}, author = {Fredrikson,Anna and North,Chris and Plaisant, Catherine and Shneiderman, Ben} } @article {18303, title = {Temporal multi-scale models for flow and acceleration}, journal = {International Journal of Computer Vision}, volume = {32}, year = {1999}, month = {1999///}, pages = {147 - 163}, author = {Yacoob,Yaser and Davis, Larry S.} } @article {16171, title = {Temporal visualization for legal case histories}, journal = {PROCEEDINGS OF THE ANNUAL MEETING-AMERICAN SOCIETY FOR INFORMATION SCIENCE}, volume = {36}, year = {1999}, month = {1999///}, pages = {271 - 279}, abstract = {This paper discusses visualization of legal information using a tool for temporal information called LifeLines. The direct and indirect histories of cases can become very complex. We explored ways that LifeLines could aid in viewing the links between the original case and the direct and indirect histories. The Apple Computer, Inc. v. Microsoft Corporation and Hewlett Packard Company case is used to illustrate the prototype. For example, if users want to find out how the rulings or statutes changed throughout this case, they could retrieve this information within a single display. Using the timeline, users could also choose at which point in time they would like to begin viewing the case. LifeLines support various views of a case{\textquoteright}s history. For instance, users can view the trial history of a case, the references involved in a case, and citations made to a case. The paper describes improvements to LifeLines that could help in providing a more useful visualization of case history.}, author = {Harris,C. and Allen,R.B. and Plaisant, Catherine and Shneiderman, Ben} } @article {17398, title = {TennisViewer: A Browser for Competition Trees}, journal = {Readings in information visualization: using vision to think}, year = {1999}, month = {1999///}, pages = {149 - 149}, author = {Johnson,B. and Shneiderman, Ben and Baker,MJ and Eick,SG} } @conference {13662, title = {Text Enhancement in Digital Video}, booktitle = {Proceedings of SPIE - Conference on Document Recognition and Retrieval VI}, year = {1999}, month = {1999/01//}, pages = {2 - 9}, author = {Li,H. and Kia,O. and David Doermann} } @conference {13663, title = {Text enhancement in digital video using multiple frame integration}, booktitle = {Proceedings of the seventh ACM international conference on Multimedia (Part 1)}, series = {MULTIMEDIA {\textquoteright}99}, year = {1999}, month = {1999///}, pages = {19 - 22}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {In this paper a multiple frame based technique to enhance text in digital video is presented. After extracting a reference text block, we use an image matching technique to find the corresponding text blocks in consecutive frames. We register these text blocks to subpixel levels by using image interpolation techniques to improve both correspondence and text resolution. The registered text blocks are averaged to obtain a new text block with a clean background and a higher resolution. Experiments conducted on several video sequences show that our enhancement scheme can improve the accuracy of commercial off-the-shelf OCR considerably.}, isbn = {1-58113-151-8}, doi = {10.1145/319463.319466}, url = {http://doi.acm.org/10.1145/319463.319466}, author = {Huiping Li and David Doermann} } @inbook {17399, title = {Text in 1D}, booktitle = {Readings in information visualizationReadings in information visualization}, year = {1999}, month = {1999///}, pages = {411 - 412}, publisher = {Morgan Kaufmann Publishers Inc.}, organization = {Morgan Kaufmann Publishers Inc.}, address = {San Francisco}, isbn = {1-55860-533-9}, author = {Card,S.K. and Mackinlay,J.D. and Shneiderman, Ben} } @inbook {17400, title = {Text in 2D}, booktitle = {Readings in information visualizationReadings in information visualization}, year = {1999}, month = {1999///}, pages = {431 - 431}, publisher = {Morgan Kaufmann Publishers Inc.}, organization = {Morgan Kaufmann Publishers Inc.}, address = {San Francisco}, isbn = {1-55860-533-9}, author = {Card,S.K. and Mackinlay,J.D. and Shneiderman, Ben} } @inbook {17401, title = {Text in 3D}, booktitle = {Readings in information visualizationReadings in information visualization}, year = {1999}, month = {1999///}, pages = {440 - 441}, publisher = {Morgan Kaufmann Publishers Inc.}, organization = {Morgan Kaufmann Publishers Inc.}, address = {San Francisco}, isbn = {1-55860-533-9}, author = {Card,S.K. and Mackinlay,J.D. and Shneiderman, Ben} } @inbook {17402, title = {Text in 3D+ time}, booktitle = {Readings in information visualizationReadings in information visualization}, year = {1999}, month = {1999///}, pages = {451 - 451}, publisher = {Morgan Kaufmann Publishers Inc.}, organization = {Morgan Kaufmann Publishers Inc.}, address = {San Francisco}, isbn = {1-55860-533-9}, author = {Card,S.K. and Mackinlay,J.D. and Shneiderman, Ben} } @article {12845, title = {A Theory of Efficiency for Markovian Processes}, journal = {University of Bologna}, year = {1999}, month = {1999///}, author = {Bernardo,M. and Cleaveland, Rance} } @conference {14303, title = {A theory of type qualifiers}, booktitle = {ACM SIGPLAN Notices}, volume = {34}, year = {1999}, month = {1999///}, pages = {192 - 203}, author = {Foster, Jeffrey S. and F{\"a}hndrich,M. and Aiken,A.} } @article {15823, title = {Tikhonov Regularization and Total Least Squares}, journal = {SIAM Journal on Matrix Analysis and Applications}, volume = {21}, year = {1999}, month = {1999///}, pages = {185 - 194}, abstract = {Discretizations of inverse problems lead to systems of linear equations with a highly ill-conditioned coefficient matrix, and in order to computestable solutions to these systems it is necessary to apply regularization methods. We show how Tikhonov{\textquoteright}s regularization method, which in its original formulation involves a least squares problem, can be recast in a total least squares formulation suited for problems in which both the coefficient matrix and the right-hand side are known only approximately. We analyze the regularizing properties of this method and demonstrate by a numerical example that, in certain cases with large perturbations, the new method is superior to standard regularization methods.}, keywords = {bidiagonalization, discrete ill-posed problems, regularization, total least squares}, doi = {10.1137/S0895479897326432}, url = {http://link.aip.org/link/?SML/21/185/1}, author = {Golub, Gene H. and Hansen,Per Christian and O{\textquoteright}Leary, Dianne P.} } @conference {18323, title = {Tracking rigid motion using a compact-structure constraint}, booktitle = {Computer Vision, 1999. The Proceedings of the Seventh IEEE International Conference on}, volume = {1}, year = {1999}, month = {1999///}, pages = {198 -205 vol.1 - 198 -205 vol.1}, abstract = {An approach for tracking the motion of a rigid object using parameterized flow models and a compact-structure constraint is proposed. While polynomial parameterized flow models have been shown to be effective in tracking the rigid motion of planar objects, these models are inappropriate for tracking moving objects that change appearance revealing their 3D structure. We extend these models by adding a structure-compactness constraint that accounts for image motion that deviates from a planar structure. The constraint is based on the assumption that object structure variations are limited with respect to planar object projection onto the image plane and therefore can be expressed as a direct constraint on the image motion. The performance of the algorithm is demonstrated on several long image sequences of rigidly moving objects}, keywords = {compact-structure constraint, image motion, Image sequences, Motion estimation, parameterized flow models, polynomial parameterized flow models, Polynomials, rigid motion tracking, rigid object, rigidly moving objects, structure-compactness constraint, tracking}, doi = {10.1109/ICCV.1999.791218}, author = {Yacoob,Yaser and Davis, Larry S.} } @article {18033, title = {Trade-offs between communication throughput and parallel time}, journal = {Journal of Complexity}, volume = {15}, year = {1999}, month = {1999///}, pages = {148 - 166}, author = {Mansour,Y. and Nisan,N. and Vishkin, Uzi} } @article {14648, title = {Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals}, journal = {J. ACM}, volume = {46}, year = {1999}, month = {1999/01//}, pages = {1 - 27}, abstract = {Genomes frequently evolve by reversals \&rgr;(i,j) that transform a gene order \&pgr;1 {\textellipsis} \&pgr;i\&pgr;i+1 {\textellipsis} \&pgr;j-1\&pgr;j {\textellipsis} \&pgr;n into \&pgr;1 {\textellipsis} \&pgr;i\&pgr;j-1 {\textellipsis} \&pgr;i+1\&pgr;j {\textellipsis} \&pgr;n. Reversal distance between permutations \&pgr; and \&sgr;is the minimum number of reversals to transform \&pgr; into \&Agr;. Analysis of genome rearrangements in molecular biology started in the late 1930{\textquoteright}s, when Dobzhansky and Sturtevant published a milestone paper presenting a rearrangement scenario with 17 inversions between the species of Drosophilia. Analysis of genomes evolving by inversions leads to a combinatorial problem of sorting by reversals studied in detail recently. We study sorting of signed permutations by reversals, a problem that adequately models rearrangements in a small genomes like chloroplast or mitochondrial DNA. The previously suggested approximation algorithms for sorting signed permutations by reversals compute the reversal distance between permutations with an astonishing accuracy for both simulated and biological data. We prove a duality theorem explaining this intriguing performance and show that there exists a {\textquotedblleft}hidden{\textquotedblright} parameter that allows one to compute the reversal distance between signed permutations in polynomial time.}, keywords = {Computational Biology, Genetics}, isbn = {0004-5411}, doi = {10.1145/300515.300516}, url = {http://doi.acm.org/10.1145/300515.300516}, author = {Hannenhalli, Sridhar and Pevzner,Pavel A.} } @conference {14747, title = {Transparent communication for distributed objects in Java}, booktitle = {Proceedings of the ACM 1999 conference on Java Grande}, series = {JAVA {\textquoteright}99}, year = {1999}, month = {1999///}, pages = {160 - 170}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, isbn = {1-58113-161-5}, doi = {10.1145/304065.304119}, url = {http://doi.acm.org/10.1145/304065.304119}, author = {Hicks, Michael W. and Jagannathan,Suresh and Kelsey,Richard and Moore,Jonathan T. and Ungureanu,Cristian} } @conference {17443, title = {Trust me, I{\textquoteright}m accountable: trust and accountability online}, booktitle = {CHI {\textquoteright}99 extended abstracts on Human factors in computing systems}, series = {CHI EA {\textquoteright}99}, year = {1999}, month = {1999///}, pages = {79 - 80}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {We live in an increasingly wired world. According to Robert Putnam, people are spending less time in persistent personal face to face interactions and more time in pursuits such as watching TV and using the Internet. At the same time, independently measured "social capital" -- the extent to which we trust and work for a common good -- is declining. In this panel, we explore: the impacts of electronic media on trust and accountability; whether and how electronic media can be designed and used to increase deserved trust and accountability; the relationship between protecting privacy and increasing the efficacy of communication; and how people{\textquoteright}s tendency to treat computers as social actors impacts these issues. In brief, how can modern technology enhance humanity{\textquoteright}s humanity?}, keywords = {accountability, anonymity, Communication, computers and society, ethics, Internet, media effects, privacy, Reciprocity, repute, social actors, social capital, social impacts, trust, value-sensitive design, wired world, WWW}, isbn = {1-58113-158-5}, doi = {10.1145/632716.632766}, url = {http://doi.acm.org/10.1145/632716.632766}, author = {Friedman,Batya and Thomas,John C. and Grudin,Jonathan and Nass,Clifford and Nissenbaum,Helen and Schlager,Mark and Shneiderman, Ben} } @article {17833, title = {T2}, journal = {ACM SIGMOD Record}, volume = {27}, year = {1998}, month = {1998/03/01/}, pages = {58 - 66}, isbn = {01635808}, doi = {10.1145/273244.273264}, url = {http://dl.acm.org/citation.cfm?id=273264}, author = {Chang,Chialin and Acharya,Anurag and Sussman, Alan and Saltz,Joel} } @article {16769, title = {Techniques for update handling in the enhanced client-server DBMS}, journal = {IEEE Transactions on Knowledge and Data Engineering}, volume = {10}, year = {1998}, month = {1998/06//May}, pages = {458 - 476}, abstract = {The Client-Server computing paradigm has significantly influenced the way modern Database Management Systems are designed and built. In such systems, clients maintain data pages in their main-memory caches, originating from the server{\textquoteright}s database. The Enhanced Client-Server architecture takes advantage of all the available client resources, including their long-term memory. Clients can cache server data into their own disk units if these data are part of their operational spaces. However, when updates occur at the server, a number of clients may need to not only be notified about these changes, but also obtain portions of the updates as well. In this paper, we examine the problem of managing server imposed updates that affect data cached on client disk managers. We propose a number of server update propagation techniques in the context of the Enhanced Client-Server DBMS architecture, and examine the performance of these strategies through detailed simulation experiments. In addition, we study how the various settings of the network affect the performance of these policies}, keywords = {client disk managers, client resources, client-server computing paradigm, client-server systems, Computational modeling, Computer architecture, concurrency control, data pages, Database systems, distributed databases, enhanced client-server DBMS, Hardware, Local area networks, long-term memory, main-memory caches, Network servers, operational spaces, Personal communication networks, server update propagation techniques, Transaction databases, update handling, Workstations, Yarn}, isbn = {1041-4347}, doi = {10.1109/69.687978}, author = {Delis,A. and Roussopoulos, Nick} } @conference {11920, title = {Temporally determinate disk access (extended abstract): an experimental approach}, booktitle = {Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems}, series = {SIGMETRICS {\textquoteright}98/PERFORMANCE {\textquoteright}98}, year = {1998}, month = {1998///}, pages = {280 - 281}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, isbn = {0-89791-982-3}, doi = {10.1145/277851.277950}, url = {http://doi.acm.org/10.1145/277851.277950}, author = {Aboutabl,Mohamed and Agrawala, Ashok K. and Decotignie,Jean-Dominique} } @conference {13665, title = {Text Extraction and Recognition in Digital Video}, booktitle = {Proceedings of Third IAPRWorkshop on Document Analysis Systems}, year = {1998}, month = {1998///}, pages = {119 - 128}, author = {Li,H. and David Doermann and Kia,O.} } @inbook {13718, title = {A Thematic Hierarchy for Efficient Generation from Lexical-Conceptual Structure}, booktitle = {Machine Translation and the Information SoupMachine Translation and the Information Soup}, series = {Lecture Notes in Computer Science}, volume = {1529}, year = {1998}, month = {1998///}, pages = {333 - 343}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {This paper describes an implemented algorithm for syntactic realization of a target-language sentence from an interlingual representation called Lexical Conceptual Structure (LCS). We provide a mapping between LCS thematic roles and Abstract Meaning Representation (AMR) relations; these relations serve as input to an off-the-shelf generator (Nitrogen). There are two contributions of this work: (1) the development of a thematic hierarchy that provides ordering information for realization of arguments in their surface positions; (2) the provision of a diagnostic tool for detecting inconsistencies in an existing online LCS-based lexicon that allows us to enhance principles for thematic-role assignment.}, isbn = {978-3-540-65259-5}, url = {http://dx.doi.org/10.1007/3-540-49478-2_30}, author = {Dorr, Bonnie J and Habash,Nizar and Traum,David}, editor = {Farwell,David and Gerber,Laurie and Hovy,Eduard} } @article {15408, title = {Three-Dimensional Hydrodynamic Modeling of MOSFET Devices}, journal = {VLSI Design}, volume = {6}, year = {1998}, month = {1998///}, pages = {261 - 265}, abstract = {The hydrodynamic (HD) model of semiconductor devices is solved numerically inthree-dimensions (3-D) for the MOSFET device. The numerical instabilities of the HD model are analyzed to develop a stable discretization. The formulation is stabilized by using a new, higher-order discretization for the relaxation-time approximation (RTA) term of the energy-balance (EB) equation. The developed formulation is used to model the MOSFET. }, isbn = {1065-514X, 1563-5171}, doi = {10.1155/1998/60859}, url = {http://www.hindawi.com/journals/vlsi/1998/060859/abs/}, author = {Kerr,Daniel C. and Goldsman,Neil and Mayergoyz, Issak D} } @conference {15680, title = {Threshold-based admission control for multi-class video-on-demand systems}, booktitle = {Performance, Computing and Communications, 1998. IPCCC {\textquoteright}98., IEEE International}, year = {1998}, month = {1998/02/16/18}, pages = {154 - 160}, publisher = {IEEE}, organization = {IEEE}, abstract = {The next generation of distributed digital video-on-demand (VoD) systems will use admission control tests to ensure that users receive predictable and guaranteed service. If the system cannot support a new request then that request is blocked This paper presents an analytical model to evaluate unified admission control strategies for distributed VoD systems with multiple video classes. We prove that there exists a computationally efficient technique to determine the blocking probabilities for newly arriving requests. Through numerical analysis we show the effect of different admission control policies on overall system blocking rates}, keywords = {Admission control, admission control tests, analytical model, Analytical models, blocking probabilities, buffer storage, Computer architecture, distributed digital VoD systems, File servers, guaranteed service, High-speed networks, interactive video, Motion pictures, multi-class video-on-demand systems, multimedia systems, Network servers, newly arriving requests, numerical analysis, Predictive models, probability, recursive algorithm, system blocking rates, telecommunication congestion control, threshold-based admission control, unified admission control}, isbn = {0-7803-4468-5}, doi = {10.1109/PCCC.1998.659937}, author = {Mundur, Padma and Sood,A. and Simon,R.} } @article {17741, title = {Time-Domain Extraction of Broad-Band Sources by Tikhonov-Phillips Regularization of Triangular Toeplitz Kernels*}, volume = {UMIACS-TR-95-87}, year = {1998}, month = {1998/10/15/}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {Single receiver source deconvolution in a shallow waterenvironment is an ill-posed problem whose difficulty is compounded by the multipath nature of the propagation operator. If only sources that are quiescent prior to some initial time to are considered, the result of discretizatizing the problem in the time domain is an ill-conditioned triangular Toeplitz system. In this paper we show how an algorithm of Elden can be used to implement Tikhonov-Phillips regularization for this system. Unlike the multichannel deconvolution techniques used in underwater acoustics, this method can extract source signatures using the outputs of a single sensor. In addition, when the propagation is multipath and source signature extraction is performed as part of an optimization procedure for environmental inversion, we can work with shorter time windows so that the process becomes computationally more efficient than frequency domain deconvolution. A number of examples of the use of the Tikhonov-Philips regularization method for source series extraction are provided. (Also cross-referenced as UMIACS-TR-95-87) }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/755}, author = {Roginsky,Jacob and Stewart, G.W.} } @article {17963, title = {Topology simplification for polygonal virtual environments}, journal = {Visualization and Computer Graphics, IEEE Transactions on}, volume = {4}, year = {1998}, month = {1998/06//apr}, pages = {133 - 144}, abstract = {We present a topology simplifying approach that can be used for genus reductions, removal of protuberances, and repair of cracks in polygonal models in a unified framework. Our work is complementary to the existing work on geometry simplification of polygonal datasets and we demonstrate that using topology and geometry simplifications together yields superior multiresolution hierarchies than is possible by using either of them alone. Our approach can also address the important issue of repair of cracks in polygonal models, as well as for rapid identification and removal of protuberances based on internal accessibility in polygonal models. Our approach is based on identifying holes and cracks by extending the concept of alpha;-shapes to polygonal meshes under the L infin; distance metric. We then generate valid triangulations to fill them using the intuitive notion of sweeping an L infin; cube over the identified regions}, keywords = {accessibility;intuitive, alpha;-shapes;L, approach;triangulations;unified, cube;L, datasets;polygonal, distance, environments;protuberance, framework;computational, geometry;topology;virtual, hierarchies;polygonal, infin;, meshes;polygonal, metric;genus, models;polygonal, notion;multiresolution, reality;, reductions;geometry, removal;topology, simplification;geometry, simplification;topology, simplifications;internal, simplifying, virtual}, isbn = {1077-2626}, doi = {10.1109/2945.694955}, author = {El-Sana,J. and Varshney, Amitabh} } @article {17441, title = {Treemaps for space-constrained visualization of hierarchies}, journal = {ACM Transactions on Graphics (TOG) Volume}, volume = {11}, year = {1998}, month = {1998///}, pages = {92 - 99}, author = {Shneiderman, Ben} } @book {13028, title = {Trends in the Early Careers of Life Scientists}, year = {1998}, month = {1998///}, publisher = {National Academy Press}, organization = {National Academy Press}, address = {Washington, DC}, author = {Tilghman,S and Astin,HS and Brinkley,W and Chilton,MD and Cummings, Michael P. and Ehrenberg,RG and Fox,MF and Glenn,K and Green,PJ and Hans,S and Kelman,A and LaPidus,J and Levin,B and McIntosh,JR and Riecken,H and Stephen,PE} } @article {13029, title = {Trends in the early careers of life scientists - Preface and executive summary}, journal = {Mol Biol Cell}, volume = {9}, year = {1998}, month = {1998/11//}, pages = {3007 - 3015}, author = {Tilghman,S and Astin,HS and Brinkley,W and Chilton,MD and Cummings, Michael P. and Ehrenberg,RG and Fox,MF and Glenn,K and Green,PJ and Hans,S and Kelman,A and LaPidus,J and Levin,B and McIntosh,JR and Riecken,H and Stephen,PE} } @article {17739, title = {The Triangular Matrices of Gaussian Elimination and Related Decompositions}, volume = {UMIACS-TR-95-91}, year = {1998}, month = {1998/10/15/}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {It has become a commonplace that triangular systems are solved tohigher accuracy than their condition would warrant. This observation is not true in general, and counterexamples are easy to construct. However, it is often true of the triangular matrices from pivoted LU or QR decompositions. It is shown that this fact is closely connected with the rank-revealing character of these decompositions. (Also cross-referenced as UMIACS-TR-95-91) }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/759}, author = {Stewart, G.W.} } @article {17742, title = {Two Algorithms for the The Efficient Computation of Truncated Pivoted QR Approximations to a Sparse Matrix}, volume = {UMIACS-TR-98-12}, year = {1998}, month = {1998/10/15/}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {In this note we propose two algorithms to compute truncated pivoted QRapproximations to a sparse matrix. One is based on the Gram--Schmidt algorithm, and the other on Householder triangularization. Both algorithms leave the original matrix unchanged, and the only additional storage requirements are arrays to contain the factorization itself. Thus, the algorithms are particularly suited to determining low-rank approximations to a sparse matrix. (Also cross-referenced as UMIACS-TR-98-12) }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/941}, author = {Stewart, G.W.} } @article {17743, title = {Two Simple Residual Bounds for the Eigenvalues of Hermitian Matrices}, volume = {UMIACS-TR-89-123}, year = {1998}, month = {1998/10/15/}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {Let $A$ be Hermitian and let the orthonormal columns of $X$ span anapproximate invariant subspace of $X$. Then the residual $R = AX-XM$ $(M=X\ctp AX)$ will be small. The theorems of this paper bound the distance of the spectrum of $M$ from the spectrum of $A$ in terms of appropriate norms of $R$. Appeared in SIAM J. Mat. Anal. Appl. 12 (1991) 205--208. (Also cross-referenced as UMIACS-TR-89-123) }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/545}, author = {Stewart, G.W.} } @article {14751, title = {Types and intermediate representations}, journal = {Technical Reports (CIS)}, year = {1998}, month = {1998///}, pages = {796 - 796}, author = {Hicks, Michael W.} } @article {16948, title = {A Taxonomy of Multiple Window Coordination}, journal = {Institute for Systems Research Technical Reports}, year = {1997}, month = {1997///}, abstract = {In current windowing environments, individual windows are treated independently, making it difficult for users to coordinate information across multiple windows. While coordinated multi- window strategies are increasingly used in visualization and web user interfaces, designs are inflexible and haphazard. The space of such linked-window strategies is not well understood and largely unexplored. This paper presents a taxonomy of coordinations, identifies important components, and reviews example interfaces. This 2x3 taxonomy provides guidelines for designers of applications, user interface toolkits, and window managers. We hope to encourage construction of generalized, end- user programmable, robust, multiple-window coordination capabilities.}, keywords = {Human-Computer Interaction,}, url = {http://drum.lib.umd.edu/handle/1903/5892}, author = {North,Chris and Shneiderman, Ben} } @conference {13658, title = {Techniques for Automated Testing for Automated Testing of Document Analysis Algorithms}, booktitle = {Proceedings of the First Brazilian Symposium on Document Image Analysis}, year = {1997}, month = {1997///}, pages = {201 - 212}, author = {Sauvola,J. and Kauniskangas,H. and David Doermann and Pietikainen,M.} } @conference {18315, title = {Temporal Multi-scale Models for Image Motion Estimation}, booktitle = {Image Understanding Workshop: proceedings of a workshop held in New Orleans, Louisiana, May 11-14, 1997}, volume = {1}, year = {1997}, month = {1997///}, pages = {135 - 135}, author = {Yacoob,Yaser and Davis, Larry S.} } @article {15562, title = {Testing simple polygons}, journal = {Computational Geometry}, volume = {8}, year = {1997}, month = {1997/07//}, pages = {97 - 114}, abstract = {We consider the problem of verifying a simple polygon in the plane using {\textquotedblleft}test points{\textquotedblright}. A test point is a geometric probe that takes as input a point in Euclidean space, and returns {\textquotedblleft}+{\textquotedblright} if the point is inside the object being probed or {\textquotedblleft}-{\textquotedblright} if it is outside. A verification procedure takes as input a description of a target object, including its location and orientation, and it produces a set of test points that are used to verify whether a test object matches the description. We give a procedure for verifying an n-sided, non-degenerate, simple target polygon using 5n test points. This testing strategy works even if the test polygon has n + 1 vertices, and we show a lower bound of 3n + 1 test points for this case. We also give algorithms using O(n) test points for simple polygons that may be degenerate and for test polygons that may have up to n + 2 vertices. All of these algorithms work for polygons with holes. We also discuss extensions of our results to higher dimensions.}, keywords = {probing, Testing, Verifying}, isbn = {0925-7721}, doi = {10.1016/S0925-7721(96)00015-6}, url = {http://www.sciencedirect.com/science/article/pii/S0925772196000156}, author = {Arkin,Esther M. and Belleville,Patrice and Mitchell,Joseph S.B. and Mount, Dave and Romanik,Kathleen and Salzberg,Steven and Souvaine,Diane} } @conference {17856, title = {Titan: a High-Performance Remote-sensing Database}, booktitle = {In Proceedings of the 1997 International Conference on Data Engineering}, year = {1997}, month = {1997///}, author = {Bongki,C. C and Chang,C. and Moon,B. and Acharya, A. and Shock,C. and Sussman, Alan and Saltz, J.} } @article {13878, title = {Toward Compact Monotonically Compositional Interlingua Using Lexical Aspect}, year = {1997}, month = {1997/12//}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {We describe a theoretical investigation into the semantic space described by our interlingua (IL), which currently has 191 main verb classes divided into 434 subclasses. represented by 237 distinct Lexical Conceptual Structures (LCSs). Using the model of aspect in Olsen (1994b, 1997a) monotonic aspectual composition we have identified 71 aspectually basic subclasses that are associated with one or more of 68 aspectually non-basic classes via some lexical ("type-shifting") rule (Bresnan 1982, Pinker 1984, Levin and Rappaport Hovav 1995). This allows us to refine the IL and address certain computational and theoretical issues at the same time. From a linguistic viewpoint, the expected benefits include a refinement of the aspectual model in (Olsen :1994b, 1997a) (which provides necessary but not sufficient conditions for aspectual composition), and a refinement of the verb classifications in (Levin 1993); we also expect our approach to eventually produce a systematic definition (in terms of LCSs and compositional operations) of the precise meaning components responsible for Levin{\textquoteright}s classification. Computationally, the lexicon is made more compact.}, keywords = {*LEXICOGRAPHY, *SEMANTICS, COMPOSITION(PROPERTY), linguistics, MODELS, STRUCTURES, THEORY, Vocabulary}, url = {http://stinet.dtic.mil/oai/oai?\&verb=getRecord\&metadataPrefix=html\&identifier=ADA458248}, author = {Dorr, Bonnie J and Olsen,Mari B and Thomas,Scott C} } @inbook {14269, title = {Toward motion picture grammars}, booktitle = {Computer Vision {\textemdash} ACCV{\textquoteright}98Computer Vision {\textemdash} ACCV{\textquoteright}98}, series = {Lecture Notes in Computer Science}, volume = {1352}, year = {1997}, month = {1997///}, pages = {283 - 290}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {We are interested in processing video data for the purpose of solving a variety of problems in video search, analysis, indexing, browsing and compression. Instead of concentrating on a particular problem, in this paper we present a framework for developing video applications. Our basic thesis is that video data can be represented at a higher level of abstraction as a string generated by a grammar, termed motion picture grammar. The rules of that grammar relate different spatiotemporal representations of the video content and, in particular, representations of action.}, isbn = {978-3-540-63931-2}, url = {http://dx.doi.org/10.1007/3-540-63931-4_228}, author = {Bolle,Ruud and Aloimonos, J. and Ferm{\"u}ller, Cornelia}, editor = {Chin,Roland and Pong,Ting-Chuen} } @article {18868, title = {Towards multiprocessor feature recognition}, journal = {Computer-Aided Design}, volume = {29}, year = {1997}, month = {1997/01//}, pages = {37 - 51}, abstract = {The availability of low-cost computational power is enabling the development of increasingly sophisticated cad software. Automation of design and manufacturing activities poses many difficult computational problems{\textemdash}significant among them is how to develop interactive systems that enable designers to explore and experiment with alternative ideas. As more downstream manufacturing activities are considered during the design phase, computational costs become problematic. Creating working software-based solutions requires a sophisticated allocation of computational resources in order to perform realistic design analyses and generate feedback. This paper presents our initial efforts to employ multiprocessor algorithms to recognize machining features from solid models of parts with large numbers of features and many geometric and topological entities. Our goal is to outline how improvements in computation time can be obtained by migrating existing software tools to multiprocessor architectures. An implementation of our approach is discussed.}, keywords = {Distributed computing, feature recognition, feature-based modelling, multiprocessor solid modelling}, isbn = {0010-4485}, doi = {10.1016/S0010-4485(96)00047-4}, url = {http://www.sciencedirect.com/science/article/pii/S0010448596000474}, author = {Regli,William C. and Gupta, Satyandra K. and Nau, Dana S.} } @article {17738, title = {The Triangular Matrices of Gaussian Elimination and Related Decompositions}, journal = {IMA Journal of Numerical Analysis}, volume = {17}, year = {1997}, month = {1997/01/01/}, pages = {7 - 16}, abstract = {It has become commonplace that triangular systems are solved to higher accuracy than their condition would warrant. This observation is not true in general, and counterexamples are easy to construct. However, it is often true of the triangular matrices from pivoted LU or QR decompositions. It is shown that this fact is closely connected with the rank-revealing character of these decompositions.}, isbn = {0272-4979, 1464-3642}, doi = {10.1093/imanum/17.1.7}, url = {http://imajna.oxfordjournals.org/content/17/1/7}, author = {Stewart, G.W.} } @article {13656, title = {Table-Form Structure Analysis Based on Box-Driven Reasoning}, journal = {IEICE TRANSACTIONS on Information and Systems}, volume = {E79-D}, year = {1996}, month = {1996/05/20/}, pages = {542 - 547}, abstract = {Table-form document structure analysis is an important problem in the document processing domain. This paper presents a new method called Box-Driven Reasoning (BDR) to robustly analyze the structure of table-form documents that include touching characters and broken lines. Real documents are copied repeatedly and overlaid with printed data, resulting in characters that touch cells and lines that are broken. Most previous methods employ a line-oriented approach, but touching characters and broken lines make the procedure fail at an early stage. BDR deals with regions directly in contrast with other previous methods and a reduced resolution image is introduced to supplement information deteriorated by noise. Experimental tests show that BDR reliably recognizes cells and strings in document images with touching characters and broken lines.}, isbn = {, 0916-8532}, url = {http://search.ieice.org/bin/summary.php?id=e79-d_5_542}, author = {Hori,Osamu and David Doermann} } @conference {13504, title = {A Theory of Document Functionality}, booktitle = {Proceedings in FLAIRS}, year = {1996}, month = {1996///}, pages = {429 - 433}, author = {Rivlin,E. and Doermann, David and Rosenfeld, A.} } @article {15375, title = {A three-dimensional MOSFET solver implementing the fixed point iteration technique}, journal = {Solid-State Electronics}, volume = {39}, year = {1996}, month = {1996/01//}, pages = {147 - 157}, abstract = {Our implementation of a fixed-point iteration technique for the three-dimensional (3D) steady-state simulation of MOSFET devices is presented. The simulation program is employed to investigate narrow channel effects on the device current-voltage characteristics. Particularly, the effects of impact ionization and the effects of variations in channel width and the field oxide bird{\textquoteright}s beak angle are evaluated. The degree to which various field oxide configurations isolate the device from the gate contact over the oxide transition region is determined by comparing the current-voltage characteristics with those of an idealized device with perfect isolation. Perfect isolation is simulated by setting the normal component of the electric field to zero at the semiconductor-field oxide interface. Simulation results show that the 3D computations are essential to account for rapidly varying charge densities and generation rates near the channel edge. Moreover, it is observed that the isolation effects of field oxides increase for larger bird{\textquoteright}s beak angles.}, isbn = {0038-1101}, doi = {10.1016/0038-1101(95)00103-Z}, url = {http://www.sciencedirect.com/science/article/pii/003811019500103Z}, author = {Madabhushi,Rajiv and Korman,Can E. and Mayergoyz, Issak D} } @conference {14643, title = {To cut{\textellipsis} or not to cut (applications of comparative physical maps in molecular evolution)}, booktitle = {Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms}, series = {SODA {\textquoteright}96}, year = {1996}, month = {1996///}, pages = {304 - 313}, publisher = {Society for Industrial and Applied Mathematics}, organization = {Society for Industrial and Applied Mathematics}, address = {Philadelphia, PA, USA}, isbn = {0-89871-366-8}, url = {http://dl.acm.org/citation.cfm?id=313852.314077}, author = {Hannenhalli, Sridhar and Pevzner,Pavel} } @article {17429, title = {Tools for creating and exploiting content}, journal = {Getty Art History Information Program (1996) Research Agenda for Networked Cultural Heritage, Santa Monica. CA: Getty AHIP}, year = {1996}, month = {1996///}, pages = {27 - 30}, author = {Kolker,R. and Shneiderman, Ben} } @article {16349, title = {Transitive closure of infinite graphs and its applications}, journal = {Languages and Compilers for Parallel Computing}, year = {1996}, month = {1996///}, pages = {126 - 140}, author = {Kelly,W. and Pugh, William and Rosser,E. and Shpeisman,T.} } @conference {14796, title = {Tuning the performance of I/O-intensive parallel applications}, booktitle = {Proceedings of the fourth workshop on I/O in parallel and distributed systems: part of the federated computing research conference}, year = {1996}, month = {1996///}, pages = {15 - 27}, author = {Acharya, A. and Uysal, M. and Bennett, R. and Mendelson, A. and Beynon, M. and Hollingsworth, Jeffrey K and Saltz, J. and Sussman, Alan} } @conference {18043, title = {On a technique for parsing a string}, booktitle = {Combinatorial Pattern Matching}, year = {1995}, month = {1995///}, pages = {386 - 386}, author = {Vishkin, Uzi} } @article {18044, title = {On a Technique for Parsing a String (Invited Lecture)}, journal = {Lecture Notes in Computer Science}, volume = {937}, year = {1995}, month = {1995///}, pages = {386 - 386}, author = {Vishkin, Uzi} } @article {14786, title = {Techniques for performance measurement of parallel programs}, journal = {Parallel computers: theory and practice}, year = {1995}, month = {1995///}, pages = {225 - 240}, author = {Hollingsworth, Jeffrey K and Lumpp, J. E and Miller, B. P} } @article {17740, title = {Theory of the Combination of Observations Least Subject to Errors}, journal = {SIAM, Philadelphia.[Translation of Gauss (1821, 1823, 1826).]}, year = {1995}, month = {1995///}, author = {Stewart, G.W.} } @article {15985, title = {Thinking takes time: a modal active-logic for reasoning in time}, journal = {Proc. of BISFAI-95}, year = {1995}, month = {1995///}, author = {Nirkhe,M. and Kraus,S. and Perlis, Don} } @article {13877, title = {Toward a lexicalized grammar for interlinguas}, journal = {Machine Translation}, volume = {10}, year = {1995}, month = {1995///}, pages = {143 - 184}, abstract = {In this paper we present one aspect of our research on machine translation (MT): capturing the grammatical and computational relation between (i) the interlingua (IL) as defined declaratively in the lexicon and (ii) the IL as defined procedurally by way of algorithms that compose and decompose pivot IL forms. We begin by examining the interlinguas in the lexicons of a variety of current IL-based approaches to MT. This brief survey makes it clear that no consensus exists among MT researchers on the level of representation for defining the IL. In the section that follows, we explore the consequences of this missing formal framework for MT system builders who develop their own lexical-IL entries. The lack of software tools to support rapid IL respecification and testing greatly hampers their ability to modify representations to handle new data and new domains. Our view is that IL-based MT research needs both (a) the formal framework to specify possible IL grammars and (b) the software support tools to implement and test these grammars. With respect to (a), we propose adopting a lexicalized grammar approach, tapping research results from the study of tree grammars for natural language syntax. With respect to (b), we sketch the design and functional specifications for parts of ILustrate, the set of software tools that we need to implement and test the various IL formalisms that meet the requirements of a lexicalized grammar. In this way, we begin to address a basic issue in MT research, how to define and test an interlingua as a computational language {\textemdash} without building a full MT system for each possible IL formalism that might be proposed.}, isbn = {0922-6567}, url = {http://dx.doi.org/10.1007/BF00997234}, author = {Voss,Clare and Dorr, Bonnie J} } @inbook {14644, title = {Towards a computational theory of genome rearrangements}, booktitle = {Computer Science TodayComputer Science Today}, series = {Lecture Notes in Computer Science}, volume = {1000}, year = {1995}, month = {1995///}, pages = {184 - 202}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {Analysis of genome rearrangements in molecular biology started in the late 1930{\textquoteright}s, when Dobzhansky and Sturtevant published a milestone paper presenting a rearrangement scenario with 17 inversions for the species of Drosophila. However, until recently there were no computer science results allowing a biologist to analyze genome rearrangements. The paper describes combinatorial problems motivated by genome rearrangements, surveys recently developed algorithms for genomic sequence comparison and presents applications of these algorithms to analyze rearrangements in herpes viruses, plant organelles, and mammalian chromosomes.}, isbn = {978-3-540-60105-0}, url = {http://dx.doi.org/10.1007/BFb0015244}, author = {Hannenhalli, Sridhar and Pevzner,Pavel}, editor = {van Leeuwen,Jan} } @conference {18316, title = {Tracking and recognizing rigid and non-rigid facial motions using local parametric models of image motion}, booktitle = {Computer Vision, 1995. Proceedings., Fifth International Conference on}, year = {1995}, month = {1995///}, pages = {374 - 381}, author = {Black,M. J and Yacoob,Yaser} } @conference {14647, title = {Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals}, booktitle = {Proceedings of the twenty-seventh annual ACM symposium on Theory of computing}, series = {STOC {\textquoteright}95}, year = {1995}, month = {1995///}, pages = {178 - 189}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, isbn = {0-89791-718-9}, doi = {10.1145/225058.225112}, url = {http://doi.acm.org/10.1145/225058.225112}, author = {Hannenhalli, Sridhar and Pevzner,Pavel} } @mastersthesis {14649, title = {Transforming men into mice (a computational theory of genome rearrangements)}, year = {1995}, month = {1995///}, school = {The Pennsylvania State University}, author = {Hannenhalli, Sridhar} } @conference {14565, title = {Transforming men into mice (polynomial algorithm for genomic distance problem)}, booktitle = {Foundations of Computer Science, Annual IEEE Symposium on}, year = {1995}, month = {1995///}, pages = {581 - 581}, publisher = {IEEE Computer Society}, organization = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, abstract = {Many people believe that transformations of humans into mice happen only in fairy tales. However, despite some differences in appearance and habits, men and mice are genetically very similar. In the pioneering paper, J.H. Nadeau and B.A. Taylor (1984) estimated that surprisingly few genomic rearrangements (178/spl plusmn/39) happened since the divergence of human and mouse 80 million years ago. However, their analysis is nonconstructive and no rearrangement scenario for human-mouse evolution has been suggested yet. The problem is complicated by the fact that rearrangements in multi chromosomal genomes include inversions, translocations, fusions and fissions of chromosomes, a rather complex set of operations. As a result, at first glance, a polynomial algorithm for the genomic distance problem with all these operations looks almost as improbable as the transformation of a (real) man into a (real) mouse. We prove a duality theorem which expresses the genomic distance in terms of easily computable parameters reflecting different combinatorial properties of sets of strings. This theorem leads to a polynomial time algorithm for computing most parsimonious rearrangement scenarios. Based on this result and the latest comparative physical mapping data we have constructed a scenario of human-mouse evolution with 131 reversals/translocaitons/fusions/fissions. A combination of the genome rearrangement algorithm with the recently proposed experimental technique called ZOO FISH suggests a new constructive approach to the 100 year old problem of reconstructing mammalian evolution.}, keywords = {biology computing, combinatorial properties, comparative physical mapping data, computable parameters, duality (mathematics), duality theorem, evolution (biological), Genetics, genome rearrangement algorithm, genomic distance problem, genomic rearrangements, human-mouse evolution, mammalian evolution, multi chromosomal genomes, parsimonious rearrangement scenarios, pattern matching, polynomial algorithm, polynomial time algorithm, set theory, sorting, string matching, strings, zoo fish}, doi = {http://doi.ieeecomputersociety.org/10.1109/SFCS.1995.492588}, author = {Hannenhalli, Sridhar and Pevzner,P.A.} } @conference {16316, title = {Tool support for tailored software prototyping}, booktitle = {Assessment of Quality Software Development Tools, 1994, Proceedings., Third Symposium on}, year = {1994}, month = {1994///}, pages = {171 - 181}, author = {Chen,C. and Porter, Adam and Purtilo,J.} } @article {15042, title = {Top-Bottom Routing around a Rectangle is as Easy as Computing Prefix Minima}, journal = {SIAM Journal on Computing}, volume = {23}, year = {1994}, month = {1994///}, pages = {449 - 465}, abstract = {A new parallel algorithm for the prefix minima problem is presented for inputs drawn from the range of integers $[1..s]$. For an input of size $n$, it runs in $O(\log \log \log s)$ time and $O(n)$ work (which is optimal). A faster algorithm is presented for the special case $s = n$; it runs in $O(\log ^ * n)$ time with optimal work. Both algorithms are for the Priority concurrent-read concurrent-write parallel random access machine (CROW PRAM). A possibly surprising outcome of this work is that, whenever the range of the input is restricted, the prefix minima problem can be solved significantly faster than the $\Omega (\log \log n)$ time lower bound in a decision model of parallel computation, as described by Valiant [SIAM J. Comput., 4 (1975), pp. 348{\textendash}355].The top-bottom routing problem, which is an important subproblem of routing wires around a rectangle in two layers, is also considered. It is established that, for parallel (and hence for serial) computation, the problem of top-bottom routing is no harder than the prefix minima problem with $s = n$, thus giving an $O(\log ^ * n)$ time optimal parallel algorithm for the top-bottom routing problem. This is one of the first nontrivial problems to be given an optimal parallel algorithm that runs in sublogarithmic time. }, keywords = {Parallel algorithms, pram algorithms, prefix minima, VLSI routing}, doi = {10.1137/S0097539791218275}, url = {http://link.aip.org/link/?SMJ/23/449/1}, author = {Berkman,Omer and JaJa, Joseph F. and Krishnamurthy,Sridhar and Thurimella,Ramakrishna and Vishkin, Uzi} } @conference {18054, title = {Trade-offs between communication throughput and parallel time}, booktitle = {Proceedings of the twenty-sixth annual ACM symposium on Theory of computing}, year = {1994}, month = {1994///}, pages = {372 - 381}, author = {Mansour,Y. and Nisan,N. and Vishkin, Uzi} } @inbook {13879, title = {Transforming queries from a relational schema to an object schema: A prototype based on F-logic}, booktitle = {Methodologies for Intelligent SystemsMethodologies for Intelligent Systems}, series = {Lecture Notes in Computer Science}, volume = {869}, year = {1994}, month = {1994///}, pages = {154 - 163}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, isbn = {978-3-540-58495-7}, url = {http://dx.doi.org/10.1007/3-540-58495-1_16}, author = {Chang,Yahui and Raschid, Louiqa and Dorr, Bonnie J}, editor = {Ras,Zbigniew and Zemankova,Maria} } @article {13027, title = {Transmission patterns of eukaryotic transposable elements - arguments for and against horizontal transfer}, journal = {Trends Ecol Evol}, volume = {9}, year = {1994}, month = {1994/04//}, pages = {141 - 145}, abstract = {Recent studies have demonstrated that several classes of transposable elements are widely distributed within eukaryotes. Horizontal transmission of these transposable elements has often been invoked in order to explain the observed variation and relationships within and between species. These same patterns of variation and relationships, however, may originate from processes that do not involve the lateral transfer of genetic material across species.}, author = {Cummings, Michael P.} } @article {17664, title = {Techniques for probabilistic analysis and randomness-efficient computation}, journal = {Computer Science Technical Reports, Cornell University}, year = {1993}, month = {1993/08//undefin}, abstract = {Randomness is well-recognized as an important computational resource in theoretical computer science. Not only are there classical problems for which the only known "efficient" solutions are randomized, but there are problems for which randomness can be used to circumvent deterministic lower bounds. However, standard tools available for probabilistic analysis such as the Chernoff-Hoeffding bounds are not sufficiently powerful in all situations; second, since there are no known "true" sources of randomness, there is a need to develop general techniques for reducing/removing randomness from randomized algorithms. This thesis addresses these two issues. Certain types of scheduling and resource allocation problems in a distributed setting can be modeled as edge coloring problems. In Chapter 2, we present a fast and simple randomized algorithm for edge coloring a graph, in the synchronous distributed point-to-point model of computation. Our algorithm computes an edge-coloring of a graph $G$ with $n$ nodes and maximum degree $\Delta$ with at most $(1.6 + \epsilon) \Delta + O(\log^{2+\delta} n)$ colors with high probability, for any fixed $\epsilon, \delta, greater than 0$. To analyze our algorithm, we introduce techniques for proving upper bounds on the tails of random variables, extending the Chernoff-Hoeffding (CH) bounds to some types of dependent random variables. This is joint work with A. Panconesi [91]. In Chapter 3, we show that the CH bounds for the tails of the sums of bounded and independent random variables $X_{1}, \ldots, X_{n}$ require only limited independence among the $X_{i}$s. We show that if $X_{1}, \ldots, X_{n}$ lie in [0,1] and are $k$-wise independent, then $Pr(X \geq E[\sum_{i}X_{i}](1 + \delta))$ can be upper bounded by the CH bound, if $k \geq \mu \cdot min\{\delta,\delta^{2}\}$. This leads to algorithms that require a reduced amount of randomness for any analysis which uses the CH bounds. This is joint work with J.P. Schmidt and A. Siegel [108]. In Chapter 4, we present an $RNC^{2}$ algorithm for the perfect matching problem which uses $O(\log Z)$ random bits where $Z$ is any given upper bound on the number of perfect matchings in the graph, generalizing results of Grigoriev and Karpinski. Underlying our algorithm is a randomness-optimal generalization of the Isolating Lemma of Mulmuley, Vazirani and Vazirani, which also leads to other applications. This is joint work with S. Chari and P. Rohatgi [26].}, author = {Srinivasan, Aravind} } @article {17432, title = {Touchscreens now offer compelling uses}, journal = {Sparks of innovation in human-computer interaction}, year = {1993}, month = {1993///}, pages = {187 - 187}, author = {Shneiderman, Ben} } @conference {16491, title = {Transitive closure: an experimental case study of three multithreaded database algorithms on a shared memory multiprocessor}, booktitle = {Parallel and Distributed Information Systems, 1993., Proceedings of the Second International Conference on}, year = {1993}, month = {1993///}, pages = {255 - 259}, author = {Young-Myers,H. and Raschid, Louiqa} } @article {17440, title = {Treemaps}, journal = {Sparks of innovation in human-computer interaction}, volume = {284}, year = {1993}, month = {1993///}, pages = {309 - 309}, author = {Johnson,B. and Shneiderman, Ben} } @conference {18065, title = {Two dimensional pattern matching in a digitized image}, booktitle = {Combinatorial Pattern Matching}, year = {1993}, month = {1993///}, pages = {134 - 151}, author = {Landau,G. and Vishkin, Uzi} } @conference {13660, title = {Temporal clues in handwriting}, booktitle = {Pattern Recognition, 1992. Vol.II. Conference B: Pattern Recognition Methodology and Systems, Proceedings., 11th IAPR International Conference on}, year = {1992}, month = {1992/09/03/aug}, pages = {317 - 320}, abstract = {Handwritten character recognition is typically classified as online or offline depending on the nature of the input data. Online data consists of a temporal sequence of instrument positions while offline data is in the form of a 2D image of the writing sample. Online recognition techniques have been relatively successful but have the disadvantage of requiring the data to be gathered during the writing process. This paper presents work on the extraction of temporal information from static images of handwriting and its implications for character recognition}, keywords = {character, extraction;, feature, handwriting, information, offline, online, recognition;, techniques;, temporal}, doi = {10.1109/ICPR.1992.201781}, author = {David Doermann and Rosenfeld, A.} } @article {12776, title = {Testing preorders for probabilistic processes}, journal = {Automata, Languages and Programming}, year = {1992}, month = {1992///}, pages = {708 - 719}, author = {Cleaveland, Rance and Smolka,S. and Zwarico,A.} } @article {16230, title = {Touchscreen interfaces for alphanumeric data entry}, journal = {Human Factors and Ergonomics Society Annual Meeting Proceedings}, volume = {36}, year = {1992}, month = {1992///}, pages = {293 - 297}, author = {Plaisant, Catherine and Sears,A.} } @conference {16227, title = {Touchscreen toggle design}, booktitle = {Proceedings of the SIGCHI conference on Human factors in computing systems}, series = {CHI {\textquoteright}92}, year = {1992}, month = {1992///}, pages = {667 - 668}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, isbn = {0-89791-513-5}, doi = {10.1145/142750.143079}, url = {http://doi.acm.org/10.1145/142750.143079}, author = {Plaisant, Catherine and Wallace,Daniel} } @article {14270, title = {Tracking facilitates 3-D motion estimation}, journal = {Biological Cybernetics}, volume = {67}, year = {1992}, month = {1992///}, pages = {259 - 268}, abstract = {The recently emerging paradigm of Active Vision advocates studying visual problems in form of modules that are directly related to a visual task for observers that are active. Along these lines, we are arguing that in many cases when an object is moving in an unrestricted manner (translation and rotation) in the 3D world, we are just interested in the motion{\textquoteright}s translational components. For a monocular observer, using only the normal flow {\textemdash} the spatio-temporal derivatives of the image intensity function {\textemdash} we solve the problem of computing the direction of translation and the time to collision. We do not use optical flow since its computation is an ill-posed problem, and in the general case it is not the same as the motion field {\textemdash} the projection of 3D motion on the image plane. The basic idea of our motion parameter estimation strategy lies in the employment of fixation and tracking. Fixation simplifies much of the computation by placing the object at the center of the visual field, and the main advantage of tracking is the accumulation of information over time. We show how tracking is accomplished using normal flow measurements and use it for two different tasks in the solution process. First it serves as a tool to compensate for the lack of existence of an optical flow field and thus to estimate the translation parallel to the image plane; and second it gathers information about the motion component perpendicular to the image plane.}, isbn = {0340-1200}, url = {http://dx.doi.org/10.1007/BF00204399}, author = {Ferm{\"u}ller, Cornelia and Aloimonos, J.} } @article {17437, title = {Tree visualization with tree-maps: 2-d space-filling approach}, journal = {ACM Transactions on Graphics}, volume = {11}, year = {1992}, month = {1992/01//}, pages = {92 - 99}, isbn = {0730-0301}, doi = {10.1145/102377.115768}, url = {http://doi.acm.org/10.1145/102377.115768}, author = {Shneiderman, Ben} } @conference {12172, title = {Two miniature pan-tilt devices}, booktitle = {Robotics and Automation, 1992. Proceedings., 1992 IEEE International Conference on}, year = {1992}, month = {1992///}, pages = {658 - 663}, author = {Bederson, Benjamin B. and Wallace,R.S. and Schwartz,E.L.} } @inbook {13719, title = {A two-level knowledge representation for machine translation: Lexical semantics and tense/aspect}, booktitle = {Lexical Semantics and Knowledge RepresentationLexical Semantics and Knowledge Representation}, series = {Lecture Notes in Computer Science}, volume = {627}, year = {1992}, month = {1992///}, pages = {269 - 287}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {This paper proposes a two-level model that integrates contemporary theories of tense and aspect with lexical semantics. The model is intended to be extensible to realms outside of the temporal domain (e.g., the spatial domain). The integration of tense and aspect with lexical-semantics is especially critical in machine translation because of the lexical selection process during generation: there is often a number of lexical connective and tense/aspect possibilities that may be produced from a lexical semantic representation, which, as defined in the model presented here, is largely underspecified. Temporal/aspectual information from the source-language sentence constrains the choice of target-language terms. In turn, the target-language terms limit the possibilities for generation of tense and aspect. Thus, there is a two-way communication channel between the two processes.}, isbn = {978-3-540-55801-9}, url = {http://dx.doi.org/10.1007/3-540-55801-2_41}, author = {Dorr, Bonnie J}, editor = {Pustejovsky,James and Bergler,Sabine} } @article {16947, title = {A taxonomy and rule base for the selection of interaction styles}, journal = {Human factors for informatics usability}, year = {1991}, month = {1991///}, pages = {325 - 325}, author = {Shneiderman, Ben} } @conference {12836, title = {A theory of testing for real-time}, booktitle = {, Proceedings of Sixth Annual IEEE Symposium on Logic in Computer Science, 1991. LICS {\textquoteright}91}, year = {1991}, month = {1991/07/15/18}, pages = {110 - 119}, publisher = {IEEE}, organization = {IEEE}, abstract = {A framework for generating testing preorders that relate processes on the basis of their timing behavior as well as their degree of relative nondeterminism is developed. The basic concepts of transition systems and testing are reviewed, and timed testing, which takes account of the delay exhibited by a process as it attempts to pass a test, is introduced. The framework is then applied to two different scenarios. In the first, relations are constructed that relate processes on the basis of all timing considerations. In the second, relations are constructed that relate processes on the basis of their relative speeds. In both cases, alternative denotational characterizations of the resulting preorders are presented, and examples are given to illustrate the utility of the approach}, keywords = {Algebra, Character generation, Computer science, Delay, formal logic, Licenses, nondeterminism, Process control, Protocols, Real time systems, real-time, System testing, testing preorders, testing theory, timed testing, Timing, timing behavior, transition systems}, isbn = {0-8186-2230-X}, doi = {10.1109/LICS.1991.151635}, author = {Cleaveland, Rance and Zwarico,A. E} } @article {17430, title = {Touch screens now offer compelling uses}, journal = {IEEE Software}, volume = {8}, year = {1991}, month = {1991/03//}, pages = {93 - 94}, abstract = {Research on improving the user interfaces of touch screen applications is described. The advantages of touch screens are discusses, their current capabilities are examined, and possible future developments are considered.<>}, keywords = {Application software, Computer aided instruction, Computer displays, Computer science, Cultural differences, Fingers, future developments, information resources, Marketing and sales, Mice, Psychology, touch screen applications, touch sensitive screens, User interfaces}, isbn = {0740-7459}, doi = {10.1109/52.73754}, author = {Shneiderman, Ben} } @conference {18145, title = {Towards a theory of nearly constant time parallel algorithms}, booktitle = {Foundations of Computer Science, 1991. Proceedings., 32nd Annual Symposium on}, year = {1991}, month = {1991/10//}, pages = {698 - 710}, abstract = {It is demonstrated that randomization is an extremely powerful tool for designing very fast and efficient parallel algorithms. Specifically, a running time of O(lg* n) (nearly-constant), with high probability, is achieved using n/lg* n (optimal speedup) processors for a wide range of fundamental problems. Also given is a constant time algorithm which, using n processors, approximates the sum of n positive numbers to within an error which is smaller than the sum by an order of magnitude. A variety of known and new techniques are used. New techniques, which are of independent interest, include estimation of the size of a set in constant time for several settings, and ways for deriving superfast optimal algorithms from superfast nonoptimal ones}, keywords = {computational complexity, Estimation, nearly constant time parallel algorithms, Parallel algorithms, positive numbers, randomization, running time, superfast optimal algorithms}, doi = {10.1109/SFCS.1991.185438}, author = {Gil,J. and Matias,Y. and Vishkin, Uzi} } @conference {17438, title = {Tree-maps: a space-filling approach to the visualization of hierarchical information structures}, booktitle = {, IEEE Conference on Visualization, 1991. Visualization {\textquoteright}91, Proceedings}, year = {1991}, month = {1991/10/22/25}, pages = {284 - 291}, publisher = {IEEE}, organization = {IEEE}, abstract = {A method for visualizing hierarchically structured information is described. The tree-map visualization technique makes 100\% use of the available display space, mapping the full hierarchy onto a rectangular region in a space-filling manner. This efficient use of space allows very large hierarchies to be displayed in their entirety and facilitates the presentation of semantic information. Tree-maps can depict both the structure and content of the hierarchy. However, the approach is best suited to hierarchies in which the content of the leaf nodes and the structure of the hierarchy are of primary importance, and the content information associated with internal nodes is largely derived from their children}, keywords = {Computer displays, Computer Graphics, Computer science, Data analysis, display space, Educational institutions, Feedback, hierarchical information structures, HUMANS, Laboratories, Libraries, Marine vehicles, rectangular region, semantic information, space-filling approach, tree-map visualization technique, trees (mathematics), Two dimensional displays, Visualization}, isbn = {0-8186-2245-8}, doi = {10.1109/VISUAL.1991.175815}, author = {Johnson,B. and Shneiderman, Ben} } @article {16743, title = {Trie hashing with controlled load}, journal = {IEEE Transactions on Software Engineering}, volume = {17}, year = {1991}, month = {1991/07//}, pages = {678 - 691}, abstract = {Trie hashing (TH), a primary key access method for storing and accessing records of dynamic files, is discussed. The key address is computed through a trie. A key search usually requires only one disk access when the trie is in core and two disk accesses for very large files when the trie must be on disk. A refinement to trie hashing, trie hashing with controlled load (THCL), is presented. It is designed to control the load factor of a TH file as tightly as that of a B-tree file, allows high load factor of up to 100\% for ordered insertions, and increases the load factor for random insertions from 70\% to over 85\%. It is shown that these properties make trie hashing preferable to a B-tree}, keywords = {B-tree file, Computer science, controlled load, Databases, disk access, dynamic files, file organisation, high load factor, information retrieval systems, key search, load factor, Military computing, ordered insertions, Predictive models, primary key access method, Protocols, random insertions, TH file, THCL, Tree data structures, trees (mathematics), trie hashing}, isbn = {0098-5589}, doi = {10.1109/32.83904}, author = {Litwin,W. A and Roussopoulos, Nick and Levy,G. and Hong,W.} } @article {15936, title = {Typicality constants and range defaults: Some pros and cons of a cognitive model of default reasoning}, journal = {Methodologies for Intelligent Systems}, year = {1991}, month = {1991///}, pages = {560 - 569}, author = {Miller,M. and Perlis, Don} } @article {12807, title = {Tableau-based model checking in the propositional mu-calculus}, journal = {Acta Informatica}, volume = {27}, year = {1990}, month = {1990///}, pages = {725 - 747}, author = {Cleaveland, Rance} } @conference {12833, title = {Testing equivalence as a bisimulation equivalence}, booktitle = {Automatic Verification Methods for Finite State Systems}, year = {1990}, month = {1990///}, pages = {11 - 23}, author = {Cleaveland, Rance and Hennessy,M.} } @article {15996, title = {Thing and Thought}, journal = {Knowledge Representation and Defeasible Reasoning. Kluwer}, year = {1990}, month = {1990///}, author = {Perlis, Don} } @conference {17431, title = {Touchscreen field specification for public access database queries: let your fingers do the walking}, booktitle = {Proceedings of the 1990 ACM annual conference on Cooperation}, series = {CSC {\textquoteright}90}, year = {1990}, month = {1990///}, pages = {1 - 7}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Database query is becoming a common task in public access systems; touchscreens can provide an appealing interface for such a system. This paper explores three interfaces for constructing queries on alphabetic field values with a touchscreen interface; including a QWERTY keyboard, an Alphabetic keyboard, and a Reduced Input Data Entry (RIDE) interface. The RIDE interface allows field values to be entered with fewer {\textquotedblleft}keystrokes{\textquotedblright} (touches) than either keyboard while eliminating certain errors. In one test database, the RIDE interface required 69\% fewer keystrokes than either keyboard interface.}, isbn = {0-89791-348-5}, doi = {10.1145/100348.100349}, url = {http://doi.acm.org/10.1145/100348.100349}, author = {Sears,Andrew and Kochavy,Yoram and Shneiderman, Ben} } @conference {11998, title = {TRACKING IN A COMPLEX VISUAL ENVIRONMENT}, booktitle = {Computer Vision-ECCV 90: First European Conference on Computer Vision. Antibes, France, April 23-27, 1990. Proceedings}, volume = {1}, year = {1990}, month = {1990///}, pages = {249 - 249}, author = {Tsakiris,J. Y.A.D.P} } @article {15202, title = {On a triangle counting problem}, journal = {Information Processing Letters}, volume = {33}, year = {1990}, month = {1990/02/10/}, pages = {319 - 321}, abstract = {We consider the following problem: given a set S of n points in the plane, we would like to compute for each point pϵS, how many triangles with corners at points in set S contain p. We give an O(n2) algorithm to solve the problem.}, keywords = {combinatorics, computational geometry, Range query}, isbn = {0020-0190}, doi = {10.1016/0020-0190(90)90217-L}, url = {http://www.sciencedirect.com/science/article/pii/002001909090217L}, author = {Khuller, Samir and Mitchell,Joseph S.B.} } @conference {16367, title = {Two-directional record layout for multiple inheritance}, booktitle = {Proceedings of the ACM SIGPLAN 1990 conference on Programming language design and implementation}, year = {1990}, month = {1990///}, pages = {85 - 91}, author = {Pugh, William and Weddell,G.} } @article {15983, title = {Truth and meaning (research note)}, journal = {Artificial intelligence}, volume = {39}, year = {1989}, month = {1989///}, pages = {245 - 250}, author = {Perlis, Don} } @article {12789, title = {Type theory and concurrency}, journal = {International Journal of Parallel Programming}, volume = {17}, year = {1988}, month = {1988///}, pages = {153 - 206}, author = {Cleaveland, Rance and Panangaden,P.} } @article {18104, title = {Tight comparison bounds on the complexity of parallel sorting}, journal = {SIAM J. Comput.}, volume = {16}, year = {1987}, month = {1987///}, pages = {458 - 464}, author = {Azar,Y. and Vishkin, Uzi} } @article {15409, title = {TIME PERTURBATION ANALYSIS FOR THE MOS SYSTEM}, journal = {COMPEL: The International Journal for Computation and Mathematics in Electrical and Electronic Engineering}, volume = {6}, year = {1987}, month = {1987/12/31/}, pages = {77 - 83}, abstract = {The development of a numerical implementation of the small signal response of the MOS (Metal-Oxide-Silicon) capacitor using time perturbation analysis is discussed. The effects of nonconstant doping profiles and interface and bulk traps are included. The model uses Fermi-Dirac statistics to describe the occupancy of the interface and bulk traps. The oxide region is considered to have no mobile carriers and any fixed oxide charge distribution is modeled as a charge sheet at the Si-SiO2 interface. This technique can be used to find the small signal response of the device from the static solution.}, isbn = {0332-1649}, doi = {10.1108/eb010305}, url = {http://www.emeraldinsight.com/journals.htm?issn=0332-1649\&volume=6\&issue=2\&articleid=1672728\&articletitle=TIME+PERTURBATION+ANALYSIS+FOR+THE+MOS+SYSTEM\&}, author = {Gaitan,Michael and Mayergoyz, Issak D} } @article {17428, title = {Time Stress Effects on Two Menu Selection Systems}, journal = {Proceedings of the Human Factors and Ergonomics Society Annual MeetingProceedings of the Human Factors and Ergonomics Society Annual Meeting}, volume = {31}, year = {1987}, month = {1987/09/01/}, pages = {727 - 731}, abstract = {The optimal number of menu items per display screen has been the topic of considerable debate and study. On the one hand, some designers have packed many items into each menu to conserve space and reduce the number of menus, whereas on the other hand there are designers who prefer a sparse display for menu structures and other videotex information. This study evaluated the effects of a broad/shallow menu compared to a narrow/deep menu structure under two conditions of time stress for inexperienced users. Results indicated that time stress both slowed performance, and increased errors. In addition, it was demonstrated that the broad/shallow menu was faster and resulted in fewer errors. Implications for menu design are discussed.}, isbn = {1071-1813,}, doi = {10.1177/154193128703100708}, url = {http://pro.sagepub.com/content/31/7/727}, author = {Wallace,Daniel F and Anderson,Nancy S and Shneiderman, Ben} } @article {18446, title = {Two implementation models of abstract data types}, journal = {Computer Languages}, volume = {12}, year = {1987}, month = {1987///}, pages = {21 - 25}, abstract = {This paper compares two implementation models for abstract data types: direct and indirect implementations. Direct implementations offer relatively cheap execution and expensive compilation costs while indirect implementations result in relatively expensive implementations and cheap compilation costs. These two models are both accommodated by Ada, and a small experiment compares their costs for a particular data type.}, keywords = {abstract data type, ada, run-time implementation}, isbn = {0096-0551}, doi = {10.1016/0096-0551(87)90009-9}, url = {http://www.sciencedirect.com/science/article/pii/0096055187900099}, author = {Gannon,John D. and Zelkowitz, Marvin V} } @conference {18116, title = {Tight complexity bounds for parallel comparison sorting}, booktitle = {27th Annual Symposium on Foundations of Computer Science}, year = {1986}, month = {1986///}, pages = {502 - 510}, author = {Alon,N. and Azar,Y. and Vishkin, Uzi} } @book {16535, title = {A theoretical foundation for abductive expert systems}, year = {1985}, month = {1985///}, publisher = {North-Holland, New York}, organization = {North-Holland, New York}, author = {Reggia, James A. and Nau, Dana S. and Peng,Y. and Perricone,B.} } @conference {16755, title = {A timed petri net methodolgoy for specifying real-time system timing requirements}, booktitle = {International Workshop on Timed Petri Nets}, year = {1985}, month = {1985///}, pages = {24 - 31}, author = {Coolahan Jr,J. E and Roussopoulos, Nick} } @article {18364, title = {A taxonomy of prototype designs}, journal = {ACM SIGSOFT Software Engineering Notes}, volume = {9}, year = {1984}, month = {1984///}, pages = {11 - 12}, author = {Zelkowitz, Marvin V} } @article {16788, title = {Timing Requirements for Time-Driven Systems Using Augmented Petri Nets}, journal = {IEEE Transactions on Software Engineering}, volume = {SE-9}, year = {1983}, month = {1983/09//}, pages = {603 - 616}, abstract = {A methodology for the statement of timing requirements is presented for a class of embedded computer systems. The notion of a "time-driven" system is introduced which is formalized using a Petri net model augmented with timing information. Several subclasses of time-driven systems are defined with increasing levels of complexity. By deriving the conditions under which the Petri net model can be proven to be safe in the presence of time, timing requirements for modules in the system can be obtained. Analytical techniques are developed for proving safeness in the presence of time for the net constructions used in the defined subclasses of time-driven systems.}, keywords = {Application software, Concurrent computing, Control systems, Embedded computing, Embedded system, Helium, Modeling methodology, performance specifications, Petri nets, Power system modeling, Real time systems, real-time systems, Timing, timing requirements}, isbn = {0098-5589}, doi = {10.1109/TSE.1983.235261}, author = {Coolahan,J. E. and Roussopoulos, Nick} } @conference {18132, title = {Trade-offs between depth and width in parallel computation}, booktitle = {Foundations of Computer Science, 1983., 24th Annual Symposium on}, year = {1983}, month = {1983/11//}, pages = {146 - 153}, abstract = {A new technique for proving lower bounds for parallel computation is introduced. This technique enables us to obtain, for the first time. non-trivial tight lower bounds for shared-memory models of parallel computation that allow simultaneous read/write access to the same memory location. The size m of the common memory is called communication width or width in short. For a wide variety of problems (including parity and majority) we show that the time complexity T (depth) and the communication width m are related by the trade-off curve mT2 = $\#$x03A9;(n) (where n is the size of the input). This bound is tight lot every m $\#$x02264;n/log2n We extend our technique to prove mT3 = $\#$x03A9;(n) trade-off for a class of "simpler" functions (includind Boolean Or) on a weaker model that forbids simultaneous write access. This result improves the lower bound of Cook and Dwork [CD-82] when communication is limited.}, doi = {10.1109/SFCS.1983.77}, author = {Vishkin, Uzi and Wigderson,A.} } @article {16540, title = {Transferability of medical decision support systems based on Bayesian classification}, journal = {Medical Decision Making}, volume = {3}, year = {1983}, month = {1983///}, pages = {501 - 501}, author = {Zagoria,R. J and Reggia, James A.} } @article {17394, title = {Teaching software psychology experimentation through team projects}, journal = {ACM SIGCSE Bulletin}, volume = {14}, year = {1982}, month = {1982/09//}, pages = {38 - 40}, isbn = {0097-8418}, doi = {10.1145/989322.989331}, url = {http://doi.acm.org/10.1145/989322.989331}, author = {Shneiderman, Ben} } @article {19007, title = {Transcription of cloned tRNA and 5S RNA genes in a Drosophila cell free extract}, journal = {Nucleic Acids ResearchNucl. Acids Res.}, volume = {9}, year = {1981}, month = {1981/08/25/}, pages = {3907 - 3918}, abstract = {We describe the preparation of a cell-free extract from Drosophila Kc cells which allows transcription of a variety of cloned eukaryotic RNA polymerase III genes. The extract has low RNA-processing nuclease activity and thus the major products obtained are primary transcripts.}, isbn = {0305-1048, 1362-4962}, doi = {10.1093/nar/9.16.3907}, url = {http://nar.oxfordjournals.org/content/9/16/3907}, author = {Dingermann,Theodor and Sharp,Stephen and Appel,Bernd and DeFranco,Donald and Mount, Stephen M. and Heiermann,Reinhard and Pongs,Olaf and S{\"o}ll,Dieter} } @article {17446, title = {Two experimental comparisons of relational and hierarchical database models}, journal = {International Journal of Man-Machine Studies}, volume = {10}, year = {1978}, month = {1978/11//}, pages = {625 - 637}, abstract = {The data model is a central feature which characterizes and distinguishes database management systems. This paper presents two experimental comparative studies of two prominent data models; the relational and hierarchical models. Comprehension, problem solving situation and memorization tasks were performed by undergraduate subjects. Significant effects were found for the data model, presentation order, subject background and tasks.}, isbn = {0020-7373}, doi = {10.1016/S0020-7373(78)80024-8}, url = {http://www.sciencedirect.com/science/article/pii/S0020737378800248}, author = {Brosey,Margaret and Shneiderman, Ben} } @article {17393, title = {Teaching programming: A spiral approach to syntax and semantics}, journal = {Computers \& Education}, volume = {1}, year = {1977}, month = {1977///}, pages = {193 - 197}, abstract = {Coupling the recently proposed syntactic/semantic model of programmer behavior [1] with classic educational psychological theories yields new insights to teaching programming to novices. These new insights should make programming education more natural to students. alleviate {\textquotedblleft}computer shock{\textquotedblright} (the analog of {\textquotedblleft}math anxiety{\textquotedblright} [2]) and promote the development of widespread {\textquotedblleft}computer literacy{\textquotedblright}.The spiral approach is the parallel acquisition of syntactic and semantic knowledge in a sequence which provokes student interest by using meaningful examples, builds on previous knowledge, is in harmony with the student{\textquoteright}s cognitive skills, provides reinforcement of recently acquired material and develops confidence through successful accomplishment of increasingly difficult tasks. The relationship of structured programming and flowcharts to the spiral approach is discussed. }, isbn = {0360-1315}, doi = {10.1016/0360-1315(77)90008-2}, url = {http://www.sciencedirect.com/science/article/pii/0360131577900082}, author = {Shneiderman, Ben} } @article {16724, title = {TORUS: A step towards bridging the gap between data bases and the casual user}, journal = {Information Systems}, volume = {2}, year = {1976}, month = {1976///}, pages = {49 - 64}, abstract = {This paper describes TORUS, a natural language understanding system that serves as a front end to a data base management system in order to facilitate communication with casual users. The system employs a semantic network to store knowledge about a data base of student files. This knowledge is used to find the meaning of each input statement, to decide what action to take with respect to the data base, and to select information that must be output in response to the input statement. A prototype version of TORUS has been implemented.}, isbn = {0306-4379}, doi = {16/0306-4379(76)90009-0}, url = {http://www.sciencedirect.com/science/article/pii/0306437976900090}, author = {Mylopoulos,J. and Borgida,A. and Cohen,P. and Roussopoulos, Nick and Tsotsos,J. and Wong,H.} } @article {17433, title = {Toward a theory of encoded data structures and data translation}, journal = {International Journal of Parallel Programming}, volume = {5}, year = {1976}, month = {1976///}, pages = {33 - 43}, abstract = {Several models of data base systems have distinguished levels of abstraction ranging from the high-level entity set model down to the low-level physical device level. This paper presents a model for describing data encodings, an intermediate level which focuses on the relationship among data items as demonstrated by contiguity or by pointer connections. Multiple data encodings for a file are shown and transformation functions that describe the translation between data encodings are discussed.}, isbn = {0885-7458}, url = {http://dx.doi.org/10.1007/BF00991070}, author = {Shneiderman, Ben and Shapiro,Stuart C.} } @article {17436, title = {Travels in computerland or incompatibilities and interfaces::, Addison-Wesley, Reading, Mass., 1974}, journal = {Information Processing \& Management}, volume = {12}, year = {1976}, month = {1976///}, pages = {230 - 230}, author = {Shneiderman, Ben} } @conference {18445, title = {Third generation compiler design}, booktitle = {Proceedings of the 1975 annual conference}, series = {ACM {\textquoteright}75}, year = {1975}, month = {1975///}, pages = {253 - 258}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Compilers, besides testing for errors in a particular implementation of an algorithm, can be implemented to analyze program structure. This information can be fed back to the programmer in order to improve the structure, reliability and efficiency of the resulting program. This paper surveys several techniques that are currently implementable in a compiler, describes several new techniques that can be applied to programs, and briefly describes one such implementation of many of these ideas.}, doi = {10.1145/800181.810332}, url = {http://doi.acm.org/10.1145/800181.810332}, author = {Zelkowitz, Marvin V} } @conference {16721, title = {TORUS-a natural language understanding system for data management}, booktitle = {Proceedings of the Fourth International Conference on Artificial Intelligence}, year = {1975}, month = {1975///}, pages = {414 - 421}, author = {Mylopoulos,J. and Borgida,A. and Cohen,P. and Roussopoulos, Nick and Tsotsos,J. and Wong,H.} } @book {17447, title = {Two Exploratory Experiments in Program Comprehension}, year = {1975}, month = {1975///}, publisher = {Indiana University, Computer Science Department}, organization = {Indiana University, Computer Science Department}, author = {Shneiderman, Ben and Ho,M.H.} }